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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
298c9938033f968fc2a515114fb4da5f35267d97 | 560 | ads | Ada | arch/ARM/Nordic/svd/nrf53/nrf53_svd.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2018-05-16T03:56:39.000Z | 2019-07-31T13:53:56.000Z | arch/ARM/Nordic/svd/nrf53/nrf53_svd.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | arch/ARM/Nordic/svd/nrf53/nrf53_svd.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | -- This spec has been automatically generated from nrf53.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with System;
-- nRF5340
package NRF53_SVD is
pragma Preelaborate;
--------------------
-- Base addresses --
--------------------
TAD_Base : constant System.Address :=
System'To_Address (16#E0080000#);
GPIO_P0_Base : constant System.Address :=
System'To_Address (16#50842500#);
GPIO_P1_Base : constant System.Address :=
System'To_Address (16#50842800#);
end NRF53_SVD;
| 22.4 | 61 | 0.664286 |
59223253e3ce5f6b95c619cec07ca3c70c46cfa0 | 2,532 | ads | Ada | dcf/src/dcf-unzip-decompress.ads | onox/dcf-ada | 47891e7789d3aa53d8f6632284cdf63dbd2ec7dd | [
"MIT"
] | 5 | 2019-05-31T00:00:15.000Z | 2022-02-11T23:11:54.000Z | dcf/src/dcf-unzip-decompress.ads | onox/dcf-ada | 47891e7789d3aa53d8f6632284cdf63dbd2ec7dd | [
"MIT"
] | null | null | null | dcf/src/dcf-unzip-decompress.ads | onox/dcf-ada | 47891e7789d3aa53d8f6632284cdf63dbd2ec7dd | [
"MIT"
] | null | null | null | -- SPDX-License-Identifier: MIT
--
-- Copyright (c) 2007 - 2018 Gautier de Montmollin
-- SWITZERLAND
--
-- Permission is hereby granted, free of charge, to any person obtaining a copy
-- of this software and associated documentation files (the "Software"), to deal
-- in the Software without restriction, including without limitation the rights
-- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-- copies of the Software, and to permit persons to whom the Software is
-- furnished to do so, subject to the following conditions:
--
-- The above copyright notice and this permission notice shall be included in
-- all copies or substantial portions of the Software.
--
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
-- THE SOFTWARE.
-- UnZip.Decompress
-- ---------------
--
-- Private, internal to the UnZip package.
--
-- This package includes the decompression algorithms for methods Store
-- and Deflate.
--
-- The package body contains the packages UnZ_IO, UnZ_Glob, UnZ_Infl,
-- UnZ_Olds and UnZ_Misc that were separate in previous versions of Zip-Ada.
-- They became local packages inside the Decompress_Data procedure.
-- Previously global variables are since then local and task-safe
-- with one copy per concurrent call.
with DCF.Zip.Headers;
with DCF.Streams;
private package DCF.Unzip.Decompress is
pragma Preelaborate;
procedure Decompress_Data
(Zip_File : in out DCF.Streams.Root_Zipstream_Type'Class;
-- Zip_File must be open and its index is meant
-- to point to the beginning of compressed data
Format : Pkzip_Method;
Output_Stream_Access : P_Stream;
Data_Descriptor_After_Data : Boolean;
Hint : in out Zip.Headers.Local_File_Header;
Verify_Integrity : Boolean);
-- Values are known, or smart fakes, and are later corrected if a closing
-- Data_descriptor is appended to the compressed data (1-pass written
-- zip files, like JAR, OpenDocument, etc.)
end DCF.Unzip.Decompress;
| 43.655172 | 81 | 0.709321 |
3d5dec21514d3818ccdf4e5ab8948c63b0309b9d | 10,607 | adb | Ada | strings_edit-utf8.adb | jrcarter/Ada_GUI | 65a829c55dec91fd48a0b72f88d76137768bf4fb | [
"BSD-3-Clause"
] | 19 | 2018-03-18T18:07:14.000Z | 2022-03-30T03:10:12.000Z | strings_edit-utf8.adb | jrcarter/Ada_GUI | 65a829c55dec91fd48a0b72f88d76137768bf4fb | [
"BSD-3-Clause"
] | 4 | 2021-08-23T12:52:06.000Z | 2022-03-31T10:48:43.000Z | strings_edit-utf8.adb | jrcarter/Ada_GUI | 65a829c55dec91fd48a0b72f88d76137768bf4fb | [
"BSD-3-Clause"
] | null | null | null | -- --
-- package Strings_Edit.UTF8 Copyright (c) Dmitry A. Kazakov --
-- Implementation Luebeck --
-- Spring, 2005 --
-- --
-- Last revision : 22:44 07 Apr 2016 --
-- --
-- This library is free software; you can redistribute it and/or --
-- modify it under the terms of the GNU General Public License as --
-- published by the Free Software Foundation; either version 2 of --
-- the License, or (at your option) any later version. This library --
-- is distributed in the hope that it will be useful, but WITHOUT --
-- ANY WARRANTY; without even the implied warranty of --
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU --
-- General Public License for more details. You should have --
-- received a copy of the GNU General Public License along with --
-- this library; if not, write to the Free Software Foundation, --
-- Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from --
-- this unit, or you link this unit with other files to produce an --
-- executable, this unit does not by itself cause the resulting --
-- executable to be covered by the GNU General Public License. This --
-- exception does not however invalidate any other reasons why the --
-- executable file might be covered by the GNU Public License. --
--____________________________________________________________________--
with Ada.IO_Exceptions; use Ada.IO_Exceptions;
package body Strings_Edit.UTF8 is
procedure Get
( Source : String;
Pointer : in out Integer;
Value : out UTF8_Code_Point
) is
Accum : UTF8_Code_Point'Base;
Code : UTF8_Code_Point'Base;
Index : Integer := Pointer;
Last : Boolean := False;
begin
if Index < Source'First then
raise Layout_Error;
end if;
if Index > Source'Last then
if Index = Source'Last + 1 then
raise End_Error;
else
raise Layout_Error;
end if;
end if;
Code := UTF8_Code_Point (Character'Pos (Source (Index)));
case Code is
when 0..16#7F# => -- 1 byte (ASCII)
Value := Code;
Pointer := Index + 1;
return;
when 16#C2#..16#DF# => -- 2 bytes
Accum := (Code and 16#1F#) * 2**6;
Last := True;
when 16#E0# => -- 3 bytes
Index := Index + 1;
if Index >= Source'Last then
raise Data_Error;
end if;
Code := UTF8_Code_Point (Character'Pos (Source (Index)));
if Code not in 16#A0#..16#BF# then
raise Data_Error;
end if;
Accum := (Code and 16#3F#) * 2**6;
Last := True;
when 16#E1#..16#EF# => -- 3 bytes
Accum := (Code and 16#0F#) * 2**12;
when 16#F0# => -- 4 bytes
Index := Index + 1;
if Index >= Source'Last then
raise Data_Error;
end if;
Code := UTF8_Code_Point (Character'Pos (Source (Index)));
if Code not in 16#90#..16#BF# then
raise Data_Error;
end if;
Accum := (Code and 16#3F#) * 2**12;
when 16#F1#..16#F3# => -- 4 bytes
Accum := (Code and 16#07#) * 2**18;
Index := Index + 1;
if Index >= Source'Last then
raise Data_Error;
end if;
Code := UTF8_Code_Point (Character'Pos (Source (Index)));
if Code not in 16#80#..16#BF# then
raise Data_Error;
end if;
Accum := Accum or (Code and 16#3F#) * 2**12;
when 16#F4# => -- 4 bytes
Accum := (Code and 16#07#) * 2**18;
Index := Index + 1;
if Index >= Source'Last then
raise Data_Error;
end if;
Code := UTF8_Code_Point (Character'Pos (Source (Index)));
if Code not in 16#80#..16#8F# then
raise Data_Error;
end if;
Accum := Accum or (Code and 16#3F#) * 2**12;
when others =>
raise Data_Error;
end case;
if not Last then
Index := Index + 1;
if Index >= Source'Last then
raise Data_Error;
end if;
Code := UTF8_Code_Point (Character'Pos (Source (Index)));
if Code not in 16#80#..16#BF# then
raise Data_Error;
end if;
Accum := Accum or (Code and 16#3F#) * 2**6;
end if;
Index := Index + 1;
if Index > Source'Last then
raise Data_Error;
end if;
Code := UTF8_Code_Point (Character'Pos (Source (Index)));
if Code not in 16#80#..16#BF# then
raise Data_Error;
end if;
Value := Accum or (Code and 16#3F#);
Pointer := Index + 1;
end Get;
procedure Get_Backwards
( Source : String;
Pointer : in out Integer;
Value : out UTF8_Code_Point
) is
First : Integer := Pointer;
Last : Integer;
Result : UTF8_Code_Point;
begin
if First <= Source'First then
if First < Source'First then
raise Layout_Error;
else
raise End_Error;
end if;
end if;
if First > Source'Last + 1 then
raise Layout_Error;
end if;
loop
First := First - 1;
exit when Character'Pos (Source (First)) not in 16#80#..16#BF#;
if First = Source'First then
raise Data_Error;
end if;
end loop;
Last := First;
Get (Source, Last, Result);
if Last /= Pointer then
raise Data_Error;
end if;
Pointer := First;
Value := Result;
end Get_Backwards;
function Image (Value : UTF8_Code_Point) return String is
Result : String (1..4);
Pointer : Integer := Result'First;
begin
Put (Result, Pointer, Value);
return Result (1..Pointer - 1);
end Image;
function Length (Source : String) return Natural is
Count : Natural := 0;
Accum : UTF8_Code_Point;
Index : Integer := Source'First;
begin
while Index <= Source'Last loop
Get (Source, Index, Accum);
Count := Count + 1;
end loop;
return Count;
end Length;
procedure Put
( Destination : in out String;
Pointer : in out Integer;
Value : UTF8_Code_Point
) is
begin
if Pointer not in Destination'Range then
raise Layout_Error;
end if;
if Value <= 16#7F# then
Destination (Pointer) := Character'Val (Value);
Pointer := Pointer + 1;
elsif Value <= 16#7FF# then
if Pointer >= Destination'Last then
raise Layout_Error;
end if;
Destination (Pointer) :=
Character'Val (16#C0# or Value / 2**6);
Destination (Pointer + 1) :=
Character'Val (16#80# or (Value and 16#3F#));
Pointer := Pointer + 2;
elsif Value <= 16#FFFF# then
if 1 >= Destination'Last - Pointer then
raise Layout_Error;
end if;
Destination (Pointer) :=
Character'Val (16#E0# or Value / 2**12);
Destination (Pointer + 1) :=
Character'Val (16#80# or (Value / 2**6 and 16#3F#));
Destination (Pointer + 2) :=
Character'Val (16#80# or (Value and 16#3F#));
Pointer := Pointer + 3;
else
if 2 >= Destination'Last - Pointer then
raise Layout_Error;
end if;
Destination (Pointer) :=
Character'Val (16#F0# or Value / 2**18);
Destination (Pointer + 1) :=
Character'Val (16#80# or (Value / 2**12 and 16#3F#));
Destination (Pointer + 2) :=
Character'Val (16#80# or (Value / 2**6 and 16#3F#));
Destination (Pointer + 3) :=
Character'Val (16#80# or (Value and 16#3F#));
Pointer := Pointer + 4;
end if;
end Put;
procedure Reverse_Put
( Destination : in out String;
Pointer : in out Integer;
Prefix : String;
Position : Natural
) is
begin
if ( Pointer not in Destination'Range
or else
Pointer - Destination'First < Prefix'Length
)
then
raise Layout_Error;
end if;
Destination (Pointer) := Character'Val (Position);
Pointer := Pointer - 1;
for Index in reverse Prefix'Range loop
Destination (Pointer) := Prefix (Index);
Pointer := Pointer - 1;
end loop;
end Reverse_Put;
procedure Skip
( Source : String;
Pointer : in out Integer;
Count : Natural := 1
) is
begin
if Count > 0 then
declare
Accum : UTF8_Code_Point;
Index : Integer := Pointer;
begin
for Character in 1..Count loop
Get (Source, Index, Accum);
end loop;
Pointer := Index;
end;
elsif ( Pointer < Source'First
or else
( Pointer > Source'Last
and then
Pointer - 1 > Source'Last
) )
then
raise Layout_Error;
end if;
end Skip;
function Value (Source : String) return UTF8_Code_Point is
Pointer : Integer := Source'First;
Result : UTF8_Code_Point;
begin
Get (Source, Pointer, Result);
if Pointer /= Source'Last + 1 then
raise Data_Error;
end if;
return Result;
end Value;
end Strings_Edit.UTF8;
| 35.59396 | 73 | 0.491845 |
3d4181aaaaacae4b373f82396719fd0f507226d4 | 201 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/notnot.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/notnot.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/notnot.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- { dg-do compile }
-- { dg-options "-gnatwr" }
procedure notnot (x, y : integer) is
begin
if not (not (x = y)) then -- { dg-warning "redundant double negation" }
return;
end if;
end;
| 20.1 | 75 | 0.58209 |
22dca68f1811e2d1a0ea76367e65149bd53ad3ed | 1,333 | ads | Ada | sources/ada_pretty-units.ads | reznikmm/adaside | fabd6da79751e84af09094073ce22149c4711348 | [
"MIT"
] | 4 | 2020-05-21T15:44:30.000Z | 2022-03-14T22:08:07.000Z | sources/ada_pretty-units.ads | reznikmm/ada-pretty | fabd6da79751e84af09094073ce22149c4711348 | [
"MIT"
] | null | null | null | sources/ada_pretty-units.ads | reznikmm/ada-pretty | fabd6da79751e84af09094073ce22149c4711348 | [
"MIT"
] | null | null | null | -- Copyright (c) 2017 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
private package Ada_Pretty.Units is
type Compilation_Unit is new Node with private;
function New_Compilation_Unit
(Root : not null Node_Access;
Clauses : Node_Access := null;
License : League.Strings.Universal_String) return Node'Class;
function New_Subunit
(Parent_Name : not null Node_Access;
Proper_Body : not null Node_Access) return Node'Class;
private
type Compilation_Unit is new Node with record
Root : not null Node_Access;
Clauses : Node_Access;
License : League.Strings.Universal_String;
end record;
overriding function Document
(Self : Compilation_Unit;
Printer : not null access League.Pretty_Printers.Printer'Class;
Pad : Natural)
return League.Pretty_Printers.Document;
type Subunit is new Node with record
Parent_Name : not null Node_Access;
Proper_Body : not null Node_Access;
end record;
overriding function Document
(Self : Subunit;
Printer : not null access League.Pretty_Printers.Printer'Class;
Pad : Natural)
return League.Pretty_Printers.Document;
end Ada_Pretty.Units;
| 28.978261 | 68 | 0.673668 |
2fe88c9e7b91b22a389ba62b34dfcd1d63f8dd68 | 3,741 | ads | Ada | source/amf/uml/amf-umldi-holders-uml_inherited_state_border_kinds.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-umldi-holders-uml_inherited_state_border_kinds.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-umldi-holders-uml_inherited_state_border_kinds.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 League.Holders.Generic_Enumerations;
package AMF.UMLDI.Holders.UML_Inherited_State_Border_Kinds is
new League.Holders.Generic_Enumerations
(AMF.UMLDI.UMLDI_UML_Inherited_State_Border_Kind);
pragma Preelaborate (AMF.UMLDI.Holders.UML_Inherited_State_Border_Kinds);
| 71.942308 | 78 | 0.418872 |
0b176f54d22c730158c5dcf7cd66180a72f28a34 | 57 | ads | Ada | openal_info.ads | io7m/coreland-openal-ada | dd320bf0cc42759d4b041ba660a4b3e0c7507da5 | [
"0BSD"
] | 1 | 2017-10-07T05:53:55.000Z | 2017-10-07T05:53:55.000Z | openal_info.ads | io7m/coreland-openal-ada | dd320bf0cc42759d4b041ba660a4b3e0c7507da5 | [
"0BSD"
] | null | null | null | openal_info.ads | io7m/coreland-openal-ada | dd320bf0cc42759d4b041ba660a4b3e0c7507da5 | [
"0BSD"
] | null | null | null | package OpenAL_Info is
procedure Run;
end OpenAL_Info;
| 14.25 | 22 | 0.807018 |
4110f8bba015ee02d35044e850971e0ceadb0def | 2,051 | ads | Ada | source/s-stoele.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/s-stoele.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/s-stoele.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | pragma License (Unrestricted);
package System.Storage_Elements is
pragma Pure;
type Storage_Offset is range
-(2 ** (Standard'Address_Size - 1)) ..
2 ** (Standard'Address_Size - 1) - 1; -- implementation-defined
subtype Storage_Count is Storage_Offset range 0 .. Storage_Offset'Last;
type Storage_Element is mod 2 ** Storage_Unit; -- implementation-defined
for Storage_Element'Size use Storage_Unit;
type Storage_Array is
array (Storage_Offset range <>) of aliased Storage_Element;
for Storage_Array'Component_Size use Storage_Unit;
-- Address Arithmetic:
function "+" (Left : Address; Right : Storage_Offset) return Address
with Convention => Intrinsic;
function "+" (Left : Storage_Offset; Right : Address) return Address
with Convention => Intrinsic;
function "-" (Left : Address; Right : Storage_Offset) return Address
with Convention => Intrinsic;
function "-" (Left, Right : Address) return Storage_Offset
with Convention => Intrinsic;
pragma Pure_Function ("+");
pragma Pure_Function ("-");
pragma Inline_Always ("+");
pragma Inline_Always ("-");
function "mod" (Left : Address; Right : Storage_Offset)
return Storage_Offset
with Convention => Intrinsic;
pragma Pure_Function ("mod");
pragma Inline_Always ("mod");
-- Conversion to/from integers:
type Integer_Address is mod Memory_Size; -- implementation-defined
function To_Address (Value : Integer_Address) return Address
with Convention => Intrinsic;
function To_Integer (Value : Address) return Integer_Address
with Convention => Intrinsic;
pragma Pure_Function (To_Address);
pragma Pure_Function (To_Integer);
pragma Inline_Always (To_Address);
pragma Inline_Always (To_Integer);
-- extended
-- Shift_Left, Shift_Right, Shift_Right_Arithmetic, Rotate_Left,
-- and Rotate_Right.
pragma Provide_Shift_Operators (Storage_Element);
pragma Provide_Shift_Operators (Integer_Address);
end System.Storage_Elements;
| 34.183333 | 75 | 0.715748 |
57227beb255046a1ed6b712c7bfeb692e1cb8807 | 7,503 | ads | Ada | arch/ARM/STM32/svd/stm32f46_79x/stm32_svd.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 192 | 2016-06-01T18:32:04.000Z | 2022-03-26T22:52:31.000Z | arch/ARM/STM32/svd/stm32f46_79x/stm32_svd.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 239 | 2016-05-26T20:02:01.000Z | 2022-03-31T09:46:56.000Z | arch/ARM/STM32/svd/stm32f46_79x/stm32_svd.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | -- This spec has been automatically generated from STM32F46_79x.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with System;
-- STM32F46_79x
package STM32_SVD is
pragma Preelaborate;
--------------------
-- Base addresses --
--------------------
RNG_Base : constant System.Address :=
System'To_Address (16#50060800#);
HASH_Base : constant System.Address :=
System'To_Address (16#50060400#);
CRYP_Base : constant System.Address :=
System'To_Address (16#50060000#);
DCMI_Base : constant System.Address :=
System'To_Address (16#50050000#);
FMC_Base : constant System.Address :=
System'To_Address (16#A0000000#);
DBG_Base : constant System.Address :=
System'To_Address (16#E0042000#);
DMA2_Base : constant System.Address :=
System'To_Address (16#40026400#);
DMA1_Base : constant System.Address :=
System'To_Address (16#40026000#);
RCC_Base : constant System.Address :=
System'To_Address (16#40023800#);
GPIOK_Base : constant System.Address :=
System'To_Address (16#40022800#);
GPIOJ_Base : constant System.Address :=
System'To_Address (16#40022400#);
GPIOI_Base : constant System.Address :=
System'To_Address (16#40022000#);
GPIOH_Base : constant System.Address :=
System'To_Address (16#40021C00#);
GPIOG_Base : constant System.Address :=
System'To_Address (16#40021800#);
GPIOF_Base : constant System.Address :=
System'To_Address (16#40021400#);
GPIOE_Base : constant System.Address :=
System'To_Address (16#40021000#);
GPIOD_Base : constant System.Address :=
System'To_Address (16#40020C00#);
GPIOC_Base : constant System.Address :=
System'To_Address (16#40020800#);
GPIOB_Base : constant System.Address :=
System'To_Address (16#40020400#);
GPIOA_Base : constant System.Address :=
System'To_Address (16#40020000#);
SYSCFG_Base : constant System.Address :=
System'To_Address (16#40013800#);
SPI1_Base : constant System.Address :=
System'To_Address (16#40013000#);
SPI2_Base : constant System.Address :=
System'To_Address (16#40003800#);
SPI3_Base : constant System.Address :=
System'To_Address (16#40003C00#);
I2S2ext_Base : constant System.Address :=
System'To_Address (16#40003400#);
I2S3ext_Base : constant System.Address :=
System'To_Address (16#40004000#);
SPI4_Base : constant System.Address :=
System'To_Address (16#40013400#);
SPI5_Base : constant System.Address :=
System'To_Address (16#40015000#);
SPI6_Base : constant System.Address :=
System'To_Address (16#40015400#);
SDIO_Base : constant System.Address :=
System'To_Address (16#40012C00#);
ADC1_Base : constant System.Address :=
System'To_Address (16#40012000#);
ADC2_Base : constant System.Address :=
System'To_Address (16#40012100#);
ADC3_Base : constant System.Address :=
System'To_Address (16#40012200#);
USART6_Base : constant System.Address :=
System'To_Address (16#40011400#);
USART1_Base : constant System.Address :=
System'To_Address (16#40011000#);
USART2_Base : constant System.Address :=
System'To_Address (16#40004400#);
USART3_Base : constant System.Address :=
System'To_Address (16#40004800#);
DAC_Base : constant System.Address :=
System'To_Address (16#40007400#);
PWR_Base : constant System.Address :=
System'To_Address (16#40007000#);
IWDG_Base : constant System.Address :=
System'To_Address (16#40003000#);
WWDG_Base : constant System.Address :=
System'To_Address (16#40002C00#);
RTC_Base : constant System.Address :=
System'To_Address (16#40002800#);
UART4_Base : constant System.Address :=
System'To_Address (16#40004C00#);
UART5_Base : constant System.Address :=
System'To_Address (16#40005000#);
UART7_Base : constant System.Address :=
System'To_Address (16#40007800#);
UART8_Base : constant System.Address :=
System'To_Address (16#40007C00#);
C_ADC_Base : constant System.Address :=
System'To_Address (16#40012300#);
TIM1_Base : constant System.Address :=
System'To_Address (16#40010000#);
TIM8_Base : constant System.Address :=
System'To_Address (16#40010400#);
TIM2_Base : constant System.Address :=
System'To_Address (16#40000000#);
TIM3_Base : constant System.Address :=
System'To_Address (16#40000400#);
TIM4_Base : constant System.Address :=
System'To_Address (16#40000800#);
TIM5_Base : constant System.Address :=
System'To_Address (16#40000C00#);
TIM9_Base : constant System.Address :=
System'To_Address (16#40014000#);
TIM12_Base : constant System.Address :=
System'To_Address (16#40001800#);
TIM10_Base : constant System.Address :=
System'To_Address (16#40014400#);
TIM13_Base : constant System.Address :=
System'To_Address (16#40001C00#);
TIM14_Base : constant System.Address :=
System'To_Address (16#40002000#);
TIM11_Base : constant System.Address :=
System'To_Address (16#40014800#);
TIM6_Base : constant System.Address :=
System'To_Address (16#40001000#);
TIM7_Base : constant System.Address :=
System'To_Address (16#40001400#);
Ethernet_MAC_Base : constant System.Address :=
System'To_Address (16#40028000#);
Ethernet_MMC_Base : constant System.Address :=
System'To_Address (16#40028100#);
Ethernet_PTP_Base : constant System.Address :=
System'To_Address (16#40028700#);
Ethernet_DMA_Base : constant System.Address :=
System'To_Address (16#40029000#);
CRC_Base : constant System.Address :=
System'To_Address (16#40023000#);
OTG_FS_GLOBAL_Base : constant System.Address :=
System'To_Address (16#50000000#);
OTG_FS_HOST_Base : constant System.Address :=
System'To_Address (16#50000400#);
OTG_FS_DEVICE_Base : constant System.Address :=
System'To_Address (16#50000800#);
OTG_FS_PWRCLK_Base : constant System.Address :=
System'To_Address (16#50000E00#);
CAN1_Base : constant System.Address :=
System'To_Address (16#40006400#);
CAN2_Base : constant System.Address :=
System'To_Address (16#40006800#);
NVIC_Base : constant System.Address :=
System'To_Address (16#E000E000#);
FLASH_Base : constant System.Address :=
System'To_Address (16#40023C00#);
EXTI_Base : constant System.Address :=
System'To_Address (16#40013C00#);
OTG_HS_GLOBAL_Base : constant System.Address :=
System'To_Address (16#40040000#);
OTG_HS_HOST_Base : constant System.Address :=
System'To_Address (16#40040400#);
OTG_HS_DEVICE_Base : constant System.Address :=
System'To_Address (16#40040800#);
OTG_HS_PWRCLK_Base : constant System.Address :=
System'To_Address (16#40040E00#);
LTDC_Base : constant System.Address :=
System'To_Address (16#40016800#);
SAI_Base : constant System.Address :=
System'To_Address (16#40015800#);
DMA2D_Base : constant System.Address :=
System'To_Address (16#4002B000#);
I2C3_Base : constant System.Address :=
System'To_Address (16#40005C00#);
I2C2_Base : constant System.Address :=
System'To_Address (16#40005800#);
I2C1_Base : constant System.Address :=
System'To_Address (16#40005400#);
DSI_Base : constant System.Address :=
System'To_Address (16#40016C00#);
QUADSPI_Base : constant System.Address :=
System'To_Address (16#A0001000#);
end STM32_SVD;
| 38.875648 | 68 | 0.695055 |
29eb2099e0472f344af89c757e1902a8b2d3069f | 1,326 | ads | Ada | tier-1/xcb/source/thin/xcb-xcb_render_trap_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_render_trap_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_render_trap_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | null | null | null | -- This file is generated by SWIG. Please do not modify by hand.
--
with xcb.xcb_render_spanfix_t;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_render_trap_t is
-- Item
--
type Item is record
top : aliased xcb.xcb_render_spanfix_t.Item;
bot : aliased xcb.xcb_render_spanfix_t.Item;
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C.size_t range <>) of aliased xcb.xcb_render_trap_t.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_render_trap_t.Item,
Element_Array => xcb.xcb_render_trap_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_render_trap_t.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_render_trap_t.Pointer,
Element_Array => xcb.xcb_render_trap_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_render_trap_t;
| 26.52 | 79 | 0.668929 |
59718cb939475538a0b6b3070e25bf4039843ce6 | 2,107 | adb | Ada | gnu/src/gdb/gdb/testsuite/gdb.ada/tasks/foo.adb | ghsecuritylab/ellcc-mirror | b03a4afac74d50cf0987554b8c0cd8209bcb92a2 | [
"BSD-2-Clause"
] | null | null | null | gnu/src/gdb/gdb/testsuite/gdb.ada/tasks/foo.adb | ghsecuritylab/ellcc-mirror | b03a4afac74d50cf0987554b8c0cd8209bcb92a2 | [
"BSD-2-Clause"
] | null | null | null | gnu/src/gdb/gdb/testsuite/gdb.ada/tasks/foo.adb | ghsecuritylab/ellcc-mirror | b03a4afac74d50cf0987554b8c0cd8209bcb92a2 | [
"BSD-2-Clause"
] | null | null | null | -- Copyright 2009-2015 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
procedure Foo is
task type Caller is
entry Initialize;
entry Call_Break_Me;
entry Finalize;
end Caller;
type Caller_Ptr is access Caller;
procedure Break_Me is
begin
null;
end Break_Me;
task body Caller is
begin
accept Initialize do
null;
end Initialize;
accept Call_Break_Me do
Break_Me;
end Call_Break_Me;
accept Finalize do
null;
end Finalize;
end Caller;
Task_List : array (1 .. 3) of Caller_Ptr;
begin
-- Start all our tasks, and call the "Initialize" entry to make
-- sure all of them have now been started. We call that entry
-- immediately after having created the task in order to make sure
-- that we wait for that task to be created before we try to create
-- another one. That way, we know that the order in our Task_List
-- corresponds to the order in the GNAT runtime.
for J in Task_List'Range loop
Task_List (J) := new Caller;
Task_List (J).Initialize;
end loop;
-- Next, call their Call_Break_Me entry of each task, using the same
-- order as the order used to create them.
for J in Task_List'Range loop -- STOP_HERE
Task_List (J).Call_Break_Me;
end loop;
-- And finally, let all the tasks die...
for J in Task_List'Range loop
Task_List (J).Finalize;
end loop;
end Foo;
| 30.536232 | 73 | 0.681538 |
2396e61a15d84603c9affd89be42282e9767a8ed | 2,445 | adb | Ada | src/sdl.adb | Fabien-Chouteau/sdlada | f08d72e3f5dcec228d68fb5b6681ea831f81ef47 | [
"Zlib"
] | 1 | 2021-10-30T14:41:56.000Z | 2021-10-30T14:41:56.000Z | src/sdl.adb | Fabien-Chouteau/sdlada | f08d72e3f5dcec228d68fb5b6681ea831f81ef47 | [
"Zlib"
] | null | null | null | src/sdl.adb | Fabien-Chouteau/sdlada | f08d72e3f5dcec228d68fb5b6681ea831f81ef47 | [
"Zlib"
] | null | null | null | --------------------------------------------------------------------------------------------------------------------
-- Copyright (c) 2013-2020, Luke A. Guest
--
-- 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.
--------------------------------------------------------------------------------------------------------------------
package body SDL is
use type C.int;
function Initialise (Flags : in Init_Flags := Enable_Everything) return Boolean is
function SDL_Init (Flags : in Init_Flags := Enable_Everything) return C.int with
Import => True,
Convention => C,
External_Name => "SDL_Init";
Result : C.int := SDL_Init (Flags);
begin
return (Result = Success);
end Initialise;
function Initialise_Sub_System (Flags : in Init_Flags) return Boolean is
function SDL_Init_Sub_System (Flags : in Init_Flags) return C.int with
Import => True,
Convention => C,
External_Name => "SDL_InitSubSystem";
Result : C.int := SDL_Init_Sub_System (Flags);
begin
return (Result = Success);
end Initialise_Sub_System;
function SDL_Was_Initialised (Flags : in Init_Flags := Null_Init_Flags) return Init_Flags with
Import => True,
Convention => C,
External_Name => "SDL_WasInit";
function Was_Initialised return Init_Flags is
begin
return SDL_Was_Initialised;
end Was_Initialised;
function Was_Initialised (Flags : in Init_Flags) return Boolean is
begin
return (SDL_Was_Initialised (Flags) = Flags);
end Was_Initialised;
end SDL;
| 38.809524 | 116 | 0.623313 |
58f11291141c0e43254dad90f7cc7fa2eeecacdc | 2,254 | adb | Ada | tests/example/main.adb | Fabien-Chouteau/ASFML | 52a013554bcfb6150e0d6391871356c1443a6b93 | [
"Zlib"
] | null | null | null | tests/example/main.adb | Fabien-Chouteau/ASFML | 52a013554bcfb6150e0d6391871356c1443a6b93 | [
"Zlib"
] | null | null | null | tests/example/main.adb | Fabien-Chouteau/ASFML | 52a013554bcfb6150e0d6391871356c1443a6b93 | [
"Zlib"
] | null | null | null | -- This is the official SFML example converted to ASFML
with Ada.Command_Line;
with Sf.Window.Videomode; use Sf, Sf.Window, Sf.Window.Videomode;
with Sf.Window.Event; use Sf.Window.Event;
with Sf.Window.Window; use Sf.Window.Window;
with Sf.Graphics.Color; use Sf.Graphics, Sf.Graphics.Color;
with Sf.Graphics.RenderWindow; use Sf.Graphics.RenderWindow;
with Sf.Graphics.Sprite; use Sf.Graphics.Sprite;
with Sf.Graphics.Texture; use Sf.Graphics.Texture;
with Sf.Graphics.Font; use Sf.Graphics.Font;
with Sf.Graphics.Text; use Sf.Graphics.Text;
with Sf.Audio.Music; use Sf.Audio, Sf.Audio.Music;
procedure Main is
Abort_Example : exception;
Mode : VideoMode.sfVideoMode := (Width => 800, Height => 600, BitsPerPixel => 32);
Window : sfRenderWindow_Ptr;
Texture : sfTexture_Ptr;
Sprite : sfSprite_Ptr;
Font : sfFont_Ptr;
Text : sfText_Ptr;
Music : sfMusic_Ptr;
event : sfEvent;
begin
-- Create the main Window
Window := create(Mode, "SFML window", sfResize or sfClose, sfDefaultContextSettings);
-- Load a sprite to display
Texture := createFromFile("cute_image.jpg", null);
Sprite := create;
setTexture(Sprite, Texture, sfTrue);
-- Create a graphical text to display
Font := createFromFile("arial.ttf");
Text := create;
setString(Text, "Hello SFML");
setFont(Text, Font);
setCharacterSize(Text, 50);
-- Load a music file to play
Music := createFromFile("nice_music.ogg");
-- Play the music
play(Music);
-- Start the game loop
while isOpen(Window) loop
-- Process events
while pollEvent(Window, event) loop
-- Close window : exit
if (event.eventType = sfEvtClosed) then
close(Window);
end if;
end loop;
-- Clear the screen
clear(Window, sfBlack);
-- Draw the sprite
drawSprite(Window, Sprite, null);
-- Draw the text
drawText(Window, Text, null);
-- Update the window
display(Window);
end loop;
-- Cleanup resources
destroy(Music);
destroy(Text);
destroy(Font);
destroy(Sprite);
destroy(Texture);
destroy(Window);
exception
when others =>
Ada.Command_Line.Set_Exit_Status (Ada.Command_Line.Failure);
end Main;
| 23.479167 | 88 | 0.674357 |
22273c6e0e43762abd3292a9414ecfdf4ec06380 | 1,081 | ads | Ada | extern/gnat_sdl/gnat_sdl/src/sdl_sdl_thread_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_sdl/src/sdl_sdl_thread_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_sdl/src/sdl_sdl_thread_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 System;
with SDL_SDL_stdinc_h;
package SDL_SDL_thread_h is
-- skipped empty struct SDL_Thread
function SDL_CreateThread (fn : access function (arg1 : System.Address) return int; data : System.Address) return System.Address; -- ../include/SDL/SDL_thread.h:88
pragma Import (C, SDL_CreateThread, "SDL_CreateThread");
function SDL_ThreadID return SDL_SDL_stdinc_h.Uint32; -- ../include/SDL/SDL_thread.h:92
pragma Import (C, SDL_ThreadID, "SDL_ThreadID");
function SDL_GetThreadID (thread : System.Address) return SDL_SDL_stdinc_h.Uint32; -- ../include/SDL/SDL_thread.h:97
pragma Import (C, SDL_GetThreadID, "SDL_GetThreadID");
procedure SDL_WaitThread (thread : System.Address; status : access int); -- ../include/SDL/SDL_thread.h:103
pragma Import (C, SDL_WaitThread, "SDL_WaitThread");
procedure SDL_KillThread (thread : System.Address); -- ../include/SDL/SDL_thread.h:106
pragma Import (C, SDL_KillThread, "SDL_KillThread");
end SDL_SDL_thread_h;
| 38.607143 | 167 | 0.748381 |
58c1e938ebfc6088778903ff46daa7921108e6d4 | 63,786 | adb | Ada | gcc-gcc-7_3_0-release/gcc/ada/a-cidlli.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/ada/a-cidlli.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/a-cidlli.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- ADA.CONTAINERS.INDEFINITE_DOUBLY_LINKED_LISTS --
-- --
-- B o d y --
-- --
-- Copyright (C) 2004-2015, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
with Ada.Unchecked_Deallocation;
with System; use type System.Address;
package body Ada.Containers.Indefinite_Doubly_Linked_Lists is
pragma Warnings (Off, "variable ""Busy*"" is not referenced");
pragma Warnings (Off, "variable ""Lock*"" is not referenced");
-- See comment in Ada.Containers.Helpers
procedure Free is
new Ada.Unchecked_Deallocation (Element_Type, Element_Access);
-----------------------
-- Local Subprograms --
-----------------------
procedure Free (X : in out Node_Access);
procedure Insert_Internal
(Container : in out List;
Before : Node_Access;
New_Node : Node_Access);
procedure Splice_Internal
(Target : in out List;
Before : Node_Access;
Source : in out List);
procedure Splice_Internal
(Target : in out List;
Before : Node_Access;
Source : in out List;
Position : Node_Access);
function Vet (Position : Cursor) return Boolean;
-- Checks invariants of the cursor and its designated container, as a
-- simple way of detecting dangling references (see operation Free for a
-- description of the detection mechanism), returning True if all checks
-- pass. Invocations of Vet are used here as the argument of pragma Assert,
-- so the checks are performed only when assertions are enabled.
---------
-- "=" --
---------
function "=" (Left, Right : List) return Boolean is
begin
if Left.Length /= Right.Length then
return False;
end if;
if Left.Length = 0 then
return True;
end if;
declare
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
Lock_Left : With_Lock (Left.TC'Unrestricted_Access);
Lock_Right : With_Lock (Right.TC'Unrestricted_Access);
L : Node_Access := Left.First;
R : Node_Access := Right.First;
begin
for J in 1 .. Left.Length loop
if L.Element.all /= R.Element.all then
return False;
end if;
L := L.Next;
R := R.Next;
end loop;
end;
return True;
end "=";
------------
-- Adjust --
------------
procedure Adjust (Container : in out List) is
Src : Node_Access := Container.First;
Dst : Node_Access;
begin
-- If the counts are nonzero, execution is technically erroneous, but
-- it seems friendly to allow things like concurrent "=" on shared
-- constants.
Zero_Counts (Container.TC);
if Src = null then
pragma Assert (Container.Last = null);
pragma Assert (Container.Length = 0);
return;
end if;
pragma Assert (Container.First.Prev = null);
pragma Assert (Container.Last.Next = null);
pragma Assert (Container.Length > 0);
Container.First := null;
Container.Last := null;
Container.Length := 0;
declare
Element : Element_Access := new Element_Type'(Src.Element.all);
begin
Dst := new Node_Type'(Element, null, null);
exception
when others =>
Free (Element);
raise;
end;
Container.First := Dst;
Container.Last := Dst;
Container.Length := 1;
Src := Src.Next;
while Src /= null loop
declare
Element : Element_Access := new Element_Type'(Src.Element.all);
begin
Dst := new Node_Type'(Element, null, Prev => Container.Last);
exception
when others =>
Free (Element);
raise;
end;
Container.Last.Next := Dst;
Container.Last := Dst;
Container.Length := Container.Length + 1;
Src := Src.Next;
end loop;
end Adjust;
------------
-- Append --
------------
procedure Append
(Container : in out List;
New_Item : Element_Type;
Count : Count_Type := 1)
is
begin
Insert (Container, No_Element, New_Item, Count);
end Append;
------------
-- Assign --
------------
procedure Assign (Target : in out List; Source : List) is
Node : Node_Access;
begin
if Target'Address = Source'Address then
return;
else
Target.Clear;
Node := Source.First;
while Node /= null loop
Target.Append (Node.Element.all);
Node := Node.Next;
end loop;
end if;
end Assign;
-----------
-- Clear --
-----------
procedure Clear (Container : in out List) is
X : Node_Access;
pragma Warnings (Off, X);
begin
if Container.Length = 0 then
pragma Assert (Container.First = null);
pragma Assert (Container.Last = null);
pragma Assert (Container.TC = (Busy => 0, Lock => 0));
return;
end if;
pragma Assert (Container.First.Prev = null);
pragma Assert (Container.Last.Next = null);
TC_Check (Container.TC);
while Container.Length > 1 loop
X := Container.First;
pragma Assert (X.Next.Prev = Container.First);
Container.First := X.Next;
Container.First.Prev := null;
Container.Length := Container.Length - 1;
Free (X);
end loop;
X := Container.First;
pragma Assert (X = Container.Last);
Container.First := null;
Container.Last := null;
Container.Length := 0;
Free (X);
end Clear;
------------------------
-- Constant_Reference --
------------------------
function Constant_Reference
(Container : aliased List;
Position : Cursor) return Constant_Reference_Type
is
begin
if Checks and then Position.Container = null then
raise Constraint_Error with "Position cursor has no element";
end if;
if Checks and then Position.Container /= Container'Unrestricted_Access
then
raise Program_Error with
"Position cursor designates wrong container";
end if;
if Checks and then Position.Node.Element = null then
raise Program_Error with "Node has no element";
end if;
pragma Assert (Vet (Position), "bad cursor in Constant_Reference");
declare
TC : constant Tamper_Counts_Access :=
Container.TC'Unrestricted_Access;
begin
return R : constant Constant_Reference_Type :=
(Element => Position.Node.Element,
Control => (Controlled with TC))
do
Lock (TC.all);
end return;
end;
end Constant_Reference;
--------------
-- Contains --
--------------
function Contains
(Container : List;
Item : Element_Type) return Boolean
is
begin
return Find (Container, Item) /= No_Element;
end Contains;
----------
-- Copy --
----------
function Copy (Source : List) return List is
begin
return Target : List do
Target.Assign (Source);
end return;
end Copy;
------------
-- Delete --
------------
procedure Delete
(Container : in out List;
Position : in out Cursor;
Count : Count_Type := 1)
is
X : Node_Access;
begin
if Checks and then Position.Node = null then
raise Constraint_Error with
"Position cursor has no element";
end if;
if Checks and then Position.Node.Element = null then
raise Program_Error with
"Position cursor has no element";
end if;
if Checks and then Position.Container /= Container'Unrestricted_Access
then
raise Program_Error with
"Position cursor designates wrong container";
end if;
pragma Assert (Vet (Position), "bad cursor in Delete");
if Position.Node = Container.First then
Delete_First (Container, Count);
Position := No_Element; -- Post-York behavior
return;
end if;
if Count = 0 then
Position := No_Element; -- Post-York behavior
return;
end if;
TC_Check (Container.TC);
for Index in 1 .. Count loop
X := Position.Node;
Container.Length := Container.Length - 1;
if X = Container.Last then
Position := No_Element;
Container.Last := X.Prev;
Container.Last.Next := null;
Free (X);
return;
end if;
Position.Node := X.Next;
X.Next.Prev := X.Prev;
X.Prev.Next := X.Next;
Free (X);
end loop;
-- Fix this junk comment ???
Position := No_Element; -- Post-York behavior
end Delete;
------------------
-- Delete_First --
------------------
procedure Delete_First
(Container : in out List;
Count : Count_Type := 1)
is
X : Node_Access;
begin
if Count >= Container.Length then
Clear (Container);
return;
end if;
if Count = 0 then
return;
end if;
TC_Check (Container.TC);
for J in 1 .. Count loop
X := Container.First;
pragma Assert (X.Next.Prev = Container.First);
Container.First := X.Next;
Container.First.Prev := null;
Container.Length := Container.Length - 1;
Free (X);
end loop;
end Delete_First;
-----------------
-- Delete_Last --
-----------------
procedure Delete_Last
(Container : in out List;
Count : Count_Type := 1)
is
X : Node_Access;
begin
if Count >= Container.Length then
Clear (Container);
return;
end if;
if Count = 0 then
return;
end if;
TC_Check (Container.TC);
for J in 1 .. Count loop
X := Container.Last;
pragma Assert (X.Prev.Next = Container.Last);
Container.Last := X.Prev;
Container.Last.Next := null;
Container.Length := Container.Length - 1;
Free (X);
end loop;
end Delete_Last;
-------------
-- Element --
-------------
function Element (Position : Cursor) return Element_Type is
begin
if Checks and then Position.Node = null then
raise Constraint_Error with
"Position cursor has no element";
end if;
if Checks and then Position.Node.Element = null then
raise Program_Error with
"Position cursor has no element";
end if;
pragma Assert (Vet (Position), "bad cursor in Element");
return Position.Node.Element.all;
end Element;
--------------
-- Finalize --
--------------
procedure Finalize (Object : in out Iterator) is
begin
if Object.Container /= null then
Unbusy (Object.Container.TC);
end if;
end Finalize;
----------
-- Find --
----------
function Find
(Container : List;
Item : Element_Type;
Position : Cursor := No_Element) return Cursor
is
Node : Node_Access := Position.Node;
begin
if Node = null then
Node := Container.First;
else
if Checks and then Node.Element = null then
raise Program_Error;
end if;
if Checks and then Position.Container /= Container'Unrestricted_Access
then
raise Program_Error with
"Position cursor designates wrong container";
end if;
pragma Assert (Vet (Position), "bad cursor in Find");
end if;
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
declare
Lock : With_Lock (Container.TC'Unrestricted_Access);
begin
while Node /= null loop
if Node.Element.all = Item then
return Cursor'(Container'Unrestricted_Access, Node);
end if;
Node := Node.Next;
end loop;
return No_Element;
end;
end Find;
-----------
-- First --
-----------
function First (Container : List) return Cursor is
begin
if Container.First = null then
return No_Element;
else
return Cursor'(Container'Unrestricted_Access, Container.First);
end if;
end First;
function First (Object : Iterator) return Cursor is
begin
-- The value of the iterator object's Node component influences the
-- behavior of the First (and Last) selector function.
-- When the Node component is null, this means the iterator object was
-- constructed without a start expression, in which case the (forward)
-- iteration starts from the (logical) beginning of the entire sequence
-- of items (corresponding to Container.First, for a forward iterator).
-- Otherwise, this is iteration over a partial sequence of items. When
-- the Node component is non-null, the iterator object was constructed
-- with a start expression, that specifies the position from which the
-- (forward) partial iteration begins.
if Object.Node = null then
return Indefinite_Doubly_Linked_Lists.First (Object.Container.all);
else
return Cursor'(Object.Container, Object.Node);
end if;
end First;
-------------------
-- First_Element --
-------------------
function First_Element (Container : List) return Element_Type is
begin
if Checks and then Container.First = null then
raise Constraint_Error with "list is empty";
end if;
return Container.First.Element.all;
end First_Element;
----------
-- Free --
----------
procedure Free (X : in out Node_Access) is
procedure Deallocate is
new Ada.Unchecked_Deallocation (Node_Type, Node_Access);
begin
-- While a node is in use, as an active link in a list, its Previous and
-- Next components must be null, or designate a different node; this is
-- a node invariant. For this indefinite list, there is an additional
-- invariant: that the element access value be non-null. Before actually
-- deallocating the node, we set the node access value components of the
-- node to point to the node itself, and set the element access value to
-- null (by deallocating the node's element), thus falsifying the node
-- invariant. Subprogram Vet inspects the value of the node components
-- when interrogating the node, in order to detect whether the cursor's
-- node access value is dangling.
-- Note that we have no guarantee that the storage for the node isn't
-- modified when it is deallocated, but there are other tests that Vet
-- does if node invariants appear to be satisifed. However, in practice
-- this simple test works well enough, detecting dangling references
-- immediately, without needing further interrogation.
X.Next := X;
X.Prev := X;
begin
Free (X.Element);
exception
when others =>
X.Element := null;
Deallocate (X);
raise;
end;
Deallocate (X);
end Free;
---------------------
-- Generic_Sorting --
---------------------
package body Generic_Sorting is
---------------
-- Is_Sorted --
---------------
function Is_Sorted (Container : List) return Boolean is
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
Lock : With_Lock (Container.TC'Unrestricted_Access);
Node : Node_Access;
begin
Node := Container.First;
for J in 2 .. Container.Length loop
if Node.Next.Element.all < Node.Element.all then
return False;
end if;
Node := Node.Next;
end loop;
return True;
end Is_Sorted;
-----------
-- Merge --
-----------
procedure Merge
(Target : in out List;
Source : in out List)
is
begin
-- The semantics of Merge changed slightly per AI05-0021. It was
-- originally the case that if Target and Source denoted the same
-- container object, then the GNAT implementation of Merge did
-- nothing. However, it was argued that RM05 did not precisely
-- specify the semantics for this corner case. The decision of the
-- ARG was that if Target and Source denote the same non-empty
-- container object, then Program_Error is raised.
if Source.Is_Empty then
return;
end if;
if Checks and then Target'Address = Source'Address then
raise Program_Error with
"Target and Source denote same non-empty container";
end if;
if Checks and then Target.Length > Count_Type'Last - Source.Length
then
raise Constraint_Error with "new length exceeds maximum";
end if;
TC_Check (Target.TC);
TC_Check (Source.TC);
declare
Lock_Target : With_Lock (Target.TC'Unchecked_Access);
Lock_Source : With_Lock (Source.TC'Unchecked_Access);
LI, RI, RJ : Node_Access;
begin
LI := Target.First;
RI := Source.First;
while RI /= null loop
pragma Assert (RI.Next = null
or else not (RI.Next.Element.all <
RI.Element.all));
if LI = null then
Splice_Internal (Target, null, Source);
exit;
end if;
pragma Assert (LI.Next = null
or else not (LI.Next.Element.all <
LI.Element.all));
if RI.Element.all < LI.Element.all then
RJ := RI;
RI := RI.Next;
Splice_Internal (Target, LI, Source, RJ);
else
LI := LI.Next;
end if;
end loop;
end;
end Merge;
----------
-- Sort --
----------
procedure Sort (Container : in out List) is
procedure Partition (Pivot : Node_Access; Back : Node_Access);
-- Comment ???
procedure Sort (Front, Back : Node_Access);
-- Comment??? Confusing name??? change name???
---------------
-- Partition --
---------------
procedure Partition (Pivot : Node_Access; Back : Node_Access) is
Node : Node_Access;
begin
Node := Pivot.Next;
while Node /= Back loop
if Node.Element.all < Pivot.Element.all then
declare
Prev : constant Node_Access := Node.Prev;
Next : constant Node_Access := Node.Next;
begin
Prev.Next := Next;
if Next = null then
Container.Last := Prev;
else
Next.Prev := Prev;
end if;
Node.Next := Pivot;
Node.Prev := Pivot.Prev;
Pivot.Prev := Node;
if Node.Prev = null then
Container.First := Node;
else
Node.Prev.Next := Node;
end if;
Node := Next;
end;
else
Node := Node.Next;
end if;
end loop;
end Partition;
----------
-- Sort --
----------
procedure Sort (Front, Back : Node_Access) is
Pivot : constant Node_Access :=
(if Front = null then Container.First else Front.Next);
begin
if Pivot /= Back then
Partition (Pivot, Back);
Sort (Front, Pivot);
Sort (Pivot, Back);
end if;
end Sort;
-- Start of processing for Sort
begin
if Container.Length <= 1 then
return;
end if;
pragma Assert (Container.First.Prev = null);
pragma Assert (Container.Last.Next = null);
TC_Check (Container.TC);
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
declare
Lock : With_Lock (Container.TC'Unchecked_Access);
begin
Sort (Front => null, Back => null);
end;
pragma Assert (Container.First.Prev = null);
pragma Assert (Container.Last.Next = null);
end Sort;
end Generic_Sorting;
------------------------
-- Get_Element_Access --
------------------------
function Get_Element_Access
(Position : Cursor) return not null Element_Access is
begin
return Position.Node.Element;
end Get_Element_Access;
-----------------
-- Has_Element --
-----------------
function Has_Element (Position : Cursor) return Boolean is
begin
pragma Assert (Vet (Position), "bad cursor in Has_Element");
return Position.Node /= null;
end Has_Element;
------------
-- Insert --
------------
procedure Insert
(Container : in out List;
Before : Cursor;
New_Item : Element_Type;
Position : out Cursor;
Count : Count_Type := 1)
is
First_Node : Node_Access;
New_Node : Node_Access;
begin
if Before.Container /= null then
if Checks and then Before.Container /= Container'Unrestricted_Access
then
raise Program_Error with
"Before cursor designates wrong list";
end if;
if Checks and then
(Before.Node = null or else Before.Node.Element = null)
then
raise Program_Error with
"Before cursor has no element";
end if;
pragma Assert (Vet (Before), "bad cursor in Insert");
end if;
if Count = 0 then
Position := Before;
return;
end if;
if Checks and then Container.Length > Count_Type'Last - Count then
raise Constraint_Error with "new length exceeds maximum";
end if;
TC_Check (Container.TC);
declare
-- The element allocator may need an accessibility check in the case
-- the actual type is class-wide or has access discriminants (see
-- RM 4.8(10.1) and AI12-0035). We don't unsuppress the check on the
-- allocator in the loop below, because the one in this block would
-- have failed already.
pragma Unsuppress (Accessibility_Check);
Element : Element_Access := new Element_Type'(New_Item);
begin
New_Node := new Node_Type'(Element, null, null);
First_Node := New_Node;
exception
when others =>
Free (Element);
raise;
end;
Insert_Internal (Container, Before.Node, New_Node);
for J in 2 .. Count loop
declare
Element : Element_Access := new Element_Type'(New_Item);
begin
New_Node := new Node_Type'(Element, null, null);
exception
when others =>
Free (Element);
raise;
end;
Insert_Internal (Container, Before.Node, New_Node);
end loop;
Position := Cursor'(Container'Unchecked_Access, First_Node);
end Insert;
procedure Insert
(Container : in out List;
Before : Cursor;
New_Item : Element_Type;
Count : Count_Type := 1)
is
Position : Cursor;
pragma Unreferenced (Position);
begin
Insert (Container, Before, New_Item, Position, Count);
end Insert;
---------------------
-- Insert_Internal --
---------------------
procedure Insert_Internal
(Container : in out List;
Before : Node_Access;
New_Node : Node_Access)
is
begin
if Container.Length = 0 then
pragma Assert (Before = null);
pragma Assert (Container.First = null);
pragma Assert (Container.Last = null);
Container.First := New_Node;
Container.Last := New_Node;
elsif Before = null then
pragma Assert (Container.Last.Next = null);
Container.Last.Next := New_Node;
New_Node.Prev := Container.Last;
Container.Last := New_Node;
elsif Before = Container.First then
pragma Assert (Container.First.Prev = null);
Container.First.Prev := New_Node;
New_Node.Next := Container.First;
Container.First := New_Node;
else
pragma Assert (Container.First.Prev = null);
pragma Assert (Container.Last.Next = null);
New_Node.Next := Before;
New_Node.Prev := Before.Prev;
Before.Prev.Next := New_Node;
Before.Prev := New_Node;
end if;
Container.Length := Container.Length + 1;
end Insert_Internal;
--------------
-- Is_Empty --
--------------
function Is_Empty (Container : List) return Boolean is
begin
return Container.Length = 0;
end Is_Empty;
-------------
-- Iterate --
-------------
procedure Iterate
(Container : List;
Process : not null access procedure (Position : Cursor))
is
Busy : With_Busy (Container.TC'Unrestricted_Access);
Node : Node_Access := Container.First;
begin
while Node /= null loop
Process (Cursor'(Container'Unrestricted_Access, Node));
Node := Node.Next;
end loop;
end Iterate;
function Iterate
(Container : List)
return List_Iterator_Interfaces.Reversible_Iterator'class
is
begin
-- The value of the Node component influences the behavior of the First
-- and Last selector functions of the iterator object. When the Node
-- component is null (as is the case here), this means the iterator
-- object was constructed without a start expression. This is a
-- complete iterator, meaning that the iteration starts from the
-- (logical) beginning of the sequence of items.
-- Note: For a forward iterator, Container.First is the beginning, and
-- for a reverse iterator, Container.Last is the beginning.
return It : constant Iterator :=
Iterator'(Limited_Controlled with
Container => Container'Unrestricted_Access,
Node => null)
do
Busy (Container.TC'Unrestricted_Access.all);
end return;
end Iterate;
function Iterate
(Container : List;
Start : Cursor)
return List_Iterator_Interfaces.Reversible_Iterator'Class
is
begin
-- It was formerly the case that when Start = No_Element, the partial
-- iterator was defined to behave the same as for a complete iterator,
-- and iterate over the entire sequence of items. However, those
-- semantics were unintuitive and arguably error-prone (it is too easy
-- to accidentally create an endless loop), and so they were changed,
-- per the ARG meeting in Denver on 2011/11. However, there was no
-- consensus about what positive meaning this corner case should have,
-- and so it was decided to simply raise an exception. This does imply,
-- however, that it is not possible to use a partial iterator to specify
-- an empty sequence of items.
if Checks and then Start = No_Element then
raise Constraint_Error with
"Start position for iterator equals No_Element";
end if;
if Checks and then Start.Container /= Container'Unrestricted_Access then
raise Program_Error with
"Start cursor of Iterate designates wrong list";
end if;
pragma Assert (Vet (Start), "Start cursor of Iterate is bad");
-- The value of the Node component influences the behavior of the
-- First and Last selector functions of the iterator object. When
-- the Node component is non-null (as is the case here), it means
-- that this is a partial iteration, over a subset of the complete
-- sequence of items. The iterator object was constructed with
-- a start expression, indicating the position from which the
-- iteration begins. Note that the start position has the same value
-- irrespective of whether this is a forward or reverse iteration.
return It : constant Iterator :=
Iterator'(Limited_Controlled with
Container => Container'Unrestricted_Access,
Node => Start.Node)
do
Busy (Container.TC'Unrestricted_Access.all);
end return;
end Iterate;
----------
-- Last --
----------
function Last (Container : List) return Cursor is
begin
if Container.Last = null then
return No_Element;
else
return Cursor'(Container'Unrestricted_Access, Container.Last);
end if;
end Last;
function Last (Object : Iterator) return Cursor is
begin
-- The value of the iterator object's Node component influences the
-- behavior of the Last (and First) selector function.
-- When the Node component is null, this means the iterator object was
-- constructed without a start expression, in which case the (reverse)
-- iteration starts from the (logical) beginning of the entire sequence
-- (corresponding to Container.Last, for a reverse iterator).
-- Otherwise, this is iteration over a partial sequence of items. When
-- the Node component is non-null, the iterator object was constructed
-- with a start expression, that specifies the position from which the
-- (reverse) partial iteration begins.
if Object.Node = null then
return Indefinite_Doubly_Linked_Lists.Last (Object.Container.all);
else
return Cursor'(Object.Container, Object.Node);
end if;
end Last;
------------------
-- Last_Element --
------------------
function Last_Element (Container : List) return Element_Type is
begin
if Checks and then Container.Last = null then
raise Constraint_Error with "list is empty";
end if;
return Container.Last.Element.all;
end Last_Element;
------------
-- Length --
------------
function Length (Container : List) return Count_Type is
begin
return Container.Length;
end Length;
----------
-- Move --
----------
procedure Move (Target : in out List; Source : in out List) is
begin
if Target'Address = Source'Address then
return;
end if;
TC_Check (Source.TC);
Clear (Target);
Target.First := Source.First;
Source.First := null;
Target.Last := Source.Last;
Source.Last := null;
Target.Length := Source.Length;
Source.Length := 0;
end Move;
----------
-- Next --
----------
procedure Next (Position : in out Cursor) is
begin
Position := Next (Position);
end Next;
function Next (Position : Cursor) return Cursor is
begin
if Position.Node = null then
return No_Element;
else
pragma Assert (Vet (Position), "bad cursor in Next");
declare
Next_Node : constant Node_Access := Position.Node.Next;
begin
if Next_Node = null then
return No_Element;
else
return Cursor'(Position.Container, Next_Node);
end if;
end;
end if;
end Next;
function Next (Object : Iterator; Position : Cursor) return Cursor is
begin
if Position.Container = null then
return No_Element;
end if;
if Checks and then Position.Container /= Object.Container then
raise Program_Error with
"Position cursor of Next designates wrong list";
end if;
return Next (Position);
end Next;
-------------
-- Prepend --
-------------
procedure Prepend
(Container : in out List;
New_Item : Element_Type;
Count : Count_Type := 1)
is
begin
Insert (Container, First (Container), New_Item, Count);
end Prepend;
--------------
-- Previous --
--------------
procedure Previous (Position : in out Cursor) is
begin
Position := Previous (Position);
end Previous;
function Previous (Position : Cursor) return Cursor is
begin
if Position.Node = null then
return No_Element;
else
pragma Assert (Vet (Position), "bad cursor in Previous");
declare
Prev_Node : constant Node_Access := Position.Node.Prev;
begin
if Prev_Node = null then
return No_Element;
else
return Cursor'(Position.Container, Prev_Node);
end if;
end;
end if;
end Previous;
function Previous (Object : Iterator; Position : Cursor) return Cursor is
begin
if Position.Container = null then
return No_Element;
end if;
if Checks and then Position.Container /= Object.Container then
raise Program_Error with
"Position cursor of Previous designates wrong list";
end if;
return Previous (Position);
end Previous;
----------------------
-- Pseudo_Reference --
----------------------
function Pseudo_Reference
(Container : aliased List'Class) return Reference_Control_Type
is
TC : constant Tamper_Counts_Access := Container.TC'Unrestricted_Access;
begin
return R : constant Reference_Control_Type := (Controlled with TC) do
Lock (TC.all);
end return;
end Pseudo_Reference;
-------------------
-- Query_Element --
-------------------
procedure Query_Element
(Position : Cursor;
Process : not null access procedure (Element : Element_Type))
is
begin
if Checks and then Position.Node = null then
raise Constraint_Error with
"Position cursor has no element";
end if;
if Checks and then Position.Node.Element = null then
raise Program_Error with
"Position cursor has no element";
end if;
pragma Assert (Vet (Position), "bad cursor in Query_Element");
declare
Lock : With_Lock (Position.Container.TC'Unrestricted_Access);
begin
Process (Position.Node.Element.all);
end;
end Query_Element;
----------
-- Read --
----------
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out List)
is
N : Count_Type'Base;
Dst : Node_Access;
begin
Clear (Item);
Count_Type'Base'Read (Stream, N);
if N = 0 then
return;
end if;
declare
Element : Element_Access :=
new Element_Type'(Element_Type'Input (Stream));
begin
Dst := new Node_Type'(Element, null, null);
exception
when others =>
Free (Element);
raise;
end;
Item.First := Dst;
Item.Last := Dst;
Item.Length := 1;
while Item.Length < N loop
declare
Element : Element_Access :=
new Element_Type'(Element_Type'Input (Stream));
begin
Dst := new Node_Type'(Element, Next => null, Prev => Item.Last);
exception
when others =>
Free (Element);
raise;
end;
Item.Last.Next := Dst;
Item.Last := Dst;
Item.Length := Item.Length + 1;
end loop;
end Read;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Cursor)
is
begin
raise Program_Error with "attempt to stream list cursor";
end Read;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Reference_Type)
is
begin
raise Program_Error with "attempt to stream reference";
end Read;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Constant_Reference_Type)
is
begin
raise Program_Error with "attempt to stream reference";
end Read;
---------------
-- Reference --
---------------
function Reference
(Container : aliased in out List;
Position : Cursor) return Reference_Type
is
begin
if Checks and then Position.Container = null then
raise Constraint_Error with "Position cursor has no element";
end if;
if Checks and then Position.Container /= Container'Unrestricted_Access
then
raise Program_Error with
"Position cursor designates wrong container";
end if;
if Checks and then Position.Node.Element = null then
raise Program_Error with "Node has no element";
end if;
pragma Assert (Vet (Position), "bad cursor in function Reference");
declare
TC : constant Tamper_Counts_Access :=
Container.TC'Unrestricted_Access;
begin
return R : constant Reference_Type :=
(Element => Position.Node.Element,
Control => (Controlled with TC))
do
Lock (TC.all);
end return;
end;
end Reference;
---------------------
-- Replace_Element --
---------------------
procedure Replace_Element
(Container : in out List;
Position : Cursor;
New_Item : Element_Type)
is
begin
if Checks and then Position.Container = null then
raise Constraint_Error with "Position cursor has no element";
end if;
if Checks and then Position.Container /= Container'Unchecked_Access then
raise Program_Error with
"Position cursor designates wrong container";
end if;
TE_Check (Container.TC);
if Checks and then Position.Node.Element = null then
raise Program_Error with
"Position cursor has no element";
end if;
pragma Assert (Vet (Position), "bad cursor in Replace_Element");
declare
-- The element allocator may need an accessibility check in the
-- case the actual type is class-wide or has access discriminants
-- (see RM 4.8(10.1) and AI12-0035).
pragma Unsuppress (Accessibility_Check);
X : Element_Access := Position.Node.Element;
begin
Position.Node.Element := new Element_Type'(New_Item);
Free (X);
end;
end Replace_Element;
----------------------
-- Reverse_Elements --
----------------------
procedure Reverse_Elements (Container : in out List) is
I : Node_Access := Container.First;
J : Node_Access := Container.Last;
procedure Swap (L, R : Node_Access);
----------
-- Swap --
----------
procedure Swap (L, R : Node_Access) is
LN : constant Node_Access := L.Next;
LP : constant Node_Access := L.Prev;
RN : constant Node_Access := R.Next;
RP : constant Node_Access := R.Prev;
begin
if LP /= null then
LP.Next := R;
end if;
if RN /= null then
RN.Prev := L;
end if;
L.Next := RN;
R.Prev := LP;
if LN = R then
pragma Assert (RP = L);
L.Prev := R;
R.Next := L;
else
L.Prev := RP;
RP.Next := L;
R.Next := LN;
LN.Prev := R;
end if;
end Swap;
-- Start of processing for Reverse_Elements
begin
if Container.Length <= 1 then
return;
end if;
pragma Assert (Container.First.Prev = null);
pragma Assert (Container.Last.Next = null);
TC_Check (Container.TC);
Container.First := J;
Container.Last := I;
loop
Swap (L => I, R => J);
J := J.Next;
exit when I = J;
I := I.Prev;
exit when I = J;
Swap (L => J, R => I);
I := I.Next;
exit when I = J;
J := J.Prev;
exit when I = J;
end loop;
pragma Assert (Container.First.Prev = null);
pragma Assert (Container.Last.Next = null);
end Reverse_Elements;
------------------
-- Reverse_Find --
------------------
function Reverse_Find
(Container : List;
Item : Element_Type;
Position : Cursor := No_Element) return Cursor
is
Node : Node_Access := Position.Node;
begin
if Node = null then
Node := Container.Last;
else
if Checks and then Node.Element = null then
raise Program_Error with "Position cursor has no element";
end if;
if Checks and then Position.Container /= Container'Unrestricted_Access
then
raise Program_Error with
"Position cursor designates wrong container";
end if;
pragma Assert (Vet (Position), "bad cursor in Reverse_Find");
end if;
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
declare
Lock : With_Lock (Container.TC'Unrestricted_Access);
begin
while Node /= null loop
if Node.Element.all = Item then
return Cursor'(Container'Unrestricted_Access, Node);
end if;
Node := Node.Prev;
end loop;
return No_Element;
end;
end Reverse_Find;
---------------------
-- Reverse_Iterate --
---------------------
procedure Reverse_Iterate
(Container : List;
Process : not null access procedure (Position : Cursor))
is
Busy : With_Busy (Container.TC'Unrestricted_Access);
Node : Node_Access := Container.Last;
begin
while Node /= null loop
Process (Cursor'(Container'Unrestricted_Access, Node));
Node := Node.Prev;
end loop;
end Reverse_Iterate;
------------
-- Splice --
------------
procedure Splice
(Target : in out List;
Before : Cursor;
Source : in out List)
is
begin
if Before.Container /= null then
if Checks and then Before.Container /= Target'Unrestricted_Access then
raise Program_Error with
"Before cursor designates wrong container";
end if;
if Checks and then
(Before.Node = null or else Before.Node.Element = null)
then
raise Program_Error with
"Before cursor has no element";
end if;
pragma Assert (Vet (Before), "bad cursor in Splice");
end if;
if Target'Address = Source'Address or else Source.Length = 0 then
return;
end if;
if Checks and then Target.Length > Count_Type'Last - Source.Length then
raise Constraint_Error with "new length exceeds maximum";
end if;
TC_Check (Target.TC);
TC_Check (Source.TC);
Splice_Internal (Target, Before.Node, Source);
end Splice;
procedure Splice
(Container : in out List;
Before : Cursor;
Position : Cursor)
is
begin
if Before.Container /= null then
if Checks and then Before.Container /= Container'Unchecked_Access then
raise Program_Error with
"Before cursor designates wrong container";
end if;
if Checks and then
(Before.Node = null or else Before.Node.Element = null)
then
raise Program_Error with
"Before cursor has no element";
end if;
pragma Assert (Vet (Before), "bad Before cursor in Splice");
end if;
if Checks and then Position.Node = null then
raise Constraint_Error with "Position cursor has no element";
end if;
if Checks and then Position.Node.Element = null then
raise Program_Error with "Position cursor has no element";
end if;
if Checks and then Position.Container /= Container'Unrestricted_Access
then
raise Program_Error with
"Position cursor designates wrong container";
end if;
pragma Assert (Vet (Position), "bad Position cursor in Splice");
if Position.Node = Before.Node
or else Position.Node.Next = Before.Node
then
return;
end if;
pragma Assert (Container.Length >= 2);
TC_Check (Container.TC);
if Before.Node = null then
pragma Assert (Position.Node /= Container.Last);
if Position.Node = Container.First then
Container.First := Position.Node.Next;
Container.First.Prev := null;
else
Position.Node.Prev.Next := Position.Node.Next;
Position.Node.Next.Prev := Position.Node.Prev;
end if;
Container.Last.Next := Position.Node;
Position.Node.Prev := Container.Last;
Container.Last := Position.Node;
Container.Last.Next := null;
return;
end if;
if Before.Node = Container.First then
pragma Assert (Position.Node /= Container.First);
if Position.Node = Container.Last then
Container.Last := Position.Node.Prev;
Container.Last.Next := null;
else
Position.Node.Prev.Next := Position.Node.Next;
Position.Node.Next.Prev := Position.Node.Prev;
end if;
Container.First.Prev := Position.Node;
Position.Node.Next := Container.First;
Container.First := Position.Node;
Container.First.Prev := null;
return;
end if;
if Position.Node = Container.First then
Container.First := Position.Node.Next;
Container.First.Prev := null;
elsif Position.Node = Container.Last then
Container.Last := Position.Node.Prev;
Container.Last.Next := null;
else
Position.Node.Prev.Next := Position.Node.Next;
Position.Node.Next.Prev := Position.Node.Prev;
end if;
Before.Node.Prev.Next := Position.Node;
Position.Node.Prev := Before.Node.Prev;
Before.Node.Prev := Position.Node;
Position.Node.Next := Before.Node;
pragma Assert (Container.First.Prev = null);
pragma Assert (Container.Last.Next = null);
end Splice;
procedure Splice
(Target : in out List;
Before : Cursor;
Source : in out List;
Position : in out Cursor)
is
begin
if Target'Address = Source'Address then
Splice (Target, Before, Position);
return;
end if;
if Before.Container /= null then
if Checks and then Before.Container /= Target'Unrestricted_Access then
raise Program_Error with
"Before cursor designates wrong container";
end if;
if Checks and then
(Before.Node = null or else Before.Node.Element = null)
then
raise Program_Error with
"Before cursor has no element";
end if;
pragma Assert (Vet (Before), "bad Before cursor in Splice");
end if;
if Checks and then Position.Node = null then
raise Constraint_Error with "Position cursor has no element";
end if;
if Checks and then Position.Node.Element = null then
raise Program_Error with
"Position cursor has no element";
end if;
if Checks and then Position.Container /= Source'Unrestricted_Access then
raise Program_Error with
"Position cursor designates wrong container";
end if;
pragma Assert (Vet (Position), "bad Position cursor in Splice");
if Checks and then Target.Length = Count_Type'Last then
raise Constraint_Error with "Target is full";
end if;
TC_Check (Target.TC);
TC_Check (Source.TC);
Splice_Internal (Target, Before.Node, Source, Position.Node);
Position.Container := Target'Unchecked_Access;
end Splice;
---------------------
-- Splice_Internal --
---------------------
procedure Splice_Internal
(Target : in out List;
Before : Node_Access;
Source : in out List)
is
begin
-- This implements the corresponding Splice operation, after the
-- parameters have been vetted, and corner-cases disposed of.
pragma Assert (Target'Address /= Source'Address);
pragma Assert (Source.Length > 0);
pragma Assert (Source.First /= null);
pragma Assert (Source.First.Prev = null);
pragma Assert (Source.Last /= null);
pragma Assert (Source.Last.Next = null);
pragma Assert (Target.Length <= Count_Type'Last - Source.Length);
if Target.Length = 0 then
pragma Assert (Before = null);
pragma Assert (Target.First = null);
pragma Assert (Target.Last = null);
Target.First := Source.First;
Target.Last := Source.Last;
elsif Before = null then
pragma Assert (Target.Last.Next = null);
Target.Last.Next := Source.First;
Source.First.Prev := Target.Last;
Target.Last := Source.Last;
elsif Before = Target.First then
pragma Assert (Target.First.Prev = null);
Source.Last.Next := Target.First;
Target.First.Prev := Source.Last;
Target.First := Source.First;
else
pragma Assert (Target.Length >= 2);
Before.Prev.Next := Source.First;
Source.First.Prev := Before.Prev;
Before.Prev := Source.Last;
Source.Last.Next := Before;
end if;
Source.First := null;
Source.Last := null;
Target.Length := Target.Length + Source.Length;
Source.Length := 0;
end Splice_Internal;
procedure Splice_Internal
(Target : in out List;
Before : Node_Access; -- node of Target
Source : in out List;
Position : Node_Access) -- node of Source
is
begin
-- This implements the corresponding Splice operation, after the
-- parameters have been vetted.
pragma Assert (Target'Address /= Source'Address);
pragma Assert (Target.Length < Count_Type'Last);
pragma Assert (Source.Length > 0);
pragma Assert (Source.First /= null);
pragma Assert (Source.First.Prev = null);
pragma Assert (Source.Last /= null);
pragma Assert (Source.Last.Next = null);
pragma Assert (Position /= null);
if Position = Source.First then
Source.First := Position.Next;
if Position = Source.Last then
pragma Assert (Source.First = null);
pragma Assert (Source.Length = 1);
Source.Last := null;
else
Source.First.Prev := null;
end if;
elsif Position = Source.Last then
pragma Assert (Source.Length >= 2);
Source.Last := Position.Prev;
Source.Last.Next := null;
else
pragma Assert (Source.Length >= 3);
Position.Prev.Next := Position.Next;
Position.Next.Prev := Position.Prev;
end if;
if Target.Length = 0 then
pragma Assert (Before = null);
pragma Assert (Target.First = null);
pragma Assert (Target.Last = null);
Target.First := Position;
Target.Last := Position;
Target.First.Prev := null;
Target.Last.Next := null;
elsif Before = null then
pragma Assert (Target.Last.Next = null);
Target.Last.Next := Position;
Position.Prev := Target.Last;
Target.Last := Position;
Target.Last.Next := null;
elsif Before = Target.First then
pragma Assert (Target.First.Prev = null);
Target.First.Prev := Position;
Position.Next := Target.First;
Target.First := Position;
Target.First.Prev := null;
else
pragma Assert (Target.Length >= 2);
Before.Prev.Next := Position;
Position.Prev := Before.Prev;
Before.Prev := Position;
Position.Next := Before;
end if;
Target.Length := Target.Length + 1;
Source.Length := Source.Length - 1;
end Splice_Internal;
----------
-- Swap --
----------
procedure Swap
(Container : in out List;
I, J : Cursor)
is
begin
if Checks and then I.Node = null then
raise Constraint_Error with "I cursor has no element";
end if;
if Checks and then J.Node = null then
raise Constraint_Error with "J cursor has no element";
end if;
if Checks and then I.Container /= Container'Unchecked_Access then
raise Program_Error with "I cursor designates wrong container";
end if;
if Checks and then J.Container /= Container'Unchecked_Access then
raise Program_Error with "J cursor designates wrong container";
end if;
if I.Node = J.Node then
return;
end if;
TE_Check (Container.TC);
pragma Assert (Vet (I), "bad I cursor in Swap");
pragma Assert (Vet (J), "bad J cursor in Swap");
declare
EI_Copy : constant Element_Access := I.Node.Element;
begin
I.Node.Element := J.Node.Element;
J.Node.Element := EI_Copy;
end;
end Swap;
----------------
-- Swap_Links --
----------------
procedure Swap_Links
(Container : in out List;
I, J : Cursor)
is
begin
if Checks and then I.Node = null then
raise Constraint_Error with "I cursor has no element";
end if;
if Checks and then J.Node = null then
raise Constraint_Error with "J cursor has no element";
end if;
if Checks and then I.Container /= Container'Unrestricted_Access then
raise Program_Error with "I cursor designates wrong container";
end if;
if Checks and then J.Container /= Container'Unrestricted_Access then
raise Program_Error with "J cursor designates wrong container";
end if;
if I.Node = J.Node then
return;
end if;
TC_Check (Container.TC);
pragma Assert (Vet (I), "bad I cursor in Swap_Links");
pragma Assert (Vet (J), "bad J cursor in Swap_Links");
declare
I_Next : constant Cursor := Next (I);
begin
if I_Next = J then
Splice (Container, Before => I, Position => J);
else
declare
J_Next : constant Cursor := Next (J);
begin
if J_Next = I then
Splice (Container, Before => J, Position => I);
else
pragma Assert (Container.Length >= 3);
Splice (Container, Before => I_Next, Position => J);
Splice (Container, Before => J_Next, Position => I);
end if;
end;
end if;
end;
pragma Assert (Container.First.Prev = null);
pragma Assert (Container.Last.Next = null);
end Swap_Links;
--------------------
-- Update_Element --
--------------------
procedure Update_Element
(Container : in out List;
Position : Cursor;
Process : not null access procedure (Element : in out Element_Type))
is
begin
if Checks and then Position.Node = null then
raise Constraint_Error with "Position cursor has no element";
end if;
if Checks and then Position.Node.Element = null then
raise Program_Error with
"Position cursor has no element";
end if;
if Checks and then Position.Container /= Container'Unchecked_Access then
raise Program_Error with
"Position cursor designates wrong container";
end if;
pragma Assert (Vet (Position), "bad cursor in Update_Element");
declare
Lock : With_Lock (Container.TC'Unchecked_Access);
begin
Process (Position.Node.Element.all);
end;
end Update_Element;
---------
-- Vet --
---------
function Vet (Position : Cursor) return Boolean is
begin
if Position.Node = null then
return Position.Container = null;
end if;
if Position.Container = null then
return False;
end if;
-- An invariant of a node is that its Previous and Next components can
-- be null, or designate a different node. Also, its element access
-- value must be non-null. Operation Free sets the node access value
-- components of the node to designate the node itself, and the element
-- access value to null, before actually deallocating the node, thus
-- deliberately violating the node invariant. This gives us a simple way
-- to detect a dangling reference to a node.
if Position.Node.Next = Position.Node then
return False;
end if;
if Position.Node.Prev = Position.Node then
return False;
end if;
if Position.Node.Element = null then
return False;
end if;
-- In practice the tests above will detect most instances of a dangling
-- reference. If we get here, it means that the invariants of the
-- designated node are satisfied (they at least appear to be satisfied),
-- so we perform some more tests, to determine whether invariants of the
-- designated list are satisfied too.
declare
L : List renames Position.Container.all;
begin
if L.Length = 0 then
return False;
end if;
if L.First = null then
return False;
end if;
if L.Last = null then
return False;
end if;
if L.First.Prev /= null then
return False;
end if;
if L.Last.Next /= null then
return False;
end if;
if Position.Node.Prev = null and then Position.Node /= L.First then
return False;
end if;
if Position.Node.Next = null and then Position.Node /= L.Last then
return False;
end if;
if L.Length = 1 then
return L.First = L.Last;
end if;
if L.First = L.Last then
return False;
end if;
if L.First.Next = null then
return False;
end if;
if L.Last.Prev = null then
return False;
end if;
if L.First.Next.Prev /= L.First then
return False;
end if;
if L.Last.Prev.Next /= L.Last then
return False;
end if;
if L.Length = 2 then
if L.First.Next /= L.Last then
return False;
end if;
if L.Last.Prev /= L.First then
return False;
end if;
return True;
end if;
if L.First.Next = L.Last then
return False;
end if;
if L.Last.Prev = L.First then
return False;
end if;
if Position.Node = L.First then
return True;
end if;
if Position.Node = L.Last then
return True;
end if;
if Position.Node.Next = null then
return False;
end if;
if Position.Node.Prev = null then
return False;
end if;
if Position.Node.Next.Prev /= Position.Node then
return False;
end if;
if Position.Node.Prev.Next /= Position.Node then
return False;
end if;
if L.Length = 3 then
if L.First.Next /= Position.Node then
return False;
end if;
if L.Last.Prev /= Position.Node then
return False;
end if;
end if;
return True;
end;
end Vet;
-----------
-- Write --
-----------
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : List)
is
Node : Node_Access := Item.First;
begin
Count_Type'Base'Write (Stream, Item.Length);
while Node /= null loop
Element_Type'Output (Stream, Node.Element.all);
Node := Node.Next;
end loop;
end Write;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Cursor)
is
begin
raise Program_Error with "attempt to stream list cursor";
end Write;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Reference_Type)
is
begin
raise Program_Error with "attempt to stream reference";
end Write;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Constant_Reference_Type)
is
begin
raise Program_Error with "attempt to stream reference";
end Write;
end Ada.Containers.Indefinite_Doubly_Linked_Lists;
| 27.84199 | 79 | 0.559888 |
58449320c23b2402f0bc5d25f9cc92a4a5f32742 | 902 | ads | Ada | Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/same_enum/pck.ads | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/same_enum/pck.ads | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/same_enum/pck.ads | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | -- Copyright 2011-2017 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with System;
package Pck is
type Color is (Black, Red, Green, Blue, White);
type RGB_Color is new Color range Red .. Blue;
procedure Do_Nothing (A : System.Address);
end Pck;
| 36.08 | 73 | 0.728381 |
587ad0484e7c22ccac25937c104a35d8e5f08a3d | 21,356 | ads | Ada | source/amf/uml/amf-internals-uml_call_operation_actions.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-internals-uml_call_operation_actions.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-internals-uml_call_operation_actions.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$
------------------------------------------------------------------------------
with AMF.Internals.UML_Named_Elements;
with AMF.UML.Activities;
with AMF.UML.Activity_Edges.Collections;
with AMF.UML.Activity_Groups.Collections;
with AMF.UML.Activity_Nodes.Collections;
with AMF.UML.Activity_Partitions.Collections;
with AMF.UML.Call_Operation_Actions;
with AMF.UML.Classifiers.Collections;
with AMF.UML.Constraints.Collections;
with AMF.UML.Dependencies.Collections;
with AMF.UML.Exception_Handlers.Collections;
with AMF.UML.Input_Pins.Collections;
with AMF.UML.Interruptible_Activity_Regions.Collections;
with AMF.UML.Named_Elements;
with AMF.UML.Namespaces;
with AMF.UML.Operations;
with AMF.UML.Output_Pins.Collections;
with AMF.UML.Packages.Collections;
with AMF.UML.Ports;
with AMF.UML.Redefinable_Elements.Collections;
with AMF.UML.String_Expressions;
with AMF.UML.Structured_Activity_Nodes;
with AMF.Visitors;
package AMF.Internals.UML_Call_Operation_Actions is
type UML_Call_Operation_Action_Proxy is
limited new AMF.Internals.UML_Named_Elements.UML_Named_Element_Proxy
and AMF.UML.Call_Operation_Actions.UML_Call_Operation_Action with null record;
overriding function Get_Operation
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Operations.UML_Operation_Access;
-- Getter of CallOperationAction::operation.
--
-- The operation to be invoked by the action execution.
overriding procedure Set_Operation
(Self : not null access UML_Call_Operation_Action_Proxy;
To : AMF.UML.Operations.UML_Operation_Access);
-- Setter of CallOperationAction::operation.
--
-- The operation to be invoked by the action execution.
overriding function Get_Target
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Input_Pins.UML_Input_Pin_Access;
-- Getter of CallOperationAction::target.
--
-- The target object to which the request is sent. The classifier of the
-- target object is used to dynamically determine a behavior to invoke.
-- This object constitutes the context of the execution of the operation.
overriding procedure Set_Target
(Self : not null access UML_Call_Operation_Action_Proxy;
To : AMF.UML.Input_Pins.UML_Input_Pin_Access);
-- Setter of CallOperationAction::target.
--
-- The target object to which the request is sent. The classifier of the
-- target object is used to dynamically determine a behavior to invoke.
-- This object constitutes the context of the execution of the operation.
overriding function Get_Is_Synchronous
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return Boolean;
-- Getter of CallAction::isSynchronous.
--
-- If true, the call is synchronous and the caller waits for completion of
-- the invoked behavior. If false, the call is asynchronous and the caller
-- proceeds immediately and does not expect a return values.
overriding procedure Set_Is_Synchronous
(Self : not null access UML_Call_Operation_Action_Proxy;
To : Boolean);
-- Setter of CallAction::isSynchronous.
--
-- If true, the call is synchronous and the caller waits for completion of
-- the invoked behavior. If false, the call is asynchronous and the caller
-- proceeds immediately and does not expect a return values.
overriding function Get_Result
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Output_Pins.Collections.Ordered_Set_Of_UML_Output_Pin;
-- Getter of CallAction::result.
--
-- A list of output pins where the results of performing the invocation
-- are placed.
overriding function Get_Argument
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Input_Pins.Collections.Ordered_Set_Of_UML_Input_Pin;
-- Getter of InvocationAction::argument.
--
-- Specification of the ordered set of argument values that appears during
-- execution.
overriding function Get_On_Port
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Ports.UML_Port_Access;
-- Getter of InvocationAction::onPort.
--
-- A optional port of the receiver object on which the behavioral feature
-- is invoked.
overriding procedure Set_On_Port
(Self : not null access UML_Call_Operation_Action_Proxy;
To : AMF.UML.Ports.UML_Port_Access);
-- Setter of InvocationAction::onPort.
--
-- A optional port of the receiver object on which the behavioral feature
-- is invoked.
overriding function Get_Context
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Classifiers.UML_Classifier_Access;
-- Getter of Action::context.
--
-- The classifier that owns the behavior of which this action is a part.
overriding function Get_Input
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Input_Pins.Collections.Ordered_Set_Of_UML_Input_Pin;
-- Getter of Action::input.
--
-- The ordered set of input pins connected to the Action. These are among
-- the total set of inputs.
overriding function Get_Is_Locally_Reentrant
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return Boolean;
-- Getter of Action::isLocallyReentrant.
--
-- If true, the action can begin a new, concurrent execution, even if
-- there is already another execution of the action ongoing. If false, the
-- action cannot begin a new execution until any previous execution has
-- completed.
overriding procedure Set_Is_Locally_Reentrant
(Self : not null access UML_Call_Operation_Action_Proxy;
To : Boolean);
-- Setter of Action::isLocallyReentrant.
--
-- If true, the action can begin a new, concurrent execution, even if
-- there is already another execution of the action ongoing. If false, the
-- action cannot begin a new execution until any previous execution has
-- completed.
overriding function Get_Local_Postcondition
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Constraints.Collections.Set_Of_UML_Constraint;
-- Getter of Action::localPostcondition.
--
-- Constraint that must be satisfied when executed is completed.
overriding function Get_Local_Precondition
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Constraints.Collections.Set_Of_UML_Constraint;
-- Getter of Action::localPrecondition.
--
-- Constraint that must be satisfied when execution is started.
overriding function Get_Output
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Output_Pins.Collections.Ordered_Set_Of_UML_Output_Pin;
-- Getter of Action::output.
--
-- The ordered set of output pins connected to the Action. The action
-- places its results onto pins in this set.
overriding function Get_Handler
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Exception_Handlers.Collections.Set_Of_UML_Exception_Handler;
-- Getter of ExecutableNode::handler.
--
-- A set of exception handlers that are examined if an uncaught exception
-- propagates to the outer level of the executable node.
overriding function Get_Activity
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Activities.UML_Activity_Access;
-- Getter of ActivityNode::activity.
--
-- Activity containing the node.
overriding procedure Set_Activity
(Self : not null access UML_Call_Operation_Action_Proxy;
To : AMF.UML.Activities.UML_Activity_Access);
-- Setter of ActivityNode::activity.
--
-- Activity containing the node.
overriding function Get_In_Group
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Activity_Groups.Collections.Set_Of_UML_Activity_Group;
-- Getter of ActivityNode::inGroup.
--
-- Groups containing the node.
overriding function Get_In_Interruptible_Region
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Interruptible_Activity_Regions.Collections.Set_Of_UML_Interruptible_Activity_Region;
-- Getter of ActivityNode::inInterruptibleRegion.
--
-- Interruptible regions containing the node.
overriding function Get_In_Partition
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Activity_Partitions.Collections.Set_Of_UML_Activity_Partition;
-- Getter of ActivityNode::inPartition.
--
-- Partitions containing the node.
overriding function Get_In_Structured_Node
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Structured_Activity_Nodes.UML_Structured_Activity_Node_Access;
-- Getter of ActivityNode::inStructuredNode.
--
-- Structured activity node containing the node.
overriding procedure Set_In_Structured_Node
(Self : not null access UML_Call_Operation_Action_Proxy;
To : AMF.UML.Structured_Activity_Nodes.UML_Structured_Activity_Node_Access);
-- Setter of ActivityNode::inStructuredNode.
--
-- Structured activity node containing the node.
overriding function Get_Incoming
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Activity_Edges.Collections.Set_Of_UML_Activity_Edge;
-- Getter of ActivityNode::incoming.
--
-- Edges that have the node as target.
overriding function Get_Outgoing
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Activity_Edges.Collections.Set_Of_UML_Activity_Edge;
-- Getter of ActivityNode::outgoing.
--
-- Edges that have the node as source.
overriding function Get_Redefined_Node
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Activity_Nodes.Collections.Set_Of_UML_Activity_Node;
-- Getter of ActivityNode::redefinedNode.
--
-- Inherited nodes replaced by this node in a specialization of the
-- activity.
overriding function Get_Is_Leaf
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return Boolean;
-- Getter of RedefinableElement::isLeaf.
--
-- Indicates whether it is possible to further redefine a
-- RedefinableElement. If the value is true, then it is not possible to
-- further redefine the RedefinableElement. Note that this property is
-- preserved through package merge operations; that is, the capability to
-- redefine a RedefinableElement (i.e., isLeaf=false) must be preserved in
-- the resulting RedefinableElement of a package merge operation where a
-- RedefinableElement with isLeaf=false is merged with a matching
-- RedefinableElement with isLeaf=true: the resulting RedefinableElement
-- will have isLeaf=false. Default value is false.
overriding procedure Set_Is_Leaf
(Self : not null access UML_Call_Operation_Action_Proxy;
To : Boolean);
-- Setter of RedefinableElement::isLeaf.
--
-- Indicates whether it is possible to further redefine a
-- RedefinableElement. If the value is true, then it is not possible to
-- further redefine the RedefinableElement. Note that this property is
-- preserved through package merge operations; that is, the capability to
-- redefine a RedefinableElement (i.e., isLeaf=false) must be preserved in
-- the resulting RedefinableElement of a package merge operation where a
-- RedefinableElement with isLeaf=false is merged with a matching
-- RedefinableElement with isLeaf=true: the resulting RedefinableElement
-- will have isLeaf=false. Default value is false.
overriding function Get_Redefined_Element
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Redefinable_Elements.Collections.Set_Of_UML_Redefinable_Element;
-- Getter of RedefinableElement::redefinedElement.
--
-- The redefinable element that is being redefined by this element.
overriding function Get_Redefinition_Context
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier;
-- Getter of RedefinableElement::redefinitionContext.
--
-- References the contexts that this element may be redefined from.
overriding function Get_Client_Dependency
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency;
-- Getter of NamedElement::clientDependency.
--
-- Indicates the dependencies that reference the client.
overriding function Get_Name_Expression
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.String_Expressions.UML_String_Expression_Access;
-- Getter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding procedure Set_Name_Expression
(Self : not null access UML_Call_Operation_Action_Proxy;
To : AMF.UML.String_Expressions.UML_String_Expression_Access);
-- Setter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding function Get_Namespace
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Getter of NamedElement::namespace.
--
-- Specifies the namespace that owns the NamedElement.
overriding function Get_Qualified_Name
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.Optional_String;
-- Getter of NamedElement::qualifiedName.
--
-- A name which allows the NamedElement to be identified within a
-- hierarchy of nested Namespaces. It is constructed from the names of the
-- containing namespaces starting at the root of the hierarchy and ending
-- with the name of the NamedElement itself.
overriding function Context
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Classifiers.UML_Classifier_Access;
-- Operation Action::context.
--
-- Missing derivation for Action::/context : Classifier
overriding function Is_Consistent_With
(Self : not null access constant UML_Call_Operation_Action_Proxy;
Redefinee : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean;
-- Operation RedefinableElement::isConsistentWith.
--
-- The query isConsistentWith() specifies, for any two RedefinableElements
-- in a context in which redefinition is possible, whether redefinition
-- would be logically consistent. By default, this is false; this
-- operation must be overridden for subclasses of RedefinableElement to
-- define the consistency conditions.
overriding function Is_Redefinition_Context_Valid
(Self : not null access constant UML_Call_Operation_Action_Proxy;
Redefined : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean;
-- Operation RedefinableElement::isRedefinitionContextValid.
--
-- The query isRedefinitionContextValid() specifies whether the
-- redefinition contexts of this RedefinableElement are properly related
-- to the redefinition contexts of the specified RedefinableElement to
-- allow this element to redefine the other. By default at least one of
-- the redefinition contexts of this element must be a specialization of
-- at least one of the redefinition contexts of the specified element.
overriding function All_Owning_Packages
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Packages.Collections.Set_Of_UML_Package;
-- Operation NamedElement::allOwningPackages.
--
-- The query allOwningPackages() returns all the directly or indirectly
-- owning packages.
overriding function Is_Distinguishable_From
(Self : not null access constant UML_Call_Operation_Action_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access;
Ns : AMF.UML.Namespaces.UML_Namespace_Access)
return Boolean;
-- Operation NamedElement::isDistinguishableFrom.
--
-- The query isDistinguishableFrom() determines whether two NamedElements
-- may logically co-exist within a Namespace. By default, two named
-- elements are distinguishable if (a) they have unrelated types or (b)
-- they have related types but different names.
overriding function Namespace
(Self : not null access constant UML_Call_Operation_Action_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Operation NamedElement::namespace.
--
-- Missing derivation for NamedElement::/namespace : Namespace
overriding procedure Enter_Element
(Self : not null access constant UML_Call_Operation_Action_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Leave_Element
(Self : not null access constant UML_Call_Operation_Action_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Visit_Element
(Self : not null access constant UML_Call_Operation_Action_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of iterator interface.
end AMF.Internals.UML_Call_Operation_Actions;
| 47.143488 | 106 | 0.699195 |
5847c1f015300e276348098bcf5d2fa5c3650860 | 20,960 | adb | Ada | unicode-ucd-generate_general_category_body.adb | annexi-strayline/ASAP-Unicode | a34b52c41378c3cfe777e59bfee634caa64767d6 | [
"BSD-3-Clause"
] | 1 | 2021-11-08T01:20:55.000Z | 2021-11-08T01:20:55.000Z | unicode-ucd-generate_general_category_body.adb | annexi-strayline/ASAP-Unicode | a34b52c41378c3cfe777e59bfee634caa64767d6 | [
"BSD-3-Clause"
] | null | null | null | unicode-ucd-generate_general_category_body.adb | annexi-strayline/ASAP-Unicode | a34b52c41378c3cfe777e59bfee634caa64767d6 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Unicode Utilities --
-- --
-- Unicode Character Database (UCD) Facilities --
-- --
-- ------------------------------------------------------------------------ --
-- --
-- Copyright (C) 2019, ANNEXI-STRAYLINE Trans-Human Ltd. --
-- All rights reserved. --
-- --
-- Original Contributors: --
-- * Richard Wai (ANNEXI-STRAYLINE) --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- --
-- * Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A --
-- PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with Ada.Unchecked_Deallocation;
with Ada.Characters.Latin_1;
with Ada.Streams.Stream_IO;
with Hex;
with Hex.Unsigned_8;
with Hex.Unsigned_24;
with Unicode.General_Category; use Unicode.General_Category;
with Unicode.General_Category.Alias;
procedure Unicode.UCD.Generate_General_Category_Body
(UnicodeData_Path: in String := "UnicodeData.txt";
Body_Path : in String := "aura-unicode-general_category.adb")
is
package SIO renames Ada.Streams.Stream_IO;
package GC_Alias renames Unicode.General_Category.Alias;
subtype Set_Case is Hex.Set_Case;
use all type Set_Case;
subtype General_Category_Type
is Unicode.General_Category.General_Category_Type;
use all type General_Category_Type;
-- Codepoint Value (0 - 16#10FFFF#, (up to FFFFFF is fine also in this
-- implementation)
use type Hex.Unsigned_24.Unsigned_24;
subtype Codepoint_Value is Hex.Unsigned_24.Unsigned_24;
procedure Encode_Codepoint (Value : in Codepoint_Value;
Buffer : out String;
Use_Case: in Set_Case := Upper_Case)
renames Hex.Unsigned_24.Encode;
-- Hash Key
use type Hex.Unsigned_8.Unsigned_8;
subtype Key_Hash is Hex.Unsigned_8.Unsigned_8
range 0 .. 16#10#;
procedure Encode_Hash (Value : in Key_Hash;
Buffer : out String;
Use_Case: in Set_Case := Upper_Case)
renames Hex.Unsigned_8.Encode;
-- Reference Hash Table ----------------------------------------------------
type Bucket_Item;
type Bucket_Item_Access is access Bucket_Item;
type Codepoint_Range is
record
First: Codepoint_Value;
Last : Codepoint_Value;
end record;
type Bucket_Item is
record
Codepoints: Codepoint_Range;
Category : General_Category_Type;
Next : Bucket_Item_Access := null;
end record;
procedure Free is new Ada.Unchecked_Deallocation
(Object => Bucket_Item,
Name => Bucket_Item_Access);
type Bucket is
record
First, Last: Bucket_Item_Access := null;
end record;
type Hash_Table is array (Key_Hash) of Bucket;
----------------------
-- Deallocate_Table --
----------------------
procedure Deallocate_Table (Table: in out Hash_Table) is
I,N: Bucket_Item_Access;
begin
for B of Table loop
I := B.First;
while I /= null loop
N := I.Next;
Free (I);
I := N;
end loop;
B.First := null;
B.Last := null;
end loop;
end Deallocate_Table;
----------
-- Hash --
----------
-- Numerous approaches were tried, but simply going by Unicode planes as the
-- hash keeps the rages as cohesive as possible (no wonder)
function Hash (Codepoint: Codepoint_Value) return Key_Hash
is (Key_Hash (Codepoint / 16#1_0000#))
with Inline;
-----------------
-- Append_Item --
-----------------
procedure Append_Item (To : in out Bucket;
Codepoint: in Codepoint_Value;
Category : in General_Category_Type)
with Inline is
New_Item: Bucket_Item_Access
:= new Bucket_Item'
(Codepoints => (others => Codepoint),
Category => Category,
Next => null);
begin
if To.First = null then
To.First := New_Item;
To.Last := New_Item;
else
To.Last.Next := New_Item;
To.Last := New_Item;
end if;
end Append_Item;
-- UnicodeData.txt Parsing -------------------------------------------------
type UnicodeData_Range is (First, Last, Single);
--------------------------
-- Identify_Point_Range --
--------------------------
-- UnicodeData.txt encodes codepoint ranges unusually. Instead of having a
-- range in Property 0 (P0), it has a special tag in P1, where the tag is
-- in angle brackets, and always ends with either ", First>" or, ", Last>".
--
-- This subprogram gives a quick answer to for each entry
function Identify_Point_Range (E: UCD_Entry) return UnicodeData_Range
with Inline is
P1: constant String := E.Property(1);
P_First: constant String := ", First>";
P_Last : constant String := ", Last>";
begin
if P1(P1'Last) = '>'
and then P1'Length >= P_First'Length
then
if P1(P1'Last - P_First'Length + 1 .. P1'Last) = P_First then
return First;
elsif P1(P1'Last - P_Last'Length + 1 .. P1'Last) = P_Last then
return Last;
else
return Single;
end if;
else
return Single;
end if;
end Identify_Point_Range;
----------------
-- Load_Table --
----------------
-- Parses the UnicodeData.txt file and loads the data into the hash table,
-- including filling in any ranges encountered
procedure Load_Table (File : in SIO.File_Type;
Table: in out Hash_Table;
Total: out Natural)
is
E: UCD_Entry;
Stream: constant SIO.Stream_Access := SIO.Stream (File);
Codepoint: Codepoint_Value;
Category : General_Category_Type;
pragma Assertion_Policy (Check);
begin
Total := 0;
while not SIO.End_Of_File (File) loop
E := Next_Entry (Stream);
pragma Assert (E.First_Codepoint = E.Last_Codepoint);
-- If this fails, the data is either bad, or Unicode changed the
-- format, either way we wouldn't handle this properly, since
-- we're expecting ranges to be expressed via P1
Codepoint := Codepoint_Value
(Wide_Wide_Character'Pos (E.First_Codepoint));
Category := GC_Alias.Category_By_Alias (E.Property(2));
Append_Item (To => Table(Hash (Codepoint)),
Codepoint => Codepoint,
Category => Category);
Total := Total + 1;
-- Check for a range and add those too
if Identify_Point_Range (E) = First then
declare
Start, Finish: Codepoint_Value;
begin
Start := Codepoint_Value
(Wide_Wide_Character'Pos
(Wide_Wide_Character'Succ (E.First_Codepoint)));
-- The next entry had better be a "Last" range
E := Next_Entry (Stream);
pragma Assert (Identify_Point_Range (E) = Last);
Finish := Codepoint_Value
(Wide_Wide_Character'Pos (E.First_Codepoint));
for C in Start .. Finish loop
Append_Item (To => Table(Hash (C)),
Codepoint => C,
Category => Category);
Total := Total + 1;
end loop;
end;
end if;
end loop;
end Load_Table;
---------------------
-- Collapse_Ranges --
---------------------
-- Scans each bucket of contiguous ranges of the same category and collapses
-- them into single entries
procedure Collapse_Ranges (Table: in out Hash_Table) is
begin
for K in Key_Hash loop
declare
B: Bucket renames Table(K);
Base : Bucket_Item_Access := B.First;
Reach: Bucket_Item_Access;
begin
while Base /= null loop
Reach := Base.Next;
while Reach /= null loop
exit when
(Reach.Category /= Base.category
or else (Reach.Codepoints.First
/= (Base.Codepoints.Last + 1)));
-- Absorb Reach
Base.Codepoints.Last := Reach.Codepoints.Last;
-- Isolate & Free Reach
Base.Next := Reach.Next;
Free (Reach);
Reach := Base.Next;
end loop;
Base := Reach;
end loop;
end;
end loop;
end Collapse_Ranges;
-- Main --------------------------------------------------------------------
UnicodeData: SIO.File_Type;
Ada_File : SIO.File_Type;
Ada_Stream : SIO.Stream_Access;
Table: Hash_Table;
Loaded_Codepoints: Natural;
-- Formatting
Tab : constant String := (1 .. 3 => ' ');
New_Line_Sequence: constant String := (1 => Ada.Characters.Latin_1.LF);
Indent: Natural := 0;
procedure Put (S: in String) with Inline is
begin
String'Write (Ada_Stream, S);
end Put;
procedure Do_Indent with Inline is
begin
for I in 1 .. Indent loop
Put (Tab);
end loop;
end Do_Indent;
procedure Put_Line (S: in String) with Inline is
begin
Do_Indent;
Put (S & New_Line_Sequence);
end Put_Line;
procedure New_Line (Count: Natural := 1) with Inline is
begin
for I in 1 .. Count loop
Put (New_Line_Sequence);
end loop;
end New_Line;
begin
declare
use SIO;
begin
Open (File => UnicodeData,
Mode => In_File,
Name => UnicodeData_Path);
end;
Load_Table (File => UnicodeData,
Table => Table,
Total => Loaded_Codepoints);
SIO.Close (UnicodeData);
-- Let's get to it
SIO.Create (File => Ada_File,
Name => Body_Path);
Ada_Stream := SIO.Stream (Ada_File);
-- Some stats
Put_Line ("-- ******* "
& "THIS FILE IS AUTOMATICALLY GENERATED "
& "******* --");
Put_Line ("-- "
& "- See Unicode.UCD.Generate_General_Category_Body -"
& " --");
New_Line (2);
Put_Line ("-- UnicodeData.txt Load Statistics --");
declare
Totals: array (General_Category_Type) of Natural := (others => 0);
Loaded_Calc: Natural := 0;
Grand_Total: Natural := 0;
I: Bucket_Item_Access;
begin
for B of Table loop
I := B.First;
while I /= null loop
Totals(I.Category) := Totals(I.Category) + 1;
I := I.Next;
end loop;
end loop;
-- Confirm our totals
for N of Totals loop
Loaded_Calc := Loaded_Calc + N;
end loop;
-- UnicodeData.txt does not contain "Other_Not_Assigned (Cn)"
-- so we need to calculate it ourselves
Totals(Other_Not_Assigned) := 16#110000# - Loaded_Calc;
for N of Totals loop
Grand_Total := Grand_Total + N;
end loop;
declare
Target_Length: constant := 26;
begin
for C in General_Category_Type loop
declare
C_Image: constant String := General_Category_Type'Image (C);
Padding: constant String(1 .. (Target_Length - C_Image'Length))
:= (others => ' ');
begin
Put_Line ("-- " & C_Image
& Padding
& '(' & GC_Alias.General_Category_Aliases(C)
& ") ="
& Natural'Image (Totals(C)));
end;
end loop;
declare
GT: constant String := "Grand Total";
Padding: constant String(1 .. (Target_Length - GT'Length))
:= (others => ' ');
begin
Put_Line (String'(1 .. Target_Length + 20 => '-'));
Put_Line ("-- " & GT & Padding & " ="
& Natural'Image(Grand_Total));
end;
end;
Put_Line ("--");
Put_Line ("-- Sanity Checks --");
if Grand_Total = 16#110000# then
Put ("-- [PASS] ");
else
Put ("-- [FAIL] ");
end if;
Put_Line ("Grand total = 16#110000# (U+000000 .. U+10FFFF)");
if Loaded_Codepoints = Loaded_Calc then
Put ("-- [PASS] ");
else
Put ("-- [FAIL] ");
end if;
Put_Line ("Total loaded (" & Natural'Image (Loaded_Codepoints)
& " ) = Hash table totals excluding Cn ("
& Natural'Image (Loaded_Calc)
& " )");
end;
-- Collapse the table
Collapse_Ranges (Table);
-- OK, now lets do the actual file
New_Line (2);
Put_Line ("package body Unicode.General_Category is");
Indent := 1;
-- Types and hash function
Put_Line ("type Codepoint is mod 2**24;");
New_Line;
-- Now we need to insert a function for each plane (bucket) with it's own
-- case statement for all the ranges in that bucket
declare
procedure Generate_Plane_Table (Table: Hash_Table; Key: Key_Hash) is
B: Bucket renames Table(Key);
Hash_Hex: String (1 .. 4);
Plane: String renames Hash_Hex (3 .. 4);
Codepoint_Hex: String (1 .. 6);
I: Bucket_Item_Access := B.First;
begin
Encode_Hash (Value => Key,
Buffer => Hash_Hex);
Indent := 1;
New_Line;
Put_Line ("function Plane_" & Plane
& "_Lookup (C: Codepoint) "
& "return General_Category_Type is");
Indent := 2;
if I = null then
-- Nothing here, this is just a direct return
Put_Line ("(" & General_Category_Type'Image (Other_Not_Assigned)
& ") with Inline;");
return;
end if;
Put_Line ("(case C is");
Indent := 3;
while I /= null loop
Do_Indent;
Put ("when ");
Encode_Codepoint (Value => I.Codepoints.First,
Buffer => Codepoint_Hex);
Put ("16#" & Codepoint_Hex & "# ");
if I.Codepoints.Last > I.Codepoints.First then
Encode_Codepoint (Value => I.Codepoints.Last,
Buffer => Codepoint_Hex);
Put (".. 16#" & Codepoint_Hex & "# ");
else
Put (" " & " " & " ");
end if;
Put ("=> " & General_Category_Type'Image (I.Category) & ',');
New_Line;
I := I.Next;
end loop;
New_Line;
Put_Line ("when others => "
& General_Category_Type'Image (Other_Not_Assigned)
& ")");
Indent := 2;
Put_Line ("with Inline;");
end Generate_Plane_Table;
begin
for K in Key_Hash loop
Generate_Plane_Table (Table, K);
end loop;
end;
-- Finally, The actual body for General_Category
Indent := 1;
New_Line (2);
Put_Line ("----------------------");
Put_Line ("-- General_Category --");
Put_Line ("----------------------");
Indent := 1;
Put_Line ("function General_Category (C: Wide_Wide_Character)");
Put_Line (" return General_Category_Type");
Put_Line ("is");
Indent := 2;
Put_Line ("CP: constant Codepoint "
& ":= Codepoint (Wide_Wide_Character'Pos(C));");
Indent := 1;
Put_Line ("begin");
Indent := 2;
Put_Line ("return");
Indent := 3;
Put_Line ("(case CP is");
declare
procedure Generate_Dispatch_Line (Key: Key_Hash) is
Hash_Hex: String (1 .. 4);
Plane: String renames Hash_Hex (3 .. 4);
Start_Hex, End_Hex: String (1 .. 6);
C: Codepoint_Value := ((Codepoint_Value(Key) + 1) * 16#1_0000#) - 1;
begin
Encode_Hash (Value => Key,
Buffer => Hash_Hex);
Encode_Codepoint (Value => C and 16#FF_0000#,
Buffer => Start_Hex);
Encode_Codepoint (Value => C,
Buffer => End_Hex);
Indent := 4;
Put_Line ("when 16#" & Start_Hex
& "# .. "
& "16#" & End_Hex
& "# => "
& "Plane_" & Plane & "_Lookup (CP),");
end Generate_Dispatch_Line;
begin
for K in Key_Hash loop
Generate_Dispatch_Line (K);
end loop;
New_Line;
Put_Line ("when others => "
& General_Category_Type'Image (Other_Not_Assigned)
& ");");
end;
Indent := 1;
Put_Line ("end General_Category;");
Indent := 0;
New_Line;
Put_Line ("end Unicode.General_Category;");
SIO.Close (Ada_File);
Deallocate_Table (Table);
exception
when others =>
Deallocate_Table (Table);
SIO.Close (UnicodeData);
SIO.Close (Ada_File);
raise;
end Unicode.UCD.Generate_General_Category_Body;
| 32.04893 | 79 | 0.482777 |
228cf2b9c5cf6bc43adbbedf0a1caf7b84d3c73b | 2,968 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-except.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-except.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-except.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . E X C E P T I O N S --
-- --
-- B o d y --
-- --
-- Copyright (C) 2006-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 does not require a body, since it is a package renaming. We
-- provide a dummy file containing a No_Body pragma so that previous versions
-- of the body (which did exist) will not interfere.
-- pragma No_Body;
-- The above pragma is commented out, since for now we can't use No_Body in
-- a unit marked as a Compiler_Unit, since this requires GNAT 6.1, and we
-- do not yet require this for bootstrapping. So instead we use a dummy Taft
-- amendment type to require the body:
package body System.Exceptions is
type Require_Body is new Integer;
end System.Exceptions;
| 64.521739 | 78 | 0.443059 |
570e6472eca2dd71a15ca16639df35120ca80cae | 13,362 | adb | Ada | memsim-master/src/memory-transform.adb | strenkml/EE368 | 00f15bce9e65badddc613355643b1061fd4a8195 | [
"MIT"
] | null | null | null | memsim-master/src/memory-transform.adb | strenkml/EE368 | 00f15bce9e65badddc613355643b1061fd4a8195 | [
"MIT"
] | null | null | null | memsim-master/src/memory-transform.adb | strenkml/EE368 | 00f15bce9e65badddc613355643b1061fd4a8195 | [
"MIT"
] | null | null | null |
with Device; use Device;
with Memory.Container; use Memory.Container;
with Memory.Join; use Memory.Join;
package body Memory.Transform is
procedure Process(mem : in out Transform_Type;
address : in Address_Type;
size : in Address_Type;
dir : in Boolean;
is_read : in Boolean) is
abits : constant Positive := Get_Address_Bits;
mask : constant Address_Type := Address_Type(2) ** abits - 1;
start : Address_Type := address;
trans : Address_Type := Apply(Transform_Type'Class(mem), start, dir);
total : Address_Type := 0;
incr : Address_Type;
nsize : Address_Type;
last : Address_Type;
temp : Address_Type;
begin
trans := trans and mask;
incr := Address_Type(Get_Alignment(Transform_Type'Class(mem)));
while (address mod incr) /= 0 loop
incr := incr / 2;
end loop;
while total < size loop
-- Determine how big we can make the current access.
last := trans;
nsize := Address_Type'Min(size - total, incr);
while total + nsize < size loop
temp := Apply(Transform_Type'Class(mem), start + nsize, dir);
temp := temp and mask;
exit when ((last + nsize) and mask) /= temp;
nsize := Address_Type'Min(size - total, nsize + incr);
end loop;
-- Perform the access.
if dir and mem.bank /= null then
if is_read then
Read(mem.bank.all, trans, Natural(nsize));
else
Write(mem.bank.all, trans, Natural(nsize));
end if;
else
if is_read then
Read(Container_Type(mem), trans, Natural(nsize));
else
Write(Container_Type(mem), trans, Natural(nsize));
end if;
end if;
total := total + nsize;
start := start + nsize;
trans := temp;
end loop;
end Process;
procedure Set_Value(mem : in out Transform_Type;
value : in Long_Integer) is
begin
mem.value := value;
end Set_Value;
function Get_Value(mem : Transform_Type) return Long_Integer is
begin
return mem.value;
end Get_Value;
function Get_Bank(mem : Transform_Type) return Memory_Pointer is
begin
return Memory_Pointer(mem.bank);
end Get_Bank;
procedure Set_Bank(mem : in out Transform_Type;
bank : access Memory_Type'Class) is
begin
mem.bank := bank;
end Set_Bank;
procedure Reset(mem : in out Transform_Type;
context : in Natural) is
begin
Reset(Container_Type(mem), context);
if mem.bank /= null then
Reset(mem.bank.all, context);
end if;
end Reset;
procedure Read(mem : in out Transform_Type;
address : in Address_Type;
size : in Positive) is
start : Time_Type;
begin
if mem.bank /= null then
start := Get_Time(mem.bank.all);
Process(mem, address, Address_Type(size), True, True);
Advance(mem, Get_Time(mem.bank.all) - start);
else
Process(mem, address, Address_Type(size), True, True);
end if;
end Read;
procedure Write(mem : in out Transform_Type;
address : in Address_Type;
size : in Positive) is
start : Time_Type;
begin
if mem.bank /= null then
start := Get_Time(mem.bank.all);
Process(mem, address, Address_Type(size), True, False);
Advance(mem, Get_Time(mem.bank.all) - start);
else
Process(mem, address, Address_Type(size), True, False);
end if;
end Write;
procedure Forward_Read(mem : in out Transform_Type;
source : in Natural;
address : in Address_Type;
size : in Positive) is
begin
Process(mem, address, Address_Type(size), False, True);
end Forward_Read;
procedure Forward_Write(mem : in out Transform_Type;
source : in Natural;
address : in Address_Type;
size : in Positive) is
begin
Process(mem, address, Address_Type(size), False, False);
end Forward_Write;
procedure Forward_Idle(mem : in out Transform_Type;
source : in Natural;
cycles : in Time_Type) is
begin
Idle(Container_Type(mem), cycles);
end Forward_Idle;
function Forward_Get_Time(mem : Transform_Type) return Time_Type is
begin
return Get_Time(Container_Type(mem));
end Forward_Get_Time;
function Get_Join_Length(mem : Transform_Type) return Natural is
begin
return Get_Transform_Length(Transform_Type'Class(mem));
end Get_Join_Length;
function Get_Cost(mem : Transform_Type) return Cost_Type is
result : Cost_Type := Get_Cost(Container_Type(mem));
begin
if mem.bank /= null then
result := result + Get_Cost(mem.bank.all);
end if;
return result;
end Get_Cost;
function Is_Empty(mem : Transform_Type) return Boolean is
begin
return False;
end Is_Empty;
function Get_Alignment(mem : Transform_Type) return Positive is
begin
return 1;
end Get_Alignment;
function To_String(mem : Transform_Type) return Unbounded_String is
result : Unbounded_String;
begin
Append(result, "(" & Get_Name(Transform_Type'Class(mem)) & " ");
if mem.value /= 0 then
Append(result, "(value " & To_String(mem.value) & ")");
end if;
if mem.bank /= null then
Append(result, "(bank ");
Append(result, To_String(To_String(mem.bank.all)));
Append(result, ")");
end if;
Append(result, "(memory ");
Append(result, To_String(Container_Type(mem)));
Append(result, ")");
Append(result, ")");
return result;
end To_String;
procedure Generate_Simple(mem : in Transform_Type;
sigs : in out Unbounded_String;
code : in out Unbounded_String) is
word_bits : constant Natural := 8 * Get_Word_Size(mem);
other : constant Memory_Pointer := Get_Memory(mem);
name : constant String := "m" & To_String(Get_ID(mem));
oname : constant String := "m" & To_String(Get_ID(other.all));
tname : constant String := Get_Name(Transform_Type'Class(mem));
value : constant Long_Integer := mem.value;
begin
Generate(other.all, sigs, code);
Declare_Signals(sigs, name, word_bits);
-- Transform into the bank.
Line(code, name & "_inst : entity work." & tname);
Line(code, " generic map (");
Line(code, " ADDR_WIDTH => ADDR_WIDTH,");
Line(code, " WORD_WIDTH => " & To_String(word_bits) & ",");
Line(code, " VALUE => " & To_String(value));
Line(code, " )");
Line(code, " port map (");
Line(code, " clk => clk,");
Line(code, " rst => rst,");
Line(code, " addr => " & name & "_addr,");
Line(code, " din => " & name & "_din,");
Line(code, " dout => " & name & "_dout,");
Line(code, " re => " & name & "_re,");
Line(code, " we => " & name & "_we,");
Line(code, " mask => " & name & "_mask,");
Line(code, " ready => " & name & "_ready,");
Line(code, " maddr => " & oname & "_addr,");
Line(code, " min => " & oname & "_dout,");
Line(code, " mout => " & oname & "_din,");
Line(code, " mre => " & oname & "_re,");
Line(code, " mwe => " & oname & "_we,");
Line(code, " mmask => " & oname & "_mask,");
Line(code, " mready => " & oname & "_ready");
Line(code, " );");
end Generate_Simple;
procedure Generate_Banked(mem : in Transform_Type;
sigs : in out Unbounded_String;
code : in out Unbounded_String) is
word_bits : constant Natural := 8 * Get_Word_Size(mem);
bank : constant Memory_Pointer := Get_Bank(mem);
join : constant Join_Pointer := Find_Join(bank);
other : constant Memory_Pointer := Get_Memory(mem);
name : constant String := "m" & To_String(Get_ID(mem));
bname : constant String := "m" & To_String(Get_ID(bank.all));
oname : constant String := "m" & To_String(Get_ID(other.all));
jname : constant String := "m" & To_String(Get_ID(join.all));
tname : constant String := Get_Name(Transform_Type'Class(mem));
value : constant Long_Integer := mem.value;
begin
Generate(other.all, sigs, code);
Generate(bank.all, sigs, code);
Declare_Signals(sigs, name, word_bits);
-- Transform into the bank.
Line(code, name & "_inst : entity work." & tname);
Line(code, " generic map (");
Line(code, " ADDR_WIDTH => ADDR_WIDTH,");
Line(code, " WORD_WIDTH => " & To_String(word_bits) & ",");
Line(code, " VALUE => " & To_String(value));
Line(code, " )");
Line(code, " port map (");
Line(code, " clk => clk,");
Line(code, " rst => rst,");
Line(code, " addr => " & name & "_addr,");
Line(code, " din => " & name & "_din,");
Line(code, " dout => " & name & "_dout,");
Line(code, " re => " & name & "_re,");
Line(code, " we => " & name & "_we,");
Line(code, " mask => " & name & "_mask,");
Line(code, " ready => " & name & "_ready,");
Line(code, " maddr => " & bname & "_addr,");
Line(code, " min => " & bname & "_dout,");
Line(code, " mout => " & bname & "_din,");
Line(code, " mre => " & bname & "_re,");
Line(code, " mwe => " & bname & "_we,");
Line(code, " mmask => " & bname & "_mask,");
Line(code, " mready => " & bname & "_ready");
Line(code, " );");
-- Transform out of the bank.
Line(code, jname & "_inst : entity work." & tname);
Line(code, " generic map (");
Line(code, " ADDR_WIDTH => ADDR_WIDTH,");
Line(code, " WORD_WIDTH => " & To_String(word_bits) & ",");
Line(code, " VALUE => " & To_String(-value));
Line(code, " )");
Line(code, " port map (");
Line(code, " clk => clk,");
Line(code, " rst => rst,");
Line(code, " addr => " & jname & "_addr,");
Line(code, " din => " & jname & "_din,");
Line(code, " dout => " & jname & "_dout,");
Line(code, " re => " & jname & "_re,");
Line(code, " we => " & jname & "_we,");
Line(code, " mask => " & jname & "_mask,");
Line(code, " ready => " & jname & "_ready,");
Line(code, " maddr => " & oname & "_addr,");
Line(code, " min => " & oname & "_dout,");
Line(code, " mout => " & oname & "_din,");
Line(code, " mre => " & oname & "_re,");
Line(code, " mwe => " & oname & "_we,");
Line(code, " mmask => " & oname & "_mask,");
Line(code, " mready => " & oname & "_ready");
Line(code, " );");
end Generate_Banked;
procedure Generate(mem : in Transform_Type;
sigs : in out Unbounded_String;
code : in out Unbounded_String) is
begin
if mem.bank /= null then
Generate_Banked(mem, sigs, code);
else
Generate_Simple(mem, sigs, code);
end if;
end Generate;
function Get_Path_Length(mem : Transform_Type) return Natural is
len : Natural := Get_Transform_Length(Transform_Type'Class(mem));
begin
if mem.bank /= null then
len := len + Get_Path_Length(mem.bank.all);
else
len := len + Get_Path_Length(Container_Type(mem));
end if;
return len;
end Get_Path_Length;
procedure Adjust(mem : in out Transform_Type) is
jp : Join_Pointer;
cp : Container_Pointer;
ptr : Memory_Pointer;
begin
Adjust(Container_Type(mem));
if mem.bank /= null then
mem.bank := Clone(mem.bank.all);
ptr := Memory_Pointer(mem.bank);
loop
if ptr.all in Join_Type'Class then
jp := Join_Pointer(ptr);
Set_Parent(jp.all, mem'Unchecked_Access);
exit;
else
cp := Container_Pointer(ptr);
ptr := Get_Memory(cp.all);
end if;
end loop;
end if;
end Adjust;
procedure Finalize(mem : in out Transform_Type) is
begin
Destroy(Memory_Pointer(mem.bank));
Finalize(Container_Type(mem));
end Finalize;
end Memory.Transform;
| 36.708791 | 78 | 0.521329 |
22e9648d89b86b0aa808ba1873e40de8817b239c | 4,070 | adb | Ada | src/interfaces_cpp.strings.adb | zackboll/interfaces.cpp | e1cc399acd7cf0c0c2a99a4034a19bb6786d50ce | [
"BSD-2-Clause"
] | null | null | null | src/interfaces_cpp.strings.adb | zackboll/interfaces.cpp | e1cc399acd7cf0c0c2a99a4034a19bb6786d50ce | [
"BSD-2-Clause"
] | null | null | null | src/interfaces_cpp.strings.adb | zackboll/interfaces.cpp | e1cc399acd7cf0c0c2a99a4034a19bb6786d50ce | [
"BSD-2-Clause"
] | null | null | null | -- BSD 2-Clause License
--
-- Copyright (c) 2017, Zack Boll
-- 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.
--
-- 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 Interfaces.C.Extensions; use Interfaces.C.Extensions;
with Interfaces.C.Strings; use Interfaces.C.Strings;
with Interfaces.C; use Interfaces.C;
package body Interfaces_CPP.Strings is
--
-- Thin bindings to C layer std::string
--
function CPP_Empty_String_Constructor return CPP_String_External;
pragma Import (C, CPP_Empty_String_Constructor,
"Interfaces_CPP_Empty_String_Constructor");
function CPP_Copy_String (Input: CPP_String_External)
return CPP_String_External;
pragma Import (C, CPP_Copy_String, "Interfaces_CPP_Copy_String");
procedure CPP_Delete_String (Input: CPP_String_External);
pragma Import (C, CPP_Delete_String, "Interfaces_CPP_Delete_String");
function CPP_To_C_String (Input: CPP_String_External)
return Interfaces.C.Strings.chars_ptr;
pragma Import (C, CPP_To_C_String, "Interfaces_CPP_To_C_String");
procedure C_To_CPP_String (Src: Interfaces.C.Strings.chars_ptr;
Dst: CPP_String_External);
pragma Import (C, C_To_CPP_String, "Interfaces_CPP_To_CPP_String");
-------------------------------------------------------------------------
procedure Initialize (Object : in out CPP_String) is
begin
--
-- Allocate empty string
--
Object.cpp_str := CPP_Empty_String_Constructor;
end Initialize;
procedure Adjust (Object : in out CPP_String) is
begin
Object.cpp_str := CPP_Copy_String (Object.cpp_str);
end Adjust;
procedure Finalize (Object : in out CPP_String) is
begin
CPP_Delete_String (Object.cpp_str);
end Finalize;
function To_Ada (Input: Interfaces.C.Strings.chars_ptr) return String is
begin
return Interfaces.C.Strings.Value (Input);
end To_Ada;
function To_Ada (Object: CPP_String) return String is
begin
return To_Ada (CPP_To_C_String (Object.cpp_str));
end To_Ada;
function To_Ada (External: CPP_String_External) return String is
begin
return To_Ada (CPP_To_C_String (External));
end To_Ada;
function To_CPP (Input: String) return CPP_String is
c_string : aliased Interfaces.C.char_array := To_C (Input);
--
-- :TODO This should probably be done better but wanted to avoid another
-- dynamic memory allocationi
--
c_string_ptr : chars_ptr := To_Chars_Ptr (c_string'Unrestricted_Access);
Object : CPP_String;
begin
C_To_CPP_String (Src => c_string_ptr, Dst => Object.cpp_str);
return Object;
end To_CPP;
function To_CPP_External (Input: CPP_String) return CPP_String_External is
begin
return Input.cpp_str;
end To_CPP_External;
end Interfaces_CPP.Strings;
| 29.926471 | 78 | 0.724079 |
3d153a5474f3fa6a5c4f70c867fab42387d83215 | 93,902 | ads | Ada | SVD2ada/svd/stm32_svd-tim.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | SVD2ada/svd/stm32_svd-tim.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | SVD2ada/svd/stm32_svd-tim.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | pragma Style_Checks (Off);
-- This spec has been automatically generated from STM32F3x4.svd
pragma Restrictions (No_Elaboration_Code);
with HAL;
with System;
package STM32_SVD.TIM is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype CR1_CMS_Field is HAL.UInt2;
subtype CR1_CKD_Field is HAL.UInt2;
-- control register 1
type CR1_Register is record
-- Counter enable
CEN : Boolean := False;
-- Update disable
UDIS : Boolean := False;
-- Update request source
URS : Boolean := False;
-- One-pulse mode
OPM : Boolean := False;
-- Direction
DIR : Boolean := False;
-- Center-aligned mode selection
CMS : CR1_CMS_Field := 16#0#;
-- Auto-reload preload enable
ARPE : Boolean := False;
-- Clock division
CKD : CR1_CKD_Field := 16#0#;
-- unspecified
Reserved_10_10 : HAL.Bit := 16#0#;
-- UIF status bit remapping
UIFREMAP : Boolean := False;
-- unspecified
Reserved_12_31 : HAL.UInt20 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CR1_Register use record
CEN at 0 range 0 .. 0;
UDIS at 0 range 1 .. 1;
URS at 0 range 2 .. 2;
OPM at 0 range 3 .. 3;
DIR at 0 range 4 .. 4;
CMS at 0 range 5 .. 6;
ARPE at 0 range 7 .. 7;
CKD at 0 range 8 .. 9;
Reserved_10_10 at 0 range 10 .. 10;
UIFREMAP at 0 range 11 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
subtype CR2_MMS_Field is HAL.UInt3;
subtype CR2_MMS2_Field is HAL.UInt4;
-- control register 2
type CR2_Register is record
-- Capture/compare preloaded control
CCPC : Boolean := False;
-- unspecified
Reserved_1_1 : HAL.Bit := 16#0#;
-- Capture/compare control update selection
CCUS : Boolean := False;
-- Capture/compare DMA selection
CCDS : Boolean := False;
-- Master mode selection
MMS : CR2_MMS_Field := 16#0#;
-- TI1 selection
TI1S : Boolean := False;
-- Output Idle state 1
OIS1 : Boolean := False;
-- Output Idle state 1
OIS1N : Boolean := False;
-- Output Idle state 2
OIS2 : Boolean := False;
-- Output Idle state 2
OIS2N : Boolean := False;
-- Output Idle state 3
OIS3 : Boolean := False;
-- Output Idle state 3
OIS3N : Boolean := False;
-- Output Idle state 4
OIS4 : Boolean := False;
-- unspecified
Reserved_15_15 : HAL.Bit := 16#0#;
-- Output Idle state 5
OIS5 : Boolean := False;
-- unspecified
Reserved_17_17 : HAL.Bit := 16#0#;
-- Output Idle state 6
OIS6 : Boolean := False;
-- unspecified
Reserved_19_19 : HAL.Bit := 16#0#;
-- Master mode selection 2
MMS2 : CR2_MMS2_Field := 16#0#;
-- unspecified
Reserved_24_31 : HAL.UInt8 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CR2_Register use record
CCPC at 0 range 0 .. 0;
Reserved_1_1 at 0 range 1 .. 1;
CCUS at 0 range 2 .. 2;
CCDS at 0 range 3 .. 3;
MMS at 0 range 4 .. 6;
TI1S at 0 range 7 .. 7;
OIS1 at 0 range 8 .. 8;
OIS1N at 0 range 9 .. 9;
OIS2 at 0 range 10 .. 10;
OIS2N at 0 range 11 .. 11;
OIS3 at 0 range 12 .. 12;
OIS3N at 0 range 13 .. 13;
OIS4 at 0 range 14 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
OIS5 at 0 range 16 .. 16;
Reserved_17_17 at 0 range 17 .. 17;
OIS6 at 0 range 18 .. 18;
Reserved_19_19 at 0 range 19 .. 19;
MMS2 at 0 range 20 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
subtype SMCR_SMS_Field is HAL.UInt3;
subtype SMCR_TS_Field is HAL.UInt3;
subtype SMCR_ETF_Field is HAL.UInt4;
subtype SMCR_ETPS_Field is HAL.UInt2;
-- slave mode control register
type SMCR_Register is record
-- Slave mode selection
SMS : SMCR_SMS_Field := 16#0#;
-- OCREF clear selection
OCCS : Boolean := False;
-- Trigger selection
TS : SMCR_TS_Field := 16#0#;
-- Master/Slave mode
MSM : Boolean := False;
-- External trigger filter
ETF : SMCR_ETF_Field := 16#0#;
-- External trigger prescaler
ETPS : SMCR_ETPS_Field := 16#0#;
-- External clock enable
ECE : Boolean := False;
-- External trigger polarity
ETP : Boolean := False;
-- Slave mode selection bit 3
SMS_3 : Boolean := False;
-- unspecified
Reserved_17_31 : HAL.UInt15 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SMCR_Register use record
SMS at 0 range 0 .. 2;
OCCS at 0 range 3 .. 3;
TS at 0 range 4 .. 6;
MSM at 0 range 7 .. 7;
ETF at 0 range 8 .. 11;
ETPS at 0 range 12 .. 13;
ECE at 0 range 14 .. 14;
ETP at 0 range 15 .. 15;
SMS_3 at 0 range 16 .. 16;
Reserved_17_31 at 0 range 17 .. 31;
end record;
-- DMA/Interrupt enable register
type DIER_Register is record
-- Update interrupt enable
UIE : Boolean := False;
-- Capture/Compare 1 interrupt enable
CC1IE : Boolean := False;
-- Capture/Compare 2 interrupt enable
CC2IE : Boolean := False;
-- Capture/Compare 3 interrupt enable
CC3IE : Boolean := False;
-- Capture/Compare 4 interrupt enable
CC4IE : Boolean := False;
-- COM interrupt enable
COMIE : Boolean := False;
-- Trigger interrupt enable
TIE : Boolean := False;
-- Break interrupt enable
BIE : Boolean := False;
-- Update DMA request enable
UDE : Boolean := False;
-- Capture/Compare 1 DMA request enable
CC1DE : Boolean := False;
-- Capture/Compare 2 DMA request enable
CC2DE : Boolean := False;
-- Capture/Compare 3 DMA request enable
CC3DE : Boolean := False;
-- Capture/Compare 4 DMA request enable
CC4DE : Boolean := False;
-- COM DMA request enable
COMDE : Boolean := False;
-- Trigger DMA request enable
TDE : Boolean := False;
-- unspecified
Reserved_15_31 : HAL.UInt17 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for DIER_Register use record
UIE at 0 range 0 .. 0;
CC1IE at 0 range 1 .. 1;
CC2IE at 0 range 2 .. 2;
CC3IE at 0 range 3 .. 3;
CC4IE at 0 range 4 .. 4;
COMIE at 0 range 5 .. 5;
TIE at 0 range 6 .. 6;
BIE at 0 range 7 .. 7;
UDE at 0 range 8 .. 8;
CC1DE at 0 range 9 .. 9;
CC2DE at 0 range 10 .. 10;
CC3DE at 0 range 11 .. 11;
CC4DE at 0 range 12 .. 12;
COMDE at 0 range 13 .. 13;
TDE at 0 range 14 .. 14;
Reserved_15_31 at 0 range 15 .. 31;
end record;
-- status register
type SR_Register is record
-- Update interrupt flag
UIF : Boolean := False;
-- Capture/compare 1 interrupt flag
CC1IF : Boolean := False;
-- Capture/Compare 2 interrupt flag
CC2IF : Boolean := False;
-- Capture/Compare 3 interrupt flag
CC3IF : Boolean := False;
-- Capture/Compare 4 interrupt flag
CC4IF : Boolean := False;
-- COM interrupt flag
COMIF : Boolean := False;
-- Trigger interrupt flag
TIF : Boolean := False;
-- Break interrupt flag
BIF : Boolean := False;
-- Break 2 interrupt flag
B2IF : Boolean := False;
-- Capture/Compare 1 overcapture flag
CC1OF : Boolean := False;
-- Capture/compare 2 overcapture flag
CC2OF : Boolean := False;
-- Capture/Compare 3 overcapture flag
CC3OF : Boolean := False;
-- Capture/Compare 4 overcapture flag
CC4OF : Boolean := False;
-- unspecified
Reserved_13_15 : HAL.UInt3 := 16#0#;
-- Capture/Compare 5 interrupt flag
C5IF : Boolean := False;
-- Capture/Compare 6 interrupt flag
C6IF : Boolean := False;
-- unspecified
Reserved_18_31 : HAL.UInt14 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register use record
UIF at 0 range 0 .. 0;
CC1IF at 0 range 1 .. 1;
CC2IF at 0 range 2 .. 2;
CC3IF at 0 range 3 .. 3;
CC4IF at 0 range 4 .. 4;
COMIF at 0 range 5 .. 5;
TIF at 0 range 6 .. 6;
BIF at 0 range 7 .. 7;
B2IF at 0 range 8 .. 8;
CC1OF at 0 range 9 .. 9;
CC2OF at 0 range 10 .. 10;
CC3OF at 0 range 11 .. 11;
CC4OF at 0 range 12 .. 12;
Reserved_13_15 at 0 range 13 .. 15;
C5IF at 0 range 16 .. 16;
C6IF at 0 range 17 .. 17;
Reserved_18_31 at 0 range 18 .. 31;
end record;
-- event generation register
type EGR_Register is record
-- Write-only. Update generation
UG : Boolean := False;
-- Write-only. Capture/compare 1 generation
CC1G : Boolean := False;
-- Write-only. Capture/compare 2 generation
CC2G : Boolean := False;
-- Write-only. Capture/compare 3 generation
CC3G : Boolean := False;
-- Write-only. Capture/compare 4 generation
CC4G : Boolean := False;
-- Write-only. Capture/Compare control update generation
COMG : Boolean := False;
-- Write-only. Trigger generation
TG : Boolean := False;
-- Write-only. Break generation
BG : Boolean := False;
-- Write-only. Break 2 generation
B2G : Boolean := False;
-- unspecified
Reserved_9_31 : HAL.UInt23 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for EGR_Register use record
UG at 0 range 0 .. 0;
CC1G at 0 range 1 .. 1;
CC2G at 0 range 2 .. 2;
CC3G at 0 range 3 .. 3;
CC4G at 0 range 4 .. 4;
COMG at 0 range 5 .. 5;
TG at 0 range 6 .. 6;
BG at 0 range 7 .. 7;
B2G at 0 range 8 .. 8;
Reserved_9_31 at 0 range 9 .. 31;
end record;
subtype CCMR1_Output_CC1S_Field is HAL.UInt2;
subtype CCMR1_Output_OC1M_Field is HAL.UInt3;
subtype CCMR1_Output_CC2S_Field is HAL.UInt2;
subtype CCMR1_Output_OC2M_Field is HAL.UInt3;
-- capture/compare mode register (output mode)
type CCMR1_Output_Register is record
-- Capture/Compare 1 selection
CC1S : CCMR1_Output_CC1S_Field := 16#0#;
-- Output Compare 1 fast enable
OC1FE : Boolean := False;
-- Output Compare 1 preload enable
OC1PE : Boolean := False;
-- Output Compare 1 mode
OC1M : CCMR1_Output_OC1M_Field := 16#0#;
-- Output Compare 1 clear enable
OC1CE : Boolean := False;
-- Capture/Compare 2 selection
CC2S : CCMR1_Output_CC2S_Field := 16#0#;
-- Output Compare 2 fast enable
OC2FE : Boolean := False;
-- Output Compare 2 preload enable
OC2PE : Boolean := False;
-- Output Compare 2 mode
OC2M : CCMR1_Output_OC2M_Field := 16#0#;
-- Output Compare 2 clear enable
OC2CE : Boolean := False;
-- Output Compare 1 mode bit 3
OC1M_3 : Boolean := False;
-- unspecified
Reserved_17_23 : HAL.UInt7 := 16#0#;
-- Output Compare 2 mode bit 3
OC2M_3 : Boolean := False;
-- unspecified
Reserved_25_31 : HAL.UInt7 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCMR1_Output_Register use record
CC1S at 0 range 0 .. 1;
OC1FE at 0 range 2 .. 2;
OC1PE at 0 range 3 .. 3;
OC1M at 0 range 4 .. 6;
OC1CE at 0 range 7 .. 7;
CC2S at 0 range 8 .. 9;
OC2FE at 0 range 10 .. 10;
OC2PE at 0 range 11 .. 11;
OC2M at 0 range 12 .. 14;
OC2CE at 0 range 15 .. 15;
OC1M_3 at 0 range 16 .. 16;
Reserved_17_23 at 0 range 17 .. 23;
OC2M_3 at 0 range 24 .. 24;
Reserved_25_31 at 0 range 25 .. 31;
end record;
subtype CCMR1_Input_CC1S_Field is HAL.UInt2;
subtype CCMR1_Input_IC1PCS_Field is HAL.UInt2;
subtype CCMR1_Input_IC1F_Field is HAL.UInt4;
subtype CCMR1_Input_CC2S_Field is HAL.UInt2;
subtype CCMR1_Input_IC2PCS_Field is HAL.UInt2;
subtype CCMR1_Input_IC2F_Field is HAL.UInt4;
-- capture/compare mode register 1 (input mode)
type CCMR1_Input_Register is record
-- Capture/Compare 1 selection
CC1S : CCMR1_Input_CC1S_Field := 16#0#;
-- Input capture 1 prescaler
IC1PCS : CCMR1_Input_IC1PCS_Field := 16#0#;
-- Input capture 1 filter
IC1F : CCMR1_Input_IC1F_Field := 16#0#;
-- Capture/Compare 2 selection
CC2S : CCMR1_Input_CC2S_Field := 16#0#;
-- Input capture 2 prescaler
IC2PCS : CCMR1_Input_IC2PCS_Field := 16#0#;
-- Input capture 2 filter
IC2F : CCMR1_Input_IC2F_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCMR1_Input_Register use record
CC1S at 0 range 0 .. 1;
IC1PCS at 0 range 2 .. 3;
IC1F at 0 range 4 .. 7;
CC2S at 0 range 8 .. 9;
IC2PCS at 0 range 10 .. 11;
IC2F at 0 range 12 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CCMR2_Output_CC3S_Field is HAL.UInt2;
subtype CCMR2_Output_OC3M_Field is HAL.UInt3;
subtype CCMR2_Output_CC4S_Field is HAL.UInt2;
subtype CCMR2_Output_OC4M_Field is HAL.UInt3;
-- capture/compare mode register (output mode)
type CCMR2_Output_Register is record
-- Capture/Compare 3 selection
CC3S : CCMR2_Output_CC3S_Field := 16#0#;
-- Output compare 3 fast enable
OC3FE : Boolean := False;
-- Output compare 3 preload enable
OC3PE : Boolean := False;
-- Output compare 3 mode
OC3M : CCMR2_Output_OC3M_Field := 16#0#;
-- Output compare 3 clear enable
OC3CE : Boolean := False;
-- Capture/Compare 4 selection
CC4S : CCMR2_Output_CC4S_Field := 16#0#;
-- Output compare 4 fast enable
OC4FE : Boolean := False;
-- Output compare 4 preload enable
OC4PE : Boolean := False;
-- Output compare 4 mode
OC4M : CCMR2_Output_OC4M_Field := 16#0#;
-- Output compare 4 clear enable
OC4CE : Boolean := False;
-- Output Compare 3 mode bit 3
OC3M_3 : Boolean := False;
-- unspecified
Reserved_17_23 : HAL.UInt7 := 16#0#;
-- Output Compare 4 mode bit 3
OC4M_3 : Boolean := False;
-- unspecified
Reserved_25_31 : HAL.UInt7 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCMR2_Output_Register use record
CC3S at 0 range 0 .. 1;
OC3FE at 0 range 2 .. 2;
OC3PE at 0 range 3 .. 3;
OC3M at 0 range 4 .. 6;
OC3CE at 0 range 7 .. 7;
CC4S at 0 range 8 .. 9;
OC4FE at 0 range 10 .. 10;
OC4PE at 0 range 11 .. 11;
OC4M at 0 range 12 .. 14;
OC4CE at 0 range 15 .. 15;
OC3M_3 at 0 range 16 .. 16;
Reserved_17_23 at 0 range 17 .. 23;
OC4M_3 at 0 range 24 .. 24;
Reserved_25_31 at 0 range 25 .. 31;
end record;
subtype CCMR2_Input_CC3S_Field is HAL.UInt2;
subtype CCMR2_Input_IC3PSC_Field is HAL.UInt2;
subtype CCMR2_Input_IC3F_Field is HAL.UInt4;
subtype CCMR2_Input_CC4S_Field is HAL.UInt2;
subtype CCMR2_Input_IC4PSC_Field is HAL.UInt2;
subtype CCMR2_Input_IC4F_Field is HAL.UInt4;
-- capture/compare mode register 2 (input mode)
type CCMR2_Input_Register is record
-- Capture/compare 3 selection
CC3S : CCMR2_Input_CC3S_Field := 16#0#;
-- Input capture 3 prescaler
IC3PSC : CCMR2_Input_IC3PSC_Field := 16#0#;
-- Input capture 3 filter
IC3F : CCMR2_Input_IC3F_Field := 16#0#;
-- Capture/Compare 4 selection
CC4S : CCMR2_Input_CC4S_Field := 16#0#;
-- Input capture 4 prescaler
IC4PSC : CCMR2_Input_IC4PSC_Field := 16#0#;
-- Input capture 4 filter
IC4F : CCMR2_Input_IC4F_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCMR2_Input_Register use record
CC3S at 0 range 0 .. 1;
IC3PSC at 0 range 2 .. 3;
IC3F at 0 range 4 .. 7;
CC4S at 0 range 8 .. 9;
IC4PSC at 0 range 10 .. 11;
IC4F at 0 range 12 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- capture/compare enable register
type CCER_Register is record
-- Capture/Compare 1 output enable
CC1E : Boolean := False;
-- Capture/Compare 1 output Polarity
CC1P : Boolean := False;
-- Capture/Compare 1 complementary output enable
CC1NE : Boolean := False;
-- Capture/Compare 1 output Polarity
CC1NP : Boolean := False;
-- Capture/Compare 2 output enable
CC2E : Boolean := False;
-- Capture/Compare 2 output Polarity
CC2P : Boolean := False;
-- Capture/Compare 2 complementary output enable
CC2NE : Boolean := False;
-- Capture/Compare 2 output Polarity
CC2NP : Boolean := False;
-- Capture/Compare 3 output enable
CC3E : Boolean := False;
-- Capture/Compare 3 output Polarity
CC3P : Boolean := False;
-- Capture/Compare 3 complementary output enable
CC3NE : Boolean := False;
-- Capture/Compare 3 output Polarity
CC3NP : Boolean := False;
-- Capture/Compare 4 output enable
CC4E : Boolean := False;
-- Capture/Compare 3 output Polarity
CC4P : Boolean := False;
-- unspecified
Reserved_14_14 : HAL.Bit := 16#0#;
-- Capture/Compare 4 output Polarity
CC4NP : Boolean := False;
-- Capture/Compare 5 output enable
CC5E : Boolean := False;
-- Capture/Compare 5 output Polarity
CC5P : Boolean := False;
-- unspecified
Reserved_18_19 : HAL.UInt2 := 16#0#;
-- Capture/Compare 6 output enable
CC6E : Boolean := False;
-- Capture/Compare 6 output Polarity
CC6P : Boolean := False;
-- unspecified
Reserved_22_31 : HAL.UInt10 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCER_Register use record
CC1E at 0 range 0 .. 0;
CC1P at 0 range 1 .. 1;
CC1NE at 0 range 2 .. 2;
CC1NP at 0 range 3 .. 3;
CC2E at 0 range 4 .. 4;
CC2P at 0 range 5 .. 5;
CC2NE at 0 range 6 .. 6;
CC2NP at 0 range 7 .. 7;
CC3E at 0 range 8 .. 8;
CC3P at 0 range 9 .. 9;
CC3NE at 0 range 10 .. 10;
CC3NP at 0 range 11 .. 11;
CC4E at 0 range 12 .. 12;
CC4P at 0 range 13 .. 13;
Reserved_14_14 at 0 range 14 .. 14;
CC4NP at 0 range 15 .. 15;
CC5E at 0 range 16 .. 16;
CC5P at 0 range 17 .. 17;
Reserved_18_19 at 0 range 18 .. 19;
CC6E at 0 range 20 .. 20;
CC6P at 0 range 21 .. 21;
Reserved_22_31 at 0 range 22 .. 31;
end record;
subtype CNT_CNT_Field is HAL.UInt16;
-- counter
type CNT_Register is record
-- counter value
CNT : CNT_CNT_Field := 16#0#;
-- unspecified
Reserved_16_30 : HAL.UInt15 := 16#0#;
-- Read-only. UIF copy
UIFCPY : Boolean := False;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CNT_Register use record
CNT at 0 range 0 .. 15;
Reserved_16_30 at 0 range 16 .. 30;
UIFCPY at 0 range 31 .. 31;
end record;
subtype PSC_PSC_Field is HAL.UInt16;
-- prescaler
type PSC_Register is record
-- Prescaler value
PSC : PSC_PSC_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for PSC_Register use record
PSC at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype ARR_ARR_Field is HAL.UInt16;
-- auto-reload register
type ARR_Register is record
-- Auto-reload value
ARR : ARR_ARR_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ARR_Register use record
ARR at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype RCR_REP_Field is HAL.UInt16;
-- repetition counter register
type RCR_Register is record
-- Repetition counter value
REP : RCR_REP_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for RCR_Register use record
REP at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CCR1_CCR1_Field is HAL.UInt16;
-- capture/compare register 1
type CCR1_Register is record
-- Capture/Compare 1 value
CCR1 : CCR1_CCR1_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCR1_Register use record
CCR1 at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CCR2_CCR2_Field is HAL.UInt16;
-- capture/compare register 2
type CCR2_Register is record
-- Capture/Compare 2 value
CCR2 : CCR2_CCR2_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCR2_Register use record
CCR2 at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CCR3_CCR3_Field is HAL.UInt16;
-- capture/compare register 3
type CCR3_Register is record
-- Capture/Compare 3 value
CCR3 : CCR3_CCR3_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCR3_Register use record
CCR3 at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CCR4_CCR4_Field is HAL.UInt16;
-- capture/compare register 4
type CCR4_Register is record
-- Capture/Compare 3 value
CCR4 : CCR4_CCR4_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCR4_Register use record
CCR4 at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype BDTR_DTG_Field is HAL.UInt8;
subtype BDTR_LOCK_Field is HAL.UInt2;
subtype BDTR_BKF_Field is HAL.UInt4;
subtype BDTR_BK2F_Field is HAL.UInt4;
-- break and dead-time register
type BDTR_Register is record
-- Dead-time generator setup
DTG : BDTR_DTG_Field := 16#0#;
-- Lock configuration
LOCK : BDTR_LOCK_Field := 16#0#;
-- Off-state selection for Idle mode
OSSI : Boolean := False;
-- Off-state selection for Run mode
OSSR : Boolean := False;
-- Break enable
BKE : Boolean := False;
-- Break polarity
BKP : Boolean := False;
-- Automatic output enable
AOE : Boolean := False;
-- Main output enable
MOE : Boolean := False;
-- Break filter
BKF : BDTR_BKF_Field := 16#0#;
-- Break 2 filter
BK2F : BDTR_BK2F_Field := 16#0#;
-- Break 2 enable
BK2E : Boolean := False;
-- Break 2 polarity
BK2P : Boolean := False;
-- unspecified
Reserved_26_31 : HAL.UInt6 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for BDTR_Register use record
DTG at 0 range 0 .. 7;
LOCK at 0 range 8 .. 9;
OSSI at 0 range 10 .. 10;
OSSR at 0 range 11 .. 11;
BKE at 0 range 12 .. 12;
BKP at 0 range 13 .. 13;
AOE at 0 range 14 .. 14;
MOE at 0 range 15 .. 15;
BKF at 0 range 16 .. 19;
BK2F at 0 range 20 .. 23;
BK2E at 0 range 24 .. 24;
BK2P at 0 range 25 .. 25;
Reserved_26_31 at 0 range 26 .. 31;
end record;
subtype DCR_DBA_Field is HAL.UInt5;
subtype DCR_DBL_Field is HAL.UInt5;
-- DMA control register
type DCR_Register is record
-- DMA base address
DBA : DCR_DBA_Field := 16#0#;
-- unspecified
Reserved_5_7 : HAL.UInt3 := 16#0#;
-- DMA burst length
DBL : DCR_DBL_Field := 16#0#;
-- unspecified
Reserved_13_31 : HAL.UInt19 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for DCR_Register use record
DBA at 0 range 0 .. 4;
Reserved_5_7 at 0 range 5 .. 7;
DBL at 0 range 8 .. 12;
Reserved_13_31 at 0 range 13 .. 31;
end record;
subtype DMAR_DMAB_Field is HAL.UInt16;
-- DMA address for full transfer
type DMAR_Register is record
-- DMA register for burst accesses
DMAB : DMAR_DMAB_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for DMAR_Register use record
DMAB at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CCMR3_Output_OC5M_Field is HAL.UInt3;
subtype CCMR3_Output_OC6M_Field is HAL.UInt3;
-- capture/compare mode register 3 (output mode)
type CCMR3_Output_Register is record
-- unspecified
Reserved_0_1 : HAL.UInt2 := 16#0#;
-- Output compare 5 fast enable
OC5FE : Boolean := False;
-- Output compare 5 preload enable
OC5PE : Boolean := False;
-- Output compare 5 mode
OC5M : CCMR3_Output_OC5M_Field := 16#0#;
-- Output compare 5 clear enable
OC5CE : Boolean := False;
-- unspecified
Reserved_8_9 : HAL.UInt2 := 16#0#;
-- Output compare 6 fast enable
OC6FE : Boolean := False;
-- Output compare 6 preload enable
OC6PE : Boolean := False;
-- Output compare 6 mode
OC6M : CCMR3_Output_OC6M_Field := 16#0#;
-- Output compare 6 clear enable
OC6CE : Boolean := False;
-- Outout Compare 5 mode bit 3
OC5M_3 : Boolean := False;
-- unspecified
Reserved_17_23 : HAL.UInt7 := 16#0#;
-- Outout Compare 6 mode bit 3
OC6M_3 : Boolean := False;
-- unspecified
Reserved_25_31 : HAL.UInt7 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCMR3_Output_Register use record
Reserved_0_1 at 0 range 0 .. 1;
OC5FE at 0 range 2 .. 2;
OC5PE at 0 range 3 .. 3;
OC5M at 0 range 4 .. 6;
OC5CE at 0 range 7 .. 7;
Reserved_8_9 at 0 range 8 .. 9;
OC6FE at 0 range 10 .. 10;
OC6PE at 0 range 11 .. 11;
OC6M at 0 range 12 .. 14;
OC6CE at 0 range 15 .. 15;
OC5M_3 at 0 range 16 .. 16;
Reserved_17_23 at 0 range 17 .. 23;
OC6M_3 at 0 range 24 .. 24;
Reserved_25_31 at 0 range 25 .. 31;
end record;
subtype CCR5_CCR5_Field is HAL.UInt16;
-- CCR5_GC5C array
type CCR5_GC5C_Field_Array is array (1 .. 3) of Boolean
with Component_Size => 1, Size => 3;
-- Type definition for CCR5_GC5C
type CCR5_GC5C_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- GC5C as a value
Val : HAL.UInt3;
when True =>
-- GC5C as an array
Arr : CCR5_GC5C_Field_Array;
end case;
end record
with Unchecked_Union, Size => 3;
for CCR5_GC5C_Field use record
Val at 0 range 0 .. 2;
Arr at 0 range 0 .. 2;
end record;
-- capture/compare register 5
type CCR5_Register is record
-- Capture/Compare 5 value
CCR5 : CCR5_CCR5_Field := 16#0#;
-- unspecified
Reserved_16_28 : HAL.UInt13 := 16#0#;
-- Group Channel 5 and Channel 1
GC5C : CCR5_GC5C_Field := (As_Array => False, Val => 16#0#);
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCR5_Register use record
CCR5 at 0 range 0 .. 15;
Reserved_16_28 at 0 range 16 .. 28;
GC5C at 0 range 29 .. 31;
end record;
subtype CCR6_CCR6_Field is HAL.UInt16;
-- capture/compare register 6
type CCR6_Register is record
-- Capture/Compare 6 value
CCR6 : CCR6_CCR6_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCR6_Register use record
CCR6 at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype OR_TIM1_ETR_ADC1_RMP_Field is HAL.UInt2;
subtype OR_TIM1_ETR_ADC2_RMP_Field is HAL.UInt2;
-- option registers
type OR_Register is record
-- TIM1_ETR_ADC1 remapping capability
TIM1_ETR_ADC1_RMP : OR_TIM1_ETR_ADC1_RMP_Field := 16#0#;
-- TIM1_ETR_ADC2 remapping capability
TIM1_ETR_ADC2_RMP : OR_TIM1_ETR_ADC2_RMP_Field := 16#0#;
-- unspecified
Reserved_4_31 : HAL.UInt28 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for OR_Register use record
TIM1_ETR_ADC1_RMP at 0 range 0 .. 1;
TIM1_ETR_ADC2_RMP at 0 range 2 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
-- control register 2
type CR2_Register_1 is record
-- unspecified
Reserved_0_2 : HAL.UInt3 := 16#0#;
-- Capture/compare DMA selection
CCDS : Boolean := False;
-- Master mode selection
MMS : CR2_MMS_Field := 16#0#;
-- TI1 selection
TI1S : Boolean := False;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CR2_Register_1 use record
Reserved_0_2 at 0 range 0 .. 2;
CCDS at 0 range 3 .. 3;
MMS at 0 range 4 .. 6;
TI1S at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- DMA/Interrupt enable register
type DIER_Register_1 is record
-- Update interrupt enable
UIE : Boolean := False;
-- Capture/Compare 1 interrupt enable
CC1IE : Boolean := False;
-- Capture/Compare 2 interrupt enable
CC2IE : Boolean := False;
-- Capture/Compare 3 interrupt enable
CC3IE : Boolean := False;
-- Capture/Compare 4 interrupt enable
CC4IE : Boolean := False;
-- unspecified
Reserved_5_5 : HAL.Bit := 16#0#;
-- Trigger interrupt enable
TIE : Boolean := False;
-- unspecified
Reserved_7_7 : HAL.Bit := 16#0#;
-- Update DMA request enable
UDE : Boolean := False;
-- Capture/Compare 1 DMA request enable
CC1DE : Boolean := False;
-- Capture/Compare 2 DMA request enable
CC2DE : Boolean := False;
-- Capture/Compare 3 DMA request enable
CC3DE : Boolean := False;
-- Capture/Compare 4 DMA request enable
CC4DE : Boolean := False;
-- unspecified
Reserved_13_13 : HAL.Bit := 16#0#;
-- Trigger DMA request enable
TDE : Boolean := False;
-- unspecified
Reserved_15_31 : HAL.UInt17 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for DIER_Register_1 use record
UIE at 0 range 0 .. 0;
CC1IE at 0 range 1 .. 1;
CC2IE at 0 range 2 .. 2;
CC3IE at 0 range 3 .. 3;
CC4IE at 0 range 4 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
TIE at 0 range 6 .. 6;
Reserved_7_7 at 0 range 7 .. 7;
UDE at 0 range 8 .. 8;
CC1DE at 0 range 9 .. 9;
CC2DE at 0 range 10 .. 10;
CC3DE at 0 range 11 .. 11;
CC4DE at 0 range 12 .. 12;
Reserved_13_13 at 0 range 13 .. 13;
TDE at 0 range 14 .. 14;
Reserved_15_31 at 0 range 15 .. 31;
end record;
-- status register
type SR_Register_1 is record
-- Update interrupt flag
UIF : Boolean := False;
-- Capture/compare 1 interrupt flag
CC1IF : Boolean := False;
-- Capture/Compare 2 interrupt flag
CC2IF : Boolean := False;
-- Capture/Compare 3 interrupt flag
CC3IF : Boolean := False;
-- Capture/Compare 4 interrupt flag
CC4IF : Boolean := False;
-- unspecified
Reserved_5_5 : HAL.Bit := 16#0#;
-- Trigger interrupt flag
TIF : Boolean := False;
-- unspecified
Reserved_7_8 : HAL.UInt2 := 16#0#;
-- Capture/Compare 1 overcapture flag
CC1OF : Boolean := False;
-- Capture/compare 2 overcapture flag
CC2OF : Boolean := False;
-- Capture/Compare 3 overcapture flag
CC3OF : Boolean := False;
-- Capture/Compare 4 overcapture flag
CC4OF : Boolean := False;
-- unspecified
Reserved_13_31 : HAL.UInt19 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register_1 use record
UIF at 0 range 0 .. 0;
CC1IF at 0 range 1 .. 1;
CC2IF at 0 range 2 .. 2;
CC3IF at 0 range 3 .. 3;
CC4IF at 0 range 4 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
TIF at 0 range 6 .. 6;
Reserved_7_8 at 0 range 7 .. 8;
CC1OF at 0 range 9 .. 9;
CC2OF at 0 range 10 .. 10;
CC3OF at 0 range 11 .. 11;
CC4OF at 0 range 12 .. 12;
Reserved_13_31 at 0 range 13 .. 31;
end record;
-- event generation register
type EGR_Register_1 is record
-- Write-only. Update generation
UG : Boolean := False;
-- Write-only. Capture/compare 1 generation
CC1G : Boolean := False;
-- Write-only. Capture/compare 2 generation
CC2G : Boolean := False;
-- Write-only. Capture/compare 3 generation
CC3G : Boolean := False;
-- Write-only. Capture/compare 4 generation
CC4G : Boolean := False;
-- unspecified
Reserved_5_5 : HAL.Bit := 16#0#;
-- Write-only. Trigger generation
TG : Boolean := False;
-- unspecified
Reserved_7_31 : HAL.UInt25 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for EGR_Register_1 use record
UG at 0 range 0 .. 0;
CC1G at 0 range 1 .. 1;
CC2G at 0 range 2 .. 2;
CC3G at 0 range 3 .. 3;
CC4G at 0 range 4 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
TG at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
subtype CCMR1_Input_IC1PSC_Field is HAL.UInt2;
subtype CCMR1_Input_IC2PSC_Field is HAL.UInt2;
-- capture/compare mode register 1 (input mode)
type CCMR1_Input_Register_1 is record
-- Capture/Compare 1 selection
CC1S : CCMR1_Input_CC1S_Field := 16#0#;
-- Input capture 1 prescaler
IC1PSC : CCMR1_Input_IC1PSC_Field := 16#0#;
-- Input capture 1 filter
IC1F : CCMR1_Input_IC1F_Field := 16#0#;
-- Capture/compare 2 selection
CC2S : CCMR1_Input_CC2S_Field := 16#0#;
-- Input capture 2 prescaler
IC2PSC : CCMR1_Input_IC2PSC_Field := 16#0#;
-- Input capture 2 filter
IC2F : CCMR1_Input_IC2F_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCMR1_Input_Register_1 use record
CC1S at 0 range 0 .. 1;
IC1PSC at 0 range 2 .. 3;
IC1F at 0 range 4 .. 7;
CC2S at 0 range 8 .. 9;
IC2PSC at 0 range 10 .. 11;
IC2F at 0 range 12 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- capture/compare mode register 2 (output mode)
type CCMR2_Output_Register_1 is record
-- Capture/Compare 3 selection
CC3S : CCMR2_Output_CC3S_Field := 16#0#;
-- Output compare 3 fast enable
OC3FE : Boolean := False;
-- Output compare 3 preload enable
OC3PE : Boolean := False;
-- Output compare 3 mode
OC3M : CCMR2_Output_OC3M_Field := 16#0#;
-- Output compare 3 clear enable
OC3CE : Boolean := False;
-- Capture/Compare 4 selection
CC4S : CCMR2_Output_CC4S_Field := 16#0#;
-- Output compare 4 fast enable
OC4FE : Boolean := False;
-- Output compare 4 preload enable
OC4PE : Boolean := False;
-- Output compare 4 mode
OC4M : CCMR2_Output_OC4M_Field := 16#0#;
-- Output compare 4 clear enable
O24CE : Boolean := False;
-- Output compare 3 mode bit3
OC3M_3 : Boolean := False;
-- unspecified
Reserved_17_23 : HAL.UInt7 := 16#0#;
-- Output compare 4 mode bit3
OC4M_3 : Boolean := False;
-- unspecified
Reserved_25_31 : HAL.UInt7 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCMR2_Output_Register_1 use record
CC3S at 0 range 0 .. 1;
OC3FE at 0 range 2 .. 2;
OC3PE at 0 range 3 .. 3;
OC3M at 0 range 4 .. 6;
OC3CE at 0 range 7 .. 7;
CC4S at 0 range 8 .. 9;
OC4FE at 0 range 10 .. 10;
OC4PE at 0 range 11 .. 11;
OC4M at 0 range 12 .. 14;
O24CE at 0 range 15 .. 15;
OC3M_3 at 0 range 16 .. 16;
Reserved_17_23 at 0 range 17 .. 23;
OC4M_3 at 0 range 24 .. 24;
Reserved_25_31 at 0 range 25 .. 31;
end record;
-- capture/compare enable register
type CCER_Register_1 is record
-- Capture/Compare 1 output enable
CC1E : Boolean := False;
-- Capture/Compare 1 output Polarity
CC1P : Boolean := False;
-- unspecified
Reserved_2_2 : HAL.Bit := 16#0#;
-- Capture/Compare 1 output Polarity
CC1NP : Boolean := False;
-- Capture/Compare 2 output enable
CC2E : Boolean := False;
-- Capture/Compare 2 output Polarity
CC2P : Boolean := False;
-- unspecified
Reserved_6_6 : HAL.Bit := 16#0#;
-- Capture/Compare 2 output Polarity
CC2NP : Boolean := False;
-- Capture/Compare 3 output enable
CC3E : Boolean := False;
-- Capture/Compare 3 output Polarity
CC3P : Boolean := False;
-- unspecified
Reserved_10_10 : HAL.Bit := 16#0#;
-- Capture/Compare 3 output Polarity
CC3NP : Boolean := False;
-- Capture/Compare 4 output enable
CC4E : Boolean := False;
-- Capture/Compare 3 output Polarity
CC4P : Boolean := False;
-- unspecified
Reserved_14_14 : HAL.Bit := 16#0#;
-- Capture/Compare 3 output Polarity
CC4NP : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCER_Register_1 use record
CC1E at 0 range 0 .. 0;
CC1P at 0 range 1 .. 1;
Reserved_2_2 at 0 range 2 .. 2;
CC1NP at 0 range 3 .. 3;
CC2E at 0 range 4 .. 4;
CC2P at 0 range 5 .. 5;
Reserved_6_6 at 0 range 6 .. 6;
CC2NP at 0 range 7 .. 7;
CC3E at 0 range 8 .. 8;
CC3P at 0 range 9 .. 9;
Reserved_10_10 at 0 range 10 .. 10;
CC3NP at 0 range 11 .. 11;
CC4E at 0 range 12 .. 12;
CC4P at 0 range 13 .. 13;
Reserved_14_14 at 0 range 14 .. 14;
CC4NP at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CNT_CNTL_Field is HAL.UInt16;
subtype CNT_CNTH_Field is HAL.UInt15;
-- counter
type CNT_Register_1 is record
-- Low counter value
CNTL : CNT_CNTL_Field := 16#0#;
-- High counter value
CNTH : CNT_CNTH_Field := 16#0#;
-- if IUFREMAP=0 than CNT with read write access else UIFCPY with read
-- only access
CNT_or_UIFCPY : Boolean := False;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CNT_Register_1 use record
CNTL at 0 range 0 .. 15;
CNTH at 0 range 16 .. 30;
CNT_or_UIFCPY at 0 range 31 .. 31;
end record;
subtype ARR_ARRL_Field is HAL.UInt16;
subtype ARR_ARRH_Field is HAL.UInt16;
-- auto-reload register
type ARR_Register_1 is record
-- Low Auto-reload value
ARRL : ARR_ARRL_Field := 16#0#;
-- High Auto-reload value
ARRH : ARR_ARRH_Field := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ARR_Register_1 use record
ARRL at 0 range 0 .. 15;
ARRH at 0 range 16 .. 31;
end record;
subtype CCR1_CCR1L_Field is HAL.UInt16;
subtype CCR1_CCR1H_Field is HAL.UInt16;
-- capture/compare register 1
type CCR1_Register_1 is record
-- Low Capture/Compare 1 value
CCR1L : CCR1_CCR1L_Field := 16#0#;
-- High Capture/Compare 1 value (on TIM2)
CCR1H : CCR1_CCR1H_Field := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCR1_Register_1 use record
CCR1L at 0 range 0 .. 15;
CCR1H at 0 range 16 .. 31;
end record;
subtype CCR2_CCR2L_Field is HAL.UInt16;
subtype CCR2_CCR2H_Field is HAL.UInt16;
-- capture/compare register 2
type CCR2_Register_1 is record
-- Low Capture/Compare 2 value
CCR2L : CCR2_CCR2L_Field := 16#0#;
-- High Capture/Compare 2 value (on TIM2)
CCR2H : CCR2_CCR2H_Field := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCR2_Register_1 use record
CCR2L at 0 range 0 .. 15;
CCR2H at 0 range 16 .. 31;
end record;
subtype CCR3_CCR3L_Field is HAL.UInt16;
subtype CCR3_CCR3H_Field is HAL.UInt16;
-- capture/compare register 3
type CCR3_Register_1 is record
-- Low Capture/Compare value
CCR3L : CCR3_CCR3L_Field := 16#0#;
-- High Capture/Compare value (on TIM2)
CCR3H : CCR3_CCR3H_Field := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCR3_Register_1 use record
CCR3L at 0 range 0 .. 15;
CCR3H at 0 range 16 .. 31;
end record;
subtype CCR4_CCR4L_Field is HAL.UInt16;
subtype CCR4_CCR4H_Field is HAL.UInt16;
-- capture/compare register 4
type CCR4_Register_1 is record
-- Low Capture/Compare value
CCR4L : CCR4_CCR4L_Field := 16#0#;
-- High Capture/Compare value (on TIM2)
CCR4H : CCR4_CCR4H_Field := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCR4_Register_1 use record
CCR4L at 0 range 0 .. 15;
CCR4H at 0 range 16 .. 31;
end record;
-- control register 1
type CR1_Register_1 is record
-- Counter enable
CEN : Boolean := False;
-- Update disable
UDIS : Boolean := False;
-- Update request source
URS : Boolean := False;
-- One-pulse mode
OPM : Boolean := False;
-- Direction
DIR : Boolean := False;
-- Center-aligned mode selection
CMS : CR1_CMS_Field := 16#0#;
-- Auto-reload preload enable
ARPE : Boolean := False;
-- Clock division
CKD : CR1_CKD_Field := 16#0#;
-- unspecified
Reserved_10_31 : HAL.UInt22 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CR1_Register_1 use record
CEN at 0 range 0 .. 0;
UDIS at 0 range 1 .. 1;
URS at 0 range 2 .. 2;
OPM at 0 range 3 .. 3;
DIR at 0 range 4 .. 4;
CMS at 0 range 5 .. 6;
ARPE at 0 range 7 .. 7;
CKD at 0 range 8 .. 9;
Reserved_10_31 at 0 range 10 .. 31;
end record;
-- capture/compare mode register 2 (output mode)
type CCMR2_Output_Register_2 is record
-- Capture/Compare 3 selection
CC3S : CCMR2_Output_CC3S_Field := 16#0#;
-- Output compare 3 fast enable
OC3FE : Boolean := False;
-- Output compare 3 preload enable
OC3PE : Boolean := False;
-- Output compare 3 mode
OC3M : CCMR2_Output_OC3M_Field := 16#0#;
-- Output compare 3 clear enable
OC3CE : Boolean := False;
-- Capture/Compare 4 selection
CC4S : CCMR2_Output_CC4S_Field := 16#0#;
-- Output compare 4 fast enable
OC4FE : Boolean := False;
-- Output compare 4 preload enable
OC4PE : Boolean := False;
-- Output compare 4 mode
OC4M : CCMR2_Output_OC4M_Field := 16#0#;
-- Output compare 4 clear enable
O24CE : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCMR2_Output_Register_2 use record
CC3S at 0 range 0 .. 1;
OC3FE at 0 range 2 .. 2;
OC3PE at 0 range 3 .. 3;
OC3M at 0 range 4 .. 6;
OC3CE at 0 range 7 .. 7;
CC4S at 0 range 8 .. 9;
OC4FE at 0 range 10 .. 10;
OC4PE at 0 range 11 .. 11;
OC4M at 0 range 12 .. 14;
O24CE at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- counter
type CNT_Register_2 is record
-- counter value
CNT : CNT_CNT_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CNT_Register_2 use record
CNT at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- control register 1
type CR1_Register_2 is record
-- Counter enable
CEN : Boolean := False;
-- Update disable
UDIS : Boolean := False;
-- Update request source
URS : Boolean := False;
-- One-pulse mode
OPM : Boolean := False;
-- unspecified
Reserved_4_6 : HAL.UInt3 := 16#0#;
-- Auto-reload preload enable
ARPE : Boolean := False;
-- unspecified
Reserved_8_10 : HAL.UInt3 := 16#0#;
-- UIF status bit remapping
UIFREMAP : Boolean := False;
-- unspecified
Reserved_12_31 : HAL.UInt20 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CR1_Register_2 use record
CEN at 0 range 0 .. 0;
UDIS at 0 range 1 .. 1;
URS at 0 range 2 .. 2;
OPM at 0 range 3 .. 3;
Reserved_4_6 at 0 range 4 .. 6;
ARPE at 0 range 7 .. 7;
Reserved_8_10 at 0 range 8 .. 10;
UIFREMAP at 0 range 11 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
-- control register 2
type CR2_Register_2 is record
-- unspecified
Reserved_0_3 : HAL.UInt4 := 16#0#;
-- Master mode selection
MMS : CR2_MMS_Field := 16#0#;
-- unspecified
Reserved_7_31 : HAL.UInt25 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CR2_Register_2 use record
Reserved_0_3 at 0 range 0 .. 3;
MMS at 0 range 4 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
-- DMA/Interrupt enable register
type DIER_Register_2 is record
-- Update interrupt enable
UIE : Boolean := False;
-- unspecified
Reserved_1_7 : HAL.UInt7 := 16#0#;
-- Update DMA request enable
UDE : Boolean := False;
-- unspecified
Reserved_9_31 : HAL.UInt23 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for DIER_Register_2 use record
UIE at 0 range 0 .. 0;
Reserved_1_7 at 0 range 1 .. 7;
UDE at 0 range 8 .. 8;
Reserved_9_31 at 0 range 9 .. 31;
end record;
-- status register
type SR_Register_2 is record
-- Update interrupt flag
UIF : Boolean := False;
-- unspecified
Reserved_1_31 : HAL.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register_2 use record
UIF at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
-- event generation register
type EGR_Register_2 is record
-- Write-only. Update generation
UG : Boolean := False;
-- unspecified
Reserved_1_31 : HAL.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for EGR_Register_2 use record
UG at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
-- control register 1
type CR1_Register_3 is record
-- Counter enable
CEN : Boolean := False;
-- Update disable
UDIS : Boolean := False;
-- Update request source
URS : Boolean := False;
-- One-pulse mode
OPM : Boolean := False;
-- unspecified
Reserved_4_6 : HAL.UInt3 := 16#0#;
-- Auto-reload preload enable
ARPE : Boolean := False;
-- Clock division
CKD : CR1_CKD_Field := 16#0#;
-- unspecified
Reserved_10_10 : HAL.Bit := 16#0#;
-- UIF status bit remapping
UIFREMAP : Boolean := False;
-- unspecified
Reserved_12_31 : HAL.UInt20 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CR1_Register_3 use record
CEN at 0 range 0 .. 0;
UDIS at 0 range 1 .. 1;
URS at 0 range 2 .. 2;
OPM at 0 range 3 .. 3;
Reserved_4_6 at 0 range 4 .. 6;
ARPE at 0 range 7 .. 7;
CKD at 0 range 8 .. 9;
Reserved_10_10 at 0 range 10 .. 10;
UIFREMAP at 0 range 11 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
-- control register 2
type CR2_Register_3 is record
-- Capture/compare preloaded control
CCPC : Boolean := False;
-- unspecified
Reserved_1_1 : HAL.Bit := 16#0#;
-- Capture/compare control update selection
CCUS : Boolean := False;
-- Capture/compare DMA selection
CCDS : Boolean := False;
-- Master mode selection
MMS : CR2_MMS_Field := 16#0#;
-- TI1 selection
TI1S : Boolean := False;
-- Output Idle state 1
OIS1 : Boolean := False;
-- Output Idle state 1
OIS1N : Boolean := False;
-- Output Idle state 2
OIS2 : Boolean := False;
-- unspecified
Reserved_11_31 : HAL.UInt21 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CR2_Register_3 use record
CCPC at 0 range 0 .. 0;
Reserved_1_1 at 0 range 1 .. 1;
CCUS at 0 range 2 .. 2;
CCDS at 0 range 3 .. 3;
MMS at 0 range 4 .. 6;
TI1S at 0 range 7 .. 7;
OIS1 at 0 range 8 .. 8;
OIS1N at 0 range 9 .. 9;
OIS2 at 0 range 10 .. 10;
Reserved_11_31 at 0 range 11 .. 31;
end record;
-- slave mode control register
type SMCR_Register_1 is record
-- Slave mode selection
SMS : SMCR_SMS_Field := 16#0#;
-- unspecified
Reserved_3_3 : HAL.Bit := 16#0#;
-- Trigger selection
TS : SMCR_TS_Field := 16#0#;
-- Master/Slave mode
MSM : Boolean := False;
-- unspecified
Reserved_8_15 : HAL.UInt8 := 16#0#;
-- Slave mode selection bit 3
SMS_3 : Boolean := False;
-- unspecified
Reserved_17_31 : HAL.UInt15 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SMCR_Register_1 use record
SMS at 0 range 0 .. 2;
Reserved_3_3 at 0 range 3 .. 3;
TS at 0 range 4 .. 6;
MSM at 0 range 7 .. 7;
Reserved_8_15 at 0 range 8 .. 15;
SMS_3 at 0 range 16 .. 16;
Reserved_17_31 at 0 range 17 .. 31;
end record;
-- DMA/Interrupt enable register
type DIER_Register_3 is record
-- Update interrupt enable
UIE : Boolean := False;
-- Capture/Compare 1 interrupt enable
CC1IE : Boolean := False;
-- Capture/Compare 2 interrupt enable
CC2IE : Boolean := False;
-- unspecified
Reserved_3_4 : HAL.UInt2 := 16#0#;
-- COM interrupt enable
COMIE : Boolean := False;
-- Trigger interrupt enable
TIE : Boolean := False;
-- Break interrupt enable
BIE : Boolean := False;
-- Update DMA request enable
UDE : Boolean := False;
-- Capture/Compare 1 DMA request enable
CC1DE : Boolean := False;
-- Capture/Compare 2 DMA request enable
CC2DE : Boolean := False;
-- unspecified
Reserved_11_12 : HAL.UInt2 := 16#0#;
-- COM DMA request enable
COMDE : Boolean := False;
-- Trigger DMA request enable
TDE : Boolean := False;
-- unspecified
Reserved_15_31 : HAL.UInt17 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for DIER_Register_3 use record
UIE at 0 range 0 .. 0;
CC1IE at 0 range 1 .. 1;
CC2IE at 0 range 2 .. 2;
Reserved_3_4 at 0 range 3 .. 4;
COMIE at 0 range 5 .. 5;
TIE at 0 range 6 .. 6;
BIE at 0 range 7 .. 7;
UDE at 0 range 8 .. 8;
CC1DE at 0 range 9 .. 9;
CC2DE at 0 range 10 .. 10;
Reserved_11_12 at 0 range 11 .. 12;
COMDE at 0 range 13 .. 13;
TDE at 0 range 14 .. 14;
Reserved_15_31 at 0 range 15 .. 31;
end record;
-- status register
type SR_Register_3 is record
-- Update interrupt flag
UIF : Boolean := False;
-- Capture/compare 1 interrupt flag
CC1IF : Boolean := False;
-- Capture/Compare 2 interrupt flag
CC2IF : Boolean := False;
-- unspecified
Reserved_3_4 : HAL.UInt2 := 16#0#;
-- COM interrupt flag
COMIF : Boolean := False;
-- Trigger interrupt flag
TIF : Boolean := False;
-- Break interrupt flag
BIF : Boolean := False;
-- unspecified
Reserved_8_8 : HAL.Bit := 16#0#;
-- Capture/Compare 1 overcapture flag
CC1OF : Boolean := False;
-- Capture/compare 2 overcapture flag
CC2OF : Boolean := False;
-- unspecified
Reserved_11_31 : HAL.UInt21 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register_3 use record
UIF at 0 range 0 .. 0;
CC1IF at 0 range 1 .. 1;
CC2IF at 0 range 2 .. 2;
Reserved_3_4 at 0 range 3 .. 4;
COMIF at 0 range 5 .. 5;
TIF at 0 range 6 .. 6;
BIF at 0 range 7 .. 7;
Reserved_8_8 at 0 range 8 .. 8;
CC1OF at 0 range 9 .. 9;
CC2OF at 0 range 10 .. 10;
Reserved_11_31 at 0 range 11 .. 31;
end record;
-- event generation register
type EGR_Register_3 is record
-- Write-only. Update generation
UG : Boolean := False;
-- Write-only. Capture/compare 1 generation
CC1G : Boolean := False;
-- Write-only. Capture/compare 2 generation
CC2G : Boolean := False;
-- unspecified
Reserved_3_4 : HAL.UInt2 := 16#0#;
-- Write-only. Capture/Compare control update generation
COMG : Boolean := False;
-- Write-only. Trigger generation
TG : Boolean := False;
-- Write-only. Break generation
BG : Boolean := False;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for EGR_Register_3 use record
UG at 0 range 0 .. 0;
CC1G at 0 range 1 .. 1;
CC2G at 0 range 2 .. 2;
Reserved_3_4 at 0 range 3 .. 4;
COMG at 0 range 5 .. 5;
TG at 0 range 6 .. 6;
BG at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- capture/compare enable register
type CCER_Register_2 is record
-- Capture/Compare 1 output enable
CC1E : Boolean := False;
-- Capture/Compare 1 output Polarity
CC1P : Boolean := False;
-- Capture/Compare 1 complementary output enable
CC1NE : Boolean := False;
-- Capture/Compare 1 output Polarity
CC1NP : Boolean := False;
-- Capture/Compare 2 output enable
CC2E : Boolean := False;
-- Capture/Compare 2 output Polarity
CC2P : Boolean := False;
-- unspecified
Reserved_6_6 : HAL.Bit := 16#0#;
-- Capture/Compare 2 output Polarity
CC2NP : Boolean := False;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCER_Register_2 use record
CC1E at 0 range 0 .. 0;
CC1P at 0 range 1 .. 1;
CC1NE at 0 range 2 .. 2;
CC1NP at 0 range 3 .. 3;
CC2E at 0 range 4 .. 4;
CC2P at 0 range 5 .. 5;
Reserved_6_6 at 0 range 6 .. 6;
CC2NP at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype RCR_REP_Field_1 is HAL.UInt8;
-- repetition counter register
type RCR_Register_1 is record
-- Repetition counter value
REP : RCR_REP_Field_1 := 16#0#;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for RCR_Register_1 use record
REP at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- break and dead-time register
type BDTR_Register_1 is record
-- Dead-time generator setup
DTG : BDTR_DTG_Field := 16#0#;
-- Lock configuration
LOCK : BDTR_LOCK_Field := 16#0#;
-- Off-state selection for Idle mode
OSSI : Boolean := False;
-- Off-state selection for Run mode
OSSR : Boolean := False;
-- Break enable
BKE : Boolean := False;
-- Break polarity
BKP : Boolean := False;
-- Automatic output enable
AOE : Boolean := False;
-- Main output enable
MOE : Boolean := False;
-- Break filter
BKF : BDTR_BKF_Field := 16#0#;
-- unspecified
Reserved_20_31 : HAL.UInt12 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for BDTR_Register_1 use record
DTG at 0 range 0 .. 7;
LOCK at 0 range 8 .. 9;
OSSI at 0 range 10 .. 10;
OSSR at 0 range 11 .. 11;
BKE at 0 range 12 .. 12;
BKP at 0 range 13 .. 13;
AOE at 0 range 14 .. 14;
MOE at 0 range 15 .. 15;
BKF at 0 range 16 .. 19;
Reserved_20_31 at 0 range 20 .. 31;
end record;
-- control register 2
type CR2_Register_4 is record
-- Capture/compare preloaded control
CCPC : Boolean := False;
-- unspecified
Reserved_1_1 : HAL.Bit := 16#0#;
-- Capture/compare control update selection
CCUS : Boolean := False;
-- Capture/compare DMA selection
CCDS : Boolean := False;
-- unspecified
Reserved_4_7 : HAL.UInt4 := 16#0#;
-- Output Idle state 1
OIS1 : Boolean := False;
-- Output Idle state 1
OIS1N : Boolean := False;
-- unspecified
Reserved_10_31 : HAL.UInt22 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CR2_Register_4 use record
CCPC at 0 range 0 .. 0;
Reserved_1_1 at 0 range 1 .. 1;
CCUS at 0 range 2 .. 2;
CCDS at 0 range 3 .. 3;
Reserved_4_7 at 0 range 4 .. 7;
OIS1 at 0 range 8 .. 8;
OIS1N at 0 range 9 .. 9;
Reserved_10_31 at 0 range 10 .. 31;
end record;
-- DMA/Interrupt enable register
type DIER_Register_4 is record
-- Update interrupt enable
UIE : Boolean := False;
-- Capture/Compare 1 interrupt enable
CC1IE : Boolean := False;
-- unspecified
Reserved_2_4 : HAL.UInt3 := 16#0#;
-- COM interrupt enable
COMIE : Boolean := False;
-- Trigger interrupt enable
TIE : Boolean := False;
-- Break interrupt enable
BIE : Boolean := False;
-- Update DMA request enable
UDE : Boolean := False;
-- Capture/Compare 1 DMA request enable
CC1DE : Boolean := False;
-- unspecified
Reserved_10_12 : HAL.UInt3 := 16#0#;
-- COM DMA request enable
COMDE : Boolean := False;
-- Trigger DMA request enable
TDE : Boolean := False;
-- unspecified
Reserved_15_31 : HAL.UInt17 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for DIER_Register_4 use record
UIE at 0 range 0 .. 0;
CC1IE at 0 range 1 .. 1;
Reserved_2_4 at 0 range 2 .. 4;
COMIE at 0 range 5 .. 5;
TIE at 0 range 6 .. 6;
BIE at 0 range 7 .. 7;
UDE at 0 range 8 .. 8;
CC1DE at 0 range 9 .. 9;
Reserved_10_12 at 0 range 10 .. 12;
COMDE at 0 range 13 .. 13;
TDE at 0 range 14 .. 14;
Reserved_15_31 at 0 range 15 .. 31;
end record;
-- status register
type SR_Register_4 is record
-- Update interrupt flag
UIF : Boolean := False;
-- Capture/compare 1 interrupt flag
CC1IF : Boolean := False;
-- unspecified
Reserved_2_4 : HAL.UInt3 := 16#0#;
-- COM interrupt flag
COMIF : Boolean := False;
-- Trigger interrupt flag
TIF : Boolean := False;
-- Break interrupt flag
BIF : Boolean := False;
-- unspecified
Reserved_8_8 : HAL.Bit := 16#0#;
-- Capture/Compare 1 overcapture flag
CC1OF : Boolean := False;
-- unspecified
Reserved_10_31 : HAL.UInt22 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register_4 use record
UIF at 0 range 0 .. 0;
CC1IF at 0 range 1 .. 1;
Reserved_2_4 at 0 range 2 .. 4;
COMIF at 0 range 5 .. 5;
TIF at 0 range 6 .. 6;
BIF at 0 range 7 .. 7;
Reserved_8_8 at 0 range 8 .. 8;
CC1OF at 0 range 9 .. 9;
Reserved_10_31 at 0 range 10 .. 31;
end record;
-- event generation register
type EGR_Register_4 is record
-- Write-only. Update generation
UG : Boolean := False;
-- Write-only. Capture/compare 1 generation
CC1G : Boolean := False;
-- unspecified
Reserved_2_4 : HAL.UInt3 := 16#0#;
-- Write-only. Capture/Compare control update generation
COMG : Boolean := False;
-- Write-only. Trigger generation
TG : Boolean := False;
-- Write-only. Break generation
BG : Boolean := False;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for EGR_Register_4 use record
UG at 0 range 0 .. 0;
CC1G at 0 range 1 .. 1;
Reserved_2_4 at 0 range 2 .. 4;
COMG at 0 range 5 .. 5;
TG at 0 range 6 .. 6;
BG at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- capture/compare mode register (output mode)
type CCMR1_Output_Register_1 is record
-- Capture/Compare 1 selection
CC1S : CCMR1_Output_CC1S_Field := 16#0#;
-- Output Compare 1 fast enable
OC1FE : Boolean := False;
-- Output Compare 1 preload enable
OC1PE : Boolean := False;
-- Output Compare 1 mode
OC1M : CCMR1_Output_OC1M_Field := 16#0#;
-- Output compare 1 clear enable
OC1CE : Boolean := False;
-- unspecified
Reserved_8_15 : HAL.UInt8 := 16#0#;
-- Output Compare 1 mode
OC1M_3 : Boolean := False;
-- unspecified
Reserved_17_31 : HAL.UInt15 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCMR1_Output_Register_1 use record
CC1S at 0 range 0 .. 1;
OC1FE at 0 range 2 .. 2;
OC1PE at 0 range 3 .. 3;
OC1M at 0 range 4 .. 6;
OC1CE at 0 range 7 .. 7;
Reserved_8_15 at 0 range 8 .. 15;
OC1M_3 at 0 range 16 .. 16;
Reserved_17_31 at 0 range 17 .. 31;
end record;
-- capture/compare mode register 1 (input mode)
type CCMR1_Input_Register_2 is record
-- Capture/Compare 1 selection
CC1S : CCMR1_Input_CC1S_Field := 16#0#;
-- Input capture 1 prescaler
IC1PSC : CCMR1_Input_IC1PSC_Field := 16#0#;
-- Input capture 1 filter
IC1F : CCMR1_Input_IC1F_Field := 16#0#;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCMR1_Input_Register_2 use record
CC1S at 0 range 0 .. 1;
IC1PSC at 0 range 2 .. 3;
IC1F at 0 range 4 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- capture/compare enable register
type CCER_Register_3 is record
-- Capture/Compare 1 output enable
CC1E : Boolean := False;
-- Capture/Compare 1 output Polarity
CC1P : Boolean := False;
-- Capture/Compare 1 complementary output enable
CC1NE : Boolean := False;
-- Capture/Compare 1 output Polarity
CC1NP : Boolean := False;
-- unspecified
Reserved_4_31 : HAL.UInt28 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCER_Register_3 use record
CC1E at 0 range 0 .. 0;
CC1P at 0 range 1 .. 1;
CC1NE at 0 range 2 .. 2;
CC1NP at 0 range 3 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
subtype OR_TI1_RMP_Field is HAL.UInt2;
-- option register
type OR_Register_1 is record
-- TIM16 remapping capability
TI1_RMP : OR_TI1_RMP_Field := 16#0#;
-- unspecified
Reserved_2_31 : HAL.UInt30 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for OR_Register_1 use record
TI1_RMP at 0 range 0 .. 1;
Reserved_2_31 at 0 range 2 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
type TIM1_Disc is
(Output,
Input);
-- Advanced timer
type TIM1_Peripheral
(Discriminent : TIM1_Disc := Output)
is record
-- control register 1
CR1 : aliased CR1_Register;
-- control register 2
CR2 : aliased CR2_Register;
-- slave mode control register
SMCR : aliased SMCR_Register;
-- DMA/Interrupt enable register
DIER : aliased DIER_Register;
-- status register
SR : aliased SR_Register;
-- event generation register
EGR : aliased EGR_Register;
-- capture/compare enable register
CCER : aliased CCER_Register;
-- counter
CNT : aliased CNT_Register;
-- prescaler
PSC : aliased PSC_Register;
-- auto-reload register
ARR : aliased ARR_Register;
-- repetition counter register
RCR : aliased RCR_Register;
-- capture/compare register 1
CCR1 : aliased CCR1_Register;
-- capture/compare register 2
CCR2 : aliased CCR2_Register;
-- capture/compare register 3
CCR3 : aliased CCR3_Register;
-- capture/compare register 4
CCR4 : aliased CCR4_Register;
-- break and dead-time register
BDTR : aliased BDTR_Register;
-- DMA control register
DCR : aliased DCR_Register;
-- DMA address for full transfer
DMAR : aliased DMAR_Register;
-- capture/compare mode register 3 (output mode)
CCMR3_Output : aliased CCMR3_Output_Register;
-- capture/compare register 5
CCR5 : aliased CCR5_Register;
-- capture/compare register 6
CCR6 : aliased CCR6_Register;
-- option registers
OR_k : aliased OR_Register;
case Discriminent is
when Output =>
-- capture/compare mode register (output mode)
CCMR1_Output : aliased CCMR1_Output_Register;
-- capture/compare mode register (output mode)
CCMR2_Output : aliased CCMR2_Output_Register;
when Input =>
-- capture/compare mode register 1 (input mode)
CCMR1_Input : aliased CCMR1_Input_Register;
-- capture/compare mode register 2 (input mode)
CCMR2_Input : aliased CCMR2_Input_Register;
end case;
end record
with Unchecked_Union, Volatile;
for TIM1_Peripheral use record
CR1 at 16#0# range 0 .. 31;
CR2 at 16#4# range 0 .. 31;
SMCR at 16#8# range 0 .. 31;
DIER at 16#C# range 0 .. 31;
SR at 16#10# range 0 .. 31;
EGR at 16#14# range 0 .. 31;
CCER at 16#20# range 0 .. 31;
CNT at 16#24# range 0 .. 31;
PSC at 16#28# range 0 .. 31;
ARR at 16#2C# range 0 .. 31;
RCR at 16#30# range 0 .. 31;
CCR1 at 16#34# range 0 .. 31;
CCR2 at 16#38# range 0 .. 31;
CCR3 at 16#3C# range 0 .. 31;
CCR4 at 16#40# range 0 .. 31;
BDTR at 16#44# range 0 .. 31;
DCR at 16#48# range 0 .. 31;
DMAR at 16#4C# range 0 .. 31;
CCMR3_Output at 16#54# range 0 .. 31;
CCR5 at 16#58# range 0 .. 31;
CCR6 at 16#5C# range 0 .. 31;
OR_k at 16#60# range 0 .. 31;
CCMR1_Output at 16#18# range 0 .. 31;
CCMR2_Output at 16#1C# range 0 .. 31;
CCMR1_Input at 16#18# range 0 .. 31;
CCMR2_Input at 16#1C# range 0 .. 31;
end record;
-- Advanced timer
TIM1_Periph : aliased TIM1_Peripheral
with Import, Address => TIM1_Base;
type TIM2_Disc is
(Output,
Input);
-- General purpose timer
type TIM2_Peripheral
(Discriminent : TIM2_Disc := Output)
is record
-- control register 1
CR1 : aliased CR1_Register;
-- control register 2
CR2 : aliased CR2_Register_1;
-- slave mode control register
SMCR : aliased SMCR_Register;
-- DMA/Interrupt enable register
DIER : aliased DIER_Register_1;
-- status register
SR : aliased SR_Register_1;
-- event generation register
EGR : aliased EGR_Register_1;
-- capture/compare enable register
CCER : aliased CCER_Register_1;
-- counter
CNT : aliased CNT_Register_1;
-- prescaler
PSC : aliased PSC_Register;
-- auto-reload register
ARR : aliased ARR_Register_1;
-- capture/compare register 1
CCR1 : aliased CCR1_Register_1;
-- capture/compare register 2
CCR2 : aliased CCR2_Register_1;
-- capture/compare register 3
CCR3 : aliased CCR3_Register_1;
-- capture/compare register 4
CCR4 : aliased CCR4_Register_1;
-- DMA control register
DCR : aliased DCR_Register;
-- DMA address for full transfer
DMAR : aliased DMAR_Register;
case Discriminent is
when Output =>
-- capture/compare mode register 1 (output mode)
CCMR1_Output : aliased CCMR1_Output_Register;
-- capture/compare mode register 2 (output mode)
CCMR2_Output : aliased CCMR2_Output_Register_1;
when Input =>
-- capture/compare mode register 1 (input mode)
CCMR1_Input : aliased CCMR1_Input_Register_1;
-- capture/compare mode register 2 (input mode)
CCMR2_Input : aliased CCMR2_Input_Register;
end case;
end record
with Unchecked_Union, Volatile;
for TIM2_Peripheral use record
CR1 at 16#0# range 0 .. 31;
CR2 at 16#4# range 0 .. 31;
SMCR at 16#8# range 0 .. 31;
DIER at 16#C# range 0 .. 31;
SR at 16#10# range 0 .. 31;
EGR at 16#14# range 0 .. 31;
CCER at 16#20# range 0 .. 31;
CNT at 16#24# range 0 .. 31;
PSC at 16#28# range 0 .. 31;
ARR at 16#2C# range 0 .. 31;
CCR1 at 16#34# range 0 .. 31;
CCR2 at 16#38# range 0 .. 31;
CCR3 at 16#3C# range 0 .. 31;
CCR4 at 16#40# range 0 .. 31;
DCR at 16#48# range 0 .. 31;
DMAR at 16#4C# range 0 .. 31;
CCMR1_Output at 16#18# range 0 .. 31;
CCMR2_Output at 16#1C# range 0 .. 31;
CCMR1_Input at 16#18# range 0 .. 31;
CCMR2_Input at 16#1C# range 0 .. 31;
end record;
-- General purpose timer
TIM2_Periph : aliased TIM2_Peripheral
with Import, Address => TIM2_Base;
type TIM3_Disc is
(Output,
Input);
-- General purpose timer
type TIM3_Peripheral
(Discriminent : TIM3_Disc := Output)
is record
-- control register 1
CR1 : aliased CR1_Register_1;
-- control register 2
CR2 : aliased CR2_Register_1;
-- slave mode control register
SMCR : aliased SMCR_Register;
-- DMA/Interrupt enable register
DIER : aliased DIER_Register_1;
-- status register
SR : aliased SR_Register_1;
-- event generation register
EGR : aliased EGR_Register_1;
-- capture/compare enable register
CCER : aliased CCER_Register_1;
-- counter
CNT : aliased CNT_Register_2;
-- prescaler
PSC : aliased PSC_Register;
-- auto-reload register
ARR : aliased ARR_Register;
-- capture/compare register 1
CCR1 : aliased CCR1_Register;
-- capture/compare register 2
CCR2 : aliased CCR2_Register;
-- capture/compare register 3
CCR3 : aliased CCR3_Register;
-- capture/compare register 4
CCR4 : aliased CCR4_Register;
-- DMA control register
DCR : aliased DCR_Register;
-- DMA address for full transfer
DMAR : aliased DMAR_Register;
case Discriminent is
when Output =>
-- capture/compare mode register 1 (output mode)
CCMR1_Output : aliased CCMR1_Output_Register;
-- capture/compare mode register 2 (output mode)
CCMR2_Output : aliased CCMR2_Output_Register_2;
when Input =>
-- capture/compare mode register 1 (input mode)
CCMR1_Input : aliased CCMR1_Input_Register_1;
-- capture/compare mode register 2 (input mode)
CCMR2_Input : aliased CCMR2_Input_Register;
end case;
end record
with Unchecked_Union, Volatile;
for TIM3_Peripheral use record
CR1 at 16#0# range 0 .. 31;
CR2 at 16#4# range 0 .. 31;
SMCR at 16#8# range 0 .. 31;
DIER at 16#C# range 0 .. 31;
SR at 16#10# range 0 .. 31;
EGR at 16#14# range 0 .. 31;
CCER at 16#20# range 0 .. 31;
CNT at 16#24# range 0 .. 31;
PSC at 16#28# range 0 .. 31;
ARR at 16#2C# range 0 .. 31;
CCR1 at 16#34# range 0 .. 31;
CCR2 at 16#38# range 0 .. 31;
CCR3 at 16#3C# range 0 .. 31;
CCR4 at 16#40# range 0 .. 31;
DCR at 16#48# range 0 .. 31;
DMAR at 16#4C# range 0 .. 31;
CCMR1_Output at 16#18# range 0 .. 31;
CCMR2_Output at 16#1C# range 0 .. 31;
CCMR1_Input at 16#18# range 0 .. 31;
CCMR2_Input at 16#1C# range 0 .. 31;
end record;
-- General purpose timer
TIM3_Periph : aliased TIM3_Peripheral
with Import, Address => TIM3_Base;
-- Basic timers
type TIM6_Peripheral is record
-- control register 1
CR1 : aliased CR1_Register_2;
-- control register 2
CR2 : aliased CR2_Register_2;
-- DMA/Interrupt enable register
DIER : aliased DIER_Register_2;
-- status register
SR : aliased SR_Register_2;
-- event generation register
EGR : aliased EGR_Register_2;
-- counter
CNT : aliased CNT_Register;
-- prescaler
PSC : aliased PSC_Register;
-- auto-reload register
ARR : aliased ARR_Register;
end record
with Volatile;
for TIM6_Peripheral use record
CR1 at 16#0# range 0 .. 31;
CR2 at 16#4# range 0 .. 31;
DIER at 16#C# range 0 .. 31;
SR at 16#10# range 0 .. 31;
EGR at 16#14# range 0 .. 31;
CNT at 16#24# range 0 .. 31;
PSC at 16#28# range 0 .. 31;
ARR at 16#2C# range 0 .. 31;
end record;
-- Basic timers
TIM6_Periph : aliased TIM6_Peripheral
with Import, Address => TIM6_Base;
-- Basic timers
TIM7_Periph : aliased TIM6_Peripheral
with Import, Address => TIM7_Base;
type TIM15_Disc is
(Output,
Input);
-- General purpose timers
type TIM15_Peripheral
(Discriminent : TIM15_Disc := Output)
is record
-- control register 1
CR1 : aliased CR1_Register_3;
-- control register 2
CR2 : aliased CR2_Register_3;
-- slave mode control register
SMCR : aliased SMCR_Register_1;
-- DMA/Interrupt enable register
DIER : aliased DIER_Register_3;
-- status register
SR : aliased SR_Register_3;
-- event generation register
EGR : aliased EGR_Register_3;
-- capture/compare enable register
CCER : aliased CCER_Register_2;
-- counter
CNT : aliased CNT_Register;
-- prescaler
PSC : aliased PSC_Register;
-- auto-reload register
ARR : aliased ARR_Register;
-- repetition counter register
RCR : aliased RCR_Register_1;
-- capture/compare register 1
CCR1 : aliased CCR1_Register;
-- capture/compare register 2
CCR2 : aliased CCR2_Register;
-- break and dead-time register
BDTR : aliased BDTR_Register_1;
-- DMA control register
DCR : aliased DCR_Register;
-- DMA address for full transfer
DMAR : aliased DMAR_Register;
case Discriminent is
when Output =>
-- capture/compare mode register (output mode)
CCMR1_Output : aliased CCMR1_Output_Register;
when Input =>
-- capture/compare mode register 1 (input mode)
CCMR1_Input : aliased CCMR1_Input_Register_1;
end case;
end record
with Unchecked_Union, Volatile;
for TIM15_Peripheral use record
CR1 at 16#0# range 0 .. 31;
CR2 at 16#4# range 0 .. 31;
SMCR at 16#8# range 0 .. 31;
DIER at 16#C# range 0 .. 31;
SR at 16#10# range 0 .. 31;
EGR at 16#14# range 0 .. 31;
CCER at 16#20# range 0 .. 31;
CNT at 16#24# range 0 .. 31;
PSC at 16#28# range 0 .. 31;
ARR at 16#2C# range 0 .. 31;
RCR at 16#30# range 0 .. 31;
CCR1 at 16#34# range 0 .. 31;
CCR2 at 16#38# range 0 .. 31;
BDTR at 16#44# range 0 .. 31;
DCR at 16#48# range 0 .. 31;
DMAR at 16#4C# range 0 .. 31;
CCMR1_Output at 16#18# range 0 .. 31;
CCMR1_Input at 16#18# range 0 .. 31;
end record;
-- General purpose timers
TIM15_Periph : aliased TIM15_Peripheral
with Import, Address => TIM15_Base;
type TIM16_Disc is
(Output,
Input);
-- General-purpose-timers
type TIM16_Peripheral
(Discriminent : TIM16_Disc := Output)
is record
-- control register 1
CR1 : aliased CR1_Register_3;
-- control register 2
CR2 : aliased CR2_Register_4;
-- DMA/Interrupt enable register
DIER : aliased DIER_Register_4;
-- status register
SR : aliased SR_Register_4;
-- event generation register
EGR : aliased EGR_Register_4;
-- capture/compare enable register
CCER : aliased CCER_Register_3;
-- counter
CNT : aliased CNT_Register;
-- prescaler
PSC : aliased PSC_Register;
-- auto-reload register
ARR : aliased ARR_Register;
-- repetition counter register
RCR : aliased RCR_Register_1;
-- capture/compare register 1
CCR1 : aliased CCR1_Register;
-- break and dead-time register
BDTR : aliased BDTR_Register_1;
-- DMA control register
DCR : aliased DCR_Register;
-- DMA address for full transfer
DMAR : aliased DMAR_Register;
-- option register
OR_k : aliased OR_Register_1;
case Discriminent is
when Output =>
-- capture/compare mode register (output mode)
CCMR1_Output : aliased CCMR1_Output_Register_1;
when Input =>
-- capture/compare mode register 1 (input mode)
CCMR1_Input : aliased CCMR1_Input_Register_2;
end case;
end record
with Unchecked_Union, Volatile;
for TIM16_Peripheral use record
CR1 at 16#0# range 0 .. 31;
CR2 at 16#4# range 0 .. 31;
DIER at 16#C# range 0 .. 31;
SR at 16#10# range 0 .. 31;
EGR at 16#14# range 0 .. 31;
CCER at 16#20# range 0 .. 31;
CNT at 16#24# range 0 .. 31;
PSC at 16#28# range 0 .. 31;
ARR at 16#2C# range 0 .. 31;
RCR at 16#30# range 0 .. 31;
CCR1 at 16#34# range 0 .. 31;
BDTR at 16#44# range 0 .. 31;
DCR at 16#48# range 0 .. 31;
DMAR at 16#4C# range 0 .. 31;
OR_k at 16#50# range 0 .. 31;
CCMR1_Output at 16#18# range 0 .. 31;
CCMR1_Input at 16#18# range 0 .. 31;
end record;
-- General-purpose-timers
TIM16_Periph : aliased TIM16_Peripheral
with Import, Address => TIM16_Base;
type TIM17_Disc is
(Output,
Input);
-- General purpose timer
type TIM17_Peripheral
(Discriminent : TIM17_Disc := Output)
is record
-- control register 1
CR1 : aliased CR1_Register_3;
-- control register 2
CR2 : aliased CR2_Register_4;
-- DMA/Interrupt enable register
DIER : aliased DIER_Register_4;
-- status register
SR : aliased SR_Register_4;
-- event generation register
EGR : aliased EGR_Register_4;
-- capture/compare enable register
CCER : aliased CCER_Register_3;
-- counter
CNT : aliased CNT_Register;
-- prescaler
PSC : aliased PSC_Register;
-- auto-reload register
ARR : aliased ARR_Register;
-- repetition counter register
RCR : aliased RCR_Register_1;
-- capture/compare register 1
CCR1 : aliased CCR1_Register;
-- break and dead-time register
BDTR : aliased BDTR_Register_1;
-- DMA control register
DCR : aliased DCR_Register;
-- DMA address for full transfer
DMAR : aliased DMAR_Register;
case Discriminent is
when Output =>
-- capture/compare mode register (output mode)
CCMR1_Output : aliased CCMR1_Output_Register_1;
when Input =>
-- capture/compare mode register 1 (input mode)
CCMR1_Input : aliased CCMR1_Input_Register_2;
end case;
end record
with Unchecked_Union, Volatile;
for TIM17_Peripheral use record
CR1 at 16#0# range 0 .. 31;
CR2 at 16#4# range 0 .. 31;
DIER at 16#C# range 0 .. 31;
SR at 16#10# range 0 .. 31;
EGR at 16#14# range 0 .. 31;
CCER at 16#20# range 0 .. 31;
CNT at 16#24# range 0 .. 31;
PSC at 16#28# range 0 .. 31;
ARR at 16#2C# range 0 .. 31;
RCR at 16#30# range 0 .. 31;
CCR1 at 16#34# range 0 .. 31;
BDTR at 16#44# range 0 .. 31;
DCR at 16#48# range 0 .. 31;
DMAR at 16#4C# range 0 .. 31;
CCMR1_Output at 16#18# range 0 .. 31;
CCMR1_Input at 16#18# range 0 .. 31;
end record;
-- General purpose timer
TIM17_Periph : aliased TIM17_Peripheral
with Import, Address => TIM17_Base;
end STM32_SVD.TIM;
| 35.129817 | 77 | 0.543524 |
582f9cc9a96128aa63656c1a2c1f65a3edb5ab7e | 2,967 | ads | Ada | pgada.ads | io7m/coreland-postgres-ada | 0e7c5294b7638899d10d8cdd4f433c87b4eaf360 | [
"BSD-3-Clause"
] | 1 | 2019-04-04T12:15:31.000Z | 2019-04-04T12:15:31.000Z | pgada.ads | io7m/coreland-postgres-ada | 0e7c5294b7638899d10d8cdd4f433c87b4eaf360 | [
"BSD-3-Clause"
] | null | null | null | pgada.ads | io7m/coreland-postgres-ada | 0e7c5294b7638899d10d8cdd4f433c87b4eaf360 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- P G A D A --
-- --
-- S p e c --
-- --
-- Copyright (c) Samuel Tardieu 2000 --
-- Copyright (c) coreland 2009 --
-- All rights reserved. --
-- --
-- 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 Samuel Tardieu 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 SAMUEL TARDIEU 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 SAMUEL --
-- TARDIEU 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 PGAda is
pragma Pure;
end PGAda;
| 70.642857 | 78 | 0.425008 |
29dc6e7cd85e5f22c3c517deb2730bbd05feeb7a | 2,275 | ads | Ada | bb-runtimes/examples/monitor/net/netloader.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/examples/monitor/net/netloader.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/examples/monitor/net/netloader.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT EXAMPLE --
-- --
-- Copyright (C) 2013, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
package Netloader is
pragma Elaborate_Body;
end Netloader;
| 68.939394 | 78 | 0.453626 |
58178f00f59a18cdce81eaaa8a93a6e77ed1b609 | 921 | ads | Ada | 3-mid/opengl/source/lean/geometry/lit_textured/opengl-geometry-lit_textured.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/opengl/source/lean/geometry/lit_textured/opengl-geometry-lit_textured.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/opengl/source/lean/geometry/lit_textured/opengl-geometry-lit_textured.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | package openGL.Geometry.lit_textured
--
-- Supports per-vertex site texture and lighting.
--
is
type Item is new openGL.Geometry.item with private;
function new_Geometry return access Geometry.lit_textured.item'Class;
----------
-- Vertex
--
type Vertex is
record
Site : Vector_3;
Normal : Vector_3;
Coords : Coordinate_2D;
end record;
type Vertex_array is array (long_Index_t range <>) of aliased Vertex;
--------------
-- Attributes
--
procedure Vertices_are (Self : in out Item; Now : in Vertex_array);
overriding
procedure Indices_are (Self : in out Item; Now : in Indices;
for_Facia : in Positive);
private
type Item is new Geometry.item with null record;
overriding
procedure enable_Texture (Self : in Item);
end openGL.Geometry.lit_textured;
| 20.931818 | 78 | 0.611292 |
1db186663d76f70138635d42c884e8426cb14003 | 5,089 | ads | Ada | arch/RISC-V/SiFive/svd/FE310/fe310_svd-pric.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 192 | 2016-06-01T18:32:04.000Z | 2022-03-26T22:52:31.000Z | arch/RISC-V/SiFive/svd/FE310/fe310_svd-pric.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 239 | 2016-05-26T20:02:01.000Z | 2022-03-31T09:46:56.000Z | arch/RISC-V/SiFive/svd/FE310/fe310_svd-pric.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | -- This spec has been automatically generated from FE310.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package FE310_SVD.PRIC is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype HFROSCCFG_DIV_Field is HAL.UInt6;
subtype HFROSCCFG_TRIM_Field is HAL.UInt5;
-- HF Ring Oscillator Configuration Register.
type HFROSCCFG_Register is record
DIV : HFROSCCFG_DIV_Field := 16#0#;
-- unspecified
Reserved_6_15 : HAL.UInt10 := 16#0#;
TRIM : HFROSCCFG_TRIM_Field := 16#0#;
-- unspecified
Reserved_21_29 : HAL.UInt9 := 16#0#;
ENABLE : Boolean := False;
READY : Boolean := False;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for HFROSCCFG_Register use record
DIV at 0 range 0 .. 5;
Reserved_6_15 at 0 range 6 .. 15;
TRIM at 0 range 16 .. 20;
Reserved_21_29 at 0 range 21 .. 29;
ENABLE at 0 range 30 .. 30;
READY at 0 range 31 .. 31;
end record;
-- HF Crystal Oscillator Configuration Register.
type HFXOSCCFG_Register is record
-- unspecified
Reserved_0_29 : HAL.UInt30 := 16#0#;
ENABLE : Boolean := False;
READY : Boolean := False;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for HFXOSCCFG_Register use record
Reserved_0_29 at 0 range 0 .. 29;
ENABLE at 0 range 30 .. 30;
READY at 0 range 31 .. 31;
end record;
subtype PLLCFG_R_Field is HAL.UInt3;
subtype PLLCFG_F_Field is HAL.UInt6;
subtype PLLCFG_Q_Field is HAL.UInt2;
type PLLCFG_SEL_Field is
(
-- The HFROSCCLK directly drives HFCLK.
Internal,
-- Drive the final HFCLK with PLL output, bypassed or otherwise.
Pll)
with Size => 1;
for PLLCFG_SEL_Field use
(Internal => 0,
Pll => 1);
type PLLCFG_REFSEL_Field is
(
-- Internal Oscillator.
Internal,
-- Crystal OScillator.
Crystal)
with Size => 1;
for PLLCFG_REFSEL_Field use
(Internal => 0,
Crystal => 1);
-- PLL Configuration Register.
type PLLCFG_Register is record
R : PLLCFG_R_Field := 16#0#;
-- unspecified
Reserved_3_3 : HAL.Bit := 16#0#;
F : PLLCFG_F_Field := 16#0#;
Q : PLLCFG_Q_Field := 16#0#;
-- unspecified
Reserved_12_15 : HAL.UInt4 := 16#0#;
SEL : PLLCFG_SEL_Field := FE310_SVD.PRIC.Internal;
REFSEL : PLLCFG_REFSEL_Field := FE310_SVD.PRIC.Internal;
BYPASS : Boolean := False;
-- unspecified
Reserved_19_30 : HAL.UInt12 := 16#0#;
LOCK : Boolean := False;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PLLCFG_Register use record
R at 0 range 0 .. 2;
Reserved_3_3 at 0 range 3 .. 3;
F at 0 range 4 .. 9;
Q at 0 range 10 .. 11;
Reserved_12_15 at 0 range 12 .. 15;
SEL at 0 range 16 .. 16;
REFSEL at 0 range 17 .. 17;
BYPASS at 0 range 18 .. 18;
Reserved_19_30 at 0 range 19 .. 30;
LOCK at 0 range 31 .. 31;
end record;
subtype PLLOUTDIV_DIV_Field is HAL.UInt6;
-- PLL Output Divider Register.
type PLLOUTDIV_Register is record
DIV : PLLOUTDIV_DIV_Field := 16#0#;
-- unspecified
Reserved_6_7 : HAL.UInt2 := 16#0#;
DIV_BY_1 : Boolean := False;
-- unspecified
Reserved_9_31 : HAL.UInt23 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PLLOUTDIV_Register use record
DIV at 0 range 0 .. 5;
Reserved_6_7 at 0 range 6 .. 7;
DIV_BY_1 at 0 range 8 .. 8;
Reserved_9_31 at 0 range 9 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Power, Reset, Clock, Interrupt.
type PRIC_Peripheral is record
-- HF Ring Oscillator Configuration Register.
HFROSCCFG : aliased HFROSCCFG_Register;
-- HF Crystal Oscillator Configuration Register.
HFXOSCCFG : aliased HFXOSCCFG_Register;
-- PLL Configuration Register.
PLLCFG : aliased PLLCFG_Register;
-- PLL Output Divider Register.
PLLOUTDIV : aliased PLLOUTDIV_Register;
end record
with Volatile;
for PRIC_Peripheral use record
HFROSCCFG at 16#0# range 0 .. 31;
HFXOSCCFG at 16#4# range 0 .. 31;
PLLCFG at 16#8# range 0 .. 31;
PLLOUTDIV at 16#C# range 0 .. 31;
end record;
-- Power, Reset, Clock, Interrupt.
PRIC_Periph : aliased PRIC_Peripheral
with Import, Address => System'To_Address (16#10008000#);
end FE310_SVD.PRIC;
| 30.473054 | 71 | 0.583415 |
576d62be7d72169b92123d0d3041f1d975d6b4f8 | 223,594 | adb | Ada | workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls/prj/sol/.autopilot/db/GACTX_bank3.sched.adb | ramcn/Darwin-WGA | e67513ba4fea273fa9b08ddaa148a2ea39805ccb | [
"MIT"
] | null | null | null | workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls/prj/sol/.autopilot/db/GACTX_bank3.sched.adb | ramcn/Darwin-WGA | e67513ba4fea273fa9b08ddaa148a2ea39805ccb | [
"MIT"
] | null | null | null | workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls/prj/sol/.autopilot/db/GACTX_bank3.sched.adb | ramcn/Darwin-WGA | e67513ba4fea273fa9b08ddaa148a2ea39805ccb | [
"MIT"
] | 1 | 2021-01-29T05:03:24.000Z | 2021-01-29T05:03:24.000Z | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="15">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>GACTX_bank3</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>25</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>m00_axi</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></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>2</direction>
<if_type>4</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>m01_axi</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>2</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>sub_AA</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>sub_AA</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_4">
<Value>
<Obj>
<type>1</type>
<id>4</id>
<name>sub_AC</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>sub_AC</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_5">
<Value>
<Obj>
<type>1</type>
<id>5</id>
<name>sub_AG</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>sub_AG</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_6">
<Value>
<Obj>
<type>1</type>
<id>6</id>
<name>sub_AT</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>sub_AT</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_7">
<Value>
<Obj>
<type>1</type>
<id>7</id>
<name>sub_CC</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>sub_CC</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_8">
<Value>
<Obj>
<type>1</type>
<id>8</id>
<name>sub_CG</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>sub_CG</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_9">
<Value>
<Obj>
<type>1</type>
<id>9</id>
<name>sub_CT</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>sub_CT</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_10">
<Value>
<Obj>
<type>1</type>
<id>10</id>
<name>sub_GG</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>sub_GG</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_11">
<Value>
<Obj>
<type>1</type>
<id>11</id>
<name>sub_GT</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>sub_GT</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_12">
<Value>
<Obj>
<type>1</type>
<id>12</id>
<name>sub_TT</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>sub_TT</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_13">
<Value>
<Obj>
<type>1</type>
<id>13</id>
<name>sub_N</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>sub_N</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_14">
<Value>
<Obj>
<type>1</type>
<id>14</id>
<name>gap_open</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>gap_open</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_15">
<Value>
<Obj>
<type>1</type>
<id>15</id>
<name>gap_extend</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>gap_extend</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_16">
<Value>
<Obj>
<type>1</type>
<id>16</id>
<name>y_drop</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>y_drop</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_17">
<Value>
<Obj>
<type>1</type>
<id>17</id>
<name>align_fields</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>align_fields</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_18">
<Value>
<Obj>
<type>1</type>
<id>18</id>
<name>ref_len</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ref_len</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_19">
<Value>
<Obj>
<type>1</type>
<id>19</id>
<name>query_len</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>query_len</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_20">
<Value>
<Obj>
<type>1</type>
<id>20</id>
<name>ref_offset</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ref_offset</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_21">
<Value>
<Obj>
<type>1</type>
<id>21</id>
<name>query_offset</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>query_offset</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_22">
<Value>
<Obj>
<type>1</type>
<id>22</id>
<name>ref_seq</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ref_seq</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_23">
<Value>
<Obj>
<type>1</type>
<id>23</id>
<name>query_seq</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>query_seq</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_24">
<Value>
<Obj>
<type>1</type>
<id>24</id>
<name>tile_output</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tile_output</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_25">
<Value>
<Obj>
<type>1</type>
<id>25</id>
<name>tb_output</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tb_output</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>83</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>tile_output_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>tile_output</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>202</item>
<item>203</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.00</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>ref_seq_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ref_seq</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>204</item>
<item>205</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.00</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>tile_output5</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>62</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>207</item>
<item>208</item>
<item>210</item>
<item>212</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>29</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>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>213</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>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>m01_axi_addr</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>214</item>
<item>215</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>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>ref_seq1</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>62</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>216</item>
<item>217</item>
<item>218</item>
<item>219</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>empty_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></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>220</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>7</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>m00_axi_addr</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>221</item>
<item>222</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>8</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name>m00_axi_input_buffer</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>85</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</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>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>85</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>m00_axi_input_buffer</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>224</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>9</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>m00_axi_output_buffer</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>86</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>86</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>m00_axi_output_buffer</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>225</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>10</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name>m01_axi_input_buffer</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>106</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>106</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>m01_axi_input_buffer</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>226</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>11</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>59</id>
<name>m01_axi_output_buffer</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>107</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>107</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>m01_axi_output_buffer</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>227</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>12</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>87</id>
<name>m00_axi_addr_rd_req</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>229</item>
<item>230</item>
<item>232</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>8.75</m_delay>
<m_topoIndex>13</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>88</id>
<name>_ln94</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>94</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>233</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.60</m_delay>
<m_topoIndex>14</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>90</id>
<name>phi_ln94</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>235</item>
<item>236</item>
<item>237</item>
<item>238</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>15</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>91</id>
<name>icmp_ln94</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>239</item>
<item>241</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.64</m_delay>
<m_topoIndex>16</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>93</id>
<name>add_ln94</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>242</item>
<item>244</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.54</m_delay>
<m_topoIndex>17</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>94</id>
<name>_ln94</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>245</item>
<item>246</item>
<item>247</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>18</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>99</id>
<name>zext_ln94</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>94</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>249</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>20</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>100</id>
<name>m00_axi_addr_read</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>251</item>
<item>252</item>
<item>1040</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>8.75</m_delay>
<m_topoIndex>19</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>101</id>
<name>m00_axi_input_buffer_addr</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>253</item>
<item>255</item>
<item>256</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="_47">
<Value>
<Obj>
<type>0</type>
<id>102</id>
<name>m00_axi_input_buffer_addr_write_ln94</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>94</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>257</item>
<item>258</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.15</m_delay>
<m_topoIndex>22</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>104</id>
<name>_ln94</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>94</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>259</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="_49">
<Value>
<Obj>
<type>0</type>
<id>106</id>
<name>_ln0</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>248</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.60</m_delay>
<m_topoIndex>24</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>108</id>
<name>i_0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>260</item>
<item>261</item>
<item>262</item>
<item>263</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>25</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>110</id>
<name>icmp_ln97</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>97</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>97</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>264</item>
<item>265</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.64</m_delay>
<m_topoIndex>26</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>112</id>
<name>i</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>97</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>97</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>266</item>
<item>267</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.54</m_delay>
<m_topoIndex>27</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>113</id>
<name>_ln97</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>97</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>97</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>268</item>
<item>269</item>
<item>270</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>28</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>115</id>
<name>zext_ln98</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>98</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>98</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>276</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>29</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>116</id>
<name>m00_axi_input_buffer_addr_1</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>98</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>98</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>277</item>
<item>278</item>
<item>279</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>30</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>117</id>
<name>m00_axi_input_buffer_load</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>98</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>98</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>280</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.15</m_delay>
<m_topoIndex>31</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>118</id>
<name>add_ln98</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>98</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>98</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>281</item>
<item>283</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.66</m_delay>
<m_topoIndex>32</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>119</id>
<name>m00_axi_output_buffer_addr</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>98</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>98</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>284</item>
<item>285</item>
<item>286</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>33</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>120</id>
<name>m00_axi_output_buffer_addr_write_ln98</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>98</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>98</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>287</item>
<item>288</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.15</m_delay>
<m_topoIndex>34</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>121</id>
<name>_ln97</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>97</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>97</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>289</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>35</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>123</id>
<name>m00_axi_addr_wr_req</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>102</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>102</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>272</item>
<item>273</item>
<item>274</item>
<item>1041</item>
</oprand_edges>
<opcode>writereq</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.75</m_delay>
<m_topoIndex>36</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_62">
<Value>
<Obj>
<type>0</type>
<id>124</id>
<name>_ln102</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>102</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>102</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>275</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.60</m_delay>
<m_topoIndex>37</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_63">
<Value>
<Obj>
<type>0</type>
<id>126</id>
<name>phi_ln102</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>102</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>102</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>290</item>
<item>291</item>
<item>292</item>
<item>293</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>38</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_64">
<Value>
<Obj>
<type>0</type>
<id>127</id>
<name>icmp_ln102</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>102</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>102</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>294</item>
<item>295</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.64</m_delay>
<m_topoIndex>39</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_65">
<Value>
<Obj>
<type>0</type>
<id>129</id>
<name>add_ln102</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>102</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>102</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>296</item>
<item>297</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.54</m_delay>
<m_topoIndex>40</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_66">
<Value>
<Obj>
<type>0</type>
<id>130</id>
<name>_ln102</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>102</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>102</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>298</item>
<item>299</item>
<item>300</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>41</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_67">
<Value>
<Obj>
<type>0</type>
<id>135</id>
<name>zext_ln102</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>102</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>102</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>308</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>42</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_68">
<Value>
<Obj>
<type>0</type>
<id>136</id>
<name>m00_axi_output_buffer_addr_1</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>102</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>102</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>309</item>
<item>310</item>
<item>311</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>43</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_69">
<Value>
<Obj>
<type>0</type>
<id>137</id>
<name>m00_axi_output_buffer_load</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>102</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>102</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>312</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.15</m_delay>
<m_topoIndex>44</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_70">
<Value>
<Obj>
<type>0</type>
<id>138</id>
<name>m00_axi_addr_write_ln102</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>102</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>102</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>6</count>
<item_version>0</item_version>
<item>314</item>
<item>315</item>
<item>316</item>
<item>318</item>
<item>1043</item>
<item>1044</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.75</m_delay>
<m_topoIndex>45</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_71">
<Value>
<Obj>
<type>0</type>
<id>140</id>
<name>_ln102</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>102</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>102</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>319</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>46</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_72">
<Value>
<Obj>
<type>0</type>
<id>142</id>
<name>m00_axi_addr_wr_resp</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>102</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>102</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>302</item>
<item>303</item>
<item>1042</item>
</oprand_edges>
<opcode>writeresp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.75</m_delay>
<m_topoIndex>48</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_73">
<Value>
<Obj>
<type>0</type>
<id>143</id>
<name>m01_axi_addr_rd_req</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>115</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>115</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>304</item>
<item>305</item>
<item>306</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>8.75</m_delay>
<m_topoIndex>47</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_74">
<Value>
<Obj>
<type>0</type>
<id>144</id>
<name>_ln115</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>115</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>115</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>307</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.60</m_delay>
<m_topoIndex>49</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_75">
<Value>
<Obj>
<type>0</type>
<id>146</id>
<name>phi_ln115</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>115</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>115</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>320</item>
<item>321</item>
<item>322</item>
<item>323</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>50</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_76">
<Value>
<Obj>
<type>0</type>
<id>147</id>
<name>icmp_ln115</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>115</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>115</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>324</item>
<item>325</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.64</m_delay>
<m_topoIndex>51</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_77">
<Value>
<Obj>
<type>0</type>
<id>149</id>
<name>add_ln115</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>115</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>115</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>326</item>
<item>327</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.54</m_delay>
<m_topoIndex>52</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_78">
<Value>
<Obj>
<type>0</type>
<id>150</id>
<name>_ln115</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>115</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>115</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>328</item>
<item>329</item>
<item>330</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>53</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_79">
<Value>
<Obj>
<type>0</type>
<id>155</id>
<name>zext_ln115</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>115</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>115</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>332</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>55</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_80">
<Value>
<Obj>
<type>0</type>
<id>156</id>
<name>m01_axi_addr_read</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>115</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>115</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>333</item>
<item>334</item>
<item>1045</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>8.75</m_delay>
<m_topoIndex>54</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_81">
<Value>
<Obj>
<type>0</type>
<id>157</id>
<name>m01_axi_input_buffer_addr</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>115</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>115</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>335</item>
<item>336</item>
<item>337</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>56</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_82">
<Value>
<Obj>
<type>0</type>
<id>158</id>
<name>m01_axi_input_buffer_addr_write_ln115</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>115</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>115</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>338</item>
<item>339</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.15</m_delay>
<m_topoIndex>57</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_83">
<Value>
<Obj>
<type>0</type>
<id>160</id>
<name>_ln115</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>115</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>115</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>340</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>58</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_84">
<Value>
<Obj>
<type>0</type>
<id>162</id>
<name>_ln0</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>331</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.60</m_delay>
<m_topoIndex>59</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_85">
<Value>
<Obj>
<type>0</type>
<id>164</id>
<name>i1_0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>341</item>
<item>342</item>
<item>343</item>
<item>344</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>60</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_86">
<Value>
<Obj>
<type>0</type>
<id>166</id>
<name>icmp_ln118</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>118</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>118</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>345</item>
<item>346</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.64</m_delay>
<m_topoIndex>61</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_87">
<Value>
<Obj>
<type>0</type>
<id>168</id>
<name>i_1</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>118</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>118</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>347</item>
<item>348</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.54</m_delay>
<m_topoIndex>62</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_88">
<Value>
<Obj>
<type>0</type>
<id>169</id>
<name>_ln118</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>118</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>118</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>349</item>
<item>350</item>
<item>351</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>63</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_89">
<Value>
<Obj>
<type>0</type>
<id>171</id>
<name>zext_ln119</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>119</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>119</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>356</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>64</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_90">
<Value>
<Obj>
<type>0</type>
<id>172</id>
<name>m01_axi_input_buffer_addr_1</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>119</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>119</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>357</item>
<item>358</item>
<item>359</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>65</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_91">
<Value>
<Obj>
<type>0</type>
<id>173</id>
<name>m01_axi_input_buffer_load</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>119</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>119</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>360</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.15</m_delay>
<m_topoIndex>66</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_92">
<Value>
<Obj>
<type>0</type>
<id>174</id>
<name>add_ln119</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>119</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>119</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>361</item>
<item>362</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.66</m_delay>
<m_topoIndex>67</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_93">
<Value>
<Obj>
<type>0</type>
<id>175</id>
<name>m01_axi_output_buffer_addr</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>119</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>119</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>363</item>
<item>364</item>
<item>365</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>68</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_94">
<Value>
<Obj>
<type>0</type>
<id>176</id>
<name>m01_axi_output_buffer_addr_write_ln119</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>119</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>119</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>366</item>
<item>367</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.15</m_delay>
<m_topoIndex>69</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_95">
<Value>
<Obj>
<type>0</type>
<id>177</id>
<name>_ln118</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>118</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>118</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>368</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>70</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_96">
<Value>
<Obj>
<type>0</type>
<id>179</id>
<name>m01_axi_addr_wr_req</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>123</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>123</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>352</item>
<item>353</item>
<item>354</item>
<item>1046</item>
</oprand_edges>
<opcode>writereq</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.75</m_delay>
<m_topoIndex>71</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_97">
<Value>
<Obj>
<type>0</type>
<id>180</id>
<name>_ln123</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>123</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>123</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>355</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.60</m_delay>
<m_topoIndex>72</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_98">
<Value>
<Obj>
<type>0</type>
<id>182</id>
<name>phi_ln123</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>123</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>123</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>369</item>
<item>370</item>
<item>371</item>
<item>372</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>73</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_99">
<Value>
<Obj>
<type>0</type>
<id>183</id>
<name>icmp_ln123</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>123</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>123</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>373</item>
<item>374</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.64</m_delay>
<m_topoIndex>74</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_100">
<Value>
<Obj>
<type>0</type>
<id>185</id>
<name>add_ln123</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>123</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>123</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>375</item>
<item>376</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.54</m_delay>
<m_topoIndex>75</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_101">
<Value>
<Obj>
<type>0</type>
<id>186</id>
<name>_ln123</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>123</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>123</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>377</item>
<item>378</item>
<item>379</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>76</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_102">
<Value>
<Obj>
<type>0</type>
<id>191</id>
<name>zext_ln123</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>123</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>123</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>380</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>77</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_103">
<Value>
<Obj>
<type>0</type>
<id>192</id>
<name>m01_axi_output_buffer_addr_1</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>123</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>123</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>381</item>
<item>382</item>
<item>383</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>78</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_104">
<Value>
<Obj>
<type>0</type>
<id>193</id>
<name>m01_axi_output_buffer_load</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>123</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>123</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>384</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.15</m_delay>
<m_topoIndex>79</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_105">
<Value>
<Obj>
<type>0</type>
<id>194</id>
<name>m01_axi_addr_write_ln123</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>123</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>123</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>6</count>
<item_version>0</item_version>
<item>385</item>
<item>386</item>
<item>387</item>
<item>388</item>
<item>1048</item>
<item>1049</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.75</m_delay>
<m_topoIndex>80</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_106">
<Value>
<Obj>
<type>0</type>
<id>196</id>
<name>_ln123</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>123</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>123</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>389</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>81</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_107">
<Value>
<Obj>
<type>0</type>
<id>198</id>
<name>m01_axi_addr_wr_resp</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>123</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>123</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>390</item>
<item>391</item>
<item>1047</item>
</oprand_edges>
<opcode>writeresp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.75</m_delay>
<m_topoIndex>82</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_108">
<Value>
<Obj>
<type>0</type>
<id>199</id>
<name>_ln126</name>
<fileName>../GACTX_bank3_cmodel.cpp</fileName>
<fileDirectory>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</fileDirectory>
<lineNumber>126</lineNumber>
<contextFuncName>GACTX_bank3</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nimbix/workspace/GACTX_bank3/vivado_rtl_kernel/GACTX_bank3_ex/imports/hls</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../GACTX_bank3_cmodel.cpp</first>
<second>GACTX_bank3</second>
</first>
<second>126</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>83</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_109">
<Value>
<Obj>
<type>2</type>
<id>209</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>2</content>
</item>
<item class_id_reference="16" object_id="_110">
<Value>
<Obj>
<type>2</type>
<id>211</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>63</content>
</item>
<item class_id_reference="16" object_id="_111">
<Value>
<Obj>
<type>2</type>
<id>223</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_112">
<Value>
<Obj>
<type>2</type>
<id>231</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>4096</content>
</item>
<item class_id_reference="16" object_id="_113">
<Value>
<Obj>
<type>2</type>
<id>234</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_114">
<Value>
<Obj>
<type>2</type>
<id>240</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<const_type>0</const_type>
<content>4096</content>
</item>
<item class_id_reference="16" object_id="_115">
<Value>
<Obj>
<type>2</type>
<id>243</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_116">
<Value>
<Obj>
<type>2</type>
<id>254</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_117">
<Value>
<Obj>
<type>2</type>
<id>282</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_118">
<Value>
<Obj>
<type>2</type>
<id>317</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>15</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>19</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_119">
<Obj>
<type>3</type>
<id>89</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>14</count>
<item_version>0</item_version>
<item>26</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>56</item>
<item>57</item>
<item>58</item>
<item>59</item>
<item>87</item>
<item>88</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_120">
<Obj>
<type>3</type>
<id>95</id>
<name>burst.rd.header</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>90</item>
<item>91</item>
<item>93</item>
<item>94</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_121">
<Obj>
<type>3</type>
<id>105</id>
<name>burstread.region</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>5</count>
<item_version>0</item_version>
<item>99</item>
<item>100</item>
<item>101</item>
<item>102</item>
<item>104</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_122">
<Obj>
<type>3</type>
<id>107</id>
<name>burst.rd.end.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>106</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_123">
<Obj>
<type>3</type>
<id>114</id>
<name>burst.rd.end</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>108</item>
<item>110</item>
<item>112</item>
<item>113</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_124">
<Obj>
<type>3</type>
<id>122</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>7</count>
<item_version>0</item_version>
<item>115</item>
<item>116</item>
<item>117</item>
<item>118</item>
<item>119</item>
<item>120</item>
<item>121</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_125">
<Obj>
<type>3</type>
<id>125</id>
<name>burst.wr.header.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>123</item>
<item>124</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_126">
<Obj>
<type>3</type>
<id>131</id>
<name>burst.wr.header</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>126</item>
<item>127</item>
<item>129</item>
<item>130</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_127">
<Obj>
<type>3</type>
<id>141</id>
<name>burstwrite.region</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>5</count>
<item_version>0</item_version>
<item>135</item>
<item>136</item>
<item>137</item>
<item>138</item>
<item>140</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_128">
<Obj>
<type>3</type>
<id>145</id>
<name>burst.rd.header21.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>142</item>
<item>143</item>
<item>144</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_129">
<Obj>
<type>3</type>
<id>151</id>
<name>burst.rd.header21</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>146</item>
<item>147</item>
<item>149</item>
<item>150</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_130">
<Obj>
<type>3</type>
<id>161</id>
<name>burstread.region1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>5</count>
<item_version>0</item_version>
<item>155</item>
<item>156</item>
<item>157</item>
<item>158</item>
<item>160</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_131">
<Obj>
<type>3</type>
<id>163</id>
<name>burst.rd.end20.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>162</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_132">
<Obj>
<type>3</type>
<id>170</id>
<name>burst.rd.end20</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>164</item>
<item>166</item>
<item>168</item>
<item>169</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_133">
<Obj>
<type>3</type>
<id>178</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>7</count>
<item_version>0</item_version>
<item>171</item>
<item>172</item>
<item>173</item>
<item>174</item>
<item>175</item>
<item>176</item>
<item>177</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_134">
<Obj>
<type>3</type>
<id>181</id>
<name>burst.wr.header33.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>179</item>
<item>180</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_135">
<Obj>
<type>3</type>
<id>187</id>
<name>burst.wr.header33</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>182</item>
<item>183</item>
<item>185</item>
<item>186</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_136">
<Obj>
<type>3</type>
<id>197</id>
<name>burstwrite.region1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>5</count>
<item_version>0</item_version>
<item>191</item>
<item>192</item>
<item>193</item>
<item>194</item>
<item>196</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_137">
<Obj>
<type>3</type>
<id>200</id>
<name>memcpy.tail46</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>198</item>
<item>199</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>194</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_138">
<id>203</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_139">
<id>205</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_140">
<id>208</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="_141">
<id>210</id>
<edge_type>1</edge_type>
<source_obj>209</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_142">
<id>212</id>
<edge_type>1</edge_type>
<source_obj>211</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_143">
<id>213</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_144">
<id>214</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_145">
<id>215</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_146">
<id>217</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_147">
<id>218</id>
<edge_type>1</edge_type>
<source_obj>209</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_148">
<id>219</id>
<edge_type>1</edge_type>
<source_obj>211</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_149">
<id>220</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_150">
<id>221</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_151">
<id>222</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_152">
<id>224</id>
<edge_type>1</edge_type>
<source_obj>223</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_153">
<id>225</id>
<edge_type>1</edge_type>
<source_obj>223</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_154">
<id>226</id>
<edge_type>1</edge_type>
<source_obj>223</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_155">
<id>227</id>
<edge_type>1</edge_type>
<source_obj>223</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_156">
<id>230</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_157">
<id>232</id>
<edge_type>1</edge_type>
<source_obj>231</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_158">
<id>233</id>
<edge_type>2</edge_type>
<source_obj>95</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_159">
<id>235</id>
<edge_type>1</edge_type>
<source_obj>234</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_160">
<id>236</id>
<edge_type>2</edge_type>
<source_obj>89</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_161">
<id>237</id>
<edge_type>1</edge_type>
<source_obj>93</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_162">
<id>238</id>
<edge_type>2</edge_type>
<source_obj>105</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_163">
<id>239</id>
<edge_type>1</edge_type>
<source_obj>90</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_164">
<id>241</id>
<edge_type>1</edge_type>
<source_obj>240</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_165">
<id>242</id>
<edge_type>1</edge_type>
<source_obj>90</source_obj>
<sink_obj>93</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_166">
<id>244</id>
<edge_type>1</edge_type>
<source_obj>243</source_obj>
<sink_obj>93</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_167">
<id>245</id>
<edge_type>1</edge_type>
<source_obj>91</source_obj>
<sink_obj>94</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_168">
<id>246</id>
<edge_type>2</edge_type>
<source_obj>105</source_obj>
<sink_obj>94</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_169">
<id>247</id>
<edge_type>2</edge_type>
<source_obj>107</source_obj>
<sink_obj>94</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_170">
<id>248</id>
<edge_type>2</edge_type>
<source_obj>114</source_obj>
<sink_obj>106</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_171">
<id>249</id>
<edge_type>1</edge_type>
<source_obj>90</source_obj>
<sink_obj>99</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_172">
<id>252</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_173">
<id>253</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_174">
<id>255</id>
<edge_type>1</edge_type>
<source_obj>254</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_175">
<id>256</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_176">
<id>257</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_177">
<id>258</id>
<edge_type>1</edge_type>
<source_obj>101</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_178">
<id>259</id>
<edge_type>2</edge_type>
<source_obj>95</source_obj>
<sink_obj>104</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_179">
<id>260</id>
<edge_type>1</edge_type>
<source_obj>112</source_obj>
<sink_obj>108</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_180">
<id>261</id>
<edge_type>2</edge_type>
<source_obj>122</source_obj>
<sink_obj>108</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_181">
<id>262</id>
<edge_type>1</edge_type>
<source_obj>234</source_obj>
<sink_obj>108</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_182">
<id>263</id>
<edge_type>2</edge_type>
<source_obj>107</source_obj>
<sink_obj>108</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_183">
<id>264</id>
<edge_type>1</edge_type>
<source_obj>108</source_obj>
<sink_obj>110</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_184">
<id>265</id>
<edge_type>1</edge_type>
<source_obj>240</source_obj>
<sink_obj>110</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_185">
<id>266</id>
<edge_type>1</edge_type>
<source_obj>108</source_obj>
<sink_obj>112</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_186">
<id>267</id>
<edge_type>1</edge_type>
<source_obj>243</source_obj>
<sink_obj>112</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_187">
<id>268</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>113</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_188">
<id>269</id>
<edge_type>2</edge_type>
<source_obj>122</source_obj>
<sink_obj>113</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_189">
<id>270</id>
<edge_type>2</edge_type>
<source_obj>125</source_obj>
<sink_obj>113</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_190">
<id>273</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>123</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_191">
<id>274</id>
<edge_type>1</edge_type>
<source_obj>231</source_obj>
<sink_obj>123</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_192">
<id>275</id>
<edge_type>2</edge_type>
<source_obj>131</source_obj>
<sink_obj>124</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_193">
<id>276</id>
<edge_type>1</edge_type>
<source_obj>108</source_obj>
<sink_obj>115</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_194">
<id>277</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>116</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_195">
<id>278</id>
<edge_type>1</edge_type>
<source_obj>254</source_obj>
<sink_obj>116</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_196">
<id>279</id>
<edge_type>1</edge_type>
<source_obj>115</source_obj>
<sink_obj>116</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_197">
<id>280</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>117</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_198">
<id>281</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>118</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_199">
<id>283</id>
<edge_type>1</edge_type>
<source_obj>282</source_obj>
<sink_obj>118</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_200">
<id>284</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>119</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_201">
<id>285</id>
<edge_type>1</edge_type>
<source_obj>254</source_obj>
<sink_obj>119</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_202">
<id>286</id>
<edge_type>1</edge_type>
<source_obj>115</source_obj>
<sink_obj>119</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_203">
<id>287</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_204">
<id>288</id>
<edge_type>1</edge_type>
<source_obj>119</source_obj>
<sink_obj>120</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_205">
<id>289</id>
<edge_type>2</edge_type>
<source_obj>114</source_obj>
<sink_obj>121</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_206">
<id>290</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>126</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_207">
<id>291</id>
<edge_type>2</edge_type>
<source_obj>141</source_obj>
<sink_obj>126</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_208">
<id>292</id>
<edge_type>1</edge_type>
<source_obj>234</source_obj>
<sink_obj>126</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_209">
<id>293</id>
<edge_type>2</edge_type>
<source_obj>125</source_obj>
<sink_obj>126</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_210">
<id>294</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>127</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_211">
<id>295</id>
<edge_type>1</edge_type>
<source_obj>240</source_obj>
<sink_obj>127</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_212">
<id>296</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>129</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_213">
<id>297</id>
<edge_type>1</edge_type>
<source_obj>243</source_obj>
<sink_obj>129</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_214">
<id>298</id>
<edge_type>1</edge_type>
<source_obj>127</source_obj>
<sink_obj>130</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_215">
<id>299</id>
<edge_type>2</edge_type>
<source_obj>141</source_obj>
<sink_obj>130</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_216">
<id>300</id>
<edge_type>2</edge_type>
<source_obj>145</source_obj>
<sink_obj>130</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_217">
<id>303</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>142</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_218">
<id>305</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>143</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_219">
<id>306</id>
<edge_type>1</edge_type>
<source_obj>231</source_obj>
<sink_obj>143</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_220">
<id>307</id>
<edge_type>2</edge_type>
<source_obj>151</source_obj>
<sink_obj>144</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_221">
<id>308</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>135</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_222">
<id>309</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>136</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_223">
<id>310</id>
<edge_type>1</edge_type>
<source_obj>254</source_obj>
<sink_obj>136</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_224">
<id>311</id>
<edge_type>1</edge_type>
<source_obj>135</source_obj>
<sink_obj>136</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_225">
<id>312</id>
<edge_type>1</edge_type>
<source_obj>136</source_obj>
<sink_obj>137</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_226">
<id>315</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>138</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_227">
<id>316</id>
<edge_type>1</edge_type>
<source_obj>137</source_obj>
<sink_obj>138</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_228">
<id>318</id>
<edge_type>1</edge_type>
<source_obj>317</source_obj>
<sink_obj>138</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_229">
<id>319</id>
<edge_type>2</edge_type>
<source_obj>131</source_obj>
<sink_obj>140</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_230">
<id>320</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>146</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_231">
<id>321</id>
<edge_type>2</edge_type>
<source_obj>161</source_obj>
<sink_obj>146</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_232">
<id>322</id>
<edge_type>1</edge_type>
<source_obj>234</source_obj>
<sink_obj>146</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_233">
<id>323</id>
<edge_type>2</edge_type>
<source_obj>145</source_obj>
<sink_obj>146</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_234">
<id>324</id>
<edge_type>1</edge_type>
<source_obj>146</source_obj>
<sink_obj>147</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_235">
<id>325</id>
<edge_type>1</edge_type>
<source_obj>240</source_obj>
<sink_obj>147</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_236">
<id>326</id>
<edge_type>1</edge_type>
<source_obj>146</source_obj>
<sink_obj>149</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_237">
<id>327</id>
<edge_type>1</edge_type>
<source_obj>243</source_obj>
<sink_obj>149</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_238">
<id>328</id>
<edge_type>1</edge_type>
<source_obj>147</source_obj>
<sink_obj>150</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_239">
<id>329</id>
<edge_type>2</edge_type>
<source_obj>161</source_obj>
<sink_obj>150</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_240">
<id>330</id>
<edge_type>2</edge_type>
<source_obj>163</source_obj>
<sink_obj>150</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_241">
<id>331</id>
<edge_type>2</edge_type>
<source_obj>170</source_obj>
<sink_obj>162</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_242">
<id>332</id>
<edge_type>1</edge_type>
<source_obj>146</source_obj>
<sink_obj>155</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_243">
<id>334</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>156</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_244">
<id>335</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>157</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_245">
<id>336</id>
<edge_type>1</edge_type>
<source_obj>254</source_obj>
<sink_obj>157</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_246">
<id>337</id>
<edge_type>1</edge_type>
<source_obj>155</source_obj>
<sink_obj>157</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_247">
<id>338</id>
<edge_type>1</edge_type>
<source_obj>156</source_obj>
<sink_obj>158</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_248">
<id>339</id>
<edge_type>1</edge_type>
<source_obj>157</source_obj>
<sink_obj>158</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_249">
<id>340</id>
<edge_type>2</edge_type>
<source_obj>151</source_obj>
<sink_obj>160</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_250">
<id>341</id>
<edge_type>1</edge_type>
<source_obj>168</source_obj>
<sink_obj>164</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_251">
<id>342</id>
<edge_type>2</edge_type>
<source_obj>178</source_obj>
<sink_obj>164</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_252">
<id>343</id>
<edge_type>1</edge_type>
<source_obj>234</source_obj>
<sink_obj>164</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_253">
<id>344</id>
<edge_type>2</edge_type>
<source_obj>163</source_obj>
<sink_obj>164</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_254">
<id>345</id>
<edge_type>1</edge_type>
<source_obj>164</source_obj>
<sink_obj>166</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_255">
<id>346</id>
<edge_type>1</edge_type>
<source_obj>240</source_obj>
<sink_obj>166</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_256">
<id>347</id>
<edge_type>1</edge_type>
<source_obj>164</source_obj>
<sink_obj>168</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_257">
<id>348</id>
<edge_type>1</edge_type>
<source_obj>243</source_obj>
<sink_obj>168</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_258">
<id>349</id>
<edge_type>1</edge_type>
<source_obj>166</source_obj>
<sink_obj>169</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_259">
<id>350</id>
<edge_type>2</edge_type>
<source_obj>178</source_obj>
<sink_obj>169</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_260">
<id>351</id>
<edge_type>2</edge_type>
<source_obj>181</source_obj>
<sink_obj>169</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_261">
<id>353</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_262">
<id>354</id>
<edge_type>1</edge_type>
<source_obj>231</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_263">
<id>355</id>
<edge_type>2</edge_type>
<source_obj>187</source_obj>
<sink_obj>180</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_264">
<id>356</id>
<edge_type>1</edge_type>
<source_obj>164</source_obj>
<sink_obj>171</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_265">
<id>357</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>172</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_266">
<id>358</id>
<edge_type>1</edge_type>
<source_obj>254</source_obj>
<sink_obj>172</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_267">
<id>359</id>
<edge_type>1</edge_type>
<source_obj>171</source_obj>
<sink_obj>172</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_268">
<id>360</id>
<edge_type>1</edge_type>
<source_obj>172</source_obj>
<sink_obj>173</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_269">
<id>361</id>
<edge_type>1</edge_type>
<source_obj>173</source_obj>
<sink_obj>174</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_270">
<id>362</id>
<edge_type>1</edge_type>
<source_obj>282</source_obj>
<sink_obj>174</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_271">
<id>363</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>175</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_272">
<id>364</id>
<edge_type>1</edge_type>
<source_obj>254</source_obj>
<sink_obj>175</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_273">
<id>365</id>
<edge_type>1</edge_type>
<source_obj>171</source_obj>
<sink_obj>175</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_274">
<id>366</id>
<edge_type>1</edge_type>
<source_obj>174</source_obj>
<sink_obj>176</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_275">
<id>367</id>
<edge_type>1</edge_type>
<source_obj>175</source_obj>
<sink_obj>176</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_276">
<id>368</id>
<edge_type>2</edge_type>
<source_obj>170</source_obj>
<sink_obj>177</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_277">
<id>369</id>
<edge_type>1</edge_type>
<source_obj>185</source_obj>
<sink_obj>182</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_278">
<id>370</id>
<edge_type>2</edge_type>
<source_obj>197</source_obj>
<sink_obj>182</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_279">
<id>371</id>
<edge_type>1</edge_type>
<source_obj>234</source_obj>
<sink_obj>182</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_280">
<id>372</id>
<edge_type>2</edge_type>
<source_obj>181</source_obj>
<sink_obj>182</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_281">
<id>373</id>
<edge_type>1</edge_type>
<source_obj>182</source_obj>
<sink_obj>183</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_282">
<id>374</id>
<edge_type>1</edge_type>
<source_obj>240</source_obj>
<sink_obj>183</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_283">
<id>375</id>
<edge_type>1</edge_type>
<source_obj>182</source_obj>
<sink_obj>185</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_284">
<id>376</id>
<edge_type>1</edge_type>
<source_obj>243</source_obj>
<sink_obj>185</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_285">
<id>377</id>
<edge_type>1</edge_type>
<source_obj>183</source_obj>
<sink_obj>186</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_286">
<id>378</id>
<edge_type>2</edge_type>
<source_obj>197</source_obj>
<sink_obj>186</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_287">
<id>379</id>
<edge_type>2</edge_type>
<source_obj>200</source_obj>
<sink_obj>186</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_288">
<id>380</id>
<edge_type>1</edge_type>
<source_obj>182</source_obj>
<sink_obj>191</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_289">
<id>381</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>192</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_290">
<id>382</id>
<edge_type>1</edge_type>
<source_obj>254</source_obj>
<sink_obj>192</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_291">
<id>383</id>
<edge_type>1</edge_type>
<source_obj>191</source_obj>
<sink_obj>192</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_292">
<id>384</id>
<edge_type>1</edge_type>
<source_obj>192</source_obj>
<sink_obj>193</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_293">
<id>386</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>194</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_294">
<id>387</id>
<edge_type>1</edge_type>
<source_obj>193</source_obj>
<sink_obj>194</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_295">
<id>388</id>
<edge_type>1</edge_type>
<source_obj>317</source_obj>
<sink_obj>194</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_296">
<id>389</id>
<edge_type>2</edge_type>
<source_obj>187</source_obj>
<sink_obj>196</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_297">
<id>391</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>198</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_298">
<id>1016</id>
<edge_type>2</edge_type>
<source_obj>89</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_299">
<id>1017</id>
<edge_type>2</edge_type>
<source_obj>95</source_obj>
<sink_obj>107</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_300">
<id>1018</id>
<edge_type>2</edge_type>
<source_obj>95</source_obj>
<sink_obj>105</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_301">
<id>1019</id>
<edge_type>2</edge_type>
<source_obj>105</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_302">
<id>1020</id>
<edge_type>2</edge_type>
<source_obj>107</source_obj>
<sink_obj>114</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_303">
<id>1021</id>
<edge_type>2</edge_type>
<source_obj>114</source_obj>
<sink_obj>125</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_304">
<id>1022</id>
<edge_type>2</edge_type>
<source_obj>114</source_obj>
<sink_obj>122</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_305">
<id>1023</id>
<edge_type>2</edge_type>
<source_obj>122</source_obj>
<sink_obj>114</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_306">
<id>1024</id>
<edge_type>2</edge_type>
<source_obj>125</source_obj>
<sink_obj>131</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_307">
<id>1025</id>
<edge_type>2</edge_type>
<source_obj>131</source_obj>
<sink_obj>145</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_308">
<id>1026</id>
<edge_type>2</edge_type>
<source_obj>131</source_obj>
<sink_obj>141</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_309">
<id>1027</id>
<edge_type>2</edge_type>
<source_obj>141</source_obj>
<sink_obj>131</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_310">
<id>1028</id>
<edge_type>2</edge_type>
<source_obj>145</source_obj>
<sink_obj>151</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_311">
<id>1029</id>
<edge_type>2</edge_type>
<source_obj>151</source_obj>
<sink_obj>163</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_312">
<id>1030</id>
<edge_type>2</edge_type>
<source_obj>151</source_obj>
<sink_obj>161</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_313">
<id>1031</id>
<edge_type>2</edge_type>
<source_obj>161</source_obj>
<sink_obj>151</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_314">
<id>1032</id>
<edge_type>2</edge_type>
<source_obj>163</source_obj>
<sink_obj>170</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_315">
<id>1033</id>
<edge_type>2</edge_type>
<source_obj>170</source_obj>
<sink_obj>181</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_316">
<id>1034</id>
<edge_type>2</edge_type>
<source_obj>170</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_317">
<id>1035</id>
<edge_type>2</edge_type>
<source_obj>178</source_obj>
<sink_obj>170</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_318">
<id>1036</id>
<edge_type>2</edge_type>
<source_obj>181</source_obj>
<sink_obj>187</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_319">
<id>1037</id>
<edge_type>2</edge_type>
<source_obj>187</source_obj>
<sink_obj>200</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_320">
<id>1038</id>
<edge_type>2</edge_type>
<source_obj>187</source_obj>
<sink_obj>197</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_321">
<id>1039</id>
<edge_type>2</edge_type>
<source_obj>197</source_obj>
<sink_obj>187</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_322">
<id>1040</id>
<edge_type>4</edge_type>
<source_obj>87</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_323">
<id>1041</id>
<edge_type>4</edge_type>
<source_obj>87</source_obj>
<sink_obj>123</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_324">
<id>1042</id>
<edge_type>4</edge_type>
<source_obj>87</source_obj>
<sink_obj>142</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_325">
<id>1043</id>
<edge_type>4</edge_type>
<source_obj>87</source_obj>
<sink_obj>138</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_326">
<id>1044</id>
<edge_type>4</edge_type>
<source_obj>123</source_obj>
<sink_obj>138</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_327">
<id>1045</id>
<edge_type>4</edge_type>
<source_obj>143</source_obj>
<sink_obj>156</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_328">
<id>1046</id>
<edge_type>4</edge_type>
<source_obj>143</source_obj>
<sink_obj>179</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_329">
<id>1047</id>
<edge_type>4</edge_type>
<source_obj>143</source_obj>
<sink_obj>198</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_330">
<id>1048</id>
<edge_type>4</edge_type>
<source_obj>143</source_obj>
<sink_obj>194</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_331">
<id>1049</id>
<edge_type>4</edge_type>
<source_obj>179</source_obj>
<sink_obj>194</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>14</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_332">
<mId>1</mId>
<mTag>GACTX_bank3</mTag>
<mType>0</mType>
<sub_regions>
<count>13</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
<item>5</item>
<item>6</item>
<item>7</item>
<item>8</item>
<item>9</item>
<item>10</item>
<item>11</item>
<item>12</item>
<item>13</item>
<item>14</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>24609</mMinLatency>
<mMaxLatency>24609</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_333">
<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>89</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="_334">
<mId>3</mId>
<mTag>memcpy.m00_axi_input_buffer.ref_seq</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>95</item>
<item>105</item>
</basic_blocks>
<mII>1</mII>
<mDepth>3</mDepth>
<mMinTripCount>4096</mMinTripCount>
<mMaxTripCount>4096</mMaxTripCount>
<mMinLatency>4097</mMinLatency>
<mMaxLatency>4097</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_335">
<mId>4</mId>
<mTag>Region 1</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>107</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_336">
<mId>5</mId>
<mTag>Loop 2</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>114</item>
<item>122</item>
</basic_blocks>
<mII>1</mII>
<mDepth>2</mDepth>
<mMinTripCount>4096</mMinTripCount>
<mMaxTripCount>4096</mMaxTripCount>
<mMinLatency>4096</mMinLatency>
<mMaxLatency>4096</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_337">
<mId>6</mId>
<mTag>Region 2</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>125</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_338">
<mId>7</mId>
<mTag>memcpy.ref_seq.m00_axi_output_buffer.gep</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>131</item>
<item>141</item>
</basic_blocks>
<mII>1</mII>
<mDepth>3</mDepth>
<mMinTripCount>4096</mMinTripCount>
<mMaxTripCount>4096</mMaxTripCount>
<mMinLatency>4097</mMinLatency>
<mMaxLatency>4097</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_339">
<mId>8</mId>
<mTag>Region 3</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>145</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>6</mMinLatency>
<mMaxLatency>6</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_340">
<mId>9</mId>
<mTag>memcpy.m01_axi_input_buffer.tile_output</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>151</item>
<item>161</item>
</basic_blocks>
<mII>1</mII>
<mDepth>3</mDepth>
<mMinTripCount>4096</mMinTripCount>
<mMaxTripCount>4096</mMaxTripCount>
<mMinLatency>4097</mMinLatency>
<mMaxLatency>4097</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_341">
<mId>10</mId>
<mTag>Region 4</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>163</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_342">
<mId>11</mId>
<mTag>Loop 5</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>170</item>
<item>178</item>
</basic_blocks>
<mII>1</mII>
<mDepth>2</mDepth>
<mMinTripCount>4096</mMinTripCount>
<mMaxTripCount>4096</mMaxTripCount>
<mMinLatency>4096</mMinLatency>
<mMaxLatency>4096</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_343">
<mId>12</mId>
<mTag>Region 5</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>181</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_344">
<mId>13</mId>
<mTag>memcpy.tile_output.m01_axi_output_buffer.gep</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>187</item>
<item>197</item>
</basic_blocks>
<mII>1</mII>
<mDepth>3</mDepth>
<mMinTripCount>4096</mMinTripCount>
<mMaxTripCount>4096</mMaxTripCount>
<mMinLatency>4097</mMinLatency>
<mMaxLatency>4097</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_345">
<mId>14</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>200</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>4</mMinLatency>
<mMaxLatency>4</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="-1"></fsm>
<res class_id="-1"></res>
<node_label_latency class_id="26" tracking_level="0" version="0">
<count>83</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>26</first>
<second class_id="28" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>87</first>
<second>
<first>1</first>
<second>6</second>
</second>
</item>
<item>
<first>88</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>90</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>91</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>93</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>94</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>99</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>100</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>101</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>102</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>104</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>106</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>108</first>
<second>
<first>12</first>
<second>0</second>
</second>
</item>
<item>
<first>110</first>
<second>
<first>12</first>
<second>0</second>
</second>
</item>
<item>
<first>112</first>
<second>
<first>12</first>
<second>0</second>
</second>
</item>
<item>
<first>113</first>
<second>
<first>12</first>
<second>0</second>
</second>
</item>
<item>
<first>115</first>
<second>
<first>12</first>
<second>0</second>
</second>
</item>
<item>
<first>116</first>
<second>
<first>12</first>
<second>0</second>
</second>
</item>
<item>
<first>117</first>
<second>
<first>12</first>
<second>1</second>
</second>
</item>
<item>
<first>118</first>
<second>
<first>13</first>
<second>0</second>
</second>
</item>
<item>
<first>119</first>
<second>
<first>13</first>
<second>0</second>
</second>
</item>
<item>
<first>120</first>
<second>
<first>13</first>
<second>0</second>
</second>
</item>
<item>
<first>121</first>
<second>
<first>13</first>
<second>0</second>
</second>
</item>
<item>
<first>123</first>
<second>
<first>14</first>
<second>0</second>
</second>
</item>
<item>
<first>124</first>
<second>
<first>14</first>
<second>0</second>
</second>
</item>
<item>
<first>126</first>
<second>
<first>15</first>
<second>0</second>
</second>
</item>
<item>
<first>127</first>
<second>
<first>15</first>
<second>0</second>
</second>
</item>
<item>
<first>129</first>
<second>
<first>15</first>
<second>0</second>
</second>
</item>
<item>
<first>130</first>
<second>
<first>15</first>
<second>0</second>
</second>
</item>
<item>
<first>135</first>
<second>
<first>15</first>
<second>0</second>
</second>
</item>
<item>
<first>136</first>
<second>
<first>15</first>
<second>0</second>
</second>
</item>
<item>
<first>137</first>
<second>
<first>15</first>
<second>1</second>
</second>
</item>
<item>
<first>138</first>
<second>
<first>17</first>
<second>0</second>
</second>
</item>
<item>
<first>140</first>
<second>
<first>17</first>
<second>0</second>
</second>
</item>
<item>
<first>142</first>
<second>
<first>19</first>
<second>4</second>
</second>
</item>
<item>
<first>143</first>
<second>
<first>18</first>
<second>6</second>
</second>
</item>
<item>
<first>144</first>
<second>
<first>24</first>
<second>0</second>
</second>
</item>
<item>
<first>146</first>
<second>
<first>25</first>
<second>0</second>
</second>
</item>
<item>
<first>147</first>
<second>
<first>25</first>
<second>0</second>
</second>
</item>
<item>
<first>149</first>
<second>
<first>25</first>
<second>0</second>
</second>
</item>
<item>
<first>150</first>
<second>
<first>25</first>
<second>0</second>
</second>
</item>
<item>
<first>155</first>
<second>
<first>27</first>
<second>0</second>
</second>
</item>
<item>
<first>156</first>
<second>
<first>26</first>
<second>0</second>
</second>
</item>
<item>
<first>157</first>
<second>
<first>27</first>
<second>0</second>
</second>
</item>
<item>
<first>158</first>
<second>
<first>27</first>
<second>0</second>
</second>
</item>
<item>
<first>160</first>
<second>
<first>27</first>
<second>0</second>
</second>
</item>
<item>
<first>162</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>164</first>
<second>
<first>29</first>
<second>0</second>
</second>
</item>
<item>
<first>166</first>
<second>
<first>29</first>
<second>0</second>
</second>
</item>
<item>
<first>168</first>
<second>
<first>29</first>
<second>0</second>
</second>
</item>
<item>
<first>169</first>
<second>
<first>29</first>
<second>0</second>
</second>
</item>
<item>
<first>171</first>
<second>
<first>29</first>
<second>0</second>
</second>
</item>
<item>
<first>172</first>
<second>
<first>29</first>
<second>0</second>
</second>
</item>
<item>
<first>173</first>
<second>
<first>29</first>
<second>1</second>
</second>
</item>
<item>
<first>174</first>
<second>
<first>30</first>
<second>0</second>
</second>
</item>
<item>
<first>175</first>
<second>
<first>30</first>
<second>0</second>
</second>
</item>
<item>
<first>176</first>
<second>
<first>30</first>
<second>0</second>
</second>
</item>
<item>
<first>177</first>
<second>
<first>30</first>
<second>0</second>
</second>
</item>
<item>
<first>179</first>
<second>
<first>31</first>
<second>0</second>
</second>
</item>
<item>
<first>180</first>
<second>
<first>31</first>
<second>0</second>
</second>
</item>
<item>
<first>182</first>
<second>
<first>32</first>
<second>0</second>
</second>
</item>
<item>
<first>183</first>
<second>
<first>32</first>
<second>0</second>
</second>
</item>
<item>
<first>185</first>
<second>
<first>32</first>
<second>0</second>
</second>
</item>
<item>
<first>186</first>
<second>
<first>32</first>
<second>0</second>
</second>
</item>
<item>
<first>191</first>
<second>
<first>32</first>
<second>0</second>
</second>
</item>
<item>
<first>192</first>
<second>
<first>32</first>
<second>0</second>
</second>
</item>
<item>
<first>193</first>
<second>
<first>32</first>
<second>1</second>
</second>
</item>
<item>
<first>194</first>
<second>
<first>34</first>
<second>0</second>
</second>
</item>
<item>
<first>196</first>
<second>
<first>34</first>
<second>0</second>
</second>
</item>
<item>
<first>198</first>
<second>
<first>35</first>
<second>4</second>
</second>
</item>
<item>
<first>199</first>
<second>
<first>39</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="29" tracking_level="0" version="0">
<count>19</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="0" version="0">
<first>89</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>7</second>
</second>
</item>
<item>
<first>95</first>
<second>
<first>8</first>
<second>8</second>
</second>
</item>
<item>
<first>105</first>
<second>
<first>9</first>
<second>10</second>
</second>
</item>
<item>
<first>107</first>
<second>
<first>9</first>
<second>9</second>
</second>
</item>
<item>
<first>114</first>
<second>
<first>10</first>
<second>10</second>
</second>
</item>
<item>
<first>122</first>
<second>
<first>10</first>
<second>11</second>
</second>
</item>
<item>
<first>125</first>
<second>
<first>11</first>
<second>11</second>
</second>
</item>
<item>
<first>131</first>
<second>
<first>12</first>
<second>12</second>
</second>
</item>
<item>
<first>141</first>
<second>
<first>12</first>
<second>14</second>
</second>
</item>
<item>
<first>145</first>
<second>
<first>13</first>
<second>19</second>
</second>
</item>
<item>
<first>151</first>
<second>
<first>20</first>
<second>20</second>
</second>
</item>
<item>
<first>161</first>
<second>
<first>21</first>
<second>22</second>
</second>
</item>
<item>
<first>163</first>
<second>
<first>21</first>
<second>21</second>
</second>
</item>
<item>
<first>170</first>
<second>
<first>22</first>
<second>22</second>
</second>
</item>
<item>
<first>178</first>
<second>
<first>22</first>
<second>23</second>
</second>
</item>
<item>
<first>181</first>
<second>
<first>23</first>
<second>23</second>
</second>
</item>
<item>
<first>187</first>
<second>
<first>24</first>
<second>24</second>
</second>
</item>
<item>
<first>197</first>
<second>
<first>24</first>
<second>26</second>
</second>
</item>
<item>
<first>200</first>
<second>
<first>25</first>
<second>29</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="32" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="1" version="0" object_id="_346">
<region_name>memcpy.m00_axi_input_buffer.ref_seq</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>95</item>
<item>105</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>
<item class_id_reference="33" object_id="_347">
<region_name>Loop 2</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>114</item>
<item>122</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>2</pipe_depth>
</item>
<item class_id_reference="33" object_id="_348">
<region_name>memcpy.ref_seq.m00_axi_output_buffer.gep</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>131</item>
<item>141</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>
<item class_id_reference="33" object_id="_349">
<region_name>memcpy.m01_axi_input_buffer.tile_output</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>151</item>
<item>161</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>
<item class_id_reference="33" object_id="_350">
<region_name>Loop 5</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>170</item>
<item>178</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>2</pipe_depth>
</item>
<item class_id_reference="33" object_id="_351">
<region_name>memcpy.tile_output.m01_axi_output_buffer.gep</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>187</item>
<item>197</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>3</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="34" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="35" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="36" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_reg_nodes>
<dp_regname_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core class_id="38" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 28.117958 | 116 | 0.61812 |
3d09e0b77d1d7ea2d4aa02324f0891a8a17ee44c | 31,836 | adb | Ada | source/containers/a-cihase.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/containers/a-cihase.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/containers/a-cihase.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | with Ada.Exceptions.Finally;
with Ada.Unchecked_Conversion;
with Ada.Unchecked_Deallocation;
with Ada.Streams; -- [gcc-4.7] can not search in private with
with System;
package body Ada.Containers.Indefinite_Hashed_Sets is
use type Hash_Tables.Table_Access;
use type Copy_On_Write.Data_Access;
function Upcast is
new Unchecked_Conversion (Cursor, Hash_Tables.Node_Access);
function Downcast is
new Unchecked_Conversion (Hash_Tables.Node_Access, Cursor);
function Upcast is
new Unchecked_Conversion (Data_Access, Copy_On_Write.Data_Access);
function Downcast is
new Unchecked_Conversion (Copy_On_Write.Data_Access, Data_Access);
procedure Free is new Unchecked_Deallocation (Element_Type, Element_Access);
procedure Free is new Unchecked_Deallocation (Node, Cursor);
type Context_Type is limited record
Left : not null access Element_Type;
end record;
pragma Suppress_Initialization (Context_Type);
function Equivalent_Element (
Position : not null Hash_Tables.Node_Access;
Params : System.Address)
return Boolean;
function Equivalent_Element (
Position : not null Hash_Tables.Node_Access;
Params : System.Address)
return Boolean
is
Context : Context_Type;
for Context'Address use Params;
begin
return Equivalent_Elements (
Context.Left.all,
Downcast (Position).Element.all);
end Equivalent_Element;
function Equivalent_Node (Left, Right : not null Hash_Tables.Node_Access)
return Boolean;
function Equivalent_Node (Left, Right : not null Hash_Tables.Node_Access)
return Boolean is
begin
return Equivalent_Elements (
Downcast (Left).Element.all,
Downcast (Right).Element.all);
end Equivalent_Node;
procedure Allocate_Element (
Item : out Element_Access;
New_Item : Element_Type);
procedure Allocate_Element (
Item : out Element_Access;
New_Item : Element_Type) is
begin
Item := new Element_Type'(New_Item);
end Allocate_Element;
procedure Allocate_Node (Item : out Cursor; New_Item : Element_Type);
procedure Allocate_Node (Item : out Cursor; New_Item : Element_Type) is
package Holder is
new Exceptions.Finally.Scoped_Holder (Cursor, Free);
X : aliased Cursor := new Node;
begin
Holder.Assign (X);
Allocate_Element (X.Element, New_Item);
Holder.Clear;
Item := X;
end Allocate_Node;
procedure Copy_Node (
Target : out Hash_Tables.Node_Access;
Source : not null Hash_Tables.Node_Access);
procedure Copy_Node (
Target : out Hash_Tables.Node_Access;
Source : not null Hash_Tables.Node_Access)
is
New_Node : Cursor;
begin
Allocate_Node (New_Node, Downcast (Source).Element.all);
Target := Upcast (New_Node);
end Copy_Node;
procedure Free_Node (Object : in out Hash_Tables.Node_Access);
procedure Free_Node (Object : in out Hash_Tables.Node_Access) is
X : Cursor := Downcast (Object);
begin
Free (X.Element);
Free (X);
Object := null;
end Free_Node;
procedure Allocate_Data (
Target : out not null Copy_On_Write.Data_Access;
New_Length : Count_Type;
Capacity : Count_Type);
procedure Allocate_Data (
Target : out not null Copy_On_Write.Data_Access;
New_Length : Count_Type;
Capacity : Count_Type)
is
pragma Unreferenced (New_Length);
New_Data : constant Data_Access :=
new Data'(Super => <>, Table => null, Length => 0);
begin
Hash_Tables.Rebuild (New_Data.Table, Capacity);
Target := Upcast (New_Data);
end Allocate_Data;
procedure Copy_Data (
Target : out not null Copy_On_Write.Data_Access;
Source : not null Copy_On_Write.Data_Access;
Length : Count_Type;
New_Length : Count_Type;
Capacity : Count_Type);
procedure Copy_Data (
Target : out not null Copy_On_Write.Data_Access;
Source : not null Copy_On_Write.Data_Access;
Length : Count_Type;
New_Length : Count_Type;
Capacity : Count_Type)
is
pragma Unreferenced (Length);
pragma Unreferenced (New_Length);
New_Data : constant Data_Access :=
new Data'(Super => <>, Table => null, Length => 0);
begin
Hash_Tables.Copy (
New_Data.Table,
New_Data.Length,
Downcast (Source).Table,
Capacity,
Copy => Copy_Node'Access);
Target := Upcast (New_Data);
end Copy_Data;
procedure Free is new Unchecked_Deallocation (Data, Data_Access);
procedure Free_Data (Data : in out Copy_On_Write.Data_Access);
procedure Free_Data (Data : in out Copy_On_Write.Data_Access) is
X : Data_Access := Downcast (Data);
begin
Hash_Tables.Free (X.Table, X.Length, Free => Free_Node'Access);
Free (X);
Data := null;
end Free_Data;
procedure Reallocate (
Container : in out Set;
Capacity : Count_Type;
To_Update : Boolean);
procedure Reallocate (
Container : in out Set;
Capacity : Count_Type;
To_Update : Boolean) is
begin
Copy_On_Write.Unique (
Target => Container.Super'Access,
Target_Length => 0, -- Length is unused
Target_Capacity => Indefinite_Hashed_Sets.Capacity (Container),
New_Length => 0,
New_Capacity => Capacity,
To_Update => To_Update,
Allocate => Allocate_Data'Access,
Move => Copy_Data'Access,
Copy => Copy_Data'Access,
Free => Free_Data'Access,
Max_Length => Copy_On_Write.Zero'Access);
end Reallocate;
procedure Unique (Container : in out Set; To_Update : Boolean);
procedure Unique (Container : in out Set; To_Update : Boolean) is
begin
if Copy_On_Write.Shared (Container.Super.Data) then
Reallocate (
Container,
Capacity (Container), -- not shrinking
To_Update);
end if;
end Unique;
function Equivalent_Sets (
Left, Right : Set;
Equivalent : not null access function (
Left, Right : not null Hash_Tables.Node_Access)
return Boolean)
return Boolean;
function Equivalent_Sets (
Left, Right : Set;
Equivalent : not null access function (
Left, Right : not null Hash_Tables.Node_Access)
return Boolean)
return Boolean
is
Left_Length : constant Count_Type := Length (Left);
Right_Length : constant Count_Type := Length (Right);
begin
if Left_Length /= Right_Length then
return False;
elsif Left_Length = 0 or else Left.Super.Data = Right.Super.Data then
return True;
else
Unique (Left'Unrestricted_Access.all, False); -- private
Unique (Right'Unrestricted_Access.all, False); -- private
declare
Left_Data : constant Data_Access := Downcast (Left.Super.Data);
Right_Data : constant Data_Access := Downcast (Right.Super.Data);
begin
return Hash_Tables.Equivalent (
Left_Data.Table,
Left_Data.Length,
Right_Data.Table,
Right_Data.Length,
Equivalent => Equivalent);
end;
end if;
end Equivalent_Sets;
function Find (Container : Set; Hash : Hash_Type; Item : Element_Type)
return Cursor;
function Find (Container : Set; Hash : Hash_Type; Item : Element_Type)
return Cursor is
begin
if Is_Empty (Container) then
return null;
else
Unique (Container'Unrestricted_Access.all, False);
declare
Context : aliased Context_Type :=
(Left => Item'Unrestricted_Access);
begin
return Downcast (Hash_Tables.Find (
Downcast (Container.Super.Data).Table,
Hash,
Context'Address,
Equivalent => Equivalent_Element'Access));
end;
end if;
end Find;
-- implementation
function Empty_Set return Set is
begin
return (Finalization.Controlled with Super => (null, null));
end Empty_Set;
function Has_Element (Position : Cursor) return Boolean is
begin
return Position /= null;
end Has_Element;
overriding function "=" (Left, Right : Set) return Boolean is
function Equivalent (Left, Right : not null Hash_Tables.Node_Access)
return Boolean;
function Equivalent (Left, Right : not null Hash_Tables.Node_Access)
return Boolean is
begin
return Downcast (Left).Element.all = Downcast (Right).Element.all;
end Equivalent;
begin
return Equivalent_Sets (Left, Right, Equivalent => Equivalent'Access);
end "=";
function Equivalent_Sets (Left, Right : Set) return Boolean is
begin
return Equivalent_Sets (Left, Right,
Equivalent => Equivalent_Node'Access);
end Equivalent_Sets;
function To_Set (New_Item : Element_Type) return Set is
begin
return Result : Set do
Insert (Result, New_Item);
end return;
end To_Set;
-- diff (Generic_Array_To_Set)
--
--
--
--
--
--
--
--
function Capacity (Container : Set) return Count_Type is
Data : constant Data_Access := Downcast (Container.Super.Data);
begin
if Data = null then
return 0;
else
return Hash_Tables.Capacity (Data.Table);
end if;
end Capacity;
procedure Reserve_Capacity (
Container : in out Set;
Capacity : Count_Type)
is
New_Capacity : constant Count_Type :=
Count_Type'Max (Capacity, Length (Container));
begin
Reallocate (Container, New_Capacity, True);
end Reserve_Capacity;
function Length (Container : Set) return Count_Type is
Data : constant Data_Access := Downcast (Container.Super.Data);
begin
if Data = null then
return 0;
else
return Data.Length;
end if;
end Length;
function Is_Empty (Container : Set) return Boolean is
Data : constant Data_Access := Downcast (Container.Super.Data);
begin
return Data = null or else Data.Length = 0;
end Is_Empty;
procedure Clear (Container : in out Set) is
begin
Copy_On_Write.Clear (Container.Super'Access, Free => Free_Data'Access);
end Clear;
function Element (Position : Cursor) return Element_Type is
begin
return Position.Element.all;
end Element;
procedure Replace_Element (
Container : in out Set;
Position : Cursor;
New_Item : Element_Type) is
begin
Unique (Container, True);
Free (Position.Element);
Allocate_Element (Position.Element, New_Item);
end Replace_Element;
procedure Query_Element (
Position : Cursor;
Process : not null access procedure (Element : Element_Type)) is
begin
Process (Position.Element.all);
end Query_Element;
function Constant_Reference (Container : aliased Set; Position : Cursor)
return Constant_Reference_Type
is
pragma Unreferenced (Container);
begin
return (Element => Position.Element.all'Access);
end Constant_Reference;
procedure Assign (Target : in out Set; Source : Set) is
begin
Copy_On_Write.Assign (
Target.Super'Access,
Source.Super'Access,
Free => Free_Data'Access);
end Assign;
function Copy (Source : Set; Capacity : Count_Type := 0) return Set is
begin
return Result : Set do
Copy_On_Write.Copy (
Result.Super'Access,
Source.Super'Access,
0, -- Length is unused
Count_Type'Max (Capacity, Length (Source)),
Allocate => Allocate_Data'Access,
Copy => Copy_Data'Access);
end return;
end Copy;
procedure Move (Target : in out Set; Source : in out Set) is
begin
Copy_On_Write.Move (
Target.Super'Access,
Source.Super'Access,
Free => Free_Data'Access);
-- diff
end Move;
procedure Insert (
Container : in out Set;
New_Item : Element_Type;
Position : out Cursor;
Inserted : out Boolean)
is
-- diff
-- diff
-- diff
New_Hash : constant Hash_Type := Hash (New_Item);
begin
-- diff
-- diff
Position := Find (Container, New_Hash, New_Item);
Inserted := Position = null;
if Inserted then
Unique (Container, True);
Allocate_Node (Position, New_Item);
declare
Data : constant Data_Access := Downcast (Container.Super.Data);
begin
Hash_Tables.Insert (
Data.Table,
Data.Length,
New_Hash,
Upcast (Position));
end;
end if;
end Insert;
procedure Insert (
Container : in out Set;
New_Item : Element_Type)
is
Position : Cursor;
Inserted : Boolean;
begin
Insert (Container, New_Item, Position, Inserted);
if not Inserted then
raise Constraint_Error;
end if;
end Insert;
procedure Include (Container : in out Set; New_Item : Element_Type) is
Position : Cursor;
Inserted : Boolean;
begin
Insert (Container, New_Item, Position, Inserted);
if not Inserted then
Replace_Element (Container, Position, New_Item);
end if;
end Include;
procedure Replace (Container : in out Set; New_Item : Element_Type) is
begin
Replace_Element (Container, Find (Container, New_Item), New_Item);
end Replace;
procedure Exclude (Container : in out Set; Item : Element_Type) is
Position : Cursor := Find (Container, Item);
begin
if Position /= null then
Delete (Container, Position);
end if;
end Exclude;
procedure Delete (Container : in out Set; Item : Element_Type) is
Position : Cursor := Find (Container, Item);
begin
Delete (Container, Position);
end Delete;
procedure Delete (Container : in out Set; Position : in out Cursor) is
Position_2 : Hash_Tables.Node_Access := Upcast (Position);
begin
Unique (Container, True);
declare
Data : constant Data_Access := Downcast (Container.Super.Data);
begin
Hash_Tables.Remove (Data.Table, Data.Length, Position_2);
end;
Free_Node (Position_2);
Position := null;
end Delete;
procedure Union (Target : in out Set; Source : Set) is
begin
if Is_Empty (Source) or else Target.Super.Data = Source.Super.Data then
null;
elsif Is_Empty (Target) then
Assign (Target, Source);
else
Unique (Target, True);
Unique (Source'Unrestricted_Access.all, False); -- private
declare
Target_Data : constant Data_Access := Downcast (Target.Super.Data);
Source_Data : constant Data_Access := Downcast (Source.Super.Data);
begin
Hash_Tables.Merge (
Target_Data.Table,
Target_Data.Length,
Source_Data.Table,
Source_Data.Length,
(others => True),
Equivalent => Equivalent_Node'Access,
Copy => Copy_Node'Access,
Free => Free_Node'Access);
end;
end if;
end Union;
function Union (Left, Right : Set) return Set is
begin
return Result : Set do
if Is_Empty (Right) or else Left.Super.Data = Right.Super.Data then
Assign (Result, Left);
elsif Is_Empty (Left) then
Assign (Result, Right);
else
Unique (Result, True);
Unique (Left'Unrestricted_Access.all, False); -- private
Unique (Right'Unrestricted_Access.all, False); -- private
declare
Result_Data : constant Data_Access :=
Downcast (Result.Super.Data);
Left_Data : constant Data_Access := Downcast (Left.Super.Data);
Right_Data : constant Data_Access :=
Downcast (Right.Super.Data);
begin
Hash_Tables.Copying_Merge (
Result_Data.Table,
Result_Data.Length,
Left_Data.Table,
Left_Data.Length,
Right_Data.Table,
Right_Data.Length,
(others => True),
Equivalent => Equivalent_Node'Access,
Copy => Copy_Node'Access);
end;
end if;
end return;
end Union;
procedure Intersection (Target : in out Set; Source : Set) is
begin
if Is_Empty (Target) or else Is_Empty (Source) then
Clear (Target);
elsif Target.Super.Data = Source.Super.Data then
null;
else
Unique (Target, True);
Unique (Source'Unrestricted_Access.all, False); -- private
declare
Target_Data : constant Data_Access := Downcast (Target.Super.Data);
Source_Data : constant Data_Access := Downcast (Source.Super.Data);
begin
Hash_Tables.Merge (
Target_Data.Table,
Target_Data.Length,
Source_Data.Table,
Source_Data.Length,
(Hash_Tables.In_Both => True, others => False),
Equivalent => Equivalent_Node'Access,
Copy => Copy_Node'Access,
Free => Free_Node'Access);
end;
end if;
end Intersection;
function Intersection (Left, Right : Set) return Set is
begin
return Result : Set do
if Is_Empty (Left) or else Is_Empty (Right) then
null; -- Empty_Set
elsif Left.Super.Data = Right.Super.Data then
Assign (Result, Left);
else
Unique (Result, True);
Unique (Left'Unrestricted_Access.all, False); -- private
Unique (Right'Unrestricted_Access.all, False); -- private
declare
Result_Data : constant Data_Access :=
Downcast (Result.Super.Data);
Left_Data : constant Data_Access := Downcast (Left.Super.Data);
Right_Data : constant Data_Access :=
Downcast (Right.Super.Data);
begin
Hash_Tables.Copying_Merge (
Result_Data.Table,
Result_Data.Length,
Left_Data.Table,
Left_Data.Length,
Right_Data.Table,
Right_Data.Length,
(Hash_Tables.In_Both => True, others => False),
Equivalent => Equivalent_Node'Access,
Copy => Copy_Node'Access);
end;
end if;
end return;
end Intersection;
procedure Difference (Target : in out Set; Source : Set) is
begin
if Is_Empty (Target) or else Target.Super.Data = Source.Super.Data then
Clear (Target);
elsif Is_Empty (Source) then
null;
else
Unique (Target, True);
Unique (Source'Unrestricted_Access.all, False); -- private
declare
Target_Data : constant Data_Access := Downcast (Target.Super.Data);
Source_Data : constant Data_Access := Downcast (Source.Super.Data);
begin
Hash_Tables.Merge (
Target_Data.Table,
Target_Data.Length,
Source_Data.Table,
Source_Data.Length,
(Hash_Tables.In_Only_Left => True, others => False),
Equivalent => Equivalent_Node'Access,
Copy => Copy_Node'Access,
Free => Free_Node'Access);
end;
end if;
end Difference;
function Difference (Left, Right : Set) return Set is
begin
return Result : Set do
if Is_Empty (Left) or else Left.Super.Data = Right.Super.Data then
null; -- Empty_Set
elsif Is_Empty (Right) then
Assign (Result, Left);
else
Unique (Result, True);
Unique (Left'Unrestricted_Access.all, False); -- private
Unique (Right'Unrestricted_Access.all, False); -- private
declare
Result_Data : constant Data_Access :=
Downcast (Result.Super.Data);
Left_Data : constant Data_Access := Downcast (Left.Super.Data);
Right_Data : constant Data_Access :=
Downcast (Right.Super.Data);
begin
Hash_Tables.Copying_Merge (
Result_Data.Table,
Result_Data.Length,
Left_Data.Table,
Left_Data.Length,
Right_Data.Table,
Right_Data.Length,
(Hash_Tables.In_Only_Left => True, others => False),
Equivalent => Equivalent_Node'Access,
Copy => Copy_Node'Access);
end;
end if;
end return;
end Difference;
procedure Symmetric_Difference (Target : in out Set; Source : Set) is
begin
if Target.Super.Data = Source.Super.Data then
Clear (Target);
elsif Is_Empty (Source) then
null;
elsif Is_Empty (Target) then
Assign (Target, Source);
else
Unique (Target, True);
Unique (Source'Unrestricted_Access.all, False); -- private
declare
Target_Data : constant Data_Access := Downcast (Target.Super.Data);
Source_Data : constant Data_Access := Downcast (Source.Super.Data);
begin
Hash_Tables.Merge (
Target_Data.Table,
Target_Data.Length,
Source_Data.Table,
Source_Data.Length,
(Hash_Tables.In_Both => False, others => True),
Equivalent => Equivalent_Node'Access,
Copy => Copy_Node'Access,
Free => Free_Node'Access);
end;
end if;
end Symmetric_Difference;
function Symmetric_Difference (Left, Right : Set) return Set is
begin
return Result : Set do
if Left.Super.Data = Right.Super.Data then
null; -- Empty_Set
elsif Is_Empty (Right) then
Assign (Result, Left);
elsif Is_Empty (Left) then
Assign (Result, Right);
else
Unique (Result, True);
Unique (Left'Unrestricted_Access.all, False); -- private
Unique (Right'Unrestricted_Access.all, False); -- private
declare
Result_Data : constant Data_Access :=
Downcast (Result.Super.Data);
Left_Data : constant Data_Access := Downcast (Left.Super.Data);
Right_Data : constant Data_Access :=
Downcast (Right.Super.Data);
begin
Hash_Tables.Copying_Merge (
Result_Data.Table,
Result_Data.Length,
Left_Data.Table,
Left_Data.Length,
Right_Data.Table,
Right_Data.Length,
(Hash_Tables.In_Both => False, others => True),
Equivalent => Equivalent_Node'Access,
Copy => Copy_Node'Access);
end;
end if;
end return;
end Symmetric_Difference;
function Overlap (Left, Right : Set) return Boolean is
begin
if Is_Empty (Left) or else Is_Empty (Right) then
return False;
elsif Left.Super.Data = Right.Super.Data then
return True;
else
Unique (Left'Unrestricted_Access.all, False); -- private
Unique (Right'Unrestricted_Access.all, False); -- private
return Hash_Tables.Overlap (
Downcast (Left.Super.Data).Table,
Downcast (Right.Super.Data).Table,
Equivalent => Equivalent_Node'Access);
end if;
end Overlap;
function Is_Subset (Subset : Set; Of_Set : Set) return Boolean is
begin
if Is_Empty (Subset) or else Subset.Super.Data = Of_Set.Super.Data then
return True;
elsif Is_Empty (Of_Set) then
return False;
else
Unique (Subset'Unrestricted_Access.all, False); -- private
Unique (Of_Set'Unrestricted_Access.all, False); -- private
return Hash_Tables.Is_Subset (
Downcast (Subset.Super.Data).Table,
Downcast (Of_Set.Super.Data).Table,
Equivalent => Equivalent_Node'Access);
end if;
end Is_Subset;
function First (Container : Set) return Cursor is
begin
if Is_Empty (Container) then
return null;
else
Unique (Container'Unrestricted_Access.all, False);
return Downcast (Hash_Tables.First (
Downcast (Container.Super.Data).Table));
end if;
end First;
function Next (Position : Cursor) return Cursor is
begin
return Downcast (Position.Super.Next);
end Next;
procedure Next (Position : in out Cursor) is
begin
Position := Downcast (Position.Super.Next);
end Next;
function Find (Container : Set; Item : Element_Type) return Cursor is
begin
return Find (Container, Hash (Item), Item);
end Find;
function Contains (Container : Set; Item : Element_Type) return Boolean is
begin
return Find (Container, Item) /= null;
end Contains;
function Equivalent_Elements (Left, Right : Cursor)
return Boolean is
begin
return Equivalent_Elements (Left.Element.all, Right.Element.all);
end Equivalent_Elements;
function Equivalent_Elements (Left : Cursor; Right : Element_Type)
return Boolean is
begin
return Equivalent_Elements (Left.Element.all, Right);
end Equivalent_Elements;
procedure Iterate (
Container : Set'Class;
Process : not null access procedure (Position : Cursor))
is
type P1 is access procedure (Position : Cursor);
type P2 is access procedure (Position : Hash_Tables.Node_Access);
function Cast is new Unchecked_Conversion (P1, P2);
begin
if not Is_Empty (Set (Container)) then
Unique (Set (Container)'Unrestricted_Access.all, False);
Hash_Tables.Iterate (
Downcast (Container.Super.Data).Table,
Cast (Process));
end if;
end Iterate;
function Iterate (Container : Set'Class)
return Set_Iterator_Interfaces.Forward_Iterator'Class is
begin
return Set_Iterator'(First => First (Set (Container)));
end Iterate;
overriding procedure Adjust (Object : in out Set) is
begin
Copy_On_Write.Adjust (Object.Super'Access);
end Adjust;
overriding function First (Object : Set_Iterator) return Cursor is
begin
return Object.First;
end First;
overriding function Next (Object : Set_Iterator; Position : Cursor)
return Cursor
is
pragma Unreferenced (Object);
begin
return Next (Position);
end Next;
package body Generic_Keys is
type Context_Type is limited record
Left : not null access Key_Type;
end record;
pragma Suppress_Initialization (Context_Type);
function Equivalent_Key (
Position : not null Hash_Tables.Node_Access;
Params : System.Address)
return Boolean;
function Equivalent_Key (
Position : not null Hash_Tables.Node_Access;
Params : System.Address)
return Boolean
is
Context : Context_Type;
for Context'Address use Params;
begin
return Equivalent_Keys (
Context.Left.all,
Key (Downcast (Position).Element.all));
end Equivalent_Key;
function Key (Position : Cursor) return Key_Type is
begin
return Key (Position.Element.all);
end Key;
function Element (Container : Set; Key : Key_Type) return Element_Type is
begin
return Element (Find (Container, Key));
end Element;
procedure Replace (
Container : in out Set;
Key : Key_Type;
New_Item : Element_Type) is
begin
Replace_Element (Container, Find (Container, Key), New_Item);
end Replace;
procedure Exclude (Container : in out Set; Key : Key_Type) is
Position : Cursor := Find (Container, Key);
begin
if Position /= null then
Delete (Container, Position);
end if;
end Exclude;
procedure Delete (Container : in out Set; Key : Key_Type) is
Position : Cursor := Find (Container, Key);
begin
Delete (Container, Position);
end Delete;
function Find (Container : Set; Key : Key_Type) return Cursor is
begin
if Is_Empty (Container) then
return null;
else
Unique (Container'Unrestricted_Access.all, False);
declare
Context : aliased Context_Type :=
(Left => Key'Unrestricted_Access);
begin
return Downcast (Hash_Tables.Find (
Downcast (Container.Super.Data).Table,
Hash (Key),
Context'Address,
Equivalent => Equivalent_Key'Access));
end;
end if;
end Find;
function Contains (Container : Set; Key : Key_Type) return Boolean is
begin
return Find (Container, Key) /= null;
end Contains;
procedure Update_Element_Preserving_Key (
Container : in out Set;
Position : Cursor;
Process : not null access procedure (
Element : in out Element_Type)) is
begin
Process (Reference_Preserving_Key (Container, Position).Element.all);
end Update_Element_Preserving_Key;
function Reference_Preserving_Key (
Container : aliased in out Set;
Position : Cursor)
return Reference_Type is
begin
Unique (Container, True);
-- diff
return (Element => Position.Element.all'Access);
end Reference_Preserving_Key;
function Constant_Reference (Container : aliased Set; Key : Key_Type)
return Constant_Reference_Type is
begin
return Constant_Reference (Container, Find (Container, Key));
end Constant_Reference;
function Reference_Preserving_Key (
Container : aliased in out Set;
Key : Key_Type)
return Reference_Type is
begin
return Reference_Preserving_Key (Container, Find (Container, Key));
end Reference_Preserving_Key;
end Generic_Keys;
package body Streaming is
procedure Read (
Stream : not null access Streams.Root_Stream_Type'Class;
Item : out Set)
is
Length : Count_Type'Base;
begin
Count_Type'Base'Read (Stream, Length);
Clear (Item);
for I in 1 .. Length loop
declare
New_Item : constant Element_Type := Element_Type'Input (Stream);
begin
-- diff
Include (Item, New_Item);
end;
end loop;
end Read;
procedure Write (
Stream : not null access Streams.Root_Stream_Type'Class;
Item : Set)
is
Length : constant Count_Type := Indefinite_Hashed_Sets.Length (Item);
begin
Count_Type'Write (Stream, Length);
if Length > 0 then
declare
Position : Cursor := First (Item);
begin
while Position /= null loop
Element_Type'Output (Stream, Position.Element.all);
Next (Position);
end loop;
end;
end if;
end Write;
end Streaming;
end Ada.Containers.Indefinite_Hashed_Sets;
| 32.092742 | 79 | 0.606609 |
584ee8887deda2bcb29daa9fffb7dcd95a57bc4b | 2,702 | ads | Ada | tools/xml2ayacc/xml_io/text_streams.ads | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | 4 | 2016-02-05T15:51:56.000Z | 2022-03-25T20:38:32.000Z | tools/xml2ayacc/xml_io/text_streams.ads | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | null | null | null | tools/xml2ayacc/xml_io/text_streams.ads | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- G E L A A S I S --
-- ASIS implementation for Gela project, a portable Ada compiler --
-- http://gela.ada-ru.org --
-- - - - - - - - - - - - - - - - --
-- Read copyright and license at the end of this file --
------------------------------------------------------------------------------
-- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $
package Text_Streams is
-----------------
-- Text_Stream --
-----------------
type Text_Stream is abstract tagged limited null record;
procedure Read
(Object : in out Text_Stream;
Text : out String;
Last : out Natural) is abstract;
end Text_Streams;
------------------------------------------------------------------------------
-- Copyright (c) 2006-2013, Maxim Reznik
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
-- * Neither the name of the Maxim Reznik, IE nor the names of its
-- contributors may be used to endorse or promote products derived from
-- this software without specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
-- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-- POSSIBILITY OF SUCH DAMAGE.
------------------------------------------------------------------------------
| 49.127273 | 79 | 0.569578 |
293ecf2a2aaf11c212cbc1e4e7948d9d54098de5 | 11,775 | ads | Ada | regtests/server/src/server/testapi-skeletons.ads | jquorning/swagger-ada | 9df95a920643b37f22a8fb2450786df00099dc9a | [
"Apache-2.0"
] | 17 | 2017-09-09T15:52:14.000Z | 2022-01-23T01:18:06.000Z | regtests/server/src/server/testapi-skeletons.ads | jquorning/swagger-ada | 9df95a920643b37f22a8fb2450786df00099dc9a | [
"Apache-2.0"
] | 13 | 2020-10-04T16:04:42.000Z | 2022-03-25T19:33:03.000Z | regtests/server/src/server/testapi-skeletons.ads | jquorning/swagger-ada | 9df95a920643b37f22a8fb2450786df00099dc9a | [
"Apache-2.0"
] | 4 | 2021-01-06T08:43:55.000Z | 2022-03-11T21:45:06.000Z | -- REST API Validation
-- API to validate
--
-- The version of the OpenAPI document: 1.0.0
-- Contact: [email protected]
--
-- NOTE: This package is auto generated by OpenAPI-Generator 5.2.1-SNAPSHOT.
-- https://openapi-generator.tech
-- Do not edit the class manually.
pragma Warnings (Off, "*is not referenced");
pragma Warnings (Off, "*no entities of*are referenced");
with Swagger.Servers;
with TestAPI.Models;
with Security.Permissions;
package TestAPI.Skeletons is
pragma Style_Checks ("-mr");
pragma Warnings (Off, "*use clause for package*");
use TestAPI.Models;
type Server_Type is limited interface;
-- Update a ticket
package ACL_Write_Ticket is new Security.Permissions.Definition ("write:ticket");
-- Read a ticket
package ACL_Read_Ticket is new Security.Permissions.Definition ("read:ticket");
--
-- Query an orchestrated service instance
procedure Orch_Store
(Server : in out Server_Type;
Inline_Object_3Type : in InlineObject3_Type;
Context : in out Swagger.Servers.Context_Type) is abstract;
-- Create a ticket
procedure Do_Create_Ticket
(Server : in out Server_Type;
Title : in Swagger.UString;
Owner : in Swagger.Nullable_UString;
Status : in Swagger.Nullable_UString;
Description : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
-- Delete a ticket
procedure Do_Delete_Ticket
(Server : in out Server_Type;
Tid : in Swagger.Long;
Context : in out Swagger.Servers.Context_Type) is abstract;
-- List the tickets
procedure Do_Head_Ticket
(Server : in out Server_Type
;
Context : in out Swagger.Servers.Context_Type) is abstract;
-- Patch a ticket
procedure Do_Patch_Ticket
(Server : in out Server_Type;
Tid : in Swagger.Long;
Owner : in Swagger.Nullable_UString;
Status : in Swagger.Nullable_UString;
Title : in Swagger.Nullable_UString;
Description : in Swagger.Nullable_UString;
Result : out TestAPI.Models.Ticket_Type;
Context : in out Swagger.Servers.Context_Type) is abstract;
-- Update a ticket
procedure Do_Update_Ticket
(Server : in out Server_Type;
Tid : in Swagger.Long;
Owner : in Swagger.Nullable_UString;
Status : in Swagger.Nullable_UString;
Title : in Swagger.Nullable_UString;
Description : in Swagger.Nullable_UString;
Result : out TestAPI.Models.Ticket_Type;
Context : in out Swagger.Servers.Context_Type) is abstract;
-- Get a ticket
-- Get a ticket
procedure Do_Get_Ticket
(Server : in out Server_Type;
Tid : in Swagger.Long;
Result : out TestAPI.Models.Ticket_Type;
Context : in out Swagger.Servers.Context_Type) is abstract;
-- List the tickets
-- List the tickets created for the project.
procedure Do_List_Tickets
(Server : in out Server_Type;
Status : in Swagger.Nullable_UString;
Owner : in Swagger.Nullable_UString;
Result : out TestAPI.Models.Ticket_Type_Vectors.Vector;
Context : in out Swagger.Servers.Context_Type) is abstract;
-- Get a ticket
-- Get a ticket
procedure Do_Options_Ticket
(Server : in out Server_Type;
Tid : in Swagger.Long;
Result : out TestAPI.Models.Ticket_Type;
Context : in out Swagger.Servers.Context_Type) is abstract;
generic
type Implementation_Type is limited new Server_Type with private;
URI_Prefix : String := "";
package Skeleton is
procedure Register (Server : in out Swagger.Servers.Application_Type'Class);
--
procedure Orch_Store
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
-- Create a ticket
procedure Do_Create_Ticket
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
-- Delete a ticket
procedure Do_Delete_Ticket
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
-- List the tickets
procedure Do_Head_Ticket
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
-- Patch a ticket
procedure Do_Patch_Ticket
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
-- Update a ticket
procedure Do_Update_Ticket
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
-- Get a ticket
procedure Do_Get_Ticket
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
-- List the tickets
procedure Do_List_Tickets
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
-- Get a ticket
procedure Do_Options_Ticket
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
end Skeleton;
generic
type Implementation_Type is limited new Server_Type with private;
URI_Prefix : String := "";
package Shared_Instance is
procedure Register (Server : in out Swagger.Servers.Application_Type'Class);
--
procedure Orch_Store
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
-- Create a ticket
procedure Do_Create_Ticket
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
-- Delete a ticket
procedure Do_Delete_Ticket
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
-- List the tickets
procedure Do_Head_Ticket
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
-- Patch a ticket
procedure Do_Patch_Ticket
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
-- Update a ticket
procedure Do_Update_Ticket
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
-- Get a ticket
procedure Do_Get_Ticket
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
-- List the tickets
procedure Do_List_Tickets
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
-- Get a ticket
procedure Do_Options_Ticket
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
private
protected Server is
--
procedure Orch_Store
(Inline_Object_3Type : in InlineObject3_Type;
Context : in out Swagger.Servers.Context_Type);
-- Create a ticket
procedure Do_Create_Ticket
(Title : in Swagger.UString;
Owner : in Swagger.Nullable_UString;
Status : in Swagger.Nullable_UString;
Description : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type);
-- Delete a ticket
procedure Do_Delete_Ticket
(Tid : in Swagger.Long;
Context : in out Swagger.Servers.Context_Type);
-- List the tickets
procedure Do_Head_Ticket (Context : in out Swagger.Servers.Context_Type);
-- Patch a ticket
procedure Do_Patch_Ticket
(Tid : in Swagger.Long;
Owner : in Swagger.Nullable_UString;
Status : in Swagger.Nullable_UString;
Title : in Swagger.Nullable_UString;
Description : in Swagger.Nullable_UString;
Result : out TestAPI.Models.Ticket_Type;
Context : in out Swagger.Servers.Context_Type);
-- Update a ticket
procedure Do_Update_Ticket
(Tid : in Swagger.Long;
Owner : in Swagger.Nullable_UString;
Status : in Swagger.Nullable_UString;
Title : in Swagger.Nullable_UString;
Description : in Swagger.Nullable_UString;
Result : out TestAPI.Models.Ticket_Type;
Context : in out Swagger.Servers.Context_Type);
-- Get a ticket
procedure Do_Get_Ticket
(Tid : in Swagger.Long;
Result : out TestAPI.Models.Ticket_Type;
Context : in out Swagger.Servers.Context_Type);
-- List the tickets
procedure Do_List_Tickets
(Status : in Swagger.Nullable_UString;
Owner : in Swagger.Nullable_UString;
Result : out TestAPI.Models.Ticket_Type_Vectors.Vector;
Context : in out Swagger.Servers.Context_Type);
-- Get a ticket
procedure Do_Options_Ticket
(Tid : in Swagger.Long;
Result : out TestAPI.Models.Ticket_Type;
Context : in out Swagger.Servers.Context_Type);
private
Impl : Implementation_Type;
end Server;
end Shared_Instance;
end TestAPI.Skeletons;
| 35.149254 | 84 | 0.642463 |
58f5d4bff673c5862d1513322a7d5c7d082ca961 | 7,246 | adb | Ada | src/frontend/Experimental_Ada_ROSE_Connection/parser/asis_adapter/source/asis_adapter-element-clauses.adb | matzke1/rose | 8561cb90a11f015dbd7005ea29386e1f4e080c7e | [
"BSD-3-Clause"
] | null | null | null | src/frontend/Experimental_Ada_ROSE_Connection/parser/asis_adapter/source/asis_adapter-element-clauses.adb | matzke1/rose | 8561cb90a11f015dbd7005ea29386e1f4e080c7e | [
"BSD-3-Clause"
] | null | null | null | src/frontend/Experimental_Ada_ROSE_Connection/parser/asis_adapter/source/asis_adapter-element-clauses.adb | matzke1/rose | 8561cb90a11f015dbd7005ea29386e1f4e080c7e | [
"BSD-3-Clause"
] | null | null | null | with Asis.Clauses;
with Asis.Elements;
package body Asis_Adapter.Element.Clauses is
------------
-- EXPORTED:
------------
procedure Do_Pre_Child_Processing
(Element : in Asis.Element;
State : in out Class)
is
Parent_Name : constant String := Module_Name;
Module_Name : constant String := Parent_Name & ".Do_Pre_Child_Processing";
Result : a_nodes_h.Clause_Struct :=
a_nodes_h.Support.Default_Clause_Struct;
Clause_Kind : constant Asis.Clause_Kinds :=
Asis.Elements.Clause_Kind (Element);
-- Supporting procedures are in alphabetical order (except
-- Add_Common_Items comes last):
procedure Add_Clause_Names is
begin
Add_Element_List
(This => State,
Elements_In => Asis.Clauses.Clause_Names (Element),
Dot_Label_Name => "Clause_Name",
List_Out => Result.Clause_Names,
Add_Edges => True);
end;
procedure Add_Component_Clause_Position is
ID : constant a_nodes_h.Expression_ID :=
Get_Element_ID (Asis.Clauses.Component_Clause_Position (Element));
begin
State.Add_To_Dot_Label_And_Edge ("Component_Clause_Position",ID);
Result.Component_Clause_Position := ID;
end;
procedure Add_Component_Clause_Range is
ID : constant a_nodes_h.Element_ID :=
Get_Element_ID (Asis.Clauses.Component_Clause_Range (Element));
begin
State.Add_To_Dot_Label_And_Edge ("Component_Clause_Range", ID);
Result.Component_Clause_Range := ID;
end;
procedure Add_Has_Limited is
Value : constant Boolean := Asis.Elements.Has_Limited (Element);
begin
State.Add_To_Dot_Label ("Has_Limited", Value);
Result.Has_Limited := a_nodes_h.Support.To_bool (Value);
end;
--Clause_Struct takes a Name_ID
procedure Add_Representation_Clause_Name is
ID : constant a_nodes_h.Name_ID :=
Get_Element_ID (Asis.Clauses.Representation_Clause_Name (Element));
begin
State.Add_To_Dot_Label_And_Edge ("Representation_Clause_Name", ID);
Result.Representation_Clause_Name := ID;
end;
-- END Field support
-----------------------------------------------------------------------
-- BEGIN record support:
function Representation_Clause
return a_nodes_h.Representation_Clause_Struct
is
Parent_Name : constant String := Module_Name;
Module_Name : constant String := Parent_Name & ".Representation_Clause";
Result : a_nodes_h.Representation_Clause_Struct :=
a_nodes_h.Support.Default_Representation_Clause_Struct;
Representation_Clause_Kind : constant Asis.Representation_Clause_Kinds :=
Asis.Elements.Representation_Clause_Kind (Element);
-- Supporting procedures are in alphabetical order (except
-- Add_Common_Items comes last):
procedure Add_Component_Clauses is
begin
Add_Element_List
(This => State,
Elements_In => Asis.Clauses.Component_Clauses (Element),
Dot_Label_Name => "Component_Clauses",
List_Out => Result.Component_Clauses,
Add_Edges => True);
end;
procedure Add_Mod_Clause_Expression is
ID : constant a_nodes_h.Expression_ID :=
Get_Element_ID (Asis.Clauses.Mod_Clause_Expression (Element));
begin
State.Add_To_Dot_Label_And_Edge ("Mod_Clause_Expression", ID);
Result.Mod_Clause_Expression := ID;
end;
procedure Add_Pragmas is begin
Add_Element_List
(This => State,
Elements_In => Asis.Elements.Pragmas (Element),
Dot_Label_Name => "Pragmas",
List_Out => Result.Pragmas,
Add_Edges => True);
end;
procedure Add_Representation_Clause_Expression is
ID : constant a_nodes_h.Expression_ID :=
Get_Element_ID (Asis.Clauses.Representation_Clause_Expression (Element));
begin
State.Add_To_Dot_Label_And_Edge ("Representation_Clause_Expression", ID);
Result.Representation_Clause_Expression := ID;
end;
procedure Add_Representation_Clause_Name is
ID : constant a_nodes_h.Name_ID :=
Get_Element_ID (Asis.Clauses.Representation_Clause_Name (Element));
begin
State.Add_To_Dot_Label_And_Edge ("Representation_Clause_Name", ID);
Result.Representation_Clause_Name := ID;
end;
procedure Add_Common_Items is
begin
State.Add_To_Dot_Label("Representation_Clause_Kind", Representation_Clause_Kind'Image);
Result.Representation_Clause_Kind := anhS.To_Representation_Clause_Kinds (Representation_Clause_Kind);
Add_Representation_Clause_Name;
end Add_Common_Items;
use all type Asis.Representation_Clause_Kinds;
begin
If Representation_Clause_Kind /= Not_A_Representation_Clause then
Add_Common_Items;
end if;
case Representation_Clause_Kind is
when Not_A_Representation_Clause =>
raise Internal_Error with
Module_Name & " called with: " & Clause_Kind'Image;
when An_Attribute_Definition_Clause =>
Add_Representation_Clause_Expression;
when An_Enumeration_Representation_Clause =>
Add_Representation_Clause_Expression;
when A_Record_Representation_Clause =>
Add_Pragmas;
Add_Mod_Clause_Expression;
Add_Component_Clauses;
when An_At_Clause =>
Add_Representation_Clause_Expression;
end case;
return Result;
end Representation_Clause;
procedure Add_Common_Items is
begin
State.Add_To_Dot_Label ("Clause_Kind", Clause_Kind'Image);
Result.Clause_Kind := anhS.To_Clause_Kinds (Clause_Kind);
end Add_Common_Items;
use all type Asis.Clause_Kinds;
begin
If Clause_Kind /= Not_A_Clause then
Add_Common_Items;
end if;
case Clause_Kind is
when Not_A_Clause =>
raise Internal_Error with
Module_Name & " called with: " & Clause_Kind'Image;
when A_Use_Package_Clause =>
Add_Clause_Names;
when A_Use_Type_Clause =>
Add_Clause_Names;
when A_Use_All_Type_Clause => -- A2012
Add_Clause_Names;
when A_With_Clause =>
Add_Has_Limited;
Add_Clause_Names;
when A_Representation_Clause =>
Result.Representation_Clause := Representation_Clause;
when A_Component_Clause =>
Add_Representation_Clause_Name;
Add_Component_Clause_Position;
Add_Component_Clause_Range;
end case;
State.A_Element.Element_Kind := a_nodes_h.A_Clause;
State.A_Element.the_union.clause := Result;
end Do_Pre_Child_Processing;
end Asis_Adapter.Element.Clauses;
| 36.781726 | 114 | 0.636627 |
58687fd3786358b62444158b1796bb28f4747886 | 6,648 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnarl/s-tasinf__solaris.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnarl/s-tasinf__solaris.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnarl/s-tasinf__solaris.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . T A S K _ I N F O --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains the definitions and routines associated with the
-- implementation and use of the Task_Info pragma. It is specialized
-- appropriately for targets that make use of this pragma.
-- Note: the compiler generates direct calls to this interface, via Rtsfind.
-- Any changes to this interface may require corresponding compiler changes.
-- The functionality in this unit is now provided by the predefined package
-- System.Multiprocessors and the CPU aspect. This package is obsolescent.
-- This is the Solaris (native) version of this module
with System.OS_Interface;
package System.Task_Info is
pragma Obsolescent (Task_Info, "use System.Multiprocessors and CPU aspect");
pragma Preelaborate;
pragma Elaborate_Body;
-- To ensure that a body is allowed
-----------------------------------------------------
-- Binding of Tasks to LWPs and LWPs to processors --
-----------------------------------------------------
-- The Solaris implementation of the GNU Low-Level Interface (GNULLI)
-- implements each Ada task as a Solaris thread. The Solaris thread
-- library distributes threads across one or more LWPs (Light Weight
-- Process) that are members of the same process. Solaris distributes
-- processes and LWPs across the available CPUs on a given machine. The
-- pragma Task_Info provides the mechanism to control the distribution
-- of tasks to LWPs, and LWPs to processors.
-- Each thread has a number of attributes that dictate it's scheduling.
-- These attributes are:
--
-- New_LWP: whether a new LWP is created for this thread.
--
-- Bound_To_LWP: whether the thread is bound to a specific LWP
-- for its entire lifetime.
--
-- CPU: the CPU number associated to the LWP
--
-- The Task_Info pragma:
-- pragma Task_Info (EXPRESSION);
-- allows the specification on a task by task basis of a value of type
-- System.Task_Info.Task_Info_Type to be passed to a task when it is
-- created. The specification of this type, and the effect on the task
-- that is created is target dependent.
-- The Task_Info pragma appears within a task definition (compare the
-- definition and implementation of pragma Priority). If no such pragma
-- appears, then the value Unspecified_Task_Info is passed. If a pragma
-- is present, then it supplies an alternative value. If the argument of
-- the pragma is a discriminant reference, then the value can be set on
-- a task by task basis by supplying the appropriate discriminant value.
-- Note that this means that the type used for Task_Info_Type must be
-- suitable for use as a discriminant (i.e. a scalar or access type).
-----------------------
-- Thread Attributes --
-----------------------
subtype CPU_Number is System.OS_Interface.processorid_t;
CPU_UNCHANGED : constant CPU_Number := System.OS_Interface.PBIND_QUERY;
-- Do not bind the LWP to a specific processor
ANY_CPU : constant CPU_Number := System.OS_Interface.PBIND_NONE;
-- Bind the LWP to any processor
Invalid_CPU_Number : exception;
type Thread_Attributes (New_LWP : Boolean) is record
Bound_To_LWP : Boolean := True;
case New_LWP is
when False =>
null;
when True =>
CPU : CPU_Number := CPU_UNCHANGED;
end case;
end record;
Default_Thread_Attributes : constant Thread_Attributes := (False, True);
function Unbound_Thread_Attributes
return Thread_Attributes;
function Bound_Thread_Attributes
return Thread_Attributes;
function Bound_Thread_Attributes (CPU : CPU_Number)
return Thread_Attributes;
type Task_Info_Type is access all Thread_Attributes;
function New_Unbound_Thread_Attributes
return Task_Info_Type;
function New_Bound_Thread_Attributes
return Task_Info_Type;
function New_Bound_Thread_Attributes (CPU : CPU_Number)
return Task_Info_Type;
Unspecified_Task_Info : constant Task_Info_Type := null;
function Number_Of_Processors return Positive;
-- Returns the number of processors on the running host
end System.Task_Info;
| 45.534247 | 79 | 0.572804 |
3d51d4369a635e4c98cb33c540615c8d9bb28e3f | 3,074 | ads | Ada | components/src/motion/bno055/bno055_i2c_io.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 192 | 2016-06-01T18:32:04.000Z | 2022-03-26T22:52:31.000Z | components/src/motion/bno055/bno055_i2c_io.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 239 | 2016-05-26T20:02:01.000Z | 2022-03-31T09:46:56.000Z | components/src/motion/bno055/bno055_i2c_io.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2016, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- This package provides I/O for communicating with the BNO055 sensor hardware
-- in terms of I2C. (USART-based communication is an alternative.)
with HAL.I2C; use HAL.I2C;
use HAL;
package BNO055_I2C_IO is
type IO_Port is tagged record
Port : Any_I2C_Port;
Device : I2C_Address;
end record;
type Any_IO_Port is access all IO_Port'Class;
procedure Read
(This : Any_IO_Port;
Register : UInt8;
Value : out UInt8);
procedure Write
(This : Any_IO_Port;
Register : UInt8;
Value : UInt8);
procedure Read_Buffer
(This : Any_IO_Port;
Register : UInt8;
Value : out I2C_Data);
end BNO055_I2C_IO;
| 48.793651 | 79 | 0.534483 |
2296f1445fa7a175b54a3290887ba2a840e75734 | 4,905 | adb | Ada | source/amf/mofext/amf-internals-factories-mofext_module_factory-construct_union.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/mofext/amf-internals-factories-mofext_module_factory-construct_union.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/mofext/amf-internals-factories-mofext_module_factory-construct_union.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-2013, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Internals.Links;
with AMF.Internals.Tables.MOFEXT_Element_Table;
with AMF.Internals.Tables.MOFEXT_Types;
with AMF.Internals.Tables.MOF_Metamodel;
with AMF.Internals.Tables.UML_Metamodel;
separate (AMF.Internals.Factories.MOFEXT_Module_Factory)
procedure Construct_Union
(Element : AMF.Internals.AMF_Element;
Property : AMF.Internals.CMOF_Element;
Link : AMF.Internals.AMF_Link)
is
Element_Kind : constant AMF.Internals.Tables.MOFEXT_Types.Element_Kinds
:= AMF.Internals.Tables.MOFEXT_Element_Table.Table (Element).Kind;
Opposite : constant AMF.Internals.AMF_Element
:= AMF.Internals.Links.Opposite_Element (Link, Element);
begin
case Element_Kind is
when AMF.Internals.Tables.MOFEXT_Types.E_MOF_Tag =>
if Property = AMF.Internals.Tables.UML_Metamodel.MP_UML_Element_Owned_Comment_A_Owning_Element then
AMF.Internals.Links.Create_Link
(AMF.Internals.Tables.UML_Metamodel.MA_UML_Element_Owned_Element_Owner,
Element,
Opposite,
Link);
elsif Property = AMF.Internals.Tables.MOF_Metamodel.MP_MOF_Tag_Tag_Owner_A_Owned_Tag then
AMF.Internals.Links.Create_Link
(AMF.Internals.Tables.UML_Metamodel.MA_UML_Element_Owned_Element_Owner,
Opposite,
Element,
Link);
end if;
when others =>
null;
end case;
end Construct_Union;
| 57.705882 | 108 | 0.481346 |
575ef4dddecd174433532f8ea0360070869cafba | 1,994 | ads | Ada | thirdparty/adasdl/thin/adasdl/AdaSDL_framebuff/sdltests/testhread_sprogs.ads | Lucretia/old_nehe_ada95 | d0378c3bfce202eb01bf00b57c128735dbe8582d | [
"BSD-3-Clause"
] | null | null | null | thirdparty/adasdl/thin/adasdl/AdaSDL_framebuff/sdltests/testhread_sprogs.ads | Lucretia/old_nehe_ada95 | d0378c3bfce202eb01bf00b57c128735dbe8582d | [
"BSD-3-Clause"
] | null | null | null | thirdparty/adasdl/thin/adasdl/AdaSDL_framebuff/sdltests/testhread_sprogs.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 --
-- ----------------------------------------------------------------- --
with System;
with Interfaces.C;
package TesThread_Sprogs is
package C renames Interfaces.C;
use type C.int;
alive : Boolean := False;
function ThreadFunc (data : System.Address) return C.int;
pragma Convention (C, ThreadFunc);
procedure killed (sig : C.int);
pragma Convention (C, killed);
end TesThread_Sprogs;
| 51.128205 | 71 | 0.46339 |
3df8b7fc882e573b970bd835245c1e41d15e182c | 2,598 | adb | Ada | gcc-gcc-7_3_0-release/gcc/ada/g-tasloc.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-tasloc.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/g-tasloc.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- G N A T . T A S K _ L O C K --
-- --
-- B o d y --
-- --
-- Copyright (C) 1997-2010, 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 package does not require a body, since it is a package renaming. We
-- provide a dummy file containing a No_Body pragma so that previous versions
-- of the body (which did exist) will not interfere.
pragma No_Body;
| 70.216216 | 78 | 0.391455 |
4d051499f59bf75ce7381b00afc14595d9885935 | 4,110 | ads | Ada | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/g-locfil.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/g-locfil.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/g-locfil.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T . L O C K _ F I L E S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1995-2019, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains the necessary routines for using files for the
-- purpose of providing reliable system wide locking capability.
package GNAT.Lock_Files is
pragma Preelaborate;
Lock_Error : exception;
-- Exception raised if file cannot be locked
subtype Path_Name is String;
-- Pathname is used by all services provided in this unit to specify
-- directory name and file name. On DOS based systems both directory
-- separators are handled (i.e. slash and backslash).
procedure Lock_File
(Directory : Path_Name;
Lock_File_Name : Path_Name;
Wait : Duration := 1.0;
Retries : Natural := Natural'Last);
-- Create a lock file Lock_File_Name in directory Directory. If the file
-- cannot be locked because someone already owns the lock, this procedure
-- waits Wait seconds and retries at most Retries times. If the file
-- still cannot be locked, Lock_Error is raised. The default is to try
-- every second, almost forever (Natural'Last times). The full path of
-- the file is constructed by concatenating Directory and Lock_File_Name.
-- Directory can optionally terminate with a directory separator.
procedure Lock_File
(Lock_File_Name : Path_Name;
Wait : Duration := 1.0;
Retries : Natural := Natural'Last);
-- See above. The full lock file path is given as one string
procedure Unlock_File (Directory : Path_Name; Lock_File_Name : Path_Name);
-- Unlock a file. Directory can optionally terminate with a directory
-- separator.
procedure Unlock_File (Lock_File_Name : Path_Name);
-- Unlock a file whose full path is given in Lock_File_Name
end GNAT.Lock_Files;
| 56.30137 | 78 | 0.50438 |
2275006ce02d8249b97735937518f33bbe384ed2 | 8,497 | ads | Ada | arch/ARM/STM32/svd/stm32wb55x/stm32_svd-quadspi.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2018-05-16T03:56:39.000Z | 2019-07-31T13:53:56.000Z | arch/ARM/STM32/svd/stm32wb55x/stm32_svd-quadspi.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | arch/ARM/STM32/svd/stm32wb55x/stm32_svd-quadspi.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | -- This spec has been automatically generated from STM32WB55x.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.QUADSPI is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype CR_FTHRES_Field is HAL.UInt4;
subtype CR_PRESCALER_Field is HAL.UInt8;
type CR_Register is record
EN : Boolean := False;
ABORT_k : Boolean := False;
DMAEN : Boolean := False;
TCEN : Boolean := False;
SSHIFT : Boolean := False;
-- unspecified
Reserved_5_7 : HAL.UInt3 := 16#0#;
FTHRES : CR_FTHRES_Field := 16#0#;
-- unspecified
Reserved_12_15 : HAL.UInt4 := 16#0#;
TEIE : Boolean := False;
TCIE : Boolean := False;
FTIE : Boolean := False;
SMIE : Boolean := False;
TOIE : Boolean := False;
-- unspecified
Reserved_21_21 : HAL.Bit := 16#0#;
APMS : Boolean := False;
PMM : Boolean := False;
PRESCALER : CR_PRESCALER_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR_Register use record
EN at 0 range 0 .. 0;
ABORT_k at 0 range 1 .. 1;
DMAEN at 0 range 2 .. 2;
TCEN at 0 range 3 .. 3;
SSHIFT at 0 range 4 .. 4;
Reserved_5_7 at 0 range 5 .. 7;
FTHRES at 0 range 8 .. 11;
Reserved_12_15 at 0 range 12 .. 15;
TEIE at 0 range 16 .. 16;
TCIE at 0 range 17 .. 17;
FTIE at 0 range 18 .. 18;
SMIE at 0 range 19 .. 19;
TOIE at 0 range 20 .. 20;
Reserved_21_21 at 0 range 21 .. 21;
APMS at 0 range 22 .. 22;
PMM at 0 range 23 .. 23;
PRESCALER at 0 range 24 .. 31;
end record;
subtype DCR_CSHT_Field is HAL.UInt3;
subtype DCR_FSIZE_Field is HAL.UInt5;
type DCR_Register is record
CKMODE : Boolean := False;
-- unspecified
Reserved_1_7 : HAL.UInt7 := 16#0#;
CSHT : DCR_CSHT_Field := 16#0#;
-- unspecified
Reserved_11_15 : HAL.UInt5 := 16#0#;
FSIZE : DCR_FSIZE_Field := 16#0#;
-- unspecified
Reserved_21_31 : HAL.UInt11 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DCR_Register use record
CKMODE at 0 range 0 .. 0;
Reserved_1_7 at 0 range 1 .. 7;
CSHT at 0 range 8 .. 10;
Reserved_11_15 at 0 range 11 .. 15;
FSIZE at 0 range 16 .. 20;
Reserved_21_31 at 0 range 21 .. 31;
end record;
subtype SR_FLEVEL_Field is HAL.UInt6;
type SR_Register is record
TEF : Boolean := False;
TCF : Boolean := False;
FTF : Boolean := False;
SMF : Boolean := False;
TOF : Boolean := False;
BUSY : Boolean := False;
-- unspecified
Reserved_6_7 : HAL.UInt2 := 16#0#;
FLEVEL : SR_FLEVEL_Field := 16#0#;
-- unspecified
Reserved_14_31 : HAL.UInt18 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register use record
TEF at 0 range 0 .. 0;
TCF at 0 range 1 .. 1;
FTF at 0 range 2 .. 2;
SMF at 0 range 3 .. 3;
TOF at 0 range 4 .. 4;
BUSY at 0 range 5 .. 5;
Reserved_6_7 at 0 range 6 .. 7;
FLEVEL at 0 range 8 .. 13;
Reserved_14_31 at 0 range 14 .. 31;
end record;
type FCR_Register is record
CTEF : Boolean := False;
CTCF : Boolean := False;
-- unspecified
Reserved_2_2 : HAL.Bit := 16#0#;
CSMF : Boolean := False;
CTOF : Boolean := False;
-- unspecified
Reserved_5_31 : HAL.UInt27 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for FCR_Register use record
CTEF at 0 range 0 .. 0;
CTCF at 0 range 1 .. 1;
Reserved_2_2 at 0 range 2 .. 2;
CSMF at 0 range 3 .. 3;
CTOF at 0 range 4 .. 4;
Reserved_5_31 at 0 range 5 .. 31;
end record;
subtype CCR_INSTRUCTION_Field is HAL.UInt8;
subtype CCR_IMODE_Field is HAL.UInt2;
subtype CCR_ADMODE_Field is HAL.UInt2;
subtype CCR_ADSIZE_Field is HAL.UInt2;
subtype CCR_ABMODE_Field is HAL.UInt2;
subtype CCR_ABSIZE_Field is HAL.UInt2;
subtype CCR_DCYC_Field is HAL.UInt5;
subtype CCR_DMODE_Field is HAL.UInt2;
subtype CCR_FMODE_Field is HAL.UInt2;
type CCR_Register is record
INSTRUCTION : CCR_INSTRUCTION_Field := 16#0#;
IMODE : CCR_IMODE_Field := 16#0#;
ADMODE : CCR_ADMODE_Field := 16#0#;
ADSIZE : CCR_ADSIZE_Field := 16#0#;
ABMODE : CCR_ABMODE_Field := 16#0#;
ABSIZE : CCR_ABSIZE_Field := 16#0#;
DCYC : CCR_DCYC_Field := 16#0#;
-- unspecified
Reserved_23_23 : HAL.Bit := 16#0#;
DMODE : CCR_DMODE_Field := 16#0#;
FMODE : CCR_FMODE_Field := 16#0#;
SIOO : Boolean := False;
-- unspecified
Reserved_29_30 : HAL.UInt2 := 16#0#;
DDRM : Boolean := False;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCR_Register use record
INSTRUCTION at 0 range 0 .. 7;
IMODE at 0 range 8 .. 9;
ADMODE at 0 range 10 .. 11;
ADSIZE at 0 range 12 .. 13;
ABMODE at 0 range 14 .. 15;
ABSIZE at 0 range 16 .. 17;
DCYC at 0 range 18 .. 22;
Reserved_23_23 at 0 range 23 .. 23;
DMODE at 0 range 24 .. 25;
FMODE at 0 range 26 .. 27;
SIOO at 0 range 28 .. 28;
Reserved_29_30 at 0 range 29 .. 30;
DDRM at 0 range 31 .. 31;
end record;
subtype PIR_INTERVAL_Field is HAL.UInt16;
type PIR_Register is record
INTERVAL : PIR_INTERVAL_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PIR_Register use record
INTERVAL at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype LPTR_TIMEOUT_Field is HAL.UInt16;
type LPTR_Register is record
TIMEOUT : LPTR_TIMEOUT_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for LPTR_Register use record
TIMEOUT at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
type QUADSPI_Peripheral is record
CR : aliased CR_Register;
DCR : aliased DCR_Register;
SR : aliased SR_Register;
FCR : aliased FCR_Register;
DLR : aliased HAL.UInt32;
CCR : aliased CCR_Register;
AR : aliased HAL.UInt32;
ABR : aliased HAL.UInt32;
DR : aliased HAL.UInt32;
PSMKR : aliased HAL.UInt32;
PSMAR : aliased HAL.UInt32;
PIR : aliased PIR_Register;
LPTR : aliased LPTR_Register;
end record
with Volatile;
for QUADSPI_Peripheral use record
CR at 16#0# range 0 .. 31;
DCR at 16#4# range 0 .. 31;
SR at 16#8# range 0 .. 31;
FCR at 16#C# range 0 .. 31;
DLR at 16#10# range 0 .. 31;
CCR at 16#14# range 0 .. 31;
AR at 16#18# range 0 .. 31;
ABR at 16#1C# range 0 .. 31;
DR at 16#20# range 0 .. 31;
PSMKR at 16#24# range 0 .. 31;
PSMAR at 16#28# range 0 .. 31;
PIR at 16#2C# range 0 .. 31;
LPTR at 16#30# range 0 .. 31;
end record;
QUADSPI_Periph : aliased QUADSPI_Peripheral
with Import, Address => System'To_Address (16#A0001000#);
end STM32_SVD.QUADSPI;
| 32.680769 | 66 | 0.539955 |
57f6c6e178165a9d76d1c7617a2b0a5ea4017838 | 9,752 | adb | Ada | src/miscellaneous/commontext.adb | jrmarino/AdaBase | 660f278613773dc4007c8b3fab21bcfddc1828b3 | [
"0BSD"
] | 30 | 2016-02-21T11:09:30.000Z | 2021-12-08T14:12:32.000Z | src/miscellaneous/commontext.adb | jrmarino/AdaBase | 660f278613773dc4007c8b3fab21bcfddc1828b3 | [
"0BSD"
] | 3 | 2018-10-29T18:44:48.000Z | 2022-03-12T23:14:20.000Z | src/miscellaneous/commontext.adb | jrmarino/AdaBase | 660f278613773dc4007c8b3fab21bcfddc1828b3 | [
"0BSD"
] | 3 | 2015-04-22T12:17:27.000Z | 2017-01-19T14:29:59.000Z | -- This file is covered by the Internet Software Consortium (ISC) License
-- Reference: ../License.txt
with Ada.Strings.Fixed;
with Ada.Strings.UTF_Encoding.Strings;
package body CommonText is
package AS renames Ada.Strings;
package UES renames Ada.Strings.UTF_Encoding.Strings;
-----------
-- USS --
-----------
function USS (US : Text) return String is
begin
return SU.To_String (US);
end USS;
-----------
-- SUS --
-----------
function SUS (S : String) return Text is
begin
return SU.To_Unbounded_String (S);
end SUS;
-------------
-- UTF8S --
-------------
function UTF8S (S8 : UTF8) return String is
begin
return UES.Decode (S8);
end UTF8S;
-------------
-- SUTF8 --
-------------
function SUTF8 (S : String) return UTF8 is
begin
return UES.Encode (S);
end SUTF8;
-----------------
-- IsBlank #1 --
-----------------
function IsBlank (US : Text) return Boolean is
begin
return SU.Length (US) = 0;
end IsBlank;
-----------------
-- IsBlank #2 --
-----------------
function IsBlank (S : String) return Boolean is
begin
return S'Length = 0;
end IsBlank;
------------------
-- equivalent --
------------------
function equivalent (A, B : Text) return Boolean
is
use type Text;
begin
return A = B;
end equivalent;
------------------
-- equivalent --
------------------
function equivalent (A : Text; B : String) return Boolean
is
AS : constant String := USS (A);
begin
return AS = B;
end equivalent;
--------------
-- trim #1 --
--------------
function trim (US : Text) return Text is
begin
return SU.Trim (US, AS.Both);
end trim;
--------------
-- trim #2 --
--------------
function trim (S : String) return String is
begin
return AS.Fixed.Trim (S, AS.Both);
end trim;
---------------
-- int2str --
---------------
function int2str (A : Integer) return String
is
raw : constant String := A'Img;
begin
return trim (raw);
end int2str;
----------------
-- int2text --
----------------
function int2text (A : Integer) return Text is
begin
return SUS (int2str (A));
end int2text;
----------------
-- bool2str --
----------------
function bool2str (A : Boolean) return String is
begin
if A then
return "true";
end if;
return "false";
end bool2str;
-----------------
-- bool2text --
-----------------
function bool2text (A : Boolean) return Text is
begin
return SUS (bool2str (A));
end bool2text;
----------------
-- pinpoint --
----------------
function pinpoint (S : String; fragment : String) return Natural is
begin
return AS.Fixed.Index (Source => S, Pattern => fragment);
end pinpoint;
--------------------
-- contains #1 --
--------------------
function contains (S : String; fragment : String) return Boolean is
begin
return (AS.Fixed.Index (Source => S, Pattern => fragment) > 0);
end contains;
--------------------
-- contains #2 --
--------------------
function contains (US : Text; fragment : String) return Boolean is
begin
return (SU.Index (Source => US, Pattern => fragment) > 0);
end contains;
--------------
-- part_1 --
--------------
function part_1 (S : String; separator : String := "/") return String
is
slash : Integer := AS.Fixed.Index (S, separator);
begin
if slash = 0 then
return S;
end if;
return S (S'First .. slash - 1);
end part_1;
--------------
-- part_2 --
--------------
function part_2 (S : String; separator : String := "/") return String
is
slash : Integer := AS.Fixed.Index (S, separator);
begin
if slash = 0 then
return S;
end if;
return S (slash + separator'Length .. S'Last);
end part_2;
---------------
-- replace --
---------------
function replace (S : String; reject, shiny : Character) return String
is
rejectstr : constant String (1 .. 1) := (1 => reject);
focus : constant Natural :=
AS.Fixed.Index (Source => S, Pattern => rejectstr);
returnstr : String := S;
begin
if focus > 0 then
returnstr (focus) := shiny;
end if;
return returnstr;
end replace;
---------------
-- zeropad --
---------------
function zeropad (N : Natural; places : Positive) return String
is
template : String (1 .. places) := (others => '0');
myimage : constant String := trim (N'Img);
startpos : constant Integer := 1 + places - myimage'Length;
begin
if startpos < 1 then
return myimage;
else
template (startpos .. places) := myimage;
return template;
end if;
end zeropad;
--------------
-- len #1 --
--------------
function len (US : Text) return Natural is
begin
return SU.Length (US);
end len;
--------------
-- len #2 --
--------------
function len (S : String) return Natural is
begin
return S'Length;
end len;
------------------
-- count_char --
------------------
function count_char (S : String; focus : Character) return Natural
is
result : Natural := 0;
begin
for x in S'Range loop
if S (x) = focus then
result := result + 1;
end if;
end loop;
return result;
end count_char;
---------------------
-- redact_quotes --
---------------------
function redact_quotes (sql : String) return String
is
-- This block will mask matching quotes (single or double)
-- These are considered to be literal and not suitable for binding
-- It also will mask "::" which is used by postgresql for casting
type seeking is (none, single, double);
redacted : String := sql;
seek_status : seeking := none;
arrow : Positive := 1;
mask : constant Character := '#';
cast : constant String := "::";
ndx : Natural;
begin
if IsBlank (sql) then
return "";
end if;
loop
ndx := AS.Fixed.Index (Source => redacted, Pattern => cast);
exit when ndx = 0;
redacted (ndx .. ndx + 1) := "##";
end loop;
loop
case sql (arrow) is
when ''' =>
case seek_status is
when none =>
seek_status := single;
redacted (arrow) := mask;
when single =>
seek_status := none;
redacted (arrow) := mask;
when double => null;
end case;
when ASCII.Quotation =>
case seek_status is
when none =>
seek_status := double;
redacted (arrow) := mask;
when double =>
seek_status := none;
redacted (arrow) := mask;
when single => null;
end case;
when others => null;
end case;
exit when arrow = sql'Length;
arrow := arrow + 1;
end loop;
return redacted;
end redact_quotes;
----------------
-- trim_sql --
----------------
function trim_sql (sql : String) return String is
pass1 : String := trim (sql);
pass2 : String (1 .. pass1'Length) := pass1;
begin
if pass2 (pass2'Last) = ASCII.Semicolon then
return pass2 (1 .. pass2'Length - 1);
else
return pass2;
end if;
end trim_sql;
---------------------
-- count_queries --
---------------------
function count_queries (trimmed_sql : String) return Natural
is
mask : String := redact_quotes (trimmed_sql);
begin
return count_char (S => mask, focus => ASCII.Semicolon) + 1;
end count_queries;
----------------
-- subquery --
----------------
function subquery (trimmed_sql : String; index : Positive) return String
is
mask : String := redact_quotes (trimmed_sql);
start : Natural := trimmed_sql'First;
segment : Natural := 1;
scanning : Boolean := (index = segment);
begin
for x in mask'Range loop
if mask (x) = ASCII.Semicolon then
if scanning then
return trimmed_sql (start .. x - 1);
else
segment := segment + 1;
start := x + 1;
scanning := (index = segment);
end if;
end if;
end loop;
-- Here we're either scanning (return current segment) or we aren't,
-- meaning the index was too high, so return nothing. (This should
-- never happen because caller knows how many segments there are and
-- thus would not request something impossible like this.)
if scanning then
return trim (trimmed_sql (start .. trimmed_sql'Last));
else
return "";
end if;
end subquery;
---------------------
-- num_set_items --
---------------------
function num_set_items (nv : String) return Natural
is
result : Natural := 0;
begin
if not IsBlank (nv) then
result := 1;
for x in nv'Range loop
if nv (x) = ',' then
result := result + 1;
end if;
end loop;
end if;
return result;
end num_set_items;
end CommonText;
| 24.019704 | 78 | 0.483388 |
2272ac4ea537585ae6011e5ebee8cc170b1a3739 | 8,253 | ads | Ada | arch/ARM/STM32/svd/stm32wb55x/stm32_svd-lptim1.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2018-05-16T03:56:39.000Z | 2019-07-31T13:53:56.000Z | arch/ARM/STM32/svd/stm32wb55x/stm32_svd-lptim1.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | arch/ARM/STM32/svd/stm32wb55x/stm32_svd-lptim1.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | -- This spec has been automatically generated from STM32WB55x.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.LPTIM1 is
pragma Preelaborate;
---------------
-- Registers --
---------------
type ISR_Register is record
CMPM : Boolean := False;
ARRM : Boolean := False;
EXTTRIG : Boolean := False;
CMPOK : Boolean := False;
ARROK : Boolean := False;
UP : Boolean := False;
DOWN : Boolean := False;
-- unspecified
Reserved_7_31 : HAL.UInt25 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ISR_Register use record
CMPM at 0 range 0 .. 0;
ARRM at 0 range 1 .. 1;
EXTTRIG at 0 range 2 .. 2;
CMPOK at 0 range 3 .. 3;
ARROK at 0 range 4 .. 4;
UP at 0 range 5 .. 5;
DOWN at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
type ICR_Register is record
CMPMCF : Boolean := False;
ARRMCF : Boolean := False;
EXTTRIGCF : Boolean := False;
CMPOKCF : Boolean := False;
ARROKCF : Boolean := False;
UPCF : Boolean := False;
DOWNCF : Boolean := False;
-- unspecified
Reserved_7_31 : HAL.UInt25 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ICR_Register use record
CMPMCF at 0 range 0 .. 0;
ARRMCF at 0 range 1 .. 1;
EXTTRIGCF at 0 range 2 .. 2;
CMPOKCF at 0 range 3 .. 3;
ARROKCF at 0 range 4 .. 4;
UPCF at 0 range 5 .. 5;
DOWNCF at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
type IER_Register is record
CMPMIE : Boolean := False;
ARRMIE : Boolean := False;
EXTTRIGIE : Boolean := False;
CMPOKIE : Boolean := False;
ARROKIE : Boolean := False;
UPIE : Boolean := False;
DOWNIE : Boolean := False;
-- unspecified
Reserved_7_31 : HAL.UInt25 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IER_Register use record
CMPMIE at 0 range 0 .. 0;
ARRMIE at 0 range 1 .. 1;
EXTTRIGIE at 0 range 2 .. 2;
CMPOKIE at 0 range 3 .. 3;
ARROKIE at 0 range 4 .. 4;
UPIE at 0 range 5 .. 5;
DOWNIE at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
subtype CFGR_CKPOL_Field is HAL.UInt2;
subtype CFGR_CKFLT_Field is HAL.UInt2;
subtype CFGR_TRGFLT_Field is HAL.UInt2;
subtype CFGR_PRESC_Field is HAL.UInt3;
subtype CFGR_TRIGSEL_Field is HAL.UInt3;
subtype CFGR_TRIGEN_Field is HAL.UInt2;
type CFGR_Register is record
CKSEL : Boolean := False;
CKPOL : CFGR_CKPOL_Field := 16#0#;
CKFLT : CFGR_CKFLT_Field := 16#0#;
-- unspecified
Reserved_5_5 : HAL.Bit := 16#0#;
TRGFLT : CFGR_TRGFLT_Field := 16#0#;
-- unspecified
Reserved_8_8 : HAL.Bit := 16#0#;
PRESC : CFGR_PRESC_Field := 16#0#;
-- unspecified
Reserved_12_12 : HAL.Bit := 16#0#;
TRIGSEL : CFGR_TRIGSEL_Field := 16#0#;
-- unspecified
Reserved_16_16 : HAL.Bit := 16#0#;
TRIGEN : CFGR_TRIGEN_Field := 16#0#;
TIMOUT : Boolean := False;
WAVE : Boolean := False;
WAVEPOL : Boolean := False;
PRELOAD : Boolean := False;
COUNTMODE : Boolean := False;
ENC : Boolean := False;
-- unspecified
Reserved_25_31 : HAL.UInt7 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CFGR_Register use record
CKSEL at 0 range 0 .. 0;
CKPOL at 0 range 1 .. 2;
CKFLT at 0 range 3 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
TRGFLT at 0 range 6 .. 7;
Reserved_8_8 at 0 range 8 .. 8;
PRESC at 0 range 9 .. 11;
Reserved_12_12 at 0 range 12 .. 12;
TRIGSEL at 0 range 13 .. 15;
Reserved_16_16 at 0 range 16 .. 16;
TRIGEN at 0 range 17 .. 18;
TIMOUT at 0 range 19 .. 19;
WAVE at 0 range 20 .. 20;
WAVEPOL at 0 range 21 .. 21;
PRELOAD at 0 range 22 .. 22;
COUNTMODE at 0 range 23 .. 23;
ENC at 0 range 24 .. 24;
Reserved_25_31 at 0 range 25 .. 31;
end record;
type CR_Register is record
ENABLE : Boolean := False;
SNGSTRT : Boolean := False;
CNTSTRT : Boolean := False;
COUNTRST : Boolean := False;
RSTARE : Boolean := False;
-- unspecified
Reserved_5_31 : HAL.UInt27 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR_Register use record
ENABLE at 0 range 0 .. 0;
SNGSTRT at 0 range 1 .. 1;
CNTSTRT at 0 range 2 .. 2;
COUNTRST at 0 range 3 .. 3;
RSTARE at 0 range 4 .. 4;
Reserved_5_31 at 0 range 5 .. 31;
end record;
subtype CMP_CMP_Field is HAL.UInt16;
type CMP_Register is record
CMP : CMP_CMP_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CMP_Register use record
CMP at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype ARR_ARR_Field is HAL.UInt16;
type ARR_Register is record
ARR : ARR_ARR_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ARR_Register use record
ARR at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CNT_CNT_Field is HAL.UInt16;
type CNT_Register is record
CNT : CNT_CNT_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CNT_Register use record
CNT at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
type OR_Register is record
OR_0 : Boolean := False;
OR_1 : Boolean := False;
-- unspecified
Reserved_2_31 : HAL.UInt30 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OR_Register use record
OR_0 at 0 range 0 .. 0;
OR_1 at 0 range 1 .. 1;
Reserved_2_31 at 0 range 2 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
type LPTIM1_Peripheral is record
ISR : aliased ISR_Register;
ICR : aliased ICR_Register;
IER : aliased IER_Register;
CFGR : aliased CFGR_Register;
CR : aliased CR_Register;
CMP : aliased CMP_Register;
ARR : aliased ARR_Register;
CNT : aliased CNT_Register;
OR_k : aliased OR_Register;
end record
with Volatile;
for LPTIM1_Peripheral use record
ISR at 16#0# range 0 .. 31;
ICR at 16#4# range 0 .. 31;
IER at 16#8# range 0 .. 31;
CFGR at 16#C# range 0 .. 31;
CR at 16#10# range 0 .. 31;
CMP at 16#14# range 0 .. 31;
ARR at 16#18# range 0 .. 31;
CNT at 16#1C# range 0 .. 31;
OR_k at 16#20# range 0 .. 31;
end record;
LPTIM1_Periph : aliased LPTIM1_Peripheral
with Import, Address => System'To_Address (16#40007C00#);
end STM32_SVD.LPTIM1;
| 31.5 | 66 | 0.543439 |
58d8dc25b80f6bdeb3d88fb2c6e09363e6efe798 | 12,678 | adb | Ada | 3-mid/opengl/source/lean/geometry/opengl-geometry-lit_colored_textured_skinned.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2022-01-20T07:13:42.000Z | 2022-01-20T07:13:42.000Z | 3-mid/opengl/source/lean/geometry/opengl-geometry-lit_colored_textured_skinned.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | 3-mid/opengl/source/lean/geometry/opengl-geometry-lit_colored_textured_skinned.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | with
openGL.Shader,
openGL.Attribute,
openGL.Buffer.general,
openGL.Texture,
openGL.Palette,
openGL.Tasks,
openGL.Errors,
GL.Binding,
GL.lean,
GL.Pointers,
Interfaces.C.Strings,
System.storage_Elements;
package body openGL.Geometry.lit_colored_textured_skinned
is
-- Globals
--
vertex_Shader : aliased Shader.item;
fragment_Shader : aliased Shader.item;
the_Program : aliased openGL.Program.lit.colored_textured_skinned.item;
is_Defined : Boolean := False;
Name_1 : constant String := "Site";
Name_2 : constant String := "Normal";
Name_3 : constant String := "Color";
Name_4 : constant String := "Coords";
Name_5 : constant String := "Shine";
Name_6 : constant String := "bone_Ids";
Name_7 : constant String := "bone_Weights";
use Interfaces;
Attribute_1_Name : aliased C.char_array := C.to_C (Name_1);
Attribute_2_Name : aliased C.char_array := C.to_C (Name_2);
Attribute_3_Name : aliased C.char_array := C.to_C (Name_3);
Attribute_4_Name : aliased C.char_array := C.to_C (Name_4);
Attribute_5_Name : aliased C.char_array := C.to_C (Name_5);
Attribute_6_Name : aliased C.char_array := C.to_C (Name_6);
Attribute_7_Name : aliased C.char_array := C.to_C (Name_7);
Attribute_1_Name_ptr : aliased constant C.strings.chars_ptr := C.strings.to_chars_ptr (Attribute_1_Name'Access);
Attribute_2_Name_ptr : aliased constant C.strings.chars_ptr := C.strings.to_chars_ptr (Attribute_2_Name'Access);
Attribute_3_Name_ptr : aliased constant C.strings.chars_ptr := C.strings.to_chars_ptr (Attribute_3_Name'Access);
Attribute_4_Name_ptr : aliased constant C.strings.chars_ptr := C.strings.to_chars_ptr (Attribute_4_Name'Access);
Attribute_5_Name_ptr : aliased constant C.strings.chars_ptr := C.strings.to_chars_ptr (Attribute_5_Name'Access);
Attribute_6_Name_ptr : aliased constant C.strings.chars_ptr := C.strings.to_chars_ptr (Attribute_6_Name'Access);
Attribute_7_Name_ptr : aliased constant C.strings.chars_ptr := C.strings.to_chars_ptr (Attribute_7_Name'Access);
white_Texture : openGL.Texture.Object;
----------
-- Vertex
--
function is_Transparent (Self : in Vertex_array) return Boolean -- TODO: Replace this with the generic (check that all similar functions use the generic).
is
use type color_Value;
begin
for Each in Self'Range
loop
if Self (Each).Color.Alpha /= opaque_Value
then
return True;
end if;
end loop;
return False;
end is_Transparent;
---------
-- Forge
--
type Geometry_view is access all Geometry.lit_colored_textured_skinned.item'Class;
function new_Geometry return access Geometry.lit_colored_textured_skinned.item'Class
is
Self : constant Geometry_view := new Geometry.lit_colored_textured_skinned.item;
begin
Self.Program_is (the_Program'Access);
return Self;
end new_Geometry;
procedure define_Program
is
use Palette,
Attribute.Forge,
GL.lean,
GL.Pointers,
System.storage_Elements;
Sample : Vertex;
Attribute_1 : openGL.Attribute.view;
Attribute_2 : openGL.Attribute.view;
Attribute_3 : openGL.Attribute.view;
Attribute_4 : openGL.Attribute.view;
Attribute_5 : openGL.Attribute.view;
Attribute_6 : openGL.Attribute.view;
Attribute_7 : openGL.Attribute.view;
white_Image : constant openGL.Image := (1 .. 2 => (1 .. 2 => +White));
begin
Tasks.check;
if is_Defined
then
raise Error with "The lit_colored_textured_skinned program has already been defined.";
end if;
is_Defined := True;
-- Define the shaders and program.
--
white_Texture := openGL.Texture.Forge.to_Texture (white_Image);
vertex_Shader .define (Shader.Vertex, "assets/opengl/shader/lit_colored_textured_skinned.vert");
fragment_Shader.define (Shader.Fragment, "assets/opengl/shader/lit_colored_textured_skinned.frag");
the_Program.define ( vertex_Shader'Access,
fragment_Shader'Access);
the_Program.enable;
Attribute_1 := new_Attribute (Name => Name_1,
gl_Location => the_Program.attribute_Location (Name_1),
Size => 3,
data_Kind => Attribute.GL_FLOAT,
Stride => lit_colored_textured_skinned.Vertex'Size / 8,
Offset => 0,
Normalized => False);
Attribute_2 := new_Attribute (Name => Name_2,
gl_Location => the_Program.attribute_Location (Name_2),
Size => 3,
data_Kind => Attribute.GL_FLOAT,
Stride => lit_colored_textured_skinned.Vertex'Size / 8,
Offset => Sample.Normal (1)'Address
- Sample.Site (1)'Address,
Normalized => False);
Attribute_3 := new_Attribute (Name => Name_3,
gl_Location => the_Program.attribute_Location (Name_3),
Size => 4,
data_Kind => Attribute.GL_UNSIGNED_BYTE,
Stride => lit_colored_textured_skinned.Vertex'Size / 8,
Offset => Sample.Color.Primary.Red'Address
- Sample.Site (1) 'Address,
Normalized => True);
Attribute_4 := new_Attribute (Name => Name_4,
gl_Location => the_Program.attribute_Location (Name_4),
Size => 2,
data_Kind => Attribute.GL_FLOAT,
Stride => lit_colored_textured_skinned.Vertex'Size / 8,
Offset => Sample.Coords.S'Address
- Sample.Site (1)'Address,
Normalized => False);
Attribute_5 := new_Attribute (Name => Name_5,
gl_Location => the_Program.attribute_Location (Name_5),
Size => 4,
data_Kind => Attribute.GL_FLOAT,
Stride => lit_colored_textured_skinned.Vertex'Size / 8,
Offset => Sample.bone_Ids (1)'Address
- Sample.Site (1)'Address,
Normalized => False);
Attribute_6 := new_Attribute (Name => Name_6,
gl_Location => the_Program.attribute_Location (Name_6),
Size => 4,
data_Kind => Attribute.GL_FLOAT,
Stride => lit_colored_textured_skinned.Vertex'Size / 8,
Offset => Sample.bone_Ids (1)'Address
- Sample.Site (1)'Address,
Normalized => False);
Attribute_7 := new_Attribute (Name => Name_7,
gl_Location => the_Program.attribute_Location (Name_7),
Size => 4,
data_Kind => Attribute.GL_FLOAT,
Stride => lit_colored_textured_skinned.Vertex'Size / 8,
Offset => Sample.bone_Weights (1)'Address
- Sample.Site (1)'Address,
Normalized => False);
the_Program.add (Attribute_1);
the_Program.add (Attribute_2);
the_Program.add (Attribute_3);
the_Program.add (Attribute_4);
the_Program.add (Attribute_5);
the_Program.add (Attribute_6);
the_Program.add (Attribute_7);
glBindAttribLocation (program => the_Program.gl_Program,
index => the_Program.Attribute (named => Name_1).gl_Location,
name => +Attribute_1_Name_ptr);
Errors.log;
glBindAttribLocation (program => the_Program.gl_Program,
index => the_Program.Attribute (named => Name_2).gl_Location,
name => +Attribute_2_Name_ptr);
Errors.log;
glBindAttribLocation (program => the_Program.gl_Program,
index => the_Program.Attribute (named => Name_3).gl_Location,
name => +Attribute_3_Name_ptr);
Errors.log;
glBindAttribLocation (program => the_Program.gl_Program,
index => the_Program.Attribute (named => Name_4).gl_Location,
name => +Attribute_4_Name_ptr);
Errors.log;
glBindAttribLocation (program => the_Program.gl_Program,
index => the_Program.Attribute (named => Name_5).gl_Location,
name => +Attribute_5_Name_ptr);
Errors.log;
glBindAttribLocation (program => the_Program.gl_Program,
index => the_Program.Attribute (named => Name_6).gl_Location,
name => +Attribute_6_Name_ptr);
Errors.log;
glBindAttribLocation (program => the_Program.gl_Program,
index => the_Program.Attribute (named => Name_7).gl_Location,
name => +Attribute_7_Name_ptr);
Errors.log;
end define_Program;
--------------
-- Attributes
--
function Program return openGL.Program.lit.colored_textured_skinned.view
is
begin
return the_Program'Access;
end Program;
overriding
procedure Indices_are (Self : in out Item; Now : in Indices;
for_Facia : in Positive)
is
begin
raise Error with "openGL.Geometry.lit_coloured_textured_skinned - 'Indices_are' ~ TODO";
end Indices_are;
package openGL_Buffer_of_geometry_Vertices is new Buffer.general (base_Object => Buffer.array_Object,
Index => long_Index_t,
Element => Vertex,
Element_Array => Vertex_array);
procedure Vertices_are (Self : in out Item; Now : in Vertex_array)
is
use openGL_Buffer_of_geometry_Vertices.Forge;
begin
Self.Vertices := new openGL_Buffer_of_geometry_Vertices.object' (to_Buffer (Now,
usage => Buffer.static_Draw));
Self.is_Transparent := Self.is_Transparent
or is_Transparent (Now);
-- Set the bounds.
--
declare
function get_Site (Index : in long_Index_t) return Vector_3
is (Now (Index).Site);
function bounding_Box is new get_Bounds (long_Index_t, get_Site);
begin
Self.Bounds_are (bounding_Box (Count => Now'Length));
end;
end Vertices_are;
overriding
procedure enable_Texture (Self : in Item)
is
use GL,
GL.Binding,
openGL.Texture;
begin
Tasks.check;
glActiveTexture (gl.GL_TEXTURE0);
Errors.log;
if Self.Texture = openGL.Texture.null_Object
then
if not white_Texture.is_Defined
then
declare
use Palette;
white_Image : constant openGL.Image := (1 .. 2 => (1 .. 2 => +White));
begin
white_Texture := openGL.Texture.Forge.to_Texture (white_Image);
end;
end if;
white_Texture.enable;
else
Self.Texture.enable;
end if;
end enable_Texture;
end openGL.Geometry.lit_colored_textured_skinned;
| 39.372671 | 159 | 0.535416 |
291d96d65b7ed130637726e2c2e460a9881408f1 | 810 | ads | Ada | 3-mid/physics/implement/box2d/source/thin/box2d_c-joint_cursor.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/physics/implement/box2d/source/thin/box2d_c-joint_cursor.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/physics/implement/box2d/source/thin/box2d_c-joint_cursor.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | -- This file is generated by SWIG. Please do *not* modify by hand.
--
with interfaces.C;
package box2d_c.joint_Cursor is
-- Item
--
type Item is
record
Joint : access box2d_c.b2Joint;
end record;
-- Items
--
type Items is array (interfaces.C.Size_t range <>) of aliased box2d_c.joint_Cursor.Item;
-- Pointer
--
type Pointer is access all box2d_c.joint_Cursor.Item;
-- Pointers
--
type Pointers is array (interfaces.C.Size_t range <>) of aliased box2d_c.joint_Cursor.Pointer;
-- Pointer_Pointer
--
type Pointer_Pointer is access all box2d_c.joint_Cursor.Pointer;
function construct return box2d_c.joint_Cursor.Item;
private
pragma Import (C, construct, "Ada_new_joint_Cursor");
end box2d_c.joint_Cursor;
| 12.857143 | 97 | 0.671605 |
22bb843da47bad1f0fe5a1a653a6c8683f8cc2b9 | 16,651 | adb | Ada | 4-high/gel/applet/demo/sprite/mixed_shapes/launch_mixed_shapes.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2022-01-20T07:13:42.000Z | 2022-01-20T07:13:42.000Z | 4-high/gel/applet/demo/sprite/mixed_shapes/launch_mixed_shapes.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | 4-high/gel/applet/demo/sprite/mixed_shapes/launch_mixed_shapes.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | with
gel.Window.sdl,
gel.Applet.gui_world,
gel.Forge,
gel.Sprite,
-- gel.Terrain,
physics.Model,
openGL.Model.box.colored,
openGL.Model.sphere.lit_colored_textured,
openGL.Model.capsule.lit_colored_textured,
openGL.Model.any,
openGL.Model.terrain,
openGL.IO,
openGL.Light,
openGL.Palette;
pragma unreferenced (gel.Window.sdl);
procedure launch_mixed_Shapes
--
-- Drops a variety of shapes onto a terrain.
--
is
use gel.Math,
openGL,
openGL.Model.box,
opengl.Palette;
the_Applet : constant gel.Applet.gui_World.view := gel.Forge.new_gui_Applet ("mixed Shapes", 1536, 864);
x : math.Real := 0.0;
y : math.Real := 2.0;
-----------
-- Terrain
--
-- Plane
--
-- the_plane_Model : constant openGL.Model.box.colored.view
-- := openGL.Model.box.colored.new_Box (size => (1000.0, 0.05, 1000.0),
-- faces => (front => (colors => (others => (Red, Opaque))),
-- rear => (colors => (others => (Blue, Opaque))),
-- upper => (colors => (others => (Green, Opaque))),
-- lower => (colors => (others => (Yellow, Opaque))),
-- left => (colors => (others => (Cyan, Opaque))),
-- right => (colors => (others => (Magenta, Opaque)))));
-- the_plane_physics_Model : constant physics.Model.view
-- := physics.Model.Forge.new_physics_Model (shape_Info => (kind => physics.Model.Plane,
-- plane_Normal => (0.00, 1.0, 0.00),
-- plane_Offset => 0.0));
-- the_Plane : constant gel.Sprite.view
-- := gel.Sprite.forge.new_Sprite ("demo.Plane",
-- the_Applet.gui_World.all'Access,
-- math.Origin_3d,
-- the_plane_Model.all'Access,
-- the_plane_physics_Model);
-- Heightfield
--
function to_Heightfield (From : in openGL.height_Map) return physics.Heightfield
is
Result : physics.Heightfield (1 .. Integer (From'Last (1)),
1 .. Integer (From'Last (2)));
Last_i : constant Index_t := From'Last (1);
begin
for i in Result'Range (1)
loop
for j in Result'Range (1)
loop
Result (i, j) := math.Real (From (Last_i - Index_t (i) + 1,
Index_t (j)));
end loop;
end loop;
return Result;
end to_Heightfield;
terrain_Heights : constant openGL.asset_Name := to_Asset ("assets/gel/kidwelly-terrain.png");
terrain_Texture : constant openGL.asset_Name := to_Asset ("assets/gel/kidwelly-terrain-texture.png");
hs : constant := 1.0;
gl_Heights : constant openGL.IO.height_Map_view := openGL.IO.to_height_Map (image_Filename => terrain_Heights,
Scale => 2.0);
the_heightfield_Model : constant openGL.Model.terrain.view
:= openGL.Model.terrain.new_Terrain (heights_Asset => terrain_Heights,
Row => 1,
Col => 1,
Heights => openGL.Model.terrain.height_Map_view (gl_Heights),
color_Map => terrain_Texture,
Tiling => (s => (0.0, 1.0),
t => (0.0, 1.0)));
the_heightfield_physics_Model : constant physics.Model.view
:= physics.Model.forge.new_physics_Model (shape_Info => (Kind => physics.Model.heightfield,
Heights => new physics.Heightfield' (to_Heightfield (gl_Heights.all)),
height_Range => (0.0, 200.0)),
Scale => (hs, 1.0, hs));
the_Heightfield : constant gel.Sprite.view
:= gel.Sprite.forge.new_Sprite ("demo.Hull",
the_Applet.gui_World.all'Access,
Origin_3D,
the_Heightfield_Model,
the_Heightfield_physics_Model);
begin
-- Applet.
--
the_Applet.gui_Camera.Site_is ((0.0, 4.0, 30.0)); -- Position the camera.
the_Applet.enable_simple_Dolly (in_World => the_Applet.gui_World.Id); -- Enable user camera control via keyboard.
the_Applet.Dolly.Speed_is (0.1);
the_Applet.Renderer.Background_is (Blue);
-- Set the lights position.
--
declare
Light : openGL.Light.item := the_Applet.Renderer.new_Light;
begin
Light.Site_is ((0.0, 1000.0, 0.0));
the_Applet.Renderer.set (Light);
end;
-- Terrain.
--
the_Applet.gui_World.add (the_heightfield); -- Add heightfield.
-- Add several of each shape.
--
for i in 1 .. 5
loop
declare
-- Box
--
the_box_Model : constant openGL.Model.box.colored.view
:= openGL.Model.box.colored.new_Box (Size => (1.0, 1.0, 1.0),
Faces => (Front => (Colors => (others => (Red, Opaque))),
Rear => (Colors => (others => (Blue, Opaque))),
Upper => (Colors => (others => (Violet, Opaque))),
Lower => (Colors => (others => (Yellow, Opaque))),
Left => (Colors => (others => (Cyan, Opaque))),
Right => (Colors => (others => (Magenta, Opaque)))));
the_box_physics_Model : constant physics.Model.view
:= physics.Model.forge.new_physics_Model (shape_Info => (Kind => physics.Model.Cube,
half_Extents => the_box_Model.Size / 2.0),
Mass => 1.0);
the_Box : constant gel.Sprite.view
:= gel.Sprite.forge.new_Sprite ("demo.Box",
the_Applet.gui_World.all'Access,
Origin_3D,
the_box_Model.all'Access,
the_box_physics_Model);
-- Ball
--
the_ball_physics_Model : constant physics.Model.view
:= physics.Model.forge.new_physics_Model (shape_Info => (Kind => physics.Model.a_sphere,
sphere_Radius => 1.0),
Mass => 1.0);
the_ball_Model : constant openGL.Model.sphere.lit_colored_textured.view
:= openGL.Model.sphere.lit_colored_textured.new_Sphere (Radius => 1.0,
Image => openGL.to_Asset ("assets/gel/golf_green-16x16.tga"));
the_Ball : constant gel.Sprite.view
:= gel.Sprite.forge.new_Sprite ("demo.Ball",
the_Applet.gui_World.all'Access,
Origin_3D,
the_ball_Model,
the_ball_physics_Model);
-- Cone
--
the_cone_Model : constant openGL.Model.any.view
:= openGL.Model.any.new_Model (Model => openGL.to_Asset ("assets/gel/model/unit_cone.obj"),
Texture => openGL.null_Asset,
Texture_is_lucid => False);
the_cone_physics_Model : constant physics.Model.view
:= physics.Model.forge.new_physics_Model (shape_Info => (Kind => physics.Model.cone),
Mass => 1.0);
the_Cone : constant gel.Sprite.view
:= gel.Sprite.forge.new_Sprite ("demo.Cone",
the_Applet.gui_World.all'Access,
Origin_3D,
the_cone_Model.all'Access,
the_cone_physics_Model);
-- Cylinder
--
the_cylinder_Model : constant openGL.Model.any.view
:= openGL.Model.any.new_Model (Model => openGL.to_Asset ("assets/gel/model/unit_cylinder.obj"),
Texture => openGL.null_Asset,
Texture_is_lucid => False);
the_cylinder_physics_Model : constant physics.Model.view
:= physics.Model.forge.new_physics_Model (shape_Info => (Kind => physics.Model.cylinder,
half_Extents => (1.0, 1.0, 1.0) / 2.0),
Mass => 1.0);
the_Cylinder : constant gel.Sprite.view
:= gel.Sprite.forge.new_Sprite ("demo.Cylinder",
the_Applet.gui_World.all'Access,
Origin_3D,
the_cylinder_Model.all'Access,
the_cylinder_physics_Model);
-- Capsule
--
the_capsule_Model : constant openGL.Model.capsule.lit_colored_textured.view
:= openGL.Model.capsule.lit_colored_textured.new_Capsule (Radius => 0.5,
Height => 0.0,
Color => (palette.Green, Opaque));
the_capsule_physics_Model : constant physics.Model.view
:= physics.Model.forge.new_physics_Model (shape_Info => (Kind => physics.Model.a_Capsule,
lower_Radius => 0.5,
upper_Radius => 0.5,
Height => 1.0),
Mass => 1.0);
the_Capsule : constant gel.Sprite.view
:= gel.Sprite.forge.new_Sprite ("demo.Capsule",
the_Applet.gui_World.all'Access,
Origin_3D,
the_capsule_Model.all'Access,
the_capsule_physics_Model);
-- multi_Sphere
--
the_multi_Sphere_Model : constant openGL.Model.capsule.lit_colored_textured.view
:= openGL.Model.capsule.lit_colored_textured.new_Capsule (Radius => 0.5,
Height => 0.0,
Color => (palette.Green, Opaque),
Image => openGL.to_Asset ("assets/gel/golf_green-16x16.tga"));
the_multi_Sphere_physics_Model : constant physics.Model.view
:= physics.Model.forge.new_physics_Model (shape_Info => (Kind => physics.Model.multi_Sphere,
Sites => new physics.Vector_3_array' ((-0.5, 0.0, 0.0),
( 0.5, 0.0, 0.0)),
Radii => new gel.math.Vector' (1 => 0.5,
2 => 0.5)),
Mass => 1.0);
the_multi_Sphere : constant gel.Sprite.view
:= gel.Sprite.forge.new_Sprite ("demo.multi_Sphere",
the_Applet.gui_World.all'Access,
Origin_3D,
the_multi_Sphere_Model.all'Access,
the_multi_Sphere_physics_Model);
-- Hull
--
s : constant := 0.5;
the_hull_Model : constant openGL.Model.box.colored.view
:= openGL.Model.box.colored.new_Box (Size => (s*2.0, s*2.0, s*2.0),
Faces => (Front => (Colors => (others => (Shade_of (Grey, 1.0), Opaque))),
Rear => (Colors => (others => (Shade_of (Grey, 0.5), Opaque))),
Upper => (Colors => (others => (Shade_of (Grey, 0.4), Opaque))),
Lower => (Colors => (others => (Shade_of (Grey, 0.3), Opaque))),
Left => (Colors => (others => (Shade_of (Grey, 0.2), Opaque))),
Right => (Colors => (others => (Shade_of (Grey, 0.1), Opaque)))));
the_hull_physics_Model : constant physics.Model.view
:= physics.Model.forge.new_physics_Model (shape_Info => (Kind => physics.Model.hull,
Points => new physics.Vector_3_array' ((-s, -s, s),
( s, -s, s),
( s, s, s),
(-s, s, s),
(-s, -s, -s),
( s, -s, -s),
( s, s, -s),
(-s, s, -s))),
Mass => 1.0);
the_Hull : constant gel.Sprite.view
:= gel.Sprite.forge.new_Sprite ("demo.Hull",
the_Applet.gui_World.all'Access,
Origin_3D,
the_hull_Model.all'Access,
the_hull_physics_Model);
begin
the_Applet.gui_World.add (the_Ball);
the_Applet.gui_World.add (the_Box);
the_Applet.gui_World.add (the_Cone);
the_Applet.gui_World.add (the_Cylinder);
the_Applet.gui_World.add (the_Capsule);
the_Applet.gui_World.add (the_multi_Sphere);
the_Applet.gui_World.add (the_Hull);
the_Ball .Site_is (( x, y, 0.0));
the_Box .Site_is (( 0.0, y, -2.5));
the_Cone .Site_is (( 0.0, y, 0.0));
the_Capsule .Site_is (( 0.0 + X, y, 0.0 + x));
the_Cylinder .Site_is (( 0.0, y, 4.4));
the_Hull .Site_is (( 4.0, y, 4.4));
the_multi_Sphere.Site_is ((-4.0, y, 4.4));
x := x + 2.0;
y := y + 2.0;
end;
end loop;
while the_Applet.is_open
loop
the_Applet.freshen; -- Handle any new events, evolve physics and update the screen.
end loop;
the_Applet.destroy;
end launch_mixed_Shapes;
| 52.693038 | 137 | 0.40472 |
2f1f9b1d9c9fddc21bec972b18327877adeb1d0f | 80,363 | ads | Ada | clients/ada-server/generated/src/server/-skeletons.ads | shinesolutions/swagger-aem | b41f1ae3d23917de38ca5cf116cbcc173368d1e8 | [
"Apache-2.0"
] | 39 | 2016-10-02T06:45:12.000Z | 2021-09-08T20:39:53.000Z | clients/ada-server/generated/src/server/-skeletons.ads | shinesolutions/swagger-aem | b41f1ae3d23917de38ca5cf116cbcc173368d1e8 | [
"Apache-2.0"
] | 35 | 2016-11-02T05:06:34.000Z | 2021-09-03T06:03:08.000Z | clients/ada-server/generated/src/server/-skeletons.ads | shinesolutions/swagger-aem | b41f1ae3d23917de38ca5cf116cbcc173368d1e8 | [
"Apache-2.0"
] | 23 | 2016-11-07T04:14:42.000Z | 2021-02-15T09:49:13.000Z | -- Adobe Experience Manager (AEM) API
-- Swagger AEM is an OpenAPI specification for Adobe Experience Manager (AEM) API
--
-- The version of the OpenAPI document: 3.5.0_pre.0
-- Contact: [email protected]
--
-- NOTE: This package is auto generated by OpenAPI-Generator 5.2.1.
-- https://openapi-generator.tech
-- Do not edit the class manually.
pragma Warnings (Off, "*is not referenced");
pragma Warnings (Off, "*no entities of*are referenced");
with Swagger.Servers;
with .Models;
with Security.Permissions;
package .Skeletons is
pragma Style_Checks ("-mr");
pragma Warnings (Off, "*use clause for package*");
use .Models;
type Server_Type is limited interface;
--
procedure Get_Aem_Product_Info
(Server : in out Server_Type
;
Result : out Swagger.UString_Vectors.Vector;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Get_Bundle_Info
(Server : in out Server_Type;
Name : in Swagger.UString;
Result : out .Models.BundleInfo_Type;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Get_Config_Mgr
(Server : in out Server_Type
;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Bundle
(Server : in out Server_Type;
Name : in Swagger.UString;
Action : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Jmx_Repository
(Server : in out Server_Type;
Action : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Saml_Configuration
(Server : in out Server_Type;
Post : in Swagger.Nullable_Boolean;
Apply : in Swagger.Nullable_Boolean;
Delete : in Swagger.Nullable_Boolean;
Action : in Swagger.Nullable_UString;
Dollarlocation : in Swagger.Nullable_UString;
Path : in Swagger.UString_Vectors.Vector;
Service_Periodranking : in Swagger.Nullable_Integer;
Idp_Url : in Swagger.Nullable_UString;
Idp_Cert_Alias : in Swagger.Nullable_UString;
Idp_Http_Redirect : in Swagger.Nullable_Boolean;
Service_Provider_Entity_Id : in Swagger.Nullable_UString;
Assertion_Consumer_Service_URL : in Swagger.Nullable_UString;
Sp_Private_Key_Alias : in Swagger.Nullable_UString;
Key_Store_Password : in Swagger.Nullable_UString;
Default_Redirect_Url : in Swagger.Nullable_UString;
User_IDAttribute : in Swagger.Nullable_UString;
Use_Encryption : in Swagger.Nullable_Boolean;
Create_User : in Swagger.Nullable_Boolean;
Add_Group_Memberships : in Swagger.Nullable_Boolean;
Group_Membership_Attribute : in Swagger.Nullable_UString;
Default_Groups : in Swagger.UString_Vectors.Vector;
Name_Id_Format : in Swagger.Nullable_UString;
Synchronize_Attributes : in Swagger.UString_Vectors.Vector;
Handle_Logout : in Swagger.Nullable_Boolean;
Logout_Url : in Swagger.Nullable_UString;
Clock_Tolerance : in Swagger.Nullable_Integer;
Digest_Method : in Swagger.Nullable_UString;
Signature_Method : in Swagger.Nullable_UString;
User_Intermediate_Path : in Swagger.Nullable_UString;
Propertylist : in Swagger.UString_Vectors.Vector;
Result : out .Models.SamlConfigurationInfo_Type;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Get_Login_Page
(Server : in out Server_Type
;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Cq_Actions
(Server : in out Server_Type;
Authorizable_Id : in Swagger.UString;
Changelog : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Get_Crxde_Status
(Server : in out Server_Type
;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Get_Install_Status
(Server : in out Server_Type
;
Result : out .Models.InstallStatus_Type;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Get_Package_Manager_Servlet
(Server : in out Server_Type
;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Package_Service
(Server : in out Server_Type;
Cmd : in Swagger.UString;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Package_Service_Json
(Server : in out Server_Type;
Path : in Swagger.UString;
Cmd : in Swagger.UString;
Group_Name : in Swagger.Nullable_UString;
Package_Name : in Swagger.Nullable_UString;
Package_Version : in Swagger.Nullable_UString;
Charset : in Swagger.Nullable_UString;
Force : in Swagger.Nullable_Boolean;
Recursive : in Swagger.Nullable_Boolean;
P_Package : in Swagger.File_Part_Type;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Package_Update
(Server : in out Server_Type;
Group_Name : in Swagger.UString;
Package_Name : in Swagger.UString;
Version : in Swagger.UString;
Path : in Swagger.UString;
Filter : in Swagger.Nullable_UString;
Charset : in Swagger.Nullable_UString;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Set_Password
(Server : in out Server_Type;
Old : in Swagger.UString;
Plain : in Swagger.UString;
Verify : in Swagger.UString;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Get_Aem_Health_Check
(Server : in out Server_Type;
Tags : in Swagger.Nullable_UString;
Combine_Tags_Or : in Swagger.Nullable_Boolean;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Config_Aem_Health_Check_Servlet
(Server : in out Server_Type;
Bundles_Periodignored : in Swagger.UString_Vectors.Vector;
Bundles_Periodignored_At_Type_Hint : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Config_Aem_Password_Reset
(Server : in out Server_Type;
Pwdreset_Periodauthorizables : in Swagger.UString_Vectors.Vector;
Pwdreset_Periodauthorizables_At_Type_Hint : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Ssl_Setup
(Server : in out Server_Type;
Keystore_Password : in Swagger.UString;
Keystore_Password_Confirm : in Swagger.UString;
Truststore_Password : in Swagger.UString;
Truststore_Password_Confirm : in Swagger.UString;
Https_Hostname : in Swagger.UString;
Https_Port : in Swagger.UString;
Privatekey_File : in Swagger.File_Part_Type;
Certificate_File : in Swagger.File_Part_Type;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Delete_Agent
(Server : in out Server_Type;
Runmode : in Swagger.UString;
Name : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Delete_Node
(Server : in out Server_Type;
Path : in Swagger.UString;
Name : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Get_Agent
(Server : in out Server_Type;
Runmode : in Swagger.UString;
Name : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Get_Agents
(Server : in out Server_Type;
Runmode : in Swagger.UString;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Get_Authorizable_Keystore
(Server : in out Server_Type;
Intermediate_Path : in Swagger.UString;
Authorizable_Id : in Swagger.UString;
Result : out .Models.KeystoreInfo_Type;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Get_Keystore
(Server : in out Server_Type;
Intermediate_Path : in Swagger.UString;
Authorizable_Id : in Swagger.UString;
Result : out Swagger.Http_Content_Type;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Get_Node
(Server : in out Server_Type;
Path : in Swagger.UString;
Name : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Get_Package
(Server : in out Server_Type;
Group : in Swagger.UString;
Name : in Swagger.UString;
Version : in Swagger.UString;
Result : out Swagger.Http_Content_Type;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Get_Package_Filter
(Server : in out Server_Type;
Group : in Swagger.UString;
Name : in Swagger.UString;
Version : in Swagger.UString;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Get_Query
(Server : in out Server_Type;
Path : in Swagger.UString;
P_Periodlimit : in Swagger.Number;
P_1Property : in Swagger.UString;
P_1Property_Periodvalue : in Swagger.UString;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Get_Truststore
(Server : in out Server_Type
;
Result : out Swagger.Http_Content_Type;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Get_Truststore_Info
(Server : in out Server_Type
;
Result : out .Models.TruststoreInfo_Type;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Agent
(Server : in out Server_Type;
Runmode : in Swagger.UString;
Name : in Swagger.UString;
Jcr_Content_Slashcq_Distribute : in Swagger.Nullable_Boolean;
Jcr_Content_Slashcq_Distribute_At_Type_Hint : in Swagger.Nullable_UString;
Jcr_Content_Slashcq_Name : in Swagger.Nullable_UString;
Jcr_Content_Slashcq_Template : in Swagger.Nullable_UString;
Jcr_Content_Slashenabled : in Swagger.Nullable_Boolean;
Jcr_Content_Slashjcr_Description : in Swagger.Nullable_UString;
Jcr_Content_Slashjcr_Last_Modified : in Swagger.Nullable_UString;
Jcr_Content_Slashjcr_Last_Modified_By : in Swagger.Nullable_UString;
Jcr_Content_Slashjcr_Mixin_Types : in Swagger.Nullable_UString;
Jcr_Content_Slashjcr_Title : in Swagger.Nullable_UString;
Jcr_Content_Slashlog_Level : in Swagger.Nullable_UString;
Jcr_Content_Slashno_Status_Update : in Swagger.Nullable_Boolean;
Jcr_Content_Slashno_Versioning : in Swagger.Nullable_Boolean;
Jcr_Content_Slashprotocol_Connect_Timeout : in Swagger.Number;
Jcr_Content_Slashprotocol_HTTPConnection_Closed : in Swagger.Nullable_Boolean;
Jcr_Content_Slashprotocol_HTTPExpired : in Swagger.Nullable_UString;
Jcr_Content_Slashprotocol_HTTPHeaders : in Swagger.UString_Vectors.Vector;
Jcr_Content_Slashprotocol_HTTPHeaders_At_Type_Hint : in Swagger.Nullable_UString;
Jcr_Content_Slashprotocol_HTTPMethod : in Swagger.Nullable_UString;
Jcr_Content_Slashprotocol_HTTPSRelaxed : in Swagger.Nullable_Boolean;
Jcr_Content_Slashprotocol_Interface : in Swagger.Nullable_UString;
Jcr_Content_Slashprotocol_Socket_Timeout : in Swagger.Number;
Jcr_Content_Slashprotocol_Version : in Swagger.Nullable_UString;
Jcr_Content_Slashproxy_NTLMDomain : in Swagger.Nullable_UString;
Jcr_Content_Slashproxy_NTLMHost : in Swagger.Nullable_UString;
Jcr_Content_Slashproxy_Host : in Swagger.Nullable_UString;
Jcr_Content_Slashproxy_Password : in Swagger.Nullable_UString;
Jcr_Content_Slashproxy_Port : in Swagger.Number;
Jcr_Content_Slashproxy_User : in Swagger.Nullable_UString;
Jcr_Content_Slashqueue_Batch_Max_Size : in Swagger.Number;
Jcr_Content_Slashqueue_Batch_Mode : in Swagger.Nullable_UString;
Jcr_Content_Slashqueue_Batch_Wait_Time : in Swagger.Number;
Jcr_Content_Slashretry_Delay : in Swagger.Nullable_UString;
Jcr_Content_Slashreverse_Replication : in Swagger.Nullable_Boolean;
Jcr_Content_Slashserialization_Type : in Swagger.Nullable_UString;
Jcr_Content_Slashsling_Resource_Type : in Swagger.Nullable_UString;
Jcr_Content_Slashssl : in Swagger.Nullable_UString;
Jcr_Content_Slashtransport_NTLMDomain : in Swagger.Nullable_UString;
Jcr_Content_Slashtransport_NTLMHost : in Swagger.Nullable_UString;
Jcr_Content_Slashtransport_Password : in Swagger.Nullable_UString;
Jcr_Content_Slashtransport_Uri : in Swagger.Nullable_UString;
Jcr_Content_Slashtransport_User : in Swagger.Nullable_UString;
Jcr_Content_Slashtrigger_Distribute : in Swagger.Nullable_Boolean;
Jcr_Content_Slashtrigger_Modified : in Swagger.Nullable_Boolean;
Jcr_Content_Slashtrigger_On_Off_Time : in Swagger.Nullable_Boolean;
Jcr_Content_Slashtrigger_Receive : in Swagger.Nullable_Boolean;
Jcr_Content_Slashtrigger_Specific : in Swagger.Nullable_Boolean;
Jcr_Content_Slashuser_Id : in Swagger.Nullable_UString;
Jcr_Primary_Type : in Swagger.Nullable_UString;
Operation : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Authorizable_Keystore
(Server : in out Server_Type;
Intermediate_Path : in Swagger.UString;
Authorizable_Id : in Swagger.UString;
Operation : in Swagger.Nullable_UString;
Current_Password : in Swagger.Nullable_UString;
New_Password : in Swagger.Nullable_UString;
Re_Password : in Swagger.Nullable_UString;
Key_Password : in Swagger.Nullable_UString;
Key_Store_Pass : in Swagger.Nullable_UString;
Alias : in Swagger.Nullable_UString;
New_Alias : in Swagger.Nullable_UString;
Remove_Alias : in Swagger.Nullable_UString;
Cert_Chain : in Swagger.File_Part_Type;
Pk : in Swagger.File_Part_Type;
Key_Store : in Swagger.File_Part_Type;
Result : out .Models.KeystoreInfo_Type;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Authorizables
(Server : in out Server_Type;
Authorizable_Id : in Swagger.UString;
Intermediate_Path : in Swagger.UString;
Create_User : in Swagger.Nullable_UString;
Create_Group : in Swagger.Nullable_UString;
Rep_Password : in Swagger.Nullable_UString;
Profile_Slashgiven_Name : in Swagger.Nullable_UString;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Config_Adobe_Granite_Saml_Authentication_Handler
(Server : in out Server_Type;
Key_Store_Password : in Swagger.Nullable_UString;
Key_Store_Password_At_Type_Hint : in Swagger.Nullable_UString;
Service_Periodranking : in Swagger.Nullable_Integer;
Service_Periodranking_At_Type_Hint : in Swagger.Nullable_UString;
Idp_Http_Redirect : in Swagger.Nullable_Boolean;
Idp_Http_Redirect_At_Type_Hint : in Swagger.Nullable_UString;
Create_User : in Swagger.Nullable_Boolean;
Create_User_At_Type_Hint : in Swagger.Nullable_UString;
Default_Redirect_Url : in Swagger.Nullable_UString;
Default_Redirect_Url_At_Type_Hint : in Swagger.Nullable_UString;
User_IDAttribute : in Swagger.Nullable_UString;
User_IDAttribute_At_Type_Hint : in Swagger.Nullable_UString;
Default_Groups : in Swagger.UString_Vectors.Vector;
Default_Groups_At_Type_Hint : in Swagger.Nullable_UString;
Idp_Cert_Alias : in Swagger.Nullable_UString;
Idp_Cert_Alias_At_Type_Hint : in Swagger.Nullable_UString;
Add_Group_Memberships : in Swagger.Nullable_Boolean;
Add_Group_Memberships_At_Type_Hint : in Swagger.Nullable_UString;
Path : in Swagger.UString_Vectors.Vector;
Path_At_Type_Hint : in Swagger.Nullable_UString;
Synchronize_Attributes : in Swagger.UString_Vectors.Vector;
Synchronize_Attributes_At_Type_Hint : in Swagger.Nullable_UString;
Clock_Tolerance : in Swagger.Nullable_Integer;
Clock_Tolerance_At_Type_Hint : in Swagger.Nullable_UString;
Group_Membership_Attribute : in Swagger.Nullable_UString;
Group_Membership_Attribute_At_Type_Hint : in Swagger.Nullable_UString;
Idp_Url : in Swagger.Nullable_UString;
Idp_Url_At_Type_Hint : in Swagger.Nullable_UString;
Logout_Url : in Swagger.Nullable_UString;
Logout_Url_At_Type_Hint : in Swagger.Nullable_UString;
Service_Provider_Entity_Id : in Swagger.Nullable_UString;
Service_Provider_Entity_Id_At_Type_Hint : in Swagger.Nullable_UString;
Assertion_Consumer_Service_URL : in Swagger.Nullable_UString;
Assertion_Consumer_Service_URLAt_Type_Hint : in Swagger.Nullable_UString;
Handle_Logout : in Swagger.Nullable_Boolean;
Handle_Logout_At_Type_Hint : in Swagger.Nullable_UString;
Sp_Private_Key_Alias : in Swagger.Nullable_UString;
Sp_Private_Key_Alias_At_Type_Hint : in Swagger.Nullable_UString;
Use_Encryption : in Swagger.Nullable_Boolean;
Use_Encryption_At_Type_Hint : in Swagger.Nullable_UString;
Name_Id_Format : in Swagger.Nullable_UString;
Name_Id_Format_At_Type_Hint : in Swagger.Nullable_UString;
Digest_Method : in Swagger.Nullable_UString;
Digest_Method_At_Type_Hint : in Swagger.Nullable_UString;
Signature_Method : in Swagger.Nullable_UString;
Signature_Method_At_Type_Hint : in Swagger.Nullable_UString;
User_Intermediate_Path : in Swagger.Nullable_UString;
User_Intermediate_Path_At_Type_Hint : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Config_Apache_Felix_Jetty_Based_Http_Service
(Server : in out Server_Type;
Org_Periodapache_Periodfelix_Periodhttps_Periodnio : in Swagger.Nullable_Boolean;
Org_Periodapache_Periodfelix_Periodhttps_Periodnio_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodpassword : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodpassword_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodkey : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodkey_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodkey_Periodpassword : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodkey_Periodpassword_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodtruststore : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodtruststore_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodtruststore_Periodpassword : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodtruststore_Periodpassword_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodclientcertificate : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodclientcertificate_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodenable : in Swagger.Nullable_Boolean;
Org_Periodapache_Periodfelix_Periodhttps_Periodenable_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodosgi_Periodservice_Periodhttp_Periodport_Periodsecure : in Swagger.Nullable_UString;
Org_Periodosgi_Periodservice_Periodhttp_Periodport_Periodsecure_At_Type_Hint : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Config_Apache_Http_Components_Proxy_Configuration
(Server : in out Server_Type;
Proxy_Periodhost : in Swagger.Nullable_UString;
Proxy_Periodhost_At_Type_Hint : in Swagger.Nullable_UString;
Proxy_Periodport : in Swagger.Nullable_Integer;
Proxy_Periodport_At_Type_Hint : in Swagger.Nullable_UString;
Proxy_Periodexceptions : in Swagger.UString_Vectors.Vector;
Proxy_Periodexceptions_At_Type_Hint : in Swagger.Nullable_UString;
Proxy_Periodenabled : in Swagger.Nullable_Boolean;
Proxy_Periodenabled_At_Type_Hint : in Swagger.Nullable_UString;
Proxy_Perioduser : in Swagger.Nullable_UString;
Proxy_Perioduser_At_Type_Hint : in Swagger.Nullable_UString;
Proxy_Periodpassword : in Swagger.Nullable_UString;
Proxy_Periodpassword_At_Type_Hint : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Config_Apache_Sling_Dav_Ex_Servlet
(Server : in out Server_Type;
Alias : in Swagger.Nullable_UString;
Alias_At_Type_Hint : in Swagger.Nullable_UString;
Dav_Periodcreate_Absolute_Uri : in Swagger.Nullable_Boolean;
Dav_Periodcreate_Absolute_Uri_At_Type_Hint : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Config_Apache_Sling_Get_Servlet
(Server : in out Server_Type;
Json_Periodmaximumresults : in Swagger.Nullable_UString;
Json_Periodmaximumresults_At_Type_Hint : in Swagger.Nullable_UString;
Enable_Periodhtml : in Swagger.Nullable_Boolean;
Enable_Periodhtml_At_Type_Hint : in Swagger.Nullable_UString;
Enable_Periodtxt : in Swagger.Nullable_Boolean;
Enable_Periodtxt_At_Type_Hint : in Swagger.Nullable_UString;
Enable_Periodxml : in Swagger.Nullable_Boolean;
Enable_Periodxml_At_Type_Hint : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Config_Apache_Sling_Referrer_Filter
(Server : in out Server_Type;
Allow_Periodempty : in Swagger.Nullable_Boolean;
Allow_Periodempty_At_Type_Hint : in Swagger.Nullable_UString;
Allow_Periodhosts : in Swagger.Nullable_UString;
Allow_Periodhosts_At_Type_Hint : in Swagger.Nullable_UString;
Allow_Periodhosts_Periodregexp : in Swagger.Nullable_UString;
Allow_Periodhosts_Periodregexp_At_Type_Hint : in Swagger.Nullable_UString;
Filter_Periodmethods : in Swagger.Nullable_UString;
Filter_Periodmethods_At_Type_Hint : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Config_Property
(Server : in out Server_Type;
Config_Node_Name : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Node
(Server : in out Server_Type;
Path : in Swagger.UString;
Name : in Swagger.UString;
Operation : in Swagger.Nullable_UString;
Delete_Authorizable : in Swagger.Nullable_UString;
File : in Swagger.File_Part_Type;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Node_Rw
(Server : in out Server_Type;
Path : in Swagger.UString;
Name : in Swagger.UString;
Add_Members : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Path
(Server : in out Server_Type;
Path : in Swagger.UString;
Jcr_Primary_Type : in Swagger.UString;
Name : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Query
(Server : in out Server_Type;
Path : in Swagger.UString;
P_Periodlimit : in Swagger.Number;
P_1Property : in Swagger.UString;
P_1Property_Periodvalue : in Swagger.UString;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Tree_Activation
(Server : in out Server_Type;
Ignoredeactivated : in Boolean;
Onlymodified : in Boolean;
Path : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Truststore
(Server : in out Server_Type;
Operation : in Swagger.Nullable_UString;
New_Password : in Swagger.Nullable_UString;
Re_Password : in Swagger.Nullable_UString;
Key_Store_Type : in Swagger.Nullable_UString;
Remove_Alias : in Swagger.Nullable_UString;
Certificate : in Swagger.File_Part_Type;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
--
procedure Post_Truststore_PKCS12
(Server : in out Server_Type;
Truststore_Periodp_12 : in Swagger.File_Part_Type;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type) is abstract;
generic
type Implementation_Type is limited new Server_Type with private;
URI_Prefix : String := "";
package Skeleton is
procedure Register (Server : in out Swagger.Servers.Application_Type'Class);
--
procedure Get_Aem_Product_Info
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Bundle_Info
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Config_Mgr
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Bundle
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Jmx_Repository
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Saml_Configuration
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Login_Page
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Cq_Actions
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Crxde_Status
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Install_Status
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Package_Manager_Servlet
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Package_Service
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Package_Service_Json
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Package_Update
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Set_Password
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Aem_Health_Check
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Aem_Health_Check_Servlet
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Aem_Password_Reset
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Ssl_Setup
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Delete_Agent
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Delete_Node
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Agent
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Agents
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Authorizable_Keystore
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Keystore
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Node
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Package
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Package_Filter
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Query
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Truststore
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Truststore_Info
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Agent
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Authorizable_Keystore
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Authorizables
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Adobe_Granite_Saml_Authentication_Handler
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Apache_Felix_Jetty_Based_Http_Service
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Apache_Http_Components_Proxy_Configuration
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Apache_Sling_Dav_Ex_Servlet
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Apache_Sling_Get_Servlet
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Apache_Sling_Referrer_Filter
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Property
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Node
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Node_Rw
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Path
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Query
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Tree_Activation
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Truststore
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Truststore_PKCS12
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
end Skeleton;
generic
type Implementation_Type is limited new Server_Type with private;
URI_Prefix : String := "";
package Shared_Instance is
procedure Register (Server : in out Swagger.Servers.Application_Type'Class);
--
procedure Get_Aem_Product_Info
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Bundle_Info
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Config_Mgr
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Bundle
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Jmx_Repository
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Saml_Configuration
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Login_Page
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Cq_Actions
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Crxde_Status
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Install_Status
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Package_Manager_Servlet
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Package_Service
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Package_Service_Json
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Package_Update
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Set_Password
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Aem_Health_Check
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Aem_Health_Check_Servlet
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Aem_Password_Reset
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Ssl_Setup
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Delete_Agent
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Delete_Node
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Agent
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Agents
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Authorizable_Keystore
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Keystore
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Node
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Package
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Package_Filter
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Query
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Truststore
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Truststore_Info
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Agent
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Authorizable_Keystore
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Authorizables
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Adobe_Granite_Saml_Authentication_Handler
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Apache_Felix_Jetty_Based_Http_Service
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Apache_Http_Components_Proxy_Configuration
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Apache_Sling_Dav_Ex_Servlet
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Apache_Sling_Get_Servlet
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Apache_Sling_Referrer_Filter
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Property
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Node
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Node_Rw
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Path
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Query
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Tree_Activation
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Truststore
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Truststore_PKCS12
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
private
protected Server is
--
procedure Get_Aem_Product_Info
(Result : out Swagger.UString_Vectors.Vector;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Bundle_Info
(Name : in Swagger.UString;
Result : out .Models.BundleInfo_Type;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Config_Mgr
(Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Bundle
(Name : in Swagger.UString;
Action : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Jmx_Repository
(Action : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Saml_Configuration
(Post : in Swagger.Nullable_Boolean;
Apply : in Swagger.Nullable_Boolean;
Delete : in Swagger.Nullable_Boolean;
Action : in Swagger.Nullable_UString;
Dollarlocation : in Swagger.Nullable_UString;
Path : in Swagger.UString_Vectors.Vector;
Service_Periodranking : in Swagger.Nullable_Integer;
Idp_Url : in Swagger.Nullable_UString;
Idp_Cert_Alias : in Swagger.Nullable_UString;
Idp_Http_Redirect : in Swagger.Nullable_Boolean;
Service_Provider_Entity_Id : in Swagger.Nullable_UString;
Assertion_Consumer_Service_URL : in Swagger.Nullable_UString;
Sp_Private_Key_Alias : in Swagger.Nullable_UString;
Key_Store_Password : in Swagger.Nullable_UString;
Default_Redirect_Url : in Swagger.Nullable_UString;
User_IDAttribute : in Swagger.Nullable_UString;
Use_Encryption : in Swagger.Nullable_Boolean;
Create_User : in Swagger.Nullable_Boolean;
Add_Group_Memberships : in Swagger.Nullable_Boolean;
Group_Membership_Attribute : in Swagger.Nullable_UString;
Default_Groups : in Swagger.UString_Vectors.Vector;
Name_Id_Format : in Swagger.Nullable_UString;
Synchronize_Attributes : in Swagger.UString_Vectors.Vector;
Handle_Logout : in Swagger.Nullable_Boolean;
Logout_Url : in Swagger.Nullable_UString;
Clock_Tolerance : in Swagger.Nullable_Integer;
Digest_Method : in Swagger.Nullable_UString;
Signature_Method : in Swagger.Nullable_UString;
User_Intermediate_Path : in Swagger.Nullable_UString;
Propertylist : in Swagger.UString_Vectors.Vector;
Result : out .Models.SamlConfigurationInfo_Type;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Login_Page
(Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Cq_Actions
(Authorizable_Id : in Swagger.UString;
Changelog : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Crxde_Status
(Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Install_Status
(Result : out .Models.InstallStatus_Type;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Package_Manager_Servlet (Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Package_Service
(Cmd : in Swagger.UString;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Package_Service_Json
(Path : in Swagger.UString;
Cmd : in Swagger.UString;
Group_Name : in Swagger.Nullable_UString;
Package_Name : in Swagger.Nullable_UString;
Package_Version : in Swagger.Nullable_UString;
Charset : in Swagger.Nullable_UString;
Force : in Swagger.Nullable_Boolean;
Recursive : in Swagger.Nullable_Boolean;
P_Package : in Swagger.File_Part_Type;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Package_Update
(Group_Name : in Swagger.UString;
Package_Name : in Swagger.UString;
Version : in Swagger.UString;
Path : in Swagger.UString;
Filter : in Swagger.Nullable_UString;
Charset : in Swagger.Nullable_UString;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Set_Password
(Old : in Swagger.UString;
Plain : in Swagger.UString;
Verify : in Swagger.UString;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Aem_Health_Check
(Tags : in Swagger.Nullable_UString;
Combine_Tags_Or : in Swagger.Nullable_Boolean;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Aem_Health_Check_Servlet
(Bundles_Periodignored : in Swagger.UString_Vectors.Vector;
Bundles_Periodignored_At_Type_Hint : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Aem_Password_Reset
(Pwdreset_Periodauthorizables : in Swagger.UString_Vectors.Vector;
Pwdreset_Periodauthorizables_At_Type_Hint : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Ssl_Setup
(Keystore_Password : in Swagger.UString;
Keystore_Password_Confirm : in Swagger.UString;
Truststore_Password : in Swagger.UString;
Truststore_Password_Confirm : in Swagger.UString;
Https_Hostname : in Swagger.UString;
Https_Port : in Swagger.UString;
Privatekey_File : in Swagger.File_Part_Type;
Certificate_File : in Swagger.File_Part_Type;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Delete_Agent
(Runmode : in Swagger.UString;
Name : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Delete_Node
(Path : in Swagger.UString;
Name : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Agent
(Runmode : in Swagger.UString;
Name : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Agents
(Runmode : in Swagger.UString;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Authorizable_Keystore
(Intermediate_Path : in Swagger.UString;
Authorizable_Id : in Swagger.UString;
Result : out .Models.KeystoreInfo_Type;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Keystore
(Intermediate_Path : in Swagger.UString;
Authorizable_Id : in Swagger.UString;
Result : out Swagger.Http_Content_Type;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Node
(Path : in Swagger.UString;
Name : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Package
(Group : in Swagger.UString;
Name : in Swagger.UString;
Version : in Swagger.UString;
Result : out Swagger.Http_Content_Type;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Package_Filter
(Group : in Swagger.UString;
Name : in Swagger.UString;
Version : in Swagger.UString;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Query
(Path : in Swagger.UString;
P_Periodlimit : in Swagger.Number;
P_1Property : in Swagger.UString;
P_1Property_Periodvalue : in Swagger.UString;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Truststore
(Result : out Swagger.Http_Content_Type;
Context : in out Swagger.Servers.Context_Type);
--
procedure Get_Truststore_Info
(Result : out .Models.TruststoreInfo_Type;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Agent
(Runmode : in Swagger.UString;
Name : in Swagger.UString;
Jcr_Content_Slashcq_Distribute : in Swagger.Nullable_Boolean;
Jcr_Content_Slashcq_Distribute_At_Type_Hint : in Swagger.Nullable_UString;
Jcr_Content_Slashcq_Name : in Swagger.Nullable_UString;
Jcr_Content_Slashcq_Template : in Swagger.Nullable_UString;
Jcr_Content_Slashenabled : in Swagger.Nullable_Boolean;
Jcr_Content_Slashjcr_Description : in Swagger.Nullable_UString;
Jcr_Content_Slashjcr_Last_Modified : in Swagger.Nullable_UString;
Jcr_Content_Slashjcr_Last_Modified_By : in Swagger.Nullable_UString;
Jcr_Content_Slashjcr_Mixin_Types : in Swagger.Nullable_UString;
Jcr_Content_Slashjcr_Title : in Swagger.Nullable_UString;
Jcr_Content_Slashlog_Level : in Swagger.Nullable_UString;
Jcr_Content_Slashno_Status_Update : in Swagger.Nullable_Boolean;
Jcr_Content_Slashno_Versioning : in Swagger.Nullable_Boolean;
Jcr_Content_Slashprotocol_Connect_Timeout : in Swagger.Number;
Jcr_Content_Slashprotocol_HTTPConnection_Closed : in Swagger.Nullable_Boolean;
Jcr_Content_Slashprotocol_HTTPExpired : in Swagger.Nullable_UString;
Jcr_Content_Slashprotocol_HTTPHeaders : in Swagger.UString_Vectors.Vector;
Jcr_Content_Slashprotocol_HTTPHeaders_At_Type_Hint : in Swagger.Nullable_UString;
Jcr_Content_Slashprotocol_HTTPMethod : in Swagger.Nullable_UString;
Jcr_Content_Slashprotocol_HTTPSRelaxed : in Swagger.Nullable_Boolean;
Jcr_Content_Slashprotocol_Interface : in Swagger.Nullable_UString;
Jcr_Content_Slashprotocol_Socket_Timeout : in Swagger.Number;
Jcr_Content_Slashprotocol_Version : in Swagger.Nullable_UString;
Jcr_Content_Slashproxy_NTLMDomain : in Swagger.Nullable_UString;
Jcr_Content_Slashproxy_NTLMHost : in Swagger.Nullable_UString;
Jcr_Content_Slashproxy_Host : in Swagger.Nullable_UString;
Jcr_Content_Slashproxy_Password : in Swagger.Nullable_UString;
Jcr_Content_Slashproxy_Port : in Swagger.Number;
Jcr_Content_Slashproxy_User : in Swagger.Nullable_UString;
Jcr_Content_Slashqueue_Batch_Max_Size : in Swagger.Number;
Jcr_Content_Slashqueue_Batch_Mode : in Swagger.Nullable_UString;
Jcr_Content_Slashqueue_Batch_Wait_Time : in Swagger.Number;
Jcr_Content_Slashretry_Delay : in Swagger.Nullable_UString;
Jcr_Content_Slashreverse_Replication : in Swagger.Nullable_Boolean;
Jcr_Content_Slashserialization_Type : in Swagger.Nullable_UString;
Jcr_Content_Slashsling_Resource_Type : in Swagger.Nullable_UString;
Jcr_Content_Slashssl : in Swagger.Nullable_UString;
Jcr_Content_Slashtransport_NTLMDomain : in Swagger.Nullable_UString;
Jcr_Content_Slashtransport_NTLMHost : in Swagger.Nullable_UString;
Jcr_Content_Slashtransport_Password : in Swagger.Nullable_UString;
Jcr_Content_Slashtransport_Uri : in Swagger.Nullable_UString;
Jcr_Content_Slashtransport_User : in Swagger.Nullable_UString;
Jcr_Content_Slashtrigger_Distribute : in Swagger.Nullable_Boolean;
Jcr_Content_Slashtrigger_Modified : in Swagger.Nullable_Boolean;
Jcr_Content_Slashtrigger_On_Off_Time : in Swagger.Nullable_Boolean;
Jcr_Content_Slashtrigger_Receive : in Swagger.Nullable_Boolean;
Jcr_Content_Slashtrigger_Specific : in Swagger.Nullable_Boolean;
Jcr_Content_Slashuser_Id : in Swagger.Nullable_UString;
Jcr_Primary_Type : in Swagger.Nullable_UString;
Operation : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Authorizable_Keystore
(Intermediate_Path : in Swagger.UString;
Authorizable_Id : in Swagger.UString;
Operation : in Swagger.Nullable_UString;
Current_Password : in Swagger.Nullable_UString;
New_Password : in Swagger.Nullable_UString;
Re_Password : in Swagger.Nullable_UString;
Key_Password : in Swagger.Nullable_UString;
Key_Store_Pass : in Swagger.Nullable_UString;
Alias : in Swagger.Nullable_UString;
New_Alias : in Swagger.Nullable_UString;
Remove_Alias : in Swagger.Nullable_UString;
Cert_Chain : in Swagger.File_Part_Type;
Pk : in Swagger.File_Part_Type;
Key_Store : in Swagger.File_Part_Type;
Result : out .Models.KeystoreInfo_Type;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Authorizables
(Authorizable_Id : in Swagger.UString;
Intermediate_Path : in Swagger.UString;
Create_User : in Swagger.Nullable_UString;
Create_Group : in Swagger.Nullable_UString;
Rep_Password : in Swagger.Nullable_UString;
Profile_Slashgiven_Name : in Swagger.Nullable_UString;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Adobe_Granite_Saml_Authentication_Handler
(Key_Store_Password : in Swagger.Nullable_UString;
Key_Store_Password_At_Type_Hint : in Swagger.Nullable_UString;
Service_Periodranking : in Swagger.Nullable_Integer;
Service_Periodranking_At_Type_Hint : in Swagger.Nullable_UString;
Idp_Http_Redirect : in Swagger.Nullable_Boolean;
Idp_Http_Redirect_At_Type_Hint : in Swagger.Nullable_UString;
Create_User : in Swagger.Nullable_Boolean;
Create_User_At_Type_Hint : in Swagger.Nullable_UString;
Default_Redirect_Url : in Swagger.Nullable_UString;
Default_Redirect_Url_At_Type_Hint : in Swagger.Nullable_UString;
User_IDAttribute : in Swagger.Nullable_UString;
User_IDAttribute_At_Type_Hint : in Swagger.Nullable_UString;
Default_Groups : in Swagger.UString_Vectors.Vector;
Default_Groups_At_Type_Hint : in Swagger.Nullable_UString;
Idp_Cert_Alias : in Swagger.Nullable_UString;
Idp_Cert_Alias_At_Type_Hint : in Swagger.Nullable_UString;
Add_Group_Memberships : in Swagger.Nullable_Boolean;
Add_Group_Memberships_At_Type_Hint : in Swagger.Nullable_UString;
Path : in Swagger.UString_Vectors.Vector;
Path_At_Type_Hint : in Swagger.Nullable_UString;
Synchronize_Attributes : in Swagger.UString_Vectors.Vector;
Synchronize_Attributes_At_Type_Hint : in Swagger.Nullable_UString;
Clock_Tolerance : in Swagger.Nullable_Integer;
Clock_Tolerance_At_Type_Hint : in Swagger.Nullable_UString;
Group_Membership_Attribute : in Swagger.Nullable_UString;
Group_Membership_Attribute_At_Type_Hint : in Swagger.Nullable_UString;
Idp_Url : in Swagger.Nullable_UString;
Idp_Url_At_Type_Hint : in Swagger.Nullable_UString;
Logout_Url : in Swagger.Nullable_UString;
Logout_Url_At_Type_Hint : in Swagger.Nullable_UString;
Service_Provider_Entity_Id : in Swagger.Nullable_UString;
Service_Provider_Entity_Id_At_Type_Hint : in Swagger.Nullable_UString;
Assertion_Consumer_Service_URL : in Swagger.Nullable_UString;
Assertion_Consumer_Service_URLAt_Type_Hint : in Swagger.Nullable_UString;
Handle_Logout : in Swagger.Nullable_Boolean;
Handle_Logout_At_Type_Hint : in Swagger.Nullable_UString;
Sp_Private_Key_Alias : in Swagger.Nullable_UString;
Sp_Private_Key_Alias_At_Type_Hint : in Swagger.Nullable_UString;
Use_Encryption : in Swagger.Nullable_Boolean;
Use_Encryption_At_Type_Hint : in Swagger.Nullable_UString;
Name_Id_Format : in Swagger.Nullable_UString;
Name_Id_Format_At_Type_Hint : in Swagger.Nullable_UString;
Digest_Method : in Swagger.Nullable_UString;
Digest_Method_At_Type_Hint : in Swagger.Nullable_UString;
Signature_Method : in Swagger.Nullable_UString;
Signature_Method_At_Type_Hint : in Swagger.Nullable_UString;
User_Intermediate_Path : in Swagger.Nullable_UString;
User_Intermediate_Path_At_Type_Hint : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Apache_Felix_Jetty_Based_Http_Service
(Org_Periodapache_Periodfelix_Periodhttps_Periodnio : in Swagger.Nullable_Boolean;
Org_Periodapache_Periodfelix_Periodhttps_Periodnio_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodpassword : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodpassword_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodkey : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodkey_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodkey_Periodpassword : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodkeystore_Periodkey_Periodpassword_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodtruststore : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodtruststore_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodtruststore_Periodpassword : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodtruststore_Periodpassword_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodclientcertificate : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodclientcertificate_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodapache_Periodfelix_Periodhttps_Periodenable : in Swagger.Nullable_Boolean;
Org_Periodapache_Periodfelix_Periodhttps_Periodenable_At_Type_Hint : in Swagger.Nullable_UString;
Org_Periodosgi_Periodservice_Periodhttp_Periodport_Periodsecure : in Swagger.Nullable_UString;
Org_Periodosgi_Periodservice_Periodhttp_Periodport_Periodsecure_At_Type_Hint : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Apache_Http_Components_Proxy_Configuration
(Proxy_Periodhost : in Swagger.Nullable_UString;
Proxy_Periodhost_At_Type_Hint : in Swagger.Nullable_UString;
Proxy_Periodport : in Swagger.Nullable_Integer;
Proxy_Periodport_At_Type_Hint : in Swagger.Nullable_UString;
Proxy_Periodexceptions : in Swagger.UString_Vectors.Vector;
Proxy_Periodexceptions_At_Type_Hint : in Swagger.Nullable_UString;
Proxy_Periodenabled : in Swagger.Nullable_Boolean;
Proxy_Periodenabled_At_Type_Hint : in Swagger.Nullable_UString;
Proxy_Perioduser : in Swagger.Nullable_UString;
Proxy_Perioduser_At_Type_Hint : in Swagger.Nullable_UString;
Proxy_Periodpassword : in Swagger.Nullable_UString;
Proxy_Periodpassword_At_Type_Hint : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Apache_Sling_Dav_Ex_Servlet
(Alias : in Swagger.Nullable_UString;
Alias_At_Type_Hint : in Swagger.Nullable_UString;
Dav_Periodcreate_Absolute_Uri : in Swagger.Nullable_Boolean;
Dav_Periodcreate_Absolute_Uri_At_Type_Hint : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Apache_Sling_Get_Servlet
(Json_Periodmaximumresults : in Swagger.Nullable_UString;
Json_Periodmaximumresults_At_Type_Hint : in Swagger.Nullable_UString;
Enable_Periodhtml : in Swagger.Nullable_Boolean;
Enable_Periodhtml_At_Type_Hint : in Swagger.Nullable_UString;
Enable_Periodtxt : in Swagger.Nullable_Boolean;
Enable_Periodtxt_At_Type_Hint : in Swagger.Nullable_UString;
Enable_Periodxml : in Swagger.Nullable_Boolean;
Enable_Periodxml_At_Type_Hint : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Apache_Sling_Referrer_Filter
(Allow_Periodempty : in Swagger.Nullable_Boolean;
Allow_Periodempty_At_Type_Hint : in Swagger.Nullable_UString;
Allow_Periodhosts : in Swagger.Nullable_UString;
Allow_Periodhosts_At_Type_Hint : in Swagger.Nullable_UString;
Allow_Periodhosts_Periodregexp : in Swagger.Nullable_UString;
Allow_Periodhosts_Periodregexp_At_Type_Hint : in Swagger.Nullable_UString;
Filter_Periodmethods : in Swagger.Nullable_UString;
Filter_Periodmethods_At_Type_Hint : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Config_Property
(Config_Node_Name : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Node
(Path : in Swagger.UString;
Name : in Swagger.UString;
Operation : in Swagger.Nullable_UString;
Delete_Authorizable : in Swagger.Nullable_UString;
File : in Swagger.File_Part_Type;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Node_Rw
(Path : in Swagger.UString;
Name : in Swagger.UString;
Add_Members : in Swagger.Nullable_UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Path
(Path : in Swagger.UString;
Jcr_Primary_Type : in Swagger.UString;
Name : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Query
(Path : in Swagger.UString;
P_Periodlimit : in Swagger.Number;
P_1Property : in Swagger.UString;
P_1Property_Periodvalue : in Swagger.UString;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Tree_Activation
(Ignoredeactivated : in Boolean;
Onlymodified : in Boolean;
Path : in Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Truststore
(Operation : in Swagger.Nullable_UString;
New_Password : in Swagger.Nullable_UString;
Re_Password : in Swagger.Nullable_UString;
Key_Store_Type : in Swagger.Nullable_UString;
Remove_Alias : in Swagger.Nullable_UString;
Certificate : in Swagger.File_Part_Type;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
--
procedure Post_Truststore_PKCS12
(Truststore_Periodp_12 : in Swagger.File_Part_Type;
Result : out Swagger.UString;
Context : in out Swagger.Servers.Context_Type);
private
Impl : Implementation_Type;
end Server;
end Shared_Instance;
end .Skeletons;
| 42.542615 | 137 | 0.673494 |
22819fbd0985c19f495bcab1b8d0437da3e63376 | 1,862 | ada | Ada | demos/semaphor.ada | daveshields/AdaEd | 57daecfb7ccadfd9aaf13b4d54f51065affbe599 | [
"BSD-4-Clause",
"BSD-3-Clause"
] | 3 | 2019-05-11T04:11:33.000Z | 2021-04-18T14:55:43.000Z | demos/semaphor.ada | daveshields/AdaEd | 57daecfb7ccadfd9aaf13b4d54f51065affbe599 | [
"BSD-4-Clause",
"BSD-3-Clause"
] | null | null | null | demos/semaphor.ada | daveshields/AdaEd | 57daecfb7ccadfd9aaf13b4d54f51065affbe599 | [
"BSD-4-Clause",
"BSD-3-Clause"
] | 2 | 2016-10-29T22:52:56.000Z | 2021-04-18T14:55:45.000Z | ----------------------------------------------------------------------
--
-- Semaphore Package
--
-- written by
--
-- Edmond Schonberg
--
-- Ada Project
-- Courant Institute
-- New York University
-- 251 Mercer Street
-- New York, New York 10012
--
-----------------------------------------------------------------------
package SEMAPHORE is
generic
INIT: NATURAL; -- initial value of semaphore
package COUNT_SEMAPHORE is
task COUNTING_SEMAPHORE is --similar to Amoroso's counting semaphore
entry P;
entry V;
end COUNTING_SEMAPHORE;
end COUNT_SEMAPHORE;
task type BINARY_SEMAPHORE is -- implements binary semaphores as suggested by
entry P; -- Amoroso and Ingargiola.
entry V;
end BINARY_SEMAPHORE;
type ACCESS_BINARY_SEMAPHORE is access BINARY_SEMAPHORE;
end SEMAPHORE;
package body SEMAPHORE is
package body COUNT_SEMAPHORE is
task body COUNTING_SEMAPHORE is
S: INTEGER := INIT;
begin
loop -- run forever, waiting for P or V to be called
select
when S > 0 => accept P; S := S - 1;
or
accept V; S := S + 1; -- S > INIT implies that new resources
end select; -- became available that were originally
end loop; -- unknown. This is not like Amoroso's
end COUNTING_SEMAPHORE; -- version.
end COUNT_SEMAPHORE;
task body BINARY_SEMAPHORE is
begin
loop
select
accept P;
or
terminate ;
end select ;
accept V;
end loop;
end BINARY_SEMAPHORE;
end SEMAPHORE;
| 25.861111 | 80 | 0.493555 |
585433bb9197ce8c660116e64f3912231171ce54 | 3,578 | ads | Ada | source/amf/mof/xmi/xmi-reader.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/mof/xmi/xmi-reader.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/mof/xmi/xmi-reader.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2010-2011, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.URI_Stores;
with League.Strings;
package XMI.Reader is
function Read_URI
(URI : League.Strings.Universal_String)
return AMF.URI_Stores.URI_Store_Access;
-- Loads model from the specified URI.
end XMI.Reader;
| 65.054545 | 78 | 0.412241 |
22cd2f381c2ac2b27890005b6a201488a988f0ed | 14,543 | adb | Ada | tests/unit_tests/sponge_suite.adb | damaki/libkeccak | d06217e525f7927380690d6c37b485bdbe8aa96e | [
"BSD-3-Clause"
] | 26 | 2015-09-20T17:52:38.000Z | 2021-07-29T21:47:04.000Z | tests/unit_tests/sponge_suite.adb | damaki/libkeccak | d06217e525f7927380690d6c37b485bdbe8aa96e | [
"BSD-3-Clause"
] | 3 | 2019-03-12T16:01:36.000Z | 2020-05-23T13:06:43.000Z | tests/unit_tests/sponge_suite.adb | damaki/libkeccak | d06217e525f7927380690d6c37b485bdbe8aa96e | [
"BSD-3-Clause"
] | 2 | 2019-04-15T18:02:19.000Z | 2020-11-22T11:22:18.000Z | -------------------------------------------------------------------------------
-- Copyright (c) 2016, Daniel King
-- 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.
-- * The name of the copyright holder may not 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 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 Sponge_Tests;
with Keccak.Keccak_1600.Rounds_24;
with Keccak.Keccak_800.Rounds_22;
with Keccak.Keccak_400.Rounds_20;
with Keccak.Keccak_200.Rounds_18;
with Keccak.Keccak_100.Rounds_16;
with Keccak.Keccak_50.Rounds_14;
with Keccak.Keccak_25.Rounds_12;
with Gimli.Sponge;
with AUnit.Test_Caller;
package body Sponge_Suite
is
-- For these tests we need to choose values for the Capacity such that the
-- rate will be a multiple of 8 (required precondition for Sponge.Init).
package Sponge_1600_Tests is new Sponge_Tests
(Keccak.Keccak_1600.Rounds_24.Sponge, 512);
package Sponge_800_Tests is new Sponge_Tests
(Keccak.Keccak_800.Rounds_22.Sponge, 512);
package Sponge_400_Tests is new Sponge_Tests
(Keccak.Keccak_400.Rounds_20.Sponge, 256);
package Sponge_200_Tests is new Sponge_Tests
(Keccak.Keccak_200.Rounds_18.Sponge, 128);
package Sponge_100_Tests is new Sponge_Tests
(Keccak.Keccak_100.Rounds_16.Sponge, 60);
package Sponge_50_Tests is new Sponge_Tests
(Keccak.Keccak_50.Rounds_14.Sponge, 26);
package Sponge_25_Tests is new Sponge_Tests
(Keccak.Keccak_25.Rounds_12.Sponge, 9);
package Sponge_Gimli_Tests is new Sponge_Tests
(Gimli.Sponge, 256);
package Caller_1600 is new AUnit.Test_Caller (Sponge_1600_Tests.Test);
package Caller_800 is new AUnit.Test_Caller (Sponge_800_Tests.Test);
package Caller_400 is new AUnit.Test_Caller (Sponge_400_Tests.Test);
package Caller_200 is new AUnit.Test_Caller (Sponge_200_Tests.Test);
package Caller_100 is new AUnit.Test_Caller (Sponge_100_Tests.Test);
package Caller_50 is new AUnit.Test_Caller (Sponge_50_Tests.Test);
package Caller_25 is new AUnit.Test_Caller (Sponge_25_Tests.Test);
package Caller_Gimli is new AUnit.Test_Caller (Sponge_Gimli_Tests.Test);
function Suite return Access_Test_Suite
is
Ret : constant Access_Test_Suite := new Test_Suite;
begin
Ret.Add_Test
(Caller_1600.Create
("Sponge[Keccak-f[1600], pad10*1, 512]: Input streaming test",
Sponge_1600_Tests.Test_Absorb_Streaming'Access));
Ret.Add_Test
(Caller_1600.Create
("Sponge[Keccak-f[1600], pad10*1, 512]: Output streaming test",
Sponge_1600_Tests.Test_Squeeze_Streaming'Access));
Ret.Add_Test
(Caller_1600.Create
("Sponge[Keccak-f[1600], pad10*1, 512]: Absorb same as Absorb_With_Suffix with 0 suffix bits",
Sponge_1600_Tests.Test_Absorb_No_Suffix'Access));
Ret.Add_Test
(Caller_1600.Create
("Sponge[Keccak-f[1600], pad10*1, 512]: Absorb_With_Suffix is same as Absorb with suffix bits in message",
Sponge_1600_Tests.Test_Suffix_Bits'Access));
Ret.Add_Test
(Caller_1600.Create
("Sponge[Keccak-f[1600], pad10*1, 512]: Test absorbing 0 bits",
Sponge_1600_Tests.Test_Null_Absorb'Access));
Ret.Add_Test
(Caller_1600.Create
("Sponge[Keccak-f[1600], pad10*1, 512]: Test absorbing only suffix bits",
Sponge_1600_Tests.Test_Absorb_Suffix_Only'Access));
Ret.Add_Test
(Caller_1600.Create
("Sponge[Keccak-f[1600], pad10*1, 512]: Test suffix bits packing",
Sponge_1600_Tests.Test_Suffix_Packing'Access));
Ret.Add_Test
(Caller_800.Create
("Sponge[Keccak-f[800], pad10*1, 512]: Input streaming test",
Sponge_800_Tests.Test_Absorb_Streaming'Access));
Ret.Add_Test
(Caller_800.Create
("Sponge[Keccak-f[800], pad10*1, 512]: Output streaming test",
Sponge_800_Tests.Test_Squeeze_Streaming'Access));
Ret.Add_Test
(Caller_800.Create
("Sponge[Keccak-f[800], pad10*1, 512]: Absorb same as Absorb_With_Suffix with 0 suffix bits",
Sponge_800_Tests.Test_Absorb_No_Suffix'Access));
Ret.Add_Test
(Caller_800.Create
("Sponge[Keccak-f[800], pad10*1, 512]: Absorb_With_Suffix is same as Absorb with suffix bits in message",
Sponge_800_Tests.Test_Suffix_Bits'Access));
Ret.Add_Test
(Caller_800.Create
("Sponge[Keccak-f[800], pad10*1, 512]: Test absorbing 0 bits",
Sponge_800_Tests.Test_Null_Absorb'Access));
Ret.Add_Test
(Caller_800.Create
("Sponge[Keccak-f[800], pad10*1, 512]: Test absorbing only suffix bits",
Sponge_800_Tests.Test_Absorb_Suffix_Only'Access));
Ret.Add_Test
(Caller_800.Create
("Sponge[Keccak-f[800], pad10*1, 512]: Test suffix bits packing",
Sponge_800_Tests.Test_Suffix_Packing'Access));
Ret.Add_Test
(Caller_400.Create
("Sponge[Keccak-f[400], pad10*1, 256]: Input streaming test",
Sponge_400_Tests.Test_Absorb_Streaming'Access));
Ret.Add_Test
(Caller_400.Create
("Sponge[Keccak-f[400], pad10*1, 256]: Output streaming test",
Sponge_400_Tests.Test_Squeeze_Streaming'Access));
Ret.Add_Test
(Caller_400.Create
("Sponge[Keccak-f[400], pad10*1, 256]: Absorb same as Absorb_With_Suffix with 0 suffix bits",
Sponge_400_Tests.Test_Absorb_No_Suffix'Access));
Ret.Add_Test
(Caller_400.Create
("Sponge[Keccak-f[400], pad10*1, 256]: Absorb_With_Suffix is same as Absorb with suffix bits in message",
Sponge_400_Tests.Test_Suffix_Bits'Access));
Ret.Add_Test
(Caller_400.Create
("Sponge[Keccak-f[400], pad10*1, 256]: Test absorbing 0 bits",
Sponge_400_Tests.Test_Null_Absorb'Access));
Ret.Add_Test
(Caller_400.Create
("Sponge[Keccak-f[400], pad10*1, 256]: Test absorbing only suffix bits",
Sponge_400_Tests.Test_Absorb_Suffix_Only'Access));
Ret.Add_Test
(Caller_400.Create
("Sponge[Keccak-f[400], pad10*1, 256]: Test suffix bits packing",
Sponge_400_Tests.Test_Suffix_Packing'Access));
Ret.Add_Test
(Caller_200.Create
("Sponge[Keccak-f[200], pad10*1, 128]: Input streaming test",
Sponge_200_Tests.Test_Absorb_Streaming'Access));
Ret.Add_Test
(Caller_200.Create
("Sponge[Keccak-f[200], pad10*1, 128]: Output streaming test",
Sponge_200_Tests.Test_Squeeze_Streaming'Access));
Ret.Add_Test
(Caller_200.Create
("Sponge[Keccak-f[200], pad10*1, 128]: Absorb same as Absorb_With_Suffix with 0 suffix bits",
Sponge_200_Tests.Test_Absorb_No_Suffix'Access));
Ret.Add_Test
(Caller_200.Create
("Sponge[Keccak-f[200], pad10*1, 128]: Absorb_With_Suffix is same as Absorb with suffix bits in message",
Sponge_200_Tests.Test_Suffix_Bits'Access));
Ret.Add_Test
(Caller_200.Create
("Sponge[Keccak-f[200], pad10*1, 128]: Test absorbing 0 bits",
Sponge_200_Tests.Test_Null_Absorb'Access));
Ret.Add_Test
(Caller_200.Create
("Sponge[Keccak-f[200], pad10*1, 128]: Test absorbing only suffix bits",
Sponge_200_Tests.Test_Absorb_Suffix_Only'Access));
Ret.Add_Test
(Caller_200.Create
("Sponge[Keccak-f[200], pad10*1, 128]: Test suffix bits packing",
Sponge_200_Tests.Test_Suffix_Packing'Access));
Ret.Add_Test
(Caller_100.Create
("Sponge[Keccak-f[100], pad10*1, 60]: Input streaming test",
Sponge_100_Tests.Test_Absorb_Streaming'Access));
Ret.Add_Test
(Caller_100.Create
("Sponge[Keccak-f[100], pad10*1, 60]: Output streaming test",
Sponge_100_Tests.Test_Squeeze_Streaming'Access));
Ret.Add_Test
(Caller_100.Create
("Sponge[Keccak-f[100], pad10*1, 60]: Absorb same as Absorb_With_Suffix with 0 suffix bits",
Sponge_100_Tests.Test_Absorb_No_Suffix'Access));
Ret.Add_Test
(Caller_100.Create
("Sponge[Keccak-f[100], pad10*1, 60]: Absorb_With_Suffix is same as Absorb with suffix bits in message",
Sponge_100_Tests.Test_Suffix_Bits'Access));
Ret.Add_Test
(Caller_100.Create
("Sponge[Keccak-f[100], pad10*1, 60]: Test absorbing 0 bits",
Sponge_100_Tests.Test_Null_Absorb'Access));
Ret.Add_Test
(Caller_100.Create
("Sponge[Keccak-f[100], pad10*1, 60]: Test absorbing only suffix bits",
Sponge_100_Tests.Test_Absorb_Suffix_Only'Access));
Ret.Add_Test
(Caller_100.Create
("Sponge[Keccak-f[100], pad10*1, 60]: Test suffix bits packing",
Sponge_100_Tests.Test_Suffix_Packing'Access));
Ret.Add_Test
(Caller_50.Create
("Sponge[Keccak-f[50], pad10*1, 26]: Input streaming test",
Sponge_50_Tests.Test_Absorb_Streaming'Access));
Ret.Add_Test
(Caller_50.Create
("Sponge[Keccak-f[50], pad10*1, 26]: Output streaming test",
Sponge_50_Tests.Test_Squeeze_Streaming'Access));
Ret.Add_Test
(Caller_50.Create
("Sponge[Keccak-f[50], pad10*1, 26]: Absorb same as Absorb_With_Suffix with 0 suffix bits",
Sponge_50_Tests.Test_Absorb_No_Suffix'Access));
Ret.Add_Test
(Caller_50.Create
("Sponge[Keccak-f[50], pad10*1, 26]: Absorb_With_Suffix is same as Absorb with suffix bits in message",
Sponge_50_Tests.Test_Suffix_Bits'Access));
Ret.Add_Test
(Caller_50.Create
("Sponge[Keccak-f[50], pad10*1, 26]: Test absorbing 0 bits",
Sponge_50_Tests.Test_Null_Absorb'Access));
Ret.Add_Test
(Caller_50.Create
("Sponge[Keccak-f[50], pad10*1, 26]: Test absorbing only suffix bits",
Sponge_50_Tests.Test_Absorb_Suffix_Only'Access));
Ret.Add_Test
(Caller_50.Create
("Sponge[Keccak-f[50], pad10*1, 26]: Test suffix bits packing",
Sponge_50_Tests.Test_Suffix_Packing'Access));
Ret.Add_Test
(Caller_25.Create
("Sponge[Keccak-f[25], pad10*1, 9]: Input streaming test",
Sponge_25_Tests.Test_Absorb_Streaming'Access));
Ret.Add_Test
(Caller_25.Create
("Sponge[Keccak-f[25], pad10*1, 9]: Output streaming test",
Sponge_25_Tests.Test_Squeeze_Streaming'Access));
Ret.Add_Test
(Caller_25.Create
("Sponge[Keccak-f[25], pad10*1, 9]: Absorb same as Absorb_With_Suffix with 0 suffix bits",
Sponge_25_Tests.Test_Absorb_No_Suffix'Access));
Ret.Add_Test
(Caller_25.Create
("Sponge[Keccak-f[25], pad10*1, 9]: Absorb_With_Suffix is same as Absorb with suffix bits in message",
Sponge_25_Tests.Test_Suffix_Bits'Access));
Ret.Add_Test
(Caller_25.Create
("Sponge[Keccak-f[25], pad10*1, 9]: Test absorbing 0 bits",
Sponge_25_Tests.Test_Null_Absorb'Access));
Ret.Add_Test
(Caller_25.Create
("Sponge[Keccak-f[25], pad10*1, 9]: Test absorbing only suffix bits",
Sponge_25_Tests.Test_Absorb_Suffix_Only'Access));
Ret.Add_Test
(Caller_25.Create
("Sponge[Keccak-f[25], pad10*1, 9]: Test suffix bits packing",
Sponge_25_Tests.Test_Suffix_Packing'Access));
Ret.Add_Test
(Caller_Gimli.Create
("Sponge[Gimli, pad10*1, 256]: Input streaming test",
Sponge_Gimli_Tests.Test_Absorb_Streaming'Access));
Ret.Add_Test
(Caller_Gimli.Create
("Sponge[Gimli, pad10*1, 256]: Output streaming test",
Sponge_Gimli_Tests.Test_Squeeze_Streaming'Access));
Ret.Add_Test
(Caller_Gimli.Create
("Sponge[Gimli, pad10*1, 256]: Absorb same as Absorb_With_Suffix with 0 suffix bits",
Sponge_Gimli_Tests.Test_Absorb_No_Suffix'Access));
Ret.Add_Test
(Caller_Gimli.Create
("Sponge[Gimli, pad10*1, 256]: Absorb_With_Suffix is same as Absorb with suffix bits in message",
Sponge_Gimli_Tests.Test_Suffix_Bits'Access));
Ret.Add_Test
(Caller_Gimli.Create
("Sponge[Gimli, pad10*1, 256]: Test absorbing 0 bits",
Sponge_Gimli_Tests.Test_Null_Absorb'Access));
Ret.Add_Test
(Caller_Gimli.Create
("Sponge[Gimli, pad10*1, 256]: Test absorbing only suffix bits",
Sponge_Gimli_Tests.Test_Absorb_Suffix_Only'Access));
Ret.Add_Test
(Caller_Gimli.Create
("Sponge[Gimli, pad10*1, 256]: Test suffix bits packing",
Sponge_Gimli_Tests.Test_Suffix_Packing'Access));
return Ret;
end Suite;
end Sponge_Suite;
| 45.732704 | 118 | 0.654542 |
22e5b9436d508677db1b86c6836593e99d15d1b9 | 2,829 | ads | Ada | src/agate-traps.ads | Fabien-Chouteau/AGATE | cd8dbc54c1c70379c833e7cd710e2326ad6e9a91 | [
"BSD-3-Clause"
] | 3 | 2017-12-23T10:25:07.000Z | 2021-06-09T13:47:19.000Z | src/agate-traps.ads | Fabien-Chouteau/AGATE | cd8dbc54c1c70379c833e7cd710e2326ad6e9a91 | [
"BSD-3-Clause"
] | null | null | null | src/agate-traps.ads | Fabien-Chouteau/AGATE | cd8dbc54c1c70379c833e7cd710e2326ad6e9a91 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2017, Fabien Chouteau --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with AGATE_Arch_Parameters;
private package AGATE.Traps is
type Trap_ID is new AGATE_Arch_Parameters.Trap_ID;
type Trap_Priority is new AGATE_Arch_Parameters.Trap_Priority;
type Trap_Handler is access procedure;
procedure Register (Handler : Trap_Handler;
ID : Trap_ID;
Priority : Trap_Priority);
procedure Enable (ID : Trap_ID);
procedure Disable (ID : Trap_ID);
end AGATE.Traps;
| 57.734694 | 78 | 0.533758 |
59892faa2626438599ae5d1f67d00cf2c8477467 | 422 | ads | Ada | common/utils.ads | ekoeppen/MSP430_Generic_Ada_Drivers | 12b8238ea22dbb0c0c6c63ca46bfa7e2cb80334a | [
"MIT"
] | 1 | 2021-04-06T07:57:56.000Z | 2021-04-06T07:57:56.000Z | common/utils.ads | ekoeppen/MSP430_Generic_Ada_Drivers | 12b8238ea22dbb0c0c6c63ca46bfa7e2cb80334a | [
"MIT"
] | null | null | null | common/utils.ads | ekoeppen/MSP430_Generic_Ada_Drivers | 12b8238ea22dbb0c0c6c63ca46bfa7e2cb80334a | [
"MIT"
] | 2 | 2018-05-29T13:59:31.000Z | 2019-02-03T19:48:08.000Z | with Interfaces; use Interfaces;
package Utils is
pragma Preelaborate;
subtype Hex_String_Byte is String (1 .. 2);
subtype Hex_String_Short is String (1 .. 4);
subtype Hex_String_Word is String (1 .. 8);
function To_Hex_String (B : Unsigned_8) return Hex_String_Byte;
function To_Hex_String (S : Unsigned_16) return Hex_String_Short;
function To_Hex_String (W : Unsigned_32) return Hex_String_Word;
end Utils;
| 26.375 | 66 | 0.772512 |
57e032ff9e0b5065f205f650eb9e305f0f6786ac | 10,526 | adb | Ada | source/web/wsse/web_services-soap-security-modules.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/web/wsse/web_services-soap-security-modules.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/web/wsse/web_services-soap-security-modules.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012-2013, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with League.Stream_Element_Vectors;
with Web_Services.SOAP.Payloads.Faults.Simple;
with Web_Services.SOAP.Security.Constants;
with Web_Services.SOAP.Security.Headers;
with Web_Services.SOAP.Security.Password_Digest_Utilities;
package body Web_Services.SOAP.Security.Modules is
procedure Default_Provider
(Username : League.Strings.Universal_String;
Password : out League.Strings.Universal_String;
Success : out Boolean);
Get_Authentication_Data : Authentication_Data_Provider
:= Default_Provider'Access;
procedure Create_Invalid_Security_Token_Fault
(Output : out Web_Services.SOAP.Messages.SOAP_Message_Access);
procedure Create_Failed_Authentication_Fault
(Output : out Web_Services.SOAP.Messages.SOAP_Message_Access);
----------------------------------------
-- Create_Failed_Authentication_Fault --
----------------------------------------
procedure Create_Failed_Authentication_Fault
(Output : out Web_Services.SOAP.Messages.SOAP_Message_Access) is
begin
Output :=
new Web_Services.SOAP.Messages.SOAP_Message'
(Payload =>
Web_Services.SOAP.Payloads.Faults.Simple.Create_Sender_Fault
(Web_Services.SOAP.Security.Constants.WSSE_Namespace_URI,
League.Strings.To_Universal_String ("FailedAuthentication"),
League.Strings.To_Universal_String ("wsse"),
League.Strings.To_Universal_String ("en-US"),
League.Strings.To_Universal_String
("The security token could not be authenticated"
& " or authorized")),
others => <>);
end Create_Failed_Authentication_Fault;
-----------------------------------------
-- Create_Invalid_Security_Token_Fault --
-----------------------------------------
procedure Create_Invalid_Security_Token_Fault
(Output : out Web_Services.SOAP.Messages.SOAP_Message_Access) is
begin
Output :=
new Web_Services.SOAP.Messages.SOAP_Message'
(Payload =>
Web_Services.SOAP.Payloads.Faults.Simple.Create_Sender_Fault
(Web_Services.SOAP.Security.Constants.WSSE_Namespace_URI,
League.Strings.To_Universal_String ("InvalidSecurityToken"),
League.Strings.To_Universal_String ("wsse"),
League.Strings.To_Universal_String ("en-US"),
League.Strings.To_Universal_String
("An invalid security token was provided")),
others => <>);
end Create_Invalid_Security_Token_Fault;
----------------------
-- Default_Provider --
----------------------
procedure Default_Provider
(Username : League.Strings.Universal_String;
Password : out League.Strings.Universal_String;
Success : out Boolean)
is
use type League.Strings.Universal_String;
begin
if Username /= League.Strings.To_Universal_String ("boris") then
Success := False;
else
Success := True;
Password := League.Strings.To_Universal_String ("123");
end if;
end Default_Provider;
---------------------
-- Receive_Request --
---------------------
overriding procedure Receive_Request
(Self : in out Security_Module;
Message : in out Web_Services.SOAP.Messages.SOAP_Message;
Output : in out Web_Services.SOAP.Messages.SOAP_Message_Access)
is
pragma Unreferenced (Self);
use type League.Stream_Element_Vectors.Stream_Element_Vector;
use type League.Strings.Universal_String;
use type Web_Services.SOAP.Security.Headers.Username_Token_Header_Access;
Token :
Web_Services.SOAP.Security.Headers.Username_Token_Header_Access;
Password : League.Strings.Universal_String;
Success : Boolean;
begin
-- There is no authentication data provider configured, security is
-- disabled.
if Get_Authentication_Data = null then
return;
end if;
-- Obtain authentication token.
for Header of Message.Headers loop
if Header.all
in Web_Services.SOAP.Security.Headers.Username_Token_Header'Class
then
Token :=
Web_Services.SOAP.Security.Headers.Username_Token_Header_Access
(Header);
exit;
end if;
end loop;
-- Authentication token is not provided, return fault.
if Token = null then
Create_Invalid_Security_Token_Fault (Output);
return;
end if;
-- Obtain authentication data.
Get_Authentication_Data (Token.Username, Password, Success);
if not Success then
Create_Failed_Authentication_Fault (Output);
return;
end if;
-- Check password.
case Token.Mode is
when Web_Services.SOAP.Security.Headers.Text =>
if Password /= Token.Password then
Create_Failed_Authentication_Fault (Output);
return;
end if;
when Web_Services.SOAP.Security.Headers.Digest =>
-- Password digest is calculated as:
--
-- Password_Digest =
-- Base64 ( SHA-1 ( nonce + created + password ) )
if Web_Services.SOAP.Security.Password_Digest_Utilities.
Compute_Digest (Password, Token.Nonce, Token.Created)
/= Token.Digest
then
Create_Failed_Authentication_Fault (Output);
return;
end if;
end case;
end Receive_Request;
------------------
-- Send_Request --
------------------
overriding procedure Send_Request
(Self : in out Security_Module;
Message : in out Web_Services.SOAP.Messages.SOAP_Message;
User : League.Strings.Universal_String;
Password : League.Strings.Universal_String)
is
pragma Unreferenced (Self);
begin
if User.Is_Empty then
return;
end if;
declare
Header : constant
Web_Services.SOAP.Security.Headers.Username_Token_Header_Access
:= new Web_Services.SOAP.Security.Headers.Username_Token_Header;
begin
Header.Mode := Headers.Digest; -- FIXME: How does user set mode?
Header.Password := Password; -- For Mode = Text
Header.Username := User;
Header.Nonce :=
Web_Services.SOAP.Security.Password_Digest_Utilities.Generate_Nonce;
Header.Created :=
Web_Services.SOAP.Security.Password_Digest_Utilities.
Generate_Created;
Header.Digest :=
Web_Services.SOAP.Security.Password_Digest_Utilities.Compute_Digest
(Password, Header.Nonce, Header.Created);
Message.Headers.Insert (Header.all'Access);
end;
end Send_Request;
--------------------------------------
-- Set_Authentication_Data_Provider --
--------------------------------------
procedure Set_Authentication_Data_Provider
(Provider : Authentication_Data_Provider) is
begin
Get_Authentication_Data := Provider;
end Set_Authentication_Data_Provider;
end Web_Services.SOAP.Security.Modules;
| 39.571429 | 79 | 0.552347 |
1255efd6b7d7b931bbce7e89e8121e9fe05ee8fb | 3,015 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/s-commun.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/ada/s-commun.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/s-commun.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . C O M M U N I C A T I O N --
-- --
-- S p e c --
-- --
-- Copyright (C) 2001-2012, 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. --
-- --
------------------------------------------------------------------------------
-- Common support unit for GNAT.Sockets and GNAT.Serial_Communication
with Ada.Streams;
with System.CRTL;
package System.Communication is
pragma Preelaborate;
function Last_Index
(First : Ada.Streams.Stream_Element_Offset;
Count : CRTL.size_t) return Ada.Streams.Stream_Element_Offset;
-- Compute the Last OUT parameter for the various Read / Receive
-- subprograms: returns First + Count - 1.
--
-- When First = Stream_Element_Offset'First and Res = 0, Constraint_Error
-- is raised. This is consistent with the semantics of stream operations
-- as clarified in AI95-227.
end System.Communication;
| 59.117647 | 78 | 0.440464 |
1d8327922f4005f603ca617137a284987179c208 | 4,072 | ads | Ada | source/web/tools/a2js/properties-declarations-loop_parameter_specification.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-declarations-loop_parameter_specification.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-declarations-loop_parameter_specification.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.Declarations.Loop_Parameter_Specification is
function Initialize
(Engine : access Engines.Contexts.Context;
Element : Asis.Declaration;
Name : Engines.Text_Property) return League.Strings.Universal_String;
function Code
(Engine : access Engines.Contexts.Context;
Element : Asis.Declaration;
Name : Engines.Text_Property) return League.Strings.Universal_String;
function Condition
(Engine : access Engines.Contexts.Context;
Element : Asis.Declaration;
Name : Engines.Text_Property) return League.Strings.Universal_String;
end Properties.Declarations.Loop_Parameter_Specification;
| 59.882353 | 78 | 0.448428 |
41da73272a917b9cf46e31cc61b4255198dfb858 | 133,251 | adb | Ada | apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen/sharpen/hls_target/.autopilot/db/Loop_3_proc.bind.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | 1 | 2020-06-18T16:51:39.000Z | 2020-06-18T16:51:39.000Z | apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen/sharpen/hls_target/.autopilot/db/Loop_3_proc.bind.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | null | null | null | apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen/sharpen/hls_target/.autopilot/db/Loop_3_proc.bind.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></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>Loop_3_proc</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>p_hw_input_stencil_stream_to_mul_V_value_V</name>
<fileName></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>FIFO_SRL</coreName>
</Obj>
<bitwidth>72</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>p_mul_stencil_stream_V_value_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>FIFO_SRL</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>47</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name></name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>195</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second class_id="11" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="12" tracking_level="0" version="0">
<first class_id="13" tracking_level="0" version="0">
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>195</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>indvar_flatten</name>
<fileName></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>21</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>175</item>
<item>176</item>
<item>177</item>
<item>178</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>exitcond_flatten</name>
<fileName></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>179</item>
<item>181</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>indvar_flatten_next</name>
<fileName></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>21</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>182</item>
<item>184</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name></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>185</item>
<item>186</item>
<item>187</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>tmp_value_V</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>203</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>72</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>64</item>
<item>65</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>p_399</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_399</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>p_404_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>215</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>215</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>p_415</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_415</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>69</item>
<item>70</item>
<item>72</item>
<item>74</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>p_420_cast_cast</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>p_447</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_447</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>76</item>
<item>77</item>
<item>79</item>
<item>81</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>p_452_cast_cast</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>82</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>p_463</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_463</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>83</item>
<item>84</item>
<item>86</item>
<item>88</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>p_468_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>287</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>287</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>tmp_7</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>203</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>91</item>
<item>92</item>
<item>94</item>
<item>96</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>p_411</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>223</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>223</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_411</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>98</item>
<item>99</item>
<item>101</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>p_412_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>224</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>224</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>102</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>p_413</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>225</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>225</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_413</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>103</item>
<item>104</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>p_413_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>225</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>225</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>105</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>tmp_8</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>203</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>106</item>
<item>107</item>
<item>109</item>
<item>111</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>p_427</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>241</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>241</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_427</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>112</item>
<item>113</item>
<item>114</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>p_428_cast_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>243</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>243</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>115</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>tmp</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>243</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>243</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>116</item>
<item>117</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>tmp_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>243</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>243</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>118</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>p_429</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>243</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>243</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_429</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>119</item>
<item>120</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>p_429_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>243</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>243</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>121</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>tmp_9</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>203</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>123</item>
<item>124</item>
<item>126</item>
<item>128</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>p_435</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>250</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>250</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_435</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>130</item>
<item>131</item>
<item>133</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>p_436_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>251</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>251</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>134</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>tmp_s</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>203</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>135</item>
<item>136</item>
<item>138</item>
<item>140</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>p_443</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>259</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>259</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_443</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>141</item>
<item>142</item>
<item>143</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>p_444_cast_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>259</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>259</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>144</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>tmp_3</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>203</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>203</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>145</item>
<item>146</item>
<item>148</item>
<item>150</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>p_459</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>277</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>277</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_459</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>151</item>
<item>152</item>
<item>153</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>p_460_cast_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>279</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>279</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>154</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>tmp1</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>279</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>279</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>155</item>
<item>156</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>tmp3</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>279</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>279</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>157</item>
<item>158</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name>tmp3_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>279</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>279</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>159</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>tmp2</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>279</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>279</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>160</item>
<item>161</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name>tmp2_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>279</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>279</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>162</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>p_461</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>279</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>279</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_461</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>163</item>
<item>164</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>p_461_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>279</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>279</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>165</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name>p_469</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>288</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>288</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_469</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>166</item>
<item>167</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>tmp_value_V_7</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>288</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>288</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>168</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name></name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>290</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>290</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>170</item>
<item>171</item>
<item>172</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name></name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</fileDirectory>
<lineNumber>197</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_8_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>197</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>173</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name></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>21</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_50">
<Value>
<Obj>
<type>2</type>
<id>71</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>16</content>
</item>
<item class_id_reference="16" object_id="_51">
<Value>
<Obj>
<type>2</type>
<id>73</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>23</content>
</item>
<item class_id_reference="16" object_id="_52">
<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>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>48</content>
</item>
<item class_id_reference="16" object_id="_53">
<Value>
<Obj>
<type>2</type>
<id>80</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>55</content>
</item>
<item class_id_reference="16" object_id="_54">
<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>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>64</content>
</item>
<item class_id_reference="16" object_id="_55">
<Value>
<Obj>
<type>2</type>
<id>87</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>71</content>
</item>
<item class_id_reference="16" object_id="_56">
<Value>
<Obj>
<type>2</type>
<id>93</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_57">
<Value>
<Obj>
<type>2</type>
<id>95</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>14</content>
</item>
<item class_id_reference="16" object_id="_58">
<Value>
<Obj>
<type>2</type>
<id>100</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_59">
<Value>
<Obj>
<type>2</type>
<id>108</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>24</content>
</item>
<item class_id_reference="16" object_id="_60">
<Value>
<Obj>
<type>2</type>
<id>110</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>30</content>
</item>
<item class_id_reference="16" object_id="_61">
<Value>
<Obj>
<type>2</type>
<id>125</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>32</content>
</item>
<item class_id_reference="16" object_id="_62">
<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>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>37</content>
</item>
<item class_id_reference="16" object_id="_63">
<Value>
<Obj>
<type>2</type>
<id>132</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_64">
<Value>
<Obj>
<type>2</type>
<id>137</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>40</content>
</item>
<item class_id_reference="16" object_id="_65">
<Value>
<Obj>
<type>2</type>
<id>139</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>46</content>
</item>
<item class_id_reference="16" object_id="_66">
<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>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>56</content>
</item>
<item class_id_reference="16" object_id="_67">
<Value>
<Obj>
<type>2</type>
<id>149</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>62</content>
</item>
<item class_id_reference="16" object_id="_68">
<Value>
<Obj>
<type>2</type>
<id>174</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>21</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_69">
<Value>
<Obj>
<type>2</type>
<id>180</id>
<name>empty</name>
<fileName></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>21</bitwidth>
</Value>
<const_type>0</const_type>
<content>2067604</content>
</item>
<item class_id_reference="16" object_id="_70">
<Value>
<Obj>
<type>2</type>
<id>183</id>
<name>empty</name>
<fileName></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>21</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_71">
<Obj>
<type>3</type>
<id>8</id>
<name>newFuncRoot</name>
<fileName></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>7</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_72">
<Obj>
<type>3</type>
<id>13</id>
<name>.preheader57</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>9</item>
<item>10</item>
<item>11</item>
<item>12</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_73">
<Obj>
<type>3</type>
<id>59</id>
<name>.preheader57.preheader</name>
<fileName></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>41</count>
<item_version>0</item_version>
<item>17</item>
<item>18</item>
<item>19</item>
<item>20</item>
<item>21</item>
<item>22</item>
<item>23</item>
<item>24</item>
<item>25</item>
<item>26</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>36</item>
<item>37</item>
<item>38</item>
<item>39</item>
<item>40</item>
<item>41</item>
<item>42</item>
<item>43</item>
<item>44</item>
<item>45</item>
<item>46</item>
<item>47</item>
<item>48</item>
<item>49</item>
<item>50</item>
<item>51</item>
<item>52</item>
<item>53</item>
<item>54</item>
<item>55</item>
<item>56</item>
<item>58</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_74">
<Obj>
<type>3</type>
<id>61</id>
<name>.preheader56.exitStub</name>
<fileName></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>60</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>87</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_75">
<id>62</id>
<edge_type>2</edge_type>
<source_obj>13</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_76">
<id>65</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_77">
<id>66</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_78">
<id>67</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_79">
<id>70</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_80">
<id>72</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_81">
<id>74</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_82">
<id>75</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_83">
<id>77</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_84">
<id>79</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_85">
<id>81</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_86">
<id>82</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_87">
<id>84</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_88">
<id>86</id>
<edge_type>1</edge_type>
<source_obj>85</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_89">
<id>88</id>
<edge_type>1</edge_type>
<source_obj>87</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_90">
<id>89</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_91">
<id>92</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_92">
<id>94</id>
<edge_type>1</edge_type>
<source_obj>93</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_93">
<id>96</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_94">
<id>99</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_95">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_96">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_97">
<id>103</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_98">
<id>104</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_99">
<id>105</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_100">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_101">
<id>109</id>
<edge_type>1</edge_type>
<source_obj>108</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_102">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_103">
<id>113</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_104">
<id>114</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_105">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_106">
<id>116</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_107">
<id>117</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_108">
<id>118</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_109">
<id>119</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_110">
<id>120</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_111">
<id>121</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_112">
<id>124</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_113">
<id>126</id>
<edge_type>1</edge_type>
<source_obj>125</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_114">
<id>128</id>
<edge_type>1</edge_type>
<source_obj>127</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_115">
<id>131</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_116">
<id>133</id>
<edge_type>1</edge_type>
<source_obj>132</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_117">
<id>134</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_118">
<id>136</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_119">
<id>138</id>
<edge_type>1</edge_type>
<source_obj>137</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_120">
<id>140</id>
<edge_type>1</edge_type>
<source_obj>139</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_121">
<id>142</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_122">
<id>143</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_123">
<id>144</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_124">
<id>146</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_125">
<id>148</id>
<edge_type>1</edge_type>
<source_obj>147</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_126">
<id>150</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_127">
<id>152</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_128">
<id>153</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_129">
<id>154</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_130">
<id>155</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_131">
<id>156</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_132">
<id>157</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_133">
<id>158</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_134">
<id>159</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_135">
<id>160</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_136">
<id>161</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_137">
<id>162</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>51</sink_obj>
</item>
<item class_id_reference="20" object_id="_138">
<id>163</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_139">
<id>164</id>
<edge_type>1</edge_type>
<source_obj>51</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_140">
<id>165</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_141">
<id>166</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_142">
<id>167</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_143">
<id>168</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_144">
<id>171</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_145">
<id>172</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_146">
<id>173</id>
<edge_type>2</edge_type>
<source_obj>13</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_147">
<id>175</id>
<edge_type>1</edge_type>
<source_obj>174</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_148">
<id>176</id>
<edge_type>2</edge_type>
<source_obj>8</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_149">
<id>177</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_150">
<id>178</id>
<edge_type>2</edge_type>
<source_obj>59</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_151">
<id>179</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_152">
<id>181</id>
<edge_type>1</edge_type>
<source_obj>180</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_153">
<id>182</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_154">
<id>184</id>
<edge_type>1</edge_type>
<source_obj>183</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_155">
<id>185</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_156">
<id>186</id>
<edge_type>2</edge_type>
<source_obj>59</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_157">
<id>187</id>
<edge_type>2</edge_type>
<source_obj>61</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_158">
<id>274</id>
<edge_type>2</edge_type>
<source_obj>8</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_159">
<id>275</id>
<edge_type>2</edge_type>
<source_obj>13</source_obj>
<sink_obj>61</sink_obj>
</item>
<item class_id_reference="20" object_id="_160">
<id>276</id>
<edge_type>2</edge_type>
<source_obj>13</source_obj>
<sink_obj>59</sink_obj>
</item>
<item class_id_reference="20" object_id="_161">
<id>277</id>
<edge_type>2</edge_type>
<source_obj>59</source_obj>
<sink_obj>13</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_162">
<mId>1</mId>
<mTag>Loop_3_proc</mTag>
<mType>0</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>2067609</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_163">
<mId>2</mId>
<mTag>Entry</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_164">
<mId>3</mId>
<mTag>Loop 1</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>13</item>
<item>59</item>
</basic_blocks>
<mII>1</mII>
<mDepth>5</mDepth>
<mMinTripCount>2067604</mMinTripCount>
<mMaxTripCount>2067604</mMaxTripCount>
<mMinLatency>2067607</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_165">
<mId>4</mId>
<mTag>Return</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_166">
<states class_id="25" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_167">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_168">
<id>3</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_169">
<id>4</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_170">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_171">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_172">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_173">
<id>2</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_174">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_175">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_176">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_177">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_178">
<id>3</id>
<operations>
<count>22</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_179">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_180">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_181">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_182">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_183">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_184">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_185">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_186">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_187">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_188">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_189">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_190">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_191">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_192">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_193">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_194">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_195">
<id>38</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_196">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_197">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_198">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_199">
<id>46</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_200">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_201">
<id>4</id>
<operations>
<count>7</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_202">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_203">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_204">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_205">
<id>42</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_206">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_207">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_208">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_209">
<id>5</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_210">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_211">
<id>39</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_212">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_213">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_214">
<id>51</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_215">
<id>52</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_216">
<id>6</id>
<operations>
<count>10</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_217">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_218">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_219">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_220">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_221">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_222">
<id>54</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_223">
<id>55</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_224">
<id>56</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_225">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_226">
<id>58</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_227">
<id>7</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_228">
<id>60</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_229">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>12</id>
<sop class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_230">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>22</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_231">
<inState>4</inState>
<outState>5</outState>
<condition>
<id>23</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_232">
<inState>5</inState>
<outState>6</outState>
<condition>
<id>24</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_233">
<inState>6</inState>
<outState>2</outState>
<condition>
<id>25</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_234">
<inState>2</inState>
<outState>7</outState>
<condition>
<id>21</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item class_id="34" tracking_level="0" version="0">
<first class_id="35" tracking_level="0" version="0">
<first>10</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_235">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>26</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>10</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="-1"></res>
<node_label_latency class_id="37" tracking_level="0" version="0">
<count>47</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>7</first>
<second class_id="39" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="40" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="41" tracking_level="0" version="0">
<first>8</first>
<second class_id="42" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>2</first>
<second>5</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="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="_236">
<region_name>Loop 1</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>13</item>
<item>59</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>5</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="45" tracking_level="0" version="0">
<count>43</count>
<item_version>0</item_version>
<item class_id="46" tracking_level="0" version="0">
<first>90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>96</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>107</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>114</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>120</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>126</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>130</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>134</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>144</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>148</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>158</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>162</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>172</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>182</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>190</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>194</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>200</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>210</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>218</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>222</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>228</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>238</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>248</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>258</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>266</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>270</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>276</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>279</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>282</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>295</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>299</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>302</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>308</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>311</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>318</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>322</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>328</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>331</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>337</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>340</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>343</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>349</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="48" tracking_level="0" version="0">
<count>41</count>
<item_version>0</item_version>
<item class_id="49" tracking_level="0" version="0">
<first>exitcond_flatten_fu_114</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_120</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>indvar_flatten_phi_fu_107</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>p_399_fu_126</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>p_404_cast_fu_130</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>p_411_fu_182</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>p_412_cast_fu_190</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>p_413_cast_fu_276</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>p_413_fu_194</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>p_415_fu_134</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>p_420_cast_cast_fu_144</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>p_427_fu_210</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>p_428_cast_cast_fu_218</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>p_429_cast_fu_308</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>p_429_fu_282</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>p_435_fu_311</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>p_436_cast_fu_318</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>p_443_fu_288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>p_444_cast_cast_fu_295</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>p_447_fu_148</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>p_452_cast_cast_fu_158</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>p_459_fu_258</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>p_460_cast_cast_fu_266</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>p_461_cast_fu_340</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>p_461_fu_331</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>p_463_fu_162</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>p_468_cast_fu_337</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>p_469_fu_343</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>tmp1_fu_322</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>tmp2_cast_fu_328</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>tmp2_fu_302</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>tmp3_cast_fu_299</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>tmp3_fu_270</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>tmp_3_fu_248</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>tmp_7_fu_172</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>tmp_8_fu_200</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>tmp_9_fu_228</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>tmp_cast_fu_279</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>tmp_fu_222</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>tmp_s_fu_238</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>tmp_value_V_7_fu_349</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>2</count>
<item_version>0</item_version>
<item>
<first>StgValue_59_write_fu_96</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>tmp_value_V_read_fu_90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="50" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>12</count>
<item_version>0</item_version>
<item>
<first>103</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>354</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>358</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>363</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>368</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>373</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>378</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>383</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>388</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>393</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>398</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>403</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>12</count>
<item_version>0</item_version>
<item>
<first>exitcond_flatten_reg_354</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>indvar_flatten_next_reg_358</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_103</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>p_413_reg_368</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>p_429_reg_393</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>p_461_reg_403</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>p_463_reg_363</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>tmp2_reg_398</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>tmp3_reg_388</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>tmp_9_reg_378</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>tmp_reg_373</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>tmp_s_reg_383</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>1</count>
<item_version>0</item_version>
<item>
<first>103</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>1</count>
<item_version>0</item_version>
<item>
<first>indvar_flatten_reg_103</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="51" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="52" tracking_level="0" version="0">
<first>p_hw_input_stencil_stream_to_mul_V_value_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
</second>
</item>
<item>
<first>p_mul_stencil_stream_V_value_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="53" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="54" tracking_level="0" version="0">
<first>1</first>
<second>FIFO_SRL</second>
</item>
<item>
<first>2</first>
<second>FIFO_SRL</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 25.884033 | 136 | 0.593271 |
5854265dd678baa58d22304978b4e74113228edd | 60,290 | adb | Ada | tools-src/gnu/gcc/gcc/ada/s-tasren.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 80 | 2015-01-02T10:14:04.000Z | 2021-06-07T06:29:49.000Z | tools-src/gnu/gcc/gcc/ada/s-tasren.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 9 | 2015-05-14T11:03:12.000Z | 2018-01-04T07:12:58.000Z | tools-src/gnu/gcc/gcc/ada/s-tasren.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNU ADA RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . T A S K I N G . R E N D E Z V O U S --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1991-2001, Florida State University --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNARL is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNARL; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. It is --
-- now maintained by Ada Core Technologies Inc. in cooperation with Florida --
-- State University (http://www.gnat.com). --
-- --
------------------------------------------------------------------------------
with Ada.Exceptions;
-- Used for Exception_ID
-- Null_Id
-- Save_Occurrence
-- Raise_Exception
with System.Task_Primitives.Operations;
-- used for Get_Priority
-- Set_Priority
-- Write_Lock
-- Unlock
-- Sleep
-- Wakeup
-- Timed_Sleep
with System.Tasking.Entry_Calls;
-- Used for Wait_For_Completion
-- Wait_For_Completion_With_Timeout
-- Wait_Until_Abortable
with System.Tasking.Initialization;
-- used for Defer_Abort
-- Undefer_Abort
-- Poll_Base_Priority_Change
with System.Tasking.Queuing;
-- used for Enqueue
-- Dequeue_Head
-- Select_Task_Entry_Call
-- Count_Waiting
with System.Tasking.Utilities;
-- used for Check_Exception
-- Make_Passive
-- Wakeup_Entry_Caller
with System.Tasking.Protected_Objects.Operations;
-- used for PO_Do_Or_Queue
-- PO_Service_Entries
-- Lock_Entries
-- Unlock_Entries
with System.Tasking.Debug;
-- used for Trace
package body System.Tasking.Rendezvous is
package STPO renames System.Task_Primitives.Operations;
package POO renames System.Tasking.Protected_Objects.Operations;
package POE renames System.Tasking.Protected_Objects.Entries;
use System.Task_Primitives;
use System.Task_Primitives.Operations;
type Select_Treatment is (
Accept_Alternative_Selected, -- alternative with non-null body
Accept_Alternative_Completed, -- alternative with null body
Else_Selected,
Terminate_Selected,
Accept_Alternative_Open,
No_Alternative_Open);
Default_Treatment : constant array (Select_Modes) of Select_Treatment :=
(Simple_Mode => No_Alternative_Open,
Else_Mode => Else_Selected,
Terminate_Mode => Terminate_Selected,
Delay_Mode => No_Alternative_Open);
New_State : constant array (Boolean, Entry_Call_State)
of Entry_Call_State :=
(True =>
(Never_Abortable => Never_Abortable,
Not_Yet_Abortable => Now_Abortable,
Was_Abortable => Now_Abortable,
Now_Abortable => Now_Abortable,
Done => Done,
Cancelled => Cancelled),
False =>
(Never_Abortable => Never_Abortable,
Not_Yet_Abortable => Not_Yet_Abortable,
Was_Abortable => Was_Abortable,
Now_Abortable => Now_Abortable,
Done => Done,
Cancelled => Cancelled)
);
-----------------------
-- Local Subprograms --
-----------------------
procedure Local_Defer_Abort (Self_Id : Task_ID) renames
System.Tasking.Initialization.Defer_Abort_Nestable;
procedure Local_Undefer_Abort (Self_Id : Task_ID) renames
System.Tasking.Initialization.Undefer_Abort_Nestable;
-- Florist defers abort around critical sections that
-- make entry calls to the Interrupt_Manager task, which
-- violates the general rule about top-level runtime system
-- calls from abort-deferred regions. It is not that this is
-- unsafe, but when it occurs in "normal" programs it usually
-- means either the user is trying to do a potentially blocking
-- operation from within a protected object, or there is a
-- runtime system/compiler error that has failed to undefer
-- an earlier abort deferral. Thus, for debugging it may be
-- wise to modify the above renamings to the non-nestable forms.
procedure Boost_Priority
(Call : Entry_Call_Link;
Acceptor : Task_ID);
pragma Inline (Boost_Priority);
-- Call this only with abort deferred and holding lock of Acceptor.
procedure Call_Synchronous
(Acceptor : Task_ID;
E : Task_Entry_Index;
Uninterpreted_Data : System.Address;
Mode : Call_Modes;
Rendezvous_Successful : out Boolean);
pragma Inline (Call_Synchronous);
-- This call is used to make a simple or conditional entry call.
procedure Setup_For_Rendezvous_With_Body
(Entry_Call : Entry_Call_Link;
Acceptor : Task_ID);
pragma Inline (Setup_For_Rendezvous_With_Body);
-- Call this only with abort deferred and holding lock of Acceptor.
-- When a rendezvous selected (ready for rendezvous) we need to save
-- privious caller and adjust the priority. Also we need to make
-- this call not Abortable (Cancellable) since the rendezvous has
-- already been started.
function Is_Entry_Open (T : Task_ID; E : Task_Entry_Index) return Boolean;
pragma Inline (Is_Entry_Open);
-- Call this only with abort deferred and holding lock of T.
procedure Wait_For_Call (Self_Id : Task_ID);
pragma Inline (Wait_For_Call);
-- Call this only with abort deferred and holding lock of Self_Id.
-- An accepting task goes into Sleep by calling this routine
-- waiting for a call from the caller or waiting for an abortion.
-- Make sure Self_Id is locked before calling this routine.
-----------------
-- Accept_Call --
-----------------
-- Compiler interface only. Do not call from within the RTS.
-- source:
-- accept E do ...A... end E;
-- expansion:
-- A27b : address;
-- L26b : label
-- begin
-- accept_call (1, A27b);
-- ...A...
-- complete_rendezvous;
-- <<L26b>>
-- exception
-- when all others =>
-- exceptional_complete_rendezvous (get_gnat_exception);
-- end;
-- The handler for Abort_Signal (*all* others) is to handle the case when
-- the acceptor is aborted between Accept_Call and the corresponding
-- Complete_Rendezvous call. We need to wake up the caller in this case.
-- See also Selective_Wait
procedure Accept_Call
(E : Task_Entry_Index;
Uninterpreted_Data : out System.Address)
is
Self_Id : constant Task_ID := STPO.Self;
Caller : Task_ID := null;
Open_Accepts : aliased Accept_List (1 .. 1);
Entry_Call : Entry_Call_Link;
begin
Initialization.Defer_Abort (Self_Id);
STPO.Write_Lock (Self_Id);
if not Self_Id.Callable then
pragma Assert (Self_Id.Pending_ATC_Level = 0);
pragma Assert (Self_Id.Pending_Action);
STPO.Unlock (Self_Id);
Initialization.Undefer_Abort (Self_Id);
-- Should never get here ???
pragma Assert (False);
raise Standard'Abort_Signal;
end if;
-- If someone completed this task, this task should not try to
-- access its pending entry calls or queues in this case, as they
-- are being emptied. Wait for abortion to kill us.
-- ?????
-- Recheck the correctness of the above, now that we have made
-- changes. The logic above seems to be based on the assumption
-- that one task can safely clean up another's in-service accepts.
-- ?????
-- Why do we need to block here in this case?
-- Why not just return and let Undefer_Abort do its work?
Queuing.Dequeue_Head (Self_Id.Entry_Queues (E), Entry_Call);
if Entry_Call /= null then
Caller := Entry_Call.Self;
Setup_For_Rendezvous_With_Body (Entry_Call, Self_Id);
Uninterpreted_Data := Entry_Call.Uninterpreted_Data;
else
-- Wait for a caller
Open_Accepts (1).Null_Body := False;
Open_Accepts (1).S := E;
Self_Id.Open_Accepts := Open_Accepts'Unrestricted_Access;
-- Wait for normal call
pragma Debug
(Debug.Trace (Self_Id, "Accept_Call: wait", 'R'));
Wait_For_Call (Self_Id);
pragma Assert (Self_Id.Open_Accepts = null);
if Self_Id.Pending_ATC_Level >= Self_Id.ATC_Nesting_Level then
Caller := Self_Id.Common.Call.Self;
Uninterpreted_Data :=
Caller.Entry_Calls (Caller.ATC_Nesting_Level).Uninterpreted_Data;
end if;
-- If this task has been aborted, skip the Uninterpreted_Data load
-- (Caller will not be reliable) and fall through to
-- Undefer_Abort which will allow the task to be killed.
-- ?????
-- Perhaps we could do the code anyway, if it has no harm, in order
-- to get better performance for the normal case.
end if;
-- Self_Id.Common.Call should already be updated by the Caller
-- On return, we will start the rendezvous.
STPO.Unlock (Self_Id);
Initialization.Undefer_Abort (Self_Id);
end Accept_Call;
--------------------
-- Accept_Trivial --
--------------------
-- Compiler interface only. Do not call from within the RTS.
-- This should only be called when there is no accept body,
-- or the except body is empty.
-- source:
-- accept E;
-- expansion:
-- accept_trivial (1);
-- The compiler is also able to recognize the following and
-- translate it the same way.
-- accept E do null; end E;
procedure Accept_Trivial (E : Task_Entry_Index) is
Self_Id : constant Task_ID := STPO.Self;
Caller : Task_ID := null;
Open_Accepts : aliased Accept_List (1 .. 1);
Entry_Call : Entry_Call_Link;
begin
Initialization.Defer_Abort_Nestable (Self_Id);
STPO.Write_Lock (Self_Id);
if not Self_Id.Callable then
pragma Assert (Self_Id.Pending_ATC_Level = 0);
pragma Assert (Self_Id.Pending_Action);
STPO.Unlock (Self_Id);
Initialization.Undefer_Abort_Nestable (Self_Id);
-- Should never get here ???
pragma Assert (False);
raise Standard'Abort_Signal;
end if;
-- If someone completed this task, this task should not try to
-- access its pending entry calls or queues in this case, as they
-- are being emptied. Wait for abortion to kill us.
-- ?????
-- Recheck the correctness of the above, now that we have made
-- changes.
Queuing.Dequeue_Head (Self_Id.Entry_Queues (E), Entry_Call);
if Entry_Call = null then
-- Need to wait for entry call
Open_Accepts (1).Null_Body := True;
Open_Accepts (1).S := E;
Self_Id.Open_Accepts := Open_Accepts'Unrestricted_Access;
pragma Debug
(Debug.Trace (Self_Id, "Accept_Trivial: wait", 'R'));
Wait_For_Call (Self_Id);
pragma Assert (Self_Id.Open_Accepts = null);
-- No need to do anything special here for pending abort.
-- Abort_Signal will be raised by Undefer on exit.
STPO.Unlock (Self_Id);
else -- found caller already waiting
pragma Assert (Entry_Call.State < Done);
STPO.Unlock (Self_Id);
Caller := Entry_Call.Self;
STPO.Write_Lock (Caller);
Initialization.Wakeup_Entry_Caller (Self_Id, Entry_Call, Done);
STPO.Unlock (Caller);
end if;
Initialization.Undefer_Abort_Nestable (Self_Id);
end Accept_Trivial;
--------------------
-- Boost_Priority --
--------------------
-- Call this only with abort deferred and holding lock of Acceptor.
procedure Boost_Priority (Call : Entry_Call_Link; Acceptor : Task_ID) is
Caller : Task_ID := Call.Self;
Caller_Prio : System.Any_Priority := Get_Priority (Caller);
Acceptor_Prio : System.Any_Priority := Get_Priority (Acceptor);
begin
if Caller_Prio > Acceptor_Prio then
Call.Acceptor_Prev_Priority := Acceptor_Prio;
Set_Priority (Acceptor, Caller_Prio);
else
Call.Acceptor_Prev_Priority := Priority_Not_Boosted;
end if;
end Boost_Priority;
-----------------
-- Call_Simple --
-----------------
-- Compiler interface only. Do not call from within the RTS.
procedure Call_Simple
(Acceptor : Task_ID;
E : Task_Entry_Index;
Uninterpreted_Data : System.Address)
is
Rendezvous_Successful : Boolean;
begin
Call_Synchronous
(Acceptor, E, Uninterpreted_Data, Simple_Call, Rendezvous_Successful);
end Call_Simple;
----------------------
-- Call_Synchronous --
----------------------
-- Compiler interface.
-- Also called from inside Call_Simple and Task_Entry_Call.
procedure Call_Synchronous
(Acceptor : Task_ID;
E : Task_Entry_Index;
Uninterpreted_Data : System.Address;
Mode : Call_Modes;
Rendezvous_Successful : out Boolean)
is
Self_Id : constant Task_ID := STPO.Self;
Level : ATC_Level;
Entry_Call : Entry_Call_Link;
begin
pragma Assert (Mode /= Asynchronous_Call);
Local_Defer_Abort (Self_Id);
Self_Id.ATC_Nesting_Level := Self_Id.ATC_Nesting_Level + 1;
pragma Debug
(Debug.Trace (Self_Id, "CS: entered ATC level: " &
ATC_Level'Image (Self_Id.ATC_Nesting_Level), 'A'));
Level := Self_Id.ATC_Nesting_Level;
Entry_Call := Self_Id.Entry_Calls (Level)'Access;
Entry_Call.Next := null;
Entry_Call.Mode := Mode;
Entry_Call.Cancellation_Attempted := False;
-- If this is a call made inside of an abort deferred region,
-- the call should be never abortable.
if Self_Id.Deferral_Level > 1 then
Entry_Call.State := Never_Abortable;
else
Entry_Call.State := Now_Abortable;
end if;
Entry_Call.E := Entry_Index (E);
Entry_Call.Prio := Get_Priority (Self_Id);
Entry_Call.Uninterpreted_Data := Uninterpreted_Data;
Entry_Call.Called_Task := Acceptor;
Entry_Call.Exception_To_Raise := Ada.Exceptions.Null_Id;
-- Note: the caller will undefer abortion on return (see WARNING above)
if not Task_Do_Or_Queue
(Self_Id, Entry_Call, With_Abort => True)
then
Self_Id.ATC_Nesting_Level := Self_Id.ATC_Nesting_Level - 1;
Initialization.Undefer_Abort (Self_Id);
pragma Debug
(Debug.Trace (Self_Id, "CS: exited to ATC level: " &
ATC_Level'Image (Self_Id.ATC_Nesting_Level), 'A'));
raise Tasking_Error;
end if;
STPO.Write_Lock (Self_Id);
pragma Debug
(Debug.Trace (Self_Id, "Call_Synchronous: wait", 'R'));
Entry_Calls.Wait_For_Completion (Self_Id, Entry_Call);
pragma Debug
(Debug.Trace (Self_Id, "Call_Synchronous: done waiting", 'R'));
Rendezvous_Successful := Entry_Call.State = Done;
STPO.Unlock (Self_Id);
Local_Undefer_Abort (Self_Id);
Entry_Calls.Check_Exception (Self_Id, Entry_Call);
end Call_Synchronous;
--------------
-- Callable --
--------------
-- Compiler interface.
-- Do not call from within the RTS,
-- except for body of Ada.Task_Identification.
function Callable (T : Task_ID) return Boolean is
Result : Boolean;
Self_Id : constant Task_ID := STPO.Self;
begin
Initialization.Defer_Abort (Self_Id);
STPO.Write_Lock (T);
Result := T.Callable;
STPO.Unlock (T);
Initialization.Undefer_Abort (Self_Id);
return Result;
end Callable;
----------------------------
-- Cancel_Task_Entry_Call --
----------------------------
-- Compiler interface only. Do not call from within the RTS.
-- Call only with abort deferred.
procedure Cancel_Task_Entry_Call (Cancelled : out Boolean) is
begin
Entry_Calls.Try_To_Cancel_Entry_Call (Cancelled);
end Cancel_Task_Entry_Call;
-------------------------
-- Complete_Rendezvous --
-------------------------
-- See comments for Exceptional_Complete_Rendezvous.
procedure Complete_Rendezvous is
begin
Exceptional_Complete_Rendezvous (Ada.Exceptions.Null_Id);
end Complete_Rendezvous;
-------------------------------------
-- Exceptional_Complete_Rendezvous --
-------------------------------------
-- Compiler interface.
-- Also called from Complete_Rendezvous.
-- ?????
-- Consider phasing out Complete_Rendezvous in favor
-- of direct call to this with Ada.Exceptions.Null_ID.
-- See code expansion examples for Accept_Call and Selective_Wait.
-- ?????
-- If we don't change the interface, consider instead
-- putting an explicit re-raise after this call, in
-- the generated code. That way we could eliminate the
-- code here that reraises the exception.
-- The deferral level is critical here,
-- since we want to raise an exception or allow abort to take
-- place, if there is an exception or abort pending.
procedure Exceptional_Complete_Rendezvous
(Ex : Ada.Exceptions.Exception_Id)
is
Self_Id : constant Task_ID := STPO.Self;
Entry_Call : Entry_Call_Link := Self_Id.Common.Call;
Caller : Task_ID;
Called_PO : STPE.Protection_Entries_Access;
Exception_To_Raise : Ada.Exceptions.Exception_Id := Ex;
Ceiling_Violation : Boolean;
use type Ada.Exceptions.Exception_Id;
procedure Internal_Reraise;
pragma Import (C, Internal_Reraise, "__gnat_reraise");
use type STPE.Protection_Entries_Access;
begin
pragma Debug
(Debug.Trace (Self_Id, "Exceptional_Complete_Rendezvous", 'R'));
if Ex = Ada.Exceptions.Null_Id then
-- The call came from normal end-of-rendezvous,
-- so abort is not yet deferred.
Initialization.Defer_Abort_Nestable (Self_Id);
end if;
-- We need to clean up any accepts which Self may have
-- been serving when it was aborted.
if Ex = Standard'Abort_Signal'Identity then
while Entry_Call /= null loop
Entry_Call.Exception_To_Raise := Tasking_Error'Identity;
-- All forms of accept make sure that the acceptor is not
-- completed, before accepting further calls, so that we
-- can be sure that no further calls are made after the
-- current calls are purged.
Caller := Entry_Call.Self;
-- Take write lock. This follows the lock precedence rule that
-- Caller may be locked while holding lock of Acceptor.
-- Complete the call abnormally, with exception.
STPO.Write_Lock (Caller);
Initialization.Wakeup_Entry_Caller (Self_Id, Entry_Call, Done);
STPO.Unlock (Caller);
Entry_Call := Entry_Call.Acceptor_Prev_Call;
end loop;
else
Caller := Entry_Call.Self;
if Entry_Call.Needs_Requeue then
-- We dare not lock Self_Id at the same time as Caller,
-- for fear of deadlock.
Entry_Call.Needs_Requeue := False;
Self_Id.Common.Call := Entry_Call.Acceptor_Prev_Call;
if Entry_Call.Called_Task /= null then
-- Requeue to another task entry
if not Task_Do_Or_Queue
(Self_Id, Entry_Call, Entry_Call.Requeue_With_Abort)
then
Initialization.Undefer_Abort (Self_Id);
raise Tasking_Error;
end if;
else
-- Requeue to a protected entry
Called_PO := POE.To_Protection (Entry_Call.Called_PO);
STPE.Lock_Entries (Called_PO, Ceiling_Violation);
if Ceiling_Violation then
pragma Assert (Ex = Ada.Exceptions.Null_Id);
Exception_To_Raise := Program_Error'Identity;
Entry_Call.Exception_To_Raise := Exception_To_Raise;
STPO.Write_Lock (Caller);
Initialization.Wakeup_Entry_Caller
(Self_Id, Entry_Call, Done);
STPO.Unlock (Caller);
else
POO.PO_Do_Or_Queue
(Self_Id, Called_PO, Entry_Call,
Entry_Call.Requeue_With_Abort);
POO.PO_Service_Entries (Self_Id, Called_PO);
STPE.Unlock_Entries (Called_PO);
end if;
end if;
Entry_Calls.Reset_Priority (Entry_Call.Acceptor_Prev_Priority,
Self_Id);
else
-- The call does not need to be requeued.
Self_Id.Common.Call := Entry_Call.Acceptor_Prev_Call;
Entry_Call.Exception_To_Raise := Ex;
STPO.Write_Lock (Caller);
-- Done with Caller locked to make sure that Wakeup is not lost.
if Ex /= Ada.Exceptions.Null_Id then
Ada.Exceptions.Save_Occurrence
(Caller.Common.Compiler_Data.Current_Excep,
Self_Id.Common.Compiler_Data.Current_Excep);
end if;
Initialization.Wakeup_Entry_Caller (Self_Id, Entry_Call, Done);
STPO.Unlock (Caller);
Entry_Calls.Reset_Priority (Entry_Call.Acceptor_Prev_Priority,
Self_Id);
end if;
end if;
Initialization.Undefer_Abort (Self_Id);
if Exception_To_Raise /= Ada.Exceptions.Null_Id then
Internal_Reraise;
end if;
-- ?????
-- Do we need to
-- give precedence to Program_Error that might be raised
-- due to failure of finalization, over Tasking_Error from
-- failure of requeue?
end Exceptional_Complete_Rendezvous;
-------------------
-- Is_Entry_Open --
-------------------
-- Call this only with abort deferred and holding lock of T.
function Is_Entry_Open (T : Task_ID; E : Task_Entry_Index) return Boolean is
begin
pragma Assert (T.Open_Accepts /= null);
if T.Open_Accepts /= null then
for J in T.Open_Accepts'Range loop
pragma Assert (J > 0);
if E = T.Open_Accepts (J).S then
return True;
end if;
end loop;
end if;
return False;
end Is_Entry_Open;
-------------------------------------
-- Requeue_Protected_To_Task_Entry --
-------------------------------------
-- Compiler interface only. Do not call from within the RTS.
-- entry e2 when b is
-- begin
-- b := false;
-- ...A...
-- requeue t.e2;
-- end e2;
-- procedure rPT__E14b (O : address; P : address; E :
-- protected_entry_index) is
-- type rTVP is access rTV;
-- freeze rTVP []
-- _object : rTVP := rTVP!(O);
-- begin
-- declare
-- rR : protection renames _object._object;
-- vP : integer renames _object.v;
-- bP : boolean renames _object.b;
-- begin
-- b := false;
-- ...A...
-- requeue_protected_to_task_entry (rR'unchecked_access, tTV!(t).
-- _task_id, 2, false);
-- return;
-- end;
-- complete_entry_body (_object._object'unchecked_access, objectF =>
-- 0);
-- return;
-- exception
-- when others =>
-- abort_undefer.all;
-- exceptional_complete_entry_body (_object._object'
-- unchecked_access, current_exception, objectF => 0);
-- return;
-- end rPT__E14b;
procedure Requeue_Protected_To_Task_Entry
(Object : STPE.Protection_Entries_Access;
Acceptor : Task_ID;
E : Task_Entry_Index;
With_Abort : Boolean)
is
Entry_Call : constant Entry_Call_Link := Object.Call_In_Progress;
begin
pragma Assert (STPO.Self.Deferral_Level > 0);
Entry_Call.E := Entry_Index (E);
Entry_Call.Called_Task := Acceptor;
Entry_Call.Called_PO := Null_Address;
Entry_Call.Requeue_With_Abort := With_Abort;
Object.Call_In_Progress := null;
end Requeue_Protected_To_Task_Entry;
------------------------
-- Requeue_Task_Entry --
------------------------
-- Compiler interface only. Do not call from within the RTS.
-- The code generation for task entry requeues is different from that
-- for protected entry requeues. There is a "goto" that skips around
-- the call to Complete_Rendezous, so that Requeue_Task_Entry must also
-- do the work of Complete_Rendezvous. The difference is that it does
-- not report that the call's State = Done.
-- accept e1 do
-- ...A...
-- requeue e2;
-- ...B...
-- end e1;
-- A62b : address;
-- L61b : label
-- begin
-- accept_call (1, A62b);
-- ...A...
-- requeue_task_entry (tTV!(t)._task_id, 2, false);
-- goto L61b;
-- ...B...
-- complete_rendezvous;
-- <<L61b>>
-- exception
-- when others =>
-- exceptional_complete_rendezvous (current_exception);
-- end;
procedure Requeue_Task_Entry
(Acceptor : Task_ID;
E : Task_Entry_Index;
With_Abort : Boolean)
is
Self_Id : constant Task_ID := STPO.Self;
Entry_Call : constant Entry_Call_Link := Self_Id.Common.Call;
begin
Initialization.Defer_Abort (Self_Id);
Entry_Call.Needs_Requeue := True;
Entry_Call.Requeue_With_Abort := With_Abort;
Entry_Call.E := Entry_Index (E);
Entry_Call.Called_Task := Acceptor;
Initialization.Undefer_Abort (Self_Id);
end Requeue_Task_Entry;
--------------------
-- Selective_Wait --
--------------------
-- Compiler interface only. Do not call from within the RTS.
-- See comments on Accept_Call.
-- source code:
-- select accept e1 do
-- ...A...
-- end e1;
-- ...B...
-- or accept e2;
-- ...C...
-- end select;
-- expansion:
-- A32b : address;
-- declare
-- null;
-- if accept_alternative'size * 2 >= 16#8000_0000# then
-- raise storage_error;
-- end if;
-- A37b : T36b;
-- A37b (1) := (null_body => false, s => 1);
-- A37b (2) := (null_body => true, s => 2);
-- if accept_alternative'size * 2 >= 16#8000_0000# then
-- raise storage_error;
-- end if;
-- S0 : aliased T36b := accept_list'A37b;
-- J1 : select_index := 0;
-- L3 : label
-- L1 : label
-- L2 : label
-- procedure e1A is
-- begin
-- abort_undefer.all;
-- L31b : label
-- ...A...
-- <<L31b>>
-- complete_rendezvous;
-- exception
-- when all others =>
-- exceptional_complete_rendezvous (get_gnat_exception);
-- end e1A;
-- begin
-- selective_wait (S0'unchecked_access, simple_mode, A32b, J1);
-- case J1 is
-- when 0 =>
-- goto L3;
-- when 1 =>
-- e1A;
-- goto L1;
-- when 2 =>
-- goto L2;
-- when others =>
-- goto L3;
-- end case;
-- <<L1>>
-- ...B...
-- goto L3;
-- <<L2>>
-- ...C...
-- goto L3;
-- <<L3>>
-- end;
procedure Selective_Wait
(Open_Accepts : Accept_List_Access;
Select_Mode : Select_Modes;
Uninterpreted_Data : out System.Address;
Index : out Select_Index)
is
Self_Id : constant Task_ID := STPO.Self;
Entry_Call : Entry_Call_Link;
Treatment : Select_Treatment;
Caller : Task_ID;
Selection : Select_Index;
Open_Alternative : Boolean;
begin
Initialization.Defer_Abort (Self_Id);
STPO.Write_Lock (Self_Id);
if not Self_Id.Callable then
pragma Assert (Self_Id.Pending_ATC_Level = 0);
pragma Assert (Self_Id.Pending_Action);
STPO.Unlock (Self_Id);
-- ??? In some cases abort is deferred more than once. Need to figure
-- out why.
Self_Id.Deferral_Level := 1;
Initialization.Undefer_Abort (Self_Id);
-- Should never get here ???
pragma Assert (False);
raise Standard'Abort_Signal;
end if;
-- If someone completed this task, this task should not try to
-- access its pending entry calls or queues in this case, as they
-- are being emptied. Wait for abortion to kill us.
-- ?????
-- Recheck the correctness of the above, now that we have made
-- changes.
pragma Assert (Open_Accepts /= null);
Queuing.Select_Task_Entry_Call
(Self_Id, Open_Accepts, Entry_Call, Selection, Open_Alternative);
-- Determine the kind and disposition of the select.
Treatment := Default_Treatment (Select_Mode);
Self_Id.Chosen_Index := No_Rendezvous;
if Open_Alternative then
if Entry_Call /= null then
if Open_Accepts (Selection).Null_Body then
Treatment := Accept_Alternative_Completed;
else
Setup_For_Rendezvous_With_Body (Entry_Call, Self_Id);
Treatment := Accept_Alternative_Selected;
end if;
Self_Id.Chosen_Index := Selection;
elsif Treatment = No_Alternative_Open then
Treatment := Accept_Alternative_Open;
end if;
end if;
-- ??????
-- Recheck the logic above against the ARM.
-- Handle the select according to the disposition selected above.
case Treatment is
when Accept_Alternative_Selected =>
-- Ready to rendezvous
Uninterpreted_Data := Self_Id.Common.Call.Uninterpreted_Data;
-- In this case the accept body is not Null_Body. Defer abortion
-- until it gets into the accept body.
pragma Assert (Self_Id.Deferral_Level = 1);
Initialization.Defer_Abort_Nestable (Self_Id);
STPO.Unlock (Self_Id);
when Accept_Alternative_Completed =>
-- Accept body is null, so rendezvous is over immediately.
STPO.Unlock (Self_Id);
Caller := Entry_Call.Self;
STPO.Write_Lock (Caller);
Initialization.Wakeup_Entry_Caller (Self_Id, Entry_Call, Done);
STPO.Unlock (Caller);
when Accept_Alternative_Open =>
-- Wait for caller.
Self_Id.Open_Accepts := Open_Accepts;
pragma Debug
(Debug.Trace (Self_Id, "Selective_Wait: wait", 'R'));
Wait_For_Call (Self_Id);
pragma Assert (Self_Id.Open_Accepts = null);
-- Self_Id.Common.Call should already be updated by the Caller if
-- not aborted. It might also be ready to do rendezvous even if
-- this wakes up due to an abortion.
-- Therefore, if the call is not empty we need to do the rendezvous
-- if the accept body is not Null_Body.
-- ?????
-- aren't the first two conditions below redundant?
if Self_Id.Chosen_Index /= No_Rendezvous and then
Self_Id.Common.Call /= null and then
not Open_Accepts (Self_Id.Chosen_Index).Null_Body
then
Uninterpreted_Data := Self_Id.Common.Call.Uninterpreted_Data;
pragma Assert (Self_Id.Deferral_Level = 1);
Initialization.Defer_Abort_Nestable (Self_Id);
-- Leave abort deferred until the accept body
end if;
STPO.Unlock (Self_Id);
when Else_Selected =>
pragma Assert (Self_Id.Open_Accepts = null);
STPO.Unlock (Self_Id);
when Terminate_Selected =>
-- Terminate alternative is open
Self_Id.Open_Accepts := Open_Accepts;
Self_Id.Common.State := Acceptor_Sleep;
STPO.Unlock (Self_Id);
-- ?????
-- We need to check if a signal is pending on an open interrupt
-- entry. Otherwise this task would become potentially terminatable
-- and, if none of the siblings are active
-- any more, the task could not wake up any more, even though a
-- signal might be pending on an open interrupt entry.
-- -------------
-- This comment paragraph does not make sense. Is it obsolete?
-- There was no code here to check for pending signals.
-- Notify ancestors that this task is on a terminate alternative.
Utilities.Make_Passive (Self_Id, Task_Completed => False);
-- Wait for normal entry call or termination
pragma Assert (Self_Id.ATC_Nesting_Level = 1);
STPO.Write_Lock (Self_Id);
loop
Initialization.Poll_Base_Priority_Change (Self_Id);
exit when Self_Id.Open_Accepts = null;
Sleep (Self_Id, Acceptor_Sleep);
end loop;
Self_Id.Common.State := Runnable;
pragma Assert (Self_Id.Open_Accepts = null);
if Self_Id.Terminate_Alternative then
-- An entry call should have reset this to False,
-- so we must be aborted.
-- We cannot be in an async. select, since that
-- is not legal, so the abort must be of the entire
-- task. Therefore, we do not need to cancel the
-- terminate alternative. The cleanup will be done
-- in Complete_Master.
pragma Assert (Self_Id.Pending_ATC_Level = 0);
pragma Assert (Self_Id.Awake_Count = 0);
-- Trust that it is OK to fall through.
null;
else
-- Self_Id.Common.Call and Self_Id.Chosen_Index
-- should already be updated by the Caller.
if Self_Id.Chosen_Index /= No_Rendezvous
and then not Open_Accepts (Self_Id.Chosen_Index).Null_Body
then
Uninterpreted_Data := Self_Id.Common.Call.Uninterpreted_Data;
pragma Assert (Self_Id.Deferral_Level = 1);
-- We need an extra defer here, to keep abort
-- deferred until we get into the accept body
Initialization.Defer_Abort_Nestable (Self_Id);
end if;
end if;
STPO.Unlock (Self_Id);
when No_Alternative_Open =>
-- In this case, Index will be No_Rendezvous on return, which
-- should cause a Program_Error if it is not a Delay_Mode.
-- If delay alternative exists (Delay_Mode) we should suspend
-- until the delay expires.
Self_Id.Open_Accepts := null;
if Select_Mode = Delay_Mode then
Self_Id.Common.State := Delay_Sleep;
loop
Initialization.Poll_Base_Priority_Change (Self_Id);
exit when Self_Id.Pending_ATC_Level < Self_Id.ATC_Nesting_Level;
Sleep (Self_Id, Delay_Sleep);
end loop;
Self_Id.Common.State := Runnable;
STPO.Unlock (Self_Id);
else
STPO.Unlock (Self_Id);
Initialization.Undefer_Abort (Self_Id);
Ada.Exceptions.Raise_Exception (Program_Error'Identity,
"Entry call not a delay mode");
end if;
end case;
-- Caller has been chosen.
-- Self_Id.Common.Call should already be updated by the Caller.
-- Self_Id.Chosen_Index should either be updated by the Caller
-- or by Test_Selective_Wait.
-- On return, we sill start rendezvous unless the accept body is
-- null. In the latter case, we will have already completed the RV.
Index := Self_Id.Chosen_Index;
Initialization.Undefer_Abort_Nestable (Self_Id);
end Selective_Wait;
------------------------------------
-- Setup_For_Rendezvous_With_Body --
------------------------------------
-- Call this only with abort deferred and holding lock of Acceptor.
procedure Setup_For_Rendezvous_With_Body
(Entry_Call : Entry_Call_Link;
Acceptor : Task_ID)
is
begin
Entry_Call.Acceptor_Prev_Call := Acceptor.Common.Call;
Acceptor.Common.Call := Entry_Call;
if Entry_Call.State = Now_Abortable then
Entry_Call.State := Was_Abortable;
end if;
Boost_Priority (Entry_Call, Acceptor);
end Setup_For_Rendezvous_With_Body;
----------------
-- Task_Count --
----------------
-- Compiler interface only. Do not call from within the RTS.
function Task_Count (E : Task_Entry_Index) return Natural is
Self_Id : constant Task_ID := STPO.Self;
Return_Count : Natural;
begin
Initialization.Defer_Abort (Self_Id);
STPO.Write_Lock (Self_Id);
Return_Count := Queuing.Count_Waiting (Self_Id.Entry_Queues (E));
STPO.Unlock (Self_Id);
Initialization.Undefer_Abort (Self_Id);
return Return_Count;
end Task_Count;
----------------------
-- Task_Do_Or_Queue --
----------------------
-- Call this only with abort deferred and holding no locks.
-- May propagate an exception, including Abort_Signal & Tasking_Error.
-- ?????
-- See Check_Callable. Check all call contexts to verify
-- it is OK to raise an exception.
-- Find out whether Entry_Call can be accepted immediately.
-- If the Acceptor is not callable, raise Tasking_Error.
-- If the rendezvous can start, initiate it.
-- If the accept-body is trivial, also complete the rendezvous.
-- If the acceptor is not ready, enqueue the call.
-- ?????
-- This should have a special case for Accept_Call and
-- Accept_Trivial, so that
-- we don't have the loop setup overhead, below.
-- ?????
-- The call state Done is used here and elsewhere to include
-- both the case of normal successful completion, and the case
-- of an exception being raised. The difference is that if an
-- exception is raised no one will pay attention to the fact
-- that State = Done. Instead the exception will be raised in
-- Undefer_Abort, and control will skip past the place where
-- we normally would resume from an entry call.
function Task_Do_Or_Queue
(Self_ID : Task_ID;
Entry_Call : Entry_Call_Link;
With_Abort : Boolean) return Boolean
is
E : constant Task_Entry_Index := Task_Entry_Index (Entry_Call.E);
Old_State : constant Entry_Call_State := Entry_Call.State;
Acceptor : constant Task_ID := Entry_Call.Called_Task;
Parent : constant Task_ID := Acceptor.Common.Parent;
Parent_Locked : Boolean := False;
Null_Body : Boolean;
begin
pragma Assert (not Queuing.Onqueue (Entry_Call));
-- We rely that the call is off-queue for protection,
-- that the caller will not exit the Entry_Caller_Sleep,
-- and so will not reuse the call record for another call.
-- We rely on the Caller's lock for call State mod's.
-- We can't lock Acceptor.Parent while holding Acceptor,
-- so lock it in advance if we expect to need to lock it.
-- ?????
-- Is there some better solution?
if Acceptor.Terminate_Alternative then
STPO.Write_Lock (Parent);
Parent_Locked := True;
end if;
STPO.Write_Lock (Acceptor);
-- If the acceptor is not callable, abort the call
-- and raise Tasking_Error. The call is not aborted
-- for an asynchronous call, since Cancel_Task_Entry_Call
-- will do the cancelation in that case.
-- ????? .....
-- Does the above still make sense?
if not Acceptor.Callable then
STPO.Unlock (Acceptor);
if Parent_Locked then
STPO.Unlock (Acceptor.Common.Parent);
end if;
pragma Assert (Entry_Call.State < Done);
-- In case we are not the caller, set up the caller
-- to raise Tasking_Error when it wakes up.
STPO.Write_Lock (Entry_Call.Self);
Entry_Call.Exception_To_Raise := Tasking_Error'Identity;
Initialization.Wakeup_Entry_Caller (Self_ID, Entry_Call, Done);
STPO.Unlock (Entry_Call.Self);
return False;
end if;
-- Try to serve the call immediately.
if Acceptor.Open_Accepts /= null then
for J in Acceptor.Open_Accepts'Range loop
if Entry_Call.E = Entry_Index (Acceptor.Open_Accepts (J).S) then
-- Commit acceptor to rendezvous with us.
Acceptor.Chosen_Index := J;
Null_Body := Acceptor.Open_Accepts (J).Null_Body;
Acceptor.Open_Accepts := null;
-- Prevent abort while call is being served.
if Entry_Call.State = Now_Abortable then
Entry_Call.State := Was_Abortable;
end if;
if Acceptor.Terminate_Alternative then
-- Cancel terminate alternative.
-- See matching code in Selective_Wait and
-- Vulnerable_Complete_Master.
Acceptor.Terminate_Alternative := False;
Acceptor.Awake_Count := Acceptor.Awake_Count + 1;
if Acceptor.Awake_Count = 1 then
-- Notify parent that acceptor is awake.
pragma Assert (Parent.Awake_Count > 0);
Parent.Awake_Count := Parent.Awake_Count + 1;
if Parent.Common.State = Master_Completion_Sleep and then
Acceptor.Master_of_Task = Parent.Master_Within
then
Parent.Common.Wait_Count :=
Parent.Common.Wait_Count + 1;
end if;
end if;
end if;
if Null_Body then
-- Rendezvous is over immediately.
STPO.Wakeup (Acceptor, Acceptor_Sleep);
STPO.Unlock (Acceptor);
if Parent_Locked then
STPO.Unlock (Parent);
end if;
STPO.Write_Lock (Entry_Call.Self);
Initialization.Wakeup_Entry_Caller
(Self_ID, Entry_Call, Done);
STPO.Unlock (Entry_Call.Self);
else
Setup_For_Rendezvous_With_Body (Entry_Call, Acceptor);
-- For terminate_alternative, acceptor may not be
-- asleep yet, so we skip the wakeup
if Acceptor.Common.State /= Runnable then
STPO.Wakeup (Acceptor, Acceptor_Sleep);
end if;
STPO.Unlock (Acceptor);
if Parent_Locked then
STPO.Unlock (Parent);
end if;
end if;
return True;
end if;
end loop;
-- The acceptor is accepting, but not this entry.
end if;
-- If the acceptor was ready to accept this call,
-- we would not have gotten this far, so now we should
-- (re)enqueue the call, if the mode permits that.
if Entry_Call.Mode /= Conditional_Call
or else not With_Abort
then
-- Timed_Call, Simple_Call, or Asynchronous_Call
Queuing.Enqueue (Acceptor.Entry_Queues (E), Entry_Call);
-- Update abortability of call
pragma Assert (Old_State < Done);
Entry_Call.State := New_State (With_Abort, Entry_Call.State);
STPO.Unlock (Acceptor);
if Parent_Locked then
STPO.Unlock (Parent);
end if;
if Old_State /= Entry_Call.State and then
Entry_Call.State = Now_Abortable and then
Entry_Call.Mode > Simple_Call and then
-- Asynchronous_Call or Conditional_Call
Entry_Call.Self /= Self_ID
then
-- Because of ATCB lock ordering rule
STPO.Write_Lock (Entry_Call.Self);
if Entry_Call.Self.Common.State = Async_Select_Sleep then
-- Caller may not yet have reached wait-point
STPO.Wakeup (Entry_Call.Self, Async_Select_Sleep);
end if;
STPO.Unlock (Entry_Call.Self);
end if;
else
-- Conditional_Call and With_Abort
STPO.Unlock (Acceptor);
if Parent_Locked then
STPO.Unlock (Parent);
end if;
STPO.Write_Lock (Entry_Call.Self);
pragma Assert (Entry_Call.State >= Was_Abortable);
Initialization.Wakeup_Entry_Caller (Self_ID, Entry_Call, Cancelled);
STPO.Unlock (Entry_Call.Self);
end if;
return True;
end Task_Do_Or_Queue;
---------------------
-- Task_Entry_Call --
---------------------
procedure Task_Entry_Call
(Acceptor : Task_ID;
E : Task_Entry_Index;
Uninterpreted_Data : System.Address;
Mode : Call_Modes;
Rendezvous_Successful : out Boolean)
is
Self_Id : constant Task_ID := STPO.Self;
Entry_Call : Entry_Call_Link;
begin
if Mode = Simple_Call or else Mode = Conditional_Call then
Call_Synchronous
(Acceptor, E, Uninterpreted_Data, Mode, Rendezvous_Successful);
else
-- This is an asynchronous call
-- Abortion must already be deferred by the compiler-generated
-- code. Without this, an abortion that occurs between the time
-- that this call is made and the time that the abortable part's
-- cleanup handler is set up might miss the cleanup handler and
-- leave the call pending.
Self_Id.ATC_Nesting_Level := Self_Id.ATC_Nesting_Level + 1;
pragma Debug
(Debug.Trace (Self_Id, "TEC: entered ATC level: " &
ATC_Level'Image (Self_Id.ATC_Nesting_Level), 'A'));
Entry_Call := Self_Id.Entry_Calls (Self_Id.ATC_Nesting_Level)'Access;
Entry_Call.Next := null;
Entry_Call.Mode := Mode;
Entry_Call.Cancellation_Attempted := False;
Entry_Call.State := Not_Yet_Abortable;
Entry_Call.E := Entry_Index (E);
Entry_Call.Prio := Get_Priority (Self_Id);
Entry_Call.Uninterpreted_Data := Uninterpreted_Data;
Entry_Call.Called_Task := Acceptor;
Entry_Call.Called_PO := Null_Address;
Entry_Call.Exception_To_Raise := Ada.Exceptions.Null_Id;
if not Task_Do_Or_Queue
(Self_Id, Entry_Call, With_Abort => True)
then
Self_Id.ATC_Nesting_Level := Self_Id.ATC_Nesting_Level - 1;
pragma Debug
(Debug.Trace (Self_Id, "TEC: exited to ATC level: " &
ATC_Level'Image (Self_Id.ATC_Nesting_Level), 'A'));
Initialization.Undefer_Abort (Self_Id);
raise Tasking_Error;
end if;
-- The following is special for async. entry calls.
-- If the call was not queued abortably, we need to wait until
-- it is before proceeding with the abortable part.
-- Wait_Until_Abortable can be called unconditionally here,
-- but it is expensive.
if Entry_Call.State < Was_Abortable then
Entry_Calls.Wait_Until_Abortable (Self_Id, Entry_Call);
end if;
-- Note: following assignment needs to be atomic.
Rendezvous_Successful := Entry_Call.State = Done;
end if;
end Task_Entry_Call;
-----------------------
-- Task_Entry_Caller --
-----------------------
-- Compiler interface only.
function Task_Entry_Caller (D : Task_Entry_Nesting_Depth) return Task_ID is
Self_Id : constant Task_ID := STPO.Self;
Entry_Call : Entry_Call_Link;
begin
Entry_Call := Self_Id.Common.Call;
for Depth in 1 .. D loop
Entry_Call := Entry_Call.Acceptor_Prev_Call;
pragma Assert (Entry_Call /= null);
end loop;
return Entry_Call.Self;
end Task_Entry_Caller;
--------------------------
-- Timed_Selective_Wait --
--------------------------
-- Compiler interface only. Do not call from within the RTS.
procedure Timed_Selective_Wait
(Open_Accepts : Accept_List_Access;
Select_Mode : Select_Modes;
Uninterpreted_Data : out System.Address;
Timeout : Duration;
Mode : Delay_Modes;
Index : out Select_Index)
is
Self_Id : constant Task_ID := STPO.Self;
Treatment : Select_Treatment;
Entry_Call : Entry_Call_Link;
Caller : Task_ID;
Selection : Select_Index;
Open_Alternative : Boolean;
Timedout : Boolean := False;
Yielded : Boolean := False;
begin
pragma Assert (Select_Mode = Delay_Mode);
Initialization.Defer_Abort (Self_Id);
-- If we are aborted here, the effect will be pending
STPO.Write_Lock (Self_Id);
if not Self_Id.Callable then
pragma Assert (Self_Id.Pending_ATC_Level = 0);
pragma Assert (Self_Id.Pending_Action);
STPO.Unlock (Self_Id);
Initialization.Undefer_Abort (Self_Id);
-- Should never get here ???
pragma Assert (False);
raise Standard'Abort_Signal;
end if;
-- If someone completed this task, this task should not try to
-- access its pending entry calls or queues in this case, as they
-- are being emptied. Wait for abortion to kill us.
-- ?????
-- Recheck the correctness of the above, now that we have made
-- changes.
pragma Assert (Open_Accepts /= null);
Queuing.Select_Task_Entry_Call
(Self_Id, Open_Accepts, Entry_Call, Selection, Open_Alternative);
-- Determine the kind and disposition of the select.
Treatment := Default_Treatment (Select_Mode);
Self_Id.Chosen_Index := No_Rendezvous;
if Open_Alternative then
if Entry_Call /= null then
if Open_Accepts (Selection).Null_Body then
Treatment := Accept_Alternative_Completed;
else
Setup_For_Rendezvous_With_Body (Entry_Call, Self_Id);
Treatment := Accept_Alternative_Selected;
end if;
Self_Id.Chosen_Index := Selection;
elsif Treatment = No_Alternative_Open then
Treatment := Accept_Alternative_Open;
end if;
end if;
-- Handle the select according to the disposition selected above.
case Treatment is
when Accept_Alternative_Selected =>
-- Ready to rendezvous
-- In this case the accept body is not Null_Body. Defer abortion
-- until it gets into the accept body.
Uninterpreted_Data := Self_Id.Common.Call.Uninterpreted_Data;
Initialization.Defer_Abort (Self_Id);
STPO.Unlock (Self_Id);
when Accept_Alternative_Completed =>
-- Rendezvous is over
STPO.Unlock (Self_Id);
Caller := Entry_Call.Self;
STPO.Write_Lock (Caller);
Initialization.Wakeup_Entry_Caller (Self_Id, Entry_Call, Done);
STPO.Unlock (Caller);
when Accept_Alternative_Open =>
-- Wait for caller.
Self_Id.Open_Accepts := Open_Accepts;
-- Wait for a normal call and a pending action until the
-- Wakeup_Time is reached.
Self_Id.Common.State := Acceptor_Sleep;
loop
Initialization.Poll_Base_Priority_Change (Self_Id);
exit when Self_Id.Open_Accepts = null;
if Timedout then
Sleep (Self_Id, Acceptor_Sleep);
else
STPO.Timed_Sleep (Self_Id, Timeout, Mode,
Acceptor_Sleep, Timedout, Yielded);
end if;
if Timedout then
Self_Id.Open_Accepts := null;
end if;
end loop;
Self_Id.Common.State := Runnable;
-- Self_Id.Common.Call should already be updated by the Caller if
-- not aborted. It might also be ready to do rendezvous even if
-- this wakes up due to an abortion.
-- Therefore, if the call is not empty we need to do the rendezvous
-- if the accept body is not Null_Body.
if Self_Id.Chosen_Index /= No_Rendezvous and then
Self_Id.Common.Call /= null and then
not Open_Accepts (Self_Id.Chosen_Index).Null_Body
then
Uninterpreted_Data := Self_Id.Common.Call.Uninterpreted_Data;
pragma Assert (Self_Id.Deferral_Level = 1);
Initialization.Defer_Abort_Nestable (Self_Id);
-- Leave abort deferred until the accept body
end if;
STPO.Unlock (Self_Id);
if not Yielded then
Yield;
end if;
when No_Alternative_Open =>
-- In this case, Index will be No_Rendezvous on return. We sleep
-- for the time we need to.
-- Wait for a signal or timeout. A wakeup can be made
-- for several reasons:
-- 1) Delay is expired
-- 2) Pending_Action needs to be checked
-- (Abortion, Priority change)
-- 3) Spurious wakeup
Self_Id.Open_Accepts := null;
Self_Id.Common.State := Acceptor_Sleep;
Initialization.Poll_Base_Priority_Change (Self_Id);
STPO.Timed_Sleep (Self_Id, Timeout, Mode, Acceptor_Sleep,
Timedout, Yielded);
Self_Id.Common.State := Runnable;
STPO.Unlock (Self_Id);
if not Yielded then
Yield;
end if;
when others =>
-- Should never get here ???
pragma Assert (False);
null;
end case;
-- Caller has been chosen
-- Self_Id.Common.Call should already be updated by the Caller
-- Self_Id.Chosen_Index should either be updated by the Caller
-- or by Test_Selective_Wait
Index := Self_Id.Chosen_Index;
Initialization.Undefer_Abort_Nestable (Self_Id);
-- Start rendezvous, if not already completed
end Timed_Selective_Wait;
---------------------------
-- Timed_Task_Entry_Call --
---------------------------
-- Compiler interface only. Do not call from within the RTS.
procedure Timed_Task_Entry_Call
(Acceptor : Task_ID;
E : Task_Entry_Index;
Uninterpreted_Data : System.Address;
Timeout : Duration;
Mode : Delay_Modes;
Rendezvous_Successful : out Boolean)
is
Self_Id : constant Task_ID := STPO.Self;
Level : ATC_Level;
Entry_Call : Entry_Call_Link;
begin
Initialization.Defer_Abort (Self_Id);
Self_Id.ATC_Nesting_Level := Self_Id.ATC_Nesting_Level + 1;
pragma Debug
(Debug.Trace (Self_Id, "TTEC: entered ATC level: " &
ATC_Level'Image (Self_Id.ATC_Nesting_Level), 'A'));
Level := Self_Id.ATC_Nesting_Level;
Entry_Call := Self_Id.Entry_Calls (Level)'Access;
Entry_Call.Next := null;
Entry_Call.Mode := Timed_Call;
Entry_Call.Cancellation_Attempted := False;
-- If this is a call made inside of an abort deferred region,
-- the call should be never abortable.
if Self_Id.Deferral_Level > 1 then
Entry_Call.State := Never_Abortable;
else
Entry_Call.State := Now_Abortable;
end if;
Entry_Call.E := Entry_Index (E);
Entry_Call.Prio := Get_Priority (Self_Id);
Entry_Call.Uninterpreted_Data := Uninterpreted_Data;
Entry_Call.Called_Task := Acceptor;
Entry_Call.Called_PO := Null_Address;
Entry_Call.Exception_To_Raise := Ada.Exceptions.Null_Id;
-- Note: the caller will undefer abortion on return (see WARNING above)
if not Task_Do_Or_Queue
(Self_Id, Entry_Call, With_Abort => True)
then
Self_Id.ATC_Nesting_Level := Self_Id.ATC_Nesting_Level - 1;
pragma Debug
(Debug.Trace (Self_Id, "TTEC: exited to ATC level: " &
ATC_Level'Image (Self_Id.ATC_Nesting_Level), 'A'));
Initialization.Undefer_Abort (Self_Id);
raise Tasking_Error;
end if;
Entry_Calls.Wait_For_Completion_With_Timeout
(Self_Id, Entry_Call, Timeout, Mode);
Rendezvous_Successful := Entry_Call.State = Done;
Initialization.Undefer_Abort (Self_Id);
Entry_Calls.Check_Exception (Self_Id, Entry_Call);
end Timed_Task_Entry_Call;
-------------------
-- Wait_For_Call --
-------------------
-- Call this only with abort deferred and holding lock of Self_Id.
-- Wait for normal call and a pending action.
procedure Wait_For_Call (Self_Id : Task_ID) is
begin
Self_Id.Common.State := Acceptor_Sleep;
loop
Initialization.Poll_Base_Priority_Change (Self_Id);
exit when Self_Id.Open_Accepts = null;
Sleep (Self_Id, Acceptor_Sleep);
end loop;
Self_Id.Common.State := Runnable;
end Wait_For_Call;
end System.Tasking.Rendezvous;
| 33.199339 | 79 | 0.587013 |
3dc1b5c77b9aae2b471b29ec55dc48c8521201a2 | 912 | ads | Ada | source/textio/a-wtenio.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/textio/a-wtenio.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/textio/a-wtenio.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | pragma License (Unrestricted);
-- separated and auto-loaded by compiler
private generic
type Enum is (<>);
pragma Unreferenced (Enum);
package Ada.Wide_Text_IO.Enumeration_IO is
Default_Width : Field := 0;
Default_Setting : Type_Set := Upper_Case;
-- procedure Get (
-- File : File_Type; -- Input_File_Type
-- Item : out Enum);
-- procedure Get (
-- Item : out Enum);
-- procedure Put (
-- File : File_Type; -- Output_File_Type
-- Item : Enum;
-- Width : Field := Default_Width;
-- Set : Type_Set := Default_Setting);
-- procedure Put (
-- Item : Enum;
-- Width : Field := Default_Width;
-- Set : Type_Set := Default_Setting);
-- procedure Get (
-- From : String;
-- Item : out Enum;
-- Last : out Positive);
-- procedure Put (
-- To : out String;
-- Item : Enum;
-- Set : Type_Set := Default_Setting);
end Ada.Wide_Text_IO.Enumeration_IO;
| 24.648649 | 44 | 0.626096 |
588486d64f65f704575aa8daad4acbbe3c69dd9b | 22,714 | adb | Ada | boards/ip_colordetect_test/colordetect/colordetect/.autopilot/db/dilate_0_0_2160_3840_0_3_3_1_1_26.sched.adb | Kgfu/PYNQ_HelloWorld | a5197130e7d4a5e7f382c3963349c1c0bd213213 | [
"BSD-3-Clause"
] | null | null | null | boards/ip_colordetect_test/colordetect/colordetect/.autopilot/db/dilate_0_0_2160_3840_0_3_3_1_1_26.sched.adb | Kgfu/PYNQ_HelloWorld | a5197130e7d4a5e7f382c3963349c1c0bd213213 | [
"BSD-3-Clause"
] | null | null | null | boards/ip_colordetect_test/colordetect/colordetect/.autopilot/db/dilate_0_0_2160_3840_0_3_3_1_1_26.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>dilate_0_0_2160_3840_0_3_3_1_1_26</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>imgHelper2_4102</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>0</coreId>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>imgHelper3_4103</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>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>p_src_rows</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>1769353058</coreId>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_4">
<Value>
<Obj>
<type>1</type>
<id>4</id>
<name>p_src_cols</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>97</coreId>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>p_src_rows_read</name>
<fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>340</lineNumber>
<contextFuncName>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</contextFuncName>
<contextNormFuncName>dilate_0_0_2160_3840_0_3_3_1_1_s</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>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</first>
<second>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</second>
</first>
<second>340</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>0</coreId>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>19</item>
<item>20</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.32</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>p_src_cols_read</name>
<fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>341</lineNumber>
<contextFuncName>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</contextFuncName>
<contextNormFuncName>dilate_0_0_2160_3840_0_3_3_1_1_s</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>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</first>
<second>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</second>
</first>
<second>341</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>11</coreId>
</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>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.32</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>trunc_ln340</name>
<fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>340</lineNumber>
<contextFuncName>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</contextFuncName>
<contextNormFuncName>dilate_0_0_2160_3840_0_3_3_1_1_s</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>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</first>
<second>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</second>
</first>
<second>340</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>113</coreId>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>trunc_ln341</name>
<fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>341</lineNumber>
<contextFuncName>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</contextFuncName>
<contextNormFuncName>dilate_0_0_2160_3840_0_3_3_1_1_s</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>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</first>
<second>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</second>
</first>
<second>341</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>113</coreId>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>_ln376</name>
<fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>376</lineNumber>
<contextFuncName>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</contextFuncName>
<contextNormFuncName>dilate_0_0_2160_3840_0_3_3_1_1_s</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>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</first>
<second>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</second>
</first>
<second>376</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>113</coreId>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>26</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>16</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>113</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>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_11">
<Value>
<Obj>
<type>2</type>
<id>25</id>
<name>xfdilate_2160_3840_1_0_1_0_3841_3_3_s</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>3409872361</coreId>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:xfdilate<2160, 3840, 1, 0, 1, 0, 3841, 3, 3>></content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_12">
<Obj>
<type>3</type>
<id>17</id>
<name>dilate<0, 0, 2160, 3840, 0, 3, 3, 1, 1>26</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>6</count>
<item_version>0</item_version>
<item>11</item>
<item>12</item>
<item>13</item>
<item>14</item>
<item>15</item>
<item>16</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_13">
<id>20</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>11</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_14">
<id>22</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_15">
<id>23</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_16">
<id>24</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_17">
<id>26</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_18">
<id>27</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_19">
<id>28</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_20">
<id>29</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_21">
<id>30</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_22">
<mId>1</mId>
<mTag>dilate<0, 0, 2160, 3840, 0, 3, 3, 1, 1>26</mTag>
<mNormTag>dilate_0_0_2160_3840_0_3_3_1_1_26</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>17</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>13</mMinLatency>
<mMaxLatency>8319373</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>6</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>11</first>
<second class_id="28" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="29" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="0" version="0">
<first>17</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>1</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="32" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="34" 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="35" 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="36" 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>
| 30.653171 | 130 | 0.631329 |
2f6c48a1ed2e3394aaaff9beb86a41cb2956cca8 | 6,138 | ads | Ada | Ada95/src/terminal_interface-curses-text_io.ads | mvaisakh/android_external_libncurses | d44c8a16d7f1ed276d0de0b3f6f1a5596c5f556f | [
"DOC",
"Unlicense"
] | 35 | 2015-03-07T13:26:22.000Z | 2021-11-06T16:18:59.000Z | Ada95/src/terminal_interface-curses-text_io.ads | mvaisakh/android_external_libncurses | d44c8a16d7f1ed276d0de0b3f6f1a5596c5f556f | [
"DOC",
"Unlicense"
] | 3 | 2017-04-07T21:02:48.000Z | 2017-04-08T17:59:35.000Z | Ada95/src/terminal_interface-curses-text_io.ads | mvaisakh/android_external_libncurses | d44c8a16d7f1ed276d0de0b3f6f1a5596c5f556f | [
"DOC",
"Unlicense"
] | 19 | 2015-06-16T06:13:44.000Z | 2021-07-24T02:37:45.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding --
-- --
-- Terminal_Interface.Curses.Text_IO --
-- --
-- S P E C --
-- --
------------------------------------------------------------------------------
-- Copyright (c) 1998 Free Software Foundation, Inc. --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files (the --
-- "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, distribute with modifications, sublicense, and/or sell --
-- copies of the Software, and to permit persons to whom the Software is --
-- furnished to do so, subject to the following conditions: --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. --
-- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, --
-- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR --
-- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR --
-- THE USE OR OTHER DEALINGS IN THE SOFTWARE. --
-- --
-- Except as contained in this notice, the name(s) of the above copyright --
-- holders shall not be used in advertising or otherwise to promote the --
-- sale, use or other dealings in this Software without prior written --
-- authorization. --
------------------------------------------------------------------------------
-- Author: Juergen Pfeifer, 1996
-- Version Control:
-- $Revision: 1.13 $
-- Binding Version 01.00
------------------------------------------------------------------------------
with Ada.Text_IO;
with Ada.IO_Exceptions;
package Terminal_Interface.Curses.Text_IO is
use type Ada.Text_IO.Count;
subtype Count is Ada.Text_IO.Count;
subtype Positive_Count is Count range 1 .. Count'Last;
subtype Field is Ada.Text_IO.Field;
subtype Number_Base is Integer range 2 .. 16;
type Type_Set is (Lower_Case, Upper_Case, Mixed_Case);
-- For most of the routines you will see a version without a Window
-- type parameter. They will operate on a default window, which can
-- be set by the user. It is initially equal to Standard_Window.
procedure Set_Window (Win : in Window);
-- Set Win as the default window
function Get_Window return Window;
-- Get the current default window
procedure Flush (Win : in Window);
procedure Flush;
--------------------------------------------
-- Specification of line and page lengths --
--------------------------------------------
-- There are no set routines in this package. I assume, that you allocate
-- the window with an appropriate size.
-- A scroll-window is interpreted as an page with unbounded page length,
-- i.e. it returns the conventional 0 as page length.
function Line_Length (Win : in Window) return Count;
function Line_Length return Count;
function Page_Length (Win : in Window) return Count;
function Page_Length return Count;
------------------------------------
-- Column, Line, and Page Control --
------------------------------------
procedure New_Line (Win : in Window; Spacing : in Positive_Count := 1);
procedure New_Line (Spacing : in Positive_Count := 1);
procedure New_Page (Win : in Window);
procedure New_Page;
procedure Set_Col (Win : in Window; To : in Positive_Count);
procedure Set_Col (To : in Positive_Count);
procedure Set_Line (Win : in Window; To : in Positive_Count);
procedure Set_Line (To : in Positive_Count);
function Col (Win : in Window) return Positive_Count;
function Col return Positive_Count;
function Line (Win : in Window) return Positive_Count;
function Line return Positive_Count;
-----------------------
-- Characters-Output --
-----------------------
procedure Put (Win : in Window; Item : in Character);
procedure Put (Item : in Character);
--------------------
-- Strings-Output --
--------------------
procedure Put (Win : in Window; Item : in String);
procedure Put (Item : in String);
procedure Put_Line
(Win : in Window;
Item : in String);
procedure Put_Line
(Item : in String);
-- Exceptions
Status_Error : exception renames Ada.IO_Exceptions.Status_Error;
Mode_Error : exception renames Ada.IO_Exceptions.Mode_Error;
Name_Error : exception renames Ada.IO_Exceptions.Name_Error;
Use_Error : exception renames Ada.IO_Exceptions.Use_Error;
Device_Error : exception renames Ada.IO_Exceptions.Device_Error;
End_Error : exception renames Ada.IO_Exceptions.End_Error;
Data_Error : exception renames Ada.IO_Exceptions.Data_Error;
Layout_Error : exception renames Ada.IO_Exceptions.Layout_Error;
end Terminal_Interface.Curses.Text_IO;
| 44.80292 | 78 | 0.535028 |
58ebf5e5cc104608a52bb174da1692ead3500db7 | 16,240 | adb | Ada | src/base/files/util-files.adb | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | 60 | 2015-01-18T23:05:34.000Z | 2022-03-20T18:56:30.000Z | src/base/files/util-files.adb | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | 20 | 2016-09-15T16:41:30.000Z | 2022-03-29T22:02:32.000Z | src/base/files/util-files.adb | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | 10 | 2015-02-13T04:00:45.000Z | 2022-03-20T18:57:54.000Z | -----------------------------------------------------------------------
-- util-files -- Various File Utility Packages
-- Copyright (C) 2001, 2002, 2003, 2009, 2010, 2011, 2012, 2015, 2017, 2018 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Interfaces.C.Strings;
with Ada.Directories;
with Ada.IO_Exceptions;
with Ada.Strings.Fixed;
with Ada.Streams;
with Ada.Streams.Stream_IO;
with Ada.Text_IO;
with Util.Strings.Tokenizers;
package body Util.Files is
-- ------------------------------
-- Read a complete file into a string.
-- The <b>Max_Size</b> parameter indicates the maximum size that is read.
-- ------------------------------
procedure Read_File (Path : in String;
Into : out Unbounded_String;
Max_Size : in Natural := 0) is
use Ada.Streams;
use Ada.Streams.Stream_IO;
F : File_Type;
Buffer : Stream_Element_Array (1 .. 10_000);
Pos : Positive_Count := 1;
Last : Stream_Element_Offset;
Space : Natural;
begin
if Max_Size = 0 then
Space := Natural'Last;
else
Space := Max_Size;
end if;
Open (Name => Path, File => F, Mode => In_File);
loop
Read (File => F, Item => Buffer, From => Pos, Last => Last);
if Natural (Last) > Space then
Last := Stream_Element_Offset (Space);
end if;
for I in 1 .. Last loop
Append (Into, Character'Val (Buffer (I)));
end loop;
exit when Last < Buffer'Length;
Pos := Pos + Positive_Count (Last);
end loop;
Close (F);
exception
when others =>
if Is_Open (F) then
Close (F);
end if;
raise;
end Read_File;
-- ------------------------------
-- Read the file with the given path, one line at a time and execute the <b>Process</b>
-- procedure with each line as argument.
-- ------------------------------
procedure Read_File (Path : in String;
Process : not null access procedure (Line : in String)) is
File : Ada.Text_IO.File_Type;
begin
Ada.Text_IO.Open (File => File,
Mode => Ada.Text_IO.In_File,
Name => Path);
while not Ada.Text_IO.End_Of_File (File) loop
Process (Ada.Text_IO.Get_Line (File));
end loop;
Ada.Text_IO.Close (File);
end Read_File;
-- ------------------------------
-- Read the file with the given path, one line at a time and append each line to
-- the <b>Into</b> vector.
-- ------------------------------
procedure Read_File (Path : in String;
Into : in out Util.Strings.Vectors.Vector) is
procedure Append (Line : in String);
procedure Append (Line : in String) is
begin
Into.Append (Line);
end Append;
begin
Read_File (Path, Append'Access);
end Read_File;
-- ------------------------------
-- Save the string into a file creating the file if necessary
-- ------------------------------
procedure Write_File (Path : in String;
Content : in String) is
use Ada.Streams;
use Ada.Streams.Stream_IO;
use Ada.Directories;
F : File_Type;
Buffer : Stream_Element_Array (Stream_Element_Offset (Content'First)
.. Stream_Element_Offset (Content'Last));
Dir : constant String := Containing_Directory (Path);
begin
if not Exists (Dir) then
Create_Path (Dir);
end if;
Create (File => F, Name => Path);
for I in Content'Range loop
Buffer (Stream_Element_Offset (I))
:= Stream_Element (Character'Pos (Content (I)));
end loop;
Write (F, Buffer);
Close (F);
exception
when others =>
if Is_Open (F) then
Close (F);
end if;
raise;
end Write_File;
-- ------------------------------
-- Save the string into a file creating the file if necessary
-- ------------------------------
procedure Write_File (Path : in String;
Content : in Unbounded_String) is
begin
Write_File (Path, Ada.Strings.Unbounded.To_String (Content));
end Write_File;
-- ------------------------------
-- Iterate over the search directories defined in <b>Paths</b> and execute
-- <b>Process</b> with each directory until it returns <b>True</b> in <b>Done</b>
-- or the last search directory is found. Each search directory
-- is separated by ';' (yes, even on Unix). When <b>Going</b> is set to Backward, the
-- directories are searched in reverse order.
-- ------------------------------
procedure Iterate_Path (Path : in String;
Process : not null access procedure (Dir : in String;
Done : out Boolean);
Going : in Direction := Ada.Strings.Forward) is
begin
Util.Strings.Tokenizers.Iterate_Tokens (Content => Path,
Pattern => ";",
Process => Process,
Going => Going);
end Iterate_Path;
-- ------------------------------
-- Find the file in one of the search directories. Each search directory
-- is separated by ';' (yes, even on Unix).
-- Returns the path to be used for reading the file.
-- ------------------------------
function Find_File_Path (Name : String;
Paths : String) return String is
use Ada.Strings.Fixed;
Sep_Pos : Natural;
Pos : Positive := Paths'First;
Last : constant Natural := Paths'Last;
begin
while Pos <= Last loop
Sep_Pos := Index (Paths, ";", Pos);
if Sep_Pos = 0 then
Sep_Pos := Last;
else
Sep_Pos := Sep_Pos - 1;
end if;
declare
use Ada.Directories;
Path : constant String := Util.Files.Compose (Paths (Pos .. Sep_Pos), Name);
begin
if Exists (Path) and then Kind (Path) = Ordinary_File then
return Path;
end if;
exception
when Name_Error =>
null;
end;
Pos := Sep_Pos + 2;
end loop;
return Name;
end Find_File_Path;
-- ------------------------------
-- Iterate over the search directories defined in <b>Path</b> and search
-- for files matching the pattern defined by <b>Pattern</b>. For each file,
-- execute <b>Process</b> with the file basename and the full file path.
-- Stop iterating when the <b>Process</b> procedure returns True.
-- Each search directory is separated by ';'. When <b>Going</b> is set to Backward, the
-- directories are searched in reverse order.
-- ------------------------------
procedure Iterate_Files_Path (Pattern : in String;
Path : in String;
Process : not null access procedure (Name : in String;
File : in String;
Done : out Boolean);
Going : in Direction := Ada.Strings.Forward) is
procedure Find_Files (Dir : in String;
Done : out Boolean);
-- ------------------------------
-- Find the files matching the pattern in <b>Dir</b>.
-- ------------------------------
procedure Find_Files (Dir : in String;
Done : out Boolean) is
use Ada.Directories;
Filter : constant Filter_Type := (Ordinary_File => True, others => False);
Ent : Directory_Entry_Type;
Search : Search_Type;
begin
Done := False;
Start_Search (Search, Directory => Dir,
Pattern => Pattern, Filter => Filter);
while More_Entries (Search) loop
Get_Next_Entry (Search, Ent);
declare
Name : constant String := Simple_Name (Ent);
File_Path : constant String := Full_Name (Ent);
begin
Process (Name, File_Path, Done);
exit when Done;
end;
end loop;
end Find_Files;
begin
Iterate_Path (Path => Path, Process => Find_Files'Access, Going => Going);
end Iterate_Files_Path;
-- ------------------------------
-- Find the files which match the pattern in the directories specified in the
-- search path <b>Path</b>. Each search directory is separated by ';'.
-- File names are added to the string set in <b>Into</b>.
-- ------------------------------
procedure Find_Files_Path (Pattern : in String;
Path : in String;
Into : in out Util.Strings.Maps.Map) is
procedure Add_File (Name : in String;
File_Path : in String;
Done : out Boolean);
-- ------------------------------
-- Find the files matching the pattern in <b>Dir</b>.
-- ------------------------------
procedure Add_File (Name : in String;
File_Path : in String;
Done : out Boolean) is
begin
if not Into.Contains (Name) then
Into.Insert (Name, File_Path);
end if;
Done := False;
end Add_File;
begin
Iterate_Files_Path (Pattern => Pattern, Path => Path, Process => Add_File'Access);
end Find_Files_Path;
-- ------------------------------
-- Compose an existing path by adding the specified name to each path component
-- and return a new paths having only existing directories. Each directory is
-- separated by ';'.
-- If the composed path exists, it is added to the result path.
-- Example:
-- paths = 'web;regtests' name = 'info'
-- result = 'web/info;regtests/info'
-- Returns the composed path.
-- ------------------------------
function Compose_Path (Paths : in String;
Name : in String) return String is
procedure Compose (Dir : in String;
Done : out Boolean);
Result : Unbounded_String;
-- ------------------------------
-- Build the new path by checking if <b>Name</b> exists in <b>Dir</b>
-- and appending the new path in the <b>Result</b>.
-- ------------------------------
procedure Compose (Dir : in String;
Done : out Boolean) is
use Ada.Directories;
Path : constant String := Util.Files.Compose (Dir, Name);
begin
Done := False;
if Exists (Path) and then Kind (Path) = Directory then
if Length (Result) > 0 then
Append (Result, ';');
end if;
Append (Result, Path);
end if;
exception
when Name_Error =>
null;
end Compose;
begin
Iterate_Path (Path => Paths, Process => Compose'Access);
return To_String (Result);
end Compose_Path;
-- ------------------------------
-- Returns the name of the external file with the specified directory
-- and the name. Unlike the Ada.Directories.Compose, the name can represent
-- a relative path and thus include directory separators.
-- ------------------------------
function Compose (Directory : in String;
Name : in String) return String is
begin
if Name'Length = 0 then
return Directory;
elsif Directory'Length = 0 then
return Name;
elsif Directory = "." or else Directory = "./" then
if Name (Name'First) = '/' then
return Compose (Directory, Name (Name'First + 1 .. Name'Last));
else
return Name;
end if;
elsif Directory (Directory'Last) = '/' and then Name (Name'First) = '/' then
return Directory & Name (Name'First + 1 .. Name'Last);
elsif Directory (Directory'Last) = '/' or else Name (Name'First) = '/' then
return Directory & Name;
else
return Directory & "/" & Name;
end if;
end Compose;
-- ------------------------------
-- Returns a relative path whose origin is defined by <b>From</b> and which refers
-- to the absolute path referenced by <b>To</b>. Both <b>From</b> and <b>To</b> are
-- assumed to be absolute pathes. Returns the absolute path <b>To</b> if the relative
-- path could not be found. Both paths must have at least one root component in common.
-- ------------------------------
function Get_Relative_Path (From : in String;
To : in String) return String is
Result : Unbounded_String;
Last : Natural := 0;
begin
for I in From'Range loop
if I > To'Last or else From (I) /= To (I) then
-- Nothing in common, return the absolute path <b>To</b>.
if Last <= From'First + 1 then
return To;
end if;
for J in Last .. From'Last - 1 loop
if From (J) = '/' or From (J) = '\' then
Append (Result, "../");
end if;
end loop;
if Last <= To'Last and From (I) /= '/' and From (I) /= '\' then
Append (Result, "../");
Append (Result, To (Last .. To'Last));
end if;
return To_String (Result);
elsif I < From'Last and then (From (I) = '/' or From (I) = '\') then
Last := I + 1;
end if;
end loop;
if To'Last = From'Last or (To'Last = From'Last + 1
and (To (To'Last) = '/' or To (To'Last) = '\'))
then
return ".";
elsif Last = 0 then
return To;
elsif To (From'Last + 1) = '/' or To (From'Last + 1) = '\' then
return To (From'Last + 2 .. To'Last);
else
return To (Last .. To'Last);
end if;
end Get_Relative_Path;
-- ------------------------------
-- Rename the old name into a new name.
-- ------------------------------
procedure Rename (Old_Name, New_Name : in String) is
-- Rename a file (the Ada.Directories.Rename does not allow to use the
-- Unix atomic file rename!)
function Sys_Rename (Oldpath : in Interfaces.C.Strings.chars_ptr;
Newpath : in Interfaces.C.Strings.chars_ptr) return Integer;
pragma Import (C, Sys_Rename, "rename");
Old_Path : Interfaces.C.Strings.chars_ptr;
New_Path : Interfaces.C.Strings.chars_ptr;
Result : Integer;
begin
-- Do a system atomic rename of old file in the new file.
-- Ada.Directories.Rename does not allow this.
Old_Path := Interfaces.C.Strings.New_String (Old_Name);
New_Path := Interfaces.C.Strings.New_String (New_Name);
Result := Sys_Rename (Old_Path, New_Path);
Interfaces.C.Strings.Free (Old_Path);
Interfaces.C.Strings.Free (New_Path);
if Result /= 0 then
raise Ada.IO_Exceptions.Use_Error with "Cannot rename file";
end if;
end Rename;
end Util.Files;
| 38.122066 | 92 | 0.510591 |
5897079164e7c8ca1ea74d6d9e9232be487c2644 | 720 | ads | Ada | src/commands-topics-issues.ads | bracke/websitegenerator | d3aee456f9f0b84e1d4e7030520fac5d8e6c8a1b | [
"CC0-1.0"
] | 1 | 2022-02-14T11:45:43.000Z | 2022-02-14T11:45:43.000Z | src/commands-topics-issues.ads | bracke/websitegenerator | d3aee456f9f0b84e1d4e7030520fac5d8e6c8a1b | [
"CC0-1.0"
] | null | null | null | src/commands-topics-issues.ads | bracke/websitegenerator | d3aee456f9f0b84e1d4e7030520fac5d8e6c8a1b | [
"CC0-1.0"
] | null | null | null | with AAA.Strings;
with CLIC.Subcommand;
with CLIC.TTY;
package Commands.Topics.Issues is
package TT renames CLIC.TTY;
type Topic is new CLIC.Subcommand.Help_Topic with null record;
overriding
function Name (This : Topic) return CLIC.Subcommand.Identifier
is ("issues");
overriding
function Title (This : Topic) return String
is ("Reporting bugs and feature requests and other issues.");
overriding
function Content (This : Topic) return AAA.Strings.Vector
is (AAA.Strings.Empty_Vector.Append
("Please create issues on the WebsiteGenerator project's GitHub page: ")
.Append
(TT.URL ("https://github.com/bracke/WebsiteGenerator/issues")));
end Commands.Topics.Issues; | 27.692308 | 77 | 0.730556 |
22d48255934dca693c74403dd160ca5cf7c846a2 | 3,237 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c39008c.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/c39008c.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c39008c.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C39008C.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 PROGRAM_ERROR IS RAISED WHEN AN ATTEMPT IS MADE TO
-- ACTIVATE A TASK BEFORE ITS BODY HAS BEEN ELABORATED. CHECK THE
-- CASE IN WHICH SEVERAL TASKS ARE TO BE ACTIVATED, AND ONLY SOME
-- HAVE UNELABORATED BODIES; NO TASKS SHOULD BE ACTIVATED.
-- HISTORY:
-- BCB 07/08/88 CREATED ORIGINAL TEST.
WITH REPORT; USE REPORT;
PROCEDURE C39008C IS
BEGIN
TEST ("C39008C", "CHECK THAT PROGRAM_ERROR IS RAISED WHEN AN " &
"ATTEMPT IS MADE TO ACTIVATE A TASK BEFORE ITS " &
"BODY HAS BEEN ELABORATED. CHECK THE CASE IN " &
"WHICH SEVERAL TASKS ARE TO BE ACTIVATED, AND " &
"ONLY SOME HAVE UNELABORATED BODIES; NO TASKS " &
"SHOULD BE ACTIVATED");
BEGIN
DECLARE
TASK TYPE A;
TASK TYPE B;
TASK TYPE C;
TASK TYPE D;
PACKAGE P IS
W : A;
X : B;
Y : C;
Z : D;
END P;
TASK BODY A IS
BEGIN
FAILED ("TASK A ACTIVATED");
END A;
TASK BODY D IS
BEGIN
FAILED ("TASK D ACTIVATED");
END D;
PACKAGE BODY P IS
END P;
TASK BODY B IS
BEGIN
FAILED ("TASK B ACTIVATED");
END B;
TASK BODY C IS
BEGIN
FAILED ("TASK C ACTIVATED");
END C;
BEGIN
FAILED ("PROGRAM_ERROR WAS NOT RAISED");
END;
EXCEPTION
WHEN PROGRAM_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("AN EXCEPTION OTHER THAN PROGRAM_ERROR WAS " &
"RAISED");
END;
RESULT;
END C39008C;
| 33.030612 | 79 | 0.537535 |
4da222ad70e5ab99c26001299caeeb28696e788b | 5,725 | ads | Ada | src/postgresql/pq.ads | My-Colaborations/ada-ado | cebf1f9b38c0c259c44935e8bca05a5bff12aace | [
"Apache-2.0"
] | null | null | null | src/postgresql/pq.ads | My-Colaborations/ada-ado | cebf1f9b38c0c259c44935e8bca05a5bff12aace | [
"Apache-2.0"
] | null | null | null | src/postgresql/pq.ads | My-Colaborations/ada-ado | cebf1f9b38c0c259c44935e8bca05a5bff12aace | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- pq -- Postgresql libpq thin binding
-- Copyright (C) 2018 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Interfaces.C.Strings;
with System;
package PQ is
pragma Linker_Options ("-lpq");
subtype chars_ptr is Interfaces.C.Strings.chars_ptr;
type PGconn_Access is new System.Address;
Null_PGconn : constant PGconn_Access := PGconn_Access (System.Null_Address);
type PGresult_Access is new System.Address;
Null_PGresult : constant PGresult_Access := PGresult_Access (System.Null_Address);
type ConnStatusType is
(
CONNECTION_OK,
CONNECTION_BAD,
-- Non-blocking mode only below here
-- The existence of these should never be relied upon - they should only
-- be used for user feedback or similar purposes.
-- Waiting for connection to be made.
CONNECTION_STARTED,
-- Connection OK; waiting to send.
CONNECTION_MADE,
-- Waiting for a response from the postmaster.
CONNECTION_AWAITING_RESPONSE,
-- Received authentication; waiting for backend startup.
CONNECTION_AUTH_OK,
-- Negotiating environment.
CONNECTION_SETENV,
-- Negotiating SSL.
CONNECTION_SSL_STARTUP,
-- Internal state: connect() needed
CONNECTION_NEEDED
);
type ExecStatusType is
(
-- empty query string was executed
PGRES_EMPTY_QUERY,
-- a query command that doesn't return anything was executed properly by the backend
PGRES_COMMAND_OK,
-- a query command that returns tuples was executed properly by the backend, PGresult
-- contains the result tuples
PGRES_TUPLES_OK,
-- Copy Out data transfer in progress
PGRES_COPY_OUT,
-- Copy In data transfer in progress
PGRES_COPY_IN,
-- an unexpected response was recv'd from the backend
PGRES_BAD_RESPONSE,
-- notice or warning message
PGRES_NONFATAL_ERROR,
-- query failed
PGRES_FATAL_ERROR,
-- Copy In/Out data transfer in progress
PGRES_COPY_BOTH,
-- single tuple from larger resultset
PGRES_SINGLE_TUPLE
);
function PQconnectdb (Conninfo : in chars_ptr) return PGconn_Access
with Import => True, Convention => C, Link_Name => "PQconnectdb";
function PQstatus (Conn : in PGconn_Access) return ConnStatusType
with Import => True, Convention => C, Link_Name => "PQstatus";
function PQerrorMessage (Conn : in PGconn_Access) return chars_ptr
with Import => True, Convention => C, Link_Name => "PQerrorMessage";
procedure PQfinish (Conn : PGconn_Access)
with Import => True, Convention => C, Link_Name => "PQfinish";
function PQexec (Conn : PGconn_Access;
SQL : Interfaces.C.Strings.chars_ptr) return PGresult_Access
with Import => True, Convention => C, Link_Name => "PQexec";
procedure PQclear (Result : in PGresult_Access)
with Import => True, Convention => C, Link_Name => "PQclear";
function PQresultStatus (Result : in PGresult_Access) return ExecStatusType
with Import => True, Convention => C, Link_Name => "PQresultStatus";
function PQresultErrorMessage (Result : in PGresult_Access) return chars_ptr
with Import => True, Convention => C, Link_Name => "PQresultErrorMessage";
function PQcmdTuples (Result : in PGresult_Access) return chars_ptr
with Import => True, Convention => C, Link_Name => "PQcmdTuples";
function PQntuples (Result : in PGresult_Access) return Interfaces.C.int
with Import => True, Convention => C, Link_Name => "PQntuples";
function PQnfields (Result : in PGresult_Access) return Interfaces.C.int
with Import => True, Convention => C, Link_Name => "PQnfields";
function PQfname (Result : in PGresult_Access;
Column_Number : in Interfaces.C.int) return chars_ptr
with Import => True, Convention => C, Link_Name => "PQfname";
function PQfsize (Result : in PGresult_Access;
Column_Number : in Interfaces.C.int) return Interfaces.C.int
with Import => True, Convention => C, Link_Name => "PQfsize";
function PQgetvalue (Result : in PGresult_Access;
Row_Number : in Interfaces.C.int;
Column_Number : in Interfaces.C.int) return chars_ptr
with Import => True, Convention => C, Link_Name => "PQgetvalue";
function PQgetisnull (Result : in PGresult_Access;
Row_Number : in Interfaces.C.int;
Column_Number : in Interfaces.C.int) return Interfaces.C.int
with Import => True, Convention => C, Link_Name => "PQgetisnull";
function PQgetlength (Result : in PGresult_Access;
Row_Number : in Interfaces.C.int;
Column_Number : in Interfaces.C.int) return Interfaces.C.int
with Import => True, Convention => C, Link_Name => "PQgetlength";
end PQ;
| 36.464968 | 92 | 0.655546 |
222701cdd11469a62525dd2a73428a3d11e6e260 | 1,844 | ads | Ada | include/sf-system-vector3.ads | Fabien-Chouteau/ASFML | 52a013554bcfb6150e0d6391871356c1443a6b93 | [
"Zlib"
] | null | null | null | include/sf-system-vector3.ads | Fabien-Chouteau/ASFML | 52a013554bcfb6150e0d6391871356c1443a6b93 | [
"Zlib"
] | null | null | null | include/sf-system-vector3.ads | Fabien-Chouteau/ASFML | 52a013554bcfb6150e0d6391871356c1443a6b93 | [
"Zlib"
] | null | null | null | --//////////////////////////////////////////////////////////
-- SFML - Simple and Fast Multimedia Library
-- Copyright (C) 2007-2015 Laurent Gomila ([email protected])
-- This software is provided 'as-is', without any express or implied warranty.
-- In no event will the authors be held liable for any damages arising from the use of this software.
-- Permission is granted to anyone to use this software for any purpose,
-- including commercial applications, and to alter it and redistribute it freely,
-- subject to the following restrictions:
-- 1. The origin of this software must not be misrepresented;
-- you must not claim that you wrote the original software.
-- If you use this software in a product, an acknowledgment
-- in the product documentation would be appreciated but is not required.
-- 2. Altered source versions must be plainly marked as such,
-- and must not be misrepresented as being the original software.
-- 3. This notice may not be removed or altered from any source distribution.
--//////////////////////////////////////////////////////////
--//////////////////////////////////////////////////////////
with Interfaces.C; use Interfaces.C;
package Sf.System.Vector3 is
--//////////////////////////////////////////////////////////
--//////////////////////////////////////////////////////////
--//////////////////////////////////////////////////////////
--//////////////////////////////////////////////////////////
--//////////////////////////////////////////////////////////
--/ @brief 3-component vector of floats
--/
--//////////////////////////////////////////////////////////
type sfVector3f is record
x : aliased float;
y : aliased float;
z : aliased float;
end record;
pragma Convention (C_Pass_By_Copy, sfVector3f);
end Sf.System.Vector3;
| 44.97561 | 101 | 0.511931 |
58fd3fd3e05263e238dd00ae359442faaa55bd24 | 37,723 | adb | Ada | gcc-gcc-7_3_0-release/gcc/ada/styleg.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/styleg.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/styleg.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S T Y L E G --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2015, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This version of the Style package implements the standard GNAT style
-- checking rules. For documentation of these rules, see comments on the
-- individual procedures.
with Atree; use Atree;
with Casing; use Casing;
with Csets; use Csets;
with Einfo; use Einfo;
with Err_Vars; use Err_Vars;
with Opt; use Opt;
with Scans; use Scans;
with Sinfo; use Sinfo;
with Sinput; use Sinput;
with Stylesw; use Stylesw;
package body Styleg is
use ASCII;
Blank_Lines : Nat := 0;
-- Counts number of empty lines seen. Reset to zero if a non-empty line
-- is encountered. Used to check for trailing blank lines in Check_EOF,
-- and for multiple blank lines.
Blank_Line_Location : Source_Ptr;
-- Remembers location of first blank line in a series. Used to issue an
-- appropriate diagnostic if subsequent blank lines or the end of file
-- is encountered.
-----------------------
-- Local Subprograms --
-----------------------
procedure Check_No_Space_After;
-- Checks that there is a non-white space character after the current
-- token, or white space followed by a comment, or the end of line.
-- Issue error message if not.
procedure Check_No_Space_Before;
-- Check that token is first token on line, or else is not preceded
-- by white space. Signal error of space not allowed if not.
procedure Check_Separate_Stmt_Lines_Cont;
-- Non-inlined continuation of Check_Separate_Stmt_Lines
function Determine_Token_Casing return Casing_Type;
-- Determine casing of current token
procedure Error_Space_Not_Allowed (S : Source_Ptr);
-- Posts an error message indicating that a space is not allowed
-- at the given source location.
procedure Error_Space_Required (S : Source_Ptr);
-- Posts an error message indicating that a space is required at
-- the given source location.
function Is_White_Space (C : Character) return Boolean;
pragma Inline (Is_White_Space);
-- Returns True for space or HT, False otherwise
-- What about VT and FF, should they return True ???
procedure Require_Following_Space;
pragma Inline (Require_Following_Space);
-- Require token to be followed by white space. Used only if in GNAT
-- style checking mode.
procedure Require_Preceding_Space;
pragma Inline (Require_Preceding_Space);
-- Require token to be preceded by white space. Used only if in GNAT
-- style checking mode.
----------------------
-- Check_Abs_Or_Not --
----------------------
-- In check token mode (-gnatyt), ABS/NOT must be followed by a space
procedure Check_Abs_Not is
begin
if Style_Check_Tokens then
if Source (Scan_Ptr) > ' ' then -- ???
Error_Space_Required (Scan_Ptr);
end if;
end if;
end Check_Abs_Not;
----------------------
-- Check_Apostrophe --
----------------------
-- Do not allow space before or after apostrophe -- OR AFTER???
procedure Check_Apostrophe is
begin
if Style_Check_Tokens then
Check_No_Space_After;
end if;
end Check_Apostrophe;
-----------------
-- Check_Arrow --
-----------------
-- In check tokens mode (-gnatys), arrow must be surrounded by spaces,
-- except that within the argument of a Depends macro the required format
-- is =>+ rather than => +).
procedure Check_Arrow (Inside_Depends : Boolean := False) is
begin
if Style_Check_Tokens then
Require_Preceding_Space;
if not Inside_Depends then
Require_Following_Space;
-- Special handling for Inside_Depends
else
if Source (Scan_Ptr) = ' '
and then Source (Scan_Ptr + 1) = '+'
then
Error_Space_Not_Allowed (Scan_Ptr);
elsif Source (Scan_Ptr) /= ' '
and then Source (Scan_Ptr) /= '+'
then
Require_Following_Space;
end if;
end if;
end if;
end Check_Arrow;
--------------------------
-- Check_Attribute_Name --
--------------------------
-- In check attribute casing mode (-gnatya), attribute names must be
-- mixed case, i.e. start with an upper case letter, and otherwise
-- lower case, except after an underline character.
procedure Check_Attribute_Name (Reserved : Boolean) is
pragma Warnings (Off, Reserved);
begin
if Style_Check_Attribute_Casing then
if Determine_Token_Casing /= Mixed_Case then
Error_Msg_SC -- CODEFIX
("(style) bad capitalization, mixed case required");
end if;
end if;
end Check_Attribute_Name;
---------------------------
-- Check_Binary_Operator --
---------------------------
-- In check token mode (-gnatyt), binary operators other than the special
-- case of exponentiation require surrounding space characters.
procedure Check_Binary_Operator is
begin
if Style_Check_Tokens then
Require_Preceding_Space;
Require_Following_Space;
end if;
end Check_Binary_Operator;
----------------------------
-- Check_Boolean_Operator --
----------------------------
procedure Check_Boolean_Operator (Node : Node_Id) is
function OK_Boolean_Operand (N : Node_Id) return Boolean;
-- Returns True for simple variable, or "not X1" or "X1 and X2" or
-- "X1 or X2" where X1, X2 are recursively OK_Boolean_Operand's.
------------------------
-- OK_Boolean_Operand --
------------------------
function OK_Boolean_Operand (N : Node_Id) return Boolean is
begin
if Nkind_In (N, N_Identifier, N_Expanded_Name) then
return True;
elsif Nkind (N) = N_Op_Not then
return OK_Boolean_Operand (Original_Node (Right_Opnd (N)));
elsif Nkind_In (N, N_Op_And, N_Op_Or) then
return OK_Boolean_Operand (Original_Node (Left_Opnd (N)))
and then
OK_Boolean_Operand (Original_Node (Right_Opnd (N)));
else
return False;
end if;
end OK_Boolean_Operand;
-- Start of processing for Check_Boolean_Operator
begin
if Style_Check_Boolean_And_Or
and then Comes_From_Source (Node)
then
declare
Orig : constant Node_Id := Original_Node (Node);
begin
if Nkind_In (Orig, N_Op_And, N_Op_Or) then
declare
L : constant Node_Id := Original_Node (Left_Opnd (Orig));
R : constant Node_Id := Original_Node (Right_Opnd (Orig));
begin
-- First OK case, simple boolean constants/identifiers
if OK_Boolean_Operand (L)
and then
OK_Boolean_Operand (R)
then
return;
-- Second OK case, modular types
elsif Is_Modular_Integer_Type (Etype (Node)) then
return;
-- Third OK case, array types
elsif Is_Array_Type (Etype (Node)) then
return;
-- Otherwise we have an error
elsif Nkind (Orig) = N_Op_And then
Error_Msg -- CODEFIX
("(style) `AND THEN` required", Sloc (Orig));
else
Error_Msg -- CODEFIX
("(style) `OR ELSE` required", Sloc (Orig));
end if;
end;
end if;
end;
end if;
end Check_Boolean_Operator;
---------------
-- Check_Box --
---------------
-- In check token mode (-gnatyt), box must be preceded by a space or by
-- a left parenthesis. Spacing checking on the surrounding tokens takes
-- care of the remaining checks.
procedure Check_Box is
begin
if Style_Check_Tokens then
if Prev_Token /= Tok_Left_Paren then
Require_Preceding_Space;
end if;
end if;
end Check_Box;
-----------------
-- Check_Colon --
-----------------
-- In check token mode (-gnatyt), colon must be surrounded by spaces
procedure Check_Colon is
begin
if Style_Check_Tokens then
Require_Preceding_Space;
Require_Following_Space;
end if;
end Check_Colon;
-----------------------
-- Check_Colon_Equal --
-----------------------
-- In check token mode (-gnatyt), := must be surrounded by spaces
procedure Check_Colon_Equal is
begin
if Style_Check_Tokens then
Require_Preceding_Space;
Require_Following_Space;
end if;
end Check_Colon_Equal;
-----------------
-- Check_Comma --
-----------------
-- In check token mode (-gnatyt), comma must be either the first
-- token on a line, or be preceded by a non-blank character.
-- It must also always be followed by a blank.
procedure Check_Comma is
begin
if Style_Check_Tokens then
Check_No_Space_Before;
if Source (Scan_Ptr) > ' ' then
Error_Space_Required (Scan_Ptr);
end if;
end if;
end Check_Comma;
-------------------
-- Check_Comment --
-------------------
-- In check comment mode (-gnatyc) there are several requirements on the
-- format of comments. The following are permissible comment formats:
-- 1. Any comment that is not at the start of a line, i.e. where the
-- initial minuses are not the first non-blank characters on the
-- line must have at least one blank after the second minus or a
-- special character as defined in rule 5.
-- 2. A row of all minuses of any length is permitted (see procedure
-- box above in the source of this routine).
-- 3. A comment line starting with two minuses and a space, and ending
-- with a space and two minuses. Again see the procedure title box
-- immediately above in the source.
-- 4. A full line comment where two spaces follow the two minus signs.
-- This is the normal comment format in GNAT style, as typified by
-- the comments you are reading now.
-- 5. A full line comment where the first character after the second
-- minus is a special character, i.e. a character in the ASCII
-- range 16#21#..16#2F# or 16#3A#..16#3F#. This allows special
-- comments, such as those generated by gnatprep, or those that
-- appear in the SPARK annotation language to be accepted.
-- Note: for GNAT internal files (-gnatg switch set on for the
-- compilation), the only special sequence recognized and allowed
-- is --! as generated by gnatprep.
-- 6. In addition, the comment must be properly indented if comment
-- indentation checking is active (Style_Check_Indentation non-zero).
-- Either the start column must be a multiple of this indentation,
-- or the indentation must match that of the next non-blank line,
-- or must match the indentation of the immediately preciding line
-- if it is non-blank.
procedure Check_Comment is
S : Source_Ptr;
C : Character;
function Is_Box_Comment return Boolean;
-- Returns True if the last two characters on the line are -- which
-- characterizes a box comment (as for example follows this spec).
function Is_Special_Character (C : Character) return Boolean;
-- Determines if C is a special character (see rule 5 above)
function Same_Column_As_Next_Non_Blank_Line return Boolean;
-- Called for a full line comment. If the indentation of this comment
-- matches that of the next non-blank line in the source, then True is
-- returned, otherwise False.
function Same_Column_As_Previous_Line return Boolean;
-- Called for a full line comment. If the previous line is blank, then
-- returns False. Otherwise, if the indentation of this comment matches
-- that of the previous line in the source, then True is returned,
-- otherwise False.
--------------------
-- Is_Box_Comment --
--------------------
function Is_Box_Comment return Boolean is
S : Source_Ptr;
begin
-- Do we need to worry about UTF_32 line terminators here ???
S := Scan_Ptr + 3;
while Source (S) not in Line_Terminator loop
S := S + 1;
end loop;
return Source (S - 1) = '-' and then Source (S - 2) = '-';
end Is_Box_Comment;
--------------------------
-- Is_Special_Character --
--------------------------
function Is_Special_Character (C : Character) return Boolean is
begin
if GNAT_Mode then
return C = '!';
else
return
Character'Pos (C) in 16#21# .. 16#2F#
or else
Character'Pos (C) in 16#3A# .. 16#3F#;
end if;
end Is_Special_Character;
----------------------------------------
-- Same_Column_As_Next_Non_Blank_Line --
----------------------------------------
function Same_Column_As_Next_Non_Blank_Line return Boolean is
P : Source_Ptr;
begin
-- Step to end of line
P := Scan_Ptr + 2;
while Source (P) not in Line_Terminator loop
P := P + 1;
end loop;
-- Step past blanks, and line terminators (UTF_32 case???)
while Source (P) <= ' ' and then Source (P) /= EOF loop
P := P + 1;
end loop;
-- Compare columns
return Get_Column_Number (Scan_Ptr) = Get_Column_Number (P);
end Same_Column_As_Next_Non_Blank_Line;
----------------------------------
-- Same_Column_As_Previous_Line --
----------------------------------
function Same_Column_As_Previous_Line return Boolean is
S, P : Source_Ptr;
begin
-- Point S to start of this line, and P to start of previous line
S := Line_Start (Scan_Ptr);
P := S;
Backup_Line (P);
-- Step P to first non-blank character on line
loop
-- If we get back to start of current line, then the previous line
-- was blank, and we always return False in that situation.
if P = S then
return False;
end if;
exit when Source (P) /= ' ' and then Source (P) /= ASCII.HT;
P := P + 1;
end loop;
-- Compare columns
return Get_Column_Number (Scan_Ptr) = Get_Column_Number (P);
end Same_Column_As_Previous_Line;
-- Start of processing for Check_Comment
begin
-- Can never have a non-blank character preceding the first minus
if Style_Check_Comments then
if Scan_Ptr > Source_First (Current_Source_File)
and then Source (Scan_Ptr - 1) > ' '
then
Error_Msg_S -- CODEFIX
("(style) space required");
end if;
end if;
-- For a comment that is not at the start of the line, the only
-- requirement is that we cannot have a non-blank character after
-- the second minus sign or a special character.
if Scan_Ptr /= First_Non_Blank_Location then
if Style_Check_Comments then
if Source (Scan_Ptr + 2) > ' '
and then not Is_Special_Character (Source (Scan_Ptr + 2))
then
Error_Msg -- CODEFIX
("(style) space required", Scan_Ptr + 2);
end if;
end if;
return;
-- Case of a comment that is at the start of a line
else
-- First check, must be in appropriately indented column
if Style_Check_Indentation /= 0 then
if Start_Column rem Style_Check_Indentation /= 0 then
if not Same_Column_As_Next_Non_Blank_Line
and then not Same_Column_As_Previous_Line
then
Error_Msg_S -- CODEFIX
("(style) bad column");
end if;
return;
end if;
end if;
-- If we are not checking comments, nothing more to do
if not Style_Check_Comments then
return;
end if;
-- Case of not followed by a blank. Usually wrong, but there are
-- some exceptions that we permit.
if Source (Scan_Ptr + 2) /= ' ' then
C := Source (Scan_Ptr + 2);
-- Case of -- all on its own on a line is OK
if C < ' ' then
return;
end if;
-- Case of --x, x special character is OK (gnatprep/SPARK/etc.)
-- This is not permitted in internal GNAT implementation units
-- except for the case of --! as used by gnatprep output.
if Is_Special_Character (C) then
return;
end if;
-- The only other case in which we allow a character after
-- the -- other than a space is when we have a row of minus
-- signs (case of header lines for a box comment for example).
S := Scan_Ptr + 2;
while Source (S) >= ' ' loop
if Source (S) /= '-' then
if Is_Box_Comment
or else Style_Check_Comments_Spacing = 1
then
Error_Space_Required (Scan_Ptr + 2);
else
Error_Msg -- CODEFIX
("(style) two spaces required", Scan_Ptr + 2);
end if;
return;
end if;
S := S + 1;
end loop;
-- If we are followed by a blank, then the comment is OK if the
-- character following this blank is another blank or a format
-- effector, or if the required comment spacing is 1.
elsif Source (Scan_Ptr + 3) <= ' '
or else Style_Check_Comments_Spacing = 1
then
return;
-- Here is the case where we only have one blank after the two minus
-- signs, with Style_Check_Comments_Spacing set to 2, which is an
-- error unless the line ends with two minus signs, the case of a
-- box comment.
elsif not Is_Box_Comment then
Error_Space_Required (Scan_Ptr + 3);
end if;
end if;
end Check_Comment;
-------------------
-- Check_Dot_Dot --
-------------------
-- In check token mode (-gnatyt), ".." must be surrounded by spaces
procedure Check_Dot_Dot is
begin
if Style_Check_Tokens then
Require_Preceding_Space;
Require_Following_Space;
end if;
end Check_Dot_Dot;
---------------
-- Check_EOF --
---------------
-- In check blanks at end mode, check no blank lines precede the EOF
procedure Check_EOF is
begin
if Style_Check_Blank_Lines then
-- We expect one blank line, from the EOF, but no more than one
if Blank_Lines = 2 then
Error_Msg -- CODEFIX
("(style) blank line not allowed at end of file",
Blank_Line_Location);
elsif Blank_Lines >= 3 then
Error_Msg -- CODEFIX
("(style) blank lines not allowed at end of file",
Blank_Line_Location);
end if;
end if;
end Check_EOF;
-----------------------------------
-- Check_Exponentiation_Operator --
-----------------------------------
-- No spaces are required for the ** operator in GNAT style check mode
procedure Check_Exponentiation_Operator is
begin
null;
end Check_Exponentiation_Operator;
--------------
-- Check_HT --
--------------
-- In check horizontal tab mode (-gnatyh), tab characters are not allowed
procedure Check_HT is
begin
if Style_Check_Horizontal_Tabs then
Error_Msg_S -- CODEFIX
("(style) horizontal tab not allowed");
end if;
end Check_HT;
-----------------------
-- Check_Indentation --
-----------------------
-- In check indentation mode (-gnaty? for ? a digit), a new statement or
-- declaration is required to start in a column that is a multiple of the
-- indentation amount.
procedure Check_Indentation is
begin
if Style_Check_Indentation /= 0 then
if Token_Ptr = First_Non_Blank_Location
and then Start_Column rem Style_Check_Indentation /= 0
then
Error_Msg_SC -- CODEFIX
("(style) bad indentation");
end if;
end if;
end Check_Indentation;
----------------------
-- Check_Left_Paren --
----------------------
-- In check token mode (-gnatyt), left paren must not be preceded by an
-- identifier character or digit (a separating space is required) and may
-- never be followed by a space.
procedure Check_Left_Paren is
begin
if Style_Check_Tokens then
if Token_Ptr > Source_First (Current_Source_File)
and then Identifier_Char (Source (Token_Ptr - 1))
then
Error_Space_Required (Token_Ptr);
end if;
Check_No_Space_After;
end if;
end Check_Left_Paren;
---------------------------
-- Check_Line_Max_Length --
---------------------------
-- In check max line length mode (-gnatym), the line length must
-- not exceed the permitted maximum value.
procedure Check_Line_Max_Length (Len : Nat) is
begin
if Style_Check_Max_Line_Length then
if Len > Style_Max_Line_Length then
Error_Msg
("(style) this line is too long",
Current_Line_Start + Source_Ptr (Style_Max_Line_Length));
end if;
end if;
end Check_Line_Max_Length;
---------------------------
-- Check_Line_Terminator --
---------------------------
-- In check blanks at end mode (-gnatyb), lines may not end with a
-- trailing space.
-- In check form feeds mode (-gnatyf), the line terminator may not
-- be either of the characters FF or VT.
-- In check DOS line terminators node (-gnatyd), the line terminator
-- must be a single LF, without a following CR.
procedure Check_Line_Terminator (Len : Nat) is
S : Source_Ptr;
L : Nat := Len;
-- Length of line (adjusted down for blanks at end of line)
begin
-- Reset count of blank lines if first line
if Get_Logical_Line_Number (Scan_Ptr) = 1 then
Blank_Lines := 0;
end if;
-- Check FF/VT terminators
if Style_Check_Form_Feeds then
if Source (Scan_Ptr) = ASCII.FF then
Error_Msg_S -- CODEFIX
("(style) form feed not allowed");
elsif Source (Scan_Ptr) = ASCII.VT then
Error_Msg_S -- CODEFIX
("(style) vertical tab not allowed");
end if;
end if;
-- Check DOS line terminator
if Style_Check_DOS_Line_Terminator then
-- Ignore EOF, since we only get called with an EOF if it is the last
-- character in the buffer (and was therefore not in the source
-- file), since the terminating EOF is added to stop the scan.
if Source (Scan_Ptr) = EOF then
null;
-- Bad terminator if we don't have an LF
elsif Source (Scan_Ptr) /= LF then
Error_Msg_S ("(style) incorrect line terminator");
end if;
end if;
-- Remove trailing spaces
S := Scan_Ptr;
while L > 0 and then Is_White_Space (Source (S - 1)) loop
S := S - 1;
L := L - 1;
end loop;
-- Issue message for blanks at end of line if option enabled
if Style_Check_Blanks_At_End and then L < Len then
Error_Msg -- CODEFIX
("(style) trailing spaces not permitted", S);
end if;
-- Deal with empty (blank) line
if L = 0 then
-- Increment blank line count
Blank_Lines := Blank_Lines + 1;
-- If first blank line, record location for later error message
if Blank_Lines = 1 then
Blank_Line_Location := Scan_Ptr;
end if;
-- Non-blank line, check for previous multiple blank lines
else
if Style_Check_Blank_Lines and then Blank_Lines > 1 then
Error_Msg -- CODEFIX
("(style) multiple blank lines", Blank_Line_Location);
end if;
-- And reset blank line count
Blank_Lines := 0;
end if;
end Check_Line_Terminator;
------------------
-- Check_Not_In --
------------------
-- In check tokens mode, only one space between NOT and IN
procedure Check_Not_In is
begin
if Style_Check_Tokens then
if Source (Token_Ptr - 1) /= ' '
or else Token_Ptr - Prev_Token_Ptr /= 4
then -- CODEFIX?
Error_Msg
("(style) single space must separate NOT and IN", Token_Ptr - 1);
end if;
end if;
end Check_Not_In;
--------------------------
-- Check_No_Space_After --
--------------------------
procedure Check_No_Space_After is
S : Source_Ptr;
begin
if Is_White_Space (Source (Scan_Ptr)) then
-- Allow one or more spaces if followed by comment
S := Scan_Ptr + 1;
loop
if Source (S) = '-' and then Source (S + 1) = '-' then
return;
elsif Is_White_Space (Source (S)) then
S := S + 1;
else
exit;
end if;
end loop;
Error_Space_Not_Allowed (Scan_Ptr);
end if;
end Check_No_Space_After;
---------------------------
-- Check_No_Space_Before --
---------------------------
procedure Check_No_Space_Before is
begin
if Token_Ptr > First_Non_Blank_Location
and then Source (Token_Ptr - 1) <= ' '
then
Error_Space_Not_Allowed (Token_Ptr - 1);
end if;
end Check_No_Space_Before;
-----------------------
-- Check_Pragma_Name --
-----------------------
-- In check pragma casing mode (-gnatyp), pragma names must be mixed
-- case, i.e. start with an upper case letter, and otherwise lower case,
-- except after an underline character.
procedure Check_Pragma_Name is
begin
if Style_Check_Pragma_Casing then
if Determine_Token_Casing /= Mixed_Case then
Error_Msg_SC -- CODEFIX
("(style) bad capitalization, mixed case required");
end if;
end if;
end Check_Pragma_Name;
-----------------------
-- Check_Right_Paren --
-----------------------
-- In check token mode (-gnatyt), right paren must not be immediately
-- followed by an identifier character, and must never be preceded by
-- a space unless it is the initial non-blank character on the line.
procedure Check_Right_Paren is
begin
if Style_Check_Tokens then
if Identifier_Char (Source (Token_Ptr + 1)) then
Error_Space_Required (Token_Ptr + 1);
end if;
Check_No_Space_Before;
end if;
end Check_Right_Paren;
---------------------
-- Check_Semicolon --
---------------------
-- In check token mode (-gnatyt), semicolon does not permit a preceding
-- space and a following space is required.
procedure Check_Semicolon is
begin
if Style_Check_Tokens then
Check_No_Space_Before;
if Source (Scan_Ptr) > ' ' then
Error_Space_Required (Scan_Ptr);
end if;
end if;
end Check_Semicolon;
-------------------------------
-- Check_Separate_Stmt_Lines --
-------------------------------
procedure Check_Separate_Stmt_Lines is
begin
if Style_Check_Separate_Stmt_Lines then
Check_Separate_Stmt_Lines_Cont;
end if;
end Check_Separate_Stmt_Lines;
------------------------------------
-- Check_Separate_Stmt_Lines_Cont --
------------------------------------
procedure Check_Separate_Stmt_Lines_Cont is
S : Source_Ptr;
begin
-- Skip past white space
S := Scan_Ptr;
while Is_White_Space (Source (S)) loop
S := S + 1;
end loop;
-- Line terminator is OK
if Source (S) in Line_Terminator then
return;
-- Comment is OK
elsif Source (S) = '-' and then Source (S + 1) = '-' then
return;
-- ABORT keyword is OK after THEN (THEN ABORT case)
elsif Token = Tok_Then
and then (Source (S + 0) = 'a' or else Source (S + 0) = 'A')
and then (Source (S + 1) = 'b' or else Source (S + 1) = 'B')
and then (Source (S + 2) = 'o' or else Source (S + 2) = 'O')
and then (Source (S + 3) = 'r' or else Source (S + 3) = 'R')
and then (Source (S + 4) = 't' or else Source (S + 4) = 'T')
and then (Source (S + 5) in Line_Terminator
or else Is_White_Space (Source (S + 5)))
then
return;
-- PRAGMA keyword is OK after ELSE
elsif Token = Tok_Else
and then (Source (S + 0) = 'p' or else Source (S + 0) = 'P')
and then (Source (S + 1) = 'r' or else Source (S + 1) = 'R')
and then (Source (S + 2) = 'a' or else Source (S + 2) = 'A')
and then (Source (S + 3) = 'g' or else Source (S + 3) = 'G')
and then (Source (S + 4) = 'm' or else Source (S + 4) = 'M')
and then (Source (S + 5) = 'a' or else Source (S + 5) = 'A')
and then (Source (S + 6) in Line_Terminator
or else Is_White_Space (Source (S + 6)))
then
return;
-- Otherwise we have the style violation we are looking for
else
if Token = Tok_Then then
Error_Msg -- CODEFIX
("(style) no statements may follow THEN on same line", S);
else
Error_Msg
("(style) no statements may follow ELSE on same line", S);
end if;
end if;
end Check_Separate_Stmt_Lines_Cont;
----------------
-- Check_Then --
----------------
-- In check if then layout mode (-gnatyi), we expect a THEN keyword to
-- appear either on the same line as the IF, or on a separate line if
-- the IF statement extends for more than one line.
procedure Check_Then (If_Loc : Source_Ptr) is
begin
if Style_Check_If_Then_Layout then
declare
If_Line : constant Physical_Line_Number :=
Get_Physical_Line_Number (If_Loc);
Then_Line : constant Physical_Line_Number :=
Get_Physical_Line_Number (Token_Ptr);
begin
if If_Line = Then_Line then
null;
elsif Token_Ptr /= First_Non_Blank_Location then
Error_Msg_SC ("(style) misplaced THEN");
end if;
end;
end if;
end Check_Then;
-------------------------------
-- Check_Unary_Plus_Or_Minus --
-------------------------------
-- In check token mode (-gnatyt), unary plus or minus must not be
-- followed by a space.
-- Annoying exception: if we have the sequence =>+ within a Depends pragma
-- or aspect, then we insist on a space rather than forbidding it.
procedure Check_Unary_Plus_Or_Minus (Inside_Depends : Boolean := False) is
begin
if Style_Check_Tokens then
if not Inside_Depends then
Check_No_Space_After;
else
Require_Following_Space;
end if;
end if;
end Check_Unary_Plus_Or_Minus;
------------------------
-- Check_Vertical_Bar --
------------------------
-- In check token mode (-gnatyt), vertical bar must be surrounded by spaces
procedure Check_Vertical_Bar is
begin
if Style_Check_Tokens then
Require_Preceding_Space;
Require_Following_Space;
end if;
end Check_Vertical_Bar;
-----------------------
-- Check_Xtra_Parens --
-----------------------
procedure Check_Xtra_Parens (Loc : Source_Ptr) is
begin
if Style_Check_Xtra_Parens then
Error_Msg -- CODEFIX
("(style) redundant parentheses", Loc);
end if;
end Check_Xtra_Parens;
----------------------------
-- Determine_Token_Casing --
----------------------------
function Determine_Token_Casing return Casing_Type is
begin
return Determine_Casing (Source (Token_Ptr .. Scan_Ptr - 1));
end Determine_Token_Casing;
-----------------------------
-- Error_Space_Not_Allowed --
-----------------------------
procedure Error_Space_Not_Allowed (S : Source_Ptr) is
begin
Error_Msg -- CODEFIX
("(style) space not allowed", S);
end Error_Space_Not_Allowed;
--------------------------
-- Error_Space_Required --
--------------------------
procedure Error_Space_Required (S : Source_Ptr) is
begin
Error_Msg -- CODEFIX
("(style) space required", S);
end Error_Space_Required;
--------------------
-- Is_White_Space --
--------------------
function Is_White_Space (C : Character) return Boolean is
begin
return C = ' ' or else C = HT;
end Is_White_Space;
-------------------
-- Mode_In_Check --
-------------------
function Mode_In_Check return Boolean is
begin
return Style_Check and Style_Check_Mode_In;
end Mode_In_Check;
-----------------
-- No_End_Name --
-----------------
-- In check end/exit labels mode (-gnatye), always require the name of
-- a subprogram or package to be present on the END, so this is an error.
procedure No_End_Name (Name : Node_Id) is
begin
if Style_Check_End_Labels then
Error_Msg_Node_1 := Name;
Error_Msg_SP -- CODEFIX
("(style) `END &` required");
end if;
end No_End_Name;
------------------
-- No_Exit_Name --
------------------
-- In check end/exit labels mode (-gnatye), always require the name of
-- the loop to be present on the EXIT when exiting a named loop.
procedure No_Exit_Name (Name : Node_Id) is
begin
if Style_Check_End_Labels then
Error_Msg_Node_1 := Name;
Error_Msg_SP -- CODEFIX
("(style) `EXIT &` required");
end if;
end No_Exit_Name;
----------------------------
-- Non_Lower_Case_Keyword --
----------------------------
-- In check casing mode (-gnatyk), reserved keywords must be spelled
-- in all lower case (excluding keywords range, access, delta and digits
-- used as attribute designators).
procedure Non_Lower_Case_Keyword is
begin
if Style_Check_Keyword_Casing then
Error_Msg_SC -- CODEFIX
("(style) reserved words must be all lower case");
end if;
end Non_Lower_Case_Keyword;
-----------------------------
-- Require_Following_Space --
-----------------------------
procedure Require_Following_Space is
begin
if Source (Scan_Ptr) > ' ' then
Error_Space_Required (Scan_Ptr);
end if;
end Require_Following_Space;
-----------------------------
-- Require_Preceding_Space --
-----------------------------
procedure Require_Preceding_Space is
begin
if Token_Ptr > Source_First (Current_Source_File)
and then Source (Token_Ptr - 1) > ' '
then
Error_Space_Required (Token_Ptr);
end if;
end Require_Preceding_Space;
end Styleg;
| 31.073311 | 79 | 0.55274 |
41765a0b59eb368cc2b553143d08ffb0561ea60e | 3,620 | adb | Ada | src/formatter-get-format_real.adb | zenharris/ada-bbs | 6294bc29979289b40927011bdff6cedf62719ef8 | [
"Unlicense"
] | 2 | 2019-07-13T03:51:43.000Z | 2019-07-17T08:27:38.000Z | src/formatter-get-format_real.adb | zenharris/ada-bbs | 6294bc29979289b40927011bdff6cedf62719ef8 | [
"Unlicense"
] | null | null | null | src/formatter-get-format_real.adb | zenharris/ada-bbs | 6294bc29979289b40927011bdff6cedf62719ef8 | [
"Unlicense"
] | 2 | 2019-10-08T08:14:38.000Z | 2021-03-11T20:50:02.000Z | separate(Formatter.Get)
procedure Format_Real(Data : in Contents;
In_The_String : in out String;
Location : in out Natural;
Width : in Natural := 0;
Precision : in Natural := 0;
Exponent : in Natural := 0;
Fill_With_Zeros : in Boolean := False) is
-- ++
--
-- FUNCTIONAL DESCRIPTION:
--
-- Formats real number according to specified parameters.
--
-- FORMAL PARAMETERS:
--
-- Data:
-- The input real number in a variant record.
--
-- In_The_String:
-- The output string where the formatted real number is placed.
--
-- Location:
-- The position of the formatted real number in the output string.
--
-- Width:
-- The output formatted real number field width.
--
-- Precision:
-- The number of decimal positions.
--
-- Exponent:
-- The number of exponent positions.
--
-- Fill_With_Zeros:
-- Logical (Boolean) flag specifying the formatted real number is to be
-- padded with leading zeros.
--
-- DESIGN:
--
-- Format the real number directly into the output string using Float or
-- Double-Float IO Put procedure.
--
-- --
-- Local variable(s)
Field_Width : Natural;
begin
-- Determine output field width
if Width > 0 then
Field_Width := Width; -- Set to specified width
else
Field_Width := Get.Default_Width;
end if;
if Data.Class = Float_Type then -- Correct data type
-- Convert to string
FIO.Put(ITEM => Data.Float_Value,
AFT => Precision,
EXP => Exponent,
TO => In_The_String(Location..Location + Field_Width - 1));
if Left_Justify then
In_The_String(Location..Location + Field_Width - 1) :=
Get.Left_Justified(In_The_String(Location..Location + Field_Width-1));
end if;
if Fill_With_Zeros then
In_The_String(Location..Location + Field_Width - 1) :=
Get.Zero_Fill(In_The_String(Location..Location + Field_Width-1));
end if;
-- Update next output position
Location := Location + Field_Width;
elsif Data.Class = DP_Float_Type then -- Correct data type
-- Format directly to output string
DFIO.Put(ITEM => Data.DP_Float_Value,
AFT => Precision,
EXP => Exponent,
TO => In_The_String(Location..Location + Field_Width - 1));
if Left_Justify then
In_The_String(Location..Location + Field_Width - 1) :=
Get.Left_Justified(In_The_String(Location..Location + Field_Width-1));
end if;
if Fill_With_Zeros then
In_The_String(Location..Location + Field_Width - 1) :=
Get.Zero_Fill(In_The_String(Location..Location + Field_Width-1));
end if;
Location := Location + Field_Width;
else -- Not correct data type to convert
Format_Error(In_The_String, Location, Field_Width);
end if;
exception
when others =>
Format_Error(In_The_String, Location, Get.Default_Width);
end Format_Real;
| 31.754386 | 86 | 0.526796 |
41810406bdff185b312019ae4f3b2c9d9e1a2f74 | 53 | adb | Ada | puzzle_08/src/puzzle_08.adb | AdaForge/Advent_of_Code_2020 | ed8bde7eb2a21b6fba70988f8220a3facc12890f | [
"CC0-1.0"
] | null | null | null | puzzle_08/src/puzzle_08.adb | AdaForge/Advent_of_Code_2020 | ed8bde7eb2a21b6fba70988f8220a3facc12890f | [
"CC0-1.0"
] | null | null | null | puzzle_08/src/puzzle_08.adb | AdaForge/Advent_of_Code_2020 | ed8bde7eb2a21b6fba70988f8220a3facc12890f | [
"CC0-1.0"
] | null | null | null | procedure Puzzle_08 is
begin
null;
end Puzzle_08;
| 10.6 | 22 | 0.773585 |
2224c6c472c867be101d5709779f91c40b26c39b | 1,825 | ada | Ada | Task/XML-Output/Ada/xml-output-1.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:38.000Z | 2018-11-09T22:08:38.000Z | Task/XML-Output/Ada/xml-output-1.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/XML-Output/Ada/xml-output-1.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:40.000Z | 2018-11-09T22:08:40.000Z | with Ada.Strings.Unbounded;
with Ada.Text_IO.Text_Streams;
with DOM.Core.Documents;
with DOM.Core.Elements;
with DOM.Core.Nodes;
procedure Character_Remarks is
package DC renames DOM.Core;
package IO renames Ada.Text_IO;
package US renames Ada.Strings.Unbounded;
type Remarks is record
Name : US.Unbounded_String;
Text : US.Unbounded_String;
end record;
type Remark_List is array (Positive range <>) of Remarks;
My_Remarks : Remark_List :=
((US.To_Unbounded_String ("April"),
US.To_Unbounded_String ("Bubbly: I'm > Tam and <= Emily")),
(US.To_Unbounded_String ("Tam O'Shanter"),
US.To_Unbounded_String ("Burns: ""When chapman billies leave the street ...""")),
(US.To_Unbounded_String ("Emily"),
US.To_Unbounded_String ("Short & shrift")));
My_Implementation : DC.DOM_Implementation;
My_Document : DC.Document := DC.Create_Document (My_Implementation);
My_Root_Node : DC.Element := DC.Nodes.Append_Child (My_Document,
DC.Documents.Create_Element (My_Document, "CharacterRemarks"));
My_Element_Node : DC.Element;
My_Text_Node : DC.Text;
begin
for I in My_Remarks'Range loop
My_Element_Node := DC.Nodes.Append_Child (My_Root_Node,
DC.Documents.Create_Element (My_Document, "Character"));
DC.Elements.Set_Attribute (My_Element_Node, "Name", US.To_String (My_Remarks (I).Name));
My_Text_Node := DC.Nodes.Append_Child (My_Element_Node,
DC.Documents.Create_Text_Node (My_Document, US.To_String (My_Remarks (I).Text)));
end loop;
DC.Nodes.Write (IO.Text_Streams.Stream (IO.Standard_Output),
N => My_Document,
Pretty_Print => True);
end Character_Remarks;
| 44.512195 | 109 | 0.66137 |
58e40bab968d3618a031ed8e31e10b0a8edca7ba | 73,442 | adb | Ada | final-project/repositories/Deep_Learning_Inference_Accelerator_with_CNNIOT/MSOC_final-main/finalconv_hls/parallel_Cin/.autopilot/db/write_row_ifm.sched.adb | bol-edu/2020-fall-ntu | 5e009875dec5a3bbcebd1b3fae327990371d1b6a | [
"MIT"
] | 7 | 2021-02-10T17:59:48.000Z | 2021-09-27T15:02:56.000Z | final-project/repositories/Deep_Learning_Inference_Accelerator_with_CNNIOT/MSOC_final-main/finalconv_hls/parallel_Cin/.autopilot/db/write_row_ifm.sched.adb | bol-edu/2020-fall-ntu | 5e009875dec5a3bbcebd1b3fae327990371d1b6a | [
"MIT"
] | null | null | null | final-project/repositories/Deep_Learning_Inference_Accelerator_with_CNNIOT/MSOC_final-main/finalconv_hls/parallel_Cin/.autopilot/db/write_row_ifm.sched.adb | bol-edu/2020-fall-ntu | 5e009875dec5a3bbcebd1b3fae327990371d1b6a | [
"MIT"
] | 1 | 2022-03-22T01:46:01.000Z | 2022-03-22T01:46:01.000Z | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="15">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>write_row_ifm</name>
<ret_bitwidth>32</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>6</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>cifm</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>cifm</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>512</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>ifm_buff0_0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ifm_buff0[0]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>34</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>ifm_buff0_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ifm_buff0[1]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>34</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>ifm_buff0_2</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ifm_buff0[2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>34</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>cifm_counter_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>cifm_counter</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_6">
<Value>
<Obj>
<type>1</type>
<id>6</id>
<name>enable</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>enable</originalName>
<rtlName></rtlName>
<coreName></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>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>27</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>enable_read</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>77</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>D:\Course\mSOC\final</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>finalconv_Jan19.cpp</first>
<second>write_row_ifm</second>
</first>
<second>77</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>enable</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>46</item>
<item>47</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>cifm_counter_read_1</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>77</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>write_row_ifm</second>
</first>
<second>77</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>cifm_counter</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</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>0.00</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>_ln79</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>79</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>write_row_ifm</second>
</first>
<second>79</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>51</item>
<item>52</item>
<item>53</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.76</m_delay>
<m_topoIndex>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>add_ln82</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>write_row_ifm</second>
</first>
<second>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>54</item>
<item>56</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>2.55</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>_ln82</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>write_row_ifm</second>
</first>
<second>82</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>57</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.76</m_delay>
<m_topoIndex>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>j_0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>58</item>
<item>59</item>
<item>61</item>
<item>62</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>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>icmp_ln82</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>write_row_ifm</second>
</first>
<second>82</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>63</item>
<item>65</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.42</m_delay>
<m_topoIndex>7</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>j</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>write_row_ifm</second>
</first>
<second>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>66</item>
<item>68</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.82</m_delay>
<m_topoIndex>8</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>_ln82</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>write_row_ifm</second>
</first>
<second>82</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>69</item>
<item>70</item>
<item>71</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>9</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>cifm_read</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>85</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>write_row_ifm</second>
</first>
<second>85</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>512</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>73</item>
<item>74</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>10</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>trunc_ln85</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>85</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>write_row_ifm</second>
</first>
<second>85</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>11</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>bitcast_ln85</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>85</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>write_row_ifm</second>
</first>
<second>85</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>12</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>zext_ln85</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>85</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>write_row_ifm</second>
</first>
<second>85</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>77</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>13</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>ifm_buff0_0_addr</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>85</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>write_row_ifm</second>
</first>
<second>85</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>78</item>
<item>80</item>
<item>81</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>14</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>ifm_buff0_0_addr_write_ln85</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>85</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>write_row_ifm</second>
</first>
<second>85</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>82</item>
<item>83</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>3.25</m_delay>
<m_topoIndex>15</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>cifm_a1_load_new6</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>86</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>write_row_ifm</second>
</first>
<second>86</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>85</item>
<item>86</item>
<item>88</item>
<item>90</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>16</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>bitcast_ln86</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>86</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>write_row_ifm</second>
</first>
<second>86</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>91</item>
</oprand_edges>
<opcode>bitcast</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="_24">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>ifm_buff0_1_addr</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>86</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>write_row_ifm</second>
</first>
<second>86</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>92</item>
<item>93</item>
<item>94</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>18</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>ifm_buff0_1_addr_write_ln86</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>86</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>write_row_ifm</second>
</first>
<second>86</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>95</item>
<item>96</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>3.25</m_delay>
<m_topoIndex>19</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>cifm_a2_load_new</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>write_row_ifm</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>97</item>
<item>98</item>
<item>100</item>
<item>102</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>20</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>bitcast_ln87</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>write_row_ifm</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>103</item>
</oprand_edges>
<opcode>bitcast</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="_28">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>ifm_buff0_2_addr</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>write_row_ifm</second>
</first>
<second>87</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>104</item>
<item>105</item>
<item>106</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>22</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>ifm_buff0_2_addr_write_ln87</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>write_row_ifm</second>
</first>
<second>87</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>107</item>
<item>108</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>3.25</m_delay>
<m_topoIndex>23</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>_ln82</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>82</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>write_row_ifm</second>
</first>
<second>82</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>109</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>24</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>_ln0</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>110</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.76</m_delay>
<m_topoIndex>25</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>cifm_counter_1</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>77</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>write_row_ifm</second>
</first>
<second>77</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>111</item>
<item>112</item>
<item>113</item>
<item>114</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>26</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>_ln105</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>105</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>write_row_ifm</second>
</first>
<second>105</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>115</item>
</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>27</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_34">
<Value>
<Obj>
<type>2</type>
<id>55</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>34</content>
</item>
<item class_id_reference="16" object_id="_35">
<Value>
<Obj>
<type>2</type>
<id>60</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_36">
<Value>
<Obj>
<type>2</type>
<id>64</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>6</bitwidth>
</Value>
<const_type>0</const_type>
<content>34</content>
</item>
<item class_id_reference="16" object_id="_37">
<Value>
<Obj>
<type>2</type>
<id>67</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>6</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_38">
<Value>
<Obj>
<type>2</type>
<id>79</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="_39">
<Value>
<Obj>
<type>2</type>
<id>87</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>32</content>
</item>
<item class_id_reference="16" object_id="_40">
<Value>
<Obj>
<type>2</type>
<id>89</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>63</content>
</item>
<item class_id_reference="16" object_id="_41">
<Value>
<Obj>
<type>2</type>
<id>99</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>64</content>
</item>
<item class_id_reference="16" object_id="_42">
<Value>
<Obj>
<type>2</type>
<id>101</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>95</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_43">
<Obj>
<type>3</type>
<id>11</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>3</count>
<item_version>0</item_version>
<item>8</item>
<item>9</item>
<item>10</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_44">
<Obj>
<type>3</type>
<id>14</id>
<name>.preheader.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>12</item>
<item>13</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_45">
<Obj>
<type>3</type>
<id>20</id>
<name>.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>15</item>
<item>16</item>
<item>18</item>
<item>19</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_46">
<Obj>
<type>3</type>
<id>39</id>
<name>hls_label_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></coreName>
</Obj>
<node_objs>
<count>15</count>
<item_version>0</item_version>
<item>23</item>
<item>24</item>
<item>25</item>
<item>26</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>36</item>
<item>38</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_47">
<Obj>
<type>3</type>
<id>41</id>
<name>.loopexit.loopexit</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>40</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_48">
<Obj>
<type>3</type>
<id>44</id>
<name>.loopexit</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>42</item>
<item>43</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>60</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_49">
<id>47</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>8</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_50">
<id>50</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_51">
<id>51</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>10</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_52">
<id>52</id>
<edge_type>2</edge_type>
<source_obj>44</source_obj>
<sink_obj>10</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_53">
<id>53</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>10</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_54">
<id>54</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_55">
<id>56</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_56">
<id>57</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_57">
<id>58</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_58">
<id>59</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_59">
<id>61</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_60">
<id>62</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_61">
<id>63</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_62">
<id>65</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_63">
<id>66</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_64">
<id>68</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_65">
<id>69</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_66">
<id>70</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_67">
<id>71</id>
<edge_type>2</edge_type>
<source_obj>41</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_68">
<id>74</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_69">
<id>75</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="_70">
<id>76</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_71">
<id>77</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_72">
<id>78</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_73">
<id>80</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_74">
<id>81</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_75">
<id>82</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_76">
<id>83</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_77">
<id>86</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_78">
<id>88</id>
<edge_type>1</edge_type>
<source_obj>87</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_79">
<id>90</id>
<edge_type>1</edge_type>
<source_obj>89</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_80">
<id>91</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_81">
<id>92</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_82">
<id>93</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_83">
<id>94</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_84">
<id>95</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_85">
<id>96</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_86">
<id>98</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_87">
<id>100</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_88">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>101</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_89">
<id>103</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="_90">
<id>104</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="_91">
<id>105</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_92">
<id>106</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_93">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_94">
<id>108</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="_95">
<id>109</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_96">
<id>110</id>
<edge_type>2</edge_type>
<source_obj>44</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_97">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_98">
<id>112</id>
<edge_type>2</edge_type>
<source_obj>11</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_99">
<id>113</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_100">
<id>114</id>
<edge_type>2</edge_type>
<source_obj>41</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_101">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_102">
<id>165</id>
<edge_type>2</edge_type>
<source_obj>11</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_103">
<id>166</id>
<edge_type>2</edge_type>
<source_obj>11</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_104">
<id>167</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_105">
<id>168</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_106">
<id>169</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_107">
<id>170</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_108">
<id>171</id>
<edge_type>2</edge_type>
<source_obj>41</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_109">
<mId>1</mId>
<mTag>write_row_ifm</mTag>
<mType>0</mType>
<sub_regions>
<count>4</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
<item>5</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>1</mMinLatency>
<mMaxLatency>36</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_110">
<mId>2</mId>
<mTag>Entry</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>11</item>
<item>14</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_111">
<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>20</item>
<item>39</item>
</basic_blocks>
<mII>1</mII>
<mDepth>1</mDepth>
<mMinTripCount>34</mMinTripCount>
<mMaxTripCount>34</mMaxTripCount>
<mMinLatency>34</mMinLatency>
<mMaxLatency>34</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_112">
<mId>4</mId>
<mTag>Region 1</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_113">
<mId>5</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>44</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>27</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>8</first>
<second class_id="28" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="29" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="0" version="0">
<first>11</first>
<second class_id="31" 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>20</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="1" version="0" object_id="_114">
<region_name>Loop 1</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>20</item>
<item>39</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>1</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="34" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="35" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="36" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_reg_nodes>
<dp_regname_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core class_id="38" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 27.000735 | 70 | 0.605022 |
224175000d5c82407cc03981d653642e689bd15c | 5,081 | adb | Ada | test/test-test_suite.adb | simonjwright/Quaternions | 24ee177d826a9792e5a596570f03dbdadbe1d1b0 | [
"Apache-2.0"
] | 1 | 2020-12-09T17:32:30.000Z | 2020-12-09T17:32:30.000Z | test/test-test_suite.adb | simonjwright/Quaternions | 24ee177d826a9792e5a596570f03dbdadbe1d1b0 | [
"Apache-2.0"
] | null | null | null | test/test-test_suite.adb | simonjwright/Quaternions | 24ee177d826a9792e5a596570f03dbdadbe1d1b0 | [
"Apache-2.0"
] | null | null | null | with AUnit.Assertions; use AUnit.Assertions;
with AUnit.Test_Cases; use AUnit.Test_Cases;
package body Test.Test_Suite is
use Quaternions;
function Image (Q : Quaternion) return String
is ("("
& Q.W'Image
& ","
& Q.X'Image
& ","
& Q.Y'Image
& ","
& Q.Y'Image
& ")");
type Case_1 is new Test_Case with null record;
overriding
function Name (C : Case_1) return AUnit.Message_String
is (new String'("quaternions"));
overriding
procedure Register_Tests (C : in out Case_1);
function Suite return AUnit.Test_Suites.Access_Test_Suite
is
Result : constant AUnit.Test_Suites.Access_Test_Suite
:= new AUnit.Test_Suites.Test_Suite;
begin
pragma Warnings (Off, "use of an anonymous access type allocator");
AUnit.Test_Suites.Add_Test (Result, new Case_1);
pragma Warnings (On, "use of an anonymous access type allocator");
return Result;
end Suite;
procedure Unary_Minus (Dummy : in out AUnit.Test_Cases.Test_Case'Class);
procedure Addition (Dummy : in out AUnit.Test_Cases.Test_Case'Class);
procedure Subtraction (Dummy : in out AUnit.Test_Cases.Test_Case'Class);
procedure Multiplication (Dummy : in out AUnit.Test_Cases.Test_Case'Class);
procedure Division (Dummy : in out AUnit.Test_Cases.Test_Case'Class);
procedure Conjugate (Dummy : in out AUnit.Test_Cases.Test_Case'Class);
procedure Norm (Dummy : in out AUnit.Test_Cases.Test_Case'Class);
procedure Normalize (Dummy : in out AUnit.Test_Cases.Test_Case'Class);
procedure Register_Tests (C : in out Case_1)
is
begin
Registration.Register_Routine
(C,
Unary_Minus'Access,
"unary minus");
Registration.Register_Routine
(C,
Addition'Access,
"addition");
Registration.Register_Routine
(C,
Subtraction'Access,
"subtraction");
Registration.Register_Routine
(C,
Multiplication'Access,
"multiplication");
Registration.Register_Routine
(C,
Division'Access,
"division");
Registration.Register_Routine
(C,
Conjugate'Access,
"conjugate");
Registration.Register_Routine
(C,
Norm'Access,
"norm");
Registration.Register_Routine
(C,
Normalize'Access,
"normalize");
end Register_Tests;
procedure Unary_Minus (Dummy : in out AUnit.Test_Cases.Test_Case'Class)
is
Q1 : constant Quaternion := (1.0, 2.0, 3.0, 4.0);
Q2 : Quaternion;
begin
Q2 := -Q1;
Assert (Q2 = (-1.0, -2.0, -3.0, -4.0), "-q1");
end Unary_Minus;
procedure Addition (Dummy : in out AUnit.Test_Cases.Test_Case'Class)
is
Q1 : constant Quaternion := (1.0, 2.0, 3.0, 4.0);
Q2 : constant Quaternion := (-1.0, 0.0, -1.0, 0.0);
Q3 : Quaternion;
begin
Q3 := Q1 + Q2;
Assert (Q3 = (0.0, 2.0, 2.0, 4.0), "q1+q2");
end Addition;
procedure Subtraction (Dummy : in out AUnit.Test_Cases.Test_Case'Class)
is
Q1 : constant Quaternion := (1.0, 2.0, 3.0, 4.0);
Q2 : constant Quaternion := (-1.0, 0.0, -1.0, 0.0);
Q3 : Quaternion;
begin
Q3 := Q1 - Q2;
Assert (Q3 = (2.0, 2.0, 4.0, 4.0), "q1-q2");
end Subtraction;
procedure Multiplication (Dummy : in out AUnit.Test_Cases.Test_Case'Class)
is
Q1 : constant Quaternion := (1.0, 2.0, 3.0, 4.0);
Q2 : Quaternion;
Q3 : Quaternion;
begin
Q2 := Q1 * 2.0;
Assert (Q2 = (2.0, 4.0, 6.0, 8.0), "q1*r");
Q3 := 3.0 * Q1;
Assert (Q3 = (3.0, 6.0, 9.0, 12.0), "r*q1");
Q3 := Q1 * Q2;
pragma Style_Checks (Off); -- line length > 79
-- From https://www.euclideanspace.com/maths/algebra/realNormedAlgebra/other/dualQuaternion/calculator/index.htm
pragma Style_Checks (On);
Assert (Q3 = (-56.0, 8.0, 12.0, 16.0), "q1*q2" & ", got " & Image (Q3));
end Multiplication;
procedure Division (Dummy : in out AUnit.Test_Cases.Test_Case'Class)
is
Q1 : constant Quaternion := (1.0, 2.0, 3.0, 4.0);
Q2 : Quaternion;
begin
Q2 := Q1 / 2.0;
Assert (Q2 = (0.5, 1.0, 1.5, 2.0), "q1/r");
end Division;
procedure Conjugate (Dummy : in out AUnit.Test_Cases.Test_Case'Class)
is
Q1 : constant Quaternion := (1.0, 2.0, 3.0, 4.0);
Q2 : Quaternion;
begin
Q2 := Conjugate (Q1);
Assert (Q2 = (1.0, -2.0, -3.0, -4.0), "conjugate(q1)");
end Conjugate;
procedure Norm (Dummy : in out AUnit.Test_Cases.Test_Case'Class)
is
Q1 : constant Quaternion := (3.0, 0.0, 0.0, 4.0);
R : Float;
begin
R := Norm (Q1);
Assert (R = 5.0, "norm(q1)");
end Norm;
procedure Normalize (Dummy : in out AUnit.Test_Cases.Test_Case'Class)
is
Q1 : constant Quaternion := (3.0, 0.0, 0.0, 4.0);
Q2 : Quaternion;
begin
Q2 := Normalize (Q1);
Assert (Q2 = (0.6, 0.0, 0.0, 0.8), "normalize(q1)");
end Normalize;
end Test.Test_Suite;
| 30.608434 | 119 | 0.596536 |
c70a9a52aaabbf2463aafd3b4fb035b236145062 | 483 | ads | Ada | src/sparknacl-scalar.ads | yannickmoy/SPARKNaCl | c27fa811bf38b3706c1dc242f30e82967ad8f1c6 | [
"BSD-2-Clause"
] | 76 | 2020-02-24T20:30:15.000Z | 2022-02-16T15:10:56.000Z | src/sparknacl-scalar.ads | yannickmoy/SPARKNaCl | c27fa811bf38b3706c1dc242f30e82967ad8f1c6 | [
"BSD-2-Clause"
] | 10 | 2020-04-15T10:02:49.000Z | 2022-02-24T20:10:46.000Z | src/sparknacl-scalar.ads | yannickmoy/SPARKNaCl | c27fa811bf38b3706c1dc242f30e82967ad8f1c6 | [
"BSD-2-Clause"
] | 4 | 2020-03-10T15:19:45.000Z | 2022-02-17T09:46:20.000Z | package SPARKNaCl.Scalar
with Pure,
SPARK_Mode => On
is
--------------------------------------------------------
-- Scalar multiplication
--------------------------------------------------------
function Mult (N : in Bytes_32;
P : in Bytes_32) return Bytes_32
with Global => null,
Pure_Function;
function Mult_Base (N : in Bytes_32) return Bytes_32
with Global => null,
Pure_Function;
end SPARKNaCl.Scalar;
| 25.421053 | 59 | 0.467909 |
3dfb99bd660f4b8ad1bbe9dc177a72ebb79cc7d6 | 11,182 | ads | Ada | day07/src/bag.ads | jwarwick/aoc_2020 | b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377 | [
"MIT"
] | 3 | 2020-12-26T23:44:33.000Z | 2021-12-06T16:00:54.000Z | day07/src/bag.ads | jwarwick/aoc_2020 | b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377 | [
"MIT"
] | null | null | null | day07/src/bag.ads | jwarwick/aoc_2020 | b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377 | [
"MIT"
] | null | null | null | with Ada.Containers; use Ada.Containers;
with Ada.Containers.Ordered_Sets;
with Ada.Containers.Indefinite_Ordered_Maps;
package Bag is
type Bag_Color is (
bright_gray,
pale_olive,
mirrored_magenta,
shiny_blue,
dotted_beige,
drab_tomato,
drab_blue,
striped_beige,
dull_gold,
wavy_red,
pale_white,
bright_orange,
plaid_yellow,
clear_red,
light_tomato,
pale_yellow,
shiny_red,
bright_maroon,
dark_crimson,
pale_red,
shiny_lavender,
dotted_blue,
bright_lime,
bright_lavender,
faded_purple,
pale_aqua,
wavy_cyan,
dull_maroon,
muted_fuchsia,
clear_salmon,
drab_maroon,
posh_blue,
shiny_gold,
light_lavender,
pale_violet,
bright_gold,
wavy_maroon,
wavy_salmon,
vibrant_orange,
vibrant_green,
striped_tan,
wavy_silver,
pale_beige,
mirrored_brown,
faded_green,
posh_red,
wavy_turquoise,
drab_indigo,
shiny_black,
wavy_fuchsia,
clear_teal,
posh_tan,
plaid_lime,
vibrant_tomato,
dull_crimson,
dotted_salmon,
striped_orange,
vibrant_bronze,
posh_black,
dim_gray,
pale_chartreuse,
wavy_green,
striped_red,
muted_black,
vibrant_gray,
dotted_plum,
mirrored_salmon,
mirrored_orange,
dark_gold,
muted_orange,
posh_aqua,
dotted_lime,
drab_lime,
bright_blue,
light_orange,
dark_chartreuse,
clear_gray,
vibrant_lime,
light_black,
clear_gold,
light_aqua,
mirrored_tan,
faded_tomato,
drab_chartreuse,
striped_tomato,
clear_white,
shiny_plum,
plaid_violet,
dotted_magenta,
mirrored_cyan,
muted_teal,
striped_maroon,
mirrored_turquoise,
shiny_silver,
striped_green,
striped_silver,
wavy_olive,
clear_brown,
bright_turquoise,
muted_tan,
dull_green,
drab_yellow,
plaid_aqua,
vibrant_chartreuse,
light_chartreuse,
vibrant_tan,
posh_turquoise,
dotted_fuchsia,
dark_turquoise,
dotted_chartreuse,
light_lime,
mirrored_teal,
vibrant_turquoise,
clear_blue,
striped_blue,
muted_silver,
dotted_indigo,
vibrant_teal,
striped_chartreuse,
dotted_violet,
light_brown,
posh_indigo,
drab_violet,
plaid_plum,
dotted_orange,
dotted_teal,
vibrant_brown,
clear_orange,
bright_magenta,
clear_tan,
dotted_brown,
vibrant_plum,
light_indigo,
bright_chartreuse,
clear_turquoise,
dim_crimson,
pale_tan,
plaid_gold,
striped_crimson,
clear_lavender,
dark_maroon,
drab_gray,
faded_olive,
muted_gray,
posh_violet,
shiny_white,
mirrored_indigo,
dark_brown,
muted_tomato,
striped_black,
shiny_crimson,
bright_coral,
dark_yellow,
faded_beige,
wavy_magenta,
wavy_bronze,
dim_lavender,
dim_indigo,
posh_green,
pale_gray,
mirrored_gold,
striped_white,
drab_cyan,
vibrant_aqua,
light_gold,
dotted_yellow,
vibrant_cyan,
posh_yellow,
faded_salmon,
bright_purple,
dotted_purple,
plaid_red,
vibrant_maroon,
clear_crimson,
clear_cyan,
vibrant_salmon,
striped_olive,
dim_turquoise,
bright_brown,
mirrored_tomato,
dark_green,
wavy_white,
shiny_green,
dotted_aqua,
shiny_aqua,
dark_lavender,
dull_violet,
drab_tan,
plaid_turquoise,
pale_lavender,
clear_indigo,
wavy_purple,
shiny_salmon,
mirrored_crimson,
plaid_chartreuse,
pale_orange,
dark_cyan,
dim_brown,
pale_blue,
vibrant_red,
dark_salmon,
bright_black,
vibrant_white,
muted_violet,
wavy_coral,
striped_salmon,
faded_blue,
dim_violet,
faded_chartreuse,
posh_silver,
dim_red,
dull_lime,
striped_fuchsia,
vibrant_lavender,
dark_gray,
drab_lavender,
mirrored_white,
bright_aqua,
dark_silver,
drab_fuchsia,
bright_teal,
striped_indigo,
dark_white,
mirrored_maroon,
wavy_tan,
wavy_lime,
dark_plum,
posh_cyan,
pale_crimson,
clear_yellow,
striped_yellow,
clear_silver,
drab_red,
dotted_turquoise,
striped_purple,
striped_gray,
clear_purple,
light_gray,
dull_tan,
muted_blue,
dull_brown,
bright_fuchsia,
plaid_purple,
drab_silver,
light_salmon,
drab_beige,
posh_beige,
muted_cyan,
dull_magenta,
shiny_cyan,
mirrored_gray,
bright_cyan,
dotted_crimson,
dim_chartreuse,
muted_crimson,
dim_aqua,
wavy_aqua,
bright_beige,
posh_purple,
shiny_fuchsia,
wavy_beige,
wavy_crimson,
pale_tomato,
bright_silver,
mirrored_chartreuse,
mirrored_aqua,
wavy_brown,
dull_purple,
pale_turquoise,
dull_lavender,
dull_aqua,
clear_maroon,
wavy_lavender,
dull_blue,
shiny_olive,
shiny_teal,
dull_teal,
dim_bronze,
muted_bronze,
vibrant_violet,
dull_turquoise,
pale_purple,
drab_aqua,
mirrored_beige,
pale_plum,
dotted_maroon,
muted_olive,
wavy_yellow,
plaid_salmon,
faded_indigo,
pale_brown,
clear_olive,
vibrant_gold,
dark_indigo,
drab_gold,
light_bronze,
vibrant_black,
wavy_tomato,
wavy_orange,
dark_blue,
drab_magenta,
posh_crimson,
mirrored_coral,
faded_crimson,
dotted_tan,
faded_magenta,
light_maroon,
dull_chartreuse,
plaid_white,
plaid_fuchsia,
dark_red,
dark_fuchsia,
dull_plum,
vibrant_crimson,
clear_magenta,
dull_indigo,
vibrant_olive,
striped_lavender,
clear_lime,
faded_orange,
posh_lime,
posh_olive,
dim_yellow,
muted_red,
pale_salmon,
light_beige,
clear_tomato,
shiny_gray,
vibrant_fuchsia,
shiny_violet,
plaid_silver,
light_white,
posh_magenta,
muted_maroon,
light_blue,
pale_teal,
posh_gold,
shiny_indigo,
wavy_teal,
striped_cyan,
pale_black,
light_green,
mirrored_green,
dim_orange,
clear_chartreuse,
dull_black,
dotted_tomato,
faded_maroon,
plaid_cyan,
dark_bronze,
vibrant_purple,
dotted_silver,
mirrored_yellow,
dim_lime,
faded_tan,
drab_plum,
plaid_lavender,
dark_beige,
dotted_red,
dull_orange,
striped_bronze,
wavy_indigo,
light_cyan,
plaid_orange,
faded_turquoise,
shiny_orange,
light_tan,
pale_coral,
faded_lavender,
dull_cyan,
shiny_turquoise,
faded_violet,
mirrored_bronze,
dull_tomato,
faded_red,
dark_magenta,
light_turquoise,
clear_green,
clear_coral,
dotted_bronze,
drab_salmon,
faded_aqua,
bright_violet,
mirrored_silver,
posh_maroon,
striped_brown,
bright_olive,
drab_white,
faded_teal,
striped_plum,
dark_coral,
drab_orange,
bright_tan,
drab_brown,
posh_bronze,
mirrored_purple,
wavy_blue,
dim_cyan,
plaid_olive,
dark_orange,
drab_olive,
pale_fuchsia,
shiny_chartreuse,
shiny_brown,
striped_turquoise,
dull_gray,
wavy_chartreuse,
bright_green,
dark_olive,
dark_black,
dim_purple,
pale_gold,
pale_maroon,
light_plum,
mirrored_plum,
dim_coral,
faded_silver,
posh_salmon,
shiny_purple,
shiny_maroon,
clear_beige,
muted_plum,
plaid_green,
faded_white,
plaid_gray,
shiny_yellow,
mirrored_violet,
plaid_beige,
plaid_black,
mirrored_fuchsia,
pale_indigo,
light_magenta,
striped_teal,
dark_aqua,
bright_red,
dim_teal,
drab_crimson,
dim_silver,
drab_bronze,
drab_teal,
dark_teal,
vibrant_indigo,
mirrored_black,
dotted_gray,
posh_plum,
drab_black,
faded_gray,
muted_white,
wavy_gray,
plaid_magenta,
muted_coral,
plaid_tomato,
dark_lime,
vibrant_coral,
drab_turquoise,
mirrored_red,
plaid_brown,
striped_gold,
drab_purple,
posh_chartreuse,
clear_violet,
striped_magenta,
muted_salmon,
pale_silver,
striped_lime,
dull_silver,
dark_violet,
dim_black,
shiny_beige,
plaid_tan,
faded_yellow,
vibrant_blue,
mirrored_lime,
dull_white,
dim_tomato,
pale_cyan,
light_fuchsia,
posh_gray,
faded_cyan,
plaid_bronze,
dim_olive,
faded_coral,
pale_lime,
dim_white,
muted_turquoise,
clear_bronze,
bright_plum,
posh_orange,
muted_chartreuse,
shiny_bronze,
shiny_coral,
posh_lavender,
clear_fuchsia,
bright_tomato,
light_yellow,
pale_magenta,
bright_bronze,
faded_bronze,
plaid_coral,
dull_coral,
muted_purple,
light_silver,
muted_aqua,
posh_white,
dotted_olive,
muted_lime,
vibrant_magenta,
dotted_coral,
drab_green,
vibrant_silver,
dull_bronze,
striped_coral,
dim_blue,
mirrored_olive,
bright_salmon,
bright_crimson,
vibrant_yellow,
plaid_indigo,
bright_indigo,
clear_aqua,
posh_tomato,
dim_tan,
dim_plum,
posh_teal,
muted_indigo,
dull_beige,
dotted_cyan,
faded_fuchsia,
pale_bronze,
dim_beige,
muted_beige,
dotted_lavender,
pale_green,
drab_coral,
wavy_plum,
dotted_green,
light_violet,
faded_gold,
muted_magenta,
light_red,
dim_maroon,
dull_fuchsia,
wavy_gold,
light_coral,
dark_tan,
faded_plum,
wavy_black,
wavy_violet,
light_teal,
posh_fuchsia,
striped_violet,
plaid_crimson,
light_olive,
dim_magenta,
striped_aqua,
dotted_white,
faded_black,
dotted_black,
dotted_gold,
dark_tomato,
shiny_tan,
muted_gold,
dim_gold,
dull_yellow,
bright_white,
light_purple,
shiny_magenta,
faded_brown,
posh_coral,
dim_green,
dull_red,
clear_plum,
mirrored_lavender,
dim_salmon,
plaid_maroon,
dim_fuchsia,
dull_olive,
muted_brown,
muted_lavender,
faded_lime,
muted_yellow,
dark_purple,
light_crimson,
muted_green,
vibrant_beige,
shiny_tomato,
bright_yellow,
clear_black,
posh_brown,
shiny_lime,
mirrored_blue,
dull_salmon,
plaid_teal,
plaid_blue);
my_color : Bag_Color := shiny_gold;
type Bag_Combo is record
Color : Bag_Color;
Count : Natural := 0;
end record;
function "<" (Left, Right : Bag_Combo) return Boolean;
package Bag_Sets is new Ada.Containers.Ordered_Sets
(Element_Type => Bag_Combo);
use Bag_Sets;
package Bag_Maps is new Ada.Containers.Indefinite_Ordered_Maps
(Key_Type => Bag_Color,
Element_Type => Bag_Sets.Set);
use Bag_Maps;
function test_data return Bag_Maps.Map;
function input_data return Bag_Maps.Map;
function parse_rules(f : in String) return Bag_Maps.Map;
end Bag;
| 17.834131 | 64 | 0.662762 |
3d6a3c14a86b4cb826b625e8eedda692ab3cec7e | 235 | ads | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/opt42.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/opt42.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/opt42.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | package Opt42 is
type Index_Type is range 1 .. 7;
type Row_Type is array (Index_Type) of Float;
type Array_Type is array (Index_Type) of Row_Type;
function "*" (Left, Right : in Array_Type) return Array_Type;
end Opt42;
| 23.5 | 64 | 0.710638 |
c7167abd51bd72c66b854a873e43cd2989d40acf | 4,664 | ads | Ada | regtests/server/src/model/testapi-models.ads | mgrojo/swagger-ada | ba592a8c9cd76304bef8f1d48738069b8c73b4a6 | [
"Apache-2.0"
] | null | null | null | regtests/server/src/model/testapi-models.ads | mgrojo/swagger-ada | ba592a8c9cd76304bef8f1d48738069b8c73b4a6 | [
"Apache-2.0"
] | null | null | null | regtests/server/src/model/testapi-models.ads | mgrojo/swagger-ada | ba592a8c9cd76304bef8f1d48738069b8c73b4a6 | [
"Apache-2.0"
] | null | null | null | -- REST API Validation
-- API to validate
--
-- The version of the OpenAPI document: 1.0.0
-- Contact: [email protected]
--
-- NOTE: This package is auto generated by OpenAPI-Generator 6.0.0-SNAPSHOT.
-- https://openapi-generator.tech
-- Do not edit the class manually.
with Swagger.Streams;
with Ada.Containers.Vectors;
package TestAPI.Models is
pragma Style_Checks ("-mr");
type StringsMap_Type is
record
Key : Swagger.Nullable_UString;
end record;
package StringsMap_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => StringsMap_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in StringsMap_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in StringsMap_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out StringsMap_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out StringsMap_Type_Vectors.Vector);
type InlineObject3_Type is
record
Requested_Qo_S : TestAPI.Models.StringsMap_Type;
Commands : TestAPI.Models.StringsMap_Type;
end record;
package InlineObject3_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => InlineObject3_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in InlineObject3_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in InlineObject3_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out InlineObject3_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out InlineObject3_Type_Vectors.Vector);
-- ------------------------------
-- Information about a ticket
-- ------------------------------
type Ticket_Type is
record
Id : Swagger.Long;
Title : Swagger.UString;
Description : Swagger.UString;
Owner : Swagger.Nullable_UString;
Create_Date : Swagger.Datetime;
End_Date : Swagger.Nullable_Date;
Update_Date : Swagger.Nullable_Date;
Status : Swagger.UString;
end record;
package Ticket_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => Ticket_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in Ticket_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in Ticket_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out Ticket_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out Ticket_Type_Vectors.Vector);
type Options_Type is
record
A : Swagger.UString_Vectors.Vector;
end record;
package Options_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => Options_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in Options_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in Options_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out Options_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out Options_Type_Vectors.Vector);
end TestAPI.Models;
| 33.314286 | 77 | 0.566681 |
220b03e45a185ea7d5b7f7ba3f0b42c27485629c | 2,156 | ads | Ada | 1A/S5/PIM/tps/tp4/stocks_materiel.ads | MOUDDENEHamza/ENSEEIHT | a90b1dee0c8d18a9578153a357278d99405bb534 | [
"Apache-2.0"
] | 4 | 2020-05-02T12:32:32.000Z | 2022-01-12T20:20:35.000Z | 1A/S5/PIM/tps/tp4/stocks_materiel.ads | MOUDDENEHamza/ENSEEIHT | a90b1dee0c8d18a9578153a357278d99405bb534 | [
"Apache-2.0"
] | 2 | 2021-01-14T20:03:26.000Z | 2022-01-30T01:10:00.000Z | 1A/S5/PIM/tps/tp4/stocks_materiel.ads | MOUDDENEHamza/ENSEEIHT | a90b1dee0c8d18a9578153a357278d99405bb534 | [
"Apache-2.0"
] | 13 | 2020-11-11T21:28:11.000Z | 2022-02-19T13:54:22.000Z |
-- Auteur: MOUDDENE Hamza.
-- Gérer un stock de matériel informatique.
package Stocks_Materiel is
CAPACITE : constant Integer := 10; -- nombre maximum de matériels dans un stock
type T_Nature is (UNITE_CENTRALE, DISQUE, ECRAN, CLAVIER, IMPRIMANTE);
type T_Materiel is array(1..CAPACITE) of Integer;
type T_Stock is limited private;
-- Créer un stock vide.
--
-- paramètres
-- Stock : le stock à créer
--
-- Assure
-- Nb_Materiels (Stock) = 0
--
procedure Creer (Stock : out T_Stock) with
Post => Nb_Materiels (Stock) = 0;
-- Obtenir le nombre de matériels dans le stock Stock
--
-- Paramètres
-- Stock : le stock dont ont veut obtenir la taille
--
-- Nécessite
-- Vrai
--
-- Assure
-- Résultat >= 0 Et Résultat <= CAPACITE
--
function Nb_Materiels (Stock: in T_Stock) return Integer with
Post => Nb_Materiels'Result >= 0 and Nb_Materiels'Result <= CAPACITE;
-- Enregistrer un nouveau métériel dans le stock. Il est en
-- fonctionnement. Le stock ne doit pas être plein.
--
-- Paramètres
-- Stock : le stock à compléter
-- Numero_Serie : le numéro de série du nouveau matériel
-- Nature : la nature du nouveau matériel
-- Annee_Achat : l'année d'achat du nouveau matériel
--
-- Nécessite
-- Nb_Materiels (Stock) < CAPACITE
--
-- Assure
-- Nouveau matériel ajouté
-- Nb_Materiels (Stock) = Nb_Materiels (Stock)'Avant + 1
procedure Enregistrer (
Stock : in out T_Stock;
Numero_Serie : in Integer;
Nature : in T_Nature;
Annee_Achat : in Integer
) with
Pre => Nb_Materiels (Stock) < CAPACITE,
Post => Nb_Materiels (Stock) = Nb_Materiels (Stock)'Old + 1;
limited private
type T_Stock is record
Materiel : T_Materiel;
N_Item : Integer;
-- Invariant
-- Stock
-- 0 <= N_item <= CAPACITY
end record;
end Stocks_Materiel;
| 27.291139 | 88 | 0.576067 |
22608c17c650230f836a36a78cad8b44914bc917 | 126,397 | adb | Ada | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/a-coinve.adb | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/a-coinve.adb | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/a-coinve.adb | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- A D A . C O N T A I N E R S . I N D E F I N I T E _ V E C T O R S --
-- --
-- B o d y --
-- --
-- Copyright (C) 2004-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/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
with Ada.Containers.Generic_Array_Sort;
with Ada.Unchecked_Deallocation;
with System; use type System.Address;
package body Ada.Containers.Indefinite_Vectors is
pragma Warnings (Off, "variable ""Busy*"" is not referenced");
pragma Warnings (Off, "variable ""Lock*"" is not referenced");
-- See comment in Ada.Containers.Helpers
procedure Free is
new Ada.Unchecked_Deallocation (Elements_Type, Elements_Access);
procedure Free is
new Ada.Unchecked_Deallocation (Element_Type, Element_Access);
procedure Append_Slow_Path
(Container : in out Vector;
New_Item : Element_Type;
Count : Count_Type);
-- This is the slow path for Append. This is split out to minimize the size
-- of Append, because we have Inline (Append).
---------
-- "&" --
---------
-- We decide that the capacity of the result of "&" is the minimum needed
-- -- the sum of the lengths of the vector parameters. We could decide to
-- make it larger, but we have no basis for knowing how much larger, so we
-- just allocate the minimum amount of storage.
function "&" (Left, Right : Vector) return Vector is
begin
return Result : Vector do
Reserve_Capacity (Result, Length (Left) + Length (Right));
Append (Result, Left);
Append (Result, Right);
end return;
end "&";
function "&" (Left : Vector; Right : Element_Type) return Vector is
begin
return Result : Vector do
Reserve_Capacity (Result, Length (Left) + 1);
Append (Result, Left);
Append (Result, Right);
end return;
end "&";
function "&" (Left : Element_Type; Right : Vector) return Vector is
begin
return Result : Vector do
Reserve_Capacity (Result, 1 + Length (Right));
Append (Result, Left);
Append (Result, Right);
end return;
end "&";
function "&" (Left, Right : Element_Type) return Vector is
begin
return Result : Vector do
Reserve_Capacity (Result, 1 + 1);
Append (Result, Left);
Append (Result, Right);
end return;
end "&";
---------
-- "=" --
---------
overriding function "=" (Left, Right : Vector) return Boolean is
begin
if Left.Last /= Right.Last then
return False;
end if;
if Left.Length = 0 then
return True;
end if;
declare
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
Lock_Left : With_Lock (Left.TC'Unrestricted_Access);
Lock_Right : With_Lock (Right.TC'Unrestricted_Access);
begin
for J in Index_Type range Index_Type'First .. Left.Last loop
if Left.Elements.EA (J) = null then
if Right.Elements.EA (J) /= null then
return False;
end if;
elsif Right.Elements.EA (J) = null then
return False;
elsif Left.Elements.EA (J).all /= Right.Elements.EA (J).all then
return False;
end if;
end loop;
end;
return True;
end "=";
------------
-- Adjust --
------------
procedure Adjust (Container : in out Vector) is
begin
-- If the counts are nonzero, execution is technically erroneous, but
-- it seems friendly to allow things like concurrent "=" on shared
-- constants.
Zero_Counts (Container.TC);
if Container.Last = No_Index then
Container.Elements := null;
return;
end if;
declare
L : constant Index_Type := Container.Last;
E : Elements_Array renames
Container.Elements.EA (Index_Type'First .. L);
begin
Container.Elements := null;
Container.Last := No_Index;
Container.Elements := new Elements_Type (L);
for J in E'Range loop
if E (J) /= null then
Container.Elements.EA (J) := new Element_Type'(E (J).all);
end if;
Container.Last := J;
end loop;
end;
end Adjust;
------------
-- Append --
------------
procedure Append (Container : in out Vector; New_Item : Vector) is
begin
if Is_Empty (New_Item) then
return;
elsif Checks and then Container.Last = Index_Type'Last then
raise Constraint_Error with "vector is already at its maximum length";
else
Insert (Container, Container.Last + 1, New_Item);
end if;
end Append;
procedure Append
(Container : in out Vector;
New_Item : Element_Type;
Count : Count_Type := 1)
is
begin
-- In the general case, we pass the buck to Insert, but for efficiency,
-- we check for the usual case where Count = 1 and the vector has enough
-- room for at least one more element.
if Count = 1
and then Container.Elements /= null
and then Container.Last /= Container.Elements.Last
then
TC_Check (Container.TC);
-- Increment Container.Last after assigning the New_Item, so we
-- leave the Container unmodified in case Finalize/Adjust raises
-- an exception.
declare
New_Last : constant Index_Type := Container.Last + 1;
-- The element allocator may need an accessibility check in the
-- case actual type is class-wide or has access discriminants
-- (see RM 4.8(10.1) and AI12-0035).
pragma Unsuppress (Accessibility_Check);
begin
Container.Elements.EA (New_Last) := new Element_Type'(New_Item);
Container.Last := New_Last;
end;
else
Append_Slow_Path (Container, New_Item, Count);
end if;
end Append;
----------------------
-- Append_Slow_Path --
----------------------
procedure Append_Slow_Path
(Container : in out Vector;
New_Item : Element_Type;
Count : Count_Type)
is
begin
if Count = 0 then
return;
elsif Checks and then Container.Last = Index_Type'Last then
raise Constraint_Error with "vector is already at its maximum length";
else
Insert (Container, Container.Last + 1, New_Item, Count);
end if;
end Append_Slow_Path;
------------
-- Assign --
------------
procedure Assign (Target : in out Vector; Source : Vector) is
begin
if Target'Address = Source'Address then
return;
else
Target.Clear;
Target.Append (Source);
end if;
end Assign;
--------------
-- Capacity --
--------------
function Capacity (Container : Vector) return Count_Type is
begin
if Container.Elements = null then
return 0;
else
return Container.Elements.EA'Length;
end if;
end Capacity;
-----------
-- Clear --
-----------
procedure Clear (Container : in out Vector) is
begin
TC_Check (Container.TC);
while Container.Last >= Index_Type'First loop
declare
X : Element_Access := Container.Elements.EA (Container.Last);
begin
Container.Elements.EA (Container.Last) := null;
Container.Last := Container.Last - 1;
Free (X);
end;
end loop;
end Clear;
------------------------
-- Constant_Reference --
------------------------
function Constant_Reference
(Container : aliased Vector;
Position : Cursor) return Constant_Reference_Type
is
begin
if Checks then
if Position.Container = null then
raise Constraint_Error with "Position cursor has no element";
end if;
if Position.Container /= Container'Unrestricted_Access then
raise Program_Error with "Position cursor denotes wrong container";
end if;
if Position.Index > Position.Container.Last then
raise Constraint_Error with "Position cursor is out of range";
end if;
end if;
declare
TC : constant Tamper_Counts_Access :=
Container.TC'Unrestricted_Access;
begin
-- The following will raise Constraint_Error if Element is null
return R : constant Constant_Reference_Type :=
(Element => Container.Elements.EA (Position.Index),
Control => (Controlled with TC))
do
Lock (TC.all);
end return;
end;
end Constant_Reference;
function Constant_Reference
(Container : aliased Vector;
Index : Index_Type) return Constant_Reference_Type
is
begin
if Checks and then Index > Container.Last then
raise Constraint_Error with "Index is out of range";
end if;
declare
TC : constant Tamper_Counts_Access :=
Container.TC'Unrestricted_Access;
begin
-- The following will raise Constraint_Error if Element is null
return R : constant Constant_Reference_Type :=
(Element => Container.Elements.EA (Index),
Control => (Controlled with TC))
do
Lock (TC.all);
end return;
end;
end Constant_Reference;
--------------
-- Contains --
--------------
function Contains
(Container : Vector;
Item : Element_Type) return Boolean
is
begin
return Find_Index (Container, Item) /= No_Index;
end Contains;
----------
-- Copy --
----------
function Copy
(Source : Vector;
Capacity : Count_Type := 0) return Vector
is
C : Count_Type;
begin
if Capacity < Source.Length then
if Checks and then Capacity /= 0 then
raise Capacity_Error
with "Requested capacity is less than Source length";
end if;
C := Source.Length;
else
C := Capacity;
end if;
return Target : Vector do
Target.Reserve_Capacity (C);
Target.Assign (Source);
end return;
end Copy;
------------
-- Delete --
------------
procedure Delete
(Container : in out Vector;
Index : Extended_Index;
Count : Count_Type := 1)
is
Old_Last : constant Index_Type'Base := Container.Last;
New_Last : Index_Type'Base;
Count2 : Count_Type'Base; -- count of items from Index to Old_Last
J : Index_Type'Base; -- first index of items that slide down
begin
-- Delete removes items from the vector, the number of which is the
-- minimum of the specified Count and the items (if any) that exist from
-- Index to Container.Last. There are no constraints on the specified
-- value of Count (it can be larger than what's available at this
-- position in the vector, for example), but there are constraints on
-- the allowed values of the Index.
-- As a precondition on the generic actual Index_Type, the base type
-- must include Index_Type'Pred (Index_Type'First); this is the value
-- that Container.Last assumes when the vector is empty. However, we do
-- not allow that as the value for Index when specifying which items
-- should be deleted, so we must manually check. (That the user is
-- allowed to specify the value at all here is a consequence of the
-- declaration of the Extended_Index subtype, which includes the values
-- in the base range that immediately precede and immediately follow the
-- values in the Index_Type.)
if Checks and then Index < Index_Type'First then
raise Constraint_Error with "Index is out of range (too small)";
end if;
-- We do allow a value greater than Container.Last to be specified as
-- the Index, but only if it's immediately greater. This allows the
-- corner case of deleting no items from the back end of the vector to
-- be treated as a no-op. (It is assumed that specifying an index value
-- greater than Last + 1 indicates some deeper flaw in the caller's
-- algorithm, so that case is treated as a proper error.)
if Index > Old_Last then
if Checks and then Index > Old_Last + 1 then
raise Constraint_Error with "Index is out of range (too large)";
else
return;
end if;
end if;
-- Here and elsewhere we treat deleting 0 items from the container as a
-- no-op, even when the container is busy, so we simply return.
if Count = 0 then
return;
end if;
-- The internal elements array isn't guaranteed to exist unless we have
-- elements, so we handle that case here in order to avoid having to
-- check it later. (Note that an empty vector can never be busy, so
-- there's no semantic harm in returning early.)
if Container.Is_Empty then
return;
end if;
-- The tampering bits exist to prevent an item from being deleted (or
-- otherwise harmfully manipulated) while it is being visited. Query,
-- Update, and Iterate increment the busy count on entry, and decrement
-- the count on exit. Delete checks the count to determine whether it is
-- being called while the associated callback procedure is executing.
TC_Check (Container.TC);
-- We first calculate what's available for deletion starting at
-- Index. Here and elsewhere we use the wider of Index_Type'Base and
-- Count_Type'Base as the type for intermediate values. (See function
-- Length for more information.)
if Count_Type'Base'Last >= Index_Type'Pos (Index_Type'Base'Last) then
Count2 := Count_Type'Base (Old_Last) - Count_Type'Base (Index) + 1;
else
Count2 := Count_Type'Base (Old_Last - Index + 1);
end if;
-- If the number of elements requested (Count) for deletion is equal to
-- (or greater than) the number of elements available (Count2) for
-- deletion beginning at Index, then everything from Index to
-- Container.Last is deleted (this is equivalent to Delete_Last).
if Count >= Count2 then
-- Elements in an indefinite vector are allocated, so we must iterate
-- over the loop and deallocate elements one-at-a-time. We work from
-- back to front, deleting the last element during each pass, in
-- order to gracefully handle deallocation failures.
declare
EA : Elements_Array renames Container.Elements.EA;
begin
while Container.Last >= Index loop
declare
K : constant Index_Type := Container.Last;
X : Element_Access := EA (K);
begin
-- We first isolate the element we're deleting, removing it
-- from the vector before we attempt to deallocate it, in
-- case the deallocation fails.
EA (K) := null;
Container.Last := K - 1;
-- Container invariants have been restored, so it is now
-- safe to attempt to deallocate the element.
Free (X);
end;
end loop;
end;
return;
end if;
-- There are some elements that aren't being deleted (the requested
-- count was less than the available count), so we must slide them down
-- to Index. We first calculate the index values of the respective array
-- slices, using the wider of Index_Type'Base and Count_Type'Base as the
-- type for intermediate calculations. For the elements that slide down,
-- index value New_Last is the last index value of their new home, and
-- index value J is the first index of their old home.
if Index_Type'Base'Last >= Count_Type_Last then
New_Last := Old_Last - Index_Type'Base (Count);
J := Index + Index_Type'Base (Count);
else
New_Last := Index_Type'Base (Count_Type'Base (Old_Last) - Count);
J := Index_Type'Base (Count_Type'Base (Index) + Count);
end if;
-- The internal elements array isn't guaranteed to exist unless we have
-- elements, but we have that guarantee here because we know we have
-- elements to slide. The array index values for each slice have
-- already been determined, so what remains to be done is to first
-- deallocate the elements that are being deleted, and then slide down
-- to Index the elements that aren't being deleted.
declare
EA : Elements_Array renames Container.Elements.EA;
begin
-- Before we can slide down the elements that aren't being deleted,
-- we need to deallocate the elements that are being deleted.
for K in Index .. J - 1 loop
declare
X : Element_Access := EA (K);
begin
-- First we remove the element we're about to deallocate from
-- the vector, in case the deallocation fails, in order to
-- preserve representation invariants.
EA (K) := null;
-- The element has been removed from the vector, so it is now
-- safe to attempt to deallocate it.
Free (X);
end;
end loop;
EA (Index .. New_Last) := EA (J .. Old_Last);
Container.Last := New_Last;
end;
end Delete;
procedure Delete
(Container : in out Vector;
Position : in out Cursor;
Count : Count_Type := 1)
is
begin
if Checks then
if Position.Container = null then
raise Constraint_Error with "Position cursor has no element";
elsif Position.Container /= Container'Unrestricted_Access then
raise Program_Error with "Position cursor denotes wrong container";
elsif Position.Index > Container.Last then
raise Program_Error with "Position index is out of range";
end if;
end if;
Delete (Container, Position.Index, Count);
Position := No_Element;
end Delete;
------------------
-- Delete_First --
------------------
procedure Delete_First
(Container : in out Vector;
Count : Count_Type := 1)
is
begin
if Count = 0 then
return;
elsif Count >= Length (Container) then
Clear (Container);
return;
else
Delete (Container, Index_Type'First, Count);
end if;
end Delete_First;
-----------------
-- Delete_Last --
-----------------
procedure Delete_Last
(Container : in out Vector;
Count : Count_Type := 1)
is
begin
-- It is not permitted to delete items while the container is busy (for
-- example, we're in the middle of a passive iteration). However, we
-- always treat deleting 0 items as a no-op, even when we're busy, so we
-- simply return without checking.
if Count = 0 then
return;
end if;
-- We cannot simply subsume the empty case into the loop below (the loop
-- would iterate 0 times), because we rename the internal array object
-- (which is allocated), but an empty vector isn't guaranteed to have
-- actually allocated an array. (Note that an empty vector can never be
-- busy, so there's no semantic harm in returning early here.)
if Container.Is_Empty then
return;
end if;
-- The tampering bits exist to prevent an item from being deleted (or
-- otherwise harmfully manipulated) while it is being visited. Query,
-- Update, and Iterate increment the busy count on entry, and decrement
-- the count on exit. Delete_Last checks the count to determine whether
-- it is being called while the associated callback procedure is
-- executing.
TC_Check (Container.TC);
-- Elements in an indefinite vector are allocated, so we must iterate
-- over the loop and deallocate elements one-at-a-time. We work from
-- back to front, deleting the last element during each pass, in order
-- to gracefully handle deallocation failures.
declare
E : Elements_Array renames Container.Elements.EA;
begin
for Indx in 1 .. Count_Type'Min (Count, Container.Length) loop
declare
J : constant Index_Type := Container.Last;
X : Element_Access := E (J);
begin
-- Note that we first isolate the element we're deleting,
-- removing it from the vector, before we actually deallocate
-- it, in order to preserve representation invariants even if
-- the deallocation fails.
E (J) := null;
Container.Last := J - 1;
-- Container invariants have been restored, so it is now safe
-- to deallocate the element.
Free (X);
end;
end loop;
end;
end Delete_Last;
-------------
-- Element --
-------------
function Element
(Container : Vector;
Index : Index_Type) return Element_Type
is
begin
if Checks and then Index > Container.Last then
raise Constraint_Error with "Index is out of range";
end if;
declare
EA : constant Element_Access := Container.Elements.EA (Index);
begin
if Checks and then EA = null then
raise Constraint_Error with "element is empty";
else
return EA.all;
end if;
end;
end Element;
function Element (Position : Cursor) return Element_Type is
begin
if Checks then
if Position.Container = null then
raise Constraint_Error with "Position cursor has no element";
end if;
if Position.Index > Position.Container.Last then
raise Constraint_Error with "Position cursor is out of range";
end if;
end if;
declare
EA : constant Element_Access :=
Position.Container.Elements.EA (Position.Index);
begin
if Checks and then EA = null then
raise Constraint_Error with "element is empty";
else
return EA.all;
end if;
end;
end Element;
--------------
-- Finalize --
--------------
procedure Finalize (Container : in out Vector) is
begin
Clear (Container); -- Checks busy-bit
declare
X : Elements_Access := Container.Elements;
begin
Container.Elements := null;
Free (X);
end;
end Finalize;
procedure Finalize (Object : in out Iterator) is
begin
Unbusy (Object.Container.TC);
end Finalize;
----------
-- Find --
----------
function Find
(Container : Vector;
Item : Element_Type;
Position : Cursor := No_Element) return Cursor
is
begin
if Checks and then Position.Container /= null then
if Position.Container /= Container'Unrestricted_Access then
raise Program_Error with "Position cursor denotes wrong container";
end if;
if Position.Index > Container.Last then
raise Program_Error with "Position index is out of range";
end if;
end if;
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
declare
Lock : With_Lock (Container.TC'Unrestricted_Access);
begin
for J in Position.Index .. Container.Last loop
if Container.Elements.EA (J).all = Item then
return Cursor'(Container'Unrestricted_Access, J);
end if;
end loop;
return No_Element;
end;
end Find;
----------------
-- Find_Index --
----------------
function Find_Index
(Container : Vector;
Item : Element_Type;
Index : Index_Type := Index_Type'First) return Extended_Index
is
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
Lock : With_Lock (Container.TC'Unrestricted_Access);
begin
for Indx in Index .. Container.Last loop
if Container.Elements.EA (Indx).all = Item then
return Indx;
end if;
end loop;
return No_Index;
end Find_Index;
-----------
-- First --
-----------
function First (Container : Vector) return Cursor is
begin
if Is_Empty (Container) then
return No_Element;
end if;
return (Container'Unrestricted_Access, Index_Type'First);
end First;
function First (Object : Iterator) return Cursor is
begin
-- The value of the iterator object's Index component influences the
-- behavior of the First (and Last) selector function.
-- When the Index component is No_Index, this means the iterator
-- object was constructed without a start expression, in which case the
-- (forward) iteration starts from the (logical) beginning of the entire
-- sequence of items (corresponding to Container.First, for a forward
-- iterator).
-- Otherwise, this is iteration over a partial sequence of items.
-- When the Index component isn't No_Index, the iterator object was
-- constructed with a start expression, that specifies the position
-- from which the (forward) partial iteration begins.
if Object.Index = No_Index then
return First (Object.Container.all);
else
return Cursor'(Object.Container, Object.Index);
end if;
end First;
-------------------
-- First_Element --
-------------------
function First_Element (Container : Vector) return Element_Type is
begin
if Checks and then Container.Last = No_Index then
raise Constraint_Error with "Container is empty";
end if;
declare
EA : constant Element_Access :=
Container.Elements.EA (Index_Type'First);
begin
if Checks and then EA = null then
raise Constraint_Error with "first element is empty";
else
return EA.all;
end if;
end;
end First_Element;
-----------------
-- First_Index --
-----------------
function First_Index (Container : Vector) return Index_Type is
pragma Unreferenced (Container);
begin
return Index_Type'First;
end First_Index;
---------------------
-- Generic_Sorting --
---------------------
package body Generic_Sorting is
-----------------------
-- Local Subprograms --
-----------------------
function Is_Less (L, R : Element_Access) return Boolean;
pragma Inline (Is_Less);
-------------
-- Is_Less --
-------------
function Is_Less (L, R : Element_Access) return Boolean is
begin
if L = null then
return R /= null;
elsif R = null then
return False;
else
return L.all < R.all;
end if;
end Is_Less;
---------------
-- Is_Sorted --
---------------
function Is_Sorted (Container : Vector) return Boolean is
begin
if Container.Last <= Index_Type'First then
return True;
end if;
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
declare
Lock : With_Lock (Container.TC'Unrestricted_Access);
E : Elements_Array renames Container.Elements.EA;
begin
for J in Index_Type'First .. Container.Last - 1 loop
if Is_Less (E (J + 1), E (J)) then
return False;
end if;
end loop;
return True;
end;
end Is_Sorted;
-----------
-- Merge --
-----------
procedure Merge (Target, Source : in out Vector) is
I, J : Index_Type'Base;
begin
-- The semantics of Merge changed slightly per AI05-0021. It was
-- originally the case that if Target and Source denoted the same
-- container object, then the GNAT implementation of Merge did
-- nothing. However, it was argued that RM05 did not precisely
-- specify the semantics for this corner case. The decision of the
-- ARG was that if Target and Source denote the same non-empty
-- container object, then Program_Error is raised.
if Source.Last < Index_Type'First then -- Source is empty
return;
end if;
if Checks and then Target'Address = Source'Address then
raise Program_Error with
"Target and Source denote same non-empty container";
end if;
if Target.Last < Index_Type'First then -- Target is empty
Move (Target => Target, Source => Source);
return;
end if;
TC_Check (Source.TC);
I := Target.Last; -- original value (before Set_Length)
Target.Set_Length (Length (Target) + Length (Source));
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
declare
TA : Elements_Array renames Target.Elements.EA;
SA : Elements_Array renames Source.Elements.EA;
Lock_Target : With_Lock (Target.TC'Unchecked_Access);
Lock_Source : With_Lock (Source.TC'Unchecked_Access);
begin
J := Target.Last; -- new value (after Set_Length)
while Source.Last >= Index_Type'First loop
pragma Assert
(Source.Last <= Index_Type'First
or else not (Is_Less (SA (Source.Last),
SA (Source.Last - 1))));
if I < Index_Type'First then
declare
Src : Elements_Array renames
SA (Index_Type'First .. Source.Last);
begin
TA (Index_Type'First .. J) := Src;
Src := (others => null);
end;
Source.Last := No_Index;
exit;
end if;
pragma Assert
(I <= Index_Type'First
or else not (Is_Less (TA (I), TA (I - 1))));
declare
Src : Element_Access renames SA (Source.Last);
Tgt : Element_Access renames TA (I);
begin
if Is_Less (Src, Tgt) then
Target.Elements.EA (J) := Tgt;
Tgt := null;
I := I - 1;
else
Target.Elements.EA (J) := Src;
Src := null;
Source.Last := Source.Last - 1;
end if;
end;
J := J - 1;
end loop;
end;
end Merge;
----------
-- Sort --
----------
procedure Sort (Container : in out Vector) is
procedure Sort is new Generic_Array_Sort
(Index_Type => Index_Type,
Element_Type => Element_Access,
Array_Type => Elements_Array,
"<" => Is_Less);
-- Start of processing for Sort
begin
if Container.Last <= Index_Type'First then
return;
end if;
-- The exception behavior for the vector container must match that
-- for the list container, so we check for cursor tampering here
-- (which will catch more things) instead of for element tampering
-- (which will catch fewer things). It's true that the elements of
-- this vector container could be safely moved around while (say) an
-- iteration is taking place (iteration only increments the busy
-- counter), and so technically all we would need here is a test for
-- element tampering (indicated by the lock counter), that's simply
-- an artifact of our array-based implementation. Logically Sort
-- requires a check for cursor tampering.
TC_Check (Container.TC);
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
declare
Lock : With_Lock (Container.TC'Unchecked_Access);
begin
Sort (Container.Elements.EA (Index_Type'First .. Container.Last));
end;
end Sort;
end Generic_Sorting;
------------------------
-- Get_Element_Access --
------------------------
function Get_Element_Access
(Position : Cursor) return not null Element_Access
is
Ptr : constant Element_Access :=
Position.Container.Elements.EA (Position.Index);
begin
-- An indefinite vector may contain spaces that hold no elements.
-- Any iteration over an indefinite vector with spaces will raise
-- Constraint_Error.
if Ptr = null then
raise Constraint_Error;
else
return Ptr;
end if;
end Get_Element_Access;
-----------------
-- Has_Element --
-----------------
function Has_Element (Position : Cursor) return Boolean is
begin
if Position.Container = null then
return False;
else
return Position.Index <= Position.Container.Last;
end if;
end Has_Element;
------------
-- Insert --
------------
procedure Insert
(Container : in out Vector;
Before : Extended_Index;
New_Item : Element_Type;
Count : Count_Type := 1)
is
Old_Length : constant Count_Type := Container.Length;
Max_Length : Count_Type'Base; -- determined from range of Index_Type
New_Length : Count_Type'Base; -- sum of current length and Count
New_Last : Index_Type'Base; -- last index of vector after insertion
Index : Index_Type'Base; -- scratch for intermediate values
J : Count_Type'Base; -- scratch
New_Capacity : Count_Type'Base; -- length of new, expanded array
Dst_Last : Index_Type'Base; -- last index of new, expanded array
Dst : Elements_Access; -- new, expanded internal array
begin
if Checks then
-- As a precondition on the generic actual Index_Type, the base type
-- must include Index_Type'Pred (Index_Type'First); this is the value
-- that Container.Last assumes when the vector is empty. However, we
-- do not allow that as the value for Index when specifying where the
-- new items should be inserted, so we must manually check. (That the
-- user is allowed to specify the value at all here is a consequence
-- of the declaration of the Extended_Index subtype, which includes
-- the values in the base range that immediately precede and
-- immediately follow the values in the Index_Type.)
if Before < Index_Type'First then
raise Constraint_Error with
"Before index is out of range (too small)";
end if;
-- We do allow a value greater than Container.Last to be specified as
-- the Index, but only if it's immediately greater. This allows for
-- the case of appending items to the back end of the vector. (It is
-- assumed that specifying an index value greater than Last + 1
-- indicates some deeper flaw in the caller's algorithm, so that case
-- is treated as a proper error.)
if Before > Container.Last + 1 then
raise Constraint_Error with
"Before index is out of range (too large)";
end if;
end if;
-- We treat inserting 0 items into the container as a no-op, even when
-- the container is busy, so we simply return.
if Count = 0 then
return;
end if;
-- There are two constraints we need to satisfy. The first constraint is
-- that a container cannot have more than Count_Type'Last elements, so
-- we must check the sum of the current length and the insertion count.
-- Note: we cannot simply add these values, because of the possibility
-- of overflow.
if Checks and then Old_Length > Count_Type'Last - Count then
raise Constraint_Error with "Count is out of range";
end if;
-- It is now safe compute the length of the new vector, without fear of
-- overflow.
New_Length := Old_Length + Count;
-- The second constraint is that the new Last index value cannot exceed
-- Index_Type'Last. In each branch below, we calculate the maximum
-- length (computed from the range of values in Index_Type), and then
-- compare the new length to the maximum length. If the new length is
-- acceptable, then we compute the new last index from that.
if Index_Type'Base'Last >= Count_Type_Last then
-- We have to handle the case when there might be more values in the
-- range of Index_Type than in the range of Count_Type.
if Index_Type'First <= 0 then
-- We know that No_Index (the same as Index_Type'First - 1) is
-- less than 0, so it is safe to compute the following sum without
-- fear of overflow.
Index := No_Index + Index_Type'Base (Count_Type'Last);
if Index <= Index_Type'Last then
-- We have determined that range of Index_Type has at least as
-- many values as in Count_Type, so Count_Type'Last is the
-- maximum number of items that are allowed.
Max_Length := Count_Type'Last;
else
-- The range of Index_Type has fewer values than in Count_Type,
-- so the maximum number of items is computed from the range of
-- the Index_Type.
Max_Length := Count_Type'Base (Index_Type'Last - No_Index);
end if;
else
-- No_Index is equal or greater than 0, so we can safely compute
-- the difference without fear of overflow (which we would have to
-- worry about if No_Index were less than 0, but that case is
-- handled above).
if Index_Type'Last - No_Index >= Count_Type_Last then
-- We have determined that range of Index_Type has at least as
-- many values as in Count_Type, so Count_Type'Last is the
-- maximum number of items that are allowed.
Max_Length := Count_Type'Last;
else
-- The range of Index_Type has fewer values than in Count_Type,
-- so the maximum number of items is computed from the range of
-- the Index_Type.
Max_Length := Count_Type'Base (Index_Type'Last - No_Index);
end if;
end if;
elsif Index_Type'First <= 0 then
-- We know that No_Index (the same as Index_Type'First - 1) is less
-- than 0, so it is safe to compute the following sum without fear of
-- overflow.
J := Count_Type'Base (No_Index) + Count_Type'Last;
if J <= Count_Type'Base (Index_Type'Last) then
-- We have determined that range of Index_Type has at least as
-- many values as in Count_Type, so Count_Type'Last is the maximum
-- number of items that are allowed.
Max_Length := Count_Type'Last;
else
-- The range of Index_Type has fewer values than Count_Type does,
-- so the maximum number of items is computed from the range of
-- the Index_Type.
Max_Length :=
Count_Type'Base (Index_Type'Last) - Count_Type'Base (No_Index);
end if;
else
-- No_Index is equal or greater than 0, so we can safely compute the
-- difference without fear of overflow (which we would have to worry
-- about if No_Index were less than 0, but that case is handled
-- above).
Max_Length :=
Count_Type'Base (Index_Type'Last) - Count_Type'Base (No_Index);
end if;
-- We have just computed the maximum length (number of items). We must
-- now compare the requested length to the maximum length, as we do not
-- allow a vector expand beyond the maximum (because that would create
-- an internal array with a last index value greater than
-- Index_Type'Last, with no way to index those elements).
if Checks and then New_Length > Max_Length then
raise Constraint_Error with "Count is out of range";
end if;
-- New_Last is the last index value of the items in the container after
-- insertion. Use the wider of Index_Type'Base and Count_Type'Base to
-- compute its value from the New_Length.
if Index_Type'Base'Last >= Count_Type_Last then
New_Last := No_Index + Index_Type'Base (New_Length);
else
New_Last := Index_Type'Base (Count_Type'Base (No_Index) + New_Length);
end if;
if Container.Elements = null then
pragma Assert (Container.Last = No_Index);
-- This is the simplest case, with which we must always begin: we're
-- inserting items into an empty vector that hasn't allocated an
-- internal array yet. Note that we don't need to check the busy bit
-- here, because an empty container cannot be busy.
-- In an indefinite vector, elements are allocated individually, and
-- stored as access values on the internal array (the length of which
-- represents the vector "capacity"), which is separately allocated.
Container.Elements := new Elements_Type (New_Last);
-- The element backbone has been successfully allocated, so now we
-- allocate the elements.
for Idx in Container.Elements.EA'Range loop
-- In order to preserve container invariants, we always attempt
-- the element allocation first, before setting the Last index
-- value, in case the allocation fails (either because there is no
-- storage available, or because element initialization fails).
declare
-- The element allocator may need an accessibility check in the
-- case actual type is class-wide or has access discriminants
-- (see RM 4.8(10.1) and AI12-0035).
pragma Unsuppress (Accessibility_Check);
begin
Container.Elements.EA (Idx) := new Element_Type'(New_Item);
end;
-- The allocation of the element succeeded, so it is now safe to
-- update the Last index, restoring container invariants.
Container.Last := Idx;
end loop;
return;
end if;
-- The tampering bits exist to prevent an item from being harmfully
-- manipulated while it is being visited. Query, Update, and Iterate
-- increment the busy count on entry, and decrement the count on
-- exit. Insert checks the count to determine whether it is being called
-- while the associated callback procedure is executing.
TC_Check (Container.TC);
if New_Length <= Container.Elements.EA'Length then
-- In this case, we're inserting elements into a vector that has
-- already allocated an internal array, and the existing array has
-- enough unused storage for the new items.
declare
E : Elements_Array renames Container.Elements.EA;
K : Index_Type'Base;
begin
if Before > Container.Last then
-- The new items are being appended to the vector, so no
-- sliding of existing elements is required.
for Idx in Before .. New_Last loop
-- In order to preserve container invariants, we always
-- attempt the element allocation first, before setting the
-- Last index value, in case the allocation fails (either
-- because there is no storage available, or because element
-- initialization fails).
declare
-- The element allocator may need an accessibility check
-- in case the actual type is class-wide or has access
-- discriminants (see RM 4.8(10.1) and AI12-0035).
pragma Unsuppress (Accessibility_Check);
begin
E (Idx) := new Element_Type'(New_Item);
end;
-- The allocation of the element succeeded, so it is now
-- safe to update the Last index, restoring container
-- invariants.
Container.Last := Idx;
end loop;
else
-- The new items are being inserted before some existing
-- elements, so we must slide the existing elements up to their
-- new home. We use the wider of Index_Type'Base and
-- Count_Type'Base as the type for intermediate index values.
if Index_Type'Base'Last >= Count_Type_Last then
Index := Before + Index_Type'Base (Count);
else
Index := Index_Type'Base (Count_Type'Base (Before) + Count);
end if;
-- The new items are being inserted in the middle of the array,
-- in the range [Before, Index). Copy the existing elements to
-- the end of the array, to make room for the new items.
E (Index .. New_Last) := E (Before .. Container.Last);
Container.Last := New_Last;
-- We have copied the existing items up to the end of the
-- array, to make room for the new items in the middle of
-- the array. Now we actually allocate the new items.
-- Note: initialize K outside loop to make it clear that
-- K always has a value if the exception handler triggers.
K := Before;
declare
-- The element allocator may need an accessibility check in
-- the case the actual type is class-wide or has access
-- discriminants (see RM 4.8(10.1) and AI12-0035).
pragma Unsuppress (Accessibility_Check);
begin
while K < Index loop
E (K) := new Element_Type'(New_Item);
K := K + 1;
end loop;
exception
when others =>
-- Values in the range [Before, K) were successfully
-- allocated, but values in the range [K, Index) are
-- stale (these array positions contain copies of the
-- old items, that did not get assigned a new item,
-- because the allocation failed). We must finish what
-- we started by clearing out all of the stale values,
-- leaving a "hole" in the middle of the array.
E (K .. Index - 1) := (others => null);
raise;
end;
end if;
end;
return;
end if;
-- In this case, we're inserting elements into a vector that has already
-- allocated an internal array, but the existing array does not have
-- enough storage, so we must allocate a new, longer array. In order to
-- guarantee that the amortized insertion cost is O(1), we always
-- allocate an array whose length is some power-of-two factor of the
-- current array length. (The new array cannot have a length less than
-- the New_Length of the container, but its last index value cannot be
-- greater than Index_Type'Last.)
New_Capacity := Count_Type'Max (1, Container.Elements.EA'Length);
while New_Capacity < New_Length loop
if New_Capacity > Count_Type'Last / 2 then
New_Capacity := Count_Type'Last;
exit;
end if;
New_Capacity := 2 * New_Capacity;
end loop;
if New_Capacity > Max_Length then
-- We have reached the limit of capacity, so no further expansion
-- will occur. (This is not a problem, as there is never a need to
-- have more capacity than the maximum container length.)
New_Capacity := Max_Length;
end if;
-- We have computed the length of the new internal array (and this is
-- what "vector capacity" means), so use that to compute its last index.
if Index_Type'Base'Last >= Count_Type_Last then
Dst_Last := No_Index + Index_Type'Base (New_Capacity);
else
Dst_Last :=
Index_Type'Base (Count_Type'Base (No_Index) + New_Capacity);
end if;
-- Now we allocate the new, longer internal array. If the allocation
-- fails, we have not changed any container state, so no side-effect
-- will occur as a result of propagating the exception.
Dst := new Elements_Type (Dst_Last);
-- We have our new internal array. All that needs to be done now is to
-- copy the existing items (if any) from the old array (the "source"
-- array) to the new array (the "destination" array), and then
-- deallocate the old array.
declare
Src : Elements_Access := Container.Elements;
begin
Dst.EA (Index_Type'First .. Before - 1) :=
Src.EA (Index_Type'First .. Before - 1);
if Before > Container.Last then
-- The new items are being appended to the vector, so no
-- sliding of existing elements is required.
-- We have copied the elements from to the old source array to the
-- new destination array, so we can now deallocate the old array.
Container.Elements := Dst;
Free (Src);
-- Now we append the new items.
for Idx in Before .. New_Last loop
-- In order to preserve container invariants, we always attempt
-- the element allocation first, before setting the Last index
-- value, in case the allocation fails (either because there
-- is no storage available, or because element initialization
-- fails).
declare
-- The element allocator may need an accessibility check in
-- the case the actual type is class-wide or has access
-- discriminants (see RM 4.8(10.1) and AI12-0035).
pragma Unsuppress (Accessibility_Check);
begin
Dst.EA (Idx) := new Element_Type'(New_Item);
end;
-- The allocation of the element succeeded, so it is now safe
-- to update the Last index, restoring container invariants.
Container.Last := Idx;
end loop;
else
-- The new items are being inserted before some existing elements,
-- so we must slide the existing elements up to their new home.
if Index_Type'Base'Last >= Count_Type_Last then
Index := Before + Index_Type'Base (Count);
else
Index := Index_Type'Base (Count_Type'Base (Before) + Count);
end if;
Dst.EA (Index .. New_Last) := Src.EA (Before .. Container.Last);
-- We have copied the elements from to the old source array to the
-- new destination array, so we can now deallocate the old array.
Container.Elements := Dst;
Container.Last := New_Last;
Free (Src);
-- The new array has a range in the middle containing null access
-- values. Fill in that partition of the array with the new items.
for Idx in Before .. Index - 1 loop
-- Note that container invariants have already been satisfied
-- (in particular, the Last index value of the vector has
-- already been updated), so if this allocation fails we simply
-- let it propagate.
declare
-- The element allocator may need an accessibility check in
-- the case the actual type is class-wide or has access
-- discriminants (see RM 4.8(10.1) and AI12-0035).
pragma Unsuppress (Accessibility_Check);
begin
Dst.EA (Idx) := new Element_Type'(New_Item);
end;
end loop;
end if;
end;
end Insert;
procedure Insert
(Container : in out Vector;
Before : Extended_Index;
New_Item : Vector)
is
N : constant Count_Type := Length (New_Item);
J : Index_Type'Base;
begin
-- Use Insert_Space to create the "hole" (the destination slice) into
-- which we copy the source items.
Insert_Space (Container, Before, Count => N);
if N = 0 then
-- There's nothing else to do here (vetting of parameters was
-- performed already in Insert_Space), so we simply return.
return;
end if;
if Container'Address /= New_Item'Address then
-- This is the simple case. New_Item denotes an object different
-- from Container, so there's nothing special we need to do to copy
-- the source items to their destination, because all of the source
-- items are contiguous.
declare
subtype Src_Index_Subtype is Index_Type'Base range
Index_Type'First .. New_Item.Last;
Src : Elements_Array renames
New_Item.Elements.EA (Src_Index_Subtype);
Dst : Elements_Array renames Container.Elements.EA;
Dst_Index : Index_Type'Base;
begin
Dst_Index := Before - 1;
for Src_Index in Src'Range loop
Dst_Index := Dst_Index + 1;
if Src (Src_Index) /= null then
Dst (Dst_Index) := new Element_Type'(Src (Src_Index).all);
end if;
end loop;
end;
return;
end if;
-- New_Item denotes the same object as Container, so an insertion has
-- potentially split the source items. The first source slice is
-- [Index_Type'First, Before), and the second source slice is
-- [J, Container.Last], where index value J is the first index of the
-- second slice. (J gets computed below, but only after we have
-- determined that the second source slice is non-empty.) The
-- destination slice is always the range [Before, J). We perform the
-- copy in two steps, using each of the two slices of the source items.
declare
L : constant Index_Type'Base := Before - 1;
subtype Src_Index_Subtype is Index_Type'Base range
Index_Type'First .. L;
Src : Elements_Array renames
Container.Elements.EA (Src_Index_Subtype);
Dst : Elements_Array renames Container.Elements.EA;
Dst_Index : Index_Type'Base;
begin
-- We first copy the source items that precede the space we
-- inserted. (If Before equals Index_Type'First, then this first
-- source slice will be empty, which is harmless.)
Dst_Index := Before - 1;
for Src_Index in Src'Range loop
Dst_Index := Dst_Index + 1;
if Src (Src_Index) /= null then
Dst (Dst_Index) := new Element_Type'(Src (Src_Index).all);
end if;
end loop;
if Src'Length = N then
-- The new items were effectively appended to the container, so we
-- have already copied all of the items that need to be copied.
-- We return early here, even though the source slice below is
-- empty (so the assignment would be harmless), because we want to
-- avoid computing J, which will overflow if J is greater than
-- Index_Type'Base'Last.
return;
end if;
end;
-- Index value J is the first index of the second source slice. (It is
-- also 1 greater than the last index of the destination slice.) Note:
-- avoid computing J if J is greater than Index_Type'Base'Last, in order
-- to avoid overflow. Prevent that by returning early above, immediately
-- after copying the first slice of the source, and determining that
-- this second slice of the source is empty.
if Index_Type'Base'Last >= Count_Type_Last then
J := Before + Index_Type'Base (N);
else
J := Index_Type'Base (Count_Type'Base (Before) + N);
end if;
declare
subtype Src_Index_Subtype is Index_Type'Base range
J .. Container.Last;
Src : Elements_Array renames
Container.Elements.EA (Src_Index_Subtype);
Dst : Elements_Array renames Container.Elements.EA;
Dst_Index : Index_Type'Base;
begin
-- We next copy the source items that follow the space we inserted.
-- Index value Dst_Index is the first index of that portion of the
-- destination that receives this slice of the source. (For the
-- reasons given above, this slice is guaranteed to be non-empty.)
if Index_Type'Base'Last >= Count_Type_Last then
Dst_Index := J - Index_Type'Base (Src'Length);
else
Dst_Index := Index_Type'Base (Count_Type'Base (J) - Src'Length);
end if;
for Src_Index in Src'Range loop
if Src (Src_Index) /= null then
Dst (Dst_Index) := new Element_Type'(Src (Src_Index).all);
end if;
Dst_Index := Dst_Index + 1;
end loop;
end;
end Insert;
procedure Insert
(Container : in out Vector;
Before : Cursor;
New_Item : Vector)
is
Index : Index_Type'Base;
begin
if Checks and then Before.Container /= null
and then Before.Container /= Container'Unrestricted_Access
then
raise Program_Error with "Before cursor denotes wrong container";
end if;
if Is_Empty (New_Item) then
return;
end if;
if Before.Container = null or else Before.Index > Container.Last then
if Checks and then Container.Last = Index_Type'Last then
raise Constraint_Error with
"vector is already at its maximum length";
end if;
Index := Container.Last + 1;
else
Index := Before.Index;
end if;
Insert (Container, Index, New_Item);
end Insert;
procedure Insert
(Container : in out Vector;
Before : Cursor;
New_Item : Vector;
Position : out Cursor)
is
Index : Index_Type'Base;
begin
if Checks and then Before.Container /= null
and then Before.Container /= Container'Unrestricted_Access
then
raise Program_Error with "Before cursor denotes wrong container";
end if;
if Is_Empty (New_Item) then
if Before.Container = null or else Before.Index > Container.Last then
Position := No_Element;
else
Position := (Container'Unrestricted_Access, Before.Index);
end if;
return;
end if;
if Before.Container = null or else Before.Index > Container.Last then
if Checks and then Container.Last = Index_Type'Last then
raise Constraint_Error with
"vector is already at its maximum length";
end if;
Index := Container.Last + 1;
else
Index := Before.Index;
end if;
Insert (Container, Index, New_Item);
Position := (Container'Unrestricted_Access, Index);
end Insert;
procedure Insert
(Container : in out Vector;
Before : Cursor;
New_Item : Element_Type;
Count : Count_Type := 1)
is
Index : Index_Type'Base;
begin
if Checks and then Before.Container /= null
and then Before.Container /= Container'Unrestricted_Access
then
raise Program_Error with "Before cursor denotes wrong container";
end if;
if Count = 0 then
return;
end if;
if Before.Container = null or else Before.Index > Container.Last then
if Checks and then Container.Last = Index_Type'Last then
raise Constraint_Error with
"vector is already at its maximum length";
end if;
Index := Container.Last + 1;
else
Index := Before.Index;
end if;
Insert (Container, Index, New_Item, Count);
end Insert;
procedure Insert
(Container : in out Vector;
Before : Cursor;
New_Item : Element_Type;
Position : out Cursor;
Count : Count_Type := 1)
is
Index : Index_Type'Base;
begin
if Checks and then Before.Container /= null
and then Before.Container /= Container'Unrestricted_Access
then
raise Program_Error with "Before cursor denotes wrong container";
end if;
if Count = 0 then
if Before.Container = null or else Before.Index > Container.Last then
Position := No_Element;
else
Position := (Container'Unrestricted_Access, Before.Index);
end if;
return;
end if;
if Before.Container = null or else Before.Index > Container.Last then
if Checks and then Container.Last = Index_Type'Last then
raise Constraint_Error with
"vector is already at its maximum length";
end if;
Index := Container.Last + 1;
else
Index := Before.Index;
end if;
Insert (Container, Index, New_Item, Count);
Position := (Container'Unrestricted_Access, Index);
end Insert;
------------------
-- Insert_Space --
------------------
procedure Insert_Space
(Container : in out Vector;
Before : Extended_Index;
Count : Count_Type := 1)
is
Old_Length : constant Count_Type := Container.Length;
Max_Length : Count_Type'Base; -- determined from range of Index_Type
New_Length : Count_Type'Base; -- sum of current length and Count
New_Last : Index_Type'Base; -- last index of vector after insertion
Index : Index_Type'Base; -- scratch for intermediate values
J : Count_Type'Base; -- scratch
New_Capacity : Count_Type'Base; -- length of new, expanded array
Dst_Last : Index_Type'Base; -- last index of new, expanded array
Dst : Elements_Access; -- new, expanded internal array
begin
if Checks then
-- As a precondition on the generic actual Index_Type, the base type
-- must include Index_Type'Pred (Index_Type'First); this is the value
-- that Container.Last assumes when the vector is empty. However, we
-- do not allow that as the value for Index when specifying where the
-- new items should be inserted, so we must manually check. (That the
-- user is allowed to specify the value at all here is a consequence
-- of the declaration of the Extended_Index subtype, which includes
-- the values in the base range that immediately precede and
-- immediately follow the values in the Index_Type.)
if Before < Index_Type'First then
raise Constraint_Error with
"Before index is out of range (too small)";
end if;
-- We do allow a value greater than Container.Last to be specified as
-- the Index, but only if it's immediately greater. This allows for
-- the case of appending items to the back end of the vector. (It is
-- assumed that specifying an index value greater than Last + 1
-- indicates some deeper flaw in the caller's algorithm, so that case
-- is treated as a proper error.)
if Before > Container.Last + 1 then
raise Constraint_Error with
"Before index is out of range (too large)";
end if;
end if;
-- We treat inserting 0 items into the container as a no-op, even when
-- the container is busy, so we simply return.
if Count = 0 then
return;
end if;
-- There are two constraints we need to satisfy. The first constraint is
-- that a container cannot have more than Count_Type'Last elements, so
-- we must check the sum of the current length and the insertion count.
-- Note: we cannot simply add these values, because of the possibility
-- of overflow.
if Checks and then Old_Length > Count_Type'Last - Count then
raise Constraint_Error with "Count is out of range";
end if;
-- It is now safe compute the length of the new vector, without fear of
-- overflow.
New_Length := Old_Length + Count;
-- The second constraint is that the new Last index value cannot exceed
-- Index_Type'Last. In each branch below, we calculate the maximum
-- length (computed from the range of values in Index_Type), and then
-- compare the new length to the maximum length. If the new length is
-- acceptable, then we compute the new last index from that.
if Index_Type'Base'Last >= Count_Type_Last then
-- We have to handle the case when there might be more values in the
-- range of Index_Type than in the range of Count_Type.
if Index_Type'First <= 0 then
-- We know that No_Index (the same as Index_Type'First - 1) is
-- less than 0, so it is safe to compute the following sum without
-- fear of overflow.
Index := No_Index + Index_Type'Base (Count_Type'Last);
if Index <= Index_Type'Last then
-- We have determined that range of Index_Type has at least as
-- many values as in Count_Type, so Count_Type'Last is the
-- maximum number of items that are allowed.
Max_Length := Count_Type'Last;
else
-- The range of Index_Type has fewer values than in Count_Type,
-- so the maximum number of items is computed from the range of
-- the Index_Type.
Max_Length := Count_Type'Base (Index_Type'Last - No_Index);
end if;
else
-- No_Index is equal or greater than 0, so we can safely compute
-- the difference without fear of overflow (which we would have to
-- worry about if No_Index were less than 0, but that case is
-- handled above).
if Index_Type'Last - No_Index >= Count_Type_Last then
-- We have determined that range of Index_Type has at least as
-- many values as in Count_Type, so Count_Type'Last is the
-- maximum number of items that are allowed.
Max_Length := Count_Type'Last;
else
-- The range of Index_Type has fewer values than in Count_Type,
-- so the maximum number of items is computed from the range of
-- the Index_Type.
Max_Length := Count_Type'Base (Index_Type'Last - No_Index);
end if;
end if;
elsif Index_Type'First <= 0 then
-- We know that No_Index (the same as Index_Type'First - 1) is less
-- than 0, so it is safe to compute the following sum without fear of
-- overflow.
J := Count_Type'Base (No_Index) + Count_Type'Last;
if J <= Count_Type'Base (Index_Type'Last) then
-- We have determined that range of Index_Type has at least as
-- many values as in Count_Type, so Count_Type'Last is the maximum
-- number of items that are allowed.
Max_Length := Count_Type'Last;
else
-- The range of Index_Type has fewer values than Count_Type does,
-- so the maximum number of items is computed from the range of
-- the Index_Type.
Max_Length :=
Count_Type'Base (Index_Type'Last) - Count_Type'Base (No_Index);
end if;
else
-- No_Index is equal or greater than 0, so we can safely compute the
-- difference without fear of overflow (which we would have to worry
-- about if No_Index were less than 0, but that case is handled
-- above).
Max_Length :=
Count_Type'Base (Index_Type'Last) - Count_Type'Base (No_Index);
end if;
-- We have just computed the maximum length (number of items). We must
-- now compare the requested length to the maximum length, as we do not
-- allow a vector expand beyond the maximum (because that would create
-- an internal array with a last index value greater than
-- Index_Type'Last, with no way to index those elements).
if Checks and then New_Length > Max_Length then
raise Constraint_Error with "Count is out of range";
end if;
-- New_Last is the last index value of the items in the container after
-- insertion. Use the wider of Index_Type'Base and Count_Type'Base to
-- compute its value from the New_Length.
if Index_Type'Base'Last >= Count_Type_Last then
New_Last := No_Index + Index_Type'Base (New_Length);
else
New_Last := Index_Type'Base (Count_Type'Base (No_Index) + New_Length);
end if;
if Container.Elements = null then
pragma Assert (Container.Last = No_Index);
-- This is the simplest case, with which we must always begin: we're
-- inserting items into an empty vector that hasn't allocated an
-- internal array yet. Note that we don't need to check the busy bit
-- here, because an empty container cannot be busy.
-- In an indefinite vector, elements are allocated individually, and
-- stored as access values on the internal array (the length of which
-- represents the vector "capacity"), which is separately allocated.
-- We have no elements here (because we're inserting "space"), so all
-- we need to do is allocate the backbone.
Container.Elements := new Elements_Type (New_Last);
Container.Last := New_Last;
return;
end if;
-- The tampering bits exist to prevent an item from being harmfully
-- manipulated while it is being visited. Query, Update, and Iterate
-- increment the busy count on entry, and decrement the count on exit.
-- Insert checks the count to determine whether it is being called while
-- the associated callback procedure is executing.
TC_Check (Container.TC);
if New_Length <= Container.Elements.EA'Length then
-- In this case, we are inserting elements into a vector that has
-- already allocated an internal array, and the existing array has
-- enough unused storage for the new items.
declare
E : Elements_Array renames Container.Elements.EA;
begin
if Before <= Container.Last then
-- The new space is being inserted before some existing
-- elements, so we must slide the existing elements up to
-- their new home. We use the wider of Index_Type'Base and
-- Count_Type'Base as the type for intermediate index values.
if Index_Type'Base'Last >= Count_Type_Last then
Index := Before + Index_Type'Base (Count);
else
Index := Index_Type'Base (Count_Type'Base (Before) + Count);
end if;
E (Index .. New_Last) := E (Before .. Container.Last);
E (Before .. Index - 1) := (others => null);
end if;
end;
Container.Last := New_Last;
return;
end if;
-- In this case, we're inserting elements into a vector that has already
-- allocated an internal array, but the existing array does not have
-- enough storage, so we must allocate a new, longer array. In order to
-- guarantee that the amortized insertion cost is O(1), we always
-- allocate an array whose length is some power-of-two factor of the
-- current array length. (The new array cannot have a length less than
-- the New_Length of the container, but its last index value cannot be
-- greater than Index_Type'Last.)
New_Capacity := Count_Type'Max (1, Container.Elements.EA'Length);
while New_Capacity < New_Length loop
if New_Capacity > Count_Type'Last / 2 then
New_Capacity := Count_Type'Last;
exit;
end if;
New_Capacity := 2 * New_Capacity;
end loop;
if New_Capacity > Max_Length then
-- We have reached the limit of capacity, so no further expansion
-- will occur. (This is not a problem, as there is never a need to
-- have more capacity than the maximum container length.)
New_Capacity := Max_Length;
end if;
-- We have computed the length of the new internal array (and this is
-- what "vector capacity" means), so use that to compute its last index.
if Index_Type'Base'Last >= Count_Type_Last then
Dst_Last := No_Index + Index_Type'Base (New_Capacity);
else
Dst_Last :=
Index_Type'Base (Count_Type'Base (No_Index) + New_Capacity);
end if;
-- Now we allocate the new, longer internal array. If the allocation
-- fails, we have not changed any container state, so no side-effect
-- will occur as a result of propagating the exception.
Dst := new Elements_Type (Dst_Last);
-- We have our new internal array. All that needs to be done now is to
-- copy the existing items (if any) from the old array (the "source"
-- array) to the new array (the "destination" array), and then
-- deallocate the old array.
declare
Src : Elements_Access := Container.Elements;
begin
Dst.EA (Index_Type'First .. Before - 1) :=
Src.EA (Index_Type'First .. Before - 1);
if Before <= Container.Last then
-- The new items are being inserted before some existing elements,
-- so we must slide the existing elements up to their new home.
if Index_Type'Base'Last >= Count_Type_Last then
Index := Before + Index_Type'Base (Count);
else
Index := Index_Type'Base (Count_Type'Base (Before) + Count);
end if;
Dst.EA (Index .. New_Last) := Src.EA (Before .. Container.Last);
end if;
-- We have copied the elements from to the old, source array to the
-- new, destination array, so we can now restore invariants, and
-- deallocate the old array.
Container.Elements := Dst;
Container.Last := New_Last;
Free (Src);
end;
end Insert_Space;
procedure Insert_Space
(Container : in out Vector;
Before : Cursor;
Position : out Cursor;
Count : Count_Type := 1)
is
Index : Index_Type'Base;
begin
if Checks and then Before.Container /= null
and then Before.Container /= Container'Unrestricted_Access
then
raise Program_Error with "Before cursor denotes wrong container";
end if;
if Count = 0 then
if Before.Container = null or else Before.Index > Container.Last then
Position := No_Element;
else
Position := (Container'Unrestricted_Access, Before.Index);
end if;
return;
end if;
if Before.Container = null or else Before.Index > Container.Last then
if Checks and then Container.Last = Index_Type'Last then
raise Constraint_Error with
"vector is already at its maximum length";
end if;
Index := Container.Last + 1;
else
Index := Before.Index;
end if;
Insert_Space (Container, Index, Count);
Position := (Container'Unrestricted_Access, Index);
end Insert_Space;
--------------
-- Is_Empty --
--------------
function Is_Empty (Container : Vector) return Boolean is
begin
return Container.Last < Index_Type'First;
end Is_Empty;
-------------
-- Iterate --
-------------
procedure Iterate
(Container : Vector;
Process : not null access procedure (Position : Cursor))
is
Busy : With_Busy (Container.TC'Unrestricted_Access);
begin
for Indx in Index_Type'First .. Container.Last loop
Process (Cursor'(Container'Unrestricted_Access, Indx));
end loop;
end Iterate;
function Iterate
(Container : Vector)
return Vector_Iterator_Interfaces.Reversible_Iterator'Class
is
V : constant Vector_Access := Container'Unrestricted_Access;
begin
-- The value of its Index component influences the behavior of the First
-- and Last selector functions of the iterator object. When the Index
-- component is No_Index (as is the case here), this means the iterator
-- object was constructed without a start expression. This is a complete
-- iterator, meaning that the iteration starts from the (logical)
-- beginning of the sequence of items.
-- Note: For a forward iterator, Container.First is the beginning, and
-- for a reverse iterator, Container.Last is the beginning.
return It : constant Iterator :=
(Limited_Controlled with
Container => V,
Index => No_Index)
do
Busy (Container.TC'Unrestricted_Access.all);
end return;
end Iterate;
function Iterate
(Container : Vector;
Start : Cursor)
return Vector_Iterator_Interfaces.Reversible_Iterator'Class
is
V : constant Vector_Access := Container'Unrestricted_Access;
begin
-- It was formerly the case that when Start = No_Element, the partial
-- iterator was defined to behave the same as for a complete iterator,
-- and iterate over the entire sequence of items. However, those
-- semantics were unintuitive and arguably error-prone (it is too easy
-- to accidentally create an endless loop), and so they were changed,
-- per the ARG meeting in Denver on 2011/11. However, there was no
-- consensus about what positive meaning this corner case should have,
-- and so it was decided to simply raise an exception. This does imply,
-- however, that it is not possible to use a partial iterator to specify
-- an empty sequence of items.
if Checks then
if Start.Container = null then
raise Constraint_Error with
"Start position for iterator equals No_Element";
end if;
if Start.Container /= V then
raise Program_Error with
"Start cursor of Iterate designates wrong vector";
end if;
if Start.Index > V.Last then
raise Constraint_Error with
"Start position for iterator equals No_Element";
end if;
end if;
-- The value of its Index component influences the behavior of the First
-- and Last selector functions of the iterator object. When the Index
-- component is not No_Index (as is the case here), it means that this
-- is a partial iteration, over a subset of the complete sequence of
-- items. The iterator object was constructed with a start expression,
-- indicating the position from which the iteration begins. Note that
-- the start position has the same value irrespective of whether this
-- is a forward or reverse iteration.
return It : constant Iterator :=
(Limited_Controlled with
Container => V,
Index => Start.Index)
do
Busy (Container.TC'Unrestricted_Access.all);
end return;
end Iterate;
----------
-- Last --
----------
function Last (Container : Vector) return Cursor is
begin
if Is_Empty (Container) then
return No_Element;
end if;
return (Container'Unrestricted_Access, Container.Last);
end Last;
function Last (Object : Iterator) return Cursor is
begin
-- The value of the iterator object's Index component influences the
-- behavior of the Last (and First) selector function.
-- When the Index component is No_Index, this means the iterator
-- object was constructed without a start expression, in which case the
-- (reverse) iteration starts from the (logical) beginning of the entire
-- sequence (corresponding to Container.Last, for a reverse iterator).
-- Otherwise, this is iteration over a partial sequence of items.
-- When the Index component is not No_Index, the iterator object was
-- constructed with a start expression, that specifies the position
-- from which the (reverse) partial iteration begins.
if Object.Index = No_Index then
return Last (Object.Container.all);
else
return Cursor'(Object.Container, Object.Index);
end if;
end Last;
------------------
-- Last_Element --
------------------
function Last_Element (Container : Vector) return Element_Type is
begin
if Checks and then Container.Last = No_Index then
raise Constraint_Error with "Container is empty";
end if;
declare
EA : constant Element_Access :=
Container.Elements.EA (Container.Last);
begin
if Checks and then EA = null then
raise Constraint_Error with "last element is empty";
else
return EA.all;
end if;
end;
end Last_Element;
----------------
-- Last_Index --
----------------
function Last_Index (Container : Vector) return Extended_Index is
begin
return Container.Last;
end Last_Index;
------------
-- Length --
------------
function Length (Container : Vector) return Count_Type is
L : constant Index_Type'Base := Container.Last;
F : constant Index_Type := Index_Type'First;
begin
-- The base range of the index type (Index_Type'Base) might not include
-- all values for length (Count_Type). Contrariwise, the index type
-- might include values outside the range of length. Hence we use
-- whatever type is wider for intermediate values when calculating
-- length. Note that no matter what the index type is, the maximum
-- length to which a vector is allowed to grow is always the minimum
-- of Count_Type'Last and (IT'Last - IT'First + 1).
-- For example, an Index_Type with range -127 .. 127 is only guaranteed
-- to have a base range of -128 .. 127, but the corresponding vector
-- would have lengths in the range 0 .. 255. In this case we would need
-- to use Count_Type'Base for intermediate values.
-- Another case would be the index range -2**63 + 1 .. -2**63 + 10. The
-- vector would have a maximum length of 10, but the index values lie
-- outside the range of Count_Type (which is only 32 bits). In this
-- case we would need to use Index_Type'Base for intermediate values.
if Count_Type'Base'Last >= Index_Type'Pos (Index_Type'Base'Last) then
return Count_Type'Base (L) - Count_Type'Base (F) + 1;
else
return Count_Type (L - F + 1);
end if;
end Length;
----------
-- Move --
----------
procedure Move
(Target : in out Vector;
Source : in out Vector)
is
begin
if Target'Address = Source'Address then
return;
end if;
TC_Check (Source.TC);
Clear (Target); -- Checks busy-bit
declare
Target_Elements : constant Elements_Access := Target.Elements;
begin
Target.Elements := Source.Elements;
Source.Elements := Target_Elements;
end;
Target.Last := Source.Last;
Source.Last := No_Index;
end Move;
----------
-- Next --
----------
function Next (Position : Cursor) return Cursor is
begin
if Position.Container = null then
return No_Element;
elsif Position.Index < Position.Container.Last then
return (Position.Container, Position.Index + 1);
else
return No_Element;
end if;
end Next;
function Next (Object : Iterator; Position : Cursor) return Cursor is
begin
if Position.Container = null then
return No_Element;
elsif Checks and then Position.Container /= Object.Container then
raise Program_Error with
"Position cursor of Next designates wrong vector";
else
return Next (Position);
end if;
end Next;
procedure Next (Position : in out Cursor) is
begin
if Position.Container = null then
return;
elsif Position.Index < Position.Container.Last then
Position.Index := Position.Index + 1;
else
Position := No_Element;
end if;
end Next;
-------------
-- Prepend --
-------------
procedure Prepend (Container : in out Vector; New_Item : Vector) is
begin
Insert (Container, Index_Type'First, New_Item);
end Prepend;
procedure Prepend
(Container : in out Vector;
New_Item : Element_Type;
Count : Count_Type := 1)
is
begin
Insert (Container, Index_Type'First, New_Item, Count);
end Prepend;
--------------
-- Previous --
--------------
function Previous (Position : Cursor) return Cursor is
begin
if Position.Container = null then
return No_Element;
elsif Position.Index > Index_Type'First then
return (Position.Container, Position.Index - 1);
else
return No_Element;
end if;
end Previous;
function Previous (Object : Iterator; Position : Cursor) return Cursor is
begin
if Position.Container = null then
return No_Element;
elsif Checks and then Position.Container /= Object.Container then
raise Program_Error with
"Position cursor of Previous designates wrong vector";
else
return Previous (Position);
end if;
end Previous;
procedure Previous (Position : in out Cursor) is
begin
if Position.Container = null then
return;
elsif Position.Index > Index_Type'First then
Position.Index := Position.Index - 1;
else
Position := No_Element;
end if;
end Previous;
----------------------
-- Pseudo_Reference --
----------------------
function Pseudo_Reference
(Container : aliased Vector'Class) return Reference_Control_Type
is
TC : constant Tamper_Counts_Access := Container.TC'Unrestricted_Access;
begin
return R : constant Reference_Control_Type := (Controlled with TC) do
Lock (TC.all);
end return;
end Pseudo_Reference;
-------------------
-- Query_Element --
-------------------
procedure Query_Element
(Container : Vector;
Index : Index_Type;
Process : not null access procedure (Element : Element_Type))
is
Lock : With_Lock (Container.TC'Unrestricted_Access);
V : Vector renames Container'Unrestricted_Access.all;
begin
if Checks and then Index > Container.Last then
raise Constraint_Error with "Index is out of range";
end if;
if Checks and then V.Elements.EA (Index) = null then
raise Constraint_Error with "element is null";
end if;
Process (V.Elements.EA (Index).all);
end Query_Element;
procedure Query_Element
(Position : Cursor;
Process : not null access procedure (Element : Element_Type))
is
begin
if Checks and then Position.Container = null then
raise Constraint_Error with "Position cursor has no element";
else
Query_Element (Position.Container.all, Position.Index, Process);
end if;
end Query_Element;
----------
-- Read --
----------
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Container : out Vector)
is
Length : Count_Type'Base;
Last : Index_Type'Base := Index_Type'Pred (Index_Type'First);
B : Boolean;
begin
Clear (Container);
Count_Type'Base'Read (Stream, Length);
if Length > Capacity (Container) then
Reserve_Capacity (Container, Capacity => Length);
end if;
for J in Count_Type range 1 .. Length loop
Last := Last + 1;
Boolean'Read (Stream, B);
if B then
Container.Elements.EA (Last) :=
new Element_Type'(Element_Type'Input (Stream));
end if;
Container.Last := Last;
end loop;
end Read;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Position : out Cursor)
is
begin
raise Program_Error with "attempt to stream vector cursor";
end Read;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Reference_Type)
is
begin
raise Program_Error with "attempt to stream reference";
end Read;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Constant_Reference_Type)
is
begin
raise Program_Error with "attempt to stream reference";
end Read;
---------------
-- Reference --
---------------
function Reference
(Container : aliased in out Vector;
Position : Cursor) return Reference_Type
is
begin
if Checks then
if Position.Container = null then
raise Constraint_Error with "Position cursor has no element";
end if;
if Position.Container /= Container'Unrestricted_Access then
raise Program_Error with "Position cursor denotes wrong container";
end if;
if Position.Index > Position.Container.Last then
raise Constraint_Error with "Position cursor is out of range";
end if;
end if;
declare
TC : constant Tamper_Counts_Access :=
Container.TC'Unrestricted_Access;
begin
-- The following will raise Constraint_Error if Element is null
return R : constant Reference_Type :=
(Element => Container.Elements.EA (Position.Index),
Control => (Controlled with TC))
do
Lock (TC.all);
end return;
end;
end Reference;
function Reference
(Container : aliased in out Vector;
Index : Index_Type) return Reference_Type
is
begin
if Checks and then Index > Container.Last then
raise Constraint_Error with "Index is out of range";
end if;
declare
TC : constant Tamper_Counts_Access :=
Container.TC'Unrestricted_Access;
begin
-- The following will raise Constraint_Error if Element is null
return R : constant Reference_Type :=
(Element => Container.Elements.EA (Index),
Control => (Controlled with TC))
do
Lock (TC.all);
end return;
end;
end Reference;
---------------------
-- Replace_Element --
---------------------
procedure Replace_Element
(Container : in out Vector;
Index : Index_Type;
New_Item : Element_Type)
is
begin
if Checks and then Index > Container.Last then
raise Constraint_Error with "Index is out of range";
end if;
TE_Check (Container.TC);
declare
X : Element_Access := Container.Elements.EA (Index);
-- The element allocator may need an accessibility check in the case
-- where the actual type is class-wide or has access discriminants
-- (see RM 4.8(10.1) and AI12-0035).
pragma Unsuppress (Accessibility_Check);
begin
Container.Elements.EA (Index) := new Element_Type'(New_Item);
Free (X);
end;
end Replace_Element;
procedure Replace_Element
(Container : in out Vector;
Position : Cursor;
New_Item : Element_Type)
is
begin
if Checks then
if Position.Container = null then
raise Constraint_Error with "Position cursor has no element";
end if;
if Position.Container /= Container'Unrestricted_Access then
raise Program_Error with "Position cursor denotes wrong container";
end if;
if Position.Index > Container.Last then
raise Constraint_Error with "Position cursor is out of range";
end if;
end if;
TE_Check (Container.TC);
declare
X : Element_Access := Container.Elements.EA (Position.Index);
-- The element allocator may need an accessibility check in the case
-- where the actual type is class-wide or has access discriminants
-- (see RM 4.8(10.1) and AI12-0035).
pragma Unsuppress (Accessibility_Check);
begin
Container.Elements.EA (Position.Index) := new Element_Type'(New_Item);
Free (X);
end;
end Replace_Element;
----------------------
-- Reserve_Capacity --
----------------------
procedure Reserve_Capacity
(Container : in out Vector;
Capacity : Count_Type)
is
N : constant Count_Type := Length (Container);
Index : Count_Type'Base;
Last : Index_Type'Base;
begin
-- Reserve_Capacity can be used to either expand the storage available
-- for elements (this would be its typical use, in anticipation of
-- future insertion), or to trim back storage. In the latter case,
-- storage can only be trimmed back to the limit of the container
-- length. Note that Reserve_Capacity neither deletes (active) elements
-- nor inserts elements; it only affects container capacity, never
-- container length.
if Capacity = 0 then
-- This is a request to trim back storage, to the minimum amount
-- possible given the current state of the container.
if N = 0 then
-- The container is empty, so in this unique case we can
-- deallocate the entire internal array. Note that an empty
-- container can never be busy, so there's no need to check the
-- tampering bits.
declare
X : Elements_Access := Container.Elements;
begin
-- First we remove the internal array from the container, to
-- handle the case when the deallocation raises an exception
-- (although that's unlikely, since this is simply an array of
-- access values, all of which are null).
Container.Elements := null;
-- Container invariants have been restored, so it is now safe
-- to attempt to deallocate the internal array.
Free (X);
end;
elsif N < Container.Elements.EA'Length then
-- The container is not empty, and the current length is less than
-- the current capacity, so there's storage available to trim. In
-- this case, we allocate a new internal array having a length
-- that exactly matches the number of items in the
-- container. (Reserve_Capacity does not delete active elements,
-- so this is the best we can do with respect to minimizing
-- storage).
TC_Check (Container.TC);
declare
subtype Array_Index_Subtype is Index_Type'Base range
Index_Type'First .. Container.Last;
Src : Elements_Array renames
Container.Elements.EA (Array_Index_Subtype);
X : Elements_Access := Container.Elements;
begin
-- Although we have isolated the old internal array that we're
-- going to deallocate, we don't deallocate it until we have
-- successfully allocated a new one. If there is an exception
-- during allocation (because there is not enough storage), we
-- let it propagate without causing any side-effect.
Container.Elements := new Elements_Type'(Container.Last, Src);
-- We have successfully allocated a new internal array (with a
-- smaller length than the old one, and containing a copy of
-- just the active elements in the container), so we can
-- deallocate the old array.
Free (X);
end;
end if;
return;
end if;
-- Reserve_Capacity can be used to expand the storage available for
-- elements, but we do not let the capacity grow beyond the number of
-- values in Index_Type'Range. (Were it otherwise, there would be no way
-- to refer to the elements with index values greater than
-- Index_Type'Last, so that storage would be wasted.) Here we compute
-- the Last index value of the new internal array, in a way that avoids
-- any possibility of overflow.
if Index_Type'Base'Last >= Count_Type_Last then
-- We perform a two-part test. First we determine whether the
-- computed Last value lies in the base range of the type, and then
-- determine whether it lies in the range of the index (sub)type.
-- Last must satisfy this relation:
-- First + Length - 1 <= Last
-- We regroup terms:
-- First - 1 <= Last - Length
-- Which can rewrite as:
-- No_Index <= Last - Length
if Checks and then
Index_Type'Base'Last - Index_Type'Base (Capacity) < No_Index
then
raise Constraint_Error with "Capacity is out of range";
end if;
-- We now know that the computed value of Last is within the base
-- range of the type, so it is safe to compute its value:
Last := No_Index + Index_Type'Base (Capacity);
-- Finally we test whether the value is within the range of the
-- generic actual index subtype:
if Checks and then Last > Index_Type'Last then
raise Constraint_Error with "Capacity is out of range";
end if;
elsif Index_Type'First <= 0 then
-- Here we can compute Last directly, in the normal way. We know that
-- No_Index is less than 0, so there is no danger of overflow when
-- adding the (positive) value of Capacity.
Index := Count_Type'Base (No_Index) + Capacity; -- Last
if Checks and then Index > Count_Type'Base (Index_Type'Last) then
raise Constraint_Error with "Capacity is out of range";
end if;
-- We know that the computed value (having type Count_Type) of Last
-- is within the range of the generic actual index subtype, so it is
-- safe to convert to Index_Type:
Last := Index_Type'Base (Index);
else
-- Here Index_Type'First (and Index_Type'Last) is positive, so we
-- must test the length indirectly (by working backwards from the
-- largest possible value of Last), in order to prevent overflow.
Index := Count_Type'Base (Index_Type'Last) - Capacity; -- No_Index
if Checks and then Index < Count_Type'Base (No_Index) then
raise Constraint_Error with "Capacity is out of range";
end if;
-- We have determined that the value of Capacity would not create a
-- Last index value outside of the range of Index_Type, so we can now
-- safely compute its value.
Last := Index_Type'Base (Count_Type'Base (No_Index) + Capacity);
end if;
-- The requested capacity is non-zero, but we don't know yet whether
-- this is a request for expansion or contraction of storage.
if Container.Elements = null then
-- The container is empty (it doesn't even have an internal array),
-- so this represents a request to allocate storage having the given
-- capacity.
Container.Elements := new Elements_Type (Last);
return;
end if;
if Capacity <= N then
-- This is a request to trim back storage, but only to the limit of
-- what's already in the container. (Reserve_Capacity never deletes
-- active elements, it only reclaims excess storage.)
if N < Container.Elements.EA'Length then
-- The container is not empty (because the requested capacity is
-- positive, and less than or equal to the container length), and
-- the current length is less than the current capacity, so there
-- is storage available to trim. In this case, we allocate a new
-- internal array having a length that exactly matches the number
-- of items in the container.
TC_Check (Container.TC);
declare
subtype Array_Index_Subtype is Index_Type'Base range
Index_Type'First .. Container.Last;
Src : Elements_Array renames
Container.Elements.EA (Array_Index_Subtype);
X : Elements_Access := Container.Elements;
begin
-- Although we have isolated the old internal array that we're
-- going to deallocate, we don't deallocate it until we have
-- successfully allocated a new one. If there is an exception
-- during allocation (because there is not enough storage), we
-- let it propagate without causing any side-effect.
Container.Elements := new Elements_Type'(Container.Last, Src);
-- We have successfully allocated a new internal array (with a
-- smaller length than the old one, and containing a copy of
-- just the active elements in the container), so it is now
-- safe to deallocate the old array.
Free (X);
end;
end if;
return;
end if;
-- The requested capacity is larger than the container length (the
-- number of active elements). Whether this represents a request for
-- expansion or contraction of the current capacity depends on what the
-- current capacity is.
if Capacity = Container.Elements.EA'Length then
-- The requested capacity matches the existing capacity, so there's
-- nothing to do here. We treat this case as a no-op, and simply
-- return without checking the busy bit.
return;
end if;
-- There is a change in the capacity of a non-empty container, so a new
-- internal array will be allocated. (The length of the new internal
-- array could be less or greater than the old internal array. We know
-- only that the length of the new internal array is greater than the
-- number of active elements in the container.) We must check whether
-- the container is busy before doing anything else.
TC_Check (Container.TC);
-- We now allocate a new internal array, having a length different from
-- its current value.
declare
X : Elements_Access := Container.Elements;
subtype Index_Subtype is Index_Type'Base range
Index_Type'First .. Container.Last;
begin
-- We now allocate a new internal array, having a length different
-- from its current value.
Container.Elements := new Elements_Type (Last);
-- We have successfully allocated the new internal array, so now we
-- move the existing elements from the existing the old internal
-- array onto the new one. Note that we're just copying access
-- values, to this should not raise any exceptions.
Container.Elements.EA (Index_Subtype) := X.EA (Index_Subtype);
-- We have moved the elements from the old internal array, so now we
-- can deallocate it.
Free (X);
end;
end Reserve_Capacity;
----------------------
-- Reverse_Elements --
----------------------
procedure Reverse_Elements (Container : in out Vector) is
begin
if Container.Length <= 1 then
return;
end if;
-- The exception behavior for the vector container must match that for
-- the list container, so we check for cursor tampering here (which will
-- catch more things) instead of for element tampering (which will catch
-- fewer things). It's true that the elements of this vector container
-- could be safely moved around while (say) an iteration is taking place
-- (iteration only increments the busy counter), and so technically all
-- we would need here is a test for element tampering (indicated by the
-- lock counter), that's simply an artifact of our array-based
-- implementation. Logically Reverse_Elements requires a check for
-- cursor tampering.
TC_Check (Container.TC);
declare
I : Index_Type;
J : Index_Type;
E : Elements_Array renames Container.Elements.EA;
begin
I := Index_Type'First;
J := Container.Last;
while I < J loop
declare
EI : constant Element_Access := E (I);
begin
E (I) := E (J);
E (J) := EI;
end;
I := I + 1;
J := J - 1;
end loop;
end;
end Reverse_Elements;
------------------
-- Reverse_Find --
------------------
function Reverse_Find
(Container : Vector;
Item : Element_Type;
Position : Cursor := No_Element) return Cursor
is
Last : Index_Type'Base;
begin
if Checks and then Position.Container /= null
and then Position.Container /= Container'Unrestricted_Access
then
raise Program_Error with "Position cursor denotes wrong container";
end if;
Last :=
(if Position.Container = null or else Position.Index > Container.Last
then Container.Last
else Position.Index);
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
declare
Lock : With_Lock (Container.TC'Unrestricted_Access);
begin
for Indx in reverse Index_Type'First .. Last loop
if Container.Elements.EA (Indx) /= null
and then Container.Elements.EA (Indx).all = Item
then
return Cursor'(Container'Unrestricted_Access, Indx);
end if;
end loop;
return No_Element;
end;
end Reverse_Find;
------------------------
-- Reverse_Find_Index --
------------------------
function Reverse_Find_Index
(Container : Vector;
Item : Element_Type;
Index : Index_Type := Index_Type'Last) return Extended_Index
is
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
Lock : With_Lock (Container.TC'Unrestricted_Access);
Last : constant Index_Type'Base :=
Index_Type'Min (Container.Last, Index);
begin
for Indx in reverse Index_Type'First .. Last loop
if Container.Elements.EA (Indx) /= null
and then Container.Elements.EA (Indx).all = Item
then
return Indx;
end if;
end loop;
return No_Index;
end Reverse_Find_Index;
---------------------
-- Reverse_Iterate --
---------------------
procedure Reverse_Iterate
(Container : Vector;
Process : not null access procedure (Position : Cursor))
is
Busy : With_Busy (Container.TC'Unrestricted_Access);
begin
for Indx in reverse Index_Type'First .. Container.Last loop
Process (Cursor'(Container'Unrestricted_Access, Indx));
end loop;
end Reverse_Iterate;
----------------
-- Set_Length --
----------------
procedure Set_Length (Container : in out Vector; Length : Count_Type) is
Count : constant Count_Type'Base := Container.Length - Length;
begin
-- Set_Length allows the user to set the length explicitly, instead of
-- implicitly as a side-effect of deletion or insertion. If the
-- requested length is less than the current length, this is equivalent
-- to deleting items from the back end of the vector. If the requested
-- length is greater than the current length, then this is equivalent to
-- inserting "space" (nonce items) at the end.
if Count >= 0 then
Container.Delete_Last (Count);
elsif Checks and then Container.Last >= Index_Type'Last then
raise Constraint_Error with "vector is already at its maximum length";
else
Container.Insert_Space (Container.Last + 1, -Count);
end if;
end Set_Length;
----------
-- Swap --
----------
procedure Swap (Container : in out Vector; I, J : Index_Type) is
begin
if Checks then
if I > Container.Last then
raise Constraint_Error with "I index is out of range";
end if;
if J > Container.Last then
raise Constraint_Error with "J index is out of range";
end if;
end if;
if I = J then
return;
end if;
TE_Check (Container.TC);
declare
EI : Element_Access renames Container.Elements.EA (I);
EJ : Element_Access renames Container.Elements.EA (J);
EI_Copy : constant Element_Access := EI;
begin
EI := EJ;
EJ := EI_Copy;
end;
end Swap;
procedure Swap
(Container : in out Vector;
I, J : Cursor)
is
begin
if Checks then
if I.Container = null then
raise Constraint_Error with "I cursor has no element";
end if;
if J.Container = null then
raise Constraint_Error with "J cursor has no element";
end if;
if I.Container /= Container'Unrestricted_Access then
raise Program_Error with "I cursor denotes wrong container";
end if;
if J.Container /= Container'Unrestricted_Access then
raise Program_Error with "J cursor denotes wrong container";
end if;
end if;
Swap (Container, I.Index, J.Index);
end Swap;
---------------
-- To_Cursor --
---------------
function To_Cursor
(Container : Vector;
Index : Extended_Index) return Cursor
is
begin
if Index not in Index_Type'First .. Container.Last then
return No_Element;
end if;
return Cursor'(Container'Unrestricted_Access, Index);
end To_Cursor;
--------------
-- To_Index --
--------------
function To_Index (Position : Cursor) return Extended_Index is
begin
if Position.Container = null then
return No_Index;
elsif Position.Index <= Position.Container.Last then
return Position.Index;
else
return No_Index;
end if;
end To_Index;
---------------
-- To_Vector --
---------------
function To_Vector (Length : Count_Type) return Vector is
Index : Count_Type'Base;
Last : Index_Type'Base;
Elements : Elements_Access;
begin
if Length = 0 then
return Empty_Vector;
end if;
-- We create a vector object with a capacity that matches the specified
-- Length, but we do not allow the vector capacity (the length of the
-- internal array) to exceed the number of values in Index_Type'Range
-- (otherwise, there would be no way to refer to those components via an
-- index). We must therefore check whether the specified Length would
-- create a Last index value greater than Index_Type'Last.
if Index_Type'Base'Last >= Count_Type_Last then
-- We perform a two-part test. First we determine whether the
-- computed Last value lies in the base range of the type, and then
-- determine whether it lies in the range of the index (sub)type.
-- Last must satisfy this relation:
-- First + Length - 1 <= Last
-- We regroup terms:
-- First - 1 <= Last - Length
-- Which can rewrite as:
-- No_Index <= Last - Length
if Checks and then
Index_Type'Base'Last - Index_Type'Base (Length) < No_Index
then
raise Constraint_Error with "Length is out of range";
end if;
-- We now know that the computed value of Last is within the base
-- range of the type, so it is safe to compute its value:
Last := No_Index + Index_Type'Base (Length);
-- Finally we test whether the value is within the range of the
-- generic actual index subtype:
if Checks and then Last > Index_Type'Last then
raise Constraint_Error with "Length is out of range";
end if;
elsif Index_Type'First <= 0 then
-- Here we can compute Last directly, in the normal way. We know that
-- No_Index is less than 0, so there is no danger of overflow when
-- adding the (positive) value of Length.
Index := Count_Type'Base (No_Index) + Length; -- Last
if Checks and then Index > Count_Type'Base (Index_Type'Last) then
raise Constraint_Error with "Length is out of range";
end if;
-- We know that the computed value (having type Count_Type) of Last
-- is within the range of the generic actual index subtype, so it is
-- safe to convert to Index_Type:
Last := Index_Type'Base (Index);
else
-- Here Index_Type'First (and Index_Type'Last) is positive, so we
-- must test the length indirectly (by working backwards from the
-- largest possible value of Last), in order to prevent overflow.
Index := Count_Type'Base (Index_Type'Last) - Length; -- No_Index
if Checks and then Index < Count_Type'Base (No_Index) then
raise Constraint_Error with "Length is out of range";
end if;
-- We have determined that the value of Length would not create a
-- Last index value outside of the range of Index_Type, so we can now
-- safely compute its value.
Last := Index_Type'Base (Count_Type'Base (No_Index) + Length);
end if;
Elements := new Elements_Type (Last);
return Vector'(Controlled with Elements, Last, TC => <>);
end To_Vector;
function To_Vector
(New_Item : Element_Type;
Length : Count_Type) return Vector
is
Index : Count_Type'Base;
Last : Index_Type'Base;
Elements : Elements_Access;
begin
if Length = 0 then
return Empty_Vector;
end if;
-- We create a vector object with a capacity that matches the specified
-- Length, but we do not allow the vector capacity (the length of the
-- internal array) to exceed the number of values in Index_Type'Range
-- (otherwise, there would be no way to refer to those components via an
-- index). We must therefore check whether the specified Length would
-- create a Last index value greater than Index_Type'Last.
if Index_Type'Base'Last >= Count_Type_Last then
-- We perform a two-part test. First we determine whether the
-- computed Last value lies in the base range of the type, and then
-- determine whether it lies in the range of the index (sub)type.
-- Last must satisfy this relation:
-- First + Length - 1 <= Last
-- We regroup terms:
-- First - 1 <= Last - Length
-- Which can rewrite as:
-- No_Index <= Last - Length
if Checks and then
Index_Type'Base'Last - Index_Type'Base (Length) < No_Index
then
raise Constraint_Error with "Length is out of range";
end if;
-- We now know that the computed value of Last is within the base
-- range of the type, so it is safe to compute its value:
Last := No_Index + Index_Type'Base (Length);
-- Finally we test whether the value is within the range of the
-- generic actual index subtype:
if Checks and then Last > Index_Type'Last then
raise Constraint_Error with "Length is out of range";
end if;
elsif Index_Type'First <= 0 then
-- Here we can compute Last directly, in the normal way. We know that
-- No_Index is less than 0, so there is no danger of overflow when
-- adding the (positive) value of Length.
Index := Count_Type'Base (No_Index) + Length; -- Last
if Checks and then Index > Count_Type'Base (Index_Type'Last) then
raise Constraint_Error with "Length is out of range";
end if;
-- We know that the computed value (having type Count_Type) of Last
-- is within the range of the generic actual index subtype, so it is
-- safe to convert to Index_Type:
Last := Index_Type'Base (Index);
else
-- Here Index_Type'First (and Index_Type'Last) is positive, so we
-- must test the length indirectly (by working backwards from the
-- largest possible value of Last), in order to prevent overflow.
Index := Count_Type'Base (Index_Type'Last) - Length; -- No_Index
if Checks and then Index < Count_Type'Base (No_Index) then
raise Constraint_Error with "Length is out of range";
end if;
-- We have determined that the value of Length would not create a
-- Last index value outside of the range of Index_Type, so we can now
-- safely compute its value.
Last := Index_Type'Base (Count_Type'Base (No_Index) + Length);
end if;
Elements := new Elements_Type (Last);
-- We use Last as the index of the loop used to populate the internal
-- array with items. In general, we prefer to initialize the loop index
-- immediately prior to entering the loop. However, Last is also used in
-- the exception handler (to reclaim elements that have been allocated,
-- before propagating the exception), and the initialization of Last
-- after entering the block containing the handler confuses some static
-- analysis tools, with respect to whether Last has been properly
-- initialized when the handler executes. So here we initialize our loop
-- variable earlier than we prefer, before entering the block, so there
-- is no ambiguity.
Last := Index_Type'First;
declare
-- The element allocator may need an accessibility check in the case
-- where the actual type is class-wide or has access discriminants
-- (see RM 4.8(10.1) and AI12-0035).
pragma Unsuppress (Accessibility_Check);
begin
loop
Elements.EA (Last) := new Element_Type'(New_Item);
exit when Last = Elements.Last;
Last := Last + 1;
end loop;
exception
when others =>
for J in Index_Type'First .. Last - 1 loop
Free (Elements.EA (J));
end loop;
Free (Elements);
raise;
end;
return (Controlled with Elements, Last, TC => <>);
end To_Vector;
--------------------
-- Update_Element --
--------------------
procedure Update_Element
(Container : in out Vector;
Index : Index_Type;
Process : not null access procedure (Element : in out Element_Type))
is
Lock : With_Lock (Container.TC'Unchecked_Access);
begin
if Checks and then Index > Container.Last then
raise Constraint_Error with "Index is out of range";
end if;
if Checks and then Container.Elements.EA (Index) = null then
raise Constraint_Error with "element is null";
end if;
Process (Container.Elements.EA (Index).all);
end Update_Element;
procedure Update_Element
(Container : in out Vector;
Position : Cursor;
Process : not null access procedure (Element : in out Element_Type))
is
begin
if Checks then
if Position.Container = null then
raise Constraint_Error with "Position cursor has no element";
elsif Position.Container /= Container'Unrestricted_Access then
raise Program_Error with "Position cursor denotes wrong container";
end if;
end if;
Update_Element (Container, Position.Index, Process);
end Update_Element;
-----------
-- Write --
-----------
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Container : Vector)
is
N : constant Count_Type := Length (Container);
begin
Count_Type'Base'Write (Stream, N);
if N = 0 then
return;
end if;
declare
E : Elements_Array renames Container.Elements.EA;
begin
for Indx in Index_Type'First .. Container.Last loop
if E (Indx) = null then
Boolean'Write (Stream, False);
else
Boolean'Write (Stream, True);
Element_Type'Output (Stream, E (Indx).all);
end if;
end loop;
end;
end Write;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Position : Cursor)
is
begin
raise Program_Error with "attempt to stream vector cursor";
end Write;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Reference_Type)
is
begin
raise Program_Error with "attempt to stream reference";
end Write;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Constant_Reference_Type)
is
begin
raise Program_Error with "attempt to stream reference";
end Write;
end Ada.Containers.Indefinite_Vectors;
| 34.496998 | 79 | 0.594231 |
290e42095bf1cc49298c19c5f22aaed5a294ddd9 | 4,046 | adb | Ada | 1A/S5/PIM/tps/tp2/specifier_et_tester.adb | MOUDDENEHamza/ENSEEIHT | a90b1dee0c8d18a9578153a357278d99405bb534 | [
"Apache-2.0"
] | 4 | 2020-05-02T12:32:32.000Z | 2022-01-12T20:20:35.000Z | 1A/S5/PIM/tps/tp2/specifier_et_tester.adb | MOUDDENEHamza/ENSEEIHT | a90b1dee0c8d18a9578153a357278d99405bb534 | [
"Apache-2.0"
] | 2 | 2021-01-14T20:03:26.000Z | 2022-01-30T01:10:00.000Z | 1A/S5/PIM/tps/tp2/specifier_et_tester.adb | MOUDDENEHamza/ENSEEIHT | a90b1dee0c8d18a9578153a357278d99405bb534 | [
"Apache-2.0"
] | 13 | 2020-11-11T21:28:11.000Z | 2022-02-19T13:54:22.000Z | with Ada.Text_IO;
use Ada.Text_IO;
procedure Specifier_Et_Tester is
-- Calculer le plus grand commun diviseur de deux entiers strictement
-- positifs.
-- Paramètres :
-- A : in Entier
-- B : in Entier
-- Retour : Entier -- le pgcd de A et B
-- Nécessite :
-- A > 0
-- B > 0
-- Assure :
-- Pgcd'Result >= 1
-- A mod Pgcd'Résultat = 0 -- le pgcd divise A
-- B mod Pgcd'Résultat = 0 -- le pgcd divise B
-- -- c'est le plus grand des entiers qui divisent A et B
-- // mais on ne sait pas l'exprimer simplement
-- Exemples : voir Tester_Pgcd
-- Efficacité : faible car on utilise une version naïve de l'algorithme
-- d'Euclide.
function Pgcd (A, B : in Integer) return Integer with
Pre => A > 0 and B > 0,
Post => Pgcd'Result >= 1
and A mod Pgcd'Result = 0 -- Le Pgcd divise A
and B mod Pgcd'Result = 0 -- Le Pgcd divise B
is
L_A, L_B: Integer; -- variables correspondant à A et B
-- A et B étant en in, on ne peut pas les modifier dans la
-- fonction. Or pour appliquer l'algortihme d'Euclide, il faut
-- retrancher le plus petit au plus grand jusqu'à avoir deux
-- nombres égaux. Nous passons donc par des variables locales et
-- utilisons le nom des paramètres formels préfixés par 'L_'.
begin
L_A := A;
L_B := B;
while L_A /= L_B loop
-- soustraire au plus grand le plus petit
if L_A > L_B then
L_A := L_A - L_B;
else
L_B := L_B - L_A;
end if;
end loop;
pragma Assert (L_A = L_B); -- la condition de sortie de boucle.
return L_A;
end Pgcd;
-- Exemple d'utilisation du Pgcd.
-- Est-ce que le corps de cette procédure est correct ? Pourquoi ?
-- Que donne son exécution ?
-- Non le corps de cette procédure n'est pas correct car A ET B doivent
-- etre strictement positifs.
-- Ça va boucler à l'infini lors de l'éxecution
procedure Utiliser_Pgcd is
Resultat: Integer;
begin
Resultat := Pgcd (0, 10);
Put ("Pgcd (0, 10) = " & Integer'Image(Resultat));
end Utiliser_Pgcd;
-- Permuter deux entiers.
-- Paramètres :
-- A, B : in out Entier -- les deux entiers à permuter
-- Nécessite : Néant
-- Assure :
-- A = B'Avant et B = A'Avant -- les valeurs de A et B sont bien permutées
procedure Permuter (A, B: in out Integer) with
Post => A = B'Old and B = A'Old
is
Copie_A : Integer;
begin
Copie_A := A;
A := B;
B := Copie_A;
end Permuter;
-- Procédure de test de Pgcd.
-- -- Parce que c'est une procédure de test, elle n'a pas de paramètre,
-- -- pas de type de retour, pas de précondition, pas de postcondition.
procedure Tester_Pgcd is
begin
pragma Assert (4 = Pgcd (4, 4)); -- A = B
pragma Assert (2 = Pgcd (10, 16)); -- A < B
pragma Assert (1 = Pgcd (21, 10)); -- A > B
pragma Assert (3 = Pgcd (105, 147)); -- un autre
end Tester_Pgcd;
-- Procédure de test pour mettre en évidence la faible efficacité de Pgcd.
procedure Tester_Performance_Pgcd is
begin
pragma Assert (1 = Pgcd (1, 10 ** 9)); -- lent !
end Tester_Performance_Pgcd;
-- Procédure de test de Permuter.
procedure Tester_Permuter is
N1, N2: Integer;
begin
-- initialiser les données du test
N1 := 5;
N2 := 18;
-- lancer la procédure à tester
Permuter (N1, N2);
-- contrôler que la procédure a eu l'effet escompté
pragma Assert (18 = N1);
pragma Assert (5 = N2);
end Tester_Permuter;
begin
--Utiliser_Pgcd;
-- lancer les programmes de test.
Tester_Pgcd;
Tester_Performance_Pgcd;
Tester_Permuter;
Put_Line ("Fini.");
end Specifier_Et_Tester;
| 31.364341 | 80 | 0.569451 |
29b140d7598a9e7b2a3b70cd0cafbaab62ba9bc5 | 226 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/warn10.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/warn10.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/warn10.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- { dg-do compile }
-- { dg-options "-O3 -gnatn -Winline" }
package body Warn10 is
procedure Do_Something(Driver : My_Driver) is
X : Float;
begin
X := Get_Input_Value( Driver, 1, 1);
end;
end Warn10;
| 17.384615 | 48 | 0.610619 |
572b766d6a203d528a39a045ca0f6a4dbc0ad73c | 2,469 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-strhas.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-strhas.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-strhas.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- A D A . S T R I N G S . H A S H --
-- --
-- B o d y --
-- --
-- Copyright (C) 2004-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/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
with System.String_Hash;
function Ada.Strings.Hash (Key : String) return Containers.Hash_Type is
use Ada.Containers;
function Hash is new System.String_Hash.Hash
(Character, String, Hash_Type);
begin
return Hash (Key);
end Ada.Strings.Hash;
| 63.307692 | 78 | 0.399757 |
c71e8aa928568c8557b6f3e41664284c213950d0 | 4,517 | ads | Ada | awa/src/awa-permissions-services.ads | Letractively/ada-awa | 3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe | [
"Apache-2.0"
] | null | null | null | awa/src/awa-permissions-services.ads | Letractively/ada-awa | 3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe | [
"Apache-2.0"
] | null | null | null | awa/src/awa-permissions-services.ads | Letractively/ada-awa | 3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- awa-permissions-services -- Permissions controller
-- Copyright (C) 2011, 2012, 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 AWA.Applications;
with Util.Beans.Objects;
with EL.Functions;
with ADO;
with ADO.Sessions;
with ADO.Objects;
with Security.Policies;
with Security.Contexts;
package AWA.Permissions.Services is
-- Register the security EL functions in the EL mapper.
procedure Set_Functions (Mapper : in out EL.Functions.Function_Mapper'Class);
type Permission_Manager is new Security.Policies.Policy_Manager with private;
type Permission_Manager_Access is access all Permission_Manager'Class;
-- Get the permission manager associated with the security context.
-- Returns null if there is none.
function Get_Permission_Manager (Context : in Security.Contexts.Security_Context'Class)
return Permission_Manager_Access;
-- Get the application instance.
function Get_Application (Manager : in Permission_Manager)
return AWA.Applications.Application_Access;
-- Set the application instance.
procedure Set_Application (Manager : in out Permission_Manager;
App : in AWA.Applications.Application_Access);
-- Add a permission for the current user to access the entity identified by
-- <b>Entity</b> and <b>Kind</b>.
procedure Add_Permission (Manager : in Permission_Manager;
Entity : in ADO.Identifier;
Kind : in ADO.Entity_Type;
Permission : in Permission_Type);
-- Check that the current user has the specified permission.
-- Raise NO_PERMISSION exception if the user does not have the permission.
procedure Check_Permission (Manager : in Permission_Manager;
Entity : in ADO.Identifier;
Kind : in ADO.Entity_Type;
Permission : in Permission_Type);
-- Add a permission for the user <b>User</b> to access the entity identified by
-- <b>Entity</b> which is of type <b>Kind</b>.
procedure Add_Permission (Session : in out ADO.Sessions.Master_Session;
User : in ADO.Identifier;
Entity : in ADO.Identifier;
Kind : in ADO.Entity_Type;
Permission : in Permission_Type := READ);
-- Add a permission for the user <b>User</b> to access the entity identified by
-- <b>Entity</b>.
procedure Add_Permission (Session : in out ADO.Sessions.Master_Session;
User : in ADO.Identifier;
Entity : in ADO.Objects.Object_Ref'Class;
Permission : in Permission_Type := READ);
-- Create a permission manager for the given application.
function Create_Permission_Manager (App : in AWA.Applications.Application_Access)
return Security.Policies.Policy_Manager_Access;
-- Check if the permission with the name <tt>Name</tt> is granted for the current user.
-- If the <tt>Entity</tt> is defined, an <tt>Entity_Permission</tt> is created and verified.
-- Returns True if the user is granted the given permission.
function Has_Permission (Name : in Util.Beans.Objects.Object;
Entity : in Util.Beans.Objects.Object)
return Util.Beans.Objects.Object;
private
type Permission_Manager is new Security.Policies.Policy_Manager with record
App : AWA.Applications.Application_Access := null;
end record;
end AWA.Permissions.Services;
| 45.626263 | 96 | 0.62453 |
29d037fd00f45e43982ab4dd6bedc0a626cdc6b1 | 1,535 | ads | Ada | source/asis/spec/annex_c/ada-interrupts.ads | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | 4 | 2016-02-05T15:51:56.000Z | 2022-03-25T20:38:32.000Z | source/asis/spec/annex_c/ada-interrupts.ads | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | null | null | null | source/asis/spec/annex_c/ada-interrupts.ads | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- A d a r u n - t i m e s p e c i f i c a t i o n --
-- ASIS implementation for Gela project, a portable Ada compiler --
-- http://gela.ada-ru.org --
-- - - - - - - - - - - - - - - - --
-- Read copyright and license at the end of ada.ads file --
------------------------------------------------------------------------------
-- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $
with System;
package Ada.Interrupts is
type Interrupt_ID is (Implementation_Defined);
type Parameterless_Handler is access protected procedure;
function Is_Reserved (Interrupt : in Interrupt_ID) return Boolean;
function Is_Attached (Interrupt : in Interrupt_ID) return Boolean;
function Current_Handler (Interrupt : in Interrupt_ID)
return Parameterless_Handler;
procedure Attach_Handler (New_Handler : in Parameterless_Handler;
Interrupt : in Interrupt_ID);
procedure Exchange_Handler (Old_Handler : out Parameterless_Handler;
New_Handler : in Parameterless_Handler;
Interrupt : in Interrupt_ID);
procedure Detach_Handler (Interrupt : in Interrupt_ID);
function Reference (Interrupt : in Interrupt_ID) return System.Address;
private
end Ada.Interrupts;
| 39.358974 | 78 | 0.527687 |
571f0861ebefe3a6c42e937fb05568856c7c11b3 | 2,563 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/mdll-fil.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/mdll-fil.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/mdll-fil.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- M D L L . F I L E S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2007, 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. --
-- --
------------------------------------------------------------------------------
-- Simple services used by GNATDLL to deal with Filename extension
package MDLL.Fil is
No_Ext : constant String := "";
-- Used to mark the absence of an extension
function Get_Ext (Filename : String) return String;
-- Return extension of Filename
function Is_Ali (Filename : String) return Boolean;
-- Test if Filename is an Ada library file (.ali)
function Is_Obj (Filename : String) return Boolean;
-- Test if Filename is an object file (.o or .obj)
function Ext_To
(Filename : String;
New_Ext : String := No_Ext)
return String;
-- Return Filename with the extension change to New_Ext
end MDLL.Fil;
| 52.306122 | 78 | 0.447913 |
3d02d105012e41a4933cf42958271851124fa273 | 1,584 | adb | Ada | source/tasking/a-sytaco.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/tasking/a-sytaco.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/tasking/a-sytaco.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | with System.Synchronous_Objects.Abortable;
with System.Tasks;
package body Ada.Synchronous_Task_Control is
-- implementation
procedure Set_True (S : in out Suspension_Object) is
begin
System.Synchronous_Objects.Set (S.Object);
end Set_True;
procedure Set_False (S : in out Suspension_Object) is
begin
System.Synchronous_Objects.Reset (S.Object);
end Set_False;
function Current_State (S : Suspension_Object) return Boolean is
begin
return System.Synchronous_Objects.Get (S.Object);
end Current_State;
procedure Suspend_Until_True (
S : in out Suspension_Object;
Multi : Boolean := False)
is
Aborted : Boolean;
begin
if System.Storage_Barriers.atomic_test_and_set (S.Waiting'Access)
and then not Multi
then
raise Program_Error; -- CXDA002, the waiter is limited to one
end if;
System.Tasks.Enable_Abort;
System.Synchronous_Objects.Abortable.Wait (
S.Object,
Aborted => Aborted);
System.Storage_Barriers.atomic_clear (S.Waiting'Access);
System.Tasks.Disable_Abort (Aborted);
end Suspend_Until_True;
overriding procedure Initialize (Object : in out Suspension_Object) is
begin
System.Storage_Barriers.atomic_clear (Object.Waiting'Access);
System.Synchronous_Objects.Initialize (Object.Object);
end Initialize;
overriding procedure Finalize (Object : in out Suspension_Object) is
begin
System.Synchronous_Objects.Finalize (Object.Object);
end Finalize;
end Ada.Synchronous_Task_Control;
| 29.886792 | 73 | 0.717803 |
2f76bab9eca1d4f2628fd2072ea70da821f83eaf | 68,105 | adb | Ada | honeybee_proj/HBE/.autopilot/db/honeybee.adb | AnthonyKenny98/HoneyBee | 5b1859fe8c50cb5bd709f53780c4e5ce7160b987 | [
"MIT"
] | null | null | null | honeybee_proj/HBE/.autopilot/db/honeybee.adb | AnthonyKenny98/HoneyBee | 5b1859fe8c50cb5bd709f53780c4e5ce7160b987 | [
"MIT"
] | null | null | null | honeybee_proj/HBE/.autopilot/db/honeybee.adb | AnthonyKenny98/HoneyBee | 5b1859fe8c50cb5bd709f53780c4e5ce7160b987 | [
"MIT"
] | 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/>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>honeybee</name>
<ret_bitwidth>64</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>6</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>edge_p1_x</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>edge_y.p1.x</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>edge_p1_y</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>edge_y.p1.z</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>edge_p1_z</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>edge_y.p1.y</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="_4">
<Value>
<Obj>
<type>1</type>
<id>4</id>
<name>edge_p2_x</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>edge_y.p2.x</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="_5">
<Value>
<Obj>
<type>1</type>
<id>5</id>
<name>edge_p2_y</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>edge_y.p2.z</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="_6">
<Value>
<Obj>
<type>1</type>
<id>6</id>
<name>edge_p2_z</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>edge_y.p2.y</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>12</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>edge_p2_z_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>148</lineNumber>
<contextFuncName>honeybee</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/mnt/hgfs/Thesis/HoneyBee</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/honeybee.c</first>
<second>honeybee</second>
</first>
<second>148</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<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>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>edge_p2_y_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>148</lineNumber>
<contextFuncName>honeybee</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>honeybee</second>
</first>
<second>148</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>31</item>
<item>32</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>edge_p2_x_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>148</lineNumber>
<contextFuncName>honeybee</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>honeybee</second>
</first>
<second>148</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>33</item>
<item>34</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>edge_p1_z_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>148</lineNumber>
<contextFuncName>honeybee</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>honeybee</second>
</first>
<second>148</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>35</item>
<item>36</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>edge_p1_y_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>148</lineNumber>
<contextFuncName>honeybee</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>honeybee</second>
</first>
<second>148</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>37</item>
<item>38</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>edge_p1_x_read</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>148</lineNumber>
<contextFuncName>honeybee</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>honeybee</second>
</first>
<second>148</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>39</item>
<item>40</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>collisions_z</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>155</lineNumber>
<contextFuncName>honeybee</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>honeybee</second>
</first>
<second>155</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>collisions_z</originalName>
<rtlName>grp_checkAxis_2_fu_64</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>7</count>
<item_version>0</item_version>
<item>42</item>
<item>43</item>
<item>44</item>
<item>45</item>
<item>46</item>
<item>47</item>
<item>48</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.75</m_delay>
<m_topoIndex>7</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>collisions_y</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>156</lineNumber>
<contextFuncName>honeybee</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>honeybee</second>
</first>
<second>156</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>collisions_y</originalName>
<rtlName>grp_checkAxis_0_fu_96</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>7</count>
<item_version>0</item_version>
<item>50</item>
<item>51</item>
<item>52</item>
<item>53</item>
<item>54</item>
<item>55</item>
<item>56</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.75</m_delay>
<m_topoIndex>8</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>collisions_x</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>157</lineNumber>
<contextFuncName>honeybee</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>honeybee</second>
</first>
<second>157</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>collisions_x</originalName>
<rtlName>grp_checkAxis_1_fu_80</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>7</count>
<item_version>0</item_version>
<item>58</item>
<item>59</item>
<item>60</item>
<item>61</item>
<item>62</item>
<item>63</item>
<item>64</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>8.75</m_delay>
<m_topoIndex>9</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>or_ln159</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>159</lineNumber>
<contextFuncName>honeybee</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>honeybee</second>
</first>
<second>159</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>or_ln159_fu_112_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>65</item>
<item>66</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>10</m_topoIndex>
<m_clusterGroupNumber>1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>collisions</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>159</lineNumber>
<contextFuncName>honeybee</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>honeybee</second>
</first>
<second>159</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>collisions</originalName>
<rtlName>ap_return</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>67</item>
<item>68</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>11</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>_ln160</name>
<fileName>src/honeybee.c</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>160</lineNumber>
<contextFuncName>honeybee</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/hgfs/Thesis/HoneyBee</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/honeybee.c</first>
<second>honeybee</second>
</first>
<second>160</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>69</item>
</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>12</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</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="_19">
<Value>
<Obj>
<type>2</type>
<id>41</id>
<name>checkAxis_2</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:checkAxis.2></content>
</item>
<item class_id_reference="16" object_id="_20">
<Value>
<Obj>
<type>2</type>
<id>49</id>
<name>checkAxis_0</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:checkAxis.0></content>
</item>
<item class_id_reference="16" object_id="_21">
<Value>
<Obj>
<type>2</type>
<id>57</id>
<name>checkAxis_1</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:checkAxis.1></content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_22">
<Obj>
<type>3</type>
<id>27</id>
<name>honeybee</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>12</count>
<item_version>0</item_version>
<item>15</item>
<item>16</item>
<item>17</item>
<item>18</item>
<item>19</item>
<item>20</item>
<item>21</item>
<item>22</item>
<item>23</item>
<item>24</item>
<item>25</item>
<item>26</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>32</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_23">
<id>30</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_24">
<id>32</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_25">
<id>34</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_26">
<id>36</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_27">
<id>38</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_28">
<id>40</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_29">
<id>42</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_30">
<id>43</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_31">
<id>44</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_32">
<id>45</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_33">
<id>46</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_34">
<id>47</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_35">
<id>48</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_36">
<id>50</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_37">
<id>51</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_38">
<id>52</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_39">
<id>53</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_40">
<id>54</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_41">
<id>55</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_42">
<id>56</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_43">
<id>58</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_44">
<id>59</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_45">
<id>60</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_46">
<id>61</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_47">
<id>62</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_48">
<id>63</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_49">
<id>64</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_50">
<id>65</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_51">
<id>66</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="_52">
<id>67</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_53">
<id>68</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_54">
<id>69</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_55">
<mId>1</mId>
<mTag>honeybee</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>27</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>205</mMinLatency>
<mMaxLatency>205</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_56">
<states class_id="25" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_57">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_58">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_59">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_60">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_61">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_62">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_63">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_64">
<id>21</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_65">
<id>22</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_66">
<id>23</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_67">
<id>2</id>
<operations>
<count>14</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_68">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_69">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_70">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_71">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_72">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_73">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_74">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_75">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_76">
<id>21</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_77">
<id>22</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_78">
<id>23</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_79">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_80">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_81">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_82">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>-1</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>
</transitions>
</fsm>
<res class_id="34" tracking_level="1" version="0" object_id="_83">
<dp_component_resource class_id="35" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="36" tracking_level="0" version="0">
<first>grp_checkAxis_0_fu_96 (checkAxis_0)</first>
<second class_id="37" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>DSP48E</first>
<second>17</second>
</item>
<item>
<first>FF</first>
<second>3459</second>
</item>
<item>
<first>LUT</first>
<second>8840</second>
</item>
</second>
</item>
<item>
<first>grp_checkAxis_1_fu_80 (checkAxis_1)</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>DSP48E</first>
<second>17</second>
</item>
<item>
<first>FF</first>
<second>3459</second>
</item>
<item>
<first>LUT</first>
<second>8840</second>
</item>
</second>
</item>
<item>
<first>grp_checkAxis_2_fu_64 (checkAxis_2)</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>DSP48E</first>
<second>17</second>
</item>
<item>
<first>FF</first>
<second>3459</second>
</item>
<item>
<first>LUT</first>
<second>8712</second>
</item>
</second>
</item>
</dp_component_resource>
<dp_expression_resource>
<count>3</count>
<item_version>0</item_version>
<item>
<first>ap_block_state2_on_subcall_done ( or ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_return ( or ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>64</second>
</item>
<item>
<first>(1P1)</first>
<second>64</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>64</second>
</item>
</second>
</item>
<item>
<first>or_ln159_fu_112_p2 ( or ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>64</second>
</item>
<item>
<first>(1P1)</first>
<second>64</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>64</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>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>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>3</second>
</item>
<item>
<first>LUT</first>
<second>3</second>
</item>
</second>
</item>
</dp_multiplexer_resource>
<dp_register_resource>
<count>4</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>2</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>grp_checkAxis_0_fu_96_ap_start_reg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>grp_checkAxis_1_fu_80_ap_start_reg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>grp_checkAxis_2_fu_64_ap_start_reg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
</dp_register_resource>
<dp_dsp_resource>
<count>3</count>
<item_version>0</item_version>
<item>
<first>grp_checkAxis_0_fu_96</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>grp_checkAxis_1_fu_80</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
<item>
<first>grp_checkAxis_2_fu_64</first>
<second>
<count>0</count>
<item_version>0</item_version>
</second>
</item>
</dp_dsp_resource>
<dp_component_map class_id="39" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="0" version="0">
<first>grp_checkAxis_0_fu_96 (checkAxis_0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>grp_checkAxis_1_fu_80 (checkAxis_1)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>grp_checkAxis_2_fu_64 (checkAxis_2)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
</dp_component_map>
<dp_expression_map>
<count>2</count>
<item_version>0</item_version>
<item>
<first>ap_return ( or ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>or_ln159_fu_112_p2 ( or ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</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="41" tracking_level="0" version="0">
<count>12</count>
<item_version>0</item_version>
<item class_id="42" tracking_level="0" version="0">
<first>15</first>
<second class_id="43" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="44" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="45" tracking_level="0" version="0">
<first>27</first>
<second class_id="46" tracking_level="0" version="0">
<first>0</first>
<second>1</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="47" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="48" tracking_level="0" version="0">
<count>11</count>
<item_version>0</item_version>
<item class_id="49" tracking_level="0" version="0">
<first>28</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>34</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>40</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>46</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>52</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>58</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>64</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>21</item>
<item>21</item>
</second>
</item>
<item>
<first>80</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>23</item>
<item>23</item>
</second>
</item>
<item>
<first>96</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>22</item>
<item>22</item>
</second>
</item>
<item>
<first>112</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="51" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="52" tracking_level="0" version="0">
<first>collisions_fu_118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>or_ln159_fu_112</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>3</count>
<item_version>0</item_version>
<item>
<first>grp_checkAxis_0_fu_96</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>22</item>
<item>22</item>
</second>
</item>
<item>
<first>grp_checkAxis_1_fu_80</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>23</item>
<item>23</item>
</second>
</item>
<item>
<first>grp_checkAxis_2_fu_64</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>21</item>
<item>21</item>
</second>
</item>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>6</count>
<item_version>0</item_version>
<item>
<first>edge_p1_x_read_read_fu_58</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>edge_p1_y_read_read_fu_52</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>edge_p1_z_read_read_fu_46</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>edge_p2_x_read_read_fu_40</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>edge_p2_y_read_read_fu_34</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>edge_p2_z_read_read_fu_28</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</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>26</item>
</second>
</item>
</return_ports>
<dp_mem_port_nodes class_id="53" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>6</count>
<item_version>0</item_version>
<item>
<first>124</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>131</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>138</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>145</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>152</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>159</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>6</count>
<item_version>0</item_version>
<item>
<first>edge_p1_x_read_reg_159</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>edge_p1_y_read_reg_152</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>edge_p1_z_read_reg_145</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>edge_p2_x_read_reg_138</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>edge_p2_y_read_reg_131</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>edge_p2_z_read_reg_124</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</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="54" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="55" tracking_level="0" version="0">
<first>edge_p1_x</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
</second>
</item>
<item>
<first>edge_p1_y</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
</second>
</item>
<item>
<first>edge_p1_z</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
</second>
</item>
<item>
<first>edge_p2_x</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
</second>
</item>
<item>
<first>edge_p2_y</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>edge_p2_z</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="56" 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>
| 31.341463 | 79 | 0.465135 |
3d7ebcff10392275b2d543d709b3536263ccb977 | 1,062 | ads | Ada | 3-mid/impact/source/3d/dynamics/impact-d3-motion_state-default.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/impact/source/3d/dynamics/impact-d3-motion_state-default.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/impact/source/3d/dynamics/impact-d3-motion_state-default.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | with impact.d3.Transform;
package impact.d3.motion_State.default
--
-- The impact.d3.motion_State.default provides a common implementation to synchronize world transforms with offsets.
--
is
type Item is new impact.d3.motion_State.Item with
record
m_graphicsWorldTrans,
m_centerOfMassOffset,
m_startWorldTrans : Transform_3d;
m_userPointer : access Any'Class;
end record;
type View is access all Item'Class;
function to_motion_State (startTrans, centerOfMassOffset : Transform_3d := impact.d3.Transform.getIdentity) return Item;
overriding procedure getWorldTransform (Self : in Item; worldTrans : out Transform_3d);
--
-- Synchronizes world transform from user to physics.
overriding procedure setWorldTransform (Self : in out Item; worldTrans : in Transform_3d);
--
-- Synchronizes world transform from physics to user.
-- Bullet only calls the update of worldtransform for active objects.
end impact.d3.motion_State.default;
| 24.697674 | 124 | 0.708098 |
c7283a829b2cb9ac94cbafa09b89dbdb9ba3566d | 3,227 | ads | Ada | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-pack27.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-pack27.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-pack27.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 2 7 --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2019, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Handling of packed arrays with Component_Size = 27
package System.Pack_27 is
pragma Preelaborate;
Bits : constant := 27;
type Bits_27 is mod 2 ** Bits;
for Bits_27'Size use Bits;
-- In all subprograms below, Rev_SSO is set True if the array has the
-- non-default scalar storage order.
function Get_27
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_27 with Inline;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned.
procedure Set_27
(Arr : System.Address;
N : Natural;
E : Bits_27;
Rev_SSO : Boolean) with Inline;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is set to the given value.
end System.Pack_27;
| 52.901639 | 78 | 0.439727 |
592ef2ef3ebe1df4a808dd8cc66e3dc8defe29e2 | 4,406 | ads | Ada | ordinary/four_body.ads | jscparker/math_packages | b112a90338014d5c2dfae3f7265ee30841fb6cfd | [
"ISC",
"MIT"
] | 30 | 2018-12-09T01:15:04.000Z | 2022-03-20T16:14:54.000Z | ordinary/four_body.ads | jscparker/math_packages | b112a90338014d5c2dfae3f7265ee30841fb6cfd | [
"ISC",
"MIT"
] | null | null | null | ordinary/four_body.ads | jscparker/math_packages | b112a90338014d5c2dfae3f7265ee30841fb6cfd | [
"ISC",
"MIT"
] | null | null | null | --
-- package Four_Body
--
-- The package defines a data structure for the N-Body
-- gravitational problem in two dimensions.
--
-- N = 4, but can be set to anything.
--
-- N-Body equation:
-- Acceleration(Body_j)
-- = SumOver(Body_k) { Mass(Body_k) * G * Delta_R / NORM(Delta_R)**3 }
--
-- where Delta_R = (X(Body_k) - X(Body_j)) is a vector,
-- and where G is the gravitaional constant.
--
-- Natural units:
-- Unit of time is earth_orbital_period : t_0.
-- Unit of distance is earth's orbital semi-major axis : a_0.
-- Unit of mass is sum of Sun and Earth mass : m_0.
-- The 3 quantities are related to each other by Kepler's law:
--
-- t_0 = 2 * Pi * Sqrt (a_0**3 / (G * m_0))
--
-- where G is the gravitaional constant. If you divide variable of
-- time in the N_Body equation by t_0 to get natural units, the equation
-- becomes:
--
-- Acceleration(Body_j) = 2*2*Pi*Pi*
-- SumOver(Body_k) { Mass(Body_k) * Delta_R / NORM(Delta_R)**3 }
--
-- where Delta_R = (X(Body_k) - X(Body_j)).
--
-- Mass, time, and distance are in the natural units given above,
-- which gets rid of the gravitational constant G. In the Equation
-- as implemented below, the masses are multiplied by 2*2*pi*pi
-- when they are defined in order to avoid excessive multiplication
-- during evaluation of F(t, Y).
--
-- Body1 is the larger, mass = 1.0.
-- Body2 is the smaller, mass = 0.6.
-- Assume that the orbital period of the 2 stars is 80.0 years.
-- Say the planet is body 3: one earth distance
-- from the larger star, with 1 earth mass.
-- From these we get the semimajor axis "a" in
-- Kepler's law given above ... then put the three bodies in
-- near circular orbits and observe stability, and
-- remember to use the reduced-mass formulas to get distance
-- from center of mass:
--
-- First_Body_Radius r1 = a*m2 / (m1+m2)
-- Second_Body_Radius r2 = a*m1 / (m1+m2)
--
-- Planet_Orbital_Radius : constant Real := 1.0;-- earth's orbital period
-- Planet_Period : constant Real := 1.0;
--
-- Planet_Orbital_Radius : constant Real := 2.0;-- Twice earth's orbit
-- Planet_Period : constant Real := 2.82842712474619;
--
-- Planet_Orbital_Radius : constant Real := 3.0;-- Thrice earth's orbit
-- Planet_Period : constant Real := 5.196152422706632;
--
-- Planet_Orbital_Radius : constant Real := 4.0;-- 4 times earth's orbit
-- Planet_Period : constant Real := 8.0;-- 4**1.5 from Kepler's law
--
-- a : constant Real := 21.71534093275925;
-- OrbitalPeriod : constant Real := 80.0;
--
generic
type Real is digits <>;
package Four_Body is
No_Of_Bodies : constant := 4;
subtype Bodies is Integer range 0 .. No_Of_Bodies-1;
subtype XYUV_Index is Integer range 0 .. 3;
type CartesianCoordinate is array(XYUV_Index) of Real;
subtype State_Index is Integer range 0 .. 4*No_Of_Bodies-1;
type Dynamical_Variable is array(State_Index) of Real;
function F
(Time : Real;
Y : Dynamical_Variable)
return Dynamical_Variable;
-- This defines the equation to be integrated as
-- dY/dt = F (t, Y). Even if the equation is t or Y
-- independent, it must be entered in this form.
procedure Update_State
(Y : in out Dynamical_Variable;
Body_id : in Bodies;
X, Z, U, W : in Real);
function State_Val
(Y : Dynamical_Variable;
Body_id : Bodies;
XYUV_id : XYUV_Index) return Real;
function "*"
(Left : Real;
Right : Dynamical_Variable)
return Dynamical_Variable;
function "+"
(Left : Dynamical_Variable;
Right : Dynamical_Variable)
return Dynamical_Variable;
function "-"
(Left : Dynamical_Variable;
Right : Dynamical_Variable)
return Dynamical_Variable;
function Norm (Y : Dynamical_Variable) return Real;
pragma Inline (F, "*", "+", "-", Norm);
R_Pi : constant := 3.14159_26535_89793_23846_26433_83279_50288;
Pii : constant Real := R_Pi;
TwoPii : constant Real := 2.0 * R_Pi;
TwoPii2 : constant Real := 4.0 * R_Pi * R_Pi;
Mass : constant array(Bodies) of Real
:= (1.0*TwoPii2, 0.6*TwoPii2, 3.0E-6 * TwoPii2, 1.0E-22 * TwoPii2);
-- body1 has sun mass, body2 has 0.6 sun mass, and
-- body3 has earth mass, body4 has negligible mass.
end Four_Body;
| 32.160584 | 78 | 0.643214 |
4dd5991caac3d86766592354442931dca12a02e8 | 4,181 | ads | Ada | source/web/soap/web_services-soap-handler_registry.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/web/soap/web_services-soap-handler_registry.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/web/soap/web_services-soap-handler_registry.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with Ada.Containers.Vectors;
with Ada.Tags;
with Web_Services.SOAP.Handlers;
package Web_Services.SOAP.Handler_Registry is
procedure Register
(Tag : Ada.Tags.Tag;
Handler : not null Web_Services.SOAP.Handlers.SOAP_Message_Handler);
-- Register handler for the given tag.
procedure Register
(Handler : not null Web_Services.SOAP.Handlers.SOAP_RPC_Handler);
-- Register RPC-style handler.
function Resolve
(Tag : Ada.Tags.Tag)
return Web_Services.SOAP.Handlers.SOAP_Message_Handler;
-- Returns handler for the given tag.
package Handler_Vectors is
new Ada.Containers.Vectors
(Positive,
Web_Services.SOAP.Handlers.SOAP_RPC_Handler,
Web_Services.SOAP.Handlers."=");
RPC_Registry : Handler_Vectors.Vector;
end Web_Services.SOAP.Handler_Registry;
| 56.5 | 78 | 0.453241 |
223f7386a2f9f5b5a74edcbd0b553a65608f57e7 | 11,178 | adb | Ada | 3-mid/opengl/source/lean/model/opengl-model-hexagon_column-lit_colored_faceted.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2022-01-20T07:13:42.000Z | 2022-01-20T07:13:42.000Z | 3-mid/opengl/source/lean/model/opengl-model-hexagon_column-lit_colored_faceted.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | 3-mid/opengl/source/lean/model/opengl-model-hexagon_column-lit_colored_faceted.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | with
openGL.Primitive.indexed,
openGL.Geometry.lit_colored,
openGL.Model.hexagon;
package body openGL.Model.Hexagon_Column.lit_colored_faceted
is
---------
--- Forge
--
function new_hexagon_Column (Radius : in Real;
Height : in Real;
Upper,
Lower : in hex_Face;
Shaft : in shaft_Face) return View
is
Self : constant View := new Item;
begin
Self.Radius := Radius;
Self.Height := Height;
Self.upper_Face := Upper;
Self.lower_Face := Lower;
Self.Shaft := Shaft;
return Self;
end new_hexagon_Column;
--------------
--- Attributes
--
overriding
function to_GL_Geometries (Self : access Item; Textures : access Texture.name_Map_of_texture'Class;
Fonts : in Font.font_id_Map_of_font) return Geometry.views
is
pragma unreferenced (Fonts, Textures);
use Geometry.lit_colored,
Model.hexagon;
shaft_Height : constant Real := Self.Height;
height_Offset : constant Vector_3 := (0.0, shaft_Height / 2.0, 0.0);
mid_Sites : constant hexagon.Sites := vertex_Sites (Self.Radius);
upper_Sites : hexagon.Sites := mid_Sites;
lower_Sites : hexagon.Sites := mid_Sites;
function new_hexagon_Face (Vertices : access Geometry.lit_colored.Vertex_array;
Flip : in Boolean := False) return Geometry.lit_colored.view
is
use Primitive;
function the_Indices return Indices
is
begin
if Flip
then return (1, 7, 6, 5, 4, 3, 2, 7);
else return (1, 2, 3, 4, 5, 6, 7, 2);
end if;
end the_Indices;
the_Geometry : constant Geometry.lit_colored.view
:= Geometry.lit_colored.new_Geometry;
the_Primitive : constant Primitive.indexed.view
:= Primitive.indexed.new_Primitive (triangle_Fan,
the_Indices);
begin
the_Geometry.Vertices_are (Vertices.all);
the_Geometry.add (Primitive.view (the_Primitive));
return the_Geometry;
end new_hexagon_Face;
function new_shaft_Face (Vertices : access Geometry.lit_colored.Vertex_array)
return Geometry.lit_colored.view
is
use Primitive;
the_Indices : constant Indices := (1, 2, 3, 4);
the_Geometry : constant Geometry.lit_colored.view
:= Geometry.lit_colored.new_Geometry;
the_Primitive : constant Primitive.view
:= Primitive.indexed.new_Primitive (triangle_Strip, the_Indices).all'Access;
begin
the_Geometry.Vertices_are (Vertices.all);
the_Geometry.add (the_Primitive);
return the_Geometry;
end new_shaft_Face;
upper_Face : Geometry.lit_colored.view;
lower_Face : Geometry.lit_colored.view;
shaft_Faces : array (1 .. 6) of Geometry.lit_colored.view;
begin
for Each in mid_Sites'Range
loop
upper_Sites (Each) := upper_Sites (Each) + height_Offset;
lower_Sites (Each) := lower_Sites (Each) - height_Offset;
end loop;
-- Upper
--
declare
the_Vertices : aliased Geometry.lit_colored.Vertex_array
:= (1 => (Site => height_Offset, Normal => Normal, Color => +Self.upper_Face.center_Color, Shine => default_Shine),
2 => (Site => upper_Sites (1), Normal => Normal, Color => +Self.upper_Face.Colors (1), Shine => default_Shine),
3 => (Site => upper_Sites (2), Normal => Normal, Color => +Self.upper_Face.Colors (2), Shine => default_Shine),
4 => (Site => upper_Sites (3), Normal => Normal, Color => +Self.upper_Face.Colors (3), Shine => default_Shine),
5 => (Site => upper_Sites (4), Normal => Normal, Color => +Self.upper_Face.Colors (4), Shine => default_Shine),
6 => (Site => upper_Sites (5), Normal => Normal, Color => +Self.upper_Face.Colors (5), Shine => default_Shine),
7 => (Site => upper_Sites (6), Normal => Normal, Color => +Self.upper_Face.Colors (6), Shine => default_Shine));
begin
upper_Face := new_hexagon_Face (Vertices => the_Vertices'Access);
end;
-- Lower
--
declare
the_Vertices : aliased Geometry.lit_colored.Vertex_array
:= (1 => (Site => -height_Offset, Normal => -Normal, Color => +Self.upper_Face.center_Color, Shine => default_Shine),
2 => (Site => lower_Sites (1), Normal => -Normal, Color => +Self.upper_Face.Colors (1), Shine => default_Shine),
3 => (Site => lower_Sites (2), Normal => -Normal, Color => +Self.upper_Face.Colors (2), Shine => default_Shine),
4 => (Site => lower_Sites (3), Normal => -Normal, Color => +Self.upper_Face.Colors (3), Shine => default_Shine),
5 => (Site => lower_Sites (4), Normal => -Normal, Color => +Self.upper_Face.Colors (4), Shine => default_Shine),
6 => (Site => lower_Sites (5), Normal => -Normal, Color => +Self.upper_Face.Colors (5), Shine => default_Shine),
7 => (Site => lower_Sites (6), Normal => -Normal, Color => +Self.upper_Face.Colors (6), Shine => default_Shine));
begin
lower_Face := new_hexagon_Face (Vertices => the_Vertices'Access,
Flip => True);
end;
-- Shaft
--
declare
type shaft_Normals is array (1 .. 6) of Vector_3;
function get_Normals return shaft_Normals
is
use linear_Algebra_3D;
Rotation : constant Matrix_3x3 := y_Rotation_from (to_Radians (60.0));
the_Normal : Vector_3 := (0.0, 0.0, -1.0);
Result : shaft_Normals;
begin
Result (2) := the_Normal;
the_Normal := Rotation * the_Normal;
Result (3) := the_Normal;
the_Normal := Rotation * the_Normal;
Result (4) := the_Normal;
the_Normal := (0.0, 0.0, 1.0);
Result (5) := the_Normal;
the_Normal := Rotation * the_Normal;
Result (6) := the_Normal;
the_Normal := Rotation * the_Normal;
Result (1) := the_Normal;
return Result;
end get_Normals;
Normals : constant shaft_Normals := get_Normals;
shaft_Color : constant rgba_Color := +Self.Shaft.Color;
the_Vertices_1 : aliased Geometry.lit_colored.Vertex_array
:= (1 => (Site => upper_Sites (1), Normal => Normals (1), Color => shaft_Color, Shine => default_Shine),
2 => (Site => lower_Sites (1), Normal => Normals (1), Color => shaft_Color, Shine => default_Shine),
3 => (Site => upper_Sites (2), Normal => Normals (1), Color => shaft_Color, Shine => default_Shine),
4 => (Site => lower_Sites (2), Normal => Normals (1), Color => shaft_Color, Shine => default_Shine));
the_Vertices_2 : aliased Geometry.lit_colored.Vertex_array
:= (1 => (Site => upper_Sites (2), Normal => Normals (2), Color => shaft_Color, Shine => default_Shine),
2 => (Site => lower_Sites (2), Normal => Normals (2), Color => shaft_Color, Shine => default_Shine),
3 => (Site => upper_Sites (3), Normal => Normals (2), Color => shaft_Color, Shine => default_Shine),
4 => (Site => lower_Sites (3), Normal => Normals (2), Color => shaft_Color, Shine => default_Shine));
the_Vertices_3 : aliased Geometry.lit_colored.Vertex_array
:= (1 => (Site => upper_Sites (3), Normal => Normals (3), Color => shaft_Color, Shine => default_Shine),
2 => (Site => lower_Sites (3), Normal => Normals (3), Color => shaft_Color, Shine => default_Shine),
3 => (Site => upper_Sites (4), Normal => Normals (3), Color => shaft_Color, Shine => default_Shine),
4 => (Site => lower_Sites (4), Normal => Normals (3), Color => shaft_Color, Shine => default_Shine));
the_Vertices_4 : aliased Geometry.lit_colored.Vertex_array
:= (1 => (Site => upper_Sites (4), Normal => Normals (4), Color => shaft_Color, Shine => default_Shine),
2 => (Site => lower_Sites (4), Normal => Normals (4), Color => shaft_Color, Shine => default_Shine),
3 => (Site => upper_Sites (5), Normal => Normals (4), Color => shaft_Color, Shine => default_Shine),
4 => (Site => lower_Sites (5), Normal => Normals (4), Color => shaft_Color, Shine => default_Shine));
the_Vertices_5 : aliased Geometry.lit_colored.Vertex_array
:= (1 => (Site => upper_Sites (5), Normal => Normals (5), Color => shaft_Color, Shine => default_Shine),
2 => (Site => lower_Sites (5), Normal => Normals (5), Color => shaft_Color, Shine => default_Shine),
3 => (Site => upper_Sites (6), Normal => Normals (5), Color => shaft_Color, Shine => default_Shine),
4 => (Site => lower_Sites (6), Normal => Normals (5), Color => shaft_Color, Shine => default_Shine));
the_Vertices_6 : aliased Geometry.lit_colored.Vertex_array
:= (1 => (Site => upper_Sites (6), Normal => Normals (6), Color => shaft_Color, Shine => default_Shine),
2 => (Site => lower_Sites (6), Normal => Normals (6), Color => shaft_Color, Shine => default_Shine),
3 => (Site => upper_Sites (1), Normal => Normals (6), Color => shaft_Color, Shine => default_Shine),
4 => (Site => lower_Sites (1), Normal => Normals (6), Color => shaft_Color, Shine => default_Shine));
the_Vertices : constant array (1 .. 6) of access Geometry.lit_colored.Vertex_array
:= (the_Vertices_1'Access,
the_Vertices_2'Access,
the_Vertices_3'Access,
the_Vertices_4'Access,
the_Vertices_5'Access,
the_Vertices_6'Access);
begin
for i in shaft_Faces'Range
loop
shaft_Faces (i) := new_shaft_Face (vertices => the_Vertices (i));
end loop;
end;
return (1 => upper_Face .all'Access,
2 => lower_Face .all'Access,
3 => shaft_Faces (1).all'Access,
4 => shaft_Faces (2).all'Access,
5 => shaft_Faces (3).all'Access,
6 => shaft_Faces (4).all'Access,
7 => shaft_Faces (5).all'Access,
8 => shaft_Faces (6).all'Access);
end to_GL_Geometries;
end openGL.Model.Hexagon_Column.lit_colored_faceted;
| 45.62449 | 136 | 0.552424 |
12c75f65e08e6b37bae67fa675899049aaf9da85 | 5,075 | adb | Ada | source/types/adam-a_type-array_type.adb | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | 3 | 2017-04-29T14:25:22.000Z | 2017-09-29T10:15:28.000Z | source/types/adam-a_type-array_type.adb | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | null | null | null | source/types/adam-a_type-array_type.adb | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | null | null | null | with
AdaM.Factory;
package body AdaM.a_Type.array_type
is
-- Storage Pool
--
record_Version : constant := 1;
pool_Size : constant := 5_000;
package Pool is new AdaM.Factory.Pools (storage_Folder => ".adam-store",
pool_Name => "array_types",
max_Items => pool_Size,
record_Version => record_Version,
Item => array_type.item,
View => array_type.view);
-- Forge
--
procedure define (Self : in out Item; Name : in String)
is
begin
Self.Name := +Name;
Self.index_Subtype := subtype_Indication.new_Indication;
Self.Component := component_Definition.new_Definition (is_subtype_Indication => True);
-- Self.element_Subtype := subtype_Indication.new_Indication;
end define;
overriding
procedure destruct (Self : in out Item)
is
use subtype_Indication,
component_Definition;
begin
free (Self. index_Subtype);
free (Self.Component);
-- free (Self.element_Subtype);
end destruct;
function new_Type (Name : in String := "") return array_type.View
is
new_View : constant array_type.view := Pool.new_Item;
begin
define (array_type.item (new_View.all),
Name);
return new_View;
end new_Type;
procedure free (Self : in out array_type.view)
is
begin
destruct (a_Type.item (Self.all));
Pool.free (Self);
end free;
-- Attributes
--
overriding function Id (Self : access Item) return AdaM.Id
is
begin
return Pool.to_Id (Self);
end Id;
overriding
function to_Source (Self : in Item) return text_Vectors.Vector
is
pragma Unreferenced (Self);
the_Source : text_Vectors.Vector;
begin
raise Program_Error with "TODO";
return the_Source;
end to_Source;
function index_Indication (Self : access Item) return AdaM.subtype_Indication.view
is
begin
return Self.index_Subtype;
end index_Indication;
function component_Indication (Self : access Item) return AdaM.subtype_Indication.view
is
begin
return Self.Component.subtype_Indication;
end component_Indication;
-- function index_Type (Self : access Item) return access AdaM.a_Type.view
-- is
-- begin
-- return Self.index_Type'Access;
-- end index_Type;
--
--
-- function index_Type (Self : in Item) return AdaM.a_Type.view
-- is
-- begin
-- return Self.index_Type;
-- end index_Type;
--
--
-- procedure index_Type_is (Self : in out Item; Now : in AdaM.a_Type.view)
-- is
-- begin
-- Self.index_Type := Now;
-- end index_Type_is;
-- function element_Type (Self : access Item) return access AdaM.a_Type.view
-- is
-- begin
-- return Self.element_Type'Access;
-- end element_Type;
--
--
-- function element_Type (Self : in Item) return AdaM.a_Type.view
-- is
-- begin
-- return Self.element_Type;
-- end element_Type;
--
--
-- procedure element_Type_is (Self : in out Item; Now : in AdaM.a_Type.view)
-- is
-- begin
-- Self.element_Type := Now;
-- end element_Type_is;
-- function First (Self : in Item) return String
-- is
-- begin
-- return +Self.First;
-- end First;
--
--
-- procedure First_is (Self : in out Item; Now : in String)
-- is
-- begin
-- Self.First := +Now;
-- end First_is;
--
--
-- function Last (Self : in Item) return String
-- is
-- begin
-- return +Self.Last;
-- end Last;
--
--
-- procedure Last_is (Self : in out Item; Now : in String)
-- is
-- begin
-- Self.Last := +Now;
-- end Last_is;
function is_Constrained (Self : in Item) return Boolean
is
begin
return Self.is_Constrained;
end is_Constrained;
procedure is_Constrained (Self : in out Item; Now : in Boolean := True)
is
begin
Self.is_Constrained := Now;
end is_Constrained;
function Component_is_aliased (Self : in Item) return Boolean
is
begin
return Self.Component.is_Aliased;
end Component_is_aliased;
procedure Component_is_aliased (Self : in out Item; Now : in Boolean := True)
is
begin
Self.Component.is_Aliased (Now);
end Component_is_aliased;
-- Streams
--
procedure View_write (Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Self : in View)
renames Pool.View_write;
procedure View_read (Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Self : out View)
renames Pool.View_read;
end AdaM.a_Type.array_type;
| 23.49537 | 96 | 0.576946 |
29d75cce04d7105420370b9772d25cff2fa30665 | 5,883 | adb | Ada | regtests/server/src/model/testapi-models.adb | jquorning/swagger-ada | 9df95a920643b37f22a8fb2450786df00099dc9a | [
"Apache-2.0"
] | 17 | 2017-09-09T15:52:14.000Z | 2022-01-23T01:18:06.000Z | regtests/server/src/model/testapi-models.adb | jquorning/swagger-ada | 9df95a920643b37f22a8fb2450786df00099dc9a | [
"Apache-2.0"
] | 13 | 2020-10-04T16:04:42.000Z | 2022-03-25T19:33:03.000Z | regtests/server/src/model/testapi-models.adb | jquorning/swagger-ada | 9df95a920643b37f22a8fb2450786df00099dc9a | [
"Apache-2.0"
] | 4 | 2021-01-06T08:43:55.000Z | 2022-03-11T21:45:06.000Z | -- REST API Validation
-- API to validate
--
-- The version of the OpenAPI document: 1.0.0
-- Contact: [email protected]
--
-- NOTE: This package is auto generated by OpenAPI-Generator 5.2.1-SNAPSHOT.
-- https://openapi-generator.tech
-- Do not edit the class manually.
package body TestAPI.Models is
pragma Style_Checks ("-mr");
pragma Warnings (Off, "*use clause for package*");
use Swagger.Streams;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in Ticket_Type) is
begin
Into.Start_Entity (Name);
Into.Write_Long_Entity ("id", Value.Id);
Into.Write_Entity ("title", Value.Title);
Into.Write_Entity ("description", Value.Description);
Into.Write_Entity ("owner", Value.Owner);
Into.Write_Entity ("create_date", Value.Create_Date);
Into.Write_Entity ("end_date", Value.End_Date);
Into.Write_Entity ("update_date", Value.Update_Date);
Into.Write_Entity ("status", Value.Status);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in Ticket_Type_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out Ticket_Type) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Swagger.Streams.Deserialize (Object, "id", Value.Id);
Swagger.Streams.Deserialize (Object, "title", Value.Title);
Swagger.Streams.Deserialize (Object, "description", Value.Description);
Swagger.Streams.Deserialize (Object, "owner", Value.Owner);
Swagger.Streams.Deserialize (Object, "create_date", Value.Create_Date);
Swagger.Streams.Deserialize (Object, "end_date", Value.End_Date);
Swagger.Streams.Deserialize (Object, "update_date", Value.Update_Date);
Swagger.Streams.Deserialize (Object, "status", Value.Status);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out Ticket_Type_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : Ticket_Type;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in StringsMap_Type) is
begin
Into.Start_Entity (Name);
Into.Write_Entity ("key", Value.Key);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in StringsMap_Type_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out StringsMap_Type) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Swagger.Streams.Deserialize (Object, "key", Value.Key);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out StringsMap_Type_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : StringsMap_Type;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in InlineObject3_Type) is
begin
Into.Start_Entity (Name);
Serialize (Into, "requestedQoS", Value.Requested_Qo_S);
Serialize (Into, "commands", Value.Commands);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in InlineObject3_Type_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out InlineObject3_Type) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Deserialize (Object, "requestedQoS", Value.Requested_Qo_S);
Deserialize (Object, "commands", Value.Commands);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out InlineObject3_Type_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : InlineObject3_Type;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
end TestAPI.Models;
| 33.617143 | 77 | 0.608193 |
58fe937ac2c6a3bacadc8ab09f905e17103d5be8 | 22,701 | adb | Ada | boards/ip_colordetect_test/colordetect/colordetect/.autopilot/db/dilate_0_0_2160_3840_0_3_3_1_1_s.sched.adb | Kgfu/PYNQ_HelloWorld | a5197130e7d4a5e7f382c3963349c1c0bd213213 | [
"BSD-3-Clause"
] | null | null | null | boards/ip_colordetect_test/colordetect/colordetect/.autopilot/db/dilate_0_0_2160_3840_0_3_3_1_1_s.sched.adb | Kgfu/PYNQ_HelloWorld | a5197130e7d4a5e7f382c3963349c1c0bd213213 | [
"BSD-3-Clause"
] | null | null | null | boards/ip_colordetect_test/colordetect/colordetect/.autopilot/db/dilate_0_0_2160_3840_0_3_3_1_1_s.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>dilate_0_0_2160_3840_0_3_3_1_1_s</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>imgHelper2_4102</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>49</coreId>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>imgHelper3_4103</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>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>p_src_rows</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>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_4">
<Value>
<Obj>
<type>1</type>
<id>4</id>
<name>p_src_cols</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>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>p_src_rows_read</name>
<fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>340</lineNumber>
<contextFuncName>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</contextFuncName>
<contextNormFuncName>dilate_0_0_2160_3840_0_3_3_1_1_s</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>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</first>
<second>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</second>
</first>
<second>340</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>0</coreId>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>19</item>
<item>20</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.28</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>p_src_cols_read</name>
<fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>341</lineNumber>
<contextFuncName>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</contextFuncName>
<contextNormFuncName>dilate_0_0_2160_3840_0_3_3_1_1_s</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>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</first>
<second>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</second>
</first>
<second>341</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>113</coreId>
</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>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.28</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>trunc_ln340</name>
<fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>340</lineNumber>
<contextFuncName>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</contextFuncName>
<contextNormFuncName>dilate_0_0_2160_3840_0_3_3_1_1_s</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>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</first>
<second>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</second>
</first>
<second>340</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>1702127986</coreId>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>trunc_ln341</name>
<fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>341</lineNumber>
<contextFuncName>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</contextFuncName>
<contextNormFuncName>dilate_0_0_2160_3840_0_3_3_1_1_s</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>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</first>
<second>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</second>
</first>
<second>341</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>145</coreId>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>_ln376</name>
<fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>376</lineNumber>
<contextFuncName>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</contextFuncName>
<contextNormFuncName>dilate_0_0_2160_3840_0_3_3_1_1_s</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>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_dilation.hpp</first>
<second>dilate&lt;0, 0, 2160, 3840, 0, 3, 3, 1, 1&gt;</second>
</first>
<second>376</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>161</coreId>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>26</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>16</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>161</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>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_11">
<Value>
<Obj>
<type>2</type>
<id>25</id>
<name>xfdilate_2160_3840_1_0_1_0_3841_3_3_s</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>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:xfdilate<2160, 3840, 1, 0, 1, 0, 3841, 3, 3>></content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_12">
<Obj>
<type>3</type>
<id>17</id>
<name>dilate<0, 0, 2160, 3840, 0, 3, 3, 1, 1></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>6</count>
<item_version>0</item_version>
<item>11</item>
<item>12</item>
<item>13</item>
<item>14</item>
<item>15</item>
<item>16</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_13">
<id>20</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>11</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_14">
<id>22</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_15">
<id>23</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_16">
<id>24</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_17">
<id>26</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_18">
<id>27</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_19">
<id>28</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_20">
<id>29</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_21">
<id>30</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_22">
<mId>1</mId>
<mTag>dilate<0, 0, 2160, 3840, 0, 3, 3, 1, 1></mTag>
<mNormTag>dilate_0_0_2160_3840_0_3_3_1_1_s</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>17</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>13</mMinLatency>
<mMaxLatency>8319373</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>6</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>11</first>
<second class_id="28" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>0</first>
<second>1</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="29" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="0" version="0">
<first>17</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>1</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="32" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="34" 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="35" 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="36" 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>
| 30.635628 | 130 | 0.631118 |
c722303e6bf4024c5bb18a98e1d1af50a584d2bd | 6,556 | ads | Ada | source/torrent-connections.ads | reznikmm/torrent | 7b32dbab106a54846000409e79f853339b7ecd64 | [
"MIT"
] | 4 | 2019-12-14T19:02:48.000Z | 2020-12-06T16:56:33.000Z | source/torrent-connections.ads | reznikmm/torrent | 7b32dbab106a54846000409e79f853339b7ecd64 | [
"MIT"
] | null | null | null | source/torrent-connections.ads | reznikmm/torrent | 7b32dbab106a54846000409e79f853339b7ecd64 | [
"MIT"
] | null | null | null | -- Copyright (c) 2019-2020 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Ada.Calendar;
with Ada.Containers.Synchronized_Queue_Interfaces;
with Ada.Containers.Unbounded_Synchronized_Queues;
with Ada.Containers.Vectors;
with Ada.Finalization;
with GNAT.Sockets;
with League.Stream_Element_Vectors;
with Torrent.Metainfo_Files;
with Torrent.Storages;
limited with Torrent.Downloaders;
package Torrent.Connections is
type Connection is tagged;
type Connection_Access is access all Connection'Class;
type Connection_Access_Array is
array (Positive range <>) of Connection_Access;
package Queue_Interfaces is new
Ada.Containers.Synchronized_Queue_Interfaces (Connection_Access);
package Queues is new
Ada.Containers.Unbounded_Synchronized_Queues (Queue_Interfaces);
type Interval is record
From : Piece_Offset; -- Starts from zero
To : Piece_Offset;
end record;
package Interval_Vectors is new Ada.Containers.Vectors
(Positive, Interval);
procedure Insert
(List : in out Interval_Vectors.Vector;
Value : Interval);
type Piece_Interval is record
Piece : Piece_Index;
Span : Interval;
end record;
subtype Piece_Interval_Count is Natural range 0 .. 8;
type Piece_Interval_Array is array (Positive range <>) of Piece_Interval;
type Piece_Intervals (Length : Piece_Interval_Count := 0) is record
List : Piece_Interval_Array (1 .. Length);
end record;
type Piece_State is record
Piece : Piece_Count;
Intervals : Interval_Vectors.Vector;
end record;
type Connection_State_Listener is synchronized interface;
type Connection_State_Listener_Access is
access all Connection_State_Listener'Class
with Storage_Size => 0;
not overriding function We_Are_Intrested
(Self : Connection_State_Listener;
Map : Boolean_Array) return Boolean is abstract;
not overriding procedure Reserve_Intervals
(Self : in out Connection_State_Listener;
Map : Boolean_Array;
Value : out Piece_State) is abstract;
not overriding procedure Unreserve_Intervals
(Self : in out Connection_State_Listener;
Map : Piece_Interval_Array) is abstract;
not overriding procedure Interval_Saved
(Self : in out Connection_State_Listener;
Piece : Piece_Index;
Value : Interval;
Last : out Boolean) is abstract;
not overriding procedure Piece_Completed
(Self : in out Connection_State_Listener;
Piece : Piece_Index;
Ok : Boolean) is abstract;
not overriding procedure Interval_Sent
(Self : in out Connection_State_Listener;
Size : Piece_Offset) is abstract;
type Connection
(Meta : not null Torrent.Metainfo_Files.Metainfo_File_Access;
Downloader : not null access Torrent.Downloaders.Downloader'Class;
Storage : not null Torrent.Storages.Storage_Access;
Piece_Count : Piece_Index) is tagged limited private;
procedure Initialize
(Self : in out Connection'Class;
My_Id : SHA1;
Peer : GNAT.Sockets.Sock_Addr_Type;
Listener : Connection_State_Listener_Access);
type Piece_Index_Array is array (Piece_Index range <>) of Piece_Index;
procedure Do_Handshake
(Self : in out Connection'Class;
Socket : GNAT.Sockets.Socket_Type;
Completed : Piece_Index_Array;
Inbound : Boolean);
function Peer (Self : Connection'Class) return GNAT.Sockets.Sock_Addr_Type;
function Connected (Self : Connection'Class) return Boolean;
function Intrested (Self : Connection'Class) return Boolean;
function Downloaded (Self : in out Connection'Class) return Piece_Offset;
-- Return amount of data received since last call.
function Serve_Needed (Self : Connection'Class) return Boolean;
-- Connection has some pending messages to send them right now
procedure Set_Choked
(Self : in out Connection'Class;
Value : Boolean);
procedure Serve
(Self : in out Connection'Class;
Limit : Ada.Calendar.Time);
-- Process input messages and seed some data if unchoked. Limit is a time
-- when it should complete.
package Connection_Vectors is new Ada.Containers.Vectors
(Index_Type => Positive,
Element_Type => Connection_Access);
procedure Serve_All
(Selector : GNAT.Sockets.Selector_Type;
Vector : in out Connection_Vectors.Vector;
Except : Connection_Access_Array;
Limit : Ada.Calendar.Time);
function Is_Valid_Piece
(Meta : not null Torrent.Metainfo_Files.Metainfo_File_Access;
Storage : in out Torrent.Storages.Storage;
Piece : Piece_Index) return Boolean;
private
package Piece_Interval_Vectors is new Ada.Containers.Vectors
(Index_Type => Positive,
Element_Type => Piece_Interval,
"=" => "=");
type Natural_Array is array (Positive range <>) of Natural;
type Sent_Piece_Intervals (Length : Piece_Interval_Count := 0) is record
Request : Piece_Intervals (Length);
Expire : Natural_Array (1 .. Length);
end record;
type Connection
(Meta : not null Torrent.Metainfo_Files.Metainfo_File_Access;
Downloader : not null access Torrent.Downloaders.Downloader'Class;
Storage : not null Torrent.Storages.Storage_Access;
Piece_Count : Piece_Index) is limited
new Ada.Finalization.Limited_Controlled with
record
Peer : GNAT.Sockets.Sock_Addr_Type;
Socket : GNAT.Sockets.Socket_Type;
Sent_Handshake : Boolean;
Got_Handshake : Boolean;
Closed : Boolean;
We_Choked : Boolean;
He_Choked : Boolean;
Choked_Sent : Boolean; -- If He_Choked is in action
He_Intrested : Boolean;
We_Intrested : Boolean;
Current_Piece : Piece_State;
My_Peer_Id : SHA1;
Unparsed : League.Stream_Element_Vectors.Stream_Element_Vector :=
League.Stream_Element_Vectors.Empty_Stream_Element_Vector;
Pipelined : Sent_Piece_Intervals;
Requests : Piece_Interval_Vectors.Vector;
Last_Request : Natural;
Last_Completed : Torrent.Piece_Count;
Listener : Connection_State_Listener_Access;
Downloaded : Piece_Offset;
Piece_Map : Boolean_Array (1 .. Piece_Count);
end record;
end Torrent.Connections;
| 33.111111 | 78 | 0.696766 |
22d4915922b0583f9bea26e47d9ece28885634e0 | 3,338 | ads | Ada | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-calcon.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-calcon.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-calcon.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . C A L E N D A R . C O N T R O L --
-- --
-- S p e c --
-- --
-- Copyright (C) 2020-2021, AdaCore --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package allows clients to set the current time and date.
package Ada.Calendar.Control is
procedure Set_Clock (Value : Time);
subtype Hour_Number is Integer range 0 .. 23;
subtype Minute_Number is Integer range 0 .. 59;
subtype Second_Number is Integer range 0 .. 59;
subtype Fractional_Seconds is Duration range 0.0 .. 1.0 - Duration'Small;
procedure Set_Clock
(Year : Year_Number;
Month : Month_Number;
Day : Day_Number;
Hour : Hour_Number;
Minute : Minute_Number;
Second : Second_Number;
Fraction : Fractional_Seconds := 0.0);
end Ada.Calendar.Control;
| 57.551724 | 78 | 0.389455 |
1d90524b9a2a5122a1ebea6bd0805e243c28c4ea | 26,111 | ads | Ada | src/gnat/uintp.ads | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 15 | 2015-01-18T23:04:19.000Z | 2022-03-01T20:27:08.000Z | src/gnat/uintp.ads | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 16 | 2018-06-10T07:09:30.000Z | 2022-03-26T18:28:40.000Z | src/gnat/uintp.ads | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 3 | 2015-11-11T18:00:14.000Z | 2022-01-30T23:08:45.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- U I N T P --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2014, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Support for universal integer arithmetic
-- WARNING: There is a C version of this package. Any changes to this
-- source file must be properly reflected in the C header file uintp.h
with Alloc;
with Table;
pragma Elaborate_All (Table);
with Types; use Types;
package Uintp is
-------------------------------------------------
-- Basic Types and Constants for Uintp Package --
-------------------------------------------------
type Uint is private;
-- The basic universal integer type
No_Uint : constant Uint;
-- A constant value indicating a missing or unset Uint value
Uint_0 : constant Uint;
Uint_1 : constant Uint;
Uint_2 : constant Uint;
Uint_3 : constant Uint;
Uint_4 : constant Uint;
Uint_5 : constant Uint;
Uint_6 : constant Uint;
Uint_7 : constant Uint;
Uint_8 : constant Uint;
Uint_9 : constant Uint;
Uint_10 : constant Uint;
Uint_11 : constant Uint;
Uint_12 : constant Uint;
Uint_13 : constant Uint;
Uint_14 : constant Uint;
Uint_15 : constant Uint;
Uint_16 : constant Uint;
Uint_24 : constant Uint;
Uint_32 : constant Uint;
Uint_63 : constant Uint;
Uint_64 : constant Uint;
Uint_80 : constant Uint;
Uint_128 : constant Uint;
Uint_Minus_1 : constant Uint;
Uint_Minus_2 : constant Uint;
Uint_Minus_3 : constant Uint;
Uint_Minus_4 : constant Uint;
Uint_Minus_5 : constant Uint;
Uint_Minus_6 : constant Uint;
Uint_Minus_7 : constant Uint;
Uint_Minus_8 : constant Uint;
Uint_Minus_9 : constant Uint;
Uint_Minus_12 : constant Uint;
Uint_Minus_36 : constant Uint;
Uint_Minus_63 : constant Uint;
Uint_Minus_80 : constant Uint;
Uint_Minus_128 : constant Uint;
type UI_Vector is array (Pos range <>) of Int;
-- Vector containing the integer values of a Uint value
-- Note: An earlier version of this package used pointers of arrays of Ints
-- (dynamically allocated) for the Uint type. The change leads to a few
-- less natural idioms used throughout this code, but eliminates all uses
-- of the heap except for the table package itself. For example, Uint
-- parameters are often converted to UI_Vectors for internal manipulation.
-- This is done by creating the local UI_Vector using the function N_Digits
-- on the Uint to find the size needed for the vector, and then calling
-- Init_Operand to copy the values out of the table into the vector.
-----------------
-- Subprograms --
-----------------
procedure Initialize;
-- Initialize Uint tables. Note that Initialize must not be called if
-- Tree_Read is used. Note also that there is no lock routine in this
-- unit, these are among the few tables that can be expanded during
-- gigi processing.
procedure Tree_Read;
-- Initializes internal tables from current tree file using the relevant
-- Table.Tree_Read routines. Note that Initialize should not be called if
-- Tree_Read is used. Tree_Read includes all necessary initialization.
procedure Tree_Write;
-- Writes out internal tables to current tree file using the relevant
-- Table.Tree_Write routines.
function UI_Abs (Right : Uint) return Uint;
pragma Inline (UI_Abs);
-- Returns abs function of universal integer
function UI_Add (Left : Uint; Right : Uint) return Uint;
function UI_Add (Left : Int; Right : Uint) return Uint;
function UI_Add (Left : Uint; Right : Int) return Uint;
-- Returns sum of two integer values
function UI_Decimal_Digits_Hi (U : Uint) return Nat;
-- Returns an estimate of the number of decimal digits required to
-- represent the absolute value of U. This estimate is correct or high,
-- i.e. it never returns a value that is too low. The accuracy of the
-- estimate affects only the effectiveness of comparison optimizations
-- in Urealp.
function UI_Decimal_Digits_Lo (U : Uint) return Nat;
-- Returns an estimate of the number of decimal digits required to
-- represent the absolute value of U. This estimate is correct or low,
-- i.e. it never returns a value that is too high. The accuracy of the
-- estimate affects only the effectiveness of comparison optimizations
-- in Urealp.
function UI_Div (Left : Uint; Right : Uint) return Uint;
function UI_Div (Left : Int; Right : Uint) return Uint;
function UI_Div (Left : Uint; Right : Int) return Uint;
-- Returns quotient of two integer values. Fatal error if Right = 0
function UI_Eq (Left : Uint; Right : Uint) return Boolean;
function UI_Eq (Left : Int; Right : Uint) return Boolean;
function UI_Eq (Left : Uint; Right : Int) return Boolean;
pragma Inline (UI_Eq);
-- Compares integer values for equality
function UI_Expon (Left : Uint; Right : Uint) return Uint;
function UI_Expon (Left : Int; Right : Uint) return Uint;
function UI_Expon (Left : Uint; Right : Int) return Uint;
function UI_Expon (Left : Int; Right : Int) return Uint;
-- Returns result of exponentiating two integer values.
-- Fatal error if Right is negative.
function UI_GCD (Uin, Vin : Uint) return Uint;
-- Computes GCD of input values. Assumes Uin >= Vin >= 0
function UI_Ge (Left : Uint; Right : Uint) return Boolean;
function UI_Ge (Left : Int; Right : Uint) return Boolean;
function UI_Ge (Left : Uint; Right : Int) return Boolean;
pragma Inline (UI_Ge);
-- Compares integer values for greater than or equal
function UI_Gt (Left : Uint; Right : Uint) return Boolean;
function UI_Gt (Left : Int; Right : Uint) return Boolean;
function UI_Gt (Left : Uint; Right : Int) return Boolean;
pragma Inline (UI_Gt);
-- Compares integer values for greater than
function UI_Is_In_Int_Range (Input : Uint) return Boolean;
pragma Inline (UI_Is_In_Int_Range);
-- Determines if universal integer is in Int range
function UI_Le (Left : Uint; Right : Uint) return Boolean;
function UI_Le (Left : Int; Right : Uint) return Boolean;
function UI_Le (Left : Uint; Right : Int) return Boolean;
pragma Inline (UI_Le);
-- Compares integer values for less than or equal
function UI_Lt (Left : Uint; Right : Uint) return Boolean;
function UI_Lt (Left : Int; Right : Uint) return Boolean;
function UI_Lt (Left : Uint; Right : Int) return Boolean;
-- Compares integer values for less than
function UI_Max (Left : Uint; Right : Uint) return Uint;
function UI_Max (Left : Int; Right : Uint) return Uint;
function UI_Max (Left : Uint; Right : Int) return Uint;
-- Returns maximum of two integer values
function UI_Min (Left : Uint; Right : Uint) return Uint;
function UI_Min (Left : Int; Right : Uint) return Uint;
function UI_Min (Left : Uint; Right : Int) return Uint;
-- Returns minimum of two integer values
function UI_Mod (Left : Uint; Right : Uint) return Uint;
function UI_Mod (Left : Int; Right : Uint) return Uint;
function UI_Mod (Left : Uint; Right : Int) return Uint;
pragma Inline (UI_Mod);
-- Returns mod function of two integer values
function UI_Mul (Left : Uint; Right : Uint) return Uint;
function UI_Mul (Left : Int; Right : Uint) return Uint;
function UI_Mul (Left : Uint; Right : Int) return Uint;
-- Returns product of two integer values
function UI_Ne (Left : Uint; Right : Uint) return Boolean;
function UI_Ne (Left : Int; Right : Uint) return Boolean;
function UI_Ne (Left : Uint; Right : Int) return Boolean;
pragma Inline (UI_Ne);
-- Compares integer values for inequality
function UI_Negate (Right : Uint) return Uint;
pragma Inline (UI_Negate);
-- Returns negative of universal integer
function UI_Rem (Left : Uint; Right : Uint) return Uint;
function UI_Rem (Left : Int; Right : Uint) return Uint;
function UI_Rem (Left : Uint; Right : Int) return Uint;
-- Returns rem of two integer values
function UI_Sub (Left : Uint; Right : Uint) return Uint;
function UI_Sub (Left : Int; Right : Uint) return Uint;
function UI_Sub (Left : Uint; Right : Int) return Uint;
pragma Inline (UI_Sub);
-- Returns difference of two integer values
function UI_Modular_Exponentiation
(B : Uint;
E : Uint;
Modulo : Uint) return Uint;
-- Efficiently compute (B ** E) rem Modulo
function UI_Modular_Inverse (N : Uint; Modulo : Uint) return Uint;
-- Compute the multiplicative inverse of N in modular arithmetics with the
-- given Modulo (uses Euclid's algorithm). Note: the call is considered
-- to be erroneous (and the behavior is undefined) if n is not invertible.
function UI_From_Int (Input : Int) return Uint;
-- Converts Int value to universal integer form
function UI_From_CC (Input : Char_Code) return Uint;
-- Converts Char_Code value to universal integer form
function UI_To_Int (Input : Uint) return Int;
-- Converts universal integer value to Int. Fatal error if value is not in
-- appropriate range.
function UI_To_CC (Input : Uint) return Char_Code;
-- Converts universal integer value to Char_Code. Fatal error if value is
-- not in Char_Code range.
function Num_Bits (Input : Uint) return Nat;
-- Approximate number of binary bits in given universal integer. This
-- function is used for capacity checks, and it can be one bit off
-- without affecting its usage.
function Vector_To_Uint
(In_Vec : UI_Vector;
Negative : Boolean) return Uint;
-- Functions that calculate values in UI_Vectors, call this function to
-- create and return the Uint value. In_Vec contains the multiple precision
-- (Base) representation of a non-negative value. Leading zeroes are
-- permitted. Negative is set if the desired result is the negative of the
-- given value. The result will be either the appropriate directly
-- represented value, or a table entry in the proper canonical format is
-- created and returned.
--
-- Note that Init_Operand puts a signed value in the result vector, but
-- Vector_To_Uint is always presented with a non-negative value. The
-- processing of signs is something that is done by the caller before
-- calling Vector_To_Uint.
---------------------
-- Output Routines --
---------------------
type UI_Format is (Hex, Decimal, Auto);
-- Used to determine whether UI_Image/UI_Write output is in hexadecimal
-- or decimal format. Auto, the default setting, lets the routine make a
-- decision based on the value.
UI_Image_Max : constant := 48; -- Enough for a 128-bit number
UI_Image_Buffer : String (1 .. UI_Image_Max);
UI_Image_Length : Natural;
-- Buffer used for UI_Image as described below
procedure UI_Image (Input : Uint; Format : UI_Format := Auto);
-- Places a representation of Uint, consisting of a possible minus sign,
-- followed by the value in UI_Image_Buffer. The form of the value is an
-- integer literal in either decimal (no base) or hexadecimal (base 16)
-- format. If Hex is True on entry, then hex mode is forced, otherwise
-- UI_Image makes a guess at which output format is more convenient. The
-- value must fit in UI_Image_Buffer. The actual length of the result is
-- returned in UI_Image_Length. If necessary to meet this requirement, the
-- result is an approximation of the proper value, using an exponential
-- format. The image of No_Uint is output as a single question mark.
function UI_Image (Input : Uint; Format : UI_Format := Auto) return String;
-- Functional form, in which the result is returned as a string. This call
-- also leaves the result in UI_Image_Buffer/Length as described above.
procedure UI_Write (Input : Uint; Format : UI_Format := Auto);
-- Writes a representation of Uint, consisting of a possible minus sign,
-- followed by the value to the output file. The form of the value is an
-- integer literal in either decimal (no base) or hexadecimal (base 16)
-- format as appropriate. UI_Format shows which format to use. Auto, the
-- default, asks UI_Write to make a guess at which output format will be
-- more convenient to read.
procedure pid (Input : Uint);
pragma Export (Ada, pid);
-- Writes representation of Uint in decimal with a terminating line
-- return. This is intended for use from the debugger.
procedure pih (Input : Uint);
pragma Export (Ada, pih);
-- Writes representation of Uint in hex with a terminating line return.
-- This is intended for use from the debugger.
------------------------
-- Operator Renamings --
------------------------
function "+" (Left : Uint; Right : Uint) return Uint renames UI_Add;
function "+" (Left : Int; Right : Uint) return Uint renames UI_Add;
function "+" (Left : Uint; Right : Int) return Uint renames UI_Add;
function "/" (Left : Uint; Right : Uint) return Uint renames UI_Div;
function "/" (Left : Int; Right : Uint) return Uint renames UI_Div;
function "/" (Left : Uint; Right : Int) return Uint renames UI_Div;
function "*" (Left : Uint; Right : Uint) return Uint renames UI_Mul;
function "*" (Left : Int; Right : Uint) return Uint renames UI_Mul;
function "*" (Left : Uint; Right : Int) return Uint renames UI_Mul;
function "-" (Left : Uint; Right : Uint) return Uint renames UI_Sub;
function "-" (Left : Int; Right : Uint) return Uint renames UI_Sub;
function "-" (Left : Uint; Right : Int) return Uint renames UI_Sub;
function "**" (Left : Uint; Right : Uint) return Uint renames UI_Expon;
function "**" (Left : Uint; Right : Int) return Uint renames UI_Expon;
function "**" (Left : Int; Right : Uint) return Uint renames UI_Expon;
function "**" (Left : Int; Right : Int) return Uint renames UI_Expon;
function "abs" (Real : Uint) return Uint renames UI_Abs;
function "mod" (Left : Uint; Right : Uint) return Uint renames UI_Mod;
function "mod" (Left : Int; Right : Uint) return Uint renames UI_Mod;
function "mod" (Left : Uint; Right : Int) return Uint renames UI_Mod;
function "rem" (Left : Uint; Right : Uint) return Uint renames UI_Rem;
function "rem" (Left : Int; Right : Uint) return Uint renames UI_Rem;
function "rem" (Left : Uint; Right : Int) return Uint renames UI_Rem;
function "-" (Real : Uint) return Uint renames UI_Negate;
function "=" (Left : Uint; Right : Uint) return Boolean renames UI_Eq;
function "=" (Left : Int; Right : Uint) return Boolean renames UI_Eq;
function "=" (Left : Uint; Right : Int) return Boolean renames UI_Eq;
function ">=" (Left : Uint; Right : Uint) return Boolean renames UI_Ge;
function ">=" (Left : Int; Right : Uint) return Boolean renames UI_Ge;
function ">=" (Left : Uint; Right : Int) return Boolean renames UI_Ge;
function ">" (Left : Uint; Right : Uint) return Boolean renames UI_Gt;
function ">" (Left : Int; Right : Uint) return Boolean renames UI_Gt;
function ">" (Left : Uint; Right : Int) return Boolean renames UI_Gt;
function "<=" (Left : Uint; Right : Uint) return Boolean renames UI_Le;
function "<=" (Left : Int; Right : Uint) return Boolean renames UI_Le;
function "<=" (Left : Uint; Right : Int) return Boolean renames UI_Le;
function "<" (Left : Uint; Right : Uint) return Boolean renames UI_Lt;
function "<" (Left : Int; Right : Uint) return Boolean renames UI_Lt;
function "<" (Left : Uint; Right : Int) return Boolean renames UI_Lt;
-----------------------------
-- Mark/Release Processing --
-----------------------------
-- The space used by Uint data is not automatically reclaimed. However, a
-- mark-release regime is implemented which allows storage to be released
-- back to a previously noted mark. This is used for example when doing
-- comparisons, where only intermediate results get stored that do not
-- need to be saved for future use.
type Save_Mark is private;
function Mark return Save_Mark;
-- Note mark point for future release
procedure Release (M : Save_Mark);
-- Release storage allocated since mark was noted
procedure Release_And_Save (M : Save_Mark; UI : in out Uint);
-- Like Release, except that the given Uint value (which is typically among
-- the data being released) is recopied after the release, so that it is
-- the most recent item, and UI is updated to point to its copied location.
procedure Release_And_Save (M : Save_Mark; UI1, UI2 : in out Uint);
-- Like Release, except that the given Uint values (which are typically
-- among the data being released) are recopied after the release, so that
-- they are the most recent items, and UI1 and UI2 are updated if necessary
-- to point to the copied locations. This routine is careful to do things
-- in the right order, so that the values do not clobber one another.
-----------------------------------
-- Representation of Uint Values --
-----------------------------------
private
type Uint is new Int range Uint_Low_Bound .. Uint_High_Bound;
for Uint'Size use 32;
No_Uint : constant Uint := Uint (Uint_Low_Bound);
-- Uint values are represented as multiple precision integers stored in
-- a multi-digit format using Base as the base. This value is chosen so
-- that the product Base*Base is within the range of allowed Int values.
-- Base is defined to allow efficient execution of the primitive operations
-- (a0, b0, c0) defined in the section "The Classical Algorithms"
-- (sec. 4.3.1) of Donald Knuth's "The Art of Computer Programming",
-- Vol. 2. These algorithms are used in this package. In particular,
-- the product of two single digits in this base fits in a 32-bit integer.
Base_Bits : constant := 15;
-- Number of bits in base value
Base : constant Int := 2 ** Base_Bits;
-- Values in the range -(Base-1) .. Max_Direct are encoded directly as
-- Uint values by adding a bias value. The value of Max_Direct is chosen
-- so that a directly represented number always fits in two digits when
-- represented in base format.
Min_Direct : constant Int := -(Base - 1);
Max_Direct : constant Int := (Base - 1) * (Base - 1);
-- The following values define the bias used to store Uint values which
-- are in this range, as well as the biased values for the first and last
-- values in this range. We use a new derived type for these constants to
-- avoid accidental use of Uint arithmetic on these values, which is never
-- correct.
type Ctrl is range Int'First .. Int'Last;
Uint_Direct_Bias : constant Ctrl := Ctrl (Uint_Low_Bound) + Ctrl (Base);
Uint_Direct_First : constant Ctrl := Uint_Direct_Bias + Ctrl (Min_Direct);
Uint_Direct_Last : constant Ctrl := Uint_Direct_Bias + Ctrl (Max_Direct);
Uint_0 : constant Uint := Uint (Uint_Direct_Bias);
Uint_1 : constant Uint := Uint (Uint_Direct_Bias + 1);
Uint_2 : constant Uint := Uint (Uint_Direct_Bias + 2);
Uint_3 : constant Uint := Uint (Uint_Direct_Bias + 3);
Uint_4 : constant Uint := Uint (Uint_Direct_Bias + 4);
Uint_5 : constant Uint := Uint (Uint_Direct_Bias + 5);
Uint_6 : constant Uint := Uint (Uint_Direct_Bias + 6);
Uint_7 : constant Uint := Uint (Uint_Direct_Bias + 7);
Uint_8 : constant Uint := Uint (Uint_Direct_Bias + 8);
Uint_9 : constant Uint := Uint (Uint_Direct_Bias + 9);
Uint_10 : constant Uint := Uint (Uint_Direct_Bias + 10);
Uint_11 : constant Uint := Uint (Uint_Direct_Bias + 11);
Uint_12 : constant Uint := Uint (Uint_Direct_Bias + 12);
Uint_13 : constant Uint := Uint (Uint_Direct_Bias + 13);
Uint_14 : constant Uint := Uint (Uint_Direct_Bias + 14);
Uint_15 : constant Uint := Uint (Uint_Direct_Bias + 15);
Uint_16 : constant Uint := Uint (Uint_Direct_Bias + 16);
Uint_24 : constant Uint := Uint (Uint_Direct_Bias + 24);
Uint_32 : constant Uint := Uint (Uint_Direct_Bias + 32);
Uint_63 : constant Uint := Uint (Uint_Direct_Bias + 63);
Uint_64 : constant Uint := Uint (Uint_Direct_Bias + 64);
Uint_80 : constant Uint := Uint (Uint_Direct_Bias + 80);
Uint_128 : constant Uint := Uint (Uint_Direct_Bias + 128);
Uint_Minus_1 : constant Uint := Uint (Uint_Direct_Bias - 1);
Uint_Minus_2 : constant Uint := Uint (Uint_Direct_Bias - 2);
Uint_Minus_3 : constant Uint := Uint (Uint_Direct_Bias - 3);
Uint_Minus_4 : constant Uint := Uint (Uint_Direct_Bias - 4);
Uint_Minus_5 : constant Uint := Uint (Uint_Direct_Bias - 5);
Uint_Minus_6 : constant Uint := Uint (Uint_Direct_Bias - 6);
Uint_Minus_7 : constant Uint := Uint (Uint_Direct_Bias - 7);
Uint_Minus_8 : constant Uint := Uint (Uint_Direct_Bias - 8);
Uint_Minus_9 : constant Uint := Uint (Uint_Direct_Bias - 9);
Uint_Minus_12 : constant Uint := Uint (Uint_Direct_Bias - 12);
Uint_Minus_36 : constant Uint := Uint (Uint_Direct_Bias - 36);
Uint_Minus_63 : constant Uint := Uint (Uint_Direct_Bias - 63);
Uint_Minus_80 : constant Uint := Uint (Uint_Direct_Bias - 80);
Uint_Minus_128 : constant Uint := Uint (Uint_Direct_Bias - 128);
Uint_Max_Simple_Mul : constant := Uint_Direct_Bias + 2 ** 15;
-- If two values are directly represented and less than or equal to this
-- value, then we know the product fits in a 32-bit integer. This allows
-- UI_Mul to efficiently compute the product in this case.
type Save_Mark is record
Save_Uint : Uint;
Save_Udigit : Int;
end record;
-- Values outside the range that is represented directly are stored using
-- two tables. The secondary table Udigits contains sequences of Int values
-- consisting of the digits of the number in a radix Base system. The
-- digits are stored from most significant to least significant with the
-- first digit only carrying the sign.
-- There is one entry in the primary Uints table for each distinct Uint
-- value. This table entry contains the length (number of digits) and
-- a starting offset of the value in the Udigits table.
Uint_First_Entry : constant Uint := Uint (Uint_Table_Start);
-- Some subprograms defined in this package manipulate the Udigits table
-- directly, while for others it is more convenient to work with locally
-- defined arrays of the digits of the Universal Integers. The type
-- UI_Vector is defined for this purpose and some internal subprograms
-- used for converting from one to the other are defined.
type Uint_Entry is record
Length : Pos;
-- Length of entry in Udigits table in digits (i.e. in words)
Loc : Int;
-- Starting location in Udigits table of this Uint value
end record;
package Uints is new Table.Table (
Table_Component_Type => Uint_Entry,
Table_Index_Type => Uint'Base,
Table_Low_Bound => Uint_First_Entry,
Table_Initial => Alloc.Uints_Initial,
Table_Increment => Alloc.Uints_Increment,
Table_Name => "Uints");
package Udigits is new Table.Table (
Table_Component_Type => Int,
Table_Index_Type => Int,
Table_Low_Bound => 0,
Table_Initial => Alloc.Udigits_Initial,
Table_Increment => Alloc.Udigits_Increment,
Table_Name => "Udigits");
-- Note: the reason these tables are defined here in the private part of
-- the spec, rather than in the body, is that they are referenced directly
-- by gigi.
end Uintp;
| 46.710197 | 79 | 0.650837 |
a18b844bcba4439839fc84a2a648e8c41fa62a25 | 12,834 | adb | Ada | gcc-gcc-7_3_0-release/gcc/ada/s-tasdeb.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/ada/s-tasdeb.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/s-tasdeb.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . T A S K I N G . D E B U G --
-- --
-- B o d y --
-- --
-- Copyright (C) 1997-2014, Free Software Foundation, Inc. --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
-- This package encapsulates all direct interfaces to task debugging services
-- that are needed by gdb with gnat mode.
-- Note : This file *must* be compiled with debugging information
-- Do not add any dependency to GNARL packages since this package is used
-- in both normal and restricted (ravenscar) environments.
pragma Restriction_Warnings (No_Secondary_Stack);
-- We wish to avoid secondary stack usage here, because (e.g.) Trace is called
-- at delicate times, such as during task termination after the secondary
-- stack has been deallocated. It's just a warning, so we don't require
-- partition-wide consistency.
with System.CRTL;
with System.Storage_Elements; use System.Storage_Elements;
with System.Task_Primitives;
with System.Task_Primitives.Operations;
package body System.Tasking.Debug is
package STPO renames System.Task_Primitives.Operations;
type Trace_Flag_Set is array (Character) of Boolean;
Trace_On : Trace_Flag_Set := ('A' .. 'Z' => False, others => True);
Stderr_Fd : constant := 2;
-- File descriptor for standard error
-----------------------
-- Local Subprograms --
-----------------------
procedure Write (Fd : Integer; S : String; Count : Integer);
-- Write Count characters of S to the file descriptor Fd
procedure Put (S : String);
-- Display S on standard error
procedure Put_Line (S : String := "");
-- Display S on standard error with an additional line terminator
procedure Put_Task_Image (T : Task_Id);
-- Display relevant characters from T.Common.Task_Image on standard error
procedure Put_Task_Id_Image (T : Task_Id);
-- Display address in hexadecimal form on standard error
------------------------
-- Continue_All_Tasks --
------------------------
procedure Continue_All_Tasks is
C : Task_Id;
Dummy : Boolean;
begin
STPO.Lock_RTS;
C := All_Tasks_List;
while C /= null loop
Dummy := STPO.Continue_Task (C);
C := C.Common.All_Tasks_Link;
end loop;
STPO.Unlock_RTS;
end Continue_All_Tasks;
--------------------
-- Get_User_State --
--------------------
function Get_User_State return Long_Integer is
begin
return STPO.Self.User_State;
end Get_User_State;
----------------
-- List_Tasks --
----------------
procedure List_Tasks is
C : Task_Id;
begin
C := All_Tasks_List;
while C /= null loop
Print_Task_Info (C);
C := C.Common.All_Tasks_Link;
end loop;
end List_Tasks;
------------------------
-- Print_Current_Task --
------------------------
procedure Print_Current_Task is
begin
Print_Task_Info (STPO.Self);
end Print_Current_Task;
---------------------
-- Print_Task_Info --
---------------------
procedure Print_Task_Info (T : Task_Id) is
Entry_Call : Entry_Call_Link;
Parent : Task_Id;
begin
if T = null then
Put_Line ("null task");
return;
end if;
Put_Task_Image (T);
Put (": " & Task_States'Image (T.Common.State));
Parent := T.Common.Parent;
if Parent = null then
Put (", parent: <none>");
else
Put (", parent: ");
Put_Task_Image (Parent);
end if;
Put (", prio:" & T.Common.Current_Priority'Img);
if not T.Callable then
Put (", not callable");
end if;
if T.Aborting then
Put (", aborting");
end if;
if T.Deferral_Level /= 0 then
Put (", abort deferred");
end if;
if T.Common.Call /= null then
Entry_Call := T.Common.Call;
Put (", serving:");
while Entry_Call /= null loop
Put_Task_Id_Image (Entry_Call.Self);
Entry_Call := Entry_Call.Acceptor_Prev_Call;
end loop;
end if;
if T.Open_Accepts /= null then
Put (", accepting:");
for J in T.Open_Accepts'Range loop
Put (T.Open_Accepts (J).S'Img);
end loop;
if T.Terminate_Alternative then
Put (" or terminate");
end if;
end if;
if T.User_State /= 0 then
Put (", state:" & T.User_State'Img);
end if;
Put_Line;
end Print_Task_Info;
---------
-- Put --
---------
procedure Put (S : String) is
begin
Write (Stderr_Fd, S, S'Length);
end Put;
--------------
-- Put_Line --
--------------
procedure Put_Line (S : String := "") is
begin
Write (Stderr_Fd, S & ASCII.LF, S'Length + 1);
end Put_Line;
-----------------------
-- Put_Task_Id_Image --
-----------------------
procedure Put_Task_Id_Image (T : Task_Id) is
Address_Image_Length : constant :=
13 + (if Standard'Address_Size = 64 then 10 else 0);
-- Length of string to be printed for address of task
H : constant array (0 .. 15) of Character := "0123456789ABCDEF";
-- Table of hex digits
S : String (1 .. Address_Image_Length);
P : Natural;
N : Integer_Address;
U : Natural := 0;
begin
if T = null then
Put ("Null_Task_Id");
else
S (S'Last) := '#';
P := Address_Image_Length - 1;
N := To_Integer (T.all'Address);
while P > 3 loop
if U = 4 then
S (P) := '_';
P := P - 1;
U := 1;
else
U := U + 1;
end if;
S (P) := H (Integer (N mod 16));
P := P - 1;
N := N / 16;
end loop;
S (1 .. 3) := "16#";
Put (S);
end if;
end Put_Task_Id_Image;
--------------------
-- Put_Task_Image --
--------------------
procedure Put_Task_Image (T : Task_Id) is
begin
-- In case T.Common.Task_Image_Len is uninitialized junk, we check that
-- it is in range, to make this more robust.
if T.Common.Task_Image_Len in T.Common.Task_Image'Range then
Put (T.Common.Task_Image (1 .. T.Common.Task_Image_Len));
else
Put (T.Common.Task_Image);
end if;
end Put_Task_Image;
----------------------
-- Resume_All_Tasks --
----------------------
procedure Resume_All_Tasks (Thread_Self : OS_Interface.Thread_Id) is
C : Task_Id;
Dummy : Boolean;
begin
STPO.Lock_RTS;
C := All_Tasks_List;
while C /= null loop
Dummy := STPO.Resume_Task (C, Thread_Self);
C := C.Common.All_Tasks_Link;
end loop;
STPO.Unlock_RTS;
end Resume_All_Tasks;
---------------
-- Set_Trace --
---------------
procedure Set_Trace (Flag : Character; Value : Boolean := True) is
begin
Trace_On (Flag) := Value;
end Set_Trace;
--------------------
-- Set_User_State --
--------------------
procedure Set_User_State (Value : Long_Integer) is
begin
STPO.Self.User_State := Value;
end Set_User_State;
------------------------
-- Signal_Debug_Event --
------------------------
procedure Signal_Debug_Event
(Event_Kind : Event_Kind_Type;
Task_Value : Task_Id)
is
begin
null;
end Signal_Debug_Event;
--------------------
-- Stop_All_Tasks --
--------------------
procedure Stop_All_Tasks is
C : Task_Id;
Dummy : Boolean;
begin
STPO.Lock_RTS;
C := All_Tasks_List;
while C /= null loop
Dummy := STPO.Stop_Task (C);
C := C.Common.All_Tasks_Link;
end loop;
STPO.Unlock_RTS;
end Stop_All_Tasks;
----------------------------
-- Stop_All_Tasks_Handler --
----------------------------
procedure Stop_All_Tasks_Handler is
begin
STPO.Stop_All_Tasks;
end Stop_All_Tasks_Handler;
-----------------------
-- Suspend_All_Tasks --
-----------------------
procedure Suspend_All_Tasks (Thread_Self : OS_Interface.Thread_Id) is
C : Task_Id;
Dummy : Boolean;
begin
STPO.Lock_RTS;
C := All_Tasks_List;
while C /= null loop
Dummy := STPO.Suspend_Task (C, Thread_Self);
C := C.Common.All_Tasks_Link;
end loop;
STPO.Unlock_RTS;
end Suspend_All_Tasks;
------------------------
-- Task_Creation_Hook --
------------------------
procedure Task_Creation_Hook (Thread : OS_Interface.Thread_Id) is
pragma Inspection_Point (Thread);
-- gdb needs to access the thread parameter in order to implement
-- the multitask mode under VxWorks.
begin
null;
end Task_Creation_Hook;
---------------------------
-- Task_Termination_Hook --
---------------------------
procedure Task_Termination_Hook is
begin
null;
end Task_Termination_Hook;
-----------
-- Trace --
-----------
procedure Trace
(Self_Id : Task_Id;
Msg : String;
Flag : Character;
Other_Id : Task_Id := null)
is
begin
if Trace_On (Flag) then
Put_Task_Id_Image (Self_Id);
Put (":" & Flag & ":");
Put_Task_Image (Self_Id);
Put (":");
if Other_Id /= null then
Put_Task_Id_Image (Other_Id);
Put (":");
end if;
Put_Line (Msg);
end if;
end Trace;
-----------
-- Write --
-----------
procedure Write (Fd : Integer; S : String; Count : Integer) is
Discard : System.CRTL.ssize_t;
-- Ignore write errors here; this is just debugging output, and there's
-- nothing to be done about errors anyway.
begin
Discard :=
System.CRTL.write
(Fd, S'Address, System.CRTL.size_t (Count));
end Write;
-----------------
-- Master_Hook --
-----------------
procedure Master_Hook
(Dependent : Task_Id;
Parent : Task_Id;
Master_Level : Integer)
is
pragma Inspection_Point (Dependent);
pragma Inspection_Point (Parent);
pragma Inspection_Point (Master_Level);
begin
null;
end Master_Hook;
---------------------------
-- Master_Completed_Hook --
---------------------------
procedure Master_Completed_Hook
(Self_ID : Task_Id;
Master_Level : Integer)
is
pragma Inspection_Point (Self_ID);
pragma Inspection_Point (Master_Level);
begin
null;
end Master_Completed_Hook;
end System.Tasking.Debug;
| 27.248408 | 79 | 0.507168 |
3d29c0d352cf6419c5837a4cf6167c4f9179d187 | 3,950 | ads | Ada | Sources/Globe_3d/gl/gl-math.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | 1 | 2019-09-21T09:40:34.000Z | 2019-09-21T09:40:34.000Z | Sources/Globe_3d/gl/gl-math.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | null | null | null | Sources/Globe_3d/gl/gl-math.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | 1 | 2019-09-25T12:29:27.000Z | 2019-09-25T12:29:27.000Z |
with Ada.Numerics.Generic_Elementary_Functions;
with Ada.Text_IO;
package GL.Math is
package REF is new Ada.Numerics.Generic_Elementary_Functions (Double);
package RIO is new Ada.Text_IO.Float_IO (Double);
-------------
-- Vectors --
-------------
function "*" (l : Double; v : Double_Vector_3D) return Double_Vector_3D;
pragma Inline ("*");
function "*" (v : Double_Vector_3D; l : Double) return Double_Vector_3D;
pragma Inline ("*");
function "+" (a, b : Double_Vector_3D) return Double_Vector_3D;
pragma Inline ("+");
function "-" (a : Double_Vector_3D) return Double_Vector_3D;
pragma Inline ("-");
function "-" (a, b : Double_Vector_3D) return Double_Vector_3D;
pragma Inline ("-");
function "*" (a, b : Double_Vector_3D) return Double; -- dot product
pragma Inline ("*");
function "*" (a, b : Double_Vector_3D) return Double_Vector_3D; -- cross product
pragma Inline ("*");
function Norm (a : Double_Vector_3D) return Double;
pragma Inline (Norm);
function Norm2 (a : Double_Vector_3D) return Double;
pragma Inline (Norm2);
function Normalized (a : Double_Vector_3D) return Double_Vector_3D;
type Vector_4D is array (0 .. 3) of Double;
-- Angles
--
function Angle (Point_1, Point_2, Point_3 : Double_Vector_3D) return Double;
--
-- returns the angle between the vector Point_1 to Point_2 and the vector Point_3 to Point_2.
function to_Degrees (Radians : Double) return Double;
function to_Radians (Degrees : Double) return Double;
--------------
-- Matrices --
--------------
type Matrix is array (Positive range <>, Positive range <>) of aliased Double;
type Matrix_33 is new Matrix (1 .. 3, 1 .. 3);
type Matrix_44 is new Matrix (1 .. 4, 1 .. 4);
-- type Matrix_44 is array (0 .. 3, 0 .. 3) of aliased Double; -- for GL.MultMatrix
pragma Convention (Fortran, Matrix_44); -- GL stores matrices columnwise -- tbd : use same convention for other matrices ?
Id_33 : constant Matrix_33 := ((1.0, 0.0, 0.0),
(0.0, 1.0, 0.0),
(0.0, 0.0, 1.0));
function "*" (A, B : Matrix_33) return Matrix_33;
function "*" (A : Matrix_33; x : Double_Vector_3D) return Double_Vector_3D;
function "*" (A : Matrix_44; x : Double_Vector_3D) return Double_Vector_3D;
function "*" (A : Matrix_44; x : Double_Vector_3D) return Vector_4D;
function Transpose (A : Matrix_33) return Matrix_33;
function Transpose (A : Matrix_44) return Matrix_44;
function Det (A : Matrix_33) return Double;
function XYZ_rotation (ax, ay, az : Double) return Matrix_33;
function XYZ_rotation (v : Double_Vector_3D) return Matrix_33;
-- Gives a rotation matrix that corresponds to look into a certain
-- direction. Camera swing rotation is arbitrary.
-- Left - multiply by XYZ_Rotation (0.0, 0.0, az) to correct it.
function Look_at (direction : Double_Vector_3D) return Matrix_33;
function Look_at (eye, center, up : Double_Vector_3D) return Matrix_33;
-- This is for correcting cumulation of small computational
-- errors, making the rotation matrix no more orthogonal
procedure Re_Orthonormalize (M : in out Matrix_33);
-- Right - multiply current matrix by A
procedure Multiply_GL_Matrix (A : Matrix_33);
-- Impose A as current matrix
procedure Set_GL_Matrix (A : Matrix_33);
-- For replacing the " = 0.0" test which is a Bad Thing
function Almost_zero (x : Double) return Boolean;
pragma Inline (Almost_zero);
function Almost_zero (x : GL.C_Float) return Boolean;
pragma Inline (Almost_zero);
function Sub_Matrix (Self : Matrix;
start_Row, end_Row : Positive;
start_Col, end_Col : Positive) return Matrix;
end GL.Math;
| 35.267857 | 143 | 0.643038 |
c7451b408fe70ddeddf87980797cc759b7315e9a | 1,067 | adb | Ada | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/var_arr_typedef/var_arr_typedef.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 31 | 2018-08-01T21:25:24.000Z | 2022-02-14T07:52:34.000Z | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/var_arr_typedef/var_arr_typedef.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 40 | 2018-12-03T19:48:52.000Z | 2021-03-10T06:34:26.000Z | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/var_arr_typedef/var_arr_typedef.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 20 | 2018-11-16T21:19:22.000Z | 2021-10-18T23:08:24.000Z | -- Copyright 2015-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 Pack; use Pack;
procedure Var_Arr_Typedef is
RA : constant Rec_Type := (3, False);
RB : constant Rec_Type := (2, True);
VA : constant Vec_Type := (RA, RA, RB, RB);
VB : constant Vec_Type := (RB, RB, RA, RA);
A : constant Array_Type (1 .. Identity (4)) := (VA, VA, VB, VB);
begin
Do_Nothing (A); -- BREAK
end Var_Arr_Typedef;
| 36.793103 | 73 | 0.697282 |
229075b92bff3ffe70bf51cdfc57a7508f195c61 | 247 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/inline3_pkg.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/inline3_pkg.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/inline3_pkg.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | package body Inline3_Pkg is
procedure Test (I : Integer) is
function F (J : Integer) return Integer is
begin
return I - J;
end;
begin
if I /= F (I) then
raise Program_Error;
end if;
end;
end Inline3_Pkg;
| 13.722222 | 46 | 0.603239 |
414d9f9f42a723b8e14057976c02dd2785470ef9 | 8,770 | adb | Ada | sources/md/markdown-link_reference_definitions.adb | reznikmm/markdown | af47bd45427f1c016c0a2a11e86fa2d1b1c82315 | [
"MIT"
] | null | null | null | sources/md/markdown-link_reference_definitions.adb | reznikmm/markdown | af47bd45427f1c016c0a2a11e86fa2d1b1c82315 | [
"MIT"
] | null | null | null | sources/md/markdown-link_reference_definitions.adb | reznikmm/markdown | af47bd45427f1c016c0a2a11e86fa2d1b1c82315 | [
"MIT"
] | null | null | null | -- SPDX-FileCopyrightText: 2020 Max Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
----------------------------------------------------------------
with League.Regexps;
with Markdown.Common_Patterns;
with Markdown.Visitors;
package body Markdown.Link_Reference_Definitions is
function "+" (Text : Wide_Wide_String)
return League.Regexps.Regexp_Pattern
is (League.Regexps.Compile (League.Strings.To_Universal_String (Text)));
Blank_Pattern : League.Regexps.Regexp_Pattern renames
Markdown.Common_Patterns.Blank_Pattern;
Link_Label : Wide_Wide_String renames Markdown.Common_Patterns.Link_Label;
-- Groups: 2
Link_Title : Wide_Wide_String renames Markdown.Common_Patterns.Link_Title;
-- Groups: 4
Label_Pattern : constant League.Regexps.Regexp_Pattern :=
+("^\ {0,3}(" & Link_Label & ")\:" &
-- Grps:1 2,3
"[\ \t\n\v\f\r\>]*"
);
Space_Pattern : constant League.Regexps.Regexp_Pattern :=
+("^[\ \t\n\v\f\r\>]*");
Title_Pattern : constant League.Regexps.Regexp_Pattern :=
+("^[\ \t\n\v\f\r\>]*(" & Link_Title & ")?[\ \t\n\v\f\r\>]*$");
-- Groups: 1 2,3,4,5
Title_Close_Group : constant array (Positive range 1 .. 3) of Positive :=
(2, 3, 5); -- Close title group numbers
-----------------
-- Append_Line --
-----------------
overriding procedure Append_Line
(Self : in out Link_Reference_Definition;
Line : Markdown.Blocks.Text_Line;
CIP : Can_Interrupt_Paragraph;
Ok : in out Boolean)
is
pragma Unreferenced (CIP);
Last : Natural;
Text : League.Strings.Universal_String := Line.Line;
Match : League.Regexps.Regexp_Match;
begin
if Self.Has_Title then
Ok := False;
elsif not Self.Has_URL then
Match := Space_Pattern.Find_Match (Text);
pragma Assert (Match.Is_Matched);
Text := Text.Tail_From (Match.Last_Index + 1); -- drop spaces
Markdown.Common_Patterns.Parse_Link_Destination
(Line => Text,
Last => Last,
URL => Self.URL);
Self.Has_URL := Last > 0;
if Last = 0 then
Ok := False;
elsif Last = Text.Length then
Ok := True;
else
Text := Text.Tail_From (Last + 1); -- drop link dest
Match := Title_Pattern.Find_Match (Text);
Ok := Match.Is_Matched;
if Ok then
Self.Has_Title :=
(for some J of Title_Close_Group =>
Match.Last_Index (J) >= Match.First_Index (J));
Text := Match.Capture (1);
if Self.Has_Title then
Self.Title.Append (Text.Slice (2, Text.Length - 1));
elsif not Text.Is_Empty then
Self.Start := Text (1).To_Wide_Wide_Character;
Self.Title.Append (Text.Tail_From (2));
end if;
else
null; -- FIXME: Turn the block into a paragraph?
end if;
end if;
elsif Self.Title.Is_Empty then
Match := Title_Pattern.Find_Match (Text);
Ok := Match.Is_Matched;
if Ok then
Self.Has_Title :=
(for some J of Title_Close_Group =>
Match.Last_Index (J) >= Match.First_Index (J));
Text := Match.Capture (1);
if Self.Has_Title then
Self.Title.Append (Text.Slice (2, Text.Length - 1));
elsif not Text.Is_Empty then
Self.Start := Text (1).To_Wide_Wide_Character;
Self.Title.Append (Text.Tail_From (2));
end if;
else
null; -- FIXME: Turn the block into a paragraph?
end if;
elsif Blank_Pattern.Find_Match (Text).Is_Matched then
Ok := False;
null; -- FIXME: Turn the block into a paragraph?
else
declare
Escape : Boolean := False;
To : Natural := 0;
Stop : constant Wide_Wide_Character :=
(if Self.Start = '(' then ')' else Self.Start);
begin
for J in 1 .. Text.Length loop
if Escape then
Escape := False;
elsif Text (J).To_Wide_Wide_Character = '\' then
Escape := True;
elsif Text (J).To_Wide_Wide_Character = Stop then
Self.Has_Title := True;
To := J;
exit;
end if;
end loop;
Ok := not Escape and then To in 0 | Text.Length;
if Self.Has_Title and To > 1 then
Self.Title.Append (Text.Tail_From (To - 1));
elsif Ok then
Self.Title.Append (Text);
else
null; -- FIXME: Turn the block into a paragraph?
end if;
end;
end if;
end Append_Line;
------------
-- Create --
------------
overriding function Create
(Line : not null access Markdown.Blocks.Text_Line)
return Link_Reference_Definition
is
Last : Natural;
Text : League.Strings.Universal_String := Line.Line;
Match : League.Regexps.Regexp_Match :=
Label_Pattern.Find_Match (Text);
begin
pragma Assert (Match.Is_Matched);
return Self : Link_Reference_Definition do
Self.Label := Match.Capture (1);
if Match.Last_Index < Text.Length then
Text := Text.Tail_From (Match.Last_Index + 1); -- drop label
Markdown.Common_Patterns.Parse_Link_Destination
(Line => Text,
Last => Last,
URL => Self.URL);
Self.Has_URL := Last > 0;
pragma Assert (Last > 0);
if Last < Text.Length then
Text := Text.Tail_From (Last + 1); -- drop link dest
Match := Title_Pattern.Find_Match (Text);
Self.Has_Title :=
(for some J of Title_Close_Group =>
Match.Last_Index (J) >= Match.First_Index (J));
Text := Match.Capture (1);
if Self.Has_Title then
Self.Title.Append (Text.Slice (2, Text.Length - 1));
elsif not Text.Is_Empty then
Self.Start := Text (1).To_Wide_Wide_Character;
Self.Title.Append (Text.Tail_From (2));
end if;
end if;
end if;
Line.Line.Clear;
end return;
end Create;
-----------------
-- Destination --
-----------------
function Destination
(Self : Link_Reference_Definition'Class)
return League.Strings.Universal_String is
begin
return Self.URL;
end Destination;
------------
-- Filter --
------------
procedure Filter
(Line : Markdown.Blocks.Text_Line;
Tag : in out Ada.Tags.Tag;
CIP : out Can_Interrupt_Paragraph)
is
Ignore : League.Strings.Universal_String;
Last : Natural;
Text : League.Strings.Universal_String := Line.Line;
Match : constant League.Regexps.Regexp_Match :=
Label_Pattern.Find_Match (Line.Line);
begin
CIP := False;
if Match.Is_Matched then
if Match.Last_Index < Text.Length then
Text := Text.Tail_From (Match.Last_Index + 1); -- drop label
Markdown.Common_Patterns.Parse_Link_Destination
(Line => Text,
Last => Last,
URL => Ignore);
if Last = 0 then
return; -- Wrong link destination
elsif Last < Text.Length then
Text := Text.Tail_From (Last + 1); -- drop link dest
if not Title_Pattern.Find_Match (Text).Is_Matched then
return; -- Wrong link title
end if;
end if;
end if;
Tag := Link_Reference_Definition'Tag;
end if;
end Filter;
-----------
-- Label --
-----------
function Label
(Self : Link_Reference_Definition'Class)
return League.Strings.Universal_String is
begin
return Self.Label;
end Label;
-----------
-- Title --
-----------
function Title
(Self : Link_Reference_Definition'Class)
return League.String_Vectors.Universal_String_Vector is
begin
return Self.Title;
end Title;
-----------
-- Visit --
-----------
overriding procedure Visit
(Self : in out Link_Reference_Definition;
Visitor : in out Markdown.Visitors.Visitor'Class) is
begin
Visitor.Link_Reference_Definition (Self);
end Visit;
end Markdown.Link_Reference_Definitions;
| 29.728814 | 79 | 0.5374 |
227c45cb4c8ed0a737947c28ba84de32dda84fd4 | 85,787 | adb | Ada | .emacs.d/elpa/wisi-3.0.1/wisi.adb | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/wisi-3.0.1/wisi.adb | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/wisi-3.0.1/wisi.adb | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | -- Abstract :
--
-- See spec.
--
-- Copyright (C) 2017 - 2020 Free Software Foundation, Inc.
--
-- This library is free software; you can redistribute it and/or modify it
-- under terms of the GNU General Public License as published by the Free
-- Software Foundation; either version 3, or (at your option) any later
-- version. This library is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHAN-
-- TABILITY or FITNESS FOR A PARTICULAR PURPOSE.
-- As a special exception under Section 7 of GPL version 3, you are granted
-- additional permissions described in the GCC Runtime Library Exception,
-- version 3.1, as published by the Free Software Foundation.
pragma License (Modified_GPL);
with Ada.Exceptions;
with Ada.Strings.Bounded;
with Ada.Strings.Unbounded;
with Ada.Text_IO;
with SAL;
with WisiToken.Semantic_Checks;
package body Wisi is
use WisiToken;
Chars_Per_Int : constant Integer := Integer'Width;
----------
-- body subprogram specs (as needed), alphabetical
function Indent_Nil_P (Indent : in Indent_Type) return Boolean;
function Max_Anchor_ID
(Data : in out Parse_Data_Type;
First_Line : in Line_Number_Type;
Last_Line : in Line_Number_Type)
return Integer;
function Paren_In_Anchor_Line
(Data : in out Parse_Data_Type'Class;
Anchor_Token : in Augmented_Token;
Offset : in Integer)
return Integer;
----------
-- body subprograms bodies, alphabetical
function Image (Anchor_IDs : in Anchor_ID_Vectors.Vector) return String
is
use Ada.Strings.Unbounded;
Result : Unbounded_String := +"(";
begin
for I in Anchor_IDs.First_Index .. Anchor_IDs.Last_Index loop
Result := Result & Integer'Image (Anchor_IDs (I));
if I /= Anchor_IDs.Last_Index then
Result := Result & ", ";
else
Result := Result & ")";
end if;
end loop;
return -Result;
end Image;
function Image (Indent : in Indent_Type) return String
is begin
case Indent.Label is
when Not_Set =>
return "(" & Indent_Label'Image (Indent.Label) & ")";
when Int =>
return "(" & Indent_Label'Image (Indent.Label) & Integer'Image (Indent.Int_Indent) & ")";
when Anchor_Nil =>
return "(" & Indent_Label'Image (Indent.Label) & ", " & Image (Indent.Anchor_Nil_IDs) & ", nil)";
when Anchor_Int =>
return "(" & Indent_Label'Image (Indent.Label) & ", " & Image (Indent.Anchor_Int_IDs) & ", " & Integer'Image
(Indent.Anchor_Int_Indent) & ")";
when Anchored =>
return "(" & Indent_Label'Image (Indent.Label) & ", " & Integer'Image (Indent.Anchored_ID) & ", " &
Integer'Image (Indent.Anchored_Delta) & ")";
when Anchor_Anchored =>
return "(" & Indent_Label'Image (Indent.Label) & ", " & Image (Indent.Anchor_Anchored_IDs) & Integer'Image
(Indent.Anchor_Anchored_ID) & ", " & Integer'Image (Indent.Anchor_Anchored_Delta) & ")";
end case;
end Image;
procedure Indent_Apply_Anchored
(Delta_Indent : in Simple_Delta_Type;
Indent : in out Indent_Type)
with Pre => Delta_Indent.Label = Anchored
is begin
-- Add Delta_Indent to Indent
case Indent.Label is
when Not_Set =>
Indent := (Anchored, Delta_Indent.Anchored_ID, Delta_Indent.Anchored_Delta);
when Int =>
if Delta_Indent.Anchored_Accumulate then
Indent := (Anchored, Delta_Indent.Anchored_ID, Indent.Int_Indent + Delta_Indent.Anchored_Delta);
end if;
when Anchor_Nil =>
Indent :=
(Anchor_Anchored,
Indent.Anchor_Nil_IDs,
Delta_Indent.Anchored_ID,
Delta_Indent.Anchored_Delta);
when Anchor_Int =>
if Delta_Indent.Anchored_Accumulate then
Indent :=
(Anchor_Anchored,
Indent.Anchor_Int_IDs,
Delta_Indent.Anchored_ID,
Delta_Indent.Anchored_Delta + Indent.Anchor_Int_Indent);
end if;
when Anchored | Anchor_Anchored =>
-- already anchored
null;
end case;
end Indent_Apply_Anchored;
procedure Indent_Apply_Int (Indent : in out Indent_Type; Offset : in Integer)
is begin
-- Add an Int indent to Indent
case Indent.Label is
when Not_Set =>
Indent := (Int, Offset);
when Int =>
Indent.Int_Indent := Indent.Int_Indent + Offset;
when Anchor_Nil =>
Indent :=
(Label => Anchor_Int,
Anchor_Int_IDs => Indent.Anchor_Nil_IDs,
Anchor_Int_Indent => Offset);
when Anchor_Int =>
Indent.Anchor_Int_Indent := Indent.Anchor_Int_Indent + Offset;
when Anchored | Anchor_Anchored =>
null;
end case;
end Indent_Apply_Int;
procedure Indent_Line
(Data : in out Parse_Data_Type;
Line : in Line_Number_Type;
Delta_Indent : in Delta_Type)
is
-- See note in Indent_Anchored_2 for why we can't use renames here.
Indent : Indent_Type := Data.Indents (Line);
begin
case Delta_Indent.Label is
when Simple =>
case Delta_Indent.Simple_Delta.Label is
when None =>
null;
when Int =>
Indent_Apply_Int (Indent, Delta_Indent.Simple_Delta.Int_Delta);
when Anchored =>
Indent_Apply_Anchored (Delta_Indent.Simple_Delta, Indent);
end case;
when Hanging =>
if Delta_Indent.Hanging_Accumulate or Indent_Nil_P (Data.Indents (Line)) then
if Line = Delta_Indent.Hanging_First_Line then
-- Apply delta_1
case Delta_Indent.Hanging_Delta_1.Label is
when None =>
null;
when Int =>
Indent_Apply_Int (Indent, Delta_Indent.Hanging_Delta_1.Int_Delta);
when Anchored =>
Indent_Apply_Anchored (Delta_Indent.Hanging_Delta_1, Indent);
end case;
else
if Delta_Indent.Hanging_Paren_State = Data.Line_Paren_State (Line) then
case Delta_Indent.Hanging_Delta_2.Label is
when None =>
null;
when Int =>
Indent_Apply_Int (Indent, Delta_Indent.Hanging_Delta_2.Int_Delta);
when Anchored =>
Indent_Apply_Anchored (Delta_Indent.Hanging_Delta_2, Indent);
end case;
end if;
end if;
end if;
end case;
if Trace_Action > Extra then
Ada.Text_IO.Put_Line (";; indent_line: " & Line_Number_Type'Image (Line) & " => " & Image (Indent));
end if;
Data.Indents.Replace_Element (Line, Indent);
end Indent_Line;
function Indent_Nil_P (Indent : in Indent_Type) return Boolean
is begin
return Indent.Label in Not_Set | Anchor_Nil;
end Indent_Nil_P;
function Max_Anchor_ID
(Data : in out Parse_Data_Type;
First_Line : in Line_Number_Type;
Last_Line : in Line_Number_Type)
return Integer
is
Result : Integer := First_Anchor_ID - 1;
begin
for Line in First_Line .. Last_Line loop
declare
Indent : Indent_Type renames Data.Indents (Line);
begin
case Indent.Label is
when Not_Set | Int =>
null;
when Anchor_Nil =>
Result := Integer'Max (Result, Indent.Anchor_Nil_IDs (Indent.Anchor_Nil_IDs.First_Index));
when Anchor_Int =>
Result := Integer'Max (Result, Indent.Anchor_Int_IDs (Indent.Anchor_Int_IDs.First_Index));
when Anchored =>
Result := Integer'Max (Result, Indent.Anchored_ID);
when Anchor_Anchored =>
Result := Integer'Max (Result, Indent.Anchor_Anchored_ID);
end case;
end;
end loop;
return Result;
end Max_Anchor_ID;
function Paren_In_Anchor_Line
(Data : in out Parse_Data_Type'Class;
Anchor_Token : in Augmented_Token;
Offset : in Integer)
return Integer
is
Left_Paren_ID : Token_ID renames Data.Left_Paren_ID;
Right_Paren_ID : Token_ID renames Data.Right_Paren_ID;
I : Base_Token_Index := Anchor_Token.First_Terminals_Index;
Paren_Count : Integer := 0;
Paren_Char_Pos : Buffer_Pos := Invalid_Buffer_Pos;
Text_Begin_Pos : Buffer_Pos := Invalid_Buffer_Pos;
begin
loop
declare
Tok : Augmented_Token renames Data.Terminals (I);
begin
if Tok.ID = Left_Paren_ID then
Paren_Count := Paren_Count + 1;
if Paren_Count = 1 then
Paren_Char_Pos := Tok.Char_Region.First;
end if;
elsif Tok.ID = Right_Paren_ID then
Paren_Count := Paren_Count - 1;
end if;
if Tok.First then
Text_Begin_Pos := Tok.Char_Region.First;
exit;
end if;
end;
I := I - 1;
end loop;
if Paren_Char_Pos /= Invalid_Buffer_Pos and Text_Begin_Pos /= Invalid_Buffer_Pos then
return 1 + Offset + Integer (Paren_Char_Pos - Text_Begin_Pos);
else
return Offset;
end if;
end Paren_In_Anchor_Line;
procedure Put (Cache : in Navigate_Cache_Type)
is
package Bounded is new Ada.Strings.Bounded.Generic_Bounded_Length (Max => 2 + 11 * Chars_Per_Int);
use Bounded;
Line : Bounded_String := To_Bounded_String ("[");
procedure Append (Item : in Nil_Buffer_Pos)
is begin
if Item.Set then
Append (Line, Buffer_Pos'Image (Item.Item));
else
Append (Line, " -1");
end if;
end Append;
begin
Append (Line, Navigate_Cache_Code);
Append (Line, Buffer_Pos'Image (Cache.Pos));
Append (Line, Token_ID'Image (Cache.Statement_ID));
Append (Line, Token_ID'Image (Cache.ID));
Append (Line, Integer'Image (Cache.Length));
Append (Line, Integer'Image (Navigate_Class_Type'Pos (Cache.Class)));
Append (Cache.Containing_Pos);
Append (Cache.Prev_Pos);
Append (Cache.Next_Pos);
Append (Cache.End_Pos);
Append (Line, ']');
Ada.Text_IO.Put_Line (To_String (Line));
end Put;
procedure Put (Cache : in WisiToken.Buffer_Region)
is begin
Ada.Text_IO.Put_Line
("[" & Name_Property_Code & Buffer_Pos'Image (Cache.First) & Buffer_Pos'Image (Cache.Last) & "]");
end Put;
procedure Put (Cache : in Face_Cache_Type)
is
package Bounded is new Ada.Strings.Bounded.Generic_Bounded_Length (Max => 2 + 4 * Chars_Per_Int);
use Bounded;
Line : Bounded_String := To_Bounded_String ("[");
begin
if Cache.Face.Set then
Append (Line, Face_Property_Code);
Append (Line, Buffer_Pos'Image (Cache.Char_Region.First));
Append (Line, Buffer_Pos'Image (Cache.Char_Region.Last));
Append (Line, Integer'Image (Cache.Face.Item));
Append (Line, ']');
Ada.Text_IO.Put_Line (To_String (Line));
end if;
end Put;
procedure Put (Line_Number : in Line_Number_Type; Item : in Indent_Type)
is begin
-- All Anchors must be resolved at this point, but not all lines have
-- an indent computed. A negative indent is an error in either the
-- grammar indent rules or the algorithms in this package.
case Item.Label is
when Not_Set =>
-- Especially with partial parse, we have no idea what this indent should be.
null;
when Int =>
declare
-- We can easily get negative indents when there are syntax errors.
Ind : constant Integer := Integer'Max (0, Item.Int_Indent);
begin
Ada.Text_IO.Put_Line
('[' & Indent_Code & Line_Number_Type'Image (Line_Number) & Integer'Image (Ind) & ']');
end;
when Anchor_Nil | Anchor_Int | Anchored | Anchor_Anchored =>
raise SAL.Programmer_Error with "Indent item has non-int label: " & Indent_Label'Image (Item.Label);
end case;
end Put;
procedure Put
(Item : in Parse.LR.Configuration;
Terminals : in Augmented_Token_Arrays.Vector;
Descriptor : in WisiToken.Descriptor;
Embedded_Quote_Escape_Doubled : in Boolean)
is
use Ada.Strings.Unbounded;
use Parse.LR;
use Parse.LR.Config_Op_Arrays, Parse.LR.Config_Op_Array_Refs;
-- Output is a sequence of edit regions; each is:
-- [edit-pos [inserted token-ids] [deleted token-ids] deleted-region]
type State_Label is
(None, -- not started yet
Inserted, -- edit-pos, some insert ids appended
Deleted); -- some delete ids appended
State : State_Label := None;
-- State of the current edit region.
Line : Unbounded_String := To_Unbounded_String ("[");
Deleted_Region : Buffer_Region := Null_Buffer_Region;
Last_Deleted : Config_Op (Delete) := (Delete, Invalid_Token_ID, Invalid_Token_Index);
procedure Start_Edit_Region (Op : in Insert_Delete_Op)
is begin
Append (Line, "[");
Append (Line, Buffer_Pos'Image (Terminals (WisiToken.Parse.LR.Token_Index (Op)).Char_Region.First));
Append (Line, "[");
end Start_Edit_Region;
function Deleted_Region_Image return String
is begin
return "(" & Deleted_Region.First'Image & " . " & Buffer_Pos'Image (Deleted_Region.Last + 1) & ")";
end Deleted_Region_Image;
procedure Terminate_Edit_Region
is begin
case State is
when None =>
null;
when Inserted =>
Append (Line, "][]" & Deleted_Region_Image & "]");
when Deleted =>
Append (Line, "]" & Deleted_Region_Image & "]");
end case;
Deleted_Region := Null_Buffer_Region;
end Terminate_Edit_Region;
begin
if Trace_Action > Detail then
Ada.Text_IO.Put_Line (";; " & Parse.LR.Image (Item.Ops, Descriptor));
end if;
Append (Line, Recover_Code);
for I in First_Index (Item.Ops) .. Last_Index (Item.Ops) loop
declare
Op : Config_Op renames Constant_Ref (Item.Ops, I);
begin
case Op.Op is
when Fast_Forward =>
Terminate_Edit_Region;
State := None;
when Undo_Reduce | Push_Back =>
null;
when Insert =>
case State is
when None =>
Start_Edit_Region (Op);
when Inserted =>
null;
when Deleted =>
Terminate_Edit_Region;
Start_Edit_Region (Op);
end case;
Append (Line, Token_ID'Image (Op.Ins_ID));
State := Inserted;
when Delete =>
Deleted_Region := Deleted_Region and Terminals (Op.Del_Token_Index).Char_Region;
declare
Skip : Boolean := False;
begin
case State is
when None =>
Start_Edit_Region (Op);
Append (Line, "][");
when Inserted =>
Append (Line, "][");
when Deleted =>
if Embedded_Quote_Escape_Doubled and then
((Last_Deleted.Del_ID = Descriptor.String_1_ID and Op.Del_ID = Descriptor.String_1_ID) or
(Last_Deleted.Del_ID = Descriptor.String_2_ID and Op.Del_ID = Descriptor.String_2_ID))
then
declare
Tok_1 : Augmented_Token renames Terminals (Last_Deleted.Del_Token_Index);
Tok_2 : Augmented_Token renames Terminals (Op.Del_Token_Index);
begin
if Tok_1.Char_Region.Last + 1 = Tok_2.Char_Region.First then
-- Buffer text was '"""', lexer repair changed it to '""""'. The
-- repaired text looks like a single string with an embedded quote.
-- But here, it is two STRING_LITERAL tokens. Don't send the second
-- delete to elisp. See test/ada_mode-recover_string_quote_1.adb
Skip := True;
end if;
end;
end if;
end case;
State := Deleted;
if not Skip then
Append (Line, Token_ID'Image (Op.Del_ID));
end if;
end;
Last_Deleted := Op;
end case;
end;
end loop;
case State is
when None =>
null;
when Inserted | Deleted =>
Terminate_Edit_Region;
end case;
Append (Line, "]");
Ada.Text_IO.Put_Line (To_String (Line));
end Put;
procedure Resolve_Anchors (Data : in out Parse_Data_Type)
is
Begin_Indent : Integer renames Data.Begin_Indent;
Anchor_Indent : array (First_Anchor_ID .. Data.Max_Anchor_ID) of Integer;
begin
if Trace_Action > Outline then
Ada.Text_IO.New_Line;
Ada.Text_IO.Put_Line (";; Begin_Indent: " & Integer'Image (Data.Begin_Indent));
for I in Data.Indents.First_Index .. Data.Indents.Last_Index loop
Ada.Text_IO.Put_Line (";; " & Line_Number_Type'Image (I) & ", " & Image (Data.Indents (I)));
end loop;
Ada.Text_IO.Put_Line (";; resolve anchors");
end if;
for I in Data.Indents.First_Index .. Data.Indents.Last_Index loop
declare
Indent : constant Indent_Type := Data.Indents (I);
begin
case Indent.Label is
when Not_Set =>
-- Indent not computed, therefore not output.
null;
when Int =>
Data.Indents.Replace_Element (I, (Int, Indent.Int_Indent + Begin_Indent));
when Anchor_Nil =>
for I of Indent.Anchor_Nil_IDs loop
Anchor_Indent (I) := Begin_Indent;
end loop;
Data.Indents.Replace_Element (I, (Int, Begin_Indent));
when Anchor_Int =>
for I of Indent.Anchor_Int_IDs loop
Anchor_Indent (I) := Indent.Anchor_Int_Indent + Begin_Indent;
end loop;
Data.Indents.Replace_Element (I, (Int, Indent.Anchor_Int_Indent + Begin_Indent));
when Anchored =>
Data.Indents.Replace_Element
(I, (Int, Anchor_Indent (Indent.Anchored_ID) + Indent.Anchored_Delta));
when Anchor_Anchored =>
declare
Temp : constant Integer :=
Anchor_Indent (Indent.Anchor_Anchored_ID) + Indent.Anchor_Anchored_Delta;
begin
for I of Indent.Anchor_Anchored_IDs loop
Anchor_Indent (I) := Temp;
end loop;
Data.Indents.Replace_Element (I, (Int, Temp));
end;
end case;
end;
end loop;
end Resolve_Anchors;
procedure Set_End
(Data : in out Parse_Data_Type;
Containing_Pos : in Buffer_Pos;
End_Pos : in Buffer_Pos)
is
use Navigate_Cursor_Lists;
I : Cursor := Data.End_Positions.First;
Delete_Cache : Boolean;
Temp : Cursor;
begin
loop
exit when not Has_Element (I);
declare
Cache : Navigate_Cache_Type renames Data.Navigate_Caches (Element (I));
begin
if Cache.Pos in Containing_Pos .. End_Pos then
Cache.End_Pos := (True, End_Pos);
Delete_Cache := True;
else
Delete_Cache := False;
end if;
end;
if Delete_Cache then
Temp := Next (I);
Delete (Data.End_Positions, I);
I := Temp;
else
Next (I);
end if;
end loop;
end Set_End;
----------
-- public subprograms (declaration order)
procedure Initialize
(Data : in out Parse_Data_Type;
Lexer : in WisiToken.Lexer.Handle;
Descriptor : access constant WisiToken.Descriptor;
Base_Terminals : in Base_Token_Array_Access;
Post_Parse_Action : in Post_Parse_Action_Type;
Begin_Line : in Line_Number_Type;
End_Line : in Line_Number_Type;
Begin_Indent : in Integer;
Params : in String)
is
pragma Unreferenced (Params);
begin
Data.Line_Begin_Pos.Set_First_Last
(First => Begin_Line,
Last => End_Line);
-- + 1 for data on line following last line; see Lexer_To_Augmented.
Data.Line_Paren_State.Set_First_Last
(First => Begin_Line,
Last => End_Line + 1);
Data.Lexer := Lexer;
Data.Descriptor := Descriptor;
Data.Base_Terminals := Base_Terminals;
Data.Post_Parse_Action := Post_Parse_Action;
case Post_Parse_Action is
when Navigate | Face =>
null;
when Indent =>
Data.Indents.Set_First_Last
(First => Begin_Line,
Last => End_Line);
Data.Begin_Indent := Begin_Indent;
end case;
Data.Reset;
exception
when E : others =>
raise SAL.Programmer_Error with "wisi.initialize: " & Ada.Exceptions.Exception_Name (E) & ": " &
Ada.Exceptions.Exception_Message (E);
end Initialize;
overriding procedure Reset (Data : in out Parse_Data_Type)
is begin
Data.Terminals.Clear;
Data.Leading_Non_Grammar.Clear;
-- Data.Line_Begin_Pos set in Initialize, overwritten in Lexer_To_Augmented
-- Data.Line_Begin_Token set in WisiToken.Parse.Next_Grammar_Token.
for S of Data.Line_Paren_State loop
S := 0;
end loop;
Data.Current_Paren_State := 0;
Data.Navigate_Caches.Finalize;
Data.Navigate_Caches.Initialize;
Data.End_Positions.Clear;
Data.Name_Caches.Finalize;
Data.Name_Caches.Initialize;
Data.Face_Caches.Finalize;
Data.Face_Caches.Initialize;
for I in Data.Indents.First_Index .. Data.Indents.Last_Index loop
Data.Indents.Replace_Element (I, (Label => Not_Set));
end loop;
Data.Max_Anchor_ID := First_Anchor_ID - 1;
end Reset;
function Source_File_Name (Data : in Parse_Data_Type) return String
is begin
return Data.Lexer.File_Name;
end Source_File_Name;
function Post_Parse_Action (Data : in Parse_Data_Type) return Post_Parse_Action_Type
is begin
return Data.Post_Parse_Action;
end Post_Parse_Action;
overriding
procedure Lexer_To_Augmented
(Data : in out Parse_Data_Type;
Token : in Base_Token;
Lexer : not null access WisiToken.Lexer.Instance'Class)
is
use all type Ada.Containers.Count_Type;
begin
if Lexer.First then
Data.Line_Begin_Pos (Token.Line) := Token.Char_Region.First;
if Token.Line > Data.Line_Begin_Pos.First_Index and then
Data.Line_Begin_Pos (Token.Line - 1) = Invalid_Buffer_Pos
then
-- Previous token contains multiple lines; ie %code in wisitoken_grammar.wy
declare
First_Set_Line : Line_Number_Type;
begin
for Line in reverse Data.Line_Begin_Pos.First_Index .. Token.Line - 1 loop
if Data.Line_Begin_Pos (Line) /= Invalid_Buffer_Pos then
First_Set_Line := Line;
exit;
end if;
end loop;
for Line in First_Set_Line + 1 .. Token.Line - 1 loop
Data.Line_Begin_Pos (Line) := Data.Line_Begin_Pos (First_Set_Line); -- good enough
end loop;
end;
end if;
end if;
if Token.ID < Data.Descriptor.First_Terminal then
-- Non-grammar token
if Token.ID = Data.Descriptor.New_Line_ID then
Data.Line_Paren_State (Token.Line + 1) := Data.Current_Paren_State;
end if;
if Data.Terminals.Length = 0 then
Data.Leading_Non_Grammar.Append ((Token with Lexer.First));
else
declare
Containing_Token : Augmented_Token renames Data.Terminals (Data.Terminals.Last_Index);
Trailing_Blank : constant Boolean :=
Token.ID = Data.Descriptor.New_Line_ID and
(Containing_Token.Non_Grammar.Length > 0 and then
Containing_Token.Non_Grammar
(Containing_Token.Non_Grammar.Last_Index).ID = Data.Descriptor.New_Line_ID);
begin
if Lexer.First and
(Token.ID in Data.First_Comment_ID .. Data.Last_Comment_ID or
Trailing_Blank)
then
if Containing_Token.First_Trailing_Comment_Line = Invalid_Line_Number then
Containing_Token.First_Trailing_Comment_Line := Token.Line;
end if;
Containing_Token.Last_Trailing_Comment_Line := Token.Line;
end if;
Containing_Token.Non_Grammar.Append ((Token with Lexer.First));
end;
end if;
else
-- grammar token
declare
Temp : constant Augmented_Token :=
(Token.ID,
Byte_Region => Token.Byte_Region,
Line => Token.Line,
Column => Token.Column,
Char_Region => Token.Char_Region,
Deleted => False,
First => Lexer.First,
Paren_State => Data.Current_Paren_State,
First_Terminals_Index => Data.Terminals.Last_Index + 1,
Last_Terminals_Index => Data.Terminals.Last_Index + 1,
First_Indent_Line => (if Lexer.First then Token.Line else Invalid_Line_Number),
Last_Indent_Line => (if Lexer.First then Token.Line else Invalid_Line_Number),
First_Trailing_Comment_Line => Invalid_Line_Number, -- Set by Reduce
Last_Trailing_Comment_Line => Invalid_Line_Number,
Non_Grammar => <>);
begin
if Token.ID = Data.Left_Paren_ID then
Data.Current_Paren_State := Data.Current_Paren_State + 1;
elsif Token.ID = Data.Right_Paren_ID then
Data.Current_Paren_State := Data.Current_Paren_State - 1;
end if;
Data.Terminals.Append (Temp);
end;
end if;
end Lexer_To_Augmented;
overriding
procedure Delete_Token
(Data : in out Parse_Data_Type;
Deleted_Token_Index : in WisiToken.Token_Index)
is
use all type Ada.Containers.Count_Type;
Deleted_Token : Augmented_Token renames Data.Terminals (Deleted_Token_Index);
Prev_Token_Index : Base_Token_Index := Deleted_Token_Index - 1;
Next_Token_Index : Base_Token_Index := Deleted_Token_Index + 1;
begin
if Deleted_Token.Deleted then
-- This can happen if error recovery screws up.
if WisiToken.Trace_Action > WisiToken.Detail then
Ada.Text_IO.Put_Line (";; delete token again; ignored " & Image (Deleted_Token, Data.Descriptor.all));
end if;
return;
end if;
if WisiToken.Trace_Action > WisiToken.Detail then
Ada.Text_IO.Put_Line (";; delete token " & Image (Deleted_Token, Data.Descriptor.all));
end if;
Deleted_Token.Deleted := True;
if Deleted_Token.Non_Grammar.Length > 0 then
-- Move Non_Grammar to previous non-deleted token
loop
exit when Prev_Token_Index = Base_Token_Index'First;
exit when Data.Terminals (Prev_Token_Index).Deleted = False;
Prev_Token_Index := Prev_Token_Index - 1;
end loop;
if Prev_Token_Index = Base_Token_Index'First then
Deleted_Token.Non_Grammar (Deleted_Token.Non_Grammar.First_Index).First := Deleted_Token.First;
Data.Leading_Non_Grammar.Append (Deleted_Token.Non_Grammar);
else
declare
Prev_Token : Augmented_Token renames Data.Terminals (Prev_Token_Index);
begin
Prev_Token.Non_Grammar.Append (Deleted_Token.Non_Grammar);
if Deleted_Token.First_Trailing_Comment_Line /= Invalid_Line_Number then
if Prev_Token.First_Trailing_Comment_Line = Invalid_Line_Number then
Prev_Token.First_Trailing_Comment_Line := Deleted_Token.First_Trailing_Comment_Line;
end if;
Prev_Token.Last_Trailing_Comment_Line := Deleted_Token.Last_Trailing_Comment_Line;
end if;
end;
end if;
end if;
-- Data.Terminals.Last_Index is Wisi_EOI; it is never deleted
loop
exit when Data.Terminals (Next_Token_Index).Deleted = False;
Next_Token_Index := Next_Token_Index + 1;
exit when Next_Token_Index = Data.Terminals.Last_Index;
end loop;
if Deleted_Token.First and
(Next_Token_Index = Data.Terminals.Last_Index or else
Data.Terminals (Next_Token_Index).Line > Deleted_Token.Line)
then
-- Deleted_Token.Line is now blank; add to previous token non
-- grammar.
if Prev_Token_Index > Base_Token_Index'First then
declare
Prev_Token : Augmented_Token renames Data.Terminals (Prev_Token_Index);
begin
if Prev_Token.First_Trailing_Comment_Line = Invalid_Line_Number then
Prev_Token.First_Trailing_Comment_Line := Deleted_Token.Line;
Prev_Token.Last_Trailing_Comment_Line := Deleted_Token.Line;
else
if Prev_Token.First_Trailing_Comment_Line > Deleted_Token.Line then
Prev_Token.First_Trailing_Comment_Line := Deleted_Token.Line;
end if;
if Prev_Token.Last_Trailing_Comment_Line < Deleted_Token.Line then
Prev_Token.Last_Trailing_Comment_Line := Deleted_Token.Line;
end if;
end if;
end;
end if;
end if;
if Deleted_Token.First and Next_Token_Index < Data.Terminals.Last_Index then
if not Data.Terminals (Next_Token_Index).First then
declare
Next_Token : Augmented_Token renames Data.Terminals (Next_Token_Index);
begin
Next_Token.First := True;
Next_Token.First_Indent_Line := Deleted_Token.First_Indent_Line;
Next_Token.Last_Indent_Line := Deleted_Token.Last_Indent_Line;
end;
end if;
end if;
end Delete_Token;
overriding
procedure Reduce
(Data : in out Parse_Data_Type;
Tree : in out Syntax_Trees.Tree'Class;
Nonterm : in Syntax_Trees.Valid_Node_Index;
Tokens : in Syntax_Trees.Valid_Node_Index_Array)
is
Aug_Nonterm : constant Augmented_Token_Access := new Augmented_Token'
(ID => Tree.ID (Nonterm),
Byte_Region => Tree.Byte_Region (Nonterm),
others => <>);
Trailing_Comment_Done : Boolean := False;
begin
Tree.Set_Augmented (Nonterm, Base_Token_Class_Access (Aug_Nonterm));
for I in reverse Tokens'Range loop
-- 'reverse' to find token containing trailing comments; last
-- non-virtual and non-empty token.
if Tree.Byte_Region (Tokens (I)) /= Null_Buffer_Region then
-- Token not entirely virtual
declare
Aug_Token : constant Aug_Token_Ref := Get_Aug_Token (Data, Tree, Tokens (I));
begin
if Data.Post_Parse_Action = Indent then
if Aug_Token.First_Terminals_Index /= Augmented_Token_Arrays.No_Index then
Aug_Nonterm.First_Terminals_Index := Aug_Token.First_Terminals_Index;
end if;
if Aug_Nonterm.Last_Terminals_Index = Augmented_Token_Arrays.No_Index then
Aug_Nonterm.Last_Terminals_Index := Aug_Token.Last_Terminals_Index;
end if;
Aug_Nonterm.First := Aug_Nonterm.First or Aug_Token.First;
if Aug_Token.First_Indent_Line /= Invalid_Line_Number then
Aug_Nonterm.First_Indent_Line := Aug_Token.First_Indent_Line;
elsif Trailing_Comment_Done and Aug_Token.First_Trailing_Comment_Line /= Invalid_Line_Number then
Aug_Nonterm.First_Indent_Line := Aug_Token.First_Trailing_Comment_Line;
end if;
if Aug_Nonterm.Last_Indent_Line = Invalid_Line_Number then
if Trailing_Comment_Done and Aug_Token.Last_Trailing_Comment_Line /= Invalid_Line_Number then
Aug_Nonterm.Last_Indent_Line := Aug_Token.Last_Trailing_Comment_Line;
elsif Aug_Token.Last_Indent_Line /= Invalid_Line_Number then
Aug_Nonterm.Last_Indent_Line := Aug_Token.Last_Indent_Line;
end if;
end if;
if not Trailing_Comment_Done then
Aug_Nonterm.First_Trailing_Comment_Line := Aug_Token.First_Trailing_Comment_Line;
Aug_Nonterm.Last_Trailing_Comment_Line := Aug_Token.Last_Trailing_Comment_Line;
Trailing_Comment_Done := True;
end if;
end if; -- Compute_Indent
if Aug_Token.Line /= Invalid_Line_Number then
Aug_Nonterm.Line := Aug_Token.Line;
Aug_Nonterm.Column := Aug_Token.Column;
end if;
if Aug_Nonterm.Char_Region.First > Aug_Token.Char_Region.First then
Aug_Nonterm.Char_Region.First := Aug_Token.Char_Region.First;
end if;
if Aug_Nonterm.Char_Region.Last < Aug_Token.Char_Region.Last then
Aug_Nonterm.Char_Region.Last := Aug_Token.Char_Region.Last;
end if;
Aug_Nonterm.Paren_State := Aug_Token.Paren_State;
end;
end if; -- Aug_Token not virtual
end loop;
end Reduce;
procedure Statement_Action
(Data : in out Parse_Data_Type;
Tree : in Syntax_Trees.Tree;
Nonterm : in Syntax_Trees.Valid_Node_Index;
Tokens : in Syntax_Trees.Valid_Node_Index_Array;
Params : in Statement_Param_Array)
is
Nonterm_Tok : constant Aug_Token_Ref := Get_Aug_Token (Data, Tree, Nonterm);
First_Item : Boolean := True;
Start_Set : Boolean := False;
Override_Start_Set : Boolean := False;
Containing_Pos : Nil_Buffer_Pos := Nil;
begin
for Pair of Params loop
if not (Pair.Index in Tokens'Range) then
raise Fatal_Error with Error_Message
(File_Name => Data.Lexer.File_Name,
Line => Nonterm_Tok.Line,
Column => Nonterm_Tok.Column,
Message => "wisi-statement-action: " & Trimmed_Image (Tree.Production_ID (Nonterm)) &
" token index" & SAL.Peek_Type'Image (Pair.Index) &
" not in tokens range (" & SAL.Peek_Type'Image (Tokens'First) & " .." &
SAL.Peek_Type'Image (Tokens'Last) & "); bad grammar action.");
elsif Tree.Byte_Region (Tokens (Pair.Index)) /= Null_Buffer_Region then
declare
use all type WisiToken.Syntax_Trees.Node_Label;
Token : constant Aug_Token_Ref :=
(if Pair.Class = Statement_End and then
Tree.Label (Tokens (Pair.Index)) = WisiToken.Syntax_Trees.Nonterm
then To_Aug_Token_Ref (Data.Terminals (Tree.Max_Terminal_Index (Tokens (Pair.Index))))
else Get_Aug_Token (Data, Tree, Tokens (Pair.Index)));
Cache_Pos : constant Buffer_Pos := Token.Char_Region.First;
Cursor : Navigate_Cache_Trees.Cursor := Navigate_Cache_Trees.Find
(Data.Navigate_Caches.Iterate, Cache_Pos,
Direction => Navigate_Cache_Trees.Unknown);
begin
if Navigate_Cache_Trees.Has_Element (Cursor) then
declare
Cache : Navigate_Cache_Type renames Data.Navigate_Caches (Cursor);
begin
if Pair.Class = Statement_Start then
if Start_Set then
Cache.Class := Motion;
else
Cache.Class := Statement_Start;
Start_Set := True;
end if;
elsif Override_Start_Set then
Cache.Class := Statement_Start;
Start_Set := True;
else
Cache.Class := Pair.Class;
end if;
Cache.Statement_ID := Tree.ID (Nonterm);
Cache.Containing_Pos := Containing_Pos;
end;
else
Cursor := Data.Navigate_Caches.Insert
((Pos => Cache_Pos,
Statement_ID => Tree.ID (Nonterm),
ID => Token.ID,
Length => Length (Token.Char_Region),
Class => (if Override_Start_Set then Statement_Start else Pair.Class),
Containing_Pos => Containing_Pos,
others => Nil));
end if;
Data.End_Positions.Append (Cursor);
if First_Item then
First_Item := False;
if Override_Start_Set or Pair.Class = Statement_Start then
Override_Start_Set := False;
Containing_Pos := (True, Token.Char_Region.First);
-- Set containing on all contained caches
declare
use Navigate_Cache_Trees;
Iterator : constant Navigate_Cache_Trees.Iterator := Data.Navigate_Caches.Iterate;
Cursor : Navigate_Cache_Trees.Cursor := Find_In_Range
(Iterator, Ascending, Nonterm_Tok.Char_Region.First + 1, -- don't set containing on start
Nonterm_Tok.Char_Region.Last);
begin
loop
exit when not Has_Element (Cursor);
declare
Cache : Navigate_Cache_Type renames Data.Navigate_Caches (Cursor);
begin
if not Cache.Containing_Pos.Set then
Cache.Containing_Pos := Containing_Pos;
end if;
exit when Nonterm_Tok.Char_Region.Last < Cache.Pos + 1;
end;
Cursor := Iterator.Next (Cursor);
end loop;
end;
end if;
end if;
if Pair.Class = Statement_End and Containing_Pos.Set then
Set_End (Data, Containing_Pos.Item, Cache_Pos);
end if;
end;
else
-- Token.Byte_Region is null
if First_Item and Pair.Class = Statement_Start then
Override_Start_Set := True;
end if;
end if;
end loop;
end Statement_Action;
procedure Name_Action
(Data : in out Parse_Data_Type;
Tree : in WisiToken.Syntax_Trees.Tree;
Nonterm : in Syntax_Trees.Valid_Node_Index;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array;
Name : in WisiToken.Positive_Index_Type)
is
use all type WisiToken.Syntax_Trees.Node_Label;
begin
if not (Name in Tokens'Range) then
declare
Token : constant Aug_Token_Ref := Get_Aug_Token (Data, Tree, Tokens (Tokens'First));
begin
raise Fatal_Error with Error_Message
(File_Name => Data.Lexer.File_Name,
Line => Token.Line,
Column => Token.Column,
Message => "wisi-name-action: " & Trimmed_Image (Tree.Production_ID (Nonterm)) & " name (" &
Trimmed_Image (Name) & ") not in Tokens range (" & SAL.Peek_Type'Image (Tokens'First) & " .." &
SAL.Peek_Type'Image (Tokens'Last) & "); bad grammar action.");
end;
end if;
if Tree.Label (Tokens (Name)) = Syntax_Trees.Virtual_Terminal then
return;
end if;
declare
use Name_Cache_Trees;
Name_Token : constant Aug_Token_Ref := Get_Aug_Token (Data, Tree, Tokens (Name));
Cursor : constant Name_Cache_Trees.Cursor := Find
(Data.Name_Caches.Iterate, Name_Token.Char_Region.First,
Direction => Name_Cache_Trees.Unknown);
begin
if Name_Token.Char_Region = Null_Buffer_Region then
return;
elsif Has_Element (Cursor) then
raise Fatal_Error with Error_Message
(File_Name => Data.Lexer.File_Name,
Line => Name_Token.Line,
Column => Name_Token.Column,
Message => Trimmed_Image (Tree.Production_ID (Nonterm)) & ": wisi-name-action: name set twice.");
else
Data.Name_Caches.Insert (Name_Token.Char_Region);
end if;
end;
end Name_Action;
procedure Motion_Action
(Data : in out Parse_Data_Type;
Tree : in Syntax_Trees.Tree;
Nonterm : in Syntax_Trees.Valid_Node_Index;
Tokens : in Syntax_Trees.Valid_Node_Index_Array;
Params : in Motion_Param_Array)
is
use Navigate_Cache_Trees;
Start : Nil_Buffer_Pos := (Set => False);
Iter : constant Iterator := Data.Navigate_Caches.Iterate;
Prev_Cache_Cur : Cursor;
Cache_Cur : Cursor;
begin
if WisiToken.Trace_Action > Outline then
Ada.Text_IO.Put_Line
("Motion_Action " & Image (Tree.ID (Nonterm), Data.Descriptor.all) & " " &
Image (Tree.Byte_Region (Nonterm)));
end if;
for Param of Params loop
if Tree.Byte_Region (Tokens (Param.Index)) /= Null_Buffer_Region then
declare
use all type WisiToken.Syntax_Trees.Node_Label;
Token : constant Aug_Token_Ref := Get_Aug_Token (Data, Tree, Tokens (Param.Index));
Region : constant Buffer_Region := Token.Char_Region;
Skip : Boolean := False;
begin
if not Start.Set then
Start := (True, Region.First);
end if;
case Tree.Label (Tokens (Param.Index)) is
when Shared_Terminal =>
Cache_Cur := Find (Iter, Region.First);
when Virtual_Terminal | Virtual_Identifier =>
return;
when Syntax_Trees.Nonterm =>
if Param.ID = Invalid_Token_ID then
Cache_Cur := Find (Iter, Region.First);
else
Skip := True;
Cache_Cur := Find_In_Range (Iter, Ascending, Region.First, Region.Last);
loop
exit when not Has_Element (Cache_Cur);
if Data.Navigate_Caches (Cache_Cur).Pos > Region.Last then
Cache_Cur := No_Element;
exit;
elsif Data.Navigate_Caches (Cache_Cur).ID = Param.ID and
not Data.Navigate_Caches (Cache_Cur).Prev_Pos.Set
then
Skip := False;
exit;
end if;
Cache_Cur := Next (Iter, Cache_Cur);
end loop;
end if;
end case;
if not Skip then
if not Has_Element (Cache_Cur) then
raise Fatal_Error with Error_Message
(File_Name => Data.Lexer.File_Name,
Line => Token.Line,
Column => Token.Column,
Message => "wisi-motion-action: token " &
WisiToken.Image (Token.ID, Data.Descriptor.all) &
" has no cache; add to statement-action for " &
Trimmed_Image (Tree.Production_ID (Nonterm)) & ".");
end if;
if Has_Element (Prev_Cache_Cur) then
declare
Cache : Navigate_Cache_Type renames Data.Navigate_Caches (Cache_Cur);
Prev_Cache : Navigate_Cache_Type renames Data.Navigate_Caches (Prev_Cache_Cur);
begin
if not Cache.Prev_Pos.Set then
Cache.Prev_Pos := (True, Prev_Cache.Pos);
if WisiToken.Trace_Action > Detail then
Ada.Text_IO.Put_Line (" " & Cache.Pos'Image & " prev to " & Cache.Prev_Pos.Item'Image);
end if;
end if;
if not Prev_Cache.Next_Pos.Set then
Prev_Cache.Next_Pos := (True, Cache.Pos);
if WisiToken.Trace_Action > Detail then
Ada.Text_IO.Put_Line
(" " & Prev_Cache.Pos'Image & " next to " & Prev_Cache.Next_Pos.Item'Image);
end if;
end if;
end;
end if;
loop
-- Set Prev_Cache_Cur to last motion cache in nonterm chain
exit when not Data.Navigate_Caches (Cache_Cur).Next_Pos.Set;
Cache_Cur := Find (Iter, Data.Navigate_Caches (Cache_Cur).Next_Pos.Item);
pragma Assert (Has_Element (Cache_Cur)); -- otherwise there's a bug in this subprogram.
end loop;
Prev_Cache_Cur := Cache_Cur;
end if;
end;
end if;
end loop;
end Motion_Action;
procedure Face_Apply_Action
(Data : in out Parse_Data_Type;
Tree : in Syntax_Trees.Tree;
Nonterm : in Syntax_Trees.Valid_Node_Index;
Tokens : in Syntax_Trees.Valid_Node_Index_Array;
Params : in Face_Apply_Param_Array)
is
pragma Unreferenced (Nonterm);
use Face_Cache_Trees;
Iter : constant Iterator := Data.Face_Caches.Iterate;
Cache_Cur : Cursor;
Suffix_Cur : Cursor;
begin
for Param of Params loop
if Tree.Byte_Region (Tokens (Param.Index)) /= Null_Buffer_Region then
declare
Token : constant Aug_Token_Ref := Get_Aug_Token (Data, Tree, Tokens (Param.Index));
begin
Cache_Cur := Find (Iter, Token.Char_Region.First, Direction => Ascending);
if Has_Element (Cache_Cur) then
declare
Cache : Face_Cache_Type renames Data.Face_Caches (Cache_Cur);
begin
case Cache.Class is
when Prefix =>
Cache.Face := (True, Param.Prefix_Face);
-- Check for suffix
Suffix_Cur := Next (Iter, Cache_Cur);
if Has_Element (Suffix_Cur) then
declare
Suf_Cache : Face_Cache_Type renames Data.Face_Caches (Suffix_Cur);
begin
if Suffix = Suf_Cache.Class and
Inside (Suf_Cache.Char_Region.First, Token.Char_Region)
then
Suf_Cache.Face := (True, Param.Suffix_Face);
end if;
end;
end if;
when Suffix =>
Cache.Face := (True, Param.Suffix_Face);
end case;
end;
else
Data.Face_Caches.Insert ((Token.Char_Region, Suffix, (True, Param.Suffix_Face)));
end if;
end;
end if;
end loop;
end Face_Apply_Action;
procedure Face_Apply_List_Action
(Data : in out Parse_Data_Type;
Tree : in Syntax_Trees.Tree;
Nonterm : in Syntax_Trees.Valid_Node_Index;
Tokens : in Syntax_Trees.Valid_Node_Index_Array;
Params : in Face_Apply_Param_Array)
is
pragma Unreferenced (Nonterm);
use Face_Cache_Trees;
Iter : constant Iterator := Data.Face_Caches.Iterate;
Cache_Cur : Cursor;
begin
for Param of Params loop
if Tree.Byte_Region (Tokens (Param.Index)) /= Null_Buffer_Region then
declare
Token : constant Aug_Token_Ref := Get_Aug_Token (Data, Tree, Tokens (Param.Index));
begin
Cache_Cur := Find_In_Range (Iter, Ascending, Token.Char_Region.First, Token.Char_Region.Last);
loop
exit when not Has_Element (Cache_Cur) or else
Data.Face_Caches (Cache_Cur).Char_Region.First > Token.Char_Region.Last;
declare
Cache : Face_Cache_Type renames Data.Face_Caches (Cache_Cur);
begin
case Cache.Class is
when Prefix =>
Cache.Face := (True, Param.Prefix_Face);
when Suffix =>
Cache.Face := (True, Param.Suffix_Face);
end case;
end;
Cache_Cur := Next (Iter, Cache_Cur);
end loop;
end;
end if;
end loop;
end Face_Apply_List_Action;
procedure Face_Mark_Action
(Data : in out Parse_Data_Type;
Tree : in Syntax_Trees.Tree;
Nonterm : in Syntax_Trees.Valid_Node_Index;
Tokens : in Syntax_Trees.Valid_Node_Index_Array;
Params : in Face_Mark_Param_Array)
is
pragma Unreferenced (Nonterm);
use Face_Cache_Trees;
Iter : constant Iterator := Data.Face_Caches.Iterate;
Cache_Cur : Cursor;
begin
for Param of Params loop
if Tree.Byte_Region (Tokens (Param.Index)) /= Null_Buffer_Region then
declare
Token : constant Aug_Token_Ref := Get_Aug_Token (Data, Tree, Tokens (Param.Index));
begin
Cache_Cur := Find (Iter, Token.Char_Region.First, Direction => Ascending);
if Has_Element (Cache_Cur) then
declare
Cache : Face_Cache_Type renames Data.Face_Caches (Cache_Cur);
Other_Cur : Cursor := Find_In_Range
(Iter, Ascending, Cache.Char_Region.Last + 1, Token.Char_Region.Last);
Temp : Cursor;
begin
loop
exit when not Has_Element (Other_Cur) or else
Data.Face_Caches (Other_Cur).Char_Region.First > Token.Char_Region.Last;
Temp := Other_Cur;
Other_Cur := Next (Iter, Other_Cur);
Delete (Data.Face_Caches, Temp);
end loop;
Cache.Class := Param.Class;
Cache.Char_Region.Last := Token.Char_Region.Last;
end;
else
Data.Face_Caches.Insert ((Token.Char_Region, Param.Class, (Set => False)));
end if;
end;
end if;
end loop;
end Face_Mark_Action;
procedure Face_Remove_Action
(Data : in out Parse_Data_Type;
Tree : in Syntax_Trees.Tree;
Nonterm : in Syntax_Trees.Valid_Node_Index;
Tokens : in Syntax_Trees.Valid_Node_Index_Array;
Params : in Face_Remove_Param_Array)
is
pragma Unreferenced (Nonterm);
use Face_Cache_Trees;
Iter : constant Iterator := Data.Face_Caches.Iterate;
Cache_Cur : Cursor;
Temp : Cursor;
begin
for I of Params loop
if Tree.Byte_Region (Tokens (I)) /= Null_Buffer_Region then
declare
Token : constant Aug_Token_Ref := Get_Aug_Token (Data, Tree, Tokens (I));
begin
Cache_Cur := Find_In_Range (Iter, Ascending, Token.Char_Region.First, Token.Char_Region.Last);
loop
exit when not Has_Element (Cache_Cur) or else
Data.Face_Caches (Cache_Cur).Char_Region.First > Token.Char_Region.Last;
Temp := Cache_Cur;
Cache_Cur := Next (Iter, Cache_Cur);
Delete (Data.Face_Caches, Temp);
end loop;
end;
end if;
end loop;
end Face_Remove_Action;
function "+" (Item : in Integer) return Indent_Arg_Arrays.Vector
is begin
return Result : Indent_Arg_Arrays.Vector do
Result.Append (Item);
end return;
end "+";
function "&" (List : in Indent_Arg_Arrays.Vector; Item : in Integer) return Indent_Arg_Arrays.Vector
is begin
return Result : Indent_Arg_Arrays.Vector := List do
Result.Append (Item);
end return;
end "&";
function "&" (Left, Right : in Integer) return Indent_Arg_Arrays.Vector
is begin
return Result : Indent_Arg_Arrays.Vector do
Result.Append (Left);
Result.Append (Right);
end return;
end "&";
function Image (Item : in Simple_Indent_Param) return String
is begin
return "(" & Simple_Indent_Param_Label'Image (Item.Label) &
(case Item.Label is
when None => "",
when Int => Integer'Image (Item.Int_Delta),
when Anchored_Label => Positive_Index_Type'Image (Item.Anchored_Index) & "," &
Integer'Image (Item.Anchored_Delta),
when Language => "<language_function>") & ")";
end Image;
function Image (Item : in Indent_Param) return String
is begin
return "(" & Indent_Param_Label'Image (Item.Label) & ", " &
(case Item.Label is
when Simple => Image (Item.Param),
when Hanging_Label =>
Image (Item.Hanging_Delta_1) & ", " & Image (Item.Hanging_Delta_2) & ")");
end Image;
function Image (Item : in Indent_Pair) return String
is begin
return "(" & Image (Item.Code_Delta) &
(if Item.Comment_Present
then ", " & Image (Item.Comment_Delta)
else "") & ")";
end Image;
procedure Indent_Action_0
(Data : in out Parse_Data_Type'Class;
Tree : in Syntax_Trees.Tree;
Nonterm : in Syntax_Trees.Valid_Node_Index;
Tokens : in Syntax_Trees.Valid_Node_Index_Array;
Params : in Indent_Param_Array)
is begin
if Trace_Action > Outline then
Ada.Text_IO.Put_Line (";; indent_action_0: " & Tree.Image (Nonterm, Data.Descriptor.all));
end if;
for I in Tokens'Range loop
if Tree.Byte_Region (Tokens (I)) /= Null_Buffer_Region and
I in Params'Range -- in some translated EBNF, not every token has an indent param
then
declare
use all type WisiToken.Syntax_Trees.Node_Index;
use all type SAL.Base_Peek_Type;
Tree_Token : constant Syntax_Trees.Valid_Node_Index := Tokens (I);
Token : constant Aug_Token_Ref := Get_Aug_Token (Data, Tree, Tree_Token);
Pair : Indent_Pair renames Params (I);
Code_Delta : Delta_Type;
Comment_Param : Indent_Param;
Comment_Param_Set : Boolean := False;
Comment_Delta : Delta_Type;
begin
if Trace_Action > Detail then
Ada.Text_IO.Put_Line
(";; indent_action_0 a: " & Tree.Image (Tree_Token, Data.Descriptor.all) & ": " & Image (Pair));
end if;
if Token.First_Indent_Line /= Invalid_Line_Number then
Code_Delta := Indent_Compute_Delta
(Data, Tree, Tokens, Pair.Code_Delta, Tree_Token, Indenting_Comment => False);
Indent_Token_1 (Data, Token, Code_Delta, Indenting_Comment => False);
end if;
if Token.First_Trailing_Comment_Line /= Invalid_Line_Number then
if Pair.Comment_Present then
Comment_Param := Pair.Comment_Delta;
Comment_Param_Set := True;
elsif I < Tokens'Last then
Comment_Param := Params (I + 1).Code_Delta;
Comment_Param_Set := True;
end if;
if Comment_Param_Set then
Comment_Delta := Indent_Compute_Delta
(Data, Tree, Tokens, Comment_Param, Tree_Token, Indenting_Comment => True);
Indent_Token_1 (Data, Token, Comment_Delta, Indenting_Comment => True);
end if;
end if;
end;
end if;
end loop;
end Indent_Action_0;
procedure Indent_Action_1
(Data : in out Parse_Data_Type'Class;
Tree : in Syntax_Trees.Tree;
Nonterm : in Syntax_Trees.Valid_Node_Index;
Tokens : in Syntax_Trees.Valid_Node_Index_Array;
N : in Positive_Index_Type;
Params : in Indent_Param_Array)
is
use all type Syntax_Trees.Node_Label;
begin
for I in Tokens'First .. N loop
if Tree.Label (Tokens (I)) /= Virtual_Terminal and then
Get_Aug_Token (Data, Tree, Tokens (I)).First
then
Indent_Action_0 (Data, Tree, Nonterm, Tokens, Params);
return;
end if;
end loop;
end Indent_Action_1;
function Indent_Hanging_1
(Data : in out Parse_Data_Type;
Tree : in Syntax_Trees.Tree;
Tokens : in Syntax_Trees.Valid_Node_Index_Array;
Tree_Indenting : in Syntax_Trees.Valid_Node_Index;
Indenting_Comment : in Boolean;
Delta_1 : in Simple_Indent_Param;
Delta_2 : in Simple_Indent_Param;
Option : in Boolean;
Accumulate : in Boolean)
return Delta_Type
is
Indenting_Token : constant Aug_Token_Ref := Get_Aug_Token (Data, Tree, Tree_Indenting);
begin
if Indenting_Comment then
return Indent_Compute_Delta
(Data, Tree, Tokens, (Simple, Delta_1), Tree_Indenting, Indenting_Comment);
else
return
(Hanging,
Hanging_First_Line => Indenting_Token.Line,
Hanging_Paren_State => Indenting_Token.Paren_State,
Hanging_Delta_1 => Indent_Compute_Delta
(Data, Tree, Tokens, (Simple, Delta_1), Tree_Indenting, Indenting_Comment).Simple_Delta,
Hanging_Delta_2 =>
(if (not Option) or
Indenting_Token.Line = Indenting_Token.First_Indent_Line -- first token in tok is first on line
then Indent_Compute_Delta
(Data, Tree, Tokens, (Simple, Delta_2), Tree_Indenting, Indenting_Comment).Simple_Delta
else Indent_Compute_Delta
(Data, Tree, Tokens, (Simple, Delta_1), Tree_Indenting, Indenting_Comment).Simple_Delta),
Hanging_Accumulate => Accumulate);
end if;
end Indent_Hanging_1;
procedure Put_Language_Action
(Data : in Parse_Data_Type;
Content : in String)
is
pragma Unreferenced (Data);
begin
Ada.Text_IO.Put_Line ("[" & Language_Action_Code & Content & "]");
end Put_Language_Action;
procedure Put (Data : in out Parse_Data_Type; Parser : in Parse.Base_Parser'Class)
is
use all type Ada.Containers.Count_Type;
Last_Term : constant Base_Token_Index := Parser.Tree.Max_Terminal_Index (Parser.Tree.Root);
function Get_Last_Char_Pos return Buffer_Pos
is begin
if Parser.Terminals.Length = 0 then
-- All comments, or empty
if Data.Leading_Non_Grammar.Length > 0 then
return Data.Leading_Non_Grammar (Data.Leading_Non_Grammar.Last_Index).Char_Region.Last;
else
return Buffer_Pos'First;
end if;
else
if Last_Term = Invalid_Token_Index then
-- All grammar tokens inserted by recover
if Data.Leading_Non_Grammar.Length > 0 then
return Data.Leading_Non_Grammar (Data.Leading_Non_Grammar.Last_Index).Char_Region.Last;
else
return Buffer_Pos'First;
end if;
else
if Data.Terminals (Last_Term).Non_Grammar.Length > 0 then
return Data.Terminals (Last_Term).Non_Grammar
(Data.Terminals (Last_Term).Non_Grammar.Last_Index).Char_Region.Last;
else
return Parser.Terminals (Last_Term).Char_Region.Last;
end if;
end if;
end if;
end Get_Last_Char_Pos;
Last_Char_Pos : constant Buffer_Pos := Get_Last_Char_Pos;
function Get_Last_Line return Line_Number_Type
is begin
for I in Data.Line_Begin_Pos.First_Index .. Data.Line_Begin_Pos.Last_Index loop
if Data.Line_Begin_Pos (I) = Invalid_Buffer_Pos then
raise SAL.Programmer_Error with "line_begin_pos" & Line_Number_Type'Image (I) & " invalid";
end if;
if Data.Line_Begin_Pos (I) > Last_Char_Pos then
if I > Line_Number_Type'First then
return I - 1;
else
return I;
end if;
end if;
end loop;
return Data.Line_Begin_Pos.Last_Index;
end Get_Last_Line;
begin
if Trace_Action > Outline then
Ada.Text_IO.Put_Line
(";; last_char_pos:" & Buffer_Pos'Image (Last_Char_Pos + 1) &
" last_line:" & Line_Number_Type'Image (Get_Last_Line));
end if;
-- +1 to match Emacs region
Ada.Text_IO.Put_Line ('[' & End_Code & Buffer_Pos'Image (Last_Char_Pos + 1) & ']');
case Data.Post_Parse_Action is
when Navigate =>
for Cache of Data.Navigate_Caches loop
Put (Cache);
end loop;
for Cache of Data.Name_Caches loop
Put (Cache);
end loop;
when Face =>
for Cache of Data.Face_Caches loop
Put (Cache);
end loop;
when Indent =>
Resolve_Anchors (Data);
if Trace_Action > Outline then
Ada.Text_IO.Put_Line (";; indent leading non_grammar");
end if;
for Token of Data.Leading_Non_Grammar loop
if Token.First then
Put (Token.Line, (Int, Data.Begin_Indent));
end if;
end loop;
-- It may be that not all lines in Data.Indents were parsed.
if Trace_Action > Outline then
Ada.Text_IO.Put_Line (";; indent grammar");
end if;
for I in Data.Indents.First_Index .. Get_Last_Line loop
Put (I, Data.Indents (I));
end loop;
end case;
end Put;
procedure Put (Lexer_Errors : in Lexer.Error_Lists.List)
is begin
for Item of Lexer_Errors loop
Ada.Text_IO.Put_Line
('[' & Lexer_Error_Code & Buffer_Pos'Image (Item.Char_Pos) &
" ""lexer error" &
(if Item.Recover_Char (1) = ASCII.NUL
then """"
elsif Item.Recover_Char (1) = '"'
then """ ?\"""
else """ ?" & Item.Recover_Char (1)) &
"]");
if Item.Recover_Char (2) /= ASCII.NUL then
raise SAL.Programmer_Error with "lexer error with non-ascii or multiple repair char";
end if;
end loop;
end Put;
procedure Put
(Data : in Parse_Data_Type;
Lexer_Errors : in Lexer.Error_Lists.List;
Parse_Errors : in Parse.LR.Parse_Error_Lists.List;
Tree : in Syntax_Trees.Tree)
is
use all type SAL.Base_Peek_Type;
use Ada.Text_IO;
use Semantic_Checks;
function Safe_Pos (Node : in Syntax_Trees.Valid_Node_Index) return Buffer_Pos
is
-- Return a reasonable position for the error at Node.
--
-- In a successful parse with error recovery, Node is a terminal with
-- an augmented token in Data.Terminals, so that is the first
-- choice.
--
-- If this is an error due to a bad recovery, Node may be a virtual
-- token, with no position information, so we try to get information
-- from its parent.
use Syntax_Trees;
N : Node_Index := Node;
begin
loop
if Tree.Label (N) /= Virtual_Terminal then
declare
Ref : constant Aug_Token_Ref := Get_Aug_Token (Data, Tree, N);
begin
if Ref.Char_Region /= Null_Buffer_Region then
return Ref.Element.Char_Region.First;
end if;
end;
end if;
N := Tree.Parent (N);
exit when N = Invalid_Node_Index;
end loop;
return Buffer_Pos'First;
end Safe_Pos;
function Safe_Pos (Token : in Recover_Token) return Buffer_Pos
is begin
if Token.Name /= Null_Buffer_Region then
return Token.Name.First;
elsif Token.Byte_Region = Null_Buffer_Region then
return Buffer_Pos'First;
else
return Token.Byte_Region.First;
end if;
end Safe_Pos;
begin
Put (Lexer_Errors);
for Item of Parse_Errors loop
case Item.Label is
when Parse.LR.Action =>
Put_Line
('[' & Parser_Error_Code & Buffer_Pos'Image (Safe_Pos (Item.Error_Token)) &
" ""syntax error: expecting " & Image (Item.Expecting, Data.Descriptor.all) &
", found '" & Image (Tree.ID (Item.Error_Token), Data.Descriptor.all) & "'""]");
when Parse.LR.Check =>
Put_Line
('[' & Check_Error_Code & Integer'Image
(Semantic_Checks.Check_Status_Label'Pos (Item.Check_Status.Label)) &
(case Item.Check_Status.Label is
when Ok => "",
when Error =>
Buffer_Pos'Image (Safe_Pos (Item.Check_Status.Begin_Name)) &
Buffer_Pos'Image (Safe_Pos (Item.Check_Status.End_Name)) &
" ""block name error""]"));
when Parse.LR.Message =>
Put_Line
('[' & Parser_Error_Code & Buffer_Pos'Image (Buffer_Pos'First) &
" """ & (-Item.Msg) & """]");
end case;
if Item.Recover.Stack.Depth > 0 then
Put (Item.Recover, Data.Terminals, Data.Descriptor.all, Data.Embedded_Quote_Escape_Doubled);
end if;
end loop;
end Put;
procedure Put_Error (Data : in Parse_Data_Type; Line_Number : in Line_Number_Type; Message : in String)
is
use Ada.Text_IO;
begin
Put_Line ("(error """ & Error_Message (Data.Lexer.File_Name, Line_Number, 0, Message) & """)");
end Put_Error;
----------
-- Spec visible private subprograms, alphabetical
function Image (Item : in Simple_Delta_Type) return String
is begin
return "(" & Simple_Delta_Labels'Image (Item.Label) &
(case Item.Label is
when None => "",
when Int => Integer'Image (Item.Int_Delta),
when Anchored => Integer'Image (Item.Anchored_ID) & Integer'Image (Item.Anchored_Delta) & " " &
Boolean'Image (Item.Anchored_Accumulate))
& ")";
end Image;
function Image (Item : in Delta_Type) return String
is begin
return "(" & Delta_Labels'Image (Item.Label) &
(case Item.Label is
when Simple => " " & Image (Item.Simple_Delta),
when Hanging => Line_Number_Type'Image (Item.Hanging_First_Line) & Integer'Image (Item.Hanging_Paren_State) &
" " & Image (Item.Hanging_Delta_1) & " " & Image (Item.Hanging_Delta_2) & " " &
Boolean'Image (Item.Hanging_Accumulate)) & ")";
end Image;
function Current_Indent_Offset
(Data : in Parse_Data_Type;
Anchor_Token : in Augmented_Token'Class;
Offset : in Integer)
return Integer
is begin
return Offset + Integer (Anchor_Token.Char_Region.First - Data.Line_Begin_Pos (Anchor_Token.Line));
end Current_Indent_Offset;
function Find
(Data : in Parse_Data_Type;
ID : in Token_ID;
Token : in Augmented_Token'Class)
return Base_Token_Index
is begin
-- linear search for ID.
for I in Token.First_Terminals_Index .. Token.Last_Terminals_Index loop
if Data.Terminals (I).ID = ID then
return I;
end if;
end loop;
return Augmented_Token_Arrays.No_Index;
end Find;
function First_Line
(Token : in Augmented_Token;
Indenting_Comment : in Boolean)
return Line_Number_Type
is begin
return
(if Indenting_Comment then
(if Token.First_Trailing_Comment_Line = Invalid_Line_Number
then Token.Line
else Token.First_Trailing_Comment_Line)
else
(if Token.First_Indent_Line = Invalid_Line_Number
then Token.Line
else Token.First_Indent_Line));
end First_Line;
function Get_Aug_Token
(Data : in Parse_Data_Type'Class;
Tree : in Syntax_Trees.Tree'Class;
Tree_Index : in Syntax_Trees.Valid_Node_Index)
return Aug_Token_Ref
is
use all type Syntax_Trees.Node_Label;
begin
return
(case Tree.Label (Tree_Index) is
when Shared_Terminal => To_Aug_Token_Ref (Data.Terminals (Tree.Terminal (Tree_Index))),
when Virtual_Terminal => raise SAL.Programmer_Error with "wisi_runtime.get_aug_token virtual terminal",
when Virtual_Identifier => raise SAL.Programmer_Error with "wisi_runtime.get_aug_token virtual identifier",
when Nonterm => To_Aug_Token_Ref (Tree.Augmented (Tree_Index)));
end Get_Aug_Token;
function Get_Text
(Data : in Parse_Data_Type;
Tree : in WisiToken.Syntax_Trees.Tree;
Tree_Index : in WisiToken.Syntax_Trees.Valid_Node_Index)
return String
is
use all type Syntax_Trees.Node_Label;
begin
case Tree.Label (Tree_Index) is
when Shared_Terminal | Nonterm =>
return Data.Lexer.Buffer_Text (Tree.Byte_Region (Tree_Index));
when Virtual_Terminal | Virtual_Identifier =>
raise SAL.Programmer_Error;
end case;
end Get_Text;
function Elisp_Escape_Quotes (Item : in String) return String
is
Result : String (Item'First .. Item'First + Item'Length * 2);
Last : Integer := Item'First - 1;
begin
for I in Item'Range loop
if Item (I) = '"' then
Last := Last + 1;
Result (Last) := '\';
end if;
Last := Last + 1;
Result (Last) := Item (I);
end loop;
return Result (Result'First .. Last);
end Elisp_Escape_Quotes;
overriding
function Image
(Item : in Augmented_Token;
Descriptor : in WisiToken.Descriptor)
return String
is
ID_Image : constant String := Image (Item.ID, Descriptor);
begin
if Item.Line /= Invalid_Line_Number and Trace_Action <= Detail then
return "(" & ID_Image &
Line_Number_Type'Image (Item.Line) & ":" & Trimmed_Image (Integer (Item.Column)) & ")";
elsif Item.Char_Region = Null_Buffer_Region then
return "(" & ID_Image & ")";
else
return "(" & ID_Image & ", " & Image (Item.Char_Region) & ")";
end if;
end Image;
function Indent_Anchored_2
(Data : in out Parse_Data_Type;
Anchor_Line : in Line_Number_Type;
Last_Line : in Line_Number_Type;
Offset : in Integer;
Accumulate : in Boolean)
return Delta_Type
is
-- Return an anchored delta
use Anchor_ID_Vectors;
-- We can't use a Reference here, because the Element in reference
-- types is constrained (as are all allocated objects of access
-- types; AARM 4.8 (6/3)), and we may need to change the Label.
Indent : Indent_Type := Data.Indents (Anchor_Line);
Anchor_ID : constant Integer := 1 + Max_Anchor_ID (Data, Anchor_Line, Last_Line);
begin
Data.Max_Anchor_ID := Integer'Max (Data.Max_Anchor_ID, Anchor_ID);
case Indent.Label is
when Not_Set =>
Indent := (Anchor_Nil, To_Vector (Anchor_ID, 1));
if Trace_Action > Extra then
Ada.Text_IO.Put_Line
(";; indent_anchored: " & Line_Number_Type'Image (Anchor_Line) & " => " & Image (Indent));
end if;
when Int =>
Indent := (Anchor_Int, To_Vector (Anchor_ID, 1), Indent.Int_Indent);
if Trace_Action > Extra then
Ada.Text_IO.Put_Line
(";; indent_anchored: " & Line_Number_Type'Image (Anchor_Line) & " => " & Image (Indent));
end if;
when Anchor_Nil =>
Indent.Anchor_Nil_IDs := Anchor_ID & Indent.Anchor_Nil_IDs;
when Anchor_Int =>
Indent.Anchor_Int_IDs := Anchor_ID & Indent.Anchor_Int_IDs;
when Anchored =>
Indent := (Anchor_Anchored, To_Vector (Anchor_ID, 1), Indent.Anchored_ID, Indent.Anchored_Delta);
when Anchor_Anchored =>
Indent.Anchor_Anchored_IDs := Anchor_ID & Indent.Anchor_Anchored_IDs;
end case;
Data.Indents.Replace_Element (Anchor_Line, Indent);
return (Simple, (Anchored, Anchor_ID, Offset, Accumulate));
end Indent_Anchored_2;
function Indent_Compute_Delta
(Data : in out Parse_Data_Type'Class;
Tree : in Syntax_Trees.Tree;
Tokens : in Syntax_Trees.Valid_Node_Index_Array;
Param : in Indent_Param;
Tree_Indenting : in Syntax_Trees.Valid_Node_Index;
Indenting_Comment : in Boolean)
return Delta_Type
is
Indenting_Token : constant Aug_Token_Ref := Get_Aug_Token (Data, Tree, Tree_Indenting);
begin
-- Evaluate wisi-anchored*, wisi-hanging*.
case Param.Label is
when Simple =>
case Param.Param.Label is
when None =>
return (Simple, (Label => None));
when Int =>
return (Simple, (Int, Param.Param.Int_Delta));
when Anchored_Label =>
if Indenting_Token.Byte_Region = Null_Buffer_Region or
Tree.Byte_Region (Tokens (Param.Param.Anchored_Index)) = Null_Buffer_Region
then
-- One of these is an entirely virtual token
return Null_Delta;
else
declare
Anchor_Token : constant Aug_Token_Ref := Get_Aug_Token
(Data, Tree, Tokens (Param.Param.Anchored_Index));
begin
case Anchored_Label'(Param.Param.Label) is
when Anchored_0 =>
-- [2] wisi-anchored
return Indent_Anchored_2
(Data,
Anchor_Line => Anchor_Token.Line,
Last_Line => Indenting_Token.Last_Line (Indenting_Comment),
Offset => Current_Indent_Offset (Data, Anchor_Token, Param.Param.Anchored_Delta),
Accumulate => True);
when Anchored_1 =>
-- [2] wisi-anchored%
return Indent_Anchored_2
(Data,
Anchor_Line => Anchor_Token.Line,
Last_Line => Indenting_Token.Last_Line (Indenting_Comment),
Offset => Paren_In_Anchor_Line (Data, Anchor_Token, Param.Param.Anchored_Delta),
Accumulate => True);
when Anchored_2 =>
-- [2] wisi-anchored%-
return Indent_Anchored_2
(Data,
Anchor_Line => Anchor_Token.Line,
Last_Line => Indenting_Token.Last_Line (Indenting_Comment),
Offset => Paren_In_Anchor_Line (Data, Anchor_Token, Param.Param.Anchored_Delta),
Accumulate => False);
when Anchored_3 =>
-- [2] wisi-anchored*
if Indenting_Token.First then
return Indent_Anchored_2
(Data,
Anchor_Line => Anchor_Token.Line,
Last_Line => Indenting_Token.Last_Line (Indenting_Comment),
Offset => Current_Indent_Offset (Data, Anchor_Token, Param.Param.Anchored_Delta),
Accumulate => True);
else
return Null_Delta;
end if;
when Anchored_4 =>
-- [2] wisi-anchored*-
return Indent_Anchored_2
(Data,
Anchor_Line => Anchor_Token.Line,
Last_Line => Indenting_Token.Last_Line (Indenting_Comment),
Offset => Current_Indent_Offset (Data, Anchor_Token, Param.Param.Anchored_Delta),
Accumulate => False);
end case;
end;
end if;
when Language =>
return Param.Param.Function_Ptr
(Data, Tree, Tokens, Tree_Indenting, Indenting_Comment, Param.Param.Args);
end case;
when Hanging_Label =>
case Hanging_Label'(Param.Label) is
when Hanging_0 => -- wisi-hanging
return Indent_Hanging_1
(Data, Tree, Tokens, Tree_Indenting, Indenting_Comment, Param.Hanging_Delta_1,
Param.Hanging_Delta_2,
Option => False, Accumulate => True);
when Hanging_1 => -- wisi-hanging-
return Indent_Hanging_1
(Data, Tree, Tokens, Tree_Indenting, Indenting_Comment, Param.Hanging_Delta_1,
Param.Hanging_Delta_2,
Option => False, Accumulate => False);
when Hanging_2 => -- wisi-hanging%
return Indent_Hanging_1
(Data, Tree, Tokens, Tree_Indenting, Indenting_Comment, Param.Hanging_Delta_1,
Param.Hanging_Delta_2,
Option => True, Accumulate => True);
when Hanging_3 => -- wisi-hanging%-
return Indent_Hanging_1
(Data, Tree, Tokens, Tree_Indenting, Indenting_Comment, Param.Hanging_Delta_1,
Param.Hanging_Delta_2,
Option => True, Accumulate => False);
end case;
end case;
end Indent_Compute_Delta;
procedure Indent_Token_1
(Data : in out Parse_Data_Type;
Indenting_Token : in Augmented_Token'Class;
Delta_Indent : in Delta_Type;
Indenting_Comment : in Boolean)
is
-- Aplly Delta_Indent to Indenting_Token
First_Line : constant Line_Number_Type := Indenting_Token.First_Line (Indenting_Comment);
Last_Line : constant Line_Number_Type := Indenting_Token.Last_Line (Indenting_Comment);
begin
if Trace_Action > Detail then
Ada.Text_IO.Put_Line
(";; indent_token_1: " & Indenting_Token.Image (Data.Descriptor.all) & " " & Image (Delta_Indent) &
Line_Number_Type'Image (First_Line) & " .." & Line_Number_Type'Image (Last_Line) &
(if Indenting_Comment then " comment" else ""));
end if;
for Line in First_Line .. Last_Line loop
if Data.Indent_Comment_Col_0 then
declare
use all type Ada.Text_IO.Count;
function Containing_Token return Base_Token_Index
is
-- Return token index of terminal containing non_grammer on Line;
-- Invalid_Token_Index if none.
I : Line_Number_Type := Line;
J : Base_Token_Index;
begin
if Line < Data.Line_Begin_Token.First_Index then
-- Line is before first grammar token; Leading_Non_Grammar checked
-- below.
return Invalid_Token_Index;
end if;
loop
exit when Data.Line_Begin_Token.all (I) /= Augmented_Token_Arrays.No_Index;
-- No_Index means Line is in a multi-line token, which could be a block comment.
I := I - 1;
end loop;
J := Data.Line_Begin_Token.all (I);
if Line in Data.Terminals (J).First_Trailing_Comment_Line ..
Data.Terminals (J).Last_Trailing_Comment_Line
then
return J;
else
return Invalid_Token_Index;
end if;
end Containing_Token;
Indent : Boolean := True;
Containing : constant Base_Token_Index := Containing_Token;
begin
if Line < Data.Line_Begin_Token.First_Index then
-- Line is before the first grammar token. We may be doing a partial
-- parse where the initial indent is non-zero, so we still have to
-- check for column 0.
for Tok of Data.Leading_Non_Grammar loop
if Tok.Line = Line and then
Tok.ID in Data.First_Comment_ID .. Data.Last_Comment_ID and then
Tok.Column = 0
then
Indent := False;
exit;
end if;
end loop;
elsif Containing /= Invalid_Token_Index then
for Tok of Data.Terminals (Containing).Non_Grammar loop
if Tok.Line = Line and then
Tok.ID in Data.First_Comment_ID .. Data.Last_Comment_ID and then
Tok.Column = 0
then
Indent := False;
exit;
end if;
end loop;
end if;
if Indent then
Indent_Line (Data, Line, Delta_Indent);
else
Indent_Line (Data, Line, (Simple, (Int, 0)));
end if;
end;
else
Indent_Line (Data, Line, Delta_Indent);
end if;
end loop;
end Indent_Token_1;
function Last_Line
(Token : in Augmented_Token;
Indenting_Comment : in Boolean)
return Line_Number_Type
is begin
return
(if Indenting_Comment then
(if Token.Last_Trailing_Comment_Line = Invalid_Line_Number
then Token.Line
else Token.Last_Trailing_Comment_Line)
else
(if Token.Last_Indent_Line = Invalid_Line_Number
then Token.Line
else Token.Last_Indent_Line));
end Last_Line;
end Wisi;
| 39.047337 | 119 | 0.562859 |
3d255509c38364db03b944694d6182edccd2d847 | 19,087 | adb | Ada | tools-src/gnu/gcc/gcc/ada/memroot.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/memroot.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/memroot.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- M E M R O O T --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1997-2001 Ada Core Technologies, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- It is now maintained by Ada Core Technologies Inc (http://www.gnat.com). --
-- --
------------------------------------------------------------------------------
with GNAT.Table;
with GNAT.HTable; use GNAT.HTable;
with Ada.Text_IO; use Ada.Text_IO;
package body Memroot is
-------------
-- Name_Id --
-------------
package Chars is new GNAT.Table (
Table_Component_Type => Character,
Table_Index_Type => Integer,
Table_Low_Bound => 1,
Table_Initial => 10_000,
Table_Increment => 100);
-- The actual character container for names
type Name is record
First, Last : Integer;
end record;
package Names is new GNAT.Table (
Table_Component_Type => Name,
Table_Index_Type => Name_Id,
Table_Low_Bound => 0,
Table_Initial => 400,
Table_Increment => 100);
type Name_Range is range 1 .. 1023;
function Name_Eq (N1, N2 : Name) return Boolean;
-- compare 2 names
function H (N : Name) return Name_Range;
package Name_HTable is new GNAT.HTable.Simple_HTable (
Header_Num => Name_Range,
Element => Name_Id,
No_Element => No_Name_Id,
Key => Name,
Hash => H,
Equal => Name_Eq);
--------------
-- Frame_Id --
--------------
type Frame is record
Name, File, Line : Name_Id;
end record;
function Image
(F : Frame_Id;
Max_Fil : Integer;
Max_Lin : Integer)
return String;
-- Returns an image for F containing the file name, the Line number,
-- and the subprogram name. When possible, spaces are inserted between
-- the line number and the subprogram name in order to align images of the
-- same frame. Alignement is cimputed with Max_Fil & Max_Lin representing
-- the max number of character in a filename or length in a given frame.
package Frames is new GNAT.Table (
Table_Component_Type => Frame,
Table_Index_Type => Frame_Id,
Table_Low_Bound => 1,
Table_Initial => 400,
Table_Increment => 100);
type Frame_Range is range 1 .. 513;
function H (N : Frame) return Frame_Range;
package Frame_HTable is new GNAT.HTable.Simple_HTable (
Header_Num => Frame_Range,
Element => Frame_Id,
No_Element => No_Frame_Id,
Key => Frame,
Hash => H,
Equal => "=");
-------------
-- Root_Id --
-------------
type Root is record
First, Last : Integer;
Nb_Alloc : Integer;
Alloc_Size : Storage_Count;
High_Water_Mark : Storage_Count;
end record;
package Frames_In_Root is new GNAT.Table (
Table_Component_Type => Frame_Id,
Table_Index_Type => Integer,
Table_Low_Bound => 1,
Table_Initial => 400,
Table_Increment => 100);
package Roots is new GNAT.Table (
Table_Component_Type => Root,
Table_Index_Type => Root_Id,
Table_Low_Bound => 1,
Table_Initial => 200,
Table_Increment => 100);
type Root_Range is range 1 .. 513;
function Root_Eq (N1, N2 : Root) return Boolean;
function H (B : Root) return Root_Range;
package Root_HTable is new GNAT.HTable.Simple_HTable (
Header_Num => Root_Range,
Element => Root_Id,
No_Element => No_Root_Id,
Key => Root,
Hash => H,
Equal => Root_Eq);
----------------
-- Alloc_Size --
----------------
function Alloc_Size (B : Root_Id) return Storage_Count is
begin
return Roots.Table (B).Alloc_Size;
end Alloc_Size;
-----------------
-- Enter_Frame --
-----------------
function Enter_Frame (Name, File, Line : Name_Id) return Frame_Id is
Res : Frame_Id;
begin
Frames.Increment_Last;
Frames.Table (Frames.Last) := Frame'(Name, File, Line);
Res := Frame_HTable.Get (Frames.Table (Frames.Last));
if Res /= No_Frame_Id then
Frames.Decrement_Last;
return Res;
else
Frame_HTable.Set (Frames.Table (Frames.Last), Frames.Last);
return Frames.Last;
end if;
end Enter_Frame;
----------------
-- Enter_Name --
----------------
function Enter_Name (S : String) return Name_Id is
Old_L : constant Integer := Chars.Last;
Len : constant Integer := S'Length;
F : constant Integer := Chars.Allocate (Len);
Res : Name_Id;
begin
Chars.Table (F .. F + Len - 1) := Chars.Table_Type (S);
Names.Increment_Last;
Names.Table (Names.Last) := Name'(F, F + Len - 1);
Res := Name_HTable.Get (Names.Table (Names.Last));
if Res /= No_Name_Id then
Names.Decrement_Last;
Chars.Set_Last (Old_L);
return Res;
else
Name_HTable.Set (Names.Table (Names.Last), Names.Last);
return Names.Last;
end if;
end Enter_Name;
----------------
-- Enter_Root --
----------------
function Enter_Root (Fr : Frame_Array) return Root_Id is
Old_L : constant Integer := Frames_In_Root.Last;
Len : constant Integer := Fr'Length;
F : constant Integer := Frames_In_Root.Allocate (Len);
Res : Root_Id;
begin
Frames_In_Root.Table (F .. F + Len - 1) :=
Frames_In_Root.Table_Type (Fr);
Roots.Increment_Last;
Roots.Table (Roots.Last) := Root'(F, F + Len - 1, 0, 0, 0);
Res := Root_HTable.Get (Roots.Table (Roots.Last));
if Res /= No_Root_Id then
Frames_In_Root.Set_Last (Old_L);
Roots.Decrement_Last;
return Res;
else
Root_HTable.Set (Roots.Table (Roots.Last), Roots.Last);
return Roots.Last;
end if;
end Enter_Root;
---------------
-- Frames_Of --
---------------
function Frames_Of (B : Root_Id) return Frame_Array is
begin
return Frame_Array (
Frames_In_Root.Table (Roots.Table (B).First .. Roots.Table (B).Last));
end Frames_Of;
---------------
-- Get_First --
---------------
function Get_First return Root_Id is
begin
return Root_HTable.Get_First;
end Get_First;
--------------
-- Get_Next --
--------------
function Get_Next return Root_Id is
begin
return Root_HTable.Get_Next;
end Get_Next;
-------
-- H --
-------
function H (B : Root) return Root_Range is
type Uns is mod 2 ** 32;
function Rotate_Left (Value : Uns; Amount : Natural) return Uns;
pragma Import (Intrinsic, Rotate_Left);
Tmp : Uns := 0;
begin
for J in B.First .. B.Last loop
Tmp := Rotate_Left (Tmp, 1) + Uns (Frames_In_Root.Table (J));
end loop;
return Root_Range'First
+ Root_Range'Base (Tmp mod Root_Range'Range_Length);
end H;
function H (N : Name) return Name_Range is
function H is new Hash (Name_Range);
begin
return H (String (Chars.Table (N.First .. N.Last)));
end H;
function H (N : Frame) return Frame_Range is
begin
return Frame_Range (1 + (7 * N.Name + 13 * N.File + 17 * N.Line)
mod Frame_Range'Range_Length);
end H;
---------------------
-- High_Water_Mark --
---------------------
function High_Water_Mark (B : Root_Id) return Storage_Count is
begin
return Roots.Table (B).High_Water_Mark;
end High_Water_Mark;
-----------
-- Image --
-----------
function Image (N : Name_Id) return String is
Nam : Name renames Names.Table (N);
begin
return String (Chars.Table (Nam.First .. Nam.Last));
end Image;
function Image
(F : Frame_Id;
Max_Fil : Integer;
Max_Lin : Integer)
return String is
Fram : Frame renames Frames.Table (F);
Fil : Name renames Names.Table (Fram.File);
Lin : Name renames Names.Table (Fram.Line);
Nam : Name renames Names.Table (Fram.Name);
Fil_Len : constant Integer := Fil.Last - Fil.First + 1;
Lin_Len : constant Integer := Lin.Last - Lin.First + 1;
use type Chars.Table_Type;
Spaces : constant String (1 .. 80) := (1 .. 80 => ' ');
begin
return String (Chars.Table (Fil.First .. Fil.Last))
& ':'
& String (Chars.Table (Lin.First .. Lin.Last))
& Spaces (1 .. 1 + Max_Fil - Fil_Len + Max_Lin - Lin_Len)
& String (Chars.Table (Nam.First .. Nam.Last));
end Image;
-------------
-- Name_Eq --
-------------
function Name_Eq (N1, N2 : Name) return Boolean is
use type Chars.Table_Type;
begin
return
Chars.Table (N1.First .. N1.Last) = Chars.Table (N2.First .. N2.Last);
end Name_Eq;
--------------
-- Nb_Alloc --
--------------
function Nb_Alloc (B : Root_Id) return Integer is
begin
return Roots.Table (B).Nb_Alloc;
end Nb_Alloc;
--------------
-- Print_BT --
--------------
procedure Print_BT (B : Root_Id) is
Max_Col_Width : constant := 35;
-- Largest filename length for which backtraces will be
-- properly aligned. Frames containing longer names won't be
-- truncated but they won't be properly aligned either.
F : constant Frame_Array := Frames_Of (B);
Max_Fil : Integer;
Max_Lin : Integer;
begin
Max_Fil := 0;
Max_Lin := 0;
for J in F'Range loop
declare
Fram : Frame renames Frames.Table (F (J));
Fil : Name renames Names.Table (Fram.File);
Lin : Name renames Names.Table (Fram.Line);
begin
Max_Fil := Integer'Max (Max_Fil, Fil.Last - Fil.First + 1);
Max_Lin := Integer'Max (Max_Lin, Lin.Last - Lin.First + 1);
end;
end loop;
Max_Fil := Integer'Min (Max_Fil, Max_Col_Width);
for J in F'Range loop
Put (" ");
Put_Line (Image (F (J), Max_Fil, Max_Lin));
end loop;
end Print_BT;
-------------
-- Read_BT --
-------------
function Read_BT (BT_Depth : Integer; FT : File_Type) return Root_Id is
Max_Line : constant Integer := 500;
Curs1 : Integer;
Curs2 : Integer;
Line : String (1 .. Max_Line);
Last : Integer := 0;
Frames : Frame_Array (1 .. BT_Depth);
F : Integer := Frames'First;
Nam : Name_Id;
Fil : Name_Id;
Lin : Name_Id;
No_File : Boolean := False;
Main_Found : Boolean := False;
procedure Find_File;
-- Position Curs1 and Curs2 so that Line (Curs1 .. Curs2) contains
-- the file name. The file name may not be on the current line since
-- a frame may be printed on more than one line when there is a lot
-- of parameters or names are long, so this subprogram can read new
-- lines of input.
procedure Find_Line;
-- Position Curs1 and Curs2 so that Line (Curs1 .. Curs2) contains
-- the line number.
procedure Find_Name;
-- Position Curs1 and Curs2 so that Line (Curs1 .. Curs2) contains
-- the subprogram name.
procedure Gmem_Read_BT_Frame (Buf : out String; Last : out Natural);
-- GMEM functionality binding
---------------
-- Find_File --
---------------
procedure Find_File is
Match_Parent : Integer;
begin
-- Skip parameters
Curs1 := Curs2 + 3;
Match_Parent := 1;
while Curs1 <= Last loop
if Line (Curs1) = '(' then
Match_Parent := Match_Parent + 1;
elsif Line (Curs1) = ')' then
Match_Parent := Match_Parent - 1;
exit when Match_Parent = 0;
end if;
Curs1 := Curs1 + 1;
end loop;
-- Skip " at "
Curs1 := Curs1 + 5;
if Curs1 >= Last then
-- Maybe the file reference is on one of the next lines
Read : loop
Get_Line (FT, Line, Last);
-- If we have another Frame or if the backtrace is finished
-- the file reference was just missing
if Last <= 1 or else Line (1) = '#' then
No_File := True;
Curs2 := Curs1 - 1;
return;
else
Curs1 := 1;
while Curs1 <= Last - 2 loop
if Line (Curs1) = '(' then
Match_Parent := Match_Parent + 1;
elsif Line (Curs1) = ')' then
Match_Parent := Match_Parent - 1;
end if;
if Match_Parent = 0
and then Line (Curs1 .. Curs1 + 1) = "at"
then
Curs1 := Curs1 + 3;
exit Read;
end if;
Curs1 := Curs1 + 1;
end loop;
end if;
end loop Read;
end if;
-- Let's assume that the filename length is greater than 1
-- it simplifies dealing with the potential drive ':' on
-- windows systems
Curs2 := Curs1 + 1;
while Line (Curs2 + 1) /= ':' loop Curs2 := Curs2 + 1; end loop;
end Find_File;
---------------
-- Find_Line --
---------------
procedure Find_Line is
begin
Curs1 := Curs2 + 2;
Curs2 := Last;
if Curs2 - Curs1 > 5 then
raise Constraint_Error;
end if;
end Find_Line;
---------------
-- Find_Name --
---------------
procedure Find_Name is
begin
Curs1 := 3;
-- Skip Frame #
while Line (Curs1) /= ' ' loop Curs1 := Curs1 + 1; end loop;
-- Skip spaces
while Line (Curs1) = ' ' loop Curs1 := Curs1 + 1; end loop;
Curs2 := Curs1;
while Line (Curs2 + 1) /= ' ' loop Curs2 := Curs2 + 1; end loop;
end Find_Name;
------------------------
-- Gmem_Read_BT_Frame --
------------------------
procedure Gmem_Read_BT_Frame (Buf : out String; Last : out Natural) is
procedure Read_BT_Frame (buf : System.Address);
pragma Import (C, Read_BT_Frame, "__gnat_gmem_read_bt_frame");
function Strlen (chars : System.Address) return Natural;
pragma Import (C, Strlen, "strlen");
S : String (1 .. 1000);
begin
Read_BT_Frame (S'Address);
Last := Strlen (S'Address);
Buf (1 .. Last) := S (1 .. Last);
end Gmem_Read_BT_Frame;
-- Start of processing for Read_BT
begin
if Gmem_Mode then
Gmem_Read_BT_Frame (Line, Last);
else
Line (1) := ' ';
while Line (1) /= '#' loop
Get_Line (FT, Line, Last);
end loop;
end if;
while Last >= 1 and then Line (1) = '#' and then not Main_Found loop
if F <= BT_Depth then
Find_Name;
Nam := Enter_Name (Line (Curs1 .. Curs2));
Main_Found := Line (Curs1 .. Curs2) = "main";
Find_File;
if No_File then
Fil := No_Name_Id;
Lin := No_Name_Id;
else
Fil := Enter_Name (Line (Curs1 .. Curs2));
Find_Line;
Lin := Enter_Name (Line (Curs1 .. Curs2));
end if;
Frames (F) := Enter_Frame (Nam, Fil, Lin);
F := F + 1;
end if;
if No_File then
-- If no file reference was found, the next line has already
-- been read because, it may sometimes be found on the next
-- line
No_File := False;
else
if Gmem_Mode then
Gmem_Read_BT_Frame (Line, Last);
else
Get_Line (FT, Line, Last);
exit when End_Of_File (FT);
end if;
end if;
end loop;
return Enter_Root (Frames (1 .. F - 1));
end Read_BT;
-------------
-- Root_Eq --
-------------
function Root_Eq (N1, N2 : Root) return Boolean is
use type Frames_In_Root.Table_Type;
begin
return
Frames_In_Root.Table (N1.First .. N1.Last)
= Frames_In_Root.Table (N2.First .. N2.Last);
end Root_Eq;
--------------------
-- Set_Alloc_Size --
--------------------
procedure Set_Alloc_Size (B : Root_Id; V : Storage_Count) is
begin
Roots.Table (B).Alloc_Size := V;
end Set_Alloc_Size;
-------------------------
-- Set_High_Water_Mark --
-------------------------
procedure Set_High_Water_Mark (B : Root_Id; V : Storage_Count) is
begin
Roots.Table (B).High_Water_Mark := V;
end Set_High_Water_Mark;
------------------
-- Set_Nb_Alloc --
------------------
procedure Set_Nb_Alloc (B : Root_Id; V : Integer) is
begin
Roots.Table (B).Nb_Alloc := V;
end Set_Nb_Alloc;
begin
-- Initialize name for No_Name_ID
Names.Increment_Last;
Names.Table (Names.Last) := Name'(1, 0);
end Memroot;
| 28.745482 | 78 | 0.506942 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.