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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
a13fe23522c146dbf6793adb8c1fd188d074a87a | 10,536 | adb | Ada | ibm_8b_10b_encoder.adb | silentTeee/IBM-8b-10b-encoder | 6048ad1f39b20241c048dbcdd5394f1dcb487970 | [
"MIT"
] | null | null | null | ibm_8b_10b_encoder.adb | silentTeee/IBM-8b-10b-encoder | 6048ad1f39b20241c048dbcdd5394f1dcb487970 | [
"MIT"
] | null | null | null | ibm_8b_10b_encoder.adb | silentTeee/IBM-8b-10b-encoder | 6048ad1f39b20241c048dbcdd5394f1dcb487970 | [
"MIT"
] | null | null | null | --Copyright (c) 2019 Alex Tsantilis under the MIT License
package body IBM_8b_10b_Encoder is
type Encoder_Entry is
record
RD_Neg_Val: Ten_Bits;
RD_Pos_Val: Ten_Bits;
RD_Changes: Boolean;
end record;
type Decoder_Entry is
record
Key: Ten_Bits := 0;
Value: Byte := 0;
end record;
type Decoder_Table is array(Natural range 0 .. 255) of Decoder_Entry;
Encoder_Table: array(Byte) of Encoder_Entry;
Decoder_Table_RD_Neg: Decoder_Table;
Decoder_Table_RD_Pos: Decoder_Table;
procedure Encode( B: in Byte;
T: out Ten_Bits;
RD: in out Running_Disp) is
begin
case RD is
when Neg_1 => T := Encoder_Table(B).RD_Neg_Val;
case Encoder_Table(B).RD_Changes is
when False => RD := Neg_1;
when True => RD := Pos_1;
end case;
when Pos_1 => T := Encoder_Table(B).RD_Pos_Val;
case Encoder_Table(B).RD_Changes is
when False => RD := Pos_1;
when True => RD := Neg_1;
end case;
end case;
end Encode;
function Compute_Hash_Index(K: Ten_Bits;
Table_Size: Natural) return Natural is
begin
return Natural(K) mod Table_Size;
end Compute_Hash_Index;
procedure Insert( Table: in out Decoder_Table;
Key: in Ten_Bits;
Value: in Byte;
Success: out Boolean ) is
I: Natural := 0;
Idx, Idx_Modded: Natural;
begin
Success := False;
Idx := Compute_Hash_Index(Key, Table'Length);
Idx_Modded := Idx;
loop
if Table(Idx_Modded).Key = 0 or Table(Idx_Modded).Key = Key then
Table(Idx_Modded).Key := Key;
Table(Idx_Modded).Value := Value;
Success := True;
else
I := I + 1;
--Note: this variant of the quadratic probing algorithm
--is most effective with tables with 2^n entries, where
--n is any positive integer. Coincidentally, this works
--perfectly for our encoding table. :D
Idx_Modded := (Idx + (I + I**2)/2) mod Table'Length;
end if;
exit when Success or I >= Table'Length;
end loop;
end Insert;
procedure Find_Entry( Table: in Decoder_Table;
Key: in Ten_Bits;
Value: out Byte;
Success: out Boolean) is
I: Natural := 0;
Idx, Idx_Modded: Natural;
begin
Success := False;
Idx := Compute_Hash_Index(Key, Table'Length);
Idx_Modded := Idx;
loop
if Table(Idx_Modded).Key = Key then
Value := Table(Idx_Modded).Value;
Success := True;
else
I := I + 1;
Idx_Modded := (Idx + (I + I**2)/2) mod Table'Length;
end if;
exit when Success or I >= Table'Length;
end loop;
end Find_Entry;
--To verify that Running Disparity is being preserved, use this version.
procedure Decode( T: in Ten_Bits;
B: out Byte;
RD: in out Running_Disp;
Success: out Boolean) is
begin
case RD is
when Neg_1 =>
Find_Entry(Decoder_Table_RD_Neg, T, B, Success);
case Encoder_Table(B).RD_Changes is
when False => RD := Neg_1;
when True => RD := Pos_1;
end case;
when Pos_1 =>
Find_Entry(Decoder_Table_RD_Pos, T, B, Success);
case Encoder_Table(B).RD_Changes is
when False => RD := Pos_1;
when True => RD := Neg_1;
end case;
end case;
end Decode;
procedure Decode( T: in Ten_Bits;
B: out Byte;
Success: out Boolean) is
begin
Find_Entry(Decoder_Table_RD_Neg, T, B, Success);
if not Success then
Find_Entry(Decoder_Table_RD_Pos, T, B, Success);
end if;
end Decode;
begin
declare
--8 to 10 bit encoding table construction necessities (all are temporary)
Table_5to6_Bits: array(Byte range 0 .. 31, 0 .. 1) of Ten_Bits :=
((2#111001#, 2#000110#),
(2#101110#, 2#010001#),
(2#101101#, 2#010010#),
(2#100011#, 2#100011#),
(2#101011#, 2#010100#),
(2#100101#, 2#100101#),
(2#100110#, 2#100110#),
(2#000111#, 2#111000#),
(2#100111#, 2#011000#),
(2#101001#, 2#101001#),
(2#101010#, 2#101010#),
(2#001011#, 2#001011#),
(2#101100#, 2#101100#),
(2#001101#, 2#001101#),
(2#001110#, 2#001110#),
(2#111010#, 2#000101#),
(2#110110#, 2#001001#),
(2#110001#, 2#110001#),
(2#110010#, 2#110010#),
(2#010011#, 2#010011#),
(2#110100#, 2#110100#),
(2#010101#, 2#010101#),
(2#010110#, 2#010110#),
(2#010111#, 2#101000#),
(2#110011#, 2#001100#),
(2#011001#, 2#011001#),
(2#011010#, 2#011010#),
(2#011011#, 2#100100#),
(2#011100#, 2#011100#),
(2#011101#, 2#100010#),
(2#011110#, 2#100001#),
(2#110101#, 2#001010#));
Table_3to4_Bits: array(Byte range 0 .. 7, 0 .. 3) of Ten_Bits :=
--RD -1, RD +1
((2#1101#, 2#0010#, -1, -1),
(2#1001#, 2#1001#, -1, -1),
(2#1010#, 2#1010#, -1, -1),
(2#0011#, 2#1100#, -1, -1),
(2#1011#, 2#0100#, -1, -1),
(2#0101#, 2#0101#, -1, -1),
(2#0110#, 2#0110#, -1, -1),
--||---Primary----|||---Alternate---||
--RD -1 , RD +1 | RD -1 , RD +1
(2#0111#, 2#1000#, 2#1110#, 2#0001#));
NO : Boolean := False;
YES : Boolean := True;
Changes_Running_Disp: array(Byte range 0 .. 31) of Boolean :=
(
NO ,
NO ,
NO ,
YES,
NO ,
YES,
YES,
YES,
NO ,
YES,
YES,
YES,
YES,
YES,
YES,
NO ,
NO ,
YES,
YES,
YES,
YES,
YES,
YES,
NO ,
NO ,
YES,
YES,
NO ,
YES,
NO ,
NO ,
NO
);
Old_Right, Old_Left: Byte := 0;
Encoded_Left_Pos, Encoded_Left_Neg,
Encoded_Right_Pos, Encoded_Right_Neg: Ten_Bits := 0;
RD_Change_Idx: Byte;
Insertion_Error: exception;
begin
for I in Byte range 0 .. 255 loop
Old_Right := I and 2#000_11111#;
Old_Left := (I and 2#111_00000#) / 2**5;
--Encoding the right 5 bits is easy, but encoding the left
--3 bits requires following a very specific pattern...
Encoded_Right_Neg := Table_5to6_Bits(Old_Right, 0);
Encoded_Right_Pos := Table_5to6_Bits(Old_Right, 1);
if Old_Left < 2#111# then
--when the encoding of the right bits is the same regardless
--of the running disparity (7 is an exception because it has
--equal 0s and 1s), the 5 bit encoding for (-) RD is paired with
--the 3 bit encoding for (-) RD, and (+) with (+)
if Encoded_Right_Neg = Encoded_Right_Pos or Old_Right = 7 then
Encoded_Left_Neg := Table_3to4_Bits(Old_Left, 0);
Encoded_Left_Pos := Table_3to4_Bits(Old_Left, 1);
else
Encoded_Left_Neg := Table_3to4_Bits(Old_Left, 1);
Encoded_Left_Pos := Table_3to4_Bits(Old_Left, 0);
end if;
--when the 3 left bits to encode are "111", there are unique
--circumstances where an alternate output needs to be used
else
if Encoded_Right_Neg = Encoded_Right_Pos or Old_Right = 7 then
if Old_Right /= 17 and Old_Right /= 18 and Old_Right /= 20 then
Encoded_Left_Neg := Table_3to4_Bits(Old_Left, 0);
else
Encoded_Left_Neg := Table_3to4_Bits(Old_Left, 2);
end if;
if Old_Right /= 11 and Old_Right /= 13 and Old_Right /= 14 then
Encoded_Left_Pos := Table_3to4_Bits(Old_Left, 1);
else
Encoded_Left_Pos := Table_3to4_Bits(Old_Left, 3);
end if;
else
Encoded_Left_Neg := Table_3to4_Bits(Old_Left, 1);
Encoded_Left_Pos := Table_3to4_Bits(Old_Left, 0);
end if;
end if;
RD_Change_Idx := I mod 32;
declare
E: Encoder_Entry;
Check: Boolean;
begin
--Add an entry to the encoding table...
E.RD_Neg_Val := (Encoded_Left_Neg * 2**6) or Encoded_Right_Neg;
E.RD_Pos_Val := (Encoded_Left_Pos * 2**6) or Encoded_Right_Pos;
if Old_Left = 2#000# or Old_Left = 2#100# or Old_Left = 2#111# then
E.RD_Changes := Changes_Running_Disp(RD_Change_Idx);
else
E.RD_Changes := not Changes_Running_Disp(RD_Change_Idx);
end if;
Encoder_Table(I) := E;
--...and add the flipped keys and values to the decoding tables
Insert(Decoder_Table_RD_Neg, E.RD_Neg_Val, I, Check);
Insert(Decoder_Table_RD_Pos, E.RD_Pos_Val, I, Check);
if not Check then raise Insertion_Error; end if;
end;
end loop;
end;
end IBM_8b_10b_Encoder;
| 35.959044 | 83 | 0.470767 |
313e5d68b257bdf2a4fdb5919e72f3e6de41f099 | 9,585 | adb | Ada | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-exextr.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-exextr.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-exextr.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- ADA.EXCEPTIONS.EXCEPTION_TRACES --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Unchecked_Conversion;
pragma Warnings (Off);
with Ada.Exceptions.Last_Chance_Handler;
pragma Warnings (On);
-- Bring last chance handler into closure
separate (Ada.Exceptions)
package body Exception_Traces is
Nline : constant String := String'(1 => ASCII.LF);
-- Convenient shortcut
type Exception_Action is access procedure (E : Exception_Occurrence);
pragma Favor_Top_Level (Exception_Action);
Global_Action : Exception_Action := null;
pragma Atomic (Global_Action);
pragma Export
(Ada, Global_Action, "__gnat_exception_actions_global_action");
-- Global action, executed whenever an exception is raised. Changing the
-- export name must be coordinated with code in g-excact.adb.
Global_Unhandled_Action : Exception_Action := null;
pragma Atomic (Global_Unhandled_Action);
pragma Export
(Ada, Global_Unhandled_Action,
"__gnat_exception_actions_global_unhandled_action");
-- Global action, executed whenever an unhandled exception is raised.
-- Changing the export name must be coordinated with code in g-excact.adb.
Raise_Hook_Initialized : Boolean := False;
pragma Export
(Ada, Raise_Hook_Initialized, "__gnat_exception_actions_initialized");
procedure Last_Chance_Handler (Except : Exception_Occurrence);
pragma Import (C, Last_Chance_Handler, "__gnat_last_chance_handler");
pragma No_Return (Last_Chance_Handler);
-- Users can replace the default version of this routine,
-- Ada.Exceptions.Last_Chance_Handler.
function To_Action is new Ada.Unchecked_Conversion
(Raise_Action, Exception_Action);
-----------------------
-- Local Subprograms --
-----------------------
procedure Notify_Exception (Excep : EOA; Is_Unhandled : Boolean);
-- Factorizes the common processing for Notify_Handled_Exception and
-- Notify_Unhandled_Exception. Is_Unhandled is set to True only in the
-- latter case because Notify_Handled_Exception may be called for an
-- actually unhandled occurrence in the Front-End-SJLJ case.
----------------------
-- Notify_Exception --
----------------------
procedure Notify_Exception (Excep : EOA; Is_Unhandled : Boolean) is
-- Save actions locally to avoid any race condition that would
-- reset them to null.
Action : constant Exception_Action := Global_Action;
Unhandled_Action : constant Exception_Action := Global_Unhandled_Action;
begin
-- Output the exception information required by the Exception_Trace
-- configuration. Take care not to output information about internal
-- exceptions.
if not Excep.Id.Not_Handled_By_Others
and then
(Exception_Trace = Every_Raise
or else
(Is_Unhandled
and then
(Exception_Trace = Unhandled_Raise
or else Exception_Trace = Unhandled_Raise_In_Main)))
then
-- Exception trace messages need to be protected when several tasks
-- can issue them at the same time.
Lock_Task.all;
To_Stderr (Nline);
if Exception_Trace /= Unhandled_Raise_In_Main then
if Is_Unhandled then
To_Stderr ("Unhandled ");
end if;
To_Stderr ("Exception raised");
To_Stderr (Nline);
end if;
To_Stderr (Exception_Information (Excep.all));
Unlock_Task.all;
end if;
-- Call the user-specific actions
-- ??? We should presumably look at the reraise status here.
if Raise_Hook_Initialized
and then Exception_Data_Ptr (Excep.Id).Raise_Hook /= null
then
To_Action (Exception_Data_Ptr (Excep.Id).Raise_Hook) (Excep.all);
end if;
if Is_Unhandled and Unhandled_Action /= null then
Unhandled_Action (Excep.all);
end if;
if Action /= null then
Action (Excep.all);
end if;
end Notify_Exception;
------------------------------
-- Notify_Handled_Exception --
------------------------------
procedure Notify_Handled_Exception (Excep : EOA) is
begin
Notify_Exception (Excep, Is_Unhandled => False);
end Notify_Handled_Exception;
--------------------------------
-- Notify_Unhandled_Exception --
--------------------------------
procedure Notify_Unhandled_Exception (Excep : EOA) is
begin
-- Check whether there is any termination handler to be executed for
-- the environment task, and execute it if needed. Here we handle both
-- the Abnormal and Unhandled_Exception task termination. Normal
-- task termination routine is executed elsewhere (either in the
-- Task_Wrapper or in the Adafinal routine for the environment task).
Task_Termination_Handler.all (Excep.all);
Notify_Exception (Excep, Is_Unhandled => True);
Debug_Unhandled_Exception (SSL.Exception_Data_Ptr (Excep.Id));
end Notify_Unhandled_Exception;
-----------------------------------
-- Unhandled_Exception_Terminate --
-----------------------------------
procedure Unhandled_Exception_Terminate (Excep : EOA) is
Occ : Exception_Occurrence;
-- This occurrence will be used to display a message after finalization.
-- It is necessary to save a copy here, or else the designated value
-- could be overwritten if an exception is raised during finalization
-- (even if that exception is caught). The occurrence is saved on the
-- stack to avoid dynamic allocation (if this exception is due to lack
-- of space in the heap, we therefore avoid a second failure). We assume
-- that there is enough room on the stack however.
begin
Save_Occurrence (Occ, Excep.all);
Last_Chance_Handler (Occ);
end Unhandled_Exception_Terminate;
------------------------------------
-- Handling GNAT.Exception_Traces --
------------------------------------
-- The bulk of exception traces output is centralized in Notify_Exception,
-- for both the Handled and Unhandled cases. Extra task specific output is
-- triggered in the task wrapper for unhandled occurrences in tasks. It is
-- not performed in this unit to avoid dependencies on the tasking units
-- here.
-- We used to rely on the output performed by Unhanded_Exception_Terminate
-- for the case of an unhandled occurrence in the environment thread, and
-- the task wrapper was responsible for the whole output in the tasking
-- case.
-- This initial scheme had a drawback: the output from Terminate only
-- occurs after finalization is done, which means possibly never if some
-- tasks keep hanging around.
-- The first "presumably obvious" fix consists in moving the Terminate
-- output before the finalization. It has not been retained because it
-- introduces annoying changes in output orders when the finalization
-- itself issues outputs, this also in "regular" cases not resorting to
-- Exception_Traces.
-- Today's solution has the advantage of simplicity and better isolates
-- the Exception_Traces machinery.
end Exception_Traces;
| 43.175676 | 79 | 0.57517 |
31151c5720ba32ffcdaf78cb887444a20643fc3b | 48,300 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/urealp.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/urealp.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/urealp.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- U R E A L P --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Alloc;
with Output; use Output;
with Table;
package body Urealp is
Ureal_First_Entry : constant Ureal := Ureal'Succ (No_Ureal);
-- First subscript allocated in Ureal table (note that we can't just
-- add 1 to No_Ureal, since "+" means something different for Ureals).
type Ureal_Entry is record
Num : Uint;
-- Numerator (always non-negative)
Den : Uint;
-- Denominator (always non-zero, always positive if base is zero)
Rbase : Nat;
-- Base value. If Rbase is zero, then the value is simply Num / Den.
-- If Rbase is non-zero, then the value is Num / (Rbase ** Den)
Negative : Boolean;
-- Flag set if value is negative
end record;
-- The following representation clause ensures that the above record
-- has no holes. We do this so that when instances of this record are
-- written, we do not write uninitialized values to the file.
for Ureal_Entry use record
Num at 0 range 0 .. 31;
Den at 4 range 0 .. 31;
Rbase at 8 range 0 .. 31;
Negative at 12 range 0 .. 31;
end record;
for Ureal_Entry'Size use 16 * 8;
-- This ensures that we did not leave out any fields
package Ureals is new Table.Table (
Table_Component_Type => Ureal_Entry,
Table_Index_Type => Ureal'Base,
Table_Low_Bound => Ureal_First_Entry,
Table_Initial => Alloc.Ureals_Initial,
Table_Increment => Alloc.Ureals_Increment,
Table_Name => "Ureals");
-- The following universal reals are the values returned by the constant
-- functions. They are initialized by the initialization procedure.
UR_0 : Ureal;
UR_M_0 : Ureal;
UR_Tenth : Ureal;
UR_Half : Ureal;
UR_1 : Ureal;
UR_2 : Ureal;
UR_10 : Ureal;
UR_10_36 : Ureal;
UR_M_10_36 : Ureal;
UR_100 : Ureal;
UR_2_128 : Ureal;
UR_2_80 : Ureal;
UR_2_M_128 : Ureal;
UR_2_M_80 : Ureal;
Normalized_Real : Ureal := No_Ureal;
-- Used to memoize Norm_Num and Norm_Den, if either of these functions
-- is called, this value is set and Normalized_Entry contains the result
-- of the normalization. On subsequent calls, this is used to avoid the
-- call to Normalize if it has already been made.
Normalized_Entry : Ureal_Entry;
-- Entry built by most recent call to Normalize
-----------------------
-- Local Subprograms --
-----------------------
function Decimal_Exponent_Hi (V : Ureal) return Int;
-- Returns an estimate of the exponent of Val represented as a normalized
-- decimal number (non-zero digit before decimal point), the estimate is
-- either correct, or high, but never low. The accuracy of the estimate
-- affects only the efficiency of the comparison routines.
function Decimal_Exponent_Lo (V : Ureal) return Int;
-- Returns an estimate of the exponent of Val represented as a normalized
-- decimal number (non-zero digit before decimal point), the estimate is
-- either correct, or low, but never high. The accuracy of the estimate
-- affects only the efficiency of the comparison routines.
function Equivalent_Decimal_Exponent (U : Ureal_Entry) return Int;
-- U is a Ureal entry for which the base value is non-zero, the value
-- returned is the equivalent decimal exponent value, i.e. the value of
-- Den, adjusted as though the base were base 10. The value is rounded
-- toward zero (truncated), and so its value can be off by one.
function Is_Integer (Num, Den : Uint) return Boolean;
-- Return true if the real quotient of Num / Den is an integer value
function Normalize (Val : Ureal_Entry) return Ureal_Entry;
-- Normalizes the Ureal_Entry by reducing it to lowest terms (with a base
-- value of 0).
function Same (U1, U2 : Ureal) return Boolean;
pragma Inline (Same);
-- Determines if U1 and U2 are the same Ureal. Note that we cannot use
-- the equals operator for this test, since that tests for equality, not
-- identity.
function Store_Ureal (Val : Ureal_Entry) return Ureal;
-- This store a new entry in the universal reals table and return its index
-- in the table.
function Store_Ureal_Normalized (Val : Ureal_Entry) return Ureal;
pragma Inline (Store_Ureal_Normalized);
-- Like Store_Ureal, but normalizes its operand first
-------------------------
-- Decimal_Exponent_Hi --
-------------------------
function Decimal_Exponent_Hi (V : Ureal) return Int is
Val : constant Ureal_Entry := Ureals.Table (V);
begin
-- Zero always returns zero
if UR_Is_Zero (V) then
return 0;
-- For numbers in rational form, get the maximum number of digits in the
-- numerator and the minimum number of digits in the denominator, and
-- subtract. For example:
-- 1000 / 99 = 1.010E+1
-- 9999 / 10 = 9.999E+2
-- This estimate may of course be high, but that is acceptable
elsif Val.Rbase = 0 then
return UI_Decimal_Digits_Hi (Val.Num) -
UI_Decimal_Digits_Lo (Val.Den);
-- For based numbers, just subtract the decimal exponent from the
-- high estimate of the number of digits in the numerator and add
-- one to accommodate possible round off errors for non-decimal
-- bases. For example:
-- 1_500_000 / 10**4 = 1.50E-2
else -- Val.Rbase /= 0
return UI_Decimal_Digits_Hi (Val.Num) -
Equivalent_Decimal_Exponent (Val) + 1;
end if;
end Decimal_Exponent_Hi;
-------------------------
-- Decimal_Exponent_Lo --
-------------------------
function Decimal_Exponent_Lo (V : Ureal) return Int is
Val : constant Ureal_Entry := Ureals.Table (V);
begin
-- Zero always returns zero
if UR_Is_Zero (V) then
return 0;
-- For numbers in rational form, get min digits in numerator, max digits
-- in denominator, and subtract and subtract one more for possible loss
-- during the division. For example:
-- 1000 / 99 = 1.010E+1
-- 9999 / 10 = 9.999E+2
-- This estimate may of course be low, but that is acceptable
elsif Val.Rbase = 0 then
return UI_Decimal_Digits_Lo (Val.Num) -
UI_Decimal_Digits_Hi (Val.Den) - 1;
-- For based numbers, just subtract the decimal exponent from the
-- low estimate of the number of digits in the numerator and subtract
-- one to accommodate possible round off errors for non-decimal
-- bases. For example:
-- 1_500_000 / 10**4 = 1.50E-2
else -- Val.Rbase /= 0
return UI_Decimal_Digits_Lo (Val.Num) -
Equivalent_Decimal_Exponent (Val) - 1;
end if;
end Decimal_Exponent_Lo;
-----------------
-- Denominator --
-----------------
function Denominator (Real : Ureal) return Uint is
begin
return Ureals.Table (Real).Den;
end Denominator;
---------------------------------
-- Equivalent_Decimal_Exponent --
---------------------------------
function Equivalent_Decimal_Exponent (U : Ureal_Entry) return Int is
type Ratio is record
Num : Nat;
Den : Nat;
end record;
-- The following table is a table of logs to the base 10. All values
-- have at least 15 digits of precision, and do not exceed the true
-- value. To avoid the use of floating point, and as a result potential
-- target dependency, each entry is represented as a fraction of two
-- integers.
Logs : constant array (Nat range 1 .. 16) of Ratio :=
(1 => (Num => 0, Den => 1), -- 0
2 => (Num => 15_392_313, Den => 51_132_157), -- 0.301029995663981
3 => (Num => 731_111_920, Den => 1532_339_867), -- 0.477121254719662
4 => (Num => 30_784_626, Den => 51_132_157), -- 0.602059991327962
5 => (Num => 111_488_153, Den => 159_503_487), -- 0.698970004336018
6 => (Num => 84_253_929, Den => 108_274_489), -- 0.778151250383643
7 => (Num => 35_275_468, Den => 41_741_273), -- 0.845098040014256
8 => (Num => 46_176_939, Den => 51_132_157), -- 0.903089986991943
9 => (Num => 417_620_173, Den => 437_645_744), -- 0.954242509439324
10 => (Num => 1, Den => 1), -- 1.000000000000000
11 => (Num => 136_507_510, Den => 131_081_687), -- 1.041392685158225
12 => (Num => 26_797_783, Den => 24_831_587), -- 1.079181246047624
13 => (Num => 73_333_297, Den => 65_832_160), -- 1.113943352306836
14 => (Num => 102_941_258, Den => 89_816_543), -- 1.146128035678238
15 => (Num => 53_385_559, Den => 45_392_361), -- 1.176091259055681
16 => (Num => 78_897_839, Den => 65_523_237)); -- 1.204119982655924
function Scale (X : Int; R : Ratio) return Int;
-- Compute the value of X scaled by R
-----------
-- Scale --
-----------
function Scale (X : Int; R : Ratio) return Int is
type Wide_Int is range -2**63 .. 2**63 - 1;
begin
return Int (Wide_Int (X) * Wide_Int (R.Num) / Wide_Int (R.Den));
end Scale;
begin
pragma Assert (U.Rbase /= 0);
return Scale (UI_To_Int (U.Den), Logs (U.Rbase));
end Equivalent_Decimal_Exponent;
----------------
-- Initialize --
----------------
procedure Initialize is
begin
Ureals.Init;
UR_0 := UR_From_Components (Uint_0, Uint_1, 0, False);
UR_M_0 := UR_From_Components (Uint_0, Uint_1, 0, True);
UR_Half := UR_From_Components (Uint_1, Uint_1, 2, False);
UR_Tenth := UR_From_Components (Uint_1, Uint_1, 10, False);
UR_1 := UR_From_Components (Uint_1, Uint_1, 0, False);
UR_2 := UR_From_Components (Uint_1, Uint_Minus_1, 2, False);
UR_10 := UR_From_Components (Uint_1, Uint_Minus_1, 10, False);
UR_10_36 := UR_From_Components (Uint_1, Uint_Minus_36, 10, False);
UR_M_10_36 := UR_From_Components (Uint_1, Uint_Minus_36, 10, True);
UR_100 := UR_From_Components (Uint_1, Uint_Minus_2, 10, False);
UR_2_128 := UR_From_Components (Uint_1, Uint_Minus_128, 2, False);
UR_2_M_128 := UR_From_Components (Uint_1, Uint_128, 2, False);
UR_2_80 := UR_From_Components (Uint_1, Uint_Minus_80, 2, False);
UR_2_M_80 := UR_From_Components (Uint_1, Uint_80, 2, False);
end Initialize;
----------------
-- Is_Integer --
----------------
function Is_Integer (Num, Den : Uint) return Boolean is
begin
return (Num / Den) * Den = Num;
end Is_Integer;
----------
-- Mark --
----------
function Mark return Save_Mark is
begin
return Save_Mark (Ureals.Last);
end Mark;
--------------
-- Norm_Den --
--------------
function Norm_Den (Real : Ureal) return Uint is
begin
if not Same (Real, Normalized_Real) then
Normalized_Real := Real;
Normalized_Entry := Normalize (Ureals.Table (Real));
end if;
return Normalized_Entry.Den;
end Norm_Den;
--------------
-- Norm_Num --
--------------
function Norm_Num (Real : Ureal) return Uint is
begin
if not Same (Real, Normalized_Real) then
Normalized_Real := Real;
Normalized_Entry := Normalize (Ureals.Table (Real));
end if;
return Normalized_Entry.Num;
end Norm_Num;
---------------
-- Normalize --
---------------
function Normalize (Val : Ureal_Entry) return Ureal_Entry is
J : Uint;
K : Uint;
Tmp : Uint;
Num : Uint;
Den : Uint;
M : constant Uintp.Save_Mark := Uintp.Mark;
begin
-- Start by setting J to the greatest of the absolute values of the
-- numerator and the denominator (taking into account the base value),
-- and K to the lesser of the two absolute values. The gcd of Num and
-- Den is the gcd of J and K.
if Val.Rbase = 0 then
J := Val.Num;
K := Val.Den;
elsif Val.Den < 0 then
J := Val.Num * Val.Rbase ** (-Val.Den);
K := Uint_1;
else
J := Val.Num;
K := Val.Rbase ** Val.Den;
end if;
Num := J;
Den := K;
if K > J then
Tmp := J;
J := K;
K := Tmp;
end if;
J := UI_GCD (J, K);
Num := Num / J;
Den := Den / J;
Uintp.Release_And_Save (M, Num, Den);
-- Divide numerator and denominator by gcd and return result
return (Num => Num,
Den => Den,
Rbase => 0,
Negative => Val.Negative);
end Normalize;
---------------
-- Numerator --
---------------
function Numerator (Real : Ureal) return Uint is
begin
return Ureals.Table (Real).Num;
end Numerator;
--------
-- pr --
--------
procedure pr (Real : Ureal) is
begin
UR_Write (Real);
Write_Eol;
end pr;
-----------
-- Rbase --
-----------
function Rbase (Real : Ureal) return Nat is
begin
return Ureals.Table (Real).Rbase;
end Rbase;
-------------
-- Release --
-------------
procedure Release (M : Save_Mark) is
begin
Ureals.Set_Last (Ureal (M));
end Release;
----------
-- Same --
----------
function Same (U1, U2 : Ureal) return Boolean is
begin
return Int (U1) = Int (U2);
end Same;
-----------------
-- Store_Ureal --
-----------------
function Store_Ureal (Val : Ureal_Entry) return Ureal is
begin
Ureals.Append (Val);
-- Normalize representation of signed values
if Val.Num < 0 then
Ureals.Table (Ureals.Last).Negative := True;
Ureals.Table (Ureals.Last).Num := -Val.Num;
end if;
return Ureals.Last;
end Store_Ureal;
----------------------------
-- Store_Ureal_Normalized --
----------------------------
function Store_Ureal_Normalized (Val : Ureal_Entry) return Ureal is
begin
return Store_Ureal (Normalize (Val));
end Store_Ureal_Normalized;
------------
-- UR_Abs --
------------
function UR_Abs (Real : Ureal) return Ureal is
Val : constant Ureal_Entry := Ureals.Table (Real);
begin
return Store_Ureal
((Num => Val.Num,
Den => Val.Den,
Rbase => Val.Rbase,
Negative => False));
end UR_Abs;
------------
-- UR_Add --
------------
function UR_Add (Left : Uint; Right : Ureal) return Ureal is
begin
return UR_From_Uint (Left) + Right;
end UR_Add;
function UR_Add (Left : Ureal; Right : Uint) return Ureal is
begin
return Left + UR_From_Uint (Right);
end UR_Add;
function UR_Add (Left : Ureal; Right : Ureal) return Ureal is
Lval : Ureal_Entry := Ureals.Table (Left);
Rval : Ureal_Entry := Ureals.Table (Right);
Num : Uint;
begin
pragma Annotate (CodePeer, Modified, Lval);
pragma Annotate (CodePeer, Modified, Rval);
-- Note, in the temporary Ureal_Entry values used in this procedure,
-- we store the sign as the sign of the numerator (i.e. xxx.Num may
-- be negative, even though in stored entries this can never be so)
if Lval.Rbase /= 0 and then Lval.Rbase = Rval.Rbase then
declare
Opd_Min, Opd_Max : Ureal_Entry;
Exp_Min, Exp_Max : Uint;
begin
if Lval.Negative then
Lval.Num := (-Lval.Num);
end if;
if Rval.Negative then
Rval.Num := (-Rval.Num);
end if;
if Lval.Den < Rval.Den then
Exp_Min := Lval.Den;
Exp_Max := Rval.Den;
Opd_Min := Lval;
Opd_Max := Rval;
else
Exp_Min := Rval.Den;
Exp_Max := Lval.Den;
Opd_Min := Rval;
Opd_Max := Lval;
end if;
Num :=
Opd_Min.Num * Lval.Rbase ** (Exp_Max - Exp_Min) + Opd_Max.Num;
if Num = 0 then
return Store_Ureal
((Num => Uint_0,
Den => Uint_1,
Rbase => 0,
Negative => Lval.Negative));
else
return Store_Ureal
((Num => abs Num,
Den => Exp_Max,
Rbase => Lval.Rbase,
Negative => (Num < 0)));
end if;
end;
else
declare
Ln : Ureal_Entry := Normalize (Lval);
Rn : Ureal_Entry := Normalize (Rval);
begin
if Ln.Negative then
Ln.Num := (-Ln.Num);
end if;
if Rn.Negative then
Rn.Num := (-Rn.Num);
end if;
Num := (Ln.Num * Rn.Den) + (Rn.Num * Ln.Den);
if Num = 0 then
return Store_Ureal
((Num => Uint_0,
Den => Uint_1,
Rbase => 0,
Negative => Lval.Negative));
else
return Store_Ureal_Normalized
((Num => abs Num,
Den => Ln.Den * Rn.Den,
Rbase => 0,
Negative => (Num < 0)));
end if;
end;
end if;
end UR_Add;
----------------
-- UR_Ceiling --
----------------
function UR_Ceiling (Real : Ureal) return Uint is
Val : constant Ureal_Entry := Normalize (Ureals.Table (Real));
begin
if Val.Negative then
return UI_Negate (Val.Num / Val.Den);
else
return (Val.Num + Val.Den - 1) / Val.Den;
end if;
end UR_Ceiling;
------------
-- UR_Div --
------------
function UR_Div (Left : Uint; Right : Ureal) return Ureal is
begin
return UR_From_Uint (Left) / Right;
end UR_Div;
function UR_Div (Left : Ureal; Right : Uint) return Ureal is
begin
return Left / UR_From_Uint (Right);
end UR_Div;
function UR_Div (Left, Right : Ureal) return Ureal is
Lval : constant Ureal_Entry := Ureals.Table (Left);
Rval : constant Ureal_Entry := Ureals.Table (Right);
Rneg : constant Boolean := Rval.Negative xor Lval.Negative;
begin
pragma Annotate (CodePeer, Modified, Lval);
pragma Annotate (CodePeer, Modified, Rval);
pragma Assert (Rval.Num /= Uint_0);
if Lval.Rbase = 0 then
if Rval.Rbase = 0 then
return Store_Ureal_Normalized
((Num => Lval.Num * Rval.Den,
Den => Lval.Den * Rval.Num,
Rbase => 0,
Negative => Rneg));
elsif Is_Integer (Lval.Num, Rval.Num * Lval.Den) then
return Store_Ureal
((Num => Lval.Num / (Rval.Num * Lval.Den),
Den => (-Rval.Den),
Rbase => Rval.Rbase,
Negative => Rneg));
elsif Rval.Den < 0 then
return Store_Ureal_Normalized
((Num => Lval.Num,
Den => Rval.Rbase ** (-Rval.Den) *
Rval.Num *
Lval.Den,
Rbase => 0,
Negative => Rneg));
else
return Store_Ureal_Normalized
((Num => Lval.Num * Rval.Rbase ** Rval.Den,
Den => Rval.Num * Lval.Den,
Rbase => 0,
Negative => Rneg));
end if;
elsif Is_Integer (Lval.Num, Rval.Num) then
if Rval.Rbase = Lval.Rbase then
return Store_Ureal
((Num => Lval.Num / Rval.Num,
Den => Lval.Den - Rval.Den,
Rbase => Lval.Rbase,
Negative => Rneg));
elsif Rval.Rbase = 0 then
return Store_Ureal
((Num => (Lval.Num / Rval.Num) * Rval.Den,
Den => Lval.Den,
Rbase => Lval.Rbase,
Negative => Rneg));
elsif Rval.Den < 0 then
declare
Num, Den : Uint;
begin
if Lval.Den < 0 then
Num := (Lval.Num / Rval.Num) * (Lval.Rbase ** (-Lval.Den));
Den := Rval.Rbase ** (-Rval.Den);
else
Num := Lval.Num / Rval.Num;
Den := (Lval.Rbase ** Lval.Den) *
(Rval.Rbase ** (-Rval.Den));
end if;
return Store_Ureal
((Num => Num,
Den => Den,
Rbase => 0,
Negative => Rneg));
end;
else
return Store_Ureal
((Num => (Lval.Num / Rval.Num) *
(Rval.Rbase ** Rval.Den),
Den => Lval.Den,
Rbase => Lval.Rbase,
Negative => Rneg));
end if;
else
declare
Num, Den : Uint;
begin
if Lval.Den < 0 then
Num := Lval.Num * (Lval.Rbase ** (-Lval.Den));
Den := Rval.Num;
else
Num := Lval.Num;
Den := Rval.Num * (Lval.Rbase ** Lval.Den);
end if;
if Rval.Rbase /= 0 then
if Rval.Den < 0 then
Den := Den * (Rval.Rbase ** (-Rval.Den));
else
Num := Num * (Rval.Rbase ** Rval.Den);
end if;
else
Num := Num * Rval.Den;
end if;
return Store_Ureal_Normalized
((Num => Num,
Den => Den,
Rbase => 0,
Negative => Rneg));
end;
end if;
end UR_Div;
-----------
-- UR_Eq --
-----------
function UR_Eq (Left, Right : Ureal) return Boolean is
begin
return not UR_Ne (Left, Right);
end UR_Eq;
---------------------
-- UR_Exponentiate --
---------------------
function UR_Exponentiate (Real : Ureal; N : Uint) return Ureal is
X : constant Uint := abs N;
Bas : Ureal;
Val : Ureal_Entry;
Neg : Boolean;
IBas : Uint;
begin
-- If base is negative, then the resulting sign depends on whether
-- the exponent is even or odd (even => positive, odd = negative)
if UR_Is_Negative (Real) then
Neg := (N mod 2) /= 0;
Bas := UR_Negate (Real);
else
Neg := False;
Bas := Real;
end if;
Val := Ureals.Table (Bas);
-- If the base is a small integer, then we can return the result in
-- exponential form, which can save a lot of time for junk exponents.
IBas := UR_Trunc (Bas);
if IBas <= 16
and then UR_From_Uint (IBas) = Bas
then
return Store_Ureal
((Num => Uint_1,
Den => -N,
Rbase => UI_To_Int (UR_Trunc (Bas)),
Negative => Neg));
-- If the exponent is negative then we raise the numerator and the
-- denominator (after normalization) to the absolute value of the
-- exponent and we return the reciprocal. An assert error will happen
-- if the numerator is zero.
elsif N < 0 then
pragma Assert (Val.Num /= 0);
Val := Normalize (Val);
return Store_Ureal
((Num => Val.Den ** X,
Den => Val.Num ** X,
Rbase => 0,
Negative => Neg));
-- If positive, we distinguish the case when the base is not zero, in
-- which case the new denominator is just the product of the old one
-- with the exponent,
else
if Val.Rbase /= 0 then
return Store_Ureal
((Num => Val.Num ** X,
Den => Val.Den * X,
Rbase => Val.Rbase,
Negative => Neg));
-- And when the base is zero, in which case we exponentiate
-- the old denominator.
else
return Store_Ureal
((Num => Val.Num ** X,
Den => Val.Den ** X,
Rbase => 0,
Negative => Neg));
end if;
end if;
end UR_Exponentiate;
--------------
-- UR_Floor --
--------------
function UR_Floor (Real : Ureal) return Uint is
Val : constant Ureal_Entry := Normalize (Ureals.Table (Real));
begin
if Val.Negative then
return UI_Negate ((Val.Num + Val.Den - 1) / Val.Den);
else
return Val.Num / Val.Den;
end if;
end UR_Floor;
------------------------
-- UR_From_Components --
------------------------
function UR_From_Components
(Num : Uint;
Den : Uint;
Rbase : Nat := 0;
Negative : Boolean := False)
return Ureal
is
begin
return Store_Ureal
((Num => Num,
Den => Den,
Rbase => Rbase,
Negative => Negative));
end UR_From_Components;
------------------
-- UR_From_Uint --
------------------
function UR_From_Uint (UI : Uint) return Ureal is
begin
return UR_From_Components
(abs UI, Uint_1, Negative => (UI < 0));
end UR_From_Uint;
-----------
-- UR_Ge --
-----------
function UR_Ge (Left, Right : Ureal) return Boolean is
begin
return not (Left < Right);
end UR_Ge;
-----------
-- UR_Gt --
-----------
function UR_Gt (Left, Right : Ureal) return Boolean is
begin
return (Right < Left);
end UR_Gt;
--------------------
-- UR_Is_Negative --
--------------------
function UR_Is_Negative (Real : Ureal) return Boolean is
begin
return Ureals.Table (Real).Negative;
end UR_Is_Negative;
--------------------
-- UR_Is_Positive --
--------------------
function UR_Is_Positive (Real : Ureal) return Boolean is
begin
return not Ureals.Table (Real).Negative
and then Ureals.Table (Real).Num /= 0;
end UR_Is_Positive;
----------------
-- UR_Is_Zero --
----------------
function UR_Is_Zero (Real : Ureal) return Boolean is
begin
return Ureals.Table (Real).Num = 0;
end UR_Is_Zero;
-----------
-- UR_Le --
-----------
function UR_Le (Left, Right : Ureal) return Boolean is
begin
return not (Right < Left);
end UR_Le;
-----------
-- UR_Lt --
-----------
function UR_Lt (Left, Right : Ureal) return Boolean is
begin
-- An operand is not less than itself
if Same (Left, Right) then
return False;
-- Deal with zero cases
elsif UR_Is_Zero (Left) then
return UR_Is_Positive (Right);
elsif UR_Is_Zero (Right) then
return Ureals.Table (Left).Negative;
-- Different signs are decisive (note we dealt with zero cases)
elsif Ureals.Table (Left).Negative
and then not Ureals.Table (Right).Negative
then
return True;
elsif not Ureals.Table (Left).Negative
and then Ureals.Table (Right).Negative
then
return False;
-- Signs are same, do rapid check based on worst case estimates of
-- decimal exponent, which will often be decisive. Precise test
-- depends on whether operands are positive or negative.
elsif Decimal_Exponent_Hi (Left) < Decimal_Exponent_Lo (Right) then
return UR_Is_Positive (Left);
elsif Decimal_Exponent_Lo (Left) > Decimal_Exponent_Hi (Right) then
return UR_Is_Negative (Left);
-- If we fall through, full gruesome test is required. This happens
-- if the numbers are close together, or in some weird (/=10) base.
else
declare
Imrk : constant Uintp.Save_Mark := Mark;
Rmrk : constant Urealp.Save_Mark := Mark;
Lval : Ureal_Entry;
Rval : Ureal_Entry;
Result : Boolean;
begin
Lval := Ureals.Table (Left);
Rval := Ureals.Table (Right);
-- An optimization. If both numbers are based, then subtract
-- common value of base to avoid unnecessarily giant numbers
if Lval.Rbase = Rval.Rbase and then Lval.Rbase /= 0 then
if Lval.Den < Rval.Den then
Rval.Den := Rval.Den - Lval.Den;
Lval.Den := Uint_0;
else
Lval.Den := Lval.Den - Rval.Den;
Rval.Den := Uint_0;
end if;
end if;
Lval := Normalize (Lval);
Rval := Normalize (Rval);
if Lval.Negative then
Result := (Lval.Num * Rval.Den) > (Rval.Num * Lval.Den);
else
Result := (Lval.Num * Rval.Den) < (Rval.Num * Lval.Den);
end if;
Release (Imrk);
Release (Rmrk);
return Result;
end;
end if;
end UR_Lt;
------------
-- UR_Max --
------------
function UR_Max (Left, Right : Ureal) return Ureal is
begin
if Left >= Right then
return Left;
else
return Right;
end if;
end UR_Max;
------------
-- UR_Min --
------------
function UR_Min (Left, Right : Ureal) return Ureal is
begin
if Left <= Right then
return Left;
else
return Right;
end if;
end UR_Min;
------------
-- UR_Mul --
------------
function UR_Mul (Left : Uint; Right : Ureal) return Ureal is
begin
return UR_From_Uint (Left) * Right;
end UR_Mul;
function UR_Mul (Left : Ureal; Right : Uint) return Ureal is
begin
return Left * UR_From_Uint (Right);
end UR_Mul;
function UR_Mul (Left, Right : Ureal) return Ureal is
Lval : constant Ureal_Entry := Ureals.Table (Left);
Rval : constant Ureal_Entry := Ureals.Table (Right);
Num : Uint := Lval.Num * Rval.Num;
Den : Uint;
Rneg : constant Boolean := Lval.Negative xor Rval.Negative;
begin
if Lval.Rbase = 0 then
if Rval.Rbase = 0 then
return Store_Ureal_Normalized
((Num => Num,
Den => Lval.Den * Rval.Den,
Rbase => 0,
Negative => Rneg));
elsif Is_Integer (Num, Lval.Den) then
return Store_Ureal
((Num => Num / Lval.Den,
Den => Rval.Den,
Rbase => Rval.Rbase,
Negative => Rneg));
elsif Rval.Den < 0 then
return Store_Ureal_Normalized
((Num => Num * (Rval.Rbase ** (-Rval.Den)),
Den => Lval.Den,
Rbase => 0,
Negative => Rneg));
else
return Store_Ureal_Normalized
((Num => Num,
Den => Lval.Den * (Rval.Rbase ** Rval.Den),
Rbase => 0,
Negative => Rneg));
end if;
elsif Lval.Rbase = Rval.Rbase then
return Store_Ureal
((Num => Num,
Den => Lval.Den + Rval.Den,
Rbase => Lval.Rbase,
Negative => Rneg));
elsif Rval.Rbase = 0 then
if Is_Integer (Num, Rval.Den) then
return Store_Ureal
((Num => Num / Rval.Den,
Den => Lval.Den,
Rbase => Lval.Rbase,
Negative => Rneg));
elsif Lval.Den < 0 then
return Store_Ureal_Normalized
((Num => Num * (Lval.Rbase ** (-Lval.Den)),
Den => Rval.Den,
Rbase => 0,
Negative => Rneg));
else
return Store_Ureal_Normalized
((Num => Num,
Den => Rval.Den * (Lval.Rbase ** Lval.Den),
Rbase => 0,
Negative => Rneg));
end if;
else
Den := Uint_1;
if Lval.Den < 0 then
Num := Num * (Lval.Rbase ** (-Lval.Den));
else
Den := Den * (Lval.Rbase ** Lval.Den);
end if;
if Rval.Den < 0 then
Num := Num * (Rval.Rbase ** (-Rval.Den));
else
Den := Den * (Rval.Rbase ** Rval.Den);
end if;
return Store_Ureal_Normalized
((Num => Num,
Den => Den,
Rbase => 0,
Negative => Rneg));
end if;
end UR_Mul;
-----------
-- UR_Ne --
-----------
function UR_Ne (Left, Right : Ureal) return Boolean is
begin
-- Quick processing for case of identical Ureal values (note that
-- this also deals with comparing two No_Ureal values).
if Same (Left, Right) then
return False;
-- Deal with case of one or other operand is No_Ureal, but not both
elsif Same (Left, No_Ureal) or else Same (Right, No_Ureal) then
return True;
-- Do quick check based on number of decimal digits
elsif Decimal_Exponent_Hi (Left) < Decimal_Exponent_Lo (Right) or else
Decimal_Exponent_Lo (Left) > Decimal_Exponent_Hi (Right)
then
return True;
-- Otherwise full comparison is required
else
declare
Imrk : constant Uintp.Save_Mark := Mark;
Rmrk : constant Urealp.Save_Mark := Mark;
Lval : constant Ureal_Entry := Normalize (Ureals.Table (Left));
Rval : constant Ureal_Entry := Normalize (Ureals.Table (Right));
Result : Boolean;
begin
if UR_Is_Zero (Left) then
return not UR_Is_Zero (Right);
elsif UR_Is_Zero (Right) then
return not UR_Is_Zero (Left);
-- Both operands are non-zero
else
Result :=
Rval.Negative /= Lval.Negative
or else Rval.Num /= Lval.Num
or else Rval.Den /= Lval.Den;
Release (Imrk);
Release (Rmrk);
return Result;
end if;
end;
end if;
end UR_Ne;
---------------
-- UR_Negate --
---------------
function UR_Negate (Real : Ureal) return Ureal is
begin
return Store_Ureal
((Num => Ureals.Table (Real).Num,
Den => Ureals.Table (Real).Den,
Rbase => Ureals.Table (Real).Rbase,
Negative => not Ureals.Table (Real).Negative));
end UR_Negate;
------------
-- UR_Sub --
------------
function UR_Sub (Left : Uint; Right : Ureal) return Ureal is
begin
return UR_From_Uint (Left) + UR_Negate (Right);
end UR_Sub;
function UR_Sub (Left : Ureal; Right : Uint) return Ureal is
begin
return Left + UR_From_Uint (-Right);
end UR_Sub;
function UR_Sub (Left, Right : Ureal) return Ureal is
begin
return Left + UR_Negate (Right);
end UR_Sub;
----------------
-- UR_To_Uint --
----------------
function UR_To_Uint (Real : Ureal) return Uint is
Val : constant Ureal_Entry := Normalize (Ureals.Table (Real));
Res : Uint;
begin
Res := (Val.Num + (Val.Den / 2)) / Val.Den;
if Val.Negative then
return UI_Negate (Res);
else
return Res;
end if;
end UR_To_Uint;
--------------
-- UR_Trunc --
--------------
function UR_Trunc (Real : Ureal) return Uint is
Val : constant Ureal_Entry := Normalize (Ureals.Table (Real));
begin
if Val.Negative then
return -(Val.Num / Val.Den);
else
return Val.Num / Val.Den;
end if;
end UR_Trunc;
--------------
-- UR_Write --
--------------
procedure UR_Write (Real : Ureal; Brackets : Boolean := False) is
Val : constant Ureal_Entry := Ureals.Table (Real);
T : Uint;
begin
-- If value is negative, we precede the constant by a minus sign
if Val.Negative then
Write_Char ('-');
end if;
-- Zero is zero
if Val.Num = 0 then
Write_Str ("0.0");
-- For constants with a denominator of zero, the value is simply the
-- numerator value, since we are dividing by base**0, which is 1.
elsif Val.Den = 0 then
UI_Write (Val.Num, Decimal);
Write_Str (".0");
-- Small powers of 2 get written in decimal fixed-point format
elsif Val.Rbase = 2
and then Val.Den <= 3
and then Val.Den >= -16
then
if Val.Den = 1 then
T := Val.Num * (10 / 2);
UI_Write (T / 10, Decimal);
Write_Char ('.');
UI_Write (T mod 10, Decimal);
elsif Val.Den = 2 then
T := Val.Num * (100 / 4);
UI_Write (T / 100, Decimal);
Write_Char ('.');
UI_Write (T mod 100 / 10, Decimal);
if T mod 10 /= 0 then
UI_Write (T mod 10, Decimal);
end if;
elsif Val.Den = 3 then
T := Val.Num * (1000 / 8);
UI_Write (T / 1000, Decimal);
Write_Char ('.');
UI_Write (T mod 1000 / 100, Decimal);
if T mod 100 /= 0 then
UI_Write (T mod 100 / 10, Decimal);
if T mod 10 /= 0 then
UI_Write (T mod 10, Decimal);
end if;
end if;
else
UI_Write (Val.Num * (Uint_2 ** (-Val.Den)), Decimal);
Write_Str (".0");
end if;
-- Constants in base 10 or 16 can be written in normal Ada literal
-- style, as long as they fit in the UI_Image_Buffer. Using hexadecimal
-- notation, 4 bytes are required for the 16# # part, and every fifth
-- character is an underscore. So, a buffer of size N has room for
-- ((N - 4) - (N - 4) / 5) * 4 bits,
-- or at least
-- N * 16 / 5 - 12 bits.
elsif (Val.Rbase = 10 or else Val.Rbase = 16)
and then Num_Bits (Val.Num) < UI_Image_Buffer'Length * 16 / 5 - 12
then
pragma Assert (Val.Den /= 0);
-- Use fixed-point format for small scaling values
if (Val.Rbase = 10 and then Val.Den < 0 and then Val.Den > -3)
or else (Val.Rbase = 16 and then Val.Den = -1)
then
UI_Write (Val.Num * Val.Rbase**(-Val.Den), Decimal);
Write_Str (".0");
-- Write hexadecimal constants in exponential notation with a zero
-- unit digit. This matches the Ada canonical form for floating point
-- numbers, and also ensures that the underscores end up in the
-- correct place.
elsif Val.Rbase = 16 then
UI_Image (Val.Num, Hex);
pragma Assert (Val.Rbase = 16);
Write_Str ("16#0.");
Write_Str (UI_Image_Buffer (4 .. UI_Image_Length));
-- For exponent, exclude 16# # and underscores from length
UI_Image_Length := UI_Image_Length - 4;
UI_Image_Length := UI_Image_Length - UI_Image_Length / 5;
Write_Char ('E');
UI_Write (Int (UI_Image_Length) - Val.Den, Decimal);
elsif Val.Den = 1 then
UI_Write (Val.Num / 10, Decimal);
Write_Char ('.');
UI_Write (Val.Num mod 10, Decimal);
elsif Val.Den = 2 then
UI_Write (Val.Num / 100, Decimal);
Write_Char ('.');
UI_Write (Val.Num / 10 mod 10, Decimal);
UI_Write (Val.Num mod 10, Decimal);
-- Else use decimal exponential format
else
-- Write decimal constants with a non-zero unit digit. This
-- matches usual scientific notation.
UI_Image (Val.Num, Decimal);
Write_Char (UI_Image_Buffer (1));
Write_Char ('.');
if UI_Image_Length = 1 then
Write_Char ('0');
else
Write_Str (UI_Image_Buffer (2 .. UI_Image_Length));
end if;
Write_Char ('E');
UI_Write (Int (UI_Image_Length - 1) - Val.Den, Decimal);
end if;
-- Constants in a base other than 10 can still be easily written in
-- normal Ada literal style if the numerator is one.
elsif Val.Rbase /= 0 and then Val.Num = 1 then
Write_Int (Val.Rbase);
Write_Str ("#1.0#E");
UI_Write (-Val.Den);
-- Other constants with a base other than 10 are written using one of
-- the following forms, depending on the sign of the number and the
-- sign of the exponent (= minus denominator value). See that we are
-- replacing the division by a multiplication (updating accordingly the
-- sign of the exponent) to generate an expression whose computation
-- does not cause a division by 0 when base**exponent is very small.
-- numerator.0*base**exponent
-- numerator.0*base**-exponent
-- And of course an exponent of 0 can be omitted.
elsif Val.Rbase /= 0 then
if Brackets then
Write_Char ('[');
end if;
UI_Write (Val.Num, Decimal);
Write_Str (".0");
if Val.Den /= 0 then
Write_Char ('*');
Write_Int (Val.Rbase);
Write_Str ("**");
if Val.Den <= 0 then
UI_Write (-Val.Den, Decimal);
else
Write_Str ("(-");
UI_Write (Val.Den, Decimal);
Write_Char (')');
end if;
end if;
if Brackets then
Write_Char (']');
end if;
-- Rationals where numerator is divisible by denominator can be output
-- as literals after we do the division. This includes the common case
-- where the denominator is 1.
elsif Val.Num mod Val.Den = 0 then
UI_Write (Val.Num / Val.Den, Decimal);
Write_Str (".0");
-- Other non-based (rational) constants are written in num/den style
else
if Brackets then
Write_Char ('[');
end if;
UI_Write (Val.Num, Decimal);
Write_Str (".0/");
UI_Write (Val.Den, Decimal);
Write_Str (".0");
if Brackets then
Write_Char (']');
end if;
end if;
end UR_Write;
-------------
-- Ureal_0 --
-------------
function Ureal_0 return Ureal is
begin
return UR_0;
end Ureal_0;
-------------
-- Ureal_1 --
-------------
function Ureal_1 return Ureal is
begin
return UR_1;
end Ureal_1;
-------------
-- Ureal_2 --
-------------
function Ureal_2 return Ureal is
begin
return UR_2;
end Ureal_2;
--------------
-- Ureal_10 --
--------------
function Ureal_10 return Ureal is
begin
return UR_10;
end Ureal_10;
---------------
-- Ureal_100 --
---------------
function Ureal_100 return Ureal is
begin
return UR_100;
end Ureal_100;
-----------------
-- Ureal_10_36 --
-----------------
function Ureal_10_36 return Ureal is
begin
return UR_10_36;
end Ureal_10_36;
----------------
-- Ureal_2_80 --
----------------
function Ureal_2_80 return Ureal is
begin
return UR_2_80;
end Ureal_2_80;
-----------------
-- Ureal_2_128 --
-----------------
function Ureal_2_128 return Ureal is
begin
return UR_2_128;
end Ureal_2_128;
-------------------
-- Ureal_2_M_80 --
-------------------
function Ureal_2_M_80 return Ureal is
begin
return UR_2_M_80;
end Ureal_2_M_80;
-------------------
-- Ureal_2_M_128 --
-------------------
function Ureal_2_M_128 return Ureal is
begin
return UR_2_M_128;
end Ureal_2_M_128;
----------------
-- Ureal_Half --
----------------
function Ureal_Half return Ureal is
begin
return UR_Half;
end Ureal_Half;
---------------
-- Ureal_M_0 --
---------------
function Ureal_M_0 return Ureal is
begin
return UR_M_0;
end Ureal_M_0;
-------------------
-- Ureal_M_10_36 --
-------------------
function Ureal_M_10_36 return Ureal is
begin
return UR_M_10_36;
end Ureal_M_10_36;
-----------------
-- Ureal_Tenth --
-----------------
function Ureal_Tenth return Ureal is
begin
return UR_Tenth;
end Ureal_Tenth;
end Urealp;
| 29.888614 | 79 | 0.499234 |
124b9904c72f279428b3475e270b9dba00cc428d | 6,029 | adb | Ada | source/nodes/program-nodes-formal_private_type_definitions.adb | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/nodes/program-nodes-formal_private_type_definitions.adb | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/nodes/program-nodes-formal_private_type_definitions.adb | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | 2 | 2019-09-14T23:18:50.000Z | 2019-10-02T10:11:40.000Z | -- Copyright (c) 2019 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
package body Program.Nodes.Formal_Private_Type_Definitions is
function Create
(Abstract_Token : Program.Lexical_Elements.Lexical_Element_Access;
Tagged_Token : Program.Lexical_Elements.Lexical_Element_Access;
Limited_Token : Program.Lexical_Elements.Lexical_Element_Access;
Private_Token : not null Program.Lexical_Elements.Lexical_Element_Access)
return Formal_Private_Type_Definition is
begin
return Result : Formal_Private_Type_Definition :=
(Abstract_Token => Abstract_Token, Tagged_Token => Tagged_Token,
Limited_Token => Limited_Token, Private_Token => Private_Token,
Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
function Create
(Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False;
Has_Abstract : Boolean := False;
Has_Tagged : Boolean := False;
Has_Limited : Boolean := False)
return Implicit_Formal_Private_Type_Definition is
begin
return Result : Implicit_Formal_Private_Type_Definition :=
(Is_Part_Of_Implicit => Is_Part_Of_Implicit,
Is_Part_Of_Inherited => Is_Part_Of_Inherited,
Is_Part_Of_Instance => Is_Part_Of_Instance,
Has_Abstract => Has_Abstract, Has_Tagged => Has_Tagged,
Has_Limited => Has_Limited, Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
overriding function Abstract_Token
(Self : Formal_Private_Type_Definition)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Abstract_Token;
end Abstract_Token;
overriding function Tagged_Token
(Self : Formal_Private_Type_Definition)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Tagged_Token;
end Tagged_Token;
overriding function Limited_Token
(Self : Formal_Private_Type_Definition)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Limited_Token;
end Limited_Token;
overriding function Private_Token
(Self : Formal_Private_Type_Definition)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Private_Token;
end Private_Token;
overriding function Has_Abstract
(Self : Formal_Private_Type_Definition)
return Boolean is
begin
return Self.Abstract_Token.Assigned;
end Has_Abstract;
overriding function Has_Tagged
(Self : Formal_Private_Type_Definition)
return Boolean is
begin
return Self.Tagged_Token.Assigned;
end Has_Tagged;
overriding function Has_Limited
(Self : Formal_Private_Type_Definition)
return Boolean is
begin
return Self.Limited_Token.Assigned;
end Has_Limited;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Formal_Private_Type_Definition)
return Boolean is
begin
return Self.Is_Part_Of_Implicit;
end Is_Part_Of_Implicit;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Formal_Private_Type_Definition)
return Boolean is
begin
return Self.Is_Part_Of_Inherited;
end Is_Part_Of_Inherited;
overriding function Is_Part_Of_Instance
(Self : Implicit_Formal_Private_Type_Definition)
return Boolean is
begin
return Self.Is_Part_Of_Instance;
end Is_Part_Of_Instance;
overriding function Has_Abstract
(Self : Implicit_Formal_Private_Type_Definition)
return Boolean is
begin
return Self.Has_Abstract;
end Has_Abstract;
overriding function Has_Tagged
(Self : Implicit_Formal_Private_Type_Definition)
return Boolean is
begin
return Self.Has_Tagged;
end Has_Tagged;
overriding function Has_Limited
(Self : Implicit_Formal_Private_Type_Definition)
return Boolean is
begin
return Self.Has_Limited;
end Has_Limited;
procedure Initialize
(Self : aliased in out Base_Formal_Private_Type_Definition'Class) is
begin
null;
end Initialize;
overriding function Is_Formal_Private_Type_Definition_Element
(Self : Base_Formal_Private_Type_Definition)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Formal_Private_Type_Definition_Element;
overriding function Is_Formal_Type_Definition_Element
(Self : Base_Formal_Private_Type_Definition)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Formal_Type_Definition_Element;
overriding function Is_Definition_Element
(Self : Base_Formal_Private_Type_Definition)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Definition_Element;
overriding procedure Visit
(Self : not null access Base_Formal_Private_Type_Definition;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is
begin
Visitor.Formal_Private_Type_Definition (Self);
end Visit;
overriding function To_Formal_Private_Type_Definition_Text
(Self : aliased in out Formal_Private_Type_Definition)
return Program.Elements.Formal_Private_Type_Definitions
.Formal_Private_Type_Definition_Text_Access is
begin
return Self'Unchecked_Access;
end To_Formal_Private_Type_Definition_Text;
overriding function To_Formal_Private_Type_Definition_Text
(Self : aliased in out Implicit_Formal_Private_Type_Definition)
return Program.Elements.Formal_Private_Type_Definitions
.Formal_Private_Type_Definition_Text_Access is
pragma Unreferenced (Self);
begin
return null;
end To_Formal_Private_Type_Definition_Text;
end Program.Nodes.Formal_Private_Type_Definitions;
| 31.565445 | 79 | 0.738099 |
316c0e8a8891790672c639d667c6a829522baf3a | 2,575 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c37309a.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/c37309a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c37309a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C37309A.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- CHECK THAT IF A DISCRIMINANT HAS A STATIC SUBTYPE, AN OTHERS
-- CHOICE CAN BE OMITTED IF ALL VALUES IN THE
-- SUBTYPE'S RANGE ARE COVERED IN A VARIANT PART.
-- ASL 7/10/81
-- SPS 10/25/82
-- SPS 7/17/83
WITH REPORT;
PROCEDURE C37309A IS
USE REPORT;
BEGIN
TEST ("C37309A","OTHERS CHOICE CAN BE OMITTED IN VARIANT PART " &
"IF ALL VALUES IN STATIC SUBTYPE RANGE OF DISCRIMINANT " &
"ARE COVERED");
DECLARE
SUBTYPE STATCHAR IS CHARACTER RANGE 'I'..'N';
TYPE REC1(DISC : STATCHAR := 'J') IS
RECORD
CASE DISC IS
WHEN 'I' => NULL;
WHEN 'J' => NULL;
WHEN 'K' => NULL;
WHEN 'L' => NULL;
WHEN 'M' => NULL;
WHEN 'N' => NULL;
END CASE;
END RECORD;
R1 : REC1;
BEGIN
R1 := (DISC => 'N');
IF EQUAL(3,3) THEN
R1 := (DISC => 'K');
END IF;
IF R1.DISC /= 'K' THEN
FAILED ("ASSIGNMENT FAILED - 1");
END IF;
EXCEPTION
WHEN OTHERS =>
FAILED ("EXCEPTION RAISED");
END;
RESULT;
END C37309A;
| 34.333333 | 79 | 0.557282 |
0b3ec2289048b7b04061b507929283beb8904ca7 | 1,882 | adb | Ada | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/arrayidx/p.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/arrayidx/p.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/arrayidx/p.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 20 | 2018-11-16T21:19:22.000Z | 2021-10-18T23:08:24.000Z | -- Copyright 2005-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/>.
procedure P is
type Index is (One, Two, Three);
type Table is array (Integer range 1 .. 3) of Integer;
type ETable is array (Index) of Integer;
type RTable is array (Index range Two .. Three) of Integer;
type UTable is array (Positive range <>) of Integer;
type PTable is array (Index) of Boolean;
pragma Pack (PTable);
function Get_UTable (I : Integer) return UTable is
begin
return Utable'(1 => I, 2 => 2, 3 => 3);
end Get_UTable;
One_Two_Three : Table := (1, 2, 3);
E_One_Two_Three : ETable := (1, 2, 3);
R_Two_Three : RTable := (2, 3);
U_One_Two_Three : UTable := Get_UTable (1);
P_One_Two_Three : PTable := (False, True, True);
Few_Reps : UTable := (1, 2, 3, 3, 3, 3, 3, 4, 5);
Many_Reps : UTable := (1, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 5);
Empty : array (1 .. 0) of Integer := (others => 0);
begin
One_Two_Three (1) := 4; -- START
E_One_Two_Three (One) := 4;
R_Two_Three (Two) := 4;
U_One_Two_Three (U_One_Two_Three'First) := 4;
P_One_Two_Three (One) := True;
Few_Reps (Few_Reps'First) := 2;
Many_Reps (Many_Reps'First) := 2;
Empty := (others => 1);
end P;
| 34.218182 | 74 | 0.653029 |
06c4fb8078d9e3d2cdb2d57eeb7987c5ff76ce7a | 1,072 | ads | Ada | ada-iterator_interfaces.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 15 | 2018-07-08T07:09:19.000Z | 2021-11-21T09:58:55.000Z | ada-iterator_interfaces.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 4 | 2019-11-17T20:04:33.000Z | 2021-08-29T21:24:55.000Z | ada-iterator_interfaces.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 3 | 2020-04-23T11:17:11.000Z | 2021-08-29T19:31:09.000Z | -- Standard Ada library specification
-- Copyright (c) 2004-2016 AXE Consultants
-- Copyright (c) 2004, 2005, 2006 Ada-Europe
-- Copyright (c) 2000 The MITRE Corporation, Inc.
-- Copyright (c) 1992, 1993, 1994, 1995 Intermetrics, Inc.
-- SPDX-License-Identifier: BSD-3-Clause and LicenseRef-AdaReferenceManual
---------------------------------------------------------------------------
generic
type Cursor;
with function Has_Element (Position : Cursor) return Boolean;
package Ada.Iterator_Interfaces is
pragma Pure (Iterator_Interfaces);
type Forward_Iterator is limited interface;
function First (Object : Forward_Iterator) return Cursor is abstract;
function Next (Object : Forward_Iterator; Position : Cursor)
return Cursor is abstract;
type Reversible_Iterator is limited interface and Forward_Iterator;
function Last (Object : Reversible_Iterator) return Cursor is abstract;
function Previous (Object : Reversible_Iterator; Position : Cursor)
return Cursor is abstract;
end Ada.Iterator_Interfaces;
| 41.230769 | 75 | 0.695896 |
a123c57c776cdf3f9a223be4c872a3114cbcad02 | 386 | ads | Ada | host/stm32gd-spi-peripheral.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 1 | 2021-04-06T07:57:56.000Z | 2021-04-06T07:57:56.000Z | host/stm32gd-spi-peripheral.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | null | null | null | host/stm32gd-spi-peripheral.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 2 | 2018-05-29T13:59:31.000Z | 2019-02-03T19:48:08.000Z | with STM32_SVD; use STM32_SVD;
generic
SPI : Natural;
package STM32GD.SPI.Peripheral is
pragma Preelaborate;
procedure Init;
procedure Send (Data : in Byte);
procedure Send (Data : in SPI_Data_8b);
procedure Receive (Data : out Byte);
procedure Receive (Data : out SPI_Data_8b);
procedure Transfer (Data : in out SPI_Data_8b);
end STM32GD.SPI.Peripheral;
| 19.3 | 50 | 0.715026 |
316233034c15df00f0c618935ac0a3a3b6df3b39 | 7,716 | adb | Ada | examples/pa_devices/src/pa_devices.adb | ficorax/PortAudioAda | 565cf8a3ad4ec3f6cbe1ed2dae75f42d001f052e | [
"MIT"
] | 2 | 2022-02-26T04:14:01.000Z | 2022-03-07T09:57:25.000Z | examples/pa_devices/src/pa_devices.adb | ficorax/PortAudioAda | 565cf8a3ad4ec3f6cbe1ed2dae75f42d001f052e | [
"MIT"
] | null | null | null | examples/pa_devices/src/pa_devices.adb | ficorax/PortAudioAda | 565cf8a3ad4ec3f6cbe1ed2dae75f42d001f052e | [
"MIT"
] | null | null | null | with Ada.Integer_Text_IO; use Ada.Integer_Text_IO;
with Ada.Long_Float_Text_IO; use Ada.Long_Float_Text_IO;
with Ada.Text_IO; use Ada.Text_IO;
with System;
with PortAudioAda; use PortAudioAda;
procedure PA_Devices
is
procedure Print_Supported_Standard_Sample_Rates
(inputParameters : access PA_Stream_Parameters;
outputParameters : access PA_Stream_Parameters);
procedure Print_Supported_Standard_Sample_Rates
(inputParameters : access PA_Stream_Parameters;
outputParameters : access PA_Stream_Parameters)
is
standardSampleRates : constant array (Natural range <>) of Long_Float :=
(8000.0,
9600.0,
11025.0,
12000.0,
16000.0,
22050.0,
24000.0,
32000.0,
44100.0,
48000.0,
88200.0,
96000.0,
192000.0
);
printCount : Integer;
err : PA_Error;
begin
printCount := 0;
for i in standardSampleRates'Range loop
err := PA_Is_Format_Supported (inputParameters,
outputParameters,
standardSampleRates (i));
if err = paFormatIsSupported then
if printCount = 0 then
Put (ASCII.HT);
Put (standardSampleRates (i), 8, 2, 0);
printCount := 1;
elsif printCount = 4 then
Put (",");
New_Line;
Put (ASCII.HT);
Put (standardSampleRates (i), 8, 2, 0);
printCount := 1;
else
Put (", ");
Put (standardSampleRates (i), 8, 2, 0);
printCount := printCount + 1;
end if;
end if;
end loop;
if printCount = 0 then
Put_Line ("None");
else
New_Line;
end if;
end Print_Supported_Standard_Sample_Rates;
err : PA_Error;
numHostApi : PA_Host_Api_Index;
numDevices : PA_Device_Index;
begin
err := PA_Initialize;
New_Line;
if err /= paNoError then
Put_Line ("ERROR: PA_Initialize returned " & err'Image);
raise PortAudio_Exception;
end if;
Put_Line ("PortAudio version: " & PA_Get_Version);
numHostApi := PA_Get_Host_API_Count;
if numHostApi < 0 then
Put_Line ("ERROR: Get_API_Count returned " & numHostApi'Image);
raise PortAudio_Exception;
end if;
Put_Line ("Number of Host API:" & numHostApi'Image);
numDevices := PA_Get_Device_Count;
if numDevices < 0 then
Put_Line ("ERROR: Get_Device_Count returned " & numDevices'Image);
raise PortAudio_Exception;
end if;
Put_Line ("Number of devices:" & numDevices'Image);
for i in 0 .. numDevices - 1 loop
declare
deviceInfo : constant PA_Device_Info := PA_Get_Device_Info (i);
defaultDisplayed : Boolean := False;
inputParameters,
outputParameters : aliased PA_Stream_Parameters;
begin
Put_Line
("--------------------------------------- device #" & i'Image);
-- Mark global and API specific default devices
if i = PA_Get_Default_Input_Device then
Put ("[ Default Input");
defaultDisplayed := True;
elsif i = PA_Get_Host_Api_Info (deviceInfo.hostApi).defaultInputDevice
then
declare
hostInfo : constant PA_Host_Api_Info
:= PA_Get_Host_Api_Info (deviceInfo.hostApi);
begin
Put ("[ Default " & hostInfo.name & " Input");
defaultDisplayed := True;
end;
end if;
if i = PA_Get_Default_Output_Device then
Put ((if defaultDisplayed then "," else "["));
Put (" Default Output");
defaultDisplayed := True;
elsif i = PA_Get_Host_Api_Info (deviceInfo.hostApi).defaultOutputDevice
then
declare
hostInfo : constant PA_Host_Api_Info
:= PA_Get_Host_Api_Info (deviceInfo.hostApi);
begin
Put ((if defaultDisplayed then "," else "["));
Put (" Default " & hostInfo.name & " Output");
defaultDisplayed := True;
end;
end if;
if defaultDisplayed then
Put_Line (" ]");
end if;
-- print device info fields
Put_Line ("Name = " & deviceInfo.name);
Put_Line ("Host API = " &
PA_Get_Host_Api_Info (deviceInfo.hostApi).name);
Put ("Max inputs = " & deviceInfo.maxInputChannels'Image);
Put_Line (", Max outputs = " & deviceInfo.maxOutputChannels'Image);
Put ("Default low input latency = ");
Put (Long_Float (deviceInfo.defaultLowInputLatency), 8, 4, 0);
New_Line;
Put ("Default low output latency = ");
Put (Long_Float (deviceInfo.defaultLowOutputLatency), 8, 4, 0);
New_Line;
Put ("Default high input latency = ");
Put (Long_Float (deviceInfo.defaultHighInputLatency), 8, 4, 0);
New_Line;
Put ("Default high output latency = ");
Put (Long_Float (deviceInfo.defaultHighOutputLatency), 8, 4, 0);
New_Line;
Put ("Default sample rate = ");
Put (Long_Float (deviceInfo.defaultSampleRate), 8, 2, 0);
New_Line;
-- poll for standard sample rates
inputParameters.device := i;
inputParameters.channelCount := deviceInfo.maxInputChannels;
inputParameters.sampleFormat := paInt16;
inputParameters.suggestedLatency := 0.0;
inputParameters.hostApiSpecificStreamInfo := System.Null_Address;
outputParameters.device := i;
outputParameters.channelCount := deviceInfo.maxOutputChannels;
outputParameters.sampleFormat := paInt16;
outputParameters.suggestedLatency := 0.0;
outputParameters.hostApiSpecificStreamInfo := System.Null_Address;
if inputParameters.channelCount > 0 then
Put_Line ("Supported standard sample rates");
Put (" for half-duplex 16 bit ");
Put (inputParameters.channelCount, 0);
Put_Line (" channel input = ");
Print_Supported_Standard_Sample_Rates
(inputParameters'Unchecked_Access,
null);
end if;
if outputParameters.channelCount > 0 then
Put_Line ("Supported standard sample rates");
Put (" for half-duplex 16 bit ");
Put (outputParameters.channelCount, 0);
Put_Line (" channel output = ");
Print_Supported_Standard_Sample_Rates
(null,
outputParameters'Unchecked_Access);
end if;
if inputParameters.channelCount > 0
and then outputParameters.channelCount > 0
then
Put_Line ("Supported standard sample rates");
Put (" for full-duplex 16 bit ");
Put (inputParameters.channelCount, 0);
Put (" channel input, ");
Put (outputParameters.channelCount, 0);
Put_Line (" channel output = ");
Print_Supported_Standard_Sample_Rates
(inputParameters'Unchecked_Access,
outputParameters'Unchecked_Access);
end if;
end;
end loop;
err := PA_Terminate;
exception
when PortAudio_Exception =>
err := PA_Terminate;
Put_Line ("Error number: " & err'Image);
Put_Line ("Error message: " & PA_Get_Error_Text (err));
end PA_Devices;
| 32.15 | 80 | 0.573484 |
312ba850505fded358940f5c62f0f9bbc352f309 | 3,428 | adb | Ada | src/latin_utils/latin_utils-dictionary_package-adjective_entry_io.adb | finleyexp/whitakers-words | 9c07fe7e96ac15dc3262b82a37f6ea69947f458b | [
"FTL"
] | 204 | 2015-06-12T21:22:55.000Z | 2022-03-28T10:50:16.000Z | src/latin_utils/latin_utils-dictionary_package-adjective_entry_io.adb | finleyexp/whitakers-words | 9c07fe7e96ac15dc3262b82a37f6ea69947f458b | [
"FTL"
] | 98 | 2015-06-15T22:17:04.000Z | 2021-10-01T18:17:55.000Z | src/latin_utils/latin_utils-dictionary_package-adjective_entry_io.adb | finleyexp/whitakers-words | 9c07fe7e96ac15dc3262b82a37f6ea69947f458b | [
"FTL"
] | 50 | 2015-06-16T22:42:24.000Z | 2021-12-29T16:53:08.000Z | -- WORDS, a Latin dictionary, by Colonel William Whitaker (USAF, Retired)
--
-- Copyright William A. Whitaker (1936–2010)
--
-- This is a free program, which means it is proper to copy it and pass
-- it on to your friends. Consider it a developmental item for which
-- there is no charge. However, just for form, it is Copyrighted
-- (c). Permission is hereby freely given for any and all use of program
-- and data. You can sell it as your own, but at least tell me.
--
-- This version is distributed without obligation, but the developer
-- would appreciate comments and suggestions.
--
-- All parts of the WORDS system, source code and data files, are made freely
-- available to anyone who wishes to use them, for whatever purpose.
separate (Latin_Utils.Dictionary_Package)
package body Adjective_Entry_IO is
---------------------------------------------------------------------------
procedure Get (File : in Ada.Text_IO.File_Type; Item : out Adjective_Entry)
is
Spacer : Character;
pragma Unreferenced (Spacer);
begin
Decn_Record_IO.Get (File, Item.Decl);
Ada.Text_IO.Get (File, Spacer);
Comparison_Type_IO.Get (File, Item.Co);
end Get;
---------------------------------------------------------------------------
procedure Get (Item : out Adjective_Entry) is
Spacer : Character;
pragma Unreferenced (Spacer);
begin
Decn_Record_IO.Get (Item.Decl);
Ada.Text_IO.Get (Spacer);
Comparison_Type_IO.Get (Item.Co);
end Get;
---------------------------------------------------------------------------
procedure Put (File : in Ada.Text_IO.File_Type; Item : in Adjective_Entry) is
begin
Decn_Record_IO.Put (File, Item.Decl);
Ada.Text_IO.Put (File, ' ');
Comparison_Type_IO.Put (File, Item.Co);
end Put;
---------------------------------------------------------------------------
procedure Put (Item : in Adjective_Entry) is
begin
Decn_Record_IO.Put (Item.Decl);
Ada.Text_IO.Put (' ');
Comparison_Type_IO.Put (Item.Co);
end Put;
---------------------------------------------------------------------------
procedure Get
(Source : in String;
Target : out Adjective_Entry;
Last : out Integer
)
is
-- Used for computing lower bound of substring
Low : Integer := Source'First - 1;
begin
Decn_Record_IO.Get (Source (Low + 1 .. Source'Last), Target.Decl, Low);
Low := Low + 1;
Comparison_Type_IO.Get (Source (Low + 1 .. Source'Last), Target.Co, Last);
end Get;
---------------------------------------------------------------------------
procedure Put (Target : out String; Item : in Adjective_Entry) is
-- These variables are used for computing bounds of substrings
Low : Integer := Target'First - 1;
High : Integer := 0;
begin
-- Put Decn_Record
High := Low + Decn_Record_IO.Default_Width;
Decn_Record_IO.Put (Target (Low + 1 .. High), Item.Decl);
Low := High + 1;
Target (Low) := ' ';
-- Put Comparison_Type
High := Low + Comparison_Type_IO.Default_Width;
Comparison_Type_IO.Put (Target (Low + 1 .. High), Item.Co);
-- Fill remainder of string
Target (High + 1 .. Target'Last) := (others => ' ');
end Put;
---------------------------------------------------------------------------
end Adjective_Entry_IO;
| 33.940594 | 80 | 0.550175 |
12274e71560a07af3f9b649015c1891adeedd642 | 1,641 | ads | Ada | regtests/security-auth-tests.ads | Letractively/ada-security | 027501979a0a154cd5c90d53e601a2ab06336529 | [
"Apache-2.0"
] | 19 | 2015-01-18T23:04:59.000Z | 2021-11-30T10:39:10.000Z | regtests/security-auth-tests.ads | Letractively/ada-security | 027501979a0a154cd5c90d53e601a2ab06336529 | [
"Apache-2.0"
] | 4 | 2020-08-06T15:37:51.000Z | 2022-02-04T20:19:39.000Z | regtests/security-auth-tests.ads | Letractively/ada-security | 027501979a0a154cd5c90d53e601a2ab06336529 | [
"Apache-2.0"
] | 3 | 2021-01-04T10:23:22.000Z | 2022-01-30T21:45:49.000Z | -----------------------------------------------------------------------
-- security-openid - Tests for OpenID
-- Copyright (C) 2009, 2010, 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 Util.Strings.Maps;
with Util.Tests;
package Security.Auth.Tests is
use Ada.Strings.Unbounded;
procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite);
type Test is new Util.Tests.Test with null record;
procedure Test_Discovery (T : in out Test);
procedure Test_Verify_Signature (T : in out Test);
type Test_Parameters is new Security.Auth.Parameters with record
Params : Util.Strings.Maps.Map;
end record;
overriding
function Get_Parameter (Params : in Test_Parameters;
Name : in String) return String;
procedure Set_Parameter (Params : in out Test_Parameters;
Name : in String;
Value : in String);
end Security.Auth.Tests;
| 35.673913 | 76 | 0.631932 |
0b6cb6251a8e49ebbe87bd6c6d429f38f5b8a304 | 2,977 | adb | Ada | source/regions/regions-contexts-environments.adb | reznikmm/declarative-regions | 2e2072aaf5163b49891b24873d179ea61249dd70 | [
"MIT"
] | null | null | null | source/regions/regions-contexts-environments.adb | reznikmm/declarative-regions | 2e2072aaf5163b49891b24873d179ea61249dd70 | [
"MIT"
] | null | null | null | source/regions/regions-contexts-environments.adb | reznikmm/declarative-regions | 2e2072aaf5163b49891b24873d179ea61249dd70 | [
"MIT"
] | null | null | null | -- SPDX-FileCopyrightText: 2022 Max Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Ada.Unchecked_Deallocation;
with Regions.Contexts.Environments.Nodes;
package body Regions.Contexts.Environments is
procedure Free is new Ada.Unchecked_Deallocation
(Regions.Contexts.Environments.Nodes.Environment_Node'Class,
Environment_Node_Access);
type Region_Cursor is new Regions.Entity_Cursor with record
Item : Selected_Entity_Name_Lists.Cursor;
end record;
type Region_Iterator is
new Regions.Entity_Iterator_Interfaces.Forward_Iterator with record
Data : Environment_Node_Access;
end record;
overriding function First (Self : Region_Iterator)
return Regions.Entity_Cursor_Class;
overriding function Next
(Self : Region_Iterator;
Cursor : Regions.Entity_Cursor_Class)
return Regions.Entity_Cursor_Class;
------------
-- Adjust --
------------
procedure Adjust (Self : in out Environment) is
begin
Self.Data.Reference;
end Adjust;
--------------
-- Finalize --
--------------
procedure Finalize (Self : in out Environment) is
Last : Boolean;
begin
Self.Data.Unreference (Last);
if Last then
Free (Self.Data);
end if;
end Finalize;
-----------
-- First --
-----------
overriding function First (Self : Region_Iterator)
return Regions.Entity_Cursor_Class
is
Cursor : constant Selected_Entity_Name_Lists.Cursor :=
Self.Data.Nested.Iterate.First;
begin
if Selected_Entity_Name_Lists.Has_Element (Cursor) then
return Region_Cursor'
(Entity => Self.Data.Get_Entity (Self.Data.Nested (Cursor)),
Left => Self.Data.Nested.Length - 1,
Item => Cursor);
else
return Region_Cursor'(null, 0, Cursor);
end if;
end First;
--------------------
-- Nested_Regions --
--------------------
function Nested_Regions (Self : Environment'Class)
return Regions.Entity_Iterator_Interfaces.Forward_Iterator'Class
is
begin
return Region_Iterator'(Data => Self.Data);
end Nested_Regions;
----------
-- Next --
----------
overriding function Next
(Self : Region_Iterator;
Cursor : Regions.Entity_Cursor_Class)
return Regions.Entity_Cursor_Class
is
Next : constant Selected_Entity_Name_Lists.Cursor :=
Self.Data.Nested.Iterate.Next (Region_Cursor (Cursor).Item);
begin
if Selected_Entity_Name_Lists.Has_Element (Next) then
return Region_Cursor'
(Entity => Self.Data.Get_Entity (Self.Data.Nested (Next)),
Left => Self.Data.Nested.Length - 1,
Item => Next);
else
return Region_Cursor'(null, 0, Selected_Entity_Name_Lists.No_Element);
end if;
end Next;
end Regions.Contexts.Environments;
| 27.063636 | 79 | 0.628485 |
501429d9e9183348119a25491adc9c5d8419d8c5 | 128,655 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/par-ch4.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/par-ch4.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/par-ch4.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- P A R . C H 4 --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. 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. --
-- --
------------------------------------------------------------------------------
pragma Style_Checks (All_Checks);
-- Turn off subprogram body ordering check. Subprograms are in order
-- by RM section rather than alphabetical
with Stringt; use Stringt;
separate (Par)
package body Ch4 is
-- Attributes that cannot have arguments
Is_Parameterless_Attribute : constant Attribute_Class_Array :=
(Attribute_Base => True,
Attribute_Body_Version => True,
Attribute_Class => True,
Attribute_External_Tag => True,
Attribute_Img => True,
Attribute_Loop_Entry => True,
Attribute_Old => True,
Attribute_Result => True,
Attribute_Stub_Type => True,
Attribute_Version => True,
Attribute_Type_Key => True,
others => False);
-- This map contains True for parameterless attributes that return a string
-- or a type. For those attributes, a left parenthesis after the attribute
-- should not be analyzed as the beginning of a parameters list because it
-- may denote a slice operation (X'Img (1 .. 2)) or a type conversion
-- (X'Class (Y)).
-- Note: Loop_Entry is in this list because, although it can take an
-- optional argument (the loop name), we can't distinguish that at parse
-- time from the case where no loop name is given and a legitimate index
-- expression is present. So we parse the argument as an indexed component
-- and the semantic analysis sorts out this syntactic ambiguity based on
-- the type and form of the expression.
-- Note that this map designates the minimum set of attributes where a
-- construct in parentheses that is not an argument can appear right
-- after the attribute. For attributes like 'Size, we do not put them
-- in the map. If someone writes X'Size (3), that's illegal in any case,
-- but we get a better error message by parsing the (3) as an illegal
-- argument to the attribute, rather than some meaningless junk that
-- follows the attribute.
-----------------------
-- Local Subprograms --
-----------------------
function P_Aggregate_Or_Paren_Expr return Node_Id;
function P_Allocator return Node_Id;
function P_Case_Expression_Alternative return Node_Id;
function P_Iterated_Component_Association return Node_Id;
function P_Record_Or_Array_Component_Association return Node_Id;
function P_Factor return Node_Id;
function P_Primary return Node_Id;
function P_Relation return Node_Id;
function P_Term return Node_Id;
function P_Declare_Expression return Node_Id;
function P_Reduction_Attribute_Reference (S : Node_Id)
return Node_Id;
function P_Binary_Adding_Operator return Node_Kind;
function P_Logical_Operator return Node_Kind;
function P_Multiplying_Operator return Node_Kind;
function P_Relational_Operator return Node_Kind;
function P_Unary_Adding_Operator return Node_Kind;
procedure Bad_Range_Attribute (Loc : Source_Ptr);
-- Called to place complaint about bad range attribute at the given
-- source location. Terminates by raising Error_Resync.
procedure Check_Bad_Exp;
-- Called after scanning a**b, posts error if ** detected
procedure P_Membership_Test (N : Node_Id);
-- N is the node for a N_In or N_Not_In node whose right operand has not
-- yet been processed. It is called just after scanning out the IN keyword.
-- On return, either Right_Opnd or Alternatives is set, as appropriate.
function P_Range_Attribute_Reference (Prefix_Node : Node_Id) return Node_Id;
-- Scan a range attribute reference. The caller has scanned out the
-- prefix. The current token is known to be an apostrophe and the
-- following token is known to be RANGE.
function P_Case_Expression return Node_Id;
-- Scans out a case expression. Called with Token pointing to the CASE
-- keyword, and returns pointing to the terminating right parent,
-- semicolon, or comma, but does not consume this terminating token.
function P_Unparen_Cond_Expr_Etc return Node_Id;
-- This function is called with Token pointing to IF, CASE, FOR, or
-- DECLARE, in a context that allows a conditional (if or case) expression,
-- a quantified expression, an iterated component association, or a declare
-- expression, if it is surrounded by parentheses. If not surrounded by
-- parentheses, the expression is still returned, but an error message is
-- issued.
-------------------------
-- Bad_Range_Attribute --
-------------------------
procedure Bad_Range_Attribute (Loc : Source_Ptr) is
begin
Error_Msg ("range attribute cannot be used in expression!", Loc);
Resync_Expression;
end Bad_Range_Attribute;
-------------------
-- Check_Bad_Exp --
-------------------
procedure Check_Bad_Exp is
begin
if Token = Tok_Double_Asterisk then
Error_Msg_SC ("parenthesization required for '*'*");
Scan; -- past **
Discard_Junk_Node (P_Primary);
Check_Bad_Exp;
end if;
end Check_Bad_Exp;
--------------------------
-- 4.1 Name (also 6.4) --
--------------------------
-- NAME ::=
-- DIRECT_NAME | EXPLICIT_DEREFERENCE
-- | INDEXED_COMPONENT | SLICE
-- | SELECTED_COMPONENT | ATTRIBUTE
-- | TYPE_CONVERSION | FUNCTION_CALL
-- | CHARACTER_LITERAL | TARGET_NAME
-- DIRECT_NAME ::= IDENTIFIER | OPERATOR_SYMBOL
-- PREFIX ::= NAME | IMPLICIT_DEREFERENCE
-- EXPLICIT_DEREFERENCE ::= NAME . all
-- IMPLICIT_DEREFERENCE ::= NAME
-- INDEXED_COMPONENT ::= PREFIX (EXPRESSION {, EXPRESSION})
-- SLICE ::= PREFIX (DISCRETE_RANGE)
-- SELECTED_COMPONENT ::= PREFIX . SELECTOR_NAME
-- SELECTOR_NAME ::= IDENTIFIER | CHARACTER_LITERAL | OPERATOR_SYMBOL
-- ATTRIBUTE_REFERENCE ::= PREFIX ' ATTRIBUTE_DESIGNATOR
-- ATTRIBUTE_DESIGNATOR ::=
-- IDENTIFIER [(static_EXPRESSION)]
-- | access | delta | digits
-- FUNCTION_CALL ::=
-- function_NAME
-- | function_PREFIX ACTUAL_PARAMETER_PART
-- ACTUAL_PARAMETER_PART ::=
-- (PARAMETER_ASSOCIATION {,PARAMETER_ASSOCIATION})
-- PARAMETER_ASSOCIATION ::=
-- [formal_parameter_SELECTOR_NAME =>] EXPLICIT_ACTUAL_PARAMETER
-- EXPLICIT_ACTUAL_PARAMETER ::= EXPRESSION | variable_NAME
-- TARGET_NAME ::= @ (AI12-0125-3: abbreviation for LHS)
-- Note: syntactically a procedure call looks just like a function call,
-- so this routine is in practice used to scan out procedure calls as well.
-- On return, Expr_Form is set to either EF_Name or EF_Simple_Name
-- Error recovery: can raise Error_Resync
-- Note: if on return Token = Tok_Apostrophe, then the apostrophe must be
-- followed by either a left paren (qualified expression case), or by
-- range (range attribute case). All other uses of apostrophe (i.e. all
-- other attributes) are handled in this routine.
-- Error recovery: can raise Error_Resync
function P_Name return Node_Id is
Scan_State : Saved_Scan_State;
Name_Node : Node_Id;
Prefix_Node : Node_Id;
Ident_Node : Node_Id;
Expr_Node : Node_Id;
Range_Node : Node_Id;
Arg_Node : Node_Id;
Arg_List : List_Id := No_List; -- kill junk warning
Attr_Name : Name_Id := No_Name; -- kill junk warning
begin
-- Case of not a name
if Token not in Token_Class_Name then
-- If it looks like start of expression, complain and scan expression
if Token in Token_Class_Literal
or else Token = Tok_Left_Paren
then
Error_Msg_SC ("name expected");
return P_Expression;
-- Otherwise some other junk, not much we can do
else
Error_Msg_AP ("name expected");
raise Error_Resync;
end if;
end if;
-- Loop through designators in qualified name
-- AI12-0125 : target_name
if Token = Tok_At_Sign then
Scan_Reserved_Identifier (Force_Msg => False);
if Present (Current_Assign_Node) then
Set_Has_Target_Names (Current_Assign_Node);
end if;
end if;
Name_Node := Token_Node;
loop
Scan; -- past designator
exit when Token /= Tok_Dot;
Save_Scan_State (Scan_State); -- at dot
Scan; -- past dot
-- If we do not have another designator after the dot, then join
-- the normal circuit to handle a dot extension (may be .all or
-- character literal case). Otherwise loop back to scan the next
-- designator.
if Token not in Token_Class_Desig then
goto Scan_Name_Extension_Dot;
else
Prefix_Node := Name_Node;
Name_Node := New_Node (N_Selected_Component, Prev_Token_Ptr);
Set_Prefix (Name_Node, Prefix_Node);
Set_Selector_Name (Name_Node, Token_Node);
end if;
end loop;
-- We have now scanned out a qualified designator. If the last token is
-- an operator symbol, then we certainly do not have the Snam case, so
-- we can just use the normal name extension check circuit
if Prev_Token = Tok_Operator_Symbol then
goto Scan_Name_Extension;
end if;
-- We have scanned out a qualified simple name, check for name
-- extension. Note that we know there is no dot here at this stage,
-- so the only possible cases of name extension are apostrophe followed
-- by '(' or '['.
if Token = Tok_Apostrophe then
Save_Scan_State (Scan_State); -- at apostrophe
Scan; -- past apostrophe
-- Qualified expression in Ada 2012 mode (treated as a name)
if Ada_Version >= Ada_2012
and then Token in Tok_Left_Paren | Tok_Left_Bracket
then
goto Scan_Name_Extension_Apostrophe;
-- If left paren not in Ada 2012, then it is not part of the name,
-- since qualified expressions are not names in prior versions of
-- Ada, so return with Token backed up to point to the apostrophe.
-- The treatment for the range attribute is similar (we do not
-- consider x'range to be a name in this grammar).
elsif Token = Tok_Left_Paren or else Token = Tok_Range then
Restore_Scan_State (Scan_State); -- to apostrophe
Expr_Form := EF_Simple_Name;
return Name_Node;
-- Otherwise we have the case of a name extended by an attribute
else
goto Scan_Name_Extension_Apostrophe;
end if;
-- Check case of qualified simple name extended by a left parenthesis
elsif Token = Tok_Left_Paren then
Scan; -- past left paren
goto Scan_Name_Extension_Left_Paren;
-- Otherwise the qualified simple name is not extended, so return
else
Expr_Form := EF_Simple_Name;
return Name_Node;
end if;
-- Loop scanning past name extensions. A label is used for control
-- transfer for this loop for ease of interfacing with the finite state
-- machine in the parenthesis scanning circuit, and also to allow for
-- passing in control to the appropriate point from the above code.
<<Scan_Name_Extension>>
-- Character literal used as name cannot be extended. Also this
-- cannot be a call, since the name for a call must be a designator.
-- Return in these cases, or if there is no name extension
if Token not in Token_Class_Namext
or else Prev_Token = Tok_Char_Literal
then
Expr_Form := EF_Name;
return Name_Node;
end if;
-- Merge here when we know there is a name extension
<<Scan_Name_Extension_OK>>
if Token = Tok_Left_Paren then
Scan; -- past left paren
goto Scan_Name_Extension_Left_Paren;
elsif Token = Tok_Apostrophe then
Save_Scan_State (Scan_State); -- at apostrophe
Scan; -- past apostrophe
goto Scan_Name_Extension_Apostrophe;
else -- Token = Tok_Dot
Save_Scan_State (Scan_State); -- at dot
Scan; -- past dot
goto Scan_Name_Extension_Dot;
end if;
-- Case of name extended by dot (selection), dot is already skipped
-- and the scan state at the point of the dot is saved in Scan_State.
<<Scan_Name_Extension_Dot>>
-- Explicit dereference case
if Token = Tok_All then
Prefix_Node := Name_Node;
Name_Node := New_Node (N_Explicit_Dereference, Token_Ptr);
Set_Prefix (Name_Node, Prefix_Node);
Scan; -- past ALL
goto Scan_Name_Extension;
-- Selected component case
elsif Token in Token_Class_Name then
Prefix_Node := Name_Node;
Name_Node := New_Node (N_Selected_Component, Prev_Token_Ptr);
Set_Prefix (Name_Node, Prefix_Node);
Set_Selector_Name (Name_Node, Token_Node);
Scan; -- past selector
goto Scan_Name_Extension;
-- Reserved identifier as selector
elsif Is_Reserved_Identifier then
Scan_Reserved_Identifier (Force_Msg => False);
Prefix_Node := Name_Node;
Name_Node := New_Node (N_Selected_Component, Prev_Token_Ptr);
Set_Prefix (Name_Node, Prefix_Node);
Set_Selector_Name (Name_Node, Token_Node);
Scan; -- past identifier used as selector
goto Scan_Name_Extension;
-- If dot is at end of line and followed by nothing legal,
-- then assume end of name and quit (dot will be taken as
-- an incorrect form of some other punctuation by our caller).
elsif Token_Is_At_Start_Of_Line then
Restore_Scan_State (Scan_State);
return Name_Node;
-- Here if nothing legal after the dot
else
Error_Msg_AP ("selector expected");
raise Error_Resync;
end if;
-- Here for an apostrophe as name extension. The scan position at the
-- apostrophe has already been saved, and the apostrophe scanned out.
<<Scan_Name_Extension_Apostrophe>>
Scan_Apostrophe : declare
function Apostrophe_Should_Be_Semicolon return Boolean;
-- Checks for case where apostrophe should probably be
-- a semicolon, and if so, gives appropriate message,
-- resets the scan pointer to the apostrophe, changes
-- the current token to Tok_Semicolon, and returns True.
-- Otherwise returns False.
------------------------------------
-- Apostrophe_Should_Be_Semicolon --
------------------------------------
function Apostrophe_Should_Be_Semicolon return Boolean is
begin
if Token_Is_At_Start_Of_Line then
Restore_Scan_State (Scan_State); -- to apostrophe
Error_Msg_SC ("|""''"" should be "";""");
Token := Tok_Semicolon;
return True;
else
return False;
end if;
end Apostrophe_Should_Be_Semicolon;
-- Start of processing for Scan_Apostrophe
begin
-- Check for qualified expression case in Ada 2012 mode
if Ada_Version >= Ada_2012
and then Token in Tok_Left_Paren | Tok_Left_Bracket
then
Name_Node := P_Qualified_Expression (Name_Node);
goto Scan_Name_Extension;
-- If range attribute after apostrophe, then return with Token
-- pointing to the apostrophe. Note that in this case the prefix
-- need not be a simple name (cases like A.all'range). Similarly
-- if there is a left paren after the apostrophe, then we also
-- return with Token pointing to the apostrophe (this is the
-- aggregate case, or some error case).
elsif Token = Tok_Range or else Token = Tok_Left_Paren then
Restore_Scan_State (Scan_State); -- to apostrophe
Expr_Form := EF_Name;
return Name_Node;
-- Here for cases where attribute designator is an identifier
elsif Token = Tok_Identifier then
Attr_Name := Token_Name;
if not Is_Attribute_Name (Attr_Name) then
if Apostrophe_Should_Be_Semicolon then
Expr_Form := EF_Name;
return Name_Node;
-- Here for a bad attribute name
else
Signal_Bad_Attribute;
Scan; -- past bad identifier
if Token = Tok_Left_Paren then
Scan; -- past left paren
loop
Discard_Junk_Node (P_Expression_If_OK);
exit when not Comma_Present;
end loop;
T_Right_Paren;
end if;
return Error;
end if;
end if;
if Style_Check then
Style.Check_Attribute_Name (False);
end if;
-- Here for case of attribute designator is not an identifier
else
if Token = Tok_Delta then
Attr_Name := Name_Delta;
elsif Token = Tok_Digits then
Attr_Name := Name_Digits;
elsif Token = Tok_Access then
Attr_Name := Name_Access;
elsif Token = Tok_Mod and then Ada_Version >= Ada_95 then
Attr_Name := Name_Mod;
elsif Apostrophe_Should_Be_Semicolon then
Expr_Form := EF_Name;
return Name_Node;
else
Error_Msg_AP ("attribute designator expected");
raise Error_Resync;
end if;
if Style_Check then
Style.Check_Attribute_Name (True);
end if;
end if;
-- We come here with an OK attribute scanned, and corresponding
-- Attribute identifier node stored in Ident_Node.
Prefix_Node := Name_Node;
Name_Node := New_Node (N_Attribute_Reference, Prev_Token_Ptr);
Scan; -- past attribute designator
Set_Prefix (Name_Node, Prefix_Node);
Set_Attribute_Name (Name_Node, Attr_Name);
-- Scan attribute arguments/designator. We skip this if we know
-- that the attribute cannot have an argument (see documentation
-- of Is_Parameterless_Attribute for further details).
if Token = Tok_Left_Paren
and then not
Is_Parameterless_Attribute (Get_Attribute_Id (Attr_Name))
then
-- Attribute Update contains an array or record association
-- list which provides new values for various components or
-- elements. The list is parsed as an aggregate, and we get
-- better error handling by knowing that in the parser.
if Attr_Name = Name_Update then
Set_Expressions (Name_Node, New_List);
Append (P_Aggregate, Expressions (Name_Node));
-- All other cases of parsing attribute arguments
else
Set_Expressions (Name_Node, New_List);
Scan; -- past left paren
loop
declare
Expr : constant Node_Id := P_Expression_If_OK;
Rnam : Node_Id;
begin
-- Case of => for named notation
if Token = Tok_Arrow then
-- Named notation allowed only for the special
-- case of System'Restriction_Set (No_Dependence =>
-- unit_NAME), in which case construct a parameter
-- assocation node and append to the arguments.
if Attr_Name = Name_Restriction_Set
and then Nkind (Expr) = N_Identifier
and then Chars (Expr) = Name_No_Dependence
then
Scan; -- past arrow
Rnam := P_Name;
Append_To (Expressions (Name_Node),
Make_Parameter_Association (Sloc (Rnam),
Selector_Name => Expr,
Explicit_Actual_Parameter => Rnam));
exit;
-- For all other cases named notation is illegal
else
Error_Msg_SC
("named parameters not permitted "
& "for attributes");
Scan; -- past junk arrow
end if;
-- Here for normal case (not => for named parameter)
else
-- Special handling for 'Image in Ada 2012, where
-- the attribute can be parameterless and its value
-- can be the prefix of a slice. Rewrite name as a
-- slice, Expr is its low bound.
if Token = Tok_Dot_Dot
and then Attr_Name = Name_Image
and then Ada_Version >= Ada_2012
then
Set_Expressions (Name_Node, No_List);
Prefix_Node := Name_Node;
Name_Node :=
New_Node (N_Slice, Sloc (Prefix_Node));
Set_Prefix (Name_Node, Prefix_Node);
Range_Node := New_Node (N_Range, Token_Ptr);
Set_Low_Bound (Range_Node, Expr);
Scan; -- past ..
Expr_Node := P_Expression;
Check_Simple_Expression (Expr_Node);
Set_High_Bound (Range_Node, Expr_Node);
Set_Discrete_Range (Name_Node, Range_Node);
T_Right_Paren;
goto Scan_Name_Extension;
else
Append (Expr, Expressions (Name_Node));
exit when not Comma_Present;
end if;
end if;
end;
end loop;
T_Right_Paren;
end if;
end if;
goto Scan_Name_Extension;
end Scan_Apostrophe;
-- Here for left parenthesis extending name (left paren skipped)
<<Scan_Name_Extension_Left_Paren>>
-- We now have to scan through a list of items, terminated by a
-- right parenthesis. The scan is handled by a finite state
-- machine. The possibilities are:
-- (discrete_range)
-- This is a slice. This case is handled in LP_State_Init
-- (expression, expression, ..)
-- This is interpreted as an indexed component, i.e. as a
-- case of a name which can be extended in the normal manner.
-- This case is handled by LP_State_Name or LP_State_Expr.
-- Note: if and case expressions (without an extra level of
-- parentheses) are permitted in this context).
-- (..., identifier => expression , ...)
-- If there is at least one occurrence of identifier => (but
-- none of the other cases apply), then we have a call.
-- Test for Id => case
if Token = Tok_Identifier then
Save_Scan_State (Scan_State); -- at Id
Scan; -- past Id
-- Test for => (allow := as an error substitute)
if Token = Tok_Arrow or else Token = Tok_Colon_Equal then
Restore_Scan_State (Scan_State); -- to Id
Arg_List := New_List;
goto LP_State_Call;
else
Restore_Scan_State (Scan_State); -- to Id
end if;
end if;
-- Here we have an expression after all
Expr_Node := P_Expression_Or_Range_Attribute_If_OK;
-- Check cases of discrete range for a slice
-- First possibility: Range_Attribute_Reference
if Expr_Form = EF_Range_Attr then
Range_Node := Expr_Node;
-- Second possibility: Simple_expression .. Simple_expression
elsif Token = Tok_Dot_Dot then
Check_Simple_Expression (Expr_Node);
Range_Node := New_Node (N_Range, Token_Ptr);
Set_Low_Bound (Range_Node, Expr_Node);
Scan; -- past ..
Expr_Node := P_Expression;
Check_Simple_Expression (Expr_Node);
Set_High_Bound (Range_Node, Expr_Node);
-- Third possibility: Type_name range Range
elsif Token = Tok_Range then
if Expr_Form /= EF_Simple_Name then
Error_Msg_SC ("subtype mark must precede RANGE");
raise Error_Resync;
end if;
Range_Node := P_Subtype_Indication (Expr_Node);
-- Otherwise we just have an expression. It is true that we might
-- have a subtype mark without a range constraint but this case
-- is syntactically indistinguishable from the expression case.
else
Arg_List := New_List;
goto LP_State_Expr;
end if;
-- Fall through here with unmistakable Discrete range scanned,
-- which means that we definitely have the case of a slice. The
-- Discrete range is in Range_Node.
if Token = Tok_Comma then
Error_Msg_SC ("slice cannot have more than one dimension");
raise Error_Resync;
elsif Token /= Tok_Right_Paren then
if Token = Tok_Arrow then
-- This may be an aggregate that is missing a qualification
Error_Msg_SC
("context of aggregate must be a qualified expression");
raise Error_Resync;
else
T_Right_Paren;
raise Error_Resync;
end if;
else
Scan; -- past right paren
Prefix_Node := Name_Node;
Name_Node := New_Node (N_Slice, Sloc (Prefix_Node));
Set_Prefix (Name_Node, Prefix_Node);
Set_Discrete_Range (Name_Node, Range_Node);
-- An operator node is legal as a prefix to other names,
-- but not for a slice.
if Nkind (Prefix_Node) = N_Operator_Symbol then
Error_Msg_N ("illegal prefix for slice", Prefix_Node);
end if;
-- If we have a name extension, go scan it
if Token in Token_Class_Namext then
goto Scan_Name_Extension_OK;
-- Otherwise return (a slice is a name, but is not a call)
else
Expr_Form := EF_Name;
return Name_Node;
end if;
end if;
-- In LP_State_Expr, we have scanned one or more expressions, and
-- so we have a call or an indexed component which is a name. On
-- entry we have the expression just scanned in Expr_Node and
-- Arg_List contains the list of expressions encountered so far
<<LP_State_Expr>>
Append (Expr_Node, Arg_List);
if Token = Tok_Arrow then
Error_Msg
("expect identifier in parameter association", Sloc (Expr_Node));
Scan; -- past arrow
elsif not Comma_Present then
T_Right_Paren;
Prefix_Node := Name_Node;
Name_Node := New_Node (N_Indexed_Component, Sloc (Prefix_Node));
Set_Prefix (Name_Node, Prefix_Node);
Set_Expressions (Name_Node, Arg_List);
goto Scan_Name_Extension;
end if;
-- Comma present (and scanned out), test for identifier => case
-- Test for identifier => case
if Token = Tok_Identifier then
Save_Scan_State (Scan_State); -- at Id
Scan; -- past Id
-- Test for => (allow := as error substitute)
if Token = Tok_Arrow or else Token = Tok_Colon_Equal then
Restore_Scan_State (Scan_State); -- to Id
goto LP_State_Call;
-- Otherwise it's just an expression after all, so backup
else
Restore_Scan_State (Scan_State); -- to Id
end if;
end if;
-- Here we have an expression after all, so stay in this state
Expr_Node := P_Expression_If_OK;
goto LP_State_Expr;
-- LP_State_Call corresponds to the situation in which at least one
-- instance of Id => Expression has been encountered, so we know that
-- we do not have a name, but rather a call. We enter it with the
-- scan pointer pointing to the next argument to scan, and Arg_List
-- containing the list of arguments scanned so far.
<<LP_State_Call>>
-- Test for case of Id => Expression (named parameter)
if Token = Tok_Identifier then
Save_Scan_State (Scan_State); -- at Id
Ident_Node := Token_Node;
Scan; -- past Id
-- Deal with => (allow := as incorrect substitute)
if Token = Tok_Arrow or else Token = Tok_Colon_Equal then
Arg_Node := New_Node (N_Parameter_Association, Prev_Token_Ptr);
Set_Selector_Name (Arg_Node, Ident_Node);
T_Arrow;
Set_Explicit_Actual_Parameter (Arg_Node, P_Expression);
Append (Arg_Node, Arg_List);
-- If a comma follows, go back and scan next entry
if Comma_Present then
goto LP_State_Call;
-- Otherwise we have the end of a call
else
Prefix_Node := Name_Node;
Name_Node := New_Node (N_Function_Call, Sloc (Prefix_Node));
Set_Name (Name_Node, Prefix_Node);
Set_Parameter_Associations (Name_Node, Arg_List);
T_Right_Paren;
if Token in Token_Class_Namext then
goto Scan_Name_Extension_OK;
-- This is a case of a call which cannot be a name
else
Expr_Form := EF_Name;
return Name_Node;
end if;
end if;
-- Not named parameter: Id started an expression after all
else
Restore_Scan_State (Scan_State); -- to Id
end if;
end if;
-- Here if entry did not start with Id => which means that it
-- is a positional parameter, which is not allowed, since we
-- have seen at least one named parameter already.
Error_Msg_SC
("positional parameter association " &
"not allowed after named one");
Expr_Node := P_Expression_If_OK;
-- Leaving the '>' in an association is not unusual, so suggest
-- a possible fix.
if Nkind (Expr_Node) = N_Op_Eq then
Error_Msg_N ("\maybe `='>` was intended", Expr_Node);
end if;
-- We go back to scanning out expressions, so that we do not get
-- multiple error messages when several positional parameters
-- follow a named parameter.
goto LP_State_Expr;
-- End of treatment for name extensions starting with left paren
-- End of loop through name extensions
end P_Name;
-- This function parses a restricted form of Names which are either
-- designators, or designators preceded by a sequence of prefixes
-- that are direct names.
-- Error recovery: cannot raise Error_Resync
function P_Function_Name return Node_Id is
Designator_Node : Node_Id;
Prefix_Node : Node_Id;
Selector_Node : Node_Id;
Dot_Sloc : Source_Ptr := No_Location;
begin
-- Prefix_Node is set to the gathered prefix so far, Empty means that
-- no prefix has been scanned. This allows us to build up the result
-- in the required right recursive manner.
Prefix_Node := Empty;
-- Loop through prefixes
loop
Designator_Node := Token_Node;
if Token not in Token_Class_Desig then
return P_Identifier; -- let P_Identifier issue the error message
else -- Token in Token_Class_Desig
Scan; -- past designator
exit when Token /= Tok_Dot;
end if;
-- Here at a dot, with token just before it in Designator_Node
if No (Prefix_Node) then
Prefix_Node := Designator_Node;
else
Selector_Node := New_Node (N_Selected_Component, Dot_Sloc);
Set_Prefix (Selector_Node, Prefix_Node);
Set_Selector_Name (Selector_Node, Designator_Node);
Prefix_Node := Selector_Node;
end if;
Dot_Sloc := Token_Ptr;
Scan; -- past dot
end loop;
-- Fall out of the loop having just scanned a designator
if No (Prefix_Node) then
return Designator_Node;
else
Selector_Node := New_Node (N_Selected_Component, Dot_Sloc);
Set_Prefix (Selector_Node, Prefix_Node);
Set_Selector_Name (Selector_Node, Designator_Node);
return Selector_Node;
end if;
exception
when Error_Resync =>
return Error;
end P_Function_Name;
-- This function parses a restricted form of Names which are either
-- identifiers, or identifiers preceded by a sequence of prefixes
-- that are direct names.
-- Error recovery: cannot raise Error_Resync
function P_Qualified_Simple_Name return Node_Id is
Designator_Node : Node_Id;
Prefix_Node : Node_Id;
Selector_Node : Node_Id;
Dot_Sloc : Source_Ptr := No_Location;
begin
-- Prefix node is set to the gathered prefix so far, Empty means that
-- no prefix has been scanned. This allows us to build up the result
-- in the required right recursive manner.
Prefix_Node := Empty;
-- Loop through prefixes
loop
Designator_Node := Token_Node;
if Token = Tok_Identifier then
Scan; -- past identifier
exit when Token /= Tok_Dot;
elsif Token not in Token_Class_Desig then
return P_Identifier; -- let P_Identifier issue the error message
else
Scan; -- past designator
if Token /= Tok_Dot then
Error_Msg_SP ("identifier expected");
return Error;
end if;
end if;
-- Here at a dot, with token just before it in Designator_Node
if No (Prefix_Node) then
Prefix_Node := Designator_Node;
else
Selector_Node := New_Node (N_Selected_Component, Dot_Sloc);
Set_Prefix (Selector_Node, Prefix_Node);
Set_Selector_Name (Selector_Node, Designator_Node);
Prefix_Node := Selector_Node;
end if;
Dot_Sloc := Token_Ptr;
Scan; -- past dot
end loop;
-- Fall out of the loop having just scanned an identifier
if No (Prefix_Node) then
return Designator_Node;
else
Selector_Node := New_Node (N_Selected_Component, Dot_Sloc);
Set_Prefix (Selector_Node, Prefix_Node);
Set_Selector_Name (Selector_Node, Designator_Node);
return Selector_Node;
end if;
exception
when Error_Resync =>
return Error;
end P_Qualified_Simple_Name;
-- This procedure differs from P_Qualified_Simple_Name only in that it
-- raises Error_Resync if any error is encountered. It only returns after
-- scanning a valid qualified simple name.
-- Error recovery: can raise Error_Resync
function P_Qualified_Simple_Name_Resync return Node_Id is
Designator_Node : Node_Id;
Prefix_Node : Node_Id;
Selector_Node : Node_Id;
Dot_Sloc : Source_Ptr := No_Location;
begin
Prefix_Node := Empty;
-- Loop through prefixes
loop
Designator_Node := Token_Node;
if Token = Tok_Identifier then
Scan; -- past identifier
exit when Token /= Tok_Dot;
elsif Token not in Token_Class_Desig then
Discard_Junk_Node (P_Identifier); -- to issue the error message
raise Error_Resync;
else
Scan; -- past designator
if Token /= Tok_Dot then
Error_Msg_SP ("identifier expected");
raise Error_Resync;
end if;
end if;
-- Here at a dot, with token just before it in Designator_Node
if No (Prefix_Node) then
Prefix_Node := Designator_Node;
else
Selector_Node := New_Node (N_Selected_Component, Dot_Sloc);
Set_Prefix (Selector_Node, Prefix_Node);
Set_Selector_Name (Selector_Node, Designator_Node);
Prefix_Node := Selector_Node;
end if;
Dot_Sloc := Token_Ptr;
Scan; -- past period
end loop;
-- Fall out of the loop having just scanned an identifier
if No (Prefix_Node) then
return Designator_Node;
else
Selector_Node := New_Node (N_Selected_Component, Dot_Sloc);
Set_Prefix (Selector_Node, Prefix_Node);
Set_Selector_Name (Selector_Node, Designator_Node);
return Selector_Node;
end if;
end P_Qualified_Simple_Name_Resync;
----------------------
-- 4.1 Direct_Name --
----------------------
-- Parsed by P_Name and other functions in section 4.1
-----------------
-- 4.1 Prefix --
-----------------
-- Parsed by P_Name (4.1)
-------------------------------
-- 4.1 Explicit Dereference --
-------------------------------
-- Parsed by P_Name (4.1)
-------------------------------
-- 4.1 Implicit_Dereference --
-------------------------------
-- Parsed by P_Name (4.1)
----------------------------
-- 4.1 Indexed Component --
----------------------------
-- Parsed by P_Name (4.1)
----------------
-- 4.1 Slice --
----------------
-- Parsed by P_Name (4.1)
-----------------------------
-- 4.1 Selected_Component --
-----------------------------
-- Parsed by P_Name (4.1)
------------------------
-- 4.1 Selector Name --
------------------------
-- Parsed by P_Name (4.1)
------------------------------
-- 4.1 Attribute Reference --
------------------------------
-- Parsed by P_Name (4.1)
-------------------------------
-- 4.1 Attribute Designator --
-------------------------------
-- Parsed by P_Name (4.1)
--------------------------------------
-- 4.1.4 Range Attribute Reference --
--------------------------------------
-- RANGE_ATTRIBUTE_REFERENCE ::= PREFIX ' RANGE_ATTRIBUTE_DESIGNATOR
-- RANGE_ATTRIBUTE_DESIGNATOR ::= range [(static_EXPRESSION)]
-- In the grammar, a RANGE attribute is simply a name, but its use is
-- highly restricted, so in the parser, we do not regard it as a name.
-- Instead, P_Name returns without scanning the 'RANGE part of the
-- attribute, and the caller uses the following function to construct
-- a range attribute in places where it is appropriate.
-- Note that RANGE here is treated essentially as an identifier,
-- rather than a reserved word.
-- The caller has parsed the prefix, i.e. a name, and Token points to
-- the apostrophe. The token after the apostrophe is known to be RANGE
-- at this point. The prefix node becomes the prefix of the attribute.
-- Error_Recovery: Cannot raise Error_Resync
function P_Range_Attribute_Reference
(Prefix_Node : Node_Id)
return Node_Id
is
Attr_Node : Node_Id;
begin
Attr_Node := New_Node (N_Attribute_Reference, Token_Ptr);
Set_Prefix (Attr_Node, Prefix_Node);
Scan; -- past apostrophe
if Style_Check then
Style.Check_Attribute_Name (True);
end if;
Set_Attribute_Name (Attr_Node, Name_Range);
Scan; -- past RANGE
if Token = Tok_Left_Paren then
Scan; -- past left paren
Set_Expressions (Attr_Node, New_List (P_Expression_If_OK));
T_Right_Paren;
end if;
return Attr_Node;
end P_Range_Attribute_Reference;
-------------------------------------
-- P_Reduction_Attribute_Reference --
-------------------------------------
function P_Reduction_Attribute_Reference (S : Node_Id)
return Node_Id
is
Attr_Node : Node_Id;
Attr_Name : Name_Id;
begin
Attr_Name := Token_Name;
Scan; -- past Reduce
Attr_Node := New_Node (N_Attribute_Reference, Token_Ptr);
Set_Attribute_Name (Attr_Node, Attr_Name);
if Attr_Name /= Name_Reduce then
Error_Msg ("reduce attribute expected", Prev_Token_Ptr);
end if;
Set_Prefix (Attr_Node, S);
Set_Expressions (Attr_Node, New_List);
T_Left_Paren;
Append (P_Name, Expressions (Attr_Node));
T_Comma;
Append (P_Expression, Expressions (Attr_Node));
T_Right_Paren;
return Attr_Node;
end P_Reduction_Attribute_Reference;
---------------------------------------
-- 4.1.4 Range Attribute Designator --
---------------------------------------
-- Parsed by P_Range_Attribute_Reference (4.4)
---------------------------------------------
-- 4.1.4 (2) Reduction_Attribute_Reference --
---------------------------------------------
-- parsed by P_Reduction_Attribute_Reference
--------------------
-- 4.3 Aggregate --
--------------------
-- AGGREGATE ::= RECORD_AGGREGATE | EXTENSION_AGGREGATE | ARRAY_AGGREGATE
-- Parsed by P_Aggregate_Or_Paren_Expr (4.3), except in the case where
-- an aggregate is known to be required (code statement, extension
-- aggregate), in which cases this routine performs the necessary check
-- that we have an aggregate rather than a parenthesized expression
-- Error recovery: can raise Error_Resync
function P_Aggregate return Node_Id is
Aggr_Sloc : constant Source_Ptr := Token_Ptr;
Aggr_Node : constant Node_Id := P_Aggregate_Or_Paren_Expr;
begin
if Nkind (Aggr_Node) /= N_Aggregate
and then
Nkind (Aggr_Node) /= N_Extension_Aggregate
and then Ada_Version < Ada_2020
then
Error_Msg
("aggregate may not have single positional component", Aggr_Sloc);
return Error;
else
return Aggr_Node;
end if;
end P_Aggregate;
------------------------------------------------
-- 4.3 Aggregate or Parenthesized Expression --
------------------------------------------------
-- This procedure parses out either an aggregate or a parenthesized
-- expression (these two constructs are closely related, since a
-- parenthesized expression looks like an aggregate with a single
-- positional component).
-- AGGREGATE ::=
-- RECORD_AGGREGATE | EXTENSION_AGGREGATE | ARRAY_AGGREGATE
-- RECORD_AGGREGATE ::= (RECORD_COMPONENT_ASSOCIATION_LIST)
-- RECORD_COMPONENT_ASSOCIATION_LIST ::=
-- RECORD_COMPONENT_ASSOCIATION {, RECORD_COMPONENT_ASSOCIATION}
-- | null record
-- RECORD_COMPONENT_ASSOCIATION ::=
-- [COMPONENT_CHOICE_LIST =>] EXPRESSION
-- COMPONENT_CHOICE_LIST ::=
-- component_SELECTOR_NAME {| component_SELECTOR_NAME}
-- | others
-- EXTENSION_AGGREGATE ::=
-- (ANCESTOR_PART with RECORD_COMPONENT_ASSOCIATION_LIST)
-- ANCESTOR_PART ::= EXPRESSION | SUBTYPE_MARK
-- ARRAY_AGGREGATE ::=
-- POSITIONAL_ARRAY_AGGREGATE | NAMED_ARRAY_AGGREGATE
-- POSITIONAL_ARRAY_AGGREGATE ::=
-- (EXPRESSION, EXPRESSION {, EXPRESSION})
-- | (EXPRESSION {, EXPRESSION}, others => EXPRESSION)
-- | (EXPRESSION {, EXPRESSION}, others => <>)
-- NAMED_ARRAY_AGGREGATE ::=
-- (ARRAY_COMPONENT_ASSOCIATION {, ARRAY_COMPONENT_ASSOCIATION})
-- PRIMARY ::= (EXPRESSION);
-- Error recovery: can raise Error_Resync
-- Note: POSITIONAL_ARRAY_AGGREGATE rule has been extended to give support
-- to Ada 2005 limited aggregates (AI-287)
function P_Aggregate_Or_Paren_Expr return Node_Id is
Aggregate_Node : Node_Id;
Expr_List : List_Id;
Assoc_List : List_Id;
Expr_Node : Node_Id;
Lparen_Sloc : Source_Ptr;
Scan_State : Saved_Scan_State;
procedure Box_Error;
-- Called if <> is encountered as positional aggregate element. Issues
-- error message and sets Expr_Node to Error.
function Is_Quantified_Expression return Boolean;
-- The presence of iterated component associations requires a one
-- token lookahead to distinguish it from quantified expressions.
---------------
-- Box_Error --
---------------
procedure Box_Error is
begin
if Ada_Version < Ada_2005 then
Error_Msg_SC ("box in aggregate is an Ada 2005 extension");
end if;
-- Ada 2005 (AI-287): The box notation is allowed only with named
-- notation because positional notation might be error prone. For
-- example, in "(X, <>, Y, <>)", there is no type associated with
-- the boxes, so you might not be leaving out the components you
-- thought you were leaving out.
Error_Msg_SC ("(Ada 2005) box only allowed with named notation");
Scan; -- past box
Expr_Node := Error;
end Box_Error;
------------------------------
-- Is_Quantified_Expression --
------------------------------
function Is_Quantified_Expression return Boolean is
Maybe : Boolean;
Scan_State : Saved_Scan_State;
begin
Save_Scan_State (Scan_State);
Scan; -- past FOR
Maybe := Token = Tok_All or else Token = Tok_Some;
Restore_Scan_State (Scan_State); -- to FOR
return Maybe;
end Is_Quantified_Expression;
Start_Token : constant Token_Type := Token;
-- Used to prevent mismatches (...] and [...)
-- Start of processing for P_Aggregate_Or_Paren_Expr
begin
Lparen_Sloc := Token_Ptr;
if Token = Tok_Left_Bracket then
Scan;
-- Special case for null aggregate in Ada 2020
if Token = Tok_Right_Bracket then
Scan; -- past ]
Aggregate_Node := New_Node (N_Aggregate, Lparen_Sloc);
Set_Expressions (Aggregate_Node, New_List);
Set_Is_Homogeneous_Aggregate (Aggregate_Node);
return Aggregate_Node;
end if;
else
T_Left_Paren;
end if;
-- Note on parentheses count. For cases like an if expression, the
-- parens here really count as real parentheses for the paren count,
-- so we adjust the paren count accordingly after scanning the expr.
-- If expression
if Token = Tok_If then
Expr_Node := P_If_Expression;
T_Right_Paren;
Set_Paren_Count (Expr_Node, Paren_Count (Expr_Node) + 1);
return Expr_Node;
-- Case expression
elsif Token = Tok_Case then
Expr_Node := P_Case_Expression;
T_Right_Paren;
Set_Paren_Count (Expr_Node, Paren_Count (Expr_Node) + 1);
return Expr_Node;
-- Quantified expression
elsif Token = Tok_For and then Is_Quantified_Expression then
Expr_Node := P_Quantified_Expression;
T_Right_Paren;
Set_Paren_Count (Expr_Node, Paren_Count (Expr_Node) + 1);
return Expr_Node;
-- Note: the mechanism used here of rescanning the initial expression
-- is distinctly unpleasant, but it saves a lot of fiddling in scanning
-- out the discrete choice list.
-- Deal with expression and extension aggregates first
elsif Token /= Tok_Others then
Save_Scan_State (Scan_State); -- at start of expression
-- Deal with (NULL RECORD)
if Token = Tok_Null then
Scan; -- past NULL
if Token = Tok_Record then
Aggregate_Node := New_Node (N_Aggregate, Lparen_Sloc);
Set_Null_Record_Present (Aggregate_Node, True);
Scan; -- past RECORD
T_Right_Paren;
return Aggregate_Node;
else
Restore_Scan_State (Scan_State); -- to NULL that must be expr
end if;
elsif Token = Tok_For then
Aggregate_Node := New_Node (N_Aggregate, Lparen_Sloc);
Expr_Node := P_Iterated_Component_Association;
goto Aggregate;
end if;
-- Scan expression, handling box appearing as positional argument
if Token = Tok_Box then
Box_Error;
else
Expr_Node := P_Expression_Or_Range_Attribute_If_OK;
end if;
-- Extension or Delta aggregate
if Token = Tok_With then
if Nkind (Expr_Node) = N_Attribute_Reference
and then Attribute_Name (Expr_Node) = Name_Range
then
Bad_Range_Attribute (Sloc (Expr_Node));
return Error;
end if;
if Ada_Version = Ada_83 then
Error_Msg_SC ("(Ada 83) extension aggregate not allowed");
end if;
Scan; -- past WITH
if Token = Tok_Delta then
Scan; -- past DELTA
Aggregate_Node := New_Node (N_Delta_Aggregate, Lparen_Sloc);
Set_Expression (Aggregate_Node, Expr_Node);
Expr_Node := Empty;
goto Aggregate;
else
Aggregate_Node := New_Node (N_Extension_Aggregate, Lparen_Sloc);
Set_Ancestor_Part (Aggregate_Node, Expr_Node);
end if;
-- Deal with WITH NULL RECORD case
if Token = Tok_Null then
Save_Scan_State (Scan_State); -- at NULL
Scan; -- past NULL
if Token = Tok_Record then
Scan; -- past RECORD
Set_Null_Record_Present (Aggregate_Node, True);
T_Right_Paren;
return Aggregate_Node;
else
Restore_Scan_State (Scan_State); -- to NULL that must be expr
end if;
end if;
if Token /= Tok_Others then
Save_Scan_State (Scan_State);
Expr_Node := P_Expression;
else
Expr_Node := Empty;
end if;
-- Expression
elsif Token = Tok_Right_Paren or else Token in Token_Class_Eterm then
if Nkind (Expr_Node) = N_Attribute_Reference
and then Attribute_Name (Expr_Node) = Name_Range
then
Error_Msg
("|parentheses not allowed for range attribute", Lparen_Sloc);
Scan; -- past right paren
return Expr_Node;
end if;
-- Bump paren count of expression
if Expr_Node /= Error then
Set_Paren_Count (Expr_Node, Paren_Count (Expr_Node) + 1);
end if;
T_Right_Paren; -- past right paren (error message if none)
return Expr_Node;
-- Normal aggregate
else
Aggregate_Node := New_Node (N_Aggregate, Lparen_Sloc);
end if;
-- Others
else
Aggregate_Node := New_Node (N_Aggregate, Lparen_Sloc);
Expr_Node := Empty;
end if;
-- Prepare to scan list of component associations
<<Aggregate>>
Expr_List := No_List; -- don't set yet, maybe all named entries
Assoc_List := No_List; -- don't set yet, maybe all positional entries
-- This loop scans through component associations. On entry to the
-- loop, an expression has been scanned at the start of the current
-- association unless initial token was OTHERS, in which case
-- Expr_Node is set to Empty.
loop
-- Deal with others association first. This is a named association
if No (Expr_Node) then
if No (Assoc_List) then
Assoc_List := New_List;
end if;
Append (P_Record_Or_Array_Component_Association, Assoc_List);
-- Improper use of WITH
elsif Token = Tok_With then
Error_Msg_SC ("WITH must be preceded by single expression in " &
"extension aggregate");
raise Error_Resync;
-- Range attribute can only appear as part of a discrete choice list
elsif Nkind (Expr_Node) = N_Attribute_Reference
and then Attribute_Name (Expr_Node) = Name_Range
and then Token /= Tok_Arrow
and then Token /= Tok_Vertical_Bar
then
Bad_Range_Attribute (Sloc (Expr_Node));
return Error;
-- Assume positional case if comma, right paren, or literal or
-- identifier or OTHERS follows (the latter cases are missing
-- comma cases). Also assume positional if a semicolon follows,
-- which can happen if there are missing parens.
-- In Ada_2012 and Ada_2020 an iterated association can appear.
elsif Nkind (Expr_Node) in
N_Iterated_Component_Association | N_Iterated_Element_Association
then
if No (Assoc_List) then
Assoc_List := New_List (Expr_Node);
else
Append_To (Assoc_List, Expr_Node);
end if;
elsif Token = Tok_Comma
or else Token = Tok_Right_Paren
or else Token = Tok_Others
or else Token in Token_Class_Lit_Or_Name
or else Token = Tok_Semicolon
then
if Present (Assoc_List) then
Error_Msg_BC -- CODEFIX
("""='>"" expected (positional association cannot follow "
& "named association)");
end if;
if No (Expr_List) then
Expr_List := New_List;
end if;
Append (Expr_Node, Expr_List);
-- Check for aggregate followed by left parent, maybe missing comma
elsif Nkind (Expr_Node) = N_Aggregate
and then Token = Tok_Left_Paren
then
T_Comma;
if No (Expr_List) then
Expr_List := New_List;
end if;
Append (Expr_Node, Expr_List);
elsif Token = Tok_Right_Bracket then
if No (Expr_List) then
Expr_List := New_List;
end if;
Append (Expr_Node, Expr_List);
exit;
-- Anything else is assumed to be a named association
else
Restore_Scan_State (Scan_State); -- to start of expression
if No (Assoc_List) then
Assoc_List := New_List;
end if;
Append (P_Record_Or_Array_Component_Association, Assoc_List);
end if;
exit when not Comma_Present;
-- If we are at an expression terminator, something is seriously
-- wrong, so let's get out now, before we start eating up stuff
-- that doesn't belong to us.
if Token in Token_Class_Eterm and then Token /= Tok_For then
Error_Msg_AP
("expecting expression or component association");
exit;
end if;
-- Deal with misused box
if Token = Tok_Box then
Box_Error;
-- Otherwise initiate for reentry to top of loop by scanning an
-- initial expression, unless the first token is OTHERS or FOR,
-- which indicates an iterated component association.
elsif Token = Tok_Others then
Expr_Node := Empty;
elsif Token = Tok_For then
Expr_Node := P_Iterated_Component_Association;
else
Save_Scan_State (Scan_State); -- at start of expression
Expr_Node := P_Expression_Or_Range_Attribute_If_OK;
end if;
end loop;
-- All component associations (positional and named) have been scanned.
-- Scan ] or ) based on Start_Token.
case Start_Token is
when Tok_Left_Bracket =>
Set_Component_Associations (Aggregate_Node, Assoc_List);
Set_Is_Homogeneous_Aggregate (Aggregate_Node);
T_Right_Bracket;
if Token = Tok_Apostrophe then
Scan;
if Token = Tok_Identifier then
return P_Reduction_Attribute_Reference (Aggregate_Node);
end if;
end if;
when Tok_Left_Paren =>
T_Right_Paren;
when others => raise Program_Error;
end case;
if Nkind (Aggregate_Node) /= N_Delta_Aggregate then
Set_Expressions (Aggregate_Node, Expr_List);
end if;
Set_Component_Associations (Aggregate_Node, Assoc_List);
return Aggregate_Node;
end P_Aggregate_Or_Paren_Expr;
------------------------------------------------
-- 4.3 Record or Array Component Association --
------------------------------------------------
-- RECORD_COMPONENT_ASSOCIATION ::=
-- [COMPONENT_CHOICE_LIST =>] EXPRESSION
-- | COMPONENT_CHOICE_LIST => <>
-- COMPONENT_CHOICE_LIST =>
-- component_SELECTOR_NAME {| component_SELECTOR_NAME}
-- | others
-- ARRAY_COMPONENT_ASSOCIATION ::=
-- DISCRETE_CHOICE_LIST => EXPRESSION
-- | DISCRETE_CHOICE_LIST => <>
-- | ITERATED_COMPONENT_ASSOCIATION
-- Note: this routine only handles the named cases, including others.
-- Cases where the component choice list is not present have already
-- been handled directly.
-- Error recovery: can raise Error_Resync
-- Note: RECORD_COMPONENT_ASSOCIATION and ARRAY_COMPONENT_ASSOCIATION
-- rules have been extended to give support to Ada 2005 limited
-- aggregates (AI-287)
function P_Record_Or_Array_Component_Association return Node_Id is
Assoc_Node : Node_Id;
begin
-- A loop indicates an iterated_component_association
if Token = Tok_For then
return P_Iterated_Component_Association;
end if;
Assoc_Node := New_Node (N_Component_Association, Token_Ptr);
Set_Choices (Assoc_Node, P_Discrete_Choice_List);
Set_Sloc (Assoc_Node, Token_Ptr);
TF_Arrow;
if Token = Tok_Box then
-- Ada 2005(AI-287): The box notation is used to indicate the
-- default initialization of aggregate components
if Ada_Version < Ada_2005 then
Error_Msg_SP
("component association with '<'> is an Ada 2005 extension");
Error_Msg_SP ("\unit must be compiled with -gnat05 switch");
end if;
Set_Box_Present (Assoc_Node);
Scan; -- Past box
else
Set_Expression (Assoc_Node, P_Expression);
end if;
return Assoc_Node;
end P_Record_Or_Array_Component_Association;
-----------------------------
-- 4.3.1 Record Aggregate --
-----------------------------
-- Case of enumeration aggregate is parsed by P_Aggregate (4.3)
-- All other cases are parsed by P_Aggregate_Or_Paren_Expr (4.3)
----------------------------------------------
-- 4.3.1 Record Component Association List --
----------------------------------------------
-- Parsed by P_Aggregate_Or_Paren_Expr (4.3)
----------------------------------
-- 4.3.1 Component Choice List --
----------------------------------
-- Parsed by P_Aggregate_Or_Paren_Expr (4.3)
--------------------------------
-- 4.3.1 Extension Aggregate --
--------------------------------
-- Parsed by P_Aggregate_Or_Paren_Expr (4.3)
--------------------------
-- 4.3.1 Ancestor Part --
--------------------------
-- Parsed by P_Aggregate_Or_Paren_Expr (4.3)
----------------------------
-- 4.3.1 Array Aggregate --
----------------------------
-- Parsed by P_Aggregate_Or_Paren_Expr (4.3)
---------------------------------------
-- 4.3.1 Positional Array Aggregate --
---------------------------------------
-- Parsed by P_Aggregate_Or_Paren_Expr (4.3)
----------------------------------
-- 4.3.1 Named Array Aggregate --
----------------------------------
-- Parsed by P_Aggregate_Or_Paren_Expr (4.3)
----------------------------------------
-- 4.3.1 Array Component Association --
----------------------------------------
-- Parsed by P_Aggregate_Or_Paren_Expr (4.3)
---------------------
-- 4.4 Expression --
---------------------
-- This procedure parses EXPRESSION or CHOICE_EXPRESSION
-- EXPRESSION ::=
-- RELATION {LOGICAL_OPERATOR RELATION}
-- CHOICE_EXPRESSION ::=
-- CHOICE_RELATION {LOGICAL_OPERATOR CHOICE_RELATION}
-- LOGICAL_OPERATOR ::= and | and then | or | or else | xor
-- On return, Expr_Form indicates the categorization of the expression
-- EF_Range_Attr is not a possible value (if a range attribute is found,
-- an error message is given, and Error is returned).
-- Error recovery: cannot raise Error_Resync
function P_Expression return Node_Id is
Logical_Op : Node_Kind;
Prev_Logical_Op : Node_Kind;
Op_Location : Source_Ptr;
Node1 : Node_Id;
Node2 : Node_Id;
begin
Node1 := P_Relation;
if Token in Token_Class_Logop then
Prev_Logical_Op := N_Empty;
loop
Op_Location := Token_Ptr;
Logical_Op := P_Logical_Operator;
if Prev_Logical_Op /= N_Empty and then
Logical_Op /= Prev_Logical_Op
then
Error_Msg
("mixed logical operators in expression", Op_Location);
Prev_Logical_Op := N_Empty;
else
Prev_Logical_Op := Logical_Op;
end if;
Node2 := Node1;
Node1 := New_Op_Node (Logical_Op, Op_Location);
Set_Left_Opnd (Node1, Node2);
Set_Right_Opnd (Node1, P_Relation);
-- Check for case of errant comma or semicolon
if Token = Tok_Comma or else Token = Tok_Semicolon then
declare
Com : constant Boolean := Token = Tok_Comma;
Scan_State : Saved_Scan_State;
Logop : Node_Kind;
begin
Save_Scan_State (Scan_State); -- at comma/semicolon
Scan; -- past comma/semicolon
-- Check for AND THEN or OR ELSE after comma/semicolon. We
-- do not deal with AND/OR because those cases get mixed up
-- with the select alternatives case.
if Token = Tok_And or else Token = Tok_Or then
Logop := P_Logical_Operator;
Restore_Scan_State (Scan_State); -- to comma/semicolon
if Logop in N_And_Then | N_Or_Else then
Scan; -- past comma/semicolon
if Com then
Error_Msg_SP -- CODEFIX
("|extra "","" ignored");
else
Error_Msg_SP -- CODEFIX
("|extra "";"" ignored");
end if;
else
Restore_Scan_State (Scan_State); -- to comma/semicolon
end if;
else
Restore_Scan_State (Scan_State); -- to comma/semicolon
end if;
end;
end if;
exit when Token not in Token_Class_Logop;
end loop;
Expr_Form := EF_Non_Simple;
end if;
if Token = Tok_Apostrophe then
Bad_Range_Attribute (Token_Ptr);
return Error;
else
return Node1;
end if;
end P_Expression;
-- This function is identical to the normal P_Expression, except that it
-- also permits the appearance of a case, conditional, or quantified
-- expression if the call immediately follows a left paren, and followed
-- by a right parenthesis. These forms are allowed if these conditions
-- are not met, but an error message will be issued.
function P_Expression_If_OK return Node_Id is
begin
-- Case of conditional, case or quantified expression
if Token = Tok_Case
or else Token = Tok_If
or else Token = Tok_For
or else Token = Tok_Declare
then
return P_Unparen_Cond_Expr_Etc;
-- Normal case, not case/conditional/quantified expression
else
return P_Expression;
end if;
end P_Expression_If_OK;
-- This function is identical to the normal P_Expression, except that it
-- checks that the expression scan did not stop on a right paren. It is
-- called in all contexts where a right parenthesis cannot legitimately
-- follow an expression.
-- Error recovery: cannot raise Error_Resync
function P_Expression_No_Right_Paren return Node_Id is
Expr : constant Node_Id := P_Expression;
begin
Ignore (Tok_Right_Paren);
return Expr;
end P_Expression_No_Right_Paren;
----------------------------------------
-- 4.4 Expression_Or_Range_Attribute --
----------------------------------------
-- EXPRESSION ::=
-- RELATION {and RELATION} | RELATION {and then RELATION}
-- | RELATION {or RELATION} | RELATION {or else RELATION}
-- | RELATION {xor RELATION}
-- RANGE_ATTRIBUTE_REFERENCE ::= PREFIX ' RANGE_ATTRIBUTE_DESIGNATOR
-- RANGE_ATTRIBUTE_DESIGNATOR ::= range [(static_EXPRESSION)]
-- On return, Expr_Form indicates the categorization of the expression
-- and EF_Range_Attr is one of the possibilities.
-- Error recovery: cannot raise Error_Resync
-- In the grammar, a RANGE attribute is simply a name, but its use is
-- highly restricted, so in the parser, we do not regard it as a name.
-- Instead, P_Name returns without scanning the 'RANGE part of the
-- attribute, and P_Expression_Or_Range_Attribute handles the range
-- attribute reference. In the normal case where a range attribute is
-- not allowed, an error message is issued by P_Expression.
function P_Expression_Or_Range_Attribute return Node_Id is
Logical_Op : Node_Kind;
Prev_Logical_Op : Node_Kind;
Op_Location : Source_Ptr;
Node1 : Node_Id;
Node2 : Node_Id;
Attr_Node : Node_Id;
begin
Node1 := P_Relation;
if Token = Tok_Apostrophe then
Attr_Node := P_Range_Attribute_Reference (Node1);
Expr_Form := EF_Range_Attr;
return Attr_Node;
elsif Token in Token_Class_Logop then
Prev_Logical_Op := N_Empty;
loop
Op_Location := Token_Ptr;
Logical_Op := P_Logical_Operator;
if Prev_Logical_Op /= N_Empty and then
Logical_Op /= Prev_Logical_Op
then
Error_Msg
("mixed logical operators in expression", Op_Location);
Prev_Logical_Op := N_Empty;
else
Prev_Logical_Op := Logical_Op;
end if;
Node2 := Node1;
Node1 := New_Op_Node (Logical_Op, Op_Location);
Set_Left_Opnd (Node1, Node2);
Set_Right_Opnd (Node1, P_Relation);
exit when Token not in Token_Class_Logop;
end loop;
Expr_Form := EF_Non_Simple;
end if;
if Token = Tok_Apostrophe then
Bad_Range_Attribute (Token_Ptr);
return Error;
else
return Node1;
end if;
end P_Expression_Or_Range_Attribute;
-- Version that allows a non-parenthesized case, conditional, or quantified
-- expression if the call immediately follows a left paren, and followed
-- by a right parenthesis. These forms are allowed if these conditions
-- are not met, but an error message will be issued.
function P_Expression_Or_Range_Attribute_If_OK return Node_Id is
begin
-- Case of conditional, case or quantified expression
if Token = Tok_Case
or else Token = Tok_If
or else Token = Tok_For
or else Token = Tok_Declare
then
return P_Unparen_Cond_Expr_Etc;
-- Normal case, not one of the above expression types
else
return P_Expression_Or_Range_Attribute;
end if;
end P_Expression_Or_Range_Attribute_If_OK;
-------------------
-- 4.4 Relation --
-------------------
-- This procedure scans both relations and choice relations
-- CHOICE_RELATION ::=
-- SIMPLE_EXPRESSION [RELATIONAL_OPERATOR SIMPLE_EXPRESSION]
-- RELATION ::=
-- SIMPLE_EXPRESSION [not] in MEMBERSHIP_CHOICE_LIST
-- | RAISE_EXPRESSION
-- MEMBERSHIP_CHOICE_LIST ::=
-- MEMBERSHIP_CHOICE {'|' MEMBERSHIP CHOICE}
-- MEMBERSHIP_CHOICE ::=
-- CHOICE_EXPRESSION | RANGE | SUBTYPE_MARK
-- RAISE_EXPRESSION ::= raise exception_NAME [with string_EXPRESSION]
-- On return, Expr_Form indicates the categorization of the expression
-- Note: if Token = Tok_Apostrophe on return, then Expr_Form is set to
-- EF_Simple_Name and the following token is RANGE (range attribute case).
-- Error recovery: cannot raise Error_Resync. If an error occurs within an
-- expression, then tokens are scanned until either a non-expression token,
-- a right paren (not matched by a left paren) or a comma, is encountered.
function P_Relation return Node_Id is
Node1, Node2 : Node_Id;
Optok : Source_Ptr;
begin
-- First check for raise expression
if Token = Tok_Raise then
Expr_Form := EF_Non_Simple;
return P_Raise_Expression;
end if;
-- All other cases
Node1 := P_Simple_Expression;
if Token not in Token_Class_Relop then
return Node1;
else
-- Here we have a relational operator following. If so then scan it
-- out. Note that the assignment symbol := is treated as a relational
-- operator to improve the error recovery when it is misused for =.
-- P_Relational_Operator also parses the IN and NOT IN operations.
Optok := Token_Ptr;
Node2 := New_Op_Node (P_Relational_Operator, Optok);
Set_Left_Opnd (Node2, Node1);
-- Case of IN or NOT IN
if Prev_Token = Tok_In then
P_Membership_Test (Node2);
-- Case of relational operator (= /= < <= > >=)
else
Set_Right_Opnd (Node2, P_Simple_Expression);
end if;
Expr_Form := EF_Non_Simple;
if Token in Token_Class_Relop then
Error_Msg_SC ("unexpected relational operator");
raise Error_Resync;
end if;
return Node2;
end if;
-- If any error occurs, then scan to the next expression terminator symbol
-- or comma or right paren at the outer (i.e. current) parentheses level.
-- The flags are set to indicate a normal simple expression.
exception
when Error_Resync =>
Resync_Expression;
Expr_Form := EF_Simple;
return Error;
end P_Relation;
----------------------------
-- 4.4 Simple Expression --
----------------------------
-- SIMPLE_EXPRESSION ::=
-- [UNARY_ADDING_OPERATOR] TERM {BINARY_ADDING_OPERATOR TERM}
-- On return, Expr_Form indicates the categorization of the expression
-- Note: if Token = Tok_Apostrophe on return, then Expr_Form is set to
-- EF_Simple_Name and the following token is RANGE (range attribute case).
-- Error recovery: cannot raise Error_Resync. If an error occurs within an
-- expression, then tokens are scanned until either a non-expression token,
-- a right paren (not matched by a left paren) or a comma, is encountered.
-- Note: P_Simple_Expression is called only internally by higher level
-- expression routines. In cases in the grammar where a simple expression
-- is required, the approach is to scan an expression, and then post an
-- appropriate error message if the expression obtained is not simple. This
-- gives better error recovery and treatment.
function P_Simple_Expression return Node_Id is
Scan_State : Saved_Scan_State;
Node1 : Node_Id;
Node2 : Node_Id;
Tokptr : Source_Ptr;
function At_Start_Of_Attribute return Boolean;
-- Tests if we have quote followed by attribute name, if so, return True
-- otherwise return False.
---------------------------
-- At_Start_Of_Attribute --
---------------------------
function At_Start_Of_Attribute return Boolean is
begin
if Token /= Tok_Apostrophe then
return False;
else
declare
Scan_State : Saved_Scan_State;
begin
Save_Scan_State (Scan_State);
Scan; -- past quote
if Token = Tok_Identifier
and then Is_Attribute_Name (Chars (Token_Node))
then
Restore_Scan_State (Scan_State);
return True;
else
Restore_Scan_State (Scan_State);
return False;
end if;
end;
end if;
end At_Start_Of_Attribute;
-- Start of processing for P_Simple_Expression
begin
-- Check for cases starting with a name. There are two reasons for
-- special casing. First speed things up by catching a common case
-- without going through several routine layers. Second the caller must
-- be informed via Expr_Form when the simple expression is a name.
if Token in Token_Class_Name then
Node1 := P_Name;
-- Deal with apostrophe cases
if Token = Tok_Apostrophe then
Save_Scan_State (Scan_State); -- at apostrophe
Scan; -- past apostrophe
-- If qualified expression, scan it out and fall through
if Token = Tok_Left_Paren then
Node1 := P_Qualified_Expression (Node1);
Expr_Form := EF_Simple;
-- If range attribute, then we return with Token pointing to the
-- apostrophe. Note: avoid the normal error check on exit. We
-- know that the expression really is complete in this case.
else -- Token = Tok_Range then
Restore_Scan_State (Scan_State); -- to apostrophe
Expr_Form := EF_Simple_Name;
return Node1;
end if;
end if;
-- If an expression terminator follows, the previous processing
-- completely scanned out the expression (a common case), and
-- left Expr_Form set appropriately for returning to our caller.
if Token in Token_Class_Sterm then
null;
-- If we do not have an expression terminator, then complete the
-- scan of a simple expression. This code duplicates the code
-- found in P_Term and P_Factor.
else
if Token = Tok_Double_Asterisk then
if Style_Check then
Style.Check_Exponentiation_Operator;
end if;
Node2 := New_Op_Node (N_Op_Expon, Token_Ptr);
Scan; -- past **
Set_Left_Opnd (Node2, Node1);
Set_Right_Opnd (Node2, P_Primary);
Check_Bad_Exp;
Node1 := Node2;
end if;
loop
exit when Token not in Token_Class_Mulop;
Tokptr := Token_Ptr;
Node2 := New_Op_Node (P_Multiplying_Operator, Tokptr);
if Style_Check then
Style.Check_Binary_Operator;
end if;
Scan; -- past operator
Set_Left_Opnd (Node2, Node1);
Set_Right_Opnd (Node2, P_Factor);
Node1 := Node2;
end loop;
loop
exit when Token not in Token_Class_Binary_Addop;
Tokptr := Token_Ptr;
Node2 := New_Op_Node (P_Binary_Adding_Operator, Tokptr);
if Style_Check then
Style.Check_Binary_Operator;
end if;
Scan; -- past operator
Set_Left_Opnd (Node2, Node1);
Set_Right_Opnd (Node2, P_Term);
Node1 := Node2;
end loop;
Expr_Form := EF_Simple;
end if;
-- Cases where simple expression does not start with a name
else
-- Scan initial sign and initial Term
if Token in Token_Class_Unary_Addop then
Tokptr := Token_Ptr;
Node1 := New_Op_Node (P_Unary_Adding_Operator, Tokptr);
if Style_Check then
Style.Check_Unary_Plus_Or_Minus (Inside_Depends);
end if;
Scan; -- past operator
Set_Right_Opnd (Node1, P_Term);
else
Node1 := P_Term;
end if;
-- In the following, we special-case a sequence of concatenations of
-- string literals, such as "aaa" & "bbb" & ... & "ccc", with nothing
-- else mixed in. For such a sequence, we return a tree representing
-- "" & "aaabbb...ccc" (a single concatenation). This is done only if
-- the number of concatenations is large. If semantic analysis
-- resolves the "&" to a predefined one, then this folding gives the
-- right answer. Otherwise, semantic analysis will complain about a
-- capacity-exceeded error. The purpose of this trick is to avoid
-- creating a deeply nested tree, which would cause deep recursion
-- during semantics, causing stack overflow. This way, we can handle
-- enormous concatenations in the normal case of predefined "&". We
-- first build up the normal tree, and then rewrite it if
-- appropriate.
declare
Num_Concats_Threshold : constant Positive := 1000;
-- Arbitrary threshold value to enable optimization
First_Node : constant Node_Id := Node1;
Is_Strlit_Concat : Boolean;
-- True iff we've parsed a sequence of concatenations of string
-- literals, with nothing else mixed in.
Num_Concats : Natural;
-- Number of "&" operators if Is_Strlit_Concat is True
begin
Is_Strlit_Concat :=
Nkind (Node1) = N_String_Literal
and then Token = Tok_Ampersand;
Num_Concats := 0;
-- Scan out sequence of terms separated by binary adding operators
loop
exit when Token not in Token_Class_Binary_Addop;
Tokptr := Token_Ptr;
Node2 := New_Op_Node (P_Binary_Adding_Operator, Tokptr);
if Style_Check and then not Debug_Flag_Dot_QQ then
Style.Check_Binary_Operator;
end if;
Scan; -- past operator
Set_Left_Opnd (Node2, Node1);
Node1 := P_Term;
Set_Right_Opnd (Node2, Node1);
-- Check if we're still concatenating string literals
Is_Strlit_Concat :=
Is_Strlit_Concat
and then Nkind (Node2) = N_Op_Concat
and then Nkind (Node1) = N_String_Literal;
if Is_Strlit_Concat then
Num_Concats := Num_Concats + 1;
end if;
Node1 := Node2;
end loop;
-- If we have an enormous series of concatenations of string
-- literals, rewrite as explained above. The Is_Folded_In_Parser
-- flag tells semantic analysis that if the "&" is not predefined,
-- the folded value is wrong.
if Is_Strlit_Concat
and then Num_Concats >= Num_Concats_Threshold
then
declare
Empty_String_Val : String_Id;
-- String_Id for ""
Strlit_Concat_Val : String_Id;
-- Contains the folded value (which will be correct if the
-- "&" operators are the predefined ones).
Cur_Node : Node_Id;
-- For walking up the tree
New_Node : Node_Id;
-- Folded node to replace Node1
Loc : constant Source_Ptr := Sloc (First_Node);
begin
-- Walk up the tree starting at the leftmost string literal
-- (First_Node), building up the Strlit_Concat_Val as we
-- go. Note that we do not use recursion here -- the whole
-- point is to avoid recursively walking that enormous tree.
Start_String;
Store_String_Chars (Strval (First_Node));
Cur_Node := Parent (First_Node);
while Present (Cur_Node) loop
pragma Assert (Nkind (Cur_Node) = N_Op_Concat and then
Nkind (Right_Opnd (Cur_Node)) = N_String_Literal);
Store_String_Chars (Strval (Right_Opnd (Cur_Node)));
Cur_Node := Parent (Cur_Node);
end loop;
Strlit_Concat_Val := End_String;
-- Create new folded node, and rewrite result with a concat-
-- enation of an empty string literal and the folded node.
Start_String;
Empty_String_Val := End_String;
New_Node :=
Make_Op_Concat (Loc,
Make_String_Literal (Loc, Empty_String_Val),
Make_String_Literal (Loc, Strlit_Concat_Val,
Is_Folded_In_Parser => True));
Rewrite (Node1, New_Node);
end;
end if;
end;
-- All done, we clearly do not have name or numeric literal so this
-- is a case of a simple expression which is some other possibility.
Expr_Form := EF_Simple;
end if;
-- Come here at end of simple expression, where we do a couple of
-- special checks to improve error recovery.
-- Special test to improve error recovery. If the current token is a
-- period, then someone is trying to do selection on something that is
-- not a name, e.g. a qualified expression.
if Token = Tok_Dot then
Error_Msg_SC ("prefix for selection is not a name");
-- If qualified expression, comment and continue, otherwise something
-- is pretty nasty so do an Error_Resync call.
if Ada_Version < Ada_2012
and then Nkind (Node1) = N_Qualified_Expression
then
Error_Msg_SC ("\would be legal in Ada 2012 mode");
else
raise Error_Resync;
end if;
end if;
-- Special test to improve error recovery: If the current token is
-- not the first token on a line (as determined by checking the
-- previous token position with the start of the current line),
-- then we insist that we have an appropriate terminating token.
-- Consider the following two examples:
-- 1) if A nad B then ...
-- 2) A := B
-- C := D
-- In the first example, we would like to issue a binary operator
-- expected message and resynchronize to the then. In the second
-- example, we do not want to issue a binary operator message, so
-- that instead we will get the missing semicolon message. This
-- distinction is of course a heuristic which does not always work,
-- but in practice it is quite effective.
-- Note: the one case in which we do not go through this circuit is
-- when we have scanned a range attribute and want to return with
-- Token pointing to the apostrophe. The apostrophe is not normally
-- an expression terminator, and is not in Token_Class_Sterm, but
-- in this special case we know that the expression is complete.
if not Token_Is_At_Start_Of_Line
and then Token not in Token_Class_Sterm
then
-- Normally the right error message is indeed that we expected a
-- binary operator, but in the case of being between a right and left
-- paren, e.g. in an aggregate, a more likely error is missing comma.
if Prev_Token = Tok_Right_Paren and then Token = Tok_Left_Paren then
T_Comma;
-- And if we have a quote, we may have a bad attribute
elsif At_Start_Of_Attribute then
Error_Msg_SC ("prefix of attribute must be a name");
if Ada_Version >= Ada_2012 then
Error_Msg_SC ("\qualify expression to turn it into a name");
end if;
-- Normal case for binary operator expected message
else
Error_Msg_AP ("binary operator expected");
end if;
raise Error_Resync;
else
return Node1;
end if;
-- If any error occurs, then scan to next expression terminator symbol
-- or comma, right paren or vertical bar at the outer (i.e. current) paren
-- level. Expr_Form is set to indicate a normal simple expression.
exception
when Error_Resync =>
Resync_Expression;
Expr_Form := EF_Simple;
return Error;
end P_Simple_Expression;
-----------------------------------------------
-- 4.4 Simple Expression or Range Attribute --
-----------------------------------------------
-- SIMPLE_EXPRESSION ::=
-- [UNARY_ADDING_OPERATOR] TERM {BINARY_ADDING_OPERATOR TERM}
-- RANGE_ATTRIBUTE_REFERENCE ::= PREFIX ' RANGE_ATTRIBUTE_DESIGNATOR
-- RANGE_ATTRIBUTE_DESIGNATOR ::= range [(static_EXPRESSION)]
-- Error recovery: cannot raise Error_Resync
function P_Simple_Expression_Or_Range_Attribute return Node_Id is
Sexpr : Node_Id;
Attr_Node : Node_Id;
begin
-- We don't just want to roar ahead and call P_Simple_Expression
-- here, since we want to handle the case of a parenthesized range
-- attribute cleanly.
if Token = Tok_Left_Paren then
declare
Lptr : constant Source_Ptr := Token_Ptr;
Scan_State : Saved_Scan_State;
begin
Save_Scan_State (Scan_State);
Scan; -- past left paren
Sexpr := P_Simple_Expression;
if Token = Tok_Apostrophe then
Attr_Node := P_Range_Attribute_Reference (Sexpr);
Expr_Form := EF_Range_Attr;
if Token = Tok_Right_Paren then
Scan; -- scan past right paren if present
end if;
Error_Msg ("parentheses not allowed for range attribute", Lptr);
return Attr_Node;
end if;
Restore_Scan_State (Scan_State);
end;
end if;
-- Here after dealing with parenthesized range attribute
Sexpr := P_Simple_Expression;
if Token = Tok_Apostrophe then
Attr_Node := P_Range_Attribute_Reference (Sexpr);
Expr_Form := EF_Range_Attr;
return Attr_Node;
else
return Sexpr;
end if;
end P_Simple_Expression_Or_Range_Attribute;
---------------
-- 4.4 Term --
---------------
-- TERM ::= FACTOR {MULTIPLYING_OPERATOR FACTOR}
-- Error recovery: can raise Error_Resync
function P_Term return Node_Id is
Node1, Node2 : Node_Id;
Tokptr : Source_Ptr;
begin
Node1 := P_Factor;
loop
exit when Token not in Token_Class_Mulop;
Tokptr := Token_Ptr;
Node2 := New_Op_Node (P_Multiplying_Operator, Tokptr);
if Style_Check and then not Debug_Flag_Dot_QQ then
Style.Check_Binary_Operator;
end if;
Scan; -- past operator
Set_Left_Opnd (Node2, Node1);
Set_Right_Opnd (Node2, P_Factor);
Node1 := Node2;
end loop;
return Node1;
end P_Term;
-----------------
-- 4.4 Factor --
-----------------
-- FACTOR ::= PRIMARY [** PRIMARY] | abs PRIMARY | not PRIMARY
-- Error recovery: can raise Error_Resync
function P_Factor return Node_Id is
Node1 : Node_Id;
Node2 : Node_Id;
begin
if Token = Tok_Abs then
Node1 := New_Op_Node (N_Op_Abs, Token_Ptr);
if Style_Check then
Style.Check_Abs_Not;
end if;
Scan; -- past ABS
Set_Right_Opnd (Node1, P_Primary);
return Node1;
elsif Token = Tok_Not then
Node1 := New_Op_Node (N_Op_Not, Token_Ptr);
if Style_Check then
Style.Check_Abs_Not;
end if;
Scan; -- past NOT
Set_Right_Opnd (Node1, P_Primary);
return Node1;
else
Node1 := P_Primary;
if Token = Tok_Double_Asterisk then
Node2 := New_Op_Node (N_Op_Expon, Token_Ptr);
Scan; -- past **
Set_Left_Opnd (Node2, Node1);
Set_Right_Opnd (Node2, P_Primary);
Check_Bad_Exp;
return Node2;
else
return Node1;
end if;
end if;
end P_Factor;
------------------
-- 4.4 Primary --
------------------
-- PRIMARY ::=
-- NUMERIC_LITERAL | null
-- | STRING_LITERAL | AGGREGATE
-- | NAME | QUALIFIED_EXPRESSION
-- | ALLOCATOR | (EXPRESSION) | QUANTIFIED_EXPRESSION
-- | REDUCTION_ATTRIBUTE_REFERENCE
-- Error recovery: can raise Error_Resync
function P_Primary return Node_Id is
Scan_State : Saved_Scan_State;
Node1 : Node_Id;
Lparen : constant Boolean := Prev_Token = Tok_Left_Paren;
-- Remember if previous token is a left parenthesis. This is used to
-- deal with checking whether IF/CASE/FOR expressions appearing as
-- primaries require extra parenthesization.
begin
-- The loop runs more than once only if misplaced pragmas are found
-- or if a misplaced unary minus is skipped.
loop
case Token is
-- Name token can start a name, call or qualified expression, all
-- of which are acceptable possibilities for primary. Note also
-- that string literal is included in name (as operator symbol)
-- and type conversion is included in name (as indexed component).
when Tok_Char_Literal
| Tok_Identifier
| Tok_Operator_Symbol
=>
Node1 := P_Name;
-- All done unless apostrophe follows
if Token /= Tok_Apostrophe then
return Node1;
-- Apostrophe following means that we have either just parsed
-- the subtype mark of a qualified expression, or the prefix
-- or a range attribute.
else -- Token = Tok_Apostrophe
Save_Scan_State (Scan_State); -- at apostrophe
Scan; -- past apostrophe
-- If range attribute, then this is always an error, since
-- the only legitimate case (where the scanned expression is
-- a qualified simple name) is handled at the level of the
-- Simple_Expression processing. This case corresponds to a
-- usage such as 3 + A'Range, which is always illegal.
if Token = Tok_Range then
Restore_Scan_State (Scan_State); -- to apostrophe
Bad_Range_Attribute (Token_Ptr);
return Error;
-- If left paren, then we have a qualified expression.
-- Note that P_Name guarantees that in this case, where
-- Token = Tok_Apostrophe on return, the only two possible
-- tokens following the apostrophe are left paren and
-- RANGE, so we know we have a left paren here.
else -- Token = Tok_Left_Paren
return P_Qualified_Expression (Node1);
end if;
end if;
-- Numeric or string literal
when Tok_Integer_Literal
| Tok_Real_Literal
| Tok_String_Literal
=>
Node1 := Token_Node;
Scan; -- past number
return Node1;
-- Left paren, starts aggregate or parenthesized expression
when Tok_Left_Paren =>
declare
Expr : constant Node_Id := P_Aggregate_Or_Paren_Expr;
begin
if Nkind (Expr) = N_Attribute_Reference
and then Attribute_Name (Expr) = Name_Range
then
Bad_Range_Attribute (Sloc (Expr));
end if;
return Expr;
end;
when Tok_Left_Bracket =>
return P_Aggregate;
-- Allocator
when Tok_New =>
return P_Allocator;
-- Null
when Tok_Null =>
Scan; -- past NULL
return New_Node (N_Null, Prev_Token_Ptr);
-- Pragma, not allowed here, so just skip past it
when Tok_Pragma =>
P_Pragmas_Misplaced;
-- Deal with IF (possible unparenthesized if expression)
when Tok_If =>
-- If this looks like a real if, defined as an IF appearing at
-- the start of a new line, then we consider we have a missing
-- operand. If in Ada 2012 and the IF is not properly indented
-- for a statement, we prefer to issue a message about an ill-
-- parenthesized if expression.
if Token_Is_At_Start_Of_Line
and then not
(Ada_Version >= Ada_2012
and then Style_Check_Indentation /= 0
and then Start_Column rem Style_Check_Indentation /= 0)
then
Error_Msg_AP ("missing operand");
return Error;
-- If this looks like an if expression, then treat it that way
-- with an error message if not explicitly surrounded by
-- parentheses.
elsif Ada_Version >= Ada_2012 then
Node1 := P_If_Expression;
if not (Lparen and then Token = Tok_Right_Paren) then
Error_Msg
("if expression must be parenthesized", Sloc (Node1));
end if;
return Node1;
-- Otherwise treat as misused identifier
else
return P_Identifier;
end if;
-- Deal with CASE (possible unparenthesized case expression)
when Tok_Case =>
-- If this looks like a real case, defined as a CASE appearing
-- the start of a new line, then we consider we have a missing
-- operand. If in Ada 2012 and the CASE is not properly
-- indented for a statement, we prefer to issue a message about
-- an ill-parenthesized case expression.
if Token_Is_At_Start_Of_Line
and then not
(Ada_Version >= Ada_2012
and then Style_Check_Indentation /= 0
and then Start_Column rem Style_Check_Indentation /= 0)
then
Error_Msg_AP ("missing operand");
return Error;
-- If this looks like a case expression, then treat it that way
-- with an error message if not within parentheses.
elsif Ada_Version >= Ada_2012 then
Node1 := P_Case_Expression;
if not (Lparen and then Token = Tok_Right_Paren) then
Error_Msg
("case expression must be parenthesized", Sloc (Node1));
end if;
return Node1;
-- Otherwise treat as misused identifier
else
return P_Identifier;
end if;
-- For [all | some] indicates a quantified expression
when Tok_For =>
if Token_Is_At_Start_Of_Line then
Error_Msg_AP ("misplaced loop");
return Error;
elsif Ada_Version >= Ada_2012 then
Save_Scan_State (Scan_State);
Scan; -- past FOR
if Token = Tok_All or else Token = Tok_Some then
Restore_Scan_State (Scan_State); -- To FOR
Node1 := P_Quantified_Expression;
if not (Lparen and then Token = Tok_Right_Paren) then
Error_Msg
("quantified expression must be parenthesized",
Sloc (Node1));
end if;
else
Restore_Scan_State (Scan_State); -- To FOR
Node1 := P_Iterated_Component_Association;
end if;
return Node1;
-- Otherwise treat as misused identifier
else
return P_Identifier;
end if;
-- Minus may well be an improper attempt at a unary minus. Give
-- a message, skip the minus and keep going.
when Tok_Minus =>
Error_Msg_SC ("parentheses required for unary minus");
Scan; -- past minus
when Tok_At_Sign => -- AI12-0125 : target_name
if Ada_Version < Ada_2020 then
Error_Msg_SC ("target name is an Ada 202x feature");
Error_Msg_SC ("\compile with -gnat2020");
end if;
Node1 := P_Name;
return Node1;
-- Anything else is illegal as the first token of a primary, but
-- we test for some common errors, to improve error messages.
when others =>
if Is_Reserved_Identifier then
return P_Identifier;
elsif Prev_Token = Tok_Comma then
Error_Msg_SP -- CODEFIX
("|extra "","" ignored");
raise Error_Resync;
else
Error_Msg_AP ("missing operand");
raise Error_Resync;
end if;
end case;
end loop;
end P_Primary;
-------------------------------
-- 4.4 Quantified_Expression --
-------------------------------
-- QUANTIFIED_EXPRESSION ::=
-- for QUANTIFIER LOOP_PARAMETER_SPECIFICATION => PREDICATE |
-- for QUANTIFIER ITERATOR_SPECIFICATION => PREDICATE
function P_Quantified_Expression return Node_Id is
I_Spec : Node_Id;
Node1 : Node_Id;
begin
Error_Msg_Ada_2012_Feature ("quantified expression", Token_Ptr);
Scan; -- past FOR
Node1 := New_Node (N_Quantified_Expression, Prev_Token_Ptr);
if Token = Tok_All then
Set_All_Present (Node1);
elsif Token /= Tok_Some then
Error_Msg_AP ("missing quantifier");
raise Error_Resync;
end if;
Scan; -- past ALL or SOME
I_Spec := P_Loop_Parameter_Specification;
if Nkind (I_Spec) = N_Loop_Parameter_Specification then
Set_Loop_Parameter_Specification (Node1, I_Spec);
else
Set_Iterator_Specification (Node1, I_Spec);
end if;
if Token = Tok_Arrow then
Scan;
Set_Condition (Node1, P_Expression);
return Node1;
else
Error_Msg_AP ("missing arrow");
raise Error_Resync;
end if;
end P_Quantified_Expression;
---------------------------
-- 4.5 Logical Operator --
---------------------------
-- LOGICAL_OPERATOR ::= and | or | xor
-- Note: AND THEN and OR ELSE are also treated as logical operators
-- by the parser (even though they are not operators semantically)
-- The value returned is the appropriate Node_Kind code for the operator
-- On return, Token points to the token following the scanned operator.
-- The caller has checked that the first token is a legitimate logical
-- operator token (i.e. is either XOR, AND, OR).
-- Error recovery: cannot raise Error_Resync
function P_Logical_Operator return Node_Kind is
begin
if Token = Tok_And then
if Style_Check then
Style.Check_Binary_Operator;
end if;
Scan; -- past AND
if Token = Tok_Then then
Scan; -- past THEN
return N_And_Then;
else
return N_Op_And;
end if;
elsif Token = Tok_Or then
if Style_Check then
Style.Check_Binary_Operator;
end if;
Scan; -- past OR
if Token = Tok_Else then
Scan; -- past ELSE
return N_Or_Else;
else
return N_Op_Or;
end if;
else -- Token = Tok_Xor
if Style_Check then
Style.Check_Binary_Operator;
end if;
Scan; -- past XOR
return N_Op_Xor;
end if;
end P_Logical_Operator;
------------------------------
-- 4.5 Relational Operator --
------------------------------
-- RELATIONAL_OPERATOR ::= = | /= | < | <= | > | >=
-- The value returned is the appropriate Node_Kind code for the operator.
-- On return, Token points to the operator token, NOT past it.
-- The caller has checked that the first token is a legitimate relational
-- operator token (i.e. is one of the operator tokens listed above).
-- Error recovery: cannot raise Error_Resync
function P_Relational_Operator return Node_Kind is
Op_Kind : Node_Kind;
Relop_Node : constant array (Token_Class_Relop) of Node_Kind :=
(Tok_Less => N_Op_Lt,
Tok_Equal => N_Op_Eq,
Tok_Greater => N_Op_Gt,
Tok_Not_Equal => N_Op_Ne,
Tok_Greater_Equal => N_Op_Ge,
Tok_Less_Equal => N_Op_Le,
Tok_In => N_In,
Tok_Not => N_Not_In,
Tok_Box => N_Op_Ne);
begin
if Token = Tok_Box then
Error_Msg_SC -- CODEFIX
("|""'<'>"" should be ""/=""");
end if;
Op_Kind := Relop_Node (Token);
if Style_Check then
Style.Check_Binary_Operator;
end if;
Scan; -- past operator token
-- Deal with NOT IN, if previous token was NOT, we must have IN now
if Prev_Token = Tok_Not then
-- Style check, for NOT IN, we require one space between NOT and IN
if Style_Check and then Token = Tok_In then
Style.Check_Not_In;
end if;
T_In;
end if;
return Op_Kind;
end P_Relational_Operator;
---------------------------------
-- 4.5 Binary Adding Operator --
---------------------------------
-- BINARY_ADDING_OPERATOR ::= + | - | &
-- The value returned is the appropriate Node_Kind code for the operator.
-- On return, Token points to the operator token (NOT past it).
-- The caller has checked that the first token is a legitimate adding
-- operator token (i.e. is one of the operator tokens listed above).
-- Error recovery: cannot raise Error_Resync
function P_Binary_Adding_Operator return Node_Kind is
Addop_Node : constant array (Token_Class_Binary_Addop) of Node_Kind :=
(Tok_Ampersand => N_Op_Concat,
Tok_Minus => N_Op_Subtract,
Tok_Plus => N_Op_Add);
begin
return Addop_Node (Token);
end P_Binary_Adding_Operator;
--------------------------------
-- 4.5 Unary Adding Operator --
--------------------------------
-- UNARY_ADDING_OPERATOR ::= + | -
-- The value returned is the appropriate Node_Kind code for the operator.
-- On return, Token points to the operator token (NOT past it).
-- The caller has checked that the first token is a legitimate adding
-- operator token (i.e. is one of the operator tokens listed above).
-- Error recovery: cannot raise Error_Resync
function P_Unary_Adding_Operator return Node_Kind is
Addop_Node : constant array (Token_Class_Unary_Addop) of Node_Kind :=
(Tok_Minus => N_Op_Minus,
Tok_Plus => N_Op_Plus);
begin
return Addop_Node (Token);
end P_Unary_Adding_Operator;
-------------------------------
-- 4.5 Multiplying Operator --
-------------------------------
-- MULTIPLYING_OPERATOR ::= * | / | mod | rem
-- The value returned is the appropriate Node_Kind code for the operator.
-- On return, Token points to the operator token (NOT past it).
-- The caller has checked that the first token is a legitimate multiplying
-- operator token (i.e. is one of the operator tokens listed above).
-- Error recovery: cannot raise Error_Resync
function P_Multiplying_Operator return Node_Kind is
Mulop_Node : constant array (Token_Class_Mulop) of Node_Kind :=
(Tok_Asterisk => N_Op_Multiply,
Tok_Mod => N_Op_Mod,
Tok_Rem => N_Op_Rem,
Tok_Slash => N_Op_Divide);
begin
return Mulop_Node (Token);
end P_Multiplying_Operator;
--------------------------------------
-- 4.5 Highest Precedence Operator --
--------------------------------------
-- Parsed by P_Factor (4.4)
-- Note: this rule is not in fact used by the grammar at any point
--------------------------
-- 4.6 Type Conversion --
--------------------------
-- Parsed by P_Primary as a Name (4.1)
-------------------------------
-- 4.7 Qualified Expression --
-------------------------------
-- QUALIFIED_EXPRESSION ::=
-- SUBTYPE_MARK ' (EXPRESSION) | SUBTYPE_MARK ' AGGREGATE
-- The caller has scanned the name which is the Subtype_Mark parameter
-- and scanned past the single quote following the subtype mark. The
-- caller has not checked that this name is in fact appropriate for
-- a subtype mark name (i.e. it is a selected component or identifier).
-- Error_Recovery: cannot raise Error_Resync
function P_Qualified_Expression (Subtype_Mark : Node_Id) return Node_Id is
Qual_Node : Node_Id;
begin
Qual_Node := New_Node (N_Qualified_Expression, Prev_Token_Ptr);
Set_Subtype_Mark (Qual_Node, Check_Subtype_Mark (Subtype_Mark));
Set_Expression (Qual_Node, P_Aggregate_Or_Paren_Expr);
return Qual_Node;
end P_Qualified_Expression;
--------------------
-- 4.8 Allocator --
--------------------
-- ALLOCATOR ::=
-- new [SUBPOOL_SPECIFICATION] SUBTYPE_INDICATION
-- | new [SUBPOOL_SPECIFICATION] QUALIFIED_EXPRESSION
--
-- SUBPOOL_SPECIFICATION ::= (subpool_handle_NAME)
-- The caller has checked that the initial token is NEW
-- Error recovery: can raise Error_Resync
function P_Allocator return Node_Id is
Alloc_Node : Node_Id;
Type_Node : Node_Id;
Null_Exclusion_Present : Boolean;
begin
Alloc_Node := New_Node (N_Allocator, Token_Ptr);
T_New;
-- Scan subpool_specification if present (Ada 2012 (AI05-0111-3))
-- Scan Null_Exclusion if present (Ada 2005 (AI-231))
if Token = Tok_Left_Paren then
Scan; -- past (
Set_Subpool_Handle_Name (Alloc_Node, P_Name);
T_Right_Paren;
Error_Msg_Ada_2012_Feature
("|subpool specification",
Sloc (Subpool_Handle_Name (Alloc_Node)));
end if;
Null_Exclusion_Present := P_Null_Exclusion;
Set_Null_Exclusion_Present (Alloc_Node, Null_Exclusion_Present);
Type_Node := P_Subtype_Mark_Resync;
if Token = Tok_Apostrophe then
Scan; -- past apostrophe
Set_Expression (Alloc_Node, P_Qualified_Expression (Type_Node));
else
Set_Expression
(Alloc_Node,
P_Subtype_Indication (Type_Node, Null_Exclusion_Present));
-- AI05-0104: An explicit null exclusion is not allowed for an
-- allocator without initialization. In previous versions of the
-- language it just raises constraint error.
if Ada_Version >= Ada_2012 and then Null_Exclusion_Present then
Error_Msg_N
("an allocator with a subtype indication "
& "cannot have a null exclusion", Alloc_Node);
end if;
end if;
return Alloc_Node;
end P_Allocator;
-----------------------
-- P_Case_Expression --
-----------------------
function P_Case_Expression return Node_Id is
Loc : constant Source_Ptr := Token_Ptr;
Case_Node : Node_Id;
Save_State : Saved_Scan_State;
begin
Error_Msg_Ada_2012_Feature ("|case expression", Token_Ptr);
Scan; -- past CASE
Case_Node :=
Make_Case_Expression (Loc,
Expression => P_Expression_No_Right_Paren,
Alternatives => New_List);
T_Is;
-- We now have scanned out CASE expression IS, scan alternatives
loop
T_When;
Append_To (Alternatives (Case_Node), P_Case_Expression_Alternative);
-- Missing comma if WHEN (more alternatives present)
if Token = Tok_When then
T_Comma;
-- A semicolon followed by "when" is probably meant to be a comma
elsif Token = Tok_Semicolon then
Save_Scan_State (Save_State);
Scan; -- past the semicolon
if Token /= Tok_When then
Restore_Scan_State (Save_State);
exit;
end if;
Error_Msg_SP -- CODEFIX
("|"";"" should be "",""");
-- If comma/WHEN, skip comma and we have another alternative
elsif Token = Tok_Comma then
Save_Scan_State (Save_State);
Scan; -- past comma
if Token /= Tok_When then
Restore_Scan_State (Save_State);
exit;
end if;
-- If no comma or WHEN, definitely done
else
exit;
end if;
end loop;
-- If we have an END CASE, diagnose as not needed
if Token = Tok_End then
Error_Msg_SC ("`END CASE` not allowed at end of case expression");
Scan; -- past END
if Token = Tok_Case then
Scan; -- past CASE;
end if;
end if;
-- Return the Case_Expression node
return Case_Node;
end P_Case_Expression;
-----------------------------------
-- P_Case_Expression_Alternative --
-----------------------------------
-- CASE_STATEMENT_ALTERNATIVE ::=
-- when DISCRETE_CHOICE_LIST =>
-- EXPRESSION
-- The caller has checked that and scanned past the initial WHEN token
-- Error recovery: can raise Error_Resync
function P_Case_Expression_Alternative return Node_Id is
Case_Alt_Node : Node_Id;
begin
Case_Alt_Node := New_Node (N_Case_Expression_Alternative, Token_Ptr);
Set_Discrete_Choices (Case_Alt_Node, P_Discrete_Choice_List);
TF_Arrow;
Set_Expression (Case_Alt_Node, P_Expression);
return Case_Alt_Node;
end P_Case_Expression_Alternative;
--------------------------------------
-- P_Iterated_Component_Association --
--------------------------------------
-- ITERATED_COMPONENT_ASSOCIATION ::=
-- for DEFINING_IDENTIFIER in DISCRETE_CHOICE_LIST => EXPRESSION
-- for ITERATOR_SPECIFICATION => EXPRESSION
function P_Iterated_Component_Association return Node_Id is
Assoc_Node : Node_Id;
Choice : Node_Id;
Id : Node_Id;
Iter_Spec : Node_Id;
Loop_Spec : Node_Id;
State : Saved_Scan_State;
-- Start of processing for P_Iterated_Component_Association
begin
Scan; -- past FOR
Save_Scan_State (State);
-- A lookahead is necessary to differentiate between the
-- Ada 2012 form with a choice list, and the Ada 202x element
-- iterator form, recognized by the presence of "OF". Other
-- disambiguation requires context and is done during semantic
-- analysis. Note that "for X in E" is syntactically ambiguous:
-- if E is a subtype indication this is a loop parameter spec,
-- while if E a name it is an iterator_specification, and the
-- disambiguation takes place during semantic analysis.
-- In addition, if "use" is present after the specification,
-- this is an Iterated_Element_Association that carries a
-- key_expression, and we generate the appropriate node.
Id := P_Defining_Identifier;
Assoc_Node :=
New_Node (N_Iterated_Component_Association, Prev_Token_Ptr);
if Token = Tok_In then
Set_Defining_Identifier (Assoc_Node, Id);
T_In;
Set_Discrete_Choices (Assoc_Node, P_Discrete_Choice_List);
if Token = Tok_Use then
-- Ada_2020 Key-expression is present, rewrite node as an
-- iterated_Element_Awwoiation.
Scan; -- past USE
Loop_Spec :=
New_Node (N_Loop_Parameter_Specification, Prev_Token_Ptr);
Set_Defining_Identifier (Loop_Spec, Id);
Choice := First (Discrete_Choices (Assoc_Node));
if Present (Next (Choice)) then
Error_Msg_N ("expect loop parameter specification", Choice);
end if;
Remove (Choice);
Set_Discrete_Subtype_Definition (Loop_Spec, Choice);
Assoc_Node :=
New_Node (N_Iterated_Element_Association, Prev_Token_Ptr);
Set_Loop_Parameter_Specification (Assoc_Node, Loop_Spec);
Set_Key_Expression (Assoc_Node, P_Expression);
end if;
TF_Arrow;
Set_Expression (Assoc_Node, P_Expression);
elsif Ada_Version >= Ada_2020
and then Token = Tok_Of
then
Restore_Scan_State (State);
Scan; -- past OF
Set_Defining_Identifier (Assoc_Node, Id);
Iter_Spec := P_Iterator_Specification (Id);
Set_Iterator_Specification (Assoc_Node, Iter_Spec);
if Token = Tok_Use then
Scan; -- past USE
-- This is an iterated_elenent_qssociation.
Assoc_Node :=
New_Node (N_Iterated_Element_Association, Prev_Token_Ptr);
Set_Iterator_Specification (Assoc_Node, Iter_Spec);
Set_Key_Expression (Assoc_Node, P_Expression);
end if;
TF_Arrow;
Set_Expression (Assoc_Node, P_Expression);
end if;
if Ada_Version < Ada_2020 then
Error_Msg_SC ("iterated component is an Ada 202x feature");
Error_Msg_SC ("\compile with -gnat2020");
end if;
return Assoc_Node;
end P_Iterated_Component_Association;
---------------------
-- P_If_Expression --
---------------------
-- IF_EXPRESSION ::=
-- if CONDITION then DEPENDENT_EXPRESSION
-- {elsif CONDITION then DEPENDENT_EXPRESSION}
-- [else DEPENDENT_EXPRESSION]
-- DEPENDENT_EXPRESSION ::= EXPRESSION
function P_If_Expression return Node_Id is
function P_If_Expression_Internal
(Loc : Source_Ptr;
Cond : Node_Id) return Node_Id;
-- This is the internal recursive routine that does all the work, it is
-- recursive since it is used to process ELSIF parts, which internally
-- are N_If_Expression nodes with the Is_Elsif flag set. The calling
-- sequence is like the outer function except that the caller passes
-- the conditional expression (scanned using P_Expression), and the
-- scan pointer points just past this expression. Loc points to the
-- IF or ELSIF token.
------------------------------
-- P_If_Expression_Internal --
------------------------------
function P_If_Expression_Internal
(Loc : Source_Ptr;
Cond : Node_Id) return Node_Id
is
Exprs : constant List_Id := New_List;
Expr : Node_Id;
State : Saved_Scan_State;
Eptr : Source_Ptr;
begin
-- All cases except where we are at right paren
if Token /= Tok_Right_Paren then
TF_Then;
Append_To (Exprs, P_Condition (Cond));
Append_To (Exprs, P_Expression);
-- Case of right paren (missing THEN phrase). Note that we know this
-- is the IF case, since the caller dealt with this possibility in
-- the ELSIF case.
else
Error_Msg_BC ("missing THEN phrase");
Append_To (Exprs, P_Condition (Cond));
end if;
-- We now have scanned out IF expr THEN expr
-- Check for common error of semicolon before the ELSE
if Token = Tok_Semicolon then
Save_Scan_State (State);
Scan; -- past semicolon
if Token = Tok_Else or else Token = Tok_Elsif then
Error_Msg_SP -- CODEFIX
("|extra "";"" ignored");
else
Restore_Scan_State (State);
end if;
end if;
-- Scan out ELSIF sequence if present
if Token = Tok_Elsif then
Eptr := Token_Ptr;
Scan; -- past ELSIF
Expr := P_Expression;
-- If we are at a right paren, we assume the ELSIF should be ELSE
if Token = Tok_Right_Paren then
Error_Msg ("ELSIF should be ELSE", Eptr);
Append_To (Exprs, Expr);
-- Otherwise we have an OK ELSIF
else
Expr := P_If_Expression_Internal (Eptr, Expr);
Set_Is_Elsif (Expr);
Append_To (Exprs, Expr);
end if;
-- Scan out ELSE phrase if present
elsif Token = Tok_Else then
-- Scan out ELSE expression
Scan; -- Past ELSE
Append_To (Exprs, P_Expression);
-- Skip redundant ELSE parts
while Token = Tok_Else loop
Error_Msg_SC ("only one ELSE part is allowed");
Scan; -- past ELSE
Discard_Junk_Node (P_Expression);
end loop;
-- Two expression case (implied True, filled in during semantics)
else
null;
end if;
-- If we have an END IF, diagnose as not needed
if Token = Tok_End then
Error_Msg_SC ("`END IF` not allowed at end of if expression");
Scan; -- past END
if Token = Tok_If then
Scan; -- past IF;
end if;
end if;
-- Return the If_Expression node
return Make_If_Expression (Loc, Expressions => Exprs);
end P_If_Expression_Internal;
-- Local variables
Loc : constant Source_Ptr := Token_Ptr;
If_Expr : Node_Id;
-- Start of processing for P_If_Expression
begin
Error_Msg_Ada_2012_Feature ("|if expression", Token_Ptr);
Scan; -- past IF
Inside_If_Expression := Inside_If_Expression + 1;
If_Expr := P_If_Expression_Internal (Loc, P_Expression);
Inside_If_Expression := Inside_If_Expression - 1;
return If_Expr;
end P_If_Expression;
--------------------------
-- P_Declare_Expression --
--------------------------
-- DECLARE_EXPRESSION ::=
-- DECLARE {DECLARE_ITEM}
-- begin BODY_EXPRESSION
-- DECLARE_ITEM ::= OBJECT_DECLARATION
-- | OBJECT_RENAMING_DECLARATION
function P_Declare_Expression return Node_Id is
Loc : constant Source_Ptr := Token_Ptr;
begin
Scan; -- past DECLARE
declare
Actions : constant List_Id := P_Basic_Declarative_Items
(Declare_Expression => True);
-- Most declarative items allowed by P_Basic_Declarative_Items are
-- illegal; semantic analysis will deal with that.
begin
if Token = Tok_Begin then
Scan;
else
Error_Msg_SC -- CODEFIX
("BEGIN expected!");
end if;
declare
Expression : constant Node_Id := P_Expression;
Result : constant Node_Id :=
Make_Expression_With_Actions (Loc, Actions, Expression);
begin
if Ada_Version < Ada_2020 then
Error_Msg ("declare_expression is an Ada 2020 feature", Loc);
end if;
return Result;
end;
end;
end P_Declare_Expression;
-----------------------
-- P_Membership_Test --
-----------------------
-- MEMBERSHIP_CHOICE_LIST ::= MEMBERSHIP_CHOICE {'|' MEMBERSHIP_CHOICE}
-- MEMBERSHIP_CHOICE ::= CHOICE_EXPRESSION | range | subtype_mark
procedure P_Membership_Test (N : Node_Id) is
Alt : constant Node_Id :=
P_Range_Or_Subtype_Mark
(Allow_Simple_Expression => (Ada_Version >= Ada_2012));
begin
-- Set case
if Token = Tok_Vertical_Bar then
Error_Msg_Ada_2012_Feature ("set notation", Token_Ptr);
Set_Alternatives (N, New_List (Alt));
Set_Right_Opnd (N, Empty);
-- Loop to accumulate alternatives
while Token = Tok_Vertical_Bar loop
Scan; -- past vertical bar
Append_To
(Alternatives (N),
P_Range_Or_Subtype_Mark (Allow_Simple_Expression => True));
end loop;
-- Not set case
else
Set_Right_Opnd (N, Alt);
Set_Alternatives (N, No_List);
end if;
end P_Membership_Test;
-----------------------------
-- P_Unparen_Cond_Expr_Etc --
-----------------------------
function P_Unparen_Cond_Expr_Etc return Node_Id is
Lparen : constant Boolean := Prev_Token = Tok_Left_Paren;
Result : Node_Id;
Scan_State : Saved_Scan_State;
begin
-- Case expression
if Token = Tok_Case then
Result := P_Case_Expression;
if not (Lparen and then Token = Tok_Right_Paren) then
Error_Msg_N ("case expression must be parenthesized!", Result);
end if;
-- If expression
elsif Token = Tok_If then
Result := P_If_Expression;
if not (Lparen and then Token = Tok_Right_Paren) then
Error_Msg_N ("if expression must be parenthesized!", Result);
end if;
-- Quantified expression or iterated component association
elsif Token = Tok_For then
Save_Scan_State (Scan_State);
Scan; -- past FOR
if Token = Tok_All or else Token = Tok_Some then
Restore_Scan_State (Scan_State);
Result := P_Quantified_Expression;
if not (Lparen and then Token = Tok_Right_Paren) then
Error_Msg_N
("quantified expression must be parenthesized!", Result);
end if;
else
-- If no quantifier keyword, this is an iterated component in
-- an aggregate.
Restore_Scan_State (Scan_State);
Result := P_Iterated_Component_Association;
end if;
-- Declare expression
elsif Token = Tok_Declare then
Result := P_Declare_Expression;
if not (Lparen and then Token = Tok_Right_Paren) then
Error_Msg_N ("declare expression must be parenthesized!", Result);
end if;
-- No other possibility should exist (caller was supposed to check)
else
raise Program_Error;
end if;
-- Return expression (possibly after having given message)
return Result;
end P_Unparen_Cond_Expr_Etc;
end Ch4;
| 33.72346 | 79 | 0.570728 |
d0f2d9f29c6d4c54450cdfb17aa01482fdbbd243 | 3,910 | ads | Ada | .emacs.d/elpa/wisi-3.1.3/wisitoken-generate-lr-lr1_generate.ads | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/wisi-3.1.3/wisitoken-generate-lr-lr1_generate.ads | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/wisi-3.1.3/wisitoken-generate-lr-lr1_generate.ads | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | -- Abstract :
--
-- LR1 (Left-to-right scanning 1 look-ahead) parser table generator.
--
-- References:
--
-- [dragon] "Compilers Principles, Techniques, and Tools" by Aho,
-- Sethi, and Ullman (aka: "The [Red] Dragon Book").
--
-- Copyright (C) 2017 - 2020 Free Software Foundation, Inc.
--
-- This file is part of the WisiToken package.
--
-- The WisiToken package 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 WisiToken.Generate.LR1_Items;
with WisiToken.Productions;
package WisiToken.Generate.LR.LR1_Generate is
function Generate
(Grammar : in out WisiToken.Productions.Prod_Arrays.Vector;
Descriptor : in WisiToken.Descriptor;
Known_Conflicts : in Conflict_Lists.List := Conflict_Lists.Empty_List;
McKenzie_Param : in McKenzie_Param_Type := Default_McKenzie_Param;
Parse_Table_File_Name : in String := "";
Include_Extra : in Boolean := False;
Ignore_Conflicts : in Boolean := False;
Partial_Recursion : in Boolean := True)
return Parse_Table_Ptr
with Pre => Descriptor.First_Nonterminal = Descriptor.Accept_ID;
-- Generate a generalized LR1 parse table for Grammar. The
-- grammar start symbol is the LHS of the first production in
-- Grammar.
--
-- Sets Recursive components in Grammar.
--
-- If Trace, output debug info to Standard_Error about generation
-- process. We don't use WisiToken.Trace here; we often want to
-- see a trace of the parser execution without the parser
-- generation.
--
-- Unless Ignore_Unused_Tokens is True, raise Grammar_Error if
-- there are unused tokens.
--
-- Unless Ignore_Unknown_Conflicts is True, raise Grammar_Error if there
-- are unknown conflicts.
----------
-- visible for unit test
function LR1_Goto_Transitions
(Set : in LR1_Items.Item_Set;
Symbol : in Token_ID;
Has_Empty_Production : in Token_ID_Set;
First_Terminal_Sequence : in Token_Sequence_Arrays.Vector;
Grammar : in WisiToken.Productions.Prod_Arrays.Vector;
Descriptor : in WisiToken.Descriptor)
return LR1_Items.Item_Set;
-- 'goto' from [dragon] algorithm 4.9
function LR1_Item_Sets
(Has_Empty_Production : in Token_ID_Set;
First_Terminal_Sequence : in Token_Sequence_Arrays.Vector;
Grammar : in WisiToken.Productions.Prod_Arrays.Vector;
Descriptor : in WisiToken.Descriptor)
return LR1_Items.Item_Set_List;
-- [dragon] algorithm 4.9 pg 231; figure 4.38 pg 232; procedure "items"
procedure Add_Actions
(Item_Sets : in LR1_Items.Item_Set_List;
Grammar : in WisiToken.Productions.Prod_Arrays.Vector;
Has_Empty_Production : in Token_ID_Set;
First_Nonterm_Set : in Token_Array_Token_Set;
Conflict_Counts : out Conflict_Count_Lists.List;
Conflicts : out Conflict_Lists.List;
Table : in out Parse_Table;
Descriptor : in WisiToken.Descriptor);
end WisiToken.Generate.LR.LR1_Generate;
| 42.5 | 86 | 0.659079 |
1ceedaf37799f95e1668cbbdfa47f576996c483a | 822 | ads | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/specs/controlled1.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/specs/controlled1.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/specs/controlled1.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- { dg-do compile }
with Ada.Finalization;
with Controlled1_Pkg; use Controlled1_Pkg;
package Controlled1 is
type Collection is new Ada.Finalization.Controlled with null record;
type Object_Kind_Type is (One, Two);
type Byte_Array is array (Natural range <>) of Integer;
type Bounded_Byte_Array_Type is record
A : Byte_Array (1 .. Value);
end record;
type Object_Type is tagged record
A : Bounded_Byte_Array_Type;
end record;
type R_Object_Type is new Object_Type with record
L : Collection;
end record;
type Obj_Type (Kind : Object_Kind_Type := One) is record
case Kind is
when One => R : R_Object_Type;
when others => null;
end case;
end record;
type Obj_Array_Type is array (Positive range <>) of Obj_Type;
end Controlled1;
| 22.833333 | 71 | 0.689781 |
c5303ce8c7e68b32c73f00663459adcbd35676f3 | 1,218 | ads | Ada | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/float_param/pck.ads | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 31 | 2018-08-01T21:25:24.000Z | 2022-02-14T07:52:34.000Z | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/float_param/pck.ads | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 40 | 2018-12-03T19:48:52.000Z | 2021-03-10T06:34:26.000Z | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/float_param/pck.ads | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 20 | 2018-11-16T21:19:22.000Z | 2021-10-18T23:08:24.000Z | -- Copyright 2013-2019 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package Pck is
Global_Float : Float := 0.0;
Global_Double : Long_Float := 0.0;
Global_Long_Double : Long_Long_Float := 0.0;
type Small_Struct is record
I : Integer;
end record;
Global_Small_Struct : Small_Struct := (I => 0);
procedure Set_Float (F : Float);
procedure Set_Double (Dummy : Integer; D : Long_Float);
procedure Set_Long_Double (Dummy : Integer;
DS: Small_Struct;
LD : Long_Long_Float);
end Pck;
| 38.0625 | 73 | 0.683087 |
3185c07cd62da17372e992b805df439220acb8fd | 226 | ada | Ada | Task/Solve-the-no-connection-puzzle/Ada/solve-the-no-connection-puzzle-1.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:38.000Z | 2018-11-09T22:08:38.000Z | Task/Solve-the-no-connection-puzzle/Ada/solve-the-no-connection-puzzle-1.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/Solve-the-no-connection-puzzle/Ada/solve-the-no-connection-puzzle-1.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:40.000Z | 2018-11-09T22:08:40.000Z | With
Ada.Text_IO,
Connection_Types,
Connection_Combinations;
procedure main is
Result : Connection_Types.Partial_Board renames Connection_Combinations;
begin
Ada.Text_IO.Put_Line( Connection_Types.Image(Result) );
end;
| 20.545455 | 75 | 0.823009 |
316cf22af3b5e98ed66ec5e6f48b0eb58ad5f9f4 | 2,622 | adb | Ada | src/simple_webapps.adb | faelys/simple-webapps | 32f4f567cddb54a1703c9b6a8232f01073c92a44 | [
"0BSD"
] | 1 | 2017-03-13T21:40:47.000Z | 2017-03-13T21:40:47.000Z | src/simple_webapps.adb | faelys/simple-webapps | 32f4f567cddb54a1703c9b6a8232f01073c92a44 | [
"0BSD"
] | null | null | null | src/simple_webapps.adb | faelys/simple-webapps | 32f4f567cddb54a1703c9b6a8232f01073c92a44 | [
"0BSD"
] | null | null | null | ------------------------------------------------------------------------------
-- Copyright (c) 2014, Natacha Porté --
-- --
-- Permission to use, copy, modify, and distribute this software for any --
-- purpose with or without fee is hereby granted, provided that the above --
-- copyright notice and this permission notice appear in all copies. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES --
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF --
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR --
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES --
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN --
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF --
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. --
------------------------------------------------------------------------------
package body Simple_Webapps is
function HTML_Escape (Unsafe_Input : String) return String is
function Length (Input : String) return Natural;
function Length (Input : String) return Natural is
Result : Natural := Input'Length;
begin
for I in Input'Range loop
case Input (I) is
when '<' | '>' =>
Result := Result + 3;
when '&' =>
Result := Result + 4;
when '"' =>
Result := Result + 5;
when others =>
null;
end case;
end loop;
return Result;
end Length;
Result : String (1 .. Length (Unsafe_Input));
O : Positive := Result'First;
begin
for I in Unsafe_Input'Range loop
case Unsafe_Input (I) is
when '<' =>
Result (O .. O + 3) := "<";
O := O + 4;
when '>' =>
Result (O .. O + 3) := ">";
O := O + 4;
when '&' =>
Result (O .. O + 4) := "&";
O := O + 5;
when '"' =>
Result (O .. O + 5) := """;
O := O + 6;
when others =>
Result (O) := Unsafe_Input (I);
O := O + 1;
end case;
end loop;
return Result;
end HTML_Escape;
end Simple_Webapps;
| 38.558824 | 78 | 0.448513 |
311fc514cb5b7580f412059acfca74a6d8d79921 | 2,456 | adb | Ada | 1-base/lace/source/text/lace-text-all_lines.adb | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 1-base/lace/source/text/lace-text-all_lines.adb | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 1-base/lace/source/text/lace-text-all_lines.adb | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | with
lace.Text.all_Tokens,
ada.Characters.Latin_1;
package body lace.Text.all_Lines
is
use lace.Text.all_Tokens,
ada.Characters.Latin_1;
function Lines (Self : in Item) return Text.items_2
is
begin
return Tokens (Self, LF);
end Lines;
function Lines (Self : in Item) return Text.items_4
is
begin
return Tokens (Self, LF);
end Lines;
function Lines (Self : in Item) return Text.items_8
is
begin
return Tokens (Self, LF);
end Lines;
function Lines (Self : in Item) return Text.items_16
is
begin
return Tokens (Self, LF);
end Lines;
function Lines (Self : in Item) return Text.items_32
is
begin
return Tokens (Self, LF);
end Lines;
function Lines (Self : in Item) return Text.items_64
is
begin
return Tokens (Self, LF);
end Lines;
function Lines (Self : in Item) return Text.items_128
is
begin
return Tokens (Self, LF);
end Lines;
function Lines (Self : in Item) return Text.items_256
is
begin
return Tokens (Self, LF);
end Lines;
function Lines (Self : in Item) return Text.items_512
is
begin
return Tokens (Self, LF);
end Lines;
function Lines (Self : in Item) return Text.items_1k
is
begin
return Tokens (Self, LF);
end Lines;
function Lines (Self : in Item) return Text.items_2k
is
begin
return Tokens (Self, LF);
end Lines;
function Lines (Self : in Item) return Text.items_4k
is
begin
return Tokens (Self, LF);
end Lines;
function Lines (Self : in Item) return Text.items_8k
is
begin
return Tokens (Self, LF);
end Lines;
function Lines (Self : in Item) return Text.items_16k
is
begin
return Tokens (Self, LF);
end Lines;
function Lines (Self : in Item) return Text.items_32k
is
begin
return Tokens (Self, LF);
end Lines;
function Lines (Self : in Item) return Text.items_64k
is
begin
return Tokens (Self, LF);
end Lines;
function Lines (Self : in Item) return Text.items_128k
is
begin
return Tokens (Self, LF);
end Lines;
function Lines (Self : in Item) return Text.items_256k
is
begin
return Tokens (Self, LF);
end Lines;
function Lines (Self : in Item) return Text.items_512k
is
begin
return Tokens (Self, LF);
end Lines;
end lace.Text.all_Lines;
| 16.821918 | 57 | 0.630293 |
313acb47b598db28d78d3cfce960f01fb8be0dea | 4,073 | ads | Ada | source/amf/dd/amf-internals-holders-di_holders.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/dd/amf-internals-holders-di_holders.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/dd/amf-internals-holders-di_holders.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This package contains conversion subprograms from different subclasses of
-- elements into holders. They are required to simplify generated code,
-- otherwise creation of intermediate object should be done in reflections
-- module. Most probably this package can be removed for Ada2020.
------------------------------------------------------------------------------
with AMF.DI.Diagram_Elements;
with AMF.DI.Styles;
package AMF.Internals.Holders.DI_Holders is
function To_Holder
(Item : AMF.DI.Diagram_Elements.DI_Diagram_Element_Access)
return League.Holders.Holder;
function To_Holder
(Item : AMF.DI.Styles.DI_Style_Access)
return League.Holders.Holder;
end AMF.Internals.Holders.DI_Holders;
| 64.650794 | 78 | 0.442917 |
fbe70e467433de4961dc626d24c5402da5bbc912 | 170,030 | adb | Ada | submissions/M2/Design_Analysis/lab1/dct_prj/solution2/.autopilot/db/dct_2d.sched.adb | maanjum95/SynthesisDigitalSystems_Lab | afc942decf7595eb1557ff78074693de2eea1780 | [
"MIT"
] | null | null | null | submissions/M2/Design_Analysis/lab1/dct_prj/solution2/.autopilot/db/dct_2d.sched.adb | maanjum95/SynthesisDigitalSystems_Lab | afc942decf7595eb1557ff78074693de2eea1780 | [
"MIT"
] | null | null | null | submissions/M2/Design_Analysis/lab1/dct_prj/solution2/.autopilot/db/dct_2d.sched.adb | maanjum95/SynthesisDigitalSystems_Lab | afc942decf7595eb1557ff78074693de2eea1780 | [
"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></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>dct_2d</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>in_block</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in_block</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>64</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>out_block</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>out_block</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>64</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>72</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>4</id>
<name>row_outbuf</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>106</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>5</id>
<name>col_outbuf</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>107</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>6</id>
<name>col_inbuf</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>71</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second class_id="12" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="13" tracking_level="0" version="0">
<first class_id="14" tracking_level="0" version="0">
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>71</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>col_inbuf</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>108</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>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name>_ln76</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></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.73</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>9</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>4</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>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>icmp_ln76</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>115</item>
<item>117</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.72</m_delay>
<m_topoIndex>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>i</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>118</item>
<item>120</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.80</m_delay>
<m_topoIndex>7</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>_ln76</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>121</item>
<item>122</item>
<item>123</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>8</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>_ln77</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>77</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>77</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>6</count>
<item_version>0</item_version>
<item>126</item>
<item>127</item>
<item>128</item>
<item>129</item>
<item>130</item>
<item>271</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.73</m_delay>
<m_topoIndex>9</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>_ln76</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>131</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>11</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>_ln81</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>124</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.73</m_delay>
<m_topoIndex>10</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>indvar_flatten</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>132</item>
<item>133</item>
<item>135</item>
<item>136</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>12</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>j_0</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>137</item>
<item>138</item>
<item>139</item>
<item>140</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>13</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>i_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>141</item>
<item>142</item>
<item>143</item>
<item>144</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>14</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>icmp_ln81</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>145</item>
<item>147</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.71</m_delay>
<m_topoIndex>15</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>add_ln81</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>148</item>
<item>150</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.85</m_delay>
<m_topoIndex>16</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>_ln81</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>151</item>
<item>152</item>
<item>153</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>17</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>j</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</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>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.80</m_delay>
<m_topoIndex>18</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>icmp_ln83</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>157</item>
<item>158</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.72</m_delay>
<m_topoIndex>19</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>select_ln84</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>159</item>
<item>160</item>
<item>161</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.18</m_delay>
<m_topoIndex>20</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>select_ln84_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>162</item>
<item>163</item>
<item>164</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.18</m_delay>
<m_topoIndex>21</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>zext_ln84</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</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>
<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="_25">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>tmp</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>167</item>
<item>168</item>
<item>170</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>30</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>zext_ln84_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>171</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>31</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>zext_ln84_2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>172</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>32</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>tmp_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>173</item>
<item>174</item>
<item>175</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<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="_29">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>zext_ln84_3</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>176</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>24</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>add_ln84</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>177</item>
<item>178</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.85</m_delay>
<m_topoIndex>25</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>zext_ln84_4</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>179</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>26</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>row_outbuf_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>180</item>
<item>182</item>
<item>183</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>27</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>add_ln84_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>184</item>
<item>185</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.85</m_delay>
<m_topoIndex>33</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>zext_ln84_5</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>186</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>34</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>col_inbuf_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>187</item>
<item>188</item>
<item>189</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>35</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name>row_outbuf_load</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>190</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.29</m_delay>
<m_topoIndex>28</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>col_inbuf_addr_write_ln84</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>191</item>
<item>192</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.29</m_delay>
<m_topoIndex>36</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>i_4</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>193</item>
<item>194</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.80</m_delay>
<m_topoIndex>29</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>_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>195</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>37</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>_ln87</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>154</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.73</m_delay>
<m_topoIndex>38</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>i_2</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>196</item>
<item>197</item>
<item>198</item>
<item>199</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>39</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name>icmp_ln87</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>200</item>
<item>201</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.72</m_delay>
<m_topoIndex>40</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name>i_5</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>202</item>
<item>203</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.80</m_delay>
<m_topoIndex>41</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>61</id>
<name>_ln87</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>204</item>
<item>205</item>
<item>206</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>42</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name>_ln88</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>88</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>88</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>6</count>
<item_version>0</item_version>
<item>208</item>
<item>209</item>
<item>210</item>
<item>211</item>
<item>212</item>
<item>272</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.73</m_delay>
<m_topoIndex>43</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>65</id>
<name>_ln87</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>213</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>45</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>67</id>
<name>_ln92</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>207</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.73</m_delay>
<m_topoIndex>44</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>69</id>
<name>indvar_flatten11</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>214</item>
<item>215</item>
<item>216</item>
<item>217</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>46</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>70</id>
<name>j_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>218</item>
<item>219</item>
<item>220</item>
<item>221</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>47</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>71</id>
<name>i_3</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>222</item>
<item>223</item>
<item>224</item>
<item>225</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>48</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name>icmp_ln92</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>226</item>
<item>227</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.71</m_delay>
<m_topoIndex>49</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>73</id>
<name>add_ln92</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>228</item>
<item>229</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.85</m_delay>
<m_topoIndex>50</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>74</id>
<name>_ln92</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>230</item>
<item>231</item>
<item>232</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>51</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>76</id>
<name>j_2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>233</item>
<item>234</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.80</m_delay>
<m_topoIndex>52</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>79</id>
<name>icmp_ln94</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>235</item>
<item>236</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.72</m_delay>
<m_topoIndex>53</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>80</id>
<name>select_ln95</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>237</item>
<item>238</item>
<item>239</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.18</m_delay>
<m_topoIndex>54</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>81</id>
<name>select_ln95_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>240</item>
<item>241</item>
<item>242</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.18</m_delay>
<m_topoIndex>55</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>82</id>
<name>zext_ln95</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>243</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>56</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>83</id>
<name>tmp_2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>244</item>
<item>245</item>
<item>246</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>64</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>84</id>
<name>zext_ln95_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>247</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>65</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>88</id>
<name>zext_ln95_2</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>248</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>66</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_62">
<Value>
<Obj>
<type>0</type>
<id>89</id>
<name>add_ln95</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>249</item>
<item>250</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.85</m_delay>
<m_topoIndex>67</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_63">
<Value>
<Obj>
<type>0</type>
<id>90</id>
<name>zext_ln95_3</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>251</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>68</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_64">
<Value>
<Obj>
<type>0</type>
<id>91</id>
<name>out_block_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>252</item>
<item>253</item>
<item>254</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>69</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_65">
<Value>
<Obj>
<type>0</type>
<id>92</id>
<name>tmp_3</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>255</item>
<item>256</item>
<item>257</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>57</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_66">
<Value>
<Obj>
<type>0</type>
<id>93</id>
<name>zext_ln95_4</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>258</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>58</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_67">
<Value>
<Obj>
<type>0</type>
<id>94</id>
<name>add_ln95_1</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>259</item>
<item>260</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.85</m_delay>
<m_topoIndex>59</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_68">
<Value>
<Obj>
<type>0</type>
<id>95</id>
<name>zext_ln95_5</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>261</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>60</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_69">
<Value>
<Obj>
<type>0</type>
<id>96</id>
<name>col_outbuf_addr</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>262</item>
<item>263</item>
<item>264</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>61</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_70">
<Value>
<Obj>
<type>0</type>
<id>97</id>
<name>col_outbuf_load</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>265</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.29</m_delay>
<m_topoIndex>62</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_71">
<Value>
<Obj>
<type>0</type>
<id>98</id>
<name>out_block_addr_write_ln95</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>266</item>
<item>267</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.29</m_delay>
<m_topoIndex>70</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_72">
<Value>
<Obj>
<type>0</type>
<id>100</id>
<name>i_6</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>268</item>
<item>269</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.80</m_delay>
<m_topoIndex>63</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_73">
<Value>
<Obj>
<type>0</type>
<id>101</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>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>71</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_74">
<Value>
<Obj>
<type>0</type>
<id>103</id>
<name>_ln96</name>
<fileName>dct.cpp</fileName>
<fileDirectory>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</fileDirectory>
<lineNumber>96</lineNumber>
<contextFuncName>dct_2d</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/usr/local/labs/SDS/current/ge46bod/Design_Analysis/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>dct.cpp</first>
<second>dct_2d</second>
</first>
<second>96</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></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>72</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="_75">
<Value>
<Obj>
<type>2</type>
<id>105</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_76">
<Value>
<Obj>
<type>2</type>
<id>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>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_77">
<Value>
<Obj>
<type>2</type>
<id>116</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_78">
<Value>
<Obj>
<type>2</type>
<id>119</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_79">
<Value>
<Obj>
<type>2</type>
<id>125</id>
<name>dct_1d2</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>
<const_type>6</const_type>
<content><constant:dct_1d2></content>
</item>
<item class_id_reference="16" object_id="_80">
<Value>
<Obj>
<type>2</type>
<id>134</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_81">
<Value>
<Obj>
<type>2</type>
<id>146</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<const_type>0</const_type>
<content>64</content>
</item>
<item class_id_reference="16" object_id="_82">
<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>7</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_83">
<Value>
<Obj>
<type>2</type>
<id>169</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_84">
<Value>
<Obj>
<type>2</type>
<id>181</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>13</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_85">
<Obj>
<type>3</type>
<id>8</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>4</item>
<item>5</item>
<item>6</item>
<item>7</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_86">
<Obj>
<type>3</type>
<id>14</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>9</item>
<item>10</item>
<item>12</item>
<item>13</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_87">
<Obj>
<type>3</type>
<id>18</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>16</item>
<item>17</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_88">
<Obj>
<type>3</type>
<id>20</id>
<name>.preheader2.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>1</count>
<item_version>0</item_version>
<item>19</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_89">
<Obj>
<type>3</type>
<id>27</id>
<name>.preheader2.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>6</count>
<item_version>0</item_version>
<item>21</item>
<item>22</item>
<item>23</item>
<item>24</item>
<item>25</item>
<item>26</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_90">
<Obj>
<type>3</type>
<id>54</id>
<name>Xpose_Row_Inner_Loop</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>20</count>
<item_version>0</item_version>
<item>28</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>36</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>52</item>
<item>53</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_91">
<Obj>
<type>3</type>
<id>56</id>
<name>.preheader1.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>55</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_92">
<Obj>
<type>3</type>
<id>62</id>
<name>.preheader1</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>57</item>
<item>58</item>
<item>60</item>
<item>61</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_93">
<Obj>
<type>3</type>
<id>66</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>64</item>
<item>65</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_94">
<Obj>
<type>3</type>
<id>68</id>
<name>.preheader.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>1</count>
<item_version>0</item_version>
<item>67</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_95">
<Obj>
<type>3</type>
<id>75</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>6</count>
<item_version>0</item_version>
<item>69</item>
<item>70</item>
<item>71</item>
<item>72</item>
<item>73</item>
<item>74</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_96">
<Obj>
<type>3</type>
<id>102</id>
<name>Xpose_Col_Inner_Loop</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>20</count>
<item_version>0</item_version>
<item>76</item>
<item>79</item>
<item>80</item>
<item>81</item>
<item>82</item>
<item>83</item>
<item>84</item>
<item>88</item>
<item>89</item>
<item>90</item>
<item>91</item>
<item>92</item>
<item>93</item>
<item>94</item>
<item>95</item>
<item>96</item>
<item>97</item>
<item>98</item>
<item>100</item>
<item>101</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_97">
<Obj>
<type>3</type>
<id>104</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>103</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>169</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_98">
<id>106</id>
<edge_type>1</edge_type>
<source_obj>105</source_obj>
<sink_obj>4</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_99">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>105</source_obj>
<sink_obj>5</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_100">
<id>108</id>
<edge_type>1</edge_type>
<source_obj>105</source_obj>
<sink_obj>6</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_101">
<id>109</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>7</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_102">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_103">
<id>112</id>
<edge_type>2</edge_type>
<source_obj>8</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_104">
<id>113</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_105">
<id>114</id>
<edge_type>2</edge_type>
<source_obj>18</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_106">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>10</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_107">
<id>117</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>10</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_108">
<id>118</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="_109">
<id>120</id>
<edge_type>1</edge_type>
<source_obj>119</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_110">
<id>121</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_111">
<id>122</id>
<edge_type>2</edge_type>
<source_obj>18</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_112">
<id>123</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="_113">
<id>124</id>
<edge_type>2</edge_type>
<source_obj>27</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_114">
<id>126</id>
<edge_type>1</edge_type>
<source_obj>125</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_115">
<id>127</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_116">
<id>128</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_117">
<id>129</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_118">
<id>130</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_119">
<id>131</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_120">
<id>132</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_121">
<id>133</id>
<edge_type>2</edge_type>
<source_obj>54</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_122">
<id>135</id>
<edge_type>1</edge_type>
<source_obj>134</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_123">
<id>136</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_124">
<id>137</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_125">
<id>138</id>
<edge_type>2</edge_type>
<source_obj>54</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_126">
<id>139</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_127">
<id>140</id>
<edge_type>2</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="_128">
<id>141</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_129">
<id>142</id>
<edge_type>2</edge_type>
<source_obj>54</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_130">
<id>143</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_131">
<id>144</id>
<edge_type>2</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="_132">
<id>145</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="_133">
<id>147</id>
<edge_type>1</edge_type>
<source_obj>146</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_134">
<id>148</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_135">
<id>150</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_136">
<id>151</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="_137">
<id>152</id>
<edge_type>2</edge_type>
<source_obj>54</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_138">
<id>153</id>
<edge_type>2</edge_type>
<source_obj>56</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_139">
<id>154</id>
<edge_type>2</edge_type>
<source_obj>62</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_140">
<id>155</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_141">
<id>156</id>
<edge_type>1</edge_type>
<source_obj>119</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_142">
<id>157</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_143">
<id>158</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_144">
<id>159</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="_145">
<id>160</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_146">
<id>161</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_147">
<id>162</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_148">
<id>163</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_149">
<id>164</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_150">
<id>165</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="_151">
<id>168</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_152">
<id>170</id>
<edge_type>1</edge_type>
<source_obj>169</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_153">
<id>171</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="_154">
<id>172</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_155">
<id>174</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_156">
<id>175</id>
<edge_type>1</edge_type>
<source_obj>169</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_157">
<id>176</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_158">
<id>177</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_159">
<id>178</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="_160">
<id>179</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_161">
<id>180</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_162">
<id>182</id>
<edge_type>1</edge_type>
<source_obj>181</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_163">
<id>183</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_164">
<id>184</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_165">
<id>185</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_166">
<id>186</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_167">
<id>187</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_168">
<id>188</id>
<edge_type>1</edge_type>
<source_obj>181</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_169">
<id>189</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_170">
<id>190</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_171">
<id>191</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_172">
<id>192</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_173">
<id>193</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_174">
<id>194</id>
<edge_type>1</edge_type>
<source_obj>119</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_175">
<id>195</id>
<edge_type>2</edge_type>
<source_obj>27</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_176">
<id>196</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_177">
<id>197</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_178">
<id>198</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_179">
<id>199</id>
<edge_type>2</edge_type>
<source_obj>56</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_180">
<id>200</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_181">
<id>201</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_182">
<id>202</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_183">
<id>203</id>
<edge_type>1</edge_type>
<source_obj>119</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_184">
<id>204</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_185">
<id>205</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_186">
<id>206</id>
<edge_type>2</edge_type>
<source_obj>68</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_187">
<id>207</id>
<edge_type>2</edge_type>
<source_obj>75</source_obj>
<sink_obj>67</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_188">
<id>208</id>
<edge_type>1</edge_type>
<source_obj>125</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_189">
<id>209</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_190">
<id>210</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_191">
<id>211</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_192">
<id>212</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_193">
<id>213</id>
<edge_type>2</edge_type>
<source_obj>62</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_194">
<id>214</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_195">
<id>215</id>
<edge_type>2</edge_type>
<source_obj>102</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_196">
<id>216</id>
<edge_type>1</edge_type>
<source_obj>134</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_197">
<id>217</id>
<edge_type>2</edge_type>
<source_obj>68</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_198">
<id>218</id>
<edge_type>1</edge_type>
<source_obj>81</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_199">
<id>219</id>
<edge_type>2</edge_type>
<source_obj>102</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_200">
<id>220</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_201">
<id>221</id>
<edge_type>2</edge_type>
<source_obj>68</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_202">
<id>222</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_203">
<id>223</id>
<edge_type>2</edge_type>
<source_obj>102</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_204">
<id>224</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_205">
<id>225</id>
<edge_type>2</edge_type>
<source_obj>68</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_206">
<id>226</id>
<edge_type>1</edge_type>
<source_obj>69</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_207">
<id>227</id>
<edge_type>1</edge_type>
<source_obj>146</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_208">
<id>228</id>
<edge_type>1</edge_type>
<source_obj>69</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_209">
<id>229</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_210">
<id>230</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>74</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_211">
<id>231</id>
<edge_type>2</edge_type>
<source_obj>102</source_obj>
<sink_obj>74</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_212">
<id>232</id>
<edge_type>2</edge_type>
<source_obj>104</source_obj>
<sink_obj>74</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_213">
<id>233</id>
<edge_type>1</edge_type>
<source_obj>70</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_214">
<id>234</id>
<edge_type>1</edge_type>
<source_obj>119</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_215">
<id>235</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>79</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_216">
<id>236</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>79</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_217">
<id>237</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_218">
<id>238</id>
<edge_type>1</edge_type>
<source_obj>110</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_219">
<id>239</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_220">
<id>240</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>81</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_221">
<id>241</id>
<edge_type>1</edge_type>
<source_obj>76</source_obj>
<sink_obj>81</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_222">
<id>242</id>
<edge_type>1</edge_type>
<source_obj>70</source_obj>
<sink_obj>81</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_223">
<id>243</id>
<edge_type>1</edge_type>
<source_obj>81</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_224">
<id>245</id>
<edge_type>1</edge_type>
<source_obj>81</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_225">
<id>246</id>
<edge_type>1</edge_type>
<source_obj>169</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_226">
<id>247</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_227">
<id>248</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_228">
<id>249</id>
<edge_type>1</edge_type>
<source_obj>88</source_obj>
<sink_obj>89</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_229">
<id>250</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>89</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_230">
<id>251</id>
<edge_type>1</edge_type>
<source_obj>89</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_231">
<id>252</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_232">
<id>253</id>
<edge_type>1</edge_type>
<source_obj>181</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_233">
<id>254</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="_234">
<id>256</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>92</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_235">
<id>257</id>
<edge_type>1</edge_type>
<source_obj>169</source_obj>
<sink_obj>92</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_236">
<id>258</id>
<edge_type>1</edge_type>
<source_obj>92</source_obj>
<sink_obj>93</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_237">
<id>259</id>
<edge_type>1</edge_type>
<source_obj>82</source_obj>
<sink_obj>94</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_238">
<id>260</id>
<edge_type>1</edge_type>
<source_obj>93</source_obj>
<sink_obj>94</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_239">
<id>261</id>
<edge_type>1</edge_type>
<source_obj>94</source_obj>
<sink_obj>95</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_240">
<id>262</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>96</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_241">
<id>263</id>
<edge_type>1</edge_type>
<source_obj>181</source_obj>
<sink_obj>96</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_242">
<id>264</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>96</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_243">
<id>265</id>
<edge_type>1</edge_type>
<source_obj>96</source_obj>
<sink_obj>97</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_244">
<id>266</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>98</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_245">
<id>267</id>
<edge_type>1</edge_type>
<source_obj>91</source_obj>
<sink_obj>98</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_246">
<id>268</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_247">
<id>269</id>
<edge_type>1</edge_type>
<source_obj>119</source_obj>
<sink_obj>100</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_248">
<id>270</id>
<edge_type>2</edge_type>
<source_obj>75</source_obj>
<sink_obj>101</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_249">
<id>271</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_250">
<id>272</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_251">
<id>340</id>
<edge_type>2</edge_type>
<source_obj>8</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_252">
<id>341</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="_253">
<id>342</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_254">
<id>343</id>
<edge_type>2</edge_type>
<source_obj>18</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_255">
<id>344</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_256">
<id>345</id>
<edge_type>2</edge_type>
<source_obj>27</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_257">
<id>346</id>
<edge_type>2</edge_type>
<source_obj>27</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_258">
<id>347</id>
<edge_type>2</edge_type>
<source_obj>54</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_259">
<id>348</id>
<edge_type>2</edge_type>
<source_obj>56</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_260">
<id>349</id>
<edge_type>2</edge_type>
<source_obj>62</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_261">
<id>350</id>
<edge_type>2</edge_type>
<source_obj>62</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_262">
<id>351</id>
<edge_type>2</edge_type>
<source_obj>66</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_263">
<id>352</id>
<edge_type>2</edge_type>
<source_obj>68</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_264">
<id>353</id>
<edge_type>2</edge_type>
<source_obj>75</source_obj>
<sink_obj>104</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_265">
<id>354</id>
<edge_type>2</edge_type>
<source_obj>75</source_obj>
<sink_obj>102</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_266">
<id>355</id>
<edge_type>2</edge_type>
<source_obj>102</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_267">
<mId>1</mId>
<mTag>dct_2d</mTag>
<mType>0</mType>
<sub_regions>
<count>9</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>
</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>1590</mMinLatency>
<mMaxLatency>1590</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_268">
<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>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_269">
<mId>3</mId>
<mTag>Row_DCT_Loop</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>14</item>
<item>18</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>8</mMinTripCount>
<mMaxTripCount>8</mMaxTripCount>
<mMinLatency>728</mMinLatency>
<mMaxLatency>728</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_270">
<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>20</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="_271">
<mId>5</mId>
<mTag>Xpose_Row_Outer_Loop_Xpose_Row_Inner_Loop</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>27</item>
<item>54</item>
</basic_blocks>
<mII>1</mII>
<mDepth>2</mDepth>
<mMinTripCount>64</mMinTripCount>
<mMaxTripCount>64</mMaxTripCount>
<mMinLatency>64</mMinLatency>
<mMaxLatency>64</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_272">
<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>56</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="_273">
<mId>7</mId>
<mTag>Col_DCT_Loop</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>62</item>
<item>66</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>8</mMinTripCount>
<mMaxTripCount>8</mMaxTripCount>
<mMinLatency>728</mMinLatency>
<mMaxLatency>728</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_274">
<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>68</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="_275">
<mId>9</mId>
<mTag>Xpose_Col_Outer_Loop_Xpose_Col_Inner_Loop</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>75</item>
<item>102</item>
</basic_blocks>
<mII>1</mII>
<mDepth>2</mDepth>
<mMinTripCount>64</mMinTripCount>
<mMaxTripCount>64</mMaxTripCount>
<mMinLatency>64</mMinLatency>
<mMaxLatency>64</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_276">
<mId>10</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>104</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>72</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>4</first>
<second class_id="28" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>5</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>6</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>7</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>36</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>3</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>3</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>4</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>4</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>3</first>
<second>1</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>6</first>
<second>1</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>67</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>73</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>74</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>79</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>80</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>81</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>82</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>84</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>88</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>89</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>90</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>91</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>92</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>95</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>96</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>97</first>
<second>
<first>8</first>
<second>1</second>
</second>
</item>
<item>
<first>98</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>100</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>101</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>103</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="29" tracking_level="0" version="0">
<count>13</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="0" version="0">
<first>8</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>1</first>
<second>2</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>2</first>
<second>3</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>4</first>
<second>4</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>4</first>
<second>5</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>4</first>
<second>4</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>5</first>
<second>5</second>
</second>
</item>
<item>
<first>102</first>
<second>
<first>5</first>
<second>6</second>
</second>
</item>
<item>
<first>104</first>
<second>
<first>6</first>
<second>6</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="32" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="1" version="0" object_id="_277">
<region_name>Xpose_Row_Outer_Loop_Xpose_Row_Inner_Loop</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>27</item>
<item>54</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="_278">
<region_name>Xpose_Col_Outer_Loop_Xpose_Col_Inner_Loop</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>75</item>
<item>102</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>2</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="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.331619 | 93 | 0.606387 |
50935cd6009cf0c7f400342cf47ad6c4a267885c | 6,570 | ads | Ada | src/asis/a4g-norm.ads | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 15 | 2015-01-18T23:04:19.000Z | 2022-03-01T20:27:08.000Z | src/asis/a4g-norm.ads | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 16 | 2018-06-10T07:09:30.000Z | 2022-03-26T18:28:40.000Z | src/asis/a4g-norm.ads | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 3 | 2015-11-11T18:00:14.000Z | 2022-01-30T23:08:45.000Z | ------------------------------------------------------------------------------
-- --
-- ASIS-for-GNAT IMPLEMENTATION COMPONENTS --
-- --
-- A 4 G . N O R M --
-- --
-- S p e c --
-- --
-- Copyright (c) 1995-2006, Free Software Foundation, Inc. --
-- --
-- ASIS-for-GNAT is free software; you can redistribute it and/or modify it --
-- under terms of the GNU General Public License as published by the Free --
-- Software Foundation; either version 2, or (at your option) any later --
-- version. ASIS-for-GNAT is distributed in the hope that it will be use- --
-- ful, but WITHOUT ANY WARRANTY; without even the implied warranty of MER- --
-- CHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General --
-- Public License for more details. You should have received a copy of the --
-- GNU General Public License distributed with ASIS-for-GNAT; see file --
-- COPYING. If not, write to the Free Software Foundation, 51 Franklin --
-- Street, Fifth Floor, Boston, MA 02110-1301, USA. --
-- --
-- --
-- --
-- --
-- --
-- --
-- --
-- --
-- ASIS-for-GNAT was originally developed by the ASIS-for-GNAT team at the --
-- Software Engineering Laboratory of the Swiss Federal Institute of --
-- Technology (LGL-EPFL) in Lausanne, Switzerland, in cooperation with the --
-- Scientific Research Computer Center of Moscow State University (SRCC --
-- MSU), Russia, with funding partially provided by grants from the Swiss --
-- National Science Foundation and the Swiss Academy of Engineering --
-- Sciences. ASIS-for-GNAT is now maintained by AdaCore --
-- (http://www.adacore.com). --
-- --
------------------------------------------------------------------------------
-- This package defines routines needed for yielding and processing
-- normalized associations and their components
with Asis;
with Types; use Types;
package A4G.Norm is
---------------------------------------
-- Obtaining normalized associations --
---------------------------------------
function Normalized_Param_Associations
(Call_Elem : Asis.Element)
return Asis.Association_List;
-- Creates the list of normalized associations for a given call to an
-- entry, a procedure or to a function (is intended to be used in the
-- implementation of Asis.Expressions.Function_Call_Parameters and
-- Asis.Statements.Call_Statement_Parameters). This function assumes that
-- the association list to be returned is not empty. It is an error to call
-- it when Sinfo.Parameter_Assoccciations function gives No_List for
-- the node representing the call in question
function Normalized_Discriminant_Associations
(Constr_Elem : Asis.Element;
Constr_Node : Node_Id)
return Asis.Association_List;
-- creates the list of normalized associations for a given discriminant
-- constraint; is intended to be used in the implementation of
-- Asis.Definitions.Discriminant_Associations. This function assumes,
-- that Constr_Node is of N_Index_Or_Discriminant_Constraint,
-- it is an error to call it for other nodes.
function Normalized_Generic_Associations
(Inst_Elem : Asis.Element;
Templ_Node : Node_Id)
return Asis.Association_List;
-- Creates the list of normalized associations for a given generic
-- instantiation (is intended to be used in the implementation of
-- Asis.Decalarations.Generic_Actual_Part. Templ_Node should be the
-- node representing the corresponding generic template declaration.
-- This function is supposed to be called if it is known that the list
-- of normalized associations is not empty
--
-- See the documentation of the body for the description of the
-- representation of the normalized generic associations.
function Normalized_Record_Component_Associations
(Aggregate : Asis.Element)
return Asis.Element_List;
-- Creates a list of normalized associations for a record aggregate
function Defining_Gen_Parameter (Gen_Form_Par : Node_Id) return Node_Id;
-- Assuming that Gen_Form_Par is a node representing a
-- generic_formal_parameter_SELECTOR_NAME (it is an error to call this
-- function for another actual!!!), this function finds the node
-- representing the defining occurrence of this generic formal
-- parameter.
--
-- ??? Is here a really good place for this function?
--
-- ??? And do we really need it???
--
-- For now this function is PARTIALLY IMPLEMENTED - it can work only
-- with a generic_formal_parameter_SELECTOR_NAME which is
-- operator_symbol "+" or "-"
----------------------------------------
-- Processing normalized associations --
----------------------------------------
function Discr_Def_Name
(Association : Asis.Discriminant_Association)
return Asis.Defining_Name;
-- from a normalized discriminant association this function creates
-- the ASIS Element representing the defining occurrence of the
-- discriminant. (Is intended to be used in
-- Asis.Expressions.Discriminant_Selector_Names).
--
-- !!!NOTE: for now the implementation is unstable and definitely
-- contains holes.
end A4G.Norm;
| 53.414634 | 79 | 0.533486 |
1212fcee96013d33eca896e2282dde2befd69ce7 | 2,124 | adb | Ada | src/wiki-render-links.adb | jquorning/ada-wiki | 21dcbeb3897499ee4b4a85353f8a782e154c0a43 | [
"Apache-2.0"
] | 18 | 2015-10-26T21:32:08.000Z | 2021-11-30T10:38:51.000Z | src/wiki-render-links.adb | jquorning/ada-wiki | 21dcbeb3897499ee4b4a85353f8a782e154c0a43 | [
"Apache-2.0"
] | 2 | 2018-03-18T08:22:06.000Z | 2022-02-16T22:15:05.000Z | src/wiki-render-links.adb | jquorning/ada-wiki | 21dcbeb3897499ee4b4a85353f8a782e154c0a43 | [
"Apache-2.0"
] | 2 | 2019-04-05T17:10:34.000Z | 2022-02-13T20:50:56.000Z | -----------------------------------------------------------------------
-- wiki-render-links -- Wiki links renderering
-- Copyright (C) 2015, 2016 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
package body Wiki.Render.Links is
-- ------------------------------
-- Get the image link that must be rendered from the wiki image link.
-- ------------------------------
overriding
procedure Make_Image_Link (Renderer : in out Default_Link_Renderer;
Link : in Wiki.Strings.WString;
URI : out Wiki.Strings.UString;
Width : in out Natural;
Height : in out Natural) is
pragma Unreferenced (Renderer);
begin
URI := Wiki.Strings.To_UString (Link);
Width := 0;
Height := 0;
end Make_Image_Link;
-- ------------------------------
-- Get the page link that must be rendered from the wiki page link.
-- ------------------------------
overriding
procedure Make_Page_Link (Renderer : in out Default_Link_Renderer;
Link : in Wiki.Strings.WString;
URI : out Wiki.Strings.UString;
Exists : out Boolean) is
pragma Unreferenced (Renderer);
begin
URI := Wiki.Strings.To_UString (Link);
Exists := True;
end Make_Page_Link;
end Wiki.Render.Links;
| 41.647059 | 76 | 0.536723 |
a1e2e2c0dfe7526673a67764d0e2e202bce7a105 | 24,084 | ads | Ada | software/hal/hpl/STM32/svd/stm32f429x/stm32_svd-fsmc.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 12 | 2017-06-08T14:19:57.000Z | 2022-03-09T02:48:59.000Z | software/hal/hpl/STM32/svd/stm32f429x/stm32_svd-fsmc.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 6 | 2017-06-08T13:13:50.000Z | 2020-05-15T09:32:43.000Z | software/hal/hpl/STM32/svd/stm32f429x/stm32_svd-fsmc.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 3 | 2017-06-30T14:05:06.000Z | 2022-02-17T12:20:45.000Z | -- This spec has been automatically generated from STM32F429x.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
with HAL;
with System;
package STM32_SVD.FSMC is
pragma Preelaborate;
---------------
-- Registers --
---------------
-------------------
-- BCR1_Register --
-------------------
subtype BCR1_MTYP_Field is HAL.UInt2;
subtype BCR1_MWID_Field is HAL.UInt2;
-- SRAM/NOR-Flash chip-select control register 1
type BCR1_Register is record
-- MBKEN
MBKEN : Boolean := False;
-- MUXEN
MUXEN : Boolean := False;
-- MTYP
MTYP : BCR1_MTYP_Field := 16#0#;
-- MWID
MWID : BCR1_MWID_Field := 16#1#;
-- FACCEN
FACCEN : Boolean := True;
-- unspecified
Reserved_7_7 : HAL.Bit := 16#1#;
-- BURSTEN
BURSTEN : Boolean := False;
-- WAITPOL
WAITPOL : Boolean := False;
-- unspecified
Reserved_10_10 : HAL.Bit := 16#0#;
-- WAITCFG
WAITCFG : Boolean := False;
-- WREN
WREN : Boolean := True;
-- WAITEN
WAITEN : Boolean := True;
-- EXTMOD
EXTMOD : Boolean := False;
-- ASYNCWAIT
ASYNCWAIT : Boolean := False;
-- unspecified
Reserved_16_18 : HAL.UInt3 := 16#0#;
-- CBURSTRW
CBURSTRW : Boolean := False;
-- CCLKEN
CCLKEN : Boolean := False;
-- unspecified
Reserved_21_31 : HAL.UInt11 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BCR1_Register use record
MBKEN at 0 range 0 .. 0;
MUXEN at 0 range 1 .. 1;
MTYP at 0 range 2 .. 3;
MWID at 0 range 4 .. 5;
FACCEN at 0 range 6 .. 6;
Reserved_7_7 at 0 range 7 .. 7;
BURSTEN at 0 range 8 .. 8;
WAITPOL at 0 range 9 .. 9;
Reserved_10_10 at 0 range 10 .. 10;
WAITCFG at 0 range 11 .. 11;
WREN at 0 range 12 .. 12;
WAITEN at 0 range 13 .. 13;
EXTMOD at 0 range 14 .. 14;
ASYNCWAIT at 0 range 15 .. 15;
Reserved_16_18 at 0 range 16 .. 18;
CBURSTRW at 0 range 19 .. 19;
CCLKEN at 0 range 20 .. 20;
Reserved_21_31 at 0 range 21 .. 31;
end record;
------------------
-- BTR_Register --
------------------
subtype BTR1_ADDSET_Field is HAL.UInt4;
subtype BTR1_ADDHLD_Field is HAL.UInt4;
subtype BTR1_DATAST_Field is HAL.Byte;
subtype BTR1_BUSTURN_Field is HAL.UInt4;
subtype BTR1_CLKDIV_Field is HAL.UInt4;
subtype BTR1_DATLAT_Field is HAL.UInt4;
subtype BTR1_ACCMOD_Field is HAL.UInt2;
-- SRAM/NOR-Flash chip-select timing register 1
type BTR_Register is record
-- ADDSET
ADDSET : BTR1_ADDSET_Field := 16#F#;
-- ADDHLD
ADDHLD : BTR1_ADDHLD_Field := 16#F#;
-- DATAST
DATAST : BTR1_DATAST_Field := 16#FF#;
-- BUSTURN
BUSTURN : BTR1_BUSTURN_Field := 16#F#;
-- CLKDIV
CLKDIV : BTR1_CLKDIV_Field := 16#F#;
-- DATLAT
DATLAT : BTR1_DATLAT_Field := 16#F#;
-- ACCMOD
ACCMOD : BTR1_ACCMOD_Field := 16#3#;
-- unspecified
Reserved_30_31 : HAL.UInt2 := 16#3#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BTR_Register use record
ADDSET at 0 range 0 .. 3;
ADDHLD at 0 range 4 .. 7;
DATAST at 0 range 8 .. 15;
BUSTURN at 0 range 16 .. 19;
CLKDIV at 0 range 20 .. 23;
DATLAT at 0 range 24 .. 27;
ACCMOD at 0 range 28 .. 29;
Reserved_30_31 at 0 range 30 .. 31;
end record;
------------------
-- BCR_Register --
------------------
subtype BCR2_MTYP_Field is HAL.UInt2;
subtype BCR2_MWID_Field is HAL.UInt2;
-- SRAM/NOR-Flash chip-select control register 2
type BCR_Register is record
-- MBKEN
MBKEN : Boolean := False;
-- MUXEN
MUXEN : Boolean := False;
-- MTYP
MTYP : BCR2_MTYP_Field := 16#0#;
-- MWID
MWID : BCR2_MWID_Field := 16#1#;
-- FACCEN
FACCEN : Boolean := True;
-- unspecified
Reserved_7_7 : HAL.Bit := 16#1#;
-- BURSTEN
BURSTEN : Boolean := False;
-- WAITPOL
WAITPOL : Boolean := False;
-- WRAPMOD
WRAPMOD : Boolean := False;
-- WAITCFG
WAITCFG : Boolean := False;
-- WREN
WREN : Boolean := True;
-- WAITEN
WAITEN : Boolean := True;
-- EXTMOD
EXTMOD : Boolean := False;
-- ASYNCWAIT
ASYNCWAIT : Boolean := False;
-- unspecified
Reserved_16_18 : HAL.UInt3 := 16#0#;
-- CBURSTRW
CBURSTRW : Boolean := False;
-- unspecified
Reserved_20_31 : HAL.UInt12 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BCR_Register use record
MBKEN at 0 range 0 .. 0;
MUXEN at 0 range 1 .. 1;
MTYP at 0 range 2 .. 3;
MWID at 0 range 4 .. 5;
FACCEN at 0 range 6 .. 6;
Reserved_7_7 at 0 range 7 .. 7;
BURSTEN at 0 range 8 .. 8;
WAITPOL at 0 range 9 .. 9;
WRAPMOD at 0 range 10 .. 10;
WAITCFG at 0 range 11 .. 11;
WREN at 0 range 12 .. 12;
WAITEN at 0 range 13 .. 13;
EXTMOD at 0 range 14 .. 14;
ASYNCWAIT at 0 range 15 .. 15;
Reserved_16_18 at 0 range 16 .. 18;
CBURSTRW at 0 range 19 .. 19;
Reserved_20_31 at 0 range 20 .. 31;
end record;
------------------
-- PCR_Register --
------------------
subtype PCR2_PWID_Field is HAL.UInt2;
subtype PCR2_TCLR_Field is HAL.UInt4;
subtype PCR2_TAR_Field is HAL.UInt4;
subtype PCR2_ECCPS_Field is HAL.UInt3;
-- PC Card/NAND Flash control register 2
type PCR_Register is record
-- unspecified
Reserved_0_0 : HAL.Bit := 16#0#;
-- PWAITEN
PWAITEN : Boolean := False;
-- PBKEN
PBKEN : Boolean := False;
-- PTYP
PTYP : Boolean := True;
-- PWID
PWID : PCR2_PWID_Field := 16#1#;
-- ECCEN
ECCEN : Boolean := False;
-- unspecified
Reserved_7_8 : HAL.UInt2 := 16#0#;
-- TCLR
TCLR : PCR2_TCLR_Field := 16#0#;
-- TAR
TAR : PCR2_TAR_Field := 16#0#;
-- ECCPS
ECCPS : PCR2_ECCPS_Field := 16#0#;
-- unspecified
Reserved_20_31 : HAL.UInt12 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PCR_Register use record
Reserved_0_0 at 0 range 0 .. 0;
PWAITEN at 0 range 1 .. 1;
PBKEN at 0 range 2 .. 2;
PTYP at 0 range 3 .. 3;
PWID at 0 range 4 .. 5;
ECCEN at 0 range 6 .. 6;
Reserved_7_8 at 0 range 7 .. 8;
TCLR at 0 range 9 .. 12;
TAR at 0 range 13 .. 16;
ECCPS at 0 range 17 .. 19;
Reserved_20_31 at 0 range 20 .. 31;
end record;
-----------------
-- SR_Register --
-----------------
-- FIFO status and interrupt register 2
type SR_Register is record
-- IRS
IRS : Boolean := False;
-- ILS
ILS : Boolean := False;
-- IFS
IFS : Boolean := False;
-- IREN
IREN : Boolean := False;
-- ILEN
ILEN : Boolean := False;
-- IFEN
IFEN : Boolean := False;
-- Read-only. FEMPT
FEMPT : Boolean := True;
-- unspecified
Reserved_7_31 : HAL.UInt25 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register use record
IRS at 0 range 0 .. 0;
ILS at 0 range 1 .. 1;
IFS at 0 range 2 .. 2;
IREN at 0 range 3 .. 3;
ILEN at 0 range 4 .. 4;
IFEN at 0 range 5 .. 5;
FEMPT at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
-------------------
-- PMEM_Register --
-------------------
subtype PMEM2_MEMSETx_Field is HAL.Byte;
subtype PMEM2_MEMWAITx_Field is HAL.Byte;
subtype PMEM2_MEMHOLDx_Field is HAL.Byte;
subtype PMEM2_MEMHIZx_Field is HAL.Byte;
-- Common memory space timing register 2
type PMEM_Register is record
-- MEMSETx
MEMSETx : PMEM2_MEMSETx_Field := 16#FC#;
-- MEMWAITx
MEMWAITx : PMEM2_MEMWAITx_Field := 16#FC#;
-- MEMHOLDx
MEMHOLDx : PMEM2_MEMHOLDx_Field := 16#FC#;
-- MEMHIZx
MEMHIZx : PMEM2_MEMHIZx_Field := 16#FC#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PMEM_Register use record
MEMSETx at 0 range 0 .. 7;
MEMWAITx at 0 range 8 .. 15;
MEMHOLDx at 0 range 16 .. 23;
MEMHIZx at 0 range 24 .. 31;
end record;
-------------------
-- PATT_Register --
-------------------
subtype PATT2_ATTSETx_Field is HAL.Byte;
subtype PATT2_ATTWAITx_Field is HAL.Byte;
subtype PATT2_ATTHOLDx_Field is HAL.Byte;
subtype PATT2_ATTHIZx_Field is HAL.Byte;
-- Attribute memory space timing register 2
type PATT_Register is record
-- ATTSETx
ATTSETx : PATT2_ATTSETx_Field := 16#FC#;
-- ATTWAITx
ATTWAITx : PATT2_ATTWAITx_Field := 16#FC#;
-- ATTHOLDx
ATTHOLDx : PATT2_ATTHOLDx_Field := 16#FC#;
-- ATTHIZx
ATTHIZx : PATT2_ATTHIZx_Field := 16#FC#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PATT_Register use record
ATTSETx at 0 range 0 .. 7;
ATTWAITx at 0 range 8 .. 15;
ATTHOLDx at 0 range 16 .. 23;
ATTHIZx at 0 range 24 .. 31;
end record;
-------------------
-- PIO4_Register --
-------------------
subtype PIO4_IOSETx_Field is HAL.Byte;
subtype PIO4_IOWAITx_Field is HAL.Byte;
subtype PIO4_IOHOLDx_Field is HAL.Byte;
subtype PIO4_IOHIZx_Field is HAL.Byte;
-- I/O space timing register 4
type PIO4_Register is record
-- IOSETx
IOSETx : PIO4_IOSETx_Field := 16#FC#;
-- IOWAITx
IOWAITx : PIO4_IOWAITx_Field := 16#FC#;
-- IOHOLDx
IOHOLDx : PIO4_IOHOLDx_Field := 16#FC#;
-- IOHIZx
IOHIZx : PIO4_IOHIZx_Field := 16#FC#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PIO4_Register use record
IOSETx at 0 range 0 .. 7;
IOWAITx at 0 range 8 .. 15;
IOHOLDx at 0 range 16 .. 23;
IOHIZx at 0 range 24 .. 31;
end record;
-------------------
-- BWTR_Register --
-------------------
subtype BWTR1_ADDSET_Field is HAL.UInt4;
subtype BWTR1_ADDHLD_Field is HAL.UInt4;
subtype BWTR1_DATAST_Field is HAL.Byte;
subtype BWTR1_CLKDIV_Field is HAL.UInt4;
subtype BWTR1_DATLAT_Field is HAL.UInt4;
subtype BWTR1_ACCMOD_Field is HAL.UInt2;
-- SRAM/NOR-Flash write timing registers 1
type BWTR_Register is record
-- ADDSET
ADDSET : BWTR1_ADDSET_Field := 16#F#;
-- ADDHLD
ADDHLD : BWTR1_ADDHLD_Field := 16#F#;
-- DATAST
DATAST : BWTR1_DATAST_Field := 16#FF#;
-- unspecified
Reserved_16_19 : HAL.UInt4 := 16#F#;
-- CLKDIV
CLKDIV : BWTR1_CLKDIV_Field := 16#F#;
-- DATLAT
DATLAT : BWTR1_DATLAT_Field := 16#F#;
-- ACCMOD
ACCMOD : BWTR1_ACCMOD_Field := 16#0#;
-- unspecified
Reserved_30_31 : HAL.UInt2 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BWTR_Register use record
ADDSET at 0 range 0 .. 3;
ADDHLD at 0 range 4 .. 7;
DATAST at 0 range 8 .. 15;
Reserved_16_19 at 0 range 16 .. 19;
CLKDIV at 0 range 20 .. 23;
DATLAT at 0 range 24 .. 27;
ACCMOD at 0 range 28 .. 29;
Reserved_30_31 at 0 range 30 .. 31;
end record;
-------------------
-- SDCR_Register --
-------------------
subtype SDCR1_NC_Field is HAL.UInt2;
subtype SDCR1_NR_Field is HAL.UInt2;
subtype SDCR1_MWID_Field is HAL.UInt2;
subtype SDCR1_CAS_Field is HAL.UInt2;
subtype SDCR1_SDCLK_Field is HAL.UInt2;
subtype SDCR1_RPIPE_Field is HAL.UInt2;
-- SDRAM Control Register 1
type SDCR_Register is record
-- Number of column address bits
NC : SDCR1_NC_Field := 16#0#;
-- Number of row address bits
NR : SDCR1_NR_Field := 16#0#;
-- Memory data bus width
MWID : SDCR1_MWID_Field := 16#1#;
-- Number of internal banks
NB : Boolean := True;
-- CAS latency
CAS : SDCR1_CAS_Field := 16#1#;
-- Write protection
WP : Boolean := True;
-- SDRAM clock configuration
SDCLK : SDCR1_SDCLK_Field := 16#0#;
-- Burst read
RBURST : Boolean := False;
-- Read pipe
RPIPE : SDCR1_RPIPE_Field := 16#0#;
-- unspecified
Reserved_15_31 : HAL.UInt17 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SDCR_Register use record
NC at 0 range 0 .. 1;
NR at 0 range 2 .. 3;
MWID at 0 range 4 .. 5;
NB at 0 range 6 .. 6;
CAS at 0 range 7 .. 8;
WP at 0 range 9 .. 9;
SDCLK at 0 range 10 .. 11;
RBURST at 0 range 12 .. 12;
RPIPE at 0 range 13 .. 14;
Reserved_15_31 at 0 range 15 .. 31;
end record;
-------------------
-- SDTR_Register --
-------------------
subtype SDTR1_TMRD_Field is HAL.UInt4;
subtype SDTR1_TXSR_Field is HAL.UInt4;
subtype SDTR1_TRAS_Field is HAL.UInt4;
subtype SDTR1_TRC_Field is HAL.UInt4;
subtype SDTR1_TWR_Field is HAL.UInt4;
subtype SDTR1_TRP_Field is HAL.UInt4;
subtype SDTR1_TRCD_Field is HAL.UInt4;
-- SDRAM Timing register 1
type SDTR_Register is record
-- Load Mode Register to Active
TMRD : SDTR1_TMRD_Field := 16#F#;
-- Exit self-refresh delay
TXSR : SDTR1_TXSR_Field := 16#F#;
-- Self refresh time
TRAS : SDTR1_TRAS_Field := 16#F#;
-- Row cycle delay
TRC : SDTR1_TRC_Field := 16#F#;
-- Recovery delay
TWR : SDTR1_TWR_Field := 16#F#;
-- Row precharge delay
TRP : SDTR1_TRP_Field := 16#F#;
-- Row to column delay
TRCD : SDTR1_TRCD_Field := 16#F#;
-- unspecified
Reserved_28_31 : HAL.UInt4 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SDTR_Register use record
TMRD at 0 range 0 .. 3;
TXSR at 0 range 4 .. 7;
TRAS at 0 range 8 .. 11;
TRC at 0 range 12 .. 15;
TWR at 0 range 16 .. 19;
TRP at 0 range 20 .. 23;
TRCD at 0 range 24 .. 27;
Reserved_28_31 at 0 range 28 .. 31;
end record;
--------------------
-- SDCMR_Register --
--------------------
subtype SDCMR_MODE_Field is HAL.UInt3;
---------------
-- SDCMR.CTB --
---------------
-- SDCMR_CTB array
type SDCMR_CTB_Field_Array is array (1 .. 2) of Boolean
with Component_Size => 1, Size => 2;
-- Type definition for SDCMR_CTB
type SDCMR_CTB_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- CTB as a value
Val : HAL.UInt2;
when True =>
-- CTB as an array
Arr : SDCMR_CTB_Field_Array;
end case;
end record
with Unchecked_Union, Size => 2;
for SDCMR_CTB_Field use record
Val at 0 range 0 .. 1;
Arr at 0 range 0 .. 1;
end record;
subtype SDCMR_NRFS_Field is HAL.UInt4;
subtype SDCMR_MRD_Field is HAL.UInt13;
-- SDRAM Command Mode register
type SDCMR_Register is record
-- Write-only. Command mode
MODE : SDCMR_MODE_Field := 16#0#;
-- Write-only. Command target bank 2
CTB : SDCMR_CTB_Field := (As_Array => False, Val => 16#0#);
-- Number of Auto-refresh
NRFS : SDCMR_NRFS_Field := 16#0#;
-- Mode Register definition
MRD : SDCMR_MRD_Field := 16#0#;
-- unspecified
Reserved_22_31 : HAL.UInt10 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SDCMR_Register use record
MODE at 0 range 0 .. 2;
CTB at 0 range 3 .. 4;
NRFS at 0 range 5 .. 8;
MRD at 0 range 9 .. 21;
Reserved_22_31 at 0 range 22 .. 31;
end record;
--------------------
-- SDRTR_Register --
--------------------
subtype SDRTR_COUNT_Field is HAL.UInt13;
-- SDRAM Refresh Timer register
type SDRTR_Register is record
-- Write-only. Clear Refresh error flag
CRE : Boolean := False;
-- Refresh Timer Count
COUNT : SDRTR_COUNT_Field := 16#0#;
-- RES Interrupt Enable
REIE : Boolean := False;
-- unspecified
Reserved_15_31 : HAL.UInt17 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SDRTR_Register use record
CRE at 0 range 0 .. 0;
COUNT at 0 range 1 .. 13;
REIE at 0 range 14 .. 14;
Reserved_15_31 at 0 range 15 .. 31;
end record;
-------------------
-- SDSR_Register --
-------------------
----------------
-- SDSR.MODES --
----------------
-- SDSR_MODES array element
subtype SDSR_MODES_Element is HAL.UInt2;
-- SDSR_MODES array
type SDSR_MODES_Field_Array is array (1 .. 2) of SDSR_MODES_Element
with Component_Size => 2, Size => 4;
-- Type definition for SDSR_MODES
type SDSR_MODES_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- MODES as a value
Val : HAL.UInt4;
when True =>
-- MODES as an array
Arr : SDSR_MODES_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for SDSR_MODES_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- SDRAM Status register
type SDSR_Register is record
-- Read-only. Refresh error flag
RE : Boolean;
-- Read-only. Status Mode for Bank 1
MODES : SDSR_MODES_Field;
-- Read-only. Busy status
BUSY : Boolean;
-- unspecified
Reserved_6_31 : HAL.UInt26;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SDSR_Register use record
RE at 0 range 0 .. 0;
MODES at 0 range 1 .. 4;
BUSY at 0 range 5 .. 5;
Reserved_6_31 at 0 range 6 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Flexible memory controller
type FMC_Peripheral is record
-- SRAM/NOR-Flash chip-select control register 1
BCR1 : BCR1_Register;
-- SRAM/NOR-Flash chip-select timing register 1
BTR1 : BTR_Register;
-- SRAM/NOR-Flash chip-select control register 2
BCR2 : BCR_Register;
-- SRAM/NOR-Flash chip-select timing register 2
BTR2 : BTR_Register;
-- SRAM/NOR-Flash chip-select control register 3
BCR3 : BCR_Register;
-- SRAM/NOR-Flash chip-select timing register 3
BTR3 : BTR_Register;
-- SRAM/NOR-Flash chip-select control register 4
BCR4 : BCR_Register;
-- SRAM/NOR-Flash chip-select timing register 4
BTR4 : BTR_Register;
-- PC Card/NAND Flash control register 2
PCR2 : PCR_Register;
-- FIFO status and interrupt register 2
SR2 : SR_Register;
-- Common memory space timing register 2
PMEM2 : PMEM_Register;
-- Attribute memory space timing register 2
PATT2 : PATT_Register;
-- ECC result register 2
ECCR2 : HAL.Word;
-- PC Card/NAND Flash control register 3
PCR3 : PCR_Register;
-- FIFO status and interrupt register 3
SR3 : SR_Register;
-- Common memory space timing register 3
PMEM3 : PMEM_Register;
-- Attribute memory space timing register 3
PATT3 : PATT_Register;
-- ECC result register 3
ECCR3 : HAL.Word;
-- PC Card/NAND Flash control register 4
PCR4 : PCR_Register;
-- FIFO status and interrupt register 4
SR4 : SR_Register;
-- Common memory space timing register 4
PMEM4 : PMEM_Register;
-- Attribute memory space timing register 4
PATT4 : PATT_Register;
-- I/O space timing register 4
PIO4 : PIO4_Register;
-- SRAM/NOR-Flash write timing registers 1
BWTR1 : BWTR_Register;
-- SRAM/NOR-Flash write timing registers 2
BWTR2 : BWTR_Register;
-- SRAM/NOR-Flash write timing registers 3
BWTR3 : BWTR_Register;
-- SRAM/NOR-Flash write timing registers 4
BWTR4 : BWTR_Register;
-- SDRAM Control Register 1
SDCR1 : SDCR_Register;
-- SDRAM Control Register 2
SDCR2 : SDCR_Register;
-- SDRAM Timing register 1
SDTR1 : SDTR_Register;
-- SDRAM Timing register 2
SDTR2 : SDTR_Register;
-- SDRAM Command Mode register
SDCMR : SDCMR_Register;
-- SDRAM Refresh Timer register
SDRTR : SDRTR_Register;
-- SDRAM Status register
SDSR : SDSR_Register;
end record
with Volatile;
for FMC_Peripheral use record
BCR1 at 0 range 0 .. 31;
BTR1 at 4 range 0 .. 31;
BCR2 at 8 range 0 .. 31;
BTR2 at 12 range 0 .. 31;
BCR3 at 16 range 0 .. 31;
BTR3 at 20 range 0 .. 31;
BCR4 at 24 range 0 .. 31;
BTR4 at 28 range 0 .. 31;
PCR2 at 96 range 0 .. 31;
SR2 at 100 range 0 .. 31;
PMEM2 at 104 range 0 .. 31;
PATT2 at 108 range 0 .. 31;
ECCR2 at 116 range 0 .. 31;
PCR3 at 128 range 0 .. 31;
SR3 at 132 range 0 .. 31;
PMEM3 at 136 range 0 .. 31;
PATT3 at 140 range 0 .. 31;
ECCR3 at 148 range 0 .. 31;
PCR4 at 160 range 0 .. 31;
SR4 at 164 range 0 .. 31;
PMEM4 at 168 range 0 .. 31;
PATT4 at 172 range 0 .. 31;
PIO4 at 176 range 0 .. 31;
BWTR1 at 260 range 0 .. 31;
BWTR2 at 268 range 0 .. 31;
BWTR3 at 276 range 0 .. 31;
BWTR4 at 284 range 0 .. 31;
SDCR1 at 320 range 0 .. 31;
SDCR2 at 324 range 0 .. 31;
SDTR1 at 328 range 0 .. 31;
SDTR2 at 332 range 0 .. 31;
SDCMR at 336 range 0 .. 31;
SDRTR at 340 range 0 .. 31;
SDSR at 344 range 0 .. 31;
end record;
-- Flexible memory controller
FMC_Periph : aliased FMC_Peripheral
with Import, Address => FMC_Base;
end STM32_SVD.FSMC;
| 30.956298 | 76 | 0.538698 |
4d5d85284a60c2894c5acd6ab8b3001e18c8f0b9 | 2,877 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c4/c41327a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c4/c41327a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c4/c41327a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C41327A.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- CHECK THAT IMPLICITLY DECLARED EQUALITY AND INEQUALITY OPERATORS
-- MAY BE SELECTED FROM OUTSIDE A PACKAGE USING AN EXPANDED NAME, FOR
-- A PRIVATE TYPE.
-- TBN 7/18/86
WITH REPORT; USE REPORT;
PROCEDURE C41327A IS
PACKAGE P IS
TYPE KEY IS PRIVATE;
TYPE CHAR IS PRIVATE;
FUNCTION INIT_KEY (X : NATURAL) RETURN KEY;
FUNCTION INIT_CHAR (X : CHARACTER) RETURN CHAR;
PRIVATE
TYPE KEY IS NEW NATURAL;
TYPE CHAR IS NEW CHARACTER;
END P;
VAR_KEY_1 : P.KEY;
VAR_KEY_2 : P.KEY;
VAR_CHAR_1 : P.CHAR;
VAR_CHAR_2 : P.CHAR;
PACKAGE BODY P IS
FUNCTION INIT_KEY (X : NATURAL) RETURN KEY IS
BEGIN
RETURN (KEY (X));
END INIT_KEY;
FUNCTION INIT_CHAR (X : CHARACTER) RETURN CHAR IS
BEGIN
RETURN (CHAR (X));
END INIT_CHAR;
BEGIN
NULL;
END P;
BEGIN
TEST ("C41327A", "CHECK THAT IMPLICITLY DECLARED EQUALITY AND " &
"INEQUALITY OPERATORS MAY BE SELECTED FROM " &
"OUTSIDE A PACKAGE USING AN EXPANDED NAME, " &
"FOR A PRIVATE TYPE");
VAR_KEY_1 := P.INIT_KEY (1);
VAR_KEY_2 := P.INIT_KEY (2);
VAR_CHAR_1 := P.INIT_CHAR ('A');
VAR_CHAR_2 := P.INIT_CHAR ('A');
IF P."=" (VAR_KEY_1, VAR_KEY_2) THEN
FAILED ("INCORRECT RESULTS FROM EXPANDED NAME - 1");
END IF;
IF P."/=" (VAR_CHAR_1, VAR_CHAR_2) THEN
FAILED ("INCORRECT RESULTS FROM EXPANDED NAME - 2");
END IF;
RESULT;
END C41327A;
| 33.847059 | 79 | 0.615919 |
d06f0d1a110fc2857d54a34da0423889ba77c045 | 151 | ads | Ada | 1-base/math/source/precision/float/pure/float_math-geometry-d2.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2022-01-20T07:13:42.000Z | 2022-01-20T07:13:42.000Z | 1-base/math/source/precision/float/pure/float_math-geometry-d2.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | 1-base/math/source/precision/float/pure/float_math-geometry-d2.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | with
any_Math.any_Geometry.any_d2;
package float_math.Geometry.d2 is new float_Math.Geometry.any_d2;
pragma Pure (float_math.Geometry.d2);
| 21.571429 | 70 | 0.768212 |
066728d9be58c6a1122af0728aedec6bdc4e26c9 | 3,623 | ads | Ada | source/amf/uml/amf-uml-conditional_nodes-hash.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-uml-conditional_nodes-hash.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-uml-conditional_nodes-hash.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements.Generic_Hash;
function AMF.UML.Conditional_Nodes.Hash is
new AMF.Elements.Generic_Hash (UML_Conditional_Node, UML_Conditional_Node_Access);
| 72.46 | 84 | 0.404361 |
0689615d3191f6b5fbdaaa3c9b90bad70ea2bf21 | 9,105 | adb | Ada | source/asis/xasis/xasis-static-discrete.adb | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | 4 | 2016-02-05T15:51:56.000Z | 2022-03-25T20:38:32.000Z | source/asis/xasis/xasis-static-discrete.adb | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | null | null | null | source/asis/xasis/xasis-static-discrete.adb | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- G E L A X A S I S --
-- ASIS implementation for Gela project, a portable Ada compiler --
-- http://gela.ada-ru.org --
-- - - - - - - - - - - - - - - - --
-- Read copyright and license at the end of this file --
------------------------------------------------------------------------------
-- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $
with Asis.Expressions;
package body XASIS.Static.Discrete is
use Asis;
use XASIS.Integers;
use Asis.Expressions;
-----------------
-- Is_Discrete --
-----------------
function Is_Discrete (Right : Value) return Boolean is
begin
return Right.Kind = Static_Discrete;
end Is_Discrete;
-------
-- B --
-------
function B (Data : Boolean) return Value is
begin
if Data then
return Static_True;
else
return Static_False;
end if;
end B;
-------
-- I --
-------
function I (Data : XASIS.Integers.Value) return Value is
begin
return (Static_Discrete, Data);
end I;
--------------
-- Evaluate --
--------------
function Evaluate
(Object : Type_Class;
Kind : Asis.Operator_Kinds;
Args : Asis.Association_List)
return Value
is
begin
case Kind is
when A_Unary_Plus_Operator =>
return Evaluate (Actual_Parameter (Args (1)));
when A_Unary_Minus_Operator | An_Abs_Operator | A_Not_Operator =>
declare
Item : Value renames
Evaluate (Actual_Parameter (Args (1)));
begin
if not Is_Discrete (Item) then
return Undefined;
elsif Kind = A_Unary_Minus_Operator then
return I (-Item.Pos);
elsif Kind = An_Abs_Operator then
return I (abs Item.Pos);
else
return B (Item.Pos = Zero);
end if;
end;
when others =>
declare
Left : Value renames
Evaluate (Actual_Parameter (Args (1)));
Right : Value renames
Evaluate (Actual_Parameter (Args (2)));
begin
if Is_Discrete (Left) and Is_Discrete (Right) then
case Kind is
when An_And_Operator =>
return I (Left.Pos and Right.Pos);
when An_Or_Operator =>
return I (Left.Pos or Right.Pos);
when An_Xor_Operator =>
return I (Left.Pos xor Right.Pos);
when An_Equal_Operator =>
return B (Left.Pos = Right.Pos);
when A_Not_Equal_Operator =>
return B (Left.Pos /= Right.Pos);
when A_Less_Than_Operator =>
return B (Left.Pos < Right.Pos);
when A_Less_Than_Or_Equal_Operator =>
return B (Left.Pos <= Right.Pos);
when A_Greater_Than_Operator =>
return B (Left.Pos > Right.Pos);
when A_Greater_Than_Or_Equal_Operator =>
return B (Left.Pos >= Right.Pos);
when others =>
null;
end case;
else
return Undefined;
end if;
end;
end case;
Raise_Error (Internal_Error);
return Undefined;
end Evaluate;
--------------
-- Evaluate --
--------------
function Evaluate
(Object : Type_Class;
Kind : Asis.Attribute_Kinds;
Args : Asis.Association_List)
return Value
is
begin
case Kind is
when A_Pos_Attribute
| A_Pred_Attribute
| A_Succ_Attribute
| A_Val_Attribute =>
declare
Item : Value renames
Evaluate (Actual_Parameter (Args (1)));
begin
if not Is_Discrete (Item) then
return Undefined;
end if;
case Kind is
when A_Pos_Attribute | A_Val_Attribute =>
return Item;
when A_Pred_Attribute =>
return I (Item.Pos - One);
when A_Succ_Attribute =>
return I (Item.Pos + One);
when others =>
null;
end case;
end;
when A_Max_Attribute | A_Min_Attribute =>
declare
Left : Value renames
Evaluate (Actual_Parameter (Args (1)));
Right : Value renames
Evaluate (Actual_Parameter (Args (2)));
begin
if Is_Discrete (Left) and Is_Discrete (Right) then
case Kind is
when A_Max_Attribute =>
if Left.Pos > Right.Pos then
return Left;
else
return Right;
end if;
when A_Min_Attribute =>
if Left.Pos < Right.Pos then
return Left;
else
return Right;
end if;
when others =>
null;
end case;
else
return Undefined;
end if;
end;
when others =>
null;
end case;
Raise_Error (Internal_Error);
return Undefined;
end Evaluate;
--------------
-- Evaluate --
--------------
function Evaluate
(Object : Type_Class;
Kind : Asis.Attribute_Kinds;
Element : Asis.Expression)
return Value
is
begin
if not Classes.Is_Declaration (Object.Info)
and Kind /= A_First_Attribute
and Kind /= A_Last_Attribute
and Kind /= A_Length_Attribute
then
Raise_Error (Internal_Error);
end if;
case Kind is
when An_Alignment_Attribute
| A_Max_Size_In_Storage_Elements_Attribute
| A_Size_Attribute
| A_Stream_Size_Attribute
| A_Wide_Wide_Width_Attribute
| A_Wide_Width_Attribute
| A_Width_Attribute
=>
return Undefined;
when A_First_Attribute =>
declare
Rng : Static_Range := Static_Range_Attribute (Element);
begin
return Rng (Lower);
end;
when A_Last_Attribute =>
declare
Rng : Static_Range := Static_Range_Attribute (Element);
begin
return Rng (Upper);
end;
when others =>
null;
end case;
Raise_Error (Internal_Error);
return Undefined;
end Evaluate;
end XASIS.Static.Discrete;
------------------------------------------------------------------------------
-- 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.
------------------------------------------------------------------------------
| 32.98913 | 79 | 0.493355 |
fb08e64125b1e380b6462dd39158a0a2d37ead2d | 30,660 | adb | Ada | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-libm.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-libm.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-libm.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . L I B M --
-- --
-- B o d y --
-- --
-- Copyright (C) 2014-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This is the Ada Cert Math specific version of s-libm.adb
-- When Cody and Waite implementation is cited, it refers to the
-- Software Manual for the Elementary Functions by William J. Cody, Jr.
-- and William Waite, published by Prentice-Hall Series in Computational
-- Mathematics. Copyright 1980. ISBN 0-13-822064-6.
-- When Hart implementation is cited, it refers to
-- "Computer Approximations" by John F. Hart, published by Krieger.
-- Copyright 1968, Reprinted 1978 w/ corrections. ISBN 0-88275-642-7.
with Ada.Numerics; use Ada.Numerics;
package body System.Libm is
type Unsigned_64 is mod 2**64;
generic
type T is private;
with function Multiply_Add (X, Y, Z : T) return T is <>;
-- The Multiply_Add function returns the value of X * Y + Z, ideally
-- (but not necessarily) using a wider intermediate type, or a fused
-- multiply-add operation with only a single rounding. They are used
-- for evaluating polynomials.
package Generic_Polynomials is
type Polynomial is array (Natural range <>) of T;
-- A value P of type PolynomialRepresents the polynomial
-- P (X) = P_0 + P_1 * X + ... + P_(n-1) * X**(n-1) + P_n * X**n,
--
-- where n = P'Length - 1, P_0 is P (P'First) and P_n is P (P'Last)
-- P (X) = P_0 + X * (P_1 + X * (P_2 + X * (... + X * P_n)))
function Compute_Horner (P : Polynomial; X : T) return T with Inline;
-- Computes the polynomial P using the Horner scheme:
-- P (X) = P_0 + X * (P_1 + X * (P_2 + X * (... + X * P_n)))
end Generic_Polynomials;
-------------------------
-- Generic_Polynomials --
-------------------------
package body Generic_Polynomials is
--------------------
-- Compute_Horner --
---------------------
function Compute_Horner (P : Polynomial; X : T) return T is
Result : T := P (P'Last);
begin
for P_j of reverse P (P'First .. P'Last - 1) loop
Result := Multiply_Add (Result, X, P_j);
end loop;
return Result;
end Compute_Horner;
end Generic_Polynomials;
----------------------------
-- Generic_Approximations --
----------------------------
package body Generic_Approximations is
function Multiply_Add (X, Y, Z : T) return T is (X * Y + Z);
package Float_Polynomials is new Generic_Polynomials (T);
use Float_Polynomials;
-----------------
-- Approx_Asin --
-----------------
function Approx_Asin (X : T) return T is
P : T;
Q : T;
begin
if Mantissa <= 24 then
declare
-- Approximation MRE = 6.0128E-9
P1 : constant T := Exact (0.93393_5835);
P2 : constant T := Exact (-0.50440_0557);
Q0 : constant T := Exact (5.6036_3004);
Q1 : constant T := Exact (-5.5484_6723);
begin
P := Compute_Horner ((P1, P2), X);
Q := Compute_Horner ((Q0, Q1 + X), X);
end;
else
declare
-- Approximation MRE = 2.0975E-18
P1 : constant T := Exact (-0.27368_49452_41642_55994E+2);
P2 : constant T := Exact (+0.57208_22787_78917_31407E+2);
P3 : constant T := Exact (-0.39688_86299_75048_77339E+2);
P4 : constant T := Exact (+0.10152_52223_38064_63645E+2);
P5 : constant T := Exact (-0.69674_57344_73506_46411);
Q0 : constant T := Exact (-0.16421_09671_44985_60795E+3);
Q1 : constant T := Exact (+0.41714_43024_82604_12556E+3);
Q2 : constant T := Exact (-0.38186_30336_17501_49284E+3);
Q3 : constant T := Exact (+0.15095_27084_10306_04719E+3);
Q4 : constant T := Exact (-0.23823_85915_36702_38830E+2);
begin
P := Compute_Horner ((P1, P2, P3, P4, P5), X);
Q := Compute_Horner ((Q0, Q1, Q2, Q3, Q4 + X), X);
end;
end if;
return X * P / Q;
end Approx_Asin;
-----------------
-- Approx_Atan --
-----------------
function Approx_Atan (X : T) return T is
G : constant T := X * X;
P, Q : T;
begin
if Mantissa <= 24 then
declare
-- Approximation MRE = 3.2002E-9
P0 : constant T := Exact (-0.47083_25141);
P1 : constant T := Exact (-0.50909_58253E-1);
Q0 : constant T := Exact (0.14125_00740E1);
begin
P := Compute_Horner ((P0, P1), G);
Q := Q0 + G;
end;
else
declare
-- Approximation MRE = 1.8154E-18
P0 : constant T := Exact (-0.13688_76889_41919_26929E2);
P1 : constant T := Exact (-0.20505_85519_58616_51981E2);
P2 : constant T := Exact (-0.84946_24035_13206_83534E1);
P3 : constant T := Exact (-0.83758_29936_81500_59274);
Q0 : constant T := Exact (0.41066_30668_25757_81263E2);
Q1 : constant T := Exact (0.86157_34959_71302_42515E2);
Q2 : constant T := Exact (0.59578_43614_25973_44465E2);
Q3 : constant T := Exact (0.15024_00116_00285_76121E2);
begin
P := Compute_Horner ((P0, P1, P2, P3), G);
Q := Compute_Horner ((Q0, Q1, Q2, Q3 + G), G);
end;
end if;
return Multiply_Add (X, (G * P / Q), X);
end Approx_Atan;
function Approx_Cos (X : T) return T is
-- Note: The reference tables named below for cosine lists
-- constants for cos((pi/4) * x) ~= P (x^2), in order to get
-- cos (x), the constants have been adjusted by division of
-- appropriate powers of (pi/4) ^ n, for n 0,2,4,6 etc.
Cos_P : constant Polynomial :=
(if Mantissa <= 24
then
-- Hart's constants : #COS 3821# (p. 209)
-- Approximation MRE = 8.1948E-9 ???
(0 => Exact (0.99999_99999),
1 => Exact (-0.49999_99957),
2 => Exact (0.41666_61323E-1),
3 => Exact (-0.13888_52915E-2),
4 => Exact (0.24372_67909E-4))
elsif Mantissa <= 53
then
-- Hart's constants : #COS 3824# (p. 209)
-- Approximation MRE = 1.2548E-18
(0 => Exact (0.99999_99999_99999_99995),
1 => Exact (-0.49999_99999_99999_99279),
2 => Exact (+0.04166_66666_66666_430254),
3 => Exact (-0.13888_88888_88589_60433E-2),
4 => Exact (+0.24801_58728_28994_63022E-4),
5 => Exact (-0.27557_31286_56960_82219E-6),
6 => Exact (+0.20875_55514_56778_82872E-8),
7 => Exact (-0.11352_12320_57839_39582E-10))
else
-- Hart's constants : #COS 3825# (p. 209-210)
-- Approximation MRE = ???
(0 => Exact (+1.0),
1 => Exact (-0.49999_99999_99999_99994_57899),
2 => Exact (+0.41666_66666_66666_66467_89627E-1),
3 => Exact (-0.13888_88888_88888_57508_03579E-2),
4 => Exact (+0.24801_58730_15616_31808_80662E-4),
5 => Exact (-0.27557_31921_21557_14660_22522E-6),
6 => Exact (+0.20876_75377_75228_35357_18906E-8),
7 => Exact (-0.11470_23678_56189_18819_10735E-10),
8 => Exact (+0.47358_93914_72413_21156_01793E-13)));
begin
return Compute_Horner (Cos_P, X * X);
end Approx_Cos;
----------------
-- Approx_Exp --
----------------
function Approx_Exp (X : T) return T is
-- Cody and Waite implementation (page 69)
Exp_P : constant Polynomial :=
(if Mantissa <= 24
then -- Approximation MRE = 8.1529E-10
(0 => Exact (0.24999_99995_0),
1 => Exact (0.41602_88626_0E-2))
elsif Mantissa <= 53
then -- Approximation MRE = 1.0259E-17
(0 => Exact (0.24999_99999_99999_993),
1 => Exact (0.69436_00015_11792_852E-2),
2 => Exact (0.16520_33002_68279_130E-4))
else
(0 => Exact (0.25),
1 => Exact (0.75753_18015_94227_76666E-2),
2 => Exact (0.31555_19276_56846_46356E-4)));
Exp_Q : constant Polynomial :=
(if Mantissa <= 24
then
(0 => Exact (0.5),
1 => Exact (0.49987_17877_8E-1))
elsif Mantissa <= 53
then
(0 => Exact (0.5),
1 => Exact (0.55553_86669_69001_188E-1),
2 => Exact (0.49586_28849_05441_294E-3))
else
(0 => Exact (0.5),
1 => Exact (0.56817_30269_85512_21787E-1),
2 => Exact (0.63121_89437_43985_03557E-3),
3 => Exact (0.75104_02839_98700_46114E-6)));
G : constant T := X * X;
P : T;
Q : T;
begin
P := Compute_Horner (Exp_P, G);
Q := Compute_Horner (Exp_Q, G);
return Exact (2.0) * Multiply_Add (X, P / (Multiply_Add (-X, P, Q)),
Exact (0.5));
end Approx_Exp;
----------------
-- Approx_Log --
----------------
function Approx_Log (X : T) return T is
Log_P : constant Polynomial :=
(if Mantissa <= 24
then -- Approximation MRE = 1.0368E-10
(0 => Exact (-0.46490_62303_464),
1 => Exact (0.013600_95468_621))
else -- Approximation MRE = 4.7849E-19
(0 => Exact (-0.64124_94342_37455_81147E+2),
1 => Exact (0.16383_94356_30215_34222E+2),
2 => Exact (-0.78956_11288_74912_57267)));
Log_Q : constant Polynomial :=
(if Mantissa <= 24
then
(0 => Exact (-5.5788_73750_242),
1 => Exact (1.0))
else
(0 => Exact (-0.76949_93210_84948_79777E+3),
1 => Exact (0.31203_22209_19245_32844E+3),
2 => Exact (-0.35667_97773_90346_46171E+2),
3 => Exact (1.0)));
G : T;
P : T;
Q : T;
ZNum, ZDen, Z : T;
begin
ZNum := (X + Exact (-0.5)) + Exact (-0.5);
ZDen := X * Exact (0.5) + Exact (0.5);
Z := ZNum / ZDen;
G := Z * Z;
P := Compute_Horner (Log_P, G);
Q := Compute_Horner (Log_Q, G);
return Multiply_Add (Z, G * (P / Q), Z);
end Approx_Log;
----------------------
-- Approx_Power Log --
----------------------
function Approx_Power_Log (X : T) return T is
Power_Log_P : constant Polynomial :=
(if Mantissa <= 24
then -- Approximation MRE = 7.9529E-4
(1 => Exact (0.83357_541E-1))
else -- Approximation MRE = 8.7973E-8
(1 => Exact (0.83333_33333_33332_11405E-1),
2 => Exact (0.12500_00000_05037_99174E-1),
3 => Exact (0.22321_42128_59242_58967E-2),
4 => Exact (0.43445_77567_21631_19635E-3)));
K : constant T := Exact (0.44269_50408_88963_40736);
G : constant T := X * X;
P : T;
begin
P := Compute_Horner (Power_Log_P, G);
P := (P * G) * X;
P := Multiply_Add (P, K, P);
return Multiply_Add (X, K, P) + X;
end Approx_Power_Log;
-----------------
-- Approx_Exp2 --
-----------------
function Approx_Exp2 (X : T) return T is
Exp2_P : constant Polynomial :=
(if Mantissa > 24
then -- Approximation MRE = 1.7418E-17
(1 => Exact (0.69314_71805_59945_29629),
2 => Exact (0.24022_65069_59095_37056),
3 => Exact (0.55504_10866_40855_95326E-1),
4 => Exact (0.96181_29059_51724_16964E-2),
5 => Exact (0.13333_54131_35857_84703E-2),
6 => Exact (0.15400_29044_09897_64601E-3),
7 => Exact (0.14928_85268_05956_08186E-4))
else -- Approximation MRE = 3.3642E-9
(1 => Exact (0.69314_675),
2 => Exact (0.24018_510),
3 => Exact (0.54360_383E-1)));
begin
return Exact (1.0) + Compute_Horner (Exp2_P, X) * X;
end Approx_Exp2;
----------------
-- Approx_Sin --
----------------
function Approx_Sin (X : T) return T is
-- Note: The reference tables named below for sine lists constants
-- for sin((pi/4) * x) ~= x * P (x^2), in order to get sin (x),
-- the constants have been adjusted by division of appropriate
-- powers of (pi/4) ^ n, for n 1,3,5, etc.
Sin_P : constant Polynomial :=
(if Mantissa <= 24
then
-- Hart's constants: #SIN 3040# (p. 199)
(1 => Exact (-0.16666_65022),
2 => Exact (0.83320_16396E-2),
3 => Exact (-0.19501_81843E-3))
else
-- Hart's constants: #SIN 3044# (p. 199)
-- Approximation MRE = 2.4262E-18 ???
(1 => Exact (-0.16666_66666_66666_66628),
2 => Exact (0.83333_33333_33332_03335E-2),
3 => Exact (-0.19841_26984_12531_05860E-3),
4 => Exact (0.27557_31921_33901_68712E-5),
5 => Exact (-0.25052_10473_82673_30950E-7),
6 => Exact (0.16058_34762_32246_06553E-9),
7 => Exact (-0.75778_67884_01271_15607E-12)));
Sqrt_Epsilon_LLF : constant Long_Long_Float :=
Sqrt_2 ** (1 - Long_Long_Float'Machine_Mantissa);
G : constant T := X * X;
begin
if abs X <= Exact (Sqrt_Epsilon_LLF) then
return X;
end if;
return Multiply_Add (X, Compute_Horner (Sin_P, G) * G, X);
end Approx_Sin;
-----------------
-- Approx_Sinh --
-----------------
function Approx_Sinh (X : T) return T is
Sinh_P : constant Polynomial :=
(if Mantissa <= 24
then -- Approximation MRE = 2.6841E-8
(0 => Exact (-0.71379_3159E1),
1 => Exact (-0.19033_3300))
else -- Approximation MRE = 4.6429E-18
(0 => Exact (-0.35181_28343_01771_17881E6),
1 => Exact (-0.11563_52119_68517_68270E5),
2 => Exact (-0.16375_79820_26307_51372E3),
3 => Exact (-0.78966_12741_73570_99479)));
Sinh_Q : constant Polynomial :=
(if Mantissa <= 24
then
(0 => Exact (-0.42827_7109E2),
1 => Exact (1.0))
else
(0 => Exact (-0.21108_77005_81062_71242E7),
1 => Exact (0.36162_72310_94218_36460E5),
2 => Exact (-0.27773_52311_96507_01667E3),
3 => Exact (1.0)));
G : constant T := X * X;
P : T;
Q : T;
begin
P := Compute_Horner (Sinh_P, G);
Q := Compute_Horner (Sinh_Q, G);
return Multiply_Add (X, (G * P / Q), X);
end Approx_Sinh;
----------------
-- Approx_Tan --
----------------
function Approx_Tan (X : T) return T is
Tan_P : constant Polynomial :=
(if Mantissa <= 24
then -- Approximation MRE = 2.7824E-8
(1 => Exact (-0.95801_7723E-1))
else -- Approximation MRE = 3.5167E-18
(1 => Exact (-0.13338_35000_64219_60681),
2 => Exact (0.34248_87823_58905_89960E-2),
3 => Exact (-0.17861_70734_22544_26711E-4)));
Tan_Q : constant Polynomial :=
(if Mantissa <= 24
then
(0 => Exact (1.0),
1 => Exact (-0.42913_5777),
2 => Exact (0.97168_5835E-2))
else
(0 => Exact (1.0),
1 => Exact (-0.46671_68333_97552_94240),
2 => Exact (0.25663_83228_94401_12864E-1),
3 => Exact (-0.31181_53190_70100_27307E-3),
4 => Exact (0.49819_43399_37865_12270E-6)));
G : constant T := X * X;
P : constant T := Multiply_Add (X, G * Compute_Horner (Tan_P, G), X);
Q : constant T := Compute_Horner (Tan_Q, G);
begin
return P / Q;
end Approx_Tan;
----------------
-- Approx_Cot --
----------------
function Approx_Cot (X : T) return T is
Tan_P : constant Polynomial :=
(if Mantissa <= 24
then -- Approxmiation MRE = 1.5113E-17
(1 => Exact (-0.95801_7723E-1))
else
(1 => Exact (-0.13338_35000_64219_60681),
2 => Exact (0.34248_87823_58905_89960E-2),
3 => Exact (-0.17861_70734_22544_26711E-4)));
Tan_Q : constant Polynomial :=
(if Mantissa <= 24
then
(0 => Exact (1.0),
1 => Exact (-0.42913_5777),
2 => Exact (0.97168_5835E-2))
else
(0 => Exact (1.0),
1 => Exact (-0.46671_68333_97552_94240),
2 => Exact (0.25663_83228_94401_12864E-1),
3 => Exact (-0.31181_53190_70100_27307E-3),
4 => Exact (0.49819_43399_37865_12270E-6)));
G : constant T := X * X;
P : constant T := Multiply_Add (X, G * Compute_Horner (Tan_P, G), X);
Q : constant T := Compute_Horner (Tan_Q, G);
begin
return -Q / P;
end Approx_Cot;
-----------------
-- Approx_Tanh --
-----------------
function Approx_Tanh (X : T) return T is
Tanh_P : constant Polynomial :=
(if Mantissa <= 24
then -- Approximation MRE = 2.7166E-9
(0 => Exact (-0.82377_28127),
1 => Exact (-0.38310_10665E-2))
else -- Approximation MRE = 3.2436E-18
(0 => Exact (-0.16134_11902_39962_28053E4),
1 => Exact (-0.99225_92967_22360_83313E2),
2 => Exact (-0.96437_49277_72254_69787)));
Tanh_Q : constant Polynomial :=
(if Mantissa <= 24
then
(0 => Exact (2.4713_19654),
1 => Exact (1.0))
else
(0 => Exact (0.48402_35707_19886_88686E4),
1 => Exact (0.22337_72071_89623_12926E4),
2 => Exact (0.11274_47438_05349_49335E3),
3 => Exact (1.0)));
G : constant T := X * X;
P, Q : T;
begin
P := Compute_Horner (Tanh_P, G);
Q := Compute_Horner (Tanh_Q, G);
return Multiply_Add (X, G * P / Q, X);
end Approx_Tanh;
----------
-- Asin --
----------
function Asin (X : T) return T is
-- Cody and Waite implementation (page 174)
Y : T := abs X;
G : T;
Result : T;
begin
if Y <= Exact (0.5) then
Result := X + X * Approx_Asin (X * X);
else
G := (Exact (1.0) + (-Y)) * Exact (0.5);
Y := Sqrt (G);
Result :=
Exact (Pi / 2.0) - Exact (2.0) * (Y + Y * Approx_Asin (G));
if not (Exact (0.0) <= X) then
Result := -Result;
end if;
end if;
return Result;
end Asin;
end Generic_Approximations;
------------------
-- Generic_Acos --
------------------
function Generic_Acos (X : T) return T is
-- Cody and Waite implementation (page 174)
Y : T := abs (X);
G : T;
Result : T;
begin
if Y <= 0.5 then
-- No reduction needed
G := Y * Y;
Result := T'Copy_Sign (Y + Y * Approx_Asin (G), X);
return 0.5 * Pi - Result;
end if;
-- In the reduction step that follows, it is not Y, but rather G that
-- is reduced. The reduced G is in 0.0 .. 0.25.
G := (1.0 - Y) / 2.0;
Y := -2.0 * Sqrt (G);
Result := Y + Y * Approx_Asin (G);
return (if X < 0.0 then Pi + Result else -Result);
end Generic_Acos;
-------------------
-- Generic_Atan2 --
-------------------
-- Ada expected values:
-- Atan2 (y, x) returns a result in [-Pi, Pi]
function Generic_Atan2 (Y, X : T) return T is
-- Cody and Waite implementation (page 194)
F : T;
N : Integer := -1;
-- Default value for N is -1 so that if X=0 or over/underflow
-- tests on N are all false.
Result : T;
begin
if Y = 0.0 and then X = 0.0 then
-- Atan2 (+-0, -0) = +-Pi
-- Atan2 (+-0, +0) = +-0
if T'Copy_Sign (1.0, X) < 0.0 then
return T'Copy_Sign (Pi, Y);
else
return T'Copy_Sign (0.0, Y);
end if;
elsif Y = 0.0 and then abs (X) > 0.0 then
-- Atan2 (+-0, x) = +-Pi, if x < 0
-- Atan2 (+-0, x) = +-0, if x > 0
if X < 0.0 then
return T'Copy_Sign (Pi, Y);
else
return T'Copy_Sign (0.0, Y);
end if;
elsif X = 0.0 then
-- Atan2 (y, +-0) = -0.5 * Pi, if y < 0
-- Atan2 (y, +-0) = 0.5 * Pi, if y > 0
return T'Copy_Sign (Half_Pi, Y);
elsif abs (Y) > 0.0 and then abs (Y) <= T'Last
and then abs (X) = Infinity
then
-- Atan2 (+-y, -INF) = +-Pi, if x < 0 and y is finite
-- (tightly approximated)
-- Atan2 (+-y, +INF) = +-0, if x > 0 and y is finite
if X < 0.0 then
Result := T'Copy_Sign (Pi, Y);
else
Result := T'Copy_Sign (0.0, Y);
end if;
elsif abs (X) <= T'Last and then abs (Y) = Infinity then
-- Atan2 (+-INF, x) = +-0.5 * Pi, if x is finite
-- (tightly approximated)
Result := T'Copy_Sign (Half_Pi, Y);
elsif abs (X) = Infinity and then abs (Y) = Infinity then
-- Atan2 (+-INF, -INF) = +-0.75 * Pi (tightly approximated)
-- Atan2 (+-INF, +INF) = +-0.25 * Pi (tightly approximated)
if X < 0.0 then
return T'Copy_Sign (3.0 * Pi / 4.0, Y);
else
return T'Copy_Sign (Pi / 4.0, Y);
end if;
else
-- Be careful not to divide Y/X until we know it won't overflow
if abs (Y) > abs (X) then
F := abs (X / Y);
N := 2;
else
F := abs (Y / X);
N := 0;
end if;
if F > 2.0 - Sqrt_3 then
F := (((Sqrt_3 - 1.0) * F - 1.0) + F) / (Sqrt_3 + F);
N := N + 1;
end if;
Result := Approx_Atan (F);
end if;
if N > 1 then
Result := -Result;
end if;
case N is
when 1 => Result := Result + Sixth_Pi;
when 2 => Result := Result + Half_Pi;
when 3 => Result := Result + Third_Pi;
when others => null;
end case;
if T'Copy_Sign (1.0, X) < 0.0 then
Result := Pi - Result;
end if;
return T'Copy_Sign (Result, Y);
end Generic_Atan2;
procedure Generic_Pow_Special_Cases
(Left : T;
Right : T;
Is_Special : out Boolean;
Negate : out Boolean;
Result : out T)
is
------------
-- Is_Even --
------------
function Is_Even (X : T) return Boolean is
(abs X >= 2.0**T'Machine_Mantissa
or else Unsigned_64 (abs X) mod 2 = 0);
pragma Assert (T'Machine_Mantissa <= 64);
-- If X is large enough, then X is a multiple of 2. Otherwise,
-- conversion to Unsigned_64 is safe, assuming a mantissa of at
-- most 64 bits.
begin
Is_Special := True;
Negate := False;
Result := 0.0;
-- value 'Result' is not used if the input is
-- not a couple of special values
if Right = 0.0 or else not (Left /= 1.0) then
Result := (if Right = 0.0 then 1.0 else Left);
elsif Left = 0.0 then
if Right < 0.0 then
if Right = T'Rounding (Right) and then not Is_Even (Right) then
Result := 1.0 / Left; -- Infinity with sign of Left
else
Result := 1.0 / abs Left; -- +Infinity
end if;
else
if Right = T'Rounding (Right)
and then not Is_Even (Right)
then
Result := Left;
else
Result := +0.0;
end if;
end if;
elsif abs (Right) > T'Last and then Left = -1.0 then
Result := 1.0;
elsif Left < 0.0
and then Left >= T'First
and then abs (Right) <= T'Last
and then Right /= T'Rounding (Right)
then
Result := 0.0 / (Left - Left); -- NaN
elsif Right < T'First then
if abs (Left) < 1.0 then
Result := -Right; -- Infinity
else
Result := 0.0; -- Cases where Left=+-1 are dealt with above
end if;
elsif Right > T'Last then
if abs (Left) < 1.0 then
Result := 0.0;
else
Result := Right;
end if;
elsif Left > T'Last then
if Right < 0.0 then
Result := 0.0;
else
Result := Left;
end if;
elsif Left < T'First then
if Right > 0.0 then
if Right = T'Rounding (Right)
and then not Is_Even (Right)
then
Result := Left;
else
Result := -Left; -- -Left = +INF
end if;
else
if Right = T'Rounding (Right)
and then not Is_Even (Right)
then
Result := -0.0;
else
Result := +0.0;
end if;
end if;
else
Is_Special := False;
if Left < 0.0
and then Left >= T'First
and then abs (Right) <= T'Last
and then Right = T'Rounding (Right)
and then not Is_Even (Right)
then
Negate := True;
end if;
end if;
end Generic_Pow_Special_Cases;
end System.Libm;
| 35.241379 | 78 | 0.434475 |
31303f71d7e0684439cf1f919b34a0869d4a9b6a | 277 | adb | Ada | tests/exec/function1.adb | xuedong/mini-ada | 59a8b966cf50ba22a3b5a7cb449f671e4da32e44 | [
"MIT"
] | null | null | null | tests/exec/function1.adb | xuedong/mini-ada | 59a8b966cf50ba22a3b5a7cb449f671e4da32e44 | [
"MIT"
] | 1 | 2019-03-10T19:13:21.000Z | 2019-03-10T19:19:46.000Z | tests/exec/function1.adb | xuedong/mini-ada | 59a8b966cf50ba22a3b5a7cb449f671e4da32e44 | [
"MIT"
] | null | null | null | with Ada.Text_IO; use Ada.Text_IO;
procedure Test is
function F return character is
begin return 'a';
end F;
function G(C: Character) return character is
begin return c;
end G;
begin
Put(F); New_Line;
Put(G('b')); New_Line;
Put(G(F)); New_Line;
end;
| 19.785714 | 47 | 0.65704 |
31ae279dbb4702f810c06e6e620d877259318fc3 | 1,601 | ads | Ada | tools/aflex/src/main_body.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | tools/aflex/src/main_body.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | tools/aflex/src/main_body.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | -- Copyright (c) 1990 Regents of the University of California.
-- All rights reserved.
--
-- This software was developed by John Self of the Arcadia project
-- at the University of California, Irvine.
--
-- Redistribution and use in source and binary forms are permitted
-- provided that the above copyright notice and this paragraph are
-- duplicated in all such forms and that any documentation,
-- advertising materials, and other materials related to such
-- distribution and use acknowledge that the software was developed
-- by the University of California, Irvine. The name of the
-- University may not be used to endorse or promote products derived
-- from this software without specific prior written permission.
-- THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
-- IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
-- WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
-- TITLE main body
-- AUTHOR: John Self (UCI)
-- DESCRIPTION driver routines for aflex. Calls drivers for all
-- high level routines from other packages.
-- $Header: /co/ua/self/arcadia/aflex/ada/src/RCS/mainS.a,v 1.5 90/01/12 15:20:14 self Exp Locker: self $
-- aflex - tool to generate fast lexical analyzers
package MAIN_BODY is
procedure Aflex_End (Status : Integer);
-- aflexend - terminate aflex
--
-- note
-- This routine does not return.
procedure Aflex_Init;
-- aflexinit - initialize aflex
procedure READIN;
procedure SET_UP_INITIAL_ALLOCATIONS;
AFLEX_TERMINATE : exception;
TERMINATION_STATUS : INTEGER;
end MAIN_BODY;
| 37.232558 | 105 | 0.75203 |
4dea2e64d2fc794c2302d205d16489ff4deba720 | 70,424 | adb | Ada | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/a-cbdlli.adb | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/a-cbdlli.adb | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/a-cbdlli.adb | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- ADA.CONTAINERS.BOUNDED_DOUBLY_LINKED_LISTS --
-- --
-- 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 System; use type System.Address;
package body Ada.Containers.Bounded_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
-----------------------
-- Local Subprograms --
-----------------------
procedure Allocate
(Container : in out List;
New_Item : Element_Type;
New_Node : out Count_Type);
procedure Allocate
(Container : in out List;
Stream : not null access Root_Stream_Type'Class;
New_Node : out Count_Type);
procedure Free
(Container : in out List;
X : Count_Type);
procedure Insert_Internal
(Container : in out List;
Before : Count_Type;
New_Node : Count_Type);
procedure Splice_Internal
(Target : in out List;
Before : Count_Type;
Source : in out List);
procedure Splice_Internal
(Target : in out List;
Before : Count_Type;
Source : in out List;
Src_Pos : Count_Type;
Tgt_Pos : out Count_Type);
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);
LN : Node_Array renames Left.Nodes;
RN : Node_Array renames Right.Nodes;
LI : Count_Type := Left.First;
RI : Count_Type := Right.First;
begin
for J in 1 .. Left.Length loop
if LN (LI).Element /= RN (RI).Element then
return False;
end if;
LI := LN (LI).Next;
RI := RN (RI).Next;
end loop;
end;
return True;
end "=";
--------------
-- Allocate --
--------------
procedure Allocate
(Container : in out List;
New_Item : Element_Type;
New_Node : out Count_Type)
is
N : Node_Array renames Container.Nodes;
begin
if Container.Free >= 0 then
New_Node := Container.Free;
-- We always perform the assignment first, before we change container
-- state, in order to defend against exceptions duration assignment.
N (New_Node).Element := New_Item;
Container.Free := N (New_Node).Next;
else
-- A negative free store value means that the links of the nodes in
-- the free store have not been initialized. In this case, the nodes
-- are physically contiguous in the array, starting at the index that
-- is the absolute value of the Container.Free, and continuing until
-- the end of the array (Nodes'Last).
New_Node := abs Container.Free;
-- As above, we perform this assignment first, before modifying any
-- container state.
N (New_Node).Element := New_Item;
Container.Free := Container.Free - 1;
end if;
end Allocate;
procedure Allocate
(Container : in out List;
Stream : not null access Root_Stream_Type'Class;
New_Node : out Count_Type)
is
N : Node_Array renames Container.Nodes;
begin
if Container.Free >= 0 then
New_Node := Container.Free;
-- We always perform the assignment first, before we change container
-- state, in order to defend against exceptions duration assignment.
Element_Type'Read (Stream, N (New_Node).Element);
Container.Free := N (New_Node).Next;
else
-- A negative free store value means that the links of the nodes in
-- the free store have not been initialized. In this case, the nodes
-- are physically contiguous in the array, starting at the index that
-- is the absolute value of the Container.Free, and continuing until
-- the end of the array (Nodes'Last).
New_Node := abs Container.Free;
-- As above, we perform this assignment first, before modifying any
-- container state.
Element_Type'Read (Stream, N (New_Node).Element);
Container.Free := Container.Free - 1;
end if;
end Allocate;
------------
-- 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
SN : Node_Array renames Source.Nodes;
J : Count_Type;
begin
if Target'Address = Source'Address then
return;
end if;
if Checks and then Target.Capacity < Source.Length then
raise Capacity_Error -- ???
with "Target capacity is less than Source length";
end if;
Target.Clear;
J := Source.First;
while J /= 0 loop
Target.Append (SN (J).Element);
J := SN (J).Next;
end loop;
end Assign;
-----------
-- Clear --
-----------
procedure Clear (Container : in out List) is
N : Node_Array renames Container.Nodes;
X : Count_Type;
begin
if Container.Length = 0 then
pragma Assert (Container.First = 0);
pragma Assert (Container.Last = 0);
pragma Assert (Container.TC = (Busy => 0, Lock => 0));
return;
end if;
pragma Assert (Container.First >= 1);
pragma Assert (Container.Last >= 1);
pragma Assert (N (Container.First).Prev = 0);
pragma Assert (N (Container.Last).Next = 0);
TC_Check (Container.TC);
while Container.Length > 1 loop
X := Container.First;
pragma Assert (N (N (X).Next).Prev = Container.First);
Container.First := N (X).Next;
N (Container.First).Prev := 0;
Container.Length := Container.Length - 1;
Free (Container, X);
end loop;
X := Container.First;
pragma Assert (X = Container.Last);
Container.First := 0;
Container.Last := 0;
Container.Length := 0;
Free (Container, 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;
pragma Assert (Vet (Position), "bad cursor in Constant_Reference");
declare
N : Node_Type renames Container.Nodes (Position.Node);
TC : constant Tamper_Counts_Access :=
Container.TC'Unrestricted_Access;
begin
return R : constant Constant_Reference_Type :=
(Element => N.Element'Access,
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; Capacity : Count_Type := 0) return List 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 : List (Capacity => C) do
Assign (Target => Target, Source => Source);
end return;
end Copy;
------------
-- Delete --
------------
procedure Delete
(Container : in out List;
Position : in out Cursor;
Count : Count_Type := 1)
is
N : Node_Array renames Container.Nodes;
X : Count_Type;
begin
if Checks and then Position.Node = 0 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;
pragma Assert (Vet (Position), "bad cursor in Delete");
pragma Assert (Container.First >= 1);
pragma Assert (Container.Last >= 1);
pragma Assert (N (Container.First).Prev = 0);
pragma Assert (N (Container.Last).Next = 0);
if Position.Node = Container.First then
Delete_First (Container, Count);
Position := No_Element;
return;
end if;
if Count = 0 then
Position := No_Element;
return;
end if;
TC_Check (Container.TC);
for Index in 1 .. Count loop
pragma Assert (Container.Length >= 2);
X := Position.Node;
Container.Length := Container.Length - 1;
if X = Container.Last then
Position := No_Element;
Container.Last := N (X).Prev;
N (Container.Last).Next := 0;
Free (Container, X);
return;
end if;
Position.Node := N (X).Next;
N (N (X).Next).Prev := N (X).Prev;
N (N (X).Prev).Next := N (X).Next;
Free (Container, X);
end loop;
Position := No_Element;
end Delete;
------------------
-- Delete_First --
------------------
procedure Delete_First
(Container : in out List;
Count : Count_Type := 1)
is
N : Node_Array renames Container.Nodes;
X : Count_Type;
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 (N (N (X).Next).Prev = Container.First);
Container.First := N (X).Next;
N (Container.First).Prev := 0;
Container.Length := Container.Length - 1;
Free (Container, X);
end loop;
end Delete_First;
-----------------
-- Delete_Last --
-----------------
procedure Delete_Last
(Container : in out List;
Count : Count_Type := 1)
is
N : Node_Array renames Container.Nodes;
X : Count_Type;
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 (N (N (X).Prev).Next = Container.Last);
Container.Last := N (X).Prev;
N (Container.Last).Next := 0;
Container.Length := Container.Length - 1;
Free (Container, X);
end loop;
end Delete_Last;
-------------
-- Element --
-------------
function Element (Position : Cursor) return Element_Type is
begin
if Checks and then Position.Node = 0 then
raise Constraint_Error with
"Position cursor has no element";
end if;
pragma Assert (Vet (Position), "bad cursor in Element");
return Position.Container.Nodes (Position.Node).Element;
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
Nodes : Node_Array renames Container.Nodes;
Node : Count_Type := Position.Node;
begin
if Node = 0 then
Node := Container.First;
else
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 /= 0 loop
if Nodes (Node).Element = Item then
return Cursor'(Container'Unrestricted_Access, Node);
end if;
Node := Nodes (Node).Next;
end loop;
return No_Element;
end;
end Find;
-----------
-- First --
-----------
function First (Container : List) return Cursor is
begin
if Container.First = 0 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 0, 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 positive, the iterator object was constructed
-- with a start expression, that specifies the position from which the
-- (forward) partial iteration begins.
if Object.Node = 0 then
return Bounded_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 = 0 then
raise Constraint_Error with "list is empty";
end if;
return Container.Nodes (Container.First).Element;
end First_Element;
----------
-- Free --
----------
procedure Free
(Container : in out List;
X : Count_Type)
is
pragma Assert (X > 0);
pragma Assert (X <= Container.Capacity);
N : Node_Array renames Container.Nodes;
pragma Assert (N (X).Prev >= 0); -- node is active
begin
-- The list container actually contains two lists: one for the "active"
-- nodes that contain elements that have been inserted onto the list,
-- and another for the "inactive" nodes for the free store.
-- We desire that merely declaring an object should have only minimal
-- cost; specially, we want to avoid having to initialize the free
-- store (to fill in the links), especially if the capacity is large.
-- The head of the free list is indicated by Container.Free. If its
-- value is non-negative, then the free store has been initialized in
-- the "normal" way: Container.Free points to the head of the list of
-- free (inactive) nodes, and the value 0 means the free list is empty.
-- Each node on the free list has been initialized to point to the next
-- free node (via its Next component), and the value 0 means that this
-- is the last free node.
-- If Container.Free is negative, then the links on the free store have
-- not been initialized. In this case the link values are implied: the
-- free store comprises the components of the node array started with
-- the absolute value of Container.Free, and continuing until the end of
-- the array (Nodes'Last).
-- If the list container is manipulated on one end only (for example if
-- the container were being used as a stack), then there is no need to
-- initialize the free store, since the inactive nodes are physically
-- contiguous (in fact, they lie immediately beyond the logical end
-- being manipulated). The only time we need to actually initialize the
-- nodes in the free store is if the node that becomes inactive is not
-- at the end of the list. The free store would then be discontiguous
-- and so its nodes would need to be linked in the traditional way.
-- ???
-- It might be possible to perform an optimization here. Suppose that
-- the free store can be represented as having two parts: one comprising
-- the non-contiguous inactive nodes linked together in the normal way,
-- and the other comprising the contiguous inactive nodes (that are not
-- linked together, at the end of the nodes array). This would allow us
-- to never have to initialize the free store, except in a lazy way as
-- nodes become inactive.
-- When an element is deleted from the list container, its node becomes
-- inactive, and so we set its Prev component to a negative value, to
-- indicate that it is now inactive. This provides a useful way to
-- detect a dangling cursor reference (and which is used in Vet).
N (X).Prev := -1; -- Node is deallocated (not on active list)
if Container.Free >= 0 then
-- The free store has previously been initialized. All we need to
-- do here is link the newly-free'd node onto the free list.
N (X).Next := Container.Free;
Container.Free := X;
elsif X + 1 = abs Container.Free then
-- The free store has not been initialized, and the node becoming
-- inactive immediately precedes the start of the free store. All
-- we need to do is move the start of the free store back by one.
-- Note: initializing Next to zero is not strictly necessary but
-- seems cleaner and marginally safer.
N (X).Next := 0;
Container.Free := Container.Free + 1;
else
-- The free store has not been initialized, and the node becoming
-- inactive does not immediately precede the free store. Here we
-- first initialize the free store (meaning the links are given
-- values in the traditional way), and then link the newly-free'd
-- node onto the head of the free store.
-- ???
-- See the comments above for an optimization opportunity. If the
-- next link for a node on the free store is negative, then this
-- means the remaining nodes on the free store are physically
-- contiguous, starting as the absolute value of that index value.
Container.Free := abs Container.Free;
if Container.Free > Container.Capacity then
Container.Free := 0;
else
for I in Container.Free .. Container.Capacity - 1 loop
N (I).Next := I + 1;
end loop;
N (Container.Capacity).Next := 0;
end if;
N (X).Next := Container.Free;
Container.Free := X;
end if;
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);
Nodes : Node_Array renames Container.Nodes;
Node : Count_Type;
begin
Node := Container.First;
for J in 2 .. Container.Length loop
if Nodes (Nodes (Node).Next).Element < Nodes (Node).Element then
return False;
end if;
Node := Nodes (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;
if Checks and then Target.Length + Source.Length > Target.Capacity
then
raise Capacity_Error with "new length exceeds target capacity";
end if;
TC_Check (Target.TC);
TC_Check (Source.TC);
-- Per AI05-0022, the container implementation is required to detect
-- element tampering by a generic actual subprogram.
declare
Lock_Target : With_Lock (Target.TC'Unchecked_Access);
Lock_Source : With_Lock (Source.TC'Unchecked_Access);
LN : Node_Array renames Target.Nodes;
RN : Node_Array renames Source.Nodes;
LI, LJ, RI, RJ : Count_Type;
begin
LI := Target.First;
RI := Source.First;
while RI /= 0 loop
pragma Assert (RN (RI).Next = 0
or else not (RN (RN (RI).Next).Element <
RN (RI).Element));
if LI = 0 then
Splice_Internal (Target, 0, Source);
exit;
end if;
pragma Assert (LN (LI).Next = 0
or else not (LN (LN (LI).Next).Element <
LN (LI).Element));
if RN (RI).Element < LN (LI).Element then
RJ := RI;
RI := RN (RI).Next;
Splice_Internal (Target, LI, Source, RJ, LJ);
else
LI := LN (LI).Next;
end if;
end loop;
end;
end Merge;
----------
-- Sort --
----------
procedure Sort (Container : in out List) is
N : Node_Array renames Container.Nodes;
procedure Partition (Pivot, Back : Count_Type);
-- What does this do ???
procedure Sort (Front, Back : Count_Type);
-- Internal procedure, what does it do??? rename it???
---------------
-- Partition --
---------------
procedure Partition (Pivot, Back : Count_Type) is
Node : Count_Type;
begin
Node := N (Pivot).Next;
while Node /= Back loop
if N (Node).Element < N (Pivot).Element then
declare
Prev : constant Count_Type := N (Node).Prev;
Next : constant Count_Type := N (Node).Next;
begin
N (Prev).Next := Next;
if Next = 0 then
Container.Last := Prev;
else
N (Next).Prev := Prev;
end if;
N (Node).Next := Pivot;
N (Node).Prev := N (Pivot).Prev;
N (Pivot).Prev := Node;
if N (Node).Prev = 0 then
Container.First := Node;
else
N (N (Node).Prev).Next := Node;
end if;
Node := Next;
end;
else
Node := N (Node).Next;
end if;
end loop;
end Partition;
----------
-- Sort --
----------
procedure Sort (Front, Back : Count_Type) is
Pivot : constant Count_Type :=
(if Front = 0 then Container.First else N (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 (N (Container.First).Prev = 0);
pragma Assert (N (Container.Last).Next = 0);
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 => 0, Back => 0);
end;
pragma Assert (N (Container.First).Prev = 0);
pragma Assert (N (Container.Last).Next = 0);
end Sort;
end Generic_Sorting;
------------------------
-- Get_Element_Access --
------------------------
function Get_Element_Access
(Position : Cursor) return not null Element_Access is
begin
return Position.Container.Nodes (Position.Node).Element'Access;
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 /= 0;
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 : Count_Type;
New_Node : Count_Type;
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;
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 > Container.Capacity - Count then
raise Capacity_Error with "capacity exceeded";
end if;
TC_Check (Container.TC);
Allocate (Container, New_Item, New_Node);
First_Node := New_Node;
Insert_Internal (Container, Before.Node, New_Node);
for Index in Count_Type'(2) .. Count loop
Allocate (Container, New_Item, New_Node);
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;
procedure Insert
(Container : in out List;
Before : Cursor;
Position : out Cursor;
Count : Count_Type := 1)
is
pragma Warnings (Off);
Default_Initialized_Item : Element_Type;
pragma Unmodified (Default_Initialized_Item);
-- OK to reference, see below. Note that we need to suppress both the
-- front end warning and the back end warning. In addition, pragma
-- Unmodified is needed to suppress the warning ``actual type for
-- "Element_Type" should be fully initialized type'' on certain
-- instantiations.
begin
-- There is no explicit element provided, but in an instance the element
-- type may be a scalar with a Default_Value aspect, or a composite
-- type with such a scalar component, or components with default
-- initialization, so insert the specified number of possibly
-- initialized elements at the given position.
Insert (Container, Before, Default_Initialized_Item, Position, Count);
pragma Warnings (On);
end Insert;
---------------------
-- Insert_Internal --
---------------------
procedure Insert_Internal
(Container : in out List;
Before : Count_Type;
New_Node : Count_Type)
is
N : Node_Array renames Container.Nodes;
begin
if Container.Length = 0 then
pragma Assert (Before = 0);
pragma Assert (Container.First = 0);
pragma Assert (Container.Last = 0);
Container.First := New_Node;
N (Container.First).Prev := 0;
Container.Last := New_Node;
N (Container.Last).Next := 0;
-- Before = zero means append
elsif Before = 0 then
pragma Assert (N (Container.Last).Next = 0);
N (Container.Last).Next := New_Node;
N (New_Node).Prev := Container.Last;
Container.Last := New_Node;
N (Container.Last).Next := 0;
-- Before = Container.First means prepend
elsif Before = Container.First then
pragma Assert (N (Container.First).Prev = 0);
N (Container.First).Prev := New_Node;
N (New_Node).Next := Container.First;
Container.First := New_Node;
N (Container.First).Prev := 0;
else
pragma Assert (N (Container.First).Prev = 0);
pragma Assert (N (Container.Last).Next = 0);
N (New_Node).Next := Before;
N (New_Node).Prev := N (Before).Prev;
N (N (Before).Prev).Next := New_Node;
N (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 : Count_Type := Container.First;
begin
while Node /= 0 loop
Process (Cursor'(Container'Unrestricted_Access, Node));
Node := Container.Nodes (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 0 (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 => 0)
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 positive (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 = 0 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 0, 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 positive, the iterator object was constructed
-- with a start expression, that specifies the position from which the
-- (reverse) partial iteration begins.
if Object.Node = 0 then
return Bounded_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 = 0 then
raise Constraint_Error with "list is empty";
end if;
return Container.Nodes (Container.Last).Element;
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
N : Node_Array renames Source.Nodes;
X : Count_Type;
begin
if Target'Address = Source'Address then
return;
end if;
if Checks and then Target.Capacity < Source.Length then
raise Capacity_Error with "Source length exceeds Target capacity";
end if;
TC_Check (Source.TC);
-- Clear target, note that this checks busy bits of Target
Clear (Target);
while Source.Length > 1 loop
pragma Assert (Source.First in 1 .. Source.Capacity);
pragma Assert (Source.Last /= Source.First);
pragma Assert (N (Source.First).Prev = 0);
pragma Assert (N (Source.Last).Next = 0);
-- Copy first element from Source to Target
X := Source.First;
Append (Target, N (X).Element);
-- Unlink first node of Source
Source.First := N (X).Next;
N (Source.First).Prev := 0;
Source.Length := Source.Length - 1;
-- The representation invariants for Source have been restored. It is
-- now safe to free the unlinked node, without fear of corrupting the
-- active links of Source.
-- Note that the algorithm we use here models similar algorithms used
-- in the unbounded form of the doubly-linked list container. In that
-- case, Free is an instantation of Unchecked_Deallocation, which can
-- fail (because PE will be raised if controlled Finalize fails), so
-- we must defer the call until the last step. Here in the bounded
-- form, Free merely links the node we have just "deallocated" onto a
-- list of inactive nodes, so technically Free cannot fail. However,
-- for consistency, we handle Free the same way here as we do for the
-- unbounded form, with the pessimistic assumption that it can fail.
Free (Source, X);
end loop;
if Source.Length = 1 then
pragma Assert (Source.First in 1 .. Source.Capacity);
pragma Assert (Source.Last = Source.First);
pragma Assert (N (Source.First).Prev = 0);
pragma Assert (N (Source.Last).Next = 0);
-- Copy element from Source to Target
X := Source.First;
Append (Target, N (X).Element);
-- Unlink node of Source
Source.First := 0;
Source.Last := 0;
Source.Length := 0;
-- Return the unlinked node to the free store
Free (Source, X);
end if;
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 = 0 then
return No_Element;
end if;
pragma Assert (Vet (Position), "bad cursor in Next");
declare
Nodes : Node_Array renames Position.Container.Nodes;
Node : constant Count_Type := Nodes (Position.Node).Next;
begin
if Node = 0 then
return No_Element;
else
return Cursor'(Position.Container, Node);
end if;
end;
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 = 0 then
return No_Element;
end if;
pragma Assert (Vet (Position), "bad cursor in Previous");
declare
Nodes : Node_Array renames Position.Container.Nodes;
Node : constant Count_Type := Nodes (Position.Node).Prev;
begin
if Node = 0 then
return No_Element;
else
return Cursor'(Position.Container, Node);
end if;
end;
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 = 0 then
raise Constraint_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);
C : List renames Position.Container.all'Unrestricted_Access.all;
N : Node_Type renames C.Nodes (Position.Node);
begin
Process (N.Element);
end;
end Query_Element;
----------
-- Read --
----------
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out List)
is
N : Count_Type'Base;
X : Count_Type;
begin
Clear (Item);
Count_Type'Base'Read (Stream, N);
if Checks and then N < 0 then
raise Program_Error with "bad list length (corrupt stream)";
end if;
if N = 0 then
return;
end if;
if Checks and then N > Item.Capacity then
raise Constraint_Error with "length exceeds capacity";
end if;
for Idx in 1 .. N loop
Allocate (Item, Stream, New_Node => X);
Insert_Internal (Item, Before => 0, New_Node => X);
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;
pragma Assert (Vet (Position), "bad cursor in function Reference");
declare
N : Node_Type renames Container.Nodes (Position.Node);
TC : constant Tamper_Counts_Access :=
Container.TC'Unrestricted_Access;
begin
return R : constant Reference_Type :=
(Element => N.Element'Access,
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);
pragma Assert (Vet (Position), "bad cursor in Replace_Element");
Container.Nodes (Position.Node).Element := New_Item;
end Replace_Element;
----------------------
-- Reverse_Elements --
----------------------
procedure Reverse_Elements (Container : in out List) is
N : Node_Array renames Container.Nodes;
I : Count_Type := Container.First;
J : Count_Type := Container.Last;
procedure Swap (L, R : Count_Type);
----------
-- Swap --
----------
procedure Swap (L, R : Count_Type) is
LN : constant Count_Type := N (L).Next;
LP : constant Count_Type := N (L).Prev;
RN : constant Count_Type := N (R).Next;
RP : constant Count_Type := N (R).Prev;
begin
if LP /= 0 then
N (LP).Next := R;
end if;
if RN /= 0 then
N (RN).Prev := L;
end if;
N (L).Next := RN;
N (R).Prev := LP;
if LN = R then
pragma Assert (RP = L);
N (L).Prev := R;
N (R).Next := L;
else
N (L).Prev := RP;
N (RP).Next := L;
N (R).Next := LN;
N (LN).Prev := R;
end if;
end Swap;
-- Start of processing for Reverse_Elements
begin
if Container.Length <= 1 then
return;
end if;
pragma Assert (N (Container.First).Prev = 0);
pragma Assert (N (Container.Last).Next = 0);
TC_Check (Container.TC);
Container.First := J;
Container.Last := I;
loop
Swap (L => I, R => J);
J := N (J).Next;
exit when I = J;
I := N (I).Prev;
exit when I = J;
Swap (L => J, R => I);
I := N (I).Next;
exit when I = J;
J := N (J).Prev;
exit when I = J;
end loop;
pragma Assert (N (Container.First).Prev = 0);
pragma Assert (N (Container.Last).Next = 0);
end Reverse_Elements;
------------------
-- Reverse_Find --
------------------
function Reverse_Find
(Container : List;
Item : Element_Type;
Position : Cursor := No_Element) return Cursor
is
Node : Count_Type := Position.Node;
begin
if Node = 0 then
Node := Container.Last;
else
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 /= 0 loop
if Container.Nodes (Node).Element = Item then
return Cursor'(Container'Unrestricted_Access, Node);
end if;
Node := Container.Nodes (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 : Count_Type := Container.Last;
begin
while Node /= 0 loop
Process (Cursor'(Container'Unrestricted_Access, Node));
Node := Container.Nodes (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;
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;
if Checks and then Target.Length + Source.Length > Target.Capacity then
raise Capacity_Error with "new length exceeds target capacity";
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
N : Node_Array renames Container.Nodes;
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;
pragma Assert (Vet (Before), "bad Before cursor in Splice");
end if;
if Checks and then Position.Node = 0 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;
pragma Assert (Vet (Position), "bad Position cursor in Splice");
if Position.Node = Before.Node
or else N (Position.Node).Next = Before.Node
then
return;
end if;
pragma Assert (Container.Length >= 2);
TC_Check (Container.TC);
if Before.Node = 0 then
pragma Assert (Position.Node /= Container.Last);
if Position.Node = Container.First then
Container.First := N (Position.Node).Next;
N (Container.First).Prev := 0;
else
N (N (Position.Node).Prev).Next := N (Position.Node).Next;
N (N (Position.Node).Next).Prev := N (Position.Node).Prev;
end if;
N (Container.Last).Next := Position.Node;
N (Position.Node).Prev := Container.Last;
Container.Last := Position.Node;
N (Container.Last).Next := 0;
return;
end if;
if Before.Node = Container.First then
pragma Assert (Position.Node /= Container.First);
if Position.Node = Container.Last then
Container.Last := N (Position.Node).Prev;
N (Container.Last).Next := 0;
else
N (N (Position.Node).Prev).Next := N (Position.Node).Next;
N (N (Position.Node).Next).Prev := N (Position.Node).Prev;
end if;
N (Container.First).Prev := Position.Node;
N (Position.Node).Next := Container.First;
Container.First := Position.Node;
N (Container.First).Prev := 0;
return;
end if;
if Position.Node = Container.First then
Container.First := N (Position.Node).Next;
N (Container.First).Prev := 0;
elsif Position.Node = Container.Last then
Container.Last := N (Position.Node).Prev;
N (Container.Last).Next := 0;
else
N (N (Position.Node).Prev).Next := N (Position.Node).Next;
N (N (Position.Node).Next).Prev := N (Position.Node).Prev;
end if;
N (N (Before.Node).Prev).Next := Position.Node;
N (Position.Node).Prev := N (Before.Node).Prev;
N (Before.Node).Prev := Position.Node;
N (Position.Node).Next := Before.Node;
pragma Assert (N (Container.First).Prev = 0);
pragma Assert (N (Container.Last).Next = 0);
end Splice;
procedure Splice
(Target : in out List;
Before : Cursor;
Source : in out List;
Position : in out Cursor)
is
Target_Position : Count_Type;
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;
pragma Assert (Vet (Before), "bad Before cursor in Splice");
end if;
if Checks and then Position.Node = 0 then
raise Constraint_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 >= Target.Capacity then
raise Capacity_Error with "Target is full";
end if;
TC_Check (Target.TC);
TC_Check (Source.TC);
Splice_Internal
(Target => Target,
Before => Before.Node,
Source => Source,
Src_Pos => Position.Node,
Tgt_Pos => Target_Position);
Position := Cursor'(Target'Unrestricted_Access, Target_Position);
end Splice;
---------------------
-- Splice_Internal --
---------------------
procedure Splice_Internal
(Target : in out List;
Before : Count_Type;
Source : in out List)
is
N : Node_Array renames Source.Nodes;
X : Count_Type;
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 /= 0);
pragma Assert (N (Source.First).Prev = 0);
pragma Assert (Source.Last /= 0);
pragma Assert (N (Source.Last).Next = 0);
pragma Assert (Target.Length <= Count_Type'Last - Source.Length);
pragma Assert (Target.Length + Source.Length <= Target.Capacity);
while Source.Length > 1 loop
-- Copy first element of Source onto Target
Allocate (Target, N (Source.First).Element, New_Node => X);
Insert_Internal (Target, Before => Before, New_Node => X);
-- Unlink the first node from Source
X := Source.First;
pragma Assert (N (N (X).Next).Prev = X);
Source.First := N (X).Next;
N (Source.First).Prev := 0;
Source.Length := Source.Length - 1;
-- Return the Source node to its free store
Free (Source, X);
end loop;
-- Copy first (and only remaining) element of Source onto Target
Allocate (Target, N (Source.First).Element, New_Node => X);
Insert_Internal (Target, Before => Before, New_Node => X);
-- Unlink the node from Source
X := Source.First;
pragma Assert (X = Source.Last);
Source.First := 0;
Source.Last := 0;
Source.Length := 0;
-- Return the Source node to its free store
Free (Source, X);
end Splice_Internal;
procedure Splice_Internal
(Target : in out List;
Before : Count_Type; -- node of Target
Source : in out List;
Src_Pos : Count_Type; -- node of Source
Tgt_Pos : out Count_Type)
is
N : Node_Array renames Source.Nodes;
begin
-- This implements the corresponding Splice operation, after the
-- parameters have been vetted, and corner-cases handled.
pragma Assert (Target'Address /= Source'Address);
pragma Assert (Target.Length < Target.Capacity);
pragma Assert (Source.Length > 0);
pragma Assert (Source.First /= 0);
pragma Assert (N (Source.First).Prev = 0);
pragma Assert (Source.Last /= 0);
pragma Assert (N (Source.Last).Next = 0);
pragma Assert (Src_Pos /= 0);
Allocate (Target, N (Src_Pos).Element, New_Node => Tgt_Pos);
Insert_Internal (Target, Before => Before, New_Node => Tgt_Pos);
if Source.Length = 1 then
pragma Assert (Source.First = Source.Last);
pragma Assert (Src_Pos = Source.First);
Source.First := 0;
Source.Last := 0;
elsif Src_Pos = Source.First then
pragma Assert (N (N (Src_Pos).Next).Prev = Src_Pos);
Source.First := N (Src_Pos).Next;
N (Source.First).Prev := 0;
elsif Src_Pos = Source.Last then
pragma Assert (N (N (Src_Pos).Prev).Next = Src_Pos);
Source.Last := N (Src_Pos).Prev;
N (Source.Last).Next := 0;
else
pragma Assert (Source.Length >= 3);
pragma Assert (N (N (Src_Pos).Next).Prev = Src_Pos);
pragma Assert (N (N (Src_Pos).Prev).Next = Src_Pos);
N (N (Src_Pos).Next).Prev := N (Src_Pos).Prev;
N (N (Src_Pos).Prev).Next := N (Src_Pos).Next;
end if;
Source.Length := Source.Length - 1;
Free (Source, Src_Pos);
end Splice_Internal;
----------
-- Swap --
----------
procedure Swap
(Container : in out List;
I, J : Cursor)
is
begin
if Checks and then I.Node = 0 then
raise Constraint_Error with "I cursor has no element";
end if;
if Checks and then J.Node = 0 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 : Element_Type renames Container.Nodes (I.Node).Element;
EJ : Element_Type renames Container.Nodes (J.Node).Element;
EI_Copy : constant Element_Type := EI;
begin
EI := EJ;
EJ := 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 = 0 then
raise Constraint_Error with "I cursor has no element";
end if;
if Checks and then J.Node = 0 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;
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 = 0 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;
pragma Assert (Vet (Position), "bad cursor in Update_Element");
declare
Lock : With_Lock (Container.TC'Unchecked_Access);
N : Node_Type renames Container.Nodes (Position.Node);
begin
Process (N.Element);
end;
end Update_Element;
---------
-- Vet --
---------
function Vet (Position : Cursor) return Boolean is
begin
if Position.Node = 0 then
return Position.Container = null;
end if;
if Position.Container = null then
return False;
end if;
declare
L : List renames Position.Container.all;
N : Node_Array renames L.Nodes;
begin
if L.Length = 0 then
return False;
end if;
if L.First = 0 or L.First > L.Capacity then
return False;
end if;
if L.Last = 0 or L.Last > L.Capacity then
return False;
end if;
if N (L.First).Prev /= 0 then
return False;
end if;
if N (L.Last).Next /= 0 then
return False;
end if;
if Position.Node > L.Capacity then
return False;
end if;
-- An invariant of an active node is that its Previous and Next
-- components are non-negative. Operation Free sets the Previous
-- component of the node to the value -1 before actually deallocating
-- the node, to mark the node as inactive. (By "dellocating" we mean
-- only that the node is linked onto a list of inactive nodes used
-- for storage.) This marker gives us a simple way to detect a
-- dangling reference to a node.
if N (Position.Node).Prev < 0 then -- see Free
return False;
end if;
if N (Position.Node).Prev > L.Capacity then
return False;
end if;
if N (Position.Node).Next = Position.Node then
return False;
end if;
if N (Position.Node).Prev = Position.Node then
return False;
end if;
if N (Position.Node).Prev = 0
and then Position.Node /= L.First
then
return False;
end if;
pragma Assert (N (Position.Node).Prev /= 0
or else Position.Node = L.First);
if N (Position.Node).Next = 0
and then Position.Node /= L.Last
then
return False;
end if;
pragma Assert (N (Position.Node).Next /= 0
or else Position.Node = L.Last);
if L.Length = 1 then
return L.First = L.Last;
end if;
if L.First = L.Last then
return False;
end if;
if N (L.First).Next = 0 then
return False;
end if;
if N (L.Last).Prev = 0 then
return False;
end if;
if N (N (L.First).Next).Prev /= L.First then
return False;
end if;
if N (N (L.Last).Prev).Next /= L.Last then
return False;
end if;
if L.Length = 2 then
if N (L.First).Next /= L.Last then
return False;
end if;
if N (L.Last).Prev /= L.First then
return False;
end if;
return True;
end if;
if N (L.First).Next = L.Last then
return False;
end if;
if N (L.Last).Prev = L.First then
return False;
end if;
-- Eliminate earlier possibility
if Position.Node = L.First then
return True;
end if;
pragma Assert (N (Position.Node).Prev /= 0);
-- Eliminate another possibility
if Position.Node = L.Last then
return True;
end if;
pragma Assert (N (Position.Node).Next /= 0);
if N (N (Position.Node).Next).Prev /= Position.Node then
return False;
end if;
if N (N (Position.Node).Prev).Next /= Position.Node then
return False;
end if;
if L.Length = 3 then
if N (L.First).Next /= Position.Node then
return False;
end if;
if N (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 : Count_Type;
begin
Count_Type'Base'Write (Stream, Item.Length);
Node := Item.First;
while Node /= 0 loop
Element_Type'Write (Stream, Item.Nodes (Node).Element);
Node := Item.Nodes (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.Bounded_Doubly_Linked_Lists;
| 29.294509 | 79 | 0.566242 |
a10db31189cd6a447484ef0574bdd98a02dab63d | 6,819 | adb | Ada | source/amf/uml/amf-internals-standard_profile_l3_metamodels.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-internals-standard_profile_l3_metamodels.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-internals-standard_profile_l3_metamodels.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 © 2011-2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements;
with AMF.Internals.Helpers;
with AMF.Internals.Tables.UML_Attributes;
with AMF.UML.Models;
with AMF.Visitors.Standard_Profile_L3_Iterators;
with AMF.Visitors.Standard_Profile_L3_Visitors;
package body AMF.Internals.Standard_Profile_L3_Metamodels is
--------------------
-- Get_Base_Model --
--------------------
overriding function Get_Base_Model
(Self : not null access constant Standard_Profile_L3_Metamodel_Proxy)
return AMF.UML.Models.UML_Model_Access is
begin
return
AMF.UML.Models.UML_Model_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Base_Model
(Self.Element)));
end Get_Base_Model;
--------------------
-- Set_Base_Model --
--------------------
overriding procedure Set_Base_Model
(Self : not null access Standard_Profile_L3_Metamodel_Proxy;
To : AMF.UML.Models.UML_Model_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Base_Model
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Base_Model;
-------------------
-- Enter_Element --
-------------------
overriding procedure Enter_Element
(Self : not null access constant Standard_Profile_L3_Metamodel_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.Standard_Profile_L3_Visitors.Standard_Profile_L3_Visitor'Class then
AMF.Visitors.Standard_Profile_L3_Visitors.Standard_Profile_L3_Visitor'Class
(Visitor).Enter_Metamodel
(AMF.Standard_Profile_L3.Metamodels.Standard_Profile_L3_Metamodel_Access (Self),
Control);
end if;
end Enter_Element;
-------------------
-- Leave_Element --
-------------------
overriding procedure Leave_Element
(Self : not null access constant Standard_Profile_L3_Metamodel_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.Standard_Profile_L3_Visitors.Standard_Profile_L3_Visitor'Class then
AMF.Visitors.Standard_Profile_L3_Visitors.Standard_Profile_L3_Visitor'Class
(Visitor).Leave_Metamodel
(AMF.Standard_Profile_L3.Metamodels.Standard_Profile_L3_Metamodel_Access (Self),
Control);
end if;
end Leave_Element;
-------------------
-- Visit_Element --
-------------------
overriding procedure Visit_Element
(Self : not null access constant Standard_Profile_L3_Metamodel_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Iterator in AMF.Visitors.Standard_Profile_L3_Iterators.Standard_Profile_L3_Iterator'Class then
AMF.Visitors.Standard_Profile_L3_Iterators.Standard_Profile_L3_Iterator'Class
(Iterator).Visit_Metamodel
(Visitor,
AMF.Standard_Profile_L3.Metamodels.Standard_Profile_L3_Metamodel_Access (Self),
Control);
end if;
end Visit_Element;
end AMF.Internals.Standard_Profile_L3_Metamodels;
| 49.413043 | 103 | 0.535856 |
31cc836221d62e38a76c81df9c6d0671bd9a109f | 681 | ads | Ada | Ada/problem_3/problem_3.ads | PyllrNL/Project_Euler_Solutions | 3d125dae48e50b1fcddb8b8bd5b1cf653aff1005 | [
"MIT"
] | null | null | null | Ada/problem_3/problem_3.ads | PyllrNL/Project_Euler_Solutions | 3d125dae48e50b1fcddb8b8bd5b1cf653aff1005 | [
"MIT"
] | null | null | null | Ada/problem_3/problem_3.ads | PyllrNL/Project_Euler_Solutions | 3d125dae48e50b1fcddb8b8bd5b1cf653aff1005 | [
"MIT"
] | null | null | null | with Ada.Numerics; use Ada.Numerics;
with Ada.Numerics.Elementary_Functions;
use Ada.Numerics.Elementary_Functions;
with Ada.Containers.Vectors;
with Test_Solution; use Test_Solution;
package Problem_3 is
type Int64 is range -2**63 .. 2**63 -1;
type Prime_Count is record
Prime : Integer;
Count : Integer;
end record;
package P is new Ada.Containers.Vectors(Index_Type => Natural,
Element_Type => Prime_Count);
function Solution_1( Comp : Int64 ) return Int64;
procedure Test_Solution_1;
function Get_Solutions return Solution_Case;
private
function Prime_Factorization( Num : Int64 ) return P.Vector;
end Problem_3;
| 21.28125 | 66 | 0.725404 |
fbf36eacfcc245aa3389bdb2d57576f4e1899351 | 18,905 | ads | Ada | source/amf/uml/amf-internals-uml_expansion_nodes.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_expansion_nodes.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_expansion_nodes.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.Behaviors;
with AMF.UML.Classifiers.Collections;
with AMF.UML.Dependencies.Collections;
with AMF.UML.Expansion_Nodes;
with AMF.UML.Expansion_Regions;
with AMF.UML.Interruptible_Activity_Regions.Collections;
with AMF.UML.Named_Elements;
with AMF.UML.Namespaces;
with AMF.UML.Packages.Collections;
with AMF.UML.Redefinable_Elements.Collections;
with AMF.UML.States.Collections;
with AMF.UML.String_Expressions;
with AMF.UML.Structured_Activity_Nodes;
with AMF.UML.Types;
with AMF.UML.Value_Specifications;
with AMF.Visitors;
package AMF.Internals.UML_Expansion_Nodes is
type UML_Expansion_Node_Proxy is
limited new AMF.Internals.UML_Named_Elements.UML_Named_Element_Proxy
and AMF.UML.Expansion_Nodes.UML_Expansion_Node with null record;
overriding function Get_Region_As_Input
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.Expansion_Regions.UML_Expansion_Region_Access;
-- Getter of ExpansionNode::regionAsInput.
--
-- The expansion region for which the node is an input.
overriding procedure Set_Region_As_Input
(Self : not null access UML_Expansion_Node_Proxy;
To : AMF.UML.Expansion_Regions.UML_Expansion_Region_Access);
-- Setter of ExpansionNode::regionAsInput.
--
-- The expansion region for which the node is an input.
overriding function Get_Region_As_Output
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.Expansion_Regions.UML_Expansion_Region_Access;
-- Getter of ExpansionNode::regionAsOutput.
--
-- The expansion region for which the node is an output.
overriding procedure Set_Region_As_Output
(Self : not null access UML_Expansion_Node_Proxy;
To : AMF.UML.Expansion_Regions.UML_Expansion_Region_Access);
-- Setter of ExpansionNode::regionAsOutput.
--
-- The expansion region for which the node is an output.
overriding function Get_In_State
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.States.Collections.Set_Of_UML_State;
-- Getter of ObjectNode::inState.
--
-- The required states of the object available at this point in the
-- activity.
overriding function Get_Is_Control_Type
(Self : not null access constant UML_Expansion_Node_Proxy)
return Boolean;
-- Getter of ObjectNode::isControlType.
--
-- Tells whether the type of the object node is to be treated as control.
overriding procedure Set_Is_Control_Type
(Self : not null access UML_Expansion_Node_Proxy;
To : Boolean);
-- Setter of ObjectNode::isControlType.
--
-- Tells whether the type of the object node is to be treated as control.
overriding function Get_Ordering
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.UML_Object_Node_Ordering_Kind;
-- Getter of ObjectNode::ordering.
--
-- Tells whether and how the tokens in the object node are ordered for
-- selection to traverse edges outgoing from the object node.
overriding procedure Set_Ordering
(Self : not null access UML_Expansion_Node_Proxy;
To : AMF.UML.UML_Object_Node_Ordering_Kind);
-- Setter of ObjectNode::ordering.
--
-- Tells whether and how the tokens in the object node are ordered for
-- selection to traverse edges outgoing from the object node.
overriding function Get_Selection
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.Behaviors.UML_Behavior_Access;
-- Getter of ObjectNode::selection.
--
-- Selects tokens for outgoing edges.
overriding procedure Set_Selection
(Self : not null access UML_Expansion_Node_Proxy;
To : AMF.UML.Behaviors.UML_Behavior_Access);
-- Setter of ObjectNode::selection.
--
-- Selects tokens for outgoing edges.
overriding function Get_Upper_Bound
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.Value_Specifications.UML_Value_Specification_Access;
-- Getter of ObjectNode::upperBound.
--
-- The maximum number of tokens allowed in the node. Objects cannot flow
-- into the node if the upper bound is reached.
overriding procedure Set_Upper_Bound
(Self : not null access UML_Expansion_Node_Proxy;
To : AMF.UML.Value_Specifications.UML_Value_Specification_Access);
-- Setter of ObjectNode::upperBound.
--
-- The maximum number of tokens allowed in the node. Objects cannot flow
-- into the node if the upper bound is reached.
overriding function Get_Activity
(Self : not null access constant UML_Expansion_Node_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_Expansion_Node_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_Expansion_Node_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_Expansion_Node_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_Expansion_Node_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_Expansion_Node_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_Expansion_Node_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_Expansion_Node_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_Expansion_Node_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_Expansion_Node_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_Expansion_Node_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_Expansion_Node_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_Expansion_Node_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_Expansion_Node_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_Expansion_Node_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_Expansion_Node_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_Expansion_Node_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_Expansion_Node_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_Expansion_Node_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 Get_Type
(Self : not null access constant UML_Expansion_Node_Proxy)
return AMF.UML.Types.UML_Type_Access;
-- Getter of TypedElement::type.
--
-- The type of the TypedElement.
-- This information is derived from the return result for this Operation.
overriding procedure Set_Type
(Self : not null access UML_Expansion_Node_Proxy;
To : AMF.UML.Types.UML_Type_Access);
-- Setter of TypedElement::type.
--
-- The type of the TypedElement.
-- This information is derived from the return result for this Operation.
overriding function Is_Consistent_With
(Self : not null access constant UML_Expansion_Node_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_Expansion_Node_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_Expansion_Node_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_Expansion_Node_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_Expansion_Node_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_Expansion_Node_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_Expansion_Node_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_Expansion_Node_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_Expansion_Nodes;
| 46.109756 | 106 | 0.688601 |
122dc9ce4724ace493b91872e533d4b93c3724c9 | 9,051 | adb | Ada | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-pack44.adb | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-pack44.adb | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-pack44.adb | 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 _ 4 4 --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2019, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.Storage_Elements;
with System.Unsigned_Types;
package body System.Pack_44 is
subtype Bit_Order is System.Bit_Order;
Reverse_Bit_Order : constant Bit_Order :=
Bit_Order'Val (1 - Bit_Order'Pos (System.Default_Bit_Order));
subtype Ofs is System.Storage_Elements.Storage_Offset;
subtype Uns is System.Unsigned_Types.Unsigned;
subtype N07 is System.Unsigned_Types.Unsigned range 0 .. 7;
use type System.Storage_Elements.Storage_Offset;
use type System.Unsigned_Types.Unsigned;
type Cluster is record
E0, E1, E2, E3, E4, E5, E6, E7 : Bits_44;
end record;
for Cluster use record
E0 at 0 range 0 * Bits .. 0 * Bits + Bits - 1;
E1 at 0 range 1 * Bits .. 1 * Bits + Bits - 1;
E2 at 0 range 2 * Bits .. 2 * Bits + Bits - 1;
E3 at 0 range 3 * Bits .. 3 * Bits + Bits - 1;
E4 at 0 range 4 * Bits .. 4 * Bits + Bits - 1;
E5 at 0 range 5 * Bits .. 5 * Bits + Bits - 1;
E6 at 0 range 6 * Bits .. 6 * Bits + Bits - 1;
E7 at 0 range 7 * Bits .. 7 * Bits + Bits - 1;
end record;
for Cluster'Size use Bits * 8;
for Cluster'Alignment use Integer'Min (Standard'Maximum_Alignment,
1 +
1 * Boolean'Pos (Bits mod 2 = 0) +
2 * Boolean'Pos (Bits mod 4 = 0));
-- Use maximum possible alignment, given the bit field size, since this
-- will result in the most efficient code possible for the field.
type Cluster_Ref is access Cluster;
type Rev_Cluster is new Cluster
with Bit_Order => Reverse_Bit_Order,
Scalar_Storage_Order => Reverse_Bit_Order;
type Rev_Cluster_Ref is access Rev_Cluster;
-- The following declarations are for the case where the address
-- passed to GetU_44 or SetU_44 is not guaranteed to be aligned.
-- These routines are used when the packed array is itself a
-- component of a packed record, and therefore may not be aligned.
type ClusterU is new Cluster;
for ClusterU'Alignment use 1;
type ClusterU_Ref is access ClusterU;
type Rev_ClusterU is new ClusterU
with Bit_Order => Reverse_Bit_Order,
Scalar_Storage_Order => Reverse_Bit_Order;
type Rev_ClusterU_Ref is access Rev_ClusterU;
------------
-- Get_44 --
------------
function Get_44
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_44
is
A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8);
C : Cluster_Ref with Address => A'Address, Import;
RC : Rev_Cluster_Ref with Address => A'Address, Import;
begin
if Rev_SSO then
case N07 (Uns (N) mod 8) is
when 0 => return RC.E0;
when 1 => return RC.E1;
when 2 => return RC.E2;
when 3 => return RC.E3;
when 4 => return RC.E4;
when 5 => return RC.E5;
when 6 => return RC.E6;
when 7 => return RC.E7;
end case;
else
case N07 (Uns (N) mod 8) is
when 0 => return C.E0;
when 1 => return C.E1;
when 2 => return C.E2;
when 3 => return C.E3;
when 4 => return C.E4;
when 5 => return C.E5;
when 6 => return C.E6;
when 7 => return C.E7;
end case;
end if;
end Get_44;
-------------
-- GetU_44 --
-------------
function GetU_44
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_44
is
A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8);
C : ClusterU_Ref with Address => A'Address, Import;
RC : Rev_ClusterU_Ref with Address => A'Address, Import;
begin
if Rev_SSO then
case N07 (Uns (N) mod 8) is
when 0 => return RC.E0;
when 1 => return RC.E1;
when 2 => return RC.E2;
when 3 => return RC.E3;
when 4 => return RC.E4;
when 5 => return RC.E5;
when 6 => return RC.E6;
when 7 => return RC.E7;
end case;
else
case N07 (Uns (N) mod 8) is
when 0 => return C.E0;
when 1 => return C.E1;
when 2 => return C.E2;
when 3 => return C.E3;
when 4 => return C.E4;
when 5 => return C.E5;
when 6 => return C.E6;
when 7 => return C.E7;
end case;
end if;
end GetU_44;
------------
-- Set_44 --
------------
procedure Set_44
(Arr : System.Address;
N : Natural;
E : Bits_44;
Rev_SSO : Boolean)
is
A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8);
C : Cluster_Ref with Address => A'Address, Import;
RC : Rev_Cluster_Ref with Address => A'Address, Import;
begin
if Rev_SSO then
case N07 (Uns (N) mod 8) is
when 0 => RC.E0 := E;
when 1 => RC.E1 := E;
when 2 => RC.E2 := E;
when 3 => RC.E3 := E;
when 4 => RC.E4 := E;
when 5 => RC.E5 := E;
when 6 => RC.E6 := E;
when 7 => RC.E7 := E;
end case;
else
case N07 (Uns (N) mod 8) is
when 0 => C.E0 := E;
when 1 => C.E1 := E;
when 2 => C.E2 := E;
when 3 => C.E3 := E;
when 4 => C.E4 := E;
when 5 => C.E5 := E;
when 6 => C.E6 := E;
when 7 => C.E7 := E;
end case;
end if;
end Set_44;
-------------
-- SetU_44 --
-------------
procedure SetU_44
(Arr : System.Address;
N : Natural;
E : Bits_44;
Rev_SSO : Boolean)
is
A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8);
C : ClusterU_Ref with Address => A'Address, Import;
RC : Rev_ClusterU_Ref with Address => A'Address, Import;
begin
if Rev_SSO then
case N07 (Uns (N) mod 8) is
when 0 => RC.E0 := E;
when 1 => RC.E1 := E;
when 2 => RC.E2 := E;
when 3 => RC.E3 := E;
when 4 => RC.E4 := E;
when 5 => RC.E5 := E;
when 6 => RC.E6 := E;
when 7 => RC.E7 := E;
end case;
else
case N07 (Uns (N) mod 8) is
when 0 => C.E0 := E;
when 1 => C.E1 := E;
when 2 => C.E2 := E;
when 3 => C.E3 := E;
when 4 => C.E4 := E;
when 5 => C.E5 := E;
when 6 => C.E6 := E;
when 7 => C.E7 := E;
end case;
end if;
end SetU_44;
end System.Pack_44;
| 36.059761 | 78 | 0.467352 |
fbc44d89712af6b2e9d6dfc73078a984476c665e | 4,957 | adb | Ada | source/xml/sax/xml-sax-output_destinations-strings.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/xml/sax/xml-sax-output_destinations-strings.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/xml/sax/xml-sax-output_destinations-strings.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- XML Processor --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2013-2014, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
package body XML.SAX.Output_Destinations.Strings is
-----------
-- Clear --
-----------
procedure Clear (Self : in out String_Output_Destination) is
begin
Self.Text.Clear;
end Clear;
------------------
-- Get_Encoding --
------------------
overriding function Get_Encoding
(Self : String_Output_Destination) return League.Strings.Universal_String
is
pragma Unreferenced (Self);
begin
return League.Strings.To_Universal_String ("utf-8");
end Get_Encoding;
--------------
-- Get_Text --
--------------
function Get_Text
(Self : String_Output_Destination)
return League.Strings.Universal_String is
begin
return Self.Text;
end Get_Text;
---------
-- Put --
---------
overriding procedure Put
(Self : in out String_Output_Destination;
Text : League.Strings.Universal_String) is
begin
Self.Text.Append (Text);
end Put;
---------
-- Put --
---------
overriding procedure Put
(Self : in out String_Output_Destination;
Char : League.Characters.Universal_Character) is
begin
Self.Text.Append (Char);
end Put;
---------
-- Put --
---------
overriding procedure Put
(Self : in out String_Output_Destination;
Char : Wide_Wide_Character) is
begin
Self.Text.Append (Char);
end Put;
---------
-- Put --
---------
overriding procedure Put
(Self : in out String_Output_Destination;
Text : Wide_Wide_String) is
begin
Self.Text.Append (Text);
end Put;
end XML.SAX.Output_Destinations.Strings;
| 39.975806 | 78 | 0.451684 |
1c01612d33effa6672bce0dbf4fe821c4779b275 | 4,511 | adb | Ada | arch/ARM/STM32/driver_demos/demo_usart_polling/src/demo_usart_polling.adb | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 192 | 2016-06-01T18:32:04.000Z | 2022-03-26T22:52:31.000Z | arch/ARM/STM32/driver_demos/demo_usart_polling/src/demo_usart_polling.adb | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 239 | 2016-05-26T20:02:01.000Z | 2022-03-31T09:46:56.000Z | arch/ARM/STM32/driver_demos/demo_usart_polling/src/demo_usart_polling.adb | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015-2017, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- The file declares the main procedure for the demonstration.
with HAL; use HAL;
with STM32.GPIO; use STM32.GPIO;
with STM32.USARTs; use STM32.USARTs;
with STM32.Device; use STM32.Device;
procedure Demo_USART_Polling is
TX_Pin : constant GPIO_Point := PB7;
RX_Pin : constant GPIO_Point := PB6;
procedure Initialize_UART_GPIO;
procedure Initialize;
procedure Await_Send_Ready (This : USART) with Inline;
procedure Put_Blocking (This : in out USART; Data : UInt16);
--------------------------
-- Initialize_UART_GPIO --
--------------------------
procedure Initialize_UART_GPIO is
begin
Enable_Clock (USART_1);
Enable_Clock (RX_Pin & TX_Pin);
Configure_IO
(RX_Pin & TX_Pin,
(Mode => Mode_AF,
AF => GPIO_AF_USART1_7,
Resistors => Pull_Up,
AF_Speed => Speed_50MHz,
AF_Output_Type => Push_Pull));
end Initialize_UART_GPIO;
----------------
-- Initialize --
----------------
procedure Initialize is
begin
Initialize_UART_GPIO;
Disable (USART_1);
Set_Baud_Rate (USART_1, 115_200);
Set_Mode (USART_1, Tx_Rx_Mode);
Set_Stop_Bits (USART_1, Stopbits_1);
Set_Word_Length (USART_1, Word_Length_8);
Set_Parity (USART_1, No_Parity);
Set_Flow_Control (USART_1, No_Flow_Control);
Enable (USART_1);
end Initialize;
----------------------
-- Await_Send_Ready --
----------------------
procedure Await_Send_Ready (This : USART) is
begin
loop
exit when Tx_Ready (This);
end loop;
end Await_Send_Ready;
------------------
-- Put_Blocking --
------------------
procedure Put_Blocking (This : in out USART; Data : UInt16) is
begin
Await_Send_Ready (This);
Transmit (This, UInt9 (Data));
end Put_Blocking;
begin
Initialize;
loop
for Next_Char in Character range 'a' .. 'z' loop -- arbitrary
Put_Blocking (USART_1, Character'Pos (Next_Char));
end loop;
end loop;
end Demo_USART_Polling;
| 36.97541 | 78 | 0.539792 |
4d649cc362b5f28433fc35dd4a211feda7540359 | 1,343 | ads | Ada | rts/gcc-9/adainclude/a-contai.ads | letsbyteit/build-avr-ada-toolchain | 7c5dddbc69e6e2df8c30971417dc50d2f2b29794 | [
"MIT"
] | 7 | 2019-09-17T20:54:13.000Z | 2021-12-20T04:31:40.000Z | rts/gcc-9/adainclude/a-contai.ads | letsbyteit/build-avr-ada-toolchain | 7c5dddbc69e6e2df8c30971417dc50d2f2b29794 | [
"MIT"
] | 6 | 2019-05-08T14:20:48.000Z | 2022-01-20T18:58:30.000Z | rts/gcc-9/adainclude/a-contai.ads | letsbyteit/build-avr-ada-toolchain | 7c5dddbc69e6e2df8c30971417dc50d2f2b29794 | [
"MIT"
] | 8 | 2019-07-09T09:18:51.000Z | 2022-01-15T20:28:50.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- A D A . C O N T A I N E R S --
-- --
-- S p e c --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. In accordance with the copyright of that document, you can freely --
-- copy and modify this specification, provided that if you redistribute a --
-- modified version, any changes that you have made are clearly indicated. --
-- --
------------------------------------------------------------------------------
-- This is the AVR version without support for exceptions
package Ada.Containers is
pragma Pure;
type Hash_Type is mod 2**32;
type Count_Type is range 0 .. 2**31 - 1;
-- Capacity_Error : exception;
end Ada.Containers;
| 49.740741 | 78 | 0.327625 |
1c1db33d7512ad9a41f071c5958f1384639626dd | 1,722 | ads | Ada | arbitrary-trig.ads | joewing/arbitrary | 44722a99e141f0a0916836d24ad48af228f3fc45 | [
"BSD-3-Clause"
] | null | null | null | arbitrary-trig.ads | joewing/arbitrary | 44722a99e141f0a0916836d24ad48af228f3fc45 | [
"BSD-3-Clause"
] | null | null | null | arbitrary-trig.ads | joewing/arbitrary | 44722a99e141f0a0916836d24ad48af228f3fc45 | [
"BSD-3-Clause"
] | 2 | 2019-01-21T02:40:56.000Z | 2020-09-17T03:59:23.000Z | --------------------------------------------------------------------------
-- Arbitrary Precision Math Library: Trigonometric Functions
-- Joe Wingbermuehe 20020320 <> 20020327
--------------------------------------------------------------------------
package Arbitrary.Trig is
function Sin(a : Arbitrary_Type) return Arbitrary_Type;
function Cos(a : Arbitrary_Type) return Arbitrary_Type;
function Tan(a : Arbitrary_Type) return Arbitrary_Type;
function Csc(a : Arbitrary_Type) return Arbitrary_Type;
function Sec(a : Arbitrary_Type) return Arbitrary_Type;
function Cot(a : Arbitrary_Type) return Arbitrary_Type;
function ArcSin(a : Arbitrary_Type) return Arbitrary_Type;
function ArcCos(a : Arbitrary_Type) return Arbitrary_Type;
function ArcTan(a : Arbitrary_Type) return Arbitrary_Type;
function ArcCsc(a : Arbitrary_Type) return Arbitrary_Type;
function ArcSec(a : Arbitrary_Type) return Arbitrary_Type;
function ArcCot(a : Arbitrary_Type) return Arbitrary_Type;
function Sinh(a : Arbitrary_Type) return Arbitrary_Type;
function Cosh(a : Arbitrary_Type) return Arbitrary_Type;
function Tanh(a : Arbitrary_Type) return Arbitrary_Type;
function Csch(a : Arbitrary_Type) return Arbitrary_Type;
function Sech(a : Arbitrary_Type) return Arbitrary_Type;
function Coth(a : Arbitrary_Type) return Arbitrary_Type;
function ArcSinh(a : Arbitrary_Type) return Arbitrary_Type;
function ArcCosh(a : Arbitrary_Type) return Arbitrary_Type;
function ArcTanh(a : Arbitrary_Type) return Arbitrary_Type;
function ArcCsch(a : Arbitrary_Type) return Arbitrary_Type;
function ArcSech(a : Arbitrary_Type) return Arbitrary_Type;
function ArcCoth(a : Arbitrary_Type) return Arbitrary_Type;
end Arbitrary.Trig;
| 45.315789 | 74 | 0.738676 |
a1deb2ea5d3bfefcb5185062d9513b1435a6cb84 | 3,523 | ads | Ada | tools/scitools/conf/understand/ada/ada12/s-pack34.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | 1 | 2020-01-20T21:26:46.000Z | 2020-01-20T21:26:46.000Z | tools/scitools/conf/understand/ada/ada12/s-pack34.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada12/s-pack34.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 3 4 --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2009, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- 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 = 34
package System.Pack_34 is
pragma Preelaborate;
Bits : constant := 34;
type Bits_34 is mod 2 ** Bits;
for Bits_34'Size use Bits;
function Get_34 (Arr : System.Address; N : Natural) return Bits_34;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned.
procedure Set_34 (Arr : System.Address; N : Natural; E : Bits_34);
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is set to the given value.
function GetU_34 (Arr : System.Address; N : Natural) return Bits_34;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned. This version
-- is used when Arr may represent an unaligned address.
procedure SetU_34 (Arr : System.Address; N : Natural; E : Bits_34);
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is set to the given value. This version
-- is used when Arr may represent an unaligned address
end System.Pack_34;
| 57.754098 | 78 | 0.427477 |
1298940f521bcfe950ff3a974bc7c1b1a4baa836 | 788 | ads | Ada | src/eval.ads | timmyjose-projects/arithmetic-expression-evaluator-in-ada | e16ca48896bd40e4601df2fc8b1bc8edef1fe8fd | [
"Unlicense"
] | null | null | null | src/eval.ads | timmyjose-projects/arithmetic-expression-evaluator-in-ada | e16ca48896bd40e4601df2fc8b1bc8edef1fe8fd | [
"Unlicense"
] | null | null | null | src/eval.ads | timmyjose-projects/arithmetic-expression-evaluator-in-ada | e16ca48896bd40e4601df2fc8b1bc8edef1fe8fd | [
"Unlicense"
] | null | null | null | generic
type T is private;
with function Image (Item : T) return String;
with function "=" (First_Item, Second_Item : T) return Boolean;
with function "+" (First_Item, Second_Item : T) return T;
with function "-" (First_Item, Second_Item : T) return T;
with function "*" (First_Item, Second_Item : T) return T;
with function "/" (First_Item, Second_Item : T) return T;
package Eval is
type Expr;
type Expr_Access is access Expr;
type Expr_Type is (Add, Sub, Mul, Div, Val);
type Expr (Kind : Expr_Type) is record
case Kind is
when Val =>
Val : T;
when others =>
Left, Right : Expr_Access;
end case;
end record;
procedure Show (E : in Expr);
function Eval (E : in Expr) return T;
end Eval;
| 29.185185 | 66 | 0.625635 |
31187f2d70cb2b714be8e2a51330735c30272d0b | 941 | ads | Ada | 4-high/gel/source/applet/distributed/gel-applet-client_world.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2022-01-20T07:13:42.000Z | 2022-01-20T07:13:42.000Z | 4-high/gel/source/applet/distributed/gel-applet-client_world.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | 4-high/gel/source/applet/distributed/gel-applet-client_world.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | with
gel.World.client,
gel.Camera,
gel.Window;
package gel.Applet.client_world
--
-- Provides a gel applet configured with a single window and a single client world.
--
is
type Item is new gel.Applet.item with private;
type View is access all Item'Class;
package Forge
is
function new_Applet (Name : in String;
use_Window : in gel.Window.view;
space_Kind : in physics.space_Kind) return gel.Applet.client_world.view;
end Forge;
procedure free (Self : in out View);
client_world_Id : constant world_Id := 1;
client_camera_Id : constant camera_Id := 1;
function client_World (Self : in Item) return gel.World.client.view;
function client_Camera (Self : in Item) return gel.Camera .view;
private
type Item is new gel.Applet.item with
record
null;
end record;
end gel.Applet.client_world;
| 22.95122 | 99 | 0.648247 |
4d3ee51db9e7261cd49217f47fa4b8e01273f78a | 6,819 | adb | Ada | source/nodes/program-nodes-component_declarations.adb | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/nodes/program-nodes-component_declarations.adb | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/nodes/program-nodes-component_declarations.adb | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | 2 | 2019-09-14T23:18:50.000Z | 2019-10-02T10:11:40.000Z | -- Copyright (c) 2019 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
package body Program.Nodes.Component_Declarations is
function Create
(Names : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Vector_Access;
Colon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Object_Subtype : not null Program.Elements.Component_Definitions
.Component_Definition_Access;
Assignment_Token : Program.Lexical_Elements.Lexical_Element_Access;
Default_Expression : Program.Elements.Expressions.Expression_Access;
With_Token : Program.Lexical_Elements.Lexical_Element_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Semicolon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access)
return Component_Declaration is
begin
return Result : Component_Declaration :=
(Names => Names, Colon_Token => Colon_Token,
Object_Subtype => Object_Subtype,
Assignment_Token => Assignment_Token,
Default_Expression => Default_Expression, With_Token => With_Token,
Aspects => Aspects, Semicolon_Token => Semicolon_Token,
Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
function Create
(Names : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Vector_Access;
Object_Subtype : not null Program.Elements.Component_Definitions
.Component_Definition_Access;
Default_Expression : Program.Elements.Expressions.Expression_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_Component_Declaration is
begin
return Result : Implicit_Component_Declaration :=
(Names => Names, Object_Subtype => Object_Subtype,
Default_Expression => Default_Expression, Aspects => Aspects,
Is_Part_Of_Implicit => Is_Part_Of_Implicit,
Is_Part_Of_Inherited => Is_Part_Of_Inherited,
Is_Part_Of_Instance => Is_Part_Of_Instance, Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
overriding function Names
(Self : Base_Component_Declaration)
return not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Vector_Access is
begin
return Self.Names;
end Names;
overriding function Object_Subtype
(Self : Base_Component_Declaration)
return not null Program.Elements.Component_Definitions
.Component_Definition_Access is
begin
return Self.Object_Subtype;
end Object_Subtype;
overriding function Default_Expression
(Self : Base_Component_Declaration)
return Program.Elements.Expressions.Expression_Access is
begin
return Self.Default_Expression;
end Default_Expression;
overriding function Aspects
(Self : Base_Component_Declaration)
return Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access is
begin
return Self.Aspects;
end Aspects;
overriding function Colon_Token
(Self : Component_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Colon_Token;
end Colon_Token;
overriding function Assignment_Token
(Self : Component_Declaration)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Assignment_Token;
end Assignment_Token;
overriding function With_Token
(Self : Component_Declaration)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.With_Token;
end With_Token;
overriding function Semicolon_Token
(Self : Component_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Semicolon_Token;
end Semicolon_Token;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Component_Declaration)
return Boolean is
begin
return Self.Is_Part_Of_Implicit;
end Is_Part_Of_Implicit;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Component_Declaration)
return Boolean is
begin
return Self.Is_Part_Of_Inherited;
end Is_Part_Of_Inherited;
overriding function Is_Part_Of_Instance
(Self : Implicit_Component_Declaration)
return Boolean is
begin
return Self.Is_Part_Of_Instance;
end Is_Part_Of_Instance;
procedure Initialize
(Self : aliased in out Base_Component_Declaration'Class) is
begin
for Item in Self.Names.Each_Element loop
Set_Enclosing_Element (Item.Element, Self'Unchecked_Access);
end loop;
Set_Enclosing_Element (Self.Object_Subtype, Self'Unchecked_Access);
if Self.Default_Expression.Assigned then
Set_Enclosing_Element
(Self.Default_Expression, Self'Unchecked_Access);
end if;
for Item in Self.Aspects.Each_Element loop
Set_Enclosing_Element (Item.Element, Self'Unchecked_Access);
end loop;
null;
end Initialize;
overriding function Is_Component_Declaration_Element
(Self : Base_Component_Declaration)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Component_Declaration_Element;
overriding function Is_Declaration_Element
(Self : Base_Component_Declaration)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Declaration_Element;
overriding procedure Visit
(Self : not null access Base_Component_Declaration;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is
begin
Visitor.Component_Declaration (Self);
end Visit;
overriding function To_Component_Declaration_Text
(Self : aliased in out Component_Declaration)
return Program.Elements.Component_Declarations
.Component_Declaration_Text_Access is
begin
return Self'Unchecked_Access;
end To_Component_Declaration_Text;
overriding function To_Component_Declaration_Text
(Self : aliased in out Implicit_Component_Declaration)
return Program.Elements.Component_Declarations
.Component_Declaration_Text_Access is
pragma Unreferenced (Self);
begin
return null;
end To_Component_Declaration_Text;
end Program.Nodes.Component_Declarations;
| 34.266332 | 79 | 0.723713 |
068183ef2266134f339c3dc2f2996805a14d00cd | 2,033 | adb | Ada | orka_simd/src/x86/generic/orka-simd-avx-doubles-math.adb | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 52 | 2016-07-30T23:00:28.000Z | 2022-02-05T11:54:55.000Z | orka_simd/src/x86/generic/orka-simd-avx-doubles-math.adb | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 79 | 2016-08-01T18:36:48.000Z | 2022-02-27T12:14:20.000Z | orka_simd/src/x86/generic/orka-simd-avx-doubles-math.adb | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 4 | 2018-04-28T22:36:26.000Z | 2020-11-14T23:00:29.000Z | -- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2017 onox <[email protected]>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
with Orka.SIMD.AVX.Doubles.Arithmetic;
with Orka.SIMD.AVX.Doubles.Swizzle;
package body Orka.SIMD.AVX.Doubles.Math is
function Cross_Product (Left, Right : m256d) return m256d is
use SIMD.AVX.Doubles.Arithmetic;
use SIMD.AVX.Doubles.Swizzle;
function Shuffle (Elements : m256d) return m256d
with Inline;
function Shuffle (Elements : m256d) return m256d is
Mask_1_0_1_0 : constant Unsigned_32 := 1 or 0 * 2 or 1 * 4 or 0 * 8;
Mask_1_2_0_0 : constant Unsigned_32 := 1 or 2 * 16 or 0 * 8 or 0 * 128;
Mask_0_1_1_1 : constant Unsigned_32 := 0 or 1 * 2 or 1 * 4 or 1 * 8;
YXWZ : constant m256d := Permute_Within_Lanes (Elements, Mask_1_0_1_0);
WZXY : constant m256d := Permute_Lanes (YXWZ, Elements, Mask_1_2_0_0);
YZXY : constant m256d := Blend (YXWZ, WZXY, Mask_0_1_1_1);
begin
return YZXY;
end Shuffle;
Left_YZX : constant m256d := Shuffle (Left);
Right_YZX : constant m256d := Shuffle (Right);
-- Z := Left (X) * Right (Y) - Left (Y) * Right (X)
-- X := Left (Y) * Right (Z) - Left (Z) * Right (Y)
-- Y := Left (Z) * Right (X) - Left (X) * Right (Z)
Result_ZXY : constant m256d := Left * Right_YZX - Left_YZX * Right;
begin
return Shuffle (Result_ZXY);
end Cross_Product;
end Orka.SIMD.AVX.Doubles.Math;
| 38.358491 | 80 | 0.654697 |
1212ef54b86765bbe6ee860a51ef954624a14c2d | 1,822 | ads | Ada | source/oasis/program-elements-with_clauses.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/oasis/program-elements-with_clauses.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/oasis/program-elements-with_clauses.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | 2 | 2019-09-14T23:18:50.000Z | 2019-10-02T10:11:40.000Z | -- Copyright (c) 2019 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Program.Elements.Clauses;
with Program.Lexical_Elements;
with Program.Elements.Expressions;
package Program.Elements.With_Clauses is
pragma Pure (Program.Elements.With_Clauses);
type With_Clause is limited interface and Program.Elements.Clauses.Clause;
type With_Clause_Access is access all With_Clause'Class
with Storage_Size => 0;
not overriding function Clause_Names
(Self : With_Clause)
return not null Program.Elements.Expressions.Expression_Vector_Access
is abstract;
not overriding function Has_Limited (Self : With_Clause) return Boolean
is abstract;
not overriding function Has_Private (Self : With_Clause) return Boolean
is abstract;
type With_Clause_Text is limited interface;
type With_Clause_Text_Access is access all With_Clause_Text'Class
with Storage_Size => 0;
not overriding function To_With_Clause_Text
(Self : aliased in out With_Clause)
return With_Clause_Text_Access is abstract;
not overriding function Limited_Token
(Self : With_Clause_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Private_Token
(Self : With_Clause_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function With_Token
(Self : With_Clause_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Semicolon_Token
(Self : With_Clause_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
end Program.Elements.With_Clauses;
| 30.881356 | 77 | 0.744786 |
31d683dffed2bf5bb961b5615b70ca39539a1f74 | 859 | ads | Ada | project/src/avr-timers-scheduler.ads | pvrego/adaino | 3b160a9006eddc8f25e8e55afea3df6b3cc6d3ca | [
"MIT"
] | 8 | 2015-05-04T20:26:24.000Z | 2021-03-09T02:38:57.000Z | project/src/avr-timers-scheduler.ads | pvrego/adaino | 3b160a9006eddc8f25e8e55afea3df6b3cc6d3ca | [
"MIT"
] | null | null | null | project/src/avr-timers-scheduler.ads | pvrego/adaino | 3b160a9006eddc8f25e8e55afea3df6b3cc6d3ca | [
"MIT"
] | 1 | 2015-08-19T14:21:40.000Z | 2015-08-19T14:21:40.000Z | -- =============================================================================
-- Package AVR.TIMERS.SCHEDULER
--
-- Implements timers configurations specific for a fixed scheduler which uses
-- for handling scheduler-type threads.
--
-- This timer is used for handling the device clock:
-- - TIMER1_COMPA (16 bits timer)
--
-- These timers are configured for Clear Timer on Compare (CTC) to handle each
-- task:
-- - TIMER5_COMPA (16 bits timer)
-- - TIMER5_COMPB (16 bits timer)
-- - TIMER5_COMPC (16 bits timer)
-- - TIMER0_COMPA (8 bits timer)
-- =============================================================================
package AVR.TIMERS.SCHEDULER is
-- Initialize Timer1 or Timer5 channels as CTC
procedure Initialize_CTC_Timer
(Timer : TIMERS.Timer_Type;
Priority : TIMERS.Channel_Priority_Type);
end AVR.TIMERS.SCHEDULER;
| 34.36 | 80 | 0.593714 |
319195644e5c331f5ab4721a43b284e5aa75bcc5 | 9,569 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/s-parame-hpux.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-parame-hpux.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/s-parame-hpux.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 . P A R A M E T E R S --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
-- This is the HP version of this package
-- This package defines some system dependent parameters for GNAT. These
-- are values that are referenced by the runtime library and are therefore
-- relevant to the target machine.
-- The parameters whose value is defined in the spec are not generally
-- expected to be changed. If they are changed, it will be necessary to
-- recompile the run-time library.
-- The parameters which are defined by functions can be changed by modifying
-- the body of System.Parameters in file s-parame.adb. A change to this body
-- requires only rebinding and relinking of the application.
-- Note: do not introduce any pragma Inline statements into this unit, since
-- otherwise the relinking and rebinding capability would be deactivated.
package System.Parameters is
pragma Pure;
---------------------------------------
-- Task And Stack Allocation Control --
---------------------------------------
type Task_Storage_Size is new Integer;
-- Type used in tasking units for task storage size
type Size_Type is new Task_Storage_Size;
-- Type used to provide task storage size to runtime
Unspecified_Size : constant Size_Type := Size_Type'First;
-- Value used to indicate that no size type is set
subtype Percentage is Size_Type range -1 .. 100;
Dynamic : constant Size_Type := -1;
-- The secondary stack ratio is a constant between 0 and 100 which
-- determines the percentage of the allocated task stack that is
-- used by the secondary stack (the rest being the primary stack).
-- The special value of minus one indicates that the secondary
-- stack is to be allocated from the heap instead.
Sec_Stack_Percentage : constant Percentage := Dynamic;
-- This constant defines the handling of the secondary stack
Sec_Stack_Dynamic : constant Boolean := Sec_Stack_Percentage = Dynamic;
-- Convenient Boolean for testing for dynamic secondary stack
function Default_Stack_Size return Size_Type;
-- Default task stack size used if none is specified
function Minimum_Stack_Size return Size_Type;
-- Minimum task stack size permitted
function Adjust_Storage_Size (Size : Size_Type) return Size_Type;
-- Given the storage size stored in the TCB, return the Storage_Size
-- value required by the RM for the Storage_Size attribute. The
-- required adjustment is as follows:
--
-- when Size = Unspecified_Size, return Default_Stack_Size
-- when Size < Minimum_Stack_Size, return Minimum_Stack_Size
-- otherwise return given Size
Default_Env_Stack_Size : constant Size_Type := 8_192_000;
-- Assumed size of the environment task, if no other information
-- is available. This value is used when stack checking is
-- enabled and no GNAT_STACK_LIMIT environment variable is set.
Stack_Grows_Down : constant Boolean := False;
-- This constant indicates whether the stack grows up (False) or
-- down (True) in memory as functions are called. It is used for
-- proper implementation of the stack overflow check.
----------------------------------------------
-- Characteristics of Types in Interfaces.C --
----------------------------------------------
long_bits : constant := Long_Integer'Size;
-- Number of bits in type long and unsigned_long. The normal convention
-- is that this is the same as type Long_Integer, but this may not be true
-- of all targets.
ptr_bits : constant := Standard'Address_Size;
subtype C_Address is System.Address;
-- Number of bits in Interfaces.C pointers, normally a standard address
C_Malloc_Linkname : constant String := "__gnat_malloc";
-- Name of runtime function used to allocate such a pointer
----------------------------------------------
-- Behavior of Pragma Finalize_Storage_Only --
----------------------------------------------
-- Garbage_Collected is a Boolean constant whose value indicates the
-- effect of the pragma Finalize_Storage_Entry on a controlled type.
-- Garbage_Collected = False
-- The system releases all storage on program termination only,
-- but not other garbage collection occurs, so finalization calls
-- are omitted only for outer level objects can be omitted if
-- pragma Finalize_Storage_Only is used.
-- Garbage_Collected = True
-- The system provides full garbage collection, so it is never
-- necessary to release storage for controlled objects for which
-- a pragma Finalize_Storage_Only is used.
Garbage_Collected : constant Boolean := False;
-- The storage mode for this system (release on program exit)
---------------------
-- Tasking Profile --
---------------------
-- In the following sections, constant parameters are defined to
-- allow some optimizations and fine tuning within the tasking run time
-- based on restrictions on the tasking features.
----------------------
-- Locking Strategy --
----------------------
Single_Lock : constant Boolean := False;
-- Indicates whether a single lock should be used within the tasking
-- run-time to protect internal structures. If True, a single lock
-- will be used, meaning less locking/unlocking operations, but also
-- more global contention. In general, Single_Lock should be set to
-- True on single processor machines, and to False to multi-processor
-- systems, but this can vary from application to application and also
-- depends on the scheduling policy.
-------------------
-- Task Abortion --
-------------------
No_Abort : constant Boolean := False;
-- This constant indicates whether abort statements and asynchronous
-- transfer of control (ATC) are disallowed. If set to True, it is
-- assumed that neither construct is used, and the run time does not
-- need to defer/undefer abort and check for pending actions at
-- completion points. A value of True for No_Abort corresponds to:
-- pragma Restrictions (No_Abort_Statements);
-- pragma Restrictions (Max_Asynchronous_Select_Nesting => 0);
---------------------
-- Task Attributes --
---------------------
Max_Attribute_Count : constant := 32;
-- Number of task attributes stored in the task control block
--------------------
-- Runtime Traces --
--------------------
Runtime_Traces : constant Boolean := False;
-- This constant indicates whether the runtime outputs traces to a
-- predefined output or not (True means that traces are output).
-- See System.Traces for more details.
-----------------------
-- Task Image Length --
-----------------------
Max_Task_Image_Length : constant := 256;
-- This constant specifies the maximum length of a task's image
------------------------------
-- Exception Message Length --
------------------------------
Default_Exception_Msg_Max_Length : constant := 200;
-- This constant specifies the default number of characters to allow
-- in an exception message (200 is minimum required by RM 11.4.1(18)).
end System.Parameters;
| 45.784689 | 78 | 0.587627 |
066558f8be706c5ac9eed6b01cea10f0b97731c8 | 5,395 | ads | Ada | source/kernel.ads | bracke/Meaning | 709f609df916aa9442f9b75c7dcb62ab807a48e9 | [
"MIT"
] | 1 | 2017-04-29T20:02:28.000Z | 2017-04-29T20:02:28.000Z | source/kernel.ads | bracke/Meaning | 709f609df916aa9442f9b75c7dcb62ab807a48e9 | [
"MIT"
] | null | null | null | source/kernel.ads | bracke/Meaning | 709f609df916aa9442f9b75c7dcb62ab807a48e9 | [
"MIT"
] | null | null | null | --------------------------------------------------------------------------------
-- --
-- Copyright (C) 2004, RISC OS Ada Library (RASCAL) developers. --
-- --
-- This library is free software; you can redistribute it and/or --
-- modify it under the terms of the GNU Lesser General Public --
-- License as published by the Free Software Foundation; either --
-- version 2.1 of the License, or (at your option) any later version. --
-- --
-- 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 --
-- Lesser General Public License for more details. --
-- --
-- You should have received a copy of the GNU Lesser 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 --
-- --
--------------------------------------------------------------------------------
-- @brief Interface to host RISC OS
-- $Author$
-- $Date$
-- $Revision$
-- --------------------------------------------------------------------------
-- THIS FILE AND ANY ASSOCIATED DOCUMENTATION IS PROVIDED "AS IS" WITHOUT
-- WARRANTY OF ANY KIND, EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
-- TO THE IMPLIED WARRANTIES OF MERCHANTABILITY AND/OR FITNESS FOR A
-- PARTICULAR PURPOSE. The user assumes the entire risk as to the accuracy
-- and the use of this file.
--
-- Ada version Copyright (c) P.J.Burwood, 1996
-- Royalty-free, unlimited, worldwide, non-exclusive use, modification,
-- reproduction and further distribution of this Ada file is permitted.
--
-- C version contains additional copyrights, see below
-- --------------------------------------------------------------------------
with Interfaces.C;
with System;
package Kernel is
subtype void is System.Address;
subtype void_ptr is System.Address;
subtype void_ptr_ptr is System.Address;
--
-- kernel.h:18
--
type vector_of_c_signed_int is
array (integer range <>) of Interfaces.C.int;
--
-- only r0 - r9 matter for swi's
-- kernel.h:19
--
type SWI_Regs is
record
R : vector_of_c_signed_int (0 .. 9);
end record;
pragma Convention (C, SWI_Regs);
--
-- error number
-- error message (zero terminated)
-- kernel.h:36
--
type oserror is
record
ErrNum : Interfaces.C.int;
ErrMess : Interfaces.C.char_array (0 .. 251);
end record;
pragma Convention (C, oserror);
type oserror_access is access all oserror;
-- kernel.h:83
kernel_NONX : constant Interfaces.C.unsigned := 16#80000000#;
--
-- Generic SWI interface. Returns NULL if there was no error.
-- The SWI called normally has the X bit set. To call a non-X bit set SWI,
-- kernel_NONX must be orred into no (in which case, if an error occurs,
-- swi does not return).
--
function swi (no : Interfaces.C.unsigned;
r_in : access SWI_Regs;
r_out : access SWI_Regs)
return oserror_access;
procedure swi (no : Interfaces.C.unsigned;
r_in : access SWI_Regs;
r_out : access SWI_Regs);
--
-- As swi, but for use with SWIs which return status in the C flag.
-- The int to which carry points is set
-- to reflect the state of the C flag on
-- exit from the SWI.
--
function swi_c (no : Interfaces.C.unsigned;
r_in : access SWI_Regs;
r_out : access SWI_Regs;
carry : access Interfaces.C.int)
return oserror_access;
procedure swi_c (no : Interfaces.C.unsigned;
r_in : access SWI_Regs;
r_out : access SWI_Regs;
carry : access Interfaces.C.int);
--
-- Returns a pointer to an error block describing the last os error since
-- last_oserror was last called (or since the program started if there has
-- been no such call). If there has been no os error, returns a null
-- pointer. Note that occurrence of a further error may overwrite the
-- contents of the block.
-- If swi caused the last os error, the error already returned by that call
-- gets returned by this too.
--
function last_oserror return oserror_access; -- kernel.h:199
private
-- kernel.h:84
pragma Import (C, swi, "_kernel_swi");
-- kernel.h:93
pragma Import (C, swi_c, "_kernel_swi_c");
-- kernel.h:199
pragma Import (C, last_oserror, "_kernel_last_oserror");
--
-- Interface to host OS.
-- Copyright (C) Acorn Computers Ltd., 1990
--
end Kernel;
| 38.262411 | 80 | 0.531603 |
a1d24576839ad0ec811bf7e759030d720b048db0 | 4,988 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/symbols.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/symbols.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/symbols.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 M B O L S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2003-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. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package allows the creation of symbol files to be used for linking
-- libraries. The format of symbol files depends on the platform, so there is
-- several implementations of the body.
with GNAT.Dynamic_Tables;
with System.OS_Lib; use System.OS_Lib;
package Symbols is
type Policy is
-- Symbol policy
(Autonomous,
-- Create a symbol file without considering any reference
Compliant,
-- Either create a symbol file with the same major and minor IDs if
-- all symbols are already found in the reference file or with an
-- incremented minor ID, if not.
Controlled,
-- Fail if symbols are not the same as those in the reference file
Restricted,
-- Restrict the symbols to those in the symbol file. Fail if some
-- symbols in the symbol file are not exported from the object files.
Direct);
-- The reference symbol file is copied to the symbol file
type Symbol_Kind is (Data, Proc);
-- To distinguish between the different kinds of symbols
type Symbol_Data is record
Name : String_Access;
Kind : Symbol_Kind := Data;
Present : Boolean := True;
end record;
-- Data (name and kind) for each of the symbols
package Symbol_Table is new GNAT.Dynamic_Tables
(Table_Component_Type => Symbol_Data,
Table_Index_Type => Natural,
Table_Low_Bound => 0,
Table_Initial => 100,
Table_Increment => 100);
-- The symbol tables
Original_Symbols : Symbol_Table.Instance;
-- The symbols, if any, found in the reference symbol table
Complete_Symbols : Symbol_Table.Instance;
-- The symbols, if any, found in the objects files
procedure Initialize
(Symbol_File : String;
Reference : String;
Symbol_Policy : Policy;
Quiet : Boolean;
Version : String;
Success : out Boolean);
-- Initialize a symbol file. This procedure must be called before
-- Processing any object file. Depending on the platforms and the
-- circumstances, additional messages may be issued if Quiet is False.
package Processing is
-- This package, containing a single visible procedure Process, exists
-- so that it can be a subunits, for some platforms, the body of package
-- Symbols is common, while the subunit Processing is not.
procedure Process
(Object_File : String;
Success : out Boolean);
-- Get the symbols from an object file. Success is set to True if the
-- object file exists and has the expected format.
end Processing;
procedure Finalize
(Quiet : Boolean;
Success : out Boolean);
-- Finalize the symbol file. This procedure should be called after
-- Initialize (once) and Process (one or more times). If Success is
-- True, the symbol file is written and closed, ready to be used for
-- linking the library. Depending on the platforms and the circumstances,
-- additional messages may be issued if Quiet is False.
end Symbols;
| 43 | 78 | 0.555533 |
397558df09db1de912b314f4ccb3d9bcd880a199 | 10,854 | adb | Ada | src/file_operations.adb | kraileth/ravenadm | 02bb13117bafc8887e0c90a4effc63ffcdc90642 | [
"0BSD"
] | 18 | 2017-02-28T08:43:17.000Z | 2022-03-22T21:55:56.000Z | src/file_operations.adb | kraileth/ravenadm | 02bb13117bafc8887e0c90a4effc63ffcdc90642 | [
"0BSD"
] | 49 | 2017-10-28T11:18:05.000Z | 2022-01-16T16:23:32.000Z | src/file_operations.adb | kraileth/ravenadm | 02bb13117bafc8887e0c90a4effc63ffcdc90642 | [
"0BSD"
] | 5 | 2017-09-06T14:47:57.000Z | 2021-11-25T08:31:10.000Z | -- This file is covered by the Internet Software Consortium (ISC) License
-- Reference: ../License.txt
with Ada.Directories;
with Ada.Direct_IO;
with Ada.Text_IO;
with HelperText;
package body File_Operations is
package DIR renames Ada.Directories;
package TIO renames Ada.Text_IO;
package HT renames HelperText;
--------------------------------------------------------------------------------------------
-- get_file_contents
--------------------------------------------------------------------------------------------
function get_file_contents (dossier : String) return String
is
File_Size : constant Natural := Natural (DIR.Size (dossier));
begin
if File_Size = 0 then
return "";
end if;
declare
subtype File_String is String (1 .. File_Size);
package File_String_IO is new Ada.Direct_IO (File_String);
file_handle : File_String_IO.File_Type;
contents : File_String;
attempts : Natural := 0;
begin
-- The introduction of variants causes a buildsheet to be scanned once per variant.
-- It's possible (even common) for simultaneous requests to scan the same buildsheet to
-- occur. Thus, if the file is already open, wait and try again (up to 5 times)
loop
begin
File_String_IO.Open (File => file_handle,
Mode => File_String_IO.In_File,
Name => dossier);
exit;
exception
when File_String_IO.Status_Error | File_String_IO.Use_Error =>
if attempts = 5 then
raise file_handling with "get_file_contents: failed open: " & dossier;
end if;
attempts := attempts + 1;
delay 0.1;
end;
end loop;
File_String_IO.Read (File => file_handle, Item => contents);
File_String_IO.Close (file_handle);
return contents;
exception
when others =>
if File_String_IO.Is_Open (file_handle) then
File_String_IO.Close (file_handle);
end if;
raise file_handling with "get_file_contents(" & dossier & ") failed";
end;
exception
when Storage_Error =>
raise file_handling with "get_file_contents(" & dossier & ") failed to allocate memory";
end get_file_contents;
--------------------------------------------------------------------------------------------
-- dump_contents_to_file
--------------------------------------------------------------------------------------------
procedure dump_contents_to_file
(contents : String;
dossier : String)
is
File_Size : Natural := contents'Length;
subtype File_String is String (1 .. File_Size);
package File_String_IO is new Ada.Direct_IO (File_String);
file_handle : File_String_IO.File_Type;
begin
mkdirp_from_filename (dossier);
File_String_IO.Create (File => file_handle,
Mode => File_String_IO.Out_File,
Name => dossier);
File_String_IO.Write (File => file_handle,
Item => contents);
File_String_IO.Close (file_handle);
exception
when Storage_Error =>
if File_String_IO.Is_Open (file_handle) then
File_String_IO.Close (file_handle);
end if;
raise file_handling
with "dump_contents_to_file(" & dossier & ") failed to allocate memory";
when others =>
if File_String_IO.Is_Open (file_handle) then
File_String_IO.Close (file_handle);
end if;
raise file_handling
with "dump_contents_to_file(" & dossier & ") error";
end dump_contents_to_file;
--------------------------------------------------------------------------------------------
-- create_subdirectory
--------------------------------------------------------------------------------------------
procedure create_subdirectory
(extraction_directory : String;
subdirectory : String)
is
abspath : String := extraction_directory & "/" & subdirectory;
begin
if subdirectory = "" then
return;
end if;
if not DIR.Exists (abspath) then
DIR.Create_Directory (abspath);
end if;
end create_subdirectory;
--------------------------------------------------------------------------------------------
-- head_n1
--------------------------------------------------------------------------------------------
function head_n1 (filename : String) return String
is
handle : TIO.File_Type;
begin
TIO.Open (File => handle, Mode => TIO.In_File, Name => filename);
if TIO.End_Of_File (handle) then
TIO.Close (handle);
return "";
end if;
declare
line : constant String := TIO.Get_Line (handle);
begin
TIO.Close (handle);
return line;
end;
end head_n1;
--------------------------------------------------------------------------------------------
-- create_pidfile
--------------------------------------------------------------------------------------------
procedure create_pidfile (pidfile : String)
is
pidtext : constant String := HT.int2str (Get_PID);
handle : TIO.File_Type;
begin
TIO.Create (File => handle, Mode => TIO.Out_File, Name => pidfile);
TIO.Put_Line (handle, pidtext);
TIO.Close (handle);
end create_pidfile;
--------------------------------------------------------------------------------------------
-- destroy_pidfile
--------------------------------------------------------------------------------------------
procedure destroy_pidfile (pidfile : String) is
begin
if DIR.Exists (pidfile) then
DIR.Delete_File (pidfile);
end if;
exception
when others => null;
end destroy_pidfile;
--------------------------------------------------------------------------------------------
-- mkdirp_from_filename
--------------------------------------------------------------------------------------------
procedure mkdirp_from_filename (filename : String)
is
condir : String := DIR.Containing_Directory (Name => filename);
begin
DIR.Create_Path (New_Directory => condir);
end mkdirp_from_filename;
--------------------------------------------------------------------------------------------
-- concatenate_file
--------------------------------------------------------------------------------------------
procedure concatenate_file (basefile : String; another_file : String)
is
handle : TIO.File_Type;
begin
if not DIR.Exists (another_file) then
raise file_handling with "concatenate_file: new_file does not exist => " & another_file;
end if;
if DIR.Exists (basefile) then
TIO.Open (File => handle,
Mode => TIO.Append_File,
Name => basefile);
declare
contents : constant String := get_file_contents (another_file);
begin
TIO.Put (handle, contents);
end;
TIO.Close (handle);
else
DIR.Copy_File (Source_Name => another_file,
Target_Name => basefile);
end if;
exception
when others =>
if TIO.Is_Open (handle) then
TIO.Close (handle);
end if;
raise file_handling;
end concatenate_file;
--------------------------------------------------------------------------------------------
-- create_cookie
--------------------------------------------------------------------------------------------
procedure create_cookie (fullpath : String)
is
subtype File_String is String (1 .. 1);
package File_String_IO is new Ada.Direct_IO (File_String);
file_handle : File_String_IO.File_Type;
begin
mkdirp_from_filename (fullpath);
File_String_IO.Create (File => file_handle,
Mode => File_String_IO.Out_File,
Name => fullpath);
File_String_IO.Close (file_handle);
exception
when others =>
raise file_handling;
end create_cookie;
--------------------------------------------------------------------------------------------
-- replace_directory_contents
--------------------------------------------------------------------------------------------
procedure replace_directory_contents
(source_directory : String;
target_directory : String;
pattern : String)
is
search : DIR.Search_Type;
dirent : DIR.Directory_Entry_Type;
filter : constant DIR.Filter_Type := (DIR.Ordinary_File => True, others => False);
begin
if not DIR.Exists (target_directory) then
return;
end if;
DIR.Start_Search (Search => search,
Directory => target_directory,
Pattern => pattern,
Filter => filter);
while DIR.More_Entries (search) loop
DIR.Get_Next_Entry (search, dirent);
declare
SN : constant String := DIR.Simple_Name (dirent);
oldfile : constant String := target_directory & "/" & SN;
newfile : constant String := source_directory & "/" & SN;
begin
if DIR.Exists (newfile) then
DIR.Copy_File (Source_Name => newfile, Target_Name => oldfile);
end if;
exception
when others =>
TIO.Put_Line ("Failed to copy " & newfile & " over to " & oldfile);
end;
end loop;
DIR.End_Search (search);
end replace_directory_contents;
--------------------------------------------------------------------------------------------
-- convert_ORIGIN_in_runpath
--------------------------------------------------------------------------------------------
function convert_ORIGIN_in_runpath (filename : String; runpath : String) return String
is
ORIGIN : constant String := "$ORIGIN";
begin
if not HT.contains (runpath, ORIGIN) then
return runpath;
end if;
declare
basedir : constant String := HT.head (filename, "/");
new_runpath : HT.Text := HT.replace_substring (US => HT.SUS (runpath),
old_string => ORIGIN,
new_string => basedir);
begin
return HT.USS (new_runpath);
end;
end convert_ORIGIN_in_runpath;
end File_Operations;
| 36.545455 | 97 | 0.47319 |
31e397366e3bd544ed48ad5ac88d88caac0524e4 | 661 | ads | Ada | problem/src/stack.ads | AdaCore/tictactoe | 6ef01ac2121040a1b3ed46288472504afe7c51ca | [
"BSD-3-Clause"
] | 3 | 2017-08-05T17:02:59.000Z | 2021-09-02T02:24:58.000Z | solution/src/stack.ads | DevCKano/tictactoe | 6ef01ac2121040a1b3ed46288472504afe7c51ca | [
"BSD-3-Clause"
] | null | null | null | solution/src/stack.ads | DevCKano/tictactoe | 6ef01ac2121040a1b3ed46288472504afe7c51ca | [
"BSD-3-Clause"
] | 4 | 2018-05-13T03:54:59.000Z | 2020-12-14T15:42:56.000Z | with Tictactoe; use Tictactoe;
package Stack
with SPARK_Mode => On
is
procedure Push (V : Board)
with Pre => not Full,
Post => Size = Size'Old + 1;
procedure Pop (V : out Board)
with Pre => not Empty,
Post => Size = Size'Old - 1;
procedure Clear;
function Top return Board
with Pre => not Empty;
Max_Size : constant := 9;
-- The stack size.
Last : Natural range 0 .. Max_Size := 0;
-- Indicates the top of the stack. When 0 the stack is empty.
function Full return Boolean is (Last >= Max_Size);
function Empty return Boolean is (Last < 1);
function Size return Integer is (Last);
end Stack;
| 20.030303 | 65 | 0.632375 |
a10d1ace1839fb1bceb6ec9b6f6bd2a6aad81384 | 1,257 | ads | Ada | snake_functions.ads | thieryw/snake_array_impl | 33782e864f81ebbf818e349d8fda5f14e49da448 | [
"MIT"
] | null | null | null | snake_functions.ads | thieryw/snake_array_impl | 33782e864f81ebbf818e349d8fda5f14e49da448 | [
"MIT"
] | 1 | 2018-06-03T19:08:34.000Z | 2018-06-03T19:08:48.000Z | snake_functions.ads | thieryw/snake_array_impl | 33782e864f81ebbf818e349d8fda5f14e49da448 | [
"MIT"
] | null | null | null | with snake_types,display ;
package snake_functions is
function are_same_coord(point1 : snake_types.Coordinates ; point2 : snake_types.Coordinates) return boolean ;
function create_snake return snake_types.Snake ;
procedure move_snake(s : in out snake_types.Snake ; dir : snake_types.Snake_direction ; fruit_coord : in out snake_types.Coordinates ; time_out : in out integer ; score : in out integer) ;
procedure retreve_user_input(
has_new_user_input: out boolean;
direction: out snake_types.Snake_direction ;
user_controls_value: in snake_types.User_Controls.Map
);
function get_user_controls_default return snake_types.User_Controls.Map ;
procedure update_direction(dir : in out snake_types.Snake_direction ; new_direction : snake_types.Snake_direction) ;
procedure generate_fruit(
s : snake_types.snake ;
fruit : out snake_types.Coordinates ;
time_out : out integer
) ;
procedure render_game(s : snake_types.snake ; fruit : snake_types.Coordinates) ;
procedure is_end_of_game(s : snake_types.snake ; end_game : out boolean) ;
end snake_functions ;
| 52.375 | 196 | 0.681782 |
31a9b0931633c5e92b61114406529b3fa0463d54 | 841 | ads | Ada | tests/tk-frame-frame_create_options_test_data.ads | thindil/tashy2 | 43fcbadb33c0062b2c8d6138a8238441dec5fd80 | [
"Apache-2.0"
] | 2 | 2020-12-09T07:27:07.000Z | 2021-10-19T13:31:54.000Z | tests/tk-frame-frame_create_options_test_data.ads | thindil/tashy2 | 43fcbadb33c0062b2c8d6138a8238441dec5fd80 | [
"Apache-2.0"
] | null | null | null | tests/tk-frame-frame_create_options_test_data.ads | thindil/tashy2 | 43fcbadb33c0062b2c8d6138a8238441dec5fd80 | [
"Apache-2.0"
] | null | null | null | -- This package is intended to set up and tear down the test environment.
-- Once created by GNATtest, this package will never be overwritten
-- automatically. Contents of this package can be modified in any way
-- except for sections surrounded by a 'read only' marker.
with Tk.Frame.Frame_Options_Test_Data.Frame_Options_Tests;
with GNATtest_Generated;
package Tk.Frame.Frame_Create_Options_Test_Data is
-- begin read only
type Test_Frame_Create_Options is new GNATtest_Generated.GNATtest_Standard
.Tk
.Frame
.Frame_Options_Test_Data
.Frame_Options_Tests
.Test_Frame_Options
-- end read only
with
null record;
procedure Set_Up(Gnattest_T: in out Test_Frame_Create_Options);
procedure Tear_Down(Gnattest_T: in out Test_Frame_Create_Options);
end Tk.Frame.Frame_Create_Options_Test_Data;
| 31.148148 | 77 | 0.782402 |
1d01fa5d4a6f4070cf2cc2b7b63ed7c5c939e0d1 | 10,934 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/s-utf_32.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-utf_32.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/s-utf_32.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . U T F _ 3 2 --
-- --
-- S p e c --
-- --
-- Copyright (C) 2005-2013, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package is an internal package that provides basic character
-- classification capabilities needed by the compiler for handling full
-- 32-bit wide wide characters. We avoid the use of the actual type
-- Wide_Wide_Character, since we want to use these routines in the compiler
-- itself, and we want to be able to compile the compiler with old versions
-- of GNAT that did not implement Wide_Wide_Character.
-- System.UTF_32 should not be directly used from an application program, but
-- an equivalent package GNAT.UTF_32 can be used directly and provides exactly
-- the same services. The reason this package is in System is so that it can
-- with'ed by other packages in the Ada and System hierarchies.
pragma Compiler_Unit_Warning;
package System.UTF_32 is
pragma Pure;
type UTF_32 is range 0 .. 16#7FFF_FFFF#;
-- So far, the only defined character codes are in 0 .. 16#01_FFFF#
-- The following type defines the categories from the unicode definitions.
-- The one addition we make is Fe, which represents the characters FFFE
-- and FFFF in any of the planes.
type Category is (
Cc, -- Other, Control
Cf, -- Other, Format
Cn, -- Other, Not Assigned
Co, -- Other, Private Use
Cs, -- Other, Surrogate
Ll, -- Letter, Lowercase
Lm, -- Letter, Modifier
Lo, -- Letter, Other
Lt, -- Letter, Titlecase
Lu, -- Letter, Uppercase
Mc, -- Mark, Spacing Combining
Me, -- Mark, Enclosing
Mn, -- Mark, Nonspacing
Nd, -- Number, Decimal Digit
Nl, -- Number, Letter
No, -- Number, Other
Pc, -- Punctuation, Connector
Pd, -- Punctuation, Dash
Pe, -- Punctuation, Close
Pf, -- Punctuation, Final quote
Pi, -- Punctuation, Initial quote
Po, -- Punctuation, Other
Ps, -- Punctuation, Open
Sc, -- Symbol, Currency
Sk, -- Symbol, Modifier
Sm, -- Symbol, Math
So, -- Symbol, Other
Zl, -- Separator, Line
Zp, -- Separator, Paragraph
Zs, -- Separator, Space
Fe); -- relative position FFFE/FFFF in any plane
function Get_Category (U : UTF_32) return Category;
-- Given a UTF32 code, returns corresponding Category, or Cn if
-- the code does not have an assigned unicode category.
-- The following functions perform category tests corresponding to lexical
-- classes defined in the Ada standard. There are two interfaces for each
-- function. The second takes a Category (e.g. returned by Get_Category).
-- The first takes a UTF_32 code. The form taking the UTF_32 code is
-- typically more efficient than calling Get_Category, but if several
-- different tests are to be performed on the same code, it is more
-- efficient to use Get_Category to get the category, then test the
-- resulting category.
function Is_UTF_32_Letter (U : UTF_32) return Boolean;
function Is_UTF_32_Letter (C : Category) return Boolean;
pragma Inline (Is_UTF_32_Letter);
-- Returns true iff U is a letter that can be used to start an identifier,
-- or if C is one of the corresponding categories, which are the following:
-- Letter, Uppercase (Lu)
-- Letter, Lowercase (Ll)
-- Letter, Titlecase (Lt)
-- Letter, Modifier (Lm)
-- Letter, Other (Lo)
-- Number, Letter (Nl)
function Is_UTF_32_Digit (U : UTF_32) return Boolean;
function Is_UTF_32_Digit (C : Category) return Boolean;
pragma Inline (Is_UTF_32_Digit);
-- Returns true iff U is a digit that can be used to extend an identifier,
-- or if C is one of the corresponding categories, which are the following:
-- Number, Decimal_Digit (Nd)
function Is_UTF_32_Line_Terminator (U : UTF_32) return Boolean;
pragma Inline (Is_UTF_32_Line_Terminator);
-- Returns true iff U is an allowed line terminator for source programs,
-- if U is in the category Zp (Separator, Paragraph), or Zl (Separator,
-- Line), or if U is a conventional line terminator (CR, LF, VT, FF).
-- There is no category version for this function, since the set of
-- characters does not correspond to a set of Unicode categories.
function Is_UTF_32_Mark (U : UTF_32) return Boolean;
function Is_UTF_32_Mark (C : Category) return Boolean;
pragma Inline (Is_UTF_32_Mark);
-- Returns true iff U is a mark character which can be used to extend an
-- identifier, or if C is one of the corresponding categories, which are
-- the following:
-- Mark, Non-Spacing (Mn)
-- Mark, Spacing Combining (Mc)
function Is_UTF_32_Other (U : UTF_32) return Boolean;
function Is_UTF_32_Other (C : Category) return Boolean;
pragma Inline (Is_UTF_32_Other);
-- Returns true iff U is an other format character, which means that it
-- can be used to extend an identifier, but is ignored for the purposes of
-- matching of identifiers, or if C is one of the corresponding categories,
-- which are the following:
-- Other, Format (Cf)
function Is_UTF_32_Punctuation (U : UTF_32) return Boolean;
function Is_UTF_32_Punctuation (C : Category) return Boolean;
pragma Inline (Is_UTF_32_Punctuation);
-- Returns true iff U is a punctuation character that can be used to
-- separate pieces of an identifier, or if C is one of the corresponding
-- categories, which are the following:
-- Punctuation, Connector (Pc)
function Is_UTF_32_Space (U : UTF_32) return Boolean;
function Is_UTF_32_Space (C : Category) return Boolean;
pragma Inline (Is_UTF_32_Space);
-- Returns true iff U is considered a space to be ignored, or if C is one
-- of the corresponding categories, which are the following:
-- Separator, Space (Zs)
function Is_UTF_32_Non_Graphic (U : UTF_32) return Boolean;
function Is_UTF_32_Non_Graphic (C : Category) return Boolean;
pragma Inline (Is_UTF_32_Non_Graphic);
-- Returns true iff U is considered to be a non-graphic character, or if C
-- is one of the corresponding categories, which are the following:
-- Other, Control (Cc)
-- Other, Private Use (Co)
-- Other, Surrogate (Cs)
-- Separator, Line (Zl)
-- Separator, Paragraph (Zp)
-- FFFE or FFFF positions in any plane (Fe)
--
-- Note that the Ada category format effector is subsumed by the above
-- list of Unicode categories.
--
-- Note that Other, Unassigned (Cn) is quite deliberately not included
-- in the list of categories above. This means that should any of these
-- code positions be defined in future with graphic characters they will
-- be allowed without a need to change implementations or the standard.
--
-- Note that Other, Format (Cf) is also quite deliberately not included
-- in the list of categories above. This means that these characters can
-- be included in character and string literals.
-- The following function is used to fold to upper case, as required by
-- the Ada 2005 standard rules for identifier case folding. Two
-- identifiers are equivalent if they are identical after folding all
-- letters to upper case using this routine. A corresponding routine to
-- fold to lower case is also provided.
function UTF_32_To_Lower_Case (U : UTF_32) return UTF_32;
pragma Inline (UTF_32_To_Lower_Case);
-- If U represents an upper case letter, returns the corresponding lower
-- case letter, otherwise U is returned unchanged. The folding rule is
-- simply that if the code corresponds to a 10646 entry whose name contains
-- the string CAPITAL LETTER, and there is a corresponding entry whose name
-- is the same but with CAPITAL LETTER replaced by SMALL LETTER, then the
-- code is folded to this SMALL LETTER code. Otherwise the input code is
-- returned unchanged.
function UTF_32_To_Upper_Case (U : UTF_32) return UTF_32;
pragma Inline (UTF_32_To_Upper_Case);
-- If U represents a lower case letter, returns the corresponding lower
-- case letter, otherwise U is returned unchanged. The folding rule is
-- simply that if the code corresponds to a 10646 entry whose name contains
-- the string SMALL LETTER, and there is a corresponding entry whose name
-- is the same but with SMALL LETTER replaced by CAPITAL LETTER, then the
-- code is folded to this CAPITAL LETTER code. Otherwise the input code is
-- returned unchanged.
end System.UTF_32;
| 51.333333 | 79 | 0.621456 |
500c1a31cc21b0f9fe61a5dd6e196733a7eddfa1 | 8,586 | ads | Ada | tlsf/src/tlsf-block-types.ads | vasil-sd/ada-tlsf | c30cfaf5f0b87ebb6e4dd479e50b3f9b11381ddd | [
"MIT"
] | 3 | 2020-02-21T15:42:14.000Z | 2020-04-08T09:42:32.000Z | tlsf/src/tlsf-block-types.ads | vasil-sd/ada-tlsf | c30cfaf5f0b87ebb6e4dd479e50b3f9b11381ddd | [
"MIT"
] | null | null | null | tlsf/src/tlsf-block-types.ads | vasil-sd/ada-tlsf | c30cfaf5f0b87ebb6e4dd479e50b3f9b11381ddd | [
"MIT"
] | 1 | 2020-02-21T15:29:26.000Z | 2020-02-21T15:29:26.000Z | with System;
with Interfaces;
with TLSF.Config;
package TLSF.Block.Types with SPARK_Mode, Pure, Preelaborate is
use TLSF.Config;
use Interfaces;
type Size is new Natural range 0 .. 2 ** Max_Block_Size_Log2-1
with Size => Max_Block_Size_Log2;
type Size_Bits is mod 2**Size'Size;
type Address is new Size;
type Address_Bits is mod 2**Address'Size;
Address_Null : constant Address := 0;
subtype Valid_Address is Address
with Predicate => (Valid_Address /= Address_Null);
function To_Size_Bits (S : Size) return Size_Bits
with
Global => null,
Pure_Function,
Post => Size(To_Size_Bits'Result) = S;
function To_Address_Bits (A : Address) return Address_Bits
with
Global => null,
Pure_Function,
Post => Address(To_Address_Bits'Result) = A;
Align_Mask : constant := (2 ** Align_Size_Log2) - 1;
Quantum : constant := Align_Mask + 1;
function Is_Aligned (Val : Size) return Boolean
with
Global => null,
Pure_Function,
Contract_Cases =>
( (Size_Bits(Val) and Align_Mask) = 0 => Is_Aligned'Result = True,
others => Is_Aligned'Result = False);
function Is_Aligned (Val : Address) return Boolean
with
Global => null,
Pure_Function,
Contract_Cases =>
( (Address_Bits(Val) and Align_Mask) = 0 => Is_Aligned'Result = True,
others => Is_Aligned'Result = False);
subtype Aligned_Size is Size with
Predicate => Is_Aligned(Aligned_Size);
subtype Aligned_Address is Address with
Predicate => Is_Aligned(Aligned_Address);
function Round_Size_Up (S : Size) return Aligned_Size
with
Global => null,
Pure_Function,
Pre => S <= Size'Last - Align_Mask,
Post => Is_Aligned(Round_Size_Up'Result);
function Round_Address_Up (A : Address) return Aligned_Address
with
Global => null,
Pure_Function,
Pre => A <= Address'Last - Align_Mask,
Post => Is_Aligned(Round_Address_Up'Result);
function "+" (A: Aligned_Address; S: Aligned_Size) return Aligned_Address
with
Global => null,
Pure_Function,
Pre => Integer(A) + Integer(S) in 0 .. Integer(Address'Last),
Post =>
Is_Aligned("+"'Result)
and "+"'Result = Aligned_Address(Integer(A) + Integer(S));
function "+" (L, R : Aligned_Size) return Aligned_Size
with
Global => null,
Pure_Function,
Pre => Integer(L) + Integer(R) in 0 .. Integer(Address'Last),
Post =>
Is_Aligned ("+"'Result)
and "+"'Result = Aligned_Size (Integer (L) + Integer (R));
-- To is not inclusive, ie [From, To)
function "-" (To, From : Aligned_Address) return Aligned_Size
with
Global => null,
Pure_Function,
Pre => To >= From,
Post => Is_Aligned ("-"'Result)
and "-"'Result = Aligned_Size (Integer (To) - Integer (From));
-- address space for blocks
type Address_Space is record
First : Aligned_Address := Quantum;
Last : Aligned_Address := Address'Last - (Quantum - 1);
end record
with Predicate =>
First >= Quantum and then
Last <= Address'Last - (Quantum - 1) and then
Last > First;
type Status is (Free, Occupied)
with Size => 1;
-- Free: block is free
-- Occupied: block in use
-- Absent: block is absent (previous of the first
-- block or next of the last)
type Free_Blocks_List is
record
Prev_Address : Aligned_Address := Address_Null;
Next_Address : Aligned_Address := Address_Null;
end record
with Pack,
Predicate => ((Prev_Address = 0 and then Next_Address = 0) or else
(Prev_Address /=0 and then Next_Address /= 0));
type Block_Header (Status : Types.Status := Free) is
record
Prev_Block_Address : Aligned_Address := Address_Null;
Size : Aligned_Size := 0;
case Status is
when Free => Free_List : Free_Blocks_List;
when Occupied => null;
end case;
end record
with Pack;
subtype Block_Header_Occupied is Block_Header(Status => Occupied);
subtype Block_Header_Free is Block_Header(Status => Free);
pragma Assert ((Size_Bits'(Small_Block_Size) and Align_Mask) = 0);
Block_Header_Size : constant Size := Small_Block_Size;
-- Size(Block_Header'Max_Size_In_Storage_Elements);
Block_Header_Occupied_Size : constant Size := Small_Block_Size;
-- Size(Block_Header_Occupied'Max_Size_In_Storage_Elements);
Block_Header_Free_Size : constant Size := Small_Block_Size;
-- Size(Block_Header_Free'Max_Size_In_Storage_Elements);
Empty_Free_List : constant Free_Blocks_List :=
Free_Blocks_List'(Address_Null, Address_Null);
pragma Assert (Small_Block_Size >= Block_Header_Size);
-- should be >= Block_Header max size in storage elements
pragma Assert (Block_Header_Free_Size >= Block_Header_Occupied_Size);
-- Predicates
function Is_Free_List_Empty (Free_List : Free_Blocks_List)
return Boolean
is (Free_List = Empty_Free_List);
function Is_Block_Free (Block : Block_Header) return Boolean
is (Block.Status = Free);
function Is_Block_Occupied (Block : Block_Header) return Boolean
is (Block.Status = Occupied);
function Is_Block_Linked_To_Free_List (Block : Block_Header_Free) return Boolean
is (Block.Free_List.Prev_Address /= Address_Null and then
Block.Free_List.Next_Address /= Address_Null)
with Pre => Is_Block_Free (Block),
Post => (if not Is_Free_List_Empty (Block.Free_List)
then Is_Block_Linked_To_Free_List'Result = True
else Is_Block_Linked_To_Free_List'Result = False);
-- Contract_Cases => (not Is_Free_List_Empty(Block.Free_List)
-- => Is_Block_Linked_To_Free_List'Result = True,
-- others
-- => Is_Block_Linked_To_Free_List'Result = False);
function Is_Block_Last_In_Free_List (Block: Block_Header) return Boolean
is (Block.Free_List /= Empty_Free_List and then
Block.Free_List.Prev_Address = Block.Free_List.Next_Address)
with Pre => Is_Block_Free(Block),
Post => (if Block.Free_List /= Empty_Free_List and then
Block.Free_List.Prev_Address = Block.Free_List.Next_Address
then Is_Block_Last_In_Free_List'Result = True
else Is_Block_Last_In_Free_List'Result = False);
-- Contract_Cases =>
-- (Block.Free_List /= Empty_Free_List and then
-- Block.Free_List.Prev_Address = Block.Free_List.Next_Address
-- => Is_Block_Last_In_Free_List'Result = True,
-- others => Is_Block_Last_In_Free_List'Result = False);
--
function Changed_Only_Links_For_Free_List (Block_Old, Block_New : Block_Header)
return Boolean
is
(Is_Block_Free(Block_Old) and then
Is_Block_Free(Block_New) and then
Block_New.Prev_Block_Address = Block_Old.Prev_Block_Address and then
Block_New.Size = Block_Old.Size);
-- Calculation of levels
type First_Level_Index is new Natural range SL_Index_Count_Log2 .. FL_Index_Max;
type Second_Level_Index is new Natural range 0 .. SL_Index_Count - 1;
pragma Assert (Second_Level_Index'Last =
(2 ** Natural(First_Level_Index'First)) - 1);
type Level_Index is
record
First_Level : First_Level_Index;
Second_Level : Second_Level_Index;
end record;
function Calculate_Levels_Indices
(S : Size_Bits)
return Level_Index
with
Pure_Function,
Pre => S >= Size_Bits(Small_Block_Size);
function Is_Same_Size_Class(S1, S2: Size) return Boolean
with
Pre =>
S1 >= Small_Block_Size and then
S2 >= Small_Block_Size,
Contract_Cases =>
(Calculate_Levels_Indices(Size_Bits(S1)) =
Calculate_Levels_Indices(Size_Bits(S2)) =>
Is_Same_Size_Class'Result = True,
others =>
Is_Same_Size_Class'Result = False);
end TLSF.Block.Types;
| 35.775 | 93 | 0.623457 |
39b6e637bb1a5233be1e289b21e923117b63636e | 2,907 | ads | Ada | src/definitions.ads | kraileth/ravenadm | 02bb13117bafc8887e0c90a4effc63ffcdc90642 | [
"0BSD"
] | null | null | null | src/definitions.ads | kraileth/ravenadm | 02bb13117bafc8887e0c90a4effc63ffcdc90642 | [
"0BSD"
] | null | null | null | src/definitions.ads | kraileth/ravenadm | 02bb13117bafc8887e0c90a4effc63ffcdc90642 | [
"0BSD"
] | null | null | null | -- This file is covered by the Internet Software Consortium (ISC) License
-- Reference: ../License.txt
package Definitions is
pragma Pure;
raven_version_major : constant String := "1";
raven_version_minor : constant String := "71";
copyright_years : constant String := "2015-2021";
raven_tool : constant String := "ravenadm";
variant_standard : constant String := "standard";
contact_nobody : constant String := "nobody";
contact_automaton : constant String := "automaton";
dlgroup_main : constant String := "main";
dlgroup_none : constant String := "none";
options_none : constant String := "none";
options_all : constant String := "all";
broken_all : constant String := "all";
boolean_yes : constant String := "yes";
homepage_none : constant String := "none";
spkg_complete : constant String := "complete";
spkg_docs : constant String := "docs";
spkg_examples : constant String := "examples";
spkg_nls : constant String := "nls";
ports_default : constant String := "floating";
default_ssl : constant String := "libressl";
default_mysql : constant String := "oracle-8.0";
default_lua : constant String := "5.3";
default_perl : constant String := "5.30";
default_pgsql : constant String := "12";
default_php : constant String := "7.4";
default_python3 : constant String := "3.8";
default_ruby : constant String := "2.7";
default_tcltk : constant String := "8.6";
default_firebird : constant String := "2.5";
default_binutils : constant String := "binutils:ravensys";
default_compiler : constant String := "gcc9";
previous_default : constant String := "gcc9";
compiler_version : constant String := "9.3.0";
previous_compiler : constant String := "9.2.0";
binutils_version : constant String := "2.35.1";
previous_binutils : constant String := "2.34";
arc_ext : constant String := ".tzst";
jobs_per_cpu : constant := 2;
task_stack_limit : constant := 10_000_000;
type supported_opsys is (dragonfly, freebsd, netbsd, openbsd, sunos, linux, macos);
type supported_arch is (x86_64, i386, aarch64);
type cpu_range is range 1 .. 64;
type scanners is range cpu_range'First .. cpu_range'Last;
type builders is range cpu_range'First .. cpu_range'Last * jobs_per_cpu;
type count_type is (total, success, failure, ignored, skipped);
-- Modify following with post-patch sed accordingly
platform_type : constant supported_opsys := dragonfly;
host_localbase : constant String := "/raven";
raven_var : constant String := "/var/ravenports";
host_pkg8 : constant String := host_localbase & "/sbin/ravensw";
ravenexec : constant String := host_localbase & "/libexec/ravenexec";
end Definitions;
| 44.723077 | 86 | 0.652219 |
a116e7cd31b61adfe5637a7821b50b86aedc5562 | 8,518 | ads | Ada | source/league/matreshka-internals-calendars-formatting-iso_8601.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/league/matreshka-internals-calendars-formatting-iso_8601.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/league/matreshka-internals-calendars-formatting-iso_8601.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
package Matreshka.Internals.Calendars.Formatting.ISO_8601 is
pragma Preelaborate;
type ISO_8601_Printer is new Abstract_Printer with null record;
overriding procedure Append_Abbreviated_Era
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Padding : Era_Padding);
overriding procedure Append_Long_Era
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number);
overriding procedure Append_Narrow_Era
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number);
overriding procedure Append_Year
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Padding : Positive);
overriding procedure Append_Year_Week
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Padding : Positive);
overriding procedure Append_Extended_Year
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Padding : Positive);
overriding procedure Append_Numerical_Quarter
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Padding : Positive;
Is_Stand_Alone : Boolean);
overriding procedure Append_Abbreviated_Quarter
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Is_Stand_Alone : Boolean);
overriding procedure Append_Full_Quarter
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Is_Stand_Alone : Boolean);
overriding procedure Append_Numerical_Month
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Padding : Positive;
Is_Stand_Alone : Boolean);
overriding procedure Append_Abbreviated_Month
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Is_Stand_Alone : Boolean);
overriding procedure Append_Full_Month
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Is_Stand_Alone : Boolean);
overriding procedure Append_Narrow_Month
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Is_Stand_Alone : Boolean);
overriding procedure Append_Chinese_Leap_Month
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number);
overriding procedure Append_Week_Of_Year
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Padding : Positive);
overriding procedure Append_Week_Of_Month
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number);
overriding procedure Append_Day_Of_Month
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Padding : Positive);
overriding procedure Append_Day_Of_Year
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Padding : Positive);
overriding procedure Append_Day_Of_Week_In_Month
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number);
overriding procedure Append_Julian_Day
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Padding : Positive);
overriding procedure Append_Numerical_Day_Of_Week
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Padding : Positive;
Is_Stand_Alone : Boolean);
overriding procedure Append_Short_Day_Of_Week
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Padding : Positive;
Is_Stand_Alone : Boolean);
overriding procedure Append_Full_Day_Of_Week
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Is_Stand_Alone : Boolean);
overriding procedure Append_Narrow_Day_Of_Week
(Self : ISO_8601_Printer;
Output : in out League.Strings.Universal_String;
Date : Julian_Day_Number;
Is_Stand_Alone : Boolean);
end Matreshka.Internals.Calendars.Formatting.ISO_8601;
| 43.682051 | 78 | 0.564921 |
31e03acd9121c194ba836d9bcfbb8590c2935932 | 5,978 | ads | Ada | src/zmq_thin.ads | sonneveld/adazmq | ee1a3ad1588f6a298fe1170c0e907052dcb7a1a6 | [
"MIT"
] | null | null | null | src/zmq_thin.ads | sonneveld/adazmq | ee1a3ad1588f6a298fe1170c0e907052dcb7a1a6 | [
"MIT"
] | null | null | null | src/zmq_thin.ads | sonneveld/adazmq | ee1a3ad1588f6a298fe1170c0e907052dcb7a1a6 | [
"MIT"
] | null | null | null | with Interfaces.C;
with Interfaces.C.Strings;
with System;
package ZMQ_Thin is
-- Version
procedure zmq_version (major : access Interfaces.C.int; minor : access Interfaces.C.int; patch : access Interfaces.C.int);
pragma Import (C, zmq_version, "zmq_version");
-- Errors
function zmq_errno return Interfaces.C.int;
pragma Import (C, zmq_errno, "zmq_errno");
function zmq_strerror (errnum : Interfaces.C.int) return Interfaces.C.Strings.chars_ptr;
pragma Import (C, zmq_strerror, "zmq_strerror");
-- Contexts
function zmq_ctx_new return System.Address;
pragma Import (C, zmq_ctx_new, "zmq_ctx_new");
function zmq_ctx_term (context : System.Address) return Interfaces.C.int;
pragma Import (C, zmq_ctx_term, "zmq_ctx_term");
function zmq_ctx_shutdown (ctx_u : System.Address) return Interfaces.C.int;
pragma Import (C, zmq_ctx_shutdown, "zmq_ctx_shutdown");
function zmq_ctx_set (context : System.Address; option : Interfaces.C.int; optval : Interfaces.C.int) return Interfaces.C.int;
pragma Import (C, zmq_ctx_set, "zmq_ctx_set");
function zmq_ctx_get (context : System.Address; option : Interfaces.C.int) return Interfaces.C.int;
pragma Import (C, zmq_ctx_get, "zmq_ctx_get");
-- Message
type zmq_msg_t_u_u_array is array (1 .. 64) of Interfaces.C.unsigned_char;
type zmq_msg_t is record
u_u : zmq_msg_t_u_u_array := (others => 0);
end record;
for zmq_msg_t'Alignment use 8;
pragma Convention (C_Pass_By_Copy, zmq_msg_t);
function zmq_msg_init (msg : access zmq_msg_t) return Interfaces.C.int;
pragma Import (C, zmq_msg_init, "zmq_msg_init");
function zmq_msg_init_size (msg : access zmq_msg_t; size : Interfaces.C.size_t) return Interfaces.C.int;
pragma Import (C, zmq_msg_init_size, "zmq_msg_init_size");
function zmq_msg_send (msg : access zmq_msg_t; s : System.Address; flags : Interfaces.C.unsigned) return Interfaces.C.int;
pragma Import (C, zmq_msg_send, "zmq_msg_send");
function zmq_msg_recv (msg : access zmq_msg_t; s : System.Address; flags : Interfaces.C.unsigned) return Interfaces.C.int;
pragma Import (C, zmq_msg_recv, "zmq_msg_recv");
function zmq_msg_close (msg : access zmq_msg_t) return Interfaces.C.int;
pragma Import (C, zmq_msg_close, "zmq_msg_close");
function zmq_msg_move (dest : access zmq_msg_t; src : access zmq_msg_t) return Interfaces.C.int;
pragma Import (C, zmq_msg_move, "zmq_msg_move");
function zmq_msg_copy (dest : access zmq_msg_t; src : access zmq_msg_t) return Interfaces.C.int;
pragma Import (C, zmq_msg_copy, "zmq_msg_copy");
function zmq_msg_data (msg : access zmq_msg_t) return System.Address;
pragma Import (C, zmq_msg_data, "zmq_msg_data");
function zmq_msg_size (msg : access zmq_msg_t) return Interfaces.C.size_t;
pragma Import (C, zmq_msg_size, "zmq_msg_size");
function zmq_msg_more (msg : access zmq_msg_t) return Interfaces.C.int;
pragma Import (C, zmq_msg_more, "zmq_msg_more");
function zmq_msg_get (msg : access zmq_msg_t; option : Interfaces.C.int) return Interfaces.C.int;
pragma Import (C, zmq_msg_get, "zmq_msg_get");
function zmq_msg_set (msg : access zmq_msg_t; option : Interfaces.C.int; optval : Interfaces.C.int) return Interfaces.C.int;
pragma Import (C, zmq_msg_set, "zmq_msg_set");
-- Sockets
function zmq_socket (cxt : System.Address; s_type : Interfaces.C.int) return System.Address;
pragma Import (C, zmq_socket, "zmq_socket");
function zmq_close (s : System.Address) return Interfaces.C.int;
pragma Import (C, zmq_close, "zmq_close");
function zmq_setsockopt (s : System.Address; option : Interfaces.C.int; optval : System.Address; optvallen : Interfaces.C.size_t) return Interfaces.C.int;
pragma Import (C, zmq_setsockopt, "zmq_setsockopt");
function zmq_getsockopt (s : System.Address; option : Interfaces.C.int; optval : System.Address; optvallen : access Interfaces.C.size_t) return Interfaces.C.int;
pragma Import (C, zmq_getsockopt, "zmq_getsockopt");
function zmq_bind (s : System.Address; addr : Interfaces.C.Strings.chars_ptr) return Interfaces.C.int;
pragma Import (C, zmq_bind, "zmq_bind");
function zmq_connect (s : System.Address; addr : Interfaces.C.Strings.chars_ptr) return Interfaces.C.int;
pragma Import (C, zmq_connect, "zmq_connect");
function zmq_unbind (s : System.Address; addr : Interfaces.C.Strings.chars_ptr) return Interfaces.C.int;
pragma Import (C, zmq_unbind, "zmq_unbind");
function zmq_disconnect (s : System.Address; addr : Interfaces.C.Strings.chars_ptr) return Interfaces.C.int;
pragma Import (C, zmq_disconnect, "zmq_disconnect");
function zmq_send (s : System.Address; buf : System.Address; len : Interfaces.C.size_t; flags : Interfaces.C.unsigned) return Interfaces.C.int;
pragma Import (C, zmq_send, "zmq_send");
function zmq_recv (s : System.Address; buf : System.Address; len : Interfaces.C.size_t; flags : Interfaces.C.unsigned) return Interfaces.C.int;
pragma Import (C, zmq_recv, "zmq_recv");
-- Polling
type zmq_pollitem_t is record
socket : System.Address := System.Null_Address;
fd : Interfaces.C.int := 0;
events : Interfaces.C.short := 0;
revents : aliased Interfaces.C.short := 0;
end record;
pragma Convention (C_Pass_By_Copy, zmq_pollitem_t);
function zmq_poll (items : access zmq_pollitem_t; nitems : Interfaces.C.int; timeout : Interfaces.C.long) return Interfaces.C.int;
pragma Import (C, zmq_poll, "zmq_poll");
-- Proxy
function zmq_proxy (frontend : System.Address; backend : System.Address; capture : System.Address) return Interfaces.C.int;
pragma Import (C, zmq_proxy, "zmq_proxy");
function zmq_proxy_steerable (frontend : System.Address; backend : System.Address; capture : System.Address; control : System.Address) return Interfaces.C.int;
pragma Import (C, zmq_proxy_steerable, "zmq_proxy_steerable");
end ZMQ_Thin;
| 42.098592 | 164 | 0.733021 |
a1da01f402815f3d66d36dd98d914d8cd778c9e6 | 4,398 | ads | Ada | tools/scitools/conf/understand/ada/ada12/s-imgrea.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | 1 | 2020-01-20T21:26:46.000Z | 2020-01-20T21:26:46.000Z | tools/scitools/conf/understand/ada/ada12/s-imgrea.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada12/s-imgrea.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . I M G _ R E A L --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2009, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
-- Image for fixed and float types (also used for Float_IO/Fixed_IO output)
package System.Img_Real is
pragma Pure;
procedure Image_Ordinary_Fixed_Point
(V : Long_Long_Float;
S : in out String;
P : out Natural;
Aft : Natural);
-- Computes fixed_type'Image (V) and returns the result in S (1 .. P)
-- updating P on return. The result is computed according to the rules for
-- image for fixed-point types (RM 3.5(34)), where Aft is the value of the
-- Aft attribute for the fixed-point type. This function is used only for
-- ordinary fixed point (see package System.Img_Dec for handling of decimal
-- fixed-point). The caller guarantees that S is long enough to hold the
-- result and has a lower bound of 1.
procedure Image_Floating_Point
(V : Long_Long_Float;
S : in out String;
P : out Natural;
Digs : Natural);
-- Computes fixed_type'Image (V) and returns the result in S (1 .. P)
-- updating P on return. The result is computed according to the rules for
-- image for floating-point types (RM 3.5(33)), where Digs is the value of
-- the Digits attribute for the floating-point type. The caller guarantees
-- that S is long enough to hold the result and has a lower bound of 1.
procedure Set_Image_Real
(V : Long_Long_Float;
S : out String;
P : in out Natural;
Fore : Natural;
Aft : Natural;
Exp : Natural);
-- Sets the image of V starting at S (P + 1), updating P to point to the
-- last character stored, the caller promises that the buffer is large
-- enough and no check is made for this. Constraint_Error will not
-- necessarily be raised if this is violated, since it is perfectly valid
-- to compile this unit with checks off). The Fore, Aft and Exp values
-- can be set to any valid values for the case of use from Text_IO. Note
-- that no space is stored at the start for non-negative values.
end System.Img_Real;
| 57.116883 | 79 | 0.468849 |
4d8e301358b9ec005f255173286c85e4fb57f606 | 934 | ads | Ada | src/skill-internal-file_writers.ads | skill-lang/adaCommon | b27bccb8fa1c8b299ab98a82741a648183e41d3c | [
"BSD-3-Clause"
] | null | null | null | src/skill-internal-file_writers.ads | skill-lang/adaCommon | b27bccb8fa1c8b299ab98a82741a648183e41d3c | [
"BSD-3-Clause"
] | null | null | null | src/skill-internal-file_writers.ads | skill-lang/adaCommon | b27bccb8fa1c8b299ab98a82741a648183e41d3c | [
"BSD-3-Clause"
] | null | null | null | -- ___ _ ___ _ _ --
-- / __| |/ (_) | | Common SKilL implementation --
-- \__ \ ' <| | | |__ file writer implementation --
-- |___/_|\_\_|_|____| by: Timm Felden --
-- --
pragma Ada_2012;
with Skill.Files;
with Skill.Streams.Writer;
-- documentation can be found in java common
-- this is a combination of serialization functions, write and append
package Skill.Internal.File_Writers is
-- write a file to disk
procedure Write
(State : Skill.Files.File;
Output : Skill.Streams.Writer.Output_Stream);
-- append a file to an existing one
procedure Append
(State : Skill.Files.File;
Output : Skill.Streams.Writer.Output_Stream);
end Skill.Internal.File_Writers;
| 35.923077 | 80 | 0.507495 |
1d0029e325ceef7f51d4e082227870e5957fccfd | 410 | ads | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/noreturn4_pkg.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/noreturn4_pkg.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/noreturn4_pkg.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | with Ada.Finalization; use Ada.Finalization;
package Noreturn4_Pkg is
type Priv is private;
function It return Priv;
function Value (Obj : Priv) return Integer;
function OK (Obj : Priv) return Boolean;
private
type Priv is new Controlled with record
Value : Integer := 15;
end record;
procedure Adjust (Obj : in out Priv);
procedure Finalize (Obj : in out Priv);
end Noreturn4_Pkg;
| 21.578947 | 45 | 0.717073 |
1290c851b5aceb10756c2d8688ba7c46f2fcdf41 | 6,552 | adb | Ada | tests/tkmrpc_orb_tests.adb | DrenfongWong/tkm-rpc | 075d22871cf81d497aac656c7f03a513278b641c | [
"BSD-3-Clause"
] | null | null | null | tests/tkmrpc_orb_tests.adb | DrenfongWong/tkm-rpc | 075d22871cf81d497aac656c7f03a513278b641c | [
"BSD-3-Clause"
] | null | null | null | tests/tkmrpc_orb_tests.adb | DrenfongWong/tkm-rpc | 075d22871cf81d497aac656c7f03a513278b641c | [
"BSD-3-Clause"
] | null | null | null | --
-- Copyright (C) 2013 Reto Buerki <[email protected]>
-- Copyright (C) 2013 Adrian-Ken Rueegsegger <[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:
-- 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 University 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 REGENTS 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 REGENTS 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.Strings;
with GNAT.OS_Lib;
with Anet.Util;
with Anet.Sockets.Unix;
with Anet.Receivers.Stream;
with Tkmrpc.Types;
with Tkmrpc.Clients.Ike;
with Tkmrpc.Dispatchers.Ike;
with Tkmrpc.Mock;
with Tkmrpc.Results;
with Tkmrpc.Process_Stream;
pragma Elaborate_All (Anet.Receivers.Stream);
pragma Elaborate_All (Tkmrpc.Process_Stream);
package body Tkmrpc_ORB_Tests
is
use Ahven;
use Tkmrpc;
package ICS renames Interfaces.C.Strings;
package Unix_TCP_Receiver is new Anet.Receivers.Stream
(Socket_Type => Anet.Sockets.Unix.TCP_Socket_Type,
Address_Type => Anet.Sockets.Unix.Full_Path_Type,
Accept_Connection => Anet.Sockets.Unix.Accept_Connection);
procedure Dispatch is new Process_Stream
(Address_Type => Anet.Sockets.Unix.Full_Path_Type,
Dispatch => Tkmrpc.Dispatchers.Ike.Dispatch);
Socket_Path : constant String := "/tmp/tkm.rpc-";
-------------------------------------------------------------------------
procedure C_Test_Client
is
use type Tkmrpc.Types.Nc_Id_Type;
use type Tkmrpc.Types.Nonce_Length_Type;
Sock : aliased Anet.Sockets.Unix.TCP_Socket_Type;
Receiver : Unix_TCP_Receiver.Receiver_Type (S => Sock'Access);
Args : GNAT.OS_Lib.Argument_List (1 .. 1);
Success : Boolean := False;
Path : constant String
:= Socket_Path & Anet.Util.Random_String (Len => 8);
begin
Sock.Init;
Sock.Bind (Path => Anet.Sockets.Unix.Path_Type (Path));
Receiver.Listen (Callback => Dispatch'Access);
Args (1) := new String'(Path);
GNAT.OS_Lib.Spawn (Program_Name => "./client",
Args => Args,
Success => Success);
GNAT.OS_Lib.Free (X => Args (1));
Assert (Condition => Success,
Message => "Spawning client failed");
-- The C test client requests a nonce with id 1 and length 128.
Assert (Condition => Mock.Last_Nonce_Id = 1,
Message => "Last nonce id mismatch");
Assert (Condition => Mock.Last_Nonce_Length = 128,
Message => "Last nonce length mismatch");
Receiver.Stop;
Mock.Last_Nonce_Id := Types.Nc_Id_Type'Last;
Mock.Last_Nonce_Length := 16;
exception
when others =>
Receiver.Stop;
Mock.Last_Nonce_Id := Types.Nc_Id_Type'Last;
Mock.Last_Nonce_Length := 16;
raise;
end C_Test_Client;
-------------------------------------------------------------------------
procedure Client_Server_ORBs
is
use type Tkmrpc.Types.Nonce_Type;
use type Tkmrpc.Types.Nonce_Length_Type;
use type Tkmrpc.Types.Nc_Id_Type;
use type Tkmrpc.Results.Result_Type;
Sock : aliased Anet.Sockets.Unix.TCP_Socket_Type;
Receiver : Unix_TCP_Receiver.Receiver_Type (S => Sock'Access);
Nonce : Types.Nonce_Type;
Result : Results.Result_Type;
Path : constant String
:= Socket_Path & Anet.Util.Random_String (Len => 8);
Address : ICS.chars_ptr
:= ICS.New_String (Str => Path);
begin
Sock.Init;
Sock.Bind (Path => Anet.Sockets.Unix.Path_Type (Path));
Receiver.Listen (Callback => Dispatch'Access);
Clients.Ike.Init (Result => Result,
Address => Address);
ICS.Free (Item => Address);
Assert (Condition => Result = Results.Ok,
Message => "IKE init failed");
Clients.Ike.Nc_Create (Nc_Id => 23,
Nonce_Length => 243,
Nonce => Nonce,
Result => Result);
Assert (Condition => Result = Results.Ok,
Message => "Remote call failed");
Assert (Condition => Nonce = Mock.Ref_Nonce,
Message => "Nonce incorrect");
Assert (Condition => Mock.Last_Nonce_Id = 23,
Message => "Last nonce id mismatch");
Assert (Condition => Mock.Last_Nonce_Length = 243,
Message => "Last nonce length mismatch");
Receiver.Stop;
Mock.Last_Nonce_Id := Types.Nc_Id_Type'Last;
Mock.Last_Nonce_Length := 16;
exception
when others =>
Receiver.Stop;
Mock.Last_Nonce_Id := Types.Nc_Id_Type'Last;
Mock.Last_Nonce_Length := 16;
raise;
end Client_Server_ORBs;
-------------------------------------------------------------------------
procedure Initialize (T : in out Testcase)
is
begin
T.Set_Name (Name => "ORB tests");
T.Add_Test_Routine
(Routine => Client_Server_ORBs'Access,
Name => "Client/server interaction");
T.Add_Test_Routine
(Routine => C_Test_Client'Access,
Name => "C test client");
end Initialize;
end Tkmrpc_ORB_Tests;
| 35.416216 | 78 | 0.624542 |
50ffb55285fab2ad5bf507a4b17bb3986a277a41 | 11,287 | ads | Ada | src/fonts/geste_fonts-freeserifbolditalic5pt7b.ads | Fabien-Chouteau/GESTE | 5ac814906fdb49d880db60cbb17279cbbb777336 | [
"BSD-3-Clause"
] | 13 | 2018-07-31T12:11:46.000Z | 2021-11-19T14:16:46.000Z | src/fonts/geste_fonts-freeserifbolditalic5pt7b.ads | gregkrsak/GESTE | 5ac814906fdb49d880db60cbb17279cbbb777336 | [
"BSD-3-Clause"
] | 1 | 2018-10-22T21:41:59.000Z | 2018-10-22T21:41:59.000Z | src/fonts/geste_fonts-freeserifbolditalic5pt7b.ads | gregkrsak/GESTE | 5ac814906fdb49d880db60cbb17279cbbb777336 | [
"BSD-3-Clause"
] | 4 | 2020-07-03T10:03:13.000Z | 2022-02-10T03:35:07.000Z | package GESTE_Fonts.FreeSerifBoldItalic5pt7b is
Font : constant Bitmap_Font_Ref;
private
FreeSerifBoldItalic5pt7bBitmaps : aliased constant Font_Bitmap := (
16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#01#, 16#80#, 16#80#, 16#40#,
16#40#, 16#00#, 16#10#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#02#, 16#82#, 16#41#, 16#20#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#02#, 16#81#, 16#41#, 16#E0#,
16#A0#, 16#F0#, 16#50#, 16#28#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#07#, 16#03#, 16#41#, 16#80#, 16#60#, 16#50#, 16#68#, 16#18#,
16#08#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#02#, 16#E3#,
16#60#, 16#DE#, 16#15#, 16#12#, 16#89#, 16#80#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#01#, 16#81#, 16#A0#, 16#E0#, 16#EC#, 16#94#, 16#6C#,
16#1B#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#02#,
16#01#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#02#, 16#02#, 16#01#, 16#01#, 16#00#, 16#80#,
16#40#, 16#20#, 16#10#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#04#,
16#02#, 16#00#, 16#80#, 16#40#, 16#20#, 16#20#, 16#10#, 16#10#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#02#, 16#03#, 16#C0#, 16#80#, 16#F0#,
16#20#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#40#, 16#F8#, 16#10#, 16#08#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#20#, 16#10#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#20#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#01#, 16#01#, 16#00#, 16#80#, 16#80#, 16#40#, 16#20#,
16#20#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#03#,
16#41#, 16#21#, 16#B0#, 16#90#, 16#58#, 16#18#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#01#, 16#03#, 16#80#, 16#C0#, 16#40#, 16#20#,
16#30#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#,
16#02#, 16#C0#, 16#60#, 16#20#, 16#20#, 16#20#, 16#3C#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#C0#, 16#40#, 16#E0#,
16#10#, 16#08#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#80#, 16#C0#, 16#C1#, 16#A0#, 16#F8#, 16#18#, 16#08#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#82#, 16#01#, 16#C0#,
16#20#, 16#10#, 16#08#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#01#, 16#81#, 16#81#, 16#C1#, 16#A0#, 16#D0#, 16#48#, 16#18#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#40#,
16#40#, 16#20#, 16#20#, 16#20#, 16#10#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#03#, 16#02#, 16#41#, 16#A0#, 16#60#, 16#D0#, 16#48#,
16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#02#,
16#41#, 16#20#, 16#B0#, 16#70#, 16#10#, 16#30#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#,
16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#30#, 16#08#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#20#, 16#E0#,
16#C0#, 16#18#, 16#02#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#3E#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#00#,
16#70#, 16#0C#, 16#18#, 16#10#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#07#, 16#00#, 16#C0#, 16#60#, 16#20#, 16#60#, 16#00#, 16#10#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C3#, 16#51#,
16#54#, 16#AA#, 16#55#, 16#3F#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#80#, 16#40#, 16#E0#, 16#50#, 16#7C#, 16#26#,
16#33#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C1#,
16#20#, 16#90#, 16#F0#, 16#6C#, 16#26#, 16#3E#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#01#, 16#E3#, 16#01#, 16#01#, 16#80#, 16#C0#,
16#22#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#,
16#C1#, 16#90#, 16#88#, 16#C4#, 16#66#, 16#26#, 16#3E#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#E1#, 16#10#, 16#80#, 16#F0#,
16#68#, 16#22#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#07#, 16#E1#, 16#20#, 16#80#, 16#F0#, 16#68#, 16#20#, 16#38#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C1#, 16#11#, 16#80#,
16#9C#, 16#C6#, 16#22#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#07#, 16#F1#, 16#10#, 16#88#, 16#FC#, 16#66#, 16#22#, 16#3B#,
16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#01#, 16#80#,
16#80#, 16#C0#, 16#60#, 16#20#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#01#, 16#C0#, 16#C0#, 16#60#, 16#20#, 16#10#, 16#18#,
16#08#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#E1#,
16#A0#, 16#A0#, 16#E0#, 16#78#, 16#26#, 16#3B#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#07#, 16#81#, 16#80#, 16#80#, 16#C0#, 16#60#,
16#22#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#,
16#19#, 16#9D#, 16#54#, 16#AA#, 16#5B#, 16#49#, 16#B5#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#31#, 16#91#, 16#48#, 16#B8#,
16#4C#, 16#46#, 16#32#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#01#, 16#C1#, 16#31#, 16#89#, 16#8C#, 16#C4#, 16#26#, 16#1E#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C1#, 16#20#, 16#90#,
16#F8#, 16#60#, 16#20#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#01#, 16#C1#, 16#31#, 16#88#, 16#8C#, 16#C6#, 16#66#, 16#12#,
16#0E#, 16#40#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C1#, 16#20#,
16#90#, 16#F0#, 16#78#, 16#24#, 16#3B#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#03#, 16#02#, 16#41#, 16#80#, 16#60#, 16#18#, 16#4C#,
16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#E2#,
16#D0#, 16#40#, 16#20#, 16#30#, 16#18#, 16#1C#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#07#, 16#31#, 16#10#, 16#88#, 16#C8#, 16#64#,
16#22#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#,
16#31#, 16#90#, 16#D0#, 16#68#, 16#18#, 16#08#, 16#04#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#69#, 16#34#, 16#DA#, 16#76#,
16#33#, 16#09#, 16#08#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#07#, 16#61#, 16#A0#, 16#60#, 16#20#, 16#38#, 16#24#, 16#37#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#61#, 16#A0#, 16#E0#,
16#30#, 16#10#, 16#18#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#07#, 16#C2#, 16#40#, 16#60#, 16#60#, 16#60#, 16#24#, 16#3E#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#02#, 16#01#,
16#00#, 16#80#, 16#40#, 16#40#, 16#20#, 16#10#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#04#, 16#02#, 16#00#, 16#80#, 16#40#, 16#20#, 16#08#,
16#04#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#01#,
16#00#, 16#80#, 16#40#, 16#40#, 16#20#, 16#10#, 16#08#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#02#, 16#01#, 16#81#, 16#40#, 16#90#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#02#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#E0#, 16#B0#, 16#D0#, 16#48#, 16#3C#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#01#, 16#01#, 16#E0#,
16#90#, 16#58#, 16#28#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#80#, 16#C0#, 16#68#, 16#18#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#40#,
16#E0#, 16#B0#, 16#D0#, 16#48#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#A0#, 16#E0#, 16#68#,
16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#03#, 16#01#,
16#01#, 16#C0#, 16#40#, 16#60#, 16#20#, 16#10#, 16#08#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#A0#, 16#50#,
16#38#, 16#38#, 16#12#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#,
16#01#, 16#01#, 16#E0#, 16#D0#, 16#58#, 16#28#, 16#36#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#02#, 16#00#, 16#01#, 16#00#, 16#80#,
16#40#, 16#30#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#01#, 16#00#, 16#01#, 16#80#, 16#40#, 16#20#, 16#10#, 16#10#, 16#08#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#01#, 16#01#, 16#E0#,
16#A0#, 16#60#, 16#38#, 16#34#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#06#, 16#01#, 16#01#, 16#80#, 16#80#, 16#40#, 16#30#, 16#30#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#,
16#78#, 16#D4#, 16#5A#, 16#2B#, 16#25#, 16#80#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#60#, 16#D0#, 16#58#, 16#68#,
16#26#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#C0#, 16#B0#, 16#D8#, 16#48#, 16#18#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#60#, 16#D0#, 16#58#,
16#68#, 16#38#, 16#10#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#E0#, 16#B0#, 16#D0#, 16#48#, 16#3C#, 16#04#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#40#, 16#C0#,
16#40#, 16#20#, 16#20#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#01#, 16#80#, 16#80#, 16#60#, 16#50#, 16#18#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#01#, 16#80#,
16#80#, 16#40#, 16#70#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#01#, 16#20#, 16#B0#, 16#50#, 16#78#, 16#34#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#,
16#40#, 16#A0#, 16#50#, 16#30#, 16#10#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#50#, 16#A8#, 16#54#, 16#3C#,
16#14#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#01#, 16#60#, 16#C0#, 16#20#, 16#70#, 16#2C#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#40#, 16#A0#, 16#70#,
16#10#, 16#08#, 16#08#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#01#, 16#C0#, 16#40#, 16#40#, 16#40#, 16#30#, 16#06#, 16#00#,
16#00#, 16#00#, 16#00#, 16#02#, 16#02#, 16#01#, 16#00#, 16#80#, 16#80#,
16#80#, 16#20#, 16#10#, 16#10#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#04#, 16#02#, 16#01#, 16#00#, 16#80#, 16#40#, 16#20#, 16#10#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#08#, 16#02#, 16#01#, 16#01#, 16#80#,
16#80#, 16#20#, 16#20#, 16#20#, 16#10#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#60#, 16#0C#, 16#00#,
16#00#, 16#00#);
Font_D : aliased constant Bitmap_Font :=
(
Bytes_Per_Glyph => 14,
Glyph_Width => 9,
Glyph_Height => 12,
Data => FreeSerifBoldItalic5pt7bBitmaps'Access);
Font : constant Bitmap_Font_Ref := Font_D'Access;
end GESTE_Fonts.FreeSerifBoldItalic5pt7b;
| 69.245399 | 73 | 0.495437 |
12db12e9a5be82ac36de9d261c7effe796071f14 | 839 | adb | Ada | gnu/src/gdb/gdb/testsuite/gdb.ada/info_locals_renaming/foo.adb | ghsecuritylab/ellcc-mirror | b03a4afac74d50cf0987554b8c0cd8209bcb92a2 | [
"BSD-2-Clause"
] | null | null | null | gnu/src/gdb/gdb/testsuite/gdb.ada/info_locals_renaming/foo.adb | ghsecuritylab/ellcc-mirror | b03a4afac74d50cf0987554b8c0cd8209bcb92a2 | [
"BSD-2-Clause"
] | null | null | null | gnu/src/gdb/gdb/testsuite/gdb.ada/info_locals_renaming/foo.adb | ghsecuritylab/ellcc-mirror | b03a4afac74d50cf0987554b8c0cd8209bcb92a2 | [
"BSD-2-Clause"
] | null | null | null | -- Copyright 2012-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/>.
with Pck; use Pck;
procedure Foo is
GV : Integer renames Pck.Global_Variable;
begin
Increment (GV); -- STOP
end Foo;
| 36.478261 | 73 | 0.733015 |
1cc84178abb1cf89531ae22577842fb3e4f806f9 | 5,714 | adb | Ada | adahw4/market.adb | jamalakhaligova/ADA | f4ad841052620f998f7d4e7d23b0457aea0a7565 | [
"Apache-2.0"
] | null | null | null | adahw4/market.adb | jamalakhaligova/ADA | f4ad841052620f998f7d4e7d23b0457aea0a7565 | [
"Apache-2.0"
] | null | null | null | adahw4/market.adb | jamalakhaligova/ADA | f4ad841052620f998f7d4e7d23b0457aea0a7565 | [
"Apache-2.0"
] | null | null | null | with Ada.Text_IO,Ada.Numerics.Discrete_Random,Ada.Calendar;
use Ada.Text_IO;
procedure Market is
subtype Index is Positive range 1..10;
package randomPos is new Ada.Numerics.Discrete_Random(Index);
infected_count : Natural := 0;
type Position is record
x: Natural;
y: Natural;
end record;
type Direction is (left,right,up,down);
package randomDir is new Ada.Numerics.Discrete_Random(Direction);
protected Generator is
procedure Init;
function GetRandPos return Position;
function GetRandDir return Direction;
private
k:randomPos.Generator;
l:randomDir.Generator;
end Generator;
protected body Generator is
procedure Init is
begin
randomPos.Reset(k);
randomDir.Reset(l);
end Init;
function GetRandPos return Position is
x:Index;
y:Index;
begin
x:=randomPos.Random(k);
y:=randomPos.Random(k);
return (x,y);
end GetRandPos;
function GetRandDir return Direction is
begin
return randomDir.Random(l);
end GetRandDir;
end Generator;
protected Monitor is
procedure Print(s:String);
end Monitor;
protected body Monitor is
procedure Print(s:String) is
begin
Put_Line(s);
end Print;
end Monitor;
type Barr is array (Natural range <>,Natural range <>) of Boolean;
protected Area is
procedure Init;
function inArea(pos:Position) return Boolean;
procedure infectCell(pos:Position);
function isInfected(pos:Position) return Boolean;
function getInfectedPerc return Natural;
private
a : Barr(1..10,1..10);
end Area;
protected body Area is
procedure Init is
begin
for i in 1..10 loop
for j in 1..10 loop
a(i,j):=False; --no covid at first
end loop;
end loop;
end Init;
procedure infectCell(pos:Position) is
begin
a(pos.x,pos.y):=True;
end infectCell;
function isInfected(pos:Position) return Boolean is
begin
return a(pos.x,pos.y);
end isInfected;
function inArea(pos:Position) return Boolean is
begin
if (pos.x>=1 and then pos.x<=10 and then
pos.y>=1 and then pos.y<=10)
then
return True;
else
return False;
end if;
end inArea;
function getInfectedPerc return Natural is
cnt : Natural:=0;
begin
for i in 1..10 loop
for j in 1..10 loop
if a(i,j) then
cnt:=cnt+1;
end if;
end loop;
end loop;
return cnt;
end getInfectedPerc;
end Area;
type Pstr is access String;
task type Customer(name : Pstr ; is_infected : Boolean);
task Organizer is
entry Create;
end Organizer;
task body Customer is
pos:Position:=Generator.GetRandPos;
movement:Natural:=0;
is_sick : Boolean := is_infected;
procedure move is
tmp:Position;
dir:Direction;
begin
loop
tmp:=pos;
dir:=Generator.GetRandDir;
case dir is
when left => tmp.x:=pos.x-1;
when right => tmp.x:=pos.x+1;
when up => tmp.y:=pos.y-1;
when down => tmp.y:=pos.y+1;
end case;
exit when Area.inArea(tmp);
end loop;
pos:=tmp;
end move;
begin
while movement<4 loop
--if not Organizer'Callable then
-- exit;
--end if;
--Monitor.Print("Current position : " & pos.x'Image & " , "& pos.y'Image);
if is_sick then
Area.infectCell(pos);
--Monitor.Print("One more cell infected");
end if;
if Area.isInfected(pos) then
is_sick := True;
end if;
movement:=movement+1;
delay 0.5;
move;
end loop;
if is_sick then
Monitor.Print(name.all &" named customer has infected");
infected_count := infected_count + 1;
end if;
if Organizer'Callable then
Monitor.Print( name.all &" named customer finished"); -- this means 4 movements so 2 mins done
Organizer.Create;
end if;
end Customer;
type CustomerPtr is access Customer;
task body Organizer is
start : Ada.Calendar.Time;
a,b,c,d,e,tmp: CustomerPtr;
total_customers : Natural := 5;
begin
Generator.Init;
Area.Init;
a:=new Customer(new String'("c1"),True);
b:=new Customer(new String'("c2"),True);
c:=new Customer(new String'("c3"),True);
d:=new Customer(new String'("c4"),True);
e:=new Customer(new String'("c5"),True);
start:=Ada.Calendar.Clock;
loop
if Ada.Calendar."-"( Ada.Calendar.Clock, start ) >=60.0 then
exit;
end if;
select
accept Create do
tmp:=new Customer(new String'("cus "& total_customers'Image),False);
Monitor.Print("Created new customer");
total_customers := total_customers + 1;
end Create;
end select;
end loop;
Monitor.Print("Percentage of territory is infected : " & Area.getInfectedPerc'Image);
--Monitor.Print("Infected customers : " & infected_count'Image);
--Monitor.Print("Total customers : " & total_customers'Image);
Monitor.Print("Out of "& total_customers'Image &" customers, "& infected_count'Image & " got infected.");
--exit;
end Organizer;
begin
-- Insert code here.
null;
end Market;
| 26.331797 | 111 | 0.574904 |
12f1e25dc8bea5e8bdb8e219c216f5e16306c08d | 217 | ada | Ada | Task/Identity-matrix/Ada/identity-matrix-2.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:38.000Z | 2018-11-09T22:08:38.000Z | Task/Identity-matrix/Ada/identity-matrix-2.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/Identity-matrix/Ada/identity-matrix-2.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:40.000Z | 2018-11-09T22:08:40.000Z | type Matrix is array(Positive Range <>, Positive Range <>) of Integer;
mat : Matrix(1..5,1..5) := (others => (others => 0));
-- then after the declarative section:
for i in mat'Range(1) loop mat(i,i) := 1; end loop;
| 43.4 | 70 | 0.645161 |
5030f4f0deb4ea3f3aa2926b73ff4553346bec1f | 584 | ads | Ada | unchecked_deallocation.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 15 | 2018-07-08T07:09:19.000Z | 2021-11-21T09:58:55.000Z | unchecked_deallocation.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 4 | 2019-11-17T20:04:33.000Z | 2021-08-29T21:24:55.000Z | unchecked_deallocation.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 3 | 2020-04-23T11:17:11.000Z | 2021-08-29T19:31:09.000Z | -- Standard Ada library specification
-- Copyright (c) 2003-2018 Maxim Reznik <[email protected]>
-- Copyright (c) 2004-2016 AXE Consultants
-- Copyright (c) 2004, 2005, 2006 Ada-Europe
-- Copyright (c) 2000 The MITRE Corporation, Inc.
-- Copyright (c) 1992, 1993, 1994, 1995 Intermetrics, Inc.
-- SPDX-License-Identifier: BSD-3-Clause and LicenseRef-AdaReferenceManual
---------------------------------------------------------------------------
with Ada.Unchecked_Deallocation;
generic procedure Unchecked_Deallocation renames Ada.Unchecked_Deallocation;
| 44.923077 | 76 | 0.645548 |
a1c4fbc79598e7f212cc406789ce5dfd8b0b32dc | 3,097 | ads | Ada | examples/zmq-examples-json_data.ads | persan/zeromq-Ada | 651ca44cce831c2d717338eab65a60fbfca7ec44 | [
"MIT"
] | 33 | 2015-01-16T13:42:55.000Z | 2021-11-30T21:28:50.000Z | examples/zmq-examples-json_data.ads | persan/zeromq-Ada | 651ca44cce831c2d717338eab65a60fbfca7ec44 | [
"MIT"
] | 6 | 2016-03-23T01:26:36.000Z | 2021-05-13T04:24:53.000Z | examples/zmq-examples-json_data.ads | persan/zeromq-Ada | 651ca44cce831c2d717338eab65a60fbfca7ec44 | [
"MIT"
] | 5 | 2016-03-09T20:20:09.000Z | 2020-06-17T06:59:39.000Z | -------------------------------------------------------------------------------
-- Copyright (C) 2020-2030, [email protected] --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files --
-- (the "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, sublicense, and / or sell copies of the Software, and to --
-- permit persons to whom the Software is furnished to do so, subject to --
-- the following conditions : --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, --
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL --
-- THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR --
-- OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, --
-- ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR --
-- OTHER DEALINGS IN THE SOFTWARE. --
-------------------------------------------------------------------------------
with GNATCOLL.JSON;
with Ada.Strings.Unbounded;
package ZMQ.Examples.JSON_Data is
use Ada.Strings.Unbounded;
use GNATCOLL.JSON;
type Coordinate is record
X, Y, Z : Float;
end record;
type Data_Type is record
Sensor_Name : Unbounded_String;
OK : Boolean := True;
Location : Coordinate := (-1.0, -2.0, -3.0);
Orientation : Coordinate := (-1.2, -2.3, -3.4);
end record;
function Create (Val : Coordinate) return JSON_Value;
function Create (Val : Data_Type) return JSON_Value;
procedure Set_Field
(Val : JSON_Value;
Field_Name : UTF8_String;
Field : Coordinate);
procedure Set_Field
(Val : JSON_Value;
Field_Name : UTF8_String;
Field : Data_Type);
procedure Cb_Coordinate
(User_Object : in out Coordinate;
Name : UTF8_String;
Value : JSON_Value);
procedure Cb_Data_Type
(User_Object : in out Data_Type;
Name : UTF8_String;
Value : JSON_Value);
procedure Read (Src : JSON_Value; Into : in out Data_Type);
procedure Read is new Gen_Map_JSON_Object (Data_Type);
procedure Read is new Gen_Map_JSON_Object (Coordinate);
end ZMQ.Examples.JSON_Data;
| 43.013889 | 79 | 0.536648 |
0b60dd643bfcff900c587049bab7bd6ceccc0391 | 16,662 | ads | Ada | arch/ARM/STM32/svd/stm32l4x5/stm32_svd-i2c.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/stm32l4x5/stm32_svd-i2c.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | arch/ARM/STM32/svd/stm32l4x5/stm32_svd-i2c.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | -- This spec has been automatically generated from STM32L4x5.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.I2C is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype CR1_DNF_Field is HAL.UInt4;
-- Control register 1
type CR1_Register is record
-- Peripheral enable
PE : Boolean := False;
-- TX Interrupt enable
TXIE : Boolean := False;
-- RX Interrupt enable
RXIE : Boolean := False;
-- Address match interrupt enable (slave only)
ADDRIE : Boolean := False;
-- Not acknowledge received interrupt enable
NACKIE : Boolean := False;
-- STOP detection Interrupt enable
STOPIE : Boolean := False;
-- Transfer Complete interrupt enable
TCIE : Boolean := False;
-- Error interrupts enable
ERRIE : Boolean := False;
-- Digital noise filter
DNF : CR1_DNF_Field := 16#0#;
-- Analog noise filter OFF
ANFOFF : Boolean := False;
-- unspecified
Reserved_13_13 : HAL.Bit := 16#0#;
-- DMA transmission requests enable
TXDMAEN : Boolean := False;
-- DMA reception requests enable
RXDMAEN : Boolean := False;
-- Slave byte control
SBC : Boolean := False;
-- Clock stretching disable
NOSTRETCH : Boolean := False;
-- Wakeup from STOP enable
WUPEN : Boolean := False;
-- General call enable
GCEN : Boolean := False;
-- SMBus Host address enable
SMBHEN : Boolean := False;
-- SMBus Device Default address enable
SMBDEN : Boolean := False;
-- SMBUS alert enable
ALERTEN : Boolean := False;
-- PEC enable
PECEN : Boolean := False;
-- unspecified
Reserved_24_31 : HAL.UInt8 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR1_Register use record
PE at 0 range 0 .. 0;
TXIE at 0 range 1 .. 1;
RXIE at 0 range 2 .. 2;
ADDRIE at 0 range 3 .. 3;
NACKIE at 0 range 4 .. 4;
STOPIE at 0 range 5 .. 5;
TCIE at 0 range 6 .. 6;
ERRIE at 0 range 7 .. 7;
DNF at 0 range 8 .. 11;
ANFOFF at 0 range 12 .. 12;
Reserved_13_13 at 0 range 13 .. 13;
TXDMAEN at 0 range 14 .. 14;
RXDMAEN at 0 range 15 .. 15;
SBC at 0 range 16 .. 16;
NOSTRETCH at 0 range 17 .. 17;
WUPEN at 0 range 18 .. 18;
GCEN at 0 range 19 .. 19;
SMBHEN at 0 range 20 .. 20;
SMBDEN at 0 range 21 .. 21;
ALERTEN at 0 range 22 .. 22;
PECEN at 0 range 23 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
subtype CR2_SADD_Field is HAL.UInt10;
subtype CR2_NBYTES_Field is HAL.UInt8;
-- Control register 2
type CR2_Register is record
-- Slave address bit (master mode)
SADD : CR2_SADD_Field := 16#0#;
-- Transfer direction (master mode)
RD_WRN : Boolean := False;
-- 10-bit addressing mode (master mode)
ADD10 : Boolean := False;
-- 10-bit address header only read direction (master receiver mode)
HEAD10R : Boolean := False;
-- Start generation
START : Boolean := False;
-- Stop generation (master mode)
STOP : Boolean := False;
-- NACK generation (slave mode)
NACK : Boolean := False;
-- Number of bytes
NBYTES : CR2_NBYTES_Field := 16#0#;
-- NBYTES reload mode
RELOAD : Boolean := False;
-- Automatic end mode (master mode)
AUTOEND : Boolean := False;
-- Packet error checking byte
PECBYTE : Boolean := False;
-- unspecified
Reserved_27_31 : HAL.UInt5 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR2_Register use record
SADD at 0 range 0 .. 9;
RD_WRN at 0 range 10 .. 10;
ADD10 at 0 range 11 .. 11;
HEAD10R at 0 range 12 .. 12;
START at 0 range 13 .. 13;
STOP at 0 range 14 .. 14;
NACK at 0 range 15 .. 15;
NBYTES at 0 range 16 .. 23;
RELOAD at 0 range 24 .. 24;
AUTOEND at 0 range 25 .. 25;
PECBYTE at 0 range 26 .. 26;
Reserved_27_31 at 0 range 27 .. 31;
end record;
subtype OAR1_OA1_Field is HAL.UInt10;
-- Own address register 1
type OAR1_Register is record
-- Interface address
OA1 : OAR1_OA1_Field := 16#0#;
-- Own Address 1 10-bit mode
OA1MODE : Boolean := False;
-- unspecified
Reserved_11_14 : HAL.UInt4 := 16#0#;
-- Own Address 1 enable
OA1EN : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OAR1_Register use record
OA1 at 0 range 0 .. 9;
OA1MODE at 0 range 10 .. 10;
Reserved_11_14 at 0 range 11 .. 14;
OA1EN at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype OAR2_OA2_Field is HAL.UInt7;
subtype OAR2_OA2MSK_Field is HAL.UInt3;
-- Own address register 2
type OAR2_Register is record
-- unspecified
Reserved_0_0 : HAL.Bit := 16#0#;
-- Interface address
OA2 : OAR2_OA2_Field := 16#0#;
-- Own Address 2 masks
OA2MSK : OAR2_OA2MSK_Field := 16#0#;
-- unspecified
Reserved_11_14 : HAL.UInt4 := 16#0#;
-- Own Address 2 enable
OA2EN : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OAR2_Register use record
Reserved_0_0 at 0 range 0 .. 0;
OA2 at 0 range 1 .. 7;
OA2MSK at 0 range 8 .. 10;
Reserved_11_14 at 0 range 11 .. 14;
OA2EN at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype TIMINGR_SCLL_Field is HAL.UInt8;
subtype TIMINGR_SCLH_Field is HAL.UInt8;
subtype TIMINGR_SDADEL_Field is HAL.UInt4;
subtype TIMINGR_SCLDEL_Field is HAL.UInt4;
subtype TIMINGR_PRESC_Field is HAL.UInt4;
-- Timing register
type TIMINGR_Register is record
-- SCL low period (master mode)
SCLL : TIMINGR_SCLL_Field := 16#0#;
-- SCL high period (master mode)
SCLH : TIMINGR_SCLH_Field := 16#0#;
-- Data hold time
SDADEL : TIMINGR_SDADEL_Field := 16#0#;
-- Data setup time
SCLDEL : TIMINGR_SCLDEL_Field := 16#0#;
-- unspecified
Reserved_24_27 : HAL.UInt4 := 16#0#;
-- Timing prescaler
PRESC : TIMINGR_PRESC_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for TIMINGR_Register use record
SCLL at 0 range 0 .. 7;
SCLH at 0 range 8 .. 15;
SDADEL at 0 range 16 .. 19;
SCLDEL at 0 range 20 .. 23;
Reserved_24_27 at 0 range 24 .. 27;
PRESC at 0 range 28 .. 31;
end record;
subtype TIMEOUTR_TIMEOUTA_Field is HAL.UInt12;
subtype TIMEOUTR_TIMEOUTB_Field is HAL.UInt12;
-- Status register 1
type TIMEOUTR_Register is record
-- Bus timeout A
TIMEOUTA : TIMEOUTR_TIMEOUTA_Field := 16#0#;
-- Idle clock timeout detection
TIDLE : Boolean := False;
-- unspecified
Reserved_13_14 : HAL.UInt2 := 16#0#;
-- Clock timeout enable
TIMOUTEN : Boolean := False;
-- Bus timeout B
TIMEOUTB : TIMEOUTR_TIMEOUTB_Field := 16#0#;
-- unspecified
Reserved_28_30 : HAL.UInt3 := 16#0#;
-- Extended clock timeout enable
TEXTEN : Boolean := False;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for TIMEOUTR_Register use record
TIMEOUTA at 0 range 0 .. 11;
TIDLE at 0 range 12 .. 12;
Reserved_13_14 at 0 range 13 .. 14;
TIMOUTEN at 0 range 15 .. 15;
TIMEOUTB at 0 range 16 .. 27;
Reserved_28_30 at 0 range 28 .. 30;
TEXTEN at 0 range 31 .. 31;
end record;
subtype ISR_ADDCODE_Field is HAL.UInt7;
-- Interrupt and Status register
type ISR_Register is record
-- Transmit data register empty (transmitters)
TXE : Boolean := True;
-- Transmit interrupt status (transmitters)
TXIS : Boolean := False;
-- Read-only. Receive data register not empty (receivers)
RXNE : Boolean := False;
-- Read-only. Address matched (slave mode)
ADDR : Boolean := False;
-- Read-only. Not acknowledge received flag
NACKF : Boolean := False;
-- Read-only. Stop detection flag
STOPF : Boolean := False;
-- Read-only. Transfer Complete (master mode)
TC : Boolean := False;
-- Read-only. Transfer Complete Reload
TCR : Boolean := False;
-- Read-only. Bus error
BERR : Boolean := False;
-- Read-only. Arbitration lost
ARLO : Boolean := False;
-- Read-only. Overrun/Underrun (slave mode)
OVR : Boolean := False;
-- Read-only. PEC Error in reception
PECERR : Boolean := False;
-- Read-only. Timeout or t_low detection flag
TIMEOUT : Boolean := False;
-- Read-only. SMBus alert
ALERT : Boolean := False;
-- unspecified
Reserved_14_14 : HAL.Bit := 16#0#;
-- Read-only. Bus busy
BUSY : Boolean := False;
-- Read-only. Transfer direction (Slave mode)
DIR : Boolean := False;
-- Read-only. Address match code (Slave mode)
ADDCODE : ISR_ADDCODE_Field := 16#0#;
-- unspecified
Reserved_24_31 : HAL.UInt8 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ISR_Register use record
TXE at 0 range 0 .. 0;
TXIS at 0 range 1 .. 1;
RXNE at 0 range 2 .. 2;
ADDR at 0 range 3 .. 3;
NACKF at 0 range 4 .. 4;
STOPF at 0 range 5 .. 5;
TC at 0 range 6 .. 6;
TCR at 0 range 7 .. 7;
BERR at 0 range 8 .. 8;
ARLO at 0 range 9 .. 9;
OVR at 0 range 10 .. 10;
PECERR at 0 range 11 .. 11;
TIMEOUT at 0 range 12 .. 12;
ALERT at 0 range 13 .. 13;
Reserved_14_14 at 0 range 14 .. 14;
BUSY at 0 range 15 .. 15;
DIR at 0 range 16 .. 16;
ADDCODE at 0 range 17 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
-- Interrupt clear register
type ICR_Register is record
-- unspecified
Reserved_0_2 : HAL.UInt3 := 16#0#;
-- Write-only. Address Matched flag clear
ADDRCF : Boolean := False;
-- Write-only. Not Acknowledge flag clear
NACKCF : Boolean := False;
-- Write-only. Stop detection flag clear
STOPCF : Boolean := False;
-- unspecified
Reserved_6_7 : HAL.UInt2 := 16#0#;
-- Write-only. Bus error flag clear
BERRCF : Boolean := False;
-- Write-only. Arbitration lost flag clear
ARLOCF : Boolean := False;
-- Write-only. Overrun/Underrun flag clear
OVRCF : Boolean := False;
-- Write-only. PEC Error flag clear
PECCF : Boolean := False;
-- Write-only. Timeout detection flag clear
TIMOUTCF : Boolean := False;
-- Write-only. Alert flag clear
ALERTCF : Boolean := False;
-- unspecified
Reserved_14_31 : HAL.UInt18 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ICR_Register use record
Reserved_0_2 at 0 range 0 .. 2;
ADDRCF at 0 range 3 .. 3;
NACKCF at 0 range 4 .. 4;
STOPCF at 0 range 5 .. 5;
Reserved_6_7 at 0 range 6 .. 7;
BERRCF at 0 range 8 .. 8;
ARLOCF at 0 range 9 .. 9;
OVRCF at 0 range 10 .. 10;
PECCF at 0 range 11 .. 11;
TIMOUTCF at 0 range 12 .. 12;
ALERTCF at 0 range 13 .. 13;
Reserved_14_31 at 0 range 14 .. 31;
end record;
subtype PECR_PEC_Field is HAL.UInt8;
-- PEC register
type PECR_Register is record
-- Read-only. Packet error checking register
PEC : PECR_PEC_Field;
-- unspecified
Reserved_8_31 : HAL.UInt24;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PECR_Register use record
PEC at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype RXDR_RXDATA_Field is HAL.UInt8;
-- Receive data register
type RXDR_Register is record
-- Read-only. 8-bit receive data
RXDATA : RXDR_RXDATA_Field;
-- unspecified
Reserved_8_31 : HAL.UInt24;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for RXDR_Register use record
RXDATA at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype TXDR_TXDATA_Field is HAL.UInt8;
-- Transmit data register
type TXDR_Register is record
-- 8-bit transmit data
TXDATA : TXDR_TXDATA_Field := 16#0#;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for TXDR_Register use record
TXDATA at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Inter-integrated circuit
type I2C_Peripheral is record
-- Control register 1
CR1 : aliased CR1_Register;
-- Control register 2
CR2 : aliased CR2_Register;
-- Own address register 1
OAR1 : aliased OAR1_Register;
-- Own address register 2
OAR2 : aliased OAR2_Register;
-- Timing register
TIMINGR : aliased TIMINGR_Register;
-- Status register 1
TIMEOUTR : aliased TIMEOUTR_Register;
-- Interrupt and Status register
ISR : aliased ISR_Register;
-- Interrupt clear register
ICR : aliased ICR_Register;
-- PEC register
PECR : aliased PECR_Register;
-- Receive data register
RXDR : aliased RXDR_Register;
-- Transmit data register
TXDR : aliased TXDR_Register;
end record
with Volatile;
for I2C_Peripheral use record
CR1 at 16#0# range 0 .. 31;
CR2 at 16#4# range 0 .. 31;
OAR1 at 16#8# range 0 .. 31;
OAR2 at 16#C# range 0 .. 31;
TIMINGR at 16#10# range 0 .. 31;
TIMEOUTR at 16#14# range 0 .. 31;
ISR at 16#18# range 0 .. 31;
ICR at 16#1C# range 0 .. 31;
PECR at 16#20# range 0 .. 31;
RXDR at 16#24# range 0 .. 31;
TXDR at 16#28# range 0 .. 31;
end record;
-- Inter-integrated circuit
I2C1_Periph : aliased I2C_Peripheral
with Import, Address => System'To_Address (16#40005400#);
-- Inter-integrated circuit
I2C2_Periph : aliased I2C_Peripheral
with Import, Address => System'To_Address (16#40005800#);
-- Inter-integrated circuit
I2C3_Periph : aliased I2C_Peripheral
with Import, Address => System'To_Address (16#40005C00#);
end STM32_SVD.I2C;
| 34.283951 | 74 | 0.549514 |
fb7cba37e0d94506784843512ac857d91ed17b17 | 1,632 | ads | Ada | source/lexer/program-source_buffers.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/lexer/program-source_buffers.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/lexer/program-source_buffers.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | 2 | 2019-09-14T23:18:50.000Z | 2019-10-02T10:11:40.000Z | -- Copyright (c) 2019 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Program.Scanner_States;
package Program.Source_Buffers is
pragma Pure;
type Source_Buffer is limited interface;
-- Source_Buffer provides an access to source text.
type Source_Buffer_Access is access all Source_Buffer'Class
with Storage_Size => 0;
type Span is record
From : Positive;
To : Natural;
end record;
not overriding function Text
(Self : Source_Buffer;
Span : Program.Source_Buffers.Span) return Program.Text is abstract;
-- Return text slice of Span, where Span is positions
-- in the source measured in encoded text element (such as bytes for UTF-8)
subtype Character_Length is Natural range 0 .. 6;
-- Length of one character in encoded text elements
type Character_Info is record
Length : Character_Length;
Class : Program.Scanner_States.Character_Class;
-- Class of character for scanner.
end record;
type Character_Info_Array is array (Positive range <>) of
Character_Info;
not overriding procedure Read
(Self : in out Source_Buffer;
Data : out Character_Info_Array;
Last : out Natural) is abstract;
-- Read next part of source starting from current position and decode
-- corresponding character classes and character lengths.
not overriding procedure Rewind (Self : in out Source_Buffer) is abstract;
-- Set reading position to begin of the buffer
end Program.Source_Buffers;
| 31.384615 | 79 | 0.690564 |
fb83eafa4dfe63eafd29e28950a3ddcec8a08a43 | 1,810 | ads | Ada | .emacs.d/elpa/ada-mode-7.1.4/ada_mode_wisi_lalr_parse.ads | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/ada-mode-7.1.4/ada_mode_wisi_lalr_parse.ads | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/ada-mode-7.1.4/ada_mode_wisi_lalr_parse.ads | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | -- Abstract :
--
-- External process parser for Ada mode
--
-- Copyright (C) 2017 - 2019 Free Software Foundation, Inc.
--
-- This program 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 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
-- distributed with this program; see file COPYING. If not, write to
-- the Free Software Foundation, 51 Franklin Street, Suite 500, Boston,
-- MA 02110-1335, USA.
pragma License (GPL);
with Ada_Process_Actions;
with Ada_Process_LALR_Main;
with Gen_Emacs_Wisi_LR_Parse;
with WisiToken.Parse.LR.McKenzie_Recover.Ada;
with Wisi.Ada;
procedure Ada_Mode_Wisi_LALR_Parse is new Gen_Emacs_Wisi_LR_Parse
(Parse_Data_Type => Wisi.Ada.Parse_Data_Type,
Language_Protocol_Version => Wisi.Ada.Language_Protocol_Version,
Name => "Ada_mode_wisi_lalr_parse",
Descriptor => Ada_Process_Actions.Descriptor,
Partial_Parse_Active => Ada_Process_Actions.Partial_Parse_Active,
Language_Fixes => WisiToken.Parse.LR.McKenzie_Recover.Ada.Language_Fixes'Access,
Language_Matching_Begin_Tokens => WisiToken.Parse.LR.McKenzie_Recover.Ada.Matching_Begin_Tokens'Access,
Language_String_ID_Set => WisiToken.Parse.LR.McKenzie_Recover.Ada.String_ID_Set'Access,
Create_Parser => Ada_Process_LALR_Main.Create_Parser);
| 50.277778 | 106 | 0.735359 |
315ebde61abbbd054dadbb5df535d0ebfdcef58e | 3,087 | adb | Ada | awa/src/awa-commands-stop.adb | stcarrez/ada-awa | 0b153316e3f0462789c5cb255dd60624d73d06f0 | [
"Apache-2.0"
] | 81 | 2015-01-18T23:02:30.000Z | 2022-03-19T17:34:57.000Z | awa/src/awa-commands-stop.adb | jquorning/ada-awa | 1307bbadbbaba34052b3bf1b1707e07c58c98e4c | [
"Apache-2.0"
] | 20 | 2015-12-09T19:26:19.000Z | 2022-03-23T14:32:43.000Z | awa/src/awa-commands-stop.adb | jquorning/ada-awa | 1307bbadbbaba34052b3bf1b1707e07c58c98e4c | [
"Apache-2.0"
] | 16 | 2015-06-29T02:44:06.000Z | 2021-09-23T18:47:50.000Z | -----------------------------------------------------------------------
-- awa-commands-stop -- Command to stop the web server
-- Copyright (C) 2020, 2021 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with GNAT.Sockets;
with Util.Streams.Sockets;
with Util.Streams.Texts;
package body AWA.Commands.Stop is
-- ------------------------------
-- Setup the command before parsing the arguments and executing it.
-- ------------------------------
overriding
procedure Setup (Command : in out Command_Type;
Config : in out GNAT.Command_Line.Command_Line_Configuration;
Context : in out Context_Type) is
begin
GC.Set_Usage (Config => Config,
Usage => Command.Get_Name & " [arguments]",
Help => Command.Get_Description);
GC.Define_Switch (Config => Config,
Output => Command.Management_Port'Access,
Switch => "-m:",
Long_Switch => "--management-port=",
Initial => Command.Management_Port,
Argument => "NUMBER",
Help => -("The server listening management port on localhost"));
AWA.Commands.Setup_Command (Config, Context);
end Setup;
-- ------------------------------
-- Stop the server by sending a 'stop' command on the management socket.
-- ------------------------------
overriding
procedure Execute (Command : in out Command_Type;
Name : in String;
Args : in Argument_List'Class;
Context : in out Context_Type) is
pragma Unreferenced (Name, Args, Context);
Address : GNAT.Sockets.Sock_Addr_Type;
Stream : aliased Util.Streams.Sockets.Socket_Stream;
Writer : Util.Streams.Texts.Print_Stream;
begin
Address.Addr := GNAT.Sockets.Loopback_Inet_Addr;
Address.Port := GNAT.Sockets.Port_Type (Command.Management_Port);
Stream.Connect (Address);
Writer.Initialize (Stream'Unchecked_Access, 1024);
Writer.Write ("stop" & ASCII.CR & ASCII.LF);
Writer.Flush;
Writer.Close;
end Execute;
begin
Command_Drivers.Driver.Add_Command ("stop",
-("stop the web server"),
Command'Access);
end AWA.Commands.Stop;
| 42.875 | 90 | 0.560091 |
062309cc389fac42f7dd03ea0e6293c3a1d57ac4 | 498 | adb | Ada | src/spdx-licenses.adb | Fabien-Chouteau/spdx_ada | 2df9b1182544359c751544e52e14c94830d99fa6 | [
"MIT"
] | null | null | null | src/spdx-licenses.adb | Fabien-Chouteau/spdx_ada | 2df9b1182544359c751544e52e14c94830d99fa6 | [
"MIT"
] | null | null | null | src/spdx-licenses.adb | Fabien-Chouteau/spdx_ada | 2df9b1182544359c751544e52e14c94830d99fa6 | [
"MIT"
] | null | null | null | package body SPDX.Licenses is
--------------
-- Valid_Id --
--------------
function Valid_Id (Str : String) return Boolean is
begin
return (for some I in Id => Str = Img (I));
end Valid_Id;
-------------
-- From_Id --
-------------
function From_Id (Str : String) return Id is
begin
for I in Id loop
if Str = Img (I) then
return I;
end if;
end loop;
raise Program_Error;
end From_Id;
end SPDX.Licenses;
| 18.444444 | 53 | 0.495984 |
a18a2e89e061371d5bd32e11320bb5e8431219fd | 4,444 | ads | Ada | tools/scitools/conf/understand/ada/ada05/s-valllu.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | 1 | 2020-01-20T21:26:46.000Z | 2020-01-20T21:26:46.000Z | tools/scitools/conf/understand/ada/ada05/s-valllu.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada05/s-valllu.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . V A L _ L L U --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2006, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
--
--
--
--
--
--
--
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains routines for scanning modular Long_Long_Unsigned
-- values for use in Text_IO.Modular_IO, and the Value attribute.
with System.Unsigned_Types;
package System.Val_LLU is
pragma Pure;
function Scan_Raw_Long_Long_Unsigned
(Str : String;
Ptr : access Integer;
Max : Integer) return System.Unsigned_Types.Long_Long_Unsigned;
-- This function scans the string starting at Str (Ptr.all) for a valid
-- integer according to the syntax described in (RM 3.5(43)). The substring
-- scanned extends no further than Str (Max). Note: this does not scan
-- leading or trailing blanks, nor leading sign.
--
-- There are three cases for the return:
--
-- If a valid integer is found, then Ptr.all is updated past the last
-- character of the integer.
--
-- If no valid integer is found, then Ptr.all points either to an initial
-- non-digit character, or to Max + 1 if the field is all spaces and the
-- exception Constraint_Error is raised.
--
-- If a syntactically valid integer is scanned, but the value is out of
-- range, or, in the based case, the base value is out of range or there
-- is an out of range digit, then Ptr.all points past the integer, and
-- Constraint_Error is raised.
--
-- Note: these rules correspond to the requirements for leaving the pointer
-- positioned in Text_IO.Get
--
-- Note: if Str is empty, i.e. if Max is less than Ptr, then this is a
-- special case of an all-blank string, and Ptr is unchanged, and hence
-- is greater than Max as required in this case.
function Scan_Long_Long_Unsigned
(Str : String;
Ptr : access Integer;
Max : Integer) return System.Unsigned_Types.Long_Long_Unsigned;
-- Same as Scan_Raw_Long_Long_Unsigned, except scans optional leading
-- blanks, and an optional leading plus sign.
-- Note: if a minus sign is present, Constraint_Error will be raised.
-- Note: trailing blanks are not scanned.
function Value_Long_Long_Unsigned
(Str : String) return System.Unsigned_Types.Long_Long_Unsigned;
-- Used in computing X'Value (Str) where X is a modular integer type whose
-- modulus exceeds the range of System.Unsigned_Types.Unsigned. Str is the
-- string argument of the attribute. Constraint_Error is raised if the
-- string is malformed, or if the value is out of range.
end System.Val_LLU;
| 49.932584 | 79 | 0.552205 |
a19505283139b2483bc1a388162248dcc2c8ebe6 | 3,624 | ads | Ada | source/amf/mofext/amf-internals-tables-mofext_constructors.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/mofext/amf-internals-tables-mofext_constructors.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/mofext/amf-internals-tables-mofext_constructors.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2010-2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
package AMF.Internals.Tables.MOFEXT_Constructors is
function Create_MOF_Tag return AMF.Internals.AMF_Element;
end AMF.Internals.Tables.MOFEXT_Constructors;
| 69.692308 | 78 | 0.404249 |
316c72f1eb58209af007725a59e17886e03f6194 | 996 | adb | Ada | src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/watch_arg/watch.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 31 | 2018-08-01T21:25:24.000Z | 2022-02-14T07:52:34.000Z | src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/watch_arg/watch.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 40 | 2018-12-03T19:48:52.000Z | 2021-03-10T06:34:26.000Z | src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/watch_arg/watch.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 20 | 2018-11-16T21:19:22.000Z | 2021-10-18T23:08:24.000Z | -- Copyright 2006-2016 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with Pck; use Pck;
procedure Watch is
procedure Foo (X : in out Integer) is
begin
-- Reference X in a way that does not change its value.
Do_Nothing (X'Address); -- BREAK1
end Foo;
X : Integer := 1;
begin
Foo (X);
X := 2; -- BREAK2
end Watch;
| 30.181818 | 73 | 0.696787 |
31c350af9f17a07c3507681f375cf122a6ad131a | 9,051 | ads | Ada | source/amf/uml/amf-uml-regions.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-uml-regions.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-uml-regions.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
-- A region is an orthogonal part of either a composite state or a state
-- machine. It contains states and transitions.
------------------------------------------------------------------------------
limited with AMF.UML.Classifiers;
with AMF.UML.Namespaces;
with AMF.UML.Redefinable_Elements;
limited with AMF.UML.State_Machines;
limited with AMF.UML.States;
limited with AMF.UML.Transitions.Collections;
limited with AMF.UML.Vertexs.Collections;
package AMF.UML.Regions is
pragma Preelaborate;
type UML_Region is limited interface
and AMF.UML.Namespaces.UML_Namespace
and AMF.UML.Redefinable_Elements.UML_Redefinable_Element;
type UML_Region_Access is
access all UML_Region'Class;
for UML_Region_Access'Storage_Size use 0;
not overriding function Get_Extended_Region
(Self : not null access constant UML_Region)
return AMF.UML.Regions.UML_Region_Access is abstract;
-- Getter of Region::extendedRegion.
--
-- The region of which this region is an extension.
not overriding procedure Set_Extended_Region
(Self : not null access UML_Region;
To : AMF.UML.Regions.UML_Region_Access) is abstract;
-- Setter of Region::extendedRegion.
--
-- The region of which this region is an extension.
not overriding function Get_Redefinition_Context
(Self : not null access constant UML_Region)
return AMF.UML.Classifiers.UML_Classifier_Access is abstract;
-- Getter of Region::redefinitionContext.
--
-- References the classifier in which context this element may be
-- redefined.
not overriding function Get_State
(Self : not null access constant UML_Region)
return AMF.UML.States.UML_State_Access is abstract;
-- Getter of Region::state.
--
-- The State that owns the Region. If a Region is owned by a State, then
-- it cannot also be owned by a StateMachine.
not overriding procedure Set_State
(Self : not null access UML_Region;
To : AMF.UML.States.UML_State_Access) is abstract;
-- Setter of Region::state.
--
-- The State that owns the Region. If a Region is owned by a State, then
-- it cannot also be owned by a StateMachine.
not overriding function Get_State_Machine
(Self : not null access constant UML_Region)
return AMF.UML.State_Machines.UML_State_Machine_Access is abstract;
-- Getter of Region::stateMachine.
--
-- The StateMachine that owns the Region. If a Region is owned by a
-- StateMachine, then it cannot also be owned by a State.
not overriding procedure Set_State_Machine
(Self : not null access UML_Region;
To : AMF.UML.State_Machines.UML_State_Machine_Access) is abstract;
-- Setter of Region::stateMachine.
--
-- The StateMachine that owns the Region. If a Region is owned by a
-- StateMachine, then it cannot also be owned by a State.
not overriding function Get_Subvertex
(Self : not null access constant UML_Region)
return AMF.UML.Vertexs.Collections.Set_Of_UML_Vertex is abstract;
-- Getter of Region::subvertex.
--
-- The set of vertices that are owned by this region.
not overriding function Get_Transition
(Self : not null access constant UML_Region)
return AMF.UML.Transitions.Collections.Set_Of_UML_Transition is abstract;
-- Getter of Region::transition.
--
-- The set of transitions owned by the region.
not overriding function Belongs_To_PSM
(Self : not null access constant UML_Region)
return Boolean is abstract;
-- Operation Region::belongsToPSM.
--
-- The operation belongsToPSM () checks if the region belongs to a
-- protocol state machine
not overriding function Containing_State_Machine
(Self : not null access constant UML_Region)
return AMF.UML.State_Machines.UML_State_Machine_Access is abstract;
-- Operation Region::containingStateMachine.
--
-- The operation containingStateMachine() returns the sate machine in
-- which this Region is defined
overriding function Is_Consistent_With
(Self : not null access constant UML_Region;
Redefinee : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean is abstract;
-- Operation Region::isConsistentWith.
--
-- The query isConsistentWith() specifies that a redefining region is
-- consistent with a redefined region provided that the redefining region
-- is an extension of the redefined region, i.e. it adds vertices and
-- transitions and it redefines states and transitions of the redefined
-- region.
not overriding function Is_Redefinition_Context_Valid
(Self : not null access constant UML_Region;
Redefined : AMF.UML.Regions.UML_Region_Access)
return Boolean is abstract;
-- Operation Region::isRedefinitionContextValid.
--
-- The query isRedefinitionContextValid() specifies whether the
-- redefinition contexts of a region are properly related to the
-- redefinition contexts of the specified region to allow this element to
-- redefine the other. The containing statemachine/state of a redefining
-- region must redefine the containing statemachine/state of the redefined
-- region.
not overriding function Redefinition_Context
(Self : not null access constant UML_Region)
return AMF.UML.Classifiers.UML_Classifier_Access is abstract;
-- Operation Region::redefinitionContext.
--
-- The redefinition context of a region is the nearest containing
-- statemachine
end AMF.UML.Regions;
| 48.40107 | 80 | 0.591647 |
a15160f066990bd47304e13d4ff7a3c840b22852 | 2,987 | ads | Ada | bb-runtimes/runtimes/zfp-stm32f3x4/gnat/s-memcop.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/zfp-stm32f3x4/gnat/s-memcop.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/zfp-stm32f3x4/gnat/s-memcop.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . M E M O R Y _ C O P Y --
-- --
-- S p e c --
-- --
-- Copyright (C) 2006-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package provides a general block copy mechanisms analogous to that
-- provided by the C routine memcpy allowing for copies without overlap.
with System.Memory_Types;
package System.Memory_Copy is
pragma No_Elaboration_Code_All;
function memcpy
(Dest : Address; Src : Address; N : Memory_Types.size_t) return Address;
pragma Export (C, memcpy, "memcpy");
-- Copies N storage units from area starting at Src to area starting
-- at Dest without any check for buffer overflow. The memory areas
-- must not overlap, or the result of this call is undefined.
end System.Memory_Copy;
| 62.229167 | 78 | 0.389019 |
df713c2a706977ac7f7a2f80110e9e620aba48eb | 580 | ads | Ada | ada-wide_wide_characters.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 15 | 2018-07-08T07:09:19.000Z | 2021-11-21T09:58:55.000Z | ada-wide_wide_characters.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 4 | 2019-11-17T20:04:33.000Z | 2021-08-29T21:24:55.000Z | ada-wide_wide_characters.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 3 | 2020-04-23T11:17:11.000Z | 2021-08-29T19:31:09.000Z | -- Standard Ada library specification
-- Copyright (c) 2003-2018 Maxim Reznik <[email protected]>
-- Copyright (c) 2004-2016 AXE Consultants
-- Copyright (c) 2004, 2005, 2006 Ada-Europe
-- Copyright (c) 2000 The MITRE Corporation, Inc.
-- Copyright (c) 1992, 1993, 1994, 1995 Intermetrics, Inc.
-- SPDX-License-Identifier: BSD-3-Clause and LicenseRef-AdaReferenceManual
---------------------------------------------------------------------------
package Ada.Wide_Wide_Characters is
pragma Pure (Wide_Wide_Characters);
end Ada.Wide_Wide_Characters;
| 38.666667 | 75 | 0.631034 |
125afee280b05738fa1e735347704b62ad41af1d | 2,922 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-busora.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-busora.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-busora.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- G N A T . B U B B L E _ S O R T _ A --
-- --
-- B o d y --
-- --
-- Copyright (C) 1995-2020, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
package body GNAT.Bubble_Sort_A is
----------
-- Sort --
----------
procedure Sort (N : Natural; Move : Move_Procedure; Lt : Lt_Function) is
Switched : Boolean;
begin
loop
Switched := False;
for J in 1 .. N - 1 loop
if Lt (J + 1, J) then
Move (J, 0);
Move (J + 1, J);
Move (0, J + 1);
Switched := True;
end if;
end loop;
exit when not Switched;
end loop;
end Sort;
end GNAT.Bubble_Sort_A;
| 49.525424 | 78 | 0.375086 |
a1658b36cf6419d47f6b00eefa323b30e2a9e105 | 3,083 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/g-sestin.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/ada/g-sestin.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/g-sestin.ads | 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 . S E C O N D A R Y _ S T A C K _ I N F O --
-- --
-- S p e c --
-- --
-- Copyright (C) 2004-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 provides facilities for obtaining information on secondary
-- stack usage.
with System.Secondary_Stack;
package GNAT.Secondary_Stack_Info is
function SS_Get_Max return Long_Long_Integer
renames System.Secondary_Stack.SS_Get_Max;
-- Return maximum used space in storage units for the current secondary
-- stack. For a dynamically allocated secondary stack, the returned
-- result is always -1. For a statically allocated secondary stack,
-- the returned value shows the largest amount of space allocated so
-- far during execution of the program to the current secondary stack,
-- i.e. the secondary stack for the current task.
end GNAT.Secondary_Stack_Info;
| 62.918367 | 78 | 0.455725 |
064fd976558ccaf4f7c6a75ac4ee818ad003e459 | 3,644 | adb | Ada | source/web/fastcgi/matreshka-fastcgi-streaming_server-fcgi_listen_socket__posix.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/web/fastcgi/matreshka-fastcgi-streaming_server-fcgi_listen_socket__posix.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/web/fastcgi/matreshka-fastcgi-streaming_server-fcgi_listen_socket__posix.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 © 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 Ada.Unchecked_Conversion;
separate (Matreshka.FastCGI.Streaming_Server)
function FCGI_Listen_Socket return GNAT.Sockets.Socket_Type is
function To_Socket_Type is
new Ada.Unchecked_Conversion (Integer, GNAT.Sockets.Socket_Type);
begin
return To_Socket_Type (0);
end FCGI_Listen_Socket;
| 66.254545 | 78 | 0.421515 |
0b34da9b50d4671297938f135d41f5e869e21c4d | 1,389 | adb | Ada | day05/tests/day-test.adb | jwarwick/aoc_2020 | b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377 | [
"MIT"
] | 3 | 2020-12-26T23:44:33.000Z | 2021-12-06T16:00:54.000Z | day05/tests/day-test.adb | jwarwick/aoc_2020 | b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377 | [
"MIT"
] | null | null | null | day05/tests/day-test.adb | jwarwick/aoc_2020 | b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377 | [
"MIT"
] | null | null | null | with AUnit.Assertions; use AUnit.Assertions;
with Ada.Containers; use Ada.Containers;
package body Day.Test is
use Boarding_Pass_Vectors;
procedure Test_Part1 (T : in out AUnit.Test_Cases.Test_Case'Class) is
pragma Unreferenced (T);
batch : constant Vector := load_batch("test1.txt");
len : constant Count_Type := length(batch);
highest : constant Natural := highest_id(batch);
begin
Assert(len = 4, "Wrong number of boarding passes, expected 4, got " & Count_Type'IMAGE(len));
Assert(highest = 820, "Wrong highest id, expected 820, got " & Natural'IMAGE(highest));
end Test_Part1;
procedure Test_Part2 (T : in out AUnit.Test_Cases.Test_Case'Class) is
pragma Unreferenced (T);
batch : constant Vector := load_batch("test1.txt");
len : constant Count_Type := length(batch);
begin
Assert(len = 4, "Wrong number of boarding passes, expected 4, got " & Count_Type'IMAGE(len));
end Test_Part2;
function Name (T : Test) return AUnit.Message_String is
pragma Unreferenced (T);
begin
return AUnit.Format ("Test Day package");
end Name;
procedure Register_Tests (T : in out Test) is
use AUnit.Test_Cases.Registration;
begin
Register_Routine (T, Test_Part1'Access, "Test Part 1");
Register_Routine (T, Test_Part2'Access, "Test Part 2");
end Register_Tests;
end Day.Test;
| 35.615385 | 98 | 0.690425 |
12eecf6dd01aa48319677c1966f44d6891258116 | 1,959 | ads | Ada | src/model/grammar/lse-model-grammar-symbol-logoangleminus.ads | mgrojo/lsystem-editor | 1f855bc1f783c8d7a1c81594c8aee403e4b53132 | [
"MIT"
] | 2 | 2021-01-09T14:49:35.000Z | 2022-01-18T18:57:45.000Z | src/model/grammar/lse-model-grammar-symbol-logoangleminus.ads | mgrojo/lsystem-editor | 1f855bc1f783c8d7a1c81594c8aee403e4b53132 | [
"MIT"
] | 1 | 2021-12-03T18:49:59.000Z | 2021-12-03T18:49:59.000Z | src/model/grammar/lse-model-grammar-symbol-logoangleminus.ads | mgrojo/lsystem-editor | 1f855bc1f783c8d7a1c81594c8aee403e4b53132 | [
"MIT"
] | 1 | 2021-12-03T18:07:44.000Z | 2021-12-03T18:07:44.000Z | -------------------------------------------------------------------------------
-- LSE -- L-System Editor
-- Author: Heziode
--
-- License:
-- MIT License
--
-- Copyright (c) 2018 Quentin Dauprat (Heziode) <[email protected]>
--
-- Permission is hereby granted, free of charge, to any person obtaining a
-- copy of this software and associated documentation files (the "Software"),
-- to deal in the Software without restriction, including without limitation
-- the rights to use, copy, modify, merge, publish, distribute, sublicense,
-- and/or sell copies of the Software, and to permit persons to whom the
-- Software is furnished to do so, subject to the following conditions:
--
-- The above copyright notice and this permission notice shall be included in
-- all copies or substantial portions of the Software.
--
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
-- FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
-- DEALINGS IN THE SOFTWARE.
-------------------------------------------------------------------------------
with LSE.Model.IO.Turtle_Utils;
with LSE.Model.Grammar.Symbol;
use LSE.Model.IO.Turtle_Utils;
use LSE.Model.Grammar.Symbol;
-- @description
-- This package provides left rotation LOGO Turtle Symbol.
--
package LSE.Model.Grammar.Symbol.LogoAngleMinus is
type Instance is new LSE.Model.Grammar.Symbol.Instance with null record;
overriding
procedure Initialize (This : out Instance);
overriding
procedure Interpret (This : in out Instance;
T : in out Holder);
end LSE.Model.Grammar.Symbol.LogoAngleMinus;
| 39.18 | 79 | 0.677897 |
4dd695a3b118c93df3f3a85ffb7bfe71a59955ed | 1,177 | ads | Ada | tools/akt.ads | My-Colaborations/ada-keystore | 6ab222c2df81f32309c5a7b4f94a475214ef5ce3 | [
"Apache-2.0"
] | 25 | 2019-05-07T20:35:50.000Z | 2021-11-30T10:35:47.000Z | tools/akt.ads | My-Colaborations/ada-keystore | 6ab222c2df81f32309c5a7b4f94a475214ef5ce3 | [
"Apache-2.0"
] | 12 | 2019-12-16T23:30:00.000Z | 2021-09-26T18:52:41.000Z | tools/akt.ads | My-Colaborations/ada-keystore | 6ab222c2df81f32309c5a7b4f94a475214ef5ce3 | [
"Apache-2.0"
] | 3 | 2019-12-18T21:30:04.000Z | 2021-01-06T08:30:36.000Z | -----------------------------------------------------------------------
-- akt -- Ada Keystore Tool
-- Copyright (C) 2019 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Intl;
package AKT is
function "-" (Message : in String) return String is (Intl."-" (Message));
No_Keystore_File : exception;
private
-- Configure the logs.
procedure Configure_Logs (Debug : in Boolean;
Dump : in Boolean;
Verbose : in Boolean);
end AKT;
| 35.666667 | 76 | 0.590484 |
065a297d7f53469a9959250d1daccb36a8026128 | 3,579 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/get_scos.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/get_scos.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/get_scos.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G E T _ S C O S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2009-2011, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains the function used to read SCO information from an ALI
-- file and populate the tables defined in package SCOs with the result.
generic
-- These subprograms provide access to the ALI file. Locating, opening and
-- providing access to the ALI file is the callers' responsibility.
with function Getc return Character is <>;
-- Get next character, positioning the ALI file ready to read the following
-- character (equivalent to calling Nextc, then Skipc). If the end of file
-- is encountered, the value Types.EOF is returned.
with function Nextc return Character is <>;
-- Look at the next character, and return it, leaving the position of the
-- file unchanged, so that a subsequent call to Getc or Nextc will return
-- this same character. If the file is positioned at the end of file, then
-- Types.EOF is returned.
with procedure Skipc is <>;
-- Skip past the current character (which typically was read with Nextc),
-- and position to the next character, which will be returned by the next
-- call to Getc or Nextc.
procedure Get_SCOs;
-- Load SCO information from ALI file text format into internal SCO tables
-- (SCOs.SCO_Table and SCOs.SCO_Unit_Table). On entry the input file is
-- positioned to the initial 'C' of the first SCO line in the ALI file.
-- On return, the file is positioned either to the end of file, or to the
-- first character of the line following the SCO information (which will
-- never start with a 'C').
--
-- If a format error is detected in the input, then an exception is raised
-- (Ada.IO_Exceptions.Data_Error), with the file positioned to the error.
| 60.661017 | 79 | 0.535904 |
a1b46e48040eda6e03ced2dc97a64b2fcc79cd9f | 78,877 | adb | Ada | Vivado_HLS_Tutorial/Arbitrary_Precision/lab1/window_fn_prj/solution1/.autopilot/db/window_fn_top.adb | williambong/Vivado | 68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb | [
"MIT"
] | null | null | null | Vivado_HLS_Tutorial/Arbitrary_Precision/lab1/window_fn_prj/solution1/.autopilot/db/window_fn_top.adb | williambong/Vivado | 68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb | [
"MIT"
] | null | null | null | Vivado_HLS_Tutorial/Arbitrary_Precision/lab1/window_fn_prj/solution1/.autopilot/db/window_fn_top.adb | williambong/Vivado | 68efafbc44b65c0bb047dbafc0ff7f1b56ee36bb | [
"MIT"
] | null | null | null | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="11">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName/>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>window_fn_top</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>outdata</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>outdata</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>32</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>indata</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>indata</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>32</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>15</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name/>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>129</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab1</first>
<second class_id="11" tracking_level="0" version="0">
<count>2</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>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>129</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>i_i</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
</oprand_edges>
<opcode>phi</opcode>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>exitcond_i</name>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>129</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>129</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>exitcond_i_fu_79_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>34</item>
<item>36</item>
</oprand_edges>
<opcode>icmp</opcode>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>i</name>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>129</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>129</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName>i_fu_85_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>37</item>
<item>39</item>
</oprand_edges>
<opcode>add</opcode>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name/>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>129</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>129</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>40</item>
<item>41</item>
<item>42</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>tmp_i</name>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>131</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>131</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_i_fu_91_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</oprand_edges>
<opcode>zext</opcode>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>coeff_tab1_addr</name>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>131</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>131</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>44</item>
<item>46</item>
<item>47</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>coeff_tab1_load</name>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>131</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>131</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>indata_addr</name>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>131</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>131</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>49</item>
<item>50</item>
<item>51</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>indata_load</name>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>131</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>131</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</oprand_edges>
<opcode>load</opcode>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>tmp_1_i</name>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>131</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>131</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>window_fn_top_fmul_32ns_32ns_32_5_max_dsp_U0</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>53</item>
<item>54</item>
</oprand_edges>
<opcode>fmul</opcode>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>outdata_addr</name>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>131</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>131</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>55</item>
<item>56</item>
<item>57</item>
</oprand_edges>
<opcode>getelementptr</opcode>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name/>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>131</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>131</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>58</item>
<item>59</item>
</oprand_edges>
<opcode>store</opcode>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name/>
<fileName>./window_fn_class.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>129</lineNumber>
<contextFuncName>apply</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab1</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>./window_fn_class.h</first>
<second>apply</second>
</first>
<second>129</second>
</item>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>64</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</oprand_edges>
<opcode>br</opcode>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name/>
<fileName>window_fn_top.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>65</lineNumber>
<contextFuncName>window_fn_top</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>d:/opt/source/Vivado/Vivado_HLS_Tutorial/Arbitrary_Precision/lab1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>window_fn_top.cpp</first>
<second>window_fn_top</second>
</first>
<second>65</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_18">
<Value>
<Obj>
<type>2</type>
<id>29</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_19">
<Value>
<Obj>
<type>2</type>
<id>35</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<const_type>0</const_type>
<content>32</content>
</item>
<item class_id_reference="16" object_id="_20">
<Value>
<Obj>
<type>2</type>
<id>38</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_21">
<Value>
<Obj>
<type>2</type>
<id>45</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_22">
<Obj>
<type>3</type>
<id>8</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_23">
<Obj>
<type>3</type>
<id>14</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>9</item>
<item>10</item>
<item>12</item>
<item>13</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_24">
<Obj>
<type>3</type>
<id>25</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>9</count>
<item_version>0</item_version>
<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>
</node_objs>
</item>
<item class_id_reference="18" object_id="_25">
<Obj>
<type>3</type>
<id>27</id>
<name>apply.exit</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>33</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_26">
<id>28</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_27">
<id>30</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_28">
<id>31</id>
<edge_type>2</edge_type>
<source_obj>8</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_29">
<id>32</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_30">
<id>33</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_31">
<id>34</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_32">
<id>36</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_33">
<id>37</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_34">
<id>39</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_35">
<id>40</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_36">
<id>41</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_37">
<id>42</id>
<edge_type>2</edge_type>
<source_obj>27</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_38">
<id>43</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_39">
<id>44</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_40">
<id>46</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_41">
<id>47</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_42">
<id>48</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_43">
<id>49</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_44">
<id>50</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_45">
<id>51</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_46">
<id>52</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_47">
<id>53</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_48">
<id>54</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_49">
<id>55</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_50">
<id>56</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_51">
<id>57</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_52">
<id>58</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_53">
<id>59</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_54">
<id>60</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_55">
<id>80</id>
<edge_type>2</edge_type>
<source_obj>8</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_56">
<id>81</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_57">
<id>82</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_58">
<id>83</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>14</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="_59">
<mId>1</mId>
<mTag>window_fn_top</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>257</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_60">
<mId>2</mId>
<mTag>Entry</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_61">
<mId>3</mId>
<mTag>winfn_loop</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>14</item>
<item>25</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>32</mMinTripCount>
<mMaxTripCount>32</mMaxTripCount>
<mMinLatency>256</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_62">
<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>27</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_63">
<states class_id="25" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_64">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_65">
<id>4</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_66">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_67">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_68">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_69">
<id>2</id>
<operations>
<count>11</count>
<item_version>0</item_version>
<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>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_76">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_77">
<id>18</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_78">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_79">
<id>20</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_80">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_81">
<id>3</id>
<operations>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_82">
<id>18</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_83">
<id>20</id>
<stage>1</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_84">
<id>4</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_85">
<id>21</id>
<stage>5</stage>
<latency>5</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_86">
<id>5</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_87">
<id>21</id>
<stage>4</stage>
<latency>5</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_88">
<id>6</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_89">
<id>21</id>
<stage>3</stage>
<latency>5</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_90">
<id>7</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_91">
<id>21</id>
<stage>2</stage>
<latency>5</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_92">
<id>8</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_93">
<id>21</id>
<stage>1</stage>
<latency>5</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_94">
<id>9</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_95">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_96">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_97">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_98">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_99">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>14</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="_100">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>15</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item class_id="34" tracking_level="0" version="0">
<first class_id="35" tracking_level="0" version="0">
<first>10</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_101">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>17</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_102">
<inState>4</inState>
<outState>5</outState>
<condition>
<id>18</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_103">
<inState>5</inState>
<outState>6</outState>
<condition>
<id>19</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_104">
<inState>6</inState>
<outState>7</outState>
<condition>
<id>20</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_105">
<inState>7</inState>
<outState>8</outState>
<condition>
<id>21</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_106">
<inState>8</inState>
<outState>9</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="_107">
<inState>9</inState>
<outState>2</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>
</transitions>
</fsm>
<res class_id="36" tracking_level="1" version="0" object_id="_108">
<dp_component_resource class_id="37" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>window_fn_top_fmul_32ns_32ns_32_5_max_dsp_U0 (window_fn_top_fmul_32ns_32ns_32_5_max_dsp)</first>
<second 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>DSP48E</first>
<second>3</second>
</item>
<item>
<first>FF</first>
<second>151</second>
</item>
<item>
<first>LUT</first>
<second>148</second>
</item>
</second>
</item>
</dp_component_resource>
<dp_expression_resource>
<count>2</count>
<item_version>0</item_version>
<item>
<first>exitcond_i_fu_79_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>6</second>
</item>
<item>
<first>(1P1)</first>
<second>7</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>3</second>
</item>
</second>
</item>
<item>
<first>i_fu_85_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>6</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>6</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>1</count>
<item_version>0</item_version>
<item>
<first>coeff_tab1_U</first>
<second>
<count>7</count>
<item_version>0</item_version>
<item>
<first>(0Words)</first>
<second>32</second>
</item>
<item>
<first>(1Bits)</first>
<second>32</second>
</item>
<item>
<first>(2Banks)</first>
<second>1</second>
</item>
<item>
<first>(3W*Bits*Banks)</first>
<second>1024</second>
</item>
<item>
<first>BRAM</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>0</second>
</item>
</second>
</item>
</dp_memory_resource>
<dp_multiplexer_resource>
<count>2</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>10</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>10</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>i_i_reg_64</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>6</second>
</item>
<item>
<first>(2Count)</first>
<second>12</second>
</item>
<item>
<first>LUT</first>
<second>6</second>
</item>
</second>
</item>
</dp_multiplexer_resource>
<dp_register_resource>
<count>7</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>9</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>coeff_tab1_load_reg_120</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>32</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>i_i_reg_64</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>6</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>6</second>
</item>
</second>
</item>
<item>
<first>i_reg_100</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>6</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>6</second>
</item>
</second>
</item>
<item>
<first>indata_load_reg_125</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>32</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>tmp_1_i_reg_130</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>32</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>tmp_i_reg_105</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>64</second>
</item>
<item>
<first>(Consts)</first>
<second>58</second>
</item>
<item>
<first>FF</first>
<second>6</second>
</item>
</second>
</item>
</dp_register_resource>
<dp_component_map class_id="41" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="42" tracking_level="0" version="0">
<first>window_fn_top_fmul_32ns_32ns_32_5_max_dsp_U0 (window_fn_top_fmul_32ns_32ns_32_5_max_dsp)</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>exitcond_i_fu_79_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>i_fu_85_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
</dp_expression_map>
<dp_fifo_map>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_map>
<dp_memory_map>
<count>1</count>
<item_version>0</item_version>
<item>
<first>coeff_tab1_U</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
</dp_memory_map>
</res>
<node_label_latency class_id="43" tracking_level="0" version="0">
<count>15</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="0" version="0">
<first>7</first>
<second class_id="45" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>3</first>
<second>4</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="46" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="47" tracking_level="0" version="0">
<first>8</first>
<second class_id="48" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>1</first>
<second>8</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="49" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="50" tracking_level="0" version="0">
<count>11</count>
<item_version>0</item_version>
<item class_id="51" tracking_level="0" version="0">
<first>28</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>35</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>18</item>
<item>18</item>
</second>
</item>
<item>
<first>40</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>47</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>20</item>
<item>20</item>
</second>
</item>
<item>
<first>52</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>59</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>68</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>75</first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
</second>
</item>
<item>
<first>79</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>85</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>91</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="53" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="54" tracking_level="0" version="0">
<first>coeff_tab1_addr_gep_fu_28</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>exitcond_i_fu_79</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>i_fu_85</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>i_i_phi_fu_68</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>indata_addr_gep_fu_40</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>outdata_addr_gep_fu_52</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>tmp_i_fu_91</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>1</count>
<item_version>0</item_version>
<item>
<first>grp_fu_75</first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
</second>
</item>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="55" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="56" tracking_level="0" version="0">
<first class_id="57" tracking_level="0" version="0">
<first>coeff_tab1</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>18</item>
<item>18</item>
</second>
</item>
<item>
<first>
<first>indata</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>20</item>
<item>20</item>
</second>
</item>
<item>
<first>
<first>outdata</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>8</count>
<item_version>0</item_version>
<item>
<first>64</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>100</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>105</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>110</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>115</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>120</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>125</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>130</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>8</count>
<item_version>0</item_version>
<item>
<first>coeff_tab1_addr_reg_110</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>coeff_tab1_load_reg_120</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>i_i_reg_64</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>i_reg_100</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>indata_addr_reg_115</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>indata_load_reg_125</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>tmp_1_i_reg_130</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>tmp_i_reg_105</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>1</count>
<item_version>0</item_version>
<item>
<first>64</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>i_i_reg_64</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="58" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="59" tracking_level="0" version="0">
<first>indata(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>load</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>20</item>
<item>20</item>
</second>
</item>
</second>
</item>
<item>
<first>outdata(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>store</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="60" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="61" tracking_level="0" version="0">
<first>1</first>
<second>RAM</second>
</item>
<item>
<first>2</first>
<second>RAM</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 30.835418 | 113 | 0.443678 |
31c9d5747cc57495528425ba4a9d9bf0b6f087f8 | 4,171 | ads | Ada | ada-directories.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 15 | 2018-07-08T07:09:19.000Z | 2021-11-21T09:58:55.000Z | ada-directories.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 4 | 2019-11-17T20:04:33.000Z | 2021-08-29T21:24:55.000Z | ada-directories.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 3 | 2020-04-23T11:17:11.000Z | 2021-08-29T19:31:09.000Z | -- Standard Ada library specification
-- Copyright (c) 2003-2018 Maxim Reznik <[email protected]>
-- Copyright (c) 2004-2016 AXE Consultants
-- Copyright (c) 2004, 2005, 2006 Ada-Europe
-- Copyright (c) 2000 The MITRE Corporation, Inc.
-- Copyright (c) 1992, 1993, 1994, 1995 Intermetrics, Inc.
-- SPDX-License-Identifier: BSD-3-Clause and LicenseRef-AdaReferenceManual
---------------------------------------------------------------------------
with Ada.Calendar;
with Ada.IO_Exceptions;
package Ada.Directories is
-- Directory and file operations:
function Current_Directory return String;
procedure Set_Directory (Directory : in String);
procedure Create_Directory (New_Directory : in String;
Form : in String := "");
procedure Delete_Directory (Directory : in String);
procedure Create_Path (New_Directory : in String;
Form : in String := "");
procedure Delete_Tree (Directory : in String);
procedure Delete_File (Name : in String);
procedure Rename (Old_Name : in String;
New_Name : in String);
procedure Copy_File (Source_Name : in String;
Target_Name : in String;
Form : in String := "");
-- File and directory name operations:
function Full_Name (Name : in String) return String;
function Simple_Name (Name : in String) return String;
function Containing_Directory (Name : in String) return String;
function Extension (Name : in String) return String;
function Base_Name (Name : in String) return String;
function Compose (Containing_Directory : in String := "";
Name : in String;
Extension : in String := "")
return String;
type Name_Case_Kind is
(Unknown, Case_Sensitive, Case_Insensitive, Case_Preserving);
function Name_Case_Equivalence (Name : in String) return Name_Case_Kind;
-- File and directory queries:
type File_Kind is (Directory, Ordinary_File, Special_File);
type File_Size is range 0 .. implementation_defined;
function Exists (Name : in String) return Boolean;
function Kind (Name : in String) return File_Kind;
function Size (Name : in String) return File_Size;
function Modification_Time (Name : in String) return Ada.Calendar.Time;
-- Directory searching:
type Directory_Entry_Type is limited private;
type Filter_Type is array (File_Kind) of Boolean;
type Search_Type is limited private;
procedure Start_Search
(Search : in out Search_Type;
Directory : in String;
Pattern : in String;
Filter : in Filter_Type := (others => True));
procedure End_Search (Search : in out Search_Type);
function More_Entries (Search : in Search_Type) return Boolean;
procedure Get_Next_Entry (Search : in out Search_Type;
Directory_Entry : out Directory_Entry_Type);
procedure Search
(Directory : in String;
Pattern : in String;
Filter : in Filter_Type := (others => True);
Process : not null access procedure
(Directory_Entry : in Directory_Entry_Type));
-- Operations on Directory Entries:
function Simple_Name (Directory_Entry : in Directory_Entry_Type)
return String;
function Full_Name (Directory_Entry : in Directory_Entry_Type)
return String;
function Kind (Directory_Entry : in Directory_Entry_Type)
return File_Kind;
function Size (Directory_Entry : in Directory_Entry_Type)
return File_Size;
function Modification_Time (Directory_Entry : in Directory_Entry_Type)
return Ada.Calendar.Time;
Status_Error : exception renames Ada.IO_Exceptions.Status_Error;
Name_Error : exception renames Ada.IO_Exceptions.Name_Error;
Use_Error : exception renames Ada.IO_Exceptions.Use_Error;
Device_Error : exception renames Ada.IO_Exceptions.Device_Error;
private
pragma Import (Ada, Directory_Entry_Type);
pragma Import (Ada, Search_Type);
end Ada.Directories;
| 31.598485 | 76 | 0.660034 |
310f844215a4f1de5c992865e0e4a9c1e9b98759 | 13,924 | ads | Ada | regtests/model/regtests-simple-model.ads | My-Colaborations/ada-ado | cebf1f9b38c0c259c44935e8bca05a5bff12aace | [
"Apache-2.0"
] | null | null | null | regtests/model/regtests-simple-model.ads | My-Colaborations/ada-ado | cebf1f9b38c0c259c44935e8bca05a5bff12aace | [
"Apache-2.0"
] | null | null | null | regtests/model/regtests-simple-model.ads | My-Colaborations/ada-ado | cebf1f9b38c0c259c44935e8bca05a5bff12aace | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- Regtests.Simple.Model -- Regtests.Simple.Model
-----------------------------------------------------------------------
-- File generated by ada-gen DO NOT MODIFY
-- Template used: templates/model/package-spec.xhtml
-- Ada Generator: https://ada-gen.googlecode.com/svn/trunk Revision 1095
-----------------------------------------------------------------------
-- Copyright (C) 2020 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
pragma Warnings (Off);
with ADO.Sessions;
with ADO.Objects;
with ADO.Statements;
with ADO.SQL;
with ADO.Schemas;
with Ada.Containers.Vectors;
with Ada.Strings.Unbounded;
with Util.Beans.Objects;
with Util.Beans.Basic.Lists;
pragma Warnings (On);
package Regtests.Simple.Model is
pragma Style_Checks ("-mr");
type Allocate_Ref is new ADO.Objects.Object_Ref with null record;
type User_Ref is new ADO.Objects.Object_Ref with null record;
-- --------------------
-- Record representing a user
-- --------------------
-- Create an object key for Allocate.
function Allocate_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key;
-- Create an object key for Allocate from a string.
-- Raises Constraint_Error if the string cannot be converted into the object key.
function Allocate_Key (Id : in String) return ADO.Objects.Object_Key;
Null_Allocate : constant Allocate_Ref;
function "=" (Left, Right : Allocate_Ref'Class) return Boolean;
-- Set the user id
procedure Set_Id (Object : in out Allocate_Ref;
Value : in ADO.Identifier);
-- Get the user id
function Get_Id (Object : in Allocate_Ref)
return ADO.Identifier;
-- Get the allocate version.
function Get_Version (Object : in Allocate_Ref)
return Integer;
-- Set the sequence value
procedure Set_Name (Object : in out Allocate_Ref;
Value : in ADO.Nullable_String);
procedure Set_Name (Object : in out Allocate_Ref;
Value : in String);
-- Get the sequence value
function Get_Name (Object : in Allocate_Ref)
return ADO.Nullable_String;
function Get_Name (Object : in Allocate_Ref)
return String;
-- Load the entity identified by 'Id'.
-- Raises the NOT_FOUND exception if it does not exist.
procedure Load (Object : in out Allocate_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier);
-- Load the entity identified by 'Id'.
-- Returns True in <b>Found</b> if the object was found and False if it does not exist.
procedure Load (Object : in out Allocate_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier;
Found : out Boolean);
-- Find and load the entity.
overriding
procedure Find (Object : in out Allocate_Ref;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean);
-- Save the entity. If the entity does not have an identifier, an identifier is allocated
-- and it is inserted in the table. Otherwise, only data fields which have been changed
-- are updated.
overriding
procedure Save (Object : in out Allocate_Ref;
Session : in out ADO.Sessions.Master_Session'Class);
-- Delete the entity.
overriding
procedure Delete (Object : in out Allocate_Ref;
Session : in out ADO.Sessions.Master_Session'Class);
overriding
function Get_Value (From : in Allocate_Ref;
Name : in String) return Util.Beans.Objects.Object;
-- Table definition
ALLOCATE_TABLE : constant ADO.Schemas.Class_Mapping_Access;
-- Internal method to allocate the Object_Record instance
overriding
procedure Allocate (Object : in out Allocate_Ref);
-- Copy of the object.
procedure Copy (Object : in Allocate_Ref;
Into : in out Allocate_Ref);
package Allocate_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => Allocate_Ref,
"=" => "=");
subtype Allocate_Vector is Allocate_Vectors.Vector;
procedure List (Object : in out Allocate_Vector;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class);
-- --------------------
-- Record representing a user
-- --------------------
-- Create an object key for User.
function User_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key;
-- Create an object key for User from a string.
-- Raises Constraint_Error if the string cannot be converted into the object key.
function User_Key (Id : in String) return ADO.Objects.Object_Key;
Null_User : constant User_Ref;
function "=" (Left, Right : User_Ref'Class) return Boolean;
-- Set the user id
procedure Set_Id (Object : in out User_Ref;
Value : in ADO.Identifier);
-- Get the user id
function Get_Id (Object : in User_Ref)
return ADO.Identifier;
-- Get the comment version.
function Get_Version (Object : in User_Ref)
return Integer;
-- Set the sequence value
procedure Set_Value (Object : in out User_Ref;
Value : in ADO.Identifier);
-- Get the sequence value
function Get_Value (Object : in User_Ref)
return ADO.Identifier;
-- Set the user name
procedure Set_Name (Object : in out User_Ref;
Value : in ADO.Nullable_String);
procedure Set_Name (Object : in out User_Ref;
Value : in String);
-- Get the user name
function Get_Name (Object : in User_Ref)
return ADO.Nullable_String;
function Get_Name (Object : in User_Ref)
return String;
-- Set the user name
procedure Set_Select_Name (Object : in out User_Ref;
Value : in ADO.Nullable_String);
procedure Set_Select_Name (Object : in out User_Ref;
Value : in String);
-- Get the user name
function Get_Select_Name (Object : in User_Ref)
return ADO.Nullable_String;
function Get_Select_Name (Object : in User_Ref)
return String;
-- Load the entity identified by 'Id'.
-- Raises the NOT_FOUND exception if it does not exist.
procedure Load (Object : in out User_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier);
-- Load the entity identified by 'Id'.
-- Returns True in <b>Found</b> if the object was found and False if it does not exist.
procedure Load (Object : in out User_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier;
Found : out Boolean);
-- Find and load the entity.
overriding
procedure Find (Object : in out User_Ref;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean);
-- Save the entity. If the entity does not have an identifier, an identifier is allocated
-- and it is inserted in the table. Otherwise, only data fields which have been changed
-- are updated.
overriding
procedure Save (Object : in out User_Ref;
Session : in out ADO.Sessions.Master_Session'Class);
-- Delete the entity.
overriding
procedure Delete (Object : in out User_Ref;
Session : in out ADO.Sessions.Master_Session'Class);
overriding
function Get_Value (From : in User_Ref;
Name : in String) return Util.Beans.Objects.Object;
-- Table definition
USER_TABLE : constant ADO.Schemas.Class_Mapping_Access;
-- Internal method to allocate the Object_Record instance
overriding
procedure Allocate (Object : in out User_Ref);
-- Copy of the object.
procedure Copy (Object : in User_Ref;
Into : in out User_Ref);
package User_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => User_Ref,
"=" => "=");
subtype User_Vector is User_Vectors.Vector;
procedure List (Object : in out User_Vector;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class);
private
ALLOCATE_NAME : aliased constant String := "allocate";
COL_0_1_NAME : aliased constant String := "id";
COL_1_1_NAME : aliased constant String := "version";
COL_2_1_NAME : aliased constant String := "name";
ALLOCATE_DEF : aliased constant ADO.Schemas.Class_Mapping :=
(Count => 3,
Table => ALLOCATE_NAME'Access,
Members => (
1 => COL_0_1_NAME'Access,
2 => COL_1_1_NAME'Access,
3 => COL_2_1_NAME'Access)
);
ALLOCATE_TABLE : constant ADO.Schemas.Class_Mapping_Access
:= ALLOCATE_DEF'Access;
Null_Allocate : constant Allocate_Ref
:= Allocate_Ref'(ADO.Objects.Object_Ref with null record);
type Allocate_Impl is
new ADO.Objects.Object_Record (Key_Type => ADO.Objects.KEY_INTEGER,
Of_Class => ALLOCATE_DEF'Access)
with record
Version : Integer;
Name : ADO.Nullable_String;
end record;
type Allocate_Access is access all Allocate_Impl;
overriding
procedure Destroy (Object : access Allocate_Impl);
overriding
procedure Find (Object : in out Allocate_Impl;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean);
overriding
procedure Load (Object : in out Allocate_Impl;
Session : in out ADO.Sessions.Session'Class);
procedure Load (Object : in out Allocate_Impl;
Stmt : in out ADO.Statements.Query_Statement'Class;
Session : in out ADO.Sessions.Session'Class);
overriding
procedure Save (Object : in out Allocate_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
procedure Create (Object : in out Allocate_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
overriding
procedure Delete (Object : in out Allocate_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
procedure Set_Field (Object : in out Allocate_Ref'Class;
Impl : out Allocate_Access);
USER_NAME : aliased constant String := "test_user";
COL_0_2_NAME : aliased constant String := "id";
COL_1_2_NAME : aliased constant String := "version";
COL_2_2_NAME : aliased constant String := "value";
COL_3_2_NAME : aliased constant String := "name";
COL_4_2_NAME : aliased constant String := "select";
USER_DEF : aliased constant ADO.Schemas.Class_Mapping :=
(Count => 5,
Table => USER_NAME'Access,
Members => (
1 => COL_0_2_NAME'Access,
2 => COL_1_2_NAME'Access,
3 => COL_2_2_NAME'Access,
4 => COL_3_2_NAME'Access,
5 => COL_4_2_NAME'Access)
);
USER_TABLE : constant ADO.Schemas.Class_Mapping_Access
:= USER_DEF'Access;
Null_User : constant User_Ref
:= User_Ref'(ADO.Objects.Object_Ref with null record);
type User_Impl is
new ADO.Objects.Object_Record (Key_Type => ADO.Objects.KEY_INTEGER,
Of_Class => USER_DEF'Access)
with record
Version : Integer;
Value : ADO.Identifier;
Name : ADO.Nullable_String;
Select_Name : ADO.Nullable_String;
end record;
type User_Access is access all User_Impl;
overriding
procedure Destroy (Object : access User_Impl);
overriding
procedure Find (Object : in out User_Impl;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean);
overriding
procedure Load (Object : in out User_Impl;
Session : in out ADO.Sessions.Session'Class);
procedure Load (Object : in out User_Impl;
Stmt : in out ADO.Statements.Query_Statement'Class;
Session : in out ADO.Sessions.Session'Class);
overriding
procedure Save (Object : in out User_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
procedure Create (Object : in out User_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
overriding
procedure Delete (Object : in out User_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
procedure Set_Field (Object : in out User_Ref'Class;
Impl : out User_Access);
end Regtests.Simple.Model;
| 37.329759 | 94 | 0.610457 |
12d7501ef83ef798c5a0cf37a9b3e5a5a7acbb35 | 126,486 | adb | Ada | AES/AES_Solutions/ultra_board/.autopilot/db/aes_main.sched.adb | itzpankajpanwar/VLSI | 64f18489ebeb5f46c4c402809d3e66b2a717e8af | [
"Apache-2.0"
] | null | null | null | AES/AES_Solutions/ultra_board/.autopilot/db/aes_main.sched.adb | itzpankajpanwar/VLSI | 64f18489ebeb5f46c4c402809d3e66b2a717e8af | [
"Apache-2.0"
] | null | null | null | AES/AES_Solutions/ultra_board/.autopilot/db/aes_main.sched.adb | itzpankajpanwar/VLSI | 64f18489ebeb5f46c4c402809d3e66b2a717e8af | [
"Apache-2.0"
] | 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>aes_main</name>
<ret_bitwidth>32</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</ports>
<nodes class_id="3" tracking_level="0" version="0">
<count>35</count>
<item_version>0</item_version>
<item class_id="4" tracking_level="1" version="0" object_id="_1">
<Value class_id="5" tracking_level="0" version="0">
<Obj class_id="6" tracking_level="0" version="0">
<type>0</type>
<id>12</id>
<name>0_write_ln84</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo class_id="7" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="8" tracking_level="0" version="0">
<first>G:\AES</first>
<second class_id="9" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first class_id="11" tracking_level="0" version="0">
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>84</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>49</item>
<item>52</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>9</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_2">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>0_write_ln85</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>85</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</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>54</item>
<item>57</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>10</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>1_write_ln86</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>86</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</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>59</item>
<item>62</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>11</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>1_write_ln87</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</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>64</item>
<item>67</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>12</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>2_write_ln88</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>88</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>88</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>69</item>
<item>72</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>15</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>2_write_ln89</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>89</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>89</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>74</item>
<item>77</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>16</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>3_write_ln90</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>90</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>90</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>79</item>
<item>82</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>17</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>3_write_ln91</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>91</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>91</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>84</item>
<item>87</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>18</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>4_write_ln92</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>92</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>89</item>
<item>92</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>21</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>4_write_ln93</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>93</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>93</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>93</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>0.67</m_delay>
<m_topoIndex>22</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>5_write_ln94</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</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>98</item>
<item>101</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>23</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>5_write_ln95</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>95</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>103</item>
<item>106</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>24</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>6_write_ln96</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>96</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>96</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>108</item>
<item>111</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>27</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>6_write_ln97</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>97</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>97</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>113</item>
<item>116</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>28</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>7_write_ln98</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>98</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</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>118</item>
<item>121</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>29</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>7_write_ln99</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>99</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>99</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>123</item>
<item>126</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>30</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>0_write_ln102</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>102</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>102</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>128</item>
<item>131</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>1_write_ln103</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>103</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>103</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>133</item>
<item>136</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>2_write_ln104</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>104</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>104</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>138</item>
<item>141</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>3_write_ln105</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>105</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>105</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>143</item>
<item>146</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>4_write_ln106</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>106</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>106</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>148</item>
<item>151</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>5_write_ln107</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>107</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>107</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>153</item>
<item>156</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>6_write_ln108</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>108</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>108</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>158</item>
<item>161</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>7</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>7_write_ln109</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>109</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>109</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>163</item>
<item>166</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>8</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>8_write_ln110</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>110</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>110</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>168</item>
<item>171</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>13</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>9_write_ln111</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>111</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>111</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>173</item>
<item>176</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>14</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>10_write_ln112</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>112</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>112</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>177</item>
<item>180</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>19</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>11_write_ln113</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>113</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>181</item>
<item>184</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>20</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>12_write_ln114</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>114</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>114</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>186</item>
<item>189</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>25</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>13_write_ln115</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>115</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</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>191</item>
<item>194</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>26</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>14_write_ln116</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>116</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>116</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>196</item>
<item>199</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>31</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>15_write_ln117</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>117</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>117</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>201</item>
<item>204</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.67</m_delay>
<m_topoIndex>32</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>_ln119</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>119</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>119</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>41</count>
<item_version>0</item_version>
<item>206</item>
<item>207</item>
<item>208</item>
<item>209</item>
<item>217</item>
<item>218</item>
<item>219</item>
<item>220</item>
<item>221</item>
<item>236</item>
<item>237</item>
<item>238</item>
<item>239</item>
<item>240</item>
<item>241</item>
<item>242</item>
<item>243</item>
<item>244</item>
<item>245</item>
<item>246</item>
<item>247</item>
<item>248</item>
<item>249</item>
<item>250</item>
<item>251</item>
<item>252</item>
<item>253</item>
<item>254</item>
<item>255</item>
<item>256</item>
<item>257</item>
<item>258</item>
<item>259</item>
<item>260</item>
<item>261</item>
<item>262</item>
<item>263</item>
<item>264</item>
<item>265</item>
<item>266</item>
<item>267</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>33</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>_ln120</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>120</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>13</count>
<item_version>0</item_version>
<item>211</item>
<item>212</item>
<item>213</item>
<item>214</item>
<item>222</item>
<item>223</item>
<item>224</item>
<item>225</item>
<item>226</item>
<item>227</item>
<item>235</item>
<item>268</item>
<item>269</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>34</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="4" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>_ln121</name>
<fileName>aes/aes.c</fileName>
<fileDirectory>G:\AES</fileDirectory>
<lineNumber>121</lineNumber>
<contextFuncName>aes_main</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>G:\AES</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>aes/aes.c</first>
<second>aes_main</second>
</first>
<second>121</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>216</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>35</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="13" tracking_level="0" version="0">
<count>64</count>
<item_version>0</item_version>
<item class_id="14" tracking_level="1" version="0" object_id="_36">
<Value>
<Obj>
<type>2</type>
<id>48</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>50</content>
</item>
<item class_id_reference="14" object_id="_37">
<Value>
<Obj>
<type>2</type>
<id>50</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>0</content>
</item>
<item class_id_reference="14" object_id="_38">
<Value>
<Obj>
<type>2</type>
<id>53</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>67</content>
</item>
<item class_id_reference="14" object_id="_39">
<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>3</const_type>
<content>0</content>
</item>
<item class_id_reference="14" object_id="_40">
<Value>
<Obj>
<type>2</type>
<id>58</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>246</content>
</item>
<item class_id_reference="14" object_id="_41">
<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>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>1</content>
</item>
<item class_id_reference="14" object_id="_42">
<Value>
<Obj>
<type>2</type>
<id>63</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>168</content>
</item>
<item class_id_reference="14" object_id="_43">
<Value>
<Obj>
<type>2</type>
<id>65</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>1</content>
</item>
<item class_id_reference="14" object_id="_44">
<Value>
<Obj>
<type>2</type>
<id>68</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>136</content>
</item>
<item class_id_reference="14" object_id="_45">
<Value>
<Obj>
<type>2</type>
<id>70</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>2</content>
</item>
<item class_id_reference="14" object_id="_46">
<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>90</content>
</item>
<item class_id_reference="14" object_id="_47">
<Value>
<Obj>
<type>2</type>
<id>75</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>2</content>
</item>
<item class_id_reference="14" object_id="_48">
<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="14" object_id="_49">
<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>3</const_type>
<content>3</content>
</item>
<item class_id_reference="14" object_id="_50">
<Value>
<Obj>
<type>2</type>
<id>83</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>141</content>
</item>
<item class_id_reference="14" object_id="_51">
<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>3</const_type>
<content>3</content>
</item>
<item class_id_reference="14" object_id="_52">
<Value>
<Obj>
<type>2</type>
<id>88</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>49</content>
</item>
<item class_id_reference="14" object_id="_53">
<Value>
<Obj>
<type>2</type>
<id>90</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>4</content>
</item>
<item class_id_reference="14" object_id="_54">
<Value>
<Obj>
<type>2</type>
<id>94</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>4</content>
</item>
<item class_id_reference="14" object_id="_55">
<Value>
<Obj>
<type>2</type>
<id>97</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>152</content>
</item>
<item class_id_reference="14" object_id="_56">
<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>3</const_type>
<content>5</content>
</item>
<item class_id_reference="14" object_id="_57">
<Value>
<Obj>
<type>2</type>
<id>102</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>162</content>
</item>
<item class_id_reference="14" object_id="_58">
<Value>
<Obj>
<type>2</type>
<id>104</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>5</content>
</item>
<item class_id_reference="14" object_id="_59">
<Value>
<Obj>
<type>2</type>
<id>107</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>224</content>
</item>
<item class_id_reference="14" object_id="_60">
<Value>
<Obj>
<type>2</type>
<id>109</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>6</content>
</item>
<item class_id_reference="14" object_id="_61">
<Value>
<Obj>
<type>2</type>
<id>112</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>55</content>
</item>
<item class_id_reference="14" object_id="_62">
<Value>
<Obj>
<type>2</type>
<id>114</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>6</content>
</item>
<item class_id_reference="14" object_id="_63">
<Value>
<Obj>
<type>2</type>
<id>117</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>7</content>
</item>
<item class_id_reference="14" object_id="_64">
<Value>
<Obj>
<type>2</type>
<id>119</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>7</content>
</item>
<item class_id_reference="14" object_id="_65">
<Value>
<Obj>
<type>2</type>
<id>122</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>52</content>
</item>
<item class_id_reference="14" object_id="_66">
<Value>
<Obj>
<type>2</type>
<id>124</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>7</content>
</item>
<item class_id_reference="14" object_id="_67">
<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>43</content>
</item>
<item class_id_reference="14" object_id="_68">
<Value>
<Obj>
<type>2</type>
<id>129</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>0</content>
</item>
<item class_id_reference="14" object_id="_69">
<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>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>126</content>
</item>
<item class_id_reference="14" object_id="_70">
<Value>
<Obj>
<type>2</type>
<id>134</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>1</content>
</item>
<item class_id_reference="14" object_id="_71">
<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>21</content>
</item>
<item class_id_reference="14" object_id="_72">
<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>3</const_type>
<content>2</content>
</item>
<item class_id_reference="14" object_id="_73">
<Value>
<Obj>
<type>2</type>
<id>142</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>22</content>
</item>
<item class_id_reference="14" object_id="_74">
<Value>
<Obj>
<type>2</type>
<id>144</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>3</content>
</item>
<item class_id_reference="14" object_id="_75">
<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>40</content>
</item>
<item class_id_reference="14" object_id="_76">
<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>3</const_type>
<content>4</content>
</item>
<item class_id_reference="14" object_id="_77">
<Value>
<Obj>
<type>2</type>
<id>152</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>174</content>
</item>
<item class_id_reference="14" object_id="_78">
<Value>
<Obj>
<type>2</type>
<id>154</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>5</content>
</item>
<item class_id_reference="14" object_id="_79">
<Value>
<Obj>
<type>2</type>
<id>157</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>210</content>
</item>
<item class_id_reference="14" object_id="_80">
<Value>
<Obj>
<type>2</type>
<id>159</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>6</content>
</item>
<item class_id_reference="14" object_id="_81">
<Value>
<Obj>
<type>2</type>
<id>162</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>166</content>
</item>
<item class_id_reference="14" object_id="_82">
<Value>
<Obj>
<type>2</type>
<id>164</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>7</content>
</item>
<item class_id_reference="14" object_id="_83">
<Value>
<Obj>
<type>2</type>
<id>167</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>171</content>
</item>
<item class_id_reference="14" object_id="_84">
<Value>
<Obj>
<type>2</type>
<id>169</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>8</content>
</item>
<item class_id_reference="14" object_id="_85">
<Value>
<Obj>
<type>2</type>
<id>172</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>247</content>
</item>
<item class_id_reference="14" object_id="_86">
<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>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>9</content>
</item>
<item class_id_reference="14" object_id="_87">
<Value>
<Obj>
<type>2</type>
<id>178</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>10</content>
</item>
<item class_id_reference="14" object_id="_88">
<Value>
<Obj>
<type>2</type>
<id>182</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>11</content>
</item>
<item class_id_reference="14" object_id="_89">
<Value>
<Obj>
<type>2</type>
<id>185</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>9</content>
</item>
<item class_id_reference="14" object_id="_90">
<Value>
<Obj>
<type>2</type>
<id>187</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>12</content>
</item>
<item class_id_reference="14" object_id="_91">
<Value>
<Obj>
<type>2</type>
<id>190</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>207</content>
</item>
<item class_id_reference="14" object_id="_92">
<Value>
<Obj>
<type>2</type>
<id>192</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>13</content>
</item>
<item class_id_reference="14" object_id="_93">
<Value>
<Obj>
<type>2</type>
<id>195</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>79</content>
</item>
<item class_id_reference="14" object_id="_94">
<Value>
<Obj>
<type>2</type>
<id>197</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>14</content>
</item>
<item class_id_reference="14" object_id="_95">
<Value>
<Obj>
<type>2</type>
<id>200</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>60</content>
</item>
<item class_id_reference="14" object_id="_96">
<Value>
<Obj>
<type>2</type>
<id>202</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>3</const_type>
<content>15</content>
</item>
<item class_id_reference="14" object_id="_97">
<Value>
<Obj>
<type>2</type>
<id>205</id>
<name>encrypt</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>
<const_type>6</const_type>
<content><constant:encrypt></content>
</item>
<item class_id_reference="14" object_id="_98">
<Value>
<Obj>
<type>2</type>
<id>210</id>
<name>decrypt</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>
<const_type>6</const_type>
<content><constant:decrypt></content>
</item>
<item class_id_reference="14" object_id="_99">
<Value>
<Obj>
<type>2</type>
<id>215</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
</consts>
<blocks 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="_100">
<Obj>
<type>3</type>
<id>47</id>
<name>aes_main</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>35</count>
<item_version>0</item_version>
<item>12</item>
<item>13</item>
<item>14</item>
<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>
<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>
</node_objs>
</item>
</blocks>
<edges class_id="17" tracking_level="0" version="0">
<count>151</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_101">
<id>49</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_102">
<id>51</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_103">
<id>52</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_104">
<id>54</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_105">
<id>56</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_106">
<id>57</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_107">
<id>59</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_108">
<id>61</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_109">
<id>62</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_110">
<id>64</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_111">
<id>66</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_112">
<id>67</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_113">
<id>69</id>
<edge_type>1</edge_type>
<source_obj>68</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_114">
<id>71</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>70</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_115">
<id>72</id>
<edge_type>1</edge_type>
<source_obj>70</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_116">
<id>74</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_117">
<id>76</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>75</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_118">
<id>77</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_119">
<id>79</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_120">
<id>81</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_121">
<id>82</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_122">
<id>84</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_123">
<id>86</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>85</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_124">
<id>87</id>
<edge_type>1</edge_type>
<source_obj>85</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_125">
<id>89</id>
<edge_type>1</edge_type>
<source_obj>88</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_126">
<id>91</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>90</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_127">
<id>92</id>
<edge_type>1</edge_type>
<source_obj>90</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_128">
<id>93</id>
<edge_type>1</edge_type>
<source_obj>88</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_129">
<id>95</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>94</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_130">
<id>96</id>
<edge_type>1</edge_type>
<source_obj>94</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_131">
<id>98</id>
<edge_type>1</edge_type>
<source_obj>97</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_132">
<id>100</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>99</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_133">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_134">
<id>103</id>
<edge_type>1</edge_type>
<source_obj>102</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_135">
<id>105</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>104</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_136">
<id>106</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_137">
<id>108</id>
<edge_type>1</edge_type>
<source_obj>107</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_138">
<id>110</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>109</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_139">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>109</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_140">
<id>113</id>
<edge_type>1</edge_type>
<source_obj>112</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_141">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>114</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_142">
<id>116</id>
<edge_type>1</edge_type>
<source_obj>114</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_143">
<id>118</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_144">
<id>120</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>119</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_145">
<id>121</id>
<edge_type>1</edge_type>
<source_obj>119</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_146">
<id>123</id>
<edge_type>1</edge_type>
<source_obj>122</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_147">
<id>125</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>124</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_148">
<id>126</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_149">
<id>128</id>
<edge_type>1</edge_type>
<source_obj>127</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_150">
<id>130</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>129</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_151">
<id>131</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_152">
<id>133</id>
<edge_type>1</edge_type>
<source_obj>132</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_153">
<id>135</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>134</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_154">
<id>136</id>
<edge_type>1</edge_type>
<source_obj>134</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_155">
<id>138</id>
<edge_type>1</edge_type>
<source_obj>137</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_156">
<id>140</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>139</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_157">
<id>141</id>
<edge_type>1</edge_type>
<source_obj>139</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_158">
<id>143</id>
<edge_type>1</edge_type>
<source_obj>142</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_159">
<id>145</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>144</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_160">
<id>146</id>
<edge_type>1</edge_type>
<source_obj>144</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_161">
<id>148</id>
<edge_type>1</edge_type>
<source_obj>147</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_162">
<id>150</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>149</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_163">
<id>151</id>
<edge_type>1</edge_type>
<source_obj>149</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_164">
<id>153</id>
<edge_type>1</edge_type>
<source_obj>152</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_165">
<id>155</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>154</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_166">
<id>156</id>
<edge_type>1</edge_type>
<source_obj>154</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_167">
<id>158</id>
<edge_type>1</edge_type>
<source_obj>157</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_168">
<id>160</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>159</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_169">
<id>161</id>
<edge_type>1</edge_type>
<source_obj>159</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_170">
<id>163</id>
<edge_type>1</edge_type>
<source_obj>162</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_171">
<id>165</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>164</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_172">
<id>166</id>
<edge_type>1</edge_type>
<source_obj>164</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_173">
<id>168</id>
<edge_type>1</edge_type>
<source_obj>167</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_174">
<id>170</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>169</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_175">
<id>171</id>
<edge_type>1</edge_type>
<source_obj>169</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_176">
<id>173</id>
<edge_type>1</edge_type>
<source_obj>172</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_177">
<id>175</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>174</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_178">
<id>176</id>
<edge_type>1</edge_type>
<source_obj>174</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_179">
<id>177</id>
<edge_type>1</edge_type>
<source_obj>137</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_180">
<id>179</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>178</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_181">
<id>180</id>
<edge_type>1</edge_type>
<source_obj>178</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_182">
<id>181</id>
<edge_type>1</edge_type>
<source_obj>68</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_183">
<id>183</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>182</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_184">
<id>184</id>
<edge_type>1</edge_type>
<source_obj>182</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_185">
<id>186</id>
<edge_type>1</edge_type>
<source_obj>185</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_186">
<id>188</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>187</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_187">
<id>189</id>
<edge_type>1</edge_type>
<source_obj>187</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_188">
<id>191</id>
<edge_type>1</edge_type>
<source_obj>190</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_189">
<id>193</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>192</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_190">
<id>194</id>
<edge_type>1</edge_type>
<source_obj>192</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_191">
<id>196</id>
<edge_type>1</edge_type>
<source_obj>195</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_192">
<id>198</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>197</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_193">
<id>199</id>
<edge_type>1</edge_type>
<source_obj>197</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_194">
<id>201</id>
<edge_type>1</edge_type>
<source_obj>200</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_195">
<id>203</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>202</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_196">
<id>204</id>
<edge_type>1</edge_type>
<source_obj>202</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_197">
<id>206</id>
<edge_type>1</edge_type>
<source_obj>205</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_198">
<id>207</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_199">
<id>208</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_200">
<id>209</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_201">
<id>211</id>
<edge_type>1</edge_type>
<source_obj>210</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_202">
<id>212</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_203">
<id>213</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_204">
<id>214</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_205">
<id>216</id>
<edge_type>1</edge_type>
<source_obj>215</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_206">
<id>217</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_207">
<id>218</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_208">
<id>219</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_209">
<id>220</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_210">
<id>221</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_211">
<id>222</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_212">
<id>223</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_213">
<id>224</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_214">
<id>225</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_215">
<id>226</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_216">
<id>227</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_217">
<id>235</id>
<edge_type>4</edge_type>
<source_obj>44</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_218">
<id>236</id>
<edge_type>4</edge_type>
<source_obj>43</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_219">
<id>237</id>
<edge_type>4</edge_type>
<source_obj>42</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_220">
<id>238</id>
<edge_type>4</edge_type>
<source_obj>41</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_221">
<id>239</id>
<edge_type>4</edge_type>
<source_obj>40</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_222">
<id>240</id>
<edge_type>4</edge_type>
<source_obj>39</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_223">
<id>241</id>
<edge_type>4</edge_type>
<source_obj>38</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_224">
<id>242</id>
<edge_type>4</edge_type>
<source_obj>37</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_225">
<id>243</id>
<edge_type>4</edge_type>
<source_obj>36</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_226">
<id>244</id>
<edge_type>4</edge_type>
<source_obj>35</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_227">
<id>245</id>
<edge_type>4</edge_type>
<source_obj>34</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_228">
<id>246</id>
<edge_type>4</edge_type>
<source_obj>33</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_229">
<id>247</id>
<edge_type>4</edge_type>
<source_obj>32</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_230">
<id>248</id>
<edge_type>4</edge_type>
<source_obj>31</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_231">
<id>249</id>
<edge_type>4</edge_type>
<source_obj>30</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_232">
<id>250</id>
<edge_type>4</edge_type>
<source_obj>29</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_233">
<id>251</id>
<edge_type>4</edge_type>
<source_obj>28</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_234">
<id>252</id>
<edge_type>4</edge_type>
<source_obj>27</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_235">
<id>253</id>
<edge_type>4</edge_type>
<source_obj>26</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_236">
<id>254</id>
<edge_type>4</edge_type>
<source_obj>25</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_237">
<id>255</id>
<edge_type>4</edge_type>
<source_obj>24</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_238">
<id>256</id>
<edge_type>4</edge_type>
<source_obj>23</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_239">
<id>257</id>
<edge_type>4</edge_type>
<source_obj>22</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_240">
<id>258</id>
<edge_type>4</edge_type>
<source_obj>21</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_241">
<id>259</id>
<edge_type>4</edge_type>
<source_obj>20</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_242">
<id>260</id>
<edge_type>4</edge_type>
<source_obj>19</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_243">
<id>261</id>
<edge_type>4</edge_type>
<source_obj>18</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_244">
<id>262</id>
<edge_type>4</edge_type>
<source_obj>17</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_245">
<id>263</id>
<edge_type>4</edge_type>
<source_obj>16</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_246">
<id>264</id>
<edge_type>4</edge_type>
<source_obj>15</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_247">
<id>265</id>
<edge_type>4</edge_type>
<source_obj>14</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_248">
<id>266</id>
<edge_type>4</edge_type>
<source_obj>13</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_249">
<id>267</id>
<edge_type>4</edge_type>
<source_obj>12</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_250">
<id>268</id>
<edge_type>4</edge_type>
<source_obj>44</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="18" object_id="_251">
<id>269</id>
<edge_type>4</edge_type>
<source_obj>44</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="19" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_252">
<mId>1</mId>
<mTag>aes_main</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>47</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>721</mMinLatency>
<mMaxLatency>721</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="24" tracking_level="0" version="0">
<count>35</count>
<item_version>0</item_version>
<item class_id="25" tracking_level="0" version="0">
<first>12</first>
<second class_id="26" tracking_level="0" version="0">
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>7</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>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>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>3</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>4</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>5</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>8</first>
<second>1</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>10</first>
<second>1</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="27" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="0" version="0">
<first>47</first>
<second class_id="29" tracking_level="0" version="0">
<first>0</first>
<second>11</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="30" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="31" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="32" 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="33" 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="34" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core class_id="35" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 26.752538 | 71 | 0.597916 |
a1002bc923396e936fe1e1d3d13a06cd40f8b5ea | 206 | ads | Ada | ada/src/nymph_logger.ads | martinmoene/NymphRPC | 99974556dddccf4143e214705b4b0f1529127e0c | [
"BSD-3-Clause"
] | 52 | 2018-05-31T16:54:59.000Z | 2022-02-15T20:55:07.000Z | ada/src/nymph_logger.ads | martinmoene/NymphRPC | 99974556dddccf4143e214705b4b0f1529127e0c | [
"BSD-3-Clause"
] | 6 | 2019-11-22T10:58:47.000Z | 2021-08-01T08:05:04.000Z | ada/src/nymph_logger.ads | martinmoene/NymphRPC | 99974556dddccf4143e214705b4b0f1529127e0c | [
"BSD-3-Clause"
] | 10 | 2019-09-11T05:44:12.000Z | 2021-11-21T13:01:40.000Z | -- nymph_logging.ads - Main package for use by NymphRPC clients (Spec).
--
-- 2017/07/01, Maya Posch
-- (c) Nyanko.ws
type LogFunction is not null access procedure (level: in integer, text: in string);
| 20.6 | 83 | 0.703883 |
50a2e8ec2a43c565bc199ab74f3f86c3a8ebd172 | 4,935 | ads | Ada | source/web/spikedog/core/matreshka-servlet_http_responses.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/web/spikedog/core/matreshka-servlet_http_responses.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/web/spikedog/core/matreshka-servlet_http_responses.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 © 2014-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$
------------------------------------------------------------------------------
-- This package provides base tagged type to build server specific HTTP
-- response objects.
------------------------------------------------------------------------------
with Matreshka.Servlet_HTTP_Requests;
with Servlet.HTTP_Responses;
package Matreshka.Servlet_HTTP_Responses is
pragma Preelaborate;
type Abstract_HTTP_Servlet_Response is abstract
limited new Servlet.HTTP_Responses.HTTP_Servlet_Response with private;
type HTTP_Servlet_Response_Access is
access all Abstract_HTTP_Servlet_Response'Class;
procedure Initialize
(Self : in out Abstract_HTTP_Servlet_Response'Class;
Request :
not null Matreshka.Servlet_HTTP_Requests.HTTP_Servlet_Request_Access);
procedure Set_Session_Cookie
(Self : in out Abstract_HTTP_Servlet_Response'Class);
-- Sets HTTP session cookie when necessary.
overriding function Get_Status
(Self : Abstract_HTTP_Servlet_Response)
return Servlet.HTTP_Responses.Status_Code;
-- Gets the current status code of this response.
overriding procedure Set_Status
(Self : in out Abstract_HTTP_Servlet_Response;
Status : Servlet.HTTP_Responses.Status_Code);
-- Sets the status code for this response.
private
type Abstract_HTTP_Servlet_Response is abstract
limited new Servlet.HTTP_Responses.HTTP_Servlet_Response with record
Status : Servlet.HTTP_Responses.Status_Code
:= Servlet.HTTP_Responses.Internal_Server_Error;
Request : Matreshka.Servlet_HTTP_Requests.HTTP_Servlet_Request_Access;
end record;
end Matreshka.Servlet_HTTP_Responses;
| 55.449438 | 78 | 0.502736 |
a1edc1a07aca2fe3dcb77392ac07aaae67f70b32 | 8,608 | adb | Ada | source/vampire-forms-mobile.adb | ytomino/vampire | 2ff6c93af53e55c89cab70fedb63accba83bcd92 | [
"OpenSSL",
"Unlicense"
] | 1 | 2016-12-19T13:25:14.000Z | 2016-12-19T13:25:14.000Z | source/vampire-forms-mobile.adb | ytomino/vampire | 2ff6c93af53e55c89cab70fedb63accba83bcd92 | [
"OpenSSL",
"Unlicense"
] | null | null | null | source/vampire-forms-mobile.adb | ytomino/vampire | 2ff6c93af53e55c89cab70fedb63accba83bcd92 | [
"OpenSSL",
"Unlicense"
] | null | null | null | -- The Village of Vampire by YT, このソースコードはNYSLです
with Ada.Strings.Functions;
with Ada.Environment_Encoding.Names;
with Ada.Environment_Encoding.Encoding_Streams;
package body Vampire.Forms.Mobile is
use type Villages.Village_State;
Encoding : constant Ada.Environment_Encoding.Encoding_Id :=
Ada.Environment_Encoding.Names.Windows_31J;
function Create (Speeches_Per_Page : Tabula.Villages.Speech_Positive_Count)
return Form_Type is
begin
return (
Encoder =>
new Ada.Environment_Encoding.Strings.Encoder'(
Ada.Environment_Encoding.Strings.To (Encoding)),
Decoder =>
new Ada.Environment_Encoding.Strings.Decoder'(
Ada.Environment_Encoding.Strings.From (Encoding)),
Speeches_Per_Page => Speeches_Per_Page);
end Create;
overriding function HTML_Version (Form : Form_Type)
return Web.HTML.HTML_Version is
begin
return Web.HTML.HTML;
end HTML_Version;
overriding function Template_Set (Form : Form_Type) return Template_Set_Type is
begin
return For_Mobile;
end Template_Set;
overriding function Parameters_To_Index_Page (
Form : Form_Type;
User_Id : String;
User_Password : String)
return Web.Query_Strings is
begin
return Parameters : Web.Query_Strings do
Web.Include (Parameters, "b", "k");
if User_Id'Length > 0 then
Web.Include (Parameters, "i", User_Id);
Web.Include (Parameters, "p", User_Password);
end if;
end return;
end Parameters_To_Index_Page;
overriding function Parameters_To_User_Page (
Form : Form_Type;
User_Id : String;
User_Password : String)
return Web.Query_Strings is
begin
return Parameters : Web.Query_Strings do
Web.Include (Parameters, "b", "k");
if User_Id'Length > 0 then
Web.Include (Parameters, "i", User_Id);
Web.Include (Parameters, "p", User_Password);
end if;
Web.Include (Parameters, "u", User_Id);
end return;
end Parameters_To_User_Page;
overriding function Parameters_To_Village_Page (
Form : Form_Type;
Village_Id : Villages.Village_Id;
Day : Integer := -1;
First : Tabula.Villages.Speech_Index'Base := -1;
Last : Tabula.Villages.Speech_Index'Base := -1;
Latest : Tabula.Villages.Speech_Positive_Count'Base := -1;
User_Id : String;
User_Password : String)
return Web.Query_Strings is
begin
return Parameters : Web.Query_Strings do
Web.Include (Parameters, "b", "k");
if User_Id'Length > 0 then
Web.Include (Parameters, "i", User_Id);
Web.Include (Parameters, "p", User_Password);
end if;
Web.Include (Parameters, "v", Village_Id);
if Day >= 0 then
Web.Include (Parameters, "d", Image (Day));
end if;
if First >= 0 and then Last >= 0 then
Web.Include (Parameters, "r", Image (First) & '-' & Image (Last));
elsif Latest >= 0 then
Web.Include (Parameters, "r", Image (Latest));
end if;
end return;
end Parameters_To_Village_Page;
overriding procedure Write_In_HTML (
Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Form : in Form_Type;
Item : in String;
Pre : in Boolean := False)
is
Out_Wrapper : aliased Ada.Environment_Encoding.Encoding_Streams.Out_Type :=
Ada.Environment_Encoding.Encoding_Streams.Open (
Ada.Environment_Encoding.Converter (Form.Encoder.all),
Stream);
begin
Web.HTML.Write_In_HTML (
Ada.Environment_Encoding.Encoding_Streams.Stream (Out_Wrapper),
Web.HTML.HTML,
Item,
Pre);
Ada.Environment_Encoding.Encoding_Streams.Finish (Out_Wrapper);
end Write_In_HTML;
overriding procedure Write_In_Attribute (
Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Form : in Form_Type;
Item : in String)
is
Out_Wrapper : aliased Ada.Environment_Encoding.Encoding_Streams.Out_Type :=
Ada.Environment_Encoding.Encoding_Streams.Open (
Ada.Environment_Encoding.Converter (Form.Encoder.all),
Stream);
begin
Web.HTML.Write_In_Attribute (
Ada.Environment_Encoding.Encoding_Streams.Stream (Out_Wrapper),
Web.HTML.HTML,
Item);
Ada.Environment_Encoding.Encoding_Streams.Finish (Out_Wrapper);
end Write_In_Attribute;
overriding function Paging (Form : Form_Type) return Boolean is
begin
return True;
end Paging;
overriding function Speeches_Per_Page (Form : Form_Type)
return Tabula.Villages.Speech_Positive_Count'Base is
begin
return Form.Speeches_Per_Page;
end Speeches_Per_Page;
overriding function Get_User_Id (
Form : Form_Type;
Query_Strings : Web.Query_Strings;
Cookie : Web.Cookie)
return String is
begin
return Web.Element (Query_Strings, "i");
end Get_User_Id;
overriding function Get_User_Password (
Form : Form_Type;
Query_Strings : Web.Query_Strings;
Cookie : Web.Cookie)
return String is
begin
return Web.Element (Query_Strings, "p");
end Get_User_Password;
overriding procedure Set_User (
Form : in out Form_Type;
Cookie : in out Web.Cookie;
New_User_Id : in String;
New_User_Password : in String) is
begin
null;
end Set_User;
overriding function Is_User_Page (
Form : Form_Type;
Query_Strings : Web.Query_Strings;
Cookie : Web.Cookie)
return Boolean
is
User_Id : constant String := Form.Get_User_Id (Query_Strings, Cookie);
begin
if User_Id'Length = 0 then
return False;
else
return Web.Element (Query_Strings, "u") = User_Id;
end if;
end Is_User_Page;
overriding function Get_Village_Id (
Form : Form_Type;
Query_Strings : Web.Query_Strings)
return Villages.Village_Id
is
S : constant String := Web.Element (Query_Strings, "v");
begin
if S'Length = Villages.Village_Id'Length then
return S;
else
return Villages.Invalid_Village_Id;
end if;
end Get_Village_Id;
overriding function Get_Day (
Form : Form_Type;
Village : Villages.Village_Type'Class;
Query_Strings : Web.Query_Strings)
return Natural
is
S : String renames Web.Element (Query_Strings, "d");
begin
return Natural'Value (S);
exception
when Constraint_Error =>
declare
State : Villages.Village_State;
Today : Natural;
begin
Village.Get_State (State, Today);
if State /= Villages.Closed then
return Today;
else
return 0;
end if;
end;
end Get_Day;
overriding function Get_Range (
Form : Form_Type;
Village : Villages.Village_Type'Class;
Day : Natural;
Now : Ada.Calendar.Time;
Query_Strings : Web.Query_Strings)
return Villages.Speech_Range_Type
is
function First_N (N : Tabula.Villages.Speech_Positive_Count'Base)
return Villages.Speech_Range_Type
is
Speech_Range : Villages.Speech_Range_Type :=
Village.Speech_Range (Day);
begin
return (
First => Speech_Range.First,
Last => Tabula.Villages.Speech_Index'Base'Max (
Speech_Range.First,
Tabula.Villages.Speech_Index'Base'Min (
Speech_Range.Last,
Speech_Range.First + (N - 1))));
end First_N;
function Last_N (N : Tabula.Villages.Speech_Positive_Count'Base)
return Villages.Speech_Range_Type
is
Speech_Range : Villages.Speech_Range_Type :=
Village.Speech_Range (Day);
begin
return (
First => Tabula.Villages.Speech_Index'Base'Max (
Speech_Range.First,
Speech_Range.Last - (N - 1)),
Last => Tabula.Villages.Speech_Index'Base'Max (
Speech_Range.First,
Speech_Range.Last));
end Last_N;
Range_Arg : constant String := Web.Element (Query_Strings, "r");
P : constant Natural :=
Ada.Strings.Functions.Index_Element_Forward (Range_Arg, '-');
begin
if P < Range_Arg'First then
return Last_N (Tabula.Villages.Speech_Index'Value (Range_Arg));
else
return (
First => Tabula.Villages.Speech_Index'Value (
Range_Arg (Range_Arg'First .. P - 1)),
Last => Tabula.Villages.Speech_Index'Value (
Range_Arg (P + 1 .. Range_Arg'Last)));
end if;
exception
when Constraint_Error =>
declare
State : Villages.Village_State;
Today : Natural;
begin
Village.Get_State (State, Today);
if State /= Villages.Closed and then Day = Today then
return Last_N (Form.Speeches_Per_Page);
else
return First_N (Form.Speeches_Per_Page);
end if;
end;
end Get_Range;
overriding function Get_New_Village_Name (
Form : Form_Type;
Inputs : Web.Query_Strings)
return String is
begin
return Trim_Name (
Ada.Environment_Encoding.Strings.Decode (
Form.Decoder.all,
Web.Element (Inputs, "name")));
end Get_New_Village_Name;
overriding function Get_Text (
Form : Form_Type;
Inputs : Web.Query_Strings)
return String is
begin
return Trim_Text (
Ada.Environment_Encoding.Strings.Decode (
Form.Decoder.all,
Web.Element (Inputs, "text")));
end Get_Text;
end Vampire.Forms.Mobile;
| 27.857605 | 80 | 0.724326 |
317c3ee8c179514977b620f7e3687d381bf17867 | 2,507 | ads | Ada | src/sdl-video-surfaces-makers.ads | alire-project/sdlada | 9593807925f5f6651d81514c7f2d163ab3156dc1 | [
"Zlib"
] | null | null | null | src/sdl-video-surfaces-makers.ads | alire-project/sdlada | 9593807925f5f6651d81514c7f2d163ab3156dc1 | [
"Zlib"
] | null | null | null | src/sdl-video-surfaces-makers.ads | alire-project/sdlada | 9593807925f5f6651d81514c7f2d163ab3156dc1 | [
"Zlib"
] | null | null | null | --------------------------------------------------------------------------------------------------------------------
-- Copyright (c) 2013-2018 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.
--------------------------------------------------------------------------------------------------------------------
-- SDL.Video.Surfaces.Makers
--
-- Functions to create surface objects.
--------------------------------------------------------------------------------------------------------------------
package SDL.Video.Surfaces.Makers is
procedure Create (Self : in out Surface;
Size : in SDL.Sizes;
BPP : in Pixel_Depths;
Red_Mask : in Colour_Masks;
Blue_Mask : in Colour_Masks;
Green_Mask : in Colour_Masks;
Alpha_Mask : in Colour_Masks);
-- TODO: This is likely a temporary place for this. It's likely I will add a Streams package.
-- procedure Create (Self : in out Surface; File_Name : in String);
private
function Get_Internal_Surface (Self : in Surface) return Internal_Surface_Pointer with
Export => True,
Convention => Ada;
-- Create a surface from an internal pointer, this pointer will be owned by something else, so we don't delete it.
function Make_Surface_From_Pointer (S : in Internal_Surface_Pointer; Owns : in Boolean := False) return Surface with
Export => True,
Convention => Ada;
-- TODO: SDL_ConvertSurface
-- TODO: SDL_ConvertSurfaceFormat
-- TODO: SDL_CreateRGBSurfaceFrom
end SDL.Video.Surfaces.Makers;
| 48.211538 | 119 | 0.578779 |
1d1ec3cde9d83434557dc855757f951167a93093 | 1,652 | adb | Ada | password.adb | Lucretia/password | 200b37a3f8dd3b02db112f7e16e7c038cd80778f | [
"BSD-3-Clause"
] | null | null | null | password.adb | Lucretia/password | 200b37a3f8dd3b02db112f7e16e7c038cd80778f | [
"BSD-3-Clause"
] | null | null | null | password.adb | Lucretia/password | 200b37a3f8dd3b02db112f7e16e7c038cd80778f | [
"BSD-3-Clause"
] | null | null | null | -- Simple password generator
-- Luke A. Guest
-- 23/01/10
with Ada.Command_Line;
with Ada.Text_IO;
with Ada.Numerics.Discrete_Random;
with Ada.Characters.Latin_1;
procedure Password is
package L1 renames Ada.Characters.Latin_1;
package Random_Char is new Ada.Numerics.Discrete_Random (Character);
Gen : Random_Char.Generator;
begin
if Ada.Command_Line.Argument_Count /= 1 then
Ada.Text_IO.Put_Line (" Usage: password <length>");
Ada.Text_IO.Put_Line (" Creates a random set of characters from the range of [a..zA..Z0..9]");
else
declare
Current : Character := Character'First;
Length : constant Integer := Integer'Value (Ada.Command_Line.Argument (1));
Pass : String (1 .. Length) := (others => L1.Space);
Index : Positive := Positive'First;
begin
Random_Char.Reset (Gen);
while Index /= Length loop
Current := Random_Char.Random (Gen);
if Current in L1.Exclamation .. L1.Solidus
| '0' .. '9'
| L1.Colon .. L1.Commercial_At
| 'A' .. 'Z'
| L1.Left_Square_Bracket .. L1.Low_Line
| L1.LC_A .. L1.Tilde
then
Pass (Index) := Current;
Index := @ + 1; -- New Ada 2020 feature!
end if;
end loop;
Ada.Text_IO.Put_Line ("Password is: " & Pass);
end;
end if;
end Password;
| 33.714286 | 104 | 0.50908 |
310ec996336c50e833a6b007106ef15dc118eef7 | 10,480 | adb | Ada | src/lambda.adb | ebolar/Unbounded | 6c19b6bbb1cb2b5eac7add0a324aaa4876d7b806 | [
"MIT"
] | null | null | null | src/lambda.adb | ebolar/Unbounded | 6c19b6bbb1cb2b5eac7add0a324aaa4876d7b806 | [
"MIT"
] | null | null | null | src/lambda.adb | ebolar/Unbounded | 6c19b6bbb1cb2b5eac7add0a324aaa4876d7b806 | [
"MIT"
] | null | null | null | -- Lambda Calculus interpreter
-- ---------------------------
-- Parses and reduces Lamdba Calculus statements.
--
-- Source:
-- lambda - [This file] definitions and helper functions
-- lambda_REPL - REPL and command line parsers
-- lambda_parser - parse tree generator
-- lambda_reducer - optimises and reduces lambda expressions
--
with Ada.Characters.Handling; use Ada.Characters.Handling;
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Text_IO.Unbounded_IO;
with Ada.Strings; use Ada.Strings;
with Ada.Strings.Fixed; use Ada.Strings.Fixed;
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Ada.Strings.Maps; use Ada.Strings.Maps;
with Ada.Exceptions; use Ada.Exceptions;
with Ada.IO_Exceptions;
with Ada.Containers; use Ada.Containers;
with Ada.Containers.Multiway_Trees;
Package body Lambda is
-- Format all the elements in an instructions tree for printing
-- Public function
function format ( I: Instructions.tree ) return Statement is
Buffer : SU.Unbounded_String := SU.Null_Unbounded_String;
Curs : Instructions.Cursor;
begin
if not Instructions.is_Empty(I)
then
for Curs in Iterate_Children( Container => I, Parent => Root(I) )
loop
SU.Append(Buffer, format_Element(I, Curs));
end loop;
end if;
return SU.To_String(Buffer);
end;
-- Format all the elements in an instructions sub-tree for printing
-- Public function
function format ( I: Instructions.tree; Curs : Instructions.Cursor ) return Statement is
Buffer : SU.Unbounded_String := SU.Null_Unbounded_String;
begin
if not Instructions.is_Empty(I) and then Curs /= Instructions.No_Element
then
SU.Append(Buffer, format_Element(I, Curs));
end if;
return SU.To_String(Buffer);
end;
-- Recursively format all of the instruction elements
-- Private function
function format_Element ( I : Instructions.tree; Curs : Instructions.Cursor ) return SU.Unbounded_String is
Buffer : SU.Unbounded_String := SU.Null_Unbounded_String;
Node : Element_Record := Instructions.Element(Curs);
E : Element_Record;
variables : Boolean;
begin
case Node.Element is
when L_Expression =>
SU.Append(Buffer, '(');
for C in Iterate_Children( Container => I, Parent => Curs )
loop
SU.Append(Buffer, format_Element(I, C));
end loop;
SU.Append(Buffer, ')');
when L_Function =>
SU.Append(Buffer, Node.Name);
variables := True;
for C in Iterate_Children( Container => I, Parent => Curs )
loop
if variables
then
E := Instructions.Element(C);
if E.Element /= L_Variable
then
variables := False;
SU.Append(Buffer, '.');
end if;
end if;
SU.Append(Buffer, format_Element(I, C));
end loop;
when L_Definition =>
-- put Synonym
SU.Append(Buffer, Node.Name);
SU.Append(Buffer, '=');
-- format(Expression)
for C in Iterate_Children( Container => I, Parent => Curs )
loop
SU.Append(Buffer, format_Element(I, C));
end loop;
when L_Variable | L_Synonym =>
SU.Append(Buffer, Node.Name);
when L_Comments =>
declare
First : Element_Record := First_Child_Element(Root(I));
begin
if First.Element /= L_Comments
then
-- add a separator
SU.Append(Buffer, " ");
end if;
SU.Append(Buffer, Node.Name);
SU.Append(Buffer, Node.Comments);
end;
end case;
return Buffer;
end;
-- Log the structure of the instructions tree
procedure Log_Format ( I: Instructions.tree ) is
Curs : Instructions.Cursor;
procedure Log_Format_Element ( I : Instructions.tree; Curs : Instructions.Cursor ) is
Node : Element_Record := Instructions.Element(Curs);
begin
case Node.Element is
when L_Expression | L_Function | L_Definition =>
Log(Log_Format, Indent(Natural(Instructions.Depth(Curs))) &
"[" & Element_Type'Image(Node.Element) &
", " & Node.Name &
", Is_Explicit=" & Boolean'Image(Node.Is_Explicit) &
"]");
for C in Iterate_Children( Container => I, Parent => Curs )
loop
Log_Format_Element(I, C);
end loop;
when L_Variable | L_Synonym =>
Log(Log_Format, Indent(Natural(Instructions.Depth(Curs))) &
"[" & Element_Type'Image(Node.Element) &
", " & Node.Name &
", Is_Explicit=" & Boolean'Image(Node.Is_Explicit) &
"]");
when L_Comments =>
Log(Log_Format, Indent(Natural(Instructions.Depth(Curs))) &
"[" & Element_Type'Image(Node.Element) &
", '" & Node.Name & Ada.Strings.Fixed.Trim(Node.Comments, Right ) & "'" &
", Is_Explicit=" & Boolean'Image(Node.Is_Explicit) &
"]");
end case;
end;
begin
if Trace and Trace_Format and not Instructions.is_Empty(I)
then
for Curs in Iterate_Children( Container => I, Parent => Root(I) )
loop
Log_Format_Element(I, Curs);
end loop;
end if;
end;
-- Add a Synonym to the list
--
-- Nb: Synonyms are stored in alphabetical order
procedure Add_Synonym ( Source: Instructions.Cursor ) is
Node : Element_Record := Instructions.Element(Source);
Before : Instructions.Cursor := No_Element;
Parent : Instructions.Cursor := Root(Synonyms);
SE : Element_Record;
begin
If Node.Element /= L_Definition then
raise Program_Error with "Cannot add " & Element_Type'Image(Node.Element) & " as a synonym";
end if;
if not(Instructions.Is_Empty(Synonyms)) then
-- Search for a Synonym of the same name
for Curs in Iterate_Children( Container => Synonyms, Parent => Root(Synonyms) )
loop
SE := Instructions.Element(Curs);
if SE.Name >= Node.Name then
Before := Curs;
exit;
end if;
end loop;
end if;
Copy_Subtree( Target => Synonyms,
Parent => Parent,
Before => Before,
Source => Source);
if not(Instructions.Is_Empty(Synonyms)) and then SE.Name = Node.Name then
Delete_Subtree( Container => Synonyms, Position => Before );
end if;
end;
-- Remove a Synonym from the list
procedure Remove_Synonym ( S: Statement ) is
SE : Element_Record;
Curs : Instructions.Cursor;
Found : Boolean := FALSE;
begin
Curs := First_Child(Root(Synonyms));
loop
exit when Curs = No_Element;
SE := Instructions.Element(Curs);
if SE.Name = S(S'First)
then
Log("Removing ", Synonyms, Curs);
Delete_Subtree( Container => Synonyms, Position => Curs);
Found := TRUE;
exit;
end if;
Curs := Next_Sibling(Curs);
end loop;
if not Found
then
Put_Line(". Synonym " & S(S'First) & " not found");
end if;
end;
-- List all Synonyms
procedure List_Synonyms is
begin
if not(Instructions.Is_Empty(Synonyms)) then
for Curs in Iterate_Children( Container => Synonyms, Parent => Root(Synonyms) )
loop
Put_Line(format(Synonyms, Curs));
end loop;
else
Put_Line(". empty");
end if;
end;
-- General logging, eg for the REPL
procedure Log(S : String) is
begin
if Trace
then
Put_Line(".. " & S);
end if;
end;
procedure Log(S : String; I : Instructions.Tree ) is
begin
if Trace
then
Put_Line(".. " & S & format(I));
end if;
end;
procedure Log(S : String; I : Instructions.Tree; C : Instructions.Cursor ) is
begin
if Trace
then
Put_Line(".. " & S & format(I, C));
end if;
end;
-- Granular logging
procedure Log(T : Log_Type; S : String) is
begin
if Trace
then
case T is
when Log_Parse =>
if Trace_Parse then
Put_Line("... P-" & S);
end if;
when Log_Reduce =>
if Trace_Reduce then
Put_Line("... R-" & S);
end if;
when Log_Format =>
if Trace_Format then
Put_Line("... F-" & S);
end if;
when others =>
raise program_error with "Unexpected log type " & Log_Type'image(T);
end case;
end if;
end;
procedure Log(T : Log_Type; S : String; I : Instructions.Tree ) is
begin
if Trace
then
case T is
when Log_Parse =>
if Trace_Parse then
Put_Line("... P-" & S & Format(I));
end if;
when Log_Reduce =>
if Trace_Reduce then
Put_Line("... R-" & S & Format(I));
end if;
when Log_Format =>
if Trace_Format then
Put_Line("... F-" & S & Format(I));
end if;
when others =>
raise program_error with "Unexpected log type " & Log_Type'image(T);
end case;
end if;
end;
procedure Log(T : Log_Type; S : String; I : Instructions.Tree; C : Instructions.Cursor ) is
begin
if Trace
then
case T is
when Log_Parse =>
if Trace_Parse then
Put_Line("... P-" & S & Format(I, C));
end if;
when Log_Reduce =>
if Trace_Reduce then
Put_Line("... R-" & S & Format(I, C));
end if;
when Log_Format =>
if Trace_Format then
Put_Line("... F-" & S & Format(I, C));
end if;
when others =>
raise program_error with "Unexpected log type " & Log_Type'image(T);
end case;
end if;
end;
function indent( I : Natural ) return String is
-- should be more than long enough
M : String := Ada.Strings.Fixed.Head("", Max_Statement_Length/2, ' ');
begin
return M(1..I);
end;
end Lambda;
| 29.192201 | 110 | 0.559924 |
06a041ee79b6ca16f634166b1bf35034325e7daf | 28,147 | ads | Ada | arch/ARM/STM32/svd/stm32f46_79x/stm32_svd-rtc.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-rtc.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-rtc.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | -- This spec has been automatically generated from STM32F46_79x.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.RTC is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype TR_SU_Field is HAL.UInt4;
subtype TR_ST_Field is HAL.UInt3;
subtype TR_MNU_Field is HAL.UInt4;
subtype TR_MNT_Field is HAL.UInt3;
subtype TR_HU_Field is HAL.UInt4;
subtype TR_HT_Field is HAL.UInt2;
-- time register
type TR_Register is record
-- Second units in BCD format
SU : TR_SU_Field := 16#0#;
-- Second tens in BCD format
ST : TR_ST_Field := 16#0#;
-- unspecified
Reserved_7_7 : HAL.Bit := 16#0#;
-- Minute units in BCD format
MNU : TR_MNU_Field := 16#0#;
-- Minute tens in BCD format
MNT : TR_MNT_Field := 16#0#;
-- unspecified
Reserved_15_15 : HAL.Bit := 16#0#;
-- Hour units in BCD format
HU : TR_HU_Field := 16#0#;
-- Hour tens in BCD format
HT : TR_HT_Field := 16#0#;
-- AM/PM notation
PM : Boolean := False;
-- unspecified
Reserved_23_31 : HAL.UInt9 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for TR_Register use record
SU at 0 range 0 .. 3;
ST at 0 range 4 .. 6;
Reserved_7_7 at 0 range 7 .. 7;
MNU at 0 range 8 .. 11;
MNT at 0 range 12 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
HU at 0 range 16 .. 19;
HT at 0 range 20 .. 21;
PM at 0 range 22 .. 22;
Reserved_23_31 at 0 range 23 .. 31;
end record;
subtype DR_DU_Field is HAL.UInt4;
subtype DR_DT_Field is HAL.UInt2;
subtype DR_MU_Field is HAL.UInt4;
subtype DR_WDU_Field is HAL.UInt3;
subtype DR_YU_Field is HAL.UInt4;
subtype DR_YT_Field is HAL.UInt4;
-- date register
type DR_Register is record
-- Date units in BCD format
DU : DR_DU_Field := 16#1#;
-- Date tens in BCD format
DT : DR_DT_Field := 16#0#;
-- unspecified
Reserved_6_7 : HAL.UInt2 := 16#0#;
-- Month units in BCD format
MU : DR_MU_Field := 16#1#;
-- Month tens in BCD format
MT : Boolean := False;
-- Week day units
WDU : DR_WDU_Field := 16#1#;
-- Year units in BCD format
YU : DR_YU_Field := 16#0#;
-- Year tens in BCD format
YT : DR_YT_Field := 16#0#;
-- unspecified
Reserved_24_31 : HAL.UInt8 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DR_Register use record
DU at 0 range 0 .. 3;
DT at 0 range 4 .. 5;
Reserved_6_7 at 0 range 6 .. 7;
MU at 0 range 8 .. 11;
MT at 0 range 12 .. 12;
WDU at 0 range 13 .. 15;
YU at 0 range 16 .. 19;
YT at 0 range 20 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
subtype CR_WCKSEL_Field is HAL.UInt3;
subtype CR_OSEL_Field is HAL.UInt2;
-- control register
type CR_Register is record
-- Wakeup clock selection
WCKSEL : CR_WCKSEL_Field := 16#0#;
-- Time-stamp event active edge
TSEDGE : Boolean := False;
-- Reference clock detection enable (50 or 60 Hz)
REFCKON : Boolean := False;
-- unspecified
Reserved_5_5 : HAL.Bit := 16#0#;
-- Hour format
FMT : Boolean := False;
-- Coarse digital calibration enable
DCE : Boolean := False;
-- Alarm A enable
ALRAE : Boolean := False;
-- Alarm B enable
ALRBE : Boolean := False;
-- Wakeup timer enable
WUTE : Boolean := False;
-- Time stamp enable
TSE : Boolean := False;
-- Alarm A interrupt enable
ALRAIE : Boolean := False;
-- Alarm B interrupt enable
ALRBIE : Boolean := False;
-- Wakeup timer interrupt enable
WUTIE : Boolean := False;
-- Time-stamp interrupt enable
TSIE : Boolean := False;
-- Add 1 hour (summer time change)
ADD1H : Boolean := False;
-- Subtract 1 hour (winter time change)
SUB1H : Boolean := False;
-- Backup
BKP : Boolean := False;
-- unspecified
Reserved_19_19 : HAL.Bit := 16#0#;
-- Output polarity
POL : Boolean := False;
-- Output selection
OSEL : CR_OSEL_Field := 16#0#;
-- Calibration output enable
COE : Boolean := False;
-- unspecified
Reserved_24_31 : HAL.UInt8 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR_Register use record
WCKSEL at 0 range 0 .. 2;
TSEDGE at 0 range 3 .. 3;
REFCKON at 0 range 4 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
FMT at 0 range 6 .. 6;
DCE at 0 range 7 .. 7;
ALRAE at 0 range 8 .. 8;
ALRBE at 0 range 9 .. 9;
WUTE at 0 range 10 .. 10;
TSE at 0 range 11 .. 11;
ALRAIE at 0 range 12 .. 12;
ALRBIE at 0 range 13 .. 13;
WUTIE at 0 range 14 .. 14;
TSIE at 0 range 15 .. 15;
ADD1H at 0 range 16 .. 16;
SUB1H at 0 range 17 .. 17;
BKP at 0 range 18 .. 18;
Reserved_19_19 at 0 range 19 .. 19;
POL at 0 range 20 .. 20;
OSEL at 0 range 21 .. 22;
COE at 0 range 23 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
-- initialization and status register
type ISR_Register is record
-- Read-only. Alarm A write flag
ALRAWF : Boolean := True;
-- Read-only. Alarm B write flag
ALRBWF : Boolean := True;
-- Read-only. Wakeup timer write flag
WUTWF : Boolean := True;
-- Shift operation pending
SHPF : Boolean := False;
-- Read-only. Initialization status flag
INITS : Boolean := False;
-- Registers synchronization flag
RSF : Boolean := False;
-- Read-only. Initialization flag
INITF : Boolean := False;
-- Initialization mode
INIT : Boolean := False;
-- Alarm A flag
ALRAF : Boolean := False;
-- Alarm B flag
ALRBF : Boolean := False;
-- Wakeup timer flag
WUTF : Boolean := False;
-- Time-stamp flag
TSF : Boolean := False;
-- Time-stamp overflow flag
TSOVF : Boolean := False;
-- Tamper detection flag
TAMP1F : Boolean := False;
-- TAMPER2 detection flag
TAMP2F : Boolean := False;
-- unspecified
Reserved_15_15 : HAL.Bit := 16#0#;
-- Read-only. Recalibration pending Flag
RECALPF : Boolean := False;
-- unspecified
Reserved_17_31 : HAL.UInt15 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ISR_Register use record
ALRAWF at 0 range 0 .. 0;
ALRBWF at 0 range 1 .. 1;
WUTWF at 0 range 2 .. 2;
SHPF at 0 range 3 .. 3;
INITS at 0 range 4 .. 4;
RSF at 0 range 5 .. 5;
INITF at 0 range 6 .. 6;
INIT at 0 range 7 .. 7;
ALRAF at 0 range 8 .. 8;
ALRBF at 0 range 9 .. 9;
WUTF at 0 range 10 .. 10;
TSF at 0 range 11 .. 11;
TSOVF at 0 range 12 .. 12;
TAMP1F at 0 range 13 .. 13;
TAMP2F at 0 range 14 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
RECALPF at 0 range 16 .. 16;
Reserved_17_31 at 0 range 17 .. 31;
end record;
subtype PRER_PREDIV_S_Field is HAL.UInt15;
subtype PRER_PREDIV_A_Field is HAL.UInt7;
-- prescaler register
type PRER_Register is record
-- Synchronous prescaler factor
PREDIV_S : PRER_PREDIV_S_Field := 16#FF#;
-- unspecified
Reserved_15_15 : HAL.Bit := 16#0#;
-- Asynchronous prescaler factor
PREDIV_A : PRER_PREDIV_A_Field := 16#7F#;
-- unspecified
Reserved_23_31 : HAL.UInt9 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PRER_Register use record
PREDIV_S at 0 range 0 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
PREDIV_A at 0 range 16 .. 22;
Reserved_23_31 at 0 range 23 .. 31;
end record;
subtype WUTR_WUT_Field is HAL.UInt16;
-- wakeup timer register
type WUTR_Register is record
-- Wakeup auto-reload value bits
WUT : WUTR_WUT_Field := 16#FFFF#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for WUTR_Register use record
WUT at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CALIBR_DC_Field is HAL.UInt5;
-- calibration register
type CALIBR_Register is record
-- Digital calibration
DC : CALIBR_DC_Field := 16#0#;
-- unspecified
Reserved_5_6 : HAL.UInt2 := 16#0#;
-- Digital calibration sign
DCS : Boolean := False;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CALIBR_Register use record
DC at 0 range 0 .. 4;
Reserved_5_6 at 0 range 5 .. 6;
DCS at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype ALRMAR_SU_Field is HAL.UInt4;
subtype ALRMAR_ST_Field is HAL.UInt3;
subtype ALRMAR_MNU_Field is HAL.UInt4;
subtype ALRMAR_MNT_Field is HAL.UInt3;
subtype ALRMAR_HU_Field is HAL.UInt4;
subtype ALRMAR_HT_Field is HAL.UInt2;
subtype ALRMAR_DU_Field is HAL.UInt4;
subtype ALRMAR_DT_Field is HAL.UInt2;
-- alarm A register
type ALRMAR_Register is record
-- Second units in BCD format
SU : ALRMAR_SU_Field := 16#0#;
-- Second tens in BCD format
ST : ALRMAR_ST_Field := 16#0#;
-- Alarm A seconds mask
MSK1 : Boolean := False;
-- Minute units in BCD format
MNU : ALRMAR_MNU_Field := 16#0#;
-- Minute tens in BCD format
MNT : ALRMAR_MNT_Field := 16#0#;
-- Alarm A minutes mask
MSK2 : Boolean := False;
-- Hour units in BCD format
HU : ALRMAR_HU_Field := 16#0#;
-- Hour tens in BCD format
HT : ALRMAR_HT_Field := 16#0#;
-- AM/PM notation
PM : Boolean := False;
-- Alarm A hours mask
MSK3 : Boolean := False;
-- Date units or day in BCD format
DU : ALRMAR_DU_Field := 16#0#;
-- Date tens in BCD format
DT : ALRMAR_DT_Field := 16#0#;
-- Week day selection
WDSEL : Boolean := False;
-- Alarm A date mask
MSK4 : Boolean := False;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ALRMAR_Register use record
SU at 0 range 0 .. 3;
ST at 0 range 4 .. 6;
MSK1 at 0 range 7 .. 7;
MNU at 0 range 8 .. 11;
MNT at 0 range 12 .. 14;
MSK2 at 0 range 15 .. 15;
HU at 0 range 16 .. 19;
HT at 0 range 20 .. 21;
PM at 0 range 22 .. 22;
MSK3 at 0 range 23 .. 23;
DU at 0 range 24 .. 27;
DT at 0 range 28 .. 29;
WDSEL at 0 range 30 .. 30;
MSK4 at 0 range 31 .. 31;
end record;
subtype ALRMBR_SU_Field is HAL.UInt4;
subtype ALRMBR_ST_Field is HAL.UInt3;
subtype ALRMBR_MNU_Field is HAL.UInt4;
subtype ALRMBR_MNT_Field is HAL.UInt3;
subtype ALRMBR_HU_Field is HAL.UInt4;
subtype ALRMBR_HT_Field is HAL.UInt2;
subtype ALRMBR_DU_Field is HAL.UInt4;
subtype ALRMBR_DT_Field is HAL.UInt2;
-- alarm B register
type ALRMBR_Register is record
-- Second units in BCD format
SU : ALRMBR_SU_Field := 16#0#;
-- Second tens in BCD format
ST : ALRMBR_ST_Field := 16#0#;
-- Alarm B seconds mask
MSK1 : Boolean := False;
-- Minute units in BCD format
MNU : ALRMBR_MNU_Field := 16#0#;
-- Minute tens in BCD format
MNT : ALRMBR_MNT_Field := 16#0#;
-- Alarm B minutes mask
MSK2 : Boolean := False;
-- Hour units in BCD format
HU : ALRMBR_HU_Field := 16#0#;
-- Hour tens in BCD format
HT : ALRMBR_HT_Field := 16#0#;
-- AM/PM notation
PM : Boolean := False;
-- Alarm B hours mask
MSK3 : Boolean := False;
-- Date units or day in BCD format
DU : ALRMBR_DU_Field := 16#0#;
-- Date tens in BCD format
DT : ALRMBR_DT_Field := 16#0#;
-- Week day selection
WDSEL : Boolean := False;
-- Alarm B date mask
MSK4 : Boolean := False;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ALRMBR_Register use record
SU at 0 range 0 .. 3;
ST at 0 range 4 .. 6;
MSK1 at 0 range 7 .. 7;
MNU at 0 range 8 .. 11;
MNT at 0 range 12 .. 14;
MSK2 at 0 range 15 .. 15;
HU at 0 range 16 .. 19;
HT at 0 range 20 .. 21;
PM at 0 range 22 .. 22;
MSK3 at 0 range 23 .. 23;
DU at 0 range 24 .. 27;
DT at 0 range 28 .. 29;
WDSEL at 0 range 30 .. 30;
MSK4 at 0 range 31 .. 31;
end record;
subtype WPR_KEY_Field is HAL.UInt8;
-- write protection register
type WPR_Register is record
-- Write-only. Write protection key
KEY : WPR_KEY_Field := 16#0#;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for WPR_Register use record
KEY at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype SSR_SS_Field is HAL.UInt16;
-- sub second register
type SSR_Register is record
-- Read-only. Sub second value
SS : SSR_SS_Field;
-- unspecified
Reserved_16_31 : HAL.UInt16;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SSR_Register use record
SS at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype SHIFTR_SUBFS_Field is HAL.UInt15;
-- shift control register
type SHIFTR_Register is record
-- Write-only. Subtract a fraction of a second
SUBFS : SHIFTR_SUBFS_Field := 16#0#;
-- unspecified
Reserved_15_30 : HAL.UInt16 := 16#0#;
-- Write-only. Add one second
ADD1S : Boolean := False;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SHIFTR_Register use record
SUBFS at 0 range 0 .. 14;
Reserved_15_30 at 0 range 15 .. 30;
ADD1S at 0 range 31 .. 31;
end record;
-- time stamp time register
type TSTR_Register is record
-- Read-only. Tamper 1 detection enable
TAMP1E : Boolean;
-- Read-only. Active level for tamper 1
TAMP1TRG : Boolean;
-- Read-only. Tamper interrupt enable
TAMPIE : Boolean;
-- unspecified
Reserved_3_15 : HAL.UInt13;
-- Read-only. TAMPER1 mapping
TAMP1INSEL : Boolean;
-- Read-only. TIMESTAMP mapping
TSINSEL : Boolean;
-- Read-only. AFO_ALARM output type
ALARMOUTTYPE : Boolean;
-- unspecified
Reserved_19_31 : HAL.UInt13;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for TSTR_Register use record
TAMP1E at 0 range 0 .. 0;
TAMP1TRG at 0 range 1 .. 1;
TAMPIE at 0 range 2 .. 2;
Reserved_3_15 at 0 range 3 .. 15;
TAMP1INSEL at 0 range 16 .. 16;
TSINSEL at 0 range 17 .. 17;
ALARMOUTTYPE at 0 range 18 .. 18;
Reserved_19_31 at 0 range 19 .. 31;
end record;
subtype TSDR_DU_Field is HAL.UInt4;
subtype TSDR_DT_Field is HAL.UInt2;
subtype TSDR_MU_Field is HAL.UInt4;
subtype TSDR_WDU_Field is HAL.UInt3;
-- time stamp date register
type TSDR_Register is record
-- Read-only. Date units in BCD format
DU : TSDR_DU_Field;
-- Read-only. Date tens in BCD format
DT : TSDR_DT_Field;
-- unspecified
Reserved_6_7 : HAL.UInt2;
-- Read-only. Month units in BCD format
MU : TSDR_MU_Field;
-- Read-only. Month tens in BCD format
MT : Boolean;
-- Read-only. Week day units
WDU : TSDR_WDU_Field;
-- unspecified
Reserved_16_31 : HAL.UInt16;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for TSDR_Register use record
DU at 0 range 0 .. 3;
DT at 0 range 4 .. 5;
Reserved_6_7 at 0 range 6 .. 7;
MU at 0 range 8 .. 11;
MT at 0 range 12 .. 12;
WDU at 0 range 13 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype TSSSR_SS_Field is HAL.UInt16;
-- timestamp sub second register
type TSSSR_Register is record
-- Read-only. Sub second value
SS : TSSSR_SS_Field;
-- unspecified
Reserved_16_31 : HAL.UInt16;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for TSSSR_Register use record
SS at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CALR_CALM_Field is HAL.UInt9;
-- calibration register
type CALR_Register is record
-- Calibration minus
CALM : CALR_CALM_Field := 16#0#;
-- unspecified
Reserved_9_12 : HAL.UInt4 := 16#0#;
-- Use a 16-second calibration cycle period
CALW16 : Boolean := False;
-- Use an 8-second calibration cycle period
CALW8 : Boolean := False;
-- Increase frequency of RTC by 488.5 ppm
CALP : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CALR_Register use record
CALM at 0 range 0 .. 8;
Reserved_9_12 at 0 range 9 .. 12;
CALW16 at 0 range 13 .. 13;
CALW8 at 0 range 14 .. 14;
CALP at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype TAFCR_TAMPFREQ_Field is HAL.UInt3;
subtype TAFCR_TAMPFLT_Field is HAL.UInt2;
subtype TAFCR_TAMPPRCH_Field is HAL.UInt2;
-- tamper and alternate function configuration register
type TAFCR_Register is record
-- Tamper 1 detection enable
TAMP1E : Boolean := False;
-- Active level for tamper 1
TAMP1TRG : Boolean := False;
-- Tamper interrupt enable
TAMPIE : Boolean := False;
-- Tamper 2 detection enable
TAMP2E : Boolean := False;
-- Active level for tamper 2
TAMP2TRG : Boolean := False;
-- unspecified
Reserved_5_6 : HAL.UInt2 := 16#0#;
-- Activate timestamp on tamper detection event
TAMPTS : Boolean := False;
-- Tamper sampling frequency
TAMPFREQ : TAFCR_TAMPFREQ_Field := 16#0#;
-- Tamper filter count
TAMPFLT : TAFCR_TAMPFLT_Field := 16#0#;
-- Tamper precharge duration
TAMPPRCH : TAFCR_TAMPPRCH_Field := 16#0#;
-- TAMPER pull-up disable
TAMPPUDIS : Boolean := False;
-- TAMPER1 mapping
TAMP1INSEL : Boolean := False;
-- TIMESTAMP mapping
TSINSEL : Boolean := False;
-- AFO_ALARM output type
ALARMOUTTYPE : Boolean := False;
-- unspecified
Reserved_19_31 : HAL.UInt13 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for TAFCR_Register use record
TAMP1E at 0 range 0 .. 0;
TAMP1TRG at 0 range 1 .. 1;
TAMPIE at 0 range 2 .. 2;
TAMP2E at 0 range 3 .. 3;
TAMP2TRG at 0 range 4 .. 4;
Reserved_5_6 at 0 range 5 .. 6;
TAMPTS at 0 range 7 .. 7;
TAMPFREQ at 0 range 8 .. 10;
TAMPFLT at 0 range 11 .. 12;
TAMPPRCH at 0 range 13 .. 14;
TAMPPUDIS at 0 range 15 .. 15;
TAMP1INSEL at 0 range 16 .. 16;
TSINSEL at 0 range 17 .. 17;
ALARMOUTTYPE at 0 range 18 .. 18;
Reserved_19_31 at 0 range 19 .. 31;
end record;
subtype ALRMASSR_SS_Field is HAL.UInt15;
subtype ALRMASSR_MASKSS_Field is HAL.UInt4;
-- alarm A sub second register
type ALRMASSR_Register is record
-- Sub seconds value
SS : ALRMASSR_SS_Field := 16#0#;
-- unspecified
Reserved_15_23 : HAL.UInt9 := 16#0#;
-- Mask the most-significant bits starting at this bit
MASKSS : ALRMASSR_MASKSS_Field := 16#0#;
-- unspecified
Reserved_28_31 : HAL.UInt4 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ALRMASSR_Register use record
SS at 0 range 0 .. 14;
Reserved_15_23 at 0 range 15 .. 23;
MASKSS at 0 range 24 .. 27;
Reserved_28_31 at 0 range 28 .. 31;
end record;
subtype ALRMBSSR_SS_Field is HAL.UInt15;
subtype ALRMBSSR_MASKSS_Field is HAL.UInt4;
-- alarm B sub second register
type ALRMBSSR_Register is record
-- Sub seconds value
SS : ALRMBSSR_SS_Field := 16#0#;
-- unspecified
Reserved_15_23 : HAL.UInt9 := 16#0#;
-- Mask the most-significant bits starting at this bit
MASKSS : ALRMBSSR_MASKSS_Field := 16#0#;
-- unspecified
Reserved_28_31 : HAL.UInt4 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ALRMBSSR_Register use record
SS at 0 range 0 .. 14;
Reserved_15_23 at 0 range 15 .. 23;
MASKSS at 0 range 24 .. 27;
Reserved_28_31 at 0 range 28 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Real-time clock
type RTC_Peripheral is record
-- time register
TR : aliased TR_Register;
-- date register
DR : aliased DR_Register;
-- control register
CR : aliased CR_Register;
-- initialization and status register
ISR : aliased ISR_Register;
-- prescaler register
PRER : aliased PRER_Register;
-- wakeup timer register
WUTR : aliased WUTR_Register;
-- calibration register
CALIBR : aliased CALIBR_Register;
-- alarm A register
ALRMAR : aliased ALRMAR_Register;
-- alarm B register
ALRMBR : aliased ALRMBR_Register;
-- write protection register
WPR : aliased WPR_Register;
-- sub second register
SSR : aliased SSR_Register;
-- shift control register
SHIFTR : aliased SHIFTR_Register;
-- time stamp time register
TSTR : aliased TSTR_Register;
-- time stamp date register
TSDR : aliased TSDR_Register;
-- timestamp sub second register
TSSSR : aliased TSSSR_Register;
-- calibration register
CALR : aliased CALR_Register;
-- tamper and alternate function configuration register
TAFCR : aliased TAFCR_Register;
-- alarm A sub second register
ALRMASSR : aliased ALRMASSR_Register;
-- alarm B sub second register
ALRMBSSR : aliased ALRMBSSR_Register;
-- backup register
BKP0R : aliased HAL.UInt32;
-- backup register
BKP1R : aliased HAL.UInt32;
-- backup register
BKP2R : aliased HAL.UInt32;
-- backup register
BKP3R : aliased HAL.UInt32;
-- backup register
BKP4R : aliased HAL.UInt32;
-- backup register
BKP5R : aliased HAL.UInt32;
-- backup register
BKP6R : aliased HAL.UInt32;
-- backup register
BKP7R : aliased HAL.UInt32;
-- backup register
BKP8R : aliased HAL.UInt32;
-- backup register
BKP9R : aliased HAL.UInt32;
-- backup register
BKP10R : aliased HAL.UInt32;
-- backup register
BKP11R : aliased HAL.UInt32;
-- backup register
BKP12R : aliased HAL.UInt32;
-- backup register
BKP13R : aliased HAL.UInt32;
-- backup register
BKP14R : aliased HAL.UInt32;
-- backup register
BKP15R : aliased HAL.UInt32;
-- backup register
BKP16R : aliased HAL.UInt32;
-- backup register
BKP17R : aliased HAL.UInt32;
-- backup register
BKP18R : aliased HAL.UInt32;
-- backup register
BKP19R : aliased HAL.UInt32;
end record
with Volatile;
for RTC_Peripheral use record
TR at 16#0# range 0 .. 31;
DR at 16#4# range 0 .. 31;
CR at 16#8# range 0 .. 31;
ISR at 16#C# range 0 .. 31;
PRER at 16#10# range 0 .. 31;
WUTR at 16#14# range 0 .. 31;
CALIBR at 16#18# range 0 .. 31;
ALRMAR at 16#1C# range 0 .. 31;
ALRMBR at 16#20# range 0 .. 31;
WPR at 16#24# range 0 .. 31;
SSR at 16#28# range 0 .. 31;
SHIFTR at 16#2C# range 0 .. 31;
TSTR at 16#30# range 0 .. 31;
TSDR at 16#34# range 0 .. 31;
TSSSR at 16#38# range 0 .. 31;
CALR at 16#3C# range 0 .. 31;
TAFCR at 16#40# range 0 .. 31;
ALRMASSR at 16#44# range 0 .. 31;
ALRMBSSR at 16#48# range 0 .. 31;
BKP0R at 16#50# range 0 .. 31;
BKP1R at 16#54# range 0 .. 31;
BKP2R at 16#58# range 0 .. 31;
BKP3R at 16#5C# range 0 .. 31;
BKP4R at 16#60# range 0 .. 31;
BKP5R at 16#64# range 0 .. 31;
BKP6R at 16#68# range 0 .. 31;
BKP7R at 16#6C# range 0 .. 31;
BKP8R at 16#70# range 0 .. 31;
BKP9R at 16#74# range 0 .. 31;
BKP10R at 16#78# range 0 .. 31;
BKP11R at 16#7C# range 0 .. 31;
BKP12R at 16#80# range 0 .. 31;
BKP13R at 16#84# range 0 .. 31;
BKP14R at 16#88# range 0 .. 31;
BKP15R at 16#8C# range 0 .. 31;
BKP16R at 16#90# range 0 .. 31;
BKP17R at 16#94# range 0 .. 31;
BKP18R at 16#98# range 0 .. 31;
BKP19R at 16#9C# range 0 .. 31;
end record;
-- Real-time clock
RTC_Periph : aliased RTC_Peripheral
with Import, Address => System'To_Address (16#40002800#);
end STM32_SVD.RTC;
| 33.548272 | 68 | 0.553523 |
31134fb5667ccbcfa28e84df15d5ceacc525bbb7 | 6,593 | ads | Ada | arch/ARM/STM32/svd/stm32l4x2/stm32_svd-comp.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/stm32l4x2/stm32_svd-comp.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | arch/ARM/STM32/svd/stm32l4x2/stm32_svd-comp.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | -- This spec has been automatically generated from STM32L4x2.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.COMP is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype COMP1_CSR_COMP1_PWRMODE_Field is HAL.UInt2;
subtype COMP1_CSR_COMP1_INMSEL_Field is HAL.UInt3;
subtype COMP1_CSR_COMP1_INPSEL_Field is HAL.UInt2;
subtype COMP1_CSR_COMP1_HYST_Field is HAL.UInt2;
subtype COMP1_CSR_COMP1_BLANKING_Field is HAL.UInt3;
subtype COMP1_CSR_COMP1_INMESEL_Field is HAL.UInt2;
-- Comparator 1 control and status register
type COMP1_CSR_Register is record
-- Comparator 1 enable bit
COMP1_EN : Boolean := False;
-- unspecified
Reserved_1_1 : HAL.Bit := 16#0#;
-- Power Mode of the comparator 1
COMP1_PWRMODE : COMP1_CSR_COMP1_PWRMODE_Field := 16#0#;
-- Comparator 1 Input Minus connection configuration bit
COMP1_INMSEL : COMP1_CSR_COMP1_INMSEL_Field := 16#0#;
-- Comparator1 input plus selection bit
COMP1_INPSEL : COMP1_CSR_COMP1_INPSEL_Field := 16#0#;
-- unspecified
Reserved_9_14 : HAL.UInt6 := 16#0#;
-- Comparator 1 polarity selection bit
COMP1_POLARITY : Boolean := False;
-- Comparator 1 hysteresis selection bits
COMP1_HYST : COMP1_CSR_COMP1_HYST_Field := 16#0#;
-- Comparator 1 blanking source selection bits
COMP1_BLANKING : COMP1_CSR_COMP1_BLANKING_Field := 16#0#;
-- unspecified
Reserved_21_21 : HAL.Bit := 16#0#;
-- Scaler bridge enable
COMP1_BRGEN : Boolean := False;
-- Voltage scaler enable bit
COMP1_SCALEN : Boolean := False;
-- unspecified
Reserved_24_24 : HAL.Bit := 16#0#;
-- comparator 1 input minus extended selection bits
COMP1_INMESEL : COMP1_CSR_COMP1_INMESEL_Field := 16#0#;
-- unspecified
Reserved_27_29 : HAL.UInt3 := 16#0#;
-- Read-only. Comparator 1 output status bit
COMP1_VALUE : Boolean := False;
-- Write-only. COMP1_CSR register lock bit
COMP1_LOCK : Boolean := False;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for COMP1_CSR_Register use record
COMP1_EN at 0 range 0 .. 0;
Reserved_1_1 at 0 range 1 .. 1;
COMP1_PWRMODE at 0 range 2 .. 3;
COMP1_INMSEL at 0 range 4 .. 6;
COMP1_INPSEL at 0 range 7 .. 8;
Reserved_9_14 at 0 range 9 .. 14;
COMP1_POLARITY at 0 range 15 .. 15;
COMP1_HYST at 0 range 16 .. 17;
COMP1_BLANKING at 0 range 18 .. 20;
Reserved_21_21 at 0 range 21 .. 21;
COMP1_BRGEN at 0 range 22 .. 22;
COMP1_SCALEN at 0 range 23 .. 23;
Reserved_24_24 at 0 range 24 .. 24;
COMP1_INMESEL at 0 range 25 .. 26;
Reserved_27_29 at 0 range 27 .. 29;
COMP1_VALUE at 0 range 30 .. 30;
COMP1_LOCK at 0 range 31 .. 31;
end record;
subtype COMP2_CSR_COMP2_PWRMODE_Field is HAL.UInt2;
subtype COMP2_CSR_COMP2_INMSEL_Field is HAL.UInt3;
subtype COMP2_CSR_COMP2_INPSEL_Field is HAL.UInt2;
subtype COMP2_CSR_COMP2_HYST_Field is HAL.UInt2;
subtype COMP2_CSR_COMP2_BLANKING_Field is HAL.UInt3;
subtype COMP2_CSR_COMP2_INMESEL_Field is HAL.UInt2;
-- Comparator 2 control and status register
type COMP2_CSR_Register is record
-- Comparator 2 enable bit
COMP2_EN : Boolean := False;
-- unspecified
Reserved_1_1 : HAL.Bit := 16#0#;
-- Power Mode of the comparator 2
COMP2_PWRMODE : COMP2_CSR_COMP2_PWRMODE_Field := 16#0#;
-- Comparator 2 Input Minus connection configuration bit
COMP2_INMSEL : COMP2_CSR_COMP2_INMSEL_Field := 16#0#;
-- Comparator 2 Input Plus connection configuration bit
COMP2_INPSEL : COMP2_CSR_COMP2_INPSEL_Field := 16#0#;
-- Windows mode selection bit
COMP2_WINMODE : Boolean := False;
-- unspecified
Reserved_10_14 : HAL.UInt5 := 16#0#;
-- Comparator 2 polarity selection bit
COMP2_POLARITY : Boolean := False;
-- Comparator 2 hysteresis selection bits
COMP2_HYST : COMP2_CSR_COMP2_HYST_Field := 16#0#;
-- Comparator 2 blanking source selection bits
COMP2_BLANKING : COMP2_CSR_COMP2_BLANKING_Field := 16#0#;
-- unspecified
Reserved_21_21 : HAL.Bit := 16#0#;
-- Scaler bridge enable
COMP2_BRGEN : Boolean := False;
-- Voltage scaler enable bit
COMP2_SCALEN : Boolean := False;
-- unspecified
Reserved_24_24 : HAL.Bit := 16#0#;
-- comparator 2 input minus extended selection bits
COMP2_INMESEL : COMP2_CSR_COMP2_INMESEL_Field := 16#0#;
-- unspecified
Reserved_27_29 : HAL.UInt3 := 16#0#;
-- Read-only. Comparator 2 output status bit
COMP2_VALUE : Boolean := False;
-- Write-only. COMP2_CSR register lock bit
COMP2_LOCK : Boolean := False;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for COMP2_CSR_Register use record
COMP2_EN at 0 range 0 .. 0;
Reserved_1_1 at 0 range 1 .. 1;
COMP2_PWRMODE at 0 range 2 .. 3;
COMP2_INMSEL at 0 range 4 .. 6;
COMP2_INPSEL at 0 range 7 .. 8;
COMP2_WINMODE at 0 range 9 .. 9;
Reserved_10_14 at 0 range 10 .. 14;
COMP2_POLARITY at 0 range 15 .. 15;
COMP2_HYST at 0 range 16 .. 17;
COMP2_BLANKING at 0 range 18 .. 20;
Reserved_21_21 at 0 range 21 .. 21;
COMP2_BRGEN at 0 range 22 .. 22;
COMP2_SCALEN at 0 range 23 .. 23;
Reserved_24_24 at 0 range 24 .. 24;
COMP2_INMESEL at 0 range 25 .. 26;
Reserved_27_29 at 0 range 27 .. 29;
COMP2_VALUE at 0 range 30 .. 30;
COMP2_LOCK at 0 range 31 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Comparator
type COMP_Peripheral is record
-- Comparator 1 control and status register
COMP1_CSR : aliased COMP1_CSR_Register;
-- Comparator 2 control and status register
COMP2_CSR : aliased COMP2_CSR_Register;
end record
with Volatile;
for COMP_Peripheral use record
COMP1_CSR at 16#0# range 0 .. 31;
COMP2_CSR at 16#4# range 0 .. 31;
end record;
-- Comparator
COMP_Periph : aliased COMP_Peripheral
with Import, Address => System'To_Address (16#40010200#);
end STM32_SVD.COMP;
| 37.248588 | 65 | 0.644926 |
a1641962b341f3a2ee3d54aee368e0085538a2f5 | 27,407 | adb | Ada | src/keystore-repository.adb | My-Colaborations/ada-keystore | 6ab222c2df81f32309c5a7b4f94a475214ef5ce3 | [
"Apache-2.0"
] | 25 | 2019-05-07T20:35:50.000Z | 2021-11-30T10:35:47.000Z | src/keystore-repository.adb | My-Colaborations/ada-keystore | 6ab222c2df81f32309c5a7b4f94a475214ef5ce3 | [
"Apache-2.0"
] | 12 | 2019-12-16T23:30:00.000Z | 2021-09-26T18:52:41.000Z | src/keystore-repository.adb | My-Colaborations/ada-keystore | 6ab222c2df81f32309c5a7b4f94a475214ef5ce3 | [
"Apache-2.0"
] | 3 | 2019-12-18T21:30:04.000Z | 2021-01-06T08:30:36.000Z | -----------------------------------------------------------------------
-- keystore-repository -- Repository management for the keystore
-- Copyright (C) 2019, 2020 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Log.Loggers;
with Util.Strings;
with Ada.Unchecked_Deallocation;
with Keystore.Marshallers;
with Keystore.Repository.Data;
with Keystore.Repository.Entries;
with Keystore.Repository.Workers;
with Keystore.Repository.Keys;
-- Block = 4K, 8K, 16K, 64K, 128K ?
--
-- Block types:
-- * Wallet File First Block
-- * Wallet Header
-- * Wallet Repository
-- * Wallet Data
--
-- Generic Block header
-- +------------------+
-- | Block HMAC-256 | 32b
-- +------------------+
-- | Block type | 4b
-- | Wallet id | 4b
-- | PAD 0 | 4b
-- | PAD 0 | 4b
-- +------------------+
-- | ...AES-CTR... | B
-- +------------------+
package body Keystore.Repository is
use type Interfaces.Unsigned_64;
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("Keystore.Repository");
procedure Free is
new Ada.Unchecked_Deallocation (Object => Wallet_Entry,
Name => Wallet_Entry_Access);
procedure Free is
new Ada.Unchecked_Deallocation (Object => Wallet_Directory_Entry,
Name => Wallet_Directory_Entry_Access);
procedure Free is
new Ada.Unchecked_Deallocation (Object => Keystore.Repository.Workers.Wallet_Worker,
Name => Wallet_Worker_Access);
procedure Mkdir (Repository : in out Wallet_Repository;
Name : in String);
function Hash (Value : in Wallet_Entry_Index) return Ada.Containers.Hash_Type is
begin
return Ada.Containers.Hash_Type (Value);
end Hash;
function Get_Identifier (Repository : in Wallet_Repository) return Wallet_Identifier is
begin
return Repository.Id;
end Get_Identifier;
procedure Open (Repository : in out Wallet_Repository;
Config : in Keystore.Wallet_Config;
Ident : in Wallet_Identifier;
Stream : in IO.Wallet_Stream_Access) is
begin
Repository.Id := Ident;
Repository.Stream := Stream;
Repository.Next_Id := 1;
Repository.Next_Wallet_Id := Ident + 1;
Repository.Config.Randomize := Config.Randomize;
Repository.Config.Cache_Directory := Config.Cache_Directory;
end Open;
procedure Open (Repository : in out Wallet_Repository;
Name : in String;
Password : in out Keystore.Passwords.Provider'Class;
Keys : in out Keystore.Keys.Key_Manager;
Master_Block : in out Keystore.IO.Storage_Block;
Master_Ident : in out Wallet_Identifier;
Wallet : in out Wallet_Repository) is
Pos : constant Wallet_Maps.Cursor := Repository.Map.Find (Name);
begin
if not Wallet_Maps.Has_Element (Pos) then
Log.Info ("Wallet entry '{0}' not found", Name);
raise Not_Found;
end if;
declare
Item : constant Wallet_Entry_Access := Wallet_Maps.Element (Pos);
begin
if Item.Kind /= T_WALLET then
raise Invalid_Keystore;
end if;
Master_Block := Repository.Root;
Master_Block.Block := Item.Master;
Master_Ident := Item.Wallet_Id;
Wallet.Stream := Repository.Stream;
Wallet.Next_Id := 1;
Wallet.Id := Item.Wallet_Id;
Wallet.Parent := Repository'Unchecked_Access;
Keystore.Repository.Keys.Open_Wallet (Repository, Item, Keys);
Keystore.Keys.Open (Keys, Password, Wallet.Id, Master_Block,
Wallet.Root, Wallet.Config, null, Repository.Stream.all);
Wallet.Workers := Workers.Create (Wallet'Unchecked_Access, null, 1).all'Access;
Entries.Load_Complete_Directory (Wallet, Wallet.Root);
end;
end Open;
procedure Create (Repository : in out Wallet_Repository;
Password : in out Keystore.Passwords.Provider'Class;
Config : in Wallet_Config;
Block : in IO.Storage_Block;
Ident : in Wallet_Identifier;
Keys : in out Keystore.Keys.Key_Manager;
Stream : in IO.Wallet_Stream_Access) is
Entry_Block : Wallet_Directory_Entry_Access;
begin
Stream.Allocate (IO.DIRECTORY_BLOCK, Repository.Root);
Repository.Id := Ident;
Repository.Next_Id := 1;
Repository.Next_Wallet_Id := Ident + 1;
Repository.Stream := Stream;
Repository.Config.Randomize := Config.Randomize;
Repository.Config.Cache_Directory := Config.Cache_Directory;
Repository.Config.Max_Counter := Interfaces.Unsigned_32 (Config.Max_Counter);
Repository.Config.Min_Counter := Interfaces.Unsigned_32 (Config.Min_Counter);
Keystore.Keys.Create (Keys, Password, 1, Ident, Block, Repository.Root,
Repository.Config, Stream.all);
Repository.Workers := Workers.Create (Repository'Unchecked_Access, null, 1).all'Access;
-- We need a new wallet directory block.
Entries.Initialize_Directory_Block (Repository, Repository.Root, 0, Entry_Block);
Repository.Current.Buffer := Buffers.Allocate (Repository.Root);
-- Fill the root directory block with random values or with zeros.
if Repository.Config.Randomize then
Repository.Random.Generate (Repository.Current.Buffer.Data.Value.Data);
else
Repository.Current.Buffer.Data.Value.Data := (others => 0);
end if;
Marshallers.Set_Header (Into => Repository.Current,
Tag => IO.BT_WALLET_DIRECTORY,
Id => Repository.Id);
Marshallers.Put_Unsigned_32 (Repository.Current, 0);
Marshallers.Put_Block_Index (Repository.Current, IO.Block_Index'Last);
Marshallers.Put_Unsigned_32 (Repository.Current, 0);
Keystore.Keys.Set_IV (Repository.Config.Dir, Repository.Root.Block);
Stream.Write (From => Repository.Current.Buffer,
Cipher => Repository.Config.Dir.Cipher,
Sign => Repository.Config.Dir.Sign);
end Create;
procedure Unlock (Repository : in out Wallet_Repository;
Password : in out Keystore.Passwords.Provider'Class;
Block : in Keystore.IO.Storage_Block;
Keys : in out Keystore.Keys.Key_Manager) is
begin
Keystore.Keys.Open (Keys, Password, Repository.Id, Block,
Repository.Root, Repository.Config, null, Repository.Stream.all);
Repository.Workers := Workers.Create (Repository'Unchecked_Access, null, 1).all'Access;
Entries.Load_Complete_Directory (Repository, Repository.Root);
end Unlock;
procedure Mkdir (Repository : in out Wallet_Repository;
Name : in String) is
First : Positive := Name'First;
Pos : Natural;
begin
while First <= Name'Last loop
Pos := Util.Strings.Index (Name, '/', First);
if Pos = 0 then
Pos := Name'Last;
else
Pos := Pos - 1;
end if;
declare
Path : constant String := Name (Name'First .. Pos);
Item : Wallet_Entry_Access;
begin
if not Repository.Map.Contains (Path) then
Log.Info ("Mkdir {0}", Path);
Entries.Add_Entry (Repository, Path, T_DIRECTORY, Item);
Entries.Update_Entry (Repository, Item, T_DIRECTORY, 0);
end if;
end;
First := Pos + 2;
end loop;
end Mkdir;
procedure Add (Repository : in out Wallet_Repository;
Name : in String;
Kind : in Entry_Type;
Content : in Ada.Streams.Stream_Element_Array) is
Item : Wallet_Entry_Access;
Data_Offset : Interfaces.Unsigned_64 := 0;
Iterator : Keys.Data_Key_Iterator;
Pos : Natural;
begin
-- For a new file, make sure we have a T_DIRECTORY entry for each path component.
if Kind = T_FILE then
Pos := Util.Strings.Rindex (Name, '/');
if Pos > 0 then
Mkdir (Repository, Name (Name'First .. Pos - 1));
end if;
end if;
Entries.Add_Entry (Repository, Name, Kind, Item);
Entries.Update_Entry (Repository, Item, Kind, Content'Length);
if Content'Length > 0 then
Keys.Initialize (Repository, Iterator, Item);
Data.Add_Data (Repository, Iterator, Content, Data_Offset);
Entries.Update_Entry (Repository, Item, Kind, Data_Offset);
end if;
Entries.Save (Manager => Repository);
end Add;
procedure Add (Repository : in out Wallet_Repository;
Name : in String;
Kind : in Entry_Type;
Input : in out Util.Streams.Input_Stream'Class) is
Item : Wallet_Entry_Access;
Data_Offset : Interfaces.Unsigned_64 := 0;
Iterator : Keys.Data_Key_Iterator;
Pos : Natural;
begin
-- For a new file, make sure we have a T_DIRECTORY entry for each path component.
if Kind = T_FILE then
Pos := Util.Strings.Rindex (Name, '/');
if Pos > 0 then
Mkdir (Repository, Name (Name'First .. Pos - 1));
end if;
end if;
Entries.Add_Entry (Repository, Name, Kind, Item);
Entries.Update_Entry (Repository, Item, Kind, 1);
Keys.Initialize (Repository, Iterator, Item);
Data.Add_Data (Repository, Iterator, Input, Data_Offset);
Entries.Update_Entry (Repository, Item, Kind, Data_Offset);
Entries.Save (Manager => Repository);
end Add;
procedure Add_Wallet (Repository : in out Wallet_Repository;
Name : in String;
Password : in out Keystore.Passwords.Provider'Class;
Keys : in out Keystore.Keys.Key_Manager;
Master_Block : in out Keystore.IO.Storage_Block;
Master_Ident : in out Wallet_Identifier;
Wallet : in out Wallet_Repository) is
Item : Wallet_Entry_Access;
Entry_Block : Wallet_Directory_Entry_Access;
begin
Entries.Add_Entry (Repository, Name, T_WALLET, Item);
-- Repository.Value.Add (Name, Password, Wallet, Stream);
Repository.Stream.Allocate (IO.MASTER_BLOCK, Master_Block);
Repository.Stream.Allocate (IO.DIRECTORY_BLOCK, Wallet.Root);
Item.Master := Master_Block.Block;
Wallet.Stream := Repository.Stream;
Wallet.Next_Id := 1;
Wallet.Id := Item.Wallet_Id;
Master_Ident := Wallet.Id;
Entries.Update_Entry (Repository, Item, T_WALLET, 0);
Keystore.Repository.Keys.Create_Wallet (Repository, Item, Master_Block, Keys);
Keystore.Keys.Create (Keys, Password, 1, Master_Ident, Master_Block, Wallet.Root,
Wallet.Config, Repository.Stream.all);
-- We need a new wallet directory block.
Entries.Initialize_Directory_Block (Wallet, Wallet.Root, 0, Entry_Block);
Entries.Save (Repository);
Wallet.Current.Buffer := Buffers.Allocate (Wallet.Root);
Wallet.Current.Buffer.Data.Value.Data := (others => 0);
Marshallers.Set_Header (Into => Wallet.Current,
Tag => IO.BT_WALLET_DIRECTORY,
Id => Wallet.Id);
Marshallers.Put_Unsigned_32 (Wallet.Current, 0);
Marshallers.Put_Block_Index (Wallet.Current, IO.Block_Index'Last);
Keystore.Keys.Set_IV (Wallet.Config.Dir, Wallet.Root.Block);
Repository.Stream.Write (From => Wallet.Current.Buffer,
Cipher => Wallet.Config.Dir.Cipher,
Sign => Wallet.Config.Dir.Sign);
Wallet.Workers := Workers.Create (Wallet'Unchecked_Access, null, 1).all'Access;
end Add_Wallet;
procedure Set (Repository : in out Wallet_Repository;
Name : in String;
Kind : in Entry_Type;
Content : in Ada.Streams.Stream_Element_Array) is
begin
if Repository.Map.Contains (Name) then
Repository.Update (Name, Kind, Content);
else
Repository.Add (Name, Kind, Content);
end if;
end Set;
procedure Set (Repository : in out Wallet_Repository;
Name : in String;
Kind : in Entry_Type;
Input : in out Util.Streams.Input_Stream'Class) is
begin
if Repository.Map.Contains (Name) then
Repository.Update (Name, Kind, Input);
else
Repository.Add (Name, Kind, Input);
end if;
end Set;
procedure Update (Repository : in out Wallet_Repository;
Name : in String;
Kind : in Entry_Type;
Content : in Ada.Streams.Stream_Element_Array) is
Pos : constant Wallet_Maps.Cursor := Repository.Map.Find (Name);
Data_Offset : Interfaces.Unsigned_64 := 0;
begin
Log.Debug ("Update keystore entry {0}", Name);
if not Wallet_Maps.Has_Element (Pos) then
Log.Info ("Data entry '{0}' not found", Name);
raise Not_Found;
end if;
declare
Item : constant Wallet_Entry_Access := Wallet_Maps.Element (Pos);
Iterator : Keys.Data_Key_Iterator;
Last_Pos : Stream_Element_Offset;
begin
if Item.Is_Wallet then
Log.Info ("Data entry '{0}' is a wallet", Name);
raise No_Content;
end if;
Item.Kind := Kind;
Keys.Initialize (Repository, Iterator, Item);
if Content'Length > 0 then
Data.Update_Data (Repository, Iterator, Content, Last_Pos, Data_Offset);
else
Last_Pos := Content'Last + 1;
end if;
if Last_Pos > Content'Last then
Data.Delete_Data (Repository, Iterator);
else
Data.Add_Data (Repository, Iterator,
Content (Last_Pos .. Content'Last), Data_Offset);
end if;
Entries.Update_Entry (Repository, Item, Kind, Data_Offset);
Entries.Save (Repository);
end;
end Update;
procedure Update (Repository : in out Wallet_Repository;
Name : in String;
Kind : in Entry_Type;
Input : in out Util.Streams.Input_Stream'Class) is
Item_Pos : constant Wallet_Maps.Cursor := Repository.Map.Find (Name);
Data_Offset : Interfaces.Unsigned_64 := 0;
begin
Log.Debug ("Update keystore entry {0}", Name);
if not Wallet_Maps.Has_Element (Item_Pos) then
Log.Info ("Data entry '{0}' not found", Name);
raise Not_Found;
end if;
declare
Item : constant Wallet_Entry_Access := Wallet_Maps.Element (Item_Pos);
Iterator : Keys.Data_Key_Iterator;
End_Of_Stream : Boolean;
begin
if Item.Is_Wallet then
Log.Info ("Data entry '{0}' is a wallet", Name);
raise No_Content;
end if;
Item.Kind := Kind;
Keys.Initialize (Repository, Iterator, Item);
Data.Update_Data (Repository, Iterator, Input, End_Of_Stream, Data_Offset);
if not End_Of_Stream then
Data.Add_Data (Repository, Iterator, Input, Data_Offset);
end if;
Entries.Update_Entry (Repository, Item, Kind, Data_Offset);
Entries.Save (Repository);
end;
end Update;
-- ------------------------------
-- Delete the value associated with the given name.
-- Raises the Not_Found exception if the name was not found.
-- ------------------------------
procedure Delete (Repository : in out Wallet_Repository;
Name : in String) is
Pos : Wallet_Maps.Cursor := Repository.Map.Find (Name);
begin
if not Wallet_Maps.Has_Element (Pos) then
Log.Info ("Data entry '{0}' not found", Name);
raise Not_Found;
end if;
declare
Item : Wallet_Entry_Access := Wallet_Maps.Element (Pos);
Iterator : Keys.Data_Key_Iterator;
begin
Keys.Initialize (Repository, Iterator, Item);
-- Erase the data fragments used by the entry.
Data.Delete_Data (Repository, Iterator);
-- Erase the entry from the repository.
Entries.Delete_Entry (Manager => Repository,
Item => Item);
Entries.Save (Manager => Repository);
Repository.Entry_Indexes.Delete (Item.Id);
Repository.Map.Delete (Pos);
Free (Item);
exception
when others =>
-- Handle data or directory block corruption or IO error.
Repository.Entry_Indexes.Delete (Item.Id);
Repository.Map.Delete (Pos);
Free (Item);
raise;
end;
end Delete;
function Contains (Repository : in Wallet_Repository;
Name : in String) return Boolean is
begin
return Repository.Map.Contains (Name);
end Contains;
procedure Find (Repository : in out Wallet_Repository;
Name : in String;
Result : out Entry_Info) is
Pos : constant Wallet_Maps.Cursor := Repository.Map.Find (Name);
Item : Wallet_Entry_Access;
begin
if not Wallet_Maps.Has_Element (Pos) then
Log.Info ("Data entry '{0}' not found", Name);
raise Not_Found;
end if;
Item := Wallet_Maps.Element (Pos);
if Item.Kind = T_INVALID then
Log.Error ("Wallet entry {0} is corrupted", Name);
raise Corrupted;
end if;
if not Item.Is_Wallet then
Result.Size := Item.Size;
Result.Block_Count := Item.Block_Count;
else
Result.Size := 0;
Result.Block_Count := 0;
end if;
Result.Kind := Item.Kind;
Result.Create_Date := Item.Create_Date;
Result.Update_Date := Item.Update_Date;
end Find;
procedure Get_Data (Repository : in out Wallet_Repository;
Name : in String;
Result : out Entry_Info;
Output : out Ada.Streams.Stream_Element_Array) is
Pos : constant Wallet_Maps.Cursor := Repository.Map.Find (Name);
begin
if not Wallet_Maps.Has_Element (Pos) then
Log.Info ("Data entry '{0}' not found", Name);
raise Not_Found;
end if;
declare
Item : constant Wallet_Entry_Access := Wallet_Maps.Element (Pos);
Iterator : Keys.Data_Key_Iterator;
begin
if Item.Is_Wallet then
Log.Info ("Data entry '{0}' is a wallet", Name);
raise No_Content;
end if;
Result.Size := Item.Size;
Result.Kind := Item.Kind;
Result.Create_Date := Item.Create_Date;
Result.Update_Date := Item.Update_Date;
Keys.Initialize (Repository, Iterator, Item);
Data.Get_Data (Repository, Iterator, Output);
pragma Assert (Iterator.Current_Offset = Item.Size);
end;
end Get_Data;
procedure Read (Repository : in out Wallet_Repository;
Name : in String;
Offset : in Ada.Streams.Stream_Element_Offset;
Content : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset) is
Pos : constant Wallet_Maps.Cursor := Repository.Map.Find (Name);
begin
if not Wallet_Maps.Has_Element (Pos) then
Log.Info ("Data entry '{0}' not found", Name);
raise Not_Found;
end if;
declare
Item : constant Wallet_Entry_Access := Wallet_Maps.Element (Pos);
Iterator : Keys.Data_Key_Iterator;
begin
if Item.Is_Wallet then
Log.Info ("Data entry '{0}' is a wallet", Name);
raise No_Content;
end if;
if Item.Size <= Interfaces.Unsigned_64 (Offset) then
Last := Content'First - 1;
return;
end if;
Keys.Initialize (Repository, Iterator, Item);
Data.Read (Repository, Iterator, Offset, Content, Last);
end;
end Read;
procedure Write (Repository : in out Wallet_Repository;
Name : in String;
Offset : in Ada.Streams.Stream_Element_Offset;
Content : in Ada.Streams.Stream_Element_Array) is
Pos : constant Wallet_Maps.Cursor := Repository.Map.Find (Name);
begin
if not Wallet_Maps.Has_Element (Pos) then
Log.Info ("Data entry '{0}' not found", Name);
raise Not_Found;
end if;
declare
Item : constant Wallet_Entry_Access := Wallet_Maps.Element (Pos);
Iterator : Keys.Data_Key_Iterator;
Data_Offset : Interfaces.Unsigned_64 := 0;
begin
if Item.Is_Wallet then
Log.Info ("Data entry '{0}' is a wallet", Name);
raise No_Content;
end if;
Keys.Initialize (Repository, Iterator, Item);
Data.Write (Repository, Iterator, Offset, Content, Data_Offset);
-- The item is now bigger, update its size.
if Item.Size < Data_Offset then
Entries.Update_Entry (Repository, Item, Item.Kind, Data_Offset);
end if;
Entries.Save (Repository);
end;
end Write;
procedure Get_Data (Repository : in out Wallet_Repository;
Name : in String;
Output : in out Util.Streams.Output_Stream'Class) is
Pos : constant Wallet_Maps.Cursor := Repository.Map.Find (Name);
begin
if not Wallet_Maps.Has_Element (Pos) then
Log.Info ("Data entry '{0}' not found", Name);
raise Not_Found;
end if;
declare
Item : constant Wallet_Entry_Access := Wallet_Maps.Element (Pos);
Iterator : Keys.Data_Key_Iterator;
begin
if Item.Is_Wallet then
Log.Info ("Data entry '{0}' is a wallet", Name);
raise No_Content;
end if;
Keys.Initialize (Repository, Iterator, Item);
Data.Get_Data (Repository, Iterator, Output);
end;
end Get_Data;
-- ------------------------------
-- Get the list of entries contained in the wallet that correspond to the optional filter.
-- ------------------------------
procedure List (Repository : in out Wallet_Repository;
Filter : in Filter_Type;
Content : out Entry_Map) is
Value : Entry_Info;
begin
for Item of Repository.Map loop
if Filter (Item.Kind) then
if not Item.Is_Wallet then
Value.Size := Item.Size;
Value.Block_Count := Item.Block_Count;
else
Value.Size := 0;
Value.Block_Count := 1;
end if;
Value.Kind := Item.Kind;
Value.Create_Date := Item.Create_Date;
Value.Update_Date := Item.Update_Date;
Content.Include (Key => Item.Name,
New_Item => Value);
end if;
end loop;
end List;
procedure List (Repository : in out Wallet_Repository;
Pattern : in GNAT.Regpat.Pattern_Matcher;
Filter : in Filter_Type;
Content : out Entry_Map) is
Value : Entry_Info;
begin
for Item of Repository.Map loop
if Filter (Item.Kind) and then GNAT.Regpat.Match (Pattern, Item.Name) then
if not Item.Is_Wallet then
Value.Size := Item.Size;
Value.Block_Count := Item.Block_Count;
else
Value.Size := 0;
Value.Block_Count := 1;
end if;
Value.Kind := Item.Kind;
Value.Create_Date := Item.Create_Date;
Value.Update_Date := Item.Update_Date;
Content.Include (Key => Item.Name,
New_Item => Value);
end if;
end loop;
end List;
-- ------------------------------
-- Get the key slot number that was used to unlock the keystore.
-- ------------------------------
function Get_Key_Slot (Repository : in Wallet_Repository) return Key_Slot is
begin
return Repository.Config.Slot;
end Get_Key_Slot;
-- ------------------------------
-- Get stats information about the wallet (the number of entries, used key slots).
-- ------------------------------
procedure Fill_Stats (Repository : in Wallet_Repository;
Stats : in out Wallet_Stats) is
begin
Stats.UUID := Repository.Config.UUID;
Stats.Keys := Repository.Config.Keys;
Stats.Entry_Count := Natural (Repository.Map.Length);
end Fill_Stats;
procedure Close (Repository : in out Wallet_Repository) is
Dir : Wallet_Directory_Entry_Access;
First : Wallet_Maps.Cursor;
Item : Wallet_Entry_Access;
begin
Entries.Save (Manager => Repository);
Repository.Cache.Clear;
while not Repository.Directory_List.Is_Empty loop
Dir := Repository.Directory_List.First_Element;
Repository.Directory_List.Delete_First;
Free (Dir);
end loop;
Repository.Entry_Indexes.Clear;
while not Repository.Map.Is_Empty loop
First := Repository.Map.First;
Item := Wallet_Maps.Element (First);
Free (Item);
Repository.Map.Delete (First);
end loop;
Free (Repository.Workers);
end Close;
procedure Set_Work_Manager (Repository : in out Wallet_Repository;
Workers : in Keystore.Task_Manager_Access) is
begin
Free (Repository.Workers);
Repository.Workers
:= Keystore.Repository.Workers.Create (Repository'Unchecked_Access,
Workers, Workers.Count).all'Access;
end Set_Work_Manager;
overriding
procedure Finalize (Manager : in out Wallet_Repository) is
begin
Manager.Close;
end Finalize;
end Keystore.Repository;
| 38.012483 | 94 | 0.583902 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.