CombinedText stringlengths 4 3.42M |
|---|
with ada.Containers.Hashed_Maps,display, Ada.Containers.Hashed_Maps,ada.containers.doubly_linked_lists ;
package snake_types is
type Snake_direction is (LEFT,RIGHT,UP,DOWN) ;
type Coordinates is
record
x : integer range display.screen'range(1) ;
y : integer range display.screen'range(2) ;
end record ;
package snake_list is new ada.Containers.doubly_linked_lists(Coordinates) ;
subtype snake is snake_list.list ;
function Hash_Func(Key : character) return Ada.Containers.Hash_Type ;
package User_Controls is new Ada.Containers.Hashed_Maps
(Key_Type => character,
Element_Type => Snake_direction,
Hash => Hash_Func,
Equivalent_Keys => "=");
end snake_types ;
|
-- Copyright (C) 2020 Glen Cornell <glen.m.cornell@gmail.com>
--
-- 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/>.
-- The following generic packages define signals with zero or more
-- parameters. A signal is analogous to a "Subject" in the observer
-- pattern. Each of these generic packages defines a tagged type
-- called "Signal". You can connect procedures, class methods, and
-- other signals to the signal object. The compiler will ensure that
-- the procedures, methods and signals follow the same parameter
-- profile as defined by the instance of the Signal generic. To
-- notify all of the observers, you invoke the signal's Emit method,
-- which then invokes every subprogram in the order in which it was
-- connected to the signal.
private with Ada.Containers.Vectors;
package Aof.Core.Generic_Signals is
pragma Preelaborate;
-- The Generic_Connections package is an internal helper package
-- to reduce similar code used in all of the generic signal
-- packages that follow. Do not create instances of this package.
generic
-- Object Methods
type Access_Object is private;
type Access_Method is private;
-- Simple Procedures
type Access_Procedure is private;
-- Emit methods to Signal Objects
type Access_Signal is private;
package Generic_Connections is
type Connection_Type is
(Connect_To_Nothing,
Connect_To_Method,
Connect_To_Procedure,
Connect_To_Signal);
type Connection_Object_Type (Connection : Connection_Type := Connect_To_Nothing) is record
case Connection is
when Connect_To_Nothing =>
null;
when Connect_To_Method =>
Object : Access_Object;
Method : Access_Method;
when Connect_To_Procedure =>
Proc : Access_Procedure;
when Connect_To_Signal =>
Signal : Access_Signal;
end case;
end record;
end Generic_Connections;
-- Implementation note: since Ada does not natively support a
-- variable number of generic formal parameters, we have to use
-- another solution to allow the user to easily create signals
-- with any number of parameters. Therefore, below you will find
-- several generic packages that vary only by the number of
-- parameters to the Emit subprogram.
-- S0: Signals with no parameters.
generic
type Object is abstract tagged limited private;
type Access_Object is access all Object'Class;
package S0 is
-- Callback definitions
type Access_Method is access procedure
(This : in not null Access_Object);
type Access_Procedure is access procedure;
type Signal is tagged limited private;
type Access_Signal is access all Signal'Class;
-- Connect a class method (slot) to the signal object
procedure Connect (This : in out Signal'Class;
Object : in not null Access_Object;
Method : in not null Access_Method);
-- Connect a procedure to the signal object
procedure Connect (This : in out Signal'Class;
Proc : in not null Access_Procedure);
-- Chaned signals: connect another signal to the signal object
procedure Connect (This : in out Signal'Class;
Signal : in not null Access_Signal);
-- Notify all of the Observers
procedure Emit (This : in Signal'Class);
private
package Connections is new Generic_Connections
(Access_Object => Access_Object,
Access_Method => Access_Method,
Access_Procedure => Access_Procedure,
Access_Signal => Access_Signal);
use type Connections.Connection_Object_Type;
package Slot_Container_Pkg is new Ada.Containers.Vectors
(Element_Type => Connections.Connection_Object_Type,
Index_Type => Natural);
type Signal is tagged limited record
Slots : Slot_Container_Pkg.Vector;
end record;
end S0;
-- S1: Signals with 1 parameter.
generic
type Object is abstract tagged limited private;
type Access_Object is access all Object'Class;
type Param_1 is private;
package S1 is
type Access_Method is access procedure
(This : in not null Access_Object;
P1 : in Param_1);
type Access_Procedure is access procedure
(P1 : in Param_1);
type Signal is tagged limited private;
type Access_Signal is access Signal'Class;
procedure Connect (This : in out Signal'Class;
Object : in not null Access_Object;
Method : in not null Access_Method);
procedure Connect (This : in out Signal'Class;
Proc : in not null Access_Procedure);
procedure Connect (This : in out Signal'Class;
Signal : in not null Access_Signal);
procedure Emit (This : in Signal'Class;
P1 : in Param_1);
private
package Connections is new Generic_Connections
(Access_Object => Access_Object,
Access_Method => Access_Method,
Access_Procedure => Access_Procedure,
Access_Signal => Access_Signal);
use type Connections.Connection_Object_Type;
package Slot_Container_Pkg is new Ada.Containers.Vectors
(Element_Type => Connections.Connection_Object_Type,
Index_Type => Natural);
type Signal is tagged limited record
Slots : Slot_Container_Pkg.Vector;
end record;
end S1;
-- S2: Signals with 2 parameters.
generic
type Object is abstract tagged limited private;
type Access_Object is access all Object'Class;
type Param_1 is private;
type Param_2 is private;
package S2 is
type Access_Method is access procedure
(This : in not null Access_Object;
P1 : in Param_1;
P2 : in Param_2);
type Access_Procedure is access procedure
(P1 : in Param_1;
P2 : in Param_2);
type Signal is tagged limited private;
type Access_Signal is access Signal'Class;
procedure Connect (This : in out Signal'Class;
Object : in not null Access_Object;
Method : in not null Access_Method);
procedure Connect (This : in out Signal'Class;
Proc : in not null Access_Procedure);
procedure Connect (This : in out Signal'Class;
Signal : in not null Access_Signal);
procedure Emit (This : in Signal'Class;
P1 : in Param_1;
P2 : in Param_2);
private
package Connections is new Generic_Connections
(Access_Object => Access_Object,
Access_Method => Access_Method,
Access_Procedure => Access_Procedure,
Access_Signal => Access_Signal);
use type Connections.Connection_Object_Type;
package Slot_Container_Pkg is new Ada.Containers.Vectors
(Element_Type => Connections.Connection_Object_Type,
Index_Type => Natural);
type Signal is tagged limited record
Slots : Slot_Container_Pkg.Vector;
end record;
end S2;
-- S3: Signals with 3 parameters.
generic
type Object is abstract tagged limited private;
type Access_Object is access all Object'Class;
type Param_1 is private;
type Param_2 is private;
type Param_3 is private;
package S3 is
type Access_Method is access procedure
(This : in not null Access_Object;
P1 : in Param_1;
P2 : in Param_2;
P3 : in Param_3);
type Access_Procedure is access procedure
(P1 : in Param_1;
P2 : in Param_2;
P3 : in Param_3);
type Signal is tagged limited private;
type Access_Signal is access Signal'Class;
procedure Connect (This : in out Signal'Class;
Object : in not null Access_Object;
Method : in not null Access_Method);
procedure Connect (This : in out Signal'Class;
Proc : in not null Access_Procedure);
procedure Connect (This : in out Signal'Class;
Signal : in not null Access_Signal);
procedure Emit (This : in Signal'Class;
P1 : in Param_1;
P2 : in Param_2;
P3 : in Param_3);
private
package Connections is new Generic_Connections
(Access_Object => Access_Object,
Access_Method => Access_Method,
Access_Procedure => Access_Procedure,
Access_Signal => Access_Signal);
use type Connections.Connection_Object_Type;
package Slot_Container_Pkg is new Ada.Containers.Vectors
(Element_Type => Connections.Connection_Object_Type,
Index_Type => Natural);
type Signal is tagged limited record
Slots : Slot_Container_Pkg.Vector;
end record;
end S3;
end Aof.Core.Generic_Signals;
|
-- D4A002B.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.
--*
-- LARGER LITERALS IN NUMBER DECLARATIONS, BUT WITH RESULTING
-- SMALLER VALUE OBTAINED BY SUBTRACTION. THIS TEST LIMITS VALUES
-- TO 64 BINARY PLACES.
-- BAW 29 SEPT 80
-- JBG 05/02/85 RENAMED TO -B. REVISED SO THAT ALL RESULTS FIT IN
-- 16 BITS.
WITH REPORT;
PROCEDURE D4A002B IS
USE REPORT;
X : CONSTANT := 4123456789012345678 - 4123456789012345679;
Y : CONSTANT := 4 * (10 ** 18) - 3999999999999999999;
Z : CONSTANT := (1024 ** 6) - (2 ** 60);
D : CONSTANT := 9_223_372_036_854_775_807 / 994_862_694_084_217;
E : CONSTANT := 36_028_790_976_242_271 REM 17_600_175_361;
F : CONSTANT := ( - 2 ** 51 ) MOD ( - 131_071 );
BEGIN TEST("D4A002B","LARGE INTEGER RANGE (WITH CANCELLATION) IN " &
"NUMBER DECLARATIONS; LONGEST INTEGER IS 64 BITS ");
IF X /= -1 OR Y /= 1 OR Z /= 0
OR D /= 9271 OR E /= 1 OR F /= -1
THEN FAILED("EXPRESSIONS WITH A LARGE INTEGER RANGE (WITH " &
"CANCELLATION) ARE NOT EXACT ");
END IF;
RESULT;
END D4A002B;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY COMPONENTS --
-- --
-- S Y S T E M . C O M P A R E _ A R R A Y _ S I G N E D _ 6 4 --
-- --
-- B o d y --
-- --
-- Copyright (C) 2002-2005 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.Address_Operations; use System.Address_Operations;
with Unchecked_Conversion;
package body System.Compare_Array_Signed_64 is
type Word is range -2**63 .. 2**63 - 1;
for Word'Size use 64;
-- Used to process operands by words
type Uword is record
W : Word;
end record;
pragma Pack (Uword);
for Uword'Alignment use 1;
-- Used to process operands when unaligned
type WP is access Word;
type UP is access Uword;
function W is new Unchecked_Conversion (Address, WP);
function U is new Unchecked_Conversion (Address, UP);
-----------------------
-- Compare_Array_S64 --
-----------------------
function Compare_Array_S64
(Left : System.Address;
Right : System.Address;
Left_Len : Natural;
Right_Len : Natural) return Integer
is
Clen : Natural := Natural'Min (Left_Len, Right_Len);
-- Number of elements left to compare
L : Address := Left;
R : Address := Right;
-- Pointers to next elements to compare
begin
-- Case of going by aligned double words
if ModA (OrA (Left, Right), 8) = 0 then
while Clen /= 0 loop
if W (L).all /= W (R).all then
if W (L).all > W (R).all then
return +1;
else
return -1;
end if;
end if;
Clen := Clen - 1;
L := AddA (L, 8);
R := AddA (R, 8);
end loop;
-- Case of going by unaligned double words
else
while Clen /= 0 loop
if U (L).W /= U (R).W then
if U (L).W > U (R).W then
return +1;
else
return -1;
end if;
end if;
Clen := Clen - 1;
L := AddA (L, 8);
R := AddA (R, 8);
end loop;
end if;
-- Here if common section equal, result decided by lengths
if Left_Len = Right_Len then
return 0;
elsif Left_Len > Right_Len then
return +1;
else
return -1;
end if;
end Compare_Array_S64;
end System.Compare_Array_Signed_64;
|
-- Generated by Snowball 2.2.0 - https://snowballstem.org/
package body Stemmer.Swedish is
pragma Style_Checks ("-mr");
pragma Warnings (Off, "*variable*is never read and never assigned*");
pragma Warnings (Off, "*mode could be*instead of*");
pragma Warnings (Off, "*formal parameter.*is not modified*");
pragma Warnings (Off, "*this line is too long*");
pragma Warnings (Off, "*is not referenced*");
procedure R_Other_suffix (Z : in out Context_Type; Result : out Boolean);
procedure R_Consonant_pair (Z : in out Context_Type; Result : out Boolean);
procedure R_Main_suffix (Z : in out Context_Type; Result : out Boolean);
procedure R_Mark_regions (Z : in out Context_Type; Result : out Boolean);
G_V : constant Grouping_Array (0 .. 151) := (
True, False, False, False, True, False, False, False,
True, False, False, False, False, False, True, False,
False, False, False, False, True, False, False, False,
True, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, True, True, False, False, False,
False, False, False, False, False, False, False, False,
False, False, False, False, False, True, False, False
);
G_S_ending : constant Grouping_Array (0 .. 23) := (
True, True, True, False, True, True, True, False,
True, True, True, True, True, True, True, False,
True, False, True, False, True, False, False, True
);
Among_String : constant String := "a" & "arna" & "erna" & "heterna"
& "orna" & "ad" & "e" & "ade" & "ande" & "arne" & "are" & "aste" & "en" & "anden"
& "aren" & "heten" & "ern" & "ar" & "er" & "heter" & "or" & "s" & "as" & "arnas"
& "ernas" & "ornas" & "es" & "ades" & "andes" & "ens" & "arens" & "hetens"
& "erns" & "at" & "andet" & "het" & "ast" & "dd" & "gd" & "nn" & "dt" & "gt"
& "kt" & "tt" & "ig" & "lig" & "els" & "fullt" & "löst";
A_0 : constant Among_Array_Type (0 .. 36) := (
(1, 1, -1, 1, 0),
(2, 5, 0, 1, 0),
(6, 9, 0, 1, 0),
(10, 16, 2, 1, 0),
(17, 20, 0, 1, 0),
(21, 22, -1, 1, 0),
(23, 23, -1, 1, 0),
(24, 26, 6, 1, 0),
(27, 30, 6, 1, 0),
(31, 34, 6, 1, 0),
(35, 37, 6, 1, 0),
(38, 41, 6, 1, 0),
(42, 43, -1, 1, 0),
(44, 48, 12, 1, 0),
(49, 52, 12, 1, 0),
(53, 57, 12, 1, 0),
(58, 60, -1, 1, 0),
(61, 62, -1, 1, 0),
(63, 64, -1, 1, 0),
(65, 69, 18, 1, 0),
(70, 71, -1, 1, 0),
(72, 72, -1, 2, 0),
(73, 74, 21, 1, 0),
(75, 79, 22, 1, 0),
(80, 84, 22, 1, 0),
(85, 89, 22, 1, 0),
(90, 91, 21, 1, 0),
(92, 95, 26, 1, 0),
(96, 100, 26, 1, 0),
(101, 103, 21, 1, 0),
(104, 108, 29, 1, 0),
(109, 114, 29, 1, 0),
(115, 118, 21, 1, 0),
(119, 120, -1, 1, 0),
(121, 125, -1, 1, 0),
(126, 128, -1, 1, 0),
(129, 131, -1, 1, 0));
A_1 : constant Among_Array_Type (0 .. 6) := (
(132, 133, -1, -1, 0),
(134, 135, -1, -1, 0),
(136, 137, -1, -1, 0),
(138, 139, -1, -1, 0),
(140, 141, -1, -1, 0),
(142, 143, -1, -1, 0),
(144, 145, -1, -1, 0));
A_2 : constant Among_Array_Type (0 .. 4) := (
(146, 147, -1, 1, 0),
(148, 150, 0, 1, 0),
(151, 153, -1, 1, 0),
(154, 158, -1, 3, 0),
(159, 163, -1, 2, 0));
procedure R_Mark_regions (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
v_1 : Char_Index;
begin
-- (, line 26
Z.I_P1 := Z.L;
-- test, line 29
v_1 := Z.C;
-- (, line 29
C := Skip_Utf8 (Z, 3); -- hop, line 29
if C < 0 then
Result := False;
return;
end if;
Z.C := C;
-- setmark x, line 29
Z.I_X := Z.C;
Z.C := v_1;
-- goto, line 30
Out_Grouping (Z, G_V, 97, 246, True, C); if C < 0 then
Result := False;
return;
end if;
-- gopast, line 30
-- non v, line 30
In_Grouping (Z, G_V, 97, 246, True, C);
if C < 0 then
Result := False;
return;
end if;
Z.C := Z.C + C;
-- setmark p1, line 30
Z.I_P1 := Z.C;
-- try, line 31
-- (, line 31
if not (Z.I_P1 < Z.I_X) then
goto lab2;
end if;
Z.I_P1 := Z.I_X;
<<lab2>>
Result := True;
end R_Mark_regions;
procedure R_Main_suffix (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
v_2 : Integer;
begin
-- (, line 36
if Z.C < Z.I_P1 then
Result := False;
return;
end if;
v_2 := Z.Lb; Z.Lb := Z.I_P1;
-- (, line 37
Z.Ket := Z.C; -- [, line 37
-- substring, line 37
if Z.C <= Z.Lb or else Check_Among (Z, Z.C - 1, 3, 16#1c4032#) then
Z.Lb := v_2;
Result := False;
return;
-- substring, line 37
end if;
Find_Among_Backward (Z, A_0, Among_String, null, A);
if A = 0 then
Z.Lb := v_2;
Result := False;
return;
end if;
Z.Bra := Z.C; -- ], line 37
Z.Lb := v_2;
-- among, line 38
case A is
when 1 =>
-- (, line 44
-- delete, line 44
Slice_Del (Z);
when 2 =>
-- (, line 46
In_Grouping_Backward (Z, G_S_ending, 98, 121, False, C);
if C /= 0 then
Result := False;
return;
end if;
-- delete, line 46
Slice_Del (Z);
when others =>
null;
end case;
Result := True;
end R_Main_suffix;
procedure R_Consonant_pair (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
v_2 : Integer;
v_3 : Char_Index;
begin
if Z.C < Z.I_P1 then
Result := False;
return;
end if;
v_2 := Z.Lb; Z.Lb := Z.I_P1;
-- and, line 52
v_3 := Z.L - Z.C;
-- among, line 51
if Z.C - 1 <= Z.Lb or else Check_Among (Z, Z.C - 1, 3, 16#104010#) then
Z.Lb := v_2;
Result := False;
return;
-- among, line 51
end if;
Find_Among_Backward (Z, A_1, Among_String, null, A);
if A = 0 then
Z.Lb := v_2;
Result := False;
return;
end if;
Z.C := Z.L - v_3;
-- (, line 52
Z.Ket := Z.C; -- [, line 52
-- next, line 52
C := Skip_Utf8_Backward (Z);
if C < 0 then
Z.Lb := v_2;
Result := False;
return;
end if;
Z.C := C;
Z.Bra := Z.C; -- ], line 52
-- delete, line 52
Slice_Del (Z);
Z.Lb := v_2;
Result := True;
end R_Consonant_pair;
procedure R_Other_suffix (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
v_2 : Integer;
begin
if Z.C < Z.I_P1 then
Result := False;
return;
end if;
v_2 := Z.Lb; Z.Lb := Z.I_P1;
-- (, line 55
Z.Ket := Z.C; -- [, line 56
-- substring, line 56
if Z.C - 1 <= Z.Lb or else Check_Among (Z, Z.C - 1, 3, 16#180080#) then
Z.Lb := v_2;
Result := False;
return;
-- substring, line 56
end if;
Find_Among_Backward (Z, A_2, Among_String, null, A);
if A = 0 then
Z.Lb := v_2;
Result := False;
return;
end if;
Z.Bra := Z.C; -- ], line 56
-- among, line 56
case A is
when 1 =>
-- (, line 57
-- delete, line 57
Slice_Del (Z);
when 2 =>
-- (, line 58
-- <-, line 58
Slice_From (Z, "lös");
when 3 =>
-- (, line 59
-- <-, line 59
Slice_From (Z, "full");
when others =>
null;
end case;
Z.Lb := v_2;
Result := True;
end R_Other_suffix;
procedure Stem (Z : in out Context_Type; Result : out Boolean) is
C : Result_Index;
A : Integer;
v_1 : Char_Index;
v_2 : Char_Index;
v_3 : Char_Index;
v_4 : Char_Index;
begin
-- (, line 64
-- do, line 66
v_1 := Z.C;
-- call mark_regions, line 66
R_Mark_regions (Z, Result);
Z.C := v_1;
Z.Lb := Z.C; Z.C := Z.L; -- backwards, line 67
-- (, line 67
-- do, line 68
v_2 := Z.L - Z.C;
-- call main_suffix, line 68
R_Main_suffix (Z, Result);
Z.C := Z.L - v_2;
-- do, line 69
v_3 := Z.L - Z.C;
-- call consonant_pair, line 69
R_Consonant_pair (Z, Result);
Z.C := Z.L - v_3;
-- do, line 70
v_4 := Z.L - Z.C;
-- call other_suffix, line 70
R_Other_suffix (Z, Result);
Z.C := Z.L - v_4;
Z.C := Z.Lb;
Result := True;
end Stem;
end Stemmer.Swedish;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- 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.Destroy_Link_Actions.Hash is
new AMF.Elements.Generic_Hash (UML_Destroy_Link_Action, UML_Destroy_Link_Action_Access);
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- A D A . C O N T A I N E R S . F O R M A L _ O R D E R E D _ S E T S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2004-2011, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
------------------------------------------------------------------------------
-- This spec is derived from package Ada.Containers.Bounded_Ordered_Sets in
-- the Ada 2012 RM. The modifications are to facilitate formal proofs by
-- making it easier to express properties.
-- The modifications are:
-- A parameter for the container is added to every function reading the
-- content of a container: Key, Element, Next, Query_Element, Previous,
-- Has_Element, Iterate, Reverse_Iterate. This change is motivated by the
-- need to have cursors which are valid on different containers (typically
-- a container C and its previous version C'Old) for expressing properties,
-- which is not possible if cursors encapsulate an access to the underlying
-- container. The operators "<" and ">" that could not be modified that way
-- have been removed.
-- There are three new functions:
-- function Strict_Equal (Left, Right : Set) return Boolean;
-- function Left (Container : Set; Position : Cursor) return Set;
-- function Right (Container : Set; Position : Cursor) return Set;
-- See detailed specifications for these subprograms
private with Ada.Containers.Red_Black_Trees;
private with Ada.Streams;
generic
type Element_Type is private;
with function "<" (Left, Right : Element_Type) return Boolean is <>;
with function "=" (Left, Right : Element_Type) return Boolean is <>;
package Ada.Containers.Formal_Ordered_Sets is
pragma Pure;
function Equivalent_Elements (Left, Right : Element_Type) return Boolean;
type Set (Capacity : Count_Type) is tagged private;
-- why is this commented out ???
-- pragma Preelaborable_Initialization (Set);
type Cursor is private;
pragma Preelaborable_Initialization (Cursor);
Empty_Set : constant Set;
No_Element : constant Cursor;
function "=" (Left, Right : Set) return Boolean;
function Equivalent_Sets (Left, Right : Set) return Boolean;
function To_Set (New_Item : Element_Type) return Set;
function Length (Container : Set) return Count_Type;
function Is_Empty (Container : Set) return Boolean;
procedure Clear (Container : in out Set);
procedure Assign (Target : in out Set; Source : Set);
function Copy (Source : Set; Capacity : Count_Type := 0) return Set;
function Element (Container : Set; Position : Cursor) return Element_Type;
procedure Replace_Element
(Container : in out Set;
Position : Cursor;
New_Item : Element_Type);
procedure Query_Element
(Container : in out Set;
Position : Cursor;
Process : not null access procedure (Element : Element_Type));
procedure Move (Target : in out Set; Source : in out Set);
procedure Insert
(Container : in out Set;
New_Item : Element_Type;
Position : out Cursor;
Inserted : out Boolean);
procedure Insert
(Container : in out Set;
New_Item : Element_Type);
procedure Include
(Container : in out Set;
New_Item : Element_Type);
procedure Replace
(Container : in out Set;
New_Item : Element_Type);
procedure Exclude
(Container : in out Set;
Item : Element_Type);
procedure Delete
(Container : in out Set;
Item : Element_Type);
procedure Delete
(Container : in out Set;
Position : in out Cursor);
procedure Delete_First (Container : in out Set);
procedure Delete_Last (Container : in out Set);
procedure Union (Target : in out Set; Source : Set);
function Union (Left, Right : Set) return Set;
function "or" (Left, Right : Set) return Set renames Union;
procedure Intersection (Target : in out Set; Source : Set);
function Intersection (Left, Right : Set) return Set;
function "and" (Left, Right : Set) return Set renames Intersection;
procedure Difference (Target : in out Set; Source : Set);
function Difference (Left, Right : Set) return Set;
function "-" (Left, Right : Set) return Set renames Difference;
procedure Symmetric_Difference (Target : in out Set; Source : Set);
function Symmetric_Difference (Left, Right : Set) return Set;
function "xor" (Left, Right : Set) return Set renames Symmetric_Difference;
function Overlap (Left, Right : Set) return Boolean;
function Is_Subset (Subset : Set; Of_Set : Set) return Boolean;
function First (Container : Set) return Cursor;
function First_Element (Container : Set) return Element_Type;
function Last (Container : Set) return Cursor;
function Last_Element (Container : Set) return Element_Type;
function Next (Container : Set; Position : Cursor) return Cursor;
procedure Next (Container : Set; Position : in out Cursor);
function Previous (Container : Set; Position : Cursor) return Cursor;
procedure Previous (Container : Set; Position : in out Cursor);
function Find (Container : Set; Item : Element_Type) return Cursor;
function Floor (Container : Set; Item : Element_Type) return Cursor;
function Ceiling (Container : Set; Item : Element_Type) return Cursor;
function Contains (Container : Set; Item : Element_Type) return Boolean;
function Has_Element (Container : Set; Position : Cursor) return Boolean;
procedure Iterate
(Container : Set;
Process :
not null access procedure (Container : Set; Position : Cursor));
procedure Reverse_Iterate
(Container : Set;
Process : not null access
procedure (Container : Set; Position : Cursor));
generic
type Key_Type (<>) is private;
with function Key (Element : Element_Type) return Key_Type;
with function "<" (Left, Right : Key_Type) return Boolean is <>;
package Generic_Keys is
function Equivalent_Keys (Left, Right : Key_Type) return Boolean;
function Key (Container : Set; Position : Cursor) return Key_Type;
function Element (Container : Set; Key : Key_Type) return Element_Type;
procedure Replace
(Container : in out Set;
Key : Key_Type;
New_Item : Element_Type);
procedure Exclude (Container : in out Set; Key : Key_Type);
procedure Delete (Container : in out Set; Key : Key_Type);
function Find (Container : Set; Key : Key_Type) return Cursor;
function Floor (Container : Set; Key : Key_Type) return Cursor;
function Ceiling (Container : Set; Key : Key_Type) return Cursor;
function Contains (Container : Set; Key : Key_Type) return Boolean;
procedure Update_Element_Preserving_Key
(Container : in out Set;
Position : Cursor;
Process : not null access
procedure (Element : in out Element_Type));
end Generic_Keys;
function Strict_Equal (Left, Right : Set) return Boolean;
-- Strict_Equal returns True if the containers are physically equal, i.e.
-- they are structurally equal (function "=" returns True) and that they
-- have the same set of cursors.
function Left (Container : Set; Position : Cursor) return Set;
function Right (Container : Set; Position : Cursor) return Set;
-- Left returns a container containing all elements preceding Position
-- (excluded) in Container. Right returns a container containing all
-- elements following Position (included) in Container. These two new
-- functions can be used to express invariant properties in loops which
-- iterate over containers. Left returns the part of the container already
-- scanned and Right the part not scanned yet.
private
pragma Inline (Next);
pragma Inline (Previous);
type Node_Type is record
Has_Element : Boolean := False;
Parent : Count_Type := 0;
Left : Count_Type := 0;
Right : Count_Type := 0;
Color : Red_Black_Trees.Color_Type;
Element : Element_Type;
end record;
package Tree_Types is
new Red_Black_Trees.Generic_Bounded_Tree_Types (Node_Type);
type Set (Capacity : Count_Type) is
new Tree_Types.Tree_Type (Capacity) with null record;
use Red_Black_Trees;
use Ada.Streams;
type Set_Access is access all Set;
for Set_Access'Storage_Size use 0;
type Cursor is record
Node : Count_Type;
end record;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Cursor);
for Cursor'Write use Write;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Cursor);
for Cursor'Read use Read;
No_Element : constant Cursor := (Node => 0);
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Container : Set);
for Set'Write use Write;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Container : out Set);
for Set'Read use Read;
Empty_Set : constant Set := (Capacity => 0, others => <>);
end Ada.Containers.Formal_Ordered_Sets;
|
--------------------------------------------------------------------------------
-- MIT License
--
-- Copyright (c) 2020 Zane Myers
--
-- Permission is hereby granted, free of charge, to any person obtaining a copy
-- of this software and associated documentation files (the "Software"), to deal
-- in the Software without restriction, including without limitation the rights
-- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-- copies of the Software, and to permit persons to whom the Software is
-- furnished to do so, subject to the following conditions:
--
-- The above copyright notice and this permission notice shall be included in all
-- copies or substantial portions of the Software.
--
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-- SOFTWARE.
--------------------------------------------------------------------------------
with Vulkan.Math.GenFType;
with Vulkan.Math.GenDType;
use Vulkan.Math.GenFType;
use Vulkan.Math.GenDType;
--------------------------------------------------------------------------------
--< @group Vulkan Math Functions
--------------------------------------------------------------------------------
--< @summary
--< This package provides GLSL Exponential Built-in functions.
--<
--< @description
--< All exponential functions operate component-wise on vectors.
--------------------------------------------------------------------------------
package Vulkan.Math.Exponential is
pragma Preelaborate;
pragma Pure;
----------------------------------------------------------------------------
--< @summary
--< Compute x raised to the y power.
--<
--< @description
--< Compute x raised to the y power for double precision floating point
--< numbers.
--<
--< @param x
--< The value that is raised to a power
--<
--< @param y
--< The power that 'x' is raised to.
--<
--< @return
--< The result of (x ** y).
----------------------------------------------------------------------------
function Pow (x, y : in Vkm_Double) return Vkm_Double
renames VKM_DBL_NEF."**";
----------------------------------------------------------------------------
--< @summary
--< Compute x raised to the y power, component-wise.
--<
--< @description
--< Compute x raised to the y power component-wise for two GenFType vectors
--< of the same length.
----------------------------------------------------------------------------
function Pow is new GFT.Apply_Func_IV_IV_RV("**");
----------------------------------------------------------------------------
--< @summary
--< Compute x raised to the y power, component-wise.
--<
--< @description
--< Compute x raised to the y power component-wise for two GenDType vectors
--< of the same length.
----------------------------------------------------------------------------
function Pow is new GDT.Apply_Func_IV_IV_RV(Pow);
----------------------------------------------------------------------------
--< @summary
--< Computes the natural exponentiation of x, component-wise.
--<
--< @description
--< Computes the component-wise natural exponentiation of x, e^x for a
--< GenFType vector.
----------------------------------------------------------------------------
function Exp is new GFT.Apply_Func_IV_RV(Exp);
----------------------------------------------------------------------------
--< @summary
--< Computes the natural logarithm of x.
--<
--< @description
--< Computes the natural logarithm of x, which satisfies equation x=e^y, for
--< a single precision floating point number.
--<
--< @param x
--< The value 'x'.
--<
--< @return
--< The result of ln(x).
----------------------------------------------------------------------------
function Log (x : in Vkm_Float) return Vkm_Float
renames VKM_FLT_NEF.Log;
----------------------------------------------------------------------------
--< @summary
--< Computes the natural logarithm of x, component-wise.
--<
--< @description
--< Computes the natural logarithm of x, which satisfies equation x=e^y, for
--< a GenFType vector.
----------------------------------------------------------------------------
function Log is new GFT.Apply_Func_IV_RV(Log);
----------------------------------------------------------------------------
--< @summary
--< Computes the binary exponentiation of x, 2^x.
--<
--< @description
--< Computes 2 raised to the x power, 2^x, for a single precision floating
--< point number.
--<
--< @param x
--< The value 'x'.
--<
--< @return
--< The result of 2^x.
----------------------------------------------------------------------------
function Exp2 (x : in Vkm_Float) return Vkm_Float is
(Exp( LN2 * x)) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Computes the binary exponentiation of x, component-wise.
--<
--< @description
--< Computes 2 raised to the x power, 2^x, for a GenFType vector.
----------------------------------------------------------------------------
function Exp2 is new GFT.Apply_Func_IV_RV(Exp2);
----------------------------------------------------------------------------
--< @summary
--< Computes log base 2 of x.
--<
--< @description
--< Computes log base 2 of x, finding the value y which satisfies y = 2^x, for
--< a single precision floating point number.
--<
--< @param x
--< The value 'x'.
--<
--< @returns y = 2^x.
--<
--< @error
--< Results are undefined for x <= 0.
----------------------------------------------------------------------------
function Log2 (x : in Vkm_Float) return Vkm_Float is
(Exp(x) / LN2) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Computes log base 2 of x, component-wise.
--<
--< @description
--< Computes the component-wise log base 2 of x, finding the value y which
--< satisfies y = 2^x, for a GenFType vector.
----------------------------------------------------------------------------
function Log2 is new GFT.Apply_Func_IV_RV(Log2);
----------------------------------------------------------------------------
--< @summary
--< Computes the square root of x.
--<
--< @description
--< Computes the square root of x for a single-precision floating point
--< number.
--<
--< @param x
--< The value 'x'
--<
--< @return
--< The result of sqrt(x)
----------------------------------------------------------------------------
function Sqrt (x : in Vkm_Float ) return Vkm_Float
renames VKM_FLT_NEF.Sqrt;
----------------------------------------------------------------------------
--< @summary
--< Computes the square root of x.
--<
--< @description
--< Computes the square root of x for a double-precision floating point
--< number.
--<
--< @param x
--< The value 'x'
--<
--< @return
--< The result of sqrt(x)
----------------------------------------------------------------------------
function Sqrt (x : in Vkm_Double) return Vkm_Double
renames VKM_DBL_NEF.Sqrt;
----------------------------------------------------------------------------
--< @summary
--< Computes the square root of x, component-wise.
--<
--< @description
--< Computes the component-wise square root of x for a GenFType vector.
----------------------------------------------------------------------------
function Sqrt is new GFT.Apply_Func_IV_RV(Sqrt);
----------------------------------------------------------------------------
--< @summary
--< Computes the square root of x, component-wise.
--<
--< @description
--< Computes the component-wise square root of x for a GenDType vector.
----------------------------------------------------------------------------
function Sqrt is new GDT.Apply_Func_IV_RV(Sqrt);
----------------------------------------------------------------------------
--< @summary
--< Computes the inverse square root of x.
--<
--< @description
--< Computes the inverse square root of x for a single precision floating point
--< number:
--< y = 1/sqrt(x)
--<
--< @param x
--< The value 'x'
--<
--< @return
--< The inverse square root of x.
----------------------------------------------------------------------------
function Inverse_Sqrt(x : in Vkm_Float ) return Vkm_Float is
(1.0 / Sqrt(x)) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Computes the inverse square root of x.
--<
--< @description
--< Computes the inverse square root of x for a double precision floating point
--< number:
--< y = 1/sqrt(x)
--<
--< @param x
--< The value 'x'
--<
--< @return
--< The inverse square root of x.
----------------------------------------------------------------------------
function Inverse_Sqrt(x : in Vkm_Double) return Vkm_Double is
(1.0 / Sqrt(x)) with Inline;
----------------------------------------------------------------------------
--< @summary
--< Computes the inverse square root of x, component-wise.
--<
--< @description
--< Computes the component-wise inverse square root of x for a GenFType vector.
----------------------------------------------------------------------------
function Inverse_Sqrt is new GFT.Apply_Func_IV_RV(Inverse_Sqrt);
----------------------------------------------------------------------------
--< @summary
--< Computes the inverse square root of x, component-wise.
--<
--< @description
--< Computes the component-wise inverse square root of x for a GenDType vector.
----------------------------------------------------------------------------
function Inverse_Sqrt is new GDT.Apply_Func_IV_RV(Inverse_Sqrt);
end Vulkan.Math.Exponential;
|
-- Copyright 2012-2017 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package body Pck is
procedure Do_Nothing is
begin
null;
end Do_Nothing;
end Pck;
|
-- $Header: /cf/ua/arcadia/alex-ayacc/ayacc/src/RCS/source_file_body.a,v 1.1 88/08/08 14:29:03 arcadia Exp $
-- Copyright (c) 1990 Regents of the University of California.
-- All rights reserved.
--
-- The primary authors of ayacc were David Taback and Deepak Tolani.
-- Enhancements were made by Ronald J. Schmalz.
--
-- Send requests for ayacc information to ayacc-info@ics.uci.edu
-- Send bug reports for ayacc to ayacc-bugs@ics.uci.edu
--
-- 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.
-- Module : source_file_body.ada
-- Component of : ayacc
-- Version : 1.2
-- Date : 11/21/86 12:36:09
-- SCCS File : disk21~/rschm/hasee/sccs/ayacc/sccs/sxsource_file_body.ada
-- $Header: /cf/ua/arcadia/alex-ayacc/ayacc/src/RCS/source_file_body.a,v 1.1 88/08/08 14:29:03 arcadia Exp $
-- $Log: source_file_body.a,v $
--Revision 1.1 88/08/08 14:29:03 arcadia
--Initial revision
--
-- Revision 0.1 86/04/01 15:12:32 ada
-- This version fixes some minor bugs with empty grammars
-- and $$ expansion. It also uses vads5.1b enhancements
-- such as pragma inline.
--
--
-- Revision 0.0 86/02/19 18:42:02 ada
--
-- These files comprise the initial version of Ayacc
-- designed and implemented by David Taback and Deepak Tolani.
-- Ayacc has been compiled and tested under the Verdix Ada compiler
-- version 4.06 on a vax 11/750 running Unix 4.2BSD.
--
with Text_IO, Ayacc_File_Names;
use Text_IO;
package body Source_File is
SCCS_ID : constant String := "@(#) source_file_body.ada, Version 1.2";
Rcs_ID : constant String := "$Header: /cf/ua/arcadia/alex-ayacc/ayacc/src/RCS/source_file_body.a,v 1.1 88/08/08 14:29:03 arcadia Exp $";
Input_File : File_Type;
Max_Line_Length : constant := 260;
type Long_STR is
record
Name : String(1..Max_Line_Length);
Length : Natural := 0;
end record;
Current_Line : Long_STR;
Previous_Line : Long_STR;
Column_Number : Natural; -- column number of current_line.
Line_Number : Natural;
Get_New_Line : Boolean := True;
End_of_Source_File : Boolean := False;
procedure Open is
use Ayacc_File_Names;
begin
Open(Input_File, In_File, Get_Source_File_Name);
Current_Line := ((others => ' '), 0);
Previous_Line := ((others => ' '), 0);
Column_Number := 1;
Line_Number := 0;
exception
when Name_Error | Use_Error =>
Put_Line("Ayacc: Error Opening """ & Get_Source_File_Name & """.");
raise;
end Open;
procedure Close is
begin
Close(Input_File);
end Close;
function Is_End_of_File return Boolean is
begin
return End_of_File(Input_File);
end Is_End_of_File;
function Source_Line_Number return Natural is
begin
return Line_Number;
end Source_Line_Number;
function Maximum_Line_Length return Natural is
begin
return Max_Line_Length;
end Maximum_Line_Length;
procedure Get_Char(Ch: out Character) is
begin
if Get_New_Line then
Previous_Line := Current_Line;
Get_Line(Input_File, Current_Line.Name, Current_Line.Length);
Get_New_Line := False;
Column_Number := 1;
Line_Number := Line_Number + 1;
end if;
if Column_Number > Current_Line.Length then
if End_of_File(Input_File) then
Ch := Eof;
End_of_Source_File := True;
return;
end if;
Ch := Eoln;
Get_New_Line := True;
else
Ch := Current_Line.Name(Column_Number);
Column_Number := Column_Number + 1;
end if;
end Get_Char;
-- Note: You can't correctly peek at next character if the last character
-- read is a EOLN. It is assumed that the lexical analyzer won't
-- call this function in that case.
function Peek_Next_Char return Character is
begin
if Column_Number > Current_Line.Length then
if End_of_File(Input_File) then
return Eof;
else
return Eoln;
end if;
end if;
return Current_Line.Name(Column_Number);
end Peek_Next_Char;
procedure Unget_Char(Ch : in Character) is
begin
if Get_New_Line then
Get_New_Line := False;
elsif End_of_Source_File then
End_of_Source_File := False;
elsif Column_Number = 1 then
Put_Line("Ayacc: Error in Unget_Char, Attempt to 'unget' an EOLN");
raise Pushback_Error;
else
Column_Number := Column_Number - 1;
end if;
end Unget_Char;
procedure Print_Context_Lines is
Ptr_Location : Integer := 0;
begin
-- Print previous line followed by current line --
Put(Integer'Image(Line_Number-1) & Ascii.Ht);
Put_Line(Previous_Line.Name(1..Previous_Line.Length));
Put(Integer'Image(Line_Number) & Ascii.Ht);
Put_Line(Current_Line.Name(1..Current_Line.Length));
-- Correct for any tab characters so that the pointer will
-- point to the proper location on the source line.
for I in 1..Column_Number - 1 loop
if Current_Line.Name(I) = Ascii.Ht then -- Adjust for tab.
Ptr_Location := (((Ptr_Location / 8) + 1) * 8);
else
Ptr_Location := Ptr_Location + 1;
end if;
end loop;
Put(Ascii.Ht);
for I in 1..Ptr_Location - 1 loop
Put('-');
end loop;
Put('^');
end Print_Context_Lines;
procedure Read_Line(Source_Line: out String; Last: out Natural) is
begin
Get_Line(Input_File, Source_Line, Last);
Line_Number := Line_Number + 1;
end Read_Line;
end Source_File;
|
-----------------------------------------------------------------------
-- mat-events-targets - Events received and collected from a target
-- Copyright (C) 2014, 2015 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Unchecked_Deallocation;
package body MAT.Events.Targets is
ITERATE_COUNT : constant Event_Id_Type := 10_000;
-- ------------------------------
-- Add the event in the list of events and increment the event counter.
-- Update the event instance to allocate the event Id.
-- ------------------------------
procedure Insert (Target : in out Target_Events;
Event : in out Target_Event_Type) is
begin
Target.Events.Insert (Event);
Util.Concurrent.Counters.Increment (Target.Event_Count);
end Insert;
-- ------------------------------
-- Update the Size and Prev_Id information in the event identified by <tt>Id</tt>.
-- Update the event represented by <tt>Prev_Id</tt> so that its Next_Id refers
-- to the <tt>Id</tt> event.
-- ------------------------------
procedure Update_Event (Target : in out Target_Events;
Id : in Event_Id_Type;
Size : in MAT.Types.Target_Size;
Prev_Id : in Event_Id_Type) is
begin
Target.Events.Update_Event (Id, Size, Prev_Id);
end Update_Event;
procedure Get_Events (Target : in out Target_Events;
Start : in MAT.Types.Target_Time;
Finish : in MAT.Types.Target_Time;
Into : in out MAT.Events.Tools.Target_Event_Vector) is
begin
Target.Events.Get_Events (Start, Finish, Into);
end Get_Events;
-- ------------------------------
-- Get the start and finish time for the events that have been received.
-- ------------------------------
procedure Get_Time_Range (Target : in out Target_Events;
Start : out MAT.Types.Target_Time;
Finish : out MAT.Types.Target_Time) is
begin
Target.Events.Get_Time_Range (Start, Finish);
end Get_Time_Range;
-- ------------------------------
-- Get the first and last event that have been received.
-- ------------------------------
procedure Get_Limits (Target : in out Target_Events;
First : out Target_Event_Type;
Last : out Target_Event_Type) is
begin
Target.Events.Get_Limits (First, Last);
end Get_Limits;
-- ------------------------------
-- Get the probe event with the given allocated unique id.
-- ------------------------------
function Get_Event (Target : in Target_Events;
Id : in Event_Id_Type) return Target_Event_Type is
begin
return Target.Events.Get_Event (Id);
end Get_Event;
-- ------------------------------
-- Get the current event counter.
-- ------------------------------
function Get_Event_Counter (Target : in Target_Events) return Integer is
begin
return Util.Concurrent.Counters.Value (Target.Event_Count);
end Get_Event_Counter;
-- ------------------------------
-- Iterate over the events starting from the <tt>Start</tt> event and until the
-- <tt>Finish</tt> event is found (inclusive). Execute the <tt>Process</tt> procedure
-- with each event instance.
-- ------------------------------
procedure Iterate (Target : in out Target_Events;
Start : in Event_Id_Type;
Finish : in Event_Id_Type;
Process : access procedure (Event : in Target_Event_Type)) is
begin
Target.Events.Iterate (Start, Finish, Process);
end Iterate;
-- ------------------------------
-- Iterate over the events starting from first first event up to the last event collected.
-- Execute the <tt>Process</tt> procedure with each event instance.
-- ------------------------------
procedure Iterate (Target : in out Target_Events;
Process : access procedure (Event : in Target_Event_Type)) is
First_Event : Target_Event_Type;
Last_Event : Target_Event_Type;
First_Id : Event_Id_Type;
begin
Target.Get_Limits (First_Event, Last_Event);
First_Id := First_Event.Id;
while First_Id < Last_Event.Id loop
-- Iterate over the events in groups of 10_000 to release the lock and give some
-- opportunity to the server thread to add new events.
Target.Iterate (Start => First_Id,
Finish => First_Id + ITERATE_COUNT,
Process => Process);
First_Id := First_Id + ITERATE_COUNT;
end loop;
end Iterate;
-- ------------------------------
-- Release the storage allocated for the events.
-- ------------------------------
overriding
procedure Finalize (Target : in out Target_Events) is
begin
Target.Events.Clear;
end Finalize;
protected body Event_Collector is
procedure Update (Id : in Event_Id_Type;
Process : not null access procedure (Event : in out Target_Event_Type));
-- ------------------------------
-- Internal operation to update the event represented by <tt>Id</tt>.
-- ------------------------------
procedure Update (Id : in Event_Id_Type;
Process : not null access procedure (Event : in out Target_Event_Type)) is
Iter : constant Event_Id_Cursor := Ids.Floor (Id);
Block : Event_Block_Access;
Pos : Event_Id_Type;
begin
if Event_Id_Maps.Has_Element (Iter) then
Block := Event_Id_Maps.Element (Iter);
Pos := Id - Block.Events (Block.Events'First).Id + Block.Events'First;
if Pos <= Block.Count then
Process (Block.Events (Pos));
end if;
end if;
end Update;
-- ------------------------------
-- Update the Size and Prev_Id information in the event identified by <tt>Id</tt>.
-- Update the event represented by <tt>Prev_Id</tt> so that its Next_Id refers
-- to the <tt>Id</tt> event.
-- ------------------------------
procedure Update_Event (Id : in Event_Id_Type;
Size : in MAT.Types.Target_Size;
Prev_Id : in Event_Id_Type) is
procedure Update_Size (Event : in out Target_Event_Type);
procedure Update_Next (Event : in out Target_Event_Type);
procedure Update_Size (Event : in out Target_Event_Type) is
begin
if Event.Index = MSG_REALLOC then
Event.Old_Size := Size;
else
Event.Size := Size;
end if;
Event.Prev_Id := Prev_Id;
end Update_Size;
procedure Update_Next (Event : in out Target_Event_Type) is
begin
Event.Next_Id := Id;
end Update_Next;
begin
Update (Id, Update_Size'Access);
Update (Prev_Id, Update_Next'Access);
end Update_Event;
-- ------------------------------
-- Add the event in the list of events.
-- Update the event instance to allocate the event Id.
-- ------------------------------
procedure Insert (Event : in out Target_Event_Type) is
begin
if Current = null then
Current := new Event_Block;
Current.Start := Event.Time;
Events.Insert (Event.Time, Current);
Ids.Insert (Last_Id, Current);
end if;
Event.Id := Last_Id;
Current.Count := Current.Count + 1;
Current.Events (Current.Count) := Event;
Last_Id := Last_Id + 1;
Current.Finish := Event.Time;
if Current.Count = Current.Events'Last then
Current := null;
end if;
end Insert;
procedure Get_Events (Start : in MAT.Types.Target_Time;
Finish : in MAT.Types.Target_Time;
Into : in out MAT.Events.Tools.Target_Event_Vector) is
Iter : Event_Cursor := Events.Floor (Start);
Block : Event_Block_Access;
begin
while Event_Maps.Has_Element (Iter) loop
Block := Event_Maps.Element (Iter);
exit when Block.Start > Finish;
for I in Block.Events'First .. Block.Count loop
exit when Block.Events (I).Time > Finish;
if Block.Events (I).Time >= Start then
Into.Append (Block.Events (I));
end if;
end loop;
Event_Maps.Next (Iter);
end loop;
end Get_Events;
-- ------------------------------
-- Get the start and finish time for the events that have been received.
-- ------------------------------
procedure Get_Time_Range (Start : out MAT.Types.Target_Time;
Finish : out MAT.Types.Target_Time) is
First : constant Event_Block_Access := Events.First_Element;
Last : constant Event_Block_Access := Events.Last_Element;
begin
Start := First.Events (First.Events'First).Time;
Finish := Last.Events (Last.Count).Time;
end Get_Time_Range;
-- ------------------------------
-- Get the first and last event that have been received.
-- ------------------------------
procedure Get_Limits (First : out Target_Event_Type;
Last : out Target_Event_Type) is
First_Block : constant Event_Block_Access := Events.First_Element;
Last_Block : constant Event_Block_Access := Events.Last_Element;
begin
First := First_Block.Events (First_Block.Events'First);
Last := Last_Block.Events (Last_Block.Count);
end Get_Limits;
-- ------------------------------
-- Get the probe event with the given allocated unique id.
-- ------------------------------
function Get_Event (Id : in Event_Id_Type) return Target_Event_Type is
Iter : Event_Id_Cursor := Ids.Floor (Id);
Block : Event_Block_Access;
Pos : Event_Id_Type;
begin
while Event_Id_Maps.Has_Element (Iter) loop
Block := Event_Id_Maps.Element (Iter);
exit when Id < Block.Events (Block.Events'First).Id;
Pos := Id - Block.Events (Block.Events'First).Id + Block.Events'First;
if Pos <= Block.Count then
return Block.Events (Pos);
end if;
Event_Id_Maps.Next (Iter);
end loop;
raise MAT.Events.Tools.Not_Found;
end Get_Event;
-- ------------------------------
-- Iterate over the events starting from the <tt>Start</tt> event and until the
-- <tt>Finish</tt> event is found (inclusive). Execute the <tt>Process</tt> procedure
-- with each event instance.
-- ------------------------------
procedure Iterate (Start : in Event_Id_Type;
Finish : in Event_Id_Type;
Process : access procedure (Event : in Target_Event_Type)) is
Iter : Event_Id_Cursor := Ids.Floor (Start);
Block : Event_Block_Access;
Pos : Event_Id_Type;
Id : Event_Id_Type := Start;
begin
-- First, find the block and position of the first event.
while Event_Id_Maps.Has_Element (Iter) loop
Block := Event_Id_Maps.Element (Iter);
exit when Id < Block.Events (Block.Events'First).Id;
Pos := Id - Block.Events (Block.Events'First).Id + Block.Events'First;
if Start <= Finish then
if Pos <= Block.Count then
-- Second, iterate over the events moving to the next event block
-- until we reach the last event.
loop
Process (Block.Events (Pos));
exit when Id > Finish;
Pos := Pos + 1;
Id := Id + 1;
if Pos > Block.Count then
Event_Id_Maps.Next (Iter);
exit when not Event_Id_Maps.Has_Element (Iter);
Block := Event_Id_Maps.Element (Iter);
Pos := Block.Events'First;
end if;
end loop;
end if;
Event_Id_Maps.Next (Iter);
else
if Pos <= Block.Count then
-- Second, iterate over the events moving to the next event block
-- until we reach the last event.
loop
Process (Block.Events (Pos));
exit when Id <= Finish;
Id := Id - 1;
if Pos = Block.Events'First then
Event_Id_Maps.Previous (Iter);
exit when not Event_Id_Maps.Has_Element (Iter);
Block := Event_Id_Maps.Element (Iter);
Pos := Block.Count;
else
Pos := Pos - 1;
end if;
end loop;
end if;
Event_Id_Maps.Previous (Iter);
end if;
end loop;
end Iterate;
-- ------------------------------
-- Clear the events.
-- ------------------------------
procedure Clear is
procedure Free is
new Ada.Unchecked_Deallocation (Event_Block, Event_Block_Access);
begin
while not Events.Is_Empty loop
declare
Block : Event_Block_Access := Events.First_Element;
begin
Free (Block);
Events.Delete_First;
end;
end loop;
Current := null;
Last_Id := 0;
Ids.Clear;
end Clear;
end Event_Collector;
end MAT.Events.Targets;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- SQL Database Access --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- 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: 1793 $ $Date: 2011-06-11 10:40:44 +0300 (Сб, 11 июн 2011) $
------------------------------------------------------------------------------
-- This package provides implementation of Query abstraction for Firebird.
------------------------------------------------------------------------------
with Ada.Containers.Vectors;
with Ada.Finalization;
with League.Text_Codecs;
with Matreshka.Internals.SQL_Drivers.Firebird.Fields;
package Matreshka.Internals.SQL_Drivers.Firebird.Records is
type Sqlda_Buffer is array (Positive range <>) of aliased Isc_Long;
type Sqlda_Buffer_Access is access all Sqlda_Buffer;
type Isc_Sqlda_Access is access all Isc_Sqlda;
pragma No_Strict_Aliasing (Isc_Sqlda_Access);
package Fields_Containers is
new Ada.Containers.Vectors
(Isc_Valid_Field_Index, Fields.Field_Access, "=" => Fields."=");
type Sql_Record is new Ada.Finalization.Controlled with record
Cnt : Isc_Field_Index := 0; -- reserved data length
Size : Isc_Field_Index := 0; -- real used data
Sqlda_Buf : Sqlda_Buffer_Access := null;
Sqlda : Isc_Sqlda_Access := null;
Fields : Fields_Containers.Vector;
Codec : access League.Text_Codecs.Text_Codec;
Utf : Boolean;
end record;
overriding procedure Finalize (Self : in out Sql_Record);
procedure Count (Self : in out Sql_Record; Value : Isc_Field_Index);
procedure Free_Fields (Self : in out Sql_Record);
procedure Init (Self : in out Sql_Record);
procedure Clear_Values (Self : in out Sql_Record);
end Matreshka.Internals.SQL_Drivers.Firebird.Records;
|
-- 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 Index_Type is (<>);
with function Before (Left, Right : Index_Type) return Boolean;
with procedure Swap (Left, Right : in Index_Type);
procedure Ada.Containers.Generic_Sort
(First, Last : Index_Type'Base);
pragma Pure(Ada.Containers.Generic_Sort);
|
with Ada.Assertions; use Ada.Assertions;
with Libadalang.Common; use Libadalang.Common;
package body Rewriters_Context_Utils is
function Combine_Contexts (C1, C2 : Ada_Node) return Ada_Node
is
begin
if Is_Reflexive_Ancestor (C1, C2)
then
return C1;
else
Assert (Check => Is_Reflexive_Ancestor (C2, C1),
Message => "Unexpectedly, contexts don't share same node.");
return C2;
end if;
end Combine_Contexts;
function To_Supported_Context (C : Ada_Node) return Ada_Node
is
begin
-- workaround for https://gt3-prod-1.adacore.com/#/tickets/UB17-030
-- solved in libadalang version 23.0 and higher
case C.Kind is
when Ada_While_Loop_Spec | Ada_Elsif_Stmt_Part_List =>
return C.Parent;
when Ada_Case_Stmt_Alternative | Ada_Elsif_Stmt_Part =>
return C.Parent.Parent;
when others =>
return C;
end case;
end To_Supported_Context;
end Rewriters_Context_Utils;
|
with Ada.Text_Io; use Ada.Text_Io;
with Ada.Integer_Text_Io; use Ada.Integer_Text_Io;
with Ada.Io_Exceptions;
with Ada.Text_Io.Bounded_Io;
with Arbre_Genealogique; use Arbre_Genealogique;
with Date; use Date;
procedure Main is
-- On utilise des chaines de taille variable
package Ada_Strings_Io is new Ada.Text_Io.Bounded_Io (Sb);
use Ada_Strings_Io;
type T_Menu is
(Menu_Principal, Menu_Registre, Menu_Registre_Consultation_Selection,
Menu_Registre_Consultation_Personne,
Menu_Registre_Consultation_Recherche, Menu_Registre_Ajout,
Menu_Registre_Modification, Menu_Arbre_Selection,
Menu_Arbre_Consultation, Menu_Arbre_Ajouter_Relation,
Menu_Arbre_Supprimer_Relation, Menu_Arbre_Parente, Menu_Statistiques,
Quitter);
-- Etat global du programme
type T_Etat is record
Arbre : T_Arbre_Genealogique;
Cle : Integer;
Menu : T_Menu;
end record;
-- Affiche la phrase "Votre choix [1, 2, ... `Nb_Choix`]"
-- et capture la saisie de l'utilisateur dans `Choix`.
procedure Choisir (Nb_Choix : in Integer; Choix : out Integer) is
procedure Afficher_Liste_Choix is
begin
for I in 1 .. Nb_Choix - 2 loop
Put (I, 0);
Put (", ");
end loop;
Put (Nb_Choix - 1, 0);
Put (" ou ");
Put (Nb_Choix - 0, 0);
end Afficher_Liste_Choix;
Correct : Boolean := False;
-- Premiere_Entree : Boolean := True;
begin
while not Correct loop
Put ("Votre choix [");
Afficher_Liste_Choix;
-- Fonctionnalité desactivée :
--if not Premiere_Entree then
-- Put (" / 0 pour quitter");
--end if;
Put ("] : ");
begin
Get (Choix);
Correct := Choix in 1 .. Nb_Choix;
--Correct := Choix in 0 .. Nb_Choix;
exception
when Ada.Io_Exceptions.Data_Error =>
Correct := False;
end;
Skip_Line;
if not Correct then
Put_Line ("Choix incorrect.");
New_Line;
end if;
-- Premiere_Entree := False;
end loop;
end Choisir;
-- Permet de choisir un entier positif ou nul de facon robuste.
procedure Choisir_Cle (Cle : out Integer) is
Correct : Boolean := False;
Premiere_Entree : Boolean := True;
begin
while not Correct loop
Put ("Votre choix");
if not Premiere_Entree then
Put (" [0 pour retour]");
end if;
Put (" : ");
begin
Get (Cle);
Correct := Cle >= 0;
exception
-- Si la valeur entrée n'est pas un entier
when Ada.Io_Exceptions.Data_Error =>
Correct := False;
end;
Skip_Line;
if not Correct then
Put_Line ("Clé incorrecte.");
New_Line;
end if;
Premiere_Entree := False;
end loop;
end Choisir_Cle;
-- Affiche le menu principal.
procedure Afficher_Menu_Principal (Etat : in out T_Etat) is
Choix : Integer;
begin
Put_Line ("**********************");
Put_Line ("* Arbre Généalogique *");
Put_Line ("**********************");
New_Line;
Put_Line ("Menu principal :");
Put_Line ("1. Accéder au registre");
Put_Line ("2. Accéder a un arbre généalogique");
Put_Line ("3. Statistiques");
Put_Line ("4. Quitter");
New_Line;
Choisir (4, Choix);
New_Line;
case Choix is
when 1 =>
Etat.Menu := Menu_Registre;
when 2 =>
Etat.Menu := Menu_Arbre_Selection;
when 3 =>
Etat.Menu := Menu_Statistiques;
when others =>
Etat.Menu := Quitter;
end case;
end Afficher_Menu_Principal;
-- Affiche le menu du registre.
procedure Afficher_Menu_Registre (Etat : in out T_Etat) is
Choix : Integer;
begin
Put_Line ("* Registre *");
New_Line;
Put_Line ("Menu :");
Put_Line ("1. Consulter une personne a partir de sa clé");
Put_Line ("2. Chercher une personne a partir de son nom");
Put_Line ("3. Ajouter une personne");
Put_Line ("4. Retour");
New_Line;
Choisir (4, Choix);
New_Line;
case Choix is
when 1 =>
Etat.Menu := Menu_Registre_Consultation_Selection;
when 2 =>
Etat.Menu := Menu_Registre_Consultation_Recherche;
when 3 =>
Etat.Menu := Menu_Registre_Ajout;
when 4 =>
Etat.Menu := Menu_Principal;
when others =>
Etat.Menu := Quitter;
end case;
end Afficher_Menu_Registre;
-- Affiche toutes les informations d'une personne.
procedure Afficher_Personne (Cle : in Integer; Personne : in T_Personne) is
begin
Put ("<");
Put (Cle, 0);
Put (">");
New_Line;
Put (Personne.Nom_Usuel);
New_Line;
Put (" * Nom complet : ");
Put (Personne.Nom_Complet);
New_Line;
Put (" * Sexe : ");
Put (T_Genre'Image (Personne.Genre));
New_Line;
Put (" * Né le ");
Put (Personne.Date_De_Naissance.Jour, 0);
Put (" ");
Put (T_Mois'Image (Personne.Date_De_Naissance.Mois));
Put (" ");
Put (Personne.Date_De_Naissance.Annee, 0);
Put (" a ");
Put (Personne.Lieu_De_Naissance);
New_Line;
end Afficher_Personne;
procedure Afficher_Nom_Usuel (Etat : in T_Etat; Cle : in Integer) is
Personne : T_Personne;
begin
Personne := Lire_Registre (Etat.Arbre, Cle);
Put (Personne.Nom_Usuel);
Put (" <");
Put (Cle, 0);
Put (">");
end Afficher_Nom_Usuel;
-- Affiche le menu qui permet de choisir une personne a consulter dans le registre.
procedure Afficher_Menu_Registre_Consultation_Selection
(Etat : in out T_Etat)
is
Cle : Integer;
Correct : Boolean;
begin
Correct := False;
while not Correct loop
Put_Line
("Entrez la clé de la personne que vous voulez consulter [0 pour retour].");
Choisir_Cle (Cle);
Correct := Cle = 0 or else Existe_Registre (Etat.Arbre, Cle);
if not Correct then
Put_Line ("Clé inconnue.");
New_Line;
end if;
end loop;
New_Line;
if Cle = 0 then
Etat.Menu := Menu_Registre;
else
Etat.Cle := Cle;
Etat.Menu := Menu_Registre_Consultation_Personne;
end if;
end Afficher_Menu_Registre_Consultation_Selection;
-- Affiche les résultats de la recherche.
procedure Afficher_Resultats (Etat : in out T_Etat; Recherche : in String)
is
Nombre_Resultats : Integer := 0;
procedure Tester_Personne (Cle : in Integer; Personne : in T_Personne) is
begin
if Sb.Index (Personne.Nom_Usuel, Recherche) > 0
or else Sb.Index (Personne.Nom_Complet, Recherche) > 0
then
Nombre_Resultats := Nombre_Resultats + 1;
Put (" * ");
Put (Personne.Nom_Usuel);
Put (" <");
Put (Cle, 0);
Put (">");
New_Line;
end if;
end Tester_Personne;
procedure Rechercher is new Appliquer_Sur_Registre (Tester_Personne);
begin
Put_Line ("Résultats de la recherche :");
Rechercher (Etat.Arbre);
if Nombre_Resultats = 0 then
Put_Line ("Aucun résultat.");
Etat.Menu := Menu_Registre;
else
Etat.Menu := Menu_Registre_Consultation_Selection;
end if;
New_Line;
end Afficher_Resultats;
-- Affiche le menu qui permet de rechercher dans le registre.
procedure Afficher_Menu_Registre_Consultation_Recherche
(Etat : in out T_Etat)
is
Recherche : Sb.Bounded_String;
begin
Put_Line ("* Recherche dans le registre *");
New_Line;
Put ("Nom a rechercher [Entrée pour retour] : ");
Recherche := Get_Line;
New_Line;
if Sb.Length (Recherche) > 0 then
Afficher_Resultats (Etat, Sb.To_String (Recherche));
else
Etat.Menu := Menu_Registre;
end if;
end Afficher_Menu_Registre_Consultation_Recherche;
-- Affiche le menu des possibilités pour une personne du registre.
procedure Afficher_Menu_Registre_Consultation_Personne
(Etat : in out T_Etat)
is
Personne : T_Personne;
Choix : Integer;
begin
Personne := Lire_Registre (Etat.Arbre, Etat.Cle);
Afficher_Personne (Etat.Cle, Personne);
New_Line;
Put_Line ("Menu : ");
Put_Line ("1. Consulter son arbre généalogique");
Put_Line ("2. Modifier les informations");
Put_Line ("3. Retour");
New_Line;
Choisir (3, Choix);
New_Line;
case Choix is
when 1 =>
Etat.Menu := Menu_Arbre_Consultation;
when 2 =>
Etat.Menu := Menu_Registre_Modification;
when 3 =>
Etat.Menu := Menu_Registre;
when others =>
Etat.Menu := Quitter;
end case;
end Afficher_Menu_Registre_Consultation_Personne;
-- Demande a l'utilisateur toutes les informations pour peupler `Personne`.
procedure Saisir_Personne (Personne : out T_Personne) is
Nom_Complet : Sb.Bounded_String;
Nom_Usuel : Sb.Bounded_String;
Genre : T_Genre;
Date_De_Naissance : T_Date;
Lieu_De_Naissance : Sb.Bounded_String;
Correct : Boolean;
Date_Lue : Integer;
Genre_Lu : Character;
begin
Put ("Nom usuel : ");
Nom_Usuel := Get_Line;
Put ("Nom Complet : ");
Nom_Complet := Get_Line;
Put ("Sexe [F pour féminin, M pour masculin, A pour autre] : ");
Get (Genre_Lu);
Skip_Line;
case Genre_Lu is
when 'f' | 'F' =>
Genre := Feminin;
when 'm' | 'M' =>
Genre := Masculin;
when others =>
Genre := Autre;
end case;
Correct := False; -- La date entrée est correcte ?
while not Correct loop
Put ("Date de naissance [au format JJMMAAAA] : ");
begin
Get (Date_Lue);
Date_De_Naissance :=
Creer_Date
(Date_Lue / 1000000, (Date_Lue / 10000) mod 100,
Date_Lue mod 10000);
Correct := True;
exception
when Ada.Io_Exceptions.Data_Error | Date_Incorrecte =>
Correct := False;
end;
Skip_Line;
if not Correct then
Put_Line ("Date incorrecte.");
end if;
end loop;
Put ("Lieu de naissance [au format Ville, Pays] : ");
Lieu_De_Naissance := Get_Line;
New_Line;
Personne :=
(Nom_Usuel, Nom_Complet, Genre, Date_De_Naissance, Lieu_De_Naissance);
end Saisir_Personne;
-- Affiche un menu pour ajouter une personne au registre.
procedure Afficher_Menu_Registre_Ajout (Etat : in out T_Etat) is
Cle : Integer;
Personne : T_Personne;
Choix : Character;
begin
Put_Line ("* Ajouter une personne au registre *");
New_Line;
Put_Line
("Informations requises : nom usuel, nom complet, sexe, date et lieu de naissance.");
New_Line;
Saisir_Personne (Personne);
Put ("Confirmer l'ajout [O pour oui, autre pour non] : ");
Get (Choix);
Skip_Line;
if Choix = 'o' or Choix = 'O' then
Ajouter_Personne (Etat.Arbre, Personne, Cle);
Put ("Personne ajoutée avec la clé : ");
Put (Cle, 0);
else
Put ("Ajout annulé.");
end if;
New_Line;
New_Line;
Etat.Menu := Menu_Registre;
end Afficher_Menu_Registre_Ajout;
-- Permet de modifier une personne enregistrée.
procedure Afficher_Menu_Registre_Modification (Etat : in out T_Etat) is
Personne : T_Personne;
Choix : Character;
begin
Put_Line ("* Modification d'une personne du registre *");
New_Line;
Put_Line ("Informations actuelles : ");
Personne := Lire_Registre (Etat.Arbre, Etat.Cle);
Afficher_Personne (Etat.Cle, Personne);
New_Line;
Saisir_Personne (Personne);
New_Line;
Put ("Confirmer la modification [O pour oui, autre pour non] : ");
Get (Choix);
Skip_Line;
if Choix = 'o' or Choix = 'O' then
Attribuer_Registre (Etat.Arbre, Etat.Cle, Personne);
Put_Line ("Personne modifiée avec succès.");
else
Put_Line ("Modification annulée.");
end if;
New_Line;
Etat.Menu := Menu_Registre;
end Afficher_Menu_Registre_Modification;
-- Demande une clé pour afficher les relations d'une personne.
procedure Afficher_Menu_Arbre_Selection (Etat : in out T_Etat) is
Cle : Integer;
Correct : Boolean;
begin
Put_Line ("* Arbre généalogique *");
New_Line;
Correct := False;
while not Correct loop
Put_Line
("Entrez la clé de la personne dont vous voulez consulter l'arbre [0 pour retour].");
Choisir_Cle (Cle);
Correct := Cle = 0 or else Existe_Registre (Etat.Arbre, Cle);
if not Correct then
Put_Line ("Clé inconnue.");
New_Line;
end if;
end loop;
New_Line;
if Cle = 0 then
Etat.Menu := Menu_Principal;
else
Etat.Cle := Cle;
Etat.Menu := Menu_Arbre_Consultation;
end if;
end Afficher_Menu_Arbre_Selection;
-- Affiche les relations d'une personne.
procedure Afficher_Menu_Arbre_Consultation (Etat : in out T_Etat) is
-- Groupe toutes les relations de même étiquette ensemble.
procedure Afficher_Relations_Groupees
(Etat : in T_Etat; Etiquette : in T_Etiquette_Arete; Titre : in String)
is
Liste : T_Liste_Relations;
Relation : T_Arete_Etiquetee;
Titre_Affiche : Boolean := False;
begin
Liste_Relations (Liste, Etat.Arbre, Etat.Cle);
-- On affiche toutes les relations notées Etiquette
while Liste_Non_Vide (Liste) loop
Relation_Suivante (Liste, Relation);
if Relation.Etiquette = Etiquette then
if not Titre_Affiche then
Put_Line (Titre);
Titre_Affiche := True;
end if;
Put (" * ");
Afficher_Nom_Usuel (Etat, Relation.Destination);
New_Line;
end if;
end loop;
end Afficher_Relations_Groupees;
Liste : T_Liste_Relations;
Choix : Integer;
begin
Afficher_Nom_Usuel (Etat, Etat.Cle);
New_Line;
New_Line;
Liste_Relations (Liste, Etat.Arbre, Etat.Cle);
if not Liste_Non_Vide (Liste) then
Put_Line ("Aucune relation.");
else
Afficher_Relations_Groupees (Etat, A_Pour_Parent, "Parent(s) :");
Afficher_Relations_Groupees (Etat, A_Pour_Enfant, "Enfant(s) :");
Afficher_Relations_Groupees (Etat, A_Pour_Conjoint, "Conjoint(e) :");
end if;
New_Line;
Put_Line ("Menu :");
Put_Line ("1. Consulter dans le registre");
Put_Line ("2. Consulter une autre personne");
Put_Line ("3. Ajouter une relation");
Put_Line ("4. Supprimer une relation");
Put_Line ("5. Afficher un arbre de parenté");
Put_Line ("6. Retour");
New_Line;
Choisir (6, Choix);
New_Line;
case Choix is
when 1 =>
Etat.Menu := Menu_Registre_Consultation_Personne;
when 2 =>
Etat.Menu := Menu_Arbre_Selection;
when 3 =>
Etat.Menu := Menu_Arbre_Ajouter_Relation;
when 4 =>
Etat.Menu := Menu_Arbre_Supprimer_Relation;
when 5 =>
Etat.Menu := Menu_Arbre_Parente;
when 6 =>
Etat.Menu := Menu_Principal;
when others =>
Etat.Menu := Quitter;
end case;
end Afficher_Menu_Arbre_Consultation;
-- Permet d'ajouter une relation.
procedure Afficher_Menu_Arbre_Ajouter_Relation (Etat : in out T_Etat) is
Dates_Incompatibles : exception;
Personne_Origine : T_Personne;
Personne_Destination : T_Personne;
Cle_Destination : Integer;
Relation_Lue : Integer;
Correct : Boolean;
begin
Put_Line ("Ajouter une relation :");
Put_Line ("1. Ajouter un parent");
Put_Line ("2. Ajouter un enfant");
Put_Line ("3. Ajouter un conjoint");
New_Line;
Choisir (3, Relation_Lue);
New_Line;
Correct := False;
while not Correct loop
Put_Line ("Entrez la clé de la personne a lier [0 pour retour].");
Choisir_Cle (Cle_Destination);
Correct :=
Cle_Destination = 0
or else Existe_Registre (Etat.Arbre, Cle_Destination);
if not Correct then
Put_Line ("Clé inconnue.");
New_Line;
end if;
end loop;
if Cle_Destination = 0 then
Put_Line ("Ajout annulé.");
else
Personne_Origine := Lire_Registre (Etat.Arbre, Etat.Cle);
Personne_Destination := Lire_Registre (Etat.Arbre, Cle_Destination);
begin
case Relation_Lue is
when 1 =>
-- On vérifie qu'un parent est plus vieux que son enfant
if D1_Inf_D2
(Personne_Origine.Date_De_Naissance,
Personne_Destination.Date_De_Naissance)
then
raise Dates_Incompatibles;
end if;
Ajouter_Relation
(Etat.Arbre, Etat.Cle, A_Pour_Parent, Cle_Destination);
when 2 =>
if D1_Inf_D2
(Personne_Destination.Date_De_Naissance,
Personne_Origine.Date_De_Naissance)
then
raise Dates_Incompatibles;
end if;
Ajouter_Relation
(Etat.Arbre, Etat.Cle, A_Pour_Enfant, Cle_Destination);
when 3 =>
Ajouter_Relation
(Etat.Arbre, Etat.Cle, A_Pour_Conjoint, Cle_Destination);
when others =>
null;
end case;
Put_Line ("Relation ajoutée.");
exception
when Dates_Incompatibles =>
Put_Line ("Un parent doit etre plus agé que son enfant.");
when Relation_Existante =>
Put_Line
("Une relation entre ces deux personnes existe déja.");
end;
end if;
New_Line;
Etat.Menu := Menu_Arbre_Consultation;
end Afficher_Menu_Arbre_Ajouter_Relation;
-- Supprime les relations avec une personne.
procedure Afficher_Menu_Arbre_Supprimer_Relation (Etat : in out T_Etat) is
Cle_Destination : Integer;
Correct : Boolean;
begin
Correct := False;
while not Correct loop
Put_Line ("Entrez la clé de la personne a délier [0 pour retour].");
Choisir_Cle (Cle_Destination);
Correct :=
Cle_Destination = 0
or else Existe_Registre (Etat.Arbre, Cle_Destination);
if not Correct then
Put_Line ("Clé inconnue.");
New_Line;
end if;
end loop;
if Cle_Destination = 0 then
Put_Line ("Suppression annulée.");
Etat.Menu := Menu_Arbre_Consultation;
else
Supprimer_Relation
(Etat.Arbre, Etat.Cle, A_Pour_Parent, Cle_Destination);
Supprimer_Relation
(Etat.Arbre, Etat.Cle, A_Pour_Enfant, Cle_Destination);
Supprimer_Relation
(Etat.Arbre, Etat.Cle, A_Pour_Conjoint, Cle_Destination);
Put_Line ("Suppression effectuée.");
end if;
New_Line;
Etat.Menu := Menu_Arbre_Consultation;
end Afficher_Menu_Arbre_Supprimer_Relation;
-- Affiche un arbre de parenté, ascendant ou descendant.
procedure Afficher_Menu_Arbre_Parente (Etat : in out T_Etat) is
-- Affiche un bandeau
-- 0 1 2 génération
-- ======================
procedure Afficher_Bandeau (Nombre_Generations : in Integer) is
begin
for I in 0 .. Nombre_Generations loop
Put (I, 2);
Put (" ");
end loop;
Put_Line (" génération");
for I in 1 .. (Nombre_Generations * 4 + 15) loop
Put ("=");
end loop;
New_Line;
end Afficher_Bandeau;
procedure Afficher_Parente
(Etat : in T_Etat; Cle : in Integer; Etiquette : in T_Etiquette_Arete;
Nombre_Generations : in Integer; Indentation : in String)
is
Liste : T_Liste_Relations;
Relation : T_Arete_Etiquetee;
begin
Put (Indentation);
Put ("-- ");
Afficher_Nom_Usuel (Etat, Cle);
New_Line;
if Nombre_Generations <= 0 then
return;
end if;
Liste_Relations (Liste, Etat.Arbre, Cle);
while Liste_Non_Vide (Liste) loop
Relation_Suivante (Liste, Relation);
if Relation.Etiquette = Etiquette then
Afficher_Parente
(Etat, Relation.Destination, Etiquette,
Nombre_Generations - 1, Indentation & " ");
end if;
end loop;
end Afficher_Parente;
Nombre_Generations : Integer;
Correct : Boolean;
begin
Correct := False;
while not Correct loop
begin
Put_Line
("Nombre de générations a afficher [> 0 pour les parents,");
Put ("< 0 pour les enfants, 0 pour retour] : ");
Get (Nombre_Generations);
Correct := True;
exception
when Ada.Io_Exceptions.Data_Error =>
Correct := False;
end;
Skip_Line;
end loop;
New_Line;
if Nombre_Generations > 0 then
Afficher_Bandeau (Nombre_Generations);
Afficher_Parente
(Etat, Etat.Cle, A_Pour_Parent, Nombre_Generations, "");
New_Line;
elsif Nombre_Generations < 0 then
Afficher_Bandeau (-Nombre_Generations);
Afficher_Parente
(Etat, Etat.Cle, A_Pour_Enfant, -Nombre_Generations, "");
New_Line;
end if;
Etat.Menu := Menu_Arbre_Consultation;
end Afficher_Menu_Arbre_Parente;
-- Affiche diverses statistiques sur le graphe.
procedure Afficher_Menu_Statistiques (Etat : in out T_Etat) is
Nombre_Personnes : Integer := 0;
Nombre_Relations : Integer := 0;
Nombre_Orphelins : Integer := 0;
type Stats_Parents is array (1 .. 4) of Integer;
Nombre_Parents_Connus : Stats_Parents := (0, 0, 0, 0);
-- Parcourt le graphe et compte les détails des personnes
procedure P (Cle : in Integer; Liste : in out T_Liste_Relations) is
Relation : T_Arete_Etiquetee;
Nombre_Parents : Integer := 0;
begin
Nombre_Personnes := Nombre_Personnes + 1;
if Liste_Non_Vide (Liste) then
while Liste_Non_Vide (Liste) loop
Nombre_Relations := Nombre_Relations + 1;
Relation_Suivante (Liste, Relation);
if Relation.Etiquette = A_Pour_Parent then
Nombre_Parents := Nombre_Parents + 1;
end if;
end loop;
if Nombre_Parents > 2 then
Nombre_Parents_Connus (4) := Nombre_Parents_Connus (4) + 1;
else
Nombre_Parents_Connus (Nombre_Parents + 1) :=
Nombre_Parents_Connus (Nombre_Parents + 1) + 1;
end if;
else
Nombre_Orphelins := Nombre_Orphelins + 1;
-- On pourrait ici utiliser Afficher_Nom_Usuel (Etat, Cle)
end if;
end P;
procedure Compter is new Appliquer_Sur_Graphe (P);
begin
Put_Line ("* Statistiques *");
New_Line;
Compter (Etat.Arbre);
Put ("Nombre de personnes enregistrées : ");
Put (Nombre_Personnes, 0);
New_Line;
Put ("Nombre de relations enregistrées : ");
Put (Nombre_Relations, 0);
New_Line;
Put ("Nombre de personnes sans aucune relation : ");
Put (Nombre_Orphelins, 0);
New_Line;
Put_Line ("Nombre de personne avec");
Put (" * Aucun parent connu : ");
Put (Nombre_Parents_Connus (1), 0);
New_Line;
Put (" * Un parent connu : ");
Put (Nombre_Parents_Connus (2), 0);
New_Line;
Put (" * Deux parents connus : ");
Put (Nombre_Parents_Connus (3), 0);
New_Line;
Put (" * Trois ou plus : ");
Put (Nombre_Parents_Connus (4), 0);
New_Line;
New_Line;
Etat.Menu := Menu_Principal;
end Afficher_Menu_Statistiques;
-- Affiche le menu correspondant a l'état du programme.
procedure Afficher_Menu (Etat : in out T_Etat) is
begin
case Etat.Menu is
when Menu_Principal =>
Afficher_Menu_Principal (Etat);
when Menu_Registre =>
Afficher_Menu_Registre (Etat);
when Menu_Registre_Consultation_Selection =>
Afficher_Menu_Registre_Consultation_Selection (Etat);
when Menu_Registre_Consultation_Personne =>
Afficher_Menu_Registre_Consultation_Personne (Etat);
when Menu_Registre_Consultation_Recherche =>
Afficher_Menu_Registre_Consultation_Recherche (Etat);
when Menu_Registre_Ajout =>
Afficher_Menu_Registre_Ajout (Etat);
when Menu_Registre_Modification =>
Afficher_Menu_Registre_Modification (Etat);
when Menu_Arbre_Selection =>
Afficher_Menu_Arbre_Selection (Etat);
when Menu_Arbre_Consultation =>
Afficher_Menu_Arbre_Consultation (Etat);
when Menu_Arbre_Ajouter_Relation =>
Afficher_Menu_Arbre_Ajouter_Relation (Etat);
when Menu_Arbre_Supprimer_Relation =>
Afficher_Menu_Arbre_Supprimer_Relation (Etat);
when Menu_Arbre_Parente =>
Afficher_Menu_Arbre_Parente (Etat);
when Menu_Statistiques =>
Afficher_Menu_Statistiques (Etat);
when others =>
Etat.Menu := Quitter;
end case;
end Afficher_Menu;
Etat : T_Etat;
Cle : Integer;
begin
Initialiser (Etat.Arbre);
Etat.Menu := Menu_Principal;
-- Quelques personnes enregistrées pour la démo
Ajouter_Personne
(Etat.Arbre,
(Sb.To_Bounded_String ("Jean Bon"),
Sb.To_Bounded_String ("Jean, Eude Bon"), Masculin,
Creer_Date (31, 1, 1960), Sb.To_Bounded_String ("Paris, France")),
Cle);
Ajouter_Personne
(Etat.Arbre,
(Sb.To_Bounded_String ("Kevin Bon"),
Sb.To_Bounded_String ("Kevin, Junior Bon"), Masculin,
Creer_Date (1, 4, 1999), Sb.To_Bounded_String ("Toulouse, France")),
Cle);
while Etat.Menu /= Quitter loop
Afficher_Menu (Etat);
end loop;
Detruire (Etat.Arbre);
end Main;
|
-----------------------------------------------------------------------
-- security-openid -- OpenID 2.0 Support
-- Copyright (C) 2009, 2010, 2011, 2012, 2018 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- 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.
-----------------------------------------------------------------------
-- == OpenID Configuration ==
-- The Open ID provider needs the following configuration parameters:
--
-- openid.realm The OpenID realm parameter passed in the authentication URL.
-- openid.callback_url The OpenID return_to parameter.
--
private package Security.Auth.OpenID is
-- ------------------------------
-- OpenID Manager
-- ------------------------------
-- The <b>Manager</b> provides the core operations for the OpenID process.
type Manager is new Security.Auth.Manager with private;
-- Initialize the OpenID authentication realm. Get the <tt>openid.realm</tt>
-- and <tt>openid.callback_url</tt> parameters to configure the realm.
overriding
procedure Initialize (Realm : in out Manager;
Params : in Parameters'Class;
Name : in String := PROVIDER_OPENID);
-- Discover the OpenID provider that must be used to authenticate the user.
-- The <b>Name</b> can be an URL or an alias that identifies the provider.
-- A cached OpenID provider can be returned.
-- Read the XRDS document from the URI and initialize the OpenID provider end point.
-- (See OpenID Section 7.3 Discovery)
overriding
procedure Discover (Realm : in out Manager;
Name : in String;
Result : out End_Point);
-- Associate the application (relying party) with the OpenID provider.
-- The association can be cached.
-- (See OpenID Section 8 Establishing Associations)
overriding
procedure Associate (Realm : in out Manager;
OP : in End_Point;
Result : out Association);
-- Get the authentication URL to which the user must be redirected for authentication
-- by the authentication server.
overriding
function Get_Authentication_URL (Realm : in Manager;
OP : in End_Point;
Assoc : in Association) return String;
-- Verify the authentication result
overriding
procedure Verify (Realm : in out Manager;
Assoc : in Association;
Request : in Parameters'Class;
Result : out Authentication);
-- Verify the authentication result
procedure Verify_Discovered (Realm : in out Manager;
Assoc : in Association;
Request : in Parameters'Class;
Result : out Authentication);
-- Verify the signature part of the result
procedure Verify_Signature (Realm : in Manager;
Assoc : in Association;
Request : in Parameters'Class;
Result : in out Authentication);
-- Extract from the XRDS content the OpenID provider URI.
-- The default implementation is very basic as it returns the first <URI>
-- available in the stream without validating the XRDS document.
-- Raises the <b>Invalid_End_Point</b> exception if the URI cannot be found.
procedure Extract_XRDS (Realm : in out Manager;
Content : in String;
Result : out End_Point);
private
type Manager is new Security.Auth.Manager with record
Return_To : Unbounded_String;
Realm : Unbounded_String;
end record;
end Security.Auth.OpenID;
|
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="14">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>Loop_sum_loop_proc</name>
<ret_bitwidth>128</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>1</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>x</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>21</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_2">
<Value>
<Obj>
<type>0</type>
<id>2</id>
<name>x_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>30</item>
<item>31</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>3</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>5</id>
<name>sum_positive_0_loc_l</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>sum_positive</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>40</item>
<item>41</item>
<item>42</item>
<item>43</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>6</id>
<name>sum_negative_0_loc_l</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>sum_negative</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>44</item>
<item>45</item>
<item>46</item>
<item>47</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name>i_0_i_i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>49</item>
<item>50</item>
<item>51</item>
<item>52</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>tmp_i</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</fileDirectory>
<lineNumber>31</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</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>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>31</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>53</item>
<item>55</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name></name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</fileDirectory>
<lineNumber>31</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>31</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>56</item>
<item>57</item>
<item>58</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>tmp_1_i</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</fileDirectory>
<lineNumber>32</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>32</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>60</item>
<item>61</item>
<item>62</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>tmp_2_i</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</fileDirectory>
<lineNumber>32</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>32</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>64</item>
<item>65</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>tmp_3_i</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</fileDirectory>
<lineNumber>32</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>32</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>66</item>
<item>67</item>
</oprand_edges>
<opcode>ddiv</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>sum_positive</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</fileDirectory>
<lineNumber>32</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>32</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>sum_positive</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>68</item>
<item>69</item>
</oprand_edges>
<opcode>dadd</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>tmp_5_i</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</fileDirectory>
<lineNumber>33</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>33</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>70</item>
<item>72</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>tmp_6_i</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</fileDirectory>
<lineNumber>33</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>33</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>73</item>
<item>74</item>
<item>75</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>tmp_7_i</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</fileDirectory>
<lineNumber>33</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>33</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>76</item>
<item>77</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>tmp_8_i</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</fileDirectory>
<lineNumber>33</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>33</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>78</item>
<item>79</item>
</oprand_edges>
<opcode>ddiv</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>sum_negative</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</fileDirectory>
<lineNumber>33</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>33</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>sum_negative</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>80</item>
<item>81</item>
</oprand_edges>
<opcode>dadd</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>i</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</fileDirectory>
<lineNumber>31</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>31</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>82</item>
<item>84</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name></name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</fileDirectory>
<lineNumber>31</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>31</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>85</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>mrv</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</fileDirectory>
<lineNumber>32</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>32</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>34</item>
<item>35</item>
</oprand_edges>
<opcode>insertvalue</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>mrv_1</name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</fileDirectory>
<lineNumber>32</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>32</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>36</item>
<item>37</item>
</oprand_edges>
<opcode>insertvalue</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name></name>
<fileName>../source_files/src/dut.cpp</fileName>
<fileDirectory>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</fileDirectory>
<lineNumber>32</lineNumber>
<contextFuncName>sin_taylor_series</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/mnt/centos_share/Vivado_Projects/hls_scratchpad/hls_cmd_line_testing/cmd_line_proj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../source_files/src/dut.cpp</first>
<second>sin_taylor_series</second>
</first>
<second>32</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>38</item>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_23">
<Value>
<Obj>
<type>2</type>
<id>33</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>128</bitwidth>
</Value>
<const_type>4</const_type>
<content><Undef not integral></content>
</item>
<item class_id_reference="16" object_id="_24">
<Value>
<Obj>
<type>2</type>
<id>39</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>1</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_25">
<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>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_26">
<Value>
<Obj>
<type>2</type>
<id>54</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>21</content>
</item>
<item class_id_reference="16" object_id="_27">
<Value>
<Obj>
<type>2</type>
<id>59</id>
<name>power</name>
<fileName></fileName>
<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>6</const_type>
<content><constant:power></content>
</item>
<item class_id_reference="16" object_id="_28">
<Value>
<Obj>
<type>2</type>
<id>63</id>
<name>fact</name>
<fileName></fileName>
<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>6</const_type>
<content><constant:fact></content>
</item>
<item class_id_reference="16" object_id="_29">
<Value>
<Obj>
<type>2</type>
<id>71</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>2</content>
</item>
<item class_id_reference="16" object_id="_30">
<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>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>4</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="_31">
<Obj>
<type>3</type>
<id>4</id>
<name>newFuncRoot</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_32">
<Obj>
<type>3</type>
<id>11</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>5</count>
<item_version>0</item_version>
<item>5</item>
<item>6</item>
<item>7</item>
<item>8</item>
<item>10</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_33">
<Obj>
<type>3</type>
<id>24</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>11</count>
<item_version>0</item_version>
<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>
</node_objs>
</item>
<item class_id_reference="18" object_id="_34">
<Obj>
<type>3</type>
<id>28</id>
<name>sin_taylor_series_.exit2.exitStub</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>25</item>
<item>26</item>
<item>27</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>51</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_35">
<id>31</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>2</sink_obj>
</item>
<item class_id_reference="20" object_id="_36">
<id>32</id>
<edge_type>2</edge_type>
<source_obj>11</source_obj>
<sink_obj>3</sink_obj>
</item>
<item class_id_reference="20" object_id="_37">
<id>34</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_38">
<id>35</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_39">
<id>36</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_40">
<id>37</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_41">
<id>38</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_42">
<id>40</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>5</sink_obj>
</item>
<item class_id_reference="20" object_id="_43">
<id>41</id>
<edge_type>2</edge_type>
<source_obj>4</source_obj>
<sink_obj>5</sink_obj>
</item>
<item class_id_reference="20" object_id="_44">
<id>42</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>5</sink_obj>
</item>
<item class_id_reference="20" object_id="_45">
<id>43</id>
<edge_type>2</edge_type>
<source_obj>24</source_obj>
<sink_obj>5</sink_obj>
</item>
<item class_id_reference="20" object_id="_46">
<id>44</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>6</sink_obj>
</item>
<item class_id_reference="20" object_id="_47">
<id>45</id>
<edge_type>2</edge_type>
<source_obj>4</source_obj>
<sink_obj>6</sink_obj>
</item>
<item class_id_reference="20" object_id="_48">
<id>46</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>6</sink_obj>
</item>
<item class_id_reference="20" object_id="_49">
<id>47</id>
<edge_type>2</edge_type>
<source_obj>24</source_obj>
<sink_obj>6</sink_obj>
</item>
<item class_id_reference="20" object_id="_50">
<id>49</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_51">
<id>50</id>
<edge_type>2</edge_type>
<source_obj>4</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_52">
<id>51</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_53">
<id>52</id>
<edge_type>2</edge_type>
<source_obj>24</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_54">
<id>53</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_55">
<id>55</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_56">
<id>56</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_57">
<id>57</id>
<edge_type>2</edge_type>
<source_obj>28</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_58">
<id>58</id>
<edge_type>2</edge_type>
<source_obj>24</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_59">
<id>60</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_60">
<id>61</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_61">
<id>62</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_62">
<id>64</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_63">
<id>65</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_64">
<id>66</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_65">
<id>67</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_66">
<id>68</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_67">
<id>69</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_68">
<id>70</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_69">
<id>72</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_70">
<id>73</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_71">
<id>74</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_72">
<id>75</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_73">
<id>76</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_74">
<id>77</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_75">
<id>78</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_76">
<id>79</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_77">
<id>80</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_78">
<id>81</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_79">
<id>82</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_80">
<id>84</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_81">
<id>85</id>
<edge_type>2</edge_type>
<source_obj>11</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_82">
<id>96</id>
<edge_type>2</edge_type>
<source_obj>4</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_83">
<id>97</id>
<edge_type>2</edge_type>
<source_obj>11</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_84">
<id>98</id>
<edge_type>2</edge_type>
<source_obj>11</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_85">
<id>99</id>
<edge_type>2</edge_type>
<source_obj>24</source_obj>
<sink_obj>11</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="_86">
<mId>1</mId>
<mTag>Loop_sum_loop_proc</mTag>
<mType>0</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>1151</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_87">
<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>4</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_88">
<mId>3</mId>
<mTag>sum_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>11</item>
<item>24</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>5</mMinTripCount>
<mMaxTripCount>5</mMaxTripCount>
<mMinLatency>1150</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_89">
<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>28</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="-1"></fsm>
<res class_id="-1"></res>
<node_label_latency class_id="26" tracking_level="0" version="0">
<count>21</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>2</first>
<second class_id="28" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>3</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>5</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>6</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>7</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>8</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>13</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>2</first>
<second>30</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>33</first>
<second>4</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>1</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>2</first>
<second>30</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>33</first>
<second>4</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>37</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="29" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="0" version="0">
<first>4</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>1</first>
<second>37</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="32" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="34" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="35" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_reg_nodes>
<dp_regname_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="36" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core class_id="37" 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>
|
-- This spec has been automatically generated from STM32F411xx.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with System;
package STM32_SVD.IWDG is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype KR_KEY_Field is STM32_SVD.UInt16;
-- Key register
type KR_Register is record
-- Write-only. Key value
KEY : KR_KEY_Field := 16#0#;
-- unspecified
Reserved_16_31 : STM32_SVD.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for KR_Register use record
KEY at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype PR_PR_Field is STM32_SVD.UInt3;
-- Prescaler register
type PR_Register is record
-- Prescaler divider
PR : PR_PR_Field := 16#0#;
-- unspecified
Reserved_3_31 : STM32_SVD.UInt29 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PR_Register use record
PR at 0 range 0 .. 2;
Reserved_3_31 at 0 range 3 .. 31;
end record;
subtype RLR_RL_Field is STM32_SVD.UInt12;
-- Reload register
type RLR_Register is record
-- Watchdog counter reload value
RL : RLR_RL_Field := 16#FFF#;
-- unspecified
Reserved_12_31 : STM32_SVD.UInt20 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for RLR_Register use record
RL at 0 range 0 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
subtype SR_PVU_Field is STM32_SVD.Bit;
subtype SR_RVU_Field is STM32_SVD.Bit;
-- Status register
type SR_Register is record
-- Read-only. Watchdog prescaler value update
PVU : SR_PVU_Field;
-- Read-only. Watchdog counter reload value update
RVU : SR_RVU_Field;
-- unspecified
Reserved_2_31 : STM32_SVD.UInt30;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register use record
PVU at 0 range 0 .. 0;
RVU at 0 range 1 .. 1;
Reserved_2_31 at 0 range 2 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Independent watchdog
type IWDG_Peripheral is record
-- Key register
KR : aliased KR_Register;
-- Prescaler register
PR : aliased PR_Register;
-- Reload register
RLR : aliased RLR_Register;
-- Status register
SR : aliased SR_Register;
end record
with Volatile;
for IWDG_Peripheral use record
KR at 16#0# range 0 .. 31;
PR at 16#4# range 0 .. 31;
RLR at 16#8# range 0 .. 31;
SR at 16#C# range 0 .. 31;
end record;
-- Independent watchdog
IWDG_Periph : aliased IWDG_Peripheral
with Import, Address => System'To_Address (16#40003000#);
end STM32_SVD.IWDG;
|
------------------------------------------------------------------------------
-- --
-- GNAT EXAMPLE --
-- --
-- Copyright (C) 2013, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Netutils; use Netutils;
package Netcfg is
My_Eth_Addr : Eth_Addr := (16#aa#, 16#00#, 16#00#,
16#00#, 16#00#, 16#01#);
-- My ethernet address. Either set by Eth_Init or used by Eth_Init if the
-- board has no ethernet address.
My_Ip_Addr : In_Addr := To_In_Addr ((10, 10, 1, 43));
My_Netmask : In_Addr := To_In_Addr ((255, 255, 255, 0));
-- Board IP address and netmask
Gw_Ip_Addr : In_Addr := Null_Ip_Addr;
-- IP address of the gateway
Srv_Ip_Addr : In_Addr := Null_Ip_Addr;
-- IP address of the server
Srv_Eth_Addr : Eth_Addr := Null_Eth_Addr;
end Netcfg;
|
-----------------------------------------------------------------------
-- Copyright 2021 Lev Kujawski --
-- --
-- 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 sell --
-- copies of the Software, and to permit persons to whom the --
-- Software is furnished to do so. --
-- --
-- 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. --
-- --
-- SPDX-License-Identifier: MIT-0 --
-- --
-- File: octets.ads (Ada Package Specification) --
-- Language: SPARK83 [1] subset of Ada (1987) [2] --
-- Author: Lev Kujawski --
-- Description: Specification of the Octets (8-bit) type --
-- --
-- References: --
-- [1] SPARK Team, SPARK83 - The SPADE Ada83 Kernel, --
-- Altran Praxis, 17 Oct. 2011. --
-- [2] Programming languages - Ada, ISO/IEC 8652:1987, --
-- 15 Jun. 1987. --
-----------------------------------------------------------------------
package Octets is
pragma Pure;
Bits : constant := 8;
type T is range 0 .. 255;
for T'Size use Bits;
end Octets;
|
-- kvflyweights_lists_spec.ads
-- A specification package that summarises the requirements for list packages
-- used in the KVFlyweights hashtables
-- Copyright (c) 2016, James Humphry
--
-- Permission to use, copy, modify, and/or 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.
pragma Profile (No_Implementation_Extensions);
generic
type Key(<>) is private;
type Key_Access is access Key;
type Value_Access is private;
type List is private;
Empty_List : List;
with procedure Insert (L : in out List;
K : in Key;
Key_Ptr : out Key_Access;
Value_Ptr : out Value_Access);
with procedure Increment (L : in out List;
Key_Ptr : in Key_Access);
with procedure Remove (L : in out List;
Key_Ptr : in Key_Access);
package KVFlyweights_Lists_Spec is
end KVFlyweights_Lists_Spec;
|
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Integer_Text_IO; use Ada.Integer_Text_IO;
procedure Lire_Entier is
-- Lire un entier au clavier.
-- Paramètres :
-- Nombre : l'entier à lire
-- Nécessite : ---
-- Assure : -- Nombre est l'entier lu
procedure Lire (Nombre: out Integer) is
Char: Character;
EOL: Boolean;
begin
Nombre := 0;
loop
Look_Ahead(Char, EOL);
exit when EOL or else (Char < '0' or Char > '9');
Get(Char);
Nombre := Nombre * 10 + (Character'Pos(Char) - Character'Pos('0'));
end loop;
end Lire;
Un_Entier: Integer; -- lu au clavier
Suivant: Character; -- lu au clavier
begin
-- Demander un entier
Put ("Un entier : ");
-- Appeler le sous-programme Lire
Lire(Un_Entier);
-- Afficher l'entier lu
Put ("L'entier lu est : ");
Put (Un_Entier, 1);
New_Line;
-- Afficher le caractère suivant
Get (Suivant);
Put ("Le caractère suivant est : ");
Put (Suivant);
New_Line;
end Lire_Entier;
|
-- Copyright (c) 2020-2021 Bartek thindil Jasicki <thindil@laeran.pl>
--
-- 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 Ada.Characters.Latin_1; use Ada.Characters.Latin_1;
with Ada.Strings; use Ada.Strings;
with Ada.Strings.Fixed; use Ada.Strings.Fixed;
with Interfaces.C; use Interfaces.C;
with Interfaces.C.Strings; use Interfaces.C.Strings;
with GNAT.Directory_Operations; use GNAT.Directory_Operations;
with CArgv; use CArgv;
with Tcl; use Tcl;
with Tcl.Ada; use Tcl.Ada;
with Tcl.Tk.Ada; use Tcl.Tk.Ada;
with Tcl.Tk.Ada.Grid;
with Tcl.Tk.Ada.Widgets; use Tcl.Tk.Ada.Widgets;
with Tcl.Tk.Ada.Widgets.Canvas; use Tcl.Tk.Ada.Widgets.Canvas;
with Tcl.Tk.Ada.Widgets.Menu; use Tcl.Tk.Ada.Widgets.Menu;
with Tcl.Tk.Ada.Widgets.Toplevel.MainWindow;
use Tcl.Tk.Ada.Widgets.Toplevel.MainWindow;
with Tcl.Tk.Ada.Widgets.TtkEntry.TtkComboBox;
use Tcl.Tk.Ada.Widgets.TtkEntry.TtkComboBox;
with Tcl.Tk.Ada.Widgets.TtkEntry.TtkSpinBox;
use Tcl.Tk.Ada.Widgets.TtkEntry.TtkSpinBox;
with Tcl.Tk.Ada.Widgets.TtkFrame; use Tcl.Tk.Ada.Widgets.TtkFrame;
with Tcl.Tk.Ada.Widgets.TtkLabel; use Tcl.Tk.Ada.Widgets.TtkLabel;
with Tcl.Tk.Ada.Widgets.TtkPanedWindow; use Tcl.Tk.Ada.Widgets.TtkPanedWindow;
with Tcl.Tk.Ada.Widgets.TtkScrollbar; use Tcl.Tk.Ada.Widgets.TtkScrollbar;
with Tcl.Tk.Ada.Winfo; use Tcl.Tk.Ada.Winfo;
with Bases.Cargo; use Bases.Cargo;
with BasesTypes; use BasesTypes;
with Config; use Config;
with CoreUI; use CoreUI;
with Dialogs; use Dialogs;
with Events; use Events;
with Maps; use Maps;
with Maps.UI; use Maps.UI;
with Messages; use Messages;
with Ships.Cargo; use Ships.Cargo;
with Table; use Table;
with Utils.UI; use Utils.UI;
package body Bases.LootUI is
-- ****iv* LUI/LUI.LootTable
-- FUNCTION
-- Table with info about the available items to loot
-- SOURCE
LootTable: Table_Widget (5);
-- ****
-- ****iv* LUI/LUI.Items_Indexes
-- FUNCTION
-- Indexes of the items for loot
-- SOURCE
Items_Indexes: Natural_Container.Vector;
-- ****
-- ****it* LUI/LUI.Items_Sort_Orders
-- FUNCTION
-- Sorting orders for the looting list
-- OPTIONS
-- NAMEASC - Sort items by name ascending
-- NAMEDESC - Sort items by name descending
-- TYPEASC - Sort items by type ascending
-- TYPEDESC - Sort items by type descending
-- DURABILITYASC - Sort items by durability ascending
-- DURABILITYDESC - Sort items by durability descending
-- OWNEDASC - Sort items by owned amount ascending
-- OWNEDDESC - Sort items by owned amount descending
-- AVAILABLEASC - Sort items by available amount ascending
-- AVAILABLEDESC - Sort items by available amount descending
-- NONE - No sorting modules (default)
-- HISTORY
-- 6.4 - Added
-- SOURCE
type Items_Sort_Orders is
(NAMEASC, NAMEDESC, TYPEASC, TYPEDESC, DURABILITYASC, DURABILITYDESC,
OWNEDASC, OWNEDDESC, AVAILABLEASC, AVAILABLEDESC, NONE) with
Default_Value => NONE;
-- ****
-- ****id* LUI/LUI.Default_Items_Sort_Order
-- FUNCTION
-- Default sorting order for the looting list
-- HISTORY
-- 6.4 - Added
-- SOURCE
Default_Items_Sort_Order: constant Items_Sort_Orders := NONE;
-- ****
-- ****iv* LUI/LUI.Items_Sort_Order
-- FUNCTION
-- The current sorting order for the looting list
-- HISTORY
-- 6.4 - Added
-- SOURCE
Items_Sort_Order: Items_Sort_Orders := Default_Items_Sort_Order;
-- ****
-- ****o* LUI/LUI.Show_Loot_Command
-- FUNCTION
-- Show information about looting
-- PARAMETERS
-- ClientData - Custom data send to the command. Unused
-- Interp - Tcl interpreter in which command was executed.
-- Argc - Number of arguments passed to the command.
-- Argv - Values of arguments passed to the command.
-- RESULT
-- This function always return TCL_OK
-- COMMANDS
-- ShowLoot
-- SOURCE
function Show_Loot_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int with
Convention => C;
-- ****
function Show_Loot_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int is
pragma Unreferenced(ClientData);
LootFrame: Ttk_Frame := Get_Widget(Main_Paned & ".lootframe", Interp);
LootCanvas: constant Tk_Canvas :=
Get_Widget(LootFrame & ".canvas", Interp);
Label: constant Ttk_Label :=
Get_Widget(LootCanvas & ".loot.options.typelabel", Interp);
ItemDurability, ItemType, ProtoIndex, ItemName: Unbounded_String;
ItemsTypes: Unbounded_String := To_Unbounded_String("All");
ComboBox: Ttk_ComboBox;
BaseIndex: constant Natural :=
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).BaseIndex;
BaseCargo: BaseCargo_Container.Vector;
BaseCargoIndex, BaseAmount: Natural;
IndexesList: Positive_Container.Vector;
Page: constant Positive :=
(if Argc = 3 then Positive'Value(CArgv.Arg(Argv, 2)) else 1);
Start_Row: constant Positive :=
((Page - 1) * Game_Settings.Lists_Limit) + 1;
Current_Row: Positive := 1;
Arguments: constant String :=
(if Argc > 1 then "{" & CArgv.Arg(Argv, 1) & "}" else "All");
Current_Item_Index: Positive := 1;
begin
if Winfo_Get(Label, "exists") = "0" then
Tcl_EvalFile
(Get_Context,
To_String(Data_Directory) & "ui" & Dir_Separator & "loot.tcl");
Bind(LootFrame, "<Configure>", "{ResizeCanvas %W.canvas %w %h}");
LootFrame := Get_Widget(LootCanvas & ".loot");
LootTable :=
CreateTable
(Widget_Image(LootFrame),
(To_Unbounded_String("Name"), To_Unbounded_String("Type"),
To_Unbounded_String("Durability"), To_Unbounded_String("Owned"),
To_Unbounded_String("Available")),
Get_Widget(".gameframe.paned.lootframe.scrolly", Interp),
"SortLootItems", "Press mouse button to sort the items.");
elsif Winfo_Get(Label, "ismapped") = "1" and Argc = 1 then
Tcl.Tk.Ada.Grid.Grid_Remove(Close_Button);
Entry_Configure(GameMenu, "Help", "-command {ShowHelp general}");
ShowSkyMap(True);
return TCL_OK;
end if;
Entry_Configure(GameMenu, "Help", "-command {ShowHelp trade}");
LootFrame.Name := New_String(LootCanvas & ".loot");
ComboBox := Get_Widget(LootFrame & ".options.type", Interp);
BaseCargo := Sky_Bases(BaseIndex).Cargo;
if Items_Sort_Order = Default_Items_Sort_Order then
Items_Indexes.Clear;
for I in Player_Ship.Cargo.Iterate loop
Items_Indexes.Append(Inventory_Container.To_Index(I));
end loop;
Items_Indexes.Append(0);
for I in BaseCargo.Iterate loop
Items_Indexes.Append(BaseCargo_Container.To_Index(I));
end loop;
end if;
ClearTable(LootTable);
Add_Player_Cargo_Loop :
for I of Items_Indexes loop
Current_Item_Index := Current_Item_Index + 1;
exit Add_Player_Cargo_Loop when I = 0;
ProtoIndex := Player_Ship.Cargo(I).ProtoIndex;
BaseCargoIndex :=
Find_Base_Cargo(ProtoIndex, Player_Ship.Cargo(I).Durability);
if BaseCargoIndex > 0 then
IndexesList.Append(New_Item => BaseCargoIndex);
end if;
ItemType :=
(if Items_List(ProtoIndex).ShowType = Null_Unbounded_String then
Items_List(ProtoIndex).IType
else Items_List(ProtoIndex).ShowType);
if Index(ItemsTypes, To_String("{" & ItemType & "}")) = 0 then
Append(ItemsTypes, " {" & ItemType & "}");
end if;
if Argc > 1 and then CArgv.Arg(Argv, 1) /= "All"
and then To_String(ItemType) /= CArgv.Arg(Argv, 1) then
goto End_Of_Cargo_Loop;
end if;
if Current_Row < Start_Row then
Current_Row := Current_Row + 1;
goto End_Of_Cargo_Loop;
end if;
ItemName :=
To_Unbounded_String
(GetItemName(Player_Ship.Cargo(I), False, False));
AddButton
(LootTable, To_String(ItemName), "Show available options for item",
"ShowLootItemMenu" & Positive'Image(I), 1);
AddButton
(LootTable, To_String(ItemType), "Show available options for item",
"ShowLootItemMenu" & Positive'Image(I), 2);
ItemDurability :=
(if Player_Ship.Cargo(I).Durability < 100 then
To_Unbounded_String
(GetItemDamage(Player_Ship.Cargo(I).Durability))
else To_Unbounded_String("Unused"));
AddProgressBar
(LootTable, Player_Ship.Cargo(I).Durability,
Default_Item_Durability, To_String(ItemDurability),
"ShowLootItemMenu" & Positive'Image(I), 3);
AddButton
(LootTable, Natural'Image(Player_Ship.Cargo(I).Amount),
"Show available options for item",
"ShowLootItemMenu" & Positive'Image(I), 4);
BaseAmount :=
(if BaseCargoIndex > 0 then
Sky_Bases(BaseIndex).Cargo(BaseCargoIndex).Amount
else 0);
AddButton
(LootTable, Natural'Image(BaseAmount),
"Show available options for item",
"ShowLootItemMenu" & Positive'Image(I), 5, True);
exit Add_Player_Cargo_Loop when LootTable.Row =
Game_Settings.Lists_Limit + 1;
<<End_Of_Cargo_Loop>>
end loop Add_Player_Cargo_Loop;
Add_Base_Cargo_Loop :
for I in Current_Item_Index .. Items_Indexes.Last_Index loop
exit Add_Base_Cargo_Loop when LootTable.Row =
Game_Settings.Lists_Limit + 1;
if IndexesList.Find_Index(Item => Items_Indexes(I)) > 0 then
goto End_Of_Base_Cargo_Loop;
end if;
ProtoIndex := BaseCargo(Items_Indexes(I)).Proto_Index;
ItemType :=
(if Items_List(ProtoIndex).ShowType = Null_Unbounded_String then
Items_List(ProtoIndex).IType
else Items_List(ProtoIndex).ShowType);
if Index(ItemsTypes, To_String("{" & ItemType & "}")) = 0 then
Append(ItemsTypes, " {" & ItemType & "}");
end if;
if Argc = 2 and then CArgv.Arg(Argv, 1) /= "All"
and then To_String(ItemType) /= CArgv.Arg(Argv, 1) then
goto End_Of_Base_Cargo_Loop;
end if;
if Current_Row < Start_Row then
Current_Row := Current_Row + 1;
goto End_Of_Base_Cargo_Loop;
end if;
ItemName := Items_List(ProtoIndex).Name;
AddButton
(LootTable, To_String(ItemName), "Show available options for item",
"ShowLootItemMenu -" &
Trim(Positive'Image(Items_Indexes(I)), Left),
1);
AddButton
(LootTable, To_String(ItemType), "Show available options for item",
"ShowLootItemMenu -" &
Trim(Positive'Image(Items_Indexes(I)), Left),
2);
ItemDurability :=
(if BaseCargo(Items_Indexes(I)).Durability < 100 then
To_Unbounded_String(GetItemDamage(BaseCargo(I).Durability))
else To_Unbounded_String("Unused"));
AddProgressBar
(LootTable, BaseCargo(Items_Indexes(I)).Durability,
Default_Item_Durability, To_String(ItemDurability),
"ShowLootItemMenu -" &
Trim(Positive'Image(Items_Indexes(I)), Left),
3);
AddButton
(LootTable, "0", "Show available options for item",
"ShowLootItemMenu -" &
Trim(Positive'Image(Items_Indexes(I)), Left),
4);
BaseAmount := Sky_Bases(BaseIndex).Cargo(Items_Indexes(I)).Amount;
AddButton
(LootTable, Natural'Image(BaseAmount),
"Show available options for item",
"ShowLootItemMenu -" &
Trim(Positive'Image(Items_Indexes(I)), Left),
5, True);
<<End_Of_Base_Cargo_Loop>>
end loop Add_Base_Cargo_Loop;
if Page > 1 then
if LootTable.Row < Game_Settings.Lists_Limit + 1 then
AddPagination
(LootTable, "ShowLoot " & Arguments & Positive'Image(Page - 1),
"");
else
AddPagination
(LootTable, "ShowLoot " & Arguments & Positive'Image(Page - 1),
"ShowLoot " & Arguments & Positive'Image(Page + 1));
end if;
elsif LootTable.Row = Game_Settings.Lists_Limit + 1 then
AddPagination
(LootTable, "", "ShowLoot " & Arguments & Positive'Image(Page + 1));
end if;
UpdateTable(LootTable);
Tcl_Eval(Get_Context, "update");
configure
(LootTable.Canvas,
"-scrollregion [list " & BBox(LootTable.Canvas, "all") & "]");
configure(ComboBox, "-values [list " & To_String(ItemsTypes) & "]");
if Argc = 1 then
Current(ComboBox, "0");
end if;
Tcl.Tk.Ada.Grid.Grid(Close_Button, "-row 0 -column 1");
configure
(LootCanvas,
"-height [expr " & SashPos(Main_Paned, "0") & " - 20] -width " &
cget(Main_Paned, "-width"));
Tcl_Eval(Get_Context, "update");
Canvas_Create
(LootCanvas, "window", "0 0 -anchor nw -window " & LootFrame);
Tcl_Eval(Get_Context, "update");
configure
(LootCanvas, "-scrollregion [list " & BBox(LootCanvas, "all") & "]");
Xview_Move_To(LootCanvas, "0.0");
Yview_Move_To(LootCanvas, "0.0");
Show_Screen("lootframe");
Tcl_SetResult(Interp, "1");
return TCL_OK;
end Show_Loot_Command;
-- ****if* LUI/LUI.ItemIndex
-- FUNCTION
-- Index of the currently selected item
-- SOURCE
ItemIndex: Integer;
-- ****
-- ****o* LUI/LUI.Show_Trade_Loot_Info_Command
-- FUNCTION
-- Show information about the selected item
-- PARAMETERS
-- ClientData - Custom data send to the command. Unused
-- Interp - Tcl interpreter in which command was executed. Unused
-- Argc - Number of arguments passed to the command. Unused
-- Argv - Values of arguments passed to the command. Unused
-- RESULT
-- This function always return TCL_OK
-- COMMANDS
-- ShowLootItemInfo
-- SOURCE
function Show_Loot_Item_Info_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int with
Convention => C;
-- ****
function Show_Loot_Item_Info_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int is
pragma Unreferenced(ClientData, Interp, Argc, Argv);
use Tiny_String;
ItemInfo, ProtoIndex: Unbounded_String;
CargoIndex, BaseCargoIndex: Natural := 0;
BaseIndex: constant Natural :=
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).BaseIndex;
ItemTypes: constant array(1 .. 6) of Unbounded_String :=
(Weapon_Type, Chest_Armor, Head_Armor, Arms_Armor, Legs_Armor,
Shield_Type);
begin
if ItemIndex < 0 then
BaseCargoIndex := abs (ItemIndex);
else
CargoIndex := ItemIndex;
end if;
if CargoIndex > Natural(Player_Ship.Cargo.Length) or
BaseCargoIndex > Natural(Sky_Bases(BaseIndex).Cargo.Length) then
return TCL_OK;
end if;
ProtoIndex :=
(if CargoIndex > 0 then Player_Ship.Cargo(CargoIndex).ProtoIndex
else Sky_Bases(BaseIndex).Cargo(BaseCargoIndex).Proto_Index);
Append
(ItemInfo,
"Weight:" & Integer'Image(Items_List(ProtoIndex).Weight) & " kg");
if Items_List(ProtoIndex).IType = Weapon_Type then
Append
(ItemInfo,
LF & "Skill: " &
To_String
(SkillsData_Container.Element
(Skills_List, Items_List(ProtoIndex).Value(3))
.Name) &
"/" &
To_String
(AttributesData_Container.Element
(Attributes_List,
SkillsData_Container.Element
(Skills_List, Items_List(ProtoIndex).Value(3))
.Attribute)
.Name));
if Items_List(ProtoIndex).Value(4) = 1 then
Append(ItemInfo, LF & "Can be used with shield.");
else
Append
(ItemInfo,
LF & "Can't be used with shield (two-handed weapon).");
end if;
Append(ItemInfo, LF & "Damage type: ");
case Items_List(ProtoIndex).Value(5) is
when 1 =>
Append(ItemInfo, "cutting");
when 2 =>
Append(ItemInfo, "impaling");
when 3 =>
Append(ItemInfo, "blunt");
when others =>
null;
end case;
end if;
Show_Weapon_Info_Loop :
for ItemType of ItemTypes loop
if Items_List(ProtoIndex).IType = ItemType then
Append
(ItemInfo,
LF & "Damage chance: " &
GetItemChanceToDamage(Items_List(ProtoIndex).Value(1)));
Append
(ItemInfo,
LF & "Strength:" &
Integer'Image(Items_List(ProtoIndex).Value(2)));
exit Show_Weapon_Info_Loop;
end if;
end loop Show_Weapon_Info_Loop;
if Tools_List.Contains(Items_List(ProtoIndex).IType) then
Append
(ItemInfo,
LF & "Damage chance: " &
GetItemChanceToDamage(Items_List(ProtoIndex).Value(1)));
end if;
if Length(Items_List(ProtoIndex).IType) > 4
and then
(Slice(Items_List(ProtoIndex).IType, 1, 4) = "Ammo" or
Items_List(ProtoIndex).IType = To_Unbounded_String("Harpoon")) then
Append
(ItemInfo,
LF & "Strength:" & Integer'Image(Items_List(ProtoIndex).Value(1)));
end if;
if Items_List(ProtoIndex).Description /= Null_Unbounded_String then
Append
(ItemInfo, LF & LF & To_String(Items_List(ProtoIndex).Description));
end if;
ShowInfo
(Text => To_String(ItemInfo),
Title => To_String(Items_List(ProtoIndex).Name));
return TCL_OK;
end Show_Loot_Item_Info_Command;
-- ****o* LUI/LUI.Loot_Item_Command
-- FUNCTION
-- Take or drop the selected item
-- PARAMETERS
-- ClientData - Custom data send to the command.
-- Interp - Tcl interpreter in which command was executed.
-- Argc - Number of arguments passed to the command. Unused
-- Argv - Values of arguments passed to the command.
-- RESULT
-- This function always return TCL_OK
-- COMMANDS
-- LootItem actiontype
-- actiontype can be: drop, dropall, take, takeall
-- SOURCE
function Loot_Item_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int with
Convention => C;
-- ****
function Loot_Item_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int is
pragma Unreferenced(Argc);
BaseIndex: constant Natural :=
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).BaseIndex;
BaseCargoIndex, CargoIndex: Natural := 0;
Amount: Natural;
ProtoIndex: Unbounded_String;
AmountBox: constant Ttk_SpinBox :=
Get_Widget(".itemdialog.amount", Interp);
TypeBox: constant Ttk_ComboBox :=
Get_Widget(Main_Paned & ".lootframe.canvas.loot.options.type", Interp);
begin
if ItemIndex < 0 then
BaseCargoIndex := abs (ItemIndex);
else
CargoIndex := ItemIndex;
end if;
if CargoIndex > 0 then
ProtoIndex := Player_Ship.Cargo(CargoIndex).ProtoIndex;
if BaseCargoIndex = 0 then
BaseCargoIndex := Find_Base_Cargo(ProtoIndex);
end if;
else
ProtoIndex := Sky_Bases(BaseIndex).Cargo(BaseCargoIndex).Proto_Index;
end if;
if CArgv.Arg(Argv, 1) in "drop" | "dropall" then
Amount :=
(if CArgv.Arg(Argv, 1) = "drop" then Positive'Value(Get(AmountBox))
else Player_Ship.Cargo(CargoIndex).Amount);
if BaseCargoIndex > 0 then
Update_Base_Cargo
(Cargo_Index => BaseCargoIndex, Amount => Amount,
Durability => Player_Ship.Cargo.Element(CargoIndex).Durability);
else
Update_Base_Cargo
(ProtoIndex, Amount,
Player_Ship.Cargo.Element(CargoIndex).Durability);
end if;
UpdateCargo
(Ship => Player_Ship, CargoIndex => CargoIndex,
Amount => (0 - Amount),
Durability => Player_Ship.Cargo.Element(CargoIndex).Durability);
AddMessage
("You drop" & Positive'Image(Amount) & " " &
To_String(Items_List(ProtoIndex).Name) & ".",
OrderMessage);
else
Amount :=
(if CArgv.Arg(Argv, 1) = "take" then Positive'Value(Get(AmountBox))
else Sky_Bases(BaseIndex).Cargo(BaseCargoIndex).Amount);
if FreeCargo(0 - (Amount * Items_List(ProtoIndex).Weight)) < 0 then
ShowMessage
(Text =>
"You can't take that much " &
To_String(Items_List(ProtoIndex).Name) & ".",
Title => "Too much taken");
return TCL_OK;
end if;
if CargoIndex > 0 then
UpdateCargo
(Ship => Player_Ship, CargoIndex => CargoIndex, Amount => Amount,
Durability =>
Sky_Bases(BaseIndex).Cargo(BaseCargoIndex).Durability);
else
UpdateCargo
(Player_Ship, ProtoIndex, Amount,
Sky_Bases(BaseIndex).Cargo(BaseCargoIndex).Durability);
end if;
Update_Base_Cargo
(Cargo_Index => BaseCargoIndex, Amount => (0 - Amount),
Durability =>
Sky_Bases(BaseIndex).Cargo.Element(BaseCargoIndex).Durability);
AddMessage
("You took" & Positive'Image(Amount) & " " &
To_String(Items_List(ProtoIndex).Name) & ".",
OrderMessage);
end if;
if CArgv.Arg(Argv, 1) in "take" | "drop" then
if Close_Dialog_Command
(ClientData, Interp, 2,
CArgv.Empty & "CloseDialog" & ".itemdialog") =
TCL_ERROR then
return TCL_ERROR;
end if;
end if;
UpdateHeader;
Update_Messages;
return
Show_Loot_Command
(ClientData, Interp, 2, CArgv.Empty & "ShowLoot" & Get(TypeBox));
end Loot_Item_Command;
-- ****o* LUI/LUI.Show_Module_Menu_Command
-- FUNCTION
-- Show menu with actions for the selected item
-- PARAMETERS
-- ClientData - Custom data send to the command. Unused
-- Interp - Tcl interpreter in which command was executed.
-- Argc - Number of arguments passed to the command. Unused
-- Argv - Values of arguments passed to the command.
-- RESULT
-- This function always return TCL_OK
-- COMMANDS
-- ShowLootItemMenu itemindex
-- ItemIndex is a index of the item which menu will be shown.
-- SOURCE
function Show_Item_Menu_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int with
Convention => C;
-- ****
function Show_Item_Menu_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int is
pragma Unreferenced(ClientData, Argc);
ItemMenu: Tk_Menu := Get_Widget(".itemmenu", Interp);
BaseCargoIndex, CargoIndex: Natural := 0;
BaseIndex: constant Natural :=
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).BaseIndex;
begin
ItemIndex := Integer'Value(CArgv.Arg(Argv, 1));
if ItemIndex < 0 then
BaseCargoIndex := abs (ItemIndex);
else
CargoIndex := ItemIndex;
end if;
if CargoIndex > 0 and then BaseCargoIndex = 0 then
BaseCargoIndex :=
Find_Base_Cargo(Player_Ship.Cargo(CargoIndex).ProtoIndex);
end if;
if Winfo_Get(ItemMenu, "exists") = "0" then
ItemMenu := Create(".itemmenu", "-tearoff false");
end if;
Delete(ItemMenu, "0", "end");
if BaseCargoIndex > 0 then
Menu.Add
(ItemMenu, "command",
"-label {Take selected amount} -command {LootAmount take" &
Natural'Image(Sky_Bases(BaseIndex).Cargo(BaseCargoIndex).Amount) &
"}");
Menu.Add
(ItemMenu, "command",
"-label {Take all available} -command {LootItem takeall}");
end if;
if CargoIndex > 0 then
Menu.Add
(ItemMenu, "command",
"-label {Drop selected amount} -command {LootAmount drop" &
Natural'Image(Player_Ship.Cargo(CargoIndex).Amount) & "}");
Menu.Add
(ItemMenu, "command",
"-label {Drop all owned} -command {LootItem dropall}");
end if;
Menu.Add
(ItemMenu, "command",
"-label {Show item details} -command {ShowLootItemInfo}");
Tk_Popup
(ItemMenu, Winfo_Get(Get_Main_Window(Interp), "pointerx"),
Winfo_Get(Get_Main_Window(Interp), "pointery"));
return TCL_OK;
end Show_Item_Menu_Command;
-- ****o* LUI/LUI.Loot_Amount_Command
-- FUNCTION
-- Show dialog to enter amount of items to drop or take
-- PARAMETERS
-- ClientData - Custom data send to the command. Unused
-- Interp - Tcl interpreter in which command was executed. Unused
-- Argc - Number of arguments passed to the command. Unused
-- Argv - Values of arguments passed to the command. Unused
-- RESULT
-- This function always return TCL_OK
-- COMMANDS
-- LootAmount action baseindex
-- Action which will be taken. Can be take or drop. BaseIndex is the index
-- of the base from which item will be take.
-- SOURCE
function Loot_Amount_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int with
Convention => C;
-- ****
function Loot_Amount_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int is
pragma Unreferenced(ClientData, Interp, Argc);
BaseIndex: constant Natural :=
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).BaseIndex;
begin
if CArgv.Arg(Argv, 1) = "drop" then
ShowManipulateItem
("Drop " & GetItemName(Player_Ship.Cargo(ItemIndex)),
"LootItem drop", "drop", ItemIndex);
else
if ItemIndex > 0 then
ShowManipulateItem
("Take " & GetItemName(Player_Ship.Cargo(ItemIndex)),
"LootItem take", "take", ItemIndex,
Natural'Value(CArgv.Arg(Argv, 2)));
else
ShowManipulateItem
("Take " &
To_String
(Items_List
(Sky_Bases(BaseIndex).Cargo(abs (ItemIndex)).Proto_Index)
.Name),
"LootItem take", "take", abs (ItemIndex),
Natural'Value(CArgv.Arg(Argv, 2)));
end if;
end if;
return TCL_OK;
end Loot_Amount_Command;
-- ****o* LUI/LUI.Sort_Items_Command
-- FUNCTION
-- Sort the looting list
-- PARAMETERS
-- ClientData - Custom data send to the command.
-- Interp - Tcl interpreter in which command was executed.
-- Argc - Number of arguments passed to the command. Unused
-- Argv - Values of arguments passed to the command.
-- RESULT
-- This function always return TCL_OK
-- COMMANDS
-- SortLootItems x
-- X is X axis coordinate where the player clicked the mouse button
-- SOURCE
function Sort_Items_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int with
Convention => C;
-- ****
function Sort_Items_Command
(ClientData: Integer; Interp: Tcl.Tcl_Interp; Argc: Interfaces.C.int;
Argv: CArgv.Chars_Ptr_Ptr) return Interfaces.C.int is
pragma Unreferenced(Argc);
Column: constant Positive :=
Get_Column_Number(LootTable, Natural'Value(CArgv.Arg(Argv, 1)));
type Local_Item_Data is record
Name: Unbounded_String;
IType: Unbounded_String;
Damage: Float;
Owned: Natural;
Available: Natural;
Id: Positive;
end record;
BaseIndex: constant Natural :=
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).BaseIndex;
Indexes_List: Positive_Container.Vector;
BaseCargo: constant BaseCargo_Container.Vector :=
Sky_Bases(BaseIndex).Cargo;
BaseCargoIndex: Natural;
ProtoIndex: Unbounded_String;
package Items_Container is new Vectors
(Index_Type => Positive, Element_Type => Local_Item_Data);
Local_Items: Items_Container.Vector;
function "<"(Left, Right: Local_Item_Data) return Boolean is
begin
if Items_Sort_Order = NAMEASC and then Left.Name < Right.Name then
return True;
end if;
if Items_Sort_Order = NAMEDESC and then Left.Name > Right.Name then
return True;
end if;
if Items_Sort_Order = TYPEASC and then Left.IType < Right.IType then
return True;
end if;
if Items_Sort_Order = TYPEDESC and then Left.IType > Right.IType then
return True;
end if;
if Items_Sort_Order = DURABILITYASC
and then Left.Damage < Right.Damage then
return True;
end if;
if Items_Sort_Order = DURABILITYDESC
and then Left.Damage > Right.Damage then
return True;
end if;
if Items_Sort_Order = OWNEDASC and then Left.Owned < Right.Owned then
return True;
end if;
if Items_Sort_Order = OWNEDDESC and then Left.Owned > Right.Owned then
return True;
end if;
if Items_Sort_Order = AVAILABLEASC
and then Left.Available < Right.Available then
return True;
end if;
if Items_Sort_Order = AVAILABLEDESC
and then Left.Available > Right.Available then
return True;
end if;
return False;
end "<";
package Sort_Items is new Items_Container.Generic_Sorting;
begin
case Column is
when 1 =>
if Items_Sort_Order = NAMEASC then
Items_Sort_Order := NAMEDESC;
else
Items_Sort_Order := NAMEASC;
end if;
when 2 =>
if Items_Sort_Order = TYPEASC then
Items_Sort_Order := TYPEDESC;
else
Items_Sort_Order := TYPEASC;
end if;
when 3 =>
if Items_Sort_Order = DURABILITYASC then
Items_Sort_Order := DURABILITYDESC;
else
Items_Sort_Order := DURABILITYASC;
end if;
when 4 =>
if Items_Sort_Order = OWNEDASC then
Items_Sort_Order := OWNEDDESC;
else
Items_Sort_Order := OWNEDASC;
end if;
when 5 =>
if Items_Sort_Order = AVAILABLEASC then
Items_Sort_Order := AVAILABLEDESC;
else
Items_Sort_Order := AVAILABLEASC;
end if;
when others =>
null;
end case;
if Items_Sort_Order = Default_Items_Sort_Order then
return TCL_OK;
end if;
for I in Player_Ship.Cargo.Iterate loop
ProtoIndex := Player_Ship.Cargo(I).ProtoIndex;
BaseCargoIndex :=
Find_Base_Cargo(ProtoIndex, Player_Ship.Cargo(I).Durability);
if BaseCargoIndex > 0 then
Indexes_List.Append(New_Item => BaseCargoIndex);
end if;
Local_Items.Append
(New_Item =>
(Name => To_Unbounded_String(GetItemName(Player_Ship.Cargo(I))),
IType =>
(if Items_List(ProtoIndex).ShowType = Null_Unbounded_String
then Items_List(ProtoIndex).IType
else Items_List(ProtoIndex).ShowType),
Damage =>
Float(Player_Ship.Cargo(I).Durability) /
Float(Default_Item_Durability),
Owned => Player_Ship.Cargo(I).Amount,
Available =>
(if BaseCargoIndex > 0 then BaseCargo(BaseCargoIndex).Amount
else 0),
Id => Inventory_Container.To_Index(I)));
end loop;
Sort_Items.Sort(Local_Items);
Items_Indexes.Clear;
for Item of Local_Items loop
Items_Indexes.Append(Item.Id);
end loop;
Items_Indexes.Append(0);
Local_Items.Clear;
for I in BaseCargo.First_Index .. BaseCargo.Last_Index loop
if Indexes_List.Find_Index(Item => I) = 0 then
ProtoIndex := BaseCargo(I).Proto_Index;
Local_Items.Append
(New_Item =>
(Name => Items_List(ProtoIndex).Name,
IType =>
(if Items_List(ProtoIndex).ShowType = Null_Unbounded_String
then Items_List(ProtoIndex).IType
else Items_List(ProtoIndex).ShowType),
Damage =>
Float(BaseCargo(I).Durability) /
Float(Default_Item_Durability),
Owned => 0, Available => BaseCargo(I).Amount, Id => I));
end if;
end loop;
Sort_Items.Sort(Local_Items);
for Item of Local_Items loop
Items_Indexes.Append(Item.Id);
end loop;
return
Show_Loot_Command
(ClientData, Interp, 2, CArgv.Empty & "ShowLoot" & "All");
end Sort_Items_Command;
procedure AddCommands is
begin
Add_Command("ShowLoot", Show_Loot_Command'Access);
Add_Command("ShowLootItemInfo", Show_Loot_Item_Info_Command'Access);
Add_Command("LootItem", Loot_Item_Command'Access);
Add_Command("ShowLootItemMenu", Show_Item_Menu_Command'Access);
Add_Command("LootAmount", Loot_Amount_Command'Access);
Add_Command("SortLootItems", Sort_Items_Command'Access);
end AddCommands;
end Bases.LootUI;
|
with Ada.Exception_Identification.From_Here;
with System.Address_To_Named_Access_Conversions;
with System.Standard_Allocators;
with System.Storage_Elements;
with System.Zero_Terminated_Strings;
with C.errno;
with C.fnmatch;
with C.stdint;
with C.sys.types;
package body System.Native_Directories.Searching is
use Ada.Exception_Identification.From_Here;
use type Storage_Elements.Storage_Offset;
use type C.char;
use type C.signed_int;
use type C.unsigned_char; -- d_namelen in FreeBSD
use type C.dirent.DIR_ptr;
use type C.size_t;
use type C.sys.dirent.struct_dirent_ptr;
use type C.sys.types.mode_t;
package char_ptr_Conv is
new Address_To_Named_Access_Conversions (C.char, C.char_ptr);
package dirent_ptr_Conv is
new Address_To_Named_Access_Conversions (
C.dirent.struct_dirent,
C.sys.dirent.struct_dirent_ptr);
procedure memcpy (
dst : not null C.sys.dirent.struct_dirent_ptr;
src : not null C.sys.dirent.struct_dirent_ptr;
n : Storage_Elements.Storage_Count)
with Import,
Convention => Intrinsic, External_Name => "__builtin_memcpy";
procedure Get_Information (
Directory : String;
Directory_Entry : not null Directory_Entry_Access;
Information : aliased out C.sys.stat.struct_stat;
errno : out C.signed_int);
procedure Get_Information (
Directory : String;
Directory_Entry : not null Directory_Entry_Access;
Information : aliased out C.sys.stat.struct_stat;
errno : out C.signed_int)
is
S_Length : constant C.size_t := C.size_t (Directory_Entry.d_namlen);
Full_Name : C.char_array (
0 ..
Directory'Length * Zero_Terminated_Strings.Expanding
+ 1 -- '/'
+ S_Length);
Full_Name_Length : C.size_t;
begin
-- compose
Zero_Terminated_Strings.To_C (
Directory,
Full_Name (0)'Access,
Full_Name_Length);
Full_Name (Full_Name_Length) := '/';
Full_Name_Length := Full_Name_Length + 1;
Full_Name (Full_Name_Length .. Full_Name_Length + S_Length - 1) :=
Directory_Entry.d_name (0 .. S_Length - 1);
Full_Name_Length := Full_Name_Length + S_Length;
Full_Name (Full_Name_Length) := C.char'Val (0);
-- stat
if C.sys.stat.lstat (Full_Name (0)'Access, Information'Access) < 0 then
errno := C.errno.errno;
else
errno := 0;
end if;
end Get_Information;
-- implementation
function New_Directory_Entry (Source : not null Directory_Entry_Access)
return not null Directory_Entry_Access
is
Result : constant Directory_Entry_Access :=
dirent_ptr_Conv.To_Pointer (
Standard_Allocators.Allocate (
Storage_Elements.Storage_Offset (Source.d_reclen)));
begin
memcpy (
Result,
Source,
Storage_Elements.Storage_Offset (Source.d_reclen));
return Result;
end New_Directory_Entry;
procedure Free (X : in out Directory_Entry_Access) is
begin
Standard_Allocators.Free (dirent_ptr_Conv.To_Address (X));
X := null;
end Free;
procedure Start_Search (
Search : aliased in out Search_Type;
Directory : String;
Pattern : String;
Filter : Filter_Type;
Directory_Entry : out Directory_Entry_Access;
Has_Next_Entry : out Boolean) is
begin
if Directory'Length = 0 then -- reject
Raise_Exception (Name_Error'Identity);
end if;
declare
C_Directory : C.char_array (
0 ..
Directory'Length * Zero_Terminated_Strings.Expanding);
Handle : C.dirent.DIR_ptr;
begin
Zero_Terminated_Strings.To_C (
Directory,
C_Directory (0)'Access);
Handle := C.dirent.opendir (C_Directory (0)'Access);
if Handle = null then
Raise_Exception (Named_IO_Exception_Id (C.errno.errno));
end if;
Search.Handle := Handle;
end;
Search.Filter := Filter;
Search.Pattern := char_ptr_Conv.To_Pointer (
Standard_Allocators.Allocate (
Storage_Elements.Storage_Offset (Pattern'Length)
* Zero_Terminated_Strings.Expanding
+ 1)); -- NUL
Zero_Terminated_Strings.To_C (Pattern, Search.Pattern);
Get_Next_Entry (Search, Directory_Entry, Has_Next_Entry);
end Start_Search;
procedure End_Search (
Search : aliased in out Search_Type;
Raise_On_Error : Boolean)
is
Handle : constant C.dirent.DIR_ptr := Search.Handle;
begin
Search.Handle := null;
Standard_Allocators.Free (char_ptr_Conv.To_Address (Search.Pattern));
Search.Pattern := null;
if C.dirent.closedir (Handle) < 0 and then Raise_On_Error then
Raise_Exception (IO_Exception_Id (C.errno.errno));
end if;
end End_Search;
procedure Get_Next_Entry (
Search : aliased in out Search_Type;
Directory_Entry : out Directory_Entry_Access;
Has_Next_Entry : out Boolean) is
begin
loop
C.errno.error.all := 0; -- clear errno
Directory_Entry := C.dirent.readdir (Search.Handle);
declare
errno : constant C.signed_int := C.errno.errno;
begin
if errno /= 0 then
Raise_Exception (IO_Exception_Id (errno));
elsif Directory_Entry = null then
Has_Next_Entry := False; -- end
exit;
end if;
end;
if Search.Filter (Kind (Directory_Entry))
and then C.fnmatch.fnmatch (
Search.Pattern,
Directory_Entry.d_name (0)'Access, 0) = 0
and then (
Directory_Entry.d_name (0) /= '.'
or else (
Directory_Entry.d_namlen > 1
and then (
Directory_Entry.d_name (1) /= '.'
or else Directory_Entry.d_namlen > 2)))
then
Has_Next_Entry := True;
exit; -- found
end if;
end loop;
end Get_Next_Entry;
procedure Get_Entry (
Directory : String;
Name : String;
Directory_Entry : aliased out Directory_Entry_Access;
Additional : aliased in out Directory_Entry_Additional_Type)
is
Dummy_dirent : C.sys.dirent.struct_dirent; -- to use 'Position
Name_Length : constant C.size_t := Name'Length;
Record_Length : constant Storage_Elements.Storage_Count :=
Storage_Elements.Storage_Offset'Max (
C.sys.dirent.struct_dirent'Size / Standard'Storage_Unit,
Dummy_dirent.d_name'Position
+ Storage_Elements.Storage_Offset (Name_Length + 1));
errno : C.signed_int;
begin
-- allocation
Directory_Entry := dirent_ptr_Conv.To_Pointer (
Standard_Allocators.Allocate (Record_Length));
-- filling components
-- Directory_Entry.d_seekoff := 0; -- missing in FreeBSD
Directory_Entry.d_reclen := C.stdint.uint16_t (Record_Length);
declare
function To_namlen (X : C.size_t) return C.stdint.uint16_t; -- OSX
function To_namlen (X : C.size_t) return C.stdint.uint16_t is
begin
return C.stdint.uint16_t (X);
end To_namlen;
function To_namlen (X : C.size_t) return C.stdint.uint8_t; -- FreeBSD
function To_namlen (X : C.size_t) return C.stdint.uint8_t is
begin
return C.stdint.uint8_t (X);
end To_namlen;
pragma Warnings (Off, To_namlen);
begin
Directory_Entry.d_namlen := To_namlen (Name_Length);
end;
Zero_Terminated_Strings.To_C (Name, Directory_Entry.d_name (0)'Access);
Get_Information (Directory, Directory_Entry, Additional.Information,
errno => errno);
if errno /= 0 then
Raise_Exception (Named_IO_Exception_Id (errno));
end if;
Directory_Entry.d_ino := Additional.Information.st_ino;
Directory_Entry.d_type := C.stdint.uint8_t (
C.Shift_Right (Additional.Information.st_mode, 12));
Additional.Filled := True;
end Get_Entry;
function Simple_Name (Directory_Entry : not null Directory_Entry_Access)
return String is
begin
return Zero_Terminated_Strings.Value (
Directory_Entry.d_name (0)'Access,
C.size_t (Directory_Entry.d_namlen));
end Simple_Name;
function Kind (Directory_Entry : not null Directory_Entry_Access)
return File_Kind is
begin
-- DTTOIF
return Kind (
C.Shift_Left (C.sys.types.mode_t (Directory_Entry.d_type), 12));
end Kind;
function Size (
Directory : String;
Directory_Entry : not null Directory_Entry_Access;
Additional : aliased in out Directory_Entry_Additional_Type)
return Ada.Streams.Stream_Element_Count is
begin
if not Additional.Filled then
Get_Information (Directory, Directory_Entry, Additional.Information);
Additional.Filled := True;
end if;
return Ada.Streams.Stream_Element_Offset (
Additional.Information.st_size);
end Size;
function Modification_Time (
Directory : String;
Directory_Entry : not null Directory_Entry_Access;
Additional : aliased in out Directory_Entry_Additional_Type)
return Native_Calendar.Native_Time is
begin
if not Additional.Filled then
Get_Information (Directory, Directory_Entry, Additional.Information);
Additional.Filled := True;
end if;
return Additional.Information.st_mtim;
end Modification_Time;
procedure Get_Information (
Directory : String;
Directory_Entry : not null Directory_Entry_Access;
Information : aliased out C.sys.stat.struct_stat)
is
errno : C.signed_int;
begin
Get_Information (Directory, Directory_Entry, Information,
errno => errno);
if errno /= 0 then
Raise_Exception (IO_Exception_Id (errno));
end if;
end Get_Information;
end System.Native_Directories.Searching;
|
------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- ADA.STRINGS.FIXED.LESS_CASE_INSENSITIVE --
-- --
-- S p e c --
-- --
-- Copyright (C) 2011, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
with Ada.Strings.Less_Case_Insensitive;
function Ada.Strings.Fixed.Less_Case_Insensitive
(Left, Right : String)
return Boolean renames Ada.Strings.Less_Case_Insensitive;
pragma Pure (Ada.Strings.Fixed.Less_Case_Insensitive);
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T C M D --
-- --
-- B o d y --
-- --
-- Copyright (C) 1996-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. --
-- --
------------------------------------------------------------------------------
with GNAT.Directory_Operations; use GNAT.Directory_Operations;
with Csets;
with MLib.Tgt; use MLib.Tgt;
with MLib.Utl;
with Namet; use Namet;
with Opt; use Opt;
with Osint; use Osint;
with Output;
with Prj; use Prj;
with Prj.Env;
with Prj.Ext; use Prj.Ext;
with Prj.Pars;
with Prj.Util; use Prj.Util;
with Sinput.P;
with Snames; use Snames;
with Table;
with Types; use Types;
with Hostparm; use Hostparm;
-- Used to determine if we are in VMS or not for error message purposes
with Ada.Characters.Handling; use Ada.Characters.Handling;
with Ada.Command_Line; use Ada.Command_Line;
with Ada.Text_IO; use Ada.Text_IO;
with GNAT.OS_Lib; use GNAT.OS_Lib;
with VMS_Conv; use VMS_Conv;
procedure GNATCmd is
Project_Tree : constant Project_Tree_Ref := new Project_Tree_Data;
Project_File : String_Access;
Project : Prj.Project_Id;
Current_Verbosity : Prj.Verbosity := Prj.Default;
Tool_Package_Name : Name_Id := No_Name;
Old_Project_File_Used : Boolean := False;
-- This flag indicates a switch -p (for gnatxref and gnatfind) for
-- an old fashioned project file. -p cannot be used in conjonction
-- with -P.
Max_Files_On_The_Command_Line : constant := 30; -- Arbitrary
Temp_File_Name : String_Access := null;
-- The name of the temporary text file to put a list of source/object
-- files to pass to a tool, when there are more than
-- Max_Files_On_The_Command_Line files.
package First_Switches is new Table.Table
(Table_Component_Type => String_Access,
Table_Index_Type => Integer,
Table_Low_Bound => 1,
Table_Initial => 20,
Table_Increment => 100,
Table_Name => "Gnatcmd.First_Switches");
-- A table to keep the switches from the project file
package Carg_Switches is new Table.Table
(Table_Component_Type => String_Access,
Table_Index_Type => Integer,
Table_Low_Bound => 1,
Table_Initial => 20,
Table_Increment => 100,
Table_Name => "Gnatcmd.Carg_Switches");
-- A table to keep the switches following -cargs for ASIS tools
package Rules_Switches is new Table.Table
(Table_Component_Type => String_Access,
Table_Index_Type => Integer,
Table_Low_Bound => 1,
Table_Initial => 20,
Table_Increment => 100,
Table_Name => "Gnatcmd.Rules_Switches");
-- A table to keep the switches following -rules for gnatcheck
package Library_Paths is new Table.Table (
Table_Component_Type => String_Access,
Table_Index_Type => Integer,
Table_Low_Bound => 1,
Table_Initial => 20,
Table_Increment => 100,
Table_Name => "Make.Library_Path");
-- Packages of project files to pass to Prj.Pars.Parse, depending on the
-- tool. We allocate objects because we cannot declare aliased objects
-- as we are in a procedure, not a library level package.
Naming_String : constant String_Access := new String'("naming");
Binder_String : constant String_Access := new String'("binder");
Compiler_String : constant String_Access := new String'("compiler");
Check_String : constant String_Access := new String'("check");
Eliminate_String : constant String_Access := new String'("eliminate");
Finder_String : constant String_Access := new String'("finder");
Linker_String : constant String_Access := new String'("linker");
Gnatls_String : constant String_Access := new String'("gnatls");
Pretty_String : constant String_Access := new String'("pretty_printer");
Gnatstub_String : constant String_Access := new String'("gnatstub");
Metric_String : constant String_Access := new String'("metrics");
Xref_String : constant String_Access := new String'("cross_reference");
Packages_To_Check_By_Binder : constant String_List_Access :=
new String_List'((Naming_String, Binder_String));
Packages_To_Check_By_Check : constant String_List_Access :=
new String_List'((Naming_String, Check_String, Compiler_String));
Packages_To_Check_By_Eliminate : constant String_List_Access :=
new String_List'((Naming_String, Eliminate_String, Compiler_String));
Packages_To_Check_By_Finder : constant String_List_Access :=
new String_List'((Naming_String, Finder_String));
Packages_To_Check_By_Linker : constant String_List_Access :=
new String_List'((Naming_String, Linker_String));
Packages_To_Check_By_Gnatls : constant String_List_Access :=
new String_List'((Naming_String, Gnatls_String));
Packages_To_Check_By_Pretty : constant String_List_Access :=
new String_List'((Naming_String, Pretty_String, Compiler_String));
Packages_To_Check_By_Gnatstub : constant String_List_Access :=
new String_List'((Naming_String, Gnatstub_String, Compiler_String));
Packages_To_Check_By_Metric : constant String_List_Access :=
new String_List'((Naming_String, Metric_String, Compiler_String));
Packages_To_Check_By_Xref : constant String_List_Access :=
new String_List'((Naming_String, Xref_String));
Packages_To_Check : String_List_Access := Prj.All_Packages;
----------------------------------
-- Declarations for GNATCMD use --
----------------------------------
The_Command : Command_Type;
-- The command specified in the invocation of the GNAT driver
Command_Arg : Positive := 1;
-- The index of the command in the arguments of the GNAT driver
My_Exit_Status : Exit_Status := Success;
-- The exit status of the spawned tool. Used to set the correct VMS
-- exit status.
Current_Work_Dir : constant String := Get_Current_Dir;
-- The path of the working directory
All_Projects : Boolean := False;
-- Flag used for GNAT PRETTY and GNAT METRIC to indicate that
-- the underlying tool (gnatcheck, gnatpp or gnatmetric) should be invoked
-- for all sources of all projects.
-----------------------
-- Local Subprograms --
-----------------------
procedure Add_To_Carg_Switches (Switch : String_Access);
-- Add a switch to the Carg_Switches table. If it is the first one,
-- put the switch "-cargs" at the beginning of the table.
procedure Add_To_Rules_Switches (Switch : String_Access);
-- Add a switch to the Rules_Switches table. If it is the first one,
-- put the switch "-crules" at the beginning of the table.
procedure Check_Files;
-- For GNAT LIST, GNAT PRETTY and GNAT METRIC, check if a project
-- file is specified, without any file arguments. If it is the case,
-- invoke the GNAT tool with the proper list of files, derived from
-- the sources of the project.
function Check_Project
(Project : Project_Id;
Root_Project : Project_Id) return Boolean;
-- Returns True if Project = Root_Project.
-- For GNAT METRIC, also returns True if Project is extended by
-- Root_Project.
procedure Check_Relative_Executable (Name : in out String_Access);
-- Check if an executable is specified as a relative path.
-- If it is, and the path contains directory information, fail.
-- Otherwise, prepend the exec directory.
-- This procedure is only used for GNAT LINK when a project file
-- is specified.
function Configuration_Pragmas_File return Name_Id;
-- Return an argument, if there is a configuration pragmas file to be
-- specified for Project, otherwise return No_Name.
-- Used for gnatstub (GNAT STUB), gnatpp (GNAT PRETTY), gnatelim
-- (GNAT ELIM), and gnatmetric (GNAT METRIC).
procedure Delete_Temp_Config_Files;
-- Delete all temporary config files
function Index (Char : Character; Str : String) return Natural;
-- Returns the first occurrence of Char in Str.
-- Returns 0 if Char is not in Str.
procedure Non_VMS_Usage;
-- Display usage for platforms other than VMS
procedure Process_Link;
-- Process GNAT LINK, when there is a project file specified
procedure Set_Library_For
(Project : Project_Id;
There_Are_Libraries : in out Boolean);
-- If Project is a library project, add the correct
-- -L and -l switches to the linker invocation.
procedure Set_Libraries is
new For_Every_Project_Imported (Boolean, Set_Library_For);
-- Add the -L and -l switches to the linker for all
-- of the library projects.
procedure Test_If_Relative_Path
(Switch : in out String_Access;
Parent : String);
-- Test if Switch is a relative search path switch.
-- If it is and it includes directory information, prepend the path with
-- Parent.This subprogram is only called when using project files.
--------------------------
-- Add_To_Carg_Switches --
--------------------------
procedure Add_To_Carg_Switches (Switch : String_Access) is
begin
-- If the Carg_Switches table is empty, put "-cargs" at the beginning
if Carg_Switches.Last = 0 then
Carg_Switches.Increment_Last;
Carg_Switches.Table (Carg_Switches.Last) := new String'("-cargs");
end if;
Carg_Switches.Increment_Last;
Carg_Switches.Table (Carg_Switches.Last) := Switch;
end Add_To_Carg_Switches;
---------------------------
-- Add_To_Rules_Switches --
---------------------------
procedure Add_To_Rules_Switches (Switch : String_Access) is
begin
-- If the Rules_Switches table is empty, put "-rules" at the beginning
if Rules_Switches.Last = 0 then
Rules_Switches.Increment_Last;
Rules_Switches.Table (Rules_Switches.Last) := new String'("-rules");
end if;
Rules_Switches.Increment_Last;
Rules_Switches.Table (Rules_Switches.Last) := Switch;
end Add_To_Rules_Switches;
-----------------
-- Check_Files --
-----------------
procedure Check_Files is
Add_Sources : Boolean := True;
Unit_Data : Prj.Unit_Data;
Subunit : Boolean := False;
begin
-- Check if there is at least one argument that is not a switch
for Index in 1 .. Last_Switches.Last loop
if Last_Switches.Table (Index) (1) /= '-' then
Add_Sources := False;
exit;
end if;
end loop;
-- If all arguments were switches, add the path names of
-- all the sources of the main project.
if Add_Sources then
declare
Current_Last : constant Integer := Last_Switches.Last;
begin
for Unit in Unit_Table.First ..
Unit_Table.Last (Project_Tree.Units)
loop
Unit_Data := Project_Tree.Units.Table (Unit);
-- For gnatls, we only need to put the library units,
-- body or spec, but not the subunits.
if The_Command = List then
if
Unit_Data.File_Names (Body_Part).Name /= No_Name
then
-- There is a body; check if it is for this
-- project.
if Unit_Data.File_Names (Body_Part).Project =
Project
then
Subunit := False;
if Unit_Data.File_Names (Specification).Name =
No_Name
then
-- We have a body with no spec: we need
-- to check if this is a subunit, because
-- gnatls will complain about subunits.
declare
Src_Ind : Source_File_Index;
begin
Src_Ind := Sinput.P.Load_Project_File
(Get_Name_String
(Unit_Data.File_Names
(Body_Part).Path));
Subunit :=
Sinput.P.Source_File_Is_Subunit
(Src_Ind);
end;
end if;
if not Subunit then
Last_Switches.Increment_Last;
Last_Switches.Table (Last_Switches.Last) :=
new String'
(Get_Name_String
(Unit_Data.File_Names
(Body_Part).Display_Name));
end if;
end if;
elsif Unit_Data.File_Names (Specification).Name /=
No_Name
then
-- We have a spec with no body; check if it is
-- for this project.
if Unit_Data.File_Names (Specification).Project =
Project
then
Last_Switches.Increment_Last;
Last_Switches.Table (Last_Switches.Last) :=
new String'
(Get_Name_String
(Unit_Data.File_Names
(Specification).Display_Name));
end if;
end if;
else
-- For gnatcheck, gnatpp and gnatmetric, put all sources
-- of the project, or of all projects if -U was specified.
for Kind in Spec_Or_Body loop
-- Put only sources that belong to the main
-- project.
if Check_Project
(Unit_Data.File_Names (Kind).Project, Project)
then
Last_Switches.Increment_Last;
Last_Switches.Table (Last_Switches.Last) :=
new String'
(Get_Name_String
(Unit_Data.File_Names
(Kind).Display_Path));
end if;
end loop;
end if;
end loop;
-- If the list of files is too long, create a temporary
-- text file that lists these files, and pass this temp
-- file to gnatcheck, gnatpp or gnatmetric using switch -files=.
if Last_Switches.Last - Current_Last >
Max_Files_On_The_Command_Line
then
declare
Temp_File_FD : File_Descriptor;
Buffer : String (1 .. 1_000);
Len : Natural;
OK : Boolean := True;
begin
Create_Temp_File (Temp_File_FD, Temp_File_Name);
if Temp_File_Name /= null then
for Index in Current_Last + 1 ..
Last_Switches.Last
loop
Len := Last_Switches.Table (Index)'Length;
Buffer (1 .. Len) :=
Last_Switches.Table (Index).all;
Len := Len + 1;
Buffer (Len) := ASCII.LF;
Buffer (Len + 1) := ASCII.NUL;
OK :=
Write (Temp_File_FD,
Buffer (1)'Address,
Len) = Len;
exit when not OK;
end loop;
if OK then
Close (Temp_File_FD, OK);
else
Close (Temp_File_FD, OK);
OK := False;
end if;
-- If there were any problem creating the temp
-- file, then pass the list of files.
if OK then
-- Replace the list of files with
-- "-files=<temp file name>".
Last_Switches.Set_Last (Current_Last + 1);
Last_Switches.Table (Last_Switches.Last) :=
new String'("-files=" & Temp_File_Name.all);
end if;
end if;
end;
end if;
end;
end if;
end Check_Files;
-------------------
-- Check_Project --
-------------------
function Check_Project
(Project : Project_Id;
Root_Project : Project_Id) return Boolean
is
begin
if Project = No_Project then
return False;
elsif All_Projects or Project = Root_Project then
return True;
elsif The_Command = Metric then
declare
Data : Project_Data :=
Project_Tree.Projects.Table (Root_Project);
begin
while Data.Extends /= No_Project loop
if Project = Data.Extends then
return True;
end if;
Data := Project_Tree.Projects.Table (Data.Extends);
end loop;
end;
end if;
return False;
end Check_Project;
-------------------------------
-- Check_Relative_Executable --
-------------------------------
procedure Check_Relative_Executable (Name : in out String_Access) is
Exec_File_Name : constant String := Name.all;
begin
if not Is_Absolute_Path (Exec_File_Name) then
for Index in Exec_File_Name'Range loop
if Exec_File_Name (Index) = Directory_Separator then
Fail ("relative executable (""" &
Exec_File_Name &
""") with directory part not allowed " &
"when using project files");
end if;
end loop;
Get_Name_String (Project_Tree.Projects.Table
(Project).Exec_Directory);
if Name_Buffer (Name_Len) /= Directory_Separator then
Name_Len := Name_Len + 1;
Name_Buffer (Name_Len) := Directory_Separator;
end if;
Name_Buffer (Name_Len + 1 ..
Name_Len + Exec_File_Name'Length) :=
Exec_File_Name;
Name_Len := Name_Len + Exec_File_Name'Length;
Name := new String'(Name_Buffer (1 .. Name_Len));
end if;
end Check_Relative_Executable;
--------------------------------
-- Configuration_Pragmas_File --
--------------------------------
function Configuration_Pragmas_File return Name_Id is
begin
Prj.Env.Create_Config_Pragmas_File
(Project, Project, Project_Tree, Include_Config_Files => False);
return Project_Tree.Projects.Table (Project).Config_File_Name;
end Configuration_Pragmas_File;
------------------------------
-- Delete_Temp_Config_Files --
------------------------------
procedure Delete_Temp_Config_Files is
Success : Boolean;
begin
if not Keep_Temporary_Files then
if Project /= No_Project then
for Prj in Project_Table.First ..
Project_Table.Last (Project_Tree.Projects)
loop
if
Project_Tree.Projects.Table (Prj).Config_File_Temp
then
if Verbose_Mode then
Output.Write_Str ("Deleting temp configuration file """);
Output.Write_Str
(Get_Name_String
(Project_Tree.Projects.Table
(Prj).Config_File_Name));
Output.Write_Line ("""");
end if;
Delete_File
(Name => Get_Name_String
(Project_Tree.Projects.Table
(Prj).Config_File_Name),
Success => Success);
end if;
end loop;
end if;
-- If a temporary text file that contains a list of files for a tool
-- has been created, delete this temporary file.
if Temp_File_Name /= null then
Delete_File (Temp_File_Name.all, Success);
end if;
end if;
end Delete_Temp_Config_Files;
-----------
-- Index --
-----------
function Index (Char : Character; Str : String) return Natural is
begin
for Index in Str'Range loop
if Str (Index) = Char then
return Index;
end if;
end loop;
return 0;
end Index;
------------------
-- Process_Link --
------------------
procedure Process_Link is
Look_For_Executable : Boolean := True;
There_Are_Libraries : Boolean := False;
Path_Option : constant String_Access :=
MLib.Linker_Library_Path_Option;
Prj : Project_Id := Project;
Arg : String_Access;
Last : Natural := 0;
Skip_Executable : Boolean := False;
begin
-- Add the default search directories, to be able to find
-- libgnat in call to MLib.Utl.Lib_Directory.
Add_Default_Search_Dirs;
Library_Paths.Set_Last (0);
-- Check if there are library project files
if MLib.Tgt.Support_For_Libraries /= MLib.Tgt.None then
Set_Libraries (Project, Project_Tree, There_Are_Libraries);
end if;
-- If there are, add the necessary additional switches
if There_Are_Libraries then
-- Add -L<lib_dir> -lgnarl -lgnat -Wl,-rpath,<lib_dir>
Last_Switches.Increment_Last;
Last_Switches.Table (Last_Switches.Last) :=
new String'("-L" & MLib.Utl.Lib_Directory);
Last_Switches.Increment_Last;
Last_Switches.Table (Last_Switches.Last) :=
new String'("-lgnarl");
Last_Switches.Increment_Last;
Last_Switches.Table (Last_Switches.Last) :=
new String'("-lgnat");
-- If Path_Option is not null, create the switch
-- ("-Wl,-rpath," or equivalent) with all the library dirs
-- plus the standard GNAT library dir.
if Path_Option /= null then
declare
Option : String_Access;
Length : Natural := Path_Option'Length;
Current : Natural;
begin
-- First, compute the exact length for the switch
for Index in
Library_Paths.First .. Library_Paths.Last
loop
-- Add the length of the library dir plus one
-- for the directory separator.
Length :=
Length +
Library_Paths.Table (Index)'Length + 1;
end loop;
-- Finally, add the length of the standard GNAT
-- library dir.
Length := Length + MLib.Utl.Lib_Directory'Length;
Option := new String (1 .. Length);
Option (1 .. Path_Option'Length) := Path_Option.all;
Current := Path_Option'Length;
-- Put each library dir followed by a dir separator
for Index in
Library_Paths.First .. Library_Paths.Last
loop
Option
(Current + 1 ..
Current +
Library_Paths.Table (Index)'Length) :=
Library_Paths.Table (Index).all;
Current :=
Current +
Library_Paths.Table (Index)'Length + 1;
Option (Current) := Path_Separator;
end loop;
-- Finally put the standard GNAT library dir
Option
(Current + 1 ..
Current + MLib.Utl.Lib_Directory'Length) :=
MLib.Utl.Lib_Directory;
-- And add the switch to the last switches
Last_Switches.Increment_Last;
Last_Switches.Table (Last_Switches.Last) :=
Option;
end;
end if;
end if;
-- Check if the first ALI file specified can be found, either
-- in the object directory of the main project or in an object
-- directory of a project file extended by the main project.
-- If the ALI file can be found, replace its name with its
-- absolute path.
Skip_Executable := False;
Switch_Loop : for J in 1 .. Last_Switches.Last loop
-- If we have an executable just reset the flag
if Skip_Executable then
Skip_Executable := False;
-- If -o, set flag so that next switch is not processed
elsif Last_Switches.Table (J).all = "-o" then
Skip_Executable := True;
-- Normal case
else
declare
Switch : constant String :=
Last_Switches.Table (J).all;
ALI_File : constant String (1 .. Switch'Length + 4) :=
Switch & ".ali";
Test_Existence : Boolean := False;
begin
Last := Switch'Length;
-- Skip real switches
if Switch'Length /= 0
and then Switch (Switch'First) /= '-'
then
-- Append ".ali" if file name does not end with it
if Switch'Length <= 4
or else Switch (Switch'Last - 3 .. Switch'Last)
/= ".ali"
then
Last := ALI_File'Last;
end if;
-- If file name includes directory information,
-- stop if ALI file exists.
if Is_Absolute_Path (ALI_File (1 .. Last)) then
Test_Existence := True;
else
for K in Switch'Range loop
if Switch (K) = '/' or else
Switch (K) = Directory_Separator
then
Test_Existence := True;
exit;
end if;
end loop;
end if;
if Test_Existence then
if Is_Regular_File (ALI_File (1 .. Last)) then
exit Switch_Loop;
end if;
-- Look in object directories if ALI file exists
else
Project_Loop : loop
declare
Dir : constant String :=
Get_Name_String
(Project_Tree.Projects.Table
(Prj).Object_Directory);
begin
if Is_Regular_File
(Dir &
Directory_Separator &
ALI_File (1 .. Last))
then
-- We have found the correct project, so we
-- replace the file with the absolute path.
Last_Switches.Table (J) :=
new String'
(Dir & Directory_Separator &
ALI_File (1 .. Last));
-- And we are done
exit Switch_Loop;
end if;
end;
-- Go to the project being extended,
-- if any.
Prj :=
Project_Tree.Projects.Table (Prj).Extends;
exit Project_Loop when Prj = No_Project;
end loop Project_Loop;
end if;
end if;
end;
end if;
end loop Switch_Loop;
-- If a relative path output file has been specified, we add
-- the exec directory.
for J in reverse 1 .. Last_Switches.Last - 1 loop
if Last_Switches.Table (J).all = "-o" then
Check_Relative_Executable
(Name => Last_Switches.Table (J + 1));
Look_For_Executable := False;
exit;
end if;
end loop;
if Look_For_Executable then
for J in reverse 1 .. First_Switches.Last - 1 loop
if First_Switches.Table (J).all = "-o" then
Look_For_Executable := False;
Check_Relative_Executable
(Name => First_Switches.Table (J + 1));
exit;
end if;
end loop;
end if;
-- If no executable is specified, then find the name
-- of the first ALI file on the command line and issue
-- a -o switch with the absolute path of the executable
-- in the exec directory.
if Look_For_Executable then
for J in 1 .. Last_Switches.Last loop
Arg := Last_Switches.Table (J);
Last := 0;
if Arg'Length /= 0 and then Arg (Arg'First) /= '-' then
if Arg'Length > 4
and then Arg (Arg'Last - 3 .. Arg'Last) = ".ali"
then
Last := Arg'Last - 4;
elsif Is_Regular_File (Arg.all & ".ali") then
Last := Arg'Last;
end if;
if Last /= 0 then
Last_Switches.Increment_Last;
Last_Switches.Table (Last_Switches.Last) :=
new String'("-o");
Get_Name_String
(Project_Tree.Projects.Table
(Project).Exec_Directory);
Last_Switches.Increment_Last;
Last_Switches.Table (Last_Switches.Last) :=
new String'(Name_Buffer (1 .. Name_Len) &
Directory_Separator &
Base_Name (Arg (Arg'First .. Last)) &
Get_Executable_Suffix.all);
exit;
end if;
end if;
end loop;
end if;
end Process_Link;
---------------------
-- Set_Library_For --
---------------------
procedure Set_Library_For
(Project : Project_Id;
There_Are_Libraries : in out Boolean)
is
Path_Option : constant String_Access :=
MLib.Linker_Library_Path_Option;
begin
-- Case of library project
if Project_Tree.Projects.Table (Project).Library then
There_Are_Libraries := True;
-- Add the -L switch
Last_Switches.Increment_Last;
Last_Switches.Table (Last_Switches.Last) :=
new String'("-L" &
Get_Name_String
(Project_Tree.Projects.Table
(Project).Library_Dir));
-- Add the -l switch
Last_Switches.Increment_Last;
Last_Switches.Table (Last_Switches.Last) :=
new String'("-l" &
Get_Name_String
(Project_Tree.Projects.Table
(Project).Library_Name));
-- Add the directory to table Library_Paths, to be processed later
-- if library is not static and if Path_Option is not null.
if Project_Tree.Projects.Table (Project).Library_Kind /=
Static
and then Path_Option /= null
then
Library_Paths.Increment_Last;
Library_Paths.Table (Library_Paths.Last) :=
new String'(Get_Name_String
(Project_Tree.Projects.Table
(Project).Library_Dir));
end if;
end if;
end Set_Library_For;
---------------------------
-- Test_If_Relative_Path --
---------------------------
procedure Test_If_Relative_Path
(Switch : in out String_Access;
Parent : String)
is
begin
if Switch /= null then
declare
Sw : String (1 .. Switch'Length);
Start : Positive := 1;
begin
Sw := Switch.all;
if Sw (1) = '-' then
if Sw'Length >= 3
and then (Sw (2) = 'A' or else
Sw (2) = 'I' or else
Sw (2) = 'L')
then
Start := 3;
if Sw = "-I-" then
return;
end if;
elsif Sw'Length >= 4
and then (Sw (2 .. 3) = "aL" or else
Sw (2 .. 3) = "aO" or else
Sw (2 .. 3) = "aI")
then
Start := 4;
elsif Sw'Length >= 7
and then Sw (2 .. 6) = "-RTS="
then
Start := 7;
else
return;
end if;
end if;
-- If the path is relative, test if it includes directory
-- information. If it does, prepend Parent to the path.
if not Is_Absolute_Path (Sw (Start .. Sw'Last)) then
for J in Start .. Sw'Last loop
if Sw (J) = Directory_Separator then
Switch :=
new String'
(Sw (1 .. Start - 1) &
Parent &
Directory_Separator &
Sw (Start .. Sw'Last));
return;
end if;
end loop;
end if;
end;
end if;
end Test_If_Relative_Path;
-------------------
-- Non_VMS_Usage --
-------------------
procedure Non_VMS_Usage is
begin
Output_Version;
New_Line;
Put_Line ("List of available commands");
New_Line;
for C in Command_List'Range loop
if not Command_List (C).VMS_Only then
Put ("gnat " & To_Lower (Command_List (C).Cname.all));
Set_Col (25);
Put (Command_List (C).Unixcmd.all);
declare
Sws : Argument_List_Access renames Command_List (C).Unixsws;
begin
if Sws /= null then
for J in Sws'Range loop
Put (' ');
Put (Sws (J).all);
end loop;
end if;
end;
New_Line;
end if;
end loop;
New_Line;
Put_Line ("Commands find, list, metric, pretty, stub and xref accept " &
"project file switches -vPx, -Pprj and -Xnam=val");
New_Line;
end Non_VMS_Usage;
-------------------------------------
-- Start of processing for GNATCmd --
-------------------------------------
begin
-- Initializations
Namet.Initialize;
Csets.Initialize;
Snames.Initialize;
Prj.Initialize (Project_Tree);
Last_Switches.Init;
Last_Switches.Set_Last (0);
First_Switches.Init;
First_Switches.Set_Last (0);
Carg_Switches.Init;
Carg_Switches.Set_Last (0);
Rules_Switches.Init;
Rules_Switches.Set_Last (0);
VMS_Conv.Initialize;
-- Add the directory where the GNAT driver is invoked in front of the
-- path, if the GNAT driver is invoked with directory information.
-- Only do this if the platform is not VMS, where the notion of path
-- does not really exist.
if not OpenVMS then
declare
Command : constant String := Command_Name;
begin
for Index in reverse Command'Range loop
if Command (Index) = Directory_Separator then
declare
Absolute_Dir : constant String :=
Normalize_Pathname
(Command (Command'First .. Index));
PATH : constant String :=
Absolute_Dir &
Path_Separator &
Getenv ("PATH").all;
begin
Setenv ("PATH", PATH);
end;
exit;
end if;
end loop;
end;
end if;
-- If on VMS, or if VMS emulation is on, convert VMS style /qualifiers,
-- filenames and pathnames to Unix style.
if Hostparm.OpenVMS
or else To_Lower (Getenv ("EMULATE_VMS").all) = "true"
then
VMS_Conversion (The_Command);
-- If not on VMS, scan the command line directly
else
if Argument_Count = 0 then
Non_VMS_Usage;
return;
else
begin
loop
if Argument_Count > Command_Arg
and then Argument (Command_Arg) = "-v"
then
Verbose_Mode := True;
Command_Arg := Command_Arg + 1;
elsif Argument_Count > Command_Arg
and then Argument (Command_Arg) = "-dn"
then
Keep_Temporary_Files := True;
Command_Arg := Command_Arg + 1;
else
exit;
end if;
end loop;
The_Command := Real_Command_Type'Value (Argument (Command_Arg));
if Command_List (The_Command).VMS_Only then
Non_VMS_Usage;
Fail
("Command """,
Command_List (The_Command).Cname.all,
""" can only be used on VMS");
end if;
exception
when Constraint_Error =>
-- Check if it is an alternate command
declare
Alternate : Alternate_Command;
begin
Alternate := Alternate_Command'Value
(Argument (Command_Arg));
The_Command := Corresponding_To (Alternate);
exception
when Constraint_Error =>
Non_VMS_Usage;
Fail ("Unknown command: ", Argument (Command_Arg));
end;
end;
-- Get the arguments from the command line and from the eventual
-- argument file(s) specified on the command line.
for Arg in Command_Arg + 1 .. Argument_Count loop
declare
The_Arg : constant String := Argument (Arg);
begin
-- Check if an argument file is specified
if The_Arg (The_Arg'First) = '@' then
declare
Arg_File : Ada.Text_IO.File_Type;
Line : String (1 .. 256);
Last : Natural;
begin
-- Open the file and fail if the file cannot be found
begin
Open
(Arg_File, In_File,
The_Arg (The_Arg'First + 1 .. The_Arg'Last));
exception
when others =>
Put
(Standard_Error, "Cannot open argument file """);
Put
(Standard_Error,
The_Arg (The_Arg'First + 1 .. The_Arg'Last));
Put_Line (Standard_Error, """");
raise Error_Exit;
end;
-- Read line by line and put the content of each
-- non empty line in the Last_Switches table.
while not End_Of_File (Arg_File) loop
Get_Line (Arg_File, Line, Last);
if Last /= 0 then
Last_Switches.Increment_Last;
Last_Switches.Table (Last_Switches.Last) :=
new String'(Line (1 .. Last));
end if;
end loop;
Close (Arg_File);
end;
else
-- It is not an argument file; just put the argument in
-- the Last_Switches table.
Last_Switches.Increment_Last;
Last_Switches.Table (Last_Switches.Last) :=
new String'(The_Arg);
end if;
end;
end loop;
end if;
end if;
declare
Program : constant String :=
Program_Name (Command_List (The_Command).Unixcmd.all).all;
Exec_Path : String_Access;
begin
-- First deal with built-in command(s)
if The_Command = Setup then
Process_Setup :
declare
Arg_Num : Positive := 1;
Argv : String_Access;
begin
while Arg_Num <= Last_Switches.Last loop
Argv := Last_Switches.Table (Arg_Num);
if Argv (Argv'First) /= '-' then
Fail ("invalid parameter """, Argv.all, """");
else
if Argv'Length = 1 then
Fail
("switch character cannot be followed by a blank");
end if;
-- -vPx Specify verbosity while parsing project files
if Argv'Length = 4
and then Argv (Argv'First + 1 .. Argv'First + 2) = "vP"
then
case Argv (Argv'Last) is
when '0' =>
Current_Verbosity := Prj.Default;
when '1' =>
Current_Verbosity := Prj.Medium;
when '2' =>
Current_Verbosity := Prj.High;
when others =>
Fail ("Invalid switch: ", Argv.all);
end case;
-- -Pproject_file Specify project file to be used
elsif Argv (Argv'First + 1) = 'P' then
-- Only one -P switch can be used
if Project_File /= null then
Fail
(Argv.all,
": second project file forbidden (first is """,
Project_File.all & """)");
elsif Argv'Length = 2 then
-- There is space between -P and the project file
-- name. -P cannot be the last option.
if Arg_Num = Last_Switches.Last then
Fail ("project file name missing after -P");
else
Arg_Num := Arg_Num + 1;
Argv := Last_Switches.Table (Arg_Num);
-- After -P, there must be a project file name,
-- not another switch.
if Argv (Argv'First) = '-' then
Fail ("project file name missing after -P");
else
Project_File := new String'(Argv.all);
end if;
end if;
else
-- No space between -P and project file name
Project_File :=
new String'(Argv (Argv'First + 2 .. Argv'Last));
end if;
-- -Xexternal=value Specify an external reference to be
-- used in project files
elsif Argv'Length >= 5
and then Argv (Argv'First + 1) = 'X'
then
declare
Equal_Pos : constant Natural :=
Index ('=', Argv (Argv'First + 2 .. Argv'Last));
begin
if Equal_Pos >= Argv'First + 3 and then
Equal_Pos /= Argv'Last then
Add
(External_Name =>
Argv (Argv'First + 2 .. Equal_Pos - 1),
Value => Argv (Equal_Pos + 1 .. Argv'Last));
else
Fail
(Argv.all,
" is not a valid external assignment.");
end if;
end;
elsif Argv.all = "-v" then
Verbose_Mode := True;
elsif Argv.all = "-q" then
Quiet_Output := True;
else
Fail ("invalid parameter """, Argv.all, """");
end if;
end if;
Arg_Num := Arg_Num + 1;
end loop;
if Project_File = null then
Fail ("no project file specified");
end if;
Setup_Projects := True;
Prj.Pars.Set_Verbosity (To => Current_Verbosity);
-- Missing directories are created during processing of the
-- project tree.
Prj.Pars.Parse
(Project => Project,
In_Tree => Project_Tree,
Project_File_Name => Project_File.all,
Packages_To_Check => All_Packages);
if Project = Prj.No_Project then
Fail ("""", Project_File.all, """ processing failed");
end if;
-- Processing is done
return;
end Process_Setup;
end if;
-- Locate the executable for the command
Exec_Path := Locate_Exec_On_Path (Program);
if Exec_Path = null then
Put_Line (Standard_Error, "could not locate " & Program);
raise Error_Exit;
end if;
-- If there are switches for the executable, put them as first switches
if Command_List (The_Command).Unixsws /= null then
for J in Command_List (The_Command).Unixsws'Range loop
First_Switches.Increment_Last;
First_Switches.Table (First_Switches.Last) :=
Command_List (The_Command).Unixsws (J);
end loop;
end if;
-- For BIND, CHECK, FIND, LINK, LIST, PRETTY ad XREF, look for project
-- file related switches.
if The_Command = Bind
or else The_Command = Check
or else The_Command = Elim
or else The_Command = Find
or else The_Command = Link
or else The_Command = List
or else The_Command = Xref
or else The_Command = Pretty
or else The_Command = Stub
or else The_Command = Metric
then
case The_Command is
when Bind =>
Tool_Package_Name := Name_Binder;
Packages_To_Check := Packages_To_Check_By_Binder;
when Check =>
Tool_Package_Name := Name_Check;
Packages_To_Check := Packages_To_Check_By_Check;
when Elim =>
Tool_Package_Name := Name_Eliminate;
Packages_To_Check := Packages_To_Check_By_Eliminate;
when Find =>
Tool_Package_Name := Name_Finder;
Packages_To_Check := Packages_To_Check_By_Finder;
when Link =>
Tool_Package_Name := Name_Linker;
Packages_To_Check := Packages_To_Check_By_Linker;
when List =>
Tool_Package_Name := Name_Gnatls;
Packages_To_Check := Packages_To_Check_By_Gnatls;
when Metric =>
Tool_Package_Name := Name_Metrics;
Packages_To_Check := Packages_To_Check_By_Metric;
when Pretty =>
Tool_Package_Name := Name_Pretty_Printer;
Packages_To_Check := Packages_To_Check_By_Pretty;
when Stub =>
Tool_Package_Name := Name_Gnatstub;
Packages_To_Check := Packages_To_Check_By_Gnatstub;
when Xref =>
Tool_Package_Name := Name_Cross_Reference;
Packages_To_Check := Packages_To_Check_By_Xref;
when others =>
null;
end case;
-- Check that the switches are consistent.
-- Detect project file related switches.
Inspect_Switches :
declare
Arg_Num : Positive := 1;
Argv : String_Access;
procedure Remove_Switch (Num : Positive);
-- Remove a project related switch from table Last_Switches
-------------------
-- Remove_Switch --
-------------------
procedure Remove_Switch (Num : Positive) is
begin
Last_Switches.Table (Num .. Last_Switches.Last - 1) :=
Last_Switches.Table (Num + 1 .. Last_Switches.Last);
Last_Switches.Decrement_Last;
end Remove_Switch;
-- Start of processing for Inspect_Switches
begin
while Arg_Num <= Last_Switches.Last loop
Argv := Last_Switches.Table (Arg_Num);
if Argv (Argv'First) = '-' then
if Argv'Length = 1 then
Fail
("switch character cannot be followed by a blank");
end if;
-- The two style project files (-p and -P) cannot be used
-- together
if (The_Command = Find or else The_Command = Xref)
and then Argv (2) = 'p'
then
Old_Project_File_Used := True;
if Project_File /= null then
Fail ("-P and -p cannot be used together");
end if;
end if;
-- -vPx Specify verbosity while parsing project files
if Argv'Length = 4
and then Argv (Argv'First + 1 .. Argv'First + 2) = "vP"
then
case Argv (Argv'Last) is
when '0' =>
Current_Verbosity := Prj.Default;
when '1' =>
Current_Verbosity := Prj.Medium;
when '2' =>
Current_Verbosity := Prj.High;
when others =>
Fail ("Invalid switch: ", Argv.all);
end case;
Remove_Switch (Arg_Num);
-- -Pproject_file Specify project file to be used
elsif Argv (Argv'First + 1) = 'P' then
-- Only one -P switch can be used
if Project_File /= null then
Fail
(Argv.all,
": second project file forbidden (first is """,
Project_File.all & """)");
-- The two style project files (-p and -P) cannot be
-- used together.
elsif Old_Project_File_Used then
Fail ("-p and -P cannot be used together");
elsif Argv'Length = 2 then
-- There is space between -P and the project file
-- name. -P cannot be the last option.
if Arg_Num = Last_Switches.Last then
Fail ("project file name missing after -P");
else
Remove_Switch (Arg_Num);
Argv := Last_Switches.Table (Arg_Num);
-- After -P, there must be a project file name,
-- not another switch.
if Argv (Argv'First) = '-' then
Fail ("project file name missing after -P");
else
Project_File := new String'(Argv.all);
end if;
end if;
else
-- No space between -P and project file name
Project_File :=
new String'(Argv (Argv'First + 2 .. Argv'Last));
end if;
Remove_Switch (Arg_Num);
-- -Xexternal=value Specify an external reference to be
-- used in project files
elsif Argv'Length >= 5
and then Argv (Argv'First + 1) = 'X'
then
declare
Equal_Pos : constant Natural :=
Index ('=', Argv (Argv'First + 2 .. Argv'Last));
begin
if Equal_Pos >= Argv'First + 3 and then
Equal_Pos /= Argv'Last then
Add (External_Name =>
Argv (Argv'First + 2 .. Equal_Pos - 1),
Value => Argv (Equal_Pos + 1 .. Argv'Last));
else
Fail
(Argv.all,
" is not a valid external assignment.");
end if;
end;
Remove_Switch (Arg_Num);
elsif
(The_Command = Check or else
The_Command = Pretty or else
The_Command = Metric)
and then Argv'Length = 2
and then Argv (2) = 'U'
then
All_Projects := True;
Remove_Switch (Arg_Num);
else
Arg_Num := Arg_Num + 1;
end if;
else
Arg_Num := Arg_Num + 1;
end if;
end loop;
end Inspect_Switches;
end if;
-- If there is a project file specified, parse it, get the switches
-- for the tool and setup PATH environment variables.
if Project_File /= null then
Prj.Pars.Set_Verbosity (To => Current_Verbosity);
Prj.Pars.Parse
(Project => Project,
In_Tree => Project_Tree,
Project_File_Name => Project_File.all,
Packages_To_Check => Packages_To_Check);
if Project = Prj.No_Project then
Fail ("""", Project_File.all, """ processing failed");
end if;
-- Check if a package with the name of the tool is in the project
-- file and if there is one, get the switches, if any, and scan them.
declare
Data : constant Prj.Project_Data :=
Project_Tree.Projects.Table (Project);
Pkg : constant Prj.Package_Id :=
Prj.Util.Value_Of
(Name => Tool_Package_Name,
In_Packages => Data.Decl.Packages,
In_Tree => Project_Tree);
Element : Package_Element;
Default_Switches_Array : Array_Element_Id;
The_Switches : Prj.Variable_Value;
Current : Prj.String_List_Id;
The_String : String_Element;
begin
if Pkg /= No_Package then
Element := Project_Tree.Packages.Table (Pkg);
-- Packages Gnatls has a single attribute Switches, that is
-- not an associative array.
if The_Command = List then
The_Switches :=
Prj.Util.Value_Of
(Variable_Name => Snames.Name_Switches,
In_Variables => Element.Decl.Attributes,
In_Tree => Project_Tree);
-- Packages Binder (for gnatbind), Cross_Reference (for
-- gnatxref), Linker (for gnatlink) Finder (for gnatfind),
-- Pretty_Printer (for gnatpp) Eliminate (for gnatelim),
-- Check (for gnatcheck) and Metric (for gnatmetric) have
-- an attributed Switches, an associative array, indexed
-- by the name of the file.
-- They also have an attribute Default_Switches, indexed
-- by the name of the programming language.
else
if The_Switches.Kind = Prj.Undefined then
Default_Switches_Array :=
Prj.Util.Value_Of
(Name => Name_Default_Switches,
In_Arrays => Element.Decl.Arrays,
In_Tree => Project_Tree);
The_Switches := Prj.Util.Value_Of
(Index => Name_Ada,
Src_Index => 0,
In_Array => Default_Switches_Array,
In_Tree => Project_Tree);
end if;
end if;
-- If there are switches specified in the package of the
-- project file corresponding to the tool, scan them.
case The_Switches.Kind is
when Prj.Undefined =>
null;
when Prj.Single =>
declare
Switch : constant String :=
Get_Name_String (The_Switches.Value);
begin
if Switch'Length > 0 then
First_Switches.Increment_Last;
First_Switches.Table (First_Switches.Last) :=
new String'(Switch);
end if;
end;
when Prj.List =>
Current := The_Switches.Values;
while Current /= Prj.Nil_String loop
The_String := Project_Tree.String_Elements.
Table (Current);
declare
Switch : constant String :=
Get_Name_String (The_String.Value);
begin
if Switch'Length > 0 then
First_Switches.Increment_Last;
First_Switches.Table (First_Switches.Last) :=
new String'(Switch);
end if;
end;
Current := The_String.Next;
end loop;
end case;
end if;
end;
if The_Command = Bind
or else The_Command = Link
or else The_Command = Elim
then
Change_Dir
(Get_Name_String
(Project_Tree.Projects.Table
(Project).Object_Directory));
end if;
-- Set up the env vars for project path files
Prj.Env.Set_Ada_Paths
(Project, Project_Tree, Including_Libraries => False);
-- For gnatcheck, gnatstub, gnatmetric, gnatpp and gnatelim, create
-- a configuration pragmas file, if necessary.
if The_Command = Pretty
or else The_Command = Metric
or else The_Command = Stub
or else The_Command = Elim
or else The_Command = Check
then
-- If there are switches in package Compiler, put them in the
-- Carg_Switches table.
declare
Data : constant Prj.Project_Data :=
Project_Tree.Projects.Table (Project);
Pkg : constant Prj.Package_Id :=
Prj.Util.Value_Of
(Name => Name_Compiler,
In_Packages => Data.Decl.Packages,
In_Tree => Project_Tree);
Element : Package_Element;
Default_Switches_Array : Array_Element_Id;
The_Switches : Prj.Variable_Value;
Current : Prj.String_List_Id;
The_String : String_Element;
begin
if Pkg /= No_Package then
Element := Project_Tree.Packages.Table (Pkg);
Default_Switches_Array :=
Prj.Util.Value_Of
(Name => Name_Default_Switches,
In_Arrays => Element.Decl.Arrays,
In_Tree => Project_Tree);
The_Switches := Prj.Util.Value_Of
(Index => Name_Ada,
Src_Index => 0,
In_Array => Default_Switches_Array,
In_Tree => Project_Tree);
-- If there are switches specified in the package of the
-- project file corresponding to the tool, scan them.
case The_Switches.Kind is
when Prj.Undefined =>
null;
when Prj.Single =>
declare
Switch : constant String :=
Get_Name_String (The_Switches.Value);
begin
if Switch'Length > 0 then
Add_To_Carg_Switches (new String'(Switch));
end if;
end;
when Prj.List =>
Current := The_Switches.Values;
while Current /= Prj.Nil_String loop
The_String :=
Project_Tree.String_Elements.Table (Current);
declare
Switch : constant String :=
Get_Name_String (The_String.Value);
begin
if Switch'Length > 0 then
Add_To_Carg_Switches (new String'(Switch));
end if;
end;
Current := The_String.Next;
end loop;
end case;
end if;
end;
-- If -cargs is one of the switches, move the following switches
-- to the Carg_Switches table.
for J in 1 .. First_Switches.Last loop
if First_Switches.Table (J).all = "-cargs" then
for K in J + 1 .. First_Switches.Last loop
Add_To_Carg_Switches (First_Switches.Table (K));
end loop;
First_Switches.Set_Last (J - 1);
exit;
end if;
end loop;
for J in 1 .. Last_Switches.Last loop
if Last_Switches.Table (J).all = "-cargs" then
for K in J + 1 .. Last_Switches.Last loop
Add_To_Carg_Switches (Last_Switches.Table (K));
end loop;
Last_Switches.Set_Last (J - 1);
exit;
end if;
end loop;
declare
CP_File : constant Name_Id := Configuration_Pragmas_File;
begin
if CP_File /= No_Name then
if The_Command = Elim then
First_Switches.Increment_Last;
First_Switches.Table (First_Switches.Last) :=
new String'("-C" & Get_Name_String (CP_File));
else
Add_To_Carg_Switches
(new String'("-gnatec=" & Get_Name_String (CP_File)));
end if;
end if;
end;
end if;
if The_Command = Link then
Process_Link;
end if;
if The_Command = Link or The_Command = Bind then
-- For files that are specified as relative paths with directory
-- information, we convert them to absolute paths, with parent
-- being the current working directory if specified on the command
-- line and the project directory if specified in the project
-- file. This is what gnatmake is doing for linker and binder
-- arguments.
for J in 1 .. Last_Switches.Last loop
Test_If_Relative_Path
(Last_Switches.Table (J), Current_Work_Dir);
end loop;
Get_Name_String
(Project_Tree.Projects.Table (Project).Directory);
declare
Project_Dir : constant String := Name_Buffer (1 .. Name_Len);
begin
for J in 1 .. First_Switches.Last loop
Test_If_Relative_Path
(First_Switches.Table (J), Project_Dir);
end loop;
end;
elsif The_Command = Stub then
declare
Data : constant Prj.Project_Data :=
Project_Tree.Projects.Table (Project);
File_Index : Integer := 0;
Dir_Index : Integer := 0;
Last : constant Integer := Last_Switches.Last;
begin
for Index in 1 .. Last loop
if Last_Switches.Table (Index)
(Last_Switches.Table (Index)'First) /= '-'
then
File_Index := Index;
exit;
end if;
end loop;
-- If the naming scheme of the project file is not standard,
-- and if the file name ends with the spec suffix, then
-- indicate to gnatstub the name of the body file with
-- a -o switch.
if Data.Naming.Ada_Spec_Suffix /=
Prj.Default_Ada_Spec_Suffix
then
if File_Index /= 0 then
declare
Spec : constant String :=
Base_Name (Last_Switches.Table (File_Index).all);
Last : Natural := Spec'Last;
begin
Get_Name_String (Data.Naming.Ada_Spec_Suffix);
if Spec'Length > Name_Len
and then Spec (Last - Name_Len + 1 .. Last) =
Name_Buffer (1 .. Name_Len)
then
Last := Last - Name_Len;
Get_Name_String (Data.Naming.Ada_Body_Suffix);
Last_Switches.Increment_Last;
Last_Switches.Table (Last_Switches.Last) :=
new String'("-o");
Last_Switches.Increment_Last;
Last_Switches.Table (Last_Switches.Last) :=
new String'(Spec (Spec'First .. Last) &
Name_Buffer (1 .. Name_Len));
end if;
end;
end if;
end if;
-- Add the directory of the spec as the destination directory
-- of the body, if there is no destination directory already
-- specified.
if File_Index /= 0 then
for Index in File_Index + 1 .. Last loop
if Last_Switches.Table (Index)
(Last_Switches.Table (Index)'First) /= '-'
then
Dir_Index := Index;
exit;
end if;
end loop;
if Dir_Index = 0 then
Last_Switches.Increment_Last;
Last_Switches.Table (Last_Switches.Last) :=
new String'
(Dir_Name (Last_Switches.Table (File_Index).all));
end if;
end if;
end;
end if;
-- For gnatmetric, the generated files should be put in the object
-- directory. This must be the first switch, because it may be
-- overriden by a switch in package Metrics in the project file or by
-- a command line option.
if The_Command = Metric then
First_Switches.Increment_Last;
First_Switches.Table (2 .. First_Switches.Last) :=
First_Switches.Table (1 .. First_Switches.Last - 1);
First_Switches.Table (1) :=
new String'("-d=" &
Get_Name_String
(Project_Tree.Projects.Table
(Project).Object_Directory));
end if;
-- For gnat check, -rules and the following switches need to be the
-- last options. So, we move all these switches to table
-- Rules_Switches.
if The_Command = Check then
declare
New_Last : Natural;
-- Set to rank of options preceding "-rules"
In_Rules_Switches : Boolean;
-- Set to True when options "-rules" is found
begin
New_Last := First_Switches.Last;
In_Rules_Switches := False;
for J in 1 .. First_Switches.Last loop
if In_Rules_Switches then
Add_To_Rules_Switches (First_Switches.Table (J));
elsif First_Switches.Table (J).all = "-rules" then
New_Last := J - 1;
In_Rules_Switches := True;
end if;
end loop;
if In_Rules_Switches then
First_Switches.Set_Last (New_Last);
end if;
New_Last := Last_Switches.Last;
In_Rules_Switches := False;
for J in 1 .. Last_Switches.Last loop
if In_Rules_Switches then
Add_To_Rules_Switches (Last_Switches.Table (J));
elsif Last_Switches.Table (J).all = "-rules" then
New_Last := J - 1;
In_Rules_Switches := True;
end if;
end loop;
if In_Rules_Switches then
Last_Switches.Set_Last (New_Last);
end if;
end;
end if;
-- For gnat check, gnat pretty, gnat metric ands gnat list,
-- if no file has been put on the command line, call tool with all
-- the sources of the main project.
if The_Command = Check or else
The_Command = Pretty or else
The_Command = Metric or else
The_Command = List
then
Check_Files;
end if;
end if;
-- Gather all the arguments and invoke the executable
declare
The_Args : Argument_List
(1 .. First_Switches.Last +
Last_Switches.Last +
Carg_Switches.Last +
Rules_Switches.Last);
Arg_Num : Natural := 0;
begin
for J in 1 .. First_Switches.Last loop
Arg_Num := Arg_Num + 1;
The_Args (Arg_Num) := First_Switches.Table (J);
end loop;
for J in 1 .. Last_Switches.Last loop
Arg_Num := Arg_Num + 1;
The_Args (Arg_Num) := Last_Switches.Table (J);
end loop;
for J in 1 .. Carg_Switches.Last loop
Arg_Num := Arg_Num + 1;
The_Args (Arg_Num) := Carg_Switches.Table (J);
end loop;
for J in 1 .. Rules_Switches.Last loop
Arg_Num := Arg_Num + 1;
The_Args (Arg_Num) := Rules_Switches.Table (J);
end loop;
-- If Display_Command is on, only display the generated command
if Display_Command then
Put (Standard_Error, "generated command -->");
Put (Standard_Error, Exec_Path.all);
for Arg in The_Args'Range loop
Put (Standard_Error, " ");
Put (Standard_Error, The_Args (Arg).all);
end loop;
Put (Standard_Error, "<--");
New_Line (Standard_Error);
raise Normal_Exit;
end if;
if Verbose_Mode then
Output.Write_Str (Exec_Path.all);
for Arg in The_Args'Range loop
Output.Write_Char (' ');
Output.Write_Str (The_Args (Arg).all);
end loop;
Output.Write_Eol;
end if;
My_Exit_Status :=
Exit_Status (Spawn (Exec_Path.all, The_Args));
raise Normal_Exit;
end;
end;
exception
when Error_Exit =>
Prj.Env.Delete_All_Path_Files (Project_Tree);
Delete_Temp_Config_Files;
Set_Exit_Status (Failure);
when Normal_Exit =>
Prj.Env.Delete_All_Path_Files (Project_Tree);
Delete_Temp_Config_Files;
-- Since GNATCmd is normally called from DCL (the VMS shell), it must
-- return an understandable VMS exit status. However the exit status
-- returned *to* GNATCmd is a Posix style code, so we test it and return
-- just a simple success or failure on VMS.
if Hostparm.OpenVMS and then My_Exit_Status /= Success then
Set_Exit_Status (Failure);
else
Set_Exit_Status (My_Exit_Status);
end if;
end GNATCmd;
|
-----------------------------------------------------------------------
-- ado-drivers-tests -- Unit tests for database drivers
-- Copyright (C) 2014 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Test_Caller;
with ADO.Drivers.Connections;
package body ADO.Drivers.Tests is
use ADO.Drivers.Connections;
package Caller is new Util.Test_Caller (Test, "ADO.Drivers");
procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite) is
begin
Caller.Add_Test (Suite, "Test ADO.Drivers.Get_Config",
Test_Get_Config'Access);
Caller.Add_Test (Suite, "Test ADO.Drivers.Get_Driver",
Test_Get_Driver'Access);
Caller.Add_Test (Suite, "Test ADO.Drivers.Get_Driver_Index",
Test_Get_Driver_Index'Access);
Caller.Add_Test (Suite, "Test ADO.Drivers.Get_Driver",
Test_Load_Invalid_Driver'Access);
end Add_Tests;
-- ------------------------------
-- Test the Get_Config operation.
-- ------------------------------
procedure Test_Get_Config (T : in out Test) is
begin
T.Assert (ADO.Drivers.Get_Config ("test.database")'Length > 0,
"The Get_Config operation returned no value for the test database");
end Test_Get_Config;
-- ------------------------------
-- Test the Get_Driver operation.
-- ------------------------------
procedure Test_Get_Driver (T : in out Test) is
Mysql_Driver : constant Driver_Access := ADO.Drivers.Connections.Get_Driver ("mysql");
Sqlite_Driver : constant Driver_Access := ADO.Drivers.Connections.Get_Driver ("sqlite");
begin
T.Assert (Mysql_Driver /= null or Sqlite_Driver /= null,
"No database driver was found!");
end Test_Get_Driver;
-- ------------------------------
-- Test loading some invalid database driver.
-- ------------------------------
procedure Test_Load_Invalid_Driver (T : in out Test) is
Invalid_Driver : constant Driver_Access := ADO.Drivers.Connections.Get_Driver ("invalid");
begin
T.Assert (Invalid_Driver = null,
"The Get_Driver operation must return null for invalid drivers");
end Test_Load_Invalid_Driver;
-- ------------------------------
-- Test the Get_Driver_Index operation.
-- ------------------------------
procedure Test_Get_Driver_Index (T : in out Test) is
Mysql_Driver : constant Driver_Access := ADO.Drivers.Connections.Get_Driver ("mysql");
Sqlite_Driver : constant Driver_Access := ADO.Drivers.Connections.Get_Driver ("sqlite");
begin
if Mysql_Driver /= null then
T.Assert (Mysql_Driver.Get_Driver_Index > 0, "The driver index must be positive");
end if;
if Sqlite_Driver /= null then
T.Assert (Sqlite_Driver.Get_Driver_Index > 0, "The driver index must be positive");
end if;
if Mysql_Driver /= null and Sqlite_Driver /= null then
T.Assert (Mysql_Driver.Get_Driver_Index /= Sqlite_Driver.Get_Driver_Index,
"Two drivers must have different driver indexes");
end if;
end Test_Get_Driver_Index;
end ADO.Drivers.Tests;
|
-- 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.QUADSPI is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype CR_FTHRES_Field is HAL.UInt5;
subtype CR_PRESCALER_Field is HAL.UInt8;
-- control register
type CR_Register is record
-- Enable
EN : Boolean := False;
-- Abort request
ABORT_k : Boolean := False;
-- DMA enable
DMAEN : Boolean := False;
-- Timeout counter enable
TCEN : Boolean := False;
-- Sample shift
SSHIFT : Boolean := False;
-- unspecified
Reserved_5_5 : HAL.Bit := 16#0#;
-- Dual-flash mode
DFM : Boolean := False;
-- FLASH memory selection
FSEL : Boolean := False;
-- IFO threshold level
FTHRES : CR_FTHRES_Field := 16#0#;
-- unspecified
Reserved_13_15 : HAL.UInt3 := 16#0#;
-- Transfer error interrupt enable
TEIE : Boolean := False;
-- Transfer complete interrupt enable
TCIE : Boolean := False;
-- FIFO threshold interrupt enable
FTIE : Boolean := False;
-- Status match interrupt enable
SMIE : Boolean := False;
-- TimeOut interrupt enable
TOIE : Boolean := False;
-- unspecified
Reserved_21_21 : HAL.Bit := 16#0#;
-- Automatic poll mode stop
APMS : Boolean := False;
-- Polling match mode
PMM : Boolean := False;
-- Clock prescaler
PRESCALER : CR_PRESCALER_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR_Register use record
EN at 0 range 0 .. 0;
ABORT_k at 0 range 1 .. 1;
DMAEN at 0 range 2 .. 2;
TCEN at 0 range 3 .. 3;
SSHIFT at 0 range 4 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
DFM at 0 range 6 .. 6;
FSEL at 0 range 7 .. 7;
FTHRES at 0 range 8 .. 12;
Reserved_13_15 at 0 range 13 .. 15;
TEIE at 0 range 16 .. 16;
TCIE at 0 range 17 .. 17;
FTIE at 0 range 18 .. 18;
SMIE at 0 range 19 .. 19;
TOIE at 0 range 20 .. 20;
Reserved_21_21 at 0 range 21 .. 21;
APMS at 0 range 22 .. 22;
PMM at 0 range 23 .. 23;
PRESCALER at 0 range 24 .. 31;
end record;
subtype DCR_CSHT_Field is HAL.UInt3;
subtype DCR_FSIZE_Field is HAL.UInt5;
-- device configuration register
type DCR_Register is record
-- Mode 0 / mode 3
CKMODE : Boolean := False;
-- unspecified
Reserved_1_7 : HAL.UInt7 := 16#0#;
-- Chip select high time
CSHT : DCR_CSHT_Field := 16#0#;
-- unspecified
Reserved_11_15 : HAL.UInt5 := 16#0#;
-- FLASH memory size
FSIZE : DCR_FSIZE_Field := 16#0#;
-- unspecified
Reserved_21_31 : HAL.UInt11 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DCR_Register use record
CKMODE at 0 range 0 .. 0;
Reserved_1_7 at 0 range 1 .. 7;
CSHT at 0 range 8 .. 10;
Reserved_11_15 at 0 range 11 .. 15;
FSIZE at 0 range 16 .. 20;
Reserved_21_31 at 0 range 21 .. 31;
end record;
subtype SR_FLEVEL_Field is HAL.UInt7;
-- status register
type SR_Register is record
-- Read-only. Transfer error flag
TEF : Boolean;
-- Read-only. Transfer complete flag
TCF : Boolean;
-- Read-only. FIFO threshold flag
FTF : Boolean;
-- Read-only. Status match flag
SMF : Boolean;
-- Read-only. Timeout flag
TOF : Boolean;
-- Read-only. Busy
BUSY : Boolean;
-- unspecified
Reserved_6_7 : HAL.UInt2;
-- Read-only. FIFO level
FLEVEL : SR_FLEVEL_Field;
-- unspecified
Reserved_15_31 : HAL.UInt17;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register use record
TEF at 0 range 0 .. 0;
TCF at 0 range 1 .. 1;
FTF at 0 range 2 .. 2;
SMF at 0 range 3 .. 3;
TOF at 0 range 4 .. 4;
BUSY at 0 range 5 .. 5;
Reserved_6_7 at 0 range 6 .. 7;
FLEVEL at 0 range 8 .. 14;
Reserved_15_31 at 0 range 15 .. 31;
end record;
-- flag clear register
type FCR_Register is record
-- Clear transfer error flag
CTEF : Boolean := False;
-- Clear transfer complete flag
CTCF : Boolean := False;
-- unspecified
Reserved_2_2 : HAL.Bit := 16#0#;
-- Clear status match flag
CSMF : Boolean := False;
-- Clear timeout flag
CTOF : Boolean := False;
-- unspecified
Reserved_5_31 : HAL.UInt27 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for FCR_Register use record
CTEF at 0 range 0 .. 0;
CTCF at 0 range 1 .. 1;
Reserved_2_2 at 0 range 2 .. 2;
CSMF at 0 range 3 .. 3;
CTOF at 0 range 4 .. 4;
Reserved_5_31 at 0 range 5 .. 31;
end record;
subtype CCR_INSTRUCTION_Field is HAL.UInt8;
subtype CCR_IMODE_Field is HAL.UInt2;
subtype CCR_ADMODE_Field is HAL.UInt2;
subtype CCR_ADSIZE_Field is HAL.UInt2;
subtype CCR_ABMODE_Field is HAL.UInt2;
subtype CCR_ABSIZE_Field is HAL.UInt2;
subtype CCR_DCYC_Field is HAL.UInt5;
subtype CCR_DMODE_Field is HAL.UInt2;
subtype CCR_FMODE_Field is HAL.UInt2;
-- communication configuration register
type CCR_Register is record
-- Instruction
INSTRUCTION : CCR_INSTRUCTION_Field := 16#0#;
-- Instruction mode
IMODE : CCR_IMODE_Field := 16#0#;
-- Address mode
ADMODE : CCR_ADMODE_Field := 16#0#;
-- Address size
ADSIZE : CCR_ADSIZE_Field := 16#0#;
-- Alternate bytes mode
ABMODE : CCR_ABMODE_Field := 16#0#;
-- Alternate bytes size
ABSIZE : CCR_ABSIZE_Field := 16#0#;
-- Number of dummy cycles
DCYC : CCR_DCYC_Field := 16#0#;
-- unspecified
Reserved_23_23 : HAL.Bit := 16#0#;
-- Data mode
DMODE : CCR_DMODE_Field := 16#0#;
-- Functional mode
FMODE : CCR_FMODE_Field := 16#0#;
-- Send instruction only once mode
SIOO : Boolean := False;
-- unspecified
Reserved_29_29 : HAL.Bit := 16#0#;
-- DDR hold half cycle
DHHC : Boolean := False;
-- Double data rate mode
DDRM : Boolean := False;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCR_Register use record
INSTRUCTION at 0 range 0 .. 7;
IMODE at 0 range 8 .. 9;
ADMODE at 0 range 10 .. 11;
ADSIZE at 0 range 12 .. 13;
ABMODE at 0 range 14 .. 15;
ABSIZE at 0 range 16 .. 17;
DCYC at 0 range 18 .. 22;
Reserved_23_23 at 0 range 23 .. 23;
DMODE at 0 range 24 .. 25;
FMODE at 0 range 26 .. 27;
SIOO at 0 range 28 .. 28;
Reserved_29_29 at 0 range 29 .. 29;
DHHC at 0 range 30 .. 30;
DDRM at 0 range 31 .. 31;
end record;
subtype PIR_INTERVAL_Field is HAL.UInt16;
-- polling interval register
type PIR_Register is record
-- Polling interval
INTERVAL : PIR_INTERVAL_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PIR_Register use record
INTERVAL at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype LPTR_TIMEOUT_Field is HAL.UInt16;
-- low-power timeout register
type LPTR_Register is record
-- Timeout period
TIMEOUT : LPTR_TIMEOUT_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for LPTR_Register use record
TIMEOUT at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- QuadSPI interface
type QUADSPI_Peripheral is record
-- control register
CR : aliased CR_Register;
-- device configuration register
DCR : aliased DCR_Register;
-- status register
SR : aliased SR_Register;
-- flag clear register
FCR : aliased FCR_Register;
-- data length register
DLR : aliased HAL.UInt32;
-- communication configuration register
CCR : aliased CCR_Register;
-- address register
AR : aliased HAL.UInt32;
-- ABR
ABR : aliased HAL.UInt32;
-- data register
DR : aliased HAL.UInt32;
-- polling status mask register
PSMKR : aliased HAL.UInt32;
-- polling status match register
PSMAR : aliased HAL.UInt32;
-- polling interval register
PIR : aliased PIR_Register;
-- low-power timeout register
LPTR : aliased LPTR_Register;
end record
with Volatile;
for QUADSPI_Peripheral use record
CR at 16#0# range 0 .. 31;
DCR at 16#4# range 0 .. 31;
SR at 16#8# range 0 .. 31;
FCR at 16#C# range 0 .. 31;
DLR at 16#10# range 0 .. 31;
CCR at 16#14# range 0 .. 31;
AR at 16#18# range 0 .. 31;
ABR at 16#1C# range 0 .. 31;
DR at 16#20# range 0 .. 31;
PSMKR at 16#24# range 0 .. 31;
PSMAR at 16#28# range 0 .. 31;
PIR at 16#2C# range 0 .. 31;
LPTR at 16#30# range 0 .. 31;
end record;
-- QuadSPI interface
QUADSPI_Periph : aliased QUADSPI_Peripheral
with Import, Address => System'To_Address (16#A0001000#);
end STM32_SVD.QUADSPI;
|
generic
type T is range <>;
package Atomic.Signed
with Preelaborate, Spark_Mode => On,
Abstract_State => null
is
-- Based on GCC atomic built-ins. See:
-- https://gcc.gnu.org/onlinedocs/gcc/_005f_005fatomic-Builtins.html
--
-- The specification is exactly the same for all sizes of data (8, 16, 32,
-- 64).
pragma Compile_Time_Error
(T'Object_Size not in 8 | 16 | 32 | 64,
"Atomic builtins not available for objects of this size");
type Instance is limited private;
-- This type is limited and private, it can only be manipulated using the
-- primitives below.
function Init (Val : T) return Instance
with Post => Value (Init'Result) = Val;
-- Can be used to initialize an atomic instance:
--
-- A : Atomic.Unsigned_8.Instance := Atomic.Unsigned_8.Init (0);
function Value (This : Instance) return T
with Ghost;
-- Ghost function to get the value of an instance without needing it
-- aliased. This function can be used in contracts for instance.
-- This doesn't use the atomic built-ins.
function Load (This : aliased Instance;
Order : Mem_Order := Seq_Cst)
return T
with Pre => Order in Relaxed | Consume | Acquire | Seq_Cst,
Post => Load'Result = Value (This);
procedure Store (This : aliased in out Instance;
Val : T;
Order : Mem_Order := Seq_Cst)
with Pre => Order in Relaxed | Release | Seq_Cst,
Post => Value (This) = Val;
procedure Exchange (This : aliased in out Instance;
Val : T;
Old : out T;
Order : Mem_Order := Seq_Cst)
with Pre => Order in Relaxed | Acquire | Release | Acq_Rel | Seq_Cst,
Post => Old = Value (This)'Old and then Value (This) = Val;
procedure Compare_Exchange (This : aliased in out Instance;
Expected : T;
Desired : T;
Weak : Boolean;
Success : out Boolean;
Success_Order : Mem_Order := Seq_Cst;
Failure_Order : Mem_Order := Seq_Cst)
with Pre => Failure_Order in Relaxed | Consume | Acquire | Seq_Cst
and then
not Stronger (Failure_Order, Success_Order),
Post => Success = (Value (This)'Old = Expected)
and then
(if Success then Value (This) = Desired);
procedure Add (This : aliased in out Instance;
Val : T;
Order : Mem_Order := Seq_Cst)
with Post => Value (This) = Value (This)'Old + Val;
procedure Sub (This : aliased in out Instance;
Val : T;
Order : Mem_Order := Seq_Cst)
with Post => Value (This) = Value (This)'Old - Val;
procedure Add_Fetch (This : aliased in out Instance;
Val : T;
Result : out T;
Order : Mem_Order := Seq_Cst)
with Post => Result = (Value (This)'Old + Val)
and then Value (This) = Result;
procedure Sub_Fetch (This : aliased in out Instance;
Val : T;
Result : out T;
Order : Mem_Order := Seq_Cst)
with Post => Result = (Value (This)'Old - Val)
and then Value (This) = Result;
procedure Fetch_Add (This : aliased in out Instance;
Val : T;
Result : out T;
Order : Mem_Order := Seq_Cst)
with Post => Result = Value (This)'Old
and Value (This) = (Value (This)'Old + Val);
procedure Fetch_Sub (This : aliased in out Instance;
Val : T;
Result : out T;
Order : Mem_Order := Seq_Cst)
with Post => Result = Value (This)'Old
and Value (This) = (Value (This)'Old - Val);
-- NOT SPARK compatible --
function Exchange (This : aliased in out Instance;
Val : T;
Order : Mem_Order := Seq_Cst)
return T
with SPARK_Mode => Off,
Post => Exchange'Result = Value (This)'Old
and then Value (This) = Val;
function Compare_Exchange (This : aliased in out Instance;
Expected : T;
Desired : T;
Weak : Boolean;
Success_Order : Mem_Order := Seq_Cst;
Failure_Order : Mem_Order := Seq_Cst)
return Boolean
with SPARK_Mode => Off,
Post =>
Compare_Exchange'Result = (Value (This)'Old = Expected)
and then
(if Compare_Exchange'Result then Value (This) = Desired);
function Add_Fetch (This : aliased in out Instance;
Val : T;
Order : Mem_Order := Seq_Cst)
return T
with SPARK_Mode => Off,
Post => Add_Fetch'Result = (Value (This)'Old + Val)
and then Value (This) = Add_Fetch'Result;
function Sub_Fetch (This : aliased in out Instance;
Val : T;
Order : Mem_Order := Seq_Cst)
return T
with SPARK_Mode => Off,
Post => Sub_Fetch'Result = (Value (This)'Old - Val)
and then Value (This) = Sub_Fetch'Result;
function Fetch_Add (This : aliased in out Instance;
Val : T;
Order : Mem_Order := Seq_Cst)
return T
with SPARK_Mode => Off;
function Fetch_Sub (This : aliased in out Instance;
Val : T;
Order : Mem_Order := Seq_Cst)
return T
with SPARK_Mode => Off;
private
type Instance is new T;
----------
-- Init --
----------
function Init (Val : T) return Instance
is (Instance (Val));
-----------
-- Value --
-----------
function Value (This : Instance) return T
is (T (This));
pragma Inline (Init);
pragma Inline (Load);
pragma Inline (Store);
pragma Inline (Exchange);
pragma Inline (Compare_Exchange);
pragma Inline (Add);
pragma Inline (Sub);
pragma Inline (Add_Fetch);
pragma Inline (Sub_Fetch);
pragma Inline (Fetch_Add);
pragma Inline (Fetch_Sub);
end Atomic.Signed;
|
-- { dg-do run }
-- { dg-options "-gnatws" }
with Ada.Exceptions;
with Ada.Text_IO;
with Ada.Task_Identification;
procedure Curr_Task is
use Ada.Task_Identification;
-- Simple semaphore
protected Semaphore is
entry Lock;
procedure Unlock;
private
TID : Task_Id := Null_Task_Id;
Lock_Count : Natural := 0;
end Semaphore;
----------
-- Lock --
----------
procedure Lock is
begin
Semaphore.Lock;
end Lock;
---------------
-- Semaphore --
---------------
protected body Semaphore is
----------
-- Lock --
----------
entry Lock when Lock_Count = 0
or else TID = Current_Task
is
begin
if not
(Lock_Count = 0
or else TID = Lock'Caller)
then
Ada.Text_IO.Put_Line
("Barrier leaks " & Lock_Count'Img
& ' ' & Image (TID)
& ' ' & Image (Lock'Caller));
end if;
Lock_Count := Lock_Count + 1;
TID := Lock'Caller;
end Lock;
------------
-- Unlock --
------------
procedure Unlock is
begin
if TID = Current_Task then
Lock_Count := Lock_Count - 1;
else
raise Tasking_Error;
end if;
end Unlock;
end Semaphore;
------------
-- Unlock --
------------
procedure Unlock is
begin
Semaphore.Unlock;
end Unlock;
task type Secondary is
entry Start;
end Secondary;
procedure Parse (P1 : Positive);
-----------
-- Parse --
-----------
procedure Parse (P1 : Positive) is
begin
Lock;
delay 0.01;
if P1 mod 2 = 0 then
Lock;
delay 0.01;
Unlock;
end if;
Unlock;
end Parse;
---------------
-- Secondary --
---------------
task body Secondary is
begin
accept Start;
for K in 1 .. 20 loop
Parse (K);
end loop;
raise Constraint_Error;
exception
when Program_Error =>
null;
end Secondary;
TS : array (1 .. 2) of Secondary;
begin
Parse (1);
for J in TS'Range loop
TS (J).Start;
end loop;
end Curr_Task;
|
with Ada.Text_IO; use Ada.Text_IO;
procedure Cellular_Automata is
type Petri_Dish is array (Positive range <>) of Boolean;
procedure Step (Culture : in out Petri_Dish) is
Left : Boolean := False;
This : Boolean;
Right : Boolean;
begin
for Index in Culture'First..Culture'Last - 1 loop
Right := Culture (Index + 1);
This := Culture (Index);
Culture (Index) := (This and (Left xor Right)) or (not This and Left and Right);
Left := This;
end loop;
Culture (Culture'Last) := Culture (Culture'Last) and not Left;
end Step;
procedure Put (Culture : Petri_Dish) is
begin
for Index in Culture'Range loop
if Culture (Index) then
Put ('#');
else
Put ('_');
end if;
end loop;
end Put;
Culture : Petri_Dish :=
( False, True, True, True, False, True, True, False, True, False, True,
False, True, False, True, False, False, True, False, False
);
begin
for Generation in 0..9 loop
Put ("Generation" & Integer'Image (Generation) & ' ');
Put (Culture);
New_Line;
Step (Culture);
end loop;
end Cellular_Automata;
|
-----------------------------------------------------------------------
-- util-tests-tokenizers -- Split texts into tokens
-- Copyright (C) 2012 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- 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 Util.Texts.Tokenizers is
-- ------------------------------
-- Iterate over the tokens of the <b>Content</b> input. Each token is separated by
-- a pattern represented by <b>Pattern</b>. For each token, call the
-- procedure <b>Process</b> with the token. When <b>Going</b> is <b>Backward</b>,
-- scan the input from the end. Stop iterating over the tokens when the <b>Process</b>
-- procedure returns True in <b>Done</b>.
-- ------------------------------
procedure Iterate_Tokens (Content : in Input;
Pattern : in Input;
Process : access procedure (Token : in Input;
Done : out Boolean);
Going : in Ada.Strings.Direction := Ada.Strings.Forward) is
use Ada.Strings;
Sep_Pos : Natural;
Pos : Natural;
Last : constant Natural := Content'Last;
begin
case Going is
when Forward =>
Pos := Content'First;
while Pos <= Last loop
Sep_Pos := Index (Content, Pattern, Pos, Forward);
if Sep_Pos = 0 then
Sep_Pos := Last;
else
Sep_Pos := Sep_Pos - 1;
end if;
declare
Done : Boolean;
begin
Process (Token => Content (Pos .. Sep_Pos), Done => Done);
exit when Done;
end;
Pos := Sep_Pos + 1 + Pattern'Length;
end loop;
when Backward =>
Pos := Content'Last;
while Pos >= Content'First loop
Sep_Pos := Index (Content, Pattern, Pos, Backward);
if Sep_Pos = 0 then
Sep_Pos := Content'First;
else
Sep_Pos := Sep_Pos + 1;
end if;
declare
Done : Boolean;
begin
Process (Token => Content (Sep_Pos .. Pos), Done => Done);
exit when Done or Sep_Pos = Content'First;
end;
Pos := Sep_Pos - 1 - Pattern'Length;
end loop;
end case;
end Iterate_Tokens;
end Util.Texts.Tokenizers;
|
pragma License (Unrestricted); -- BSD 3-Clause
-- translated unit from SFMT (SFMT-sse2.h)
private generic
package Ada.Numerics.SFMT.Generating is
-- SSE2 version
pragma Preelaborate;
procedure gen_rand_all (
sfmt : in out w128_t_Array_N);
pragma Inline (gen_rand_all);
procedure gen_rand_array (
sfmt : in out w128_t_Array_N;
Item : in out w128_t_Array_1; -- w128_t_Array (0 .. size - 1)
size : Integer);
pragma Inline (gen_rand_array);
end Ada.Numerics.SFMT.Generating;
|
package Benchmark.Matrix is
type Matrix_Type is abstract new Benchmark_Type with private;
overriding
procedure Set_Argument(benchmark : in out Matrix_Type;
arg : in String);
overriding
procedure Run(benchmark : in Matrix_Type) is abstract;
private
type Matrix_Type is abstract new Benchmark_Type with record
size : Positive := 256;
iterations : Positive := 1;
end record;
function Get_Size(benchmark : Matrix_Type'Class) return Address_Type;
procedure Read(benchmark : in Matrix_Type'Class;
offset : in Address_Type;
x, y : in Natural);
procedure Write(benchmark : in Matrix_Type'Class;
offset : in Address_Type;
x, y : in Natural);
end Benchmark.Matrix;
|
---------------------------------------------------------------------------------
-- Copyright 2004-2005 © Luke A. Guest
--
-- This code is to be used for tutorial purposes only.
-- You may not redistribute this code in any form without my express permission.
---------------------------------------------------------------------------------
with Text_Io; use Text_Io;
package body Example is
procedure PrintUsage is
begin
Put_Line("Keys");
Put_Line("Cursor keys => Rotate");
Put_Line("Page Down/Up => Zoom in/out");
Put_Line("F1 => Toggle Fullscreen");
Put_Line("Escape => Quit");
end PrintUsage;
function Initialise return Boolean is
begin
GL.glClearColor(0.0, 0.0, 0.0, 0.0); -- Black Background
GL.glClearDepth(1.0); -- Depth Buffer Setup
GL.glDepthFunc(GL.GL_LEQUAL); -- The Type Of Depth Testing (Less Or Equal)
GL.glEnable(GL.GL_DEPTH_TEST); -- Enable Depth Testing
GL.glShadeModel(GL.GL_SMOOTH); -- Select Smooth Shading
GL.glHint(GL.GL_PERSPECTIVE_CORRECTION_HINT, GL.GL_NICEST); -- Set Perspective Calculations To Most Accurate
-- Start of user initialisation
return True;
end Initialise;
procedure Uninitialise is
begin
null;
end Uninitialise;
procedure Update(Ticks : in Integer) is
Result : Interfaces.C.int;
begin
if Keys(SDL.Keysym.K_F1) = True then
Result := SDL.Video.WM_ToggleFullScreen(ScreenSurface);
end if;
if Keys(SDL.Keysym.K_LEFT) = True then
XSpeed := XSpeed - 0.1;
end if;
if Keys(SDL.Keysym.K_RIGHT) = True then
XSpeed := XSpeed + 0.1;
end if;
if Keys(SDL.Keysym.K_UP) = True then
YSpeed := YSpeed - 0.1;
end if;
if Keys(SDL.Keysym.K_DOWN) = True then
YSpeed := YSpeed + 0.1;
end if;
if Keys(SDL.Keysym.K_PAGEUP) = True then
Zoom := Zoom - 0.1;
end if;
if Keys(SDL.Keysym.K_PAGEDOWN) = True then
Zoom := Zoom + 0.1;
end if;
if Keys(SDL.Keysym.K_ESCAPE) = True then
AppQuit := True;
end if;
end Update;
procedure Draw is
begin
GL.glClear(GL.GL_COLOR_BUFFER_BIT or GL.GL_DEPTH_BUFFER_BIT); -- Clear Screen And Depth Buffer
GL.glLoadIdentity; -- Reset The Modelview Matrix
GL.glTranslatef(0.0, 0.0, Zoom); -- Translate 6 Units Into The Screen
GL.glRotatef(XSpeed, 0.0, 1.0, 0.0); -- Rotate On The Y-Axis By angle
GL.glRotatef(YSpeed, 1.0, 0.0, 0.0); -- Rotate On The Y-Axis By angle
GL.glBegin(GL.GL_TRIANGLES); -- Begin Drawing Triangles
GL.glColor3f(1.0, 0.0, 0.0); GL.glVertex3f( 0.0, 1.0, 0.0);
GL.glColor3f(0.0, 1.0, 0.0); GL.glVertex3f(-1.0, -1.0, 1.0);
GL.glColor3f(0.0, 0.0, 1.0); GL.glVertex3f( 1.0, -1.0, 1.0);
GL.glEnd; -- Done Drawing Triangles
for Rot1 in 0 .. 2 loop
GL.glRotatef(90.0, 0.0, 1.0, 0.0); -- Rotate 90 Degrees On The Y-Axis
GL.glRotatef(180.0, 1.0, 0.0, 0.0); -- Rotate 180 Degress On The X-Axis
for Rot2 in 0 .. 2 loop
GL.glRotatef(180.0, 0.0, 1.0, 0.0); -- Rotate 180 Degrees On The Y-Axis
GL.glBegin(GL.GL_TRIANGLES); -- Drawing Triangles
GL.glColor3f(1.0, 0.0, 0.0); GL.glVertex3f( 0.0, 1.0, 0.0);
GL.glColor3f(0.0, 1.0, 0.0); GL.glVertex3f(-1.0, -1.0, 1.0);
GL.glColor3f(0.0, 0.0, 1.0); GL.glVertex3f( 1.0, -1.0, 1.0);
GL.glEnd; -- Done Drawing Triangles
end loop;
end loop;
GL.glFlush; -- Flush The GL Rendering Pipeline
end Draw;
function GetTitle return String is
begin
return Title;
end GetTitle;
function GetWidth return Integer is
begin
return Width;
end GetWidth;
function GetHeight return Integer is
begin
return Height;
end GetHeight;
function GetBitsPerPixel return Integer is
begin
return BitsPerPixel;
end GetBitsPerPixel;
procedure SetLastTickCount(Ticks : in Integer) is
begin
LastTickCount := Ticks;
end SetLastTickCount;
procedure SetSurface(Surface : in SDL.Video.Surface_Ptr) is
begin
ScreenSurface := Surface;
end SetSurface;
function GetSurface return SDL.Video.Surface_Ptr is
begin
return ScreenSurface;
end GetSurface;
procedure SetKey(Key : in SDL.Keysym.Key; Down : in Boolean) is
begin
Keys(Key) := Down;
end SetKey;
procedure SetActive(Active : in Boolean) is
begin
AppActive := Active;
end SetActive;
function IsActive return Boolean is
begin
return AppActive;
end IsActive;
procedure SetQuit(Quit : in Boolean) is
begin
AppQuit := Quit;
end SetQuit;
function Quit return Boolean is
begin
return AppQuit;
end Quit;
end Example;
|
with Ada.Text_IO;
use Ada.Text_IO;
procedure Triple is
begin
for C in 1 .. 40 loop
for B in 1 .. C loop
for A in 1 .. B loop
if A ** 2 + B ** 2 = C ** 2 then
Put_Line (Integer'Image(A) & ", " & Integer'Image(B) & ", " & Integer'Image(C));
end if;
end loop;
end loop;
end loop;
end Triple;
|
with Ada.Unchecked_Deallocation;
package body Generic_Stack is
------------
-- Create --
------------
function Create return Stack is
begin
return (null);
end Create;
----------
-- Push --
----------
procedure Push(Item : Element_Type; Onto : in out Stack) is
Temp : Stack := new Node;
begin
Temp.Element := Item;
Temp.Next := Onto;
Onto := Temp;
end Push;
---------
-- Pop --
---------
procedure Pop(Item : out Element_Type; From : in out Stack) is
procedure Free is new Ada.Unchecked_Deallocation(Node, Stack);
Temp : Stack := From;
begin
if Temp = null then
raise Stack_Empty_Error;
end if;
Item := Temp.Element;
From := Temp.Next;
Free(Temp);
end Pop;
end Generic_Stack;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- G N A T . I O --
-- --
-- S p e c --
-- --
-- Copyright (C) 1995-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. --
-- --
-- --
-- --
-- --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
-- A simple preelaborable subset of Text_IO capabilities
-- A simple text I/O package that can be used for simple I/O functions in
-- user programs as required. This package is also preelaborated, unlike
-- Text_IO, and can thus be with'ed by preelaborated library units.
-- Note that Data_Error is not raised by these subprograms for bad data.
-- If such checks are needed then the regular Text_IO package must be used.
-- This is the zfp version of GNAT.IO package
package GNAT.IO
with SPARK_Mode => On is
pragma Preelaborate;
procedure Put (X : Integer);
-- Output integer to specified file, or to current output file, same
-- output as if Ada.Text_IO.Integer_IO had been instantiated for Integer.
procedure Put (C : Character);
-- Output character to specified file, or to current output file
procedure Put (S : String);
-- Output string to specified file, or to current output file
procedure Put_Line (S : String);
-- Output string followed by new line to specified file, or to
-- current output file.
procedure New_Line (Spacing : Positive := 1);
-- Output new line character to specified file, or to current output file
end GNAT.IO;
|
-- This file is generated by SWIG. Please do not modify by hand.
--
with Interfaces;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_ungrab_server_request_t is
-- Item
--
type Item is record
major_opcode : aliased Interfaces.Unsigned_8;
pad0 : aliased Interfaces.Unsigned_8;
length : aliased Interfaces.Unsigned_16;
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_ungrab_server_request_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_ungrab_server_request_t.Item,
Element_Array => xcb.xcb_ungrab_server_request_t.Item_Array,
Default_Terminator => (others => <>));
subtype Pointer is C_Pointers.Pointer;
-- Pointer_Array
--
type Pointer_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_ungrab_server_request_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_ungrab_server_request_t.Pointer,
Element_Array => xcb.xcb_ungrab_server_request_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_ungrab_server_request_t;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . C A S E _ U T I L --
-- --
-- S p e c --
-- --
-- Copyright (C) 1995-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. --
-- --
------------------------------------------------------------------------------
-- Simple casing functions
-- This package provides simple casing functions that do not require the
-- overhead of the full casing tables found in Ada.Characters.Handling.
-- Note that all the routines in this package are available to the user
-- via GNAT.Case_Util, which imports all the entities from this package.
pragma Compiler_Unit;
package System.Case_Util is
pragma Pure;
-- Note: all the following functions handle the full Latin-1 set
function To_Upper (A : Character) return Character;
-- Converts A to upper case if it is a lower case letter, otherwise
-- returns the input argument unchanged.
procedure To_Upper (A : in out String);
-- Folds all characters of string A to upper case
function To_Lower (A : Character) return Character;
-- Converts A to lower case if it is an upper case letter, otherwise
-- returns the input argument unchanged.
procedure To_Lower (A : in out String);
-- Folds all characters of string A to lower case
procedure To_Mixed (A : in out String);
-- Converts A to mixed case (i.e. lower case, except for initial
-- character and any character after an underscore, which are
-- converted to upper case.
end System.Case_Util;
|
with Ada.Containers.Generic_Array_Access_Types;
with Ada.Unchecked_Deallocation;
procedure cntnr_array_sorting is
type SA is access String;
procedure Free is new Ada.Unchecked_Deallocation (String, SA);
Data : SA := null;
Comp_Count : Natural;
Swap_Count : Natural;
procedure Setup (Source : String) is
begin
Free (Data);
Data := new String'(Source);
Comp_Count := 0;
Swap_Count := 0;
end Setup;
procedure Report (
Message : String;
Source_Location : String := Ada.Debug.Source_Location;
Enclosing_Entity : String := Ada.Debug.Enclosing_Entity) is
begin
Ada.Debug.Put (
Message & Natural'Image (Comp_Count) & Natural'Image (Swap_Count),
Source_Location => Source_Location,
Enclosing_Entity => Enclosing_Entity);
end Report;
procedure Increment (X : in out Natural) is
begin
X := X + 1;
end Increment;
function LT (Left, Right : Character) return Boolean is
pragma Debug (Increment (Comp_Count));
begin
return Left < Right;
end LT;
procedure Swap (Data : in out SA; Left, Right : Integer) is
pragma Debug (Increment (Swap_Count));
Temp : Character := Data (Left);
begin
Data (Left) := Data (Right);
Data (Right) := Temp;
end Swap;
package SA_Op is
new Ada.Containers.Generic_Array_Access_Types (
Positive,
Character,
String,
SA);
package SA_Reversing is new SA_Op.Generic_Reversing (Swap);
package SA_Sorting is new SA_Op.Generic_Sorting (LT, Swap);
begin
-- Is_Sorted
begin
Setup ("");
pragma Assert (SA_Sorting.Is_Sorted (Data));
Setup ("ABCDEF");
pragma Assert (SA_Sorting.Is_Sorted (Data));
Setup ("ABCCDD");
pragma Assert (SA_Sorting.Is_Sorted (Data));
Setup ("ABCBA");
pragma Assert (not SA_Sorting.Is_Sorted (Data));
end;
-- In_Place_Reverse
begin
Setup ("");
SA_Reversing.Reverse_Elements (Data);
pragma Assert (Data.all = "");
pragma Assert (Swap_Count = 0);
Setup ("A");
SA_Reversing.Reverse_Elements (Data);
pragma Assert (Data.all = "A");
pragma Assert (Swap_Count = 0);
Setup ("BA");
SA_Reversing.Reverse_Elements (Data);
pragma Assert (Data.all = "AB");
pragma Assert (Swap_Count = 1);
Setup ("CBA");
SA_Reversing.Reverse_Elements (Data);
pragma Assert (Data.all = "ABC");
pragma Assert (Swap_Count = 1);
Setup ("DCBA");
SA_Reversing.Reverse_Elements (Data);
pragma Assert (Data.all = "ABCD");
pragma Assert (Swap_Count = 2);
end;
-- rotate an empty data
declare
Source : constant String := "";
Middle : constant Integer := 0;
begin
Setup (Source);
SA_Reversing.Reverse_Rotate_Elements (Data, Before => Middle + 1);
pragma Assert (Data.all = "");
pragma Assert (Swap_Count = 0);
Setup (Source);
SA_Reversing.Juggling_Rotate_Elements (Data, Before => Middle + 1);
pragma Assert (Data.all = "");
pragma Assert (Swap_Count = 0);
end;
-- rotate 1
declare
Source : constant String := "A";
Middle : constant Integer := 1;
begin
Setup (Source);
SA_Reversing.Reverse_Rotate_Elements (Data, Before => Middle + 1);
pragma Assert (Data.all = "A");
pragma Assert (Swap_Count = 0);
Setup (Source);
SA_Reversing.Juggling_Rotate_Elements (Data, Before => Middle + 1);
pragma Assert (Data.all = "A");
pragma Assert (Swap_Count = 0);
end;
-- rotate 2
declare
Source : constant String := "BA";
Middle : constant Integer := 1;
begin
Setup (Source);
SA_Reversing.Reverse_Rotate_Elements (Data, Before => Middle + 1);
pragma Assert (Data.all = "AB");
pragma Assert (Swap_Count = 1);
Setup (Source);
SA_Reversing.Juggling_Rotate_Elements (Data, Before => Middle + 1);
pragma Assert (Data.all = "AB");
pragma Assert (Swap_Count = 1);
end;
-- rotate 3-1
declare
Source : constant String := "CAB";
Middle : constant Integer := 1;
begin
Setup (Source);
SA_Reversing.Reverse_Rotate_Elements (Data, Before => Middle + 1);
pragma Assert (Data.all = "ABC");
pragma Debug (Report ("R3-1 rev"));
Setup (Source);
SA_Reversing.Juggling_Rotate_Elements (Data, Before => Middle + 1);
pragma Assert (Data.all = "ABC");
pragma Debug (Report ("R3-1 jug"));
end;
-- rotate 3-2
declare
Source : constant String := "BCA";
Middle : constant Integer := 2;
begin
Setup (Source);
SA_Reversing.Reverse_Rotate_Elements (Data, Before => Middle + 1);
pragma Assert (Data.all = "ABC");
pragma Debug (Report ("R3-2 rev"));
Setup (Source);
SA_Reversing.Juggling_Rotate_Elements (Data, Before => Middle + 1);
pragma Assert (Data.all = "ABC");
pragma Debug (Report ("R3-2 jug"));
end;
-- rotate 4-1
declare
Source : constant String := "DABC";
Middle : constant Integer := 1;
begin
Setup (Source);
SA_Reversing.Reverse_Rotate_Elements (Data, Before => Middle + 1);
pragma Assert (Data.all = "ABCD");
pragma Debug (Report ("R4-1 rev"));
Setup (Source);
SA_Reversing.Juggling_Rotate_Elements (Data, Before => Middle + 1);
pragma Assert (Data.all = "ABCD");
pragma Debug (Report ("R4-1 jug"));
end;
-- rotate 4-2
declare
Source : constant String := "CDAB";
Middle : constant Integer := 2;
begin
Setup (Source);
SA_Reversing.Reverse_Rotate_Elements (Data, Before => Middle + 1);
pragma Assert (Data.all = "ABCD");
pragma Debug (Report ("R4-2 rev"));
Setup (Source);
SA_Reversing.Juggling_Rotate_Elements (Data, Before => Middle + 1);
pragma Assert (Data.all = "ABCD");
pragma Debug (Report ("R4-2 jug"));
end;
-- rotate 4-3
declare
Source : constant String := "BCDA";
Middle : constant Integer := 3;
begin
Setup (Source);
SA_Reversing.Reverse_Rotate_Elements (Data, Before => Middle + 1);
pragma Assert (Data.all = "ABCD");
pragma Debug (Report ("R4-3 rev"));
Setup (Source);
SA_Reversing.Juggling_Rotate_Elements (Data, Before => Middle + 1);
pragma Assert (Data.all = "ABCD");
pragma Debug (Report ("R4-3 jug"));
end;
-- sort a sorted data
declare
Source : constant String := "ABBCDDEFFG";
begin
Setup (Source);
SA_Sorting.Insertion_Sort (Data);
pragma Assert (Data.all = "ABBCDDEFFG");
pragma Assert (Swap_Count = 0);
pragma Debug (Report ("S1 ins"));
Setup (Source);
SA_Sorting.Merge_Sort (Data);
pragma Assert (Data.all = "ABBCDDEFFG");
pragma Assert (Swap_Count = 0);
pragma Debug (Report ("S1 ipm"));
end;
-- sort a random data
declare
Source : constant String := "DBFGHIECJA";
begin
Setup (Source);
SA_Sorting.Insertion_Sort (Data);
pragma Assert (Data.all = "ABCDEFGHIJ");
pragma Debug (Report ("S2 ins"));
Setup (Source);
SA_Sorting.Merge_Sort (Data);
pragma Assert (Data.all = "ABCDEFGHIJ");
pragma Debug (Report ("S2 ipm"));
end;
-- sort a random long data
declare
Source : constant String := "LOOOOOOOOOONGDATA";
begin
Setup (Source);
SA_Sorting.Insertion_Sort (Data);
pragma Assert (Data.all = "AADGLNOOOOOOOOOOT");
pragma Debug (Report ("S3 ins"));
Setup (Source);
SA_Sorting.Merge_Sort (Data);
pragma Assert (Data.all = "AADGLNOOOOOOOOOOT");
pragma Debug (Report ("S3 ipm"));
end;
-- sort a keyboard
declare
Source : constant String := "ASDFGHJKL";
begin
Setup (Source);
SA_Sorting.Insertion_Sort (Data);
pragma Assert (Data.all = "ADFGHJKLS");
pragma Debug (Report ("S4 ins"));
Setup (Source);
SA_Sorting.Merge_Sort (Data);
pragma Assert (Data.all = "ADFGHJKLS");
pragma Debug (Report ("S4 ipm"));
end;
Free (Data);
pragma Debug (Ada.Debug.Put ("OK"));
end cntnr_array_sorting;
|
package Native is
pragma Pure;
end Native;
|
with Ada.Strings.Fixed;
with AUnit.Test_Caller;
package body AUnit.Suite_Builders_Generic is
package Caller is new AUnit.Test_Caller (Fixture);
Package_Name : constant String := GNAT.Source_Info.Enclosing_Entity;
Separator : constant String := " : ";
--
-- The separator for suite and test names.
---------------------------
-- Compute_Suite_Prefix --
---------------------------
procedure Compute_Suite_Prefix
(This : in out Builder'Class)
is
Prefix : String := Package_Name;
Last_Dot : Natural := 0;
Test_Suffix : constant String := ".Tests";
Suffix_Index : Natural := 0;
begin
-- Trim off the name of this package.
--
Last_Dot := Ada.Strings.Fixed.Index
(Source => Prefix,
Pattern => ".",
Going => Ada.Strings.Backward);
if Last_Dot > 0 then
Ada.Strings.Fixed.Delete
(Source => Prefix,
From => Last_Dot,
Through => Prefix'Last);
end if;
-- Strip off a useless ".Test" suffix.
--
-- Note: Assumes the suffix doesn't also occur in the middle of the name.
--
Suffix_Index := Ada.Strings.Fixed.Index
(Source => Prefix,
Pattern => Test_Suffix,
Going => Ada.Strings.Backward);
if Suffix_Index > 0 then
Ada.Strings.Fixed.Delete
(Source => Prefix,
From => Suffix_Index,
Through => Prefix'Last);
end if;
This.M_Prefix := Ada.Strings.Unbounded.To_Unbounded_String
(Ada.Strings.Fixed.Trim (Prefix, Ada.Strings.Both) & Separator);
end Compute_Suite_Prefix;
function To_Suite
(This : in Builder)
return not null AUnit.Test_Suites.Access_Test_Suite
is
begin
return This.M_Suite;
end To_Suite;
procedure Set_Suite_Name
(This : in out Builder;
Name : in String)
is
begin
This.M_Prefix := Ada.Strings.Unbounded.To_Unbounded_String (Name & Separator);
end Set_Suite_Name;
----------------------------------------------------------------------------
procedure Add
(This : in out Builder;
Name : in String;
Test : access procedure (T : in out Fixture))
is
begin
This.M_Suite.Add_Test
(Caller.Create (Ada.Strings.Unbounded.To_String (This.M_Prefix) & Name, Test));
end Add;
----------------------------------------------------------------------------
procedure Add
(This : in out Builder;
Test : not null access AUnit.Test_Cases.Test_Case'Class)
is
begin
This.M_Suite.Add_Test (Test);
end Add;
----------------------------------------------------------------------------
procedure Add
(This : in out Builder;
Suite : not null access AUnit.Test_Suites.Test_Suite'Class)
is
begin
This.M_Suite.Add_Test (Suite);
end Add;
overriding
procedure Initialize
(This : in out Builder)
is
begin
This.M_Suite := AUnit.Test_Suites.New_Suite;
This.Compute_Suite_Prefix;
end Initialize;
end AUnit.Suite_Builders_Generic;
|
with Ada.Containers.Vectors;
package BigInteger is
type BigInt is private;
function Create(l : in Long_Long_Integer) return BigInt;
function Create(s : in String) return BigInt;
-- Two Big Ints
function "+" (Left, Right: in BigInt) return BigInt;
function "-" (Left, Right: in BigInt) return BigInt;
function "*" (Left, Right: in BigInt) return BigInt;
function "**" (Left: in BigInt; Right: in Natural) return BigInt;
function Magnitude(bi : in BigInt) return Positive;
function ToString(bi : in BigInt) return String;
private
package Int_Vector is new Ada.Containers.Vectors(Index_Type => Positive, Element_Type => Long_Long_Integer);
type BigInt is record
bits : Int_Vector.Vector;
negative : Boolean;
end record;
end BigInteger;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . I M G _ U N S --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
-- This package contains the routines for supporting the Image attribute for
-- modular integer types up to Size Modular'Size, and also for conversion
-- operations required in Text_IO.Modular_IO for such types.
with System.Unsigned_Types;
package System.Img_Uns is
pragma Pure;
procedure Image_Unsigned
(V : System.Unsigned_Types.Unsigned;
S : in out String;
P : out Natural);
pragma Inline (Image_Unsigned);
-- Computes Unsigned'Image (V) and stores the result in S (1 .. P)
-- setting the resulting value of P. The caller guarantees that S
-- is long enough to hold the result, and that S'First is 1.
procedure Set_Image_Unsigned
(V : System.Unsigned_Types.Unsigned;
S : in out String;
P : in out Natural);
-- Stores the image of V in S starting at S (P + 1), P is updated to point
-- to the last character stored. The value stored is identical to the value
-- of Unsigned'Image (V) except that no leading space is stored. The caller
-- guarantees that S is long enough to hold the result. S need not have a
-- lower bound of 1.
end System.Img_Uns;
|
-- Copyright 2008-2019 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with Pck; use Pck;
procedure Foo is
begin
Do_Nothing (First.IntegerVar); -- STOP
Do_Nothing (Second.IntegerVar);
end Foo;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <vgodunko@gmail.com> --
-- 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.Elements;
with AMF.Internals.Helpers;
with AMF.Internals.Tables.UML_Attributes;
with AMF.Visitors.UMLDI_Iterators;
with AMF.Visitors.UMLDI_Visitors;
with League.Strings.Internals;
package body AMF.Internals.UMLDI_UML_Stereotype_Property_Value_Labels is
-----------------------
-- Get_Model_Element --
-----------------------
overriding function Get_Model_Element
(Self : not null access constant UMLDI_UML_Stereotype_Property_Value_Label_Proxy)
return AMF.UML.Properties.UML_Property_Access is
begin
return
AMF.UML.Properties.UML_Property_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Model_Element
(Self.Element)));
end Get_Model_Element;
-----------------------
-- Set_Model_Element --
-----------------------
overriding procedure Set_Model_Element
(Self : not null access UMLDI_UML_Stereotype_Property_Value_Label_Proxy;
To : AMF.UML.Properties.UML_Property_Access) is
begin
raise Program_Error;
-- AMF.Internals.Tables.UML_Attributes.Internal_Set_Model_Element
-- (Self.Element,
-- AMF.Internals.Helpers.To_Element
-- (AMF.Elements.Element_Access (To)));
end Set_Model_Element;
-----------------------------
-- Get_Stereotyped_Element --
-----------------------------
overriding function Get_Stereotyped_Element
(Self : not null access constant UMLDI_UML_Stereotype_Property_Value_Label_Proxy)
return AMF.UML.Elements.UML_Element_Access is
begin
return
AMF.UML.Elements.UML_Element_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Stereotyped_Element
(Self.Element)));
end Get_Stereotyped_Element;
-----------------------------
-- Set_Stereotyped_Element --
-----------------------------
overriding procedure Set_Stereotyped_Element
(Self : not null access UMLDI_UML_Stereotype_Property_Value_Label_Proxy;
To : AMF.UML.Elements.UML_Element_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Stereotyped_Element
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Stereotyped_Element;
--------------
-- Get_Text --
--------------
overriding function Get_Text
(Self : not null access constant UMLDI_UML_Stereotype_Property_Value_Label_Proxy)
return League.Strings.Universal_String is
begin
null;
return
League.Strings.Internals.Create
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Text (Self.Element));
end Get_Text;
--------------
-- Set_Text --
--------------
overriding procedure Set_Text
(Self : not null access UMLDI_UML_Stereotype_Property_Value_Label_Proxy;
To : League.Strings.Universal_String) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Text
(Self.Element,
League.Strings.Internals.Internal (To));
end Set_Text;
-----------------
-- Get_Is_Icon --
-----------------
overriding function Get_Is_Icon
(Self : not null access constant UMLDI_UML_Stereotype_Property_Value_Label_Proxy)
return Boolean is
begin
return
AMF.Internals.Tables.UML_Attributes.Internal_Get_Is_Icon
(Self.Element);
end Get_Is_Icon;
-----------------
-- Set_Is_Icon --
-----------------
overriding procedure Set_Is_Icon
(Self : not null access UMLDI_UML_Stereotype_Property_Value_Label_Proxy;
To : Boolean) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Is_Icon
(Self.Element, To);
end Set_Is_Icon;
---------------------
-- Get_Local_Style --
---------------------
overriding function Get_Local_Style
(Self : not null access constant UMLDI_UML_Stereotype_Property_Value_Label_Proxy)
return AMF.UMLDI.UML_Styles.UMLDI_UML_Style_Access is
begin
return
AMF.UMLDI.UML_Styles.UMLDI_UML_Style_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Local_Style
(Self.Element)));
end Get_Local_Style;
---------------------
-- Set_Local_Style --
---------------------
overriding procedure Set_Local_Style
(Self : not null access UMLDI_UML_Stereotype_Property_Value_Label_Proxy;
To : AMF.UMLDI.UML_Styles.UMLDI_UML_Style_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Local_Style
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Local_Style;
-----------------------
-- Get_Model_Element --
-----------------------
overriding function Get_Model_Element
(Self : not null access constant UMLDI_UML_Stereotype_Property_Value_Label_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element is
begin
raise Program_Error;
return X : AMF.UML.Elements.Collections.Set_Of_UML_Element;
-- return
-- AMF.UML.Elements.Collections.Wrap
-- (AMF.Internals.Element_Collections.Wrap
-- (AMF.Internals.Tables.UML_Attributes.Internal_Get_Model_Element
-- (Self.Element)));
end Get_Model_Element;
-----------------------
-- Get_Model_Element --
-----------------------
overriding function Get_Model_Element
(Self : not null access constant UMLDI_UML_Stereotype_Property_Value_Label_Proxy)
return AMF.CMOF.Elements.CMOF_Element_Access is
begin
return
AMF.CMOF.Elements.CMOF_Element_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Model_Element
(Self.Element)));
end Get_Model_Element;
---------------------
-- Get_Local_Style --
---------------------
overriding function Get_Local_Style
(Self : not null access constant UMLDI_UML_Stereotype_Property_Value_Label_Proxy)
return AMF.DI.Styles.DI_Style_Access is
begin
return
AMF.DI.Styles.DI_Style_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Local_Style
(Self.Element)));
end Get_Local_Style;
---------------------
-- Set_Local_Style --
---------------------
overriding procedure Set_Local_Style
(Self : not null access UMLDI_UML_Stereotype_Property_Value_Label_Proxy;
To : AMF.DI.Styles.DI_Style_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Local_Style
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Local_Style;
-------------------
-- Enter_Element --
-------------------
overriding procedure Enter_Element
(Self : not null access constant UMLDI_UML_Stereotype_Property_Value_Label_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.UMLDI_Visitors.UMLDI_Visitor'Class then
AMF.Visitors.UMLDI_Visitors.UMLDI_Visitor'Class
(Visitor).Enter_UML_Stereotype_Property_Value_Label
(AMF.UMLDI.UML_Stereotype_Property_Value_Labels.UMLDI_UML_Stereotype_Property_Value_Label_Access (Self),
Control);
end if;
end Enter_Element;
-------------------
-- Leave_Element --
-------------------
overriding procedure Leave_Element
(Self : not null access constant UMLDI_UML_Stereotype_Property_Value_Label_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.UMLDI_Visitors.UMLDI_Visitor'Class then
AMF.Visitors.UMLDI_Visitors.UMLDI_Visitor'Class
(Visitor).Leave_UML_Stereotype_Property_Value_Label
(AMF.UMLDI.UML_Stereotype_Property_Value_Labels.UMLDI_UML_Stereotype_Property_Value_Label_Access (Self),
Control);
end if;
end Leave_Element;
-------------------
-- Visit_Element --
-------------------
overriding procedure Visit_Element
(Self : not null access constant UMLDI_UML_Stereotype_Property_Value_Label_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.UMLDI_Iterators.UMLDI_Iterator'Class then
AMF.Visitors.UMLDI_Iterators.UMLDI_Iterator'Class
(Iterator).Visit_UML_Stereotype_Property_Value_Label
(Visitor,
AMF.UMLDI.UML_Stereotype_Property_Value_Labels.UMLDI_UML_Stereotype_Property_Value_Label_Access (Self),
Control);
end if;
end Visit_Element;
end AMF.Internals.UMLDI_UML_Stereotype_Property_Value_Labels;
|
-- for ZCX (or SjLj, or Win64 SEH)
pragma Check_Policy (Trace => Ignore);
with Ada.Unchecked_Conversion;
with System.Unwind.Representation;
with System.Unwind.Searching;
with C.unwind;
separate (System.Unwind.Raising)
package body Separated is
pragma Suppress (All_Checks);
use type C.unwind.Unwind_Action;
function To_GNAT is
new Ada.Unchecked_Conversion (
C.unwind.struct_Unwind_Exception_ptr,
Representation.Machine_Occurrence_Access);
-- (a-exexpr-gcc.adb)
function CleanupUnwind_Handler (
ABI_Version : C.signed_int;
Phases : C.unwind.Unwind_Action;
Exception_Class : C.unwind.Unwind_Exception_Class;
Exception_Object : access C.unwind.struct_Unwind_Exception;
Context : access C.unwind.struct_Unwind_Context;
Argument : C.void_ptr)
return C.unwind.Unwind_Reason_Code
with Convention => C;
function CleanupUnwind_Handler (
ABI_Version : C.signed_int;
Phases : C.unwind.Unwind_Action;
Exception_Class : C.unwind.Unwind_Exception_Class;
Exception_Object : access C.unwind.struct_Unwind_Exception;
Context : access C.unwind.struct_Unwind_Context;
Argument : C.void_ptr)
return C.unwind.Unwind_Reason_Code
is
pragma Unreferenced (ABI_Version);
pragma Unreferenced (Exception_Class);
pragma Unreferenced (Context);
pragma Unreferenced (Argument);
begin
pragma Check (Trace, Ada.Debug.Put ("enter"));
if Phases >= C.unwind.UA_END_OF_STACK then
Occurrences.Unhandled_Except_Handler (To_GNAT (Exception_Object));
end if;
pragma Check (Trace, Ada.Debug.Put ("leave"));
return C.unwind.URC_NO_REASON;
end CleanupUnwind_Handler;
-- implementation
procedure Propagate_Machine_Occurrence (
Machine_Occurrence :
not null Representation.Machine_Occurrence_Access)
is
Dummy : C.unwind.Unwind_Reason_Code;
begin
pragma Check (Trace, Ada.Debug.Put ("Unwind_RaiseException"));
Dummy := Searching.Unwind_RaiseException (
Machine_Occurrence.Header'Access);
-- in GNAT runtime, calling Notify_Unhandled_Exception here
pragma Check (Trace, Ada.Debug.Put ("Unwind_ForcedUnwind"));
Dummy := Searching.Unwind_ForcedUnwind (
Machine_Occurrence.Header'Access,
CleanupUnwind_Handler'Access,
C.void_ptr (Null_Address));
pragma Check (Trace, Ada.Debug.Put ("unhandled"));
Occurrences.Unhandled_Except_Handler (Machine_Occurrence);
end Propagate_Machine_Occurrence;
end Separated;
|
with
lace.Event,
lace.Subject;
package gel.Keyboard with remote_Types
--
-- Provides an interface for a keyboard.
--
is
type Item is limited interface
and lace.Subject.item;
type View is access all Item'class;
--------
--- Keys
--
type Key is (Nil,
BACKSPACE,
TAB,
CLEAR,
ENTER,
PAUSE,
ESCAPE,
SPACE,
EXCLAIM,
QUOTEDBL,
HASH,
DOLLAR,
AMPERSAND,
QUOTE,
LEFTPAREN,
RIGHTPAREN,
ASTERISK,
PLUS,
COMMA,
MINUS,
PERIOD,
SLASH,
'0', '1', '2', '3', '4', '5', '6', '7', '8', '9',
COLON, SEMICOLON,
LESS, EQUALS, GREATER,
QUESTION,
AT_key,
LEFTBRACKET,
BACKSLASH,
RIGHTBRACKET,
CARET,
UNDERSCORE,
BACKQUOTE,
a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v, w, x, y, z,
DELETE,
WORLD_0, WORLD_1, WORLD_2, WORLD_3, WORLD_4, WORLD_5, WORLD_6, WORLD_7, WORLD_8, WORLD_9,
WORLD_10, WORLD_11, WORLD_12, WORLD_13, WORLD_14, WORLD_15, WORLD_16, WORLD_17, WORLD_18, WORLD_19,
WORLD_20, WORLD_21, WORLD_22, WORLD_23, WORLD_24, WORLD_25, WORLD_26, WORLD_27, WORLD_28, WORLD_29,
WORLD_30, WORLD_31, WORLD_32, WORLD_33, WORLD_34, WORLD_35, WORLD_36, WORLD_37, WORLD_38, WORLD_39,
WORLD_40, WORLD_41, WORLD_42, WORLD_43, WORLD_44, WORLD_45, WORLD_46, WORLD_47, WORLD_48, WORLD_49,
WORLD_50, WORLD_51, WORLD_52, WORLD_53, WORLD_54, WORLD_55, WORLD_56, WORLD_57, WORLD_58, WORLD_59,
WORLD_60, WORLD_61, WORLD_62, WORLD_63, WORLD_64, WORLD_65, WORLD_66, WORLD_67, WORLD_68, WORLD_69,
WORLD_70, WORLD_71, WORLD_72, WORLD_73, WORLD_74, WORLD_75, WORLD_76, WORLD_77, WORLD_78, WORLD_79,
WORLD_80, WORLD_81, WORLD_82, WORLD_83, WORLD_84, WORLD_85, WORLD_86, WORLD_87, WORLD_88, WORLD_89,
WORLD_90, WORLD_91, WORLD_92, WORLD_93, WORLD_94, WORLD_95,
KP0, KP1, KP2, KP3, KP4, KP5, KP6, KP7, KP8, KP9,
KP_PERIOD,
KP_DIVIDE, KP_MULTIPLY, KP_MINUS, KP_PLUS,
KP_ENTER, KP_EQUALS,
UP, DOWN, RIGHT, LEFT,
INSERT,
HOME, END_key,
PAGEUP, PAGEDOWN,
F1, F2, F3, F4, F5, F6, F7, F8, F9, F10, F11, F12, F13, F14, F15,
NUMLOCK, CAPSLOCK, SCROLLOCK,
RSHIFT, LSHIFT,
RCTRL, LCTRL,
RALT, LALT,
RMETA, LMETA,
LSUPER, RSUPER,
MODE,
COMPOSE,
HELP,
PRINT,
SYSREQ,
BREAK,
MENU,
POWER,
EURO,
UNDO);
function is_Graphic (Self : in Key) return Boolean;
-------------
--- Modifiers
--
type Modifier is (LSHIFT,
RSHIFT,
LCTRL,
RCTRL,
LALT,
RALT,
LMETA,
RMETA,
NUM,
CAPS,
MODE);
type modifier_Set is array (Modifier) of Boolean;
no_Modifiers : constant modifier_Set;
type modified_Key is
record
Key : keyboard.Key;
modifier_Set : keyboard.modifier_Set;
end record;
function Image (Self : in modified_Key) return Character;
----------
--- Events
--
type key_press_Event is new lace.Event.item with
record
modified_Key : keyboard.modified_Key;
Code : Integer;
end record;
type key_release_Event is new lace.Event.item with
record
modified_Key : keyboard.modified_Key;
end record;
--------------
--- Attributes
--
function Modifiers (Self : in Item) return Modifier_Set is abstract;
--------------
--- Operations
--
procedure emit_key_press_Event (Self : in out Item; Key : in keyboard.Key;
key_Code : in Integer) is abstract;
procedure emit_key_release_Event (Self : in out Item; Key : in keyboard.Key) is abstract;
private
no_Modifiers : constant modifier_Set := (others => False);
end gel.Keyboard;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- XML Processor --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2013-2014, Vadim Godunko <vgodunko@gmail.com> --
-- 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 DOM document builder component to construct DOM
-- document from SAX events stream.
------------------------------------------------------------------------------
private with Ada.Containers.Vectors;
private with League.Strings;
with XML.DOM.Documents;
private with XML.DOM.Nodes;
private with XML.SAX.Attributes;
with XML.SAX.Content_Handlers;
with XML.SAX.Lexical_Handlers;
package Matreshka.DOM_Builders is
type DOM_Builder is
limited new XML.SAX.Content_Handlers.SAX_Content_Handler
and XML.SAX.Lexical_Handlers.SAX_Lexical_Handler with private;
procedure Set_Document
(Self : in out DOM_Builder'Class;
Document : not null XML.DOM.Documents.DOM_Document_Access);
function Get_Document
(Self : DOM_Builder'Class) return XML.DOM.Documents.DOM_Document_Access;
-- Returns constructed document.
private
package Node_Vectors is
new Ada.Containers.Vectors
(Positive,
XML.DOM.Nodes.DOM_Node_Access,
XML.DOM.Nodes."=");
type DOM_Builder is
limited new XML.SAX.Content_Handlers.SAX_Content_Handler
and XML.SAX.Lexical_Handlers.SAX_Lexical_Handler with
record
Document : XML.DOM.Documents.DOM_Document_Access;
Current : XML.DOM.Nodes.DOM_Node_Access;
Parent : XML.DOM.Nodes.DOM_Node_Access;
Stack : Node_Vectors.Vector;
end record;
overriding procedure Characters
(Self : in out DOM_Builder;
Text : League.Strings.Universal_String;
Success : in out Boolean);
overriding procedure End_Element
(Self : in out DOM_Builder;
Namespace_URI : League.Strings.Universal_String;
Local_Name : League.Strings.Universal_String;
Qualified_Name : League.Strings.Universal_String;
Success : in out Boolean);
overriding function Error_String
(Self : DOM_Builder) return League.Strings.Universal_String;
overriding procedure Start_Document
(Self : in out DOM_Builder;
Success : in out Boolean);
overriding procedure Start_Element
(Self : in out DOM_Builder;
Namespace_URI : League.Strings.Universal_String;
Local_Name : League.Strings.Universal_String;
Qualified_Name : League.Strings.Universal_String;
Attributes : XML.SAX.Attributes.SAX_Attributes;
Success : in out Boolean);
end Matreshka.DOM_Builders;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements;
with AMF.Internals.Element_Collections;
with AMF.Internals.Helpers;
with AMF.Internals.Tables.OCL_Attributes;
with AMF.String_Collections;
with AMF.UML.Classifier_Template_Parameters;
with AMF.UML.Classifiers.Collections;
with AMF.UML.Collaboration_Uses.Collections;
with AMF.UML.Comments.Collections;
with AMF.UML.Constraints.Collections;
with AMF.UML.Dependencies.Collections;
with AMF.UML.Element_Imports.Collections;
with AMF.UML.Elements.Collections;
with AMF.UML.Features.Collections;
with AMF.UML.Generalization_Sets.Collections;
with AMF.UML.Generalizations.Collections;
with AMF.UML.Named_Elements.Collections;
with AMF.UML.Namespaces.Collections;
with AMF.UML.Package_Imports.Collections;
with AMF.UML.Packageable_Elements.Collections;
with AMF.UML.Packages.Collections;
with AMF.UML.Parameterable_Elements.Collections;
with AMF.UML.Properties.Collections;
with AMF.UML.Redefinable_Elements.Collections;
with AMF.UML.Redefinable_Template_Signatures;
with AMF.UML.String_Expressions;
with AMF.UML.Substitutions.Collections;
with AMF.UML.Template_Bindings.Collections;
with AMF.UML.Template_Parameters;
with AMF.UML.Template_Signatures;
with AMF.UML.Types;
with AMF.UML.Use_Cases.Collections;
with AMF.Visitors.OCL_Iterators;
with AMF.Visitors.OCL_Visitors;
with League.Strings.Internals;
with Matreshka.Internals.Strings;
package body AMF.Internals.OCL_Template_Parameter_Types is
-----------------------
-- Get_Specification --
-----------------------
overriding function Get_Specification
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.Optional_String is
begin
declare
use type Matreshka.Internals.Strings.Shared_String_Access;
Aux : constant Matreshka.Internals.Strings.Shared_String_Access
:= AMF.Internals.Tables.OCL_Attributes.Internal_Get_Specification (Self.Element);
begin
if Aux = null then
return (Is_Empty => True);
else
return (False, League.Strings.Internals.Create (Aux));
end if;
end;
end Get_Specification;
-----------------------
-- Set_Specification --
-----------------------
overriding procedure Set_Specification
(Self : not null access OCL_Template_Parameter_Type_Proxy;
To : AMF.Optional_String) is
begin
if To.Is_Empty then
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Specification
(Self.Element, null);
else
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Specification
(Self.Element,
League.Strings.Internals.Internal (To.Value));
end if;
end Set_Specification;
-------------------
-- Get_Attribute --
-------------------
overriding function Get_Attribute
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Properties.Collections.Set_Of_UML_Property is
begin
return
AMF.UML.Properties.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Attribute
(Self.Element)));
end Get_Attribute;
---------------------------
-- Get_Collaboration_Use --
---------------------------
overriding function Get_Collaboration_Use
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Collaboration_Uses.Collections.Set_Of_UML_Collaboration_Use is
begin
return
AMF.UML.Collaboration_Uses.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Collaboration_Use
(Self.Element)));
end Get_Collaboration_Use;
-----------------
-- Get_Feature --
-----------------
overriding function Get_Feature
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Features.Collections.Set_Of_UML_Feature is
begin
return
AMF.UML.Features.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Feature
(Self.Element)));
end Get_Feature;
-----------------
-- Get_General --
-----------------
overriding function Get_General
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is
begin
return
AMF.UML.Classifiers.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_General
(Self.Element)));
end Get_General;
------------------------
-- Get_Generalization --
------------------------
overriding function Get_Generalization
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Generalizations.Collections.Set_Of_UML_Generalization is
begin
return
AMF.UML.Generalizations.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Generalization
(Self.Element)));
end Get_Generalization;
--------------------------
-- Get_Inherited_Member --
--------------------------
overriding function Get_Inherited_Member
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
return
AMF.UML.Named_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Inherited_Member
(Self.Element)));
end Get_Inherited_Member;
---------------------
-- Get_Is_Abstract --
---------------------
overriding function Get_Is_Abstract
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return Boolean is
begin
return
AMF.Internals.Tables.OCL_Attributes.Internal_Get_Is_Abstract
(Self.Element);
end Get_Is_Abstract;
---------------------
-- Set_Is_Abstract --
---------------------
overriding procedure Set_Is_Abstract
(Self : not null access OCL_Template_Parameter_Type_Proxy;
To : Boolean) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Is_Abstract
(Self.Element, To);
end Set_Is_Abstract;
---------------------------------
-- Get_Is_Final_Specialization --
---------------------------------
overriding function Get_Is_Final_Specialization
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return Boolean is
begin
return
AMF.Internals.Tables.OCL_Attributes.Internal_Get_Is_Final_Specialization
(Self.Element);
end Get_Is_Final_Specialization;
---------------------------------
-- Set_Is_Final_Specialization --
---------------------------------
overriding procedure Set_Is_Final_Specialization
(Self : not null access OCL_Template_Parameter_Type_Proxy;
To : Boolean) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Is_Final_Specialization
(Self.Element, To);
end Set_Is_Final_Specialization;
----------------------------------
-- Get_Owned_Template_Signature --
----------------------------------
overriding function Get_Owned_Template_Signature
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Redefinable_Template_Signatures.UML_Redefinable_Template_Signature_Access is
begin
return
AMF.UML.Redefinable_Template_Signatures.UML_Redefinable_Template_Signature_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owned_Template_Signature
(Self.Element)));
end Get_Owned_Template_Signature;
----------------------------------
-- Set_Owned_Template_Signature --
----------------------------------
overriding procedure Set_Owned_Template_Signature
(Self : not null access OCL_Template_Parameter_Type_Proxy;
To : AMF.UML.Redefinable_Template_Signatures.UML_Redefinable_Template_Signature_Access) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Owned_Template_Signature
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Owned_Template_Signature;
------------------------
-- Get_Owned_Use_Case --
------------------------
overriding function Get_Owned_Use_Case
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Use_Cases.Collections.Set_Of_UML_Use_Case is
begin
return
AMF.UML.Use_Cases.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owned_Use_Case
(Self.Element)));
end Get_Owned_Use_Case;
--------------------------
-- Get_Powertype_Extent --
--------------------------
overriding function Get_Powertype_Extent
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Generalization_Sets.Collections.Set_Of_UML_Generalization_Set is
begin
return
AMF.UML.Generalization_Sets.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Powertype_Extent
(Self.Element)));
end Get_Powertype_Extent;
------------------------------
-- Get_Redefined_Classifier --
------------------------------
overriding function Get_Redefined_Classifier
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is
begin
return
AMF.UML.Classifiers.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Redefined_Classifier
(Self.Element)));
end Get_Redefined_Classifier;
------------------------
-- Get_Representation --
------------------------
overriding function Get_Representation
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Collaboration_Uses.UML_Collaboration_Use_Access is
begin
return
AMF.UML.Collaboration_Uses.UML_Collaboration_Use_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Representation
(Self.Element)));
end Get_Representation;
------------------------
-- Set_Representation --
------------------------
overriding procedure Set_Representation
(Self : not null access OCL_Template_Parameter_Type_Proxy;
To : AMF.UML.Collaboration_Uses.UML_Collaboration_Use_Access) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Representation
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Representation;
----------------------
-- Get_Substitution --
----------------------
overriding function Get_Substitution
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Substitutions.Collections.Set_Of_UML_Substitution is
begin
return
AMF.UML.Substitutions.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Substitution
(Self.Element)));
end Get_Substitution;
----------------------------
-- Get_Template_Parameter --
----------------------------
overriding function Get_Template_Parameter
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Classifier_Template_Parameters.UML_Classifier_Template_Parameter_Access is
begin
return
AMF.UML.Classifier_Template_Parameters.UML_Classifier_Template_Parameter_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Template_Parameter
(Self.Element)));
end Get_Template_Parameter;
----------------------------
-- Set_Template_Parameter --
----------------------------
overriding procedure Set_Template_Parameter
(Self : not null access OCL_Template_Parameter_Type_Proxy;
To : AMF.UML.Classifier_Template_Parameters.UML_Classifier_Template_Parameter_Access) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Template_Parameter
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Template_Parameter;
------------------
-- Get_Use_Case --
------------------
overriding function Get_Use_Case
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Use_Cases.Collections.Set_Of_UML_Use_Case is
begin
return
AMF.UML.Use_Cases.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Use_Case
(Self.Element)));
end Get_Use_Case;
------------------------
-- Get_Element_Import --
------------------------
overriding function Get_Element_Import
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Element_Imports.Collections.Set_Of_UML_Element_Import is
begin
return
AMF.UML.Element_Imports.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Element_Import
(Self.Element)));
end Get_Element_Import;
-------------------------
-- Get_Imported_Member --
-------------------------
overriding function Get_Imported_Member
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element is
begin
return
AMF.UML.Packageable_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Imported_Member
(Self.Element)));
end Get_Imported_Member;
----------------
-- Get_Member --
----------------
overriding function Get_Member
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
return
AMF.UML.Named_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Member
(Self.Element)));
end Get_Member;
----------------------
-- Get_Owned_Member --
----------------------
overriding function Get_Owned_Member
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
return
AMF.UML.Named_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owned_Member
(Self.Element)));
end Get_Owned_Member;
--------------------
-- Get_Owned_Rule --
--------------------
overriding function Get_Owned_Rule
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Constraints.Collections.Set_Of_UML_Constraint is
begin
return
AMF.UML.Constraints.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owned_Rule
(Self.Element)));
end Get_Owned_Rule;
------------------------
-- Get_Package_Import --
------------------------
overriding function Get_Package_Import
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Package_Imports.Collections.Set_Of_UML_Package_Import is
begin
return
AMF.UML.Package_Imports.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Package_Import
(Self.Element)));
end Get_Package_Import;
---------------------------
-- Get_Client_Dependency --
---------------------------
overriding function Get_Client_Dependency
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency is
begin
return
AMF.UML.Dependencies.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Client_Dependency
(Self.Element)));
end Get_Client_Dependency;
--------------
-- Get_Name --
--------------
overriding function Get_Name
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.Optional_String is
begin
declare
use type Matreshka.Internals.Strings.Shared_String_Access;
Aux : constant Matreshka.Internals.Strings.Shared_String_Access
:= AMF.Internals.Tables.OCL_Attributes.Internal_Get_Name (Self.Element);
begin
if Aux = null then
return (Is_Empty => True);
else
return (False, League.Strings.Internals.Create (Aux));
end if;
end;
end Get_Name;
--------------
-- Set_Name --
--------------
overriding procedure Set_Name
(Self : not null access OCL_Template_Parameter_Type_Proxy;
To : AMF.Optional_String) is
begin
if To.Is_Empty then
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Name
(Self.Element, null);
else
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Name
(Self.Element,
League.Strings.Internals.Internal (To.Value));
end if;
end Set_Name;
-------------------------
-- Get_Name_Expression --
-------------------------
overriding function Get_Name_Expression
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.String_Expressions.UML_String_Expression_Access is
begin
return
AMF.UML.String_Expressions.UML_String_Expression_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Name_Expression
(Self.Element)));
end Get_Name_Expression;
-------------------------
-- Set_Name_Expression --
-------------------------
overriding procedure Set_Name_Expression
(Self : not null access OCL_Template_Parameter_Type_Proxy;
To : AMF.UML.String_Expressions.UML_String_Expression_Access) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Name_Expression
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Name_Expression;
-------------------
-- Get_Namespace --
-------------------
overriding function Get_Namespace
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access is
begin
return
AMF.UML.Namespaces.UML_Namespace_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Namespace
(Self.Element)));
end Get_Namespace;
------------------------
-- Get_Qualified_Name --
------------------------
overriding function Get_Qualified_Name
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.Optional_String is
begin
declare
use type Matreshka.Internals.Strings.Shared_String_Access;
Aux : constant Matreshka.Internals.Strings.Shared_String_Access
:= AMF.Internals.Tables.OCL_Attributes.Internal_Get_Qualified_Name (Self.Element);
begin
if Aux = null then
return (Is_Empty => True);
else
return (False, League.Strings.Internals.Create (Aux));
end if;
end;
end Get_Qualified_Name;
--------------------
-- Get_Visibility --
--------------------
overriding function Get_Visibility
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Optional_UML_Visibility_Kind is
begin
return
AMF.Internals.Tables.OCL_Attributes.Internal_Get_Visibility
(Self.Element);
end Get_Visibility;
--------------------
-- Set_Visibility --
--------------------
overriding procedure Set_Visibility
(Self : not null access OCL_Template_Parameter_Type_Proxy;
To : AMF.UML.Optional_UML_Visibility_Kind) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Visibility
(Self.Element, To);
end Set_Visibility;
-----------------------
-- Get_Owned_Comment --
-----------------------
overriding function Get_Owned_Comment
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Comments.Collections.Set_Of_UML_Comment is
begin
return
AMF.UML.Comments.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owned_Comment
(Self.Element)));
end Get_Owned_Comment;
-----------------------
-- Get_Owned_Element --
-----------------------
overriding function Get_Owned_Element
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element is
begin
return
AMF.UML.Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owned_Element
(Self.Element)));
end Get_Owned_Element;
---------------
-- Get_Owner --
---------------
overriding function Get_Owner
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Elements.UML_Element_Access is
begin
return
AMF.UML.Elements.UML_Element_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owner
(Self.Element)));
end Get_Owner;
-----------------
-- Get_Package --
-----------------
overriding function Get_Package
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Packages.UML_Package_Access is
begin
return
AMF.UML.Packages.UML_Package_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Package
(Self.Element)));
end Get_Package;
-----------------
-- Set_Package --
-----------------
overriding procedure Set_Package
(Self : not null access OCL_Template_Parameter_Type_Proxy;
To : AMF.UML.Packages.UML_Package_Access) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Package
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Package;
--------------------
-- Get_Visibility --
--------------------
overriding function Get_Visibility
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.UML_Visibility_Kind is
begin
return
AMF.Internals.Tables.OCL_Attributes.Internal_Get_Visibility
(Self.Element).Value;
end Get_Visibility;
--------------------
-- Set_Visibility --
--------------------
overriding procedure Set_Visibility
(Self : not null access OCL_Template_Parameter_Type_Proxy;
To : AMF.UML.UML_Visibility_Kind) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Visibility
(Self.Element, (False, To));
end Set_Visibility;
-----------------------------------
-- Get_Owning_Template_Parameter --
-----------------------------------
overriding function Get_Owning_Template_Parameter
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Template_Parameters.UML_Template_Parameter_Access is
begin
return
AMF.UML.Template_Parameters.UML_Template_Parameter_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owning_Template_Parameter
(Self.Element)));
end Get_Owning_Template_Parameter;
-----------------------------------
-- Set_Owning_Template_Parameter --
-----------------------------------
overriding procedure Set_Owning_Template_Parameter
(Self : not null access OCL_Template_Parameter_Type_Proxy;
To : AMF.UML.Template_Parameters.UML_Template_Parameter_Access) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Owning_Template_Parameter
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Owning_Template_Parameter;
----------------------------
-- Get_Template_Parameter --
----------------------------
overriding function Get_Template_Parameter
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Template_Parameters.UML_Template_Parameter_Access is
begin
return
AMF.UML.Template_Parameters.UML_Template_Parameter_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Template_Parameter
(Self.Element)));
end Get_Template_Parameter;
----------------------------
-- Set_Template_Parameter --
----------------------------
overriding procedure Set_Template_Parameter
(Self : not null access OCL_Template_Parameter_Type_Proxy;
To : AMF.UML.Template_Parameters.UML_Template_Parameter_Access) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Template_Parameter
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Template_Parameter;
----------------------------------
-- Get_Owned_Template_Signature --
----------------------------------
overriding function Get_Owned_Template_Signature
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Template_Signatures.UML_Template_Signature_Access is
begin
return
AMF.UML.Template_Signatures.UML_Template_Signature_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Owned_Template_Signature
(Self.Element)));
end Get_Owned_Template_Signature;
----------------------------------
-- Set_Owned_Template_Signature --
----------------------------------
overriding procedure Set_Owned_Template_Signature
(Self : not null access OCL_Template_Parameter_Type_Proxy;
To : AMF.UML.Template_Signatures.UML_Template_Signature_Access) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Owned_Template_Signature
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Owned_Template_Signature;
--------------------------
-- Get_Template_Binding --
--------------------------
overriding function Get_Template_Binding
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Template_Bindings.Collections.Set_Of_UML_Template_Binding is
begin
return
AMF.UML.Template_Bindings.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Template_Binding
(Self.Element)));
end Get_Template_Binding;
-----------------
-- Get_Is_Leaf --
-----------------
overriding function Get_Is_Leaf
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return Boolean is
begin
return
AMF.Internals.Tables.OCL_Attributes.Internal_Get_Is_Leaf
(Self.Element);
end Get_Is_Leaf;
-----------------
-- Set_Is_Leaf --
-----------------
overriding procedure Set_Is_Leaf
(Self : not null access OCL_Template_Parameter_Type_Proxy;
To : Boolean) is
begin
AMF.Internals.Tables.OCL_Attributes.Internal_Set_Is_Leaf
(Self.Element, To);
end Set_Is_Leaf;
---------------------------
-- Get_Redefined_Element --
---------------------------
overriding function Get_Redefined_Element
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Redefinable_Elements.Collections.Set_Of_UML_Redefinable_Element is
begin
return
AMF.UML.Redefinable_Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Redefined_Element
(Self.Element)));
end Get_Redefined_Element;
------------------------------
-- Get_Redefinition_Context --
------------------------------
overriding function Get_Redefinition_Context
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is
begin
return
AMF.UML.Classifiers.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.OCL_Attributes.Internal_Get_Redefinition_Context
(Self.Element)));
end Get_Redefinition_Context;
------------------
-- All_Features --
------------------
overriding function All_Features
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Features.Collections.Set_Of_UML_Feature is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Features unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.All_Features";
return All_Features (Self);
end All_Features;
-----------------
-- All_Parents --
-----------------
overriding function All_Parents
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Parents unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.All_Parents";
return All_Parents (Self);
end All_Parents;
-----------------
-- Conforms_To --
-----------------
overriding function Conforms_To
(Self : not null access constant OCL_Template_Parameter_Type_Proxy;
Other : AMF.UML.Classifiers.UML_Classifier_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Conforms_To unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.Conforms_To";
return Conforms_To (Self, Other);
end Conforms_To;
-------------
-- General --
-------------
overriding function General
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "General unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.General";
return General (Self);
end General;
-----------------------
-- Has_Visibility_Of --
-----------------------
overriding function Has_Visibility_Of
(Self : not null access constant OCL_Template_Parameter_Type_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Has_Visibility_Of unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.Has_Visibility_Of";
return Has_Visibility_Of (Self, N);
end Has_Visibility_Of;
-------------
-- Inherit --
-------------
overriding function Inherit
(Self : not null access constant OCL_Template_Parameter_Type_Proxy;
Inhs : AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Inherit unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.Inherit";
return Inherit (Self, Inhs);
end Inherit;
-------------------------
-- Inheritable_Members --
-------------------------
overriding function Inheritable_Members
(Self : not null access constant OCL_Template_Parameter_Type_Proxy;
C : AMF.UML.Classifiers.UML_Classifier_Access)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Inheritable_Members unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.Inheritable_Members";
return Inheritable_Members (Self, C);
end Inheritable_Members;
----------------------
-- Inherited_Member --
----------------------
overriding function Inherited_Member
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Inherited_Member unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.Inherited_Member";
return Inherited_Member (Self);
end Inherited_Member;
-----------------
-- Is_Template --
-----------------
overriding function Is_Template
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Template unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.Is_Template";
return Is_Template (Self);
end Is_Template;
-------------------------
-- May_Specialize_Type --
-------------------------
overriding function May_Specialize_Type
(Self : not null access constant OCL_Template_Parameter_Type_Proxy;
C : AMF.UML.Classifiers.UML_Classifier_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "May_Specialize_Type unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.May_Specialize_Type";
return May_Specialize_Type (Self, C);
end May_Specialize_Type;
-------------
-- Parents --
-------------
overriding function Parents
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Classifiers.Collections.Set_Of_UML_Classifier is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Parents unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.Parents";
return Parents (Self);
end Parents;
------------------------
-- Exclude_Collisions --
------------------------
overriding function Exclude_Collisions
(Self : not null access constant OCL_Template_Parameter_Type_Proxy;
Imps : AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Exclude_Collisions unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.Exclude_Collisions";
return Exclude_Collisions (Self, Imps);
end Exclude_Collisions;
-------------------------
-- Get_Names_Of_Member --
-------------------------
overriding function Get_Names_Of_Member
(Self : not null access constant OCL_Template_Parameter_Type_Proxy;
Element : AMF.UML.Named_Elements.UML_Named_Element_Access)
return AMF.String_Collections.Set_Of_String is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Get_Names_Of_Member unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.Get_Names_Of_Member";
return Get_Names_Of_Member (Self, Element);
end Get_Names_Of_Member;
--------------------
-- Import_Members --
--------------------
overriding function Import_Members
(Self : not null access constant OCL_Template_Parameter_Type_Proxy;
Imps : AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Import_Members unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.Import_Members";
return Import_Members (Self, Imps);
end Import_Members;
---------------------
-- Imported_Member --
---------------------
overriding function Imported_Member
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Packageable_Elements.Collections.Set_Of_UML_Packageable_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Imported_Member unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.Imported_Member";
return Imported_Member (Self);
end Imported_Member;
---------------------------------
-- Members_Are_Distinguishable --
---------------------------------
overriding function Members_Are_Distinguishable
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Members_Are_Distinguishable unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.Members_Are_Distinguishable";
return Members_Are_Distinguishable (Self);
end Members_Are_Distinguishable;
------------------
-- Owned_Member --
------------------
overriding function Owned_Member
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Named_Elements.Collections.Set_Of_UML_Named_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Owned_Member unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.Owned_Member";
return Owned_Member (Self);
end Owned_Member;
--------------------
-- All_Namespaces --
--------------------
overriding function All_Namespaces
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Namespaces.Collections.Ordered_Set_Of_UML_Namespace is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Namespaces unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.All_Namespaces";
return All_Namespaces (Self);
end All_Namespaces;
-------------------------
-- All_Owning_Packages --
-------------------------
overriding function All_Owning_Packages
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Packages.Collections.Set_Of_UML_Package is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Owning_Packages unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.All_Owning_Packages";
return All_Owning_Packages (Self);
end All_Owning_Packages;
-----------------------------
-- Is_Distinguishable_From --
-----------------------------
overriding function Is_Distinguishable_From
(Self : not null access constant OCL_Template_Parameter_Type_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access;
Ns : AMF.UML.Namespaces.UML_Namespace_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Distinguishable_From unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.Is_Distinguishable_From";
return Is_Distinguishable_From (Self, N, Ns);
end Is_Distinguishable_From;
---------------
-- Namespace --
---------------
overriding function Namespace
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Namespace unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.Namespace";
return Namespace (Self);
end Namespace;
--------------------
-- Qualified_Name --
--------------------
overriding function Qualified_Name
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return League.Strings.Universal_String is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Qualified_Name unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.Qualified_Name";
return Qualified_Name (Self);
end Qualified_Name;
---------------
-- Separator --
---------------
overriding function Separator
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return League.Strings.Universal_String is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Separator unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.Separator";
return Separator (Self);
end Separator;
------------------------
-- All_Owned_Elements --
------------------------
overriding function All_Owned_Elements
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "All_Owned_Elements unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.All_Owned_Elements";
return All_Owned_Elements (Self);
end All_Owned_Elements;
-------------------
-- Must_Be_Owned --
-------------------
overriding function Must_Be_Owned
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Must_Be_Owned unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.Must_Be_Owned";
return Must_Be_Owned (Self);
end Must_Be_Owned;
-----------------
-- Conforms_To --
-----------------
overriding function Conforms_To
(Self : not null access constant OCL_Template_Parameter_Type_Proxy;
Other : AMF.UML.Types.UML_Type_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Conforms_To unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.Conforms_To";
return Conforms_To (Self, Other);
end Conforms_To;
------------------------
-- Is_Compatible_With --
------------------------
overriding function Is_Compatible_With
(Self : not null access constant OCL_Template_Parameter_Type_Proxy;
P : AMF.UML.Parameterable_Elements.UML_Parameterable_Element_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Compatible_With unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.Is_Compatible_With";
return Is_Compatible_With (Self, P);
end Is_Compatible_With;
---------------------------
-- Is_Template_Parameter --
---------------------------
overriding function Is_Template_Parameter
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Template_Parameter unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.Is_Template_Parameter";
return Is_Template_Parameter (Self);
end Is_Template_Parameter;
----------------------------
-- Parameterable_Elements --
----------------------------
overriding function Parameterable_Elements
(Self : not null access constant OCL_Template_Parameter_Type_Proxy)
return AMF.UML.Parameterable_Elements.Collections.Set_Of_UML_Parameterable_Element is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Parameterable_Elements unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.Parameterable_Elements";
return Parameterable_Elements (Self);
end Parameterable_Elements;
------------------------
-- Is_Consistent_With --
------------------------
overriding function Is_Consistent_With
(Self : not null access constant OCL_Template_Parameter_Type_Proxy;
Redefinee : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Consistent_With unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.Is_Consistent_With";
return Is_Consistent_With (Self, Redefinee);
end Is_Consistent_With;
-----------------------------------
-- Is_Redefinition_Context_Valid --
-----------------------------------
overriding function Is_Redefinition_Context_Valid
(Self : not null access constant OCL_Template_Parameter_Type_Proxy;
Redefined : AMF.UML.Redefinable_Elements.UML_Redefinable_Element_Access)
return Boolean is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Is_Redefinition_Context_Valid unimplemented");
raise Program_Error with "Unimplemented procedure OCL_Template_Parameter_Type_Proxy.Is_Redefinition_Context_Valid";
return Is_Redefinition_Context_Valid (Self, Redefined);
end Is_Redefinition_Context_Valid;
-------------------
-- Enter_Element --
-------------------
overriding procedure Enter_Element
(Self : not null access constant OCL_Template_Parameter_Type_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.OCL_Visitors.OCL_Visitor'Class then
AMF.Visitors.OCL_Visitors.OCL_Visitor'Class
(Visitor).Enter_Template_Parameter_Type
(AMF.OCL.Template_Parameter_Types.OCL_Template_Parameter_Type_Access (Self),
Control);
end if;
end Enter_Element;
-------------------
-- Leave_Element --
-------------------
overriding procedure Leave_Element
(Self : not null access constant OCL_Template_Parameter_Type_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.OCL_Visitors.OCL_Visitor'Class then
AMF.Visitors.OCL_Visitors.OCL_Visitor'Class
(Visitor).Leave_Template_Parameter_Type
(AMF.OCL.Template_Parameter_Types.OCL_Template_Parameter_Type_Access (Self),
Control);
end if;
end Leave_Element;
-------------------
-- Visit_Element --
-------------------
overriding procedure Visit_Element
(Self : not null access constant OCL_Template_Parameter_Type_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Iterator in AMF.Visitors.OCL_Iterators.OCL_Iterator'Class then
AMF.Visitors.OCL_Iterators.OCL_Iterator'Class
(Iterator).Visit_Template_Parameter_Type
(Visitor,
AMF.OCL.Template_Parameter_Types.OCL_Template_Parameter_Type_Access (Self),
Control);
end if;
end Visit_Element;
end AMF.Internals.OCL_Template_Parameter_Types;
|
-- Copyright 2008-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/>.
package body Pck is
procedure Do_Nothing (C : in out Circle) is
begin
null;
end Do_Nothing;
end Pck;
|
with Function_Declaration;
procedure Function_Call is
Result : Integer;
begin
Result := Function_Declaration;
end Function_Call;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011, Vadim Godunko <vgodunko@gmail.com> --
-- 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 type is a named element that is used as the type for a typed element. A
-- type can be contained in a package.
------------------------------------------------------------------------------
with AMF.CMOF.Named_Elements;
with AMF.CMOF.Packageable_Elements;
limited with AMF.CMOF.Packages;
package AMF.CMOF.Types is
pragma Preelaborate;
type CMOF_Type is limited interface
and AMF.CMOF.Packageable_Elements.CMOF_Packageable_Element
and AMF.CMOF.Named_Elements.CMOF_Named_Element;
type CMOF_Type_Access is
access all CMOF_Type'Class;
for CMOF_Type_Access'Storage_Size use 0;
not overriding function Get_Package
(Self : not null access constant CMOF_Type)
return AMF.CMOF.Packages.CMOF_Package_Access is abstract;
-- Getter of Type::package.
--
-- Specifies the owning package of this classifier, if any.
not overriding procedure Set_Package
(Self : not null access CMOF_Type;
To : AMF.CMOF.Packages.CMOF_Package_Access) is abstract;
-- Setter of Type::package.
--
-- Specifies the owning package of this classifier, if any.
not overriding function Conforms_To
(Self : not null access constant CMOF_Type;
Other : AMF.CMOF.Types.CMOF_Type_Access)
return Boolean is abstract;
-- Operation Type::conformsTo.
--
-- The query conformsTo() gives true for a type that conforms to another.
-- By default, two types do not conform to each other. This query is
-- intended to be redefined for specific conformance situations.
end AMF.CMOF.Types;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . L O C A L E S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2010, Free Software Foundation, Inc. --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
package Ada.Locales is
pragma Preelaborate (Locales);
pragma Remote_Types (Locales);
type Language_Code is array (1 .. 3) of Character range 'a' .. 'z';
type Country_Code is array (1 .. 2) of Character range 'A' .. 'Z';
Language_Unknown : constant Language_Code := "und";
Country_Unknown : constant Country_Code := "ZZ";
function Language return Language_Code;
function Country return Country_Code;
end Ada.Locales;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . W I D E _ T E X T _ I O . M O D U L A R _ I O --
-- --
-- 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 Ada.Wide_Text_IO.Modular_Aux;
with System.Unsigned_Types; use System.Unsigned_Types;
with System.WCh_Con; use System.WCh_Con;
with System.WCh_WtS; use System.WCh_WtS;
package body Ada.Wide_Text_IO.Modular_IO is
subtype TFT is Ada.Wide_Text_IO.File_Type;
-- File type required for calls to routines in Aux
package Aux renames Ada.Wide_Text_IO.Modular_Aux;
---------
-- Get --
---------
procedure Get
(File : File_Type;
Item : out Num;
Width : Field := 0)
is
begin
if Num'Size > Unsigned'Size then
Aux.Get_LLU (TFT (File), Long_Long_Unsigned (Item), Width);
else
Aux.Get_Uns (TFT (File), Unsigned (Item), Width);
end if;
exception
when Constraint_Error => raise Data_Error;
end Get;
procedure Get
(Item : out Num;
Width : Field := 0)
is
begin
Get (Current_Input, Item, Width);
end Get;
procedure Get
(From : Wide_String;
Item : out Num;
Last : out Positive)
is
S : constant String := Wide_String_To_String (From, WCEM_Upper);
-- String on which we do the actual conversion. Note that the method
-- used for wide character encoding is irrelevant, since if there is
-- a character outside the Standard.Character range then the call to
-- Aux.Gets will raise Data_Error in any case.
begin
if Num'Size > Unsigned'Size then
Aux.Gets_LLU (S, Long_Long_Unsigned (Item), Last);
else
Aux.Gets_Uns (S, Unsigned (Item), Last);
end if;
exception
when Constraint_Error => raise Data_Error;
end Get;
---------
-- Put --
---------
procedure Put
(File : File_Type;
Item : Num;
Width : Field := Default_Width;
Base : Number_Base := Default_Base)
is
begin
if Num'Size > Unsigned'Size then
Aux.Put_LLU (TFT (File), Long_Long_Unsigned (Item), Width, Base);
else
Aux.Put_Uns (TFT (File), Unsigned (Item), Width, Base);
end if;
end Put;
procedure Put
(Item : Num;
Width : Field := Default_Width;
Base : Number_Base := Default_Base)
is
begin
Put (Current_Output, Item, Width, Base);
end Put;
procedure Put
(To : out Wide_String;
Item : Num;
Base : Number_Base := Default_Base)
is
S : String (To'First .. To'Last);
begin
if Num'Size > Unsigned'Size then
Aux.Puts_LLU (S, Long_Long_Unsigned (Item), Base);
else
Aux.Puts_Uns (S, Unsigned (Item), Base);
end if;
for J in S'Range loop
To (J) := Wide_Character'Val (Character'Pos (S (J)));
end loop;
end Put;
end Ada.Wide_Text_IO.Modular_IO;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . M E M O R Y _ M O V E --
-- --
-- S p e c --
-- --
-- Copyright (C) 2006-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. --
-- --
-- --
-- --
-- --
-- --
-- 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 mechanism analogous to that
-- provided by the C routine memmove allowing for copies with overlap.
pragma Restrictions (No_Elaboration_Code);
with Interfaces.C;
package System.Memory_Move
with SPARK_Mode => On is
pragma Preelaborate;
function memmove
(Dest : Address; Src : Address; N : Interfaces.C.size_t) return Address;
pragma Export (C, memmove, "memmove");
-- Copies N storage units from area starting at Src to area starting
-- at Dest without any check for buffer overflow. The difference between
-- this memmove and memcpy is that with memmove, the storage areas may
-- overlap (forwards or backwards) and the result is correct (i.e. it
-- is as if Src is first moved to a temporary area, and then this area
-- is copied to Dst in a separate step).
end System.Memory_Move;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Tools Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2015, Vadim Godunko <vgodunko@gmail.com> --
-- 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.Wide_Wide_Text_IO;
with Interfaces;
with Asis.Expressions;
with League.String_Vectors;
package body Properties.Expressions.Integer_Literal is
----------
-- Code --
----------
function Code
(Engine : access Engines.Contexts.Context;
Element : Asis.Expression;
Name : Engines.Text_Property) return League.Strings.Universal_String
is
pragma Unreferenced (Engine, Name);
Image : constant Wide_String := Asis.Expressions.Value_Image (Element);
Result : League.Strings.Universal_String :=
League.Strings.From_UTF_16_Wide_String (Image);
begin
if Result.Index ('.') > 0 then
declare
Value : constant Long_Long_Float :=
Long_Long_Float'Wide_Value (Image);
Text : constant Wide_Wide_String :=
Long_Long_Float'Wide_Wide_Image (Value);
begin
Result :=
League.Strings.To_Universal_String (Text (2 .. Text'Last));
end;
elsif Result.Starts_With ("16#") then
declare
package IO is
new Ada.Wide_Wide_Text_IO.Modular_IO (Interfaces.Unsigned_32);
Value : constant Interfaces.Unsigned_32 :=
Interfaces.Unsigned_32'Wide_Value (Image);
Text : Wide_Wide_String (1 .. 19);
List : League.String_Vectors.Universal_String_Vector;
begin
IO.Put (Text, Value, 16);
Result := League.Strings.To_Universal_String (Text);
List := Result.Split ('#');
Result.Clear;
Result.Append ("0x");
Result.Append (List.Element (2));
end;
else
declare
Value : constant Interfaces.Unsigned_32 :=
Interfaces.Unsigned_32'Wide_Value (Image);
Text : constant Wide_Wide_String :=
Interfaces.Unsigned_32'Wide_Wide_Image (Value);
begin
Result :=
League.Strings.To_Universal_String (Text (2 .. Text'Last));
end;
end if;
return Result;
end Code;
end Properties.Expressions.Integer_Literal;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . N U M E R I C S . L O N G _ L O N G _R E A L _ A R R A Y 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. --
-- --
------------------------------------------------------------------------------
with Ada.Numerics.Generic_Real_Arrays;
package Ada.Numerics.Long_Long_Real_Arrays is
new Ada.Numerics.Generic_Real_Arrays (Long_Long_Float);
pragma Pure (Long_Long_Real_Arrays);
|
-- Copyright (c) 2014 onox <denkpadje@gmail.com>
--
-- Permission to use, copy, modify, and/or 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.
with Ahven; use Ahven;
with Opus.Decoders;
use Opus;
use Opus.Decoders;
package body Test_Decoders is
Unexpected_Sampling_Rate_Message : constant String := "Unexpected sampling rate";
Unexpected_Configuration_Message : constant String := "Unexpected configuration";
Expected_No_Packets_Decoded_Message : constant String := "Expected No_Packets_Decoded exception";
overriding
procedure Initialize (T : in out Test) is
begin
T.Set_Name ("Decoders");
T.Add_Test_Routine (Test_Create_Decoder'Access, "Create decoder");
T.Add_Test_Routine (Test_Destroy_Decoder'Access, "Destroy decoder");
T.Add_Test_Routine (Test_Reset_State'Access, "Reset state of decoder");
T.Add_Test_Routine (Test_Default_Configuration'Access, "Test the default configuration of the decoder");
T.Add_Test_Routine (Test_Change_Configuration'Access, "Test changing the configuration of the decoder");
end Initialize;
procedure Test_Create_Decoder is
Decoder_Mono_8_kHz : Decoder_Data;
begin
Decoder_Mono_8_kHz := Create (Rate_8_kHz, Mono);
Assert (Get_Sample_Rate (Decoder_Mono_8_kHz) = Rate_8_kHz, Unexpected_Sampling_Rate_Message);
end Test_Create_Decoder;
procedure Test_Destroy_Decoder is
Decoder : constant Decoder_Data := Create (Rate_8_kHz, Mono);
begin
Destroy (Decoder);
end Test_Destroy_Decoder;
procedure Test_Reset_State is
Decoder : constant Decoder_Data := Create (Rate_8_kHz, Stereo);
begin
Reset_State (Decoder);
end Test_Reset_State;
procedure Test_Default_Configuration is
Decoder : constant Decoder_Data := Create (Rate_8_kHz, Mono);
begin
Assert (Get_Sample_Rate (Decoder) = Rate_8_kHz, Unexpected_Configuration_Message);
Assert (Get_Channels (Decoder) = Mono, Unexpected_Configuration_Message);
Assert (Get_Pitch (Decoder) = 0, Unexpected_Configuration_Message);
Assert (Get_Gain (Decoder) = 0, Unexpected_Configuration_Message);
Assert (Get_Last_Packet_Duration (Decoder) = 0, Unexpected_Configuration_Message);
declare
Result : Bandwidth
with Unreferenced;
begin
Result := Get_Bandwidth (Decoder);
Fail (Expected_No_Packets_Decoded_Message);
exception
when No_Packets_Decoded =>
null;
end;
end Test_Default_Configuration;
procedure Test_Change_Configuration is
Decoder : constant Decoder_Data := Create (Rate_8_kHz, Mono);
begin
null;
Set_Gain (Decoder, 1);
Assert (Get_Gain (Decoder) = 1, Unexpected_Configuration_Message);
Set_Gain (Decoder, 0);
Assert (Get_Gain (Decoder) = 0, Unexpected_Configuration_Message);
end Test_Change_Configuration;
end Test_Decoders;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <vgodunko@gmail.com> --
-- 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.Elements;
with AMF.Internals.Helpers;
with AMF.Internals.Tables.UML_Attributes;
with AMF.Visitors.UMLDI_Iterators;
with AMF.Visitors.UMLDI_Visitors;
package body AMF.Internals.UMLDI_UML_Shapes is
-----------------
-- Get_Is_Icon --
-----------------
overriding function Get_Is_Icon
(Self : not null access constant UMLDI_UML_Shape_Proxy)
return Boolean is
begin
return
AMF.Internals.Tables.UML_Attributes.Internal_Get_Is_Icon
(Self.Element);
end Get_Is_Icon;
-----------------
-- Set_Is_Icon --
-----------------
overriding procedure Set_Is_Icon
(Self : not null access UMLDI_UML_Shape_Proxy;
To : Boolean) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Is_Icon
(Self.Element, To);
end Set_Is_Icon;
---------------------
-- Get_Local_Style --
---------------------
overriding function Get_Local_Style
(Self : not null access constant UMLDI_UML_Shape_Proxy)
return AMF.UMLDI.UML_Styles.UMLDI_UML_Style_Access is
begin
return
AMF.UMLDI.UML_Styles.UMLDI_UML_Style_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Local_Style
(Self.Element)));
end Get_Local_Style;
---------------------
-- Set_Local_Style --
---------------------
overriding procedure Set_Local_Style
(Self : not null access UMLDI_UML_Shape_Proxy;
To : AMF.UMLDI.UML_Styles.UMLDI_UML_Style_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Local_Style
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Local_Style;
-----------------------
-- Get_Model_Element --
-----------------------
overriding function Get_Model_Element
(Self : not null access constant UMLDI_UML_Shape_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element is
begin
raise Program_Error;
return X : AMF.UML.Elements.Collections.Set_Of_UML_Element;
-- return
-- AMF.UML.Elements.Collections.Wrap
-- (AMF.Internals.Element_Collections.Wrap
-- (AMF.Internals.Tables.UML_Attributes.Internal_Get_Model_Element
-- (Self.Element)));
end Get_Model_Element;
-----------------------
-- Get_Model_Element --
-----------------------
overriding function Get_Model_Element
(Self : not null access constant UMLDI_UML_Shape_Proxy)
return AMF.CMOF.Elements.CMOF_Element_Access is
begin
return
AMF.CMOF.Elements.CMOF_Element_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Model_Element
(Self.Element)));
end Get_Model_Element;
---------------------
-- Get_Local_Style --
---------------------
overriding function Get_Local_Style
(Self : not null access constant UMLDI_UML_Shape_Proxy)
return AMF.DI.Styles.DI_Style_Access is
begin
return
AMF.DI.Styles.DI_Style_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Local_Style
(Self.Element)));
end Get_Local_Style;
---------------------
-- Set_Local_Style --
---------------------
overriding procedure Set_Local_Style
(Self : not null access UMLDI_UML_Shape_Proxy;
To : AMF.DI.Styles.DI_Style_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Local_Style
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Local_Style;
----------------
-- Get_Bounds --
----------------
overriding function Get_Bounds
(Self : not null access constant UMLDI_UML_Shape_Proxy)
return AMF.DC.Optional_DC_Bounds is
begin
return
AMF.Internals.Tables.UML_Attributes.Internal_Get_Bounds
(Self.Element);
end Get_Bounds;
----------------
-- Set_Bounds --
----------------
overriding procedure Set_Bounds
(Self : not null access UMLDI_UML_Shape_Proxy;
To : AMF.DC.Optional_DC_Bounds) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Bounds
(Self.Element, To);
end Set_Bounds;
-------------------
-- Enter_Element --
-------------------
overriding procedure Enter_Element
(Self : not null access constant UMLDI_UML_Shape_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.UMLDI_Visitors.UMLDI_Visitor'Class then
AMF.Visitors.UMLDI_Visitors.UMLDI_Visitor'Class
(Visitor).Enter_UML_Shape
(AMF.UMLDI.UML_Shapes.UMLDI_UML_Shape_Access (Self),
Control);
end if;
end Enter_Element;
-------------------
-- Leave_Element --
-------------------
overriding procedure Leave_Element
(Self : not null access constant UMLDI_UML_Shape_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.UMLDI_Visitors.UMLDI_Visitor'Class then
AMF.Visitors.UMLDI_Visitors.UMLDI_Visitor'Class
(Visitor).Leave_UML_Shape
(AMF.UMLDI.UML_Shapes.UMLDI_UML_Shape_Access (Self),
Control);
end if;
end Leave_Element;
-------------------
-- Visit_Element --
-------------------
overriding procedure Visit_Element
(Self : not null access constant UMLDI_UML_Shape_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.UMLDI_Iterators.UMLDI_Iterator'Class then
AMF.Visitors.UMLDI_Iterators.UMLDI_Iterator'Class
(Iterator).Visit_UML_Shape
(Visitor,
AMF.UMLDI.UML_Shapes.UMLDI_UML_Shape_Access (Self),
Control);
end if;
end Visit_Element;
end AMF.Internals.UMLDI_UML_Shapes;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . S T R I N G S . W I D E _ W I D E _ U N B O U N D E D --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2021, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Strings.Wide_Wide_Maps;
with Ada.Finalization;
package Ada.Strings.Wide_Wide_Unbounded is
pragma Preelaborate;
type Unbounded_Wide_Wide_String is private;
pragma Preelaborable_Initialization (Unbounded_Wide_Wide_String);
Null_Unbounded_Wide_Wide_String : constant Unbounded_Wide_Wide_String;
function Length (Source : Unbounded_Wide_Wide_String) return Natural;
type Wide_Wide_String_Access is access all Wide_Wide_String;
procedure Free (X : in out Wide_Wide_String_Access);
--------------------------------------------------------
-- Conversion, Concatenation, and Selection Functions --
--------------------------------------------------------
function To_Unbounded_Wide_Wide_String
(Source : Wide_Wide_String) return Unbounded_Wide_Wide_String;
function To_Unbounded_Wide_Wide_String
(Length : Natural) return Unbounded_Wide_Wide_String;
function To_Wide_Wide_String
(Source : Unbounded_Wide_Wide_String) return Wide_Wide_String;
procedure Set_Unbounded_Wide_Wide_String
(Target : out Unbounded_Wide_Wide_String;
Source : Wide_Wide_String);
pragma Ada_05 (Set_Unbounded_Wide_Wide_String);
procedure Append
(Source : in out Unbounded_Wide_Wide_String;
New_Item : Unbounded_Wide_Wide_String);
procedure Append
(Source : in out Unbounded_Wide_Wide_String;
New_Item : Wide_Wide_String);
procedure Append
(Source : in out Unbounded_Wide_Wide_String;
New_Item : Wide_Wide_Character);
function "&"
(Left : Unbounded_Wide_Wide_String;
Right : Unbounded_Wide_Wide_String) return Unbounded_Wide_Wide_String;
function "&"
(Left : Unbounded_Wide_Wide_String;
Right : Wide_Wide_String) return Unbounded_Wide_Wide_String;
function "&"
(Left : Wide_Wide_String;
Right : Unbounded_Wide_Wide_String) return Unbounded_Wide_Wide_String;
function "&"
(Left : Unbounded_Wide_Wide_String;
Right : Wide_Wide_Character) return Unbounded_Wide_Wide_String;
function "&"
(Left : Wide_Wide_Character;
Right : Unbounded_Wide_Wide_String) return Unbounded_Wide_Wide_String;
function Element
(Source : Unbounded_Wide_Wide_String;
Index : Positive) return Wide_Wide_Character;
procedure Replace_Element
(Source : in out Unbounded_Wide_Wide_String;
Index : Positive;
By : Wide_Wide_Character);
function Slice
(Source : Unbounded_Wide_Wide_String;
Low : Positive;
High : Natural) return Wide_Wide_String;
function Unbounded_Slice
(Source : Unbounded_Wide_Wide_String;
Low : Positive;
High : Natural) return Unbounded_Wide_Wide_String;
pragma Ada_05 (Unbounded_Slice);
procedure Unbounded_Slice
(Source : Unbounded_Wide_Wide_String;
Target : out Unbounded_Wide_Wide_String;
Low : Positive;
High : Natural);
pragma Ada_05 (Unbounded_Slice);
function "="
(Left : Unbounded_Wide_Wide_String;
Right : Unbounded_Wide_Wide_String) return Boolean;
function "="
(Left : Unbounded_Wide_Wide_String;
Right : Wide_Wide_String) return Boolean;
function "="
(Left : Wide_Wide_String;
Right : Unbounded_Wide_Wide_String) return Boolean;
function "<"
(Left : Unbounded_Wide_Wide_String;
Right : Unbounded_Wide_Wide_String) return Boolean;
function "<"
(Left : Unbounded_Wide_Wide_String;
Right : Wide_Wide_String) return Boolean;
function "<"
(Left : Wide_Wide_String;
Right : Unbounded_Wide_Wide_String) return Boolean;
function "<="
(Left : Unbounded_Wide_Wide_String;
Right : Unbounded_Wide_Wide_String) return Boolean;
function "<="
(Left : Unbounded_Wide_Wide_String;
Right : Wide_Wide_String) return Boolean;
function "<="
(Left : Wide_Wide_String;
Right : Unbounded_Wide_Wide_String) return Boolean;
function ">"
(Left : Unbounded_Wide_Wide_String;
Right : Unbounded_Wide_Wide_String) return Boolean;
function ">"
(Left : Unbounded_Wide_Wide_String;
Right : Wide_Wide_String) return Boolean;
function ">"
(Left : Wide_Wide_String;
Right : Unbounded_Wide_Wide_String) return Boolean;
function ">="
(Left : Unbounded_Wide_Wide_String;
Right : Unbounded_Wide_Wide_String) return Boolean;
function ">="
(Left : Unbounded_Wide_Wide_String;
Right : Wide_Wide_String) return Boolean;
function ">="
(Left : Wide_Wide_String;
Right : Unbounded_Wide_Wide_String) return Boolean;
------------------------
-- Search Subprograms --
------------------------
function Index
(Source : Unbounded_Wide_Wide_String;
Pattern : Wide_Wide_String;
Going : Direction := Forward;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping :=
Wide_Wide_Maps.Identity)
return Natural;
function Index
(Source : Unbounded_Wide_Wide_String;
Pattern : Wide_Wide_String;
Going : Direction := Forward;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function)
return Natural;
function Index
(Source : Unbounded_Wide_Wide_String;
Set : Wide_Wide_Maps.Wide_Wide_Character_Set;
Test : Membership := Inside;
Going : Direction := Forward) return Natural;
function Index
(Source : Unbounded_Wide_Wide_String;
Pattern : Wide_Wide_String;
From : Positive;
Going : Direction := Forward;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping :=
Wide_Wide_Maps.Identity)
return Natural;
pragma Ada_05 (Index);
function Index
(Source : Unbounded_Wide_Wide_String;
Pattern : Wide_Wide_String;
From : Positive;
Going : Direction := Forward;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function)
return Natural;
pragma Ada_05 (Index);
function Index
(Source : Unbounded_Wide_Wide_String;
Set : Wide_Wide_Maps.Wide_Wide_Character_Set;
From : Positive;
Test : Membership := Inside;
Going : Direction := Forward) return Natural;
pragma Ada_05 (Index);
function Index_Non_Blank
(Source : Unbounded_Wide_Wide_String;
Going : Direction := Forward) return Natural;
function Index_Non_Blank
(Source : Unbounded_Wide_Wide_String;
From : Positive;
Going : Direction := Forward) return Natural;
pragma Ada_05 (Index_Non_Blank);
function Count
(Source : Unbounded_Wide_Wide_String;
Pattern : Wide_Wide_String;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping :=
Wide_Wide_Maps.Identity)
return Natural;
function Count
(Source : Unbounded_Wide_Wide_String;
Pattern : Wide_Wide_String;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function)
return Natural;
function Count
(Source : Unbounded_Wide_Wide_String;
Set : Wide_Wide_Maps.Wide_Wide_Character_Set) return Natural;
procedure Find_Token
(Source : Unbounded_Wide_Wide_String;
Set : Wide_Wide_Maps.Wide_Wide_Character_Set;
From : Positive;
Test : Membership;
First : out Positive;
Last : out Natural);
pragma Ada_2012 (Find_Token);
procedure Find_Token
(Source : Unbounded_Wide_Wide_String;
Set : Wide_Wide_Maps.Wide_Wide_Character_Set;
Test : Membership;
First : out Positive;
Last : out Natural);
------------------------------------
-- String Translation Subprograms --
------------------------------------
function Translate
(Source : Unbounded_Wide_Wide_String;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping)
return Unbounded_Wide_Wide_String;
procedure Translate
(Source : in out Unbounded_Wide_Wide_String;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping);
function Translate
(Source : Unbounded_Wide_Wide_String;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function)
return Unbounded_Wide_Wide_String;
procedure Translate
(Source : in out Unbounded_Wide_Wide_String;
Mapping : Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function);
---------------------------------------
-- String Transformation Subprograms --
---------------------------------------
function Replace_Slice
(Source : Unbounded_Wide_Wide_String;
Low : Positive;
High : Natural;
By : Wide_Wide_String) return Unbounded_Wide_Wide_String;
procedure Replace_Slice
(Source : in out Unbounded_Wide_Wide_String;
Low : Positive;
High : Natural;
By : Wide_Wide_String);
function Insert
(Source : Unbounded_Wide_Wide_String;
Before : Positive;
New_Item : Wide_Wide_String) return Unbounded_Wide_Wide_String;
procedure Insert
(Source : in out Unbounded_Wide_Wide_String;
Before : Positive;
New_Item : Wide_Wide_String);
function Overwrite
(Source : Unbounded_Wide_Wide_String;
Position : Positive;
New_Item : Wide_Wide_String) return Unbounded_Wide_Wide_String;
procedure Overwrite
(Source : in out Unbounded_Wide_Wide_String;
Position : Positive;
New_Item : Wide_Wide_String);
function Delete
(Source : Unbounded_Wide_Wide_String;
From : Positive;
Through : Natural) return Unbounded_Wide_Wide_String;
procedure Delete
(Source : in out Unbounded_Wide_Wide_String;
From : Positive;
Through : Natural);
function Trim
(Source : Unbounded_Wide_Wide_String;
Side : Trim_End) return Unbounded_Wide_Wide_String;
procedure Trim
(Source : in out Unbounded_Wide_Wide_String;
Side : Trim_End);
function Trim
(Source : Unbounded_Wide_Wide_String;
Left : Wide_Wide_Maps.Wide_Wide_Character_Set;
Right : Wide_Wide_Maps.Wide_Wide_Character_Set)
return Unbounded_Wide_Wide_String;
procedure Trim
(Source : in out Unbounded_Wide_Wide_String;
Left : Wide_Wide_Maps.Wide_Wide_Character_Set;
Right : Wide_Wide_Maps.Wide_Wide_Character_Set);
function Head
(Source : Unbounded_Wide_Wide_String;
Count : Natural;
Pad : Wide_Wide_Character := Wide_Wide_Space)
return Unbounded_Wide_Wide_String;
procedure Head
(Source : in out Unbounded_Wide_Wide_String;
Count : Natural;
Pad : Wide_Wide_Character := Wide_Wide_Space);
function Tail
(Source : Unbounded_Wide_Wide_String;
Count : Natural;
Pad : Wide_Wide_Character := Wide_Wide_Space)
return Unbounded_Wide_Wide_String;
procedure Tail
(Source : in out Unbounded_Wide_Wide_String;
Count : Natural;
Pad : Wide_Wide_Character := Wide_Wide_Space);
function "*"
(Left : Natural;
Right : Wide_Wide_Character) return Unbounded_Wide_Wide_String;
function "*"
(Left : Natural;
Right : Wide_Wide_String) return Unbounded_Wide_Wide_String;
function "*"
(Left : Natural;
Right : Unbounded_Wide_Wide_String) return Unbounded_Wide_Wide_String;
private
pragma Inline (Length);
package AF renames Ada.Finalization;
Null_Wide_Wide_String : aliased Wide_Wide_String := "";
function To_Unbounded_Wide
(S : Wide_Wide_String) return Unbounded_Wide_Wide_String
renames To_Unbounded_Wide_Wide_String;
type Unbounded_Wide_Wide_String is new AF.Controlled with record
Reference : Wide_Wide_String_Access := Null_Wide_Wide_String'Access;
Last : Natural := 0;
end record;
-- The Unbounded_Wide_Wide_String is using a buffered implementation to
-- increase speed of the Append/Delete/Insert procedures. The Reference
-- string pointer above contains the current string value and extra room
-- at the end to be used by the next Append routine. Last is the index of
-- the string ending character. So the current string value is really
-- Reference (1 .. Last).
pragma Stream_Convert
(Unbounded_Wide_Wide_String, To_Unbounded_Wide, To_Wide_Wide_String);
pragma Finalize_Storage_Only (Unbounded_Wide_Wide_String);
-- Finalization is required only for freeing storage
procedure Initialize (Object : in out Unbounded_Wide_Wide_String);
procedure Adjust (Object : in out Unbounded_Wide_Wide_String);
procedure Finalize (Object : in out Unbounded_Wide_Wide_String);
procedure Realloc_For_Chunk
(Source : in out Unbounded_Wide_Wide_String;
Chunk_Size : Natural);
-- Adjust the size allocated for the string. Add at least Chunk_Size so it
-- is safe to add a string of this size at the end of the current content.
-- The real size allocated for the string is Chunk_Size + x of the current
-- string size. This buffered handling makes the Append unbounded string
-- routines very fast.
Null_Unbounded_Wide_Wide_String : constant Unbounded_Wide_Wide_String :=
(AF.Controlled with
Reference =>
Null_Wide_Wide_String'Access,
Last => 0);
end Ada.Strings.Wide_Wide_Unbounded;
|
-----------------------------------------------------------------------
-- Memory Events - Definition and Analysis of memory events
-- Copyright (C) 2014, 2015 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- 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 MAT.Memory.Probes;
package body MAT.Memory.Targets is
-- The logger
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("MAT.Memory.Targets");
-- ------------------------------
-- Initialize the target memory object to manage the memory slots, the stack frames
-- and setup the reader to analyze the memory events.
-- ------------------------------
procedure Initialize (Memory : in out Target_Memory;
Manager : in out MAT.Events.Probes.Probe_Manager_Type'Class) is
Memory_Probe : constant MAT.Memory.Probes.Memory_Probe_Type_Access
:= new MAT.Memory.Probes.Memory_Probe_Type;
begin
Memory_Probe.Data := Memory'Unrestricted_Access;
MAT.Memory.Probes.Register (Manager, Memory_Probe);
end Initialize;
-- ------------------------------
-- Add the memory region from the list of memory region managed by the program.
-- ------------------------------
procedure Add_Region (Memory : in out Target_Memory;
Region : in Region_Info) is
begin
Log.Info ("Add region [" & MAT.Types.Hex_Image (Region.Start_Addr) & "-"
& MAT.Types.Hex_Image (Region.End_Addr) & "] - {0}", Region.Path);
Memory.Memory.Add_Region (Region);
end Add_Region;
-- ------------------------------
-- Find the memory region that intersect the given section described by <tt>From</tt>
-- and <tt>To</tt>. Each memory region that intersects is added to the <tt>Into</tt>
-- map.
-- ------------------------------
procedure Find (Memory : in out Target_Memory;
From : in MAT.Types.Target_Addr;
To : in MAT.Types.Target_Addr;
Into : in out MAT.Memory.Region_Info_Map) is
begin
Memory.Memory.Find (From, To, Into);
end Find;
-- ------------------------------
-- Find the region that matches the given name.
-- ------------------------------
function Find_Region (Memory : in Target_Memory;
Name : in String) return Region_Info is
begin
return Memory.Memory.Find_Region (Name);
end Find_Region;
-- ------------------------------
-- Take into account a malloc probe. The memory slot [Addr .. Slot.Size] is inserted
-- in the used slots map. The freed slots that intersect the malloc'ed region are
-- removed from the freed map.
-- ------------------------------
procedure Probe_Malloc (Memory : in out Target_Memory;
Addr : in MAT.Types.Target_Addr;
Slot : in Allocation) is
begin
Memory.Memory.Probe_Malloc (Addr, Slot);
end Probe_Malloc;
-- ------------------------------
-- Take into account a free probe. Add the memory slot in the freed map and remove
-- the slot from the used slots map.
-- ------------------------------
procedure Probe_Free (Memory : in out Target_Memory;
Addr : in MAT.Types.Target_Addr;
Slot : in Allocation;
Size : out MAT.Types.Target_Size;
By : out MAT.Events.Event_Id_Type) is
begin
Memory.Memory.Probe_Free (Addr, Slot, Size, By);
end Probe_Free;
-- ------------------------------
-- Take into account a realloc probe. The old memory slot represented by Old_Addr is
-- removed from the used slots maps and the new memory slot [Addr .. Slot.Size] is
-- inserted in the used slots map.
-- ------------------------------
procedure Probe_Realloc (Memory : in out Target_Memory;
Addr : in MAT.Types.Target_Addr;
Old_Addr : in MAT.Types.Target_Addr;
Slot : in Allocation;
Old_Size : out MAT.Types.Target_Size;
By : out MAT.Events.Event_Id_Type) is
begin
Memory.Memory.Probe_Realloc (Addr, Old_Addr, Slot, Old_Size, By);
end Probe_Realloc;
-- ------------------------------
-- Collect the information about memory slot sizes allocated by the application.
-- ------------------------------
procedure Size_Information (Memory : in out Target_Memory;
Sizes : in out MAT.Memory.Tools.Size_Info_Map) is
begin
Memory.Memory.Size_Information (Sizes);
end Size_Information;
-- ------------------------------
-- Collect the information about threads and the memory allocations they've made.
-- ------------------------------
procedure Thread_Information (Memory : in out Target_Memory;
Threads : in out Memory_Info_Map) is
begin
Memory.Memory.Thread_Information (Threads);
end Thread_Information;
-- ------------------------------
-- Collect the information about frames and the memory allocations they've made.
-- ------------------------------
procedure Frame_Information (Memory : in out Target_Memory;
Level : in Natural;
Frames : in out Frame_Info_Map) is
begin
Memory.Memory.Frame_Information (Level, Frames);
end Frame_Information;
-- ------------------------------
-- Get the global memory and allocation statistics.
-- ------------------------------
procedure Stat_Information (Memory : in out Target_Memory;
Result : out Memory_Stat) is
begin
Memory.Memory.Stat_Information (Result);
end Stat_Information;
-- ------------------------------
-- Find from the <tt>Memory</tt> map the memory slots whose address intersects
-- the region [From .. To] and which is selected by the given filter expression.
-- Add the memory slot in the <tt>Into</tt> list if it does not already contains
-- the memory slot.
-- ------------------------------
procedure Find (Memory : in out Target_Memory;
From : in MAT.Types.Target_Addr;
To : in MAT.Types.Target_Addr;
Filter : in MAT.Expressions.Expression_Type;
Into : in out MAT.Memory.Allocation_Map) is
begin
Memory.Memory.Find (From, To, Filter, Into);
end Find;
protected body Memory_Allocator is
-- ------------------------------
-- Add the memory region from the list of memory region managed by the program.
-- ------------------------------
procedure Add_Region (Region : in Region_Info) is
begin
Regions.Insert (Region.Start_Addr, Region);
end Add_Region;
-- ------------------------------
-- Find the region that matches the given name.
-- ------------------------------
function Find_Region (Name : in String) return Region_Info is
Iter : Region_Info_Cursor := Regions.First;
begin
while Region_Info_Maps.Has_Element (Iter) loop
declare
Region : constant Region_Info := Region_Info_Maps.Element (Iter);
Path : constant String := Ada.Strings.Unbounded.To_String (Region.Path);
Pos : constant Natural := Util.Strings.Rindex (Path, '/');
begin
if Path = Name then
return Region;
end if;
if Pos > 0 and then Path (Pos + 1 .. Path'Last) = Name then
return Region;
end if;
end;
Region_Info_Maps.Next (Iter);
end loop;
raise Not_Found with "Region '" & Name & "' was not found";
end Find_Region;
-- ------------------------------
-- Find the memory region that intersect the given section described by <tt>From</tt>
-- and <tt>To</tt>. Each memory region that intersects is added to the <tt>Into</tt>
-- map.
-- ------------------------------
procedure Find (From : in MAT.Types.Target_Addr;
To : in MAT.Types.Target_Addr;
Into : in out MAT.Memory.Region_Info_Map) is
Iter : Region_Info_Cursor;
begin
Iter := Regions.Floor (From);
if not Region_Info_Maps.Has_Element (Iter) then
Iter := Regions.First;
end if;
while Region_Info_Maps.Has_Element (Iter) loop
declare
Start : constant MAT.Types.Target_Addr := Region_Info_Maps.Key (Iter);
Region : Region_Info;
begin
exit when Start > To;
Region := Region_Info_Maps.Element (Iter);
if Region.End_Addr >= From then
if not Into.Contains (Start) then
Into.Insert (Start, Region);
end if;
end if;
Region_Info_Maps.Next (Iter);
end;
end loop;
end Find;
-- ------------------------------
-- Remove the memory region [Addr .. Addr + Size] from the free list.
-- ------------------------------
procedure Remove_Free (Addr : in MAT.Types.Target_Addr;
Size : in MAT.Types.Target_Size) is
Iter : Allocation_Cursor;
Last : constant MAT.Types.Target_Addr := Addr + MAT.Types.Target_Addr (Size);
Slot : Allocation;
begin
-- Walk the list of free blocks and remove all the blocks which intersect the region
-- [Addr .. Addr + Slot.Size]. We start walking at the first block below and near
-- the address. Slots are then removed when they intersect the malloc'ed region.
Iter := Freed_Slots.Floor (Addr);
while Allocation_Maps.Has_Element (Iter) loop
declare
Freed_Addr : constant MAT.Types.Target_Addr := Allocation_Maps.Key (Iter);
begin
exit when Freed_Addr > Last;
Slot := Allocation_Maps.Element (Iter);
if Freed_Addr + MAT.Types.Target_Addr (Slot.Size) > Addr then
if Stats.Total_Free > Slot.Size then
Stats.Total_Free := Stats.Total_Free - Slot.Size;
else
Stats.Total_Free := 0;
end if;
Freed_Slots.Delete (Iter);
Iter := Freed_Slots.Floor (Addr);
else
Allocation_Maps.Next (Iter);
end if;
end;
end loop;
end Remove_Free;
-- ------------------------------
-- Take into account a malloc probe. The memory slot [Addr .. Slot.Size] is inserted
-- in the used slots map. The freed slots that intersect the malloc'ed region are
-- removed from the freed map.
-- ------------------------------
procedure Probe_Malloc (Addr : in MAT.Types.Target_Addr;
Slot : in Allocation) is
begin
if Log.Get_Level = Util.Log.DEBUG_LEVEL then
Log.Debug ("Malloc at {0} size {1}", MAT.Types.Hex_Image (Addr),
MAT.Types.Target_Size'Image (Slot.Size));
end if;
Stats.Malloc_Count := Stats.Malloc_Count + 1;
if Addr /= 0 then
Stats.Total_Alloc := Stats.Total_Alloc + Slot.Size;
Remove_Free (Addr, Slot.Size);
Used_Slots.Insert (Addr, Slot);
end if;
end Probe_Malloc;
-- ------------------------------
-- Take into account a free probe. Add the memory slot in the freed map and remove
-- the slot from the used slots map.
-- ------------------------------
procedure Probe_Free (Addr : in MAT.Types.Target_Addr;
Slot : in Allocation;
Size : out MAT.Types.Target_Size;
By : out MAT.Events.Event_Id_Type) is
Item : Allocation;
Iter : Allocation_Cursor;
begin
if Log.Get_Level = Util.Log.DEBUG_LEVEL then
Log.Debug ("Free {0}", MAT.Types.Hex_Image (Addr));
end if;
Stats.Free_Count := Stats.Free_Count + 1;
Iter := Used_Slots.Find (Addr);
if Allocation_Maps.Has_Element (Iter) then
Item := Allocation_Maps.Element (Iter);
Size := Item.Size;
By := Item.Event;
if Stats.Total_Alloc >= Item.Size then
Stats.Total_Alloc := Stats.Total_Alloc - Item.Size;
else
Stats.Total_Alloc := 0;
end if;
Stats.Total_Free := Stats.Total_Free + Item.Size;
Used_Slots.Delete (Iter);
Item.Frame := Slot.Frame;
Iter := Freed_Slots.Find (Addr);
if not Allocation_Maps.Has_Element (Iter) then
Freed_Slots.Insert (Addr, Item);
end if;
else
Size := 0;
By := 0;
end if;
exception
when others =>
Log.Error ("Free {0} raised some exception", MAT.Types.Hex_Image (Addr));
raise;
end Probe_Free;
-- ------------------------------
-- Take into account a realloc probe. The old memory slot represented by Old_Addr is
-- removed from the used slots maps and the new memory slot [Addr .. Slot.Size] is
-- inserted in the used slots map.
-- ------------------------------
procedure Probe_Realloc (Addr : in MAT.Types.Target_Addr;
Old_Addr : in MAT.Types.Target_Addr;
Slot : in Allocation;
Old_Size : out MAT.Types.Target_Size;
By : out MAT.Events.Event_Id_Type) is
procedure Update_Size (Key : in MAT.Types.Target_Addr;
Element : in out Allocation);
procedure Update_Size (Key : in MAT.Types.Target_Addr;
Element : in out Allocation) is
pragma Unreferenced (Key);
begin
if Stats.Total_Alloc >= Element.Size then
Stats.Total_Alloc := Stats.Total_Alloc - Element.Size;
else
Stats.Total_Alloc := 0;
end if;
Old_Size := Element.Size;
By := Element.Event;
Element.Size := Slot.Size;
Element.Frame := Slot.Frame;
Element.Event := Slot.Event;
end Update_Size;
Pos : Allocation_Cursor;
begin
if Log.Get_Level = Util.Log.DEBUG_LEVEL then
Log.Debug ("Realloc {0} to {1} size {2}", MAT.Types.Hex_Image (Old_Addr),
MAT.Types.Hex_Image (Addr), MAT.Types.Target_Size'Image (Slot.Size));
end if;
Old_Size := 0;
By := 0;
Stats.Realloc_Count := Stats.Realloc_Count + 1;
if Addr /= 0 then
Stats.Total_Alloc := Stats.Total_Alloc + Slot.Size;
Pos := Used_Slots.Find (Old_Addr);
if Allocation_Maps.Has_Element (Pos) then
if Addr = Old_Addr then
Used_Slots.Update_Element (Pos, Update_Size'Access);
else
Old_Size := Allocation_Maps.Element (Pos).Size;
By := Allocation_Maps.Element (Pos).Event;
Stats.Total_Alloc := Stats.Total_Alloc - Old_Size;
Used_Slots.Delete (Pos);
Used_Slots.Insert (Addr, Slot);
end if;
else
Used_Slots.Insert (Addr, Slot);
end if;
Remove_Free (Addr, Slot.Size);
end if;
end Probe_Realloc;
-- ------------------------------
-- Collect the information about memory slot sizes allocated by the application.
-- ------------------------------
procedure Size_Information (Sizes : in out MAT.Memory.Tools.Size_Info_Map) is
begin
MAT.Memory.Tools.Size_Information (Used_Slots, Sizes);
end Size_Information;
-- ------------------------------
-- Collect the information about threads and the memory allocations they've made.
-- ------------------------------
procedure Thread_Information (Threads : in out Memory_Info_Map) is
begin
MAT.Memory.Tools.Thread_Information (Used_Slots, Threads);
end Thread_Information;
-- ------------------------------
-- Collect the information about frames and the memory allocations they've made.
-- ------------------------------
procedure Frame_Information (Level : in Natural;
Frames : in out Frame_Info_Map) is
begin
MAT.Memory.Tools.Frame_Information (Used_Slots, Level, Frames);
end Frame_Information;
-- ------------------------------
-- Find from the <tt>Memory</tt> map the memory slots whose address intersects
-- the region [From .. To] and which is selected by the given filter expression.
-- Add the memory slot in the <tt>Into</tt> list if it does not already contains
-- the memory slot.
-- ------------------------------
procedure Find (From : in MAT.Types.Target_Addr;
To : in MAT.Types.Target_Addr;
Filter : in MAT.Expressions.Expression_Type;
Into : in out MAT.Memory.Allocation_Map) is
begin
MAT.Memory.Tools.Find (Used_Slots, From, To, Filter, Into);
end Find;
-- ------------------------------
-- Get the global memory and allocation statistics.
-- ------------------------------
procedure Stat_Information (Result : out Memory_Stat) is
begin
Result := Stats;
Result.Used_Count := Natural (Used_Slots.Length);
end Stat_Information;
end Memory_Allocator;
end MAT.Memory.Targets;
|
with
aIDE.GUI,
aIDE.Editor.of_enumeration_literal,
AdaM.a_Type.enumeration_literal,
glib.Error,
gtk.Builder,
gtk.Handlers;
with Ada.Text_IO; use Ada.Text_IO;
package body aIDE.Editor.of_subtype_indication
is
use Gtk.Builder,
Glib,
glib.Error;
function on_first_Entry_leave (the_Entry : access Gtk_Entry_Record'Class;
Target : in AdaM.subtype_Indication.view) return Boolean
is
the_Text : constant String := the_Entry.Get_Text;
begin
Target.First_is (the_Text);
return False;
end on_first_Entry_leave;
function on_last_Entry_leave (the_Entry : access Gtk_Entry_Record'Class;
Target : in AdaM.subtype_Indication.view) return Boolean
is
the_Text : constant String := the_Entry.Get_Text;
begin
Target.Last_is (the_Text);
return False;
end on_last_Entry_leave;
procedure on_index_type_Button_clicked (the_Entry : access Gtk_Button_Record'Class;
the_Editor : in aIDE.Editor.of_subtype_Indication.view)
is
begin
aIDE.GUI.show_types_Palette (Invoked_by => the_Entry.all'Access,
Target => the_Editor.Target.main_Type);
end on_index_type_Button_clicked;
procedure on_rid_Button_clicked (the_Button : access Gtk_Button_Record'Class;
the_Editor : in aIDE.Editor.of_subtype_Indication.view)
is
pragma Unreferenced (the_Editor);
begin
the_Button.get_Parent.destroy;
end on_rid_Button_clicked;
package Entry_return_Callbacks is new Gtk.Handlers.User_Return_Callback (Gtk_Entry_Record,
Boolean,
AdaM.subtype_Indication.view);
package Button_Callbacks is new Gtk.Handlers.User_Callback (Gtk_Button_Record,
aIDE.Editor.of_subtype_Indication.view);
function on_unconstrained_Label_clicked (the_Label : access Gtk_Label_Record'Class;
Self : in aIDE.Editor.of_subtype_Indication.view) return Boolean
is
pragma Unreferenced (the_Label);
begin
-- Self.Target.is_Constrained;
Self.freshen;
return False;
end on_unconstrained_Label_clicked;
function on_constrained_Label_clicked (the_Label : access Gtk_Label_Record'Class;
Self : in aIDE.Editor.of_subtype_Indication.view) return Boolean
is
pragma Unreferenced (the_Label);
begin
-- Self.Target.is_Constrained (Now => False);
Self.freshen;
return False;
end on_constrained_Label_clicked;
package Label_return_Callbacks is new Gtk.Handlers.User_Return_Callback (Gtk_Label_Record,
Boolean,
aIDE.Editor.of_subtype_Indication.view);
package body Forge
is
function to_Editor (the_Target : in AdaM.subtype_Indication.view;
is_in_unconstrained_Array : in Boolean) return View
is
use AdaM,
Glib;
Self : constant Editor.of_subtype_Indication.view := new Editor.of_subtype_Indication.item;
the_Builder : Gtk_Builder;
Error : aliased GError;
Result : Guint;
pragma Unreferenced (Result);
begin
Self.Target := the_Target;
Self.is_in_unconstrained_Array := is_in_unconstrained_Array;
Gtk_New (the_Builder);
Result := the_Builder.Add_From_File ("glade/editor/subtype_indication_editor.glade", Error'Access);
if Error /= null then
raise Program_Error with "Error: adam.Editor.of_enumeration_type ~ " & Get_Message (Error);
end if;
Self.top_Box := gtk_Box (the_Builder.get_Object ("top_Box"));
Self.type_Button := Gtk_Button (the_Builder.get_Object ("index_type_Button"));
Self.range_Label := Gtk_Label (the_Builder.get_Object ("range_Label"));
Self.unconstrained_Label := Gtk_Label (the_Builder.get_Object ("unconstrained_Label"));
Self. constrained_Label := Gtk_Label (the_Builder.get_Object ( "constrained_Label"));
Self.first_Entry := Gtk_Entry (the_Builder.get_Object ("first_Entry"));
Self. last_Entry := Gtk_Entry (the_Builder.get_Object ( "last_Entry"));
-- Self.rid_Button := gtk_Button (the_Builder.get_Object ("rid_Button"));
Self.first_Entry.set_Text (Self.Target.First);
Entry_return_Callbacks.connect (Self.first_Entry,
"focus-out-event",
on_first_Entry_leave'Access,
the_Target);
Self.last_Entry.set_Text (Self.Target.Last);
Entry_return_Callbacks.connect (Self.last_Entry,
"focus-out-event",
on_last_Entry_leave'Access,
the_Target);
Self.type_Button.set_Label (+Self.Target.main_Type.Name);
button_Callbacks.connect (Self.type_Button,
"clicked",
on_index_type_Button_clicked'Access,
Self);
-- Button_Callbacks.Connect (Self.rid_Button,
-- "clicked",
-- on_rid_Button_clicked'Access,
-- Self);
Label_return_Callbacks.Connect (Self.unconstrained_Label,
"button-release-event",
on_unconstrained_Label_clicked'Access,
Self);
Label_return_Callbacks.Connect (Self.constrained_Label,
"button-release-event",
on_constrained_Label_clicked'Access,
Self);
Self.freshen;
return Self;
end to_Editor;
end Forge;
procedure destroy_Callback (Widget : not null access Gtk.Widget.Gtk_Widget_Record'Class)
is
begin
Widget.destroy;
end destroy_Callback;
overriding
procedure freshen (Self : in out Item)
is
use gtk.Widget;
-- the_Literals : AdaM.a_Type.enumeration_literal.vector renames Self.Target.Literals;
-- literal_Editor : aIDE.Editor.of_enumeration_literal.view;
begin
-- if Self.is_in_unconstrained_Array
-- then
-- Self.unconstrained_Label.show;
--
-- Self.first_Entry.hide;
-- Self.last_Entry.hide;
-- Self.range_Label.show;
-- Self. constrained_Label.hide;
-- else
-- Self.unconstrained_Label.hide;
if Self.Target.is_Constrained
then
if Self.Target.First = ""
then
Self.range_Label.hide;
Self. constrained_Label.hide;
Self.unconstrained_Label.hide;
Self.first_Entry.hide;
Self.last_Entry.hide;
else
Self.range_Label.show;
Self. constrained_Label.show;
Self.unconstrained_Label.hide;
Self.first_Entry.show;
Self.last_Entry.show;
end if;
else
Self.range_Label.show;
Self.first_Entry.hide;
Self.last_Entry.hide;
Self. constrained_Label.hide;
Self.unconstrained_Label.show;
end if;
-- end if;
-- if Self.is_in_unconstrained_Array
-- then
-- Self.unconstrained_Label.show;
--
-- Self.first_Entry.hide;
-- Self.last_Entry.hide;
-- Self.range_Label.show;
-- Self. constrained_Label.hide;
-- else
-- Self.unconstrained_Label.hide;
--
-- if Self.Target.is_Constrained
-- then
-- Self.range_Label.show;
-- Self. constrained_Label.show;
-- Self.first_Entry.show;
-- Self.last_Entry.show;
-- else
-- Self.range_Label.hide;
-- Self.first_Entry.hide;
-- Self.last_Entry.hide;
-- Self. constrained_Label.hide;
-- Self.unconstrained_Label.hide;
-- end if;
-- end if;
-- Self.first_Entry.set_Text (Self.Target.First);
-- Self.last_Entry .set_Text (Self.Target.Last);
-- Self.literals_Box.Foreach (destroy_Callback'Access);
-- for Each of the_Literals
-- loop
-- literal_Editor := Editor.of_enumeration_literal.Forge.to_Editor (Each,
-- targets_Parent => Self.Target.all'Access);
-- Self.literals_Box.pack_Start (literal_Editor.top_Widget);
-- end loop;
end freshen;
overriding
function top_Widget (Self : in Item) return gtk.Widget.Gtk_Widget
is
begin
return gtk.Widget.Gtk_Widget (Self.top_Box);
end top_Widget;
end aIDE.Editor.of_subtype_indication;
|
------------------------------------------------------------------------------
-- G E L A A S I S --
-- ASIS implementation for Gela project, a portable Ada compiler --
-- http://gela.ada-ru.org --
-- - - - - - - - - - - - - - - - --
-- Read copyright and license at the end of this file --
------------------------------------------------------------------------------
-- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $
with Ada.Text_IO;
with Text_Streams.File;
with XML_IO.Stream_Readers;
procedure Test_XML_IO is
use XML_IO;
package R renames XML_IO.Stream_Readers;
Stream : aliased Text_Streams.File.File_Text_Stream;
Parser : R.Reader (Stream'Access, 32);-- R.Default_Buffer_Size);
begin
Text_Streams.File.Open (Stream, "aaa.xml");
R.Initialize (Parser);
while R.More_Pieces (Parser) loop
Ada.Text_IO.Put_Line
("Kind: " & Piece_Kinds'Image (R.Piece_Kind (Parser)));
case R.Piece_Kind (Parser) is
when Start_Document =>
Ada.Text_IO.Put_Line
(" Encoding: " & R.Encoding (Parser));
Ada.Text_IO.Put_Line
(" Standalone: " & Boolean'Image (R.Standalone (Parser)));
when DTD | End_Document =>
null;
when Entity_Reference =>
Ada.Text_IO.Put_Line
(" Name: " & R.Name (Parser));
when Start_Element =>
Ada.Text_IO.Put_Line
(" Name: " & R.Name (Parser));
for I in 1 .. R.Attribute_Count (Parser) loop
Ada.Text_IO.Put_Line
(" Attr : " & R.Attribute_Name (Parser, I)
& " = " & R.Attribute_Value (Parser, I));
end loop;
when End_Element =>
Ada.Text_IO.Put_Line
(" Name: " & R.Name (Parser));
when Comment
| Characters
| CDATA_Section
=>
Ada.Text_IO.Put_Line
(" Text: " & R.Text (Parser));
when Processing_Instruction =>
Ada.Text_IO.Put_Line
(" Name: " & R.Name (Parser));
Ada.Text_IO.Put_Line
(" Text: " & R.Text (Parser));
when Attribute | Namespace =>
null;
end case;
R.Next (Parser);
end loop;
end Test_XML_IO;
------------------------------------------------------------------------------
-- 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.
------------------------------------------------------------------------------
|
pragma Warnings (Off);
pragma Style_Checks (Off);
with GLOBE_3D.Textures,
GLOBE_3D.Math;
with glut.Windows; use glut.Windows;
with GL.Errors;
with GLU;
with ada.Text_IO; use ada.Text_IO;
package body GLOBE_3D.Impostor is
package G3DT renames GLOBE_3D.Textures;
package G3DM renames GLOBE_3D.Math;
procedure destroy (o : in out Impostor)
is
use GL.Geometry, GL.Skins;
begin
free (o.skinned_Geometry.Geometry);
free (o.skinned_Geometry.Skin);
free (o.skinned_Geometry.Veneer);
end;
procedure free (o : in out p_Impostor)
is
procedure deallocate is new ada.unchecked_Deallocation (Impostor'Class, p_Impostor);
begin
if o /= null then
destroy (o.all);
end if;
deallocate (o);
end;
function get_Target (O : in Impostor) return p_Visual
is
begin
return o.Target;
end;
procedure set_Target (o : in out Impostor; Target : in p_Visual)
is
use GL, GL.Skins, GL.Geometry;
begin
o.Target := Target;
o.is_Terrain := Target.is_Terrain;
Target.pre_Calculate;
-- set o.skinned_Geometry.geometry.vertices & indices
--
declare
Width : GL.Double := Target.bounds.sphere_Radius * 1.00;
begin
o.Quads.Vertices (1) := ( - Width, - Width, 0.0);
o.Quads.Vertices (2) := (Width, - Width, 0.0);
o.Quads.Vertices (3) := (Width, Width, 0.0);
o.Quads.Vertices (4) := ( - Width, Width, 0.0);
end;
o.Quads.all.set_vertex_Id (1, 1, 1); -- tbd : the '.all' required for gnat gpl06 . .. not required in gpl07.
o.Quads.all.set_vertex_Id (1, 2, 2);
o.Quads.all.set_vertex_Id (1, 3, 3);
o.Quads.all.set_vertex_Id (1, 4, 4);
-- create the veneer, if necessary
--
if o.skinned_Geometry.Veneer = null then
--o.skinned_Geometry.Veneer := o.skinned_Geometry.Skin.new_Veneer (o.Quads.all);
o.skinned_Geometry.Veneer := o.skinned_Geometry.Skin.new_Veneer (o.skinned_geometry.Geometry.all);
end if;
--o.bounding_sphere_Radius := bounding_sphere_Radius (o.Quads.vertex_Pool.all);
--o.Bounds := o.skinned_Geometry.Geometry.Bounds;
end;
-- update trigger configuration
--
procedure set_freshen_count_update_trigger_Mod (o : in out Impostor; To : in Positive)
is
begin
o.freshen_count_update_trigger_Mod := Counter (To);
end;
function get_freshen_count_update_trigger_Mod (o : in Impostor) return Positive
is
begin
return Positive (o.freshen_count_update_trigger_Mod);
end;
procedure set_size_update_trigger_Delta (o : in out Impostor; To : in Positive)
is
begin
o.size_update_trigger_Delta := GL.SizeI (To);
end;
function get_size_update_trigger_Delta (o : in Impostor) return Positive
is
begin
return Positive (o.size_update_trigger_Delta);
end;
function general_Update_required (o : access Impostor; the_Camera : in p_Camera;
the_pixel_Region : in pixel_Region) return Boolean
is
use GL, Globe_3D.Math;
Camera_has_moved : Boolean := the_Camera.clipper.eye_Position /= o.prior_camera_Position;
Target_has_moved : Boolean := o.Target.Centre /= o.prior_target_Position;
begin
o.freshen_Count := o.freshen_Count + 1;
if o.freshen_Count > o.freshen_count_update_trigger_Mod then
return True;
end if;
if Camera_has_moved
and then abs (Angle (the_Camera.clipper.eye_Position, o.prior_target_Position, o.prior_camera_Position)) > to_Radians (degrees => 15.0)
then
return True;
end if;
if Target_has_moved
and then abs (Angle (o.target.Centre, o.prior_camera_Position, o.prior_target_Position)) > to_Radians (degrees => 15.0)
then
return True;
end if;
if o.prior_pixel_Region.Width > 40 -- ignore target rotation triggered updates when target is small on screen
and then o.prior_pixel_Region.Height > 40 --
and then o.prior_target_Rotation /= o.target.Rotation
then
return True;
end if;
return False;
end;
function size_Update_required (o : access Impostor; the_pixel_Region : in pixel_Region) return Boolean
is
use GL;
begin
return abs (the_pixel_Region.Width - o.prior_Width_Pixels) > o.size_update_trigger_Delta
or else abs (the_pixel_Region.Height - o.prior_Height_pixels) > o.size_update_trigger_Delta;
end;
function get_pixel_Region (o : access Impostor'Class; the_Camera : in globe_3d.p_Camera) return pixel_Region
is
use GL, globe_3d.Math;
target_Centre : Vector_3d := the_Camera.world_Rotation * (o.Target.Centre - the_Camera.clipper.eye_Position);
target_lower_Left : Vector_3d := target_Centre - (o.Target.bounds.sphere_Radius, o.Target.bounds.sphere_Radius, 0.0);
target_Centre_proj : Vector_4d := the_Camera.Projection_Matrix * target_Centre;
target_Lower_Left_proj : Vector_4d := the_Camera.Projection_Matrix * target_lower_Left;
target_Centre_norm : Vector_3d := (target_Centre_proj (0) / target_Centre_proj (3),
target_Centre_proj (1) / target_Centre_proj (3),
target_Centre_proj (2) / target_Centre_proj (3));
target_Lower_Left_norm : Vector_3d := (target_Lower_Left_proj (0) / target_Lower_Left_proj (3),
target_Lower_Left_proj (1) / target_Lower_Left_proj (3),
target_Lower_Left_proj (2) / target_Lower_Left_proj (3));
target_Centre_norm_0to1 : Vector_3d := (target_Centre_norm (0) * 0.5 + 0.5,
target_Centre_norm (1) * 0.5 + 0.5,
target_Centre_norm (2) * 0.5 + 0.5);
target_Lower_Left_norm_0to1 : Vector_3d := (target_Lower_Left_norm (0) * 0.5 + 0.5,
target_Lower_Left_norm (1) * 0.5 + 0.5,
target_Lower_Left_norm (2) * 0.5 + 0.5);
viewport_Width : Integer := the_Camera.clipper.main_Clipping.x2 - the_Camera.clipper.main_Clipping.x1 + 1;
viewport_Height : Integer := the_Camera.clipper.main_Clipping.y2 - the_Camera.clipper.main_Clipping.y1 + 1;
Width : Real := 2.0 * Real (viewport_Width) * (target_Centre_norm_0to1 (0) - target_Lower_Left_norm_0to1 (0));
Width_pixels : GL.Sizei := GL.Sizei (Integer (Real (viewport_Width) * target_Lower_Left_norm_0to1 (0) + Width)
- Integer (Real (viewport_Width) * target_Lower_Left_norm_0to1 (0))
+ 1);
Height : Real := 2.0 * Real (viewport_Height) * (target_Centre_norm_0to1 (1) - target_Lower_Left_norm_0to1 (1));
Height_pixels : GL.Sizei := GL.Sizei (Integer (Real (viewport_Height) * target_Lower_Left_norm_0to1 (1) + Height)
- Integer (Real (viewport_Height) * target_Lower_Left_norm_0to1 (1))
+ 1);
begin
o.all.target_camera_Distance := Norm (target_Centre); -- nb : cache distance from camera to target.
return (x => GL.Int (target_Lower_Left_norm_0to1 (0) * Real (Viewport_Width)),
y => GL.Int (target_Lower_Left_norm_0to1 (1) * Real (viewport_Height)),
width => Width_pixels,
height => Height_pixels);
end;
procedure update (o : in out Impostor;
the_Camera : in p_Camera;
texture_Pool : in GL.textures.p_Pool)
is
use GL, GL.Textures;
Width_size : GL.textures.Size := to_Size (Natural (o.current_Width_pixels));
Height_size : GL.textures.Size := to_Size (Natural (o.current_Height_pixels));
texture_Width : GL.sizei := GL.sizei (power_of_2_Ceiling (Natural (o.current_Width_pixels)));
texture_Height : GL.sizei := GL.sizei (power_of_2_Ceiling (Natural (o.current_Height_pixels)));
GL_Error : Boolean;
begin
o.prior_pixel_Region := (o.current_copy_X, o.current_copy_Y, o.current_Width_pixels, o.current_Height_pixels);
o.prior_Width_pixels := o.current_Width_pixels;
o.prior_Height_pixels := o.current_Height_pixels;
o.prior_target_Rotation := o.target.Rotation;
o.prior_target_Position := o.target.Centre;
o.prior_camera_Position := the_Camera.clipper.Eye_Position;
GL.ClearColor (0.0, 0.0, 0.0, 0.0);
render ((1 => o.Target), the_Camera.all); -- render the target for subsequent copy to impostor texture.
declare -- set texture coordinates for the veneer.
use GL.Skins;
the_Veneer : p_Veneer_transparent_unlit_textured := p_Veneer_transparent_unlit_textured (o.skinned_Geometry.Veneer);
X_first : Real := o.expand_X;
Y_first : Real := o.expand_Y;
X_last : Real := Real (o.current_Width_pixels) / Real (texture_Width) - X_First;
Y_last : Real := Real (o.current_Height_pixels) / Real (texture_Height) - Y_First;
begin
the_Veneer.texture_Coordinates := (1 => (s => X_first, t => Y_first),
2 => (s => X_last, t => Y_first),
3 => (s => X_last, t => Y_last),
4 => (s => X_first, t => Y_last));
end;
if Width_size /= GL.textures.Size_width (o.skin.Texture)
or else Height_size /= GL.textures.Size_height (o.skin.Texture)
then
free (texture_Pool.all, o.skin.Texture);
o.skin.all.Texture := new_Texture (texture_Pool, Natural (texture_Width), Natural (texture_Height));
end if;
enable (o.skin.all.Texture);
GL.CopyTexSubImage2D (gl.TEXTURE_2D, 0,
o.current_copy_x_Offset, o.current_copy_y_Offset,
o.current_copy_X, o.current_copy_Y,
o.current_copy_Width, o.current_copy_Height);
GL.Errors.log (error_occurred => gl_Error);
if gl_Error then
put_Line ("x_Offset : " & GL.Int'image (o.current_copy_x_Offset) & " ********");
put_Line ("y_Offset : " & GL.Int'image (o.current_copy_y_Offset));
put_Line ("start x : " & GL.Int'image (o.current_copy_X));
put_Line ("start y : " & GL.Int'image (o.current_copy_Y));
put_Line ("copy width : " & GL.sizei'image (o.current_copy_Width));
put_Line ("copy height : " & GL.sizei'image (o.current_copy_Height));
put_Line ("width_pixels : " & GL.sizei'image (o.current_Width_pixels));
put_Line ("height_pixels : " & GL.sizei'image (o.current_Height_pixels));
put_Line ("width_size : " & GL.textures.size'image (Width_size));
put_Line ("height_size : " & GL.textures.size'image (Height_size));
put_Line ("texture width : " & GL.sizei'image (texture_Width));
put_Line ("texutre height : " & GL.sizei'image (texture_Height));
end if;
o.never_Updated := False;
o.freshen_Count := 0;
end;
procedure freshen (o : in out Impostor'Class; the_Camera : in globe_3d.p_Camera;
texture_Pool : in GL.Textures.p_Pool;
is_Valid : out Boolean)
is
update_Required : Boolean := o.Update_required (the_Camera); -- nb : caches current update info
begin
if update_Required then
o.update (the_Camera, texture_Pool);
end if;
is_Valid := o.is_Valid;
end;
function target_camera_Distance (o : in Impostor'Class) return Real
is
begin
return o.target_camera_Distance;
end;
function is_Valid (o : in Impostor'Class) return Boolean
is
begin
return o.is_Valid;
end;
function never_Updated (o : in Impostor'Class) return Boolean
is
begin
return o.never_Updated;
end;
function frame_Count_since_last_update (o : in Impostor'Class) return Natural
is
begin
return Natural (o.freshen_Count);
end;
function skinned_Geometrys (o : in Impostor) return GL.skinned_geometry.skinned_Geometrys
is
begin
return (1 => o.skinned_Geometry);
end;
function face_Count (o : in Impostor) return Natural
is
begin
return 1;
end;
procedure Display (o : in out Impostor; clip : in Clipping_data)
is
begin
null; -- actual display is done by the renderer (ie glut.Windows), which requests all skinned Geometry's
-- and then applies 'gl state' sorting for performance, before drawing.
end Display;
procedure set_Alpha (o : in out Impostor; Alpha : in GL.Double)
is
begin
null; -- tbd
end;
function Bounds (o : in Impostor) return GL.geometry.Bounds_record
is
begin
return o.skinned_geometry.Geometry.Bounds;
end;
function is_Transparent (o : in Impostor) return Boolean
is
begin
return True; -- tbd : - if using gl alpha test, depth sorting is not needed apparently.
-- in which case this could be set to False, and treated as a non - transparent in g3d.render.
-- may then be faster (?).
-- - seems to make little difference . .. test with different vid card.
end;
function Skin (o : access Impostor) return GL.skins.p_Skin_transparent_unlit_textured
is
begin
return GL.skins.p_Skin_transparent_unlit_textured (o.skinned_geometry.skin);
end;
function Quads (o : in Impostor) return GL.geometry.primitives.p_Quads
is
use GL.Geometry.Primitives, GL.geometry.primal;
begin
return p_Quads (p_primal_Geometry (o.skinned_geometry.Geometry).Primitive);
end;
-- note : only old, unused code folows (may be useful) . ..
--
-- tbd : enable_rotation is no good for impostors, since they must be aligned with the viewport
-- it might be useful for general billboards however !
--
procedure enable_Rotation (o : in Impostor; camera_Site : in Vector_3D)
is
use globe_3d.Math, globe_3d.REF, GL;
lookAt : Vector_3D := (0.0, 0.0, 1.0);
objToCamProj : Vector_3D := Normalized ((camera_Site (0) - o.Centre (0), 0.0, camera_Site (2) - o.Centre (2)));
upAux : Vector_3D := lookAt * objToCamProj;
angleCosine : GL.Double := lookAt * objToCamProj;
begin
if angleCosine > - 0.9999
and angleCosine < 0.9999
then
GL.Rotate (arcCos (angleCosine) * 180.0 / 3.14, upAux (0), upAux (1), upAux (2));
end if;
declare
objToCam : Vector_3D := Normalized ((camera_Site (0) - o.Centre (0),
camera_Site (1) - o.Centre (1),
camera_Site (2) - o.Centre (2)));
begin
angleCosine := objToCamProj * objToCam;
if angleCosine > - 0.9999
and angleCosine < 0.9999
then
if objToCam (1) < 0.0 then
GL.Rotate (arcCos (angleCosine) * 180.0 / 3.14, 1.0, 0.0, 0.0);
else
GL.Rotate (arcCos (angleCosine) * 180.0 / 3.14, - 1.0, 0.0, 0.0);
end if;
end if;
end;
end;
--
-- based on lighthouse3d billboard example.
end GLOBE_3D.Impostor;
|
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="14">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName/>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>normalizeHisto0</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>sum</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>sum</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>2</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>descriptor_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>descriptor.V</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>72</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>normalized_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>normalized.V</originalName>
<rtlName/>
<coreName>RAM_2P_BRAM</coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>72</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>111</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>5</id>
<name/>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>77</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second class_id="11" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="12" tracking_level="0" version="0">
<first class_id="13" tracking_level="0" version="0">
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>77</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>145</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name>indvar_flatten</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>147</item>
<item>148</item>
<item>149</item>
<item>150</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>blkIdx</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>152</item>
<item>153</item>
<item>154</item>
<item>155</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>i</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>157</item>
<item>158</item>
<item>159</item>
<item>160</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>exitcond_flatten</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>exitcond_flatten_fu_243_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>161</item>
<item>163</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>indvar_flatten_next</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>indvar_flatten_next_fu_249_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>164</item>
<item>166</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>167</item>
<item>168</item>
<item>169</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>tmp_34</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_34_fu_255_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>335</item>
<item>337</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>i_mid2</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>i_mid2_fu_261_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>338</item>
<item>339</item>
<item>340</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>blkIdx_s</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>77</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>77</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>blkIdx_s_fu_269_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>342</item>
<item>343</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>tmp_mid2_v</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_mid2_v_fu_275_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>344</item>
<item>345</item>
<item>346</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>tmp_mid2</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_mid2_fu_293_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>347</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>tmp</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_fu_283_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>348</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>p_shl_cast_mid2_v</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_shl_cast_mid2_v_fu_323_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>350</item>
<item>351</item>
<item>353</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>p_shl_cast_mid2</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_shl_cast_mid2_fu_330_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>354</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>p_shl4_cast_mid2_v</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_shl4_cast_mid2_v_fu_307_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>356</item>
<item>357</item>
<item>358</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>p_shl4_cast_mid2</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_shl4_cast_mid2_fu_314_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>359</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>sum_addr</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>360</item>
<item>361</item>
<item>362</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>sum_load</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>363</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>zext_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>grp_fu_301_p10</rtlName>
<coreName/>
</Obj>
<bitwidth>65</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>364</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>mul</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>hog_mul_34ns_32nsjbC_U45</rtlName>
<coreName/>
</Obj>
<bitwidth>65</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>366</item>
<item>367</item>
</oprand_edges>
<opcode>mul</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>tmp_35</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_35_reg_650</rtlName>
<coreName/>
</Obj>
<bitwidth>27</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>369</item>
<item>370</item>
<item>372</item>
<item>373</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>average_cast8</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>average_cast8_fu_358_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>31</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>374</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>average_cast7</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>average_cast7_fu_361_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>30</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>375</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>average_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>average_cast_fu_364_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>28</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>376</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>tmp1</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp1_fu_318_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>377</item>
<item>378</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>tmp1_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp1_cast_fu_344_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>379</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>tmp_20</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_20_fu_347_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>380</item>
<item>381</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>tmp_21</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_21_fu_353_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>382</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>op2_assign</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>op2</originalName>
<rtlName>op2_assign_fu_367_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>28</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>384</item>
<item>385</item>
<item>387</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>op2_assign_cast6</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>op2_assign_cast6_fu_374_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>31</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>388</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>op2_assign_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>op2_assign_cast_fu_378_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>29</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>389</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>descriptor_V_addr</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>390</item>
<item>391</item>
<item>392</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>descriptor_V_load</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>15</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>393</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>tmp_22_cast5</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_22_cast5_fu_382_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>26</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>394</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>tmp_22_cast4</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_22_cast4_fu_386_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>27</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>395</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>tmp_22_cast3</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_22_cast3_fu_390_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>28</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>396</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>tmp_22_cast2</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_22_cast2_fu_394_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>31</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>397</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>tmp_22_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_22_cast_fu_398_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>29</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>398</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name>tmp_22</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_22_fu_402_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>399</item>
<item>400</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name/>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>401</item>
<item>402</item>
<item>403</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>p_shl5</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>86</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>86</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_shl5_fu_408_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>30</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>179</item>
<item>180</item>
<item>182</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>p_shl5_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>86</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>86</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_shl5_cast_fu_415_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>31</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>183</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name>tmp_23</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>86</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>86</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_23_fu_419_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>31</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>184</item>
<item>185</item>
</oprand_edges>
<opcode>sub</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>tmp_s</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>86</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>86</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_s_fu_425_p4</rtlName>
<coreName/>
</Obj>
<bitwidth>29</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>187</item>
<item>188</item>
<item>190</item>
<item>192</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name>tmp_36</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>86</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>86</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_36_fu_435_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>30</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>193</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>op2_assign_7_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>86</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>86</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>op2_assign_7_cast_fu_439_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>31</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>194</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name>tmp_24</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>86</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>86</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_24_fu_443_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>195</item>
<item>196</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>59</id>
<name/>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>86</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>86</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>197</item>
<item>198</item>
<item>199</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>61</id>
<name>tmp_25</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>89</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>89</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_25_fu_449_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>31</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>207</item>
<item>208</item>
</oprand_edges>
<opcode>sub</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>62</id>
<name>tmp_37</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>89</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>89</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_37_fu_455_p4</rtlName>
<coreName/>
</Obj>
<bitwidth>29</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>209</item>
<item>210</item>
<item>211</item>
<item>212</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>63</id>
<name>tmp_38</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>89</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>89</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_38_fu_465_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>30</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>213</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name>op2_assign_8_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>89</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>89</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>op2_assign_8_cast_fu_469_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>31</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>214</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>65</id>
<name>tmp_26</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>89</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>89</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_26_fu_473_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>215</item>
<item>216</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>66</id>
<name/>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>89</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>89</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>217</item>
<item>218</item>
<item>219</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>68</id>
<name>p_shl6</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_shl6_fu_479_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>29</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>228</item>
<item>229</item>
<item>230</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>69</id>
<name>p_shl6_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_shl6_cast_fu_486_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>30</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>231</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>70</id>
<name>tmp_27</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_27_fu_490_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>30</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>232</item>
<item>233</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_62">
<Value>
<Obj>
<type>0</type>
<id>71</id>
<name>tmp_39</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_39_fu_496_p4</rtlName>
<coreName/>
</Obj>
<bitwidth>28</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>235</item>
<item>236</item>
<item>237</item>
<item>239</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_63">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name>op2_assign_9_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>op2_assign_9_cast_fu_506_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>29</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>240</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_64">
<Value>
<Obj>
<type>0</type>
<id>73</id>
<name>tmp_28</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_28_fu_510_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>241</item>
<item>242</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_65">
<Value>
<Obj>
<type>0</type>
<id>74</id>
<name/>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>243</item>
<item>244</item>
<item>245</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_66">
<Value>
<Obj>
<type>0</type>
<id>76</id>
<name>tmp_29</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_29_fu_516_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>253</item>
<item>254</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_67">
<Value>
<Obj>
<type>0</type>
<id>77</id>
<name/>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>95</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>95</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>255</item>
<item>256</item>
<item>257</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_68">
<Value>
<Obj>
<type>0</type>
<id>79</id>
<name>tmp_30</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>98</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>98</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_30_fu_522_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>30</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>265</item>
<item>266</item>
</oprand_edges>
<opcode>sub</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_69">
<Value>
<Obj>
<type>0</type>
<id>80</id>
<name>tmp_40</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>98</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>98</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_40_fu_528_p4</rtlName>
<coreName/>
</Obj>
<bitwidth>28</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>267</item>
<item>268</item>
<item>269</item>
<item>270</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_70">
<Value>
<Obj>
<type>0</type>
<id>81</id>
<name>tmp_41</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>98</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>98</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_41_fu_538_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>30</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>271</item>
</oprand_edges>
<opcode>sext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_71">
<Value>
<Obj>
<type>0</type>
<id>82</id>
<name>op2_assign_10_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>98</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>98</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>op2_assign_10_cast_fu_542_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>31</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>272</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_72">
<Value>
<Obj>
<type>0</type>
<id>83</id>
<name>tmp_31</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>98</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>98</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_31_fu_546_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>273</item>
<item>274</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_73">
<Value>
<Obj>
<type>0</type>
<id>84</id>
<name/>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>98</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>98</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>275</item>
<item>276</item>
<item>277</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_74">
<Value>
<Obj>
<type>0</type>
<id>86</id>
<name>tmp_42</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>101</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>101</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_42_fu_552_p4</rtlName>
<coreName/>
</Obj>
<bitwidth>26</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>286</item>
<item>287</item>
<item>289</item>
<item>291</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_75">
<Value>
<Obj>
<type>0</type>
<id>87</id>
<name>op2_assign_11_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>101</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>101</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>op2_assign_11_cast_fu_561_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>27</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>292</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_76">
<Value>
<Obj>
<type>0</type>
<id>88</id>
<name>tmp_32</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>101</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>101</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_32_fu_565_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>293</item>
<item>294</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_77">
<Value>
<Obj>
<type>0</type>
<id>89</id>
<name/>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>101</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>101</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>295</item>
<item>296</item>
<item>297</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_78">
<Value>
<Obj>
<type>0</type>
<id>91</id>
<name>tmp_43</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>104</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>104</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_43_fu_571_p4</rtlName>
<coreName/>
</Obj>
<bitwidth>25</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>306</item>
<item>307</item>
<item>309</item>
<item>310</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_79">
<Value>
<Obj>
<type>0</type>
<id>92</id>
<name>op2_assign_12_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>104</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>104</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>op2_assign_12_cast_fu_580_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>26</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>311</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_80">
<Value>
<Obj>
<type>0</type>
<id>93</id>
<name>tmp_33</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>104</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>104</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_33_fu_584_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>312</item>
<item>313</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_81">
<Value>
<Obj>
<type>0</type>
<id>94</id>
<name>normalized_V_addr_13</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>105</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>105</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>314</item>
<item>315</item>
<item>316</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_82">
<Value>
<Obj>
<type>0</type>
<id>95</id>
<name>storemerge_cast_cast</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>105</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>105</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>storemerge_cast_cast_fu_590_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>317</item>
<item>319</item>
<item>321</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_83">
<Value>
<Obj>
<type>0</type>
<id>96</id>
<name/>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>105</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>105</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>322</item>
<item>323</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_84">
<Value>
<Obj>
<type>0</type>
<id>97</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>324</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_85">
<Value>
<Obj>
<type>0</type>
<id>99</id>
<name>normalized_V_addr_12</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>102</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>102</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>298</item>
<item>299</item>
<item>300</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_86">
<Value>
<Obj>
<type>0</type>
<id>100</id>
<name/>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>102</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>102</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>302</item>
<item>303</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_87">
<Value>
<Obj>
<type>0</type>
<id>101</id>
<name/>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>103</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>103</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>304</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_88">
<Value>
<Obj>
<type>0</type>
<id>103</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>325</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_89">
<Value>
<Obj>
<type>0</type>
<id>105</id>
<name>normalized_V_addr_11</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>99</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>99</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>278</item>
<item>279</item>
<item>280</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_90">
<Value>
<Obj>
<type>0</type>
<id>106</id>
<name/>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>99</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>99</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>282</item>
<item>283</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_91">
<Value>
<Obj>
<type>0</type>
<id>107</id>
<name/>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>100</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>100</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>284</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_92">
<Value>
<Obj>
<type>0</type>
<id>109</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>326</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_93">
<Value>
<Obj>
<type>0</type>
<id>111</id>
<name>normalized_V_addr_10</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>96</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>96</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>258</item>
<item>259</item>
<item>260</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_94">
<Value>
<Obj>
<type>0</type>
<id>112</id>
<name/>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>96</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>96</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>262</item>
<item>263</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_95">
<Value>
<Obj>
<type>0</type>
<id>113</id>
<name/>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>97</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>97</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>264</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_96">
<Value>
<Obj>
<type>0</type>
<id>115</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>327</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_97">
<Value>
<Obj>
<type>0</type>
<id>117</id>
<name>normalized_V_addr_9</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>93</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>93</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>246</item>
<item>247</item>
<item>248</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_98">
<Value>
<Obj>
<type>0</type>
<id>118</id>
<name/>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>93</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>93</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>250</item>
<item>251</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_99">
<Value>
<Obj>
<type>0</type>
<id>119</id>
<name/>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>252</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_100">
<Value>
<Obj>
<type>0</type>
<id>121</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>328</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_101">
<Value>
<Obj>
<type>0</type>
<id>123</id>
<name>normalized_V_addr_8</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>90</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>90</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>220</item>
<item>221</item>
<item>222</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_102">
<Value>
<Obj>
<type>0</type>
<id>124</id>
<name/>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>90</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>90</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>224</item>
<item>225</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_103">
<Value>
<Obj>
<type>0</type>
<id>125</id>
<name/>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>91</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>91</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>226</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_104">
<Value>
<Obj>
<type>0</type>
<id>127</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>329</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_105">
<Value>
<Obj>
<type>0</type>
<id>129</id>
<name>normalized_V_addr</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>200</item>
<item>201</item>
<item>202</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_106">
<Value>
<Obj>
<type>0</type>
<id>130</id>
<name/>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>204</item>
<item>205</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_107">
<Value>
<Obj>
<type>0</type>
<id>131</id>
<name/>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>88</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>88</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>206</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_108">
<Value>
<Obj>
<type>0</type>
<id>133</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>330</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_109">
<Value>
<Obj>
<type>0</type>
<id>135</id>
<name>normalized_V_addr25</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>170</item>
<item>172</item>
<item>173</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_110">
<Value>
<Obj>
<type>0</type>
<id>136</id>
<name/>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>84</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>84</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>175</item>
<item>176</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_111">
<Value>
<Obj>
<type>0</type>
<id>137</id>
<name/>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>85</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>85</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>177</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_112">
<Value>
<Obj>
<type>0</type>
<id>140</id>
<name>i_2</name>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName>i_2_fu_287_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>331</item>
<item>333</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_113">
<Value>
<Obj>
<type>0</type>
<id>141</id>
<name/>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>334</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_114">
<Value>
<Obj>
<type>0</type>
<id>143</id>
<name/>
<fileName>src/c/hog.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>112</lineNumber>
<contextFuncName>normalizeHisto0</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/nick/Documents/student_xohw18-222_Nikolaos_Bellas_20180630_1</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>src/c/hog.cpp</first>
<second>normalizeHisto0</second>
</first>
<second>112</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>
<m_Display>0</m_Display>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>29</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_115">
<Value>
<Obj>
<type>2</type>
<id>146</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_116">
<Value>
<Obj>
<type>2</type>
<id>151</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_117">
<Value>
<Obj>
<type>2</type>
<id>156</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="_118">
<Value>
<Obj>
<type>2</type>
<id>162</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<const_type>0</const_type>
<content>72</content>
</item>
<item class_id_reference="16" object_id="_119">
<Value>
<Obj>
<type>2</type>
<id>165</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_120">
<Value>
<Obj>
<type>2</type>
<id>171</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>
<item class_id_reference="16" object_id="_121">
<Value>
<Obj>
<type>2</type>
<id>174</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<const_type>0</const_type>
<content>409</content>
</item>
<item class_id_reference="16" object_id="_122">
<Value>
<Obj>
<type>2</type>
<id>181</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_123">
<Value>
<Obj>
<type>2</type>
<id>189</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>2</content>
</item>
<item class_id_reference="16" object_id="_124">
<Value>
<Obj>
<type>2</type>
<id>191</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>30</content>
</item>
<item class_id_reference="16" object_id="_125">
<Value>
<Obj>
<type>2</type>
<id>203</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>10</bitwidth>
</Value>
<const_type>0</const_type>
<content>358</content>
</item>
<item class_id_reference="16" object_id="_126">
<Value>
<Obj>
<type>2</type>
<id>223</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>10</bitwidth>
</Value>
<const_type>0</const_type>
<content>307</content>
</item>
<item class_id_reference="16" object_id="_127">
<Value>
<Obj>
<type>2</type>
<id>238</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>29</content>
</item>
<item class_id_reference="16" object_id="_128">
<Value>
<Obj>
<type>2</type>
<id>249</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>10</bitwidth>
</Value>
<const_type>0</const_type>
<content>256</content>
</item>
<item class_id_reference="16" object_id="_129">
<Value>
<Obj>
<type>2</type>
<id>261</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>10</bitwidth>
</Value>
<const_type>0</const_type>
<content>204</content>
</item>
<item class_id_reference="16" object_id="_130">
<Value>
<Obj>
<type>2</type>
<id>281</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>10</bitwidth>
</Value>
<const_type>0</const_type>
<content>153</content>
</item>
<item class_id_reference="16" object_id="_131">
<Value>
<Obj>
<type>2</type>
<id>288</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>39</content>
</item>
<item class_id_reference="16" object_id="_132">
<Value>
<Obj>
<type>2</type>
<id>290</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>64</content>
</item>
<item class_id_reference="16" object_id="_133">
<Value>
<Obj>
<type>2</type>
<id>301</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>10</bitwidth>
</Value>
<const_type>0</const_type>
<content>102</content>
</item>
<item class_id_reference="16" object_id="_134">
<Value>
<Obj>
<type>2</type>
<id>308</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>40</content>
</item>
<item class_id_reference="16" object_id="_135">
<Value>
<Obj>
<type>2</type>
<id>318</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>10</bitwidth>
</Value>
<const_type>0</const_type>
<content>51</content>
</item>
<item class_id_reference="16" object_id="_136">
<Value>
<Obj>
<type>2</type>
<id>320</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>10</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_137">
<Value>
<Obj>
<type>2</type>
<id>332</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="_138">
<Value>
<Obj>
<type>2</type>
<id>336</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>36</content>
</item>
<item class_id_reference="16" object_id="_139">
<Value>
<Obj>
<type>2</type>
<id>341</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_140">
<Value>
<Obj>
<type>2</type>
<id>352</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>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_141">
<Value>
<Obj>
<type>2</type>
<id>365</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>65</bitwidth>
</Value>
<const_type>0</const_type>
<content>7635497416</content>
</item>
<item class_id_reference="16" object_id="_142">
<Value>
<Obj>
<type>2</type>
<id>371</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>38</content>
</item>
<item class_id_reference="16" object_id="_143">
<Value>
<Obj>
<type>2</type>
<id>386</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>25</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_144">
<Obj>
<type>3</type>
<id>6</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>5</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_145">
<Obj>
<type>3</type>
<id>13</id>
<name>.preheader</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>6</count>
<item_version>0</item_version>
<item>7</item>
<item>8</item>
<item>9</item>
<item>10</item>
<item>11</item>
<item>12</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_146">
<Obj>
<type>3</type>
<id>51</id>
<name>.preheader.preheader</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>34</count>
<item_version>0</item_version>
<item>15</item>
<item>16</item>
<item>17</item>
<item>18</item>
<item>19</item>
<item>20</item>
<item>21</item>
<item>22</item>
<item>23</item>
<item>24</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>36</item>
<item>37</item>
<item>38</item>
<item>39</item>
<item>40</item>
<item>41</item>
<item>42</item>
<item>43</item>
<item>44</item>
<item>45</item>
<item>46</item>
<item>47</item>
<item>48</item>
<item>49</item>
<item>50</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_147">
<Obj>
<type>3</type>
<id>60</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>8</count>
<item_version>0</item_version>
<item>52</item>
<item>53</item>
<item>54</item>
<item>55</item>
<item>56</item>
<item>57</item>
<item>58</item>
<item>59</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_148">
<Obj>
<type>3</type>
<id>67</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>6</count>
<item_version>0</item_version>
<item>61</item>
<item>62</item>
<item>63</item>
<item>64</item>
<item>65</item>
<item>66</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_149">
<Obj>
<type>3</type>
<id>75</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>7</count>
<item_version>0</item_version>
<item>68</item>
<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="_150">
<Obj>
<type>3</type>
<id>78</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>76</item>
<item>77</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_151">
<Obj>
<type>3</type>
<id>85</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>6</count>
<item_version>0</item_version>
<item>79</item>
<item>80</item>
<item>81</item>
<item>82</item>
<item>83</item>
<item>84</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_152">
<Obj>
<type>3</type>
<id>90</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>86</item>
<item>87</item>
<item>88</item>
<item>89</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_153">
<Obj>
<type>3</type>
<id>98</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>7</count>
<item_version>0</item_version>
<item>91</item>
<item>92</item>
<item>93</item>
<item>94</item>
<item>95</item>
<item>96</item>
<item>97</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_154">
<Obj>
<type>3</type>
<id>102</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>99</item>
<item>100</item>
<item>101</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_155">
<Obj>
<type>3</type>
<id>104</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>103</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_156">
<Obj>
<type>3</type>
<id>108</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>105</item>
<item>106</item>
<item>107</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_157">
<Obj>
<type>3</type>
<id>110</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>109</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_158">
<Obj>
<type>3</type>
<id>114</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>111</item>
<item>112</item>
<item>113</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_159">
<Obj>
<type>3</type>
<id>116</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>115</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_160">
<Obj>
<type>3</type>
<id>120</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>117</item>
<item>118</item>
<item>119</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_161">
<Obj>
<type>3</type>
<id>122</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>121</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_162">
<Obj>
<type>3</type>
<id>126</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>123</item>
<item>124</item>
<item>125</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_163">
<Obj>
<type>3</type>
<id>128</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>127</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_164">
<Obj>
<type>3</type>
<id>132</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>129</item>
<item>130</item>
<item>131</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_165">
<Obj>
<type>3</type>
<id>134</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>133</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_166">
<Obj>
<type>3</type>
<id>138</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>135</item>
<item>136</item>
<item>137</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_167">
<Obj>
<type>3</type>
<id>142</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>140</item>
<item>141</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_168">
<Obj>
<type>3</type>
<id>144</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>143</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>240</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_169">
<id>145</id>
<edge_type>2</edge_type>
<source_obj>13</source_obj>
<sink_obj>5</sink_obj>
</item>
<item class_id_reference="20" object_id="_170">
<id>147</id>
<edge_type>1</edge_type>
<source_obj>146</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_171">
<id>148</id>
<edge_type>2</edge_type>
<source_obj>6</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_172">
<id>149</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_173">
<id>150</id>
<edge_type>2</edge_type>
<source_obj>142</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_174">
<id>152</id>
<edge_type>1</edge_type>
<source_obj>151</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_175">
<id>153</id>
<edge_type>2</edge_type>
<source_obj>6</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_176">
<id>154</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_177">
<id>155</id>
<edge_type>2</edge_type>
<source_obj>142</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_178">
<id>157</id>
<edge_type>1</edge_type>
<source_obj>156</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_179">
<id>158</id>
<edge_type>2</edge_type>
<source_obj>6</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_180">
<id>159</id>
<edge_type>1</edge_type>
<source_obj>140</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_181">
<id>160</id>
<edge_type>2</edge_type>
<source_obj>142</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_182">
<id>161</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_183">
<id>163</id>
<edge_type>1</edge_type>
<source_obj>162</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_184">
<id>164</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_185">
<id>166</id>
<edge_type>1</edge_type>
<source_obj>165</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_186">
<id>167</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_187">
<id>168</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_188">
<id>169</id>
<edge_type>2</edge_type>
<source_obj>144</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_189">
<id>170</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>135</sink_obj>
</item>
<item class_id_reference="20" object_id="_190">
<id>172</id>
<edge_type>1</edge_type>
<source_obj>171</source_obj>
<sink_obj>135</sink_obj>
</item>
<item class_id_reference="20" object_id="_191">
<id>173</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>135</sink_obj>
</item>
<item class_id_reference="20" object_id="_192">
<id>175</id>
<edge_type>1</edge_type>
<source_obj>174</source_obj>
<sink_obj>136</sink_obj>
</item>
<item class_id_reference="20" object_id="_193">
<id>176</id>
<edge_type>1</edge_type>
<source_obj>135</source_obj>
<sink_obj>136</sink_obj>
</item>
<item class_id_reference="20" object_id="_194">
<id>177</id>
<edge_type>2</edge_type>
<source_obj>142</source_obj>
<sink_obj>137</sink_obj>
</item>
<item class_id_reference="20" object_id="_195">
<id>180</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_196">
<id>182</id>
<edge_type>1</edge_type>
<source_obj>181</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_197">
<id>183</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_198">
<id>184</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_199">
<id>185</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_200">
<id>188</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_201">
<id>190</id>
<edge_type>1</edge_type>
<source_obj>189</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_202">
<id>192</id>
<edge_type>1</edge_type>
<source_obj>191</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_203">
<id>193</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_204">
<id>194</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>57</sink_obj>
</item>
<item class_id_reference="20" object_id="_205">
<id>195</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_206">
<id>196</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_207">
<id>197</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>59</sink_obj>
</item>
<item class_id_reference="20" object_id="_208">
<id>198</id>
<edge_type>2</edge_type>
<source_obj>67</source_obj>
<sink_obj>59</sink_obj>
</item>
<item class_id_reference="20" object_id="_209">
<id>199</id>
<edge_type>2</edge_type>
<source_obj>132</source_obj>
<sink_obj>59</sink_obj>
</item>
<item class_id_reference="20" object_id="_210">
<id>200</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>129</sink_obj>
</item>
<item class_id_reference="20" object_id="_211">
<id>201</id>
<edge_type>1</edge_type>
<source_obj>171</source_obj>
<sink_obj>129</sink_obj>
</item>
<item class_id_reference="20" object_id="_212">
<id>202</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>129</sink_obj>
</item>
<item class_id_reference="20" object_id="_213">
<id>204</id>
<edge_type>1</edge_type>
<source_obj>203</source_obj>
<sink_obj>130</sink_obj>
</item>
<item class_id_reference="20" object_id="_214">
<id>205</id>
<edge_type>1</edge_type>
<source_obj>129</source_obj>
<sink_obj>130</sink_obj>
</item>
<item class_id_reference="20" object_id="_215">
<id>206</id>
<edge_type>2</edge_type>
<source_obj>134</source_obj>
<sink_obj>131</sink_obj>
</item>
<item class_id_reference="20" object_id="_216">
<id>207</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>61</sink_obj>
</item>
<item class_id_reference="20" object_id="_217">
<id>208</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>61</sink_obj>
</item>
<item class_id_reference="20" object_id="_218">
<id>210</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>62</sink_obj>
</item>
<item class_id_reference="20" object_id="_219">
<id>211</id>
<edge_type>1</edge_type>
<source_obj>189</source_obj>
<sink_obj>62</sink_obj>
</item>
<item class_id_reference="20" object_id="_220">
<id>212</id>
<edge_type>1</edge_type>
<source_obj>191</source_obj>
<sink_obj>62</sink_obj>
</item>
<item class_id_reference="20" object_id="_221">
<id>213</id>
<edge_type>1</edge_type>
<source_obj>62</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_222">
<id>214</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_223">
<id>215</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_224">
<id>216</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_225">
<id>217</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>66</sink_obj>
</item>
<item class_id_reference="20" object_id="_226">
<id>218</id>
<edge_type>2</edge_type>
<source_obj>75</source_obj>
<sink_obj>66</sink_obj>
</item>
<item class_id_reference="20" object_id="_227">
<id>219</id>
<edge_type>2</edge_type>
<source_obj>126</source_obj>
<sink_obj>66</sink_obj>
</item>
<item class_id_reference="20" object_id="_228">
<id>220</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>123</sink_obj>
</item>
<item class_id_reference="20" object_id="_229">
<id>221</id>
<edge_type>1</edge_type>
<source_obj>171</source_obj>
<sink_obj>123</sink_obj>
</item>
<item class_id_reference="20" object_id="_230">
<id>222</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>123</sink_obj>
</item>
<item class_id_reference="20" object_id="_231">
<id>224</id>
<edge_type>1</edge_type>
<source_obj>223</source_obj>
<sink_obj>124</sink_obj>
</item>
<item class_id_reference="20" object_id="_232">
<id>225</id>
<edge_type>1</edge_type>
<source_obj>123</source_obj>
<sink_obj>124</sink_obj>
</item>
<item class_id_reference="20" object_id="_233">
<id>226</id>
<edge_type>2</edge_type>
<source_obj>128</source_obj>
<sink_obj>125</sink_obj>
</item>
<item class_id_reference="20" object_id="_234">
<id>229</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_235">
<id>230</id>
<edge_type>1</edge_type>
<source_obj>151</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_236">
<id>231</id>
<edge_type>1</edge_type>
<source_obj>68</source_obj>
<sink_obj>69</sink_obj>
</item>
<item class_id_reference="20" object_id="_237">
<id>232</id>
<edge_type>1</edge_type>
<source_obj>69</source_obj>
<sink_obj>70</sink_obj>
</item>
<item class_id_reference="20" object_id="_238">
<id>233</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>70</sink_obj>
</item>
<item class_id_reference="20" object_id="_239">
<id>236</id>
<edge_type>1</edge_type>
<source_obj>70</source_obj>
<sink_obj>71</sink_obj>
</item>
<item class_id_reference="20" object_id="_240">
<id>237</id>
<edge_type>1</edge_type>
<source_obj>189</source_obj>
<sink_obj>71</sink_obj>
</item>
<item class_id_reference="20" object_id="_241">
<id>239</id>
<edge_type>1</edge_type>
<source_obj>238</source_obj>
<sink_obj>71</sink_obj>
</item>
<item class_id_reference="20" object_id="_242">
<id>240</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>72</sink_obj>
</item>
<item class_id_reference="20" object_id="_243">
<id>241</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>73</sink_obj>
</item>
<item class_id_reference="20" object_id="_244">
<id>242</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>73</sink_obj>
</item>
<item class_id_reference="20" object_id="_245">
<id>243</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_246">
<id>244</id>
<edge_type>2</edge_type>
<source_obj>78</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_247">
<id>245</id>
<edge_type>2</edge_type>
<source_obj>120</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_248">
<id>246</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>117</sink_obj>
</item>
<item class_id_reference="20" object_id="_249">
<id>247</id>
<edge_type>1</edge_type>
<source_obj>171</source_obj>
<sink_obj>117</sink_obj>
</item>
<item class_id_reference="20" object_id="_250">
<id>248</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>117</sink_obj>
</item>
<item class_id_reference="20" object_id="_251">
<id>250</id>
<edge_type>1</edge_type>
<source_obj>249</source_obj>
<sink_obj>118</sink_obj>
</item>
<item class_id_reference="20" object_id="_252">
<id>251</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>118</sink_obj>
</item>
<item class_id_reference="20" object_id="_253">
<id>252</id>
<edge_type>2</edge_type>
<source_obj>122</source_obj>
<sink_obj>119</sink_obj>
</item>
<item class_id_reference="20" object_id="_254">
<id>253</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>76</sink_obj>
</item>
<item class_id_reference="20" object_id="_255">
<id>254</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>76</sink_obj>
</item>
<item class_id_reference="20" object_id="_256">
<id>255</id>
<edge_type>1</edge_type>
<source_obj>76</source_obj>
<sink_obj>77</sink_obj>
</item>
<item class_id_reference="20" object_id="_257">
<id>256</id>
<edge_type>2</edge_type>
<source_obj>85</source_obj>
<sink_obj>77</sink_obj>
</item>
<item class_id_reference="20" object_id="_258">
<id>257</id>
<edge_type>2</edge_type>
<source_obj>114</source_obj>
<sink_obj>77</sink_obj>
</item>
<item class_id_reference="20" object_id="_259">
<id>258</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>111</sink_obj>
</item>
<item class_id_reference="20" object_id="_260">
<id>259</id>
<edge_type>1</edge_type>
<source_obj>171</source_obj>
<sink_obj>111</sink_obj>
</item>
<item class_id_reference="20" object_id="_261">
<id>260</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>111</sink_obj>
</item>
<item class_id_reference="20" object_id="_262">
<id>262</id>
<edge_type>1</edge_type>
<source_obj>261</source_obj>
<sink_obj>112</sink_obj>
</item>
<item class_id_reference="20" object_id="_263">
<id>263</id>
<edge_type>1</edge_type>
<source_obj>111</source_obj>
<sink_obj>112</sink_obj>
</item>
<item class_id_reference="20" object_id="_264">
<id>264</id>
<edge_type>2</edge_type>
<source_obj>116</source_obj>
<sink_obj>113</sink_obj>
</item>
<item class_id_reference="20" object_id="_265">
<id>265</id>
<edge_type>1</edge_type>
<source_obj>69</source_obj>
<sink_obj>79</sink_obj>
</item>
<item class_id_reference="20" object_id="_266">
<id>266</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>79</sink_obj>
</item>
<item class_id_reference="20" object_id="_267">
<id>268</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>80</sink_obj>
</item>
<item class_id_reference="20" object_id="_268">
<id>269</id>
<edge_type>1</edge_type>
<source_obj>189</source_obj>
<sink_obj>80</sink_obj>
</item>
<item class_id_reference="20" object_id="_269">
<id>270</id>
<edge_type>1</edge_type>
<source_obj>238</source_obj>
<sink_obj>80</sink_obj>
</item>
<item class_id_reference="20" object_id="_270">
<id>271</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>81</sink_obj>
</item>
<item class_id_reference="20" object_id="_271">
<id>272</id>
<edge_type>1</edge_type>
<source_obj>81</source_obj>
<sink_obj>82</sink_obj>
</item>
<item class_id_reference="20" object_id="_272">
<id>273</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>83</sink_obj>
</item>
<item class_id_reference="20" object_id="_273">
<id>274</id>
<edge_type>1</edge_type>
<source_obj>82</source_obj>
<sink_obj>83</sink_obj>
</item>
<item class_id_reference="20" object_id="_274">
<id>275</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>84</sink_obj>
</item>
<item class_id_reference="20" object_id="_275">
<id>276</id>
<edge_type>2</edge_type>
<source_obj>90</source_obj>
<sink_obj>84</sink_obj>
</item>
<item class_id_reference="20" object_id="_276">
<id>277</id>
<edge_type>2</edge_type>
<source_obj>108</source_obj>
<sink_obj>84</sink_obj>
</item>
<item class_id_reference="20" object_id="_277">
<id>278</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>105</sink_obj>
</item>
<item class_id_reference="20" object_id="_278">
<id>279</id>
<edge_type>1</edge_type>
<source_obj>171</source_obj>
<sink_obj>105</sink_obj>
</item>
<item class_id_reference="20" object_id="_279">
<id>280</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>105</sink_obj>
</item>
<item class_id_reference="20" object_id="_280">
<id>282</id>
<edge_type>1</edge_type>
<source_obj>281</source_obj>
<sink_obj>106</sink_obj>
</item>
<item class_id_reference="20" object_id="_281">
<id>283</id>
<edge_type>1</edge_type>
<source_obj>105</source_obj>
<sink_obj>106</sink_obj>
</item>
<item class_id_reference="20" object_id="_282">
<id>284</id>
<edge_type>2</edge_type>
<source_obj>110</source_obj>
<sink_obj>107</sink_obj>
</item>
<item class_id_reference="20" object_id="_283">
<id>287</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>86</sink_obj>
</item>
<item class_id_reference="20" object_id="_284">
<id>289</id>
<edge_type>1</edge_type>
<source_obj>288</source_obj>
<sink_obj>86</sink_obj>
</item>
<item class_id_reference="20" object_id="_285">
<id>291</id>
<edge_type>1</edge_type>
<source_obj>290</source_obj>
<sink_obj>86</sink_obj>
</item>
<item class_id_reference="20" object_id="_286">
<id>292</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>87</sink_obj>
</item>
<item class_id_reference="20" object_id="_287">
<id>293</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>88</sink_obj>
</item>
<item class_id_reference="20" object_id="_288">
<id>294</id>
<edge_type>1</edge_type>
<source_obj>87</source_obj>
<sink_obj>88</sink_obj>
</item>
<item class_id_reference="20" object_id="_289">
<id>295</id>
<edge_type>1</edge_type>
<source_obj>88</source_obj>
<sink_obj>89</sink_obj>
</item>
<item class_id_reference="20" object_id="_290">
<id>296</id>
<edge_type>2</edge_type>
<source_obj>98</source_obj>
<sink_obj>89</sink_obj>
</item>
<item class_id_reference="20" object_id="_291">
<id>297</id>
<edge_type>2</edge_type>
<source_obj>102</source_obj>
<sink_obj>89</sink_obj>
</item>
<item class_id_reference="20" object_id="_292">
<id>298</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>99</sink_obj>
</item>
<item class_id_reference="20" object_id="_293">
<id>299</id>
<edge_type>1</edge_type>
<source_obj>171</source_obj>
<sink_obj>99</sink_obj>
</item>
<item class_id_reference="20" object_id="_294">
<id>300</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>99</sink_obj>
</item>
<item class_id_reference="20" object_id="_295">
<id>302</id>
<edge_type>1</edge_type>
<source_obj>301</source_obj>
<sink_obj>100</sink_obj>
</item>
<item class_id_reference="20" object_id="_296">
<id>303</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>100</sink_obj>
</item>
<item class_id_reference="20" object_id="_297">
<id>304</id>
<edge_type>2</edge_type>
<source_obj>104</source_obj>
<sink_obj>101</sink_obj>
</item>
<item class_id_reference="20" object_id="_298">
<id>307</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>91</sink_obj>
</item>
<item class_id_reference="20" object_id="_299">
<id>309</id>
<edge_type>1</edge_type>
<source_obj>308</source_obj>
<sink_obj>91</sink_obj>
</item>
<item class_id_reference="20" object_id="_300">
<id>310</id>
<edge_type>1</edge_type>
<source_obj>290</source_obj>
<sink_obj>91</sink_obj>
</item>
<item class_id_reference="20" object_id="_301">
<id>311</id>
<edge_type>1</edge_type>
<source_obj>91</source_obj>
<sink_obj>92</sink_obj>
</item>
<item class_id_reference="20" object_id="_302">
<id>312</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>93</sink_obj>
</item>
<item class_id_reference="20" object_id="_303">
<id>313</id>
<edge_type>1</edge_type>
<source_obj>92</source_obj>
<sink_obj>93</sink_obj>
</item>
<item class_id_reference="20" object_id="_304">
<id>314</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>94</sink_obj>
</item>
<item class_id_reference="20" object_id="_305">
<id>315</id>
<edge_type>1</edge_type>
<source_obj>171</source_obj>
<sink_obj>94</sink_obj>
</item>
<item class_id_reference="20" object_id="_306">
<id>316</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>94</sink_obj>
</item>
<item class_id_reference="20" object_id="_307">
<id>317</id>
<edge_type>1</edge_type>
<source_obj>93</source_obj>
<sink_obj>95</sink_obj>
</item>
<item class_id_reference="20" object_id="_308">
<id>319</id>
<edge_type>1</edge_type>
<source_obj>318</source_obj>
<sink_obj>95</sink_obj>
</item>
<item class_id_reference="20" object_id="_309">
<id>321</id>
<edge_type>1</edge_type>
<source_obj>320</source_obj>
<sink_obj>95</sink_obj>
</item>
<item class_id_reference="20" object_id="_310">
<id>322</id>
<edge_type>1</edge_type>
<source_obj>95</source_obj>
<sink_obj>96</sink_obj>
</item>
<item class_id_reference="20" object_id="_311">
<id>323</id>
<edge_type>1</edge_type>
<source_obj>94</source_obj>
<sink_obj>96</sink_obj>
</item>
<item class_id_reference="20" object_id="_312">
<id>324</id>
<edge_type>2</edge_type>
<source_obj>104</source_obj>
<sink_obj>97</sink_obj>
</item>
<item class_id_reference="20" object_id="_313">
<id>325</id>
<edge_type>2</edge_type>
<source_obj>110</source_obj>
<sink_obj>103</sink_obj>
</item>
<item class_id_reference="20" object_id="_314">
<id>326</id>
<edge_type>2</edge_type>
<source_obj>116</source_obj>
<sink_obj>109</sink_obj>
</item>
<item class_id_reference="20" object_id="_315">
<id>327</id>
<edge_type>2</edge_type>
<source_obj>122</source_obj>
<sink_obj>115</sink_obj>
</item>
<item class_id_reference="20" object_id="_316">
<id>328</id>
<edge_type>2</edge_type>
<source_obj>128</source_obj>
<sink_obj>121</sink_obj>
</item>
<item class_id_reference="20" object_id="_317">
<id>329</id>
<edge_type>2</edge_type>
<source_obj>134</source_obj>
<sink_obj>127</sink_obj>
</item>
<item class_id_reference="20" object_id="_318">
<id>330</id>
<edge_type>2</edge_type>
<source_obj>142</source_obj>
<sink_obj>133</sink_obj>
</item>
<item class_id_reference="20" object_id="_319">
<id>331</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>140</sink_obj>
</item>
<item class_id_reference="20" object_id="_320">
<id>333</id>
<edge_type>1</edge_type>
<source_obj>332</source_obj>
<sink_obj>140</sink_obj>
</item>
<item class_id_reference="20" object_id="_321">
<id>334</id>
<edge_type>2</edge_type>
<source_obj>13</source_obj>
<sink_obj>141</sink_obj>
</item>
<item class_id_reference="20" object_id="_322">
<id>335</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_323">
<id>337</id>
<edge_type>1</edge_type>
<source_obj>336</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_324">
<id>338</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_325">
<id>339</id>
<edge_type>1</edge_type>
<source_obj>156</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_326">
<id>340</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_327">
<id>342</id>
<edge_type>1</edge_type>
<source_obj>341</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_328">
<id>343</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_329">
<id>344</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_330">
<id>345</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_331">
<id>346</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_332">
<id>347</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_333">
<id>348</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_334">
<id>351</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_335">
<id>353</id>
<edge_type>1</edge_type>
<source_obj>352</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_336">
<id>354</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_337">
<id>357</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_338">
<id>358</id>
<edge_type>1</edge_type>
<source_obj>151</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_339">
<id>359</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_340">
<id>360</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_341">
<id>361</id>
<edge_type>1</edge_type>
<source_obj>171</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_342">
<id>362</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_343">
<id>363</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_344">
<id>364</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_345">
<id>366</id>
<edge_type>1</edge_type>
<source_obj>365</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_346">
<id>367</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_347">
<id>370</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_348">
<id>372</id>
<edge_type>1</edge_type>
<source_obj>371</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_349">
<id>373</id>
<edge_type>1</edge_type>
<source_obj>290</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_350">
<id>374</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_351">
<id>375</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_352">
<id>376</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_353">
<id>377</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_354">
<id>378</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_355">
<id>379</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_356">
<id>380</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_357">
<id>381</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_358">
<id>382</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_359">
<id>385</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_360">
<id>387</id>
<edge_type>1</edge_type>
<source_obj>386</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_361">
<id>388</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_362">
<id>389</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_363">
<id>390</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_364">
<id>391</id>
<edge_type>1</edge_type>
<source_obj>171</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_365">
<id>392</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_366">
<id>393</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_367">
<id>394</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_368">
<id>395</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_369">
<id>396</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_370">
<id>397</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_371">
<id>398</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_372">
<id>399</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_373">
<id>400</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_374">
<id>401</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_375">
<id>402</id>
<edge_type>2</edge_type>
<source_obj>60</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_376">
<id>403</id>
<edge_type>2</edge_type>
<source_obj>138</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_377">
<id>442</id>
<edge_type>2</edge_type>
<source_obj>6</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_378">
<id>443</id>
<edge_type>2</edge_type>
<source_obj>13</source_obj>
<sink_obj>144</sink_obj>
</item>
<item class_id_reference="20" object_id="_379">
<id>444</id>
<edge_type>2</edge_type>
<source_obj>13</source_obj>
<sink_obj>51</sink_obj>
</item>
<item class_id_reference="20" object_id="_380">
<id>445</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>138</sink_obj>
</item>
<item class_id_reference="20" object_id="_381">
<id>446</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_382">
<id>447</id>
<edge_type>2</edge_type>
<source_obj>60</source_obj>
<sink_obj>132</sink_obj>
</item>
<item class_id_reference="20" object_id="_383">
<id>448</id>
<edge_type>2</edge_type>
<source_obj>60</source_obj>
<sink_obj>67</sink_obj>
</item>
<item class_id_reference="20" object_id="_384">
<id>449</id>
<edge_type>2</edge_type>
<source_obj>67</source_obj>
<sink_obj>126</sink_obj>
</item>
<item class_id_reference="20" object_id="_385">
<id>450</id>
<edge_type>2</edge_type>
<source_obj>67</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_386">
<id>451</id>
<edge_type>2</edge_type>
<source_obj>75</source_obj>
<sink_obj>120</sink_obj>
</item>
<item class_id_reference="20" object_id="_387">
<id>452</id>
<edge_type>2</edge_type>
<source_obj>75</source_obj>
<sink_obj>78</sink_obj>
</item>
<item class_id_reference="20" object_id="_388">
<id>453</id>
<edge_type>2</edge_type>
<source_obj>78</source_obj>
<sink_obj>114</sink_obj>
</item>
<item class_id_reference="20" object_id="_389">
<id>454</id>
<edge_type>2</edge_type>
<source_obj>78</source_obj>
<sink_obj>85</sink_obj>
</item>
<item class_id_reference="20" object_id="_390">
<id>455</id>
<edge_type>2</edge_type>
<source_obj>85</source_obj>
<sink_obj>108</sink_obj>
</item>
<item class_id_reference="20" object_id="_391">
<id>456</id>
<edge_type>2</edge_type>
<source_obj>85</source_obj>
<sink_obj>90</sink_obj>
</item>
<item class_id_reference="20" object_id="_392">
<id>457</id>
<edge_type>2</edge_type>
<source_obj>90</source_obj>
<sink_obj>102</sink_obj>
</item>
<item class_id_reference="20" object_id="_393">
<id>458</id>
<edge_type>2</edge_type>
<source_obj>90</source_obj>
<sink_obj>98</sink_obj>
</item>
<item class_id_reference="20" object_id="_394">
<id>459</id>
<edge_type>2</edge_type>
<source_obj>98</source_obj>
<sink_obj>104</sink_obj>
</item>
<item class_id_reference="20" object_id="_395">
<id>460</id>
<edge_type>2</edge_type>
<source_obj>102</source_obj>
<sink_obj>104</sink_obj>
</item>
<item class_id_reference="20" object_id="_396">
<id>461</id>
<edge_type>2</edge_type>
<source_obj>104</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_397">
<id>462</id>
<edge_type>2</edge_type>
<source_obj>108</source_obj>
<sink_obj>110</sink_obj>
</item>
<item class_id_reference="20" object_id="_398">
<id>463</id>
<edge_type>2</edge_type>
<source_obj>110</source_obj>
<sink_obj>116</sink_obj>
</item>
<item class_id_reference="20" object_id="_399">
<id>464</id>
<edge_type>2</edge_type>
<source_obj>114</source_obj>
<sink_obj>116</sink_obj>
</item>
<item class_id_reference="20" object_id="_400">
<id>465</id>
<edge_type>2</edge_type>
<source_obj>116</source_obj>
<sink_obj>122</sink_obj>
</item>
<item class_id_reference="20" object_id="_401">
<id>466</id>
<edge_type>2</edge_type>
<source_obj>120</source_obj>
<sink_obj>122</sink_obj>
</item>
<item class_id_reference="20" object_id="_402">
<id>467</id>
<edge_type>2</edge_type>
<source_obj>122</source_obj>
<sink_obj>128</sink_obj>
</item>
<item class_id_reference="20" object_id="_403">
<id>468</id>
<edge_type>2</edge_type>
<source_obj>126</source_obj>
<sink_obj>128</sink_obj>
</item>
<item class_id_reference="20" object_id="_404">
<id>469</id>
<edge_type>2</edge_type>
<source_obj>128</source_obj>
<sink_obj>134</sink_obj>
</item>
<item class_id_reference="20" object_id="_405">
<id>470</id>
<edge_type>2</edge_type>
<source_obj>132</source_obj>
<sink_obj>134</sink_obj>
</item>
<item class_id_reference="20" object_id="_406">
<id>471</id>
<edge_type>2</edge_type>
<source_obj>134</source_obj>
<sink_obj>142</sink_obj>
</item>
<item class_id_reference="20" object_id="_407">
<id>472</id>
<edge_type>2</edge_type>
<source_obj>138</source_obj>
<sink_obj>142</sink_obj>
</item>
<item class_id_reference="20" object_id="_408">
<id>473</id>
<edge_type>2</edge_type>
<source_obj>142</source_obj>
<sink_obj>13</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_409">
<mId>1</mId>
<mTag>normalizeHisto0</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>83</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_410">
<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>6</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="_411">
<mId>3</mId>
<mTag>Loop 1</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>23</count>
<item_version>0</item_version>
<item>13</item>
<item>51</item>
<item>60</item>
<item>67</item>
<item>75</item>
<item>78</item>
<item>85</item>
<item>90</item>
<item>98</item>
<item>102</item>
<item>104</item>
<item>108</item>
<item>110</item>
<item>114</item>
<item>116</item>
<item>120</item>
<item>122</item>
<item>126</item>
<item>128</item>
<item>132</item>
<item>134</item>
<item>138</item>
<item>142</item>
</basic_blocks>
<mII>1</mII>
<mDepth>11</mDepth>
<mMinTripCount>72</mMinTripCount>
<mMaxTripCount>72</mMaxTripCount>
<mMinLatency>81</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_412">
<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>144</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="_413">
<states class_id="25" tracking_level="0" version="0">
<count>13</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_414">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_415">
<id>4</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_416">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_417">
<id>2</id>
<operations>
<count>12</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_418">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_419">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_420">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_421">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_422">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_423">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_424">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_425">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_426">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_427">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_428">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_429">
<id>140</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_430">
<id>3</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_431">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_432">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_433">
<id>28</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_434">
<id>4</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_435">
<id>28</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_436">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_437">
<id>30</id>
<stage>7</stage>
<latency>7</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_438">
<id>5</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_439">
<id>30</id>
<stage>6</stage>
<latency>7</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_440">
<id>6</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_441">
<id>30</id>
<stage>5</stage>
<latency>7</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_442">
<id>7</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_443">
<id>30</id>
<stage>4</stage>
<latency>7</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_444">
<id>8</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_445">
<id>30</id>
<stage>3</stage>
<latency>7</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_446">
<id>9</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_447">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_448">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_449">
<id>30</id>
<stage>2</stage>
<latency>7</latency>
</item>
<item class_id_reference="28" object_id="_450">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_451">
<id>10</id>
<operations>
<count>9</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_452">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_453">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_454">
<id>30</id>
<stage>1</stage>
<latency>7</latency>
</item>
<item class_id_reference="28" object_id="_455">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_456">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_457">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_458">
<id>38</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_459">
<id>42</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_460">
<id>43</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_461">
<id>11</id>
<operations>
<count>50</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_462">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_463">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_464">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_465">
<id>39</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_466">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_467">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_468">
<id>43</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_469">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_470">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_471">
<id>46</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_472">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_473">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_474">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_475">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_476">
<id>52</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_477">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_478">
<id>54</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_479">
<id>55</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_480">
<id>56</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_481">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_482">
<id>58</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_483">
<id>59</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_484">
<id>61</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_485">
<id>62</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_486">
<id>63</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_487">
<id>64</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_488">
<id>65</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_489">
<id>66</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_490">
<id>68</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_491">
<id>69</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_492">
<id>70</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_493">
<id>71</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_494">
<id>72</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_495">
<id>73</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_496">
<id>74</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_497">
<id>76</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_498">
<id>77</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_499">
<id>79</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_500">
<id>80</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_501">
<id>81</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_502">
<id>82</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_503">
<id>83</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_504">
<id>84</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_505">
<id>86</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_506">
<id>87</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_507">
<id>88</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_508">
<id>89</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_509">
<id>91</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_510">
<id>92</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_511">
<id>93</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_512">
<id>12</id>
<operations>
<count>36</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_513">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_514">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_515">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_516">
<id>94</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_517">
<id>95</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_518">
<id>96</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_519">
<id>97</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_520">
<id>99</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_521">
<id>100</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_522">
<id>101</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_523">
<id>103</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_524">
<id>105</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_525">
<id>106</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_526">
<id>107</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_527">
<id>109</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_528">
<id>111</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_529">
<id>112</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_530">
<id>113</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_531">
<id>115</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_532">
<id>117</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_533">
<id>118</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_534">
<id>119</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_535">
<id>121</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_536">
<id>123</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_537">
<id>124</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_538">
<id>125</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_539">
<id>127</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_540">
<id>129</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_541">
<id>130</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_542">
<id>131</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_543">
<id>133</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_544">
<id>135</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_545">
<id>136</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_546">
<id>137</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_547">
<id>139</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_548">
<id>141</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_549">
<id>13</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_550">
<id>143</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>13</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_551">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>150</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="_552">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>184</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="_553">
<inState>4</inState>
<outState>5</outState>
<condition>
<id>185</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="_554">
<inState>5</inState>
<outState>6</outState>
<condition>
<id>186</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="_555">
<inState>6</inState>
<outState>7</outState>
<condition>
<id>187</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="_556">
<inState>7</inState>
<outState>8</outState>
<condition>
<id>188</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="_557">
<inState>8</inState>
<outState>9</outState>
<condition>
<id>189</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="_558">
<inState>9</inState>
<outState>10</outState>
<condition>
<id>190</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="_559">
<inState>10</inState>
<outState>11</outState>
<condition>
<id>191</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="_560">
<inState>11</inState>
<outState>12</outState>
<condition>
<id>192</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="_561">
<inState>12</inState>
<outState>2</outState>
<condition>
<id>193</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="_562">
<inState>2</inState>
<outState>13</outState>
<condition>
<id>183</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item class_id="34" tracking_level="0" version="0">
<first class_id="35" tracking_level="0" version="0">
<first>10</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_563">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>194</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>10</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="36" tracking_level="1" version="0" object_id="_564">
<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>hog_mul_34ns_32nsjbC_U45 (hog_mul_34ns_32nsjbC)</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>4</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>0</second>
</item>
</second>
</item>
</dp_component_resource>
<dp_expression_resource>
<count>28</count>
<item_version>0</item_version>
<item>
<first>ap_condition_199 ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_condition_203 ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_condition_207 ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_condition_211 ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_condition_215 ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_condition_219 ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>blkIdx_s_fu_269_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>2</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>exitcond_flatten_fu_243_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>7</second>
</item>
<item>
<first>(1P1)</first>
<second>7</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>3</second>
</item>
</second>
</item>
<item>
<first>i_2_fu_287_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>
<item>
<first>i_mid2_fu_261_p3 ( select ) </first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>(2P2)</first>
<second>6</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>6</second>
</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_249_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>7</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>7</second>
</item>
</second>
</item>
<item>
<first>storemerge_cast_cast_fu_590_p3 ( select ) </first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>6</second>
</item>
<item>
<first>(2P2)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>6</second>
</item>
</second>
</item>
<item>
<first>tmp1_fu_318_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>6</second>
</item>
<item>
<first>(1P1)</first>
<second>6</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>6</second>
</item>
</second>
</item>
<item>
<first>tmp_20_fu_347_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>7</second>
</item>
<item>
<first>(1P1)</first>
<second>7</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>7</second>
</item>
</second>
</item>
<item>
<first>tmp_22_fu_402_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>29</second>
</item>
<item>
<first>(1P1)</first>
<second>29</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>10</second>
</item>
</second>
</item>
<item>
<first>tmp_23_fu_419_p2 ( - ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>31</second>
</item>
<item>
<first>(1P1)</first>
<second>31</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>31</second>
</item>
</second>
</item>
<item>
<first>tmp_24_fu_443_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>31</second>
</item>
<item>
<first>(1P1)</first>
<second>31</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>11</second>
</item>
</second>
</item>
<item>
<first>tmp_25_fu_449_p2 ( - ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>31</second>
</item>
<item>
<first>(1P1)</first>
<second>31</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>31</second>
</item>
</second>
</item>
<item>
<first>tmp_26_fu_473_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>31</second>
</item>
<item>
<first>(1P1)</first>
<second>31</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>11</second>
</item>
</second>
</item>
<item>
<first>tmp_27_fu_490_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>30</second>
</item>
<item>
<first>(1P1)</first>
<second>30</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>30</second>
</item>
</second>
</item>
<item>
<first>tmp_28_fu_510_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>29</second>
</item>
<item>
<first>(1P1)</first>
<second>29</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>10</second>
</item>
</second>
</item>
<item>
<first>tmp_29_fu_516_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>28</second>
</item>
<item>
<first>(1P1)</first>
<second>28</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>10</second>
</item>
</second>
</item>
<item>
<first>tmp_30_fu_522_p2 ( - ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>30</second>
</item>
<item>
<first>(1P1)</first>
<second>30</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>30</second>
</item>
</second>
</item>
<item>
<first>tmp_31_fu_546_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>31</second>
</item>
<item>
<first>(1P1)</first>
<second>31</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>11</second>
</item>
</second>
</item>
<item>
<first>tmp_32_fu_565_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>27</second>
</item>
<item>
<first>(1P1)</first>
<second>27</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>tmp_33_fu_584_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>26</second>
</item>
<item>
<first>(1P1)</first>
<second>26</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>tmp_34_fu_255_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>6</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>3</second>
</item>
</second>
</item>
<item>
<first>tmp_mid2_v_fu_275_p3 ( select ) </first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>2</second>
</item>
<item>
<first>(2P2)</first>
<second>2</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
</dp_expression_resource>
<dp_fifo_resource>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_resource>
<dp_memory_resource>
<count>0</count>
<item_version>0</item_version>
</dp_memory_resource>
<dp_multiplexer_resource>
<count>8</count>
<item_version>0</item_version>
<item>
<first>ap_NS_fsm</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>4</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>4</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter10</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>blkIdx_phi_fu_225_p4</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>2</second>
</item>
<item>
<first>(2Count)</first>
<second>4</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>blkIdx_reg_221</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>2</second>
</item>
<item>
<first>(2Count)</first>
<second>4</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>i_reg_232</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>
<item>
<first>indvar_flatten_reg_210</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>7</second>
</item>
<item>
<first>(2Count)</first>
<second>14</second>
</item>
<item>
<first>LUT</first>
<second>7</second>
</item>
</second>
</item>
<item>
<first>normalized_V_address1</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>9</second>
</item>
<item>
<first>(1Bits)</first>
<second>7</second>
</item>
<item>
<first>(2Count)</first>
<second>63</second>
</item>
<item>
<first>LUT</first>
<second>14</second>
</item>
</second>
</item>
<item>
<first>normalized_V_d1</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>9</second>
</item>
<item>
<first>(1Bits)</first>
<second>10</second>
</item>
<item>
<first>(2Count)</first>
<second>90</second>
</item>
<item>
<first>LUT</first>
<second>20</second>
</item>
</second>
</item>
</dp_multiplexer_resource>
<dp_register_resource>
<count>32</count>
<item_version>0</item_version>
<item>
<first>ap_CS_fsm</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>3</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>3</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter0</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter1</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter10</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter2</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter3</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter4</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter5</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter6</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter7</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter8</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter9</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_pipeline_reg_pp0_iter9_tmp_21_reg_660</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>64</second>
</item>
<item>
<first>(Consts)</first>
<second>57</second>
</item>
<item>
<first>FF</first>
<second>7</second>
</item>
</second>
</item>
<item>
<first>blkIdx_reg_221</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>2</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>exitcond_flatten_reg_598</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>i_mid2_reg_607</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_232</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>indvar_flatten_reg_210</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>7</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>7</second>
</item>
</second>
</item>
<item>
<first>mul_reg_644</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>65</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>65</second>
</item>
</second>
</item>
<item>
<first>tmp1_reg_639</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>6</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>6</second>
</item>
</second>
</item>
<item>
<first>tmp_21_reg_660</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>64</second>
</item>
<item>
<first>(Consts)</first>
<second>57</second>
</item>
<item>
<first>FF</first>
<second>7</second>
</item>
</second>
</item>
<item>
<first>tmp_22_reg_677</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>tmp_24_reg_681</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>tmp_26_reg_685</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>tmp_28_reg_689</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>tmp_29_reg_693</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>tmp_31_reg_697</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>tmp_32_reg_701</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>tmp_33_reg_705</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>tmp_35_reg_650</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>27</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>27</second>
</item>
</second>
</item>
<item>
<first>tmp_mid2_v_reg_612</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>2</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>tmp_reg_618</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
</dp_register_resource>
<dp_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>hog_mul_34ns_32nsjbC_U45 (hog_mul_34ns_32nsjbC)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
</dp_component_map>
<dp_expression_map>
<count>22</count>
<item_version>0</item_version>
<item>
<first>blkIdx_s_fu_269_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>exitcond_flatten_fu_243_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>i_2_fu_287_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>140</item>
</second>
</item>
<item>
<first>i_mid2_fu_261_p3 ( select ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_249_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>storemerge_cast_cast_fu_590_p3 ( select ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</second>
</item>
<item>
<first>tmp1_fu_318_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>tmp_20_fu_347_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>tmp_22_fu_402_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>tmp_23_fu_419_p2 ( - ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>tmp_24_fu_443_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>tmp_25_fu_449_p2 ( - ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>tmp_26_fu_473_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>tmp_27_fu_490_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>70</item>
</second>
</item>
<item>
<first>tmp_28_fu_510_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>tmp_29_fu_516_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</second>
</item>
<item>
<first>tmp_30_fu_522_p2 ( - ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>tmp_31_fu_546_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>tmp_32_fu_565_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>tmp_33_fu_584_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>93</item>
</second>
</item>
<item>
<first>tmp_34_fu_255_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>tmp_mid2_v_fu_275_p3 ( select ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
</dp_expression_map>
<dp_fifo_map>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_map>
<dp_memory_map>
<count>0</count>
<item_version>0</item_version>
</dp_memory_map>
</res>
<node_label_latency class_id="43" tracking_level="0" version="0">
<count>111</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="0" version="0">
<first>5</first>
<second class_id="45" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>7</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>8</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>9</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>27</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>2</first>
<second>1</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>3</first>
<second>6</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>9</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>9</first>
<second>1</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>73</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>74</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>77</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>79</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>80</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>81</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>82</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>84</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>86</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>87</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>88</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>89</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>91</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>92</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>93</first>
<second>
<first>10</first>
<second>0</second>
</second>
</item>
<item>
<first>94</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>95</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>96</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>97</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>99</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>100</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>101</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>103</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>105</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>106</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>107</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>109</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>111</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>112</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>113</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>115</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>117</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>118</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>119</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>121</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>123</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>124</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>125</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>127</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>129</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>130</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>131</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>133</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>135</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>136</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>137</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>140</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>141</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
<item>
<first>143</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="46" tracking_level="0" version="0">
<count>25</count>
<item_version>0</item_version>
<item class_id="47" tracking_level="0" version="0">
<first>6</first>
<second class_id="48" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>1</first>
<second>11</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>10</first>
<second>10</second>
</second>
</item>
<item>
<first>67</first>
<second>
<first>10</first>
<second>10</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>10</first>
<second>10</second>
</second>
</item>
<item>
<first>78</first>
<second>
<first>10</first>
<second>10</second>
</second>
</item>
<item>
<first>85</first>
<second>
<first>10</first>
<second>10</second>
</second>
</item>
<item>
<first>90</first>
<second>
<first>10</first>
<second>10</second>
</second>
</item>
<item>
<first>98</first>
<second>
<first>10</first>
<second>11</second>
</second>
</item>
<item>
<first>102</first>
<second>
<first>11</first>
<second>11</second>
</second>
</item>
<item>
<first>104</first>
<second>
<first>11</first>
<second>11</second>
</second>
</item>
<item>
<first>108</first>
<second>
<first>11</first>
<second>11</second>
</second>
</item>
<item>
<first>110</first>
<second>
<first>11</first>
<second>11</second>
</second>
</item>
<item>
<first>114</first>
<second>
<first>11</first>
<second>11</second>
</second>
</item>
<item>
<first>116</first>
<second>
<first>11</first>
<second>11</second>
</second>
</item>
<item>
<first>120</first>
<second>
<first>11</first>
<second>11</second>
</second>
</item>
<item>
<first>122</first>
<second>
<first>11</first>
<second>11</second>
</second>
</item>
<item>
<first>126</first>
<second>
<first>11</first>
<second>11</second>
</second>
</item>
<item>
<first>128</first>
<second>
<first>11</first>
<second>11</second>
</second>
</item>
<item>
<first>132</first>
<second>
<first>11</first>
<second>11</second>
</second>
</item>
<item>
<first>134</first>
<second>
<first>11</first>
<second>11</second>
</second>
</item>
<item>
<first>138</first>
<second>
<first>11</first>
<second>11</second>
</second>
</item>
<item>
<first>142</first>
<second>
<first>1</first>
<second>11</second>
</second>
</item>
<item>
<first>144</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="49" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="50" tracking_level="1" version="0" object_id="_565">
<region_name>Loop 1</region_name>
<basic_blocks>
<count>23</count>
<item_version>0</item_version>
<item>13</item>
<item>51</item>
<item>60</item>
<item>67</item>
<item>75</item>
<item>78</item>
<item>85</item>
<item>90</item>
<item>98</item>
<item>102</item>
<item>104</item>
<item>108</item>
<item>110</item>
<item>114</item>
<item>116</item>
<item>120</item>
<item>122</item>
<item>126</item>
<item>128</item>
<item>132</item>
<item>134</item>
<item>138</item>
<item>142</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>11</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="51" tracking_level="0" version="0">
<count>79</count>
<item_version>0</item_version>
<item class_id="52" tracking_level="0" version="0">
<first>108</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>115</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>28</item>
<item>28</item>
</second>
</item>
<item>
<first>120</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>127</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>43</item>
<item>43</item>
</second>
</item>
<item>
<first>132</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
<item>
<first>139</first>
<second>
<count>8</count>
<item_version>0</item_version>
<item>96</item>
<item>100</item>
<item>106</item>
<item>112</item>
<item>118</item>
<item>124</item>
<item>130</item>
<item>136</item>
</second>
</item>
<item>
<first>147</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>99</item>
</second>
</item>
<item>
<first>156</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>105</item>
</second>
</item>
<item>
<first>165</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>111</item>
</second>
</item>
<item>
<first>174</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>117</item>
</second>
</item>
<item>
<first>183</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>123</item>
</second>
</item>
<item>
<first>192</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>129</item>
</second>
</item>
<item>
<first>201</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>135</item>
</second>
</item>
<item>
<first>214</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
<item>
<first>225</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>236</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>243</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>249</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>255</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>261</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>269</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>275</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>283</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>287</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>140</item>
</second>
</item>
<item>
<first>293</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>297</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>301</first>
<second>
<count>7</count>
<item_version>0</item_version>
<item>30</item>
<item>30</item>
<item>30</item>
<item>30</item>
<item>30</item>
<item>30</item>
<item>30</item>
</second>
</item>
<item>
<first>307</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>314</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>318</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>323</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>330</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>334</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>344</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>347</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>353</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>358</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>361</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>364</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>367</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>374</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>378</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>382</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>386</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>390</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>394</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>398</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>402</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>408</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>415</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>419</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>425</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>435</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>439</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>443</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>449</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>455</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>465</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>469</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>473</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>479</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>486</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>69</item>
</second>
</item>
<item>
<first>490</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>70</item>
</second>
</item>
<item>
<first>496</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>506</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>510</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>516</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</second>
</item>
<item>
<first>522</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>528</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>538</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>542</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>82</item>
</second>
</item>
<item>
<first>546</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>552</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>86</item>
</second>
</item>
<item>
<first>561</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>565</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>571</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>91</item>
</second>
</item>
<item>
<first>580</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
<item>
<first>584</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>93</item>
</second>
</item>
<item>
<first>590</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="54" tracking_level="0" version="0">
<count>75</count>
<item_version>0</item_version>
<item class_id="55" tracking_level="0" version="0">
<first>average_cast7_fu_361</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>average_cast8_fu_358</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>average_cast_fu_364</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>blkIdx_phi_fu_225</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>blkIdx_s_fu_269</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>descriptor_V_addr_gep_fu_120</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>exitcond_flatten_fu_243</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>i_2_fu_287</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>140</item>
</second>
</item>
<item>
<first>i_mid2_fu_261</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>i_phi_fu_236</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_249</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>indvar_flatten_phi_fu_214</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
<item>
<first>normalized_V_addr25_gep_fu_201</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>135</item>
</second>
</item>
<item>
<first>normalized_V_addr_10_gep_fu_165</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>111</item>
</second>
</item>
<item>
<first>normalized_V_addr_11_gep_fu_156</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>105</item>
</second>
</item>
<item>
<first>normalized_V_addr_12_gep_fu_147</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>99</item>
</second>
</item>
<item>
<first>normalized_V_addr_13_gep_fu_132</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</second>
</item>
<item>
<first>normalized_V_addr_8_gep_fu_183</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>123</item>
</second>
</item>
<item>
<first>normalized_V_addr_9_gep_fu_174</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>117</item>
</second>
</item>
<item>
<first>normalized_V_addr_gep_fu_192</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>129</item>
</second>
</item>
<item>
<first>op2_assign_10_cast_fu_542</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>82</item>
</second>
</item>
<item>
<first>op2_assign_11_cast_fu_561</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>op2_assign_12_cast_fu_580</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
<item>
<first>op2_assign_7_cast_fu_439</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>op2_assign_8_cast_fu_469</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>op2_assign_9_cast_fu_506</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>72</item>
</second>
</item>
<item>
<first>op2_assign_cast6_fu_374</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>op2_assign_cast_fu_378</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>op2_assign_fu_367</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>p_shl4_cast_mid2_fu_314</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>p_shl4_cast_mid2_v_fu_307</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>p_shl5_cast_fu_415</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>p_shl5_fu_408</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>p_shl6_cast_fu_486</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>69</item>
</second>
</item>
<item>
<first>p_shl6_fu_479</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>p_shl_cast_mid2_fu_330</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>p_shl_cast_mid2_v_fu_323</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>storemerge_cast_cast_fu_590</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</second>
</item>
<item>
<first>sum_addr_gep_fu_108</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>tmp1_cast_fu_344</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>tmp1_fu_318</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>tmp_20_fu_347</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>tmp_21_fu_353</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>tmp_22_cast2_fu_394</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>tmp_22_cast3_fu_390</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>tmp_22_cast4_fu_386</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>tmp_22_cast5_fu_382</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>tmp_22_cast_fu_398</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>tmp_22_fu_402</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>tmp_23_fu_419</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>tmp_24_fu_443</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>tmp_25_fu_449</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>tmp_26_fu_473</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>tmp_27_fu_490</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>70</item>
</second>
</item>
<item>
<first>tmp_28_fu_510</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>tmp_29_fu_516</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</second>
</item>
<item>
<first>tmp_30_fu_522</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>tmp_31_fu_546</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>tmp_32_fu_565</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>tmp_33_fu_584</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>93</item>
</second>
</item>
<item>
<first>tmp_34_fu_255</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>tmp_35_fu_334</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>tmp_36_fu_435</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>tmp_37_fu_455</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>tmp_38_fu_465</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>tmp_39_fu_496</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>tmp_40_fu_528</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>tmp_41_fu_538</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>tmp_42_fu_552</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>86</item>
</second>
</item>
<item>
<first>tmp_43_fu_571</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>91</item>
</second>
</item>
<item>
<first>tmp_fu_283</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>tmp_mid2_fu_293</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>tmp_mid2_v_fu_275</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>tmp_s_fu_425</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>zext_cast_fu_297</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>1</count>
<item_version>0</item_version>
<item>
<first>grp_fu_301</first>
<second>
<count>7</count>
<item_version>0</item_version>
<item>30</item>
<item>30</item>
<item>30</item>
<item>30</item>
<item>30</item>
<item>30</item>
<item>30</item>
</second>
</item>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="56" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="57" tracking_level="0" version="0">
<first class_id="58" tracking_level="0" version="0">
<first>descriptor_V</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>43</item>
<item>43</item>
</second>
</item>
<item>
<first>
<first>normalized_V</first>
<second>1</second>
</first>
<second>
<count>8</count>
<item_version>0</item_version>
<item>96</item>
<item>100</item>
<item>106</item>
<item>112</item>
<item>118</item>
<item>124</item>
<item>130</item>
<item>136</item>
</second>
</item>
<item>
<first>
<first>sum</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>28</item>
<item>28</item>
</second>
</item>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>24</count>
<item_version>0</item_version>
<item>
<first>210</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
<item>
<first>221</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>232</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>598</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>602</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>607</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>612</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>618</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>624</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>140</item>
</second>
</item>
<item>
<first>629</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>634</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>639</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>644</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>650</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>660</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>672</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>677</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>681</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>685</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>689</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>693</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</second>
</item>
<item>
<first>697</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>701</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>705</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>93</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>24</count>
<item_version>0</item_version>
<item>
<first>blkIdx_reg_221</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>descriptor_V_addr_reg_672</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>exitcond_flatten_reg_598</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>i_2_reg_624</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>140</item>
</second>
</item>
<item>
<first>i_mid2_reg_607</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>i_reg_232</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>indvar_flatten_next_reg_602</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_210</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
<item>
<first>mul_reg_644</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>sum_addr_reg_629</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>tmp1_reg_639</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>tmp_21_reg_660</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>tmp_22_reg_677</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>tmp_24_reg_681</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>tmp_26_reg_685</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>tmp_28_reg_689</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>73</item>
</second>
</item>
<item>
<first>tmp_29_reg_693</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</second>
</item>
<item>
<first>tmp_31_reg_697</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>tmp_32_reg_701</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>tmp_33_reg_705</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>93</item>
</second>
</item>
<item>
<first>tmp_35_reg_650</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>tmp_mid2_v_reg_612</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>tmp_reg_618</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>zext_cast_reg_634</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>3</count>
<item_version>0</item_version>
<item>
<first>210</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
<item>
<first>221</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>232</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>3</count>
<item_version>0</item_version>
<item>
<first>blkIdx_reg_221</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>i_reg_232</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_210</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="59" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="60" tracking_level="0" version="0">
<first>descriptor_V(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>43</item>
<item>43</item>
</second>
</item>
</second>
</item>
<item>
<first>normalized_V(p1)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>store</first>
<second>
<count>8</count>
<item_version>0</item_version>
<item>96</item>
<item>100</item>
<item>106</item>
<item>112</item>
<item>118</item>
<item>124</item>
<item>130</item>
<item>136</item>
</second>
</item>
</second>
</item>
<item>
<first>sum(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>28</item>
<item>28</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="61" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="62" tracking_level="0" version="0">
<first>1</first>
<second>RAM</second>
</item>
<item>
<first>2</first>
<second>RAM</second>
</item>
<item>
<first>3</first>
<second>RAM_2P_BRAM</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
|
with
physics.remote.Model,
physics.Shape;
package physics.Model
--
-- Provides a model describing physical properties.
--
is
type shape_Kind is (Cylinder, Cone, Cube, a_Sphere, a_Capsule, Heightfield, Hull, Mesh, multi_Sphere, Plane, -- 3D
Circle, Polygon); -- 2D
type a_Shape (Kind : shape_Kind := Cube) is
record
case Kind
is
when Cube | Cylinder =>
half_Extents : Vector_3;
when a_Capsule =>
lower_Radius,
upper_Radius : Real;
Height : Real;
when Heightfield =>
Heights : access physics.Heightfield;
height_Range : Vector_2;
when a_Sphere =>
sphere_Radius : Real;
when Circle =>
circle_Radius : Real;
when Hull =>
Points : access physics.Vector_3_array;
when Mesh =>
Model : access Geometry_3D.a_Model;
when multi_Sphere =>
Sites : access physics.Vector_3_array;
Radii : access Vector;
when Plane =>
plane_Normal : Vector_3;
plane_Offset : Real;
when Polygon =>
Vertices : Geometry_2d.Sites (1 .. 8);
vertex_Count : Natural := 0;
when others =>
null;
end case;
end record;
type Item is new physics.remote.Model.item with
record
shape_Info : a_Shape;
Shape : physics.Shape.view;
Mass : Real;
Friction : Real;
Restitution : Real; -- Bounce
-- Site : Vector_3;
is_Tangible : Boolean := True;
end record;
type View is access all Item'Class;
----------
--- Forge
--
package Forge
is
function new_physics_Model (Id : in model_Id := null_model_Id;
shape_Info : in a_Shape;
Scale : in Vector_3 := (1.0, 1.0, 1.0);
Mass : in Real := 0.0;
Friction : in Real := 0.1;
Restitution : in Real := 0.1;
-- Site : in Vector_3 := Origin_3d;
is_Tangible : in Boolean := True) return View;
end Forge;
procedure define (Self : in out Item; Scale : in Vector_3);
procedure destroy (Self : in out Item);
procedure free (Self : in out View);
---------------
--- Attributes
--
function Id (Self : in Item'Class) return model_Id;
procedure Id_is (Self : in out Item'Class; Now : in model_Id);
procedure Scale_is (Self : in out Item'Class; Now : in Vector_3);
end physics.Model;
|
-- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2017 onox <denkpadje@gmail.com>
--
-- 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 Orka.Rendering.Buffers.Mapped is
overriding
function Length (Object : Mapped_Buffer) return Natural is
(Object.Buffer.Length);
procedure Map
(Object : in out Mapped_Buffer;
Length : Size;
Flags : GL.Objects.Buffers.Access_Bits) is
begin
case Object.Kind is
-- Numeric types
when UByte_Type =>
Pointers.UByte.Map_Range
(Object.Buffer.Buffer, Flags, 0, Length, Object.Pointer_UByte);
when UShort_Type =>
Pointers.UShort.Map_Range
(Object.Buffer.Buffer, Flags, 0, Length, Object.Pointer_UShort);
when UInt_Type =>
Pointers.UInt.Map_Range
(Object.Buffer.Buffer, Flags, 0, Length, Object.Pointer_UInt);
when Byte_Type =>
Pointers.Byte.Map_Range
(Object.Buffer.Buffer, Flags, 0, Length, Object.Pointer_Byte);
when Short_Type =>
Pointers.Short.Map_Range
(Object.Buffer.Buffer, Flags, 0, Length, Object.Pointer_Short);
when Int_Type =>
Pointers.Int.Map_Range
(Object.Buffer.Buffer, Flags, 0, Length, Object.Pointer_Int);
when Half_Type =>
Pointers.Half.Map_Range
(Object.Buffer.Buffer, Flags, 0, Length, Object.Pointer_Half);
when Single_Type =>
Pointers.Single.Map_Range
(Object.Buffer.Buffer, Flags, 0, Length, Object.Pointer_Single);
when Double_Type =>
Pointers.Double.Map_Range
(Object.Buffer.Buffer, Flags, 0, Length, Object.Pointer_Double);
-- Composite types
when Single_Vector_Type =>
Pointers.Single_Vector4.Map_Range
(Object.Buffer.Buffer, Flags, 0, Length, Object.Pointer_SV);
when Double_Vector_Type =>
Pointers.Double_Vector4.Map_Range
(Object.Buffer.Buffer, Flags, 0, Length, Object.Pointer_DV);
when Single_Matrix_Type =>
Pointers.Single_Matrix4.Map_Range
(Object.Buffer.Buffer, Flags, 0, Length, Object.Pointer_SM);
when Double_Matrix_Type =>
Pointers.Double_Matrix4.Map_Range
(Object.Buffer.Buffer, Flags, 0, Length, Object.Pointer_DM);
when Arrays_Command_Type =>
Pointers.Arrays_Command.Map_Range
(Object.Buffer.Buffer, Flags, 0, Length, Object.Pointer_AC);
when Elements_Command_Type =>
Pointers.Elements_Command.Map_Range
(Object.Buffer.Buffer, Flags, 0, Length, Object.Pointer_EC);
when Dispatch_Command_Type =>
Pointers.Dispatch_Command.Map_Range
(Object.Buffer.Buffer, Flags, 0, Length, Object.Pointer_DC);
end case;
end Map;
-----------------------------------------------------------------------------
overriding
procedure Bind
(Object : Mapped_Buffer;
Target : Indexed_Buffer_Target;
Index : Natural)
is
Buffer_Target : access constant GL.Objects.Buffers.Buffer_Target;
Offset : constant Size := Size (Object.Offset);
Length : constant Size := Size (Mapped_Buffer'Class (Object).Length);
begin
case Target is
when Uniform =>
Buffer_Target := GL.Objects.Buffers.Uniform_Buffer'Access;
when Shader_Storage =>
Buffer_Target := GL.Objects.Buffers.Shader_Storage_Buffer'Access;
when Atomic_Counter =>
Buffer_Target := GL.Objects.Buffers.Atomic_Counter_Buffer'Access;
end case;
case Object.Kind is
-- Numeric types
when UByte_Type =>
Pointers.UByte.Bind_Range
(Buffer_Target.all, Object.Buffer.Buffer, Index, Offset, Length);
when UShort_Type =>
Pointers.UShort.Bind_Range
(Buffer_Target.all, Object.Buffer.Buffer, Index, Offset, Length);
when UInt_Type =>
Pointers.UInt.Bind_Range
(Buffer_Target.all, Object.Buffer.Buffer, Index, Offset, Length);
when Byte_Type =>
Pointers.Byte.Bind_Range
(Buffer_Target.all, Object.Buffer.Buffer, Index, Offset, Length);
when Short_Type =>
Pointers.Short.Bind_Range
(Buffer_Target.all, Object.Buffer.Buffer, Index, Offset, Length);
when Int_Type =>
Pointers.Int.Bind_Range
(Buffer_Target.all, Object.Buffer.Buffer, Index, Offset, Length);
when Half_Type =>
Pointers.Half.Bind_Range
(Buffer_Target.all, Object.Buffer.Buffer, Index, Offset, Length);
when Single_Type =>
Pointers.Single.Bind_Range
(Buffer_Target.all, Object.Buffer.Buffer, Index, Offset, Length);
when Double_Type =>
Pointers.Double.Bind_Range
(Buffer_Target.all, Object.Buffer.Buffer, Index, Offset, Length);
-- Composite types
when Single_Vector_Type =>
Pointers.Single_Vector4.Bind_Range
(Buffer_Target.all, Object.Buffer.Buffer, Index, Offset, Length);
when Double_Vector_Type =>
Pointers.Double_Vector4.Bind_Range
(Buffer_Target.all, Object.Buffer.Buffer, Index, Offset, Length);
when Single_Matrix_Type =>
Pointers.Single_Matrix4.Bind_Range
(Buffer_Target.all, Object.Buffer.Buffer, Index, Offset, Length);
when Double_Matrix_Type =>
Pointers.Double_Matrix4.Bind_Range
(Buffer_Target.all, Object.Buffer.Buffer, Index, Offset, Length);
when Arrays_Command_Type =>
Pointers.Arrays_Command.Bind_Range
(Buffer_Target.all, Object.Buffer.Buffer, Index, Offset, Length);
when Elements_Command_Type =>
Pointers.Elements_Command.Bind_Range
(Buffer_Target.all, Object.Buffer.Buffer, Index, Offset, Length);
when Dispatch_Command_Type =>
Pointers.Dispatch_Command.Bind_Range
(Buffer_Target.all, Object.Buffer.Buffer, Index, Offset, Length);
end case;
end Bind;
overriding
procedure Bind (Object : Mapped_Buffer; Target : Buffer_Target) is
begin
case Target is
when Index =>
GL.Objects.Buffers.Element_Array_Buffer.Bind (Object.Buffer.Buffer);
when Dispatch_Indirect =>
GL.Objects.Buffers.Dispatch_Indirect_Buffer.Bind (Object.Buffer.Buffer);
when Draw_Indirect =>
GL.Objects.Buffers.Draw_Indirect_Buffer.Bind (Object.Buffer.Buffer);
when Parameter =>
GL.Objects.Buffers.Parameter_Buffer.Bind (Object.Buffer.Buffer);
when Pixel_Pack =>
GL.Objects.Buffers.Pixel_Pack_Buffer.Bind (Object.Buffer.Buffer);
when Pixel_Unpack =>
GL.Objects.Buffers.Pixel_Unpack_Buffer.Bind (Object.Buffer.Buffer);
when Query =>
GL.Objects.Buffers.Query_Buffer.Bind (Object.Buffer.Buffer);
end case;
end Bind;
-----------------------------------------------------------------------------
procedure Write_Data
(Object : Mapped_Buffer;
Data : UByte_Array;
Offset : Natural := 0) is
begin
Pointers.UByte.Set_Mapped_Data
(Object.Pointer_UByte, Size (Object.Offset + Offset), Data);
end Write_Data;
procedure Write_Data
(Object : Mapped_Buffer;
Data : UShort_Array;
Offset : Natural := 0) is
begin
Pointers.UShort.Set_Mapped_Data
(Object.Pointer_UShort, Size (Object.Offset + Offset), Data);
end Write_Data;
procedure Write_Data
(Object : Mapped_Buffer;
Data : UInt_Array;
Offset : Natural := 0) is
begin
Pointers.UInt.Set_Mapped_Data
(Object.Pointer_UInt, Size (Object.Offset + Offset), Data);
end Write_Data;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Byte_Array;
Offset : Natural := 0) is
begin
Pointers.Byte.Set_Mapped_Data
(Object.Pointer_Byte, Size (Object.Offset + Offset), Data);
end Write_Data;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Short_Array;
Offset : Natural := 0) is
begin
Pointers.Short.Set_Mapped_Data
(Object.Pointer_Short, Size (Object.Offset + Offset), Data);
end Write_Data;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Int_Array;
Offset : Natural := 0) is
begin
Pointers.Int.Set_Mapped_Data
(Object.Pointer_Int, Size (Object.Offset + Offset), Data);
end Write_Data;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Half_Array;
Offset : Natural := 0) is
begin
Pointers.Half.Set_Mapped_Data
(Object.Pointer_Half, Size (Object.Offset + Offset), Data);
end Write_Data;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Single_Array;
Offset : Natural := 0) is
begin
Pointers.Single.Set_Mapped_Data
(Object.Pointer_Single, Size (Object.Offset + Offset), Data);
end Write_Data;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Double_Array;
Offset : Natural := 0) is
begin
Pointers.Double.Set_Mapped_Data
(Object.Pointer_Double, Size (Object.Offset + Offset), Data);
end Write_Data;
-----------------------------------------------------------------------------
procedure Write_Data
(Object : Mapped_Buffer;
Data : Orka.Types.Singles.Vector4_Array;
Offset : Natural := 0) is
begin
Pointers.Single_Vector4.Set_Mapped_Data
(Object.Pointer_SV, Size (Object.Offset + Offset), Data);
end Write_Data;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Orka.Types.Singles.Matrix4_Array;
Offset : Natural := 0) is
begin
Pointers.Single_Matrix4.Set_Mapped_Data
(Object.Pointer_SM, Size (Object.Offset + Offset), Data);
end Write_Data;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Orka.Types.Doubles.Vector4_Array;
Offset : Natural := 0) is
begin
Pointers.Double_Vector4.Set_Mapped_Data
(Object.Pointer_DV, Size (Object.Offset + Offset), Data);
end Write_Data;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Orka.Types.Doubles.Matrix4_Array;
Offset : Natural := 0) is
begin
Pointers.Double_Matrix4.Set_Mapped_Data
(Object.Pointer_DM, Size (Object.Offset + Offset), Data);
end Write_Data;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Indirect.Arrays_Indirect_Command_Array;
Offset : Natural := 0) is
begin
Pointers.Arrays_Command.Set_Mapped_Data
(Object.Pointer_AC, Size (Object.Offset + Offset), Data);
end Write_Data;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Indirect.Elements_Indirect_Command_Array;
Offset : Natural := 0) is
begin
Pointers.Elements_Command.Set_Mapped_Data
(Object.Pointer_EC, Size (Object.Offset + Offset), Data);
end Write_Data;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Indirect.Dispatch_Indirect_Command_Array;
Offset : Natural := 0) is
begin
Pointers.Dispatch_Command.Set_Mapped_Data
(Object.Pointer_DC, Size (Object.Offset + Offset), Data);
end Write_Data;
-----------------------------------------------------------------------------
procedure Write_Data
(Object : Mapped_Buffer;
Value : Orka.Types.Singles.Vector4;
Offset : Natural) is
begin
Pointers.Single_Vector4.Set_Mapped_Data
(Object.Pointer_SV, Size (Object.Offset + Offset), Value);
end Write_Data;
procedure Write_Data
(Object : Mapped_Buffer;
Value : Orka.Types.Singles.Matrix4;
Offset : Natural) is
begin
Pointers.Single_Matrix4.Set_Mapped_Data
(Object.Pointer_SM, Size (Object.Offset + Offset), Value);
end Write_Data;
procedure Write_Data
(Object : Mapped_Buffer;
Value : Orka.Types.Doubles.Vector4;
Offset : Natural) is
begin
Pointers.Double_Vector4.Set_Mapped_Data
(Object.Pointer_DV, Size (Object.Offset + Offset), Value);
end Write_Data;
procedure Write_Data
(Object : Mapped_Buffer;
Value : Orka.Types.Doubles.Matrix4;
Offset : Natural) is
begin
Pointers.Double_Matrix4.Set_Mapped_Data
(Object.Pointer_DM, Size (Object.Offset + Offset), Value);
end Write_Data;
procedure Write_Data
(Object : Mapped_Buffer;
Value : Indirect.Arrays_Indirect_Command;
Offset : Natural) is
begin
Pointers.Arrays_Command.Set_Mapped_Data
(Object.Pointer_AC, Size (Object.Offset + Offset), Value);
end Write_Data;
procedure Write_Data
(Object : Mapped_Buffer;
Value : Indirect.Elements_Indirect_Command;
Offset : Natural) is
begin
Pointers.Elements_Command.Set_Mapped_Data
(Object.Pointer_EC, Size (Object.Offset + Offset), Value);
end Write_Data;
procedure Write_Data
(Object : Mapped_Buffer;
Value : Indirect.Dispatch_Indirect_Command;
Offset : Natural) is
begin
Pointers.Dispatch_Command.Set_Mapped_Data
(Object.Pointer_DC, Size (Object.Offset + Offset), Value);
end Write_Data;
-----------------------------------------------------------------------------
procedure Read_Data
(Object : Mapped_Buffer;
Data : out UByte_Array;
Offset : Natural := 0) is
begin
Data := Pointers.UByte.Get_Mapped_Data
(Object.Pointer_UByte, Size (Object.Offset + Offset), Data'Length);
end Read_Data;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out UShort_Array;
Offset : Natural := 0) is
begin
Data := Pointers.UShort.Get_Mapped_Data
(Object.Pointer_UShort, Size (Object.Offset + Offset), Data'Length);
end Read_Data;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out UInt_Array;
Offset : Natural := 0) is
begin
Data := Pointers.UInt.Get_Mapped_Data
(Object.Pointer_UInt, Size (Object.Offset + Offset), Data'Length);
end Read_Data;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Byte_Array;
Offset : Natural := 0) is
begin
Data := Pointers.Byte.Get_Mapped_Data
(Object.Pointer_Byte, Size (Object.Offset + Offset), Data'Length);
end Read_Data;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Short_Array;
Offset : Natural := 0) is
begin
Data := Pointers.Short.Get_Mapped_Data
(Object.Pointer_Short, Size (Object.Offset + Offset), Data'Length);
end Read_Data;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Int_Array;
Offset : Natural := 0) is
begin
Data := Pointers.Int.Get_Mapped_Data
(Object.Pointer_Int, Size (Object.Offset + Offset), Data'Length);
end Read_Data;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Half_Array;
Offset : Natural := 0) is
begin
Data := Pointers.Half.Get_Mapped_Data
(Object.Pointer_Half, Size (Object.Offset + Offset), Data'Length);
end Read_Data;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Single_Array;
Offset : Natural := 0) is
begin
Data := Pointers.Single.Get_Mapped_Data
(Object.Pointer_Single, Size (Object.Offset + Offset), Data'Length);
end Read_Data;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Double_Array;
Offset : Natural := 0) is
begin
Data := Pointers.Double.Get_Mapped_Data
(Object.Pointer_Double, Size (Object.Offset + Offset), Data'Length);
end Read_Data;
-----------------------------------------------------------------------------
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Orka.Types.Singles.Vector4_Array;
Offset : Natural := 0) is
begin
Data := Pointers.Single_Vector4.Get_Mapped_Data
(Object.Pointer_SV, Size (Object.Offset + Offset), Data'Length);
end Read_Data;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Orka.Types.Singles.Matrix4_Array;
Offset : Natural := 0) is
begin
Data := Pointers.Single_Matrix4.Get_Mapped_Data
(Object.Pointer_SM, Size (Object.Offset + Offset), Data'Length);
end Read_Data;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Orka.Types.Doubles.Vector4_Array;
Offset : Natural := 0) is
begin
Data := Pointers.Double_Vector4.Get_Mapped_Data
(Object.Pointer_DV, Size (Object.Offset + Offset), Data'Length);
end Read_Data;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Orka.Types.Doubles.Matrix4_Array;
Offset : Natural := 0) is
begin
Data := Pointers.Double_Matrix4.Get_Mapped_Data
(Object.Pointer_DM, Size (Object.Offset + Offset), Data'Length);
end Read_Data;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Indirect.Arrays_Indirect_Command_Array;
Offset : Natural := 0) is
begin
Data := Pointers.Arrays_Command.Get_Mapped_Data
(Object.Pointer_AC, Size (Object.Offset + Offset), Data'Length);
end Read_Data;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Indirect.Elements_Indirect_Command_Array;
Offset : Natural := 0) is
begin
Data := Pointers.Elements_Command.Get_Mapped_Data
(Object.Pointer_EC, Size (Object.Offset + Offset), Data'Length);
end Read_Data;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Indirect.Dispatch_Indirect_Command_Array;
Offset : Natural := 0) is
begin
Data := Pointers.Dispatch_Command.Get_Mapped_Data
(Object.Pointer_DC, Size (Object.Offset + Offset), Data'Length);
end Read_Data;
end Orka.Rendering.Buffers.Mapped;
|
------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015-2016, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of STMicroelectronics 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. --
-- --
------------------------------------------------------------------------------
-- Based on ft5336.h from MCD Application Team
with Ada.Real_Time; use Ada.Real_Time;
with Ada.Unchecked_Conversion;
with HAL.Touch_Panel; use HAL.Touch_Panel;
with STM32.Board; use STM32.Board;
with STM32.Setup;
package body Touch_Panel_FT5336 is
----------------
-- Initialize --
----------------
function Initialize
(This : in out Touch_Panel;
Orientation : HAL.Framebuffer.Display_Orientation :=
HAL.Framebuffer.Default)
return Boolean
is
begin
-- Wait at least 200ms after power up before accessing the TP registers
delay until Clock + Milliseconds (200);
STM32.Setup.Setup_I2C_Master (Port => TP_I2C,
SDA => TP_I2C_SDA,
SCL => TP_I2C_SCL,
SDA_AF => TP_I2C_AF,
SCL_AF => TP_I2C_AF,
Clock_Speed => 100_000);
This.TP_Set_Use_Interrupts (False);
This.Set_Orientation (Orientation);
return This.Check_Id;
end Initialize;
----------------
-- Initialize --
----------------
procedure Initialize (This : in out Touch_Panel;
Orientation : HAL.Framebuffer.Display_Orientation :=
HAL.Framebuffer.Default) is
begin
if not This.Initialize (Orientation) then
raise Constraint_Error with "Cannot initialize the touch panel";
end if;
end Initialize;
---------------------
-- Set_Orientation --
---------------------
procedure Set_Orientation
(This : in out Touch_Panel;
Orientation : HAL.Framebuffer.Display_Orientation)
is
begin
case Orientation is
when HAL.Framebuffer.Default | HAL.Framebuffer.Landscape =>
This.Set_Bounds (LCD_Natural_Width,
LCD_Natural_Height,
0);
when HAL.Framebuffer.Portrait =>
This.Set_Bounds (LCD_Natural_Width,
LCD_Natural_Height,
Invert_Y or Swap_XY);
end case;
end Set_Orientation;
end Touch_Panel_FT5336;
|
with Ada.Streams.Stream_IO;
with Ada.Text_IO;
with Ada.Unchecked_Deallocation;
with Ada.Containers.Vectors;
package body Benchmark_S_Number is
package Skill renames Number.Api;
use Number;
use Skill;
type State_Type is access Skill_State;
State : State_Type;
procedure Create (N : Integer; File_Name : String) is
begin
State := new Skill_State;
Skill.Create (State);
for I in 1 .. i64 (N) loop
New_Number (State, I);
end loop;
end Create;
procedure Write (N : Integer; File_Name : String) is
package ASS_IO renames Ada.Streams.Stream_IO;
File : ASS_IO.File_Type;
Stream : ASS_IO.Stream_Access;
procedure Free is new Ada.Unchecked_Deallocation (Number_Type_Array, Number_Type_Accesses);
Objects : Number_Type_Accesses := Skill.Get_Numbers (State);
begin
ASS_IO.Create (File, ASS_IO.Out_File, File_Name);
Stream := ASS_IO.Stream (File);
for I in Objects'Range loop
Number_Type'Write (Stream, Objects (I).all);
end loop;
ASS_IO.Close (File);
Free (Objects);
end Write;
procedure Read (N : Integer; File_Name : String) is
package ASS_IO renames Ada.Streams.Stream_IO;
File : ASS_IO.File_Type;
Stream : ASS_IO.Stream_Access;
package Vector is new Ada.Containers.Vectors (Positive, Number_Type);
Storage_Pool : Vector.Vector;
begin
ASS_IO.Open (File, ASS_IO.In_File, File_Name);
Stream := ASS_IO.Stream (File);
while not ASS_IO.End_Of_File (File) loop
declare
X : Number_Type;
begin
Number_Type'Read (Stream, X);
Storage_Pool.Append (X);
end;
end loop;
ASS_IO.Close (File);
end Read;
procedure Reset (N : Integer; File_Name : String) is
procedure Free is new Ada.Unchecked_Deallocation (Skill_State, State_Type);
begin
Skill.Close (State);
Free (State);
end Reset;
end Benchmark_S_Number;
|
package Pcap.Low_Level is
end pcap.Low_level;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 3 1 --
-- --
-- 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 = 31
package System.Pack_31 is
pragma Preelaborate;
Bits : constant := 31;
type Bits_31 is mod 2 ** Bits;
for Bits_31'Size use Bits;
function Get_31 (Arr : System.Address; N : Natural) return Bits_31;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned.
procedure Set_31 (Arr : System.Address; N : Natural; E : Bits_31);
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is set to the given value.
end System.Pack_31;
|
-----------------------------------------------------------------------
-- asf-beans-globals -- Bean giving access to the global init parameters
-- Copyright (C) 2012 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with ASF.Contexts.Faces;
with ASF.Applications.Main;
package body ASF.Beans.Globals is
Bean : aliased Global_Bean;
-- ------------------------------
-- Get the init parameter identified by the given name.
-- Returns Null_Object if the application does not define such parameter.
-- ------------------------------
overriding
function Get_Value (Bean : in Global_Bean;
Name : in String) return Util.Beans.Objects.Object is
pragma Unreferenced (Bean);
use type ASF.Contexts.Faces.Faces_Context_Access;
Ctx : constant ASF.Contexts.Faces.Faces_Context_Access := ASF.Contexts.Faces.Current;
begin
if Ctx = null then
return Util.Beans.Objects.Null_Object;
end if;
declare
App : constant ASF.Contexts.Faces.Application_Access := Ctx.Get_Application;
Param : constant String := App.Get_Init_Parameter (Name, "");
begin
if Param = "" then
return Util.Beans.Objects.Null_Object;
else
return Util.Beans.Objects.To_Object (Param);
end if;
end;
end Get_Value;
-- ------------------------------
-- Return the Param_Bean instance.
-- ------------------------------
function Instance return Util.Beans.Objects.Object is
begin
return Util.Beans.Objects.To_Object (Bean'Access, Util.Beans.Objects.STATIC);
end Instance;
end ASF.Beans.Globals;
|
------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . V A L _ U T I L --
-- --
-- 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 provides some common utilities used by the s-valxxx files
package System.Val_Util is
pragma Pure;
procedure Normalize_String
(S : in out String;
F, L : out Integer);
-- This procedure scans the string S setting F to be the index of the first
-- non-blank character of S and L to be the index of the last non-blank
-- character of S. Any lower case characters present in S will be folded
-- to their upper case equivalent except for character literals. If S
-- consists of entirely blanks then Constraint_Error is raised.
--
-- Note: if S is the null string, F is set to S'First, L to S'Last
procedure Scan_Sign
(Str : String;
Ptr : access Integer;
Max : Integer;
Minus : out Boolean;
Start : out Positive);
-- The Str, Ptr, Max parameters are as for the scan routines (Str is the
-- string to be scanned starting at Ptr.all, and Max is the index of the
-- last character in the string). Scan_Sign first scans out any initial
-- blanks, raising Constraint_Error if the field is all blank. It then
-- checks for and skips an initial plus or minus, requiring a non-blank
-- character to follow (Constraint_Error is raised if plus or minus
-- appears at the end of the string or with a following blank). Minus is
-- set True if a minus sign was skipped, and False otherwise. On exit
-- Ptr.all points to the character after the sign, or to the first
-- non-blank character if no sign is present. Start is set to the point
-- to the first non-blank character (sign or digit after it).
--
-- Note: if Str is null, 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. Constraint_Error is
-- also raised in this case.
procedure Scan_Plus_Sign
(Str : String;
Ptr : access Integer;
Max : Integer;
Start : out Positive);
-- Same as Scan_Sign, but allows only plus, not minus.
-- This is used for modular types.
function Scan_Exponent
(Str : String;
Ptr : access Integer;
Max : Integer;
Real : Boolean := False) return Integer;
-- Called to scan a possible exponent. Str, Ptr, Max are as described above
-- for Scan_Sign. If Ptr.all < Max and Str (Ptr.all) = 'E' or 'e', then an
-- exponent is scanned out, with the exponent value returned in Exp, and
-- Ptr.all updated to point past the exponent. If the exponent field is
-- incorrectly formed or not present, then Ptr.all is unchanged, and the
-- returned exponent value is zero. Real indicates whether a minus sign
-- is permitted (True = permitted). Very large exponents are handled by
-- returning a suitable large value. If the base is zero, then any value
-- is allowed, and otherwise the large value will either cause underflow
-- or overflow during the scaling process which is fine.
procedure Scan_Trailing_Blanks (Str : String; P : Positive);
-- Checks that the remainder of the field Str (P .. Str'Last) is all
-- blanks. Raises Constraint_Error if a non-blank character is found.
procedure Scan_Underscore
(Str : String;
P : in out Natural;
Ptr : access Integer;
Max : Integer;
Ext : Boolean);
-- Called if an underscore is encountered while scanning digits. Str (P)
-- contains the underscore. Ptr it the pointer to be returned to the
-- ultimate caller of the scan routine, Max is the maximum subscript in
-- Str, and Ext indicates if extended digits are allowed. In the case
-- where the underscore is invalid, Constraint_Error is raised with Ptr
-- set appropriately, otherwise control returns with P incremented past
-- the underscore.
end System.Val_Util;
|
-------------------------------------------------------------------------------
-- Copyright (c) 2019, Daniel King
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
-- * Redistributions of source code must retain the above copyright
-- notice, this list of conditions and the following disclaimer.
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
-- * The name of the copyright holder may not be used to endorse or promote
-- Products derived from this software without specific prior written
-- permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE FOR ANY
-- DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
-- (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
-- LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
-- ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
-- THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-------------------------------------------------------------------------------
with Keccak.Generic_Duplex;
with Keccak.Generic_Sponge;
pragma Elaborate_All (Keccak.Generic_Duplex);
pragma Elaborate_All (Keccak.Generic_Sponge);
-- @summary
-- Instantiation of Keccak-p[400,12], with a Sponge and Duplex built on top of it.
package Keccak.Keccak_400.Rounds_12
with SPARK_Mode => On
is
procedure Permute is new KeccakF_400_Permutation.Permute
(Num_Rounds => 12);
package Sponge is new Keccak.Generic_Sponge
(State_Size_Bits => KeccakF_400.State_Size_Bits,
State_Type => State,
Init_State => KeccakF_400.Init,
Permute => Permute,
XOR_Bits_Into_State => KeccakF_400_Lanes.XOR_Bits_Into_State,
Extract_Data => KeccakF_400_Lanes.Extract_Bytes,
Pad => Keccak.Padding.Pad101_Multi_Blocks);
package Duplex is new Keccak.Generic_Duplex
(State_Size_Bits => KeccakF_400.State_Size_Bits,
State_Type => State,
Init_State => KeccakF_400.Init,
Permute => Permute,
XOR_Bits_Into_State => KeccakF_400_Lanes.XOR_Bits_Into_State,
Extract_Bits => KeccakF_400_Lanes.Extract_Bits,
Pad => Keccak.Padding.Pad101_Single_Block,
Min_Padding_Bits => Keccak.Padding.Pad101_Min_Bits);
end Keccak.Keccak_400.Rounds_12;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Tools Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2015, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with Asis.Declarations;
package body Properties.Declarations.Loop_Parameter_Specification is
----------
-- Code --
----------
function Code
(Engine : access Engines.Contexts.Context;
Element : Asis.Declaration;
Name : Engines.Text_Property)
return League.Strings.Universal_String
is
Var : League.Strings.Universal_String;
Text : League.Strings.Universal_String;
Names : constant Asis.Defining_Name_List :=
Asis.Declarations.Names (Element);
Cond : constant League.Strings.Universal_String :=
Engine.Text.Get_Property (Element, Engines.Condition);
Last : constant League.Strings.Universal_String :=
Engine.Unique.Get (Element, "_last");
begin
Text.Append ("(");
Text.Append (Cond);
Text.Append ("=");
Var := Engine.Text.Get_Property (Names (1), Name);
Text.Append (Var);
Text.Append ("!=");
Text.Append (Last);
Text.Append (") && (");
Text.Append (Var);
Text.Append ("=_ec._succ(");
Text.Append (Var);
Text.Append ("))");
return Text;
end Code;
---------------
-- Condition --
---------------
function Condition
(Engine : access Engines.Contexts.Context;
Element : Asis.Declaration;
Name : Engines.Text_Property) return League.Strings.Universal_String
is
pragma Unreferenced (Name);
Result : constant League.Strings.Universal_String :=
Engine.Unique.Get (Element, "_cond");
begin
return Result;
end Condition;
----------------
-- Initialize --
----------------
function Initialize
(Engine : access Engines.Contexts.Context;
Element : Asis.Declaration;
Name : Engines.Text_Property)
return League.Strings.Universal_String
is
pragma Unreferenced (Name);
Var : League.Strings.Universal_String;
Text : League.Strings.Universal_String;
Down : League.Strings.Universal_String;
Names : constant Asis.Defining_Name_List :=
Asis.Declarations.Names (Element);
Bounds : constant Asis.Discrete_Subtype_Definition :=
Asis.Declarations.Specification_Subtype_Definition (Element);
Last : constant League.Strings.Universal_String :=
Engine.Unique.Get (Element, "_last");
Cond : constant League.Strings.Universal_String :=
Engine.Text.Get_Property (Element, Engines.Condition);
begin
Text.Append ("var ");
Text.Append (Last);
Text.Append ("=");
Down := Engine.Text.Get_Property (Bounds, Engines.Upper);
Text.Append (Down);
Text.Append (",");
Var := Engine.Text.Get_Property (Names (1), Engines.Code);
Text.Append (Var);
Text.Append ("=");
Down := Engine.Text.Get_Property (Bounds, Engines.Lower);
Text.Append (Down);
Text.Append (",");
Text.Append (Cond);
Text.Append ("=");
Text.Append (Var);
Text.Append ("<=");
Text.Append (Last);
return Text;
end Initialize;
end Properties.Declarations.Loop_Parameter_Specification;
|
-----------------------------------------------------------------------
-- security-controllers-roles -- Simple role base security
-- Copyright (C) 2011, 2012 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- 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 Security.Contexts;
with Security.Permissions;
with Security.Policies.Roles;
package Security.Controllers.Roles is
-- ------------------------------
-- Security Controller
-- ------------------------------
-- The <b>Role_Controller</b> implements a simple role based permissions check.
-- The permission is granted if the user has the role defined by the controller.
type Role_Controller (Count : Positive) is limited new Controller with record
Roles : Policies.Roles.Role_Type_Array (1 .. Count);
end record;
type Role_Controller_Access is access all Role_Controller'Class;
-- Returns true if the user associated with the security context <b>Context</b> has
-- one of the role defined in the <b>Handler</b>.
overriding
function Has_Permission (Handler : in Role_Controller;
Context : in Security.Contexts.Security_Context'Class;
Permission : in Security.Permissions.Permission'Class)
return Boolean;
end Security.Controllers.Roles;
|
-- 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.TIM is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype CR1_CMS_Field is HAL.UInt2;
subtype CR1_CKD_Field is HAL.UInt2;
-- control register 1
type CR1_Register is record
-- Counter enable
CEN : Boolean := False;
-- Update disable
UDIS : Boolean := False;
-- Update request source
URS : Boolean := False;
-- One-pulse mode
OPM : Boolean := False;
-- Direction
DIR : Boolean := False;
-- Center-aligned mode selection
CMS : CR1_CMS_Field := 16#0#;
-- Auto-reload preload enable
ARPE : Boolean := False;
-- Clock division
CKD : CR1_CKD_Field := 16#0#;
-- unspecified
Reserved_10_31 : HAL.UInt22 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR1_Register use record
CEN at 0 range 0 .. 0;
UDIS at 0 range 1 .. 1;
URS at 0 range 2 .. 2;
OPM at 0 range 3 .. 3;
DIR at 0 range 4 .. 4;
CMS at 0 range 5 .. 6;
ARPE at 0 range 7 .. 7;
CKD at 0 range 8 .. 9;
Reserved_10_31 at 0 range 10 .. 31;
end record;
subtype CR2_MMS_Field is HAL.UInt3;
-- control register 2
type CR2_Register is record
-- Capture/compare preloaded control
CCPC : Boolean := False;
-- unspecified
Reserved_1_1 : HAL.Bit := 16#0#;
-- Capture/compare control update selection
CCUS : Boolean := False;
-- Capture/compare DMA selection
CCDS : Boolean := False;
-- Master mode selection
MMS : CR2_MMS_Field := 16#0#;
-- TI1 selection
TI1S : Boolean := False;
-- Output Idle state 1
OIS1 : Boolean := False;
-- Output Idle state 1
OIS1N : Boolean := False;
-- Output Idle state 2
OIS2 : Boolean := False;
-- Output Idle state 2
OIS2N : Boolean := False;
-- Output Idle state 3
OIS3 : Boolean := False;
-- Output Idle state 3
OIS3N : Boolean := False;
-- Output Idle state 4
OIS4 : Boolean := False;
-- unspecified
Reserved_15_31 : HAL.UInt17 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR2_Register use record
CCPC at 0 range 0 .. 0;
Reserved_1_1 at 0 range 1 .. 1;
CCUS at 0 range 2 .. 2;
CCDS at 0 range 3 .. 3;
MMS at 0 range 4 .. 6;
TI1S at 0 range 7 .. 7;
OIS1 at 0 range 8 .. 8;
OIS1N at 0 range 9 .. 9;
OIS2 at 0 range 10 .. 10;
OIS2N at 0 range 11 .. 11;
OIS3 at 0 range 12 .. 12;
OIS3N at 0 range 13 .. 13;
OIS4 at 0 range 14 .. 14;
Reserved_15_31 at 0 range 15 .. 31;
end record;
subtype SMCR_SMS_Field is HAL.UInt3;
subtype SMCR_TS_Field is HAL.UInt3;
subtype SMCR_ETF_Field is HAL.UInt4;
subtype SMCR_ETPS_Field is HAL.UInt2;
-- slave mode control register
type SMCR_Register is record
-- Slave mode selection
SMS : SMCR_SMS_Field := 16#0#;
-- unspecified
Reserved_3_3 : HAL.Bit := 16#0#;
-- Trigger selection
TS : SMCR_TS_Field := 16#0#;
-- Master/Slave mode
MSM : Boolean := False;
-- External trigger filter
ETF : SMCR_ETF_Field := 16#0#;
-- External trigger prescaler
ETPS : SMCR_ETPS_Field := 16#0#;
-- External clock enable
ECE : Boolean := False;
-- External trigger polarity
ETP : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SMCR_Register use record
SMS at 0 range 0 .. 2;
Reserved_3_3 at 0 range 3 .. 3;
TS at 0 range 4 .. 6;
MSM at 0 range 7 .. 7;
ETF at 0 range 8 .. 11;
ETPS at 0 range 12 .. 13;
ECE at 0 range 14 .. 14;
ETP at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- DMA/Interrupt enable register
type DIER_Register is record
-- Update interrupt enable
UIE : Boolean := False;
-- Capture/Compare 1 interrupt enable
CC1IE : Boolean := False;
-- Capture/Compare 2 interrupt enable
CC2IE : Boolean := False;
-- Capture/Compare 3 interrupt enable
CC3IE : Boolean := False;
-- Capture/Compare 4 interrupt enable
CC4IE : Boolean := False;
-- COM interrupt enable
COMIE : Boolean := False;
-- Trigger interrupt enable
TIE : Boolean := False;
-- Break interrupt enable
BIE : Boolean := False;
-- Update DMA request enable
UDE : Boolean := False;
-- Capture/Compare 1 DMA request enable
CC1DE : Boolean := False;
-- Capture/Compare 2 DMA request enable
CC2DE : Boolean := False;
-- Capture/Compare 3 DMA request enable
CC3DE : Boolean := False;
-- Capture/Compare 4 DMA request enable
CC4DE : Boolean := False;
-- COM DMA request enable
COMDE : Boolean := False;
-- Trigger DMA request enable
TDE : Boolean := False;
-- unspecified
Reserved_15_31 : HAL.UInt17 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DIER_Register use record
UIE at 0 range 0 .. 0;
CC1IE at 0 range 1 .. 1;
CC2IE at 0 range 2 .. 2;
CC3IE at 0 range 3 .. 3;
CC4IE at 0 range 4 .. 4;
COMIE at 0 range 5 .. 5;
TIE at 0 range 6 .. 6;
BIE at 0 range 7 .. 7;
UDE at 0 range 8 .. 8;
CC1DE at 0 range 9 .. 9;
CC2DE at 0 range 10 .. 10;
CC3DE at 0 range 11 .. 11;
CC4DE at 0 range 12 .. 12;
COMDE at 0 range 13 .. 13;
TDE at 0 range 14 .. 14;
Reserved_15_31 at 0 range 15 .. 31;
end record;
-- status register
type SR_Register is record
-- Update interrupt flag
UIF : Boolean := False;
-- Capture/compare 1 interrupt flag
CC1IF : Boolean := False;
-- Capture/Compare 2 interrupt flag
CC2IF : Boolean := False;
-- Capture/Compare 3 interrupt flag
CC3IF : Boolean := False;
-- Capture/Compare 4 interrupt flag
CC4IF : Boolean := False;
-- COM interrupt flag
COMIF : Boolean := False;
-- Trigger interrupt flag
TIF : Boolean := False;
-- Break interrupt flag
BIF : Boolean := False;
-- unspecified
Reserved_8_8 : HAL.Bit := 16#0#;
-- Capture/Compare 1 overcapture flag
CC1OF : Boolean := False;
-- Capture/compare 2 overcapture flag
CC2OF : Boolean := False;
-- Capture/Compare 3 overcapture flag
CC3OF : Boolean := False;
-- Capture/Compare 4 overcapture flag
CC4OF : Boolean := False;
-- unspecified
Reserved_13_31 : HAL.UInt19 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register use record
UIF at 0 range 0 .. 0;
CC1IF at 0 range 1 .. 1;
CC2IF at 0 range 2 .. 2;
CC3IF at 0 range 3 .. 3;
CC4IF at 0 range 4 .. 4;
COMIF at 0 range 5 .. 5;
TIF at 0 range 6 .. 6;
BIF at 0 range 7 .. 7;
Reserved_8_8 at 0 range 8 .. 8;
CC1OF at 0 range 9 .. 9;
CC2OF at 0 range 10 .. 10;
CC3OF at 0 range 11 .. 11;
CC4OF at 0 range 12 .. 12;
Reserved_13_31 at 0 range 13 .. 31;
end record;
-- event generation register
type EGR_Register is record
-- Write-only. Update generation
UG : Boolean := False;
-- Write-only. Capture/compare 1 generation
CC1G : Boolean := False;
-- Write-only. Capture/compare 2 generation
CC2G : Boolean := False;
-- Write-only. Capture/compare 3 generation
CC3G : Boolean := False;
-- Write-only. Capture/compare 4 generation
CC4G : Boolean := False;
-- Write-only. Capture/Compare control update generation
COMG : Boolean := False;
-- Write-only. Trigger generation
TG : Boolean := False;
-- Write-only. Break generation
BG : Boolean := False;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EGR_Register use record
UG at 0 range 0 .. 0;
CC1G at 0 range 1 .. 1;
CC2G at 0 range 2 .. 2;
CC3G at 0 range 3 .. 3;
CC4G at 0 range 4 .. 4;
COMG at 0 range 5 .. 5;
TG at 0 range 6 .. 6;
BG at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype CCMR1_Output_CC1S_Field is HAL.UInt2;
subtype CCMR1_Output_OC1M_Field is HAL.UInt3;
subtype CCMR1_Output_CC2S_Field is HAL.UInt2;
subtype CCMR1_Output_OC2M_Field is HAL.UInt3;
-- capture/compare mode register 1 (output mode)
type CCMR1_Output_Register is record
-- Capture/Compare 1 selection
CC1S : CCMR1_Output_CC1S_Field := 16#0#;
-- Output Compare 1 fast enable
OC1FE : Boolean := False;
-- Output Compare 1 preload enable
OC1PE : Boolean := False;
-- Output Compare 1 mode
OC1M : CCMR1_Output_OC1M_Field := 16#0#;
-- Output Compare 1 clear enable
OC1CE : Boolean := False;
-- Capture/Compare 2 selection
CC2S : CCMR1_Output_CC2S_Field := 16#0#;
-- Output Compare 2 fast enable
OC2FE : Boolean := False;
-- Output Compare 2 preload enable
OC2PE : Boolean := False;
-- Output Compare 2 mode
OC2M : CCMR1_Output_OC2M_Field := 16#0#;
-- Output Compare 2 clear enable
OC2CE : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCMR1_Output_Register use record
CC1S at 0 range 0 .. 1;
OC1FE at 0 range 2 .. 2;
OC1PE at 0 range 3 .. 3;
OC1M at 0 range 4 .. 6;
OC1CE at 0 range 7 .. 7;
CC2S at 0 range 8 .. 9;
OC2FE at 0 range 10 .. 10;
OC2PE at 0 range 11 .. 11;
OC2M at 0 range 12 .. 14;
OC2CE at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CCMR1_Input_CC1S_Field is HAL.UInt2;
subtype CCMR1_Input_ICPCS_Field is HAL.UInt2;
subtype CCMR1_Input_IC1F_Field is HAL.UInt4;
subtype CCMR1_Input_CC2S_Field is HAL.UInt2;
subtype CCMR1_Input_IC2PCS_Field is HAL.UInt2;
subtype CCMR1_Input_IC2F_Field is HAL.UInt4;
-- capture/compare mode register 1 (input mode)
type CCMR1_Input_Register is record
-- Capture/Compare 1 selection
CC1S : CCMR1_Input_CC1S_Field := 16#0#;
-- Input capture 1 prescaler
ICPCS : CCMR1_Input_ICPCS_Field := 16#0#;
-- Input capture 1 filter
IC1F : CCMR1_Input_IC1F_Field := 16#0#;
-- Capture/Compare 2 selection
CC2S : CCMR1_Input_CC2S_Field := 16#0#;
-- Input capture 2 prescaler
IC2PCS : CCMR1_Input_IC2PCS_Field := 16#0#;
-- Input capture 2 filter
IC2F : CCMR1_Input_IC2F_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCMR1_Input_Register use record
CC1S at 0 range 0 .. 1;
ICPCS at 0 range 2 .. 3;
IC1F at 0 range 4 .. 7;
CC2S at 0 range 8 .. 9;
IC2PCS at 0 range 10 .. 11;
IC2F at 0 range 12 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CCMR2_Output_CC3S_Field is HAL.UInt2;
subtype CCMR2_Output_OC3M_Field is HAL.UInt3;
subtype CCMR2_Output_CC4S_Field is HAL.UInt2;
subtype CCMR2_Output_OC4M_Field is HAL.UInt3;
-- capture/compare mode register 2 (output mode)
type CCMR2_Output_Register is record
-- Capture/Compare 3 selection
CC3S : CCMR2_Output_CC3S_Field := 16#0#;
-- Output compare 3 fast enable
OC3FE : Boolean := False;
-- Output compare 3 preload enable
OC3PE : Boolean := False;
-- Output compare 3 mode
OC3M : CCMR2_Output_OC3M_Field := 16#0#;
-- Output compare 3 clear enable
OC3CE : Boolean := False;
-- Capture/Compare 4 selection
CC4S : CCMR2_Output_CC4S_Field := 16#0#;
-- Output compare 4 fast enable
OC4FE : Boolean := False;
-- Output compare 4 preload enable
OC4PE : Boolean := False;
-- Output compare 4 mode
OC4M : CCMR2_Output_OC4M_Field := 16#0#;
-- Output compare 4 clear enable
OC4CE : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCMR2_Output_Register use record
CC3S at 0 range 0 .. 1;
OC3FE at 0 range 2 .. 2;
OC3PE at 0 range 3 .. 3;
OC3M at 0 range 4 .. 6;
OC3CE at 0 range 7 .. 7;
CC4S at 0 range 8 .. 9;
OC4FE at 0 range 10 .. 10;
OC4PE at 0 range 11 .. 11;
OC4M at 0 range 12 .. 14;
OC4CE at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CCMR2_Input_CC3S_Field is HAL.UInt2;
subtype CCMR2_Input_IC3PSC_Field is HAL.UInt2;
subtype CCMR2_Input_IC3F_Field is HAL.UInt4;
subtype CCMR2_Input_CC4S_Field is HAL.UInt2;
subtype CCMR2_Input_IC4PSC_Field is HAL.UInt2;
subtype CCMR2_Input_IC4F_Field is HAL.UInt4;
-- capture/compare mode register 2 (input mode)
type CCMR2_Input_Register is record
-- Capture/compare 3 selection
CC3S : CCMR2_Input_CC3S_Field := 16#0#;
-- Input capture 3 prescaler
IC3PSC : CCMR2_Input_IC3PSC_Field := 16#0#;
-- Input capture 3 filter
IC3F : CCMR2_Input_IC3F_Field := 16#0#;
-- Capture/Compare 4 selection
CC4S : CCMR2_Input_CC4S_Field := 16#0#;
-- Input capture 4 prescaler
IC4PSC : CCMR2_Input_IC4PSC_Field := 16#0#;
-- Input capture 4 filter
IC4F : CCMR2_Input_IC4F_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCMR2_Input_Register use record
CC3S at 0 range 0 .. 1;
IC3PSC at 0 range 2 .. 3;
IC3F at 0 range 4 .. 7;
CC4S at 0 range 8 .. 9;
IC4PSC at 0 range 10 .. 11;
IC4F at 0 range 12 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- capture/compare enable register
type CCER_Register is record
-- Capture/Compare 1 output enable
CC1E : Boolean := False;
-- Capture/Compare 1 output Polarity
CC1P : Boolean := False;
-- Capture/Compare 1 complementary output enable
CC1NE : Boolean := False;
-- Capture/Compare 1 output Polarity
CC1NP : Boolean := False;
-- Capture/Compare 2 output enable
CC2E : Boolean := False;
-- Capture/Compare 2 output Polarity
CC2P : Boolean := False;
-- Capture/Compare 2 complementary output enable
CC2NE : Boolean := False;
-- Capture/Compare 2 output Polarity
CC2NP : Boolean := False;
-- Capture/Compare 3 output enable
CC3E : Boolean := False;
-- Capture/Compare 3 output Polarity
CC3P : Boolean := False;
-- Capture/Compare 3 complementary output enable
CC3NE : Boolean := False;
-- Capture/Compare 3 output Polarity
CC3NP : Boolean := False;
-- Capture/Compare 4 output enable
CC4E : Boolean := False;
-- Capture/Compare 3 output Polarity
CC4P : Boolean := False;
-- unspecified
Reserved_14_31 : HAL.UInt18 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCER_Register use record
CC1E at 0 range 0 .. 0;
CC1P at 0 range 1 .. 1;
CC1NE at 0 range 2 .. 2;
CC1NP at 0 range 3 .. 3;
CC2E at 0 range 4 .. 4;
CC2P at 0 range 5 .. 5;
CC2NE at 0 range 6 .. 6;
CC2NP at 0 range 7 .. 7;
CC3E at 0 range 8 .. 8;
CC3P at 0 range 9 .. 9;
CC3NE at 0 range 10 .. 10;
CC3NP at 0 range 11 .. 11;
CC4E at 0 range 12 .. 12;
CC4P at 0 range 13 .. 13;
Reserved_14_31 at 0 range 14 .. 31;
end record;
subtype CNT_CNT_Field is HAL.UInt16;
-- counter
type CNT_Register is record
-- counter value
CNT : CNT_CNT_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CNT_Register use record
CNT at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype PSC_PSC_Field is HAL.UInt16;
-- prescaler
type PSC_Register is record
-- Prescaler value
PSC : PSC_PSC_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PSC_Register use record
PSC at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype ARR_ARR_Field is HAL.UInt16;
-- auto-reload register
type ARR_Register is record
-- Auto-reload value
ARR : ARR_ARR_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ARR_Register use record
ARR at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype RCR_REP_Field is HAL.UInt8;
-- repetition counter register
type RCR_Register is record
-- Repetition counter value
REP : RCR_REP_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 RCR_Register use record
REP at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype CCR1_CCR1_Field is HAL.UInt16;
-- capture/compare register 1
type CCR1_Register is record
-- Capture/Compare 1 value
CCR1 : CCR1_CCR1_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCR1_Register use record
CCR1 at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CCR2_CCR2_Field is HAL.UInt16;
-- capture/compare register 2
type CCR2_Register is record
-- Capture/Compare 2 value
CCR2 : CCR2_CCR2_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCR2_Register use record
CCR2 at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CCR3_CCR3_Field is HAL.UInt16;
-- capture/compare register 3
type CCR3_Register is record
-- Capture/Compare value
CCR3 : CCR3_CCR3_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCR3_Register use record
CCR3 at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CCR4_CCR4_Field is HAL.UInt16;
-- capture/compare register 4
type CCR4_Register is record
-- Capture/Compare value
CCR4 : CCR4_CCR4_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCR4_Register use record
CCR4 at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype BDTR_DTG_Field is HAL.UInt8;
subtype BDTR_LOCK_Field is HAL.UInt2;
-- break and dead-time register
type BDTR_Register is record
-- Dead-time generator setup
DTG : BDTR_DTG_Field := 16#0#;
-- Lock configuration
LOCK : BDTR_LOCK_Field := 16#0#;
-- Off-state selection for Idle mode
OSSI : Boolean := False;
-- Off-state selection for Run mode
OSSR : Boolean := False;
-- Break enable
BKE : Boolean := False;
-- Break polarity
BKP : Boolean := False;
-- Automatic output enable
AOE : Boolean := False;
-- Main output enable
MOE : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BDTR_Register use record
DTG at 0 range 0 .. 7;
LOCK at 0 range 8 .. 9;
OSSI at 0 range 10 .. 10;
OSSR at 0 range 11 .. 11;
BKE at 0 range 12 .. 12;
BKP at 0 range 13 .. 13;
AOE at 0 range 14 .. 14;
MOE at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype DCR_DBA_Field is HAL.UInt5;
subtype DCR_DBL_Field is HAL.UInt5;
-- DMA control register
type DCR_Register is record
-- DMA base address
DBA : DCR_DBA_Field := 16#0#;
-- unspecified
Reserved_5_7 : HAL.UInt3 := 16#0#;
-- DMA burst length
DBL : DCR_DBL_Field := 16#0#;
-- unspecified
Reserved_13_31 : HAL.UInt19 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DCR_Register use record
DBA at 0 range 0 .. 4;
Reserved_5_7 at 0 range 5 .. 7;
DBL at 0 range 8 .. 12;
Reserved_13_31 at 0 range 13 .. 31;
end record;
subtype DMAR_DMAB_Field is HAL.UInt16;
-- DMA address for full transfer
type DMAR_Register is record
-- DMA register for burst accesses
DMAB : DMAR_DMAB_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DMAR_Register use record
DMAB at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype OR1_ETR_ADC1_RMP_Field is HAL.UInt2;
subtype OR1_ETR_ADC3_RMP_Field is HAL.UInt2;
-- DMA address for full transfer
type OR1_Register is record
-- External trigger remap on ADC1 analog watchdog
ETR_ADC1_RMP : OR1_ETR_ADC1_RMP_Field := 16#0#;
-- External trigger remap on ADC3 analog watchdog
ETR_ADC3_RMP : OR1_ETR_ADC3_RMP_Field := 16#0#;
-- Input Capture 1 remap
TI1_RMP : Boolean := False;
-- unspecified
Reserved_5_31 : HAL.UInt27 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OR1_Register use record
ETR_ADC1_RMP at 0 range 0 .. 1;
ETR_ADC3_RMP at 0 range 2 .. 3;
TI1_RMP at 0 range 4 .. 4;
Reserved_5_31 at 0 range 5 .. 31;
end record;
subtype CCMR3_Output_OC5M_Field is HAL.UInt3;
subtype CCMR3_Output_OC6M_Field is HAL.UInt3;
subtype CCMR3_Output_OC5M_bit3_Field is HAL.UInt3;
-- capture/compare mode register 2 (output mode)
type CCMR3_Output_Register is record
-- unspecified
Reserved_0_1 : HAL.UInt2 := 16#0#;
-- Output compare 5 fast enable
OC5FE : Boolean := False;
-- Output compare 5 preload enable
OC5PE : Boolean := False;
-- Output compare 5 mode
OC5M : CCMR3_Output_OC5M_Field := 16#0#;
-- Output compare 5 clear enable
OC5CE : Boolean := False;
-- unspecified
Reserved_8_9 : HAL.UInt2 := 16#0#;
-- Output compare 6 fast enable
OC6FE : Boolean := False;
-- Output compare 6 preload enable
OC6PE : Boolean := False;
-- Output compare 6 mode
OC6M : CCMR3_Output_OC6M_Field := 16#0#;
-- Output compare 6 clear enable
OC6CE : Boolean := False;
-- Output Compare 5 mode bit 3
OC5M_bit3 : CCMR3_Output_OC5M_bit3_Field := 16#0#;
-- unspecified
Reserved_19_23 : HAL.UInt5 := 16#0#;
-- Output Compare 6 mode bit 3
OC6M_bit3 : Boolean := False;
-- unspecified
Reserved_25_31 : HAL.UInt7 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCMR3_Output_Register use record
Reserved_0_1 at 0 range 0 .. 1;
OC5FE at 0 range 2 .. 2;
OC5PE at 0 range 3 .. 3;
OC5M at 0 range 4 .. 6;
OC5CE at 0 range 7 .. 7;
Reserved_8_9 at 0 range 8 .. 9;
OC6FE at 0 range 10 .. 10;
OC6PE at 0 range 11 .. 11;
OC6M at 0 range 12 .. 14;
OC6CE at 0 range 15 .. 15;
OC5M_bit3 at 0 range 16 .. 18;
Reserved_19_23 at 0 range 19 .. 23;
OC6M_bit3 at 0 range 24 .. 24;
Reserved_25_31 at 0 range 25 .. 31;
end record;
subtype CCR5_CCR5_Field is HAL.UInt16;
-- CCR5_GC5C array
type CCR5_GC5C_Field_Array is array (1 .. 3) of Boolean
with Component_Size => 1, Size => 3;
-- Type definition for CCR5_GC5C
type CCR5_GC5C_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- GC5C as a value
Val : HAL.UInt3;
when True =>
-- GC5C as an array
Arr : CCR5_GC5C_Field_Array;
end case;
end record
with Unchecked_Union, Size => 3;
for CCR5_GC5C_Field use record
Val at 0 range 0 .. 2;
Arr at 0 range 0 .. 2;
end record;
-- capture/compare register 4
type CCR5_Register is record
-- Capture/Compare value
CCR5 : CCR5_CCR5_Field := 16#0#;
-- unspecified
Reserved_16_28 : HAL.UInt13 := 16#0#;
-- Group Channel 5 and Channel 1
GC5C : CCR5_GC5C_Field := (As_Array => False, Val => 16#0#);
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCR5_Register use record
CCR5 at 0 range 0 .. 15;
Reserved_16_28 at 0 range 16 .. 28;
GC5C at 0 range 29 .. 31;
end record;
subtype CCR6_CCR6_Field is HAL.UInt16;
-- capture/compare register 4
type CCR6_Register is record
-- Capture/Compare value
CCR6 : CCR6_CCR6_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCR6_Register use record
CCR6 at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype OR2_ETRSEL_Field is HAL.UInt3;
-- DMA address for full transfer
type OR2_Register is record
-- BRK BKIN input enable
BKINE : Boolean := True;
-- BRK COMP1 enable
BKCMP1E : Boolean := False;
-- BRK COMP2 enable
BKCMP2E : Boolean := False;
-- unspecified
Reserved_3_7 : HAL.UInt5 := 16#0#;
-- BRK DFSDM_BREAK0 enable
BKDFBK0E : Boolean := False;
-- BRK BKIN input polarity
BKINP : Boolean := False;
-- BRK COMP1 input polarity
BKCMP1P : Boolean := False;
-- BRK COMP2 input polarity
BKCMP2P : Boolean := False;
-- unspecified
Reserved_12_13 : HAL.UInt2 := 16#0#;
-- ETR source selection
ETRSEL : OR2_ETRSEL_Field := 16#0#;
-- unspecified
Reserved_17_31 : HAL.UInt15 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OR2_Register use record
BKINE at 0 range 0 .. 0;
BKCMP1E at 0 range 1 .. 1;
BKCMP2E at 0 range 2 .. 2;
Reserved_3_7 at 0 range 3 .. 7;
BKDFBK0E at 0 range 8 .. 8;
BKINP at 0 range 9 .. 9;
BKCMP1P at 0 range 10 .. 10;
BKCMP2P at 0 range 11 .. 11;
Reserved_12_13 at 0 range 12 .. 13;
ETRSEL at 0 range 14 .. 16;
Reserved_17_31 at 0 range 17 .. 31;
end record;
-- DMA address for full transfer
type OR3_Register is record
-- BRK2 BKIN input enable
BK2INE : Boolean := True;
-- BRK2 COMP1 enable
BK2CMP1E : Boolean := False;
-- BRK2 COMP2 enable
BK2CMP2E : Boolean := False;
-- unspecified
Reserved_3_7 : HAL.UInt5 := 16#0#;
-- BRK2 DFSDM_BREAK0 enable
BK2DFBK0E : Boolean := False;
-- BRK2 BKIN input polarity
BK2INP : Boolean := False;
-- BRK2 COMP1 input polarity
BK2CMP1P : Boolean := False;
-- BRK2 COMP2 input polarity
BK2CMP2P : Boolean := False;
-- unspecified
Reserved_12_31 : HAL.UInt20 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OR3_Register use record
BK2INE at 0 range 0 .. 0;
BK2CMP1E at 0 range 1 .. 1;
BK2CMP2E at 0 range 2 .. 2;
Reserved_3_7 at 0 range 3 .. 7;
BK2DFBK0E at 0 range 8 .. 8;
BK2INP at 0 range 9 .. 9;
BK2CMP1P at 0 range 10 .. 10;
BK2CMP2P at 0 range 11 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
-- control register 2
type CR2_Register_1 is record
-- unspecified
Reserved_0_2 : HAL.UInt3 := 16#0#;
-- Capture/compare DMA selection
CCDS : Boolean := False;
-- Master mode selection
MMS : CR2_MMS_Field := 16#0#;
-- TI1 selection
TI1S : Boolean := False;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR2_Register_1 use record
Reserved_0_2 at 0 range 0 .. 2;
CCDS at 0 range 3 .. 3;
MMS at 0 range 4 .. 6;
TI1S at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- DMA/Interrupt enable register
type DIER_Register_1 is record
-- Update interrupt enable
UIE : Boolean := False;
-- Capture/Compare 1 interrupt enable
CC1IE : Boolean := False;
-- Capture/Compare 2 interrupt enable
CC2IE : Boolean := False;
-- Capture/Compare 3 interrupt enable
CC3IE : Boolean := False;
-- Capture/Compare 4 interrupt enable
CC4IE : Boolean := False;
-- unspecified
Reserved_5_5 : HAL.Bit := 16#0#;
-- Trigger interrupt enable
TIE : Boolean := False;
-- unspecified
Reserved_7_7 : HAL.Bit := 16#0#;
-- Update DMA request enable
UDE : Boolean := False;
-- Capture/Compare 1 DMA request enable
CC1DE : Boolean := False;
-- Capture/Compare 2 DMA request enable
CC2DE : Boolean := False;
-- Capture/Compare 3 DMA request enable
CC3DE : Boolean := False;
-- Capture/Compare 4 DMA request enable
CC4DE : Boolean := False;
-- COM DMA request enable
COMDE : Boolean := False;
-- Trigger DMA request enable
TDE : Boolean := False;
-- unspecified
Reserved_15_31 : HAL.UInt17 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DIER_Register_1 use record
UIE at 0 range 0 .. 0;
CC1IE at 0 range 1 .. 1;
CC2IE at 0 range 2 .. 2;
CC3IE at 0 range 3 .. 3;
CC4IE at 0 range 4 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
TIE at 0 range 6 .. 6;
Reserved_7_7 at 0 range 7 .. 7;
UDE at 0 range 8 .. 8;
CC1DE at 0 range 9 .. 9;
CC2DE at 0 range 10 .. 10;
CC3DE at 0 range 11 .. 11;
CC4DE at 0 range 12 .. 12;
COMDE at 0 range 13 .. 13;
TDE at 0 range 14 .. 14;
Reserved_15_31 at 0 range 15 .. 31;
end record;
-- status register
type SR_Register_1 is record
-- Update interrupt flag
UIF : Boolean := False;
-- Capture/compare 1 interrupt flag
CC1IF : Boolean := False;
-- Capture/Compare 2 interrupt flag
CC2IF : Boolean := False;
-- Capture/Compare 3 interrupt flag
CC3IF : Boolean := False;
-- Capture/Compare 4 interrupt flag
CC4IF : Boolean := False;
-- unspecified
Reserved_5_5 : HAL.Bit := 16#0#;
-- Trigger interrupt flag
TIF : Boolean := False;
-- unspecified
Reserved_7_8 : HAL.UInt2 := 16#0#;
-- Capture/Compare 1 overcapture flag
CC1OF : Boolean := False;
-- Capture/compare 2 overcapture flag
CC2OF : Boolean := False;
-- Capture/Compare 3 overcapture flag
CC3OF : Boolean := False;
-- Capture/Compare 4 overcapture flag
CC4OF : Boolean := False;
-- unspecified
Reserved_13_31 : HAL.UInt19 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register_1 use record
UIF at 0 range 0 .. 0;
CC1IF at 0 range 1 .. 1;
CC2IF at 0 range 2 .. 2;
CC3IF at 0 range 3 .. 3;
CC4IF at 0 range 4 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
TIF at 0 range 6 .. 6;
Reserved_7_8 at 0 range 7 .. 8;
CC1OF at 0 range 9 .. 9;
CC2OF at 0 range 10 .. 10;
CC3OF at 0 range 11 .. 11;
CC4OF at 0 range 12 .. 12;
Reserved_13_31 at 0 range 13 .. 31;
end record;
-- event generation register
type EGR_Register_1 is record
-- Write-only. Update generation
UG : Boolean := False;
-- Write-only. Capture/compare 1 generation
CC1G : Boolean := False;
-- Write-only. Capture/compare 2 generation
CC2G : Boolean := False;
-- Write-only. Capture/compare 3 generation
CC3G : Boolean := False;
-- Write-only. Capture/compare 4 generation
CC4G : Boolean := False;
-- unspecified
Reserved_5_5 : HAL.Bit := 16#0#;
-- Write-only. Trigger generation
TG : Boolean := False;
-- unspecified
Reserved_7_31 : HAL.UInt25 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EGR_Register_1 use record
UG at 0 range 0 .. 0;
CC1G at 0 range 1 .. 1;
CC2G at 0 range 2 .. 2;
CC3G at 0 range 3 .. 3;
CC4G at 0 range 4 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
TG at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
subtype CCMR1_Input_IC1PSC_Field is HAL.UInt2;
subtype CCMR1_Input_IC2PSC_Field is HAL.UInt2;
-- capture/compare mode register 1 (input mode)
type CCMR1_Input_Register_1 is record
-- Capture/Compare 1 selection
CC1S : CCMR1_Input_CC1S_Field := 16#0#;
-- Input capture 1 prescaler
IC1PSC : CCMR1_Input_IC1PSC_Field := 16#0#;
-- Input capture 1 filter
IC1F : CCMR1_Input_IC1F_Field := 16#0#;
-- Capture/compare 2 selection
CC2S : CCMR1_Input_CC2S_Field := 16#0#;
-- Input capture 2 prescaler
IC2PSC : CCMR1_Input_IC2PSC_Field := 16#0#;
-- Input capture 2 filter
IC2F : CCMR1_Input_IC2F_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCMR1_Input_Register_1 use record
CC1S at 0 range 0 .. 1;
IC1PSC at 0 range 2 .. 3;
IC1F at 0 range 4 .. 7;
CC2S at 0 range 8 .. 9;
IC2PSC at 0 range 10 .. 11;
IC2F at 0 range 12 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- capture/compare enable register
type CCER_Register_1 is record
-- Capture/Compare 1 output enable
CC1E : Boolean := False;
-- Capture/Compare 1 output Polarity
CC1P : Boolean := False;
-- unspecified
Reserved_2_2 : HAL.Bit := 16#0#;
-- Capture/Compare 1 output Polarity
CC1NP : Boolean := False;
-- Capture/Compare 2 output enable
CC2E : Boolean := False;
-- Capture/Compare 2 output Polarity
CC2P : Boolean := False;
-- unspecified
Reserved_6_6 : HAL.Bit := 16#0#;
-- Capture/Compare 2 output Polarity
CC2NP : Boolean := False;
-- Capture/Compare 3 output enable
CC3E : Boolean := False;
-- Capture/Compare 3 output Polarity
CC3P : Boolean := False;
-- unspecified
Reserved_10_10 : HAL.Bit := 16#0#;
-- Capture/Compare 3 output Polarity
CC3NP : Boolean := False;
-- Capture/Compare 4 output enable
CC4E : Boolean := False;
-- Capture/Compare 3 output Polarity
CC4P : Boolean := False;
-- unspecified
Reserved_14_14 : HAL.Bit := 16#0#;
-- Capture/Compare 4 output Polarity
CC4NP : 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 CCER_Register_1 use record
CC1E at 0 range 0 .. 0;
CC1P at 0 range 1 .. 1;
Reserved_2_2 at 0 range 2 .. 2;
CC1NP at 0 range 3 .. 3;
CC2E at 0 range 4 .. 4;
CC2P at 0 range 5 .. 5;
Reserved_6_6 at 0 range 6 .. 6;
CC2NP at 0 range 7 .. 7;
CC3E at 0 range 8 .. 8;
CC3P at 0 range 9 .. 9;
Reserved_10_10 at 0 range 10 .. 10;
CC3NP at 0 range 11 .. 11;
CC4E at 0 range 12 .. 12;
CC4P at 0 range 13 .. 13;
Reserved_14_14 at 0 range 14 .. 14;
CC4NP at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CNT_CNT_L_Field is HAL.UInt16;
subtype CNT_CNT_H_Field is HAL.UInt16;
-- counter
type CNT_Register_1 is record
-- Low counter value
CNT_L : CNT_CNT_L_Field := 16#0#;
-- High counter value (TIM2 only)
CNT_H : CNT_CNT_H_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CNT_Register_1 use record
CNT_L at 0 range 0 .. 15;
CNT_H at 0 range 16 .. 31;
end record;
subtype ARR_ARR_L_Field is HAL.UInt16;
subtype ARR_ARR_H_Field is HAL.UInt16;
-- auto-reload register
type ARR_Register_1 is record
-- Low Auto-reload value
ARR_L : ARR_ARR_L_Field := 16#0#;
-- High Auto-reload value (TIM2 only)
ARR_H : ARR_ARR_H_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ARR_Register_1 use record
ARR_L at 0 range 0 .. 15;
ARR_H at 0 range 16 .. 31;
end record;
subtype CCR1_CCR1_L_Field is HAL.UInt16;
subtype CCR1_CCR1_H_Field is HAL.UInt16;
-- capture/compare register 1
type CCR1_Register_1 is record
-- Low Capture/Compare 1 value
CCR1_L : CCR1_CCR1_L_Field := 16#0#;
-- High Capture/Compare 1 value (TIM2 only)
CCR1_H : CCR1_CCR1_H_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCR1_Register_1 use record
CCR1_L at 0 range 0 .. 15;
CCR1_H at 0 range 16 .. 31;
end record;
subtype CCR2_CCR2_L_Field is HAL.UInt16;
subtype CCR2_CCR2_H_Field is HAL.UInt16;
-- capture/compare register 2
type CCR2_Register_1 is record
-- Low Capture/Compare 2 value
CCR2_L : CCR2_CCR2_L_Field := 16#0#;
-- High Capture/Compare 2 value (TIM2 only)
CCR2_H : CCR2_CCR2_H_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCR2_Register_1 use record
CCR2_L at 0 range 0 .. 15;
CCR2_H at 0 range 16 .. 31;
end record;
subtype CCR3_CCR3_L_Field is HAL.UInt16;
subtype CCR3_CCR3_H_Field is HAL.UInt16;
-- capture/compare register 3
type CCR3_Register_1 is record
-- Low Capture/Compare value
CCR3_L : CCR3_CCR3_L_Field := 16#0#;
-- High Capture/Compare value (TIM2 only)
CCR3_H : CCR3_CCR3_H_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCR3_Register_1 use record
CCR3_L at 0 range 0 .. 15;
CCR3_H at 0 range 16 .. 31;
end record;
subtype CCR4_CCR4_L_Field is HAL.UInt16;
subtype CCR4_CCR4_H_Field is HAL.UInt16;
-- capture/compare register 4
type CCR4_Register_1 is record
-- Low Capture/Compare value
CCR4_L : CCR4_CCR4_L_Field := 16#0#;
-- High Capture/Compare value (TIM2 only)
CCR4_H : CCR4_CCR4_H_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCR4_Register_1 use record
CCR4_L at 0 range 0 .. 15;
CCR4_H at 0 range 16 .. 31;
end record;
subtype OR_ETR_RMP_Field is HAL.UInt3;
subtype OR_TI4_RMP_Field is HAL.UInt2;
-- TIM2 option register
type OR_Register is record
-- Timer2 ETR remap
ETR_RMP : OR_ETR_RMP_Field := 16#0#;
-- Internal trigger
TI4_RMP : OR_TI4_RMP_Field := 16#0#;
-- unspecified
Reserved_5_31 : HAL.UInt27 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OR_Register use record
ETR_RMP at 0 range 0 .. 2;
TI4_RMP at 0 range 3 .. 4;
Reserved_5_31 at 0 range 5 .. 31;
end record;
-- control register 1
type CR1_Register_1 is record
-- Counter enable
CEN : Boolean := False;
-- Update disable
UDIS : Boolean := False;
-- Update request source
URS : Boolean := False;
-- One-pulse mode
OPM : Boolean := False;
-- unspecified
Reserved_4_6 : HAL.UInt3 := 16#0#;
-- Auto-reload preload enable
ARPE : 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 CR1_Register_1 use record
CEN at 0 range 0 .. 0;
UDIS at 0 range 1 .. 1;
URS at 0 range 2 .. 2;
OPM at 0 range 3 .. 3;
Reserved_4_6 at 0 range 4 .. 6;
ARPE at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- control register 2
type CR2_Register_2 is record
-- unspecified
Reserved_0_3 : HAL.UInt4 := 16#0#;
-- Master mode selection
MMS : CR2_MMS_Field := 16#0#;
-- unspecified
Reserved_7_31 : HAL.UInt25 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR2_Register_2 use record
Reserved_0_3 at 0 range 0 .. 3;
MMS at 0 range 4 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
-- DMA/Interrupt enable register
type DIER_Register_2 is record
-- Update interrupt enable
UIE : Boolean := False;
-- unspecified
Reserved_1_7 : HAL.UInt7 := 16#0#;
-- Update DMA request enable
UDE : Boolean := False;
-- unspecified
Reserved_9_31 : HAL.UInt23 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DIER_Register_2 use record
UIE at 0 range 0 .. 0;
Reserved_1_7 at 0 range 1 .. 7;
UDE at 0 range 8 .. 8;
Reserved_9_31 at 0 range 9 .. 31;
end record;
-- status register
type SR_Register_2 is record
-- Update interrupt flag
UIF : Boolean := False;
-- unspecified
Reserved_1_31 : HAL.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register_2 use record
UIF at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
-- event generation register
type EGR_Register_2 is record
-- Write-only. Update generation
UG : Boolean := False;
-- unspecified
Reserved_1_31 : HAL.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EGR_Register_2 use record
UG at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
subtype OR1_ETR_ADC2_RMP_Field is HAL.UInt2;
-- DMA address for full transfer
type OR1_Register_1 is record
-- External trigger remap on ADC2 analog watchdog
ETR_ADC2_RMP : OR1_ETR_ADC2_RMP_Field := 16#0#;
-- External trigger remap on ADC3 analog watchdog
ETR_ADC3_RMP : OR1_ETR_ADC3_RMP_Field := 16#0#;
-- Input Capture 1 remap
TI1_RMP : Boolean := False;
-- unspecified
Reserved_5_31 : HAL.UInt27 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OR1_Register_1 use record
ETR_ADC2_RMP at 0 range 0 .. 1;
ETR_ADC3_RMP at 0 range 2 .. 3;
TI1_RMP at 0 range 4 .. 4;
Reserved_5_31 at 0 range 5 .. 31;
end record;
-- DMA address for full transfer
type OR2_Register_1 is record
-- BRK BKIN input enable
BKINE : Boolean := True;
-- BRK COMP1 enable
BKCMP1E : Boolean := False;
-- BRK COMP2 enable
BKCMP2E : Boolean := False;
-- unspecified
Reserved_3_7 : HAL.UInt5 := 16#0#;
-- BRK DFSDM_BREAK2 enable
BKDFBK2E : Boolean := False;
-- BRK BKIN input polarity
BKINP : Boolean := False;
-- BRK COMP1 input polarity
BKCMP1P : Boolean := False;
-- BRK COMP2 input polarity
BKCMP2P : Boolean := False;
-- unspecified
Reserved_12_13 : HAL.UInt2 := 16#0#;
-- ETR source selection
ETRSEL : OR2_ETRSEL_Field := 16#0#;
-- unspecified
Reserved_17_31 : HAL.UInt15 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OR2_Register_1 use record
BKINE at 0 range 0 .. 0;
BKCMP1E at 0 range 1 .. 1;
BKCMP2E at 0 range 2 .. 2;
Reserved_3_7 at 0 range 3 .. 7;
BKDFBK2E at 0 range 8 .. 8;
BKINP at 0 range 9 .. 9;
BKCMP1P at 0 range 10 .. 10;
BKCMP2P at 0 range 11 .. 11;
Reserved_12_13 at 0 range 12 .. 13;
ETRSEL at 0 range 14 .. 16;
Reserved_17_31 at 0 range 17 .. 31;
end record;
-- DMA address for full transfer
type OR3_Register_1 is record
-- BRK2 BKIN input enable
BK2INE : Boolean := True;
-- BRK2 COMP1 enable
BK2CMP1E : Boolean := False;
-- BRK2 COMP2 enable
BK2CMP2E : Boolean := False;
-- unspecified
Reserved_3_7 : HAL.UInt5 := 16#0#;
-- BRK2 DFSDM_BREAK3 enable
BK2DFBK3E : Boolean := False;
-- BRK2 BKIN input polarity
BK2INP : Boolean := False;
-- BRK2 COMP1 input polarity
BK2CMP1P : Boolean := False;
-- BRK2 COMP2 input polarity
BK2CMP2P : Boolean := False;
-- unspecified
Reserved_12_31 : HAL.UInt20 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OR3_Register_1 use record
BK2INE at 0 range 0 .. 0;
BK2CMP1E at 0 range 1 .. 1;
BK2CMP2E at 0 range 2 .. 2;
Reserved_3_7 at 0 range 3 .. 7;
BK2DFBK3E at 0 range 8 .. 8;
BK2INP at 0 range 9 .. 9;
BK2CMP1P at 0 range 10 .. 10;
BK2CMP2P at 0 range 11 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
-- control register 1
type CR1_Register_2 is record
-- Counter enable
CEN : Boolean := False;
-- Update disable
UDIS : Boolean := False;
-- Update request source
URS : Boolean := False;
-- One-pulse mode
OPM : Boolean := False;
-- unspecified
Reserved_4_6 : HAL.UInt3 := 16#0#;
-- Auto-reload preload enable
ARPE : Boolean := False;
-- Clock division
CKD : CR1_CKD_Field := 16#0#;
-- unspecified
Reserved_10_10 : HAL.Bit := 16#0#;
-- UIF status bit remapping
UIFREMAP : Boolean := False;
-- unspecified
Reserved_12_31 : HAL.UInt20 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR1_Register_2 use record
CEN at 0 range 0 .. 0;
UDIS at 0 range 1 .. 1;
URS at 0 range 2 .. 2;
OPM at 0 range 3 .. 3;
Reserved_4_6 at 0 range 4 .. 6;
ARPE at 0 range 7 .. 7;
CKD at 0 range 8 .. 9;
Reserved_10_10 at 0 range 10 .. 10;
UIFREMAP at 0 range 11 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
-- control register 2
type CR2_Register_3 is record
-- Capture/compare preloaded control
CCPC : Boolean := False;
-- unspecified
Reserved_1_1 : HAL.Bit := 16#0#;
-- Capture/compare control update selection
CCUS : Boolean := False;
-- Capture/compare DMA selection
CCDS : Boolean := False;
-- unspecified
Reserved_4_7 : HAL.UInt4 := 16#0#;
-- Output Idle state 1
OIS1 : Boolean := False;
-- Output Idle state 1
OIS1N : Boolean := False;
-- unspecified
Reserved_10_31 : HAL.UInt22 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR2_Register_3 use record
CCPC at 0 range 0 .. 0;
Reserved_1_1 at 0 range 1 .. 1;
CCUS at 0 range 2 .. 2;
CCDS at 0 range 3 .. 3;
Reserved_4_7 at 0 range 4 .. 7;
OIS1 at 0 range 8 .. 8;
OIS1N at 0 range 9 .. 9;
Reserved_10_31 at 0 range 10 .. 31;
end record;
-- DMA/Interrupt enable register
type DIER_Register_3 is record
-- Update interrupt enable
UIE : Boolean := False;
-- Capture/Compare 1 interrupt enable
CC1IE : Boolean := False;
-- unspecified
Reserved_2_4 : HAL.UInt3 := 16#0#;
-- COM interrupt enable
COMIE : Boolean := False;
-- Trigger interrupt enable
TIE : Boolean := False;
-- Break interrupt enable
BIE : Boolean := False;
-- Update DMA request enable
UDE : Boolean := False;
-- Capture/Compare 1 DMA request enable
CC1DE : Boolean := False;
-- unspecified
Reserved_10_12 : HAL.UInt3 := 16#0#;
-- COM DMA request enable
COMDE : Boolean := False;
-- Trigger DMA request enable
TDE : Boolean := False;
-- unspecified
Reserved_15_31 : HAL.UInt17 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DIER_Register_3 use record
UIE at 0 range 0 .. 0;
CC1IE at 0 range 1 .. 1;
Reserved_2_4 at 0 range 2 .. 4;
COMIE at 0 range 5 .. 5;
TIE at 0 range 6 .. 6;
BIE at 0 range 7 .. 7;
UDE at 0 range 8 .. 8;
CC1DE at 0 range 9 .. 9;
Reserved_10_12 at 0 range 10 .. 12;
COMDE at 0 range 13 .. 13;
TDE at 0 range 14 .. 14;
Reserved_15_31 at 0 range 15 .. 31;
end record;
-- status register
type SR_Register_3 is record
-- Update interrupt flag
UIF : Boolean := False;
-- Capture/compare 1 interrupt flag
CC1IF : Boolean := False;
-- unspecified
Reserved_2_4 : HAL.UInt3 := 16#0#;
-- COM interrupt flag
COMIF : Boolean := False;
-- Trigger interrupt flag
TIF : Boolean := False;
-- Break interrupt flag
BIF : Boolean := False;
-- unspecified
Reserved_8_8 : HAL.Bit := 16#0#;
-- Capture/Compare 1 overcapture flag
CC1OF : Boolean := False;
-- unspecified
Reserved_10_31 : HAL.UInt22 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register_3 use record
UIF at 0 range 0 .. 0;
CC1IF at 0 range 1 .. 1;
Reserved_2_4 at 0 range 2 .. 4;
COMIF at 0 range 5 .. 5;
TIF at 0 range 6 .. 6;
BIF at 0 range 7 .. 7;
Reserved_8_8 at 0 range 8 .. 8;
CC1OF at 0 range 9 .. 9;
Reserved_10_31 at 0 range 10 .. 31;
end record;
-- event generation register
type EGR_Register_3 is record
-- Write-only. Update generation
UG : Boolean := False;
-- Write-only. Capture/compare 1 generation
CC1G : Boolean := False;
-- unspecified
Reserved_2_4 : HAL.UInt3 := 16#0#;
-- Write-only. Capture/Compare control update generation
COMG : Boolean := False;
-- Write-only. Trigger generation
TG : Boolean := False;
-- Write-only. Break generation
BG : Boolean := False;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EGR_Register_3 use record
UG at 0 range 0 .. 0;
CC1G at 0 range 1 .. 1;
Reserved_2_4 at 0 range 2 .. 4;
COMG at 0 range 5 .. 5;
TG at 0 range 6 .. 6;
BG at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- capture/compare mode register (output mode)
type CCMR1_Output_Register_1 is record
-- Capture/Compare 1 selection
CC1S : CCMR1_Output_CC1S_Field := 16#0#;
-- Output Compare 1 fast enable
OC1FE : Boolean := False;
-- Output Compare 1 preload enable
OC1PE : Boolean := False;
-- Output Compare 1 mode
OC1M : CCMR1_Output_OC1M_Field := 16#0#;
-- unspecified
Reserved_7_15 : HAL.UInt9 := 16#0#;
-- Output Compare 1 mode
OC1M_2 : 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 CCMR1_Output_Register_1 use record
CC1S at 0 range 0 .. 1;
OC1FE at 0 range 2 .. 2;
OC1PE at 0 range 3 .. 3;
OC1M at 0 range 4 .. 6;
Reserved_7_15 at 0 range 7 .. 15;
OC1M_2 at 0 range 16 .. 16;
Reserved_17_31 at 0 range 17 .. 31;
end record;
-- capture/compare mode register 1 (input mode)
type CCMR1_Input_Register_2 is record
-- Capture/Compare 1 selection
CC1S : CCMR1_Input_CC1S_Field := 16#0#;
-- Input capture 1 prescaler
IC1PSC : CCMR1_Input_IC1PSC_Field := 16#0#;
-- Input capture 1 filter
IC1F : CCMR1_Input_IC1F_Field := 16#0#;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCMR1_Input_Register_2 use record
CC1S at 0 range 0 .. 1;
IC1PSC at 0 range 2 .. 3;
IC1F at 0 range 4 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- capture/compare enable register
type CCER_Register_2 is record
-- Capture/Compare 1 output enable
CC1E : Boolean := False;
-- Capture/Compare 1 output Polarity
CC1P : Boolean := False;
-- Capture/Compare 1 complementary output enable
CC1NE : Boolean := False;
-- Capture/Compare 1 output Polarity
CC1NP : Boolean := False;
-- unspecified
Reserved_4_31 : HAL.UInt28 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CCER_Register_2 use record
CC1E at 0 range 0 .. 0;
CC1P at 0 range 1 .. 1;
CC1NE at 0 range 2 .. 2;
CC1NP at 0 range 3 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
-- counter
type CNT_Register_2 is record
-- counter value
CNT : CNT_CNT_Field := 16#0#;
-- unspecified
Reserved_16_30 : HAL.UInt15 := 16#0#;
-- Read-only. UIF Copy
UIFCPY : Boolean := False;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CNT_Register_2 use record
CNT at 0 range 0 .. 15;
Reserved_16_30 at 0 range 16 .. 30;
UIFCPY at 0 range 31 .. 31;
end record;
subtype BDTR_BKF_Field is HAL.UInt4;
-- break and dead-time register
type BDTR_Register_1 is record
-- Dead-time generator setup
DTG : BDTR_DTG_Field := 16#0#;
-- Lock configuration
LOCK : BDTR_LOCK_Field := 16#0#;
-- Off-state selection for Idle mode
OSSI : Boolean := False;
-- Off-state selection for Run mode
OSSR : Boolean := False;
-- Break enable
BKE : Boolean := False;
-- Break polarity
BKP : Boolean := False;
-- Automatic output enable
AOE : Boolean := False;
-- Main output enable
MOE : Boolean := False;
-- Break filter
BKF : BDTR_BKF_Field := 16#0#;
-- unspecified
Reserved_20_31 : HAL.UInt12 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BDTR_Register_1 use record
DTG at 0 range 0 .. 7;
LOCK at 0 range 8 .. 9;
OSSI at 0 range 10 .. 10;
OSSR at 0 range 11 .. 11;
BKE at 0 range 12 .. 12;
BKP at 0 range 13 .. 13;
AOE at 0 range 14 .. 14;
MOE at 0 range 15 .. 15;
BKF at 0 range 16 .. 19;
Reserved_20_31 at 0 range 20 .. 31;
end record;
subtype OR1_TI1_RMP_Field is HAL.UInt2;
-- TIM16 option register 1
type OR1_Register_2 is record
-- Input capture 1 remap
TI1_RMP : OR1_TI1_RMP_Field := 16#0#;
-- unspecified
Reserved_2_31 : HAL.UInt30 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OR1_Register_2 use record
TI1_RMP at 0 range 0 .. 1;
Reserved_2_31 at 0 range 2 .. 31;
end record;
-- TIM17 option register 1
type OR2_Register_2 is record
-- BRK BKIN input enable
BKINE : Boolean := False;
-- BRK COMP1 enable
BKCMP1E : Boolean := False;
-- BRK COMP2 enable
BKCMP2E : Boolean := False;
-- unspecified
Reserved_3_7 : HAL.UInt5 := 16#0#;
-- BRK DFSDM_BREAK1 enable
BKDFBK1E : Boolean := False;
-- BRK BKIN input polarity
BKINP : Boolean := False;
-- BRK COMP1 input polarity
BKCMP1P : Boolean := False;
-- BRK COMP2 input polarit
BKCMP2P : Boolean := False;
-- unspecified
Reserved_12_31 : HAL.UInt20 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OR2_Register_2 use record
BKINE at 0 range 0 .. 0;
BKCMP1E at 0 range 1 .. 1;
BKCMP2E at 0 range 2 .. 2;
Reserved_3_7 at 0 range 3 .. 7;
BKDFBK1E at 0 range 8 .. 8;
BKINP at 0 range 9 .. 9;
BKCMP1P at 0 range 10 .. 10;
BKCMP2P at 0 range 11 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
type TIM1_Disc is
(
Output,
Input);
-- Advanced-timers
type TIM1_Peripheral
(Discriminent : TIM1_Disc := Output)
is record
-- control register 1
CR1 : aliased CR1_Register;
-- control register 2
CR2 : aliased CR2_Register;
-- slave mode control register
SMCR : aliased SMCR_Register;
-- DMA/Interrupt enable register
DIER : aliased DIER_Register;
-- status register
SR : aliased SR_Register;
-- event generation register
EGR : aliased EGR_Register;
-- capture/compare enable register
CCER : aliased CCER_Register;
-- counter
CNT : aliased CNT_Register;
-- prescaler
PSC : aliased PSC_Register;
-- auto-reload register
ARR : aliased ARR_Register;
-- repetition counter register
RCR : aliased RCR_Register;
-- capture/compare register 1
CCR1 : aliased CCR1_Register;
-- capture/compare register 2
CCR2 : aliased CCR2_Register;
-- capture/compare register 3
CCR3 : aliased CCR3_Register;
-- capture/compare register 4
CCR4 : aliased CCR4_Register;
-- break and dead-time register
BDTR : aliased BDTR_Register;
-- DMA control register
DCR : aliased DCR_Register;
-- DMA address for full transfer
DMAR : aliased DMAR_Register;
-- DMA address for full transfer
OR1 : aliased OR1_Register;
-- capture/compare mode register 2 (output mode)
CCMR3_Output : aliased CCMR3_Output_Register;
-- capture/compare register 4
CCR5 : aliased CCR5_Register;
-- capture/compare register 4
CCR6 : aliased CCR6_Register;
-- DMA address for full transfer
OR2 : aliased OR2_Register;
-- DMA address for full transfer
OR3 : aliased OR3_Register;
case Discriminent is
when Output =>
-- capture/compare mode register 1 (output mode)
CCMR1_Output : aliased CCMR1_Output_Register;
-- capture/compare mode register 2 (output mode)
CCMR2_Output : aliased CCMR2_Output_Register;
when Input =>
-- capture/compare mode register 1 (input mode)
CCMR1_Input : aliased CCMR1_Input_Register;
-- capture/compare mode register 2 (input mode)
CCMR2_Input : aliased CCMR2_Input_Register;
end case;
end record
with Unchecked_Union, Volatile;
for TIM1_Peripheral use record
CR1 at 16#0# range 0 .. 31;
CR2 at 16#4# range 0 .. 31;
SMCR at 16#8# range 0 .. 31;
DIER at 16#C# range 0 .. 31;
SR at 16#10# range 0 .. 31;
EGR at 16#14# range 0 .. 31;
CCER at 16#20# range 0 .. 31;
CNT at 16#24# range 0 .. 31;
PSC at 16#28# range 0 .. 31;
ARR at 16#2C# range 0 .. 31;
RCR at 16#30# range 0 .. 31;
CCR1 at 16#34# range 0 .. 31;
CCR2 at 16#38# range 0 .. 31;
CCR3 at 16#3C# range 0 .. 31;
CCR4 at 16#40# range 0 .. 31;
BDTR at 16#44# range 0 .. 31;
DCR at 16#48# range 0 .. 31;
DMAR at 16#4C# range 0 .. 31;
OR1 at 16#50# range 0 .. 31;
CCMR3_Output at 16#54# range 0 .. 31;
CCR5 at 16#58# range 0 .. 31;
CCR6 at 16#5C# range 0 .. 31;
OR2 at 16#60# range 0 .. 31;
OR3 at 16#64# range 0 .. 31;
CCMR1_Output at 16#18# range 0 .. 31;
CCMR2_Output at 16#1C# range 0 .. 31;
CCMR1_Input at 16#18# range 0 .. 31;
CCMR2_Input at 16#1C# range 0 .. 31;
end record;
-- Advanced-timers
TIM1_Periph : aliased TIM1_Peripheral
with Import, Address => System'To_Address (16#40012C00#);
type TIM2_Disc is
(
Output,
Input);
-- General-purpose-timers
type TIM2_Peripheral
(Discriminent : TIM2_Disc := Output)
is record
-- control register 1
CR1 : aliased CR1_Register;
-- control register 2
CR2 : aliased CR2_Register_1;
-- slave mode control register
SMCR : aliased SMCR_Register;
-- DMA/Interrupt enable register
DIER : aliased DIER_Register_1;
-- status register
SR : aliased SR_Register_1;
-- event generation register
EGR : aliased EGR_Register_1;
-- capture/compare enable register
CCER : aliased CCER_Register_1;
-- counter
CNT : aliased CNT_Register_1;
-- prescaler
PSC : aliased PSC_Register;
-- auto-reload register
ARR : aliased ARR_Register_1;
-- capture/compare register 1
CCR1 : aliased CCR1_Register_1;
-- capture/compare register 2
CCR2 : aliased CCR2_Register_1;
-- capture/compare register 3
CCR3 : aliased CCR3_Register_1;
-- capture/compare register 4
CCR4 : aliased CCR4_Register_1;
-- DMA control register
DCR : aliased DCR_Register;
-- DMA address for full transfer
DMAR : aliased DMAR_Register;
-- TIM2 option register
OR_k : aliased OR_Register;
case Discriminent is
when Output =>
-- capture/compare mode register 1 (output mode)
CCMR1_Output : aliased CCMR1_Output_Register;
-- capture/compare mode register 2 (output mode)
CCMR2_Output : aliased CCMR2_Output_Register;
when Input =>
-- capture/compare mode register 1 (input mode)
CCMR1_Input : aliased CCMR1_Input_Register_1;
-- capture/compare mode register 2 (input mode)
CCMR2_Input : aliased CCMR2_Input_Register;
end case;
end record
with Unchecked_Union, Volatile;
for TIM2_Peripheral use record
CR1 at 16#0# range 0 .. 31;
CR2 at 16#4# range 0 .. 31;
SMCR at 16#8# range 0 .. 31;
DIER at 16#C# range 0 .. 31;
SR at 16#10# range 0 .. 31;
EGR at 16#14# range 0 .. 31;
CCER at 16#20# range 0 .. 31;
CNT at 16#24# range 0 .. 31;
PSC at 16#28# range 0 .. 31;
ARR at 16#2C# range 0 .. 31;
CCR1 at 16#34# range 0 .. 31;
CCR2 at 16#38# range 0 .. 31;
CCR3 at 16#3C# range 0 .. 31;
CCR4 at 16#40# range 0 .. 31;
DCR at 16#48# range 0 .. 31;
DMAR at 16#4C# range 0 .. 31;
OR_k at 16#50# range 0 .. 31;
CCMR1_Output at 16#18# range 0 .. 31;
CCMR2_Output at 16#1C# range 0 .. 31;
CCMR1_Input at 16#18# range 0 .. 31;
CCMR2_Input at 16#1C# range 0 .. 31;
end record;
-- General-purpose-timers
TIM2_Periph : aliased TIM2_Peripheral
with Import, Address => System'To_Address (16#40000000#);
-- General-purpose-timers
TIM3_Periph : aliased TIM2_Peripheral
with Import, Address => System'To_Address (16#40000400#);
-- General-purpose-timers
TIM4_Periph : aliased TIM2_Peripheral
with Import, Address => System'To_Address (16#40000800#);
-- General-purpose-timers
TIM5_Periph : aliased TIM2_Peripheral
with Import, Address => System'To_Address (16#40000C00#);
-- Basic-timers
type TIM6_Peripheral is record
-- control register 1
CR1 : aliased CR1_Register_1;
-- control register 2
CR2 : aliased CR2_Register_2;
-- DMA/Interrupt enable register
DIER : aliased DIER_Register_2;
-- status register
SR : aliased SR_Register_2;
-- event generation register
EGR : aliased EGR_Register_2;
-- counter
CNT : aliased CNT_Register;
-- prescaler
PSC : aliased PSC_Register;
-- auto-reload register
ARR : aliased ARR_Register;
end record
with Volatile;
for TIM6_Peripheral use record
CR1 at 16#0# range 0 .. 31;
CR2 at 16#4# range 0 .. 31;
DIER at 16#C# range 0 .. 31;
SR at 16#10# range 0 .. 31;
EGR at 16#14# range 0 .. 31;
CNT at 16#24# range 0 .. 31;
PSC at 16#28# range 0 .. 31;
ARR at 16#2C# range 0 .. 31;
end record;
-- Basic-timers
TIM6_Periph : aliased TIM6_Peripheral
with Import, Address => System'To_Address (16#40001000#);
-- Basic-timers
TIM7_Periph : aliased TIM6_Peripheral
with Import, Address => System'To_Address (16#40001400#);
type TIM8_Disc is
(
Output,
Input);
-- Advanced-timers
type TIM8_Peripheral
(Discriminent : TIM8_Disc := Output)
is record
-- control register 1
CR1 : aliased CR1_Register;
-- control register 2
CR2 : aliased CR2_Register;
-- slave mode control register
SMCR : aliased SMCR_Register;
-- DMA/Interrupt enable register
DIER : aliased DIER_Register;
-- status register
SR : aliased SR_Register;
-- event generation register
EGR : aliased EGR_Register;
-- capture/compare enable register
CCER : aliased CCER_Register;
-- counter
CNT : aliased CNT_Register;
-- prescaler
PSC : aliased PSC_Register;
-- auto-reload register
ARR : aliased ARR_Register;
-- repetition counter register
RCR : aliased RCR_Register;
-- capture/compare register 1
CCR1 : aliased CCR1_Register;
-- capture/compare register 2
CCR2 : aliased CCR2_Register;
-- capture/compare register 3
CCR3 : aliased CCR3_Register;
-- capture/compare register 4
CCR4 : aliased CCR4_Register;
-- break and dead-time register
BDTR : aliased BDTR_Register;
-- DMA control register
DCR : aliased DCR_Register;
-- DMA address for full transfer
DMAR : aliased DMAR_Register;
-- DMA address for full transfer
OR1 : aliased OR1_Register_1;
-- capture/compare mode register 2 (output mode)
CCMR3_Output : aliased CCMR3_Output_Register;
-- capture/compare register 4
CCR5 : aliased CCR5_Register;
-- capture/compare register 4
CCR6 : aliased CCR6_Register;
-- DMA address for full transfer
OR2 : aliased OR2_Register_1;
-- DMA address for full transfer
OR3 : aliased OR3_Register_1;
case Discriminent is
when Output =>
-- capture/compare mode register 1 (output mode)
CCMR1_Output : aliased CCMR1_Output_Register;
-- capture/compare mode register 2 (output mode)
CCMR2_Output : aliased CCMR2_Output_Register;
when Input =>
-- capture/compare mode register 1 (input mode)
CCMR1_Input : aliased CCMR1_Input_Register;
-- capture/compare mode register 2 (input mode)
CCMR2_Input : aliased CCMR2_Input_Register;
end case;
end record
with Unchecked_Union, Volatile;
for TIM8_Peripheral use record
CR1 at 16#0# range 0 .. 31;
CR2 at 16#4# range 0 .. 31;
SMCR at 16#8# range 0 .. 31;
DIER at 16#C# range 0 .. 31;
SR at 16#10# range 0 .. 31;
EGR at 16#14# range 0 .. 31;
CCER at 16#20# range 0 .. 31;
CNT at 16#24# range 0 .. 31;
PSC at 16#28# range 0 .. 31;
ARR at 16#2C# range 0 .. 31;
RCR at 16#30# range 0 .. 31;
CCR1 at 16#34# range 0 .. 31;
CCR2 at 16#38# range 0 .. 31;
CCR3 at 16#3C# range 0 .. 31;
CCR4 at 16#40# range 0 .. 31;
BDTR at 16#44# range 0 .. 31;
DCR at 16#48# range 0 .. 31;
DMAR at 16#4C# range 0 .. 31;
OR1 at 16#50# range 0 .. 31;
CCMR3_Output at 16#54# range 0 .. 31;
CCR5 at 16#58# range 0 .. 31;
CCR6 at 16#5C# range 0 .. 31;
OR2 at 16#60# range 0 .. 31;
OR3 at 16#64# range 0 .. 31;
CCMR1_Output at 16#18# range 0 .. 31;
CCMR2_Output at 16#1C# range 0 .. 31;
CCMR1_Input at 16#18# range 0 .. 31;
CCMR2_Input at 16#1C# range 0 .. 31;
end record;
-- Advanced-timers
TIM8_Periph : aliased TIM8_Peripheral
with Import, Address => System'To_Address (16#40013400#);
type TIM15_Disc is
(
Output,
Input);
-- General purpose timers
type TIM15_Peripheral
(Discriminent : TIM15_Disc := Output)
is record
-- control register 1
CR1 : aliased CR1_Register_2;
-- control register 2
CR2 : aliased CR2_Register_3;
-- DMA/Interrupt enable register
DIER : aliased DIER_Register_3;
-- status register
SR : aliased SR_Register_3;
-- event generation register
EGR : aliased EGR_Register_3;
-- capture/compare enable register
CCER : aliased CCER_Register_2;
-- counter
CNT : aliased CNT_Register_2;
-- prescaler
PSC : aliased PSC_Register;
-- auto-reload register
ARR : aliased ARR_Register;
-- repetition counter register
RCR : aliased RCR_Register;
-- capture/compare register 1
CCR1 : aliased CCR1_Register;
-- break and dead-time register
BDTR : aliased BDTR_Register_1;
-- DMA control register
DCR : aliased DCR_Register;
-- DMA address for full transfer
DMAR : aliased DMAR_Register;
case Discriminent is
when Output =>
-- capture/compare mode register (output mode)
CCMR1_Output : aliased CCMR1_Output_Register_1;
when Input =>
-- capture/compare mode register 1 (input mode)
CCMR1_Input : aliased CCMR1_Input_Register_2;
end case;
end record
with Unchecked_Union, Volatile;
for TIM15_Peripheral use record
CR1 at 16#0# range 0 .. 31;
CR2 at 16#4# range 0 .. 31;
DIER at 16#C# range 0 .. 31;
SR at 16#10# range 0 .. 31;
EGR at 16#14# range 0 .. 31;
CCER at 16#20# range 0 .. 31;
CNT at 16#24# range 0 .. 31;
PSC at 16#28# range 0 .. 31;
ARR at 16#2C# range 0 .. 31;
RCR at 16#30# range 0 .. 31;
CCR1 at 16#34# range 0 .. 31;
BDTR at 16#44# range 0 .. 31;
DCR at 16#48# range 0 .. 31;
DMAR at 16#4C# range 0 .. 31;
CCMR1_Output at 16#18# range 0 .. 31;
CCMR1_Input at 16#18# range 0 .. 31;
end record;
-- General purpose timers
TIM15_Periph : aliased TIM15_Peripheral
with Import, Address => System'To_Address (16#40014000#);
type TIM16_Disc is
(
Output,
Input);
-- General purpose timers
type TIM16_Peripheral
(Discriminent : TIM16_Disc := Output)
is record
-- control register 1
CR1 : aliased CR1_Register_2;
-- control register 2
CR2 : aliased CR2_Register_3;
-- DMA/Interrupt enable register
DIER : aliased DIER_Register_3;
-- status register
SR : aliased SR_Register_3;
-- event generation register
EGR : aliased EGR_Register_3;
-- capture/compare enable register
CCER : aliased CCER_Register_2;
-- counter
CNT : aliased CNT_Register_2;
-- prescaler
PSC : aliased PSC_Register;
-- auto-reload register
ARR : aliased ARR_Register;
-- repetition counter register
RCR : aliased RCR_Register;
-- capture/compare register 1
CCR1 : aliased CCR1_Register;
-- break and dead-time register
BDTR : aliased BDTR_Register_1;
-- DMA control register
DCR : aliased DCR_Register;
-- DMA address for full transfer
DMAR : aliased DMAR_Register;
-- TIM16 option register 1
OR1 : aliased OR1_Register_2;
-- TIM17 option register 1
OR2 : aliased OR2_Register_2;
case Discriminent is
when Output =>
-- capture/compare mode register (output mode)
CCMR1_Output : aliased CCMR1_Output_Register_1;
when Input =>
-- capture/compare mode register 1 (input mode)
CCMR1_Input : aliased CCMR1_Input_Register_2;
end case;
end record
with Unchecked_Union, Volatile;
for TIM16_Peripheral use record
CR1 at 16#0# range 0 .. 31;
CR2 at 16#4# range 0 .. 31;
DIER at 16#C# range 0 .. 31;
SR at 16#10# range 0 .. 31;
EGR at 16#14# range 0 .. 31;
CCER at 16#20# range 0 .. 31;
CNT at 16#24# range 0 .. 31;
PSC at 16#28# range 0 .. 31;
ARR at 16#2C# range 0 .. 31;
RCR at 16#30# range 0 .. 31;
CCR1 at 16#34# range 0 .. 31;
BDTR at 16#44# range 0 .. 31;
DCR at 16#48# range 0 .. 31;
DMAR at 16#4C# range 0 .. 31;
OR1 at 16#50# range 0 .. 31;
OR2 at 16#60# range 0 .. 31;
CCMR1_Output at 16#18# range 0 .. 31;
CCMR1_Input at 16#18# range 0 .. 31;
end record;
-- General purpose timers
TIM16_Periph : aliased TIM16_Peripheral
with Import, Address => System'To_Address (16#40014400#);
-- General purpose timers
TIM17_Periph : aliased TIM16_Peripheral
with Import, Address => System'To_Address (16#40014800#);
end STM32_SVD.TIM;
|
pragma Warnings (Off);
pragma Ada_95;
with System;
with System.Parameters;
with System.Secondary_Stack;
package ada_main is
gnat_argc : Integer;
gnat_argv : System.Address;
gnat_envp : System.Address;
pragma Import (C, gnat_argc);
pragma Import (C, gnat_argv);
pragma Import (C, gnat_envp);
gnat_exit_status : Integer;
pragma Import (C, gnat_exit_status);
GNAT_Version : constant String :=
"GNAT Version: Community 2020 (20200429-93)" & ASCII.NUL;
pragma Export (C, GNAT_Version, "__gnat_version");
Ada_Main_Program_Name : constant String := "_ada_syncr_espera" & ASCII.NUL;
pragma Export (C, Ada_Main_Program_Name, "__gnat_ada_main_program_name");
procedure adainit;
pragma Export (C, adainit, "adainit");
procedure adafinal;
pragma Export (C, adafinal, "adafinal");
function main
(argc : Integer;
argv : System.Address;
envp : System.Address)
return Integer;
pragma Export (C, main, "main");
type Version_32 is mod 2 ** 32;
u00001 : constant Version_32 := 16#4dc4564a#;
pragma Export (C, u00001, "syncr_esperaB");
u00002 : constant Version_32 := 16#67c8d842#;
pragma Export (C, u00002, "system__standard_libraryB");
u00003 : constant Version_32 := 16#5741b5a5#;
pragma Export (C, u00003, "system__standard_libraryS");
u00004 : constant Version_32 := 16#76789da1#;
pragma Export (C, u00004, "adaS");
u00005 : constant Version_32 := 16#ffaa9e94#;
pragma Export (C, u00005, "ada__calendar__delaysB");
u00006 : constant Version_32 := 16#d86d2f1d#;
pragma Export (C, u00006, "ada__calendar__delaysS");
u00007 : constant Version_32 := 16#57c21ad4#;
pragma Export (C, u00007, "ada__calendarB");
u00008 : constant Version_32 := 16#31350a81#;
pragma Export (C, u00008, "ada__calendarS");
u00009 : constant Version_32 := 16#f34ff985#;
pragma Export (C, u00009, "ada__exceptionsB");
u00010 : constant Version_32 := 16#cfbb5cc5#;
pragma Export (C, u00010, "ada__exceptionsS");
u00011 : constant Version_32 := 16#35e1815f#;
pragma Export (C, u00011, "ada__exceptions__last_chance_handlerB");
u00012 : constant Version_32 := 16#cfec26ee#;
pragma Export (C, u00012, "ada__exceptions__last_chance_handlerS");
u00013 : constant Version_32 := 16#32a08138#;
pragma Export (C, u00013, "systemS");
u00014 : constant Version_32 := 16#ae860117#;
pragma Export (C, u00014, "system__soft_linksB");
u00015 : constant Version_32 := 16#4d9536d3#;
pragma Export (C, u00015, "system__soft_linksS");
u00016 : constant Version_32 := 16#59d61025#;
pragma Export (C, u00016, "system__secondary_stackB");
u00017 : constant Version_32 := 16#c30bb6bc#;
pragma Export (C, u00017, "system__secondary_stackS");
u00018 : constant Version_32 := 16#896564a3#;
pragma Export (C, u00018, "system__parametersB");
u00019 : constant Version_32 := 16#75f245f3#;
pragma Export (C, u00019, "system__parametersS");
u00020 : constant Version_32 := 16#ced09590#;
pragma Export (C, u00020, "system__storage_elementsB");
u00021 : constant Version_32 := 16#1f63cb3c#;
pragma Export (C, u00021, "system__storage_elementsS");
u00022 : constant Version_32 := 16#ce3e0e21#;
pragma Export (C, u00022, "system__soft_links__initializeB");
u00023 : constant Version_32 := 16#5697fc2b#;
pragma Export (C, u00023, "system__soft_links__initializeS");
u00024 : constant Version_32 := 16#41837d1e#;
pragma Export (C, u00024, "system__stack_checkingB");
u00025 : constant Version_32 := 16#bc1fead0#;
pragma Export (C, u00025, "system__stack_checkingS");
u00026 : constant Version_32 := 16#34742901#;
pragma Export (C, u00026, "system__exception_tableB");
u00027 : constant Version_32 := 16#0dc9c2c8#;
pragma Export (C, u00027, "system__exception_tableS");
u00028 : constant Version_32 := 16#ce4af020#;
pragma Export (C, u00028, "system__exceptionsB");
u00029 : constant Version_32 := 16#5ac3ecce#;
pragma Export (C, u00029, "system__exceptionsS");
u00030 : constant Version_32 := 16#69416224#;
pragma Export (C, u00030, "system__exceptions__machineB");
u00031 : constant Version_32 := 16#5c74e542#;
pragma Export (C, u00031, "system__exceptions__machineS");
u00032 : constant Version_32 := 16#aa0563fc#;
pragma Export (C, u00032, "system__exceptions_debugB");
u00033 : constant Version_32 := 16#2eed524e#;
pragma Export (C, u00033, "system__exceptions_debugS");
u00034 : constant Version_32 := 16#6c2f8802#;
pragma Export (C, u00034, "system__img_intB");
u00035 : constant Version_32 := 16#307b61fa#;
pragma Export (C, u00035, "system__img_intS");
u00036 : constant Version_32 := 16#39df8c17#;
pragma Export (C, u00036, "system__tracebackB");
u00037 : constant Version_32 := 16#6c825ffc#;
pragma Export (C, u00037, "system__tracebackS");
u00038 : constant Version_32 := 16#9ed49525#;
pragma Export (C, u00038, "system__traceback_entriesB");
u00039 : constant Version_32 := 16#32fb7748#;
pragma Export (C, u00039, "system__traceback_entriesS");
u00040 : constant Version_32 := 16#3f39e75e#;
pragma Export (C, u00040, "system__traceback__symbolicB");
u00041 : constant Version_32 := 16#46491211#;
pragma Export (C, u00041, "system__traceback__symbolicS");
u00042 : constant Version_32 := 16#179d7d28#;
pragma Export (C, u00042, "ada__containersS");
u00043 : constant Version_32 := 16#701f9d88#;
pragma Export (C, u00043, "ada__exceptions__tracebackB");
u00044 : constant Version_32 := 16#ae2d2db5#;
pragma Export (C, u00044, "ada__exceptions__tracebackS");
u00045 : constant Version_32 := 16#e865e681#;
pragma Export (C, u00045, "system__bounded_stringsB");
u00046 : constant Version_32 := 16#455da021#;
pragma Export (C, u00046, "system__bounded_stringsS");
u00047 : constant Version_32 := 16#7b499e82#;
pragma Export (C, u00047, "system__crtlS");
u00048 : constant Version_32 := 16#641e2245#;
pragma Export (C, u00048, "system__dwarf_linesB");
u00049 : constant Version_32 := 16#40ce1ea3#;
pragma Export (C, u00049, "system__dwarf_linesS");
u00050 : constant Version_32 := 16#5b4659fa#;
pragma Export (C, u00050, "ada__charactersS");
u00051 : constant Version_32 := 16#8f637df8#;
pragma Export (C, u00051, "ada__characters__handlingB");
u00052 : constant Version_32 := 16#3b3f6154#;
pragma Export (C, u00052, "ada__characters__handlingS");
u00053 : constant Version_32 := 16#4b7bb96a#;
pragma Export (C, u00053, "ada__characters__latin_1S");
u00054 : constant Version_32 := 16#e6d4fa36#;
pragma Export (C, u00054, "ada__stringsS");
u00055 : constant Version_32 := 16#96df1a3f#;
pragma Export (C, u00055, "ada__strings__mapsB");
u00056 : constant Version_32 := 16#1e526bec#;
pragma Export (C, u00056, "ada__strings__mapsS");
u00057 : constant Version_32 := 16#465aa89c#;
pragma Export (C, u00057, "system__bit_opsB");
u00058 : constant Version_32 := 16#0765e3a3#;
pragma Export (C, u00058, "system__bit_opsS");
u00059 : constant Version_32 := 16#6c6ff32a#;
pragma Export (C, u00059, "system__unsigned_typesS");
u00060 : constant Version_32 := 16#92f05f13#;
pragma Export (C, u00060, "ada__strings__maps__constantsS");
u00061 : constant Version_32 := 16#5ab55268#;
pragma Export (C, u00061, "interfacesS");
u00062 : constant Version_32 := 16#a0d3d22b#;
pragma Export (C, u00062, "system__address_imageB");
u00063 : constant Version_32 := 16#934c1c02#;
pragma Export (C, u00063, "system__address_imageS");
u00064 : constant Version_32 := 16#8631cc2e#;
pragma Export (C, u00064, "system__img_unsB");
u00065 : constant Version_32 := 16#f39bcfdd#;
pragma Export (C, u00065, "system__img_unsS");
u00066 : constant Version_32 := 16#20ec7aa3#;
pragma Export (C, u00066, "system__ioB");
u00067 : constant Version_32 := 16#ace27677#;
pragma Export (C, u00067, "system__ioS");
u00068 : constant Version_32 := 16#3080f2ca#;
pragma Export (C, u00068, "system__mmapB");
u00069 : constant Version_32 := 16#9ad4d587#;
pragma Export (C, u00069, "system__mmapS");
u00070 : constant Version_32 := 16#92d882c5#;
pragma Export (C, u00070, "ada__io_exceptionsS");
u00071 : constant Version_32 := 16#a8ba7b3b#;
pragma Export (C, u00071, "system__mmap__os_interfaceB");
u00072 : constant Version_32 := 16#8f4541b8#;
pragma Export (C, u00072, "system__mmap__os_interfaceS");
u00073 : constant Version_32 := 16#657efc5a#;
pragma Export (C, u00073, "system__os_libB");
u00074 : constant Version_32 := 16#d872da39#;
pragma Export (C, u00074, "system__os_libS");
u00075 : constant Version_32 := 16#ec4d5631#;
pragma Export (C, u00075, "system__case_utilB");
u00076 : constant Version_32 := 16#0d75376c#;
pragma Export (C, u00076, "system__case_utilS");
u00077 : constant Version_32 := 16#2a8e89ad#;
pragma Export (C, u00077, "system__stringsB");
u00078 : constant Version_32 := 16#52b6adad#;
pragma Export (C, u00078, "system__stringsS");
u00079 : constant Version_32 := 16#e49bce3e#;
pragma Export (C, u00079, "interfaces__cB");
u00080 : constant Version_32 := 16#dbc36ce0#;
pragma Export (C, u00080, "interfaces__cS");
u00081 : constant Version_32 := 16#c83ab8ef#;
pragma Export (C, u00081, "system__object_readerB");
u00082 : constant Version_32 := 16#f6d45c39#;
pragma Export (C, u00082, "system__object_readerS");
u00083 : constant Version_32 := 16#914b0305#;
pragma Export (C, u00083, "system__val_lliB");
u00084 : constant Version_32 := 16#5ece13c8#;
pragma Export (C, u00084, "system__val_lliS");
u00085 : constant Version_32 := 16#d2ae2792#;
pragma Export (C, u00085, "system__val_lluB");
u00086 : constant Version_32 := 16#01a17ec8#;
pragma Export (C, u00086, "system__val_lluS");
u00087 : constant Version_32 := 16#269742a9#;
pragma Export (C, u00087, "system__val_utilB");
u00088 : constant Version_32 := 16#9e0037c6#;
pragma Export (C, u00088, "system__val_utilS");
u00089 : constant Version_32 := 16#b578159b#;
pragma Export (C, u00089, "system__exception_tracesB");
u00090 : constant Version_32 := 16#167fa1a2#;
pragma Export (C, u00090, "system__exception_tracesS");
u00091 : constant Version_32 := 16#e1282880#;
pragma Export (C, u00091, "system__win32S");
u00092 : constant Version_32 := 16#8c33a517#;
pragma Export (C, u00092, "system__wch_conB");
u00093 : constant Version_32 := 16#29dda3ea#;
pragma Export (C, u00093, "system__wch_conS");
u00094 : constant Version_32 := 16#9721e840#;
pragma Export (C, u00094, "system__wch_stwB");
u00095 : constant Version_32 := 16#04cc8feb#;
pragma Export (C, u00095, "system__wch_stwS");
u00096 : constant Version_32 := 16#a831679c#;
pragma Export (C, u00096, "system__wch_cnvB");
u00097 : constant Version_32 := 16#266a1919#;
pragma Export (C, u00097, "system__wch_cnvS");
u00098 : constant Version_32 := 16#ece6fdb6#;
pragma Export (C, u00098, "system__wch_jisB");
u00099 : constant Version_32 := 16#a61a0038#;
pragma Export (C, u00099, "system__wch_jisS");
u00100 : constant Version_32 := 16#24ec69e6#;
pragma Export (C, u00100, "system__os_primitivesB");
u00101 : constant Version_32 := 16#355de4ce#;
pragma Export (C, u00101, "system__os_primitivesS");
u00102 : constant Version_32 := 16#05c60a38#;
pragma Export (C, u00102, "system__task_lockB");
u00103 : constant Version_32 := 16#532ab656#;
pragma Export (C, u00103, "system__task_lockS");
u00104 : constant Version_32 := 16#b8c476a4#;
pragma Export (C, u00104, "system__win32__extS");
u00105 : constant Version_32 := 16#553ad4ac#;
pragma Export (C, u00105, "ada__real_timeB");
u00106 : constant Version_32 := 16#1ad7dfc0#;
pragma Export (C, u00106, "ada__real_timeS");
u00107 : constant Version_32 := 16#0d140719#;
pragma Export (C, u00107, "system__taskingB");
u00108 : constant Version_32 := 16#c6674d66#;
pragma Export (C, u00108, "system__taskingS");
u00109 : constant Version_32 := 16#dc410cef#;
pragma Export (C, u00109, "system__task_primitivesS");
u00110 : constant Version_32 := 16#4cfe4fc8#;
pragma Export (C, u00110, "system__os_interfaceS");
u00111 : constant Version_32 := 16#1d638357#;
pragma Export (C, u00111, "interfaces__c__stringsB");
u00112 : constant Version_32 := 16#f239f79c#;
pragma Export (C, u00112, "interfaces__c__stringsS");
u00113 : constant Version_32 := 16#152ee045#;
pragma Export (C, u00113, "system__task_primitives__operationsB");
u00114 : constant Version_32 := 16#5a0b0d58#;
pragma Export (C, u00114, "system__task_primitives__operationsS");
u00115 : constant Version_32 := 16#1b28662b#;
pragma Export (C, u00115, "system__float_controlB");
u00116 : constant Version_32 := 16#d25cc204#;
pragma Export (C, u00116, "system__float_controlS");
u00117 : constant Version_32 := 16#6387a759#;
pragma Export (C, u00117, "system__interrupt_managementB");
u00118 : constant Version_32 := 16#246e2885#;
pragma Export (C, u00118, "system__interrupt_managementS");
u00119 : constant Version_32 := 16#64507e17#;
pragma Export (C, u00119, "system__multiprocessorsB");
u00120 : constant Version_32 := 16#0a0c1e4b#;
pragma Export (C, u00120, "system__multiprocessorsS");
u00121 : constant Version_32 := 16#ce7dfb56#;
pragma Export (C, u00121, "system__task_infoB");
u00122 : constant Version_32 := 16#4713b9b1#;
pragma Export (C, u00122, "system__task_infoS");
u00123 : constant Version_32 := 16#1bbc5086#;
pragma Export (C, u00123, "system__tasking__debugB");
u00124 : constant Version_32 := 16#48f9280e#;
pragma Export (C, u00124, "system__tasking__debugS");
u00125 : constant Version_32 := 16#fd83e873#;
pragma Export (C, u00125, "system__concat_2B");
u00126 : constant Version_32 := 16#300056e8#;
pragma Export (C, u00126, "system__concat_2S");
u00127 : constant Version_32 := 16#2b70b149#;
pragma Export (C, u00127, "system__concat_3B");
u00128 : constant Version_32 := 16#39d0dd9d#;
pragma Export (C, u00128, "system__concat_3S");
u00129 : constant Version_32 := 16#b31a5821#;
pragma Export (C, u00129, "system__img_enum_newB");
u00130 : constant Version_32 := 16#53ec87f8#;
pragma Export (C, u00130, "system__img_enum_newS");
u00131 : constant Version_32 := 16#617d5887#;
pragma Export (C, u00131, "system__stack_usageB");
u00132 : constant Version_32 := 16#3a3ac346#;
pragma Export (C, u00132, "system__stack_usageS");
u00133 : constant Version_32 := 16#f9576a72#;
pragma Export (C, u00133, "ada__tagsB");
u00134 : constant Version_32 := 16#b6661f55#;
pragma Export (C, u00134, "ada__tagsS");
u00135 : constant Version_32 := 16#796f31f1#;
pragma Export (C, u00135, "system__htableB");
u00136 : constant Version_32 := 16#b66232d2#;
pragma Export (C, u00136, "system__htableS");
u00137 : constant Version_32 := 16#089f5cd0#;
pragma Export (C, u00137, "system__string_hashB");
u00138 : constant Version_32 := 16#143c59ac#;
pragma Export (C, u00138, "system__string_hashS");
u00139 : constant Version_32 := 16#f4e097a7#;
pragma Export (C, u00139, "ada__text_ioB");
u00140 : constant Version_32 := 16#03e83e15#;
pragma Export (C, u00140, "ada__text_ioS");
u00141 : constant Version_32 := 16#10558b11#;
pragma Export (C, u00141, "ada__streamsB");
u00142 : constant Version_32 := 16#67e31212#;
pragma Export (C, u00142, "ada__streamsS");
u00143 : constant Version_32 := 16#73d2d764#;
pragma Export (C, u00143, "interfaces__c_streamsB");
u00144 : constant Version_32 := 16#b1330297#;
pragma Export (C, u00144, "interfaces__c_streamsS");
u00145 : constant Version_32 := 16#ec9c64c3#;
pragma Export (C, u00145, "system__file_ioB");
u00146 : constant Version_32 := 16#95d1605d#;
pragma Export (C, u00146, "system__file_ioS");
u00147 : constant Version_32 := 16#86c56e5a#;
pragma Export (C, u00147, "ada__finalizationS");
u00148 : constant Version_32 := 16#95817ed8#;
pragma Export (C, u00148, "system__finalization_rootB");
u00149 : constant Version_32 := 16#7d52f2a8#;
pragma Export (C, u00149, "system__finalization_rootS");
u00150 : constant Version_32 := 16#cf3f1b90#;
pragma Export (C, u00150, "system__file_control_blockS");
u00151 : constant Version_32 := 16#72e59739#;
pragma Export (C, u00151, "system__tasking__rendezvousB");
u00152 : constant Version_32 := 16#e93c6c5f#;
pragma Export (C, u00152, "system__tasking__rendezvousS");
u00153 : constant Version_32 := 16#100eaf58#;
pragma Export (C, u00153, "system__restrictionsB");
u00154 : constant Version_32 := 16#dbc9df38#;
pragma Export (C, u00154, "system__restrictionsS");
u00155 : constant Version_32 := 16#4cd3ce3b#;
pragma Export (C, u00155, "system__tasking__entry_callsB");
u00156 : constant Version_32 := 16#526fb901#;
pragma Export (C, u00156, "system__tasking__entry_callsS");
u00157 : constant Version_32 := 16#b19e9df1#;
pragma Export (C, u00157, "system__tasking__initializationB");
u00158 : constant Version_32 := 16#cd0eb8a9#;
pragma Export (C, u00158, "system__tasking__initializationS");
u00159 : constant Version_32 := 16#215cb8f4#;
pragma Export (C, u00159, "system__soft_links__taskingB");
u00160 : constant Version_32 := 16#e939497e#;
pragma Export (C, u00160, "system__soft_links__taskingS");
u00161 : constant Version_32 := 16#3880736e#;
pragma Export (C, u00161, "ada__exceptions__is_null_occurrenceB");
u00162 : constant Version_32 := 16#6fde25af#;
pragma Export (C, u00162, "ada__exceptions__is_null_occurrenceS");
u00163 : constant Version_32 := 16#d798575d#;
pragma Export (C, u00163, "system__tasking__task_attributesB");
u00164 : constant Version_32 := 16#7dbadc03#;
pragma Export (C, u00164, "system__tasking__task_attributesS");
u00165 : constant Version_32 := 16#3af67f9c#;
pragma Export (C, u00165, "system__tasking__protected_objectsB");
u00166 : constant Version_32 := 16#242da0e0#;
pragma Export (C, u00166, "system__tasking__protected_objectsS");
u00167 : constant Version_32 := 16#119b2d0b#;
pragma Export (C, u00167, "system__tasking__protected_objects__entriesB");
u00168 : constant Version_32 := 16#7daf93e7#;
pragma Export (C, u00168, "system__tasking__protected_objects__entriesS");
u00169 : constant Version_32 := 16#ad55c617#;
pragma Export (C, u00169, "system__tasking__protected_objects__operationsB");
u00170 : constant Version_32 := 16#343fde45#;
pragma Export (C, u00170, "system__tasking__protected_objects__operationsS");
u00171 : constant Version_32 := 16#db326703#;
pragma Export (C, u00171, "system__tasking__queuingB");
u00172 : constant Version_32 := 16#73e13001#;
pragma Export (C, u00172, "system__tasking__queuingS");
u00173 : constant Version_32 := 16#1d9c679e#;
pragma Export (C, u00173, "system__tasking__utilitiesB");
u00174 : constant Version_32 := 16#a65de031#;
pragma Export (C, u00174, "system__tasking__utilitiesS");
u00175 : constant Version_32 := 16#7d29cee1#;
pragma Export (C, u00175, "system__tasking__stagesB");
u00176 : constant Version_32 := 16#6153a6f3#;
pragma Export (C, u00176, "system__tasking__stagesS");
u00177 : constant Version_32 := 16#eca5ecae#;
pragma Export (C, u00177, "system__memoryB");
u00178 : constant Version_32 := 16#6bdde70c#;
pragma Export (C, u00178, "system__memoryS");
-- BEGIN ELABORATION ORDER
-- ada%s
-- ada.characters%s
-- ada.characters.latin_1%s
-- interfaces%s
-- system%s
-- system.float_control%s
-- system.float_control%b
-- system.img_enum_new%s
-- system.img_enum_new%b
-- system.img_int%s
-- system.img_int%b
-- system.io%s
-- system.io%b
-- system.parameters%s
-- system.parameters%b
-- system.crtl%s
-- interfaces.c_streams%s
-- interfaces.c_streams%b
-- system.restrictions%s
-- system.restrictions%b
-- system.storage_elements%s
-- system.storage_elements%b
-- system.stack_checking%s
-- system.stack_checking%b
-- system.stack_usage%s
-- system.stack_usage%b
-- system.string_hash%s
-- system.string_hash%b
-- system.htable%s
-- system.htable%b
-- system.strings%s
-- system.strings%b
-- system.traceback_entries%s
-- system.traceback_entries%b
-- system.unsigned_types%s
-- system.img_uns%s
-- system.img_uns%b
-- system.wch_con%s
-- system.wch_con%b
-- system.wch_jis%s
-- system.wch_jis%b
-- system.wch_cnv%s
-- system.wch_cnv%b
-- system.concat_2%s
-- system.concat_2%b
-- system.concat_3%s
-- system.concat_3%b
-- system.traceback%s
-- system.traceback%b
-- ada.characters.handling%s
-- system.case_util%s
-- system.os_lib%s
-- system.secondary_stack%s
-- system.standard_library%s
-- ada.exceptions%s
-- system.exceptions_debug%s
-- system.exceptions_debug%b
-- system.soft_links%s
-- system.val_lli%s
-- system.val_llu%s
-- system.val_util%s
-- system.val_util%b
-- system.wch_stw%s
-- system.wch_stw%b
-- ada.exceptions.last_chance_handler%s
-- ada.exceptions.last_chance_handler%b
-- ada.exceptions.traceback%s
-- ada.exceptions.traceback%b
-- system.address_image%s
-- system.address_image%b
-- system.bit_ops%s
-- system.bit_ops%b
-- system.bounded_strings%s
-- system.bounded_strings%b
-- system.case_util%b
-- system.exception_table%s
-- system.exception_table%b
-- ada.containers%s
-- ada.io_exceptions%s
-- ada.strings%s
-- ada.strings.maps%s
-- ada.strings.maps%b
-- ada.strings.maps.constants%s
-- interfaces.c%s
-- interfaces.c%b
-- system.exceptions%s
-- system.exceptions%b
-- system.exceptions.machine%s
-- system.exceptions.machine%b
-- system.win32%s
-- ada.characters.handling%b
-- system.exception_traces%s
-- system.exception_traces%b
-- system.memory%s
-- system.memory%b
-- system.mmap%s
-- system.mmap.os_interface%s
-- system.mmap.os_interface%b
-- system.mmap%b
-- system.object_reader%s
-- system.object_reader%b
-- system.dwarf_lines%s
-- system.dwarf_lines%b
-- system.os_lib%b
-- system.secondary_stack%b
-- system.soft_links.initialize%s
-- system.soft_links.initialize%b
-- system.soft_links%b
-- system.standard_library%b
-- system.traceback.symbolic%s
-- system.traceback.symbolic%b
-- ada.exceptions%b
-- system.val_lli%b
-- system.val_llu%b
-- ada.exceptions.is_null_occurrence%s
-- ada.exceptions.is_null_occurrence%b
-- ada.tags%s
-- ada.tags%b
-- ada.streams%s
-- ada.streams%b
-- interfaces.c.strings%s
-- interfaces.c.strings%b
-- system.file_control_block%s
-- system.finalization_root%s
-- system.finalization_root%b
-- ada.finalization%s
-- system.file_io%s
-- system.file_io%b
-- system.multiprocessors%s
-- system.multiprocessors%b
-- system.os_interface%s
-- system.interrupt_management%s
-- system.interrupt_management%b
-- system.task_info%s
-- system.task_info%b
-- system.task_lock%s
-- system.task_lock%b
-- system.task_primitives%s
-- system.win32.ext%s
-- system.os_primitives%s
-- system.os_primitives%b
-- system.tasking%s
-- system.task_primitives.operations%s
-- system.tasking.debug%s
-- system.tasking.debug%b
-- system.task_primitives.operations%b
-- system.tasking%b
-- ada.calendar%s
-- ada.calendar%b
-- ada.calendar.delays%s
-- ada.calendar.delays%b
-- ada.real_time%s
-- ada.real_time%b
-- ada.text_io%s
-- ada.text_io%b
-- system.soft_links.tasking%s
-- system.soft_links.tasking%b
-- system.tasking.initialization%s
-- system.tasking.task_attributes%s
-- system.tasking.task_attributes%b
-- system.tasking.initialization%b
-- system.tasking.protected_objects%s
-- system.tasking.protected_objects%b
-- system.tasking.protected_objects.entries%s
-- system.tasking.protected_objects.entries%b
-- system.tasking.queuing%s
-- system.tasking.queuing%b
-- system.tasking.utilities%s
-- system.tasking.utilities%b
-- system.tasking.entry_calls%s
-- system.tasking.rendezvous%s
-- system.tasking.protected_objects.operations%s
-- system.tasking.protected_objects.operations%b
-- system.tasking.entry_calls%b
-- system.tasking.rendezvous%b
-- system.tasking.stages%s
-- system.tasking.stages%b
-- syncr_espera%b
-- END ELABORATION ORDER
end ada_main;
|
with Ada.Text_IO; use Ada.Text_IO;
procedure Test_Events is
-- Place the event implementation here
X : Event;
task A;
task body A is
begin
Put_Line ("A is waiting for X");
X.Wait;
Put_Line ("A received X");
end A;
begin
delay 1.0;
Put_Line ("Signal X");
X.Signal;
end Test_Events;
|
-- class package: ${self.name}
-- description: self.description
.if ( "" != domain_types_package_name )
with ${domain_types_package_name};
.end if
package ${root_package.name}.${domain_package.name}.${self.name} is
--************** Object ${self.long_name} Information **************
Object_String : String := "${self.name}";
${record_body}
end ${root_package.name}.${domain_package.name}.${self.name};
|
-- { dg-do compile }
-- { dg-options "-w" }
package body Vect10 is
procedure Add_Mul (X : in out Unit; Y, Z : in Unit) is
begin
X := X + Y * Z;
end;
pragma Inline_Always (Add_Mul);
procedure Proc
(F : in Rec_Vector;
First_Index : in Natural;
Last_Index : in Natural;
Result : out Unit)
is
begin
Result := (others => 0.0);
for I in First_Index + 1 .. Last_Index loop
declare
Local : Rec renames F (I);
begin
Add_Mul (Result, Local.Val, Local.Val);
end;
end loop;
end;
end Vect10;
|
------------------------------------------------------------------------------
-- 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. --
------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- HMAC.Pinentry encapsulates communication with `pinentry` utility from --
-- GnuPG project. --
-- Depending on communication features available, the package might not be --
-- functional on all targets. A client should use Is_Available function to --
-- ensure the underlying implentation is indeed operational. --
------------------------------------------------------------------------------
package HMAC.Pinentry is
Backend_Error : exception;
function Get_Key (Command : String) return String;
-- Run the given Command and communicate with it using pinentry protocol
-- and return a secret String or raise Backend_Error.
function Is_Available return Boolean;
-- Check whether Get_Key can actually work
end HMAC.Pinentry;
|
------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- G N A T . R A N D O M _ N U M B E R S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2007-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. --
-- --
------------------------------------------------------------------------------
-- Extended pseudo-random number generation
-- This package provides a type representing pseudo-random number generators,
-- and subprograms to extract various distributions of numbers from them. It
-- also provides types for representing initialization values and snapshots of
-- internal generator state, which permit reproducible pseudo-random streams.
-- The generator currently provided by this package has an extremely long
-- period (at least 2**19937-1), and passes the Big Crush test suite, with the
-- exception of the two linear complexity tests. Therefore, it is suitable for
-- simulations, but should not be used as a cryptographic pseudo-random source
-- without additional processing.
-- The design of this package effects is simplified compared to the design
-- of standard Ada.Numerics packages. There is no separate State type; the
-- Generator type itself suffices for this purpose. The parameter modes on
-- Reset procedures better reflect the effect of these routines.
with System.Random_Numbers;
with Interfaces; use Interfaces;
package GNAT.Random_Numbers is
type Generator is limited private;
subtype Initialization_Vector is
System.Random_Numbers.Initialization_Vector;
function Random (Gen : Generator) return Float;
function Random (Gen : Generator) return Long_Float;
-- Return pseudo-random numbers uniformly distributed on [0 .. 1)
function Random (Gen : Generator) return Interfaces.Integer_32;
function Random (Gen : Generator) return Interfaces.Unsigned_32;
function Random (Gen : Generator) return Interfaces.Integer_64;
function Random (Gen : Generator) return Interfaces.Unsigned_64;
function Random (Gen : Generator) return Integer;
function Random (Gen : Generator) return Long_Integer;
-- Return pseudo-random numbers uniformly distributed on T'First .. T'Last
-- for various builtin integer types.
generic
type Result_Subtype is (<>);
Default_Min : Result_Subtype := Result_Subtype'Val (0);
function Random_Discrete
(Gen : Generator;
Min : Result_Subtype := Default_Min;
Max : Result_Subtype := Result_Subtype'Last) return Result_Subtype;
-- Returns pseudo-random numbers uniformly distributed on Min .. Max
generic
type Result_Subtype is digits <>;
function Random_Float (Gen : Generator) return Result_Subtype;
-- Returns pseudo-random numbers uniformly distributed on [0 .. 1)
function Random_Gaussian (Gen : Generator) return Long_Float;
function Random_Gaussian (Gen : Generator) return Float;
-- Returns pseudo-random numbers normally distributed value with mean 0
-- and standard deviation 1.0.
procedure Reset (Gen : out Generator);
-- Re-initialize the state of Gen from the time of day
procedure Reset
(Gen : out Generator;
Initiator : Initialization_Vector);
procedure Reset
(Gen : out Generator;
Initiator : Interfaces.Integer_32);
procedure Reset
(Gen : out Generator;
Initiator : Interfaces.Unsigned_32);
procedure Reset
(Gen : out Generator;
Initiator : Integer);
-- Re-initialize Gen based on the Initiator in various ways. Identical
-- values of Initiator cause identical sequences of values.
procedure Reset (Gen : out Generator; From_State : Generator);
-- Causes the state of Gen to be identical to that of From_State; Gen
-- and From_State will produce identical sequences of values subsequently.
procedure Reset (Gen : out Generator; From_Image : String);
function Image (Gen : Generator) return String;
-- The call
-- Reset (Gen2, Image (Gen1))
-- has the same effect as Reset (Gen2, Gen1);
Max_Image_Width : constant :=
System.Random_Numbers.Max_Image_Width + 2 + 20 + 5;
-- Maximum possible length of result of Image (...)
private
type Generator is limited record
Rep : System.Random_Numbers.Generator;
Have_Gaussian : Boolean;
-- The algorithm used for Random_Gaussian produces deviates in
-- pairs. Have_Gaussian is true iff Random_Gaussian has returned one
-- member of the pair and Next_Gaussian contains the other.
Next_Gaussian : Long_Float;
-- Next random deviate to be produced by Random_Gaussian, if
-- Have_Gaussian.
end record;
end GNAT.Random_Numbers;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Tools Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2013, Vadim Godunko <vgodunko@gmail.com> --
-- 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 WSDL.Iterators;
with WSDL.Visitors;
package body WSDL.AST.Faults is
-----------
-- Enter --
-----------
overriding procedure Enter
(Self : not null access Binding_Fault_Node;
Visitor : in out WSDL.Visitors.WSDL_Visitor'Class;
Control : in out WSDL.Iterators.Traverse_Control) is
begin
Visitor.Enter_Binding_Fault
(Binding_Fault_Access (Self), Control);
end Enter;
-----------
-- Enter --
-----------
overriding procedure Enter
(Self : not null access Interface_Fault_Node;
Visitor : in out WSDL.Visitors.WSDL_Visitor'Class;
Control : in out WSDL.Iterators.Traverse_Control) is
begin
Visitor.Enter_Interface_Fault
(Interface_Fault_Access (Self), Control);
end Enter;
-----------
-- Enter --
-----------
overriding procedure Enter
(Self : not null access Interface_Fault_Reference_Node;
Visitor : in out WSDL.Visitors.WSDL_Visitor'Class;
Control : in out WSDL.Iterators.Traverse_Control) is
begin
Visitor.Enter_Interface_Fault_Reference
(Interface_Fault_Reference_Access (Self), Control);
end Enter;
-----------
-- Leave --
-----------
overriding procedure Leave
(Self : not null access Binding_Fault_Node;
Visitor : in out WSDL.Visitors.WSDL_Visitor'Class;
Control : in out WSDL.Iterators.Traverse_Control) is
begin
Visitor.Leave_Binding_Fault
(Binding_Fault_Access (Self), Control);
end Leave;
-----------
-- Leave --
-----------
overriding procedure Leave
(Self : not null access Interface_Fault_Node;
Visitor : in out WSDL.Visitors.WSDL_Visitor'Class;
Control : in out WSDL.Iterators.Traverse_Control) is
begin
Visitor.Leave_Interface_Fault
(Interface_Fault_Access (Self), Control);
end Leave;
-----------
-- Leave --
-----------
overriding procedure Leave
(Self : not null access Interface_Fault_Reference_Node;
Visitor : in out WSDL.Visitors.WSDL_Visitor'Class;
Control : in out WSDL.Iterators.Traverse_Control) is
begin
Visitor.Leave_Interface_Fault_Reference
(Interface_Fault_Reference_Access (Self), Control);
end Leave;
-----------
-- Visit --
-----------
overriding procedure Visit
(Self : not null access Binding_Fault_Node;
Iterator : in out WSDL.Iterators.WSDL_Iterator'Class;
Visitor : in out WSDL.Visitors.WSDL_Visitor'Class;
Control : in out WSDL.Iterators.Traverse_Control) is
begin
Iterator.Visit_Binding_Fault
(Visitor, Binding_Fault_Access (Self), Control);
end Visit;
-----------
-- Visit --
-----------
overriding procedure Visit
(Self : not null access Interface_Fault_Node;
Iterator : in out WSDL.Iterators.WSDL_Iterator'Class;
Visitor : in out WSDL.Visitors.WSDL_Visitor'Class;
Control : in out WSDL.Iterators.Traverse_Control) is
begin
Iterator.Visit_Interface_Fault
(Visitor, Interface_Fault_Access (Self), Control);
end Visit;
-----------
-- Visit --
-----------
overriding procedure Visit
(Self : not null access Interface_Fault_Reference_Node;
Iterator : in out WSDL.Iterators.WSDL_Iterator'Class;
Visitor : in out WSDL.Visitors.WSDL_Visitor'Class;
Control : in out WSDL.Iterators.Traverse_Control) is
begin
Iterator.Visit_Interface_Fault_Reference
(Visitor, Interface_Fault_Reference_Access (Self), Control);
end Visit;
end WSDL.AST.Faults;
|
pragma Ada_2005;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
with Interfaces.C.Extensions;
package asm_generic_int_ll64_h is
-- * asm-generic/int-ll64.h
-- *
-- * Integer declarations for architectures which use "long long"
-- * for 64-bit types.
--
-- * __xx is ok: it doesn't pollute the POSIX namespace. Use these in the
-- * header files exported to user space
--
subtype uu_s8 is signed_char; -- /usr/include/asm-generic/int-ll64.h:19
subtype uu_u8 is unsigned_char; -- /usr/include/asm-generic/int-ll64.h:20
subtype uu_s16 is short; -- /usr/include/asm-generic/int-ll64.h:22
subtype uu_u16 is unsigned_short; -- /usr/include/asm-generic/int-ll64.h:23
subtype uu_s32 is int; -- /usr/include/asm-generic/int-ll64.h:25
subtype uu_u32 is unsigned; -- /usr/include/asm-generic/int-ll64.h:26
subtype uu_s64 is Long_Long_Integer; -- /usr/include/asm-generic/int-ll64.h:29
subtype uu_u64 is Extensions.unsigned_long_long; -- /usr/include/asm-generic/int-ll64.h:30
end asm_generic_int_ll64_h;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <vgodunko@gmail.com> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Generic_Collections;
package AMF.UML.Function_Behaviors.Collections is
pragma Preelaborate;
package UML_Function_Behavior_Collections is
new AMF.Generic_Collections
(UML_Function_Behavior,
UML_Function_Behavior_Access);
type Set_Of_UML_Function_Behavior is
new UML_Function_Behavior_Collections.Set with null record;
Empty_Set_Of_UML_Function_Behavior : constant Set_Of_UML_Function_Behavior;
type Ordered_Set_Of_UML_Function_Behavior is
new UML_Function_Behavior_Collections.Ordered_Set with null record;
Empty_Ordered_Set_Of_UML_Function_Behavior : constant Ordered_Set_Of_UML_Function_Behavior;
type Bag_Of_UML_Function_Behavior is
new UML_Function_Behavior_Collections.Bag with null record;
Empty_Bag_Of_UML_Function_Behavior : constant Bag_Of_UML_Function_Behavior;
type Sequence_Of_UML_Function_Behavior is
new UML_Function_Behavior_Collections.Sequence with null record;
Empty_Sequence_Of_UML_Function_Behavior : constant Sequence_Of_UML_Function_Behavior;
private
Empty_Set_Of_UML_Function_Behavior : constant Set_Of_UML_Function_Behavior
:= (UML_Function_Behavior_Collections.Set with null record);
Empty_Ordered_Set_Of_UML_Function_Behavior : constant Ordered_Set_Of_UML_Function_Behavior
:= (UML_Function_Behavior_Collections.Ordered_Set with null record);
Empty_Bag_Of_UML_Function_Behavior : constant Bag_Of_UML_Function_Behavior
:= (UML_Function_Behavior_Collections.Bag with null record);
Empty_Sequence_Of_UML_Function_Behavior : constant Sequence_Of_UML_Function_Behavior
:= (UML_Function_Behavior_Collections.Sequence with null record);
end AMF.UML.Function_Behaviors.Collections;
|
No-one has translated the durapub2 example into Ada yet. Be the first to create
durapub2 in Ada and get one free Internet! If you're the author of the Ada
binding, this is a great way to get people to use 0MQ in Ada.
To submit a new translation email it to zeromq-dev@lists.zeromq.org. Please:
* Stick to identical functionality and naming used in examples so that readers
can easily compare languages.
* You MUST place your name as author in the examples so readers can contact you.
* You MUST state in the email that you license your code under the MIT/X11
license.
Subscribe to this list at http://lists.zeromq.org/mailman/listinfo/zeromq-dev.
|
------------------------------------------------------------------------------
-- 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.
------------------------------------------------------------------------------
package Asis.Gela.Elements.Defs.Const is
------------------------------------
-- Range_Attribute_Reference_Node --
------------------------------------
type Range_Attribute_Reference_Node is
new Constraint_Node with private;
type Range_Attribute_Reference_Ptr is
access all Range_Attribute_Reference_Node;
for Range_Attribute_Reference_Ptr'Storage_Pool use Lists.Pool;
function New_Range_Attribute_Reference_Node
(The_Context : ASIS.Context)
return Range_Attribute_Reference_Ptr;
function Range_Attribute
(Element : Range_Attribute_Reference_Node) return Asis.Expression;
procedure Set_Range_Attribute
(Element : in out Range_Attribute_Reference_Node;
Value : in Asis.Expression);
function Constraint_Kind (Element : Range_Attribute_Reference_Node)
return Asis.Constraint_Kinds;
function Children (Element : access Range_Attribute_Reference_Node)
return Traverse_List;
function Clone
(Element : Range_Attribute_Reference_Node;
Parent : Asis.Element)
return Asis.Element;
procedure Copy
(Source : in Asis.Element;
Target : access Range_Attribute_Reference_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element);
----------------------------------
-- Simple_Expression_Range_Node --
----------------------------------
type Simple_Expression_Range_Node is
new Constraint_Node with private;
type Simple_Expression_Range_Ptr is
access all Simple_Expression_Range_Node;
for Simple_Expression_Range_Ptr'Storage_Pool use Lists.Pool;
function New_Simple_Expression_Range_Node
(The_Context : ASIS.Context)
return Simple_Expression_Range_Ptr;
function Lower_Bound
(Element : Simple_Expression_Range_Node) return Asis.Expression;
procedure Set_Lower_Bound
(Element : in out Simple_Expression_Range_Node;
Value : in Asis.Expression);
function Upper_Bound
(Element : Simple_Expression_Range_Node) return Asis.Expression;
procedure Set_Upper_Bound
(Element : in out Simple_Expression_Range_Node;
Value : in Asis.Expression);
function Constraint_Kind (Element : Simple_Expression_Range_Node)
return Asis.Constraint_Kinds;
function Children (Element : access Simple_Expression_Range_Node)
return Traverse_List;
function Clone
(Element : Simple_Expression_Range_Node;
Parent : Asis.Element)
return Asis.Element;
procedure Copy
(Source : in Asis.Element;
Target : access Simple_Expression_Range_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element);
----------------------------
-- Digits_Constraint_Node --
----------------------------
type Digits_Constraint_Node is
new Constraint_Node with private;
type Digits_Constraint_Ptr is
access all Digits_Constraint_Node;
for Digits_Constraint_Ptr'Storage_Pool use Lists.Pool;
function New_Digits_Constraint_Node
(The_Context : ASIS.Context)
return Digits_Constraint_Ptr;
function Digits_Expression
(Element : Digits_Constraint_Node) return Asis.Expression;
procedure Set_Digits_Expression
(Element : in out Digits_Constraint_Node;
Value : in Asis.Expression);
function Real_Range_Constraint
(Element : Digits_Constraint_Node) return Asis.Range_Constraint;
procedure Set_Real_Range_Constraint
(Element : in out Digits_Constraint_Node;
Value : in Asis.Range_Constraint);
function Constraint_Kind (Element : Digits_Constraint_Node)
return Asis.Constraint_Kinds;
function Children (Element : access Digits_Constraint_Node)
return Traverse_List;
function Clone
(Element : Digits_Constraint_Node;
Parent : Asis.Element)
return Asis.Element;
procedure Copy
(Source : in Asis.Element;
Target : access Digits_Constraint_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element);
---------------------------
-- Delta_Constraint_Node --
---------------------------
type Delta_Constraint_Node is
new Constraint_Node with private;
type Delta_Constraint_Ptr is
access all Delta_Constraint_Node;
for Delta_Constraint_Ptr'Storage_Pool use Lists.Pool;
function New_Delta_Constraint_Node
(The_Context : ASIS.Context)
return Delta_Constraint_Ptr;
function Delta_Expression
(Element : Delta_Constraint_Node) return Asis.Expression;
procedure Set_Delta_Expression
(Element : in out Delta_Constraint_Node;
Value : in Asis.Expression);
function Real_Range_Constraint
(Element : Delta_Constraint_Node) return Asis.Range_Constraint;
procedure Set_Real_Range_Constraint
(Element : in out Delta_Constraint_Node;
Value : in Asis.Range_Constraint);
function Constraint_Kind (Element : Delta_Constraint_Node)
return Asis.Constraint_Kinds;
function Children (Element : access Delta_Constraint_Node)
return Traverse_List;
function Clone
(Element : Delta_Constraint_Node;
Parent : Asis.Element)
return Asis.Element;
procedure Copy
(Source : in Asis.Element;
Target : access Delta_Constraint_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element);
---------------------------
-- Index_Constraint_Node --
---------------------------
type Index_Constraint_Node is
new Constraint_Node with private;
type Index_Constraint_Ptr is
access all Index_Constraint_Node;
for Index_Constraint_Ptr'Storage_Pool use Lists.Pool;
function New_Index_Constraint_Node
(The_Context : ASIS.Context)
return Index_Constraint_Ptr;
function Discrete_Ranges
(Element : Index_Constraint_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List;
procedure Set_Discrete_Ranges
(Element : in out Index_Constraint_Node;
Value : in Asis.Element);
function Discrete_Ranges_List
(Element : Index_Constraint_Node) return Asis.Element;
function Constraint_Kind (Element : Index_Constraint_Node)
return Asis.Constraint_Kinds;
function Children (Element : access Index_Constraint_Node)
return Traverse_List;
function Clone
(Element : Index_Constraint_Node;
Parent : Asis.Element)
return Asis.Element;
procedure Copy
(Source : in Asis.Element;
Target : access Index_Constraint_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element);
----------------------------------
-- Discriminant_Constraint_Node --
----------------------------------
type Discriminant_Constraint_Node is
new Constraint_Node with private;
type Discriminant_Constraint_Ptr is
access all Discriminant_Constraint_Node;
for Discriminant_Constraint_Ptr'Storage_Pool use Lists.Pool;
function New_Discriminant_Constraint_Node
(The_Context : ASIS.Context)
return Discriminant_Constraint_Ptr;
function Discriminant_Associations
(Element : Discriminant_Constraint_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List;
procedure Set_Discriminant_Associations
(Element : in out Discriminant_Constraint_Node;
Value : in Asis.Element);
function Discriminant_Associations_List
(Element : Discriminant_Constraint_Node) return Asis.Element;
function Normalized_Discriminant_Associations
(Element : Discriminant_Constraint_Node;
Include_Pragmas : in Boolean := False) return Asis.Element_List;
procedure Add_To_Normalized_Discriminant_Associations
(Element : in out Discriminant_Constraint_Node;
Item : in Asis.Element);
function Constraint_Kind (Element : Discriminant_Constraint_Node)
return Asis.Constraint_Kinds;
function Children (Element : access Discriminant_Constraint_Node)
return Traverse_List;
function Clone
(Element : Discriminant_Constraint_Node;
Parent : Asis.Element)
return Asis.Element;
procedure Copy
(Source : in Asis.Element;
Target : access Discriminant_Constraint_Node;
Cloner : in Cloner_Class;
Parent : in Asis.Element);
private
type Range_Attribute_Reference_Node is
new Constraint_Node with
record
Range_Attribute : aliased Asis.Expression;
end record;
type Simple_Expression_Range_Node is
new Constraint_Node with
record
Lower_Bound : aliased Asis.Expression;
Upper_Bound : aliased Asis.Expression;
end record;
type Digits_Constraint_Node is
new Constraint_Node with
record
Digits_Expression : aliased Asis.Expression;
Real_Range_Constraint : aliased Asis.Range_Constraint;
end record;
type Delta_Constraint_Node is
new Constraint_Node with
record
Delta_Expression : aliased Asis.Expression;
Real_Range_Constraint : aliased Asis.Range_Constraint;
end record;
type Index_Constraint_Node is
new Constraint_Node with
record
Discrete_Ranges : aliased Primary_Definition_Lists.List;
end record;
type Discriminant_Constraint_Node is
new Constraint_Node with
record
Discriminant_Associations : aliased Primary_Association_Lists.List;
Normalized_Discriminant_Associations : aliased Secondary_Association_Lists.List_Node;
end record;
end Asis.Gela.Elements.Defs.Const;
|
package volatile1 is
type Command is (Nothing, Get);
type Data is
record
Time : Duration;
end record;
type Data_Array is array (Integer range <>) of Data;
type Command_Data (Kind : Command; Length : Integer) is
record
case Kind is
when Nothing =>
null;
when Get =>
Data : Data_Array (1 .. Length);
end case;
end record;
end;
|
-----------------------------------------------------------------------
-- security-filters -- Security filter
-- Copyright (C) 2011, 2012, 2015, 2018 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- 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 Servlet.Security.Filters;
-- The <b>Security.Filters</b> package defines a servlet filter that can be activated
-- on requests to authenticate users and verify they have the permission to view
-- a page.
package ASF.Security.Filters is
SID_COOKIE : constant String := "SID";
AID_COOKIE : constant String := "AID";
subtype Auth_Filter is Servlet.Security.Filters.Auth_Filter;
end ASF.Security.Filters;
|
-- Copyright (c) 2013, Nordic Semiconductor ASA
-- 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 Nordic Semiconductor ASA nor the names of its
-- contributors may be used to endorse or promote products derived from
-- this software without specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
-- DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
-- FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
-- DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
-- SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
-- CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
-- OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
--
-- This spec has been automatically generated from nrf51.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package NRF_SVD.QDEC is
pragma Preelaborate;
---------------
-- Registers --
---------------
-- Shortcut between REPORTRDY event and READCLRACC task.
type SHORTS_REPORTRDY_READCLRACC_Field is
(-- Shortcut disabled.
Disabled,
-- Shortcut enabled.
Enabled)
with Size => 1;
for SHORTS_REPORTRDY_READCLRACC_Field use
(Disabled => 0,
Enabled => 1);
-- Shortcut between SAMPLERDY event and STOP task.
type SHORTS_SAMPLERDY_STOP_Field is
(-- Shortcut disabled.
Disabled,
-- Shortcut enabled.
Enabled)
with Size => 1;
for SHORTS_SAMPLERDY_STOP_Field use
(Disabled => 0,
Enabled => 1);
-- Shortcuts for the QDEC.
type SHORTS_Register is record
-- Shortcut between REPORTRDY event and READCLRACC task.
REPORTRDY_READCLRACC : SHORTS_REPORTRDY_READCLRACC_Field :=
NRF_SVD.QDEC.Disabled;
-- Shortcut between SAMPLERDY event and STOP task.
SAMPLERDY_STOP : SHORTS_SAMPLERDY_STOP_Field :=
NRF_SVD.QDEC.Disabled;
-- unspecified
Reserved_2_31 : HAL.UInt30 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SHORTS_Register use record
REPORTRDY_READCLRACC at 0 range 0 .. 0;
SAMPLERDY_STOP at 0 range 1 .. 1;
Reserved_2_31 at 0 range 2 .. 31;
end record;
-- Enable interrupt on SAMPLERDY event.
type INTENSET_SAMPLERDY_Field is
(-- Interrupt disabled.
Disabled,
-- Interrupt enabled.
Enabled)
with Size => 1;
for INTENSET_SAMPLERDY_Field use
(Disabled => 0,
Enabled => 1);
-- Enable interrupt on SAMPLERDY event.
type INTENSET_SAMPLERDY_Field_1 is
(-- Reset value for the field
Intenset_Samplerdy_Field_Reset,
-- Enable interrupt on write.
Set)
with Size => 1;
for INTENSET_SAMPLERDY_Field_1 use
(Intenset_Samplerdy_Field_Reset => 0,
Set => 1);
-- Enable interrupt on REPORTRDY event.
type INTENSET_REPORTRDY_Field is
(-- Interrupt disabled.
Disabled,
-- Interrupt enabled.
Enabled)
with Size => 1;
for INTENSET_REPORTRDY_Field use
(Disabled => 0,
Enabled => 1);
-- Enable interrupt on REPORTRDY event.
type INTENSET_REPORTRDY_Field_1 is
(-- Reset value for the field
Intenset_Reportrdy_Field_Reset,
-- Enable interrupt on write.
Set)
with Size => 1;
for INTENSET_REPORTRDY_Field_1 use
(Intenset_Reportrdy_Field_Reset => 0,
Set => 1);
-- Enable interrupt on ACCOF event.
type INTENSET_ACCOF_Field is
(-- Interrupt disabled.
Disabled,
-- Interrupt enabled.
Enabled)
with Size => 1;
for INTENSET_ACCOF_Field use
(Disabled => 0,
Enabled => 1);
-- Enable interrupt on ACCOF event.
type INTENSET_ACCOF_Field_1 is
(-- Reset value for the field
Intenset_Accof_Field_Reset,
-- Enable interrupt on write.
Set)
with Size => 1;
for INTENSET_ACCOF_Field_1 use
(Intenset_Accof_Field_Reset => 0,
Set => 1);
-- Interrupt enable set register.
type INTENSET_Register is record
-- Enable interrupt on SAMPLERDY event.
SAMPLERDY : INTENSET_SAMPLERDY_Field_1 :=
Intenset_Samplerdy_Field_Reset;
-- Enable interrupt on REPORTRDY event.
REPORTRDY : INTENSET_REPORTRDY_Field_1 :=
Intenset_Reportrdy_Field_Reset;
-- Enable interrupt on ACCOF event.
ACCOF : INTENSET_ACCOF_Field_1 := Intenset_Accof_Field_Reset;
-- unspecified
Reserved_3_31 : HAL.UInt29 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for INTENSET_Register use record
SAMPLERDY at 0 range 0 .. 0;
REPORTRDY at 0 range 1 .. 1;
ACCOF at 0 range 2 .. 2;
Reserved_3_31 at 0 range 3 .. 31;
end record;
-- Disable interrupt on SAMPLERDY event.
type INTENCLR_SAMPLERDY_Field is
(-- Interrupt disabled.
Disabled,
-- Interrupt enabled.
Enabled)
with Size => 1;
for INTENCLR_SAMPLERDY_Field use
(Disabled => 0,
Enabled => 1);
-- Disable interrupt on SAMPLERDY event.
type INTENCLR_SAMPLERDY_Field_1 is
(-- Reset value for the field
Intenclr_Samplerdy_Field_Reset,
-- Disable interrupt on write.
Clear)
with Size => 1;
for INTENCLR_SAMPLERDY_Field_1 use
(Intenclr_Samplerdy_Field_Reset => 0,
Clear => 1);
-- Disable interrupt on REPORTRDY event.
type INTENCLR_REPORTRDY_Field is
(-- Interrupt disabled.
Disabled,
-- Interrupt enabled.
Enabled)
with Size => 1;
for INTENCLR_REPORTRDY_Field use
(Disabled => 0,
Enabled => 1);
-- Disable interrupt on REPORTRDY event.
type INTENCLR_REPORTRDY_Field_1 is
(-- Reset value for the field
Intenclr_Reportrdy_Field_Reset,
-- Disable interrupt on write.
Clear)
with Size => 1;
for INTENCLR_REPORTRDY_Field_1 use
(Intenclr_Reportrdy_Field_Reset => 0,
Clear => 1);
-- Disable interrupt on ACCOF event.
type INTENCLR_ACCOF_Field is
(-- Interrupt disabled.
Disabled,
-- Interrupt enabled.
Enabled)
with Size => 1;
for INTENCLR_ACCOF_Field use
(Disabled => 0,
Enabled => 1);
-- Disable interrupt on ACCOF event.
type INTENCLR_ACCOF_Field_1 is
(-- Reset value for the field
Intenclr_Accof_Field_Reset,
-- Disable interrupt on write.
Clear)
with Size => 1;
for INTENCLR_ACCOF_Field_1 use
(Intenclr_Accof_Field_Reset => 0,
Clear => 1);
-- Interrupt enable clear register.
type INTENCLR_Register is record
-- Disable interrupt on SAMPLERDY event.
SAMPLERDY : INTENCLR_SAMPLERDY_Field_1 :=
Intenclr_Samplerdy_Field_Reset;
-- Disable interrupt on REPORTRDY event.
REPORTRDY : INTENCLR_REPORTRDY_Field_1 :=
Intenclr_Reportrdy_Field_Reset;
-- Disable interrupt on ACCOF event.
ACCOF : INTENCLR_ACCOF_Field_1 := Intenclr_Accof_Field_Reset;
-- unspecified
Reserved_3_31 : HAL.UInt29 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for INTENCLR_Register use record
SAMPLERDY at 0 range 0 .. 0;
REPORTRDY at 0 range 1 .. 1;
ACCOF at 0 range 2 .. 2;
Reserved_3_31 at 0 range 3 .. 31;
end record;
-- Enable or disable QDEC.
type ENABLE_ENABLE_Field is
(-- Disabled QDEC.
Disabled,
-- Enable QDEC.
Enabled)
with Size => 1;
for ENABLE_ENABLE_Field use
(Disabled => 0,
Enabled => 1);
-- Enable the QDEC.
type ENABLE_Register is record
-- Enable or disable QDEC.
ENABLE : ENABLE_ENABLE_Field := NRF_SVD.QDEC.Disabled;
-- unspecified
Reserved_1_31 : HAL.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ENABLE_Register use record
ENABLE at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
-- LED output pin polarity.
type LEDPOL_LEDPOL_Field is
(-- LED output is active low.
Activelow,
-- LED output is active high.
Activehigh)
with Size => 1;
for LEDPOL_LEDPOL_Field use
(Activelow => 0,
Activehigh => 1);
-- LED output pin polarity.
type LEDPOL_Register is record
-- LED output pin polarity.
LEDPOL : LEDPOL_LEDPOL_Field := NRF_SVD.QDEC.Activelow;
-- unspecified
Reserved_1_31 : HAL.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for LEDPOL_Register use record
LEDPOL at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
-- Sample period.
type SAMPLEPER_SAMPLEPER_Field is
(-- 128us sample period.
Val_128US,
-- 256us sample period.
Val_256US,
-- 512us sample period.
Val_512US,
-- 1024us sample period.
Val_1024US,
-- 2048us sample period.
Val_2048US,
-- 4096us sample period.
Val_4096US,
-- 8192us sample period.
Val_8192US,
-- 16384us sample period.
Val_16384US)
with Size => 3;
for SAMPLEPER_SAMPLEPER_Field use
(Val_128US => 0,
Val_256US => 1,
Val_512US => 2,
Val_1024US => 3,
Val_2048US => 4,
Val_4096US => 5,
Val_8192US => 6,
Val_16384US => 7);
-- Sample period.
type SAMPLEPER_Register is record
-- Sample period.
SAMPLEPER : SAMPLEPER_SAMPLEPER_Field := NRF_SVD.QDEC.Val_128US;
-- unspecified
Reserved_3_31 : HAL.UInt29 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SAMPLEPER_Register use record
SAMPLEPER at 0 range 0 .. 2;
Reserved_3_31 at 0 range 3 .. 31;
end record;
-- Number of samples to generate an EVENT_REPORTRDY.
type REPORTPER_REPORTPER_Field is
(-- 10 samples per report.
Val_10Smpl,
-- 40 samples per report.
Val_40Smpl,
-- 80 samples per report.
Val_80Smpl,
-- 120 samples per report.
Val_120Smpl,
-- 160 samples per report.
Val_160Smpl,
-- 200 samples per report.
Val_200Smpl,
-- 240 samples per report.
Val_240Smpl,
-- 280 samples per report.
Val_280Smpl)
with Size => 3;
for REPORTPER_REPORTPER_Field use
(Val_10Smpl => 0,
Val_40Smpl => 1,
Val_80Smpl => 2,
Val_120Smpl => 3,
Val_160Smpl => 4,
Val_200Smpl => 5,
Val_240Smpl => 6,
Val_280Smpl => 7);
-- Number of samples to generate an EVENT_REPORTRDY.
type REPORTPER_Register is record
-- Number of samples to generate an EVENT_REPORTRDY.
REPORTPER : REPORTPER_REPORTPER_Field := NRF_SVD.QDEC.Val_10Smpl;
-- unspecified
Reserved_3_31 : HAL.UInt29 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for REPORTPER_Register use record
REPORTPER at 0 range 0 .. 2;
Reserved_3_31 at 0 range 3 .. 31;
end record;
-- Enable debounce input filters.
type DBFEN_DBFEN_Field is
(-- Debounce input filters disabled.
Disabled,
-- Debounce input filters enabled.
Enabled)
with Size => 1;
for DBFEN_DBFEN_Field use
(Disabled => 0,
Enabled => 1);
-- Enable debouncer input filters.
type DBFEN_Register is record
-- Enable debounce input filters.
DBFEN : DBFEN_DBFEN_Field := NRF_SVD.QDEC.Disabled;
-- unspecified
Reserved_1_31 : HAL.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for DBFEN_Register use record
DBFEN at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
subtype LEDPRE_LEDPRE_Field is HAL.UInt9;
-- Time LED is switched ON before the sample.
type LEDPRE_Register is record
-- Period in us the LED in switched on prior to sampling.
LEDPRE : LEDPRE_LEDPRE_Field := 16#10#;
-- unspecified
Reserved_9_31 : HAL.UInt23 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for LEDPRE_Register use record
LEDPRE at 0 range 0 .. 8;
Reserved_9_31 at 0 range 9 .. 31;
end record;
subtype ACCDBL_ACCDBL_Field is HAL.UInt4;
-- Accumulated double (error) transitions register.
type ACCDBL_Register is record
-- Read-only. Accumulated double (error) transitions.
ACCDBL : ACCDBL_ACCDBL_Field;
-- unspecified
Reserved_4_31 : HAL.UInt28;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ACCDBL_Register use record
ACCDBL at 0 range 0 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
subtype ACCDBLREAD_ACCDBLREAD_Field is HAL.UInt4;
-- Snapshot of ACCDBL register. Value generated by the TASKS_READCLEACC
-- task.
type ACCDBLREAD_Register is record
-- Read-only. Snapshot of accumulated double (error) transitions.
ACCDBLREAD : ACCDBLREAD_ACCDBLREAD_Field;
-- unspecified
Reserved_4_31 : HAL.UInt28;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ACCDBLREAD_Register use record
ACCDBLREAD at 0 range 0 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
-- Peripheral power control.
type POWER_POWER_Field is
(-- Module power disabled.
Disabled,
-- Module power enabled.
Enabled)
with Size => 1;
for POWER_POWER_Field use
(Disabled => 0,
Enabled => 1);
-- Peripheral power control.
type POWER_Register is record
-- Peripheral power control.
POWER : POWER_POWER_Field := NRF_SVD.QDEC.Disabled;
-- unspecified
Reserved_1_31 : HAL.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for POWER_Register use record
POWER at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Rotary decoder.
type QDEC_Peripheral is record
-- Start the quadrature decoder.
TASKS_START : aliased HAL.UInt32;
-- Stop the quadrature decoder.
TASKS_STOP : aliased HAL.UInt32;
-- Transfers the content from ACC registers to ACCREAD registers, and
-- clears the ACC registers.
TASKS_READCLRACC : aliased HAL.UInt32;
-- A new sample is written to the sample register.
EVENTS_SAMPLERDY : aliased HAL.UInt32;
-- REPORTPER number of samples accumulated in ACC register, and ACC
-- register different than zero.
EVENTS_REPORTRDY : aliased HAL.UInt32;
-- ACC or ACCDBL register overflow.
EVENTS_ACCOF : aliased HAL.UInt32;
-- Shortcuts for the QDEC.
SHORTS : aliased SHORTS_Register;
-- Interrupt enable set register.
INTENSET : aliased INTENSET_Register;
-- Interrupt enable clear register.
INTENCLR : aliased INTENCLR_Register;
-- Enable the QDEC.
ENABLE : aliased ENABLE_Register;
-- LED output pin polarity.
LEDPOL : aliased LEDPOL_Register;
-- Sample period.
SAMPLEPER : aliased SAMPLEPER_Register;
-- Motion sample value.
SAMPLE : aliased HAL.UInt32;
-- Number of samples to generate an EVENT_REPORTRDY.
REPORTPER : aliased REPORTPER_Register;
-- Accumulated valid transitions register.
ACC : aliased HAL.UInt32;
-- Snapshot of ACC register. Value generated by the TASKS_READCLEACC
-- task.
ACCREAD : aliased HAL.UInt32;
-- Pin select for LED output.
PSELLED : aliased HAL.UInt32;
-- Pin select for phase A input.
PSELA : aliased HAL.UInt32;
-- Pin select for phase B input.
PSELB : aliased HAL.UInt32;
-- Enable debouncer input filters.
DBFEN : aliased DBFEN_Register;
-- Time LED is switched ON before the sample.
LEDPRE : aliased LEDPRE_Register;
-- Accumulated double (error) transitions register.
ACCDBL : aliased ACCDBL_Register;
-- Snapshot of ACCDBL register. Value generated by the TASKS_READCLEACC
-- task.
ACCDBLREAD : aliased ACCDBLREAD_Register;
-- Peripheral power control.
POWER : aliased POWER_Register;
end record
with Volatile;
for QDEC_Peripheral use record
TASKS_START at 16#0# range 0 .. 31;
TASKS_STOP at 16#4# range 0 .. 31;
TASKS_READCLRACC at 16#8# range 0 .. 31;
EVENTS_SAMPLERDY at 16#100# range 0 .. 31;
EVENTS_REPORTRDY at 16#104# range 0 .. 31;
EVENTS_ACCOF at 16#108# range 0 .. 31;
SHORTS at 16#200# range 0 .. 31;
INTENSET at 16#304# range 0 .. 31;
INTENCLR at 16#308# range 0 .. 31;
ENABLE at 16#500# range 0 .. 31;
LEDPOL at 16#504# range 0 .. 31;
SAMPLEPER at 16#508# range 0 .. 31;
SAMPLE at 16#50C# range 0 .. 31;
REPORTPER at 16#510# range 0 .. 31;
ACC at 16#514# range 0 .. 31;
ACCREAD at 16#518# range 0 .. 31;
PSELLED at 16#51C# range 0 .. 31;
PSELA at 16#520# range 0 .. 31;
PSELB at 16#524# range 0 .. 31;
DBFEN at 16#528# range 0 .. 31;
LEDPRE at 16#540# range 0 .. 31;
ACCDBL at 16#544# range 0 .. 31;
ACCDBLREAD at 16#548# range 0 .. 31;
POWER at 16#FFC# range 0 .. 31;
end record;
-- Rotary decoder.
QDEC_Periph : aliased QDEC_Peripheral
with Import, Address => QDEC_Base;
end NRF_SVD.QDEC;
|
-- Copyright 2008-2021 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package Pck is
type Data is record
One : Integer;
Two : Integer;
Three : Integer;
Four : Integer;
Five : Integer;
Six : Integer;
end record;
procedure Call_Me (D : in out Data);
end Pck;
|
-----------------------------------------------------------------------
-- awa-users-filters -- Specific filters for authentication and key verification
-- Copyright (C) 2011, 2012, 2013 Stephane Carrez
-- Written by Stephane Carrez (Stephane.Carrez@gmail.com)
--
-- 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 ASF.Cookies;
with AWA.Users.Services;
with AWA.Users.Modules;
package body AWA.Users.Filters is
-- The logger
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("AWA.Users.Filters");
-- ------------------------------
-- Set the user principal on the session associated with the ASF request.
-- ------------------------------
procedure Set_Session_Principal (Request : in out ASF.Requests.Request'Class;
Principal : in Principals.Principal_Access) is
Session : ASF.Sessions.Session := Request.Get_Session (Create => True);
begin
Session.Set_Principal (Principal.all'Access);
end Set_Session_Principal;
-- ------------------------------
-- Initialize the filter and configure the redirection URIs.
-- ------------------------------
procedure Initialize (Filter : in out Auth_Filter;
Context : in ASF.Servlets.Servlet_Registry'Class) is
URI : constant String := Context.Get_Init_Parameter (AUTH_FILTER_REDIRECT_PARAM);
begin
Log.Info ("Using login URI: {0}", URI);
if URI = "" then
Log.Error ("The login URI is empty. Redirection to the login page will not work.");
end if;
Filter.Login_URI := To_Unbounded_String (URI);
ASF.Security.Filters.Auth_Filter (Filter).Initialize (Context);
end Initialize;
procedure Authenticate (F : in Auth_Filter;
Request : in out ASF.Requests.Request'Class;
Response : in out ASF.Responses.Response'Class;
Session : in ASF.Sessions.Session;
Auth_Id : in String;
Principal : out ASF.Principals.Principal_Access) is
pragma Unreferenced (F, Session);
use AWA.Users.Modules;
use AWA.Users.Services;
Manager : constant User_Service_Access := AWA.Users.Modules.Get_User_Manager;
P : AWA.Users.Principals.Principal_Access;
begin
Manager.Authenticate (Cookie => Auth_Id,
Ip_Addr => "",
Principal => P);
Principal := P.all'Access;
-- Setup a new AID cookie with the new connection session.
declare
Cookie : constant String := Manager.Get_Authenticate_Cookie (P.Get_Session_Identifier);
C : ASF.Cookies.Cookie := ASF.Cookies.Create (ASF.Security.Filters.AID_COOKIE,
Cookie);
begin
ASF.Cookies.Set_Path (C, Request.Get_Context_Path);
ASF.Cookies.Set_Max_Age (C, 15 * 86400);
Response.Add_Cookie (Cookie => C);
end;
exception
when Not_Found =>
Principal := null;
end Authenticate;
-- ------------------------------
-- Display or redirects the user to the login page. This procedure is called when
-- the user is not authenticated.
-- ------------------------------
overriding
procedure Do_Login (Filter : in Auth_Filter;
Request : in out ASF.Requests.Request'Class;
Response : in out ASF.Responses.Response'Class) is
URI : constant String := To_String (Filter.Login_URI);
begin
Log.Info ("User is not logged, redirecting to {0}", URI);
if Request.Get_Header ("X-Requested-With") = "" then
Response.Send_Redirect (Location => URI);
else
Response.Send_Error (ASF.Responses.SC_UNAUTHORIZED);
end if;
end Do_Login;
-- ------------------------------
-- Initialize the filter and configure the redirection URIs.
-- ------------------------------
overriding
procedure Initialize (Filter : in out Verify_Filter;
Context : in ASF.Servlets.Servlet_Registry'Class) is
URI : constant String := Context.Get_Init_Parameter (VERIFY_FILTER_REDIRECT_PARAM);
begin
Filter.Invalid_Key_URI := To_Unbounded_String (URI);
end Initialize;
-- ------------------------------
-- Filter a request which contains an access key and verify that the
-- key is valid and identifies a user. Once the user is known, create
-- a session and setup the user principal.
--
-- If the access key is missing or invalid, redirect to the
-- <b>Invalid_Key_URI</b> associated with the filter.
-- ------------------------------
overriding
procedure Do_Filter (Filter : in Verify_Filter;
Request : in out ASF.Requests.Request'Class;
Response : in out ASF.Responses.Response'Class;
Chain : in out ASF.Servlets.Filter_Chain) is
Key : constant String := Request.Get_Parameter (PARAM_ACCESS_KEY);
Manager : constant Users.Services.User_Service_Access := Users.Modules.Get_User_Manager;
Principal : AWA.Users.Principals.Principal_Access;
begin
Log.Info ("Verify access key {0}", Key);
Manager.Verify_User (Key => Key,
IpAddr => "",
Principal => Principal);
Set_Session_Principal (Request, Principal);
-- Request is authorized, proceed to the next filter.
ASF.Servlets.Do_Filter (Chain => Chain,
Request => Request,
Response => Response);
exception
when AWA.Users.Services.Not_Found =>
declare
URI : constant String := To_String (Filter.Invalid_Key_URI);
begin
Log.Info ("Invalid access key {0}, redirecting to {1}", Key, URI);
Response.Send_Redirect (Location => URI);
end;
end Do_Filter;
end AWA.Users.Filters;
|
------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <vgodunko@gmail.com> --
-- 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 body AMF.Internals.Tables.Utp_Metamodel is
----------------
-- MM_Utp_Utp --
----------------
function MM_Utp_Utp return AMF.Internals.CMOF_Element is
begin
return Base + 126;
end MM_Utp_Utp;
---------------------
-- MC_Utp_Duration --
---------------------
function MC_Utp_Duration return AMF.Internals.CMOF_Element is
begin
return Base + 137;
end MC_Utp_Duration;
-----------------
-- MC_Utp_Time --
-----------------
function MC_Utp_Time return AMF.Internals.CMOF_Element is
begin
return Base + 136;
end MC_Utp_Time;
---------------------
-- MC_Utp_Timezone --
---------------------
function MC_Utp_Timezone return AMF.Internals.CMOF_Element is
begin
return Base + 135;
end MC_Utp_Timezone;
--------------------
-- MC_Utp_Verdict --
--------------------
function MC_Utp_Verdict return AMF.Internals.CMOF_Element is
begin
return Base + 129;
end MC_Utp_Verdict;
------------------------
-- MC_Utp_Coding_Rule --
------------------------
function MC_Utp_Coding_Rule return AMF.Internals.CMOF_Element is
begin
return Base + 1;
end MC_Utp_Coding_Rule;
---------------------------
-- MC_Utp_Data_Partition --
---------------------------
function MC_Utp_Data_Partition return AMF.Internals.CMOF_Element is
begin
return Base + 2;
end MC_Utp_Data_Partition;
----------------------
-- MC_Utp_Data_Pool --
----------------------
function MC_Utp_Data_Pool return AMF.Internals.CMOF_Element is
begin
return Base + 3;
end MC_Utp_Data_Pool;
--------------------------
-- MC_Utp_Data_Selector --
--------------------------
function MC_Utp_Data_Selector return AMF.Internals.CMOF_Element is
begin
return Base + 4;
end MC_Utp_Data_Selector;
--------------------
-- MC_Utp_Default --
--------------------
function MC_Utp_Default return AMF.Internals.CMOF_Element is
begin
return Base + 5;
end MC_Utp_Default;
--------------------------------
-- MC_Utp_Default_Application --
--------------------------------
function MC_Utp_Default_Application return AMF.Internals.CMOF_Element is
begin
return Base + 6;
end MC_Utp_Default_Application;
-----------------------
-- MC_Utp_Determ_Alt --
-----------------------
function MC_Utp_Determ_Alt return AMF.Internals.CMOF_Element is
begin
return Base + 7;
end MC_Utp_Determ_Alt;
--------------------------
-- MC_Utp_Finish_Action --
--------------------------
function MC_Utp_Finish_Action return AMF.Internals.CMOF_Element is
begin
return Base + 8;
end MC_Utp_Finish_Action;
--------------------------------
-- MC_Utp_Get_Timezone_Action --
--------------------------------
function MC_Utp_Get_Timezone_Action return AMF.Internals.CMOF_Element is
begin
return Base + 9;
end MC_Utp_Get_Timezone_Action;
------------------------
-- MC_Utp_Literal_Any --
------------------------
function MC_Utp_Literal_Any return AMF.Internals.CMOF_Element is
begin
return Base + 10;
end MC_Utp_Literal_Any;
--------------------------------
-- MC_Utp_Literal_Any_Or_Null --
--------------------------------
function MC_Utp_Literal_Any_Or_Null return AMF.Internals.CMOF_Element is
begin
return Base + 11;
end MC_Utp_Literal_Any_Or_Null;
-----------------------
-- MC_Utp_Log_Action --
-----------------------
function MC_Utp_Log_Action return AMF.Internals.CMOF_Element is
begin
return Base + 12;
end MC_Utp_Log_Action;
----------------------------
-- MC_Utp_Managed_Element --
----------------------------
function MC_Utp_Managed_Element return AMF.Internals.CMOF_Element is
begin
return Base + 13;
end MC_Utp_Managed_Element;
------------------------------
-- MC_Utp_Read_Timer_Action --
------------------------------
function MC_Utp_Read_Timer_Action return AMF.Internals.CMOF_Element is
begin
return Base + 14;
end MC_Utp_Read_Timer_Action;
----------------
-- MC_Utp_SUT --
----------------
function MC_Utp_SUT return AMF.Internals.CMOF_Element is
begin
return Base + 15;
end MC_Utp_SUT;
--------------------------------
-- MC_Utp_Set_Timezone_Action --
--------------------------------
function MC_Utp_Set_Timezone_Action return AMF.Internals.CMOF_Element is
begin
return Base + 16;
end MC_Utp_Set_Timezone_Action;
-------------------------------
-- MC_Utp_Start_Timer_Action --
-------------------------------
function MC_Utp_Start_Timer_Action return AMF.Internals.CMOF_Element is
begin
return Base + 17;
end MC_Utp_Start_Timer_Action;
------------------------------
-- MC_Utp_Stop_Timer_Action --
------------------------------
function MC_Utp_Stop_Timer_Action return AMF.Internals.CMOF_Element is
begin
return Base + 18;
end MC_Utp_Stop_Timer_Action;
----------------------
-- MC_Utp_Test_Case --
----------------------
function MC_Utp_Test_Case return AMF.Internals.CMOF_Element is
begin
return Base + 19;
end MC_Utp_Test_Case;
---------------------------
-- MC_Utp_Test_Component --
---------------------------
function MC_Utp_Test_Component return AMF.Internals.CMOF_Element is
begin
return Base + 20;
end MC_Utp_Test_Component;
-------------------------
-- MC_Utp_Test_Context --
-------------------------
function MC_Utp_Test_Context return AMF.Internals.CMOF_Element is
begin
return Base + 21;
end MC_Utp_Test_Context;
---------------------
-- MC_Utp_Test_Log --
---------------------
function MC_Utp_Test_Log return AMF.Internals.CMOF_Element is
begin
return Base + 22;
end MC_Utp_Test_Log;
---------------------------------
-- MC_Utp_Test_Log_Application --
---------------------------------
function MC_Utp_Test_Log_Application return AMF.Internals.CMOF_Element is
begin
return Base + 23;
end MC_Utp_Test_Log_Application;
---------------------------
-- MC_Utp_Test_Objective --
---------------------------
function MC_Utp_Test_Objective return AMF.Internals.CMOF_Element is
begin
return Base + 24;
end MC_Utp_Test_Objective;
-----------------------
-- MC_Utp_Test_Suite --
-----------------------
function MC_Utp_Test_Suite return AMF.Internals.CMOF_Element is
begin
return Base + 25;
end MC_Utp_Test_Suite;
---------------------
-- MC_Utp_Time_Out --
---------------------
function MC_Utp_Time_Out return AMF.Internals.CMOF_Element is
begin
return Base + 26;
end MC_Utp_Time_Out;
----------------------------
-- MC_Utp_Time_Out_Action --
----------------------------
function MC_Utp_Time_Out_Action return AMF.Internals.CMOF_Element is
begin
return Base + 27;
end MC_Utp_Time_Out_Action;
-----------------------------
-- MC_Utp_Time_Out_Message --
-----------------------------
function MC_Utp_Time_Out_Message return AMF.Internals.CMOF_Element is
begin
return Base + 28;
end MC_Utp_Time_Out_Message;
---------------------------------
-- MC_Utp_Timer_Running_Action --
---------------------------------
function MC_Utp_Timer_Running_Action return AMF.Internals.CMOF_Element is
begin
return Base + 29;
end MC_Utp_Timer_Running_Action;
------------------------------
-- MC_Utp_Validation_Action --
------------------------------
function MC_Utp_Validation_Action return AMF.Internals.CMOF_Element is
begin
return Base + 30;
end MC_Utp_Validation_Action;
---------------------------------------------------------------
-- MP_Utp_Coding_Rule_Base_Namespace_A_Extension_Coding_Rule --
---------------------------------------------------------------
function MP_Utp_Coding_Rule_Base_Namespace_A_Extension_Coding_Rule return AMF.Internals.CMOF_Element is
begin
return Base + 32;
end MP_Utp_Coding_Rule_Base_Namespace_A_Extension_Coding_Rule;
--------------------------------------------------------------
-- MP_Utp_Coding_Rule_Base_Property_A_Extension_Coding_Rule --
--------------------------------------------------------------
function MP_Utp_Coding_Rule_Base_Property_A_Extension_Coding_Rule return AMF.Internals.CMOF_Element is
begin
return Base + 33;
end MP_Utp_Coding_Rule_Base_Property_A_Extension_Coding_Rule;
-------------------------------------------------------------------------
-- MP_Utp_Coding_Rule_Base_Value_Specification_A_Extension_Coding_Rule --
-------------------------------------------------------------------------
function MP_Utp_Coding_Rule_Base_Value_Specification_A_Extension_Coding_Rule return AMF.Internals.CMOF_Element is
begin
return Base + 34;
end MP_Utp_Coding_Rule_Base_Value_Specification_A_Extension_Coding_Rule;
-------------------------------
-- MP_Utp_Coding_Rule_Coding --
-------------------------------
function MP_Utp_Coding_Rule_Coding return AMF.Internals.CMOF_Element is
begin
return Base + 35;
end MP_Utp_Coding_Rule_Coding;
----------------------------------------------------------------------
-- MP_Utp_Data_Partition_Base_Classifier_A_Extension_Data_Partition --
----------------------------------------------------------------------
function MP_Utp_Data_Partition_Base_Classifier_A_Extension_Data_Partition return AMF.Internals.CMOF_Element is
begin
return Base + 36;
end MP_Utp_Data_Partition_Base_Classifier_A_Extension_Data_Partition;
------------------------------------------------------------
-- MP_Utp_Data_Pool_Base_Classifier_A_Extension_Data_Pool --
------------------------------------------------------------
function MP_Utp_Data_Pool_Base_Classifier_A_Extension_Data_Pool return AMF.Internals.CMOF_Element is
begin
return Base + 37;
end MP_Utp_Data_Pool_Base_Classifier_A_Extension_Data_Pool;
----------------------------------------------------------
-- MP_Utp_Data_Pool_Base_Property_A_Extension_Data_Pool --
----------------------------------------------------------
function MP_Utp_Data_Pool_Base_Property_A_Extension_Data_Pool return AMF.Internals.CMOF_Element is
begin
return Base + 38;
end MP_Utp_Data_Pool_Base_Property_A_Extension_Data_Pool;
-------------------------------------------------------------------
-- MP_Utp_Data_Selector_Base_Operation_A_Extension_Data_Selector --
-------------------------------------------------------------------
function MP_Utp_Data_Selector_Base_Operation_A_Extension_Data_Selector return AMF.Internals.CMOF_Element is
begin
return Base + 39;
end MP_Utp_Data_Selector_Base_Operation_A_Extension_Data_Selector;
------------------------------------------------------
-- MP_Utp_Default_Base_Behavior_A_Extension_Default --
------------------------------------------------------
function MP_Utp_Default_Base_Behavior_A_Extension_Default return AMF.Internals.CMOF_Element is
begin
return Base + 40;
end MP_Utp_Default_Base_Behavior_A_Extension_Default;
--------------------------------------------------------------------------------
-- MP_Utp_Default_Application_Base_Dependency_A_Extension_Default_Application --
--------------------------------------------------------------------------------
function MP_Utp_Default_Application_Base_Dependency_A_Extension_Default_Application return AMF.Internals.CMOF_Element is
begin
return Base + 41;
end MP_Utp_Default_Application_Base_Dependency_A_Extension_Default_Application;
-------------------------------------------
-- MP_Utp_Default_Application_Repetition --
-------------------------------------------
function MP_Utp_Default_Application_Repetition return AMF.Internals.CMOF_Element is
begin
return Base + 42;
end MP_Utp_Default_Application_Repetition;
---------------------------------------------------------------------
-- MP_Utp_Determ_Alt_Base_Combined_Fragment_A_Extension_Determ_Alt --
---------------------------------------------------------------------
function MP_Utp_Determ_Alt_Base_Combined_Fragment_A_Extension_Determ_Alt return AMF.Internals.CMOF_Element is
begin
return Base + 43;
end MP_Utp_Determ_Alt_Base_Combined_Fragment_A_Extension_Determ_Alt;
---------------------------------------------------------------------------
-- MP_Utp_Finish_Action_Base_Invocation_Action_A_Extension_Finish_Action --
---------------------------------------------------------------------------
function MP_Utp_Finish_Action_Base_Invocation_Action_A_Extension_Finish_Action return AMF.Internals.CMOF_Element is
begin
return Base + 44;
end MP_Utp_Finish_Action_Base_Invocation_Action_A_Extension_Finish_Action;
-----------------------------------------------------------------------
-- MP_Utp_Finish_Action_Base_Opaque_Action_A_Extension_Finish_Action --
-----------------------------------------------------------------------
function MP_Utp_Finish_Action_Base_Opaque_Action_A_Extension_Finish_Action return AMF.Internals.CMOF_Element is
begin
return Base + 45;
end MP_Utp_Finish_Action_Base_Opaque_Action_A_Extension_Finish_Action;
----------------------------------------------------------------------------------------------------
-- MP_Utp_Get_Timezone_Action_Base_Read_Structural_Feature_Action_A_Extension_Get_Timezone_Action --
----------------------------------------------------------------------------------------------------
function MP_Utp_Get_Timezone_Action_Base_Read_Structural_Feature_Action_A_Extension_Get_Timezone_Action return AMF.Internals.CMOF_Element is
begin
return Base + 46;
end MP_Utp_Get_Timezone_Action_Base_Read_Structural_Feature_Action_A_Extension_Get_Timezone_Action;
---------------------------------------------------------------------------
-- MP_Utp_Literal_Any_Base_Literal_Specification_A_Extension_Literal_Any --
---------------------------------------------------------------------------
function MP_Utp_Literal_Any_Base_Literal_Specification_A_Extension_Literal_Any return AMF.Internals.CMOF_Element is
begin
return Base + 47;
end MP_Utp_Literal_Any_Base_Literal_Specification_A_Extension_Literal_Any;
-------------------------------------------------------------------------------------------
-- MP_Utp_Literal_Any_Or_Null_Base_Literal_Specification_A_Extension_Literal_Any_Or_Null --
-------------------------------------------------------------------------------------------
function MP_Utp_Literal_Any_Or_Null_Base_Literal_Specification_A_Extension_Literal_Any_Or_Null return AMF.Internals.CMOF_Element is
begin
return Base + 48;
end MP_Utp_Literal_Any_Or_Null_Base_Literal_Specification_A_Extension_Literal_Any_Or_Null;
----------------------------------------------------------------------
-- MP_Utp_Log_Action_Base_Send_Object_Action_A_Extension_Log_Action --
----------------------------------------------------------------------
function MP_Utp_Log_Action_Base_Send_Object_Action_A_Extension_Log_Action return AMF.Internals.CMOF_Element is
begin
return Base + 49;
end MP_Utp_Log_Action_Base_Send_Object_Action_A_Extension_Log_Action;
---------------------------------------------------------------------
-- MP_Utp_Managed_Element_Base_Element_A_Extension_Managed_Element --
---------------------------------------------------------------------
function MP_Utp_Managed_Element_Base_Element_A_Extension_Managed_Element return AMF.Internals.CMOF_Element is
begin
return Base + 50;
end MP_Utp_Managed_Element_Base_Element_A_Extension_Managed_Element;
----------------------------------------
-- MP_Utp_Managed_Element_Criticality --
----------------------------------------
function MP_Utp_Managed_Element_Criticality return AMF.Internals.CMOF_Element is
begin
return Base + 51;
end MP_Utp_Managed_Element_Criticality;
----------------------------------------
-- MP_Utp_Managed_Element_Description --
----------------------------------------
function MP_Utp_Managed_Element_Description return AMF.Internals.CMOF_Element is
begin
return Base + 52;
end MP_Utp_Managed_Element_Description;
----------------------------------
-- MP_Utp_Managed_Element_Owner --
----------------------------------
function MP_Utp_Managed_Element_Owner return AMF.Internals.CMOF_Element is
begin
return Base + 53;
end MP_Utp_Managed_Element_Owner;
------------------------------------
-- MP_Utp_Managed_Element_Version --
------------------------------------
function MP_Utp_Managed_Element_Version return AMF.Internals.CMOF_Element is
begin
return Base + 54;
end MP_Utp_Managed_Element_Version;
---------------------------------------------------------------------------------------
-- MP_Utp_Read_Timer_Action_Base_Call_Operation_Action_A_Extension_Read_Timer_Action --
---------------------------------------------------------------------------------------
function MP_Utp_Read_Timer_Action_Base_Call_Operation_Action_A_Extension_Read_Timer_Action return AMF.Internals.CMOF_Element is
begin
return Base + 55;
end MP_Utp_Read_Timer_Action_Base_Call_Operation_Action_A_Extension_Read_Timer_Action;
----------------------------------------------
-- MP_Utp_SUT_Base_Property_A_Extension_SUT --
----------------------------------------------
function MP_Utp_SUT_Base_Property_A_Extension_SUT return AMF.Internals.CMOF_Element is
begin
return Base + 56;
end MP_Utp_SUT_Base_Property_A_Extension_SUT;
-----------------------------------------------------------------------------------------------------
-- MP_Utp_Set_Timezone_Action_Base_Write_Structural_Feature_Action_A_Extension_Set_Timezone_Action --
-----------------------------------------------------------------------------------------------------
function MP_Utp_Set_Timezone_Action_Base_Write_Structural_Feature_Action_A_Extension_Set_Timezone_Action return AMF.Internals.CMOF_Element is
begin
return Base + 57;
end MP_Utp_Set_Timezone_Action_Base_Write_Structural_Feature_Action_A_Extension_Set_Timezone_Action;
-----------------------------------------------------------------------------------------
-- MP_Utp_Start_Timer_Action_Base_Call_Operation_Action_A_Extension_Start_Timer_Action --
-----------------------------------------------------------------------------------------
function MP_Utp_Start_Timer_Action_Base_Call_Operation_Action_A_Extension_Start_Timer_Action return AMF.Internals.CMOF_Element is
begin
return Base + 58;
end MP_Utp_Start_Timer_Action_Base_Call_Operation_Action_A_Extension_Start_Timer_Action;
---------------------------------------------------------------------------------------
-- MP_Utp_Stop_Timer_Action_Base_Call_Operation_Action_A_Extension_Stop_Timer_Action --
---------------------------------------------------------------------------------------
function MP_Utp_Stop_Timer_Action_Base_Call_Operation_Action_A_Extension_Stop_Timer_Action return AMF.Internals.CMOF_Element is
begin
return Base + 59;
end MP_Utp_Stop_Timer_Action_Base_Call_Operation_Action_A_Extension_Stop_Timer_Action;
----------------------------------------------------------
-- MP_Utp_Test_Case_Base_Behavior_A_Extension_Test_Case --
----------------------------------------------------------
function MP_Utp_Test_Case_Base_Behavior_A_Extension_Test_Case return AMF.Internals.CMOF_Element is
begin
return Base + 60;
end MP_Utp_Test_Case_Base_Behavior_A_Extension_Test_Case;
-----------------------------------------------------------
-- MP_Utp_Test_Case_Base_Operation_A_Extension_Test_Case --
-----------------------------------------------------------
function MP_Utp_Test_Case_Base_Operation_A_Extension_Test_Case return AMF.Internals.CMOF_Element is
begin
return Base + 61;
end MP_Utp_Test_Case_Base_Operation_A_Extension_Test_Case;
---------------------------------------------
-- MP_Utp_Test_Case_Compatible_SUT_Variant --
---------------------------------------------
function MP_Utp_Test_Case_Compatible_SUT_Variant return AMF.Internals.CMOF_Element is
begin
return Base + 62;
end MP_Utp_Test_Case_Compatible_SUT_Variant;
---------------------------------------------
-- MP_Utp_Test_Case_Compatible_SUT_Version --
---------------------------------------------
function MP_Utp_Test_Case_Compatible_SUT_Version return AMF.Internals.CMOF_Element is
begin
return Base + 63;
end MP_Utp_Test_Case_Compatible_SUT_Version;
-------------------------------
-- MP_Utp_Test_Case_Priority --
-------------------------------
function MP_Utp_Test_Case_Priority return AMF.Internals.CMOF_Element is
begin
return Base + 64;
end MP_Utp_Test_Case_Priority;
---------------------------------------------------------------------------------
-- MP_Utp_Test_Component_Base_Structured_Classifier_A_Extension_Test_Component --
---------------------------------------------------------------------------------
function MP_Utp_Test_Component_Base_Structured_Classifier_A_Extension_Test_Component return AMF.Internals.CMOF_Element is
begin
return Base + 65;
end MP_Utp_Test_Component_Base_Structured_Classifier_A_Extension_Test_Component;
--------------------------------------------------
-- MP_Utp_Test_Component_Compatible_SUT_Variant --
--------------------------------------------------
function MP_Utp_Test_Component_Compatible_SUT_Variant return AMF.Internals.CMOF_Element is
begin
return Base + 66;
end MP_Utp_Test_Component_Compatible_SUT_Variant;
--------------------------------------------------
-- MP_Utp_Test_Component_Compatible_SUT_Version --
--------------------------------------------------
function MP_Utp_Test_Component_Compatible_SUT_Version return AMF.Internals.CMOF_Element is
begin
return Base + 67;
end MP_Utp_Test_Component_Compatible_SUT_Version;
-----------------------------------------------------------------------------
-- MP_Utp_Test_Context_Base_Behaviored_Classifier_A_Extension_Test_Context --
-----------------------------------------------------------------------------
function MP_Utp_Test_Context_Base_Behaviored_Classifier_A_Extension_Test_Context return AMF.Internals.CMOF_Element is
begin
return Base + 68;
end MP_Utp_Test_Context_Base_Behaviored_Classifier_A_Extension_Test_Context;
-----------------------------------------------------------------------------
-- MP_Utp_Test_Context_Base_Structured_Classifier_A_Extension_Test_Context --
-----------------------------------------------------------------------------
function MP_Utp_Test_Context_Base_Structured_Classifier_A_Extension_Test_Context return AMF.Internals.CMOF_Element is
begin
return Base + 69;
end MP_Utp_Test_Context_Base_Structured_Classifier_A_Extension_Test_Context;
------------------------------------------------
-- MP_Utp_Test_Context_Compatible_SUT_Variant --
------------------------------------------------
function MP_Utp_Test_Context_Compatible_SUT_Variant return AMF.Internals.CMOF_Element is
begin
return Base + 70;
end MP_Utp_Test_Context_Compatible_SUT_Variant;
------------------------------------------------
-- MP_Utp_Test_Context_Compatible_SUT_Version --
------------------------------------------------
function MP_Utp_Test_Context_Compatible_SUT_Version return AMF.Internals.CMOF_Element is
begin
return Base + 71;
end MP_Utp_Test_Context_Compatible_SUT_Version;
------------------------------------
-- MP_Utp_Test_Context_Test_Level --
------------------------------------
function MP_Utp_Test_Context_Test_Level return AMF.Internals.CMOF_Element is
begin
return Base + 72;
end MP_Utp_Test_Context_Test_Level;
--------------------------------------------------------
-- MP_Utp_Test_Log_Base_Behavior_A_Extension_Test_Log --
--------------------------------------------------------
function MP_Utp_Test_Log_Base_Behavior_A_Extension_Test_Log return AMF.Internals.CMOF_Element is
begin
return Base + 73;
end MP_Utp_Test_Log_Base_Behavior_A_Extension_Test_Log;
------------------------------
-- MP_Utp_Test_Log_Duration --
------------------------------
function MP_Utp_Test_Log_Duration return AMF.Internals.CMOF_Element is
begin
return Base + 74;
end MP_Utp_Test_Log_Duration;
---------------------------------
-- MP_Utp_Test_Log_Executed_At --
---------------------------------
function MP_Utp_Test_Log_Executed_At return AMF.Internals.CMOF_Element is
begin
return Base + 75;
end MP_Utp_Test_Log_Executed_At;
---------------------------------
-- MP_Utp_Test_Log_Sut_Version --
---------------------------------
function MP_Utp_Test_Log_Sut_Version return AMF.Internals.CMOF_Element is
begin
return Base + 76;
end MP_Utp_Test_Log_Sut_Version;
----------------------------
-- MP_Utp_Test_Log_Tester --
----------------------------
function MP_Utp_Test_Log_Tester return AMF.Internals.CMOF_Element is
begin
return Base + 77;
end MP_Utp_Test_Log_Tester;
-----------------------------
-- MP_Utp_Test_Log_Verdict --
-----------------------------
function MP_Utp_Test_Log_Verdict return AMF.Internals.CMOF_Element is
begin
return Base + 78;
end MP_Utp_Test_Log_Verdict;
------------------------------------
-- MP_Utp_Test_Log_Verdict_Reason --
------------------------------------
function MP_Utp_Test_Log_Verdict_Reason return AMF.Internals.CMOF_Element is
begin
return Base + 79;
end MP_Utp_Test_Log_Verdict_Reason;
----------------------------------------------------------------------------------
-- MP_Utp_Test_Log_Application_Base_Dependency_A_Extension_Test_Log_Application --
----------------------------------------------------------------------------------
function MP_Utp_Test_Log_Application_Base_Dependency_A_Extension_Test_Log_Application return AMF.Internals.CMOF_Element is
begin
return Base + 80;
end MP_Utp_Test_Log_Application_Base_Dependency_A_Extension_Test_Log_Application;
----------------------------------------------------------------------
-- MP_Utp_Test_Objective_Base_Dependency_A_Extension_Test_Objective --
----------------------------------------------------------------------
function MP_Utp_Test_Objective_Base_Dependency_A_Extension_Test_Objective return AMF.Internals.CMOF_Element is
begin
return Base + 81;
end MP_Utp_Test_Objective_Base_Dependency_A_Extension_Test_Objective;
------------------------------------
-- MP_Utp_Test_Objective_Priority --
------------------------------------
function MP_Utp_Test_Objective_Priority return AMF.Internals.CMOF_Element is
begin
return Base + 82;
end MP_Utp_Test_Objective_Priority;
------------------------------------------------------------
-- MP_Utp_Test_Suite_Base_Behavior_A_Extension_Test_Suite --
------------------------------------------------------------
function MP_Utp_Test_Suite_Base_Behavior_A_Extension_Test_Suite return AMF.Internals.CMOF_Element is
begin
return Base + 83;
end MP_Utp_Test_Suite_Base_Behavior_A_Extension_Test_Suite;
--------------------------------
-- MP_Utp_Test_Suite_Priority --
--------------------------------
function MP_Utp_Test_Suite_Priority return AMF.Internals.CMOF_Element is
begin
return Base + 84;
end MP_Utp_Test_Suite_Priority;
---------------------------------
-- MP_Utp_Test_Suite_Test_Case --
---------------------------------
function MP_Utp_Test_Suite_Test_Case return AMF.Internals.CMOF_Element is
begin
return Base + 31;
end MP_Utp_Test_Suite_Test_Case;
----------------------------------------------------------
-- MP_Utp_Time_Out_Base_Time_Event_A_Extension_Time_Out --
----------------------------------------------------------
function MP_Utp_Time_Out_Base_Time_Event_A_Extension_Time_Out return AMF.Internals.CMOF_Element is
begin
return Base + 85;
end MP_Utp_Time_Out_Base_Time_Event_A_Extension_Time_Out;
---------------------------------------------------------------------------------
-- MP_Utp_Time_Out_Action_Base_Accept_Event_Action_A_Extension_Time_Out_Action --
---------------------------------------------------------------------------------
function MP_Utp_Time_Out_Action_Base_Accept_Event_Action_A_Extension_Time_Out_Action return AMF.Internals.CMOF_Element is
begin
return Base + 86;
end MP_Utp_Time_Out_Action_Base_Accept_Event_Action_A_Extension_Time_Out_Action;
-----------------------------------------------------------------------
-- MP_Utp_Time_Out_Message_Base_Message_A_Extension_Time_Out_Message --
-----------------------------------------------------------------------
function MP_Utp_Time_Out_Message_Base_Message_A_Extension_Time_Out_Message return AMF.Internals.CMOF_Element is
begin
return Base + 87;
end MP_Utp_Time_Out_Message_Base_Message_A_Extension_Time_Out_Message;
------------------------------------------------------------------------------------------------------
-- MP_Utp_Timer_Running_Action_Base_Read_Structural_Feature_Action_A_Extension_Timer_Running_Action --
------------------------------------------------------------------------------------------------------
function MP_Utp_Timer_Running_Action_Base_Read_Structural_Feature_Action_A_Extension_Timer_Running_Action return AMF.Internals.CMOF_Element is
begin
return Base + 88;
end MP_Utp_Timer_Running_Action_Base_Read_Structural_Feature_Action_A_Extension_Timer_Running_Action;
---------------------------------------------------------------------------------------
-- MP_Utp_Validation_Action_Base_Call_Operation_Action_A_Extension_Validation_Action --
---------------------------------------------------------------------------------------
function MP_Utp_Validation_Action_Base_Call_Operation_Action_A_Extension_Validation_Action return AMF.Internals.CMOF_Element is
begin
return Base + 89;
end MP_Utp_Validation_Action_Base_Call_Operation_Action_A_Extension_Validation_Action;
----------------------------------------------
-- MP_Utp_A_Extension_SUT_SUT_Base_Property --
----------------------------------------------
function MP_Utp_A_Extension_SUT_SUT_Base_Property return AMF.Internals.CMOF_Element is
begin
return Base + 168;
end MP_Utp_A_Extension_SUT_SUT_Base_Property;
-----------------------------------------------------------------------------
-- MP_Utp_A_Extension_Test_Context_Test_Context_Base_Behaviored_Classifier --
-----------------------------------------------------------------------------
function MP_Utp_A_Extension_Test_Context_Test_Context_Base_Behaviored_Classifier return AMF.Internals.CMOF_Element is
begin
return Base + 169;
end MP_Utp_A_Extension_Test_Context_Test_Context_Base_Behaviored_Classifier;
-------------------------------------------------------------------
-- MP_Utp_A_Extension_Data_Selector_Data_Selector_Base_Operation --
-------------------------------------------------------------------
function MP_Utp_A_Extension_Data_Selector_Data_Selector_Base_Operation return AMF.Internals.CMOF_Element is
begin
return Base + 154;
end MP_Utp_A_Extension_Data_Selector_Data_Selector_Base_Operation;
---------------------------------------------------------------------------------------
-- MP_Utp_A_Extension_Validation_Action_Validation_Action_Base_Call_Operation_Action --
---------------------------------------------------------------------------------------
function MP_Utp_A_Extension_Validation_Action_Validation_Action_Base_Call_Operation_Action return AMF.Internals.CMOF_Element is
begin
return Base + 143;
end MP_Utp_A_Extension_Validation_Action_Validation_Action_Base_Call_Operation_Action;
----------------------------------------------------------
-- MP_Utp_A_Extension_Time_Out_Time_Out_Base_Time_Event --
----------------------------------------------------------
function MP_Utp_A_Extension_Time_Out_Time_Out_Base_Time_Event return AMF.Internals.CMOF_Element is
begin
return Base + 155;
end MP_Utp_A_Extension_Time_Out_Time_Out_Base_Time_Event;
---------------------------------------------------------------------
-- MP_Utp_A_Extension_Managed_Element_Managed_Element_Base_Element --
---------------------------------------------------------------------
function MP_Utp_A_Extension_Managed_Element_Managed_Element_Base_Element return AMF.Internals.CMOF_Element is
begin
return Base + 170;
end MP_Utp_A_Extension_Managed_Element_Managed_Element_Base_Element;
-----------------------------------------------------------------------
-- MP_Utp_A_Extension_Time_Out_Message_Time_Out_Message_Base_Message --
-----------------------------------------------------------------------
function MP_Utp_A_Extension_Time_Out_Message_Time_Out_Message_Base_Message return AMF.Internals.CMOF_Element is
begin
return Base + 156;
end MP_Utp_A_Extension_Time_Out_Message_Time_Out_Message_Base_Message;
---------------------------------------------------------------------------------
-- MP_Utp_A_Extension_Test_Component_Test_Component_Base_Structured_Classifier --
---------------------------------------------------------------------------------
function MP_Utp_A_Extension_Test_Component_Test_Component_Base_Structured_Classifier return AMF.Internals.CMOF_Element is
begin
return Base + 127;
end MP_Utp_A_Extension_Test_Component_Test_Component_Base_Structured_Classifier;
---------------------------------------------------------------------------------
-- MP_Utp_A_Extension_Time_Out_Action_Time_Out_Action_Base_Accept_Event_Action --
---------------------------------------------------------------------------------
function MP_Utp_A_Extension_Time_Out_Action_Time_Out_Action_Base_Accept_Event_Action return AMF.Internals.CMOF_Element is
begin
return Base + 157;
end MP_Utp_A_Extension_Time_Out_Action_Time_Out_Action_Base_Accept_Event_Action;
------------------------------------------------------------
-- MP_Utp_A_Extension_Test_Suite_Test_Suite_Base_Behavior --
------------------------------------------------------------
function MP_Utp_A_Extension_Test_Suite_Test_Suite_Base_Behavior return AMF.Internals.CMOF_Element is
begin
return Base + 171;
end MP_Utp_A_Extension_Test_Suite_Test_Suite_Base_Behavior;
--------------------------------------------------------
-- MP_Utp_A_Extension_Test_Log_Test_Log_Base_Behavior --
--------------------------------------------------------
function MP_Utp_A_Extension_Test_Log_Test_Log_Base_Behavior return AMF.Internals.CMOF_Element is
begin
return Base + 144;
end MP_Utp_A_Extension_Test_Log_Test_Log_Base_Behavior;
-----------------------------------------------------------------------------------------
-- MP_Utp_A_Extension_Start_Timer_Action_Start_Timer_Action_Base_Call_Operation_Action --
-----------------------------------------------------------------------------------------
function MP_Utp_A_Extension_Start_Timer_Action_Start_Timer_Action_Base_Call_Operation_Action return AMF.Internals.CMOF_Element is
begin
return Base + 158;
end MP_Utp_A_Extension_Start_Timer_Action_Start_Timer_Action_Base_Call_Operation_Action;
-----------------------------------------------------------------------------
-- MP_Utp_A_Extension_Test_Context_Test_Context_Base_Structured_Classifier --
-----------------------------------------------------------------------------
function MP_Utp_A_Extension_Test_Context_Test_Context_Base_Structured_Classifier return AMF.Internals.CMOF_Element is
begin
return Base + 128;
end MP_Utp_A_Extension_Test_Context_Test_Context_Base_Structured_Classifier;
----------------------------------------------------------------------------------
-- MP_Utp_A_Extension_Test_Log_Application_Test_Log_Application_Base_Dependency --
----------------------------------------------------------------------------------
function MP_Utp_A_Extension_Test_Log_Application_Test_Log_Application_Base_Dependency return AMF.Internals.CMOF_Element is
begin
return Base + 145;
end MP_Utp_A_Extension_Test_Log_Application_Test_Log_Application_Base_Dependency;
---------------------------------------------------------------------------------------
-- MP_Utp_A_Extension_Stop_Timer_Action_Stop_Timer_Action_Base_Call_Operation_Action --
---------------------------------------------------------------------------------------
function MP_Utp_A_Extension_Stop_Timer_Action_Stop_Timer_Action_Base_Call_Operation_Action return AMF.Internals.CMOF_Element is
begin
return Base + 159;
end MP_Utp_A_Extension_Stop_Timer_Action_Stop_Timer_Action_Base_Call_Operation_Action;
---------------------------------------------------------------------------------------
-- MP_Utp_A_Extension_Read_Timer_Action_Read_Timer_Action_Base_Call_Operation_Action --
---------------------------------------------------------------------------------------
function MP_Utp_A_Extension_Read_Timer_Action_Read_Timer_Action_Base_Call_Operation_Action return AMF.Internals.CMOF_Element is
begin
return Base + 160;
end MP_Utp_A_Extension_Read_Timer_Action_Read_Timer_Action_Base_Call_Operation_Action;
-------------------------------------------------------------------------
-- MP_Utp_A_Extension_Coding_Rule_Coding_Rule_Base_Value_Specification --
-------------------------------------------------------------------------
function MP_Utp_A_Extension_Coding_Rule_Coding_Rule_Base_Value_Specification return AMF.Internals.CMOF_Element is
begin
return Base + 146;
end MP_Utp_A_Extension_Coding_Rule_Coding_Rule_Base_Value_Specification;
------------------------------------------------------------------------------------------------------
-- MP_Utp_A_Extension_Timer_Running_Action_Timer_Running_Action_Base_Read_Structural_Feature_Action --
------------------------------------------------------------------------------------------------------
function MP_Utp_A_Extension_Timer_Running_Action_Timer_Running_Action_Base_Read_Structural_Feature_Action return AMF.Internals.CMOF_Element is
begin
return Base + 161;
end MP_Utp_A_Extension_Timer_Running_Action_Timer_Running_Action_Base_Read_Structural_Feature_Action;
---------------------------------------------------------------
-- MP_Utp_A_Extension_Coding_Rule_Coding_Rule_Base_Namespace --
---------------------------------------------------------------
function MP_Utp_A_Extension_Coding_Rule_Coding_Rule_Base_Namespace return AMF.Internals.CMOF_Element is
begin
return Base + 147;
end MP_Utp_A_Extension_Coding_Rule_Coding_Rule_Base_Namespace;
--------------------------------------------------------------
-- MP_Utp_A_Extension_Coding_Rule_Coding_Rule_Base_Property --
--------------------------------------------------------------
function MP_Utp_A_Extension_Coding_Rule_Coding_Rule_Base_Property return AMF.Internals.CMOF_Element is
begin
return Base + 148;
end MP_Utp_A_Extension_Coding_Rule_Coding_Rule_Base_Property;
----------------------------------------------------------------------------------------------------
-- MP_Utp_A_Extension_Get_Timezone_Action_Get_Timezone_Action_Base_Read_Structural_Feature_Action --
----------------------------------------------------------------------------------------------------
function MP_Utp_A_Extension_Get_Timezone_Action_Get_Timezone_Action_Base_Read_Structural_Feature_Action return AMF.Internals.CMOF_Element is
begin
return Base + 162;
end MP_Utp_A_Extension_Get_Timezone_Action_Get_Timezone_Action_Base_Read_Structural_Feature_Action;
----------------------------------------------------------
-- MP_Utp_A_Extension_Test_Case_Test_Case_Base_Behavior --
----------------------------------------------------------
function MP_Utp_A_Extension_Test_Case_Test_Case_Base_Behavior return AMF.Internals.CMOF_Element is
begin
return Base + 138;
end MP_Utp_A_Extension_Test_Case_Test_Case_Base_Behavior;
---------------------------------------------------------------------------
-- MP_Utp_A_Extension_Literal_Any_Literal_Any_Base_Literal_Specification --
---------------------------------------------------------------------------
function MP_Utp_A_Extension_Literal_Any_Literal_Any_Base_Literal_Specification return AMF.Internals.CMOF_Element is
begin
return Base + 149;
end MP_Utp_A_Extension_Literal_Any_Literal_Any_Base_Literal_Specification;
-----------------------------------------------------------
-- MP_Utp_A_Extension_Test_Case_Test_Case_Base_Operation --
-----------------------------------------------------------
function MP_Utp_A_Extension_Test_Case_Test_Case_Base_Operation return AMF.Internals.CMOF_Element is
begin
return Base + 139;
end MP_Utp_A_Extension_Test_Case_Test_Case_Base_Operation;
-----------------------------------------------------------------------------------------------------
-- MP_Utp_A_Extension_Set_Timezone_Action_Set_Timezone_Action_Base_Write_Structural_Feature_Action --
-----------------------------------------------------------------------------------------------------
function MP_Utp_A_Extension_Set_Timezone_Action_Set_Timezone_Action_Base_Write_Structural_Feature_Action return AMF.Internals.CMOF_Element is
begin
return Base + 163;
end MP_Utp_A_Extension_Set_Timezone_Action_Set_Timezone_Action_Base_Write_Structural_Feature_Action;
-----------------------------------------------------------------------
-- MP_Utp_A_Extension_Finish_Action_Finish_Action_Base_Opaque_Action --
-----------------------------------------------------------------------
function MP_Utp_A_Extension_Finish_Action_Finish_Action_Base_Opaque_Action return AMF.Internals.CMOF_Element is
begin
return Base + 164;
end MP_Utp_A_Extension_Finish_Action_Finish_Action_Base_Opaque_Action;
-------------------------------------------------------------------------------------------
-- MP_Utp_A_Extension_Literal_Any_Or_Null_Literal_Any_Or_Null_Base_Literal_Specification --
-------------------------------------------------------------------------------------------
function MP_Utp_A_Extension_Literal_Any_Or_Null_Literal_Any_Or_Null_Base_Literal_Specification return AMF.Internals.CMOF_Element is
begin
return Base + 150;
end MP_Utp_A_Extension_Literal_Any_Or_Null_Literal_Any_Or_Null_Base_Literal_Specification;
----------------------------------------------------------------------
-- MP_Utp_A_Extension_Log_Action_Log_Action_Base_Send_Object_Action --
----------------------------------------------------------------------
function MP_Utp_A_Extension_Log_Action_Log_Action_Base_Send_Object_Action return AMF.Internals.CMOF_Element is
begin
return Base + 165;
end MP_Utp_A_Extension_Log_Action_Log_Action_Base_Send_Object_Action;
----------------------------------------------------------------------
-- MP_Utp_A_Extension_Test_Objective_Test_Objective_Base_Dependency --
----------------------------------------------------------------------
function MP_Utp_A_Extension_Test_Objective_Test_Objective_Base_Dependency return AMF.Internals.CMOF_Element is
begin
return Base + 140;
end MP_Utp_A_Extension_Test_Objective_Test_Objective_Base_Dependency;
---------------------------------------------------------------------------
-- MP_Utp_A_Extension_Finish_Action_Finish_Action_Base_Invocation_Action --
---------------------------------------------------------------------------
function MP_Utp_A_Extension_Finish_Action_Finish_Action_Base_Invocation_Action return AMF.Internals.CMOF_Element is
begin
return Base + 166;
end MP_Utp_A_Extension_Finish_Action_Finish_Action_Base_Invocation_Action;
------------------------------------------------------------
-- MP_Utp_A_Extension_Data_Pool_Data_Pool_Base_Classifier --
------------------------------------------------------------
function MP_Utp_A_Extension_Data_Pool_Data_Pool_Base_Classifier return AMF.Internals.CMOF_Element is
begin
return Base + 151;
end MP_Utp_A_Extension_Data_Pool_Data_Pool_Base_Classifier;
------------------------------------------------------
-- MP_Utp_A_Extension_Default_Default_Base_Behavior --
------------------------------------------------------
function MP_Utp_A_Extension_Default_Default_Base_Behavior return AMF.Internals.CMOF_Element is
begin
return Base + 141;
end MP_Utp_A_Extension_Default_Default_Base_Behavior;
----------------------------------------------------------
-- MP_Utp_A_Extension_Data_Pool_Data_Pool_Base_Property --
----------------------------------------------------------
function MP_Utp_A_Extension_Data_Pool_Data_Pool_Base_Property return AMF.Internals.CMOF_Element is
begin
return Base + 152;
end MP_Utp_A_Extension_Data_Pool_Data_Pool_Base_Property;
---------------------------------------------------------------------
-- MP_Utp_A_Extension_Determ_Alt_Determ_Alt_Base_Combined_Fragment --
---------------------------------------------------------------------
function MP_Utp_A_Extension_Determ_Alt_Determ_Alt_Base_Combined_Fragment return AMF.Internals.CMOF_Element is
begin
return Base + 167;
end MP_Utp_A_Extension_Determ_Alt_Determ_Alt_Base_Combined_Fragment;
----------------------------------------------------------------------
-- MP_Utp_A_Extension_Data_Partition_Data_Partition_Base_Classifier --
----------------------------------------------------------------------
function MP_Utp_A_Extension_Data_Partition_Data_Partition_Base_Classifier return AMF.Internals.CMOF_Element is
begin
return Base + 153;
end MP_Utp_A_Extension_Data_Partition_Data_Partition_Base_Classifier;
--------------------------------------------------------------------------------
-- MP_Utp_A_Extension_Default_Application_Default_Application_Base_Dependency --
--------------------------------------------------------------------------------
function MP_Utp_A_Extension_Default_Application_Default_Application_Base_Dependency return AMF.Internals.CMOF_Element is
begin
return Base + 142;
end MP_Utp_A_Extension_Default_Application_Default_Application_Base_Dependency;
--------------------------------------------
-- MA_Utp_SUT_Base_Property_Extension_SUT --
--------------------------------------------
function MA_Utp_SUT_Base_Property_Extension_SUT return AMF.Internals.CMOF_Element is
begin
return Base + 90;
end MA_Utp_SUT_Base_Property_Extension_SUT;
---------------------------------------------------------------------------
-- MA_Utp_Test_Context_Base_Behaviored_Classifier_Extension_Test_Context --
---------------------------------------------------------------------------
function MA_Utp_Test_Context_Base_Behaviored_Classifier_Extension_Test_Context return AMF.Internals.CMOF_Element is
begin
return Base + 91;
end MA_Utp_Test_Context_Base_Behaviored_Classifier_Extension_Test_Context;
-----------------------------------------------------------------
-- MA_Utp_Data_Selector_Base_Operation_Extension_Data_Selector --
-----------------------------------------------------------------
function MA_Utp_Data_Selector_Base_Operation_Extension_Data_Selector return AMF.Internals.CMOF_Element is
begin
return Base + 92;
end MA_Utp_Data_Selector_Base_Operation_Extension_Data_Selector;
-------------------------------------------------------------------------------------
-- MA_Utp_Validation_Action_Base_Call_Operation_Action_Extension_Validation_Action --
-------------------------------------------------------------------------------------
function MA_Utp_Validation_Action_Base_Call_Operation_Action_Extension_Validation_Action return AMF.Internals.CMOF_Element is
begin
return Base + 93;
end MA_Utp_Validation_Action_Base_Call_Operation_Action_Extension_Validation_Action;
--------------------------------------------------------
-- MA_Utp_Time_Out_Base_Time_Event_Extension_Time_Out --
--------------------------------------------------------
function MA_Utp_Time_Out_Base_Time_Event_Extension_Time_Out return AMF.Internals.CMOF_Element is
begin
return Base + 94;
end MA_Utp_Time_Out_Base_Time_Event_Extension_Time_Out;
-------------------------------------------------------------------
-- MA_Utp_Managed_Element_Base_Element_Extension_Managed_Element --
-------------------------------------------------------------------
function MA_Utp_Managed_Element_Base_Element_Extension_Managed_Element return AMF.Internals.CMOF_Element is
begin
return Base + 95;
end MA_Utp_Managed_Element_Base_Element_Extension_Managed_Element;
---------------------------------------------------------------------
-- MA_Utp_Time_Out_Message_Base_Message_Extension_Time_Out_Message --
---------------------------------------------------------------------
function MA_Utp_Time_Out_Message_Base_Message_Extension_Time_Out_Message return AMF.Internals.CMOF_Element is
begin
return Base + 96;
end MA_Utp_Time_Out_Message_Base_Message_Extension_Time_Out_Message;
-------------------------------------------------------------------------------
-- MA_Utp_Test_Component_Base_Structured_Classifier_Extension_Test_Component --
-------------------------------------------------------------------------------
function MA_Utp_Test_Component_Base_Structured_Classifier_Extension_Test_Component return AMF.Internals.CMOF_Element is
begin
return Base + 97;
end MA_Utp_Test_Component_Base_Structured_Classifier_Extension_Test_Component;
-------------------------------------------------------------------------------
-- MA_Utp_Time_Out_Action_Base_Accept_Event_Action_Extension_Time_Out_Action --
-------------------------------------------------------------------------------
function MA_Utp_Time_Out_Action_Base_Accept_Event_Action_Extension_Time_Out_Action return AMF.Internals.CMOF_Element is
begin
return Base + 98;
end MA_Utp_Time_Out_Action_Base_Accept_Event_Action_Extension_Time_Out_Action;
----------------------------------------------------------
-- MA_Utp_Test_Suite_Base_Behavior_Extension_Test_Suite --
----------------------------------------------------------
function MA_Utp_Test_Suite_Base_Behavior_Extension_Test_Suite return AMF.Internals.CMOF_Element is
begin
return Base + 99;
end MA_Utp_Test_Suite_Base_Behavior_Extension_Test_Suite;
------------------------------------------------------
-- MA_Utp_Test_Log_Base_Behavior_Extension_Test_Log --
------------------------------------------------------
function MA_Utp_Test_Log_Base_Behavior_Extension_Test_Log return AMF.Internals.CMOF_Element is
begin
return Base + 100;
end MA_Utp_Test_Log_Base_Behavior_Extension_Test_Log;
---------------------------------------------------------------------------------------
-- MA_Utp_Start_Timer_Action_Base_Call_Operation_Action_Extension_Start_Timer_Action --
---------------------------------------------------------------------------------------
function MA_Utp_Start_Timer_Action_Base_Call_Operation_Action_Extension_Start_Timer_Action return AMF.Internals.CMOF_Element is
begin
return Base + 101;
end MA_Utp_Start_Timer_Action_Base_Call_Operation_Action_Extension_Start_Timer_Action;
---------------------------------------------------------------------------
-- MA_Utp_Test_Context_Base_Structured_Classifier_Extension_Test_Context --
---------------------------------------------------------------------------
function MA_Utp_Test_Context_Base_Structured_Classifier_Extension_Test_Context return AMF.Internals.CMOF_Element is
begin
return Base + 102;
end MA_Utp_Test_Context_Base_Structured_Classifier_Extension_Test_Context;
--------------------------------------------------------------------------------
-- MA_Utp_Test_Log_Application_Base_Dependency_Extension_Test_Log_Application --
--------------------------------------------------------------------------------
function MA_Utp_Test_Log_Application_Base_Dependency_Extension_Test_Log_Application return AMF.Internals.CMOF_Element is
begin
return Base + 103;
end MA_Utp_Test_Log_Application_Base_Dependency_Extension_Test_Log_Application;
-------------------------------------------------------------------------------------
-- MA_Utp_Stop_Timer_Action_Base_Call_Operation_Action_Extension_Stop_Timer_Action --
-------------------------------------------------------------------------------------
function MA_Utp_Stop_Timer_Action_Base_Call_Operation_Action_Extension_Stop_Timer_Action return AMF.Internals.CMOF_Element is
begin
return Base + 104;
end MA_Utp_Stop_Timer_Action_Base_Call_Operation_Action_Extension_Stop_Timer_Action;
-------------------------------------------------------------------------------------
-- MA_Utp_Read_Timer_Action_Base_Call_Operation_Action_Extension_Read_Timer_Action --
-------------------------------------------------------------------------------------
function MA_Utp_Read_Timer_Action_Base_Call_Operation_Action_Extension_Read_Timer_Action return AMF.Internals.CMOF_Element is
begin
return Base + 105;
end MA_Utp_Read_Timer_Action_Base_Call_Operation_Action_Extension_Read_Timer_Action;
-----------------------------------------------------------------------
-- MA_Utp_Coding_Rule_Base_Value_Specification_Extension_Coding_Rule --
-----------------------------------------------------------------------
function MA_Utp_Coding_Rule_Base_Value_Specification_Extension_Coding_Rule return AMF.Internals.CMOF_Element is
begin
return Base + 106;
end MA_Utp_Coding_Rule_Base_Value_Specification_Extension_Coding_Rule;
----------------------------------------------------------------------------------------------------
-- MA_Utp_Timer_Running_Action_Base_Read_Structural_Feature_Action_Extension_Timer_Running_Action --
----------------------------------------------------------------------------------------------------
function MA_Utp_Timer_Running_Action_Base_Read_Structural_Feature_Action_Extension_Timer_Running_Action return AMF.Internals.CMOF_Element is
begin
return Base + 107;
end MA_Utp_Timer_Running_Action_Base_Read_Structural_Feature_Action_Extension_Timer_Running_Action;
-------------------------------------------------------------
-- MA_Utp_Coding_Rule_Base_Namespace_Extension_Coding_Rule --
-------------------------------------------------------------
function MA_Utp_Coding_Rule_Base_Namespace_Extension_Coding_Rule return AMF.Internals.CMOF_Element is
begin
return Base + 108;
end MA_Utp_Coding_Rule_Base_Namespace_Extension_Coding_Rule;
------------------------------------------------------------
-- MA_Utp_Coding_Rule_Base_Property_Extension_Coding_Rule --
------------------------------------------------------------
function MA_Utp_Coding_Rule_Base_Property_Extension_Coding_Rule return AMF.Internals.CMOF_Element is
begin
return Base + 109;
end MA_Utp_Coding_Rule_Base_Property_Extension_Coding_Rule;
--------------------------------------------------------------------------------------------------
-- MA_Utp_Get_Timezone_Action_Base_Read_Structural_Feature_Action_Extension_Get_Timezone_Action --
--------------------------------------------------------------------------------------------------
function MA_Utp_Get_Timezone_Action_Base_Read_Structural_Feature_Action_Extension_Get_Timezone_Action return AMF.Internals.CMOF_Element is
begin
return Base + 110;
end MA_Utp_Get_Timezone_Action_Base_Read_Structural_Feature_Action_Extension_Get_Timezone_Action;
--------------------------------------------------------
-- MA_Utp_Test_Case_Base_Behavior_Extension_Test_Case --
--------------------------------------------------------
function MA_Utp_Test_Case_Base_Behavior_Extension_Test_Case return AMF.Internals.CMOF_Element is
begin
return Base + 111;
end MA_Utp_Test_Case_Base_Behavior_Extension_Test_Case;
-------------------------------------------------------------------------
-- MA_Utp_Literal_Any_Base_Literal_Specification_Extension_Literal_Any --
-------------------------------------------------------------------------
function MA_Utp_Literal_Any_Base_Literal_Specification_Extension_Literal_Any return AMF.Internals.CMOF_Element is
begin
return Base + 112;
end MA_Utp_Literal_Any_Base_Literal_Specification_Extension_Literal_Any;
---------------------------------------------------------
-- MA_Utp_Test_Case_Base_Operation_Extension_Test_Case --
---------------------------------------------------------
function MA_Utp_Test_Case_Base_Operation_Extension_Test_Case return AMF.Internals.CMOF_Element is
begin
return Base + 113;
end MA_Utp_Test_Case_Base_Operation_Extension_Test_Case;
---------------------------------------------------------------------------------------------------
-- MA_Utp_Set_Timezone_Action_Base_Write_Structural_Feature_Action_Extension_Set_Timezone_Action --
---------------------------------------------------------------------------------------------------
function MA_Utp_Set_Timezone_Action_Base_Write_Structural_Feature_Action_Extension_Set_Timezone_Action return AMF.Internals.CMOF_Element is
begin
return Base + 114;
end MA_Utp_Set_Timezone_Action_Base_Write_Structural_Feature_Action_Extension_Set_Timezone_Action;
---------------------------------------------------------------------
-- MA_Utp_Finish_Action_Base_Opaque_Action_Extension_Finish_Action --
---------------------------------------------------------------------
function MA_Utp_Finish_Action_Base_Opaque_Action_Extension_Finish_Action return AMF.Internals.CMOF_Element is
begin
return Base + 115;
end MA_Utp_Finish_Action_Base_Opaque_Action_Extension_Finish_Action;
-----------------------------------------------------------------------------------------
-- MA_Utp_Literal_Any_Or_Null_Base_Literal_Specification_Extension_Literal_Any_Or_Null --
-----------------------------------------------------------------------------------------
function MA_Utp_Literal_Any_Or_Null_Base_Literal_Specification_Extension_Literal_Any_Or_Null return AMF.Internals.CMOF_Element is
begin
return Base + 116;
end MA_Utp_Literal_Any_Or_Null_Base_Literal_Specification_Extension_Literal_Any_Or_Null;
--------------------------------------------------------------------
-- MA_Utp_Log_Action_Base_Send_Object_Action_Extension_Log_Action --
--------------------------------------------------------------------
function MA_Utp_Log_Action_Base_Send_Object_Action_Extension_Log_Action return AMF.Internals.CMOF_Element is
begin
return Base + 117;
end MA_Utp_Log_Action_Base_Send_Object_Action_Extension_Log_Action;
--------------------------------------------------------------------
-- MA_Utp_Test_Objective_Base_Dependency_Extension_Test_Objective --
--------------------------------------------------------------------
function MA_Utp_Test_Objective_Base_Dependency_Extension_Test_Objective return AMF.Internals.CMOF_Element is
begin
return Base + 118;
end MA_Utp_Test_Objective_Base_Dependency_Extension_Test_Objective;
-------------------------------------------------------------------------
-- MA_Utp_Finish_Action_Base_Invocation_Action_Extension_Finish_Action --
-------------------------------------------------------------------------
function MA_Utp_Finish_Action_Base_Invocation_Action_Extension_Finish_Action return AMF.Internals.CMOF_Element is
begin
return Base + 119;
end MA_Utp_Finish_Action_Base_Invocation_Action_Extension_Finish_Action;
----------------------------------------------------------
-- MA_Utp_Data_Pool_Base_Classifier_Extension_Data_Pool --
----------------------------------------------------------
function MA_Utp_Data_Pool_Base_Classifier_Extension_Data_Pool return AMF.Internals.CMOF_Element is
begin
return Base + 120;
end MA_Utp_Data_Pool_Base_Classifier_Extension_Data_Pool;
----------------------------------------------------
-- MA_Utp_Default_Base_Behavior_Extension_Default --
----------------------------------------------------
function MA_Utp_Default_Base_Behavior_Extension_Default return AMF.Internals.CMOF_Element is
begin
return Base + 121;
end MA_Utp_Default_Base_Behavior_Extension_Default;
--------------------------------------------------------
-- MA_Utp_Data_Pool_Base_Property_Extension_Data_Pool --
--------------------------------------------------------
function MA_Utp_Data_Pool_Base_Property_Extension_Data_Pool return AMF.Internals.CMOF_Element is
begin
return Base + 122;
end MA_Utp_Data_Pool_Base_Property_Extension_Data_Pool;
-------------------------------------------------------------------
-- MA_Utp_Determ_Alt_Base_Combined_Fragment_Extension_Determ_Alt --
-------------------------------------------------------------------
function MA_Utp_Determ_Alt_Base_Combined_Fragment_Extension_Determ_Alt return AMF.Internals.CMOF_Element is
begin
return Base + 123;
end MA_Utp_Determ_Alt_Base_Combined_Fragment_Extension_Determ_Alt;
--------------------------------------------------------------------
-- MA_Utp_Data_Partition_Base_Classifier_Extension_Data_Partition --
--------------------------------------------------------------------
function MA_Utp_Data_Partition_Base_Classifier_Extension_Data_Partition return AMF.Internals.CMOF_Element is
begin
return Base + 124;
end MA_Utp_Data_Partition_Base_Classifier_Extension_Data_Partition;
------------------------------------------------------------------------------
-- MA_Utp_Default_Application_Base_Dependency_Extension_Default_Application --
------------------------------------------------------------------------------
function MA_Utp_Default_Application_Base_Dependency_Extension_Default_Application return AMF.Internals.CMOF_Element is
begin
return Base + 125;
end MA_Utp_Default_Application_Base_Dependency_Extension_Default_Application;
------------
-- MB_Utp --
------------
function MB_Utp return AMF.Internals.AMF_Element is
begin
return Base;
end MB_Utp;
------------
-- MB_Utp --
------------
function ML_Utp return AMF.Internals.AMF_Element is
begin
return Base + 172;
end ML_Utp;
end AMF.Internals.Tables.Utp_Metamodel;
|
generic
package any_Math.any_Algebra
is
pragma Pure;
pragma Optimize (Time);
end any_Math.any_Algebra;
|
with Ada.Text_IO; use Ada.Text_IO;
procedure Test is begin if 1 >= 'a' then new_line; end if; end;
|
-- --
-- procedure Copyright (c) Dmitry A. Kazakov --
-- Parsers.Generic_Source. Luebeck --
-- Get_Cpp_Blank Winter, 2004 --
-- Implementation --
-- Last revision : 19:13 09 Jul 2009 --
-- --
-- This library is free software; you can redistribute it and/or --
-- modify it under the terms of the GNU General Public License as --
-- published by the Free Software Foundation; either version 2 of --
-- the License, or (at your option) any later version. This library --
-- is distributed in the hope that it will be useful, but WITHOUT --
-- ANY WARRANTY; without even the implied warranty of --
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU --
-- General Public License for more details. You should have --
-- received a copy of the GNU General Public License along with --
-- this library; if not, write to the Free Software Foundation, --
-- Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from --
-- this unit, or you link this unit with other files to produce an --
-- executable, this unit does not by itself cause the resulting --
-- executable to be covered by the GNU General Public License. This --
-- exception does not however invalidate any other reasons why the --
-- executable file might be covered by the GNU Public License. --
--____________________________________________________________________--
with Ada.Characters.Latin_1; use Ada.Characters.Latin_1;
with Ada.IO_Exceptions; use Ada.IO_Exceptions;
procedure Parsers.Generic_Source.Get_Cpp_Blank
( Code : in out Source_Type;
Got_It : out Boolean;
Error : out Boolean;
Error_At : out Location_Type
) is
Line : Line_Ptr_Type;
Pointer : Integer;
Last : Integer;
In_Comment : Boolean := False;
begin
Chain_Of_Blanks :
loop
Get_Line (Code, Line, Pointer, Last);
while Pointer <= Last loop
if In_Comment then
while Pointer < Last loop
if Line (Pointer..Pointer + 1) = "*/" then
Pointer := Pointer + 2;
In_Comment := False;
exit;
end if;
Pointer := Pointer + 1;
end loop;
exit when In_Comment; -- Comment does not end at this line
else
case Line (Pointer) is
when ' ' | HT | VT | FF | CR | LF =>
Pointer := Pointer + 1;
when '/' =>
exit Chain_Of_Blanks when Pointer = Last;
case Line (Pointer + 1) is
when '/' =>
exit;
when '*' =>
In_Comment := True;
Set_Pointer (Code, Pointer);
Pointer := Pointer + 2;
Set_Pointer (Code, Pointer);
Error_At := Link (Code);
when others =>
exit Chain_Of_Blanks;
end case;
when others =>
exit Chain_Of_Blanks;
end case;
end if;
end loop;
Set_Pointer (Code, Last + 1);
Next_Line (Code);
end loop Chain_Of_Blanks;
Got_It := True;
Error := False;
Set_Pointer (Code, Pointer);
exception
when End_Error =>
Got_It := False;
Error := In_Comment;
end Parsers.Generic_Source.Get_Cpp_Blank;
|
-- Copyright (c) 2019 Maxim Reznik <reznikmm@gmail.com>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Program.Lexical_Elements;
with Program.Element_Vectors;
with Program.Elements.Case_Paths;
with Program.Element_Visitors;
package Program.Nodes.Case_Paths is
pragma Preelaborate;
type Case_Path is
new Program.Nodes.Node and Program.Elements.Case_Paths.Case_Path
and Program.Elements.Case_Paths.Case_Path_Text
with private;
function Create
(When_Token : not null Program.Lexical_Elements.Lexical_Element_Access;
Choices : not null Program.Element_Vectors.Element_Vector_Access;
Arrow_Token : Program.Lexical_Elements.Lexical_Element_Access;
Statements : not null Program.Element_Vectors.Element_Vector_Access)
return Case_Path;
type Implicit_Case_Path is
new Program.Nodes.Node and Program.Elements.Case_Paths.Case_Path
with private;
function Create
(Choices : not null Program.Element_Vectors
.Element_Vector_Access;
Statements : not null Program.Element_Vectors
.Element_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_Case_Path
with Pre =>
Is_Part_Of_Implicit or Is_Part_Of_Inherited or Is_Part_Of_Instance;
private
type Base_Case_Path is
abstract new Program.Nodes.Node and Program.Elements.Case_Paths.Case_Path
with record
Choices : not null Program.Element_Vectors.Element_Vector_Access;
Statements : not null Program.Element_Vectors.Element_Vector_Access;
end record;
procedure Initialize (Self : aliased in out Base_Case_Path'Class);
overriding procedure Visit
(Self : not null access Base_Case_Path;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class);
overriding function Choices
(Self : Base_Case_Path)
return not null Program.Element_Vectors.Element_Vector_Access;
overriding function Statements
(Self : Base_Case_Path)
return not null Program.Element_Vectors.Element_Vector_Access;
overriding function Is_Case_Path_Element
(Self : Base_Case_Path)
return Boolean;
overriding function Is_Path_Element (Self : Base_Case_Path) return Boolean;
type Case_Path is
new Base_Case_Path and Program.Elements.Case_Paths.Case_Path_Text
with record
When_Token : not null Program.Lexical_Elements.Lexical_Element_Access;
Arrow_Token : Program.Lexical_Elements.Lexical_Element_Access;
end record;
overriding function To_Case_Path_Text
(Self : aliased in out Case_Path)
return Program.Elements.Case_Paths.Case_Path_Text_Access;
overriding function When_Token
(Self : Case_Path)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Arrow_Token
(Self : Case_Path)
return Program.Lexical_Elements.Lexical_Element_Access;
type Implicit_Case_Path is
new Base_Case_Path
with record
Is_Part_Of_Implicit : Boolean;
Is_Part_Of_Inherited : Boolean;
Is_Part_Of_Instance : Boolean;
end record;
overriding function To_Case_Path_Text
(Self : aliased in out Implicit_Case_Path)
return Program.Elements.Case_Paths.Case_Path_Text_Access;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Case_Path)
return Boolean;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Case_Path)
return Boolean;
overriding function Is_Part_Of_Instance
(Self : Implicit_Case_Path)
return Boolean;
end Program.Nodes.Case_Paths;
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.