hexsha
stringlengths 40
40
| size
int64 3
1.05M
| ext
stringclasses 163
values | lang
stringclasses 53
values | max_stars_repo_path
stringlengths 3
945
| max_stars_repo_name
stringlengths 4
112
| max_stars_repo_head_hexsha
stringlengths 40
78
| max_stars_repo_licenses
sequencelengths 1
10
| max_stars_count
float64 1
191k
⌀ | max_stars_repo_stars_event_min_datetime
stringlengths 24
24
⌀ | max_stars_repo_stars_event_max_datetime
stringlengths 24
24
⌀ | max_issues_repo_path
stringlengths 3
945
| max_issues_repo_name
stringlengths 4
113
| max_issues_repo_head_hexsha
stringlengths 40
78
| max_issues_repo_licenses
sequencelengths 1
10
| max_issues_count
float64 1
116k
⌀ | max_issues_repo_issues_event_min_datetime
stringlengths 24
24
⌀ | max_issues_repo_issues_event_max_datetime
stringlengths 24
24
⌀ | max_forks_repo_path
stringlengths 3
945
| max_forks_repo_name
stringlengths 4
113
| max_forks_repo_head_hexsha
stringlengths 40
78
| max_forks_repo_licenses
sequencelengths 1
10
| max_forks_count
float64 1
105k
⌀ | max_forks_repo_forks_event_min_datetime
stringlengths 24
24
⌀ | max_forks_repo_forks_event_max_datetime
stringlengths 24
24
⌀ | content
stringlengths 3
1.05M
| avg_line_length
float64 1
966k
| max_line_length
int64 1
977k
| alphanum_fraction
float64 0
1
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
204de81222211a91c6cfa060aaa4aafe78e9e7e9 | 3,432 | ads | Ada | src/shared/generic/lsc-internal-convert_hmac.ads | Componolit/libsparkcrypto | 8531a07b6e9f5eb33eae0fa32759b4cbd3509d95 | [
"OpenSSL",
"Unlicense"
] | 30 | 2018-05-18T09:11:50.000Z | 2021-05-18T16:29:14.000Z | src/shared/generic/lsc-internal-convert_hmac.ads | Componolit/libsparkcrypto | 8531a07b6e9f5eb33eae0fa32759b4cbd3509d95 | [
"OpenSSL",
"Unlicense"
] | 15 | 2018-12-13T07:53:36.000Z | 2019-09-24T19:43:35.000Z | src/shared/generic/lsc-internal-convert_hmac.ads | Componolit/libsparkcrypto | 8531a07b6e9f5eb33eae0fa32759b4cbd3509d95 | [
"OpenSSL",
"Unlicense"
] | 3 | 2019-04-04T17:41:29.000Z | 2021-05-07T22:28:46.000Z | -------------------------------------------------------------------------------
-- This file is part of libsparkcrypto.
--
-- @author Alexander Senier
-- @date 2019-02-28
--
-- Copyright (C) 2019 Componolit GmbH
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
--
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
--
-- * Neither the name of the nor the names of its contributors may be used
-- to endorse or promote products derived from this software without
-- specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS
-- BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-- POSSIBILITY OF SUCH DAMAGE.
-------------------------------------------------------------------------------
package LSC.Internal.Convert_HMAC
is
pragma Pure;
generic
Block_Len : Natural;
Hash_Len : Natural;
type Key_Index_Type is (<>);
type Key_Elem_Type is (<>);
type Key_Type is array (Key_Index_Type range <>) of Key_Elem_Type;
type Message_Index_Type is (<>);
type Message_Elem_Type is (<>);
type Message_Type is array (Message_Index_Type range <>) of Message_Elem_Type;
type Hash_Index_Type is (<>);
type Hash_Elem_Type is (<>);
type Hash_Type is array (Hash_Index_Type) of Hash_Elem_Type;
type Internal_Context_Type is private;
type Internal_Block_Type is private;
type Internal_Block_Length_Type is (<>);
type Internal_Hash_Type is private;
with function Context_Init (Block : Internal_Block_Type) return Internal_Context_Type is <>;
with procedure Context_Update (Context : in out Internal_Context_Type;
Block : Internal_Block_Type) is <>;
with procedure Context_Finalize (Context : in out Internal_Context_Type;
Block : Internal_Block_Type;
Length : Internal_Block_Length_Type) is <>;
with function Get_Auth (Context : Internal_Context_Type) return Internal_Hash_Type is <>;
with function Hash_Key (Key : Key_Type) return Key_Type;
function HMAC_Generic
(Key : Key_Type;
Message : Message_Type) return Hash_Type;
end LSC.Internal.Convert_HMAC;
| 45.157895 | 98 | 0.657925 |
10d8b7df94cf5e564290e9b20560c39a9319aebc | 123 | ads | Ada | demo1/xample1.ads | MatrixMike/AdaDemo1 | cbf2ad5a05dc06a8ee11d0780c19f5fd74c8990a | [
"MIT"
] | 1 | 2019-06-27T12:58:28.000Z | 2019-06-27T12:58:28.000Z | demo1/xample1.ads | MatrixMike/AdaDemo1 | cbf2ad5a05dc06a8ee11d0780c19f5fd74c8990a | [
"MIT"
] | null | null | null | demo1/xample1.ads | MatrixMike/AdaDemo1 | cbf2ad5a05dc06a8ee11d0780c19f5fd74c8990a | [
"MIT"
] | null | null | null | package xample1 is
procedure SayWelcome;
procedure xercise;
-- procedure Goodbye;
end xample1;
| 20.5 | 28 | 0.626016 |
206b3ef7df26524aee32c0665aa2a3353d700254 | 4,682 | adb | Ada | examples/MicroBit/servos/src/main.adb | ekoeppen/Ada_Drivers_Library | 4b295a4ee8e89df17c460bd35ab270a3a0a68a3b | [
"BSD-3-Clause"
] | null | null | null | examples/MicroBit/servos/src/main.adb | ekoeppen/Ada_Drivers_Library | 4b295a4ee8e89df17c460bd35ab270a3a0a68a3b | [
"BSD-3-Clause"
] | null | null | null | examples/MicroBit/servos/src/main.adb | ekoeppen/Ada_Drivers_Library | 4b295a4ee8e89df17c460bd35ab270a3a0a68a3b | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2018, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with Ada.Text_IO; use Ada.Text_IO;
with MicroBit.Display; use MicroBit.Display;
with MicroBit.IOs; use MicroBit.IOs;
with MicroBit.Servos; use MicroBit.Servos;
with MicroBit.Buttons; use MicroBit.Buttons;
with MicroBit.Time; use MicroBit.Time;
procedure Main is
subtype Servo_Pin_Id is Pin_Id range 1 .. 2;
type Servo_Pin_State (Active : Boolean := False) is record
case Active is
when True => Setpoint : Servo_Set_Point;
when False => null;
end case;
end record;
type Servo_Pin_Array is array (Servo_Pin_Id) of Servo_Pin_State;
Servo_Pins, Cur_Servo_Pins : Servo_Pin_Array := (others => (Active => False));
Code : Character := ' ';
Button_AB : Boolean;
Starting : Boolean := False;
begin
Put_Line ("Start");
loop
-- Update PWM pulse size
if Starting or else Cur_Servo_Pins /= Servo_Pins then
Starting := False;
Clear;
Display (Code);
for J in Servo_Pins'Range loop
if Servo_Pins (J).Active then
Go (J, Servo_Pins (J).Setpoint);
else
Stop (J);
end if;
end loop;
Cur_Servo_Pins := Servo_Pins;
end if;
-- Check buttons
if State (Button_A) = Released and then State (Button_B) = Released then
-- Reset double press latch
Button_AB := False;
elsif State (Button_A) = Pressed and then State (Button_B) = Pressed then
Servo_Pins := (others => (Active => False));
Code := '0';
-- Latch double press mode so that when one button is released, we
-- ignore the other.
Button_AB := True;
elsif Button_AB then
-- After double press, ignore single button state until both buttons
-- are released.
null;
elsif State (Button_A) = Pressed then
Servo_Pins := (1 => (Active => True, Setpoint => 0),
2 => (Active => True, Setpoint => 180));
Code := 'A';
elsif State (Button_B) = Pressed then
Servo_Pins := (1 => (Active => True, Setpoint => 180),
2 => (Active => True, Setpoint => 0));
Code := 'R';
end if;
-- Delay for at least 1 PWM frame
Delay_Ms (20);
end loop;
end Main;
| 41.803571 | 81 | 0.539727 |
4a645e3a2eece3d737477aa08b950b6cda753f90 | 122 | adb | Ada | tests/typing/bad/testfile-for-2.adb | xuedong/mini-ada | 59a8b966cf50ba22a3b5a7cb449f671e4da32e44 | [
"MIT"
] | null | null | null | tests/typing/bad/testfile-for-2.adb | xuedong/mini-ada | 59a8b966cf50ba22a3b5a7cb449f671e4da32e44 | [
"MIT"
] | 1 | 2019-03-10T19:13:21.000Z | 2019-03-10T19:19:46.000Z | tests/typing/bad/testfile-for-2.adb | xuedong/mini-ada | 59a8b966cf50ba22a3b5a7cb449f671e4da32e44 | [
"MIT"
] | null | null | null | with Ada.Text_IO; use Ada.Text_IO;
procedure Test is
begin
for I in 'a' .. 10 loop
New_Line;
end loop;
end;
| 12.2 | 34 | 0.639344 |
df9db60deaa35e69e7139fa780e5ec9194bc7a48 | 509 | ads | Ada | src/oberon-files.ads | Lucretia/so | 95073516f688ade01e8e01ca3691f69182a2a8a4 | [
"BSD-3-Clause"
] | 8 | 2015-06-05T11:52:50.000Z | 2021-09-04T20:01:03.000Z | src/oberon-files.ads | Lucretia/so | 95073516f688ade01e8e01ca3691f69182a2a8a4 | [
"BSD-3-Clause"
] | null | null | null | src/oberon-files.ads | Lucretia/so | 95073516f688ade01e8e01ca3691f69182a2a8a4 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------------------------------------------------
-- See COPYING for licence information.
------------------------------------------------------------------------------------------------------------------------
-- Oberon.Files
-- This is the root package for file handling.
package Oberon.Files is
subtype File is String;
type File_Access is access all File;
function Open (File_Name : String) return File;
end Oberon.Files;
| 42.416667 | 120 | 0.387033 |
c5fcfa30b2cc58af26d845fc494b2a554d34dcf5 | 112 | ads | Ada | tests/statistics-test_data-tests-statistics_container.ads | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 80 | 2017-04-08T23:14:07.000Z | 2022-02-10T22:30:51.000Z | tests/statistics-test_data-tests-statistics_container.ads | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 89 | 2017-06-24T08:18:26.000Z | 2021-11-12T04:37:36.000Z | tests/statistics-test_data-tests-statistics_container.ads | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 9 | 2018-04-14T16:37:25.000Z | 2020-03-21T14:33:49.000Z | package Statistics.Test_Data.Tests.Statistics_Container is
end Statistics.Test_Data.Tests.Statistics_Container;
| 37.333333 | 58 | 0.892857 |
231f9990d8cfc0d3988cf99314d0d13e3dce5a79 | 871 | ads | Ada | gdb/testsuite/gdb.ada/rename_subscript_param/pkg.ads | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | 1 | 2020-10-14T03:24:35.000Z | 2020-10-14T03:24:35.000Z | gdb/testsuite/gdb.ada/rename_subscript_param/pkg.ads | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | null | null | null | gdb/testsuite/gdb.ada/rename_subscript_param/pkg.ads | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | null | null | null | -- Copyright 2016-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 Pkg is
type Bits_Type is array (1 .. 10) of Boolean
with Pack => True;
procedure Flip (Bits : in out Bits_Type; I : Natural);
end Pkg;
| 39.590909 | 73 | 0.722158 |
23ac4c82c84811bf430befe87381e801e93e2e72 | 1,172 | ads | Ada | gdb/testsuite/gdb.ada/frame_args/pck.ads | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | 1 | 2020-10-14T03:24:35.000Z | 2020-10-14T03:24:35.000Z | gdb/testsuite/gdb.ada/frame_args/pck.ads | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | null | null | null | gdb/testsuite/gdb.ada/frame_args/pck.ads | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | null | null | null | -- Copyright 2007-2021 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with System;
package Pck is
type Struct is record
A : Integer;
B : Integer;
end record;
type Arr is array (1 .. 3) of Integer;
procedure Call_Me (Int : Integer;
Flt : Float;
Bln : Boolean;
Ary : Arr; -- Non scalar
Chr : Character;
Sad : System.Address;
Rec : Struct); -- Non scalar
end Pck;
| 30.842105 | 73 | 0.622014 |
396ccde2d61dc42c074360018d8087c53d1a1b88 | 3,827 | ads | Ada | ada/core/agar-timer.ads | auzkok/libagar | 8dffa4afe73df47cf7e461c3073b744373d3af0b | [
"BSD-2-Clause"
] | 286 | 2017-07-31T20:05:16.000Z | 2022-03-26T20:26:24.000Z | ada/core/agar-timer.ads | kalatestimine/libagar | f830265ad00a82d4cddd8b59943bd3887ebb1486 | [
"BSD-2-Clause"
] | 67 | 2017-08-30T18:56:21.000Z | 2021-09-08T03:38:20.000Z | ada/core/agar-timer.ads | kalatestimine/libagar | f830265ad00a82d4cddd8b59943bd3887ebb1486 | [
"BSD-2-Clause"
] | 31 | 2017-08-14T13:34:12.000Z | 2022-03-14T15:33:49.000Z | ------------------------------------------------------------------------------
-- AGAR CORE LIBRARY --
-- A G A R . T I M E R --
-- S p e c --
------------------------------------------------------------------------------
with Interfaces;
with Interfaces.C;
with Interfaces.C.Strings;
with Agar.Event;
with System;
--
-- Interface to the Agar timer facility (AG_Timer(3) in C). Agar timers are
-- generally attached to a parent Agar object. Detaching the parent object from
-- its parent VFS has the effect of cancelling any active timers.
--
-- Unless Agar was initialized with the Software_Timers option, Agar timers
-- are implemented using the "best" available hardware interface on the current
-- platform (such as BSD kqueue(2), POSIX select(2) or Linux timerfd). The
-- Software_Timers option enforces a delay loop and timing wheel in software.
--
package Agar.Timer is
package C renames Interfaces.C;
package CS renames Interfaces.C.Strings;
package EV renames Agar.Event;
TIMER_NAME_MAX : constant Natural := $AG_TIMER_NAME_MAX;
type Timer_Private is array (1 .. $SIZEOF_AG_TimerPvt)
of aliased Interfaces.Unsigned_8 with Convention => C;
for Timer_Private'Size use $SIZEOF_AG_TimerPvt * System.Storage_Unit;
type Timer_Name is array (1 .. TIMER_NAME_MAX)
of aliased c.char with Convention => C;
type Timer;
type Timer_Access is access all Timer with Convention => C;
subtype Timer_not_null_Access is not null Timer_Access;
type Timer_Callback is access function
(Timer : Timer_Access;
Event : EV.Event_Access) return Interfaces.Unsigned_32
with Convention => C;
subtype Timer_not_null_Callback is not null Timer_Callback;
type Timer is limited record
Callback_Args : EV.Event; -- Callback arguments
Callback_Func : Timer_Callback; -- Callback function
Private_Data : Timer_Private; -- Private data
Parent_Object : System.Address; -- Parent object
Flags : C.unsigned;
Identifier : C.int; -- Unique identifier
Expiration_Time : Interfaces.Unsigned_32; -- Expires in this long (ticks)
Interval : Interfaces.Unsigned_32; -- Timer interval (ticks)
Name : Timer_Name; -- Optional name ID
end record
with Convention => C;
procedure Init_Timer
(Timer : in Timer_not_null_Access;
Name : in String);
-- Initialize an (initially unattached) timer.
function Add_Timer
(Timer : in Timer_not_null_Access;
Interval : in Interfaces.Unsigned_32;
Func : in Timer_Callback) return Boolean;
-- Start a global timer not attached to a specific object.
function Add_Timer
(Interval : in Interfaces.Unsigned_32;
Func : in Timer_Callback) return Boolean;
-- Start a global, auto-allocated timer not attached to a specific object.
private
procedure AG_InitTimer
(Timer : in Timer_not_null_Access;
Name : in CS.chars_ptr;
Flags : in C.unsigned)
with Import, Convention => C, Link_Name => "AG_InitTimer";
function AG_AddTimer
(Object : in System.Address;
Timer : in Timer_not_null_Access;
Interval : in Interfaces.Unsigned_32;
Func : in Timer_Callback;
Flags : in C.unsigned;
Format : in CS.chars_ptr) return C.int
with Import, Convention => C, Link_Name => "AG_AddTimer";
function AG_AddTimerAuto
(Object : in System.Address;
Interval : in Interfaces.Unsigned_32;
Func : in Timer_Callback;
Format : in CS.chars_ptr) return Timer_Access
with Import, Convention => C, Link_Name => "AG_AddTimerAuto";
end Agar.Timer;
| 38.27 | 79 | 0.636791 |
39a33115d90424ba1b2531db9ad786611050e368 | 1,010 | ads | Ada | boards/native/config_src/adl_config.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 6 | 2017-05-28T04:37:11.000Z | 2020-11-22T11:26:19.000Z | boards/native/config_src/adl_config.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 2 | 2019-08-30T10:57:40.000Z | 2020-02-11T21:34:14.000Z | boards/native/config_src/adl_config.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 2 | 2017-02-07T19:42:02.000Z | 2020-11-22T11:26:20.000Z | -- This package was generated by the Ada_Drivers_Library project wizard script
package ADL_Config is
Max_Mount_Points : constant := 2; -- From default value
Max_Mount_Name_Length : constant := 128; -- From default value
Has_Ravenscar_Full_Runtime : constant String := "False"; -- From default value
Board : constant String := "Native"; -- From command line
Has_ZFP_Runtime : constant String := "False"; -- From default value
Has_Ravenscar_SFP_Runtime : constant String := "False"; -- From default value
Use_Startup_Gen : constant Boolean := False; -- From command line
Max_Path_Length : constant := 1024; -- From default value
Architecture : constant String := "Native"; -- From board definition
end ADL_Config;
| 77.692308 | 101 | 0.536634 |
10312a3a0b9d7f9aeea41aa334a13df054ca2425 | 1,460 | ads | Ada | source/oasis/program-elements-choice_parameter_specifications.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/oasis/program-elements-choice_parameter_specifications.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/oasis/program-elements-choice_parameter_specifications.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | 1 | 2019-10-16T09:05:27.000Z | 2019-10-16T09:05:27.000Z | -- SPDX-FileCopyrightText: 2019 Max Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Program.Elements.Declarations;
with Program.Elements.Defining_Identifiers;
with Program.Lexical_Elements;
package Program.Elements.Choice_Parameter_Specifications is
pragma Pure (Program.Elements.Choice_Parameter_Specifications);
type Choice_Parameter_Specification is
limited interface and Program.Elements.Declarations.Declaration;
type Choice_Parameter_Specification_Access is
access all Choice_Parameter_Specification'Class with Storage_Size => 0;
not overriding function Name
(Self : Choice_Parameter_Specification)
return not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access is abstract;
type Choice_Parameter_Specification_Text is limited interface;
type Choice_Parameter_Specification_Text_Access is
access all Choice_Parameter_Specification_Text'Class
with Storage_Size => 0;
not overriding function To_Choice_Parameter_Specification_Text
(Self : in out Choice_Parameter_Specification)
return Choice_Parameter_Specification_Text_Access is abstract;
not overriding function Colon_Token
(Self : Choice_Parameter_Specification_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
end Program.Elements.Choice_Parameter_Specifications;
| 35.609756 | 76 | 0.778767 |
395fe6a3b37921b8d44a4155710b8da59f0b3634 | 4,440 | adb | Ada | src/latin_utils/latin_utils-inflections_package-noun_record_io.adb | Alex-Vasile/whitakers-words | 9fa16606d97842746fea0379839f40c959c53d56 | [
"FTL"
] | 204 | 2015-06-12T21:22:55.000Z | 2022-03-28T10:50:16.000Z | src/latin_utils/latin_utils-inflections_package-noun_record_io.adb | Alex-Vasile/whitakers-words | 9fa16606d97842746fea0379839f40c959c53d56 | [
"FTL"
] | 98 | 2015-06-15T22:17:04.000Z | 2021-10-01T18:17:55.000Z | src/latin_utils/latin_utils-inflections_package-noun_record_io.adb | Alex-Vasile/whitakers-words | 9fa16606d97842746fea0379839f40c959c53d56 | [
"FTL"
] | 50 | 2015-06-16T22:42:24.000Z | 2021-12-29T16:53:08.000Z | -- WORDS, a Latin dictionary, by Colonel William Whitaker (USAF, Retired)
--
-- Copyright William A. Whitaker (1936–2010)
--
-- This is a free program, which means it is proper to copy it and pass
-- it on to your friends. Consider it a developmental item for which
-- there is no charge. However, just for form, it is Copyrighted
-- (c). Permission is hereby freely given for any and all use of program
-- and data. You can sell it as your own, but at least tell me.
--
-- This version is distributed without obligation, but the developer
-- would appreciate comments and suggestions.
--
-- All parts of the WORDS system, source code and data files, are made freely
-- available to anyone who wishes to use them, for whatever purpose.
separate (Latin_Utils.Inflections_Package)
package body Noun_Record_IO is
---------------------------------------------------------------------------
procedure Get (File : in File_Type; Item : out Noun_Record)
is
Spacer : Character := ' ';
pragma Unreferenced (Spacer);
begin
Decn_Record_IO.Get (File, Item.Decl);
Get (File, Spacer);
Case_Type_IO.Get (File, Item.Of_Case);
Get (File, Spacer);
Number_Type_IO.Get (File, Item.Number);
Get (File, Spacer);
Gender_Type_IO.Get (File, Item.Gender);
end Get;
---------------------------------------------------------------------------
procedure Get (Item : out Noun_Record)
is
Spacer : Character := ' ';
pragma Unreferenced (Spacer);
begin
Decn_Record_IO.Get (Item.Decl);
Get (Spacer);
Case_Type_IO.Get (Item.Of_Case);
Get (Spacer);
Number_Type_IO.Get (Item.Number);
Get (Spacer);
Gender_Type_IO.Get (Item.Gender);
end Get;
---------------------------------------------------------------------------
procedure Put (File : in File_Type; Item : in Noun_Record) is
begin
Decn_Record_IO.Put (File, Item.Decl);
Put (File, ' ');
Case_Type_IO.Put (File, Item.Of_Case);
Put (File, ' ');
Number_Type_IO.Put (File, Item.Number);
Put (File, ' ');
Gender_Type_IO.Put (File, Item.Gender);
end Put;
---------------------------------------------------------------------------
procedure Put (Item : in Noun_Record) is
begin
Decn_Record_IO.Put (Item.Decl);
Put (' ');
Case_Type_IO.Put (Item.Of_Case);
Put (' ');
Number_Type_IO.Put (Item.Number);
Put (' ');
Gender_Type_IO.Put (Item.Gender);
end Put;
---------------------------------------------------------------------------
procedure Get
(Source : in String;
Target : out Noun_Record;
Last : out Integer
)
is
-- Used for computing lower bound of substrings
Low : Integer := Source'First - 1;
begin
Decn_Record_IO.Get (Source (Low + 1 .. Source'Last), Target.Decl, Low);
Low := Low + 1;
Case_Type_IO.Get (Source (Low + 1 .. Source'Last), Target.Of_Case, Low);
Low := Low + 1;
Number_Type_IO.Get (Source (Low + 1 .. Source'Last), Target.Number, Low);
Low := Low + 1;
Gender_Type_IO.Get (Source (Low + 1 .. Source'Last), Target.Gender, Last);
end Get;
---------------------------------------------------------------------------
procedure Put
(Target : out String;
Item : in Noun_Record
)
is
-- Used for computing bounds of substrings
Low : Integer := Target'First - 1;
High : Integer := 0;
begin
-- Put Decn_Record
High := Low + Decn_Record_IO.Default_Width;
Decn_Record_IO.Put (Target (Low + 1 .. High), Item.Decl);
-- Put Case_Type
Low := High + 1;
Target (Low) := ' ';
High := Low + Case_Type_IO.Default_Width;
Case_Type_IO.Put (Target (Low + 1 .. High), Item.Of_Case);
-- Put Number_Type
Low := High + 1;
Target (Low) := ' ';
High := Low + Number_Type_IO.Default_Width;
Number_Type_IO.Put (Target (Low + 1 .. High), Item.Number);
-- Put Gender_Type
Low := High + 1;
Target (Low) := ' ';
High := Low + Gender_Type_IO.Default_Width;
Gender_Type_IO.Put (Target (Low + 1 .. High), Item.Gender);
-- Fill remainder of String
Target (High + 1 .. Target'Last) := (others => ' ');
end Put;
---------------------------------------------------------------------------
end Noun_Record_IO;
| 32.173913 | 80 | 0.537613 |
cba628d16ef244cdb609c52996f400a69b698c62 | 4,412 | adb | Ada | applet/aide/source/editors/aide-editor-of_context_line.adb | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | 3 | 2017-04-29T14:25:22.000Z | 2017-09-29T10:15:28.000Z | applet/aide/source/editors/aide-editor-of_context_line.adb | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | null | null | null | applet/aide/source/editors/aide-editor-of_context_line.adb | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | null | null | null | with
aIDE.GUI,
Glib,
Glib.Error,
Gtk.Builder,
Gtk.Handlers;
package body aIDE.Editor.of_context_line
is
use gtk.Builder,
Glib,
glib.Error;
procedure on_name_Button_clicked (the_Button : access Gtk_Button_Record'Class;
the_context_line_Editor : in aIDE.Editor.of_context_Line.view)
is
begin
aIDE.GUI.show_packages_Palette (Invoked_by => gtk_Button (the_Button),
Target => the_context_line_Editor.context_Line);
null;
end on_name_Button_clicked;
function on_used_Button_leave (the_Button : access Gtk_Check_Button_Record'Class;
the_Context_Line : in AdaM.context_Line.view) return Boolean
is
begin
the_Context_Line.is_Used (the_Button.get_Active);
return False;
end on_used_Button_leave;
procedure on_rid_Button_clicked (the_Button : access Gtk_Button_Record'Class;
the_context_line_Editor : in aIDE.Editor.of_context_Line.view)
is
begin
the_context_line_Editor.Context.rid (the_context_line_Editor.context_Line);
the_Button.get_Parent.destroy;
end on_rid_Button_clicked;
package check_Button_return_Callbacks is new Gtk.Handlers.User_Return_Callback (Gtk_Check_Button_Record,
Boolean,
AdaM.Context_Line.view);
package Button_Callbacks is new Gtk.Handlers.User_Callback (Gtk_Button_Record,
aIDE.Editor.of_context_Line.view);
package body Forge
is
function to_context_line_Editor (the_Context : in AdaM.Context .view;
the_Context_Line : in AdaM.context_Line.view) return View
is
Self : constant Editor.of_context_Line.view := new Editor.of_context_Line.item;
the_Builder : Gtk_Builder;
Error : aliased GError;
Result : Guint;
pragma Unreferenced (Result);
begin
Gtk_New (the_Builder);
Result := the_Builder.Add_From_File ("glade/editor/context_line_editor.glade", Error'Access);
if Error /= null then
raise Program_Error with "Error: adam.Editor.context_line ~ " & Get_Message (Error);
end if;
Self.Top := gtk_Box (the_Builder.get_Object ("top_Box"));
Self.name_Button := gtk_Button (the_Builder.get_Object ("name_Button"));
Self.used_Button := gtk_Check_Button (the_Builder.get_Object ("used_Button"));
Self.rid_Button := gtk_Button (the_Builder.get_Object ("rid_Button"));
Button_Callbacks.Connect (Self.name_Button,
"clicked",
on_name_Button_clicked'Access,
Self); -- the_Context_Line);
check_Button_return_Callbacks.Connect (Self.used_Button,
"focus-out-event",
on_used_Button_leave'Access,
the_Context_Line);
Button_Callbacks.Connect (Self.rid_Button,
"clicked",
on_rid_Button_clicked'Access,
Self);
Self.name_Button.set_Label (the_Context_Line.Name);
Self.used_Button.Set_Active (the_Context_Line.is_Used);
Self.Context := the_Context;
Self.context_Line := the_Context_Line;
return Self;
end to_context_line_Editor;
end Forge;
overriding function top_Widget (Self : in Item) return gtk.Widget.Gtk_Widget
is
begin
return gtk.Widget.Gtk_Widget (Self.Top);
end top_Widget;
function name_Button (Self : in Item) return gtk.Button.gtk_Button
is
begin
return Self.name_Button;
end name_Button;
function context_Line (Self : in Item) return AdaM.context_Line.view
is
begin
return Self.context_Line;
end context_Line;
end aIDE.Editor.of_context_line;
| 31.741007 | 107 | 0.56913 |
2315e2f44dd2b29cca6581ac129df4776759eeb1 | 592 | ads | Ada | source/oasis/program-elements-formal_access_types.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/oasis/program-elements-formal_access_types.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/oasis/program-elements-formal_access_types.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | 1 | 2019-10-16T09:05:27.000Z | 2019-10-16T09:05:27.000Z | -- SPDX-FileCopyrightText: 2019 Max Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Program.Elements.Formal_Type_Definitions;
package Program.Elements.Formal_Access_Types is
pragma Pure (Program.Elements.Formal_Access_Types);
type Formal_Access_Type is
limited interface
and Program.Elements.Formal_Type_Definitions.Formal_Type_Definition;
type Formal_Access_Type_Access is access all Formal_Access_Type'Class
with Storage_Size => 0;
end Program.Elements.Formal_Access_Types;
| 29.6 | 75 | 0.714527 |
dfc79c684f10824a255d579fd96869a1533145ce | 34,774 | adb | Ada | arch/ARM/STM32/drivers/dma/stm32-dma.adb | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 192 | 2016-06-01T18:32:04.000Z | 2022-03-26T22:52:31.000Z | arch/ARM/STM32/drivers/dma/stm32-dma.adb | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 239 | 2016-05-26T20:02:01.000Z | 2022-03-31T09:46:56.000Z | arch/ARM/STM32/drivers/dma/stm32-dma.adb | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015, 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. --
-- --
-- --
-- This file is based on: --
-- --
-- @file stm32f4xx_hal_dma.c --
-- @author MCD Application Team --
-- @version V1.1.0 --
-- @date 19-June-2014 --
-- @brief DMA HAL module driver. --
-- --
-- COPYRIGHT(c) 2014 STMicroelectronics --
------------------------------------------------------------------------------
with Ada.Unchecked_Conversion;
with System.Storage_Elements;
with STM32_SVD.DMA; use STM32_SVD.DMA;
package body STM32.DMA is
type DMA_Stream_Record is record
-- configuration register
CR : S0CR_Register;
-- number of data register
NDTR : S0NDTR_Register;
-- peripheral address register
PAR : UInt32;
-- memory 0 address register
M0AR : UInt32;
-- memory 1 address register
M1AR : UInt32;
-- FIFO control register
FCR : S0FCR_Register;
end record with Volatile;
for DMA_Stream_Record use record
CR at 0 range 0 .. 31;
NDTR at 4 range 0 .. 31;
PAR at 8 range 0 .. 31;
M0AR at 12 range 0 .. 31;
M1AR at 16 range 0 .. 31;
FCR at 20 range 0 .. 31;
end record;
type DMA_Stream is access all DMA_Stream_Record;
function Get_Stream
(Port : DMA_Controller;
Num : DMA_Stream_Selector) return DMA_Stream
with Inline;
procedure Set_Interrupt_Enabler
(This_Stream : DMA_Stream;
Source : DMA_Interrupt;
Value : Boolean);
-- An internal routine, used to enable and disable the specified interrupt
function "-" is new Ada.Unchecked_Conversion
(Memory_Buffer_Target, Boolean);
function "-" is new Ada.Unchecked_Conversion
(Boolean, Memory_Buffer_Target);
----------------
-- Get_Stream --
----------------
function Get_Stream
(Port : DMA_Controller;
Num : DMA_Stream_Selector) return DMA_Stream
is
Addr : System.Address;
function To_Stream is new Ada.Unchecked_Conversion
(System.Address, DMA_Stream);
begin
case Num is
when Stream_0 =>
Addr := Port.S0CR'Address;
when Stream_1 =>
Addr := Port.S1CR'Address;
when Stream_2 =>
Addr := Port.S2CR'Address;
when Stream_3 =>
Addr := Port.S3CR'Address;
when Stream_4 =>
Addr := Port.S4CR'Address;
when Stream_5 =>
Addr := Port.S5CR'Address;
when Stream_6 =>
Addr := Port.S6CR'Address;
when Stream_7 =>
Addr := Port.S7CR'Address;
end case;
return To_Stream (Addr);
end Get_Stream;
------------
-- Enable --
------------
procedure Enable
(This : DMA_Controller;
Stream : DMA_Stream_Selector)
is
begin
Get_Stream (This, Stream).CR.EN := True;
end Enable;
-------------
-- Enabled --
-------------
function Enabled
(This : DMA_Controller;
Stream : DMA_Stream_Selector)
return Boolean
is
begin
return Get_Stream (This, Stream).CR.EN;
end Enabled;
-------------
-- Disable --
-------------
procedure Disable
(This : DMA_Controller;
Stream : DMA_Stream_Selector)
is
begin
Get_Stream (This, Stream).CR.EN := False;
-- the STMicro Reference Manual RM0090, Doc Id 018909 Rev 6, pg 319,
-- step 1 says we must await the bit actually clearing, to confirm no
-- ongoing operation remains active.
loop
exit when not Enabled (This, Stream);
end loop;
end Disable;
---------------------------
-- Set_Interrupt_Enabler --
---------------------------
procedure Set_Interrupt_Enabler
(This_Stream : DMA_Stream;
Source : DMA_Interrupt;
Value : Boolean)
is
begin
case Source is
when Direct_Mode_Error_Interrupt =>
This_Stream.CR.DMEIE := Value;
when Transfer_Error_Interrupt =>
This_Stream.CR.TEIE := Value;
when Half_Transfer_Complete_Interrupt =>
This_Stream.CR.HTIE := Value;
when Transfer_Complete_Interrupt =>
This_Stream.CR.TCIE := Value;
when FIFO_Error_Interrupt =>
This_Stream.FCR.FEIE := Value;
end case;
end Set_Interrupt_Enabler;
----------------------
-- Enable_Interrupt --
----------------------
procedure Enable_Interrupt
(This : DMA_Controller;
Stream : DMA_Stream_Selector;
Source : DMA_Interrupt)
is
begin
Set_Interrupt_Enabler (Get_Stream (This, Stream), Source, True);
end Enable_Interrupt;
-----------------------
-- Disable_Interrupt --
-----------------------
procedure Disable_Interrupt
(This : DMA_Controller;
Stream : DMA_Stream_Selector;
Source : DMA_Interrupt)
is
begin
Set_Interrupt_Enabler (Get_Stream (This, Stream), Source, False);
end Disable_Interrupt;
-----------------------
-- Interrupt_Enabled --
-----------------------
function Interrupt_Enabled
(This : DMA_Controller;
Stream : DMA_Stream_Selector;
Source : DMA_Interrupt)
return Boolean
is
Result : Boolean;
This_Stream : DMA_Stream renames Get_Stream (This, Stream);
-- this is a bit heavy, considering it will be called from interrupt
-- handlers.
-- TODO: consider a much lower level implementation, based on bit-masks.
begin
case Source is
when Direct_Mode_Error_Interrupt =>
Result := This_Stream.CR.DMEIE;
when Transfer_Error_Interrupt =>
Result := This_Stream.CR.TEIE;
when Half_Transfer_Complete_Interrupt =>
Result := This_Stream.CR.HTIE;
when Transfer_Complete_Interrupt =>
Result := This_Stream.CR.TCIE;
when FIFO_Error_Interrupt =>
Result := This_Stream.FCR.FEIE;
end case;
return Result;
end Interrupt_Enabled;
--------------------
-- Start_Transfer --
--------------------
procedure Start_Transfer
(This : DMA_Controller;
Stream : DMA_Stream_Selector;
Source : Address;
Destination : Address;
Data_Count : UInt16)
is
begin
Disable (This, Stream); -- per the RM, eg section 10.5.6 for the NDTR
Configure_Data_Flow
(This,
Stream,
Source => Source,
Destination => Destination,
Data_Count => Data_Count);
Enable (This, Stream);
end Start_Transfer;
------------------------------------
-- Start_Transfer_with_Interrupts --
------------------------------------
procedure Start_Transfer_with_Interrupts
(This : DMA_Controller;
Stream : DMA_Stream_Selector;
Source : Address;
Destination : Address;
Data_Count : UInt16;
Enabled_Interrupts : Interrupt_Selections := (others => True))
is
begin
Disable (This, Stream); -- per the RM, eg section 10.5.6 for the NDTR
Configure_Data_Flow
(This,
Stream,
Source => Source,
Destination => Destination,
Data_Count => Data_Count);
for Selected_Interrupt in Enabled_Interrupts'Range loop
if Enabled_Interrupts (Selected_Interrupt) then
Enable_Interrupt (This, Stream, Selected_Interrupt);
end if;
end loop;
Enable (This, Stream);
end Start_Transfer_with_Interrupts;
-------------------------
-- Configure_Data_Flow --
-------------------------
procedure Configure_Data_Flow
(This : DMA_Controller;
Stream : DMA_Stream_Selector;
Source : Address;
Destination : Address;
Data_Count : UInt16)
is
This_Stream : DMA_Stream renames Get_Stream (This, Stream);
function W is new Ada.Unchecked_Conversion
(Address, UInt32);
begin
-- the following assignment has NO EFFECT if flow is controlled by
-- peripheral. The hardware resets it to 16#FFFF#, see RM0090 10.3.15.
This_Stream.NDTR.NDT := Data_Count;
if This_Stream.CR.DIR = Memory_To_Peripheral'Enum_Rep then
This_Stream.M0AR := W (Source);
This_Stream.PAR := W (Destination);
else
This_Stream.PAR := W (Source);
This_Stream.M0AR := W (Destination);
end if;
end Configure_Data_Flow;
--------------------
-- Abort_Transfer --
--------------------
procedure Abort_Transfer
(This : DMA_Controller;
Stream : DMA_Stream_Selector;
Result : out DMA_Error_Code)
is
Max_Abort_Time : constant Time_Span := Seconds (1);
Timeout : Time;
This_Stream : DMA_Stream renames Get_Stream (This, Stream);
begin
Disable (This, Stream);
Timeout := Clock + Max_Abort_Time;
loop
exit when not This_Stream.CR.EN;
if Clock > Timeout then
Result := DMA_Timeout_Error;
return;
end if;
end loop;
Result := DMA_No_Error;
end Abort_Transfer;
-------------------------
-- Poll_For_Completion --
-------------------------
procedure Poll_For_Completion
(This : in out DMA_Controller;
Stream : DMA_Stream_Selector;
Expected_Level : DMA_Transfer_Level;
Timeout : Time_Span;
Result : out DMA_Error_Code)
is
Deadline : constant Time := Clock + Timeout;
begin
Result := DMA_No_Error; -- initially anyway
Polling : loop
if Expected_Level = Full_Transfer then
exit Polling when
Status (This, Stream, Transfer_Complete_Indicated);
else
exit Polling when
Status (This, Stream, Half_Transfer_Complete_Indicated);
end if;
if Status (This, Stream, Transfer_Error_Indicated) or
Status (This, Stream, FIFO_Error_Indicated) or
Status (This, Stream, Direct_Mode_Error_Indicated)
then
Clear_Status (This, Stream, Transfer_Error_Indicated);
Clear_Status (This, Stream, FIFO_Error_Indicated);
Clear_Status (This, Stream, Direct_Mode_Error_Indicated);
Result := DMA_Device_Error;
return;
end if;
if Clock > Deadline then
Result := DMA_Timeout_Error;
return;
end if;
end loop Polling;
Clear_Status (This, Stream, Half_Transfer_Complete_Indicated);
if Expected_Level = Full_Transfer then
Clear_Status (This, Stream, Transfer_Complete_Indicated);
else
Clear_Status (This, Stream, Half_Transfer_Complete_Indicated);
end if;
end Poll_For_Completion;
------------------
-- Clear_Status --
------------------
procedure Clear_Status
(This : in out DMA_Controller;
Stream : DMA_Stream_Selector;
Flag : DMA_Status_Flag)
is
begin
case Stream is
when Stream_0 =>
case Flag is
when FIFO_Error_Indicated =>
This.LIFCR.CFEIF0 := True;
when Direct_Mode_Error_Indicated =>
This.LIFCR.CDMEIF0 := True;
when Transfer_Error_Indicated =>
This.LIFCR.CTEIF0 := True;
when Half_Transfer_Complete_Indicated =>
This.LIFCR.CHTIF0 := True;
when Transfer_Complete_Indicated =>
This.LIFCR.CTCIF0 := True;
end case;
when Stream_1 =>
case Flag is
when FIFO_Error_Indicated =>
This.LIFCR.CFEIF1 := True;
when Direct_Mode_Error_Indicated =>
This.LIFCR.CDMEIF1 := True;
when Transfer_Error_Indicated =>
This.LIFCR.CTEIF1 := True;
when Half_Transfer_Complete_Indicated =>
This.LIFCR.CHTIF1 := True;
when Transfer_Complete_Indicated =>
This.LIFCR.CTCIF1 := True;
end case;
when Stream_2 =>
case Flag is
when FIFO_Error_Indicated =>
This.LIFCR.CFEIF2 := True;
when Direct_Mode_Error_Indicated =>
This.LIFCR.CDMEIF2 := True;
when Transfer_Error_Indicated =>
This.LIFCR.CTEIF2 := True;
when Half_Transfer_Complete_Indicated =>
This.LIFCR.CHTIF2 := True;
when Transfer_Complete_Indicated =>
This.LIFCR.CTCIF2 := True;
end case;
when Stream_3 =>
case Flag is
when FIFO_Error_Indicated =>
This.LIFCR.CFEIF3 := True;
when Direct_Mode_Error_Indicated =>
This.LIFCR.CDMEIF3 := True;
when Transfer_Error_Indicated =>
This.LIFCR.CTEIF3 := True;
when Half_Transfer_Complete_Indicated =>
This.LIFCR.CHTIF3 := True;
when Transfer_Complete_Indicated =>
This.LIFCR.CTCIF3 := True;
end case;
when Stream_4 =>
case Flag is
when FIFO_Error_Indicated =>
This.HIFCR.CFEIF4 := True;
when Direct_Mode_Error_Indicated =>
This.HIFCR.CDMEIF4 := True;
when Transfer_Error_Indicated =>
This.HIFCR.CTEIF4 := True;
when Half_Transfer_Complete_Indicated =>
This.HIFCR.CHTIF4 := True;
when Transfer_Complete_Indicated =>
This.HIFCR.CTCIF4 := True;
end case;
when Stream_5 =>
case Flag is
when FIFO_Error_Indicated =>
This.HIFCR.CFEIF5 := True;
when Direct_Mode_Error_Indicated =>
This.HIFCR.CDMEIF5 := True;
when Transfer_Error_Indicated =>
This.HIFCR.CTEIF5 := True;
when Half_Transfer_Complete_Indicated =>
This.HIFCR.CHTIF5 := True;
when Transfer_Complete_Indicated =>
This.HIFCR.CTCIF5 := True;
end case;
when Stream_6 =>
case Flag is
when FIFO_Error_Indicated =>
This.HIFCR.CFEIF6 := True;
when Direct_Mode_Error_Indicated =>
This.HIFCR.CDMEIF6 := True;
when Transfer_Error_Indicated =>
This.HIFCR.CTEIF6 := True;
when Half_Transfer_Complete_Indicated =>
This.HIFCR.CHTIF6 := True;
when Transfer_Complete_Indicated =>
This.HIFCR.CTCIF6 := True;
end case;
when Stream_7 =>
case Flag is
when FIFO_Error_Indicated =>
This.HIFCR.CFEIF7 := True;
when Direct_Mode_Error_Indicated =>
This.HIFCR.CDMEIF7 := True;
when Transfer_Error_Indicated =>
This.HIFCR.CTEIF7 := True;
when Half_Transfer_Complete_Indicated =>
This.HIFCR.CHTIF7 := True;
when Transfer_Complete_Indicated =>
This.HIFCR.CTCIF7 := True;
end case;
end case;
end Clear_Status;
----------------------
-- Clear_All_Status --
----------------------
procedure Clear_All_Status
(This : in out DMA_Controller;
Stream : DMA_Stream_Selector)
is
begin
case Stream is
when Stream_0 =>
This.LIFCR.CFEIF0 := True;
This.LIFCR.CDMEIF0 := True;
This.LIFCR.CTEIF0 := True;
This.LIFCR.CHTIF0 := True;
This.LIFCR.CTCIF0 := True;
when Stream_1 =>
This.LIFCR.CFEIF1 := True;
This.LIFCR.CDMEIF1 := True;
This.LIFCR.CTEIF1 := True;
This.LIFCR.CHTIF1 := True;
This.LIFCR.CTCIF1 := True;
when Stream_2 =>
This.LIFCR.CFEIF2 := True;
This.LIFCR.CDMEIF2 := True;
This.LIFCR.CTEIF2 := True;
This.LIFCR.CHTIF2 := True;
This.LIFCR.CTCIF2 := True;
when Stream_3 =>
This.LIFCR.CFEIF3 := True;
This.LIFCR.CDMEIF3 := True;
This.LIFCR.CTEIF3 := True;
This.LIFCR.CHTIF3 := True;
This.LIFCR.CTCIF3 := True;
when Stream_4 =>
This.HIFCR.CFEIF4 := True;
This.HIFCR.CDMEIF4 := True;
This.HIFCR.CTEIF4 := True;
This.HIFCR.CHTIF4 := True;
This.HIFCR.CTCIF4 := True;
when Stream_5 =>
This.HIFCR.CFEIF5 := True;
This.HIFCR.CDMEIF5 := True;
This.HIFCR.CTEIF5 := True;
This.HIFCR.CHTIF5 := True;
This.HIFCR.CTCIF5 := True;
when Stream_6 =>
This.HIFCR.CFEIF6 := True;
This.HIFCR.CDMEIF6 := True;
This.HIFCR.CTEIF6 := True;
This.HIFCR.CHTIF6 := True;
This.HIFCR.CTCIF6 := True;
when Stream_7 =>
This.HIFCR.CFEIF7 := True;
This.HIFCR.CDMEIF7 := True;
This.HIFCR.CTEIF7 := True;
This.HIFCR.CHTIF7 := True;
This.HIFCR.CTCIF7 := True;
end case;
end Clear_All_Status;
------------
-- Status --
------------
function Status
(This : DMA_Controller;
Stream : DMA_Stream_Selector;
Flag : DMA_Status_Flag)
return Boolean
is
begin
case Stream is
when Stream_0 =>
case Flag is
when FIFO_Error_Indicated =>
return This.LISR.FEIF0;
when Direct_Mode_Error_Indicated =>
return This.LISR.DMEIF0;
when Transfer_Error_Indicated =>
return This.LISR.TEIF0;
when Half_Transfer_Complete_Indicated =>
return This.LISR.HTIF0;
when Transfer_Complete_Indicated =>
return This.LISR.TCIF0;
end case;
when Stream_1 =>
case Flag is
when FIFO_Error_Indicated =>
return This.LISR.FEIF1;
when Direct_Mode_Error_Indicated =>
return This.LISR.DMEIF1;
when Transfer_Error_Indicated =>
return This.LISR.TEIF1;
when Half_Transfer_Complete_Indicated =>
return This.LISR.HTIF1;
when Transfer_Complete_Indicated =>
return This.LISR.TCIF1;
end case;
when Stream_2 =>
case Flag is
when FIFO_Error_Indicated =>
return This.LISR.FEIF2;
when Direct_Mode_Error_Indicated =>
return This.LISR.DMEIF2;
when Transfer_Error_Indicated =>
return This.LISR.TEIF2;
when Half_Transfer_Complete_Indicated =>
return This.LISR.HTIF2;
when Transfer_Complete_Indicated =>
return This.LISR.TCIF2;
end case;
when Stream_3 =>
case Flag is
when FIFO_Error_Indicated =>
return This.LISR.FEIF3;
when Direct_Mode_Error_Indicated =>
return This.LISR.DMEIF3;
when Transfer_Error_Indicated =>
return This.LISR.TEIF3;
when Half_Transfer_Complete_Indicated =>
return This.LISR.HTIF3;
when Transfer_Complete_Indicated =>
return This.LISR.TCIF3;
end case;
when Stream_4 =>
case Flag is
when FIFO_Error_Indicated =>
return This.HISR.FEIF4;
when Direct_Mode_Error_Indicated =>
return This.HISR.DMEIF4;
when Transfer_Error_Indicated =>
return This.HISR.TEIF4;
when Half_Transfer_Complete_Indicated =>
return This.HISR.HTIF4;
when Transfer_Complete_Indicated =>
return This.HISR.TCIF4;
end case;
when Stream_5 =>
case Flag is
when FIFO_Error_Indicated =>
return This.HISR.FEIF5;
when Direct_Mode_Error_Indicated =>
return This.HISR.DMEIF5;
when Transfer_Error_Indicated =>
return This.HISR.TEIF5;
when Half_Transfer_Complete_Indicated =>
return This.HISR.HTIF5;
when Transfer_Complete_Indicated =>
return This.HISR.TCIF5;
end case;
when Stream_6 =>
case Flag is
when FIFO_Error_Indicated =>
return This.HISR.FEIF6;
when Direct_Mode_Error_Indicated =>
return This.HISR.DMEIF6;
when Transfer_Error_Indicated =>
return This.HISR.TEIF6;
when Half_Transfer_Complete_Indicated =>
return This.HISR.HTIF6;
when Transfer_Complete_Indicated =>
return This.HISR.TCIF6;
end case;
when Stream_7 =>
case Flag is
when FIFO_Error_Indicated =>
return This.HISR.FEIF7;
when Direct_Mode_Error_Indicated =>
return This.HISR.DMEIF7;
when Transfer_Error_Indicated =>
return This.HISR.TEIF7;
when Half_Transfer_Complete_Indicated =>
return This.HISR.HTIF7;
when Transfer_Complete_Indicated =>
return This.HISR.TCIF7;
end case;
end case;
end Status;
-----------------
-- Set_Counter --
-----------------
procedure Set_NDT
(This : DMA_Controller;
Stream : DMA_Stream_Selector;
Data_Count : UInt16)
is
This_Stream : DMA_Stream renames Get_Stream (This, Stream);
begin
This_Stream.NDTR.NDT := Data_Count;
end Set_NDT;
function Items_Transferred
(This : DMA_Controller;
Stream : DMA_Stream_Selector)
return UInt16
is
ndt : constant UInt16 := Current_NDT (This, Stream);
items : UInt16;
begin
if Operating_Mode (This, Stream) = Peripheral_Flow_Control_Mode then
items := 16#ffff# - ndt;
else
items := ndt;
end if;
return items;
end Items_Transferred;
function Current_NDT
(This : DMA_Controller;
Stream : DMA_Stream_Selector)
return UInt16
is
This_Stream : DMA_Stream renames Get_Stream (This, Stream);
begin
return This_Stream.NDTR.NDT;
end Current_NDT;
---------------------
-- Double_Buffered --
---------------------
function Double_Buffered
(This : DMA_Controller;
Stream : DMA_Stream_Selector)
return Boolean
is
begin
return Get_Stream (This, Stream).CR.DBM;
end Double_Buffered;
-------------------
-- Circular_Mode --
-------------------
function Circular_Mode
(This : DMA_Controller;
Stream : DMA_Stream_Selector)
return Boolean
is
begin
return Get_Stream (This, Stream).CR.CIRC;
end Circular_Mode;
---------------
-- Configure --
---------------
procedure Configure
(This : DMA_Controller;
Stream : DMA_Stream_Selector;
Config : DMA_Stream_Configuration)
is
-- see HAL_DMA_Init in STM32F4xx_HAL_Driver\Inc\stm32f4xx_hal_dma.h
This_Stream : DMA_Stream renames Get_Stream (This, Stream);
begin
-- the STMicro Reference Manual RM0090, Doc Id 018909 Rev 6, pg 319 says
-- we must disable the stream before configuring it
Disable (This, Stream);
This_Stream.CR.CT := -Memory_Buffer_0;
This_Stream.CR.DBM := False;
This_Stream.CR.CHSEL :=
DMA_Channel_Selector'Enum_Rep (Config.Channel);
This_Stream.CR.DIR :=
DMA_Data_Transfer_Direction'Enum_Rep (Config.Direction);
This_Stream.CR.PINC := Config.Increment_Peripheral_Address;
This_Stream.CR.MINC := Config.Increment_Memory_Address;
This_Stream.CR.PSIZE :=
DMA_Data_Transfer_Widths'Enum_Rep (Config.Peripheral_Data_Format);
This_Stream.CR.MSIZE :=
DMA_Data_Transfer_Widths'Enum_Rep (Config.Memory_Data_Format);
This_Stream.CR.PL :=
DMA_Priority_Level'Enum_Rep (Config.Priority);
case Config.Operation_Mode is
when Normal_Mode =>
This_Stream.CR.PFCTRL := False; -- DMA is the flow controller
This_Stream.CR.CIRC := False; -- Disable circular mode
when Peripheral_Flow_Control_Mode =>
This_Stream.CR.PFCTRL := True; -- Peripheral is the flow ctrl.
This_Stream.CR.CIRC := False; -- Disable circular mode
when Circular_Mode =>
This_Stream.CR.PFCTRL := False; -- DMA is the flow controller
This_Stream.CR.CIRC := True; -- Enable circular mode
end case;
-- the memory burst and peripheral burst values are only used when
-- the FIFO is enabled
if Config.FIFO_Enabled then
This_Stream.CR.MBURST :=
DMA_Memory_Burst'Enum_Rep (Config.Memory_Burst_Size);
This_Stream.CR.PBURST :=
DMA_Peripheral_Burst'Enum_Rep (Config.Peripheral_Burst_Size);
else
This_Stream.CR.MBURST := Memory_Burst_Single'Enum_Rep;
This_Stream.CR.PBURST := Peripheral_Burst_Single'Enum_Rep;
end if;
-- DMDIS: disable the direct mode (set to True) when FIFO is enabled
This_Stream.FCR.DMDIS := Config.FIFO_Enabled;
if Config.FIFO_Enabled then
This_Stream.FCR.FTH :=
DMA_FIFO_Threshold_Level'Enum_Rep (Config.FIFO_Threshold);
else
This_Stream.FCR.FTH :=
FIFO_Threshold_1_Quart_Full_Configuration'Enum_Rep; -- 0, default
end if;
end Configure;
-----------
-- Reset --
-----------
procedure Reset
(This : in out DMA_Controller;
Stream : DMA_Stream_Selector)
is
This_Stream : DMA_Stream renames Get_Stream (This, Stream);
begin
Disable (This, Stream);
This_Stream.CR := (others => <>);
This_Stream.NDTR.NDT := 0;
This_Stream.PAR := 0;
This_Stream.M0AR := 0;
This_Stream.M1AR := 0;
This_Stream.FCR := (others => <>);
Clear_All_Status (This, Stream);
end Reset;
---------------------------
-- Peripheral_Data_Width --
---------------------------
function Peripheral_Data_Width
(This : DMA_Controller; Stream : DMA_Stream_Selector)
return DMA_Data_Transfer_Widths
is
begin
return DMA_Data_Transfer_Widths'Val
(Get_Stream (This, Stream).CR.PSIZE);
end Peripheral_Data_Width;
-----------------------
-- Memory_Data_Width --
-----------------------
function Memory_Data_Width
(This : DMA_Controller; Stream : DMA_Stream_Selector)
return DMA_Data_Transfer_Widths
is
begin
return DMA_Data_Transfer_Widths'Val
(Get_Stream (This, Stream).CR.MSIZE);
end Memory_Data_Width;
------------------------
-- Transfer_Direction --
------------------------
function Transfer_Direction
(This : DMA_Controller; Stream : DMA_Stream_Selector)
return DMA_Data_Transfer_Direction
is
begin
return DMA_Data_Transfer_Direction'Val
(Get_Stream (This, Stream).CR.DIR);
end Transfer_Direction;
--------------------
-- Operating_Mode --
--------------------
function Operating_Mode
(This : DMA_Controller; Stream : DMA_Stream_Selector)
return DMA_Mode
is
begin
if Get_Stream (This, Stream).CR.PFCTRL then
return Peripheral_Flow_Control_Mode;
elsif Get_Stream (This, Stream).CR.CIRC then
return Circular_Mode;
end if;
return Normal_Mode;
end Operating_Mode;
--------------
-- Priority --
--------------
function Priority
(This : DMA_Controller; Stream : DMA_Stream_Selector)
return DMA_Priority_Level
is
begin
return DMA_Priority_Level'Val (Get_Stream (This, Stream).CR.PL);
end Priority;
---------------------------
-- Current_Memory_Buffer --
---------------------------
function Current_Memory_Buffer
(This : DMA_Controller; Stream : DMA_Stream_Selector)
return Memory_Buffer_Target
is
begin
return -Get_Stream (This, Stream).CR.CT;
end Current_Memory_Buffer;
-----------------------
-- Set_Memory_Buffer --
-----------------------
procedure Set_Memory_Buffer
(This : DMA_Controller;
Stream : DMA_Stream_Selector;
Buffer : Memory_Buffer_Target;
To : System.Address)
is
function W is new Ada.Unchecked_Conversion
(System.Address, UInt32);
This_Stream : DMA_Stream renames Get_Stream (This, Stream);
begin
case Buffer is
when Memory_Buffer_0 =>
This_Stream.M0AR := W (To);
when Memory_Buffer_1 =>
This_Stream.M1AR := W (To);
end case;
end Set_Memory_Buffer;
----------------------------------
-- Select_Current_Memory_Buffer --
----------------------------------
procedure Select_Current_Memory_Buffer
(This : DMA_Controller;
Stream : DMA_Stream_Selector;
Buffer : Memory_Buffer_Target)
is
begin
Get_Stream (This, Stream).CR.CT := -Buffer;
end Select_Current_Memory_Buffer;
------------------------------------
-- Configure_Double_Buffered_Mode --
------------------------------------
procedure Configure_Double_Buffered_Mode
(This : DMA_Controller;
Stream : DMA_Stream_Selector;
Buffer_0_Value : Address;
Buffer_1_Value : Address;
First_Buffer_Used : Memory_Buffer_Target)
is
begin
Set_Memory_Buffer (This, Stream, Memory_Buffer_0, Buffer_0_Value);
Set_Memory_Buffer (This, Stream, Memory_Buffer_1, Buffer_1_Value);
Select_Current_Memory_Buffer (This, Stream, First_Buffer_Used);
end Configure_Double_Buffered_Mode;
---------------------------------
-- Enable_Double_Buffered_Mode --
---------------------------------
procedure Enable_Double_Buffered_Mode
(This : DMA_Controller;
Stream : DMA_Stream_Selector)
is
begin
Get_Stream (This, Stream).CR.DBM := True;
end Enable_Double_Buffered_Mode;
----------------------------------
-- Disable_Double_Buffered_Mode --
----------------------------------
procedure Disable_Double_Buffered_Mode
(This : DMA_Controller;
Stream : DMA_Stream_Selector)
is
begin
Get_Stream (This, Stream).CR.DBM := False;
end Disable_Double_Buffered_Mode;
----------------------
-- Selected_Channel --
----------------------
function Selected_Channel
(This : DMA_Controller; Stream : DMA_Stream_Selector)
return DMA_Channel_Selector
is
begin
return DMA_Channel_Selector'Val (Get_Stream (This, Stream).CR.CHSEL);
end Selected_Channel;
-------------
-- Aligned --
-------------
function Aligned (This : Address; Width : DMA_Data_Transfer_Widths)
return Boolean
is
use System.Storage_Elements;
begin
case Width is
when Words =>
return To_Integer (This) mod 4 = 0;
when HalfWords =>
return To_Integer (This) mod 2 = 0;
when Bytes =>
return True;
end case;
end Aligned;
end STM32.DMA;
| 32.468721 | 79 | 0.544832 |
104d34d69fb48f83d7e53885f5e275ddf0f00de0 | 1,758 | adb | Ada | tests/natools-references-tools__protected.adb | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | tests/natools-references-tools__protected.adb | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | tests/natools-references-tools__protected.adb | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | ------------------------------------------------------------------------------
-- Copyright (c) 2013-2014, Natacha Porté --
-- --
-- Permission to use, copy, modify, and distribute this software for any --
-- purpose with or without fee is hereby granted, provided that the above --
-- copyright notice and this permission notice appear in all copies. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES --
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF --
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR --
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES --
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN --
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF --
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. --
------------------------------------------------------------------------------
package body Natools.References.Tools is
function Is_Consistent (Left, Right : Reference) return Boolean is
begin
return (Left.Data = Right.Data) = (Left.Count = Right.Count);
end Is_Consistent;
function Is_Valid (Ref : Reference) return Boolean is
begin
return (Ref.Data = null) = (Ref.Count = null);
end Is_Valid;
function Count (Ref : Reference) return Natural is
begin
if Ref.Count /= null then
return Ref.Count.Get_Value;
else
return 0;
end if;
end Count;
end Natools.References.Tools;
| 42.878049 | 78 | 0.552332 |
103ff9ab825d8f356571c2e1ab0672ac9ede34d6 | 285 | ads | Ada | src/002/father-son.ads | xeenta/learning-ada | bd3edf0c9e8b8eff814ffd89b040f488b80a7d5b | [
"MIT"
] | null | null | null | src/002/father-son.ads | xeenta/learning-ada | bd3edf0c9e8b8eff814ffd89b040f488b80a7d5b | [
"MIT"
] | null | null | null | src/002/father-son.ads | xeenta/learning-ada | bd3edf0c9e8b8eff814ffd89b040f488b80a7d5b | [
"MIT"
] | null | null | null | package Father.Son is
subtype Son_Type is Father_Type range -20 .. 20;
type Sonic_Type is range -20 .. 20;
function "+" (Left : Son_Type; Right : Father_Type) return Father_Type;
function "+" (Left : Sonic_Type; Right : Father_Type) return Integer;
end Father.Son;
| 31.666667 | 74 | 0.687719 |
107d93fba04e9194264e475811294628c687ea7a | 7,948 | adb | Ada | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-imgcha.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-imgcha.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-imgcha.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . I M G _ C H A R --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
package body System.Img_Char is
---------------------
-- Image_Character --
---------------------
procedure Image_Character
(V : Character;
S : in out String;
P : out Natural)
is
pragma Assert (S'First = 1);
subtype Cname is String (1 .. 3);
subtype C0_Range is Character
range Character'Val (16#00#) .. Character'Val (16#1F#);
C0 : constant array (C0_Range) of Cname :=
(Character'Val (16#00#) => "NUL",
Character'Val (16#01#) => "SOH",
Character'Val (16#02#) => "STX",
Character'Val (16#03#) => "ETX",
Character'Val (16#04#) => "EOT",
Character'Val (16#05#) => "ENQ",
Character'Val (16#06#) => "ACK",
Character'Val (16#07#) => "BEL",
Character'Val (16#08#) => "BS ",
Character'Val (16#09#) => "HT ",
Character'Val (16#0A#) => "LF ",
Character'Val (16#0B#) => "VT ",
Character'Val (16#0C#) => "FF ",
Character'Val (16#0D#) => "CR ",
Character'Val (16#0E#) => "SO ",
Character'Val (16#0F#) => "SI ",
Character'Val (16#10#) => "DLE",
Character'Val (16#11#) => "DC1",
Character'Val (16#12#) => "DC2",
Character'Val (16#13#) => "DC3",
Character'Val (16#14#) => "DC4",
Character'Val (16#15#) => "NAK",
Character'Val (16#16#) => "SYN",
Character'Val (16#17#) => "ETB",
Character'Val (16#18#) => "CAN",
Character'Val (16#19#) => "EM ",
Character'Val (16#1A#) => "SUB",
Character'Val (16#1B#) => "ESC",
Character'Val (16#1C#) => "FS ",
Character'Val (16#1D#) => "GS ",
Character'Val (16#1E#) => "RS ",
Character'Val (16#1F#) => "US ");
subtype C1_Range is Character
range Character'Val (16#7F#) .. Character'Val (16#9F#);
C1 : constant array (C1_Range) of Cname :=
(Character'Val (16#7F#) => "DEL",
Character'Val (16#80#) => "res",
Character'Val (16#81#) => "res",
Character'Val (16#82#) => "BPH",
Character'Val (16#83#) => "NBH",
Character'Val (16#84#) => "res",
Character'Val (16#85#) => "NEL",
Character'Val (16#86#) => "SSA",
Character'Val (16#87#) => "ESA",
Character'Val (16#88#) => "HTS",
Character'Val (16#89#) => "HTJ",
Character'Val (16#8A#) => "VTS",
Character'Val (16#8B#) => "PLD",
Character'Val (16#8C#) => "PLU",
Character'Val (16#8D#) => "RI ",
Character'Val (16#8E#) => "SS2",
Character'Val (16#8F#) => "SS3",
Character'Val (16#90#) => "DCS",
Character'Val (16#91#) => "PU1",
Character'Val (16#92#) => "PU2",
Character'Val (16#93#) => "STS",
Character'Val (16#94#) => "CCH",
Character'Val (16#95#) => "MW ",
Character'Val (16#96#) => "SPA",
Character'Val (16#97#) => "EPA",
Character'Val (16#98#) => "SOS",
Character'Val (16#99#) => "res",
Character'Val (16#9A#) => "SCI",
Character'Val (16#9B#) => "CSI",
Character'Val (16#9C#) => "ST ",
Character'Val (16#9D#) => "OSC",
Character'Val (16#9E#) => "PM ",
Character'Val (16#9F#) => "APC");
begin
-- Control characters are represented by their names (RM 3.5(32))
if V in C0_Range then
S (1 .. 3) := C0 (V);
P := (if S (3) = ' ' then 2 else 3);
elsif V in C1_Range then
S (1 .. 3) := C1 (V);
if S (1) /= 'r' then
P := (if S (3) = ' ' then 2 else 3);
-- Special case, res means RESERVED_nnn where nnn is the three digit
-- decimal value corresponding to the code position (more efficient
-- to compute than to store).
else
declare
VP : constant Natural := Character'Pos (V);
begin
pragma Assert (S'First = 1 and S'Last >= 12);
-- As described in the header description, this procedure
-- doesn't check the size of the string provided by the caller
-- and suppose S'First is 1.
S (1 .. 10) := "RESERVED_1";
-- Since C1_Range is 127..159, the first character is always 1
S (11) := Character'Val (48 + (VP / 10) mod 10);
S (12) := Character'Val (48 + VP mod 10);
P := 12;
end;
end if;
-- Normal characters yield the character enclosed in quotes (RM 3.5(32))
else
S (1) := ''';
S (2) := V;
S (3) := ''';
P := 3;
end if;
end Image_Character;
------------------------
-- Image_Character_05 --
------------------------
procedure Image_Character_05
(V : Character;
S : in out String;
P : out Natural)
is
pragma Assert (S'First = 1);
begin
if V = Character'Val (16#00AD#) then
P := 11;
S (1 .. P) := "SOFT_HYPHEN";
else
Image_Character (V, S, P);
end if;
end Image_Character_05;
end System.Img_Char;
| 42.962162 | 79 | 0.393558 |
234d7846a402695b08952632cbfc92494d227200 | 12,857 | adb | Ada | tools-src/gnu/gcc/gcc/ada/xtreeprs.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 80 | 2015-01-02T10:14:04.000Z | 2021-06-07T06:29:49.000Z | tools-src/gnu/gcc/gcc/ada/xtreeprs.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 9 | 2015-05-14T11:03:12.000Z | 2018-01-04T07:12:58.000Z | tools-src/gnu/gcc/gcc/ada/xtreeprs.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT SYSTEM UTILITIES --
-- --
-- X T R E E P R S --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-2001 Free Software Foundation, Inc.
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Program to construct the spec of the Treeprs package
-- Input files:
-- sinfo.ads Spec of Sinfo package
-- treeprs.adt Template for Treeprs package
-- Output files:
-- treeprs.ads Spec of Treeprs package
-- Note: this program assumes that sinfo.ads has passed the error checks which
-- are carried out by the CSinfo utility so it does not duplicate these checks
-- An optional argument allows the specification of an output file name to
-- override the default treeprs.ads file name for the generated output file.
with Ada.Command_Line; use Ada.Command_Line;
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Ada.Strings.Unbounded.Text_IO; use Ada.Strings.Unbounded.Text_IO;
with Ada.Text_IO; use Ada.Text_IO;
with GNAT.Spitbol; use GNAT.Spitbol;
with GNAT.Spitbol.Patterns; use GNAT.Spitbol.Patterns;
with GNAT.Spitbol.Table_Boolean; use GNAT.Spitbol.Table_Boolean;
with GNAT.Spitbol.Table_VString; use GNAT.Spitbol.Table_VString;
procedure XTreeprs is
package TB renames GNAT.Spitbol.Table_Boolean;
package TV renames GNAT.Spitbol.Table_VString;
Err : exception;
-- Raised on fatal error
A : VString := Nul;
Ffield : VString := Nul;
Field : VString := Nul;
Fieldno : VString := Nul;
Flagno : VString := Nul;
Line : VString := Nul;
Name : VString := Nul;
Node : VString := Nul;
Outstring : VString := Nul;
Prefix : VString := Nul;
S : VString := Nul;
S1 : VString := Nul;
Sinforev : VString := Nul;
Syn : VString := Nul;
Synonym : VString := Nul;
Temprev : VString := Nul;
Term : VString := Nul;
Treeprsrev : VString := Nul;
OutS : File_Type;
-- Output file
InS : File_Type;
-- Read sinfo.ads
InT : File_Type;
-- Read treeprs.adt
Special : TB.Table (20);
-- Table of special fields. These fields are not included in the table
-- constructed by Xtreeprs, since they are specially handled in treeprs.
-- This means these field definitions are completely ignored.
Names : array (1 .. 500) of VString;
-- Table of names of synonyms
Positions : array (1 .. 500) of Natural;
-- Table of starting positions in Pchars string for synonyms
Strings : TV.Table (300);
-- Contribution of each synonym to Pchars string, indexed by name
Count : Natural := 0;
-- Number of synonyms processed so far
Curpos : Natural := 1;
-- Number of characters generated in Pchars string so far
Lineno : Natural := 0;
-- Line number in sinfo.ads
Field_Base : constant := Character'Pos ('#');
-- Fields 1-5 are represented by the characters #$%&' (i.e. by five
-- contiguous characters starting at # (16#23#)).
Flag_Base : constant := Character'Pos ('(');
-- Flags 1-18 are represented by the characters ()*+,-./0123456789
-- (i.e. by 18 contiguous characters starting at (16#28#)).
Fieldch : Character;
-- Field character, as per above tables
Sp : aliased Natural;
-- Space left on line for Pchars output
wsp : Pattern := Span (' ' & ASCII.HT);
Get_SRev : Pattern := BreakX ('$') & "$Rev" & "ision: "
& Break (' ') * Sinforev;
Get_TRev : Pattern := BreakX ('$') & "$Rev" & "ision: "
& Break (' ') * Temprev;
Is_Temp : Pattern := BreakX ('T') * A & "T e m p l a t e";
Get_Node : Pattern := wsp & "-- N_" & Rest * Node;
Tst_Punc : Pattern := Break (" ,.");
Get_Syn : Pattern := Span (' ') & "-- " & Break (' ') * Synonym
& " (" & Break (')') * Field;
Brk_Min : Pattern := Break ('-') * Ffield;
Is_Flag : Pattern := "Flag" & Rest * Flagno;
Is_Field : Pattern := Rtab (1) & Len (1) * Fieldno;
Is_Syn : Pattern := wsp & "N_" & Break (",)") * Syn & Len (1) * Term;
Brk_Node : Pattern := Break (' ') * Node & ' ';
Chop_SP : Pattern := Len (Sp'Unrestricted_Access) * S1;
M : Match_Result;
begin
Anchored_Mode := True;
Match ("$Revision$",
"$Rev" & "ision: " & Break (' ') * Treeprsrev);
if Argument_Count > 0 then
Create (OutS, Out_File, Argument (1));
else
Create (OutS, Out_File, "treeprs.ads");
end if;
Open (InS, In_File, "sinfo.ads");
Open (InT, In_File, "treeprs.adt");
-- Initialize special fields table
Set (Special, "Analyzed", True);
Set (Special, "Cannot_Be_Constant", True);
Set (Special, "Chars", True);
Set (Special, "Comes_From_Source", True);
Set (Special, "Error_Posted", True);
Set (Special, "Etype", True);
Set (Special, "Has_No_Side_Effects", True);
Set (Special, "Is_Controlling_Actual", True);
Set (Special, "Is_Overloaded", True);
Set (Special, "Is_Static_Expression", True);
Set (Special, "Left_Opnd", True);
Set (Special, "Must_Check_Expr", True);
Set (Special, "No_Overflow_Expr", True);
Set (Special, "Paren_Count", True);
Set (Special, "Raises_Constraint_Error", True);
Set (Special, "Right_Opnd", True);
-- Get sinfo revs and write header to output file
loop
Line := Get_Line (InS);
Lineno := Lineno + 1;
if Line = "" then
raise Err;
end if;
exit when Match (Line, Get_SRev);
end loop;
-- Read template header and generate new header
loop
Line := Get_Line (InT);
if Match (Line, Get_TRev) then
Put_Line
(OutS,
"-- Generated by xtreeprs revision " &
Treeprsrev & " using");
Put_Line
(OutS,
"-- sinfo.ads revision " &
Sinforev);
Put_Line
(OutS,
"-- treeprs.adt revision "
& Temprev);
else
-- Skip lines describing the template
if Match (Line, "-- This file is a template") then
loop
Line := Get_Line (InT);
exit when Line = "";
end loop;
end if;
exit when Match (Line, "package");
if Match (Line, Is_Temp, M) then
Replace (M, A & " S p e c ");
end if;
Put_Line (OutS, Line);
end if;
end loop;
Put_Line (OutS, Line);
-- Copy rest of comments up to template insert point to spec
loop
Line := Get_Line (InT);
exit when Match (Line, "!!TEMPLATE INSERTION POINT");
Put_Line (OutS, Line);
end loop;
-- Here we are doing the actual insertions
Put_Line (OutS, " Pchars : constant String :=");
-- Loop through comments describing nodes, picking up fields
loop
Line := Get_Line (InS);
Lineno := Lineno + 1;
exit when Match (Line, " type Node_Kind");
if Match (Line, Get_Node)
and then not Match (Node, Tst_Punc)
then
Outstring := Node & ' ';
loop
Line := Get_Line (InS);
exit when Line = "";
if Match (Line, Get_Syn)
and then not Match (Synonym, "plus")
and then not Present (Special, Synonym)
then
-- Convert this field into the character used to
-- represent the field according to the table:
-- Field1 '#'
-- Field2 '$'
-- Field3 '%'
-- Field4 '&'
-- Field5 "'"
-- Flag1 "("
-- Flag2 ")"
-- Flag3 '*'
-- Flag4 '+'
-- Flag5 ','
-- Flag6 '-'
-- Flag7 '.'
-- Flag8 '/'
-- Flag9 '0'
-- Flag10 '1'
-- Flag11 '2'
-- Flag12 '3'
-- Flag13 '4'
-- Flag14 '5'
-- Flag15 '6'
-- Flag16 '7'
-- Flag17 '8'
-- Flag18 '9'
if Match (Field, Brk_Min) then
Field := Ffield;
end if;
if Match (Field, Is_Flag) then
Fieldch := Char (Flag_Base - 1 + N (Flagno));
elsif Match (Field, Is_Field) then
Fieldch := Char (Field_Base - 1 + N (Fieldno));
else
Put_Line
(Standard_Error,
"*** Line " &
Lineno &
" has unrecognized field name " &
Field);
raise Err;
end if;
Append (Outstring, Fieldch & Synonym);
end if;
end loop;
Set (Strings, Node, Outstring);
end if;
end loop;
-- Loop through actual definitions of node kind enumeration literals
loop
loop
Line := Get_Line (InS);
Lineno := Lineno + 1;
exit when Match (Line, Is_Syn);
end loop;
S := Get (Strings, Syn);
Match (S, Brk_Node, "");
Count := Count + 1;
Names (Count) := Syn;
Positions (Count) := Curpos;
Curpos := Curpos + Length (S);
Put_Line (OutS, " -- " & Node);
Prefix := V (" ");
exit when Term = ")";
-- Loop to output the string literal for Pchars
loop
Sp := 79 - 4 - Length (Prefix);
exit when (Size (S) <= Sp);
Match (S, Chop_SP, "");
Put_Line (OutS, Prefix & '"' & S1 & """ &");
Prefix := V (" ");
end loop;
Put_Line (OutS, Prefix & '"' & S & """ &");
end loop;
Put_Line (OutS, " """";");
Put_Line (OutS, "");
Put_Line
(OutS, " type Pchar_Pos_Array is array (Node_Kind) of Positive;");
Put_Line
(OutS,
" Pchar_Pos : constant Pchar_Pos_Array := Pchar_Pos_Array'(");
-- Output lines for Pchar_Pos_Array values
for M in 1 .. Count - 1 loop
Name := Rpad ("N_" & Names (M), 40);
Put_Line (OutS, " " & Name & " => " & Positions (M) & ',');
end loop;
Name := Rpad ("N_" & Names (Count), 40);
Put_Line (OutS, " " & Name & " => " & Positions (Count) & ");");
Put_Line (OutS, "");
Put_Line (OutS, "end Treeprs;");
exception
when Err =>
Put_Line (Standard_Error, "*** fatal error");
Set_Exit_Status (1);
end XTreeprs;
| 33.394805 | 79 | 0.481528 |
cb5049010a42cf17e0a657faca4cd16af9e6d5d0 | 7,304 | adb | Ada | benchmark/benchmark-eval_number.adb | skill-lang/skillAdaTestSuite | 279ea0c0cd489c2e39d7532a3b68c564497101e2 | [
"BSD-3-Clause"
] | 1 | 2019-02-09T22:04:10.000Z | 2019-02-09T22:04:10.000Z | benchmark/benchmark-eval_number.adb | skill-lang/skillAdaTestSuite | 279ea0c0cd489c2e39d7532a3b68c564497101e2 | [
"BSD-3-Clause"
] | null | null | null | benchmark/benchmark-eval_number.adb | skill-lang/skillAdaTestSuite | 279ea0c0cd489c2e39d7532a3b68c564497101e2 | [
"BSD-3-Clause"
] | null | null | null | with Benchmark_Number;
with Number.Api;
separate (Benchmark)
procedure Eval_Number (Count, Repetitions : Natural) is
package Skill renames Number.Api;
use Number;
use Skill;
Base_Name : constant String := "number";
begin
for J in 0 .. Repetitions loop
for I in 1 .. Count loop
Measure (Base_Name, Integer (10 ** I * 0.25), J, "create", Benchmark_Number.Create'Access);
Measure (Base_Name, Integer (10 ** I * 0.25), J, "write", Benchmark_Number.Write'Access);
Measure (Base_Name, Integer (10 ** I * 0.25), J, "reset", Benchmark_Number.Reset'Access);
Measure (Base_Name, Integer (10 ** I * 0.25), J, "read", Benchmark_Number.Read'Access);
Measure (Base_Name, Integer (10 ** I * 0.25), J, "create-more", Benchmark_Number.Create_More'Access);
Measure (Base_Name, Integer (10 ** I * 0.25), J, "append", Benchmark_Number.Append'Access);
Measure (Base_Name, Integer (10 ** I * 0.25), J, "reset", Benchmark_Number.Reset'Access);
Measure (Base_Name, Integer (10 ** I * 0.50), J, "create", Benchmark_Number.Create'Access);
Measure (Base_Name, Integer (10 ** I * 0.50), J, "write", Benchmark_Number.Write'Access);
Measure (Base_Name, Integer (10 ** I * 0.50), J, "reset", Benchmark_Number.Reset'Access);
Measure (Base_Name, Integer (10 ** I * 0.50), J, "read", Benchmark_Number.Read'Access);
Measure (Base_Name, Integer (10 ** I * 0.50), J, "create-more", Benchmark_Number.Create_More'Access);
Measure (Base_Name, Integer (10 ** I * 0.50), J, "append", Benchmark_Number.Append'Access);
Measure (Base_Name, Integer (10 ** I * 0.50), J, "reset", Benchmark_Number.Reset'Access);
Measure (Base_Name, Integer (10 ** I * 0.75), J, "create", Benchmark_Number.Create'Access);
Measure (Base_Name, Integer (10 ** I * 0.75), J, "write", Benchmark_Number.Write'Access);
Measure (Base_Name, Integer (10 ** I * 0.75), J, "reset", Benchmark_Number.Reset'Access);
Measure (Base_Name, Integer (10 ** I * 0.75), J, "read", Benchmark_Number.Read'Access);
Measure (Base_Name, Integer (10 ** I * 0.75), J, "create-more", Benchmark_Number.Create_More'Access);
Measure (Base_Name, Integer (10 ** I * 0.75), J, "append", Benchmark_Number.Append'Access);
Measure (Base_Name, Integer (10 ** I * 0.75), J, "reset", Benchmark_Number.Reset'Access);
Measure (Base_Name, Integer (10 ** I * 1.00), J, "create", Benchmark_Number.Create'Access);
Measure (Base_Name, Integer (10 ** I * 1.00), J, "write", Benchmark_Number.Write'Access);
Measure (Base_Name, Integer (10 ** I * 1.00), J, "reset", Benchmark_Number.Reset'Access);
Measure (Base_Name, Integer (10 ** I * 1.00), J, "read", Benchmark_Number.Read'Access);
Measure (Base_Name, Integer (10 ** I * 1.00), J, "create-more", Benchmark_Number.Create_More'Access);
Measure (Base_Name, Integer (10 ** I * 1.00), J, "append", Benchmark_Number.Append'Access);
Measure (Base_Name, Integer (10 ** I * 1.00), J, "reset", Benchmark_Number.Reset'Access);
end loop;
end loop;
Correct_Append_Size (Base_Name);
declare
Function_Name : constant String := "create";
Print_Type : constant String := "time";
begin
Ada.Text_IO.Put_Line ("\addplot+[smooth,color=blue,mark=square*,mark options={fill=white}] coordinates { % ada " & Base_Name & " " & Function_Name & " " & Print_Type);
Print (Base_Name, Repetitions, Function_Name, Print_TIME);
Ada.Text_IO.Put_Line ("};");
end;
declare
Function_Name : constant String := "write";
Print_Type : constant String := "time";
begin
Ada.Text_IO.Put_Line ("\addplot+[smooth,color=black,mark=square*,mark options={fill=white}] coordinates { % ada " & Base_Name & " " & Function_Name & " " & Print_Type);
Print (Base_Name, Repetitions, Function_Name, Print_TIME);
Ada.Text_IO.Put_Line ("};");
end;
declare
Function_Name : constant String := "read";
Print_Type : constant String := "time";
begin
Ada.Text_IO.Put_Line ("\addplot+[smooth,color=red,mark=square*,mark options={fill=white}] coordinates { % ada " & Base_Name & " " & Function_Name & " " & Print_Type);
Print (Base_Name, Repetitions, Function_Name, Print_TIME);
Ada.Text_IO.Put_Line ("};");
end;
declare
Function_Name : constant String := "create-more";
Print_Type : constant String := "time";
begin
Ada.Text_IO.Put_Line ("\addplot+[smooth,color=orange,mark=square*,mark options={fill=white}] coordinates { % ada " & Base_Name & " " & Function_Name & " " & Print_Type);
Print (Base_Name, Repetitions, Function_Name, Print_TIME);
Ada.Text_IO.Put_Line ("};");
end;
declare
Function_Name : constant String := "append";
Print_Type : constant String := "time";
begin
Ada.Text_IO.Put_Line ("\addplot+[smooth,color=teal,mark=square*,mark options={fill=white}] coordinates { % ada " & Base_Name & " " & Function_Name & " " & Print_Type);
Print (Base_Name, Repetitions, Function_Name, Print_TIME);
Ada.Text_IO.Put_Line ("};");
end;
Ada.Text_IO.New_Line;
declare
Function_Name : constant String := "write";
Print_Type : constant String := "size";
begin
Ada.Text_IO.Put_Line ("\addplot+[smooth,color=black,mark=square*,mark options={fill=white}] coordinates { % ada " & Base_Name & " " & Function_Name & " " & Print_Type);
Print (Base_Name, Repetitions, Function_Name, Print_SIZE);
Ada.Text_IO.Put_Line ("};");
end;
declare
Function_Name : constant String := "append";
Print_Type : constant String := "size";
begin
Ada.Text_IO.Put_Line ("\addplot+[smooth,color=teal,mark=square*,mark options={fill=white}] coordinates { % ada " & Base_Name & " " & Function_Name & " " & Print_Type);
Print (Base_Name, Repetitions, Function_Name, Print_SIZE);
Ada.Text_IO.Put_Line ("};");
end;
Ada.Text_IO.New_Line;
declare
Function_Name : constant String := "write";
Print_Type : constant String := "throughput";
begin
Ada.Text_IO.Put_Line ("\addplot+[smooth,color=black,mark=square*,mark options={fill=white}] coordinates { % ada " & Base_Name & " " & Function_Name & " " & Print_Type);
Print (Base_Name, Repetitions, Function_Name, Print_THROUGHPUT);
Ada.Text_IO.Put_Line ("};");
end;
declare
Function_Name : constant String := "read";
Print_Type : constant String := "throughput";
begin
Ada.Text_IO.Put_Line ("\addplot+[smooth,color=red,mark=square*,mark options={fill=white}] coordinates { % ada " & Base_Name & " " & Function_Name & " " & Print_Type);
Print (Base_Name, Repetitions, Function_Name, Print_THROUGHPUT);
Ada.Text_IO.Put_Line ("};");
end;
declare
Function_Name : constant String := "append";
Print_Type : constant String := "throughput";
begin
Ada.Text_IO.Put_Line ("\addplot+[smooth,color=teal,mark=square*,mark options={fill=white}] coordinates { % ada " & Base_Name & " " & Function_Name & " " & Print_Type);
Print (Base_Name, Repetitions, Function_Name, Print_THROUGHPUT);
Ada.Text_IO.Put_Line ("};");
end;
end Eval_Number;
| 50.372414 | 175 | 0.644578 |
205f04163ae4ecd3cfc5caf37fb3ce7d867ba2ce | 1,613 | adb | Ada | src/Ada/ewok-dma-interfaces.adb | wookey-project/ewok-legacy | c973752dac3a0ebe3f7cfca062f50744578f051b | [
"Apache-2.0"
] | null | null | null | src/Ada/ewok-dma-interfaces.adb | wookey-project/ewok-legacy | c973752dac3a0ebe3f7cfca062f50744578f051b | [
"Apache-2.0"
] | null | null | null | src/Ada/ewok-dma-interfaces.adb | wookey-project/ewok-legacy | c973752dac3a0ebe3f7cfca062f50744578f051b | [
"Apache-2.0"
] | null | null | null | --
-- Copyright 2018 The wookey project team <[email protected]>
-- - Ryad Benadjila
-- - Arnauld Michelizza
-- - Mathieu Renard
-- - Philippe Thierry
-- - Philippe Trebuchet
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
--
--
with ada.unchecked_conversion;
package body ewok.dma.interfaces
with spark_mode => off
is
procedure dma_init
is begin
ewok.dma.init;
end dma_init;
function dma_get_status
(caller_id : ewok.tasks_shared.t_task_id;
intr : soc.interrupts.t_interrupt)
return unsigned_32
is
pragma warnings (off); -- size may differ
function to_unsigned_32 is new ada.unchecked_conversion
(soc.dma.t_dma_stream_int_status, unsigned_32);
pragma warnings (on);
status : soc.dma.t_dma_stream_int_status;
ok : boolean;
begin
ewok.dma.get_status_register (caller_id, intr, status, ok);
if ok then
return to_unsigned_32 (status) and 16#0000_003F#;
else
return 0;
end if;
end dma_get_status;
end ewok.dma.interfaces;
| 27.810345 | 79 | 0.678859 |
183e5aca83baf4253c6b57c1487f763c20329df0 | 341 | ads | Ada | stm32f1/stm32gd-spi-peripheral.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 1 | 2021-04-06T07:57:56.000Z | 2021-04-06T07:57:56.000Z | stm32f1/stm32gd-spi-peripheral.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | null | null | null | stm32f1/stm32gd-spi-peripheral.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 2 | 2018-05-29T13:59:31.000Z | 2019-02-03T19:48:08.000Z | with STM32_SVD.SPI;
generic
SPI : in out STM32_SVD.SPI.SPI_Peripheral;
Data_Size : STM32GD.SPI.SPI_Data_Size := Data_Size_8b;
package STM32GD.SPI.Peripheral is
pragma Preelaborate;
procedure Init;
procedure Transfer (Data : in out SPI_Data_8b)
with
Pre => Data_Size = Data_Size_8b;
end STM32GD.SPI.Peripheral;
| 17.947368 | 57 | 0.730205 |
109427fce766c7687d2014823f97693d7351b0af | 42,659 | adb | Ada | tools-src/gnu/gcc/gcc/ada/urealp.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 80 | 2015-01-02T10:14:04.000Z | 2021-06-07T06:29:49.000Z | tools-src/gnu/gcc/gcc/ada/urealp.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 9 | 2015-05-14T11:03:12.000Z | 2018-01-04T07:12:58.000Z | tools-src/gnu/gcc/gcc/ada/urealp.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- U R E A L P --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-2001 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Alloc;
with Output; use Output;
with Table;
with Tree_IO; use Tree_IO;
package body Urealp is
Ureal_First_Entry : constant Ureal := Ureal'Succ (No_Ureal);
-- First subscript allocated in Ureal table (note that we can't just
-- add 1 to No_Ureal, since "+" means something different for Ureals!
type Ureal_Entry is record
Num : Uint;
-- Numerator (always non-negative)
Den : Uint;
-- Denominator (always non-zero, always positive if base is zero)
Rbase : Nat;
-- Base value. If Rbase is zero, then the value is simply Num / Den.
-- If Rbase is non-zero, then the value is Num / (Rbase ** Den)
Negative : Boolean;
-- Flag set if value is negative
end record;
package Ureals is new Table.Table (
Table_Component_Type => Ureal_Entry,
Table_Index_Type => Ureal,
Table_Low_Bound => Ureal_First_Entry,
Table_Initial => Alloc.Ureals_Initial,
Table_Increment => Alloc.Ureals_Increment,
Table_Name => "Ureals");
-- The following universal reals are the values returned by the constant
-- functions. They are initialized by the initialization procedure.
UR_M_0 : Ureal;
UR_0 : Ureal;
UR_Tenth : Ureal;
UR_Half : Ureal;
UR_1 : Ureal;
UR_2 : Ureal;
UR_10 : Ureal;
UR_100 : Ureal;
UR_2_128 : Ureal;
UR_2_M_128 : Ureal;
Num_Ureal_Constants : constant := 10;
-- This is used for an assertion check in Tree_Read and Tree_Write to
-- help remember to add values to these routines when we add to the list.
Normalized_Real : Ureal := No_Ureal;
-- Used to memoize Norm_Num and Norm_Den, if either of these functions
-- is called, this value is set and Normalized_Entry contains the result
-- of the normalization. On subsequent calls, this is used to avoid the
-- call to Normalize if it has already been made.
Normalized_Entry : Ureal_Entry;
-- Entry built by most recent call to Normalize
-----------------------
-- Local Subprograms --
-----------------------
function Decimal_Exponent_Hi (V : Ureal) return Int;
-- Returns an estimate of the exponent of Val represented as a normalized
-- decimal number (non-zero digit before decimal point), The estimate is
-- either correct, or high, but never low. The accuracy of the estimate
-- affects only the efficiency of the comparison routines.
function Decimal_Exponent_Lo (V : Ureal) return Int;
-- Returns an estimate of the exponent of Val represented as a normalized
-- decimal number (non-zero digit before decimal point), The estimate is
-- either correct, or low, but never high. The accuracy of the estimate
-- affects only the efficiency of the comparison routines.
function Equivalent_Decimal_Exponent (U : Ureal_Entry) return Int;
-- U is a Ureal entry for which the base value is non-zero, the value
-- returned is the equivalent decimal exponent value, i.e. the value of
-- Den, adjusted as though the base were base 10. The value is rounded
-- to the nearest integer, and so can be one off.
function Is_Integer (Num, Den : Uint) return Boolean;
-- Return true if the real quotient of Num / Den is an integer value
function Normalize (Val : Ureal_Entry) return Ureal_Entry;
-- Normalizes the Ureal_Entry by reducing it to lowest terms (with a
-- base value of 0).
function Same (U1, U2 : Ureal) return Boolean;
pragma Inline (Same);
-- Determines if U1 and U2 are the same Ureal. Note that we cannot use
-- the equals operator for this test, since that tests for equality,
-- not identity.
function Store_Ureal (Val : Ureal_Entry) return Ureal;
-- This store a new entry in the universal reals table and return
-- its index in the table.
-------------------------
-- Decimal_Exponent_Hi --
-------------------------
function Decimal_Exponent_Hi (V : Ureal) return Int is
Val : constant Ureal_Entry := Ureals.Table (V);
begin
-- Zero always returns zero
if UR_Is_Zero (V) then
return 0;
-- For numbers in rational form, get the maximum number of digits in the
-- numerator and the minimum number of digits in the denominator, and
-- subtract. For example:
-- 1000 / 99 = 1.010E+1
-- 9999 / 10 = 9.999E+2
-- This estimate may of course be high, but that is acceptable
elsif Val.Rbase = 0 then
return UI_Decimal_Digits_Hi (Val.Num) -
UI_Decimal_Digits_Lo (Val.Den);
-- For based numbers, just subtract the decimal exponent from the
-- high estimate of the number of digits in the numerator and add
-- one to accommodate possible round off errors for non-decimal
-- bases. For example:
-- 1_500_000 / 10**4 = 1.50E-2
else -- Val.Rbase /= 0
return UI_Decimal_Digits_Hi (Val.Num) -
Equivalent_Decimal_Exponent (Val) + 1;
end if;
end Decimal_Exponent_Hi;
-------------------------
-- Decimal_Exponent_Lo --
-------------------------
function Decimal_Exponent_Lo (V : Ureal) return Int is
Val : constant Ureal_Entry := Ureals.Table (V);
begin
-- Zero always returns zero
if UR_Is_Zero (V) then
return 0;
-- For numbers in rational form, get min digits in numerator, max digits
-- in denominator, and subtract and subtract one more for possible loss
-- during the division. For example:
-- 1000 / 99 = 1.010E+1
-- 9999 / 10 = 9.999E+2
-- This estimate may of course be low, but that is acceptable
elsif Val.Rbase = 0 then
return UI_Decimal_Digits_Lo (Val.Num) -
UI_Decimal_Digits_Hi (Val.Den) - 1;
-- For based numbers, just subtract the decimal exponent from the
-- low estimate of the number of digits in the numerator and subtract
-- one to accommodate possible round off errors for non-decimal
-- bases. For example:
-- 1_500_000 / 10**4 = 1.50E-2
else -- Val.Rbase /= 0
return UI_Decimal_Digits_Lo (Val.Num) -
Equivalent_Decimal_Exponent (Val) - 1;
end if;
end Decimal_Exponent_Lo;
-----------------
-- Denominator --
-----------------
function Denominator (Real : Ureal) return Uint is
begin
return Ureals.Table (Real).Den;
end Denominator;
---------------------------------
-- Equivalent_Decimal_Exponent --
---------------------------------
function Equivalent_Decimal_Exponent (U : Ureal_Entry) return Int is
-- The following table is a table of logs to the base 10
Logs : constant array (Nat range 1 .. 16) of Long_Float := (
1 => 0.000000000000000,
2 => 0.301029995663981,
3 => 0.477121254719662,
4 => 0.602059991327962,
5 => 0.698970004336019,
6 => 0.778151250383644,
7 => 0.845098040014257,
8 => 0.903089986991944,
9 => 0.954242509439325,
10 => 1.000000000000000,
11 => 1.041392685158230,
12 => 1.079181246047620,
13 => 1.113943352306840,
14 => 1.146128035678240,
15 => 1.176091259055680,
16 => 1.204119982655920);
begin
pragma Assert (U.Rbase /= 0);
return Int (Long_Float (UI_To_Int (U.Den)) * Logs (U.Rbase));
end Equivalent_Decimal_Exponent;
----------------
-- Initialize --
----------------
procedure Initialize is
begin
Ureals.Init;
UR_0 := UR_From_Components (Uint_0, Uint_1, 0, False);
UR_M_0 := UR_From_Components (Uint_0, Uint_1, 0, True);
UR_Half := UR_From_Components (Uint_1, Uint_1, 2, False);
UR_Tenth := UR_From_Components (Uint_1, Uint_1, 10, False);
UR_1 := UR_From_Components (Uint_1, Uint_1, 0, False);
UR_2 := UR_From_Components (Uint_1, Uint_Minus_1, 2, False);
UR_10 := UR_From_Components (Uint_1, Uint_Minus_1, 10, False);
UR_100 := UR_From_Components (Uint_1, Uint_Minus_2, 10, False);
UR_2_128 := UR_From_Components (Uint_1, Uint_Minus_128, 2, False);
UR_2_M_128 := UR_From_Components (Uint_1, Uint_128, 2, False);
end Initialize;
----------------
-- Is_Integer --
----------------
function Is_Integer (Num, Den : Uint) return Boolean is
begin
return (Num / Den) * Den = Num;
end Is_Integer;
----------
-- Mark --
----------
function Mark return Save_Mark is
begin
return Save_Mark (Ureals.Last);
end Mark;
--------------
-- Norm_Den --
--------------
function Norm_Den (Real : Ureal) return Uint is
begin
if not Same (Real, Normalized_Real) then
Normalized_Real := Real;
Normalized_Entry := Normalize (Ureals.Table (Real));
end if;
return Normalized_Entry.Den;
end Norm_Den;
--------------
-- Norm_Num --
--------------
function Norm_Num (Real : Ureal) return Uint is
begin
if not Same (Real, Normalized_Real) then
Normalized_Real := Real;
Normalized_Entry := Normalize (Ureals.Table (Real));
end if;
return Normalized_Entry.Num;
end Norm_Num;
---------------
-- Normalize --
---------------
function Normalize (Val : Ureal_Entry) return Ureal_Entry is
J : Uint;
K : Uint;
Tmp : Uint;
Num : Uint;
Den : Uint;
M : constant Uintp.Save_Mark := Uintp.Mark;
begin
-- Start by setting J to the greatest of the absolute values of the
-- numerator and the denominator (taking into account the base value),
-- and K to the lesser of the two absolute values. The gcd of Num and
-- Den is the gcd of J and K.
if Val.Rbase = 0 then
J := Val.Num;
K := Val.Den;
elsif Val.Den < 0 then
J := Val.Num * Val.Rbase ** (-Val.Den);
K := Uint_1;
else
J := Val.Num;
K := Val.Rbase ** Val.Den;
end if;
Num := J;
Den := K;
if K > J then
Tmp := J;
J := K;
K := Tmp;
end if;
J := UI_GCD (J, K);
Num := Num / J;
Den := Den / J;
Uintp.Release_And_Save (M, Num, Den);
-- Divide numerator and denominator by gcd and return result
return (Num => Num,
Den => Den,
Rbase => 0,
Negative => Val.Negative);
end Normalize;
---------------
-- Numerator --
---------------
function Numerator (Real : Ureal) return Uint is
begin
return Ureals.Table (Real).Num;
end Numerator;
--------
-- pr --
--------
procedure pr (Real : Ureal) is
begin
UR_Write (Real);
Write_Eol;
end pr;
-----------
-- Rbase --
-----------
function Rbase (Real : Ureal) return Nat is
begin
return Ureals.Table (Real).Rbase;
end Rbase;
-------------
-- Release --
-------------
procedure Release (M : Save_Mark) is
begin
Ureals.Set_Last (Ureal (M));
end Release;
----------
-- Same --
----------
function Same (U1, U2 : Ureal) return Boolean is
begin
return Int (U1) = Int (U2);
end Same;
-----------------
-- Store_Ureal --
-----------------
function Store_Ureal (Val : Ureal_Entry) return Ureal is
begin
Ureals.Increment_Last;
Ureals.Table (Ureals.Last) := Val;
-- Normalize representation of signed values
if Val.Num < 0 then
Ureals.Table (Ureals.Last).Negative := True;
Ureals.Table (Ureals.Last).Num := -Val.Num;
end if;
return Ureals.Last;
end Store_Ureal;
---------------
-- Tree_Read --
---------------
procedure Tree_Read is
begin
pragma Assert (Num_Ureal_Constants = 10);
Ureals.Tree_Read;
Tree_Read_Int (Int (UR_0));
Tree_Read_Int (Int (UR_M_0));
Tree_Read_Int (Int (UR_Tenth));
Tree_Read_Int (Int (UR_Half));
Tree_Read_Int (Int (UR_1));
Tree_Read_Int (Int (UR_2));
Tree_Read_Int (Int (UR_10));
Tree_Read_Int (Int (UR_100));
Tree_Read_Int (Int (UR_2_128));
Tree_Read_Int (Int (UR_2_M_128));
-- Clear the normalization cache
Normalized_Real := No_Ureal;
end Tree_Read;
----------------
-- Tree_Write --
----------------
procedure Tree_Write is
begin
pragma Assert (Num_Ureal_Constants = 10);
Ureals.Tree_Write;
Tree_Write_Int (Int (UR_0));
Tree_Write_Int (Int (UR_M_0));
Tree_Write_Int (Int (UR_Tenth));
Tree_Write_Int (Int (UR_Half));
Tree_Write_Int (Int (UR_1));
Tree_Write_Int (Int (UR_2));
Tree_Write_Int (Int (UR_10));
Tree_Write_Int (Int (UR_100));
Tree_Write_Int (Int (UR_2_128));
Tree_Write_Int (Int (UR_2_M_128));
end Tree_Write;
------------
-- UR_Abs --
------------
function UR_Abs (Real : Ureal) return Ureal is
Val : constant Ureal_Entry := Ureals.Table (Real);
begin
return Store_Ureal (
(Num => Val.Num,
Den => Val.Den,
Rbase => Val.Rbase,
Negative => False));
end UR_Abs;
------------
-- UR_Add --
------------
function UR_Add (Left : Uint; Right : Ureal) return Ureal is
begin
return UR_From_Uint (Left) + Right;
end UR_Add;
function UR_Add (Left : Ureal; Right : Uint) return Ureal is
begin
return Left + UR_From_Uint (Right);
end UR_Add;
function UR_Add (Left : Ureal; Right : Ureal) return Ureal is
Lval : Ureal_Entry := Ureals.Table (Left);
Rval : Ureal_Entry := Ureals.Table (Right);
Num : Uint;
begin
-- Note, in the temporary Ureal_Entry values used in this procedure,
-- we store the sign as the sign of the numerator (i.e. xxx.Num may
-- be negative, even though in stored entries this can never be so)
if Lval.Rbase /= 0 and then Lval.Rbase = Rval.Rbase then
declare
Opd_Min, Opd_Max : Ureal_Entry;
Exp_Min, Exp_Max : Uint;
begin
if Lval.Negative then
Lval.Num := (-Lval.Num);
end if;
if Rval.Negative then
Rval.Num := (-Rval.Num);
end if;
if Lval.Den < Rval.Den then
Exp_Min := Lval.Den;
Exp_Max := Rval.Den;
Opd_Min := Lval;
Opd_Max := Rval;
else
Exp_Min := Rval.Den;
Exp_Max := Lval.Den;
Opd_Min := Rval;
Opd_Max := Lval;
end if;
Num :=
Opd_Min.Num * Lval.Rbase ** (Exp_Max - Exp_Min) + Opd_Max.Num;
if Num = 0 then
return Store_Ureal (
(Num => Uint_0,
Den => Uint_1,
Rbase => 0,
Negative => Lval.Negative));
else
return Store_Ureal (
(Num => abs Num,
Den => Exp_Max,
Rbase => Lval.Rbase,
Negative => (Num < 0)));
end if;
end;
else
declare
Ln : Ureal_Entry := Normalize (Lval);
Rn : Ureal_Entry := Normalize (Rval);
begin
if Ln.Negative then
Ln.Num := (-Ln.Num);
end if;
if Rn.Negative then
Rn.Num := (-Rn.Num);
end if;
Num := (Ln.Num * Rn.Den) + (Rn.Num * Ln.Den);
if Num = 0 then
return Store_Ureal (
(Num => Uint_0,
Den => Uint_1,
Rbase => 0,
Negative => Lval.Negative));
else
return Store_Ureal (
Normalize (
(Num => abs Num,
Den => Ln.Den * Rn.Den,
Rbase => 0,
Negative => (Num < 0))));
end if;
end;
end if;
end UR_Add;
----------------
-- UR_Ceiling --
----------------
function UR_Ceiling (Real : Ureal) return Uint is
Val : Ureal_Entry := Normalize (Ureals.Table (Real));
begin
if Val.Negative then
return UI_Negate (Val.Num / Val.Den);
else
return (Val.Num + Val.Den - 1) / Val.Den;
end if;
end UR_Ceiling;
------------
-- UR_Div --
------------
function UR_Div (Left : Uint; Right : Ureal) return Ureal is
begin
return UR_From_Uint (Left) / Right;
end UR_Div;
function UR_Div (Left : Ureal; Right : Uint) return Ureal is
begin
return Left / UR_From_Uint (Right);
end UR_Div;
function UR_Div (Left, Right : Ureal) return Ureal is
Lval : constant Ureal_Entry := Ureals.Table (Left);
Rval : constant Ureal_Entry := Ureals.Table (Right);
Rneg : constant Boolean := Rval.Negative xor Lval.Negative;
begin
pragma Assert (Rval.Num /= Uint_0);
if Lval.Rbase = 0 then
if Rval.Rbase = 0 then
return Store_Ureal (
Normalize (
(Num => Lval.Num * Rval.Den,
Den => Lval.Den * Rval.Num,
Rbase => 0,
Negative => Rneg)));
elsif Is_Integer (Lval.Num, Rval.Num * Lval.Den) then
return Store_Ureal (
(Num => Lval.Num / (Rval.Num * Lval.Den),
Den => (-Rval.Den),
Rbase => Rval.Rbase,
Negative => Rneg));
elsif Rval.Den < 0 then
return Store_Ureal (
Normalize (
(Num => Lval.Num,
Den => Rval.Rbase ** (-Rval.Den) *
Rval.Num *
Lval.Den,
Rbase => 0,
Negative => Rneg)));
else
return Store_Ureal (
Normalize (
(Num => Lval.Num * Rval.Rbase ** Rval.Den,
Den => Rval.Num * Lval.Den,
Rbase => 0,
Negative => Rneg)));
end if;
elsif Is_Integer (Lval.Num, Rval.Num) then
if Rval.Rbase = Lval.Rbase then
return Store_Ureal (
(Num => Lval.Num / Rval.Num,
Den => Lval.Den - Rval.Den,
Rbase => Lval.Rbase,
Negative => Rneg));
elsif Rval.Rbase = 0 then
return Store_Ureal (
(Num => (Lval.Num / Rval.Num) * Rval.Den,
Den => Lval.Den,
Rbase => Lval.Rbase,
Negative => Rneg));
elsif Rval.Den < 0 then
declare
Num, Den : Uint;
begin
if Lval.Den < 0 then
Num := (Lval.Num / Rval.Num) * (Lval.Rbase ** (-Lval.Den));
Den := Rval.Rbase ** (-Rval.Den);
else
Num := Lval.Num / Rval.Num;
Den := (Lval.Rbase ** Lval.Den) *
(Rval.Rbase ** (-Rval.Den));
end if;
return Store_Ureal (
(Num => Num,
Den => Den,
Rbase => 0,
Negative => Rneg));
end;
else
return Store_Ureal (
(Num => (Lval.Num / Rval.Num) *
(Rval.Rbase ** Rval.Den),
Den => Lval.Den,
Rbase => Lval.Rbase,
Negative => Rneg));
end if;
else
declare
Num, Den : Uint;
begin
if Lval.Den < 0 then
Num := Lval.Num * (Lval.Rbase ** (-Lval.Den));
Den := Rval.Num;
else
Num := Lval.Num;
Den := Rval.Num * (Lval.Rbase ** Lval.Den);
end if;
if Rval.Rbase /= 0 then
if Rval.Den < 0 then
Den := Den * (Rval.Rbase ** (-Rval.Den));
else
Num := Num * (Rval.Rbase ** Rval.Den);
end if;
else
Num := Num * Rval.Den;
end if;
return Store_Ureal (
Normalize (
(Num => Num,
Den => Den,
Rbase => 0,
Negative => Rneg)));
end;
end if;
end UR_Div;
-----------
-- UR_Eq --
-----------
function UR_Eq (Left, Right : Ureal) return Boolean is
begin
return not UR_Ne (Left, Right);
end UR_Eq;
---------------------
-- UR_Exponentiate --
---------------------
function UR_Exponentiate (Real : Ureal; N : Uint) return Ureal is
Bas : Ureal;
Val : Ureal_Entry;
X : Uint := abs N;
Neg : Boolean;
IBas : Uint;
begin
-- If base is negative, then the resulting sign depends on whether
-- the exponent is even or odd (even => positive, odd = negative)
if UR_Is_Negative (Real) then
Neg := (N mod 2) /= 0;
Bas := UR_Negate (Real);
else
Neg := False;
Bas := Real;
end if;
Val := Ureals.Table (Bas);
-- If the base is a small integer, then we can return the result in
-- exponential form, which can save a lot of time for junk exponents.
IBas := UR_Trunc (Bas);
if IBas <= 16
and then UR_From_Uint (IBas) = Bas
then
return Store_Ureal (
(Num => Uint_1,
Den => -N,
Rbase => UI_To_Int (UR_Trunc (Bas)),
Negative => Neg));
-- If the exponent is negative then we raise the numerator and the
-- denominator (after normalization) to the absolute value of the
-- exponent and we return the reciprocal. An assert error will happen
-- if the numerator is zero.
elsif N < 0 then
pragma Assert (Val.Num /= 0);
Val := Normalize (Val);
return Store_Ureal (
(Num => Val.Den ** X,
Den => Val.Num ** X,
Rbase => 0,
Negative => Neg));
-- If positive, we distinguish the case when the base is not zero, in
-- which case the new denominator is just the product of the old one
-- with the exponent,
else
if Val.Rbase /= 0 then
return Store_Ureal (
(Num => Val.Num ** X,
Den => Val.Den * X,
Rbase => Val.Rbase,
Negative => Neg));
-- And when the base is zero, in which case we exponentiate
-- the old denominator.
else
return Store_Ureal (
(Num => Val.Num ** X,
Den => Val.Den ** X,
Rbase => 0,
Negative => Neg));
end if;
end if;
end UR_Exponentiate;
--------------
-- UR_Floor --
--------------
function UR_Floor (Real : Ureal) return Uint is
Val : Ureal_Entry := Normalize (Ureals.Table (Real));
begin
if Val.Negative then
return UI_Negate ((Val.Num + Val.Den - 1) / Val.Den);
else
return Val.Num / Val.Den;
end if;
end UR_Floor;
-------------------------
-- UR_From_Components --
-------------------------
function UR_From_Components
(Num : Uint;
Den : Uint;
Rbase : Nat := 0;
Negative : Boolean := False)
return Ureal
is
begin
return Store_Ureal (
(Num => Num,
Den => Den,
Rbase => Rbase,
Negative => Negative));
end UR_From_Components;
------------------
-- UR_From_Uint --
------------------
function UR_From_Uint (UI : Uint) return Ureal is
begin
return UR_From_Components
(abs UI, Uint_1, Negative => (UI < 0));
end UR_From_Uint;
-----------
-- UR_Ge --
-----------
function UR_Ge (Left, Right : Ureal) return Boolean is
begin
return not (Left < Right);
end UR_Ge;
-----------
-- UR_Gt --
-----------
function UR_Gt (Left, Right : Ureal) return Boolean is
begin
return (Right < Left);
end UR_Gt;
--------------------
-- UR_Is_Negative --
--------------------
function UR_Is_Negative (Real : Ureal) return Boolean is
begin
return Ureals.Table (Real).Negative;
end UR_Is_Negative;
--------------------
-- UR_Is_Positive --
--------------------
function UR_Is_Positive (Real : Ureal) return Boolean is
begin
return not Ureals.Table (Real).Negative
and then Ureals.Table (Real).Num /= 0;
end UR_Is_Positive;
----------------
-- UR_Is_Zero --
----------------
function UR_Is_Zero (Real : Ureal) return Boolean is
begin
return Ureals.Table (Real).Num = 0;
end UR_Is_Zero;
-----------
-- UR_Le --
-----------
function UR_Le (Left, Right : Ureal) return Boolean is
begin
return not (Right < Left);
end UR_Le;
-----------
-- UR_Lt --
-----------
function UR_Lt (Left, Right : Ureal) return Boolean is
begin
-- An operand is not less than itself
if Same (Left, Right) then
return False;
-- Deal with zero cases
elsif UR_Is_Zero (Left) then
return UR_Is_Positive (Right);
elsif UR_Is_Zero (Right) then
return Ureals.Table (Left).Negative;
-- Different signs are decisive (note we dealt with zero cases)
elsif Ureals.Table (Left).Negative
and then not Ureals.Table (Right).Negative
then
return True;
elsif not Ureals.Table (Left).Negative
and then Ureals.Table (Right).Negative
then
return False;
-- Signs are same, do rapid check based on worst case estimates of
-- decimal exponent, which will often be decisive. Precise test
-- depends on whether operands are positive or negative.
elsif Decimal_Exponent_Hi (Left) < Decimal_Exponent_Lo (Right) then
return UR_Is_Positive (Left);
elsif Decimal_Exponent_Lo (Left) > Decimal_Exponent_Hi (Right) then
return UR_Is_Negative (Left);
-- If we fall through, full gruesome test is required. This happens
-- if the numbers are close together, or in some weird (/=10) base.
else
declare
Imrk : constant Uintp.Save_Mark := Mark;
Rmrk : constant Urealp.Save_Mark := Mark;
Lval : Ureal_Entry;
Rval : Ureal_Entry;
Result : Boolean;
begin
Lval := Ureals.Table (Left);
Rval := Ureals.Table (Right);
-- An optimization. If both numbers are based, then subtract
-- common value of base to avoid unnecessarily giant numbers
if Lval.Rbase = Rval.Rbase and then Lval.Rbase /= 0 then
if Lval.Den < Rval.Den then
Rval.Den := Rval.Den - Lval.Den;
Lval.Den := Uint_0;
else
Lval.Den := Lval.Den - Rval.Den;
Rval.Den := Uint_0;
end if;
end if;
Lval := Normalize (Lval);
Rval := Normalize (Rval);
if Lval.Negative then
Result := (Lval.Num * Rval.Den) > (Rval.Num * Lval.Den);
else
Result := (Lval.Num * Rval.Den) < (Rval.Num * Lval.Den);
end if;
Release (Imrk);
Release (Rmrk);
return Result;
end;
end if;
end UR_Lt;
------------
-- UR_Max --
------------
function UR_Max (Left, Right : Ureal) return Ureal is
begin
if Left >= Right then
return Left;
else
return Right;
end if;
end UR_Max;
------------
-- UR_Min --
------------
function UR_Min (Left, Right : Ureal) return Ureal is
begin
if Left <= Right then
return Left;
else
return Right;
end if;
end UR_Min;
------------
-- UR_Mul --
------------
function UR_Mul (Left : Uint; Right : Ureal) return Ureal is
begin
return UR_From_Uint (Left) * Right;
end UR_Mul;
function UR_Mul (Left : Ureal; Right : Uint) return Ureal is
begin
return Left * UR_From_Uint (Right);
end UR_Mul;
function UR_Mul (Left, Right : Ureal) return Ureal is
Lval : constant Ureal_Entry := Ureals.Table (Left);
Rval : constant Ureal_Entry := Ureals.Table (Right);
Num : Uint := Lval.Num * Rval.Num;
Den : Uint;
Rneg : constant Boolean := Lval.Negative xor Rval.Negative;
begin
if Lval.Rbase = 0 then
if Rval.Rbase = 0 then
return Store_Ureal (
Normalize (
(Num => Num,
Den => Lval.Den * Rval.Den,
Rbase => 0,
Negative => Rneg)));
elsif Is_Integer (Num, Lval.Den) then
return Store_Ureal (
(Num => Num / Lval.Den,
Den => Rval.Den,
Rbase => Rval.Rbase,
Negative => Rneg));
elsif Rval.Den < 0 then
return Store_Ureal (
Normalize (
(Num => Num * (Rval.Rbase ** (-Rval.Den)),
Den => Lval.Den,
Rbase => 0,
Negative => Rneg)));
else
return Store_Ureal (
Normalize (
(Num => Num,
Den => Lval.Den * (Rval.Rbase ** Rval.Den),
Rbase => 0,
Negative => Rneg)));
end if;
elsif Lval.Rbase = Rval.Rbase then
return Store_Ureal (
(Num => Num,
Den => Lval.Den + Rval.Den,
Rbase => Lval.Rbase,
Negative => Rneg));
elsif Rval.Rbase = 0 then
if Is_Integer (Num, Rval.Den) then
return Store_Ureal (
(Num => Num / Rval.Den,
Den => Lval.Den,
Rbase => Lval.Rbase,
Negative => Rneg));
elsif Lval.Den < 0 then
return Store_Ureal (
Normalize (
(Num => Num * (Lval.Rbase ** (-Lval.Den)),
Den => Rval.Den,
Rbase => 0,
Negative => Rneg)));
else
return Store_Ureal (
Normalize (
(Num => Num,
Den => Rval.Den * (Lval.Rbase ** Lval.Den),
Rbase => 0,
Negative => Rneg)));
end if;
else
Den := Uint_1;
if Lval.Den < 0 then
Num := Num * (Lval.Rbase ** (-Lval.Den));
else
Den := Den * (Lval.Rbase ** Lval.Den);
end if;
if Rval.Den < 0 then
Num := Num * (Rval.Rbase ** (-Rval.Den));
else
Den := Den * (Rval.Rbase ** Rval.Den);
end if;
return Store_Ureal (
Normalize (
(Num => Num,
Den => Den,
Rbase => 0,
Negative => Rneg)));
end if;
end UR_Mul;
-----------
-- UR_Ne --
-----------
function UR_Ne (Left, Right : Ureal) return Boolean is
begin
-- Quick processing for case of identical Ureal values (note that
-- this also deals with comparing two No_Ureal values).
if Same (Left, Right) then
return False;
-- Deal with case of one or other operand is No_Ureal, but not both
elsif Same (Left, No_Ureal) or else Same (Right, No_Ureal) then
return True;
-- Do quick check based on number of decimal digits
elsif Decimal_Exponent_Hi (Left) < Decimal_Exponent_Lo (Right) or else
Decimal_Exponent_Lo (Left) > Decimal_Exponent_Hi (Right)
then
return True;
-- Otherwise full comparison is required
else
declare
Imrk : constant Uintp.Save_Mark := Mark;
Rmrk : constant Urealp.Save_Mark := Mark;
Lval : constant Ureal_Entry := Normalize (Ureals.Table (Left));
Rval : constant Ureal_Entry := Normalize (Ureals.Table (Right));
Result : Boolean;
begin
if UR_Is_Zero (Left) then
return not UR_Is_Zero (Right);
elsif UR_Is_Zero (Right) then
return not UR_Is_Zero (Left);
-- Both operands are non-zero
else
Result :=
Rval.Negative /= Lval.Negative
or else Rval.Num /= Lval.Num
or else Rval.Den /= Lval.Den;
Release (Imrk);
Release (Rmrk);
return Result;
end if;
end;
end if;
end UR_Ne;
---------------
-- UR_Negate --
---------------
function UR_Negate (Real : Ureal) return Ureal is
begin
return Store_Ureal (
(Num => Ureals.Table (Real).Num,
Den => Ureals.Table (Real).Den,
Rbase => Ureals.Table (Real).Rbase,
Negative => not Ureals.Table (Real).Negative));
end UR_Negate;
------------
-- UR_Sub --
------------
function UR_Sub (Left : Uint; Right : Ureal) return Ureal is
begin
return UR_From_Uint (Left) + UR_Negate (Right);
end UR_Sub;
function UR_Sub (Left : Ureal; Right : Uint) return Ureal is
begin
return Left + UR_From_Uint (-Right);
end UR_Sub;
function UR_Sub (Left, Right : Ureal) return Ureal is
begin
return Left + UR_Negate (Right);
end UR_Sub;
----------------
-- UR_To_Uint --
----------------
function UR_To_Uint (Real : Ureal) return Uint is
Val : Ureal_Entry := Normalize (Ureals.Table (Real));
Res : Uint;
begin
Res := (Val.Num + (Val.Den / 2)) / Val.Den;
if Val.Negative then
return UI_Negate (Res);
else
return Res;
end if;
end UR_To_Uint;
--------------
-- UR_Trunc --
--------------
function UR_Trunc (Real : Ureal) return Uint is
Val : constant Ureal_Entry := Normalize (Ureals.Table (Real));
begin
if Val.Negative then
return -(Val.Num / Val.Den);
else
return Val.Num / Val.Den;
end if;
end UR_Trunc;
--------------
-- UR_Write --
--------------
procedure UR_Write (Real : Ureal) is
Val : constant Ureal_Entry := Ureals.Table (Real);
begin
-- If value is negative, we precede the constant by a minus sign
-- and add an extra layer of parentheses on the outside since the
-- minus sign is part of the value, not a negation operator.
if Val.Negative then
Write_Str ("(-");
end if;
-- Constants in base 10 can be written in normal Ada literal style
-- If the literal is negative enclose in parens to emphasize that
-- it is part of the constant, and not a separate negation operator
if Val.Rbase = 10 then
UI_Write (Val.Num / 10);
Write_Char ('.');
UI_Write (Val.Num mod 10);
if Val.Den /= 0 then
Write_Char ('E');
UI_Write (1 - Val.Den);
end if;
-- Constants in a base other than 10 can still be easily written
-- in normal Ada literal style if the numerator is one.
elsif Val.Rbase /= 0 and then Val.Num = 1 then
Write_Int (Val.Rbase);
Write_Str ("#1.0#E");
UI_Write (-Val.Den);
-- Other constants with a base other than 10 are written using one
-- of the following forms, depending on the sign of the number
-- and the sign of the exponent (= minus denominator value)
-- (numerator.0*base**exponent)
-- (numerator.0*base**(-exponent))
elsif Val.Rbase /= 0 then
Write_Char ('(');
UI_Write (Val.Num, Decimal);
Write_Str (".0*");
Write_Int (Val.Rbase);
Write_Str ("**");
if Val.Den <= 0 then
UI_Write (-Val.Den, Decimal);
else
Write_Str ("(-");
UI_Write (Val.Den, Decimal);
Write_Char (')');
end if;
Write_Char (')');
-- Rational constants with a denominator of 1 can be written as
-- a real literal for the numerator integer.
elsif Val.Den = 1 then
UI_Write (Val.Num, Decimal);
Write_Str (".0");
-- Non-based (rational) constants are written in (num/den) style
else
Write_Char ('(');
UI_Write (Val.Num, Decimal);
Write_Str (".0/");
UI_Write (Val.Den, Decimal);
Write_Str (".0)");
end if;
-- Add trailing paren for negative values
if Val.Negative then
Write_Char (')');
end if;
end UR_Write;
-------------
-- Ureal_0 --
-------------
function Ureal_0 return Ureal is
begin
return UR_0;
end Ureal_0;
-------------
-- Ureal_1 --
-------------
function Ureal_1 return Ureal is
begin
return UR_1;
end Ureal_1;
-------------
-- Ureal_2 --
-------------
function Ureal_2 return Ureal is
begin
return UR_2;
end Ureal_2;
--------------
-- Ureal_10 --
--------------
function Ureal_10 return Ureal is
begin
return UR_10;
end Ureal_10;
---------------
-- Ureal_100 --
---------------
function Ureal_100 return Ureal is
begin
return UR_100;
end Ureal_100;
-----------------
-- Ureal_2_128 --
-----------------
function Ureal_2_128 return Ureal is
begin
return UR_2_128;
end Ureal_2_128;
-------------------
-- Ureal_2_M_128 --
-------------------
function Ureal_2_M_128 return Ureal is
begin
return UR_2_M_128;
end Ureal_2_M_128;
----------------
-- Ureal_Half --
----------------
function Ureal_Half return Ureal is
begin
return UR_Half;
end Ureal_Half;
---------------
-- Ureal_M_0 --
---------------
function Ureal_M_0 return Ureal is
begin
return UR_M_0;
end Ureal_M_0;
-----------------
-- Ureal_Tenth --
-----------------
function Ureal_Tenth return Ureal is
begin
return UR_Tenth;
end Ureal_Tenth;
end Urealp;
| 28.960625 | 79 | 0.490752 |
392f96eb906c88f29a86a5db2060eedca38cff33 | 778 | ads | Ada | ada-numerics.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 15 | 2018-07-08T07:09:19.000Z | 2021-11-21T09:58:55.000Z | ada-numerics.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 4 | 2019-11-17T20:04:33.000Z | 2021-08-29T21:24:55.000Z | ada-numerics.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 3 | 2020-04-23T11:17:11.000Z | 2021-08-29T19:31:09.000Z | -- Standard Ada library specification
-- Copyright (c) 2003-2018 Maxim Reznik <[email protected]>
-- Copyright (c) 2004-2016 AXE Consultants
-- Copyright (c) 2004, 2005, 2006 Ada-Europe
-- Copyright (c) 2000 The MITRE Corporation, Inc.
-- Copyright (c) 1992, 1993, 1994, 1995 Intermetrics, Inc.
-- SPDX-License-Identifier: BSD-3-Clause and LicenseRef-AdaReferenceManual
---------------------------------------------------------------------------
package Ada.Numerics is
pragma Pure (Numerics);
Argument_Error : exception;
Pi : constant :=
3.14159_26535_89793_23846_26433_83279_50288_41971_69399_37511;
π : constant := Pi;
e : constant :=
2.71828_18284_59045_23536_02874_71352_66249_77572_47093_69996;
end Ada.Numerics;
| 32.416667 | 75 | 0.64653 |
1044ea704e75d11e304194019f716f90588ba5db | 1,020 | ads | Ada | 3-mid/opengl/source/lean/model/opengl-model-box-lit_textured.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2022-01-20T07:13:42.000Z | 2022-01-20T07:13:42.000Z | 3-mid/opengl/source/lean/model/opengl-model-box-lit_textured.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | 3-mid/opengl/source/lean/model/opengl-model-box-lit_textured.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | with
openGL.Geometry,
openGL.Font;
package openGL.Model.Box.lit_textured
--
-- Models a lit and textured box.
--
-- Each face may have a separate texture.
--
is
type Item is new Model.box.item with private;
type View is access all Item'Class;
type Face is
record
texture_Name : asset_Name := null_Asset; -- The texture applied to the face.
end record;
type Faces is array (Side) of Face;
---------
--- Forge
--
function new_Box (Size : in Vector_3;
Faces : in lit_textured.Faces) return View;
--------------
--- Attributes
--
overriding
function to_GL_Geometries (Self : access Item; Textures : access Texture.name_Map_of_texture'Class;
Fonts : in Font.font_id_Map_of_font) return Geometry.views;
private
type Item is new Model.box.item with
record
Faces : lit_textured.Faces;
end record;
end openGL.Model.Box.lit_textured;
| 20.4 | 118 | 0.60098 |
39425681995a0e2346cae338339da575bf4602fc | 4,722 | adb | Ada | src/ewok-exti.adb | PThierry/ewok-kernel | e9c23cb3fd0afd8378bc27418778e1117d5e16cc | [
"Apache-2.0"
] | 65 | 2018-09-26T09:10:11.000Z | 2022-01-30T21:17:37.000Z | src/ewok-exti.adb | PThierry/ewok-kernel | e9c23cb3fd0afd8378bc27418778e1117d5e16cc | [
"Apache-2.0"
] | 22 | 2019-04-07T15:15:54.000Z | 2020-10-15T12:45:54.000Z | src/ewok-exti.adb | PThierry/ewok-kernel | e9c23cb3fd0afd8378bc27418778e1117d5e16cc | [
"Apache-2.0"
] | 10 | 2018-09-27T09:43:08.000Z | 2021-01-29T22:50:17.000Z | --
-- Copyright 2018 The wookey project team <[email protected]>
-- - Ryad Benadjila
-- - Arnauld Michelizza
-- - Mathieu Renard
-- - Philippe Thierry
-- - Philippe Trebuchet
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
--
--
with soc.exti; use soc.exti;
with soc.nvic;
with soc.syscfg;
with soc.gpio;
with ewok.exported.gpios; use ewok.exported.gpios;
with ewok.exti.handler;
package body ewok.exti
with spark_mode => off
is
procedure init
is
begin
ewok.exti.handler.init;
soc.exti.init;
end init;
procedure enable
(ref : in ewok.exported.gpios.t_gpio_ref)
is
line : soc.exti.t_exti_line_index;
begin
line := soc.exti.t_exti_line_index'val
(soc.gpio.t_gpio_pin_index'pos (ref.pin));
soc.exti.enable (line);
case ref.pin is
when 0 => soc.nvic.enable_irq (soc.nvic.EXTI_Line_0);
when 1 => soc.nvic.enable_irq (soc.nvic.EXTI_Line_1);
when 2 => soc.nvic.enable_irq (soc.nvic.EXTI_Line_2);
when 3 => soc.nvic.enable_irq (soc.nvic.EXTI_Line_3);
when 4 => soc.nvic.enable_irq (soc.nvic.EXTI_Line_4);
when 5 .. 9 => soc.nvic.enable_irq (soc.nvic.EXTI_Line_5_9);
when 10 .. 15 => soc.nvic.enable_irq (soc.nvic.EXTI_Line_10_15);
end case;
end enable;
procedure disable
(ref : in ewok.exported.gpios.t_gpio_ref)
is
line : soc.exti.t_exti_line_index;
begin
line := soc.exti.t_exti_line_index'val
(soc.gpio.t_gpio_pin_index'pos (ref.pin));
soc.exti.disable (line);
end disable;
function is_used
(ref : ewok.exported.gpios.t_gpio_ref)
return boolean
is
line : constant soc.exti.t_exti_line_index :=
soc.exti.t_exti_line_index'val
(soc.gpio.t_gpio_pin_index'pos (ref.pin));
begin
return exti_line_registered (line) or
soc.exti.is_enabled (line);
end is_used;
procedure register
(conf : in ewok.exported.gpios.t_gpio_config_access;
success : out boolean)
is
line : constant soc.exti.t_exti_line_index :=
soc.exti.t_exti_line_index'val
(soc.gpio.t_gpio_pin_index'pos (conf.all.kref.pin));
begin
-- Is EXTI setting required?
if not conf.all.settings.set_exti then
success := true;
return;
end if;
-- Is EXTI line already registered?
if exti_line_registered (line) then
success := false;
return;
end if;
-- If the line is already set, thus it's already used.
-- We return in error.
if soc.exti.is_enabled (line) then
success := false;
return;
end if;
-- Configuring the triggers
case conf.all.exti_trigger is
when GPIO_EXTI_TRIGGER_NONE =>
success := true;
return;
when GPIO_EXTI_TRIGGER_RISE =>
soc.exti.EXTI.RTSR.line(line) := TRIGGER_ENABLED;
when GPIO_EXTI_TRIGGER_FALL =>
soc.exti.EXTI.FTSR.line(line) := TRIGGER_ENABLED;
when GPIO_EXTI_TRIGGER_BOTH =>
soc.exti.EXTI.RTSR.line(line) := TRIGGER_ENABLED;
soc.exti.EXTI.FTSR.line(line) := TRIGGER_ENABLED;
end case;
-- Configuring the SYSCFG register
soc.syscfg.set_exti_port (conf.all.kref.pin, conf.all.kref.port);
exti_line_registered (line) := true;
success := true;
end register;
procedure release
(conf : in ewok.exported.gpios.t_gpio_config_access)
is
line : constant soc.exti.t_exti_line_index :=
soc.exti.t_exti_line_index'val
(soc.gpio.t_gpio_pin_index'pos (conf.all.kref.pin));
begin
if not conf.all.settings.set_exti then
return;
end if;
if not exti_line_registered (line) then
return;
end if;
if not soc.exti.is_enabled (line) then
return;
end if;
if conf.all.exti_trigger = GPIO_EXTI_TRIGGER_NONE then
return;
end if;
soc.exti.disable (line);
exti_line_registered (line) := false;
end release;
end ewok.exti;
| 26.829545 | 79 | 0.625159 |
dfc369149199b70771d53dcf564387ca2e7fc3d4 | 3,099 | ads | Ada | bb-runtimes/arm/stm32/stm32f429x/s-bbmcpa.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/arm/stm32/stm32f429x/s-bbmcpa.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/arm/stm32/stm32f429x/s-bbmcpa.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . B B . M C U _ P A R A M E T E R S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2016, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
-- The port of GNARL to bare board targets was initially developed by the --
-- Real-Time Systems Group at the Technical University of Madrid. --
-- --
------------------------------------------------------------------------------
-- This package defines MCU parameters for the STM32F429x family
with Interfaces.STM32;
with Interfaces.STM32.PWR;
package System.BB.MCU_Parameters is
pragma No_Elaboration_Code_All;
pragma Preelaborate;
use type Interfaces.STM32.Bit;
Number_Of_Interrupts : constant := 92;
procedure PWR_Initialize;
procedure PWR_Overdrive_Enable;
function Is_PWR_Stabilized return Boolean
is (Interfaces.STM32.PWR.PWR_Periph.CSR.VOSRDY = 1);
end System.BB.MCU_Parameters;
| 56.345455 | 78 | 0.437238 |
1016deea93d2ef8cc1eadbe8976249ea6a11c945 | 4,585 | ads | Ada | source/nodes/program-nodes-at_clauses.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/nodes/program-nodes-at_clauses.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/nodes/program-nodes-at_clauses.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | 1 | 2019-10-16T09:05:27.000Z | 2019-10-16T09:05:27.000Z | -- SPDX-FileCopyrightText: 2019 Max Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Program.Lexical_Elements;
with Program.Elements.Identifiers;
with Program.Elements.Expressions;
with Program.Elements.At_Clauses;
with Program.Element_Visitors;
package Program.Nodes.At_Clauses is
pragma Preelaborate;
type At_Clause is
new Program.Nodes.Node and Program.Elements.At_Clauses.At_Clause
and Program.Elements.At_Clauses.At_Clause_Text
with private;
function Create
(For_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Name : not null Program.Elements.Identifiers.Identifier_Access;
Use_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
At_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Expression : not null Program.Elements.Expressions.Expression_Access;
Semicolon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access)
return At_Clause;
type Implicit_At_Clause is
new Program.Nodes.Node and Program.Elements.At_Clauses.At_Clause
with private;
function Create
(Name : not null Program.Elements.Identifiers
.Identifier_Access;
Expression : not null Program.Elements.Expressions
.Expression_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_At_Clause
with Pre =>
Is_Part_Of_Implicit or Is_Part_Of_Inherited or Is_Part_Of_Instance;
private
type Base_At_Clause is
abstract new Program.Nodes.Node and Program.Elements.At_Clauses.At_Clause
with record
Name : not null Program.Elements.Identifiers.Identifier_Access;
Expression : not null Program.Elements.Expressions.Expression_Access;
end record;
procedure Initialize (Self : in out Base_At_Clause'Class);
overriding procedure Visit
(Self : not null access Base_At_Clause;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class);
overriding function Name
(Self : Base_At_Clause)
return not null Program.Elements.Identifiers.Identifier_Access;
overriding function Expression
(Self : Base_At_Clause)
return not null Program.Elements.Expressions.Expression_Access;
overriding function Is_At_Clause (Self : Base_At_Clause) return Boolean;
overriding function Is_Representation_Clause
(Self : Base_At_Clause)
return Boolean;
overriding function Is_Clause (Self : Base_At_Clause) return Boolean;
type At_Clause is
new Base_At_Clause and Program.Elements.At_Clauses.At_Clause_Text
with record
For_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Use_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
At_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Semicolon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
end record;
overriding function To_At_Clause_Text
(Self : in out At_Clause)
return Program.Elements.At_Clauses.At_Clause_Text_Access;
overriding function For_Token
(Self : At_Clause)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Use_Token
(Self : At_Clause)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function At_Token
(Self : At_Clause)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Semicolon_Token
(Self : At_Clause)
return not null Program.Lexical_Elements.Lexical_Element_Access;
type Implicit_At_Clause is
new Base_At_Clause
with record
Is_Part_Of_Implicit : Boolean;
Is_Part_Of_Inherited : Boolean;
Is_Part_Of_Instance : Boolean;
end record;
overriding function To_At_Clause_Text
(Self : in out Implicit_At_Clause)
return Program.Elements.At_Clauses.At_Clause_Text_Access;
overriding function Is_Part_Of_Implicit
(Self : Implicit_At_Clause)
return Boolean;
overriding function Is_Part_Of_Inherited
(Self : Implicit_At_Clause)
return Boolean;
overriding function Is_Part_Of_Instance
(Self : Implicit_At_Clause)
return Boolean;
end Program.Nodes.At_Clauses;
| 33.224638 | 79 | 0.719302 |
39108d65d48f7beab89df3ef84d7cb396414fdef | 2,737 | adb | Ada | 05_files/Practica5.adb | hbarrientosg/cs-mp | e62f467551e5f1b46747bc6642607ac48d61142a | [
"MIT"
] | null | null | null | 05_files/Practica5.adb | hbarrientosg/cs-mp | e62f467551e5f1b46747bc6642607ac48d61142a | [
"MIT"
] | null | null | null | 05_files/Practica5.adb | hbarrientosg/cs-mp | e62f467551e5f1b46747bc6642607ac48d61142a | [
"MIT"
] | null | null | null | with Text_Io,sequential_io,Direct_io;
with Ada.strings.unbounded;
use text_io;
use Ada.strings.unbounded;
procedure practica5 is
Type TDatos is record
Palabra:string(1..15);-- Este el tipo de dato que tiene el fichero de acceso directo
numero:Natural;
end record;
package ficheroSec is new Sequential_Io(positive);-- Declaro los ficheros indice y secuencial y de que estructuras
package ficheroInd is new Direct_io(TDatos);-- se componen ambos ficheros
use FicheroSec,ficheroInd;
-- declaro las variables que voy a utilizar--
Nombre_dat,nombre_ind,Nombre_txt:string(1..50);
Lon_dat,lon_Ind,lon_txt:Natural;
Fichero_dat:FicheroInd.File_type;
fichero_Ind:FicheroSec.File_type;
fichero_Txt:Text_io.File_type;
Dato:Tdatos;
N:Natural;
Linea:unbounded_string:=null_unbounded_string;
begin
-- Pido los nombres de los ficheros por pantalla
put_line("Deme el Nombre del fichero con extencion .ind");
get_line(Nombre_ind,Lon_ind);
put_line("Deme el Nombre del Fichero con extencion .dat");
get_line(Nombre_dat,Lon_dat);
Put_line("Deme el nombre del fichero de texto destino");
get_line(Nombre_txt,Lon_txt);
-- Abro el fichero secuencial y el de acceso directo
open(Fichero_Dat,in_file,Nombre_dat(1..lon_Dat));
open(Fichero_Ind,in_file,Nombre_Ind(1..Lon_ind));
Create(fichero_Txt,out_file,Nombre_Txt(1..lon_Txt));
loop
read(fichero_ind,N);
-- leo en el fichero la posicion
Read(fichero_dat,Dato,Ficheroind.positive_count(N));
-- leo el dato en la posicion que marac el fichero anterior
if index(to_unbounded_string(Dato.Palabra(1..dato.Numero)),".")= dato.Numero then
-- si la palabra tiene el punto al final lo concateno a linea y lo escribo en el fichero
Linea:=Linea & to_unbounded_string(Dato.Palabra(1..dato.Numero));
put_line(Fichero_txt,To_string(Linea));
linea:=null_unbounded_string;
else
--si no entoces lo concateno con un espacio a linea
Linea:=Linea & to_unbounded_string(Dato.Palabra(1..dato.Numero)) & " ";
end if;
exit when end_of_File(fichero_ind);
end loop;
If Length(Linea)/=0 then-- si al final no hay punto entoces le quito el espacio y
--lo escribo en el fichero
Linea:=to_unbounded_string(slice(linea,1,Length(Linea)-1));
put_line(Fichero_txt,To_string(Linea));
end if;
close(Fichero_ind);
Close(Fichero_Dat);--Cierro los ficheros
Close(Fichero_Txt);
exception
when ficheroInd.Name_Error | FicheroSec.name_Error =>
put_line("El nombre del archivo no existe");
when ficheroInd.End_Error | FicheroSec.End_Error =>
put_line("No ha escrito la ruta del archivo");
When FicheroInd.Device_Error | FicheroSec.Device_Error =>
Put_line("No puede Escribir en el dispositivo");
when Others =>
Put_line("Error desconocido");
end Practica5;
| 39.666667 | 115 | 0.764341 |
101ba22744088e4c1d0238fca06d091fdf7df4f9 | 617 | adb | Ada | msp430x2/mspgd-gpio-polled.adb | ekoeppen/MSP430_Generic_Ada_Drivers | 12b8238ea22dbb0c0c6c63ca46bfa7e2cb80334a | [
"MIT"
] | null | null | null | msp430x2/mspgd-gpio-polled.adb | ekoeppen/MSP430_Generic_Ada_Drivers | 12b8238ea22dbb0c0c6c63ca46bfa7e2cb80334a | [
"MIT"
] | null | null | null | msp430x2/mspgd-gpio-polled.adb | ekoeppen/MSP430_Generic_Ada_Drivers | 12b8238ea22dbb0c0c6c63ca46bfa7e2cb80334a | [
"MIT"
] | null | null | null | package body MSPGD.GPIO.Polled is
T : Boolean;
procedure Wait_For_Trigger is
begin
while Pin.Is_Set loop
null;
end loop;
T := True;
end Wait_For_Trigger;
procedure Clear_Trigger is
begin
T := False;
end Clear_Trigger;
function Triggered return Boolean is
begin
return T;
end Triggered;
procedure Cancel_Wait is
begin
null;
end Cancel_Wait;
procedure Configure_Trigger (Event : Boolean := False; Rising : Boolean := False; Falling : Boolean := False) is
begin
null;
end Configure_Trigger;
end MSPGD.GPIO.Polled;
| 18.147059 | 115 | 0.65154 |
104bc20c75855abff19fd45aa0f7cc972fa3d274 | 3,229 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce3708a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce3708a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce3708a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- CE3708A.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE:
-- CHECK THAT INTEGER_IO PUT RAISES LAYOUT_ERROR WHEN THE MINIMUM
-- WIDTH REQUIRED FOR THE OUTPUT VALUE IS GREATER THAN THE LENGTH
-- OF THE STRING. ALSO CHECK THAT INTEGER_IO PUT PADS THE OUTPUT
-- ON THE LEFT WITH SPACES IF THE LENGTH OF THE STRING IS GREATER
-- THAN THE MINIMUM WIDTH REQUIRED.
-- HISTORY:
-- SPS 10/05/82
-- CPP 07/30/84
-- JLH 09/11/87 ADDED CASES FOR PADDING OF OUTPUT STRING.
WITH REPORT; USE REPORT;
WITH TEXT_IO; USE TEXT_IO;
PROCEDURE CE3708A IS
BEGIN
TEST ("CE3708A", "CHECK THAT INTEGER_IO PUT RAISES LAYOUT_ERROR " &
"WHEN THE MINIMUM WIDTH REQUIRED FOR THE " &
"OUTPUT VALUE IS GREATER THAN THE LENGTH OF " &
"THE STRING. ALSO CHECK THAT INTEGER_IO PUT " &
"PADS THE OUTPUT ON THE LEFT WITH SPACES IF " &
"THE LENGTH OF THE STRING IS GREATER THAN THE " &
"MINIMUM WIDTH REQUIRED.");
DECLARE
PACKAGE IIO IS NEW INTEGER_IO (INTEGER);
USE IIO;
ST1 : STRING (1 .. 4);
ST2 : STRING (1 .. 4);
ST : STRING (1 .. 4) := "6382";
BEGIN
PUT (ST1, IDENT_INT(6382));
IF ST1 /= ST THEN
FAILED ("PUT TO STRING INCORRECT");
END IF;
BEGIN
PUT (ST2, IDENT_INT(12345));
FAILED ("LAYOUT_ERROR NOT RAISED");
EXCEPTION
WHEN LAYOUT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED");
END;
PUT (ST1, IDENT_INT(123));
IF ST1 /= " 123" THEN
FAILED ("PUT DID NOT PAD WITH BLANKS - 1");
END IF;
PUT (ST2, IDENT_INT(-2));
IF ST2 /= " -2" THEN
FAILED ("PUT DID NOT PAD WITH BLANKS - 2");
END IF;
END;
RESULT;
END CE3708A;
| 36.693182 | 79 | 0.582224 |
4a73b3f812272d474b8d814f6e9552aaabe30da3 | 610 | adb | Ada | examples/test_sha512.adb | ytomino/openssl-ada | efacd262cec28c773e80246319f25ab316d93d81 | [
"OpenSSL",
"Unlicense"
] | 1 | 2020-09-04T18:05:22.000Z | 2020-09-04T18:05:22.000Z | examples/test_sha512.adb | ytomino/openssl-ada | efacd262cec28c773e80246319f25ab316d93d81 | [
"OpenSSL",
"Unlicense"
] | null | null | null | examples/test_sha512.adb | ytomino/openssl-ada | efacd262cec28c773e80246319f25ab316d93d81 | [
"OpenSSL",
"Unlicense"
] | null | null | null | with Ada.Streams;
with Ada.Text_IO;
with Crypto.SHA512; use Crypto.SHA512;
procedure Test_SHA512 is
procedure Test_01 is
use type Ada.Streams.Stream_Element_Array;
C : Context := Initial;
D : Fingerprint;
begin
Update (C, "a");
Final (C, D);
pragma Assert (
Image (D) =
"1f40fc92da241694750979ee6cf582f2d5d7d28e18335de05abc54d0560e0f5302860c652bf08"
& "d560252aa5e74210546f369fbbbce8c12cfc7957b2652fe9a75");
pragma Assert (D = Value (Image (D)));
end Test_01;
pragma Debug (Test_01);
begin
-- finish
Ada.Text_IO.Put_Line (Ada.Text_IO.Standard_Error.all, "ok");
end Test_SHA512;
| 26.521739 | 83 | 0.742623 |
23017ac4b57cf993ff33dc48340ab797fdc1a96f | 1,103 | ads | Ada | applet/aide/source/editors/aide-editor-of_enumeration_type.ads | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | 3 | 2017-04-29T14:25:22.000Z | 2017-09-29T10:15:28.000Z | applet/aide/source/editors/aide-editor-of_enumeration_type.ads | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | null | null | null | applet/aide/source/editors/aide-editor-of_enumeration_type.ads | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | null | null | null | with
AdaM.a_Type.enumeration_type,
gtk.Widget;
private
with
gtk.gEntry,
gtk.Box,
gtk.Label,
gtk.Button;
package aIDE.Editor.of_enumeration_type
is
type Item is new Editor.item with private;
type View is access all Item'Class;
package Forge
is
function to_Editor (the_Target : in AdaM.a_Type.enumeration_type.view) return View;
end Forge;
overriding
function top_Widget (Self : in Item) return gtk.Widget.Gtk_Widget;
private
use gtk.Button,
gtk.gEntry,
gtk.Label,
gtk.Box;
type Item is new Editor.item with
record
Target : AdaM.a_Type.enumeration_type.view;
top_Box : gtk_Box;
name_Entry : Gtk_Entry;
is_Label : Gtk_Label;
open_parenthesis_Label : Gtk_Label;
close_parenthesis_Label : Gtk_Label;
literals_Box : gtk_Box;
rid_Button : gtk_Button;
end record;
overriding
procedure freshen (Self : in out Item);
end aIDE.Editor.of_enumeration_type;
| 19.696429 | 89 | 0.615594 |
cb8c969c7b0da2f9d432dc309b63bae3e8676c29 | 6,797 | adb | Ada | llvm-gcc-4.2-2.9/gcc/ada/s-osinte-vxworks.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 1 | 2016-04-09T02:58:13.000Z | 2016-04-09T02:58:13.000Z | llvm-gcc-4.2-2.9/gcc/ada/s-osinte-vxworks.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/s-osinte-vxworks.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . O S _ I N T E R F A C E --
-- --
-- B o d y --
-- --
-- Copyright (C) 1997-2005 Free Software Foundation --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNARL is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNARL; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
-- This is the VxWorks version.
-- This package encapsulates all direct interfaces to OS services
-- that are needed by children of System.
pragma Polling (Off);
-- Turn off polling, we do not want ATC polling to take place during
-- tasking operations. It causes infinite loops and other problems.
package body System.OS_Interface is
use type Interfaces.C.int;
Low_Priority : constant := 255;
-- VxWorks native (default) lowest scheduling priority.
----------
-- kill --
----------
function kill (pid : t_id; sig : Signal) return int is
function c_kill (pid : t_id; sig : Signal) return int;
pragma Import (C, c_kill, "kill");
begin
return c_kill (pid, sig);
end kill;
--------------------
-- Set_Time_Slice --
--------------------
function Set_Time_Slice (ticks : int) return int is
function kernelTimeSlice (ticks : int) return int;
pragma Import (C, kernelTimeSlice, "kernelTimeSlice");
begin
return kernelTimeSlice (ticks);
end Set_Time_Slice;
-------------
-- sigwait --
-------------
function sigwait
(set : access sigset_t;
sig : access Signal) return int
is
Result : int;
function sigwaitinfo
(set : access sigset_t; sigvalue : System.Address) return int;
pragma Import (C, sigwaitinfo, "sigwaitinfo");
begin
Result := sigwaitinfo (set, System.Null_Address);
if Result /= -1 then
sig.all := Signal (Result);
return 0;
else
sig.all := 0;
return errno;
end if;
end sigwait;
-----------------
-- To_Duration --
-----------------
function To_Duration (TS : timespec) return Duration is
begin
return Duration (TS.ts_sec) + Duration (TS.ts_nsec) / 10#1#E9;
end To_Duration;
-----------------
-- To_Timespec --
-----------------
function To_Timespec (D : Duration) return timespec is
S : time_t;
F : Duration;
begin
S := time_t (Long_Long_Integer (D));
F := D - Duration (S);
-- If F has negative value due to a round-up, adjust for positive F
-- value.
if F < 0.0 then
S := S - 1;
F := F + 1.0;
end if;
return timespec'(ts_sec => S,
ts_nsec => long (Long_Long_Integer (F * 10#1#E9)));
end To_Timespec;
-------------------------
-- To_VxWorks_Priority --
-------------------------
function To_VxWorks_Priority (Priority : in int) return int is
begin
return Low_Priority - Priority;
end To_VxWorks_Priority;
--------------------
-- To_Clock_Ticks --
--------------------
-- ??? - For now, we'll always get the system clock rate
-- since it is allowed to be changed during run-time in
-- VxWorks. A better method would be to provide an operation
-- to set it that so we can always know its value.
--
-- Another thing we should probably allow for is a resultant
-- tick count greater than int'Last. This should probably
-- be a procedure with two output parameters, one in the
-- range 0 .. int'Last, and another representing the overflow
-- count.
function To_Clock_Ticks (D : Duration) return int is
Ticks : Long_Long_Integer;
Rate_Duration : Duration;
Ticks_Duration : Duration;
begin
if D < 0.0 then
return -1;
end if;
-- Ensure that the duration can be converted to ticks
-- at the current clock tick rate without overflowing.
Rate_Duration := Duration (sysClkRateGet);
if D > (Duration'Last / Rate_Duration) then
Ticks := Long_Long_Integer (int'Last);
else
Ticks_Duration := D * Rate_Duration;
Ticks := Long_Long_Integer (Ticks_Duration);
if Ticks_Duration > Duration (Ticks) then
Ticks := Ticks + 1;
end if;
if Ticks > Long_Long_Integer (int'Last) then
Ticks := Long_Long_Integer (int'Last);
end if;
end if;
return int (Ticks);
end To_Clock_Ticks;
----------------
-- VX_FP_TASK --
----------------
function VX_FP_TASK return int is
begin
return 16#0008#;
end VX_FP_TASK;
end System.OS_Interface;
| 34.678571 | 78 | 0.514197 |
cb2c6546ae77641e1607cd7f225680418bb2adbe | 72,696 | ads | Ada | legacy-core/src/test/resources/dm/TestModel2.ads | greifentor/archimedes-legacy | 32eac85cba6e82b2c2001b339cb6af20b11799b9 | [
"Apache-2.0"
] | null | null | null | legacy-core/src/test/resources/dm/TestModel2.ads | greifentor/archimedes-legacy | 32eac85cba6e82b2c2001b339cb6af20b11799b9 | [
"Apache-2.0"
] | 27 | 2021-03-11T13:09:39.000Z | 2021-11-19T07:14:13.000Z | legacy-core/src/test/resources/dm/TestModel2.ads | greifentor/archimedes-legacy | 32eac85cba6e82b2c2001b339cb6af20b11799b9 | [
"Apache-2.0"
] | null | null | null | <Diagramm>
<AdditionalSQLCode>
<SQLCode>
<AdditionalSQLCodePostChanging></AdditionalSQLCodePostChanging>
<AdditionalSQLCodePostReducing></AdditionalSQLCodePostReducing>
<AdditionalSQLCodePreChanging></AdditionalSQLCodePreChanging>
<AdditionalSQLCodePreExtending></AdditionalSQLCodePreExtending>
</SQLCode>
</AdditionalSQLCode>
<Colors>
<Anzahl>23</Anzahl>
<Color0>
<B>255</B>
<G>0</G>
<Name>blau</Name>
<R>0</R>
</Color0>
<Color1>
<B>221</B>
<G>212</G>
<Name>blaugrau</Name>
<R>175</R>
</Color1>
<Color10>
<B>192</B>
<G>192</G>
<Name>hellgrau</Name>
<R>192</R>
</Color10>
<Color11>
<B>255</B>
<G>0</G>
<Name>kamesinrot</Name>
<R>255</R>
</Color11>
<Color12>
<B>0</B>
<G>200</G>
<Name>orange</Name>
<R>255</R>
</Color12>
<Color13>
<B>255</B>
<G>247</G>
<Name>pastell-blau</Name>
<R>211</R>
</Color13>
<Color14>
<B>186</B>
<G>245</G>
<Name>pastell-gelb</Name>
<R>255</R>
</Color14>
<Color15>
<B>234</B>
<G>255</G>
<Name>pastell-gr&uuml;n</Name>
<R>211</R>
</Color15>
<Color16>
<B>255</B>
<G>211</G>
<Name>pastell-lila</Name>
<R>244</R>
</Color16>
<Color17>
<B>191</B>
<G>165</G>
<Name>pastell-rot</Name>
<R>244</R>
</Color17>
<Color18>
<B>175</B>
<G>175</G>
<Name>pink</Name>
<R>255</R>
</Color18>
<Color19>
<B>0</B>
<G>0</G>
<Name>rot</Name>
<R>255</R>
</Color19>
<Color2>
<B>61</B>
<G>125</G>
<Name>braun</Name>
<R>170</R>
</Color2>
<Color20>
<B>0</B>
<G>0</G>
<Name>schwarz</Name>
<R>0</R>
</Color20>
<Color21>
<B>255</B>
<G>255</G>
<Name>t&uuml;rkis</Name>
<R>0</R>
</Color21>
<Color22>
<B>255</B>
<G>255</G>
<Name>wei&szlig;</Name>
<R>255</R>
</Color22>
<Color3>
<B>64</B>
<G>64</G>
<Name>dunkelgrau</Name>
<R>64</R>
</Color3>
<Color4>
<B>84</B>
<G>132</G>
<Name>dunkelgr&uuml;n</Name>
<R>94</R>
</Color4>
<Color5>
<B>0</B>
<G>255</G>
<Name>gelb</Name>
<R>255</R>
</Color5>
<Color6>
<B>0</B>
<G>225</G>
<Name>goldgelb</Name>
<R>255</R>
</Color6>
<Color7>
<B>128</B>
<G>128</G>
<Name>grau</Name>
<R>128</R>
</Color7>
<Color8>
<B>0</B>
<G>255</G>
<Name>gr&uuml;n</Name>
<R>0</R>
</Color8>
<Color9>
<B>255</B>
<G>212</G>
<Name>hellblau</Name>
<R>191</R>
</Color9>
</Colors>
<ComplexIndices>
<IndexCount>0</IndexCount>
</ComplexIndices>
<DataSource>
<Import>
<DBName></DBName>
<Description></Description>
<Domains>false</Domains>
<Driver></Driver>
<Name></Name>
<Referenzen>false</Referenzen>
<User></User>
</Import>
</DataSource>
<DatabaseConnections>
<Count>1</Count>
<DatabaseConnection0>
<DBExecMode>MYSQL</DBExecMode>
<Driver>com.mysql.jdbc.Driver</Driver>
<Name>Productive database</Name>
<Quote></Quote>
<SetDomains>false</SetDomains>
<SetNotNull>false</SetNotNull>
<SetReferences>false</SetReferences>
<URL>jdbc:mysql://messene/platon</URL>
<UserName>platon</UserName>
</DatabaseConnection0>
</DatabaseConnections>
<DefaultComment>
<Anzahl>0</Anzahl>
</DefaultComment>
<Domains>
<Anzahl>14</Anzahl>
<Domain0>
<Datatype>4</Datatype>
<History></History>
<Initialwert>NULL</Initialwert>
<Kommentar>A boolean value in number format. 0 means false, any other value is true.</Kommentar>
<Length>0</Length>
<NKS>0</NKS>
<Name>Boolean</Name>
<Parameters></Parameters>
</Domain0>
<Domain1>
<Datatype>12</Datatype>
<History></History>
<Initialwert>NULL</Initialwert>
<Kommentar>This type is for descriptions in the meaning of names of data records.</Kommentar>
<Length>100</Length>
<NKS>0</NKS>
<Name>Description</Name>
<Parameters></Parameters>
</Domain1>
<Domain10>
<Datatype>12</Datatype>
<History></History>
<Initialwert>NULL</Initialwert>
<Kommentar></Kommentar>
<Length>21</Length>
<NKS>0</NKS>
<Name>Password</Name>
<Parameters></Parameters>
</Domain10>
<Domain11>
<Datatype>4</Datatype>
<History></History>
<Initialwert>NULL</Initialwert>
<Kommentar></Kommentar>
<Length>0</Length>
<NKS>0</NKS>
<Name>Portnumber</Name>
<Parameters></Parameters>
</Domain11>
<Domain12>
<Datatype>4</Datatype>
<History></History>
<Initialwert>NULL</Initialwert>
<Kommentar></Kommentar>
<Length>0</Length>
<NKS>0</NKS>
<Name>Sorting</Name>
<Parameters></Parameters>
</Domain12>
<Domain13>
<Datatype>12</Datatype>
<History></History>
<Initialwert>NULL</Initialwert>
<Kommentar>A token, that describes the record in a short form.</Kommentar>
<Length>20</Length>
<NKS>0</NKS>
<Name>Token</Name>
<Parameters></Parameters>
</Domain13>
<Domain2>
<Datatype>12</Datatype>
<History></History>
<Initialwert>NULL</Initialwert>
<Kommentar></Kommentar>
<Length>255</Length>
<NKS>0</NKS>
<Name>Filename</Name>
<Parameters></Parameters>
</Domain2>
<Domain3>
<Datatype>-5</Datatype>
<History></History>
<Initialwert>NULL</Initialwert>
<Kommentar>A GLI is a global local identificator. Fields of this type are used to store comprehensive ids (across more than one databases).</Kommentar>
<Length>0</Length>
<NKS>0</NKS>
<Name>GLI</Name>
<Parameters></Parameters>
</Domain3>
<Domain4>
<Datatype>-5</Datatype>
<History></History>
<Initialwert>NULL</Initialwert>
<Kommentar>This type should be used for key data fields.</Kommentar>
<Length>0</Length>
<NKS>0</NKS>
<Name>Ident</Name>
<Parameters></Parameters>
</Domain4>
<Domain5>
<Datatype>12</Datatype>
<History></History>
<Initialwert>NULL</Initialwert>
<Kommentar></Kommentar>
<Length>255</Length>
<NKS>0</NKS>
<Name>LongDescription</Name>
<Parameters></Parameters>
</Domain5>
<Domain6>
<Datatype>-5</Datatype>
<History></History>
<Initialwert>NULL</Initialwert>
<Kommentar>A type to store more precise manner, than the PTimestamp domain. LongPTimestamps include millis additionally. The format is: YYYYMMDDHHMMSSsss.</Kommentar>
<Length>0</Length>
<NKS>0</NKS>
<Name>LongPTimestamp</Name>
<Parameters></Parameters>
</Domain6>
<Domain7>
<Datatype>-1</Datatype>
<History></History>
<Initialwert>NULL</Initialwert>
<Kommentar></Kommentar>
<Length>0</Length>
<NKS>0</NKS>
<Name>Longtext</Name>
<Parameters></Parameters>
</Domain7>
<Domain8>
<Datatype>12</Datatype>
<History></History>
<Initialwert>NULL</Initialwert>
<Kommentar>This field contains the name of the Workstation, where the data record has been changed.</Kommentar>
<Length>40</Length>
<NKS>0</NKS>
<Name>PCName</Name>
<Parameters></Parameters>
</Domain8>
<Domain9>
<Datatype>2</Datatype>
<History></History>
<Initialwert>NULL</Initialwert>
<Kommentar>Data fields of this type contain time informations in the following format: YYYYMMDDHHMMSS.</Kommentar>
<Length>14</Length>
<NKS>0</NKS>
<Name>PTimestamp</Name>
<Parameters></Parameters>
</Domain9>
</Domains>
<Factories>
<Object>archimedes.legacy.scheme.DefaultObjectFactory</Object>
</Factories>
<Pages>
<PerColumn>5</PerColumn>
<PerRow>10</PerRow>
</Pages>
<Parameter>
<AdditionalSQLScriptListener></AdditionalSQLScriptListener>
<Applicationname>TestModel</Applicationname>
<AufgehobeneAusblenden>false</AufgehobeneAusblenden>
<Autor>ollie</Autor>
<Basepackagename>testmodel</Basepackagename>
<CodeFactoryClassName></CodeFactoryClassName>
<Codebasispfad>~/codetmp/</Codebasispfad>
<DBVersionDBVersionColumn></DBVersionDBVersionColumn>
<DBVersionDescriptionColumn></DBVersionDescriptionColumn>
<DBVersionTablename></DBVersionTablename>
<History></History>
<Kommentar>Ein kleines Archimedesmodell f&uuml;r den Unittest.</Kommentar>
<Name>TestModel 2</Name>
<Optionen>
<Anzahl>0</Anzahl>
</Optionen>
<PflichtfelderMarkieren>false</PflichtfelderMarkieren>
<ReferenzierteSpaltenAnzeigen>true</ReferenzierteSpaltenAnzeigen>
<RelationColorExternalTables>java.awt.Color[r=192,g=192,b=192]</RelationColorExternalTables>
<RelationColorRegular>java.awt.Color[r=0,g=0,b=0]</RelationColorRegular>
<SchemaName></SchemaName>
<Schriftgroessen>
<Tabelleninhalte>12</Tabelleninhalte>
<Ueberschriften>24</Ueberschriften>
<Untertitel>12</Untertitel>
</Schriftgroessen>
<Scripte>
<AfterWrite>&lt;null&gt;</AfterWrite>
</Scripte>
<TechnischeFelderAusgrauen>true</TechnischeFelderAusgrauen>
<TransienteFelderAusgrauen>false</TransienteFelderAusgrauen>
<UdschebtiBaseClassName></UdschebtiBaseClassName>
<Version>2</Version>
<Versionsdatum>09.12.2008</Versionsdatum>
<Versionskommentar>:o)</Versionskommentar>
</Parameter>
<Sequences>
<Count>0</Count>
</Sequences>
<Stereotype>
<Anzahl>4</Anzahl>
<Stereotype0>
<DoNotPrint>false</DoNotPrint>
<HideTable>false</HideTable>
<History></History>
<Kommentar>Diese Stereotype kennzeichnet eine Tabelle, deren Datens&auml;tze nicht gel&ouml;scht, sondern lediglich deaktiviert werden sollen.</Kommentar>
<Name>Deactivatable</Name>
</Stereotype0>
<Stereotype1>
<DoNotPrint>false</DoNotPrint>
<HideTable>false</HideTable>
<History></History>
<Kommentar>Diese Stereotype kennzeichnet eine Tabelle, deren Datens&auml;tze nicht gel&ouml;scht, sondern lediglich deaktiviert werden sollen.</Kommentar>
<Name>Deaktivierbar</Name>
</Stereotype1>
<Stereotype2>
<DoNotPrint>false</DoNotPrint>
<HideTable>false</HideTable>
<History></History>
<Kommentar>-/-</Kommentar>
<Name>System</Name>
</Stereotype2>
<Stereotype3>
<DoNotPrint>false</DoNotPrint>
<HideTable>false</HideTable>
<History></History>
<Kommentar>-/-</Kommentar>
<Name>Test</Name>
</Stereotype3>
</Stereotype>
<Tabellen>
<Anzahl>4</Anzahl>
<Tabelle0>
<Aufgehoben>false</Aufgehoben>
<Codegenerator>
<AuswahlMembers>
<Anzahl>2</Anzahl>
<Member0>
<Attribute>OPTIONAL</Attribute>
<Spalte>Description</Spalte>
<Tabelle>Table01</Tabelle>
</Member0>
<Member1>
<Attribute>OPTIONAL</Attribute>
<Spalte>Token</Spalte>
<Tabelle>Table01</Tabelle>
</Member1>
</AuswahlMembers>
<CompareMembers>
<Anzahl>1</Anzahl>
<Member0>
<Spalte>Description</Spalte>
</Member0>
</CompareMembers>
<Equalsmembers>
<Anzahl>4</Anzahl>
<Member0>
<Spalte>Table01</Spalte>
</Member0>
<Member1>
<Spalte>Description</Spalte>
</Member1>
<Member2>
<Spalte>Deleted</Spalte>
</Member2>
<Member3>
<Spalte>Token</Spalte>
</Member3>
</Equalsmembers>
<HashCodeMembers>
<Anzahl>1</Anzahl>
<Member0>
<Spalte>Table01</Spalte>
</Member0>
</HashCodeMembers>
<NReferenzen>
<Anzahl>0</Anzahl>
</NReferenzen>
<OrderMembers>
<Anzahl>1</Anzahl>
<Member0>
<Richtung>ASC</Richtung>
<Spalte>Description</Spalte>
<Tabelle>Table01</Tabelle>
</Member0>
</OrderMembers>
<ToComboStringMembers>
<Anzahl>2</Anzahl>
<Member0>
<Prefix></Prefix>
<Spalte>Description</Spalte>
<Suffix></Suffix>
</Member0>
<Member1>
<Prefix> (</Prefix>
<Spalte>Token</Spalte>
<Suffix>)</Suffix>
</Member1>
</ToComboStringMembers>
<ToStringMembers>
<Anzahl>2</Anzahl>
<Member0>
<Prefix></Prefix>
<Spalte>Description</Spalte>
<Suffix></Suffix>
</Member0>
<Member1>
<Prefix> (</Prefix>
<Spalte>Token</Spalte>
<Suffix>)</Suffix>
</Member1>
</ToStringMembers>
</Codegenerator>
<ExternalTable>false</ExternalTable>
<Farben>
<Hintergrund>null</Hintergrund>
<Schrift>schwarz</Schrift>
</Farben>
<FirstGenerationDone>false</FirstGenerationDone>
<History></History>
<InDevelopment>false</InDevelopment>
<Kommentar></Kommentar>
<NMRelation>false</NMRelation>
<Name>Table01</Name>
<Options>
<Count>0</Count>
</Options>
<Panels>
<Anzahl>1</Anzahl>
<Panel0>
<PanelClass></PanelClass>
<PanelNumber>0</PanelNumber>
<TabMnemonic>1</TabMnemonic>
<TabTitle>1.Daten</TabTitle>
<TabToolTipText>Hier können Sie die Daten des Objekt warten</TabToolTipText>
</Panel0>
</Panels>
<Spalten>
<Anzahl>5</Anzahl>
<Codegenerator>
<ActiveInApplication>false</ActiveInApplication>
<AdditionalCreateConstraints></AdditionalCreateConstraints>
<Codegeneratoroptionen></Codegeneratoroptionen>
<Codeverzeichnis>.</Codeverzeichnis>
<Codieren>true</Codieren>
<DynamicCode>true</DynamicCode>
<Inherited>false</Inherited>
<Kontextname></Kontextname>
<UniqueFormula>Description & Deleted | Token & Deleted</UniqueFormula>
</Codegenerator>
<Spalte0>
<AlterInBatch>false</AlterInBatch>
<Aufgehoben>false</Aufgehoben>
<CanBeReferenced>true</CanBeReferenced>
<Disabled>false</Disabled>
<Domain>Ident</Domain>
<Editordescriptor>
<Editormember>false</Editormember>
<LabelText></LabelText>
<MaxCharacters>0</MaxCharacters>
<Mnemonic></Mnemonic>
<Position>0</Position>
<ReferenceWeight>keine</ReferenceWeight>
<RessourceIdentifier></RessourceIdentifier>
<ToolTipText></ToolTipText>
</Editordescriptor>
<ForeignKey>false</ForeignKey>
<Global>false</Global>
<GlobalId>false</GlobalId>
<HideReference>false</HideReference>
<History></History>
<IndexSearchMember>false</IndexSearchMember>
<Indexed>false</Indexed>
<IndividualDefaultValue></IndividualDefaultValue>
<Kodiert>false</Kodiert>
<Kommentar></Kommentar>
<Konsistenz>
<Writeablemember>false</Writeablemember>
</Konsistenz>
<LastModificationField>false</LastModificationField>
<ListItemField>false</ListItemField>
<Name>Table01</Name>
<NotNull>true</NotNull>
<PanelNumber>0</PanelNumber>
<Parameter></Parameter>
<PrimaryKey>true</PrimaryKey>
<RemovedStateField>false</RemovedStateField>
<SequenceForKeyGeneration></SequenceForKeyGeneration>
<SuppressForeignKeyConstraints>false</SuppressForeignKeyConstraints>
<TechnicalField>false</TechnicalField>
<Transient>false</Transient>
<Unique>false</Unique>
</Spalte0>
<Spalte1>
<AlterInBatch>false</AlterInBatch>
<Aufgehoben>false</Aufgehoben>
<CanBeReferenced>false</CanBeReferenced>
<Disabled>false</Disabled>
<Domain>Ident</Domain>
<Editordescriptor>
<Editormember>false</Editormember>
<LabelText></LabelText>
<MaxCharacters>0</MaxCharacters>
<Mnemonic></Mnemonic>
<Position>0</Position>
<ReferenceWeight>keine</ReferenceWeight>
<RessourceIdentifier></RessourceIdentifier>
<ToolTipText></ToolTipText>
</Editordescriptor>
<ForeignKey>true</ForeignKey>
<Global>false</Global>
<GlobalId>false</GlobalId>
<HideReference>false</HideReference>
<History></History>
<IndexSearchMember>false</IndexSearchMember>
<Indexed>false</Indexed>
<IndividualDefaultValue></IndividualDefaultValue>
<Kodiert>false</Kodiert>
<Kommentar></Kommentar>
<Konsistenz>
<Writeablemember>false</Writeablemember>
</Konsistenz>
<LastModificationField>false</LastModificationField>
<ListItemField>false</ListItemField>
<Name>Table04</Name>
<NotNull>false</NotNull>
<PanelNumber>0</PanelNumber>
<Parameter></Parameter>
<PrimaryKey>false</PrimaryKey>
<Referenz>
<Direction0>DOWN</Direction0>
<Direction1>UP</Direction1>
<Offset0>25</Offset0>
<Offset1>25</Offset1>
<Spalte>Table04</Spalte>
<Tabelle>Table04</Tabelle>
<Views>
<Anzahl>1</Anzahl>
<View0>
<Direction0>DOWN</Direction0>
<Direction1>UP</Direction1>
<Name>Main</Name>
<Offset0>25</Offset0>
<Offset1>25</Offset1>
<Points>
<Anzahl>0</Anzahl>
</Points>
</View0>
</Views>
</Referenz>
<RemovedStateField>false</RemovedStateField>
<SequenceForKeyGeneration></SequenceForKeyGeneration>
<SuppressForeignKeyConstraints>false</SuppressForeignKeyConstraints>
<TechnicalField>false</TechnicalField>
<Transient>false</Transient>
<Unique>false</Unique>
</Spalte1>
<Spalte2>
<AlterInBatch>false</AlterInBatch>
<Aufgehoben>false</Aufgehoben>
<CanBeReferenced>false</CanBeReferenced>
<Disabled>false</Disabled>
<Domain>Boolean</Domain>
<Editordescriptor>
<Editormember>false</Editormember>
<LabelText></LabelText>
<MaxCharacters>0</MaxCharacters>
<Mnemonic></Mnemonic>
<Position>0</Position>
<ReferenceWeight>keine</ReferenceWeight>
<RessourceIdentifier></RessourceIdentifier>
<ToolTipText></ToolTipText>
</Editordescriptor>
<ForeignKey>false</ForeignKey>
<Global>false</Global>
<GlobalId>false</GlobalId>
<HideReference>false</HideReference>
<History></History>
<IndexSearchMember>false</IndexSearchMember>
<Indexed>false</Indexed>
<IndividualDefaultValue></IndividualDefaultValue>
<Kodiert>false</Kodiert>
<Kommentar></Kommentar>
<Konsistenz>
<Writeablemember>false</Writeablemember>
</Konsistenz>
<LastModificationField>false</LastModificationField>
<ListItemField>false</ListItemField>
<Name>Deleted</Name>
<NotNull>false</NotNull>
<PanelNumber>0</PanelNumber>
<Parameter></Parameter>
<PrimaryKey>false</PrimaryKey>
<RemovedStateField>false</RemovedStateField>
<SequenceForKeyGeneration></SequenceForKeyGeneration>
<SuppressForeignKeyConstraints>false</SuppressForeignKeyConstraints>
<TechnicalField>false</TechnicalField>
<Transient>false</Transient>
<Unique>false</Unique>
</Spalte2>
<Spalte3>
<AlterInBatch>false</AlterInBatch>
<Aufgehoben>false</Aufgehoben>
<CanBeReferenced>false</CanBeReferenced>
<Disabled>false</Disabled>
<Domain>Description</Domain>
<Editordescriptor>
<Editormember>true</Editormember>
<LabelText>Bezeichnung</LabelText>
<MaxCharacters>0</MaxCharacters>
<Mnemonic>B</Mnemonic>
<Position>1</Position>
<ReferenceWeight>keine</ReferenceWeight>
<RessourceIdentifier>TextFieldDescription</RessourceIdentifier>
<ToolTipText>Geben Sie hier eine eindeutige,aussagekr&auml;ftige Bezeichnung ein.</ToolTipText>
</Editordescriptor>
<ForeignKey>false</ForeignKey>
<Global>false</Global>
<GlobalId>false</GlobalId>
<HideReference>false</HideReference>
<History></History>
<IndexSearchMember>false</IndexSearchMember>
<Indexed>false</Indexed>
<IndividualDefaultValue></IndividualDefaultValue>
<Kodiert>false</Kodiert>
<Kommentar></Kommentar>
<Konsistenz>
<Writeablemember>true</Writeablemember>
</Konsistenz>
<LastModificationField>false</LastModificationField>
<ListItemField>false</ListItemField>
<Name>Description</Name>
<NotNull>false</NotNull>
<PanelNumber>0</PanelNumber>
<Parameter></Parameter>
<PrimaryKey>false</PrimaryKey>
<RemovedStateField>false</RemovedStateField>
<SequenceForKeyGeneration></SequenceForKeyGeneration>
<SuppressForeignKeyConstraints>false</SuppressForeignKeyConstraints>
<TechnicalField>false</TechnicalField>
<Transient>false</Transient>
<Unique>false</Unique>
</Spalte3>
<Spalte4>
<AlterInBatch>false</AlterInBatch>
<Aufgehoben>false</Aufgehoben>
<CanBeReferenced>false</CanBeReferenced>
<Disabled>false</Disabled>
<Domain>Token</Domain>
<Editordescriptor>
<Editormember>false</Editormember>
<LabelText>K&uuml;rzel</LabelText>
<MaxCharacters>0</MaxCharacters>
<Mnemonic>K</Mnemonic>
<Position>2</Position>
<ReferenceWeight>keine</ReferenceWeight>
<RessourceIdentifier>TextFieldToken</RessourceIdentifier>
<ToolTipText>Geben Sie hier ein eindeutiges, aussagekr&auml;ftiges K&uuml;rzel ein.</ToolTipText>
</Editordescriptor>
<ForeignKey>false</ForeignKey>
<Global>false</Global>
<GlobalId>false</GlobalId>
<HideReference>false</HideReference>
<History></History>
<IndexSearchMember>false</IndexSearchMember>
<Indexed>false</Indexed>
<IndividualDefaultValue></IndividualDefaultValue>
<Kodiert>false</Kodiert>
<Kommentar></Kommentar>
<Konsistenz>
<Writeablemember>true</Writeablemember>
</Konsistenz>
<LastModificationField>false</LastModificationField>
<ListItemField>false</ListItemField>
<Name>Token</Name>
<NotNull>false</NotNull>
<PanelNumber>0</PanelNumber>
<Parameter></Parameter>
<PrimaryKey>false</PrimaryKey>
<RemovedStateField>false</RemovedStateField>
<SequenceForKeyGeneration></SequenceForKeyGeneration>
<SuppressForeignKeyConstraints>false</SuppressForeignKeyConstraints>
<TechnicalField>false</TechnicalField>
<Transient>false</Transient>
<Unique>false</Unique>
</Spalte4>
</Spalten>
<Stereotype>
<Anzahl>0</Anzahl>
</Stereotype>
<Views>
<Anzahl>1</Anzahl>
<View0>
<Name>Main</Name>
<X>50</X>
<Y>200</Y>
</View0>
</Views>
</Tabelle0>
<Tabelle1>
<Aufgehoben>false</Aufgehoben>
<Codegenerator>
<AuswahlMembers>
<Anzahl>0</Anzahl>
</AuswahlMembers>
<CompareMembers>
<Anzahl>0</Anzahl>
</CompareMembers>
<Equalsmembers>
<Anzahl>2</Anzahl>
<Member0>
<Spalte>Table01</Spalte>
</Member0>
<Member1>
<Spalte>Deleted</Spalte>
</Member1>
</Equalsmembers>
<HashCodeMembers>
<Anzahl>1</Anzahl>
<Member0>
<Spalte>Table01</Spalte>
</Member0>
</HashCodeMembers>
<NReferenzen>
<Anzahl>0</Anzahl>
</NReferenzen>
<OrderMembers>
<Anzahl>0</Anzahl>
</OrderMembers>
<ToComboStringMembers>
<Anzahl>0</Anzahl>
</ToComboStringMembers>
<ToStringMembers>
<Anzahl>0</Anzahl>
</ToStringMembers>
</Codegenerator>
<ExternalTable>false</ExternalTable>
<Farben>
<Hintergrund>null</Hintergrund>
<Schrift>schwarz</Schrift>
</Farben>
<FirstGenerationDone>false</FirstGenerationDone>
<History></History>
<InDevelopment>false</InDevelopment>
<Kommentar></Kommentar>
<NMRelation>true</NMRelation>
<Name>Table02</Name>
<Options>
<Count>0</Count>
</Options>
<Panels>
<Anzahl>1</Anzahl>
<Panel0>
<PanelClass></PanelClass>
<PanelNumber>0</PanelNumber>
<TabMnemonic>1</TabMnemonic>
<TabTitle>1.Daten</TabTitle>
<TabToolTipText>Hier können Sie die Daten des Objekt warten</TabToolTipText>
</Panel0>
</Panels>
<Spalten>
<Anzahl>3</Anzahl>
<Codegenerator>
<ActiveInApplication>false</ActiveInApplication>
<AdditionalCreateConstraints></AdditionalCreateConstraints>
<Codegeneratoroptionen></Codegeneratoroptionen>
<Codeverzeichnis>.</Codeverzeichnis>
<Codieren>true</Codieren>
<DynamicCode>true</DynamicCode>
<Inherited>false</Inherited>
<Kontextname></Kontextname>
<UniqueFormula>Description & Deleted | Token & Deleted</UniqueFormula>
</Codegenerator>
<Spalte0>
<AlterInBatch>false</AlterInBatch>
<Aufgehoben>false</Aufgehoben>
<CanBeReferenced>true</CanBeReferenced>
<Disabled>false</Disabled>
<Domain>Ident</Domain>
<Editordescriptor>
<Editormember>false</Editormember>
<LabelText></LabelText>
<MaxCharacters>0</MaxCharacters>
<Mnemonic></Mnemonic>
<Position>0</Position>
<ReferenceWeight>keine</ReferenceWeight>
<RessourceIdentifier></RessourceIdentifier>
<ToolTipText></ToolTipText>
</Editordescriptor>
<ForeignKey>true</ForeignKey>
<Global>false</Global>
<GlobalId>false</GlobalId>
<HideReference>false</HideReference>
<History></History>
<IndexSearchMember>false</IndexSearchMember>
<Indexed>false</Indexed>
<IndividualDefaultValue></IndividualDefaultValue>
<Kodiert>false</Kodiert>
<Kommentar></Kommentar>
<Konsistenz>
<Writeablemember>false</Writeablemember>
</Konsistenz>
<LastModificationField>false</LastModificationField>
<ListItemField>false</ListItemField>
<Name>Table01</Name>
<NotNull>true</NotNull>
<PanelNumber>0</PanelNumber>
<Parameter></Parameter>
<PrimaryKey>true</PrimaryKey>
<Referenz>
<Direction0>LEFT</Direction0>
<Direction1>RIGHT</Direction1>
<Offset0>25</Offset0>
<Offset1>25</Offset1>
<Spalte>Table01</Spalte>
<Tabelle>Table01</Tabelle>
<Views>
<Anzahl>1</Anzahl>
<View0>
<Direction0>LEFT</Direction0>
<Direction1>RIGHT</Direction1>
<Name>Main</Name>
<Offset0>25</Offset0>
<Offset1>25</Offset1>
<Points>
<Anzahl>0</Anzahl>
</Points>
</View0>
</Views>
</Referenz>
<RemovedStateField>false</RemovedStateField>
<SequenceForKeyGeneration></SequenceForKeyGeneration>
<SuppressForeignKeyConstraints>false</SuppressForeignKeyConstraints>
<TechnicalField>false</TechnicalField>
<Transient>false</Transient>
<Unique>false</Unique>
</Spalte0>
<Spalte1>
<AlterInBatch>false</AlterInBatch>
<Aufgehoben>false</Aufgehoben>
<CanBeReferenced>true</CanBeReferenced>
<Disabled>false</Disabled>
<Domain>Ident</Domain>
<Editordescriptor>
<Editormember>false</Editormember>
<LabelText></LabelText>
<MaxCharacters>0</MaxCharacters>
<Mnemonic></Mnemonic>
<Position>0</Position>
<ReferenceWeight>keine</ReferenceWeight>
<RessourceIdentifier></RessourceIdentifier>
<ToolTipText></ToolTipText>
</Editordescriptor>
<ForeignKey>true</ForeignKey>
<Global>false</Global>
<GlobalId>false</GlobalId>
<HideReference>false</HideReference>
<History></History>
<IndexSearchMember>false</IndexSearchMember>
<Indexed>false</Indexed>
<IndividualDefaultValue></IndividualDefaultValue>
<Kodiert>false</Kodiert>
<Kommentar></Kommentar>
<Konsistenz>
<Writeablemember>false</Writeablemember>
</Konsistenz>
<LastModificationField>false</LastModificationField>
<ListItemField>false</ListItemField>
<Name>Table03</Name>
<NotNull>true</NotNull>
<PanelNumber>0</PanelNumber>
<Parameter></Parameter>
<PrimaryKey>true</PrimaryKey>
<Referenz>
<Direction0>RIGHT</Direction0>
<Direction1>LEFT</Direction1>
<Offset0>25</Offset0>
<Offset1>25</Offset1>
<Spalte>Table03</Spalte>
<Tabelle>Table03</Tabelle>
<Views>
<Anzahl>1</Anzahl>
<View0>
<Direction0>RIGHT</Direction0>
<Direction1>LEFT</Direction1>
<Name>Main</Name>
<Offset0>25</Offset0>
<Offset1>25</Offset1>
<Points>
<Anzahl>0</Anzahl>
</Points>
</View0>
</Views>
</Referenz>
<RemovedStateField>false</RemovedStateField>
<SequenceForKeyGeneration></SequenceForKeyGeneration>
<SuppressForeignKeyConstraints>false</SuppressForeignKeyConstraints>
<TechnicalField>false</TechnicalField>
<Transient>false</Transient>
<Unique>false</Unique>
</Spalte1>
<Spalte2>
<AlterInBatch>false</AlterInBatch>
<Aufgehoben>false</Aufgehoben>
<CanBeReferenced>false</CanBeReferenced>
<Disabled>false</Disabled>
<Domain>Boolean</Domain>
<Editordescriptor>
<Editormember>false</Editormember>
<LabelText></LabelText>
<MaxCharacters>0</MaxCharacters>
<Mnemonic></Mnemonic>
<Position>0</Position>
<ReferenceWeight>keine</ReferenceWeight>
<RessourceIdentifier></RessourceIdentifier>
<ToolTipText></ToolTipText>
</Editordescriptor>
<ForeignKey>false</ForeignKey>
<Global>false</Global>
<GlobalId>false</GlobalId>
<HideReference>false</HideReference>
<History></History>
<IndexSearchMember>false</IndexSearchMember>
<Indexed>false</Indexed>
<IndividualDefaultValue></IndividualDefaultValue>
<Kodiert>false</Kodiert>
<Kommentar></Kommentar>
<Konsistenz>
<Writeablemember>false</Writeablemember>
</Konsistenz>
<LastModificationField>false</LastModificationField>
<ListItemField>false</ListItemField>
<Name>Deleted</Name>
<NotNull>false</NotNull>
<PanelNumber>0</PanelNumber>
<Parameter></Parameter>
<PrimaryKey>false</PrimaryKey>
<RemovedStateField>false</RemovedStateField>
<SequenceForKeyGeneration></SequenceForKeyGeneration>
<SuppressForeignKeyConstraints>false</SuppressForeignKeyConstraints>
<TechnicalField>false</TechnicalField>
<Transient>false</Transient>
<Unique>false</Unique>
</Spalte2>
</Spalten>
<Stereotype>
<Anzahl>0</Anzahl>
</Stereotype>
<Views>
<Anzahl>1</Anzahl>
<View0>
<Name>Main</Name>
<X>375</X>
<Y>200</Y>
</View0>
</Views>
</Tabelle1>
<Tabelle2>
<Aufgehoben>false</Aufgehoben>
<Codegenerator>
<AuswahlMembers>
<Anzahl>2</Anzahl>
<Member0>
<Attribute>OPTIONAL</Attribute>
<Spalte>Description</Spalte>
<Tabelle>Table03</Tabelle>
</Member0>
<Member1>
<Attribute>OPTIONAL</Attribute>
<Spalte>Token</Spalte>
<Tabelle>Table03</Tabelle>
</Member1>
</AuswahlMembers>
<CompareMembers>
<Anzahl>1</Anzahl>
<Member0>
<Spalte>Description</Spalte>
</Member0>
</CompareMembers>
<Equalsmembers>
<Anzahl>4</Anzahl>
<Member0>
<Spalte>Table03</Spalte>
</Member0>
<Member1>
<Spalte>Deleted</Spalte>
</Member1>
<Member2>
<Spalte>Description</Spalte>
</Member2>
<Member3>
<Spalte>Token</Spalte>
</Member3>
</Equalsmembers>
<HashCodeMembers>
<Anzahl>1</Anzahl>
<Member0>
<Spalte>Table03</Spalte>
</Member0>
</HashCodeMembers>
<NReferenzen>
<Anzahl>0</Anzahl>
</NReferenzen>
<OrderMembers>
<Anzahl>1</Anzahl>
<Member0>
<Richtung>ASC</Richtung>
<Spalte>Description</Spalte>
<Tabelle>Table03</Tabelle>
</Member0>
</OrderMembers>
<ToComboStringMembers>
<Anzahl>2</Anzahl>
<Member0>
<Prefix></Prefix>
<Spalte>Description</Spalte>
<Suffix></Suffix>
</Member0>
<Member1>
<Prefix> (</Prefix>
<Spalte>Token</Spalte>
<Suffix>)</Suffix>
</Member1>
</ToComboStringMembers>
<ToStringMembers>
<Anzahl>2</Anzahl>
<Member0>
<Prefix></Prefix>
<Spalte>Description</Spalte>
<Suffix></Suffix>
</Member0>
<Member1>
<Prefix> (</Prefix>
<Spalte>Token</Spalte>
<Suffix>)</Suffix>
</Member1>
</ToStringMembers>
</Codegenerator>
<ExternalTable>false</ExternalTable>
<Farben>
<Hintergrund>null</Hintergrund>
<Schrift>schwarz</Schrift>
</Farben>
<FirstGenerationDone>false</FirstGenerationDone>
<History></History>
<InDevelopment>false</InDevelopment>
<Kommentar></Kommentar>
<NMRelation>false</NMRelation>
<Name>Table03</Name>
<Options>
<Count>0</Count>
</Options>
<Panels>
<Anzahl>1</Anzahl>
<Panel0>
<PanelClass></PanelClass>
<PanelNumber>0</PanelNumber>
<TabMnemonic>1</TabMnemonic>
<TabTitle>1.Daten</TabTitle>
<TabToolTipText>Hier können Sie die Daten des Objekt warten</TabToolTipText>
</Panel0>
</Panels>
<Spalten>
<Anzahl>4</Anzahl>
<Codegenerator>
<ActiveInApplication>false</ActiveInApplication>
<AdditionalCreateConstraints></AdditionalCreateConstraints>
<Codegeneratoroptionen></Codegeneratoroptionen>
<Codeverzeichnis>.</Codeverzeichnis>
<Codieren>true</Codieren>
<DynamicCode>true</DynamicCode>
<Inherited>false</Inherited>
<Kontextname></Kontextname>
<UniqueFormula>Description & Deleted | Token & Deleted</UniqueFormula>
</Codegenerator>
<Spalte0>
<AlterInBatch>false</AlterInBatch>
<Aufgehoben>false</Aufgehoben>
<CanBeReferenced>true</CanBeReferenced>
<Disabled>false</Disabled>
<Domain>Ident</Domain>
<Editordescriptor>
<Editormember>false</Editormember>
<LabelText></LabelText>
<MaxCharacters>0</MaxCharacters>
<Mnemonic></Mnemonic>
<Position>0</Position>
<ReferenceWeight>keine</ReferenceWeight>
<RessourceIdentifier></RessourceIdentifier>
<ToolTipText></ToolTipText>
</Editordescriptor>
<ForeignKey>false</ForeignKey>
<Global>false</Global>
<GlobalId>false</GlobalId>
<HideReference>false</HideReference>
<History></History>
<IndexSearchMember>false</IndexSearchMember>
<Indexed>false</Indexed>
<IndividualDefaultValue></IndividualDefaultValue>
<Kodiert>false</Kodiert>
<Kommentar></Kommentar>
<Konsistenz>
<Writeablemember>false</Writeablemember>
</Konsistenz>
<LastModificationField>false</LastModificationField>
<ListItemField>false</ListItemField>
<Name>Table03</Name>
<NotNull>true</NotNull>
<PanelNumber>0</PanelNumber>
<Parameter></Parameter>
<PrimaryKey>true</PrimaryKey>
<RemovedStateField>false</RemovedStateField>
<SequenceForKeyGeneration></SequenceForKeyGeneration>
<SuppressForeignKeyConstraints>false</SuppressForeignKeyConstraints>
<TechnicalField>false</TechnicalField>
<Transient>false</Transient>
<Unique>false</Unique>
</Spalte0>
<Spalte1>
<AlterInBatch>false</AlterInBatch>
<Aufgehoben>false</Aufgehoben>
<CanBeReferenced>false</CanBeReferenced>
<Disabled>false</Disabled>
<Domain>Boolean</Domain>
<Editordescriptor>
<Editormember>false</Editormember>
<LabelText></LabelText>
<MaxCharacters>0</MaxCharacters>
<Mnemonic></Mnemonic>
<Position>0</Position>
<ReferenceWeight>keine</ReferenceWeight>
<RessourceIdentifier></RessourceIdentifier>
<ToolTipText></ToolTipText>
</Editordescriptor>
<ForeignKey>false</ForeignKey>
<Global>false</Global>
<GlobalId>false</GlobalId>
<HideReference>false</HideReference>
<History></History>
<IndexSearchMember>false</IndexSearchMember>
<Indexed>false</Indexed>
<IndividualDefaultValue></IndividualDefaultValue>
<Kodiert>false</Kodiert>
<Kommentar></Kommentar>
<Konsistenz>
<Writeablemember>false</Writeablemember>
</Konsistenz>
<LastModificationField>false</LastModificationField>
<ListItemField>false</ListItemField>
<Name>Deleted</Name>
<NotNull>false</NotNull>
<PanelNumber>0</PanelNumber>
<Parameter></Parameter>
<PrimaryKey>false</PrimaryKey>
<RemovedStateField>false</RemovedStateField>
<SequenceForKeyGeneration></SequenceForKeyGeneration>
<SuppressForeignKeyConstraints>false</SuppressForeignKeyConstraints>
<TechnicalField>false</TechnicalField>
<Transient>false</Transient>
<Unique>false</Unique>
</Spalte1>
<Spalte2>
<AlterInBatch>false</AlterInBatch>
<Aufgehoben>false</Aufgehoben>
<CanBeReferenced>false</CanBeReferenced>
<Disabled>false</Disabled>
<Domain>Description</Domain>
<Editordescriptor>
<Editormember>true</Editormember>
<LabelText>Bezeichnung</LabelText>
<MaxCharacters>0</MaxCharacters>
<Mnemonic>B</Mnemonic>
<Position>1</Position>
<ReferenceWeight>keine</ReferenceWeight>
<RessourceIdentifier>TextFieldDescription</RessourceIdentifier>
<ToolTipText>Geben Sie hier eine eindeutige,aussagekr&auml;ftige Bezeichnung ein.</ToolTipText>
</Editordescriptor>
<ForeignKey>false</ForeignKey>
<Global>false</Global>
<GlobalId>false</GlobalId>
<HideReference>false</HideReference>
<History></History>
<IndexSearchMember>false</IndexSearchMember>
<Indexed>false</Indexed>
<IndividualDefaultValue></IndividualDefaultValue>
<Kodiert>false</Kodiert>
<Kommentar></Kommentar>
<Konsistenz>
<Writeablemember>true</Writeablemember>
</Konsistenz>
<LastModificationField>false</LastModificationField>
<ListItemField>false</ListItemField>
<Name>Description</Name>
<NotNull>false</NotNull>
<PanelNumber>0</PanelNumber>
<Parameter></Parameter>
<PrimaryKey>false</PrimaryKey>
<RemovedStateField>false</RemovedStateField>
<SequenceForKeyGeneration></SequenceForKeyGeneration>
<SuppressForeignKeyConstraints>false</SuppressForeignKeyConstraints>
<TechnicalField>false</TechnicalField>
<Transient>false</Transient>
<Unique>false</Unique>
</Spalte2>
<Spalte3>
<AlterInBatch>false</AlterInBatch>
<Aufgehoben>false</Aufgehoben>
<CanBeReferenced>false</CanBeReferenced>
<Disabled>false</Disabled>
<Domain>Token</Domain>
<Editordescriptor>
<Editormember>false</Editormember>
<LabelText>K&uuml;rzel</LabelText>
<MaxCharacters>0</MaxCharacters>
<Mnemonic>K</Mnemonic>
<Position>2</Position>
<ReferenceWeight>keine</ReferenceWeight>
<RessourceIdentifier>TextFieldToken</RessourceIdentifier>
<ToolTipText>Geben Sie hier ein eindeutiges, aussagekr&auml;ftiges K&uuml;rzel ein.</ToolTipText>
</Editordescriptor>
<ForeignKey>false</ForeignKey>
<Global>false</Global>
<GlobalId>false</GlobalId>
<HideReference>false</HideReference>
<History></History>
<IndexSearchMember>false</IndexSearchMember>
<Indexed>false</Indexed>
<IndividualDefaultValue></IndividualDefaultValue>
<Kodiert>false</Kodiert>
<Kommentar></Kommentar>
<Konsistenz>
<Writeablemember>true</Writeablemember>
</Konsistenz>
<LastModificationField>false</LastModificationField>
<ListItemField>false</ListItemField>
<Name>Token</Name>
<NotNull>false</NotNull>
<PanelNumber>0</PanelNumber>
<Parameter></Parameter>
<PrimaryKey>false</PrimaryKey>
<RemovedStateField>false</RemovedStateField>
<SequenceForKeyGeneration></SequenceForKeyGeneration>
<SuppressForeignKeyConstraints>false</SuppressForeignKeyConstraints>
<TechnicalField>false</TechnicalField>
<Transient>false</Transient>
<Unique>false</Unique>
</Spalte3>
</Spalten>
<Stereotype>
<Anzahl>0</Anzahl>
</Stereotype>
<Views>
<Anzahl>1</Anzahl>
<View0>
<Name>Main</Name>
<X>650</X>
<Y>200</Y>
</View0>
</Views>
</Tabelle2>
<Tabelle3>
<Aufgehoben>false</Aufgehoben>
<Codegenerator>
<AuswahlMembers>
<Anzahl>2</Anzahl>
<Member0>
<Attribute>OPTIONAL</Attribute>
<Spalte>Description</Spalte>
<Tabelle>Table04</Tabelle>
</Member0>
<Member1>
<Attribute>OPTIONAL</Attribute>
<Spalte>Token</Spalte>
<Tabelle>Table04</Tabelle>
</Member1>
</AuswahlMembers>
<CompareMembers>
<Anzahl>1</Anzahl>
<Member0>
<Spalte>Description</Spalte>
</Member0>
</CompareMembers>
<Equalsmembers>
<Anzahl>4</Anzahl>
<Member0>
<Spalte>Table04</Spalte>
</Member0>
<Member1>
<Spalte>Description</Spalte>
</Member1>
<Member2>
<Spalte>Deleted</Spalte>
</Member2>
<Member3>
<Spalte>Token</Spalte>
</Member3>
</Equalsmembers>
<HashCodeMembers>
<Anzahl>1</Anzahl>
<Member0>
<Spalte>Table04</Spalte>
</Member0>
</HashCodeMembers>
<NReferenzen>
<Anzahl>0</Anzahl>
</NReferenzen>
<OrderMembers>
<Anzahl>1</Anzahl>
<Member0>
<Richtung>ASC</Richtung>
<Spalte>Description</Spalte>
<Tabelle>Table04</Tabelle>
</Member0>
</OrderMembers>
<ToComboStringMembers>
<Anzahl>2</Anzahl>
<Member0>
<Prefix></Prefix>
<Spalte>Description</Spalte>
<Suffix></Suffix>
</Member0>
<Member1>
<Prefix> (</Prefix>
<Spalte>Token</Spalte>
<Suffix>)</Suffix>
</Member1>
</ToComboStringMembers>
<ToStringMembers>
<Anzahl>2</Anzahl>
<Member0>
<Prefix></Prefix>
<Spalte>Description</Spalte>
<Suffix></Suffix>
</Member0>
<Member1>
<Prefix> (</Prefix>
<Spalte>Token</Spalte>
<Suffix>)</Suffix>
</Member1>
</ToStringMembers>
</Codegenerator>
<ExternalTable>false</ExternalTable>
<Farben>
<Hintergrund>null</Hintergrund>
<Schrift>schwarz</Schrift>
</Farben>
<FirstGenerationDone>false</FirstGenerationDone>
<History></History>
<InDevelopment>false</InDevelopment>
<Kommentar></Kommentar>
<NMRelation>false</NMRelation>
<Name>Table04</Name>
<Options>
<Count>0</Count>
</Options>
<Panels>
<Anzahl>1</Anzahl>
<Panel0>
<PanelClass></PanelClass>
<PanelNumber>0</PanelNumber>
<TabMnemonic>1</TabMnemonic>
<TabTitle>1.Daten</TabTitle>
<TabToolTipText>Hier können Sie die Daten des Objekt warten</TabToolTipText>
</Panel0>
</Panels>
<Spalten>
<Anzahl>4</Anzahl>
<Codegenerator>
<ActiveInApplication>false</ActiveInApplication>
<AdditionalCreateConstraints></AdditionalCreateConstraints>
<Codegeneratoroptionen></Codegeneratoroptionen>
<Codeverzeichnis>.</Codeverzeichnis>
<Codieren>true</Codieren>
<DynamicCode>true</DynamicCode>
<Inherited>false</Inherited>
<Kontextname></Kontextname>
<UniqueFormula>Description & Deleted | Token & Deleted</UniqueFormula>
</Codegenerator>
<Spalte0>
<AlterInBatch>false</AlterInBatch>
<Aufgehoben>false</Aufgehoben>
<CanBeReferenced>true</CanBeReferenced>
<Disabled>false</Disabled>
<Domain>Ident</Domain>
<Editordescriptor>
<Editormember>false</Editormember>
<LabelText></LabelText>
<MaxCharacters>0</MaxCharacters>
<Mnemonic></Mnemonic>
<Position>0</Position>
<ReferenceWeight>keine</ReferenceWeight>
<RessourceIdentifier></RessourceIdentifier>
<ToolTipText></ToolTipText>
</Editordescriptor>
<ForeignKey>false</ForeignKey>
<Global>false</Global>
<GlobalId>false</GlobalId>
<HideReference>false</HideReference>
<History></History>
<IndexSearchMember>false</IndexSearchMember>
<Indexed>false</Indexed>
<IndividualDefaultValue></IndividualDefaultValue>
<Kodiert>false</Kodiert>
<Kommentar></Kommentar>
<Konsistenz>
<Writeablemember>false</Writeablemember>
</Konsistenz>
<LastModificationField>false</LastModificationField>
<ListItemField>false</ListItemField>
<Name>Table04</Name>
<NotNull>true</NotNull>
<PanelNumber>0</PanelNumber>
<Parameter></Parameter>
<PrimaryKey>true</PrimaryKey>
<RemovedStateField>false</RemovedStateField>
<SequenceForKeyGeneration></SequenceForKeyGeneration>
<SuppressForeignKeyConstraints>false</SuppressForeignKeyConstraints>
<TechnicalField>false</TechnicalField>
<Transient>false</Transient>
<Unique>false</Unique>
</Spalte0>
<Spalte1>
<AlterInBatch>false</AlterInBatch>
<Aufgehoben>false</Aufgehoben>
<CanBeReferenced>false</CanBeReferenced>
<Disabled>false</Disabled>
<Domain>Boolean</Domain>
<Editordescriptor>
<Editormember>false</Editormember>
<LabelText></LabelText>
<MaxCharacters>0</MaxCharacters>
<Mnemonic></Mnemonic>
<Position>0</Position>
<ReferenceWeight>keine</ReferenceWeight>
<RessourceIdentifier></RessourceIdentifier>
<ToolTipText></ToolTipText>
</Editordescriptor>
<ForeignKey>false</ForeignKey>
<Global>false</Global>
<GlobalId>false</GlobalId>
<HideReference>false</HideReference>
<History></History>
<IndexSearchMember>false</IndexSearchMember>
<Indexed>false</Indexed>
<IndividualDefaultValue></IndividualDefaultValue>
<Kodiert>false</Kodiert>
<Kommentar></Kommentar>
<Konsistenz>
<Writeablemember>false</Writeablemember>
</Konsistenz>
<LastModificationField>false</LastModificationField>
<ListItemField>false</ListItemField>
<Name>Deleted</Name>
<NotNull>false</NotNull>
<PanelNumber>0</PanelNumber>
<Parameter></Parameter>
<PrimaryKey>false</PrimaryKey>
<RemovedStateField>false</RemovedStateField>
<SequenceForKeyGeneration></SequenceForKeyGeneration>
<SuppressForeignKeyConstraints>false</SuppressForeignKeyConstraints>
<TechnicalField>false</TechnicalField>
<Transient>false</Transient>
<Unique>false</Unique>
</Spalte1>
<Spalte2>
<AlterInBatch>false</AlterInBatch>
<Aufgehoben>false</Aufgehoben>
<CanBeReferenced>false</CanBeReferenced>
<Disabled>false</Disabled>
<Domain>Description</Domain>
<Editordescriptor>
<Editormember>true</Editormember>
<LabelText>Bezeichnung</LabelText>
<MaxCharacters>0</MaxCharacters>
<Mnemonic>B</Mnemonic>
<Position>1</Position>
<ReferenceWeight>keine</ReferenceWeight>
<RessourceIdentifier>TextFieldDescription</RessourceIdentifier>
<ToolTipText>Geben Sie hier eine eindeutige,aussagekr&auml;ftige Bezeichnung ein.</ToolTipText>
</Editordescriptor>
<ForeignKey>false</ForeignKey>
<Global>false</Global>
<GlobalId>false</GlobalId>
<HideReference>false</HideReference>
<History></History>
<IndexSearchMember>false</IndexSearchMember>
<Indexed>false</Indexed>
<IndividualDefaultValue></IndividualDefaultValue>
<Kodiert>false</Kodiert>
<Kommentar></Kommentar>
<Konsistenz>
<Writeablemember>true</Writeablemember>
</Konsistenz>
<LastModificationField>false</LastModificationField>
<ListItemField>false</ListItemField>
<Name>Description</Name>
<NotNull>false</NotNull>
<PanelNumber>0</PanelNumber>
<Parameter></Parameter>
<PrimaryKey>false</PrimaryKey>
<RemovedStateField>false</RemovedStateField>
<SequenceForKeyGeneration></SequenceForKeyGeneration>
<SuppressForeignKeyConstraints>false</SuppressForeignKeyConstraints>
<TechnicalField>false</TechnicalField>
<Transient>false</Transient>
<Unique>false</Unique>
</Spalte2>
<Spalte3>
<AlterInBatch>false</AlterInBatch>
<Aufgehoben>false</Aufgehoben>
<CanBeReferenced>false</CanBeReferenced>
<Disabled>false</Disabled>
<Domain>Token</Domain>
<Editordescriptor>
<Editormember>false</Editormember>
<LabelText>K&uuml;rzel</LabelText>
<MaxCharacters>0</MaxCharacters>
<Mnemonic>K</Mnemonic>
<Position>2</Position>
<ReferenceWeight>keine</ReferenceWeight>
<RessourceIdentifier>TextFieldToken</RessourceIdentifier>
<ToolTipText>Geben Sie hier ein eindeutiges, aussagekr&auml;ftiges K&uuml;rzel ein.</ToolTipText>
</Editordescriptor>
<ForeignKey>false</ForeignKey>
<Global>false</Global>
<GlobalId>false</GlobalId>
<HideReference>false</HideReference>
<History></History>
<IndexSearchMember>false</IndexSearchMember>
<Indexed>false</Indexed>
<IndividualDefaultValue></IndividualDefaultValue>
<Kodiert>false</Kodiert>
<Kommentar></Kommentar>
<Konsistenz>
<Writeablemember>true</Writeablemember>
</Konsistenz>
<LastModificationField>false</LastModificationField>
<ListItemField>false</ListItemField>
<Name>Token</Name>
<NotNull>false</NotNull>
<PanelNumber>0</PanelNumber>
<Parameter></Parameter>
<PrimaryKey>false</PrimaryKey>
<RemovedStateField>false</RemovedStateField>
<SequenceForKeyGeneration></SequenceForKeyGeneration>
<SuppressForeignKeyConstraints>false</SuppressForeignKeyConstraints>
<TechnicalField>false</TechnicalField>
<Transient>false</Transient>
<Unique>false</Unique>
</Spalte3>
</Spalten>
<Stereotype>
<Anzahl>0</Anzahl>
</Stereotype>
<Views>
<Anzahl>1</Anzahl>
<View0>
<Name>Main</Name>
<X>50</X>
<Y>400</Y>
</View0>
</Views>
</Tabelle3>
</Tabellen>
<Views>
<Anzahl>1</Anzahl>
<View0>
<Beschreibung>Diese Sicht beinhaltet alle Tabellen des Schemas</Beschreibung>
<Name>Main</Name>
<ReferenzierteSpaltenAnzeigen>true</ReferenzierteSpaltenAnzeigen>
<Tabelle0>Table01</Tabelle0>
<Tabelle1>Table02</Tabelle1>
<Tabelle2>Table03</Tabelle2>
<Tabelle3>Table04</Tabelle3>
<Tabellenanzahl>4</Tabellenanzahl>
<TechnischeSpaltenVerstecken>false</TechnischeSpaltenVerstecken>
</View0>
</Views>
</Diagramm>
| 44.004843 | 179 | 0.454207 |
3963bc609564e680671553cbfc1622e1201e541a | 8,409 | ads | Ada | src/gen/gstreamer-gst_low_level-gstreamer_0_10_gst_gsturi_h.ads | persan/A-gst | 7a39693d105617adea52680424c862a1a08f7368 | [
"Apache-2.0"
] | 1 | 2018-01-18T00:51:00.000Z | 2018-01-18T00:51:00.000Z | src/gen/gstreamer-gst_low_level-gstreamer_0_10_gst_gsturi_h.ads | persan/A-gst | 7a39693d105617adea52680424c862a1a08f7368 | [
"Apache-2.0"
] | null | null | null | src/gen/gstreamer-gst_low_level-gstreamer_0_10_gst_gsturi_h.ads | persan/A-gst | 7a39693d105617adea52680424c862a1a08f7368 | [
"Apache-2.0"
] | null | null | null | pragma Ada_2005;
pragma Style_Checks (Off);
pragma Warnings (Off);
with Interfaces.C; use Interfaces.C;
with glib;
with glib.Values;
with System;
with glib;
with System;
limited with GStreamer.GST_Low_Level.gstreamer_0_10_gst_gstelement_h;
package GStreamer.GST_Low_Level.gstreamer_0_10_gst_gsturi_h is
-- arg-macro: function GST_URI_TYPE_IS_VALID (type)
-- return (type) = GST_URI_SRC or else (type) = GST_URI_SINK;
-- unsupported macro: GST_TYPE_URI_HANDLER (gst_uri_handler_get_type ())
-- arg-macro: function GST_URI_HANDLER (obj)
-- return G_TYPE_CHECK_INSTANCE_CAST ((obj), GST_TYPE_URI_HANDLER, GstURIHandler);
-- arg-macro: function GST_IS_URI_HANDLER (obj)
-- return G_TYPE_CHECK_INSTANCE_TYPE ((obj), GST_TYPE_URI_HANDLER);
-- arg-macro: function GST_URI_HANDLER_GET_INTERFACE (obj)
-- return G_TYPE_INSTANCE_GET_INTERFACE ((obj), GST_TYPE_URI_HANDLER, GstURIHandlerInterface);
-- GStreamer
-- * Copyright (C) 1999,2000 Erik Walthinsen <[email protected]>
-- * 2000 Wim Taymans <[email protected]>
-- *
-- * gsturi.h: Header for uri to element mappings
-- *
-- * This library is free software; you can redistribute it and/or
-- * modify it under the terms of the GNU Library 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
-- * Library General Public License for more details.
-- *
-- * You should have received a copy of the GNU Library 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.
--
--*
-- * GstURIType:
-- * @GST_URI_UNKNOWN : The URI direction is unknown
-- * @GST_URI_SINK : The URI is a consumer.
-- * @GST_URI_SRC : The URI is a producer.
-- *
-- * The different types of URI direction.
--
type GstURIType is
(GST_URI_UNKNOWN,
GST_URI_SINK,
GST_URI_SRC);
pragma Convention (C, GstURIType); -- gst/gsturi.h:46
--*
-- * GST_URI_TYPE_IS_VALID:
-- * @type: A #GstURIType
-- *
-- * Tests if the type direction is valid.
--
-- uri handler functions
--*
-- * GstURIHandler:
-- *
-- * Opaque #GstURIHandler structure.
--
-- skipped empty struct u_GstURIHandler
-- skipped empty struct GstURIHandler
type GstURIHandlerInterface;
type u_GstURIHandlerInterface_u_gst_reserved_array is array (0 .. 1) of System.Address;
--subtype GstURIHandlerInterface is u_GstURIHandlerInterface; -- gst/gsturi.h:68
--*
-- * GstURIHandlerInterface:
-- * @parent: The parent interface type
-- * @get_type: Method to tell whether the element handles source or sink URI.
-- * @get_protocols: Method to return the list of protocols handled by the element.
-- * @get_uri: Method to return the URI currently handled by the element.
-- * @set_uri: Method to set a new URI.
-- * @get_type_full: Variant of get_type which takes a GType argument. This is
-- * for use by bindings that need to pass context when creating a URI Handler.
-- * If implemented, get_type will be used in preference to get_type_full.
-- * Since: 0.10.15.
-- * @get_protocols_full: Variant of get_protocols which takes a GType argument.
-- * This is for use by bindings that need to pass context when creating a URI
-- * Handler. If implemented, get_protocols will be used in preference to
-- * get_protocols_full. Since: 0.10.15.
-- *
-- * Any #GstElement using this interface should implement these methods.
--
type GstURIHandlerInterface is record
parent : aliased GStreamer.GST_Low_Level.glib_2_0_gobject_gtype_h.GTypeInterface; -- gst/gsturi.h:89
new_uri : access procedure (arg1 : System.Address; arg2 : access GLIB.gchar); -- gst/gsturi.h:94
get_type : access function return GstURIType; -- gst/gsturi.h:105
get_protocols : access function return System.Address; -- gst/gsturi.h:106
get_uri : access function (arg1 : System.Address) return access GLIB.gchar; -- gst/gsturi.h:109
set_uri : access function (arg1 : System.Address; arg2 : access GLIB.gchar) return GLIB.gboolean; -- gst/gsturi.h:111
get_type_full : access function (arg1 : GLIB.GType) return GstURIType; -- gst/gsturi.h:113
get_protocols_full : access function (arg1 : GLIB.GType) return System.Address; -- gst/gsturi.h:114
u_gst_reserved : u_GstURIHandlerInterface_u_gst_reserved_array; -- gst/gsturi.h:120
end record;
pragma Convention (C_Pass_By_Copy, GstURIHandlerInterface); -- gst/gsturi.h:88
--< private >
-- signals
-- idea for the future ?
-- gboolean (* require_password) (GstURIHandler * handler,
-- gchar ** username,
-- gchar ** password);
--
-- vtable
--< public >
-- querying capabilities
-- using the interface
--< private >
-- we might want to add functions here to query features,
-- * someone with gnome-vfs knowledge go ahead
-- general URI functions
function gst_uri_protocol_is_valid (protocol : access GLIB.gchar) return GLIB.gboolean; -- gst/gsturi.h:125
pragma Import (C, gst_uri_protocol_is_valid, "gst_uri_protocol_is_valid");
function gst_uri_protocol_is_supported (c_type : GstURIType; protocol : access GLIB.gchar) return GLIB.gboolean; -- gst/gsturi.h:126
pragma Import (C, gst_uri_protocol_is_supported, "gst_uri_protocol_is_supported");
function gst_uri_is_valid (uri : access GLIB.gchar) return GLIB.gboolean; -- gst/gsturi.h:128
pragma Import (C, gst_uri_is_valid, "gst_uri_is_valid");
function gst_uri_get_protocol (uri : access GLIB.gchar) return access GLIB.gchar; -- gst/gsturi.h:129
pragma Import (C, gst_uri_get_protocol, "gst_uri_get_protocol");
function gst_uri_has_protocol (uri : access GLIB.gchar; protocol : access GLIB.gchar) return GLIB.gboolean; -- gst/gsturi.h:130
pragma Import (C, gst_uri_has_protocol, "gst_uri_has_protocol");
function gst_uri_get_location (uri : access GLIB.gchar) return access GLIB.gchar; -- gst/gsturi.h:132
pragma Import (C, gst_uri_get_location, "gst_uri_get_location");
function gst_uri_construct (protocol : access GLIB.gchar; location : access GLIB.gchar) return access GLIB.gchar; -- gst/gsturi.h:133
pragma Import (C, gst_uri_construct, "gst_uri_construct");
function gst_filename_to_uri (filename : access GLIB.gchar; error : System.Address) return access GLIB.gchar; -- gst/gsturi.h:136
pragma Import (C, gst_filename_to_uri, "gst_filename_to_uri");
function gst_element_make_from_uri
(c_type : GstURIType;
uri : access GLIB.gchar;
elementname : access GLIB.gchar) return access GStreamer.GST_Low_Level.gstreamer_0_10_gst_gstelement_h.GstElement; -- gst/gsturi.h:139
pragma Import (C, gst_element_make_from_uri, "gst_element_make_from_uri");
-- accessing the interface
function gst_uri_handler_get_type return GLIB.GType; -- gst/gsturi.h:144
pragma Import (C, gst_uri_handler_get_type, "gst_uri_handler_get_type");
function gst_uri_handler_get_uri_type (handler : System.Address) return GLIB.guint; -- gst/gsturi.h:146
pragma Import (C, gst_uri_handler_get_uri_type, "gst_uri_handler_get_uri_type");
function gst_uri_handler_get_protocols (handler : System.Address) return System.Address; -- gst/gsturi.h:147
pragma Import (C, gst_uri_handler_get_protocols, "gst_uri_handler_get_protocols");
function gst_uri_handler_get_uri (handler : System.Address) return access GLIB.gchar; -- gst/gsturi.h:148
pragma Import (C, gst_uri_handler_get_uri, "gst_uri_handler_get_uri");
function gst_uri_handler_set_uri (handler : System.Address; uri : access GLIB.gchar) return GLIB.gboolean; -- gst/gsturi.h:149
pragma Import (C, gst_uri_handler_set_uri, "gst_uri_handler_set_uri");
procedure gst_uri_handler_new_uri (handler : System.Address; uri : access GLIB.gchar); -- gst/gsturi.h:151
pragma Import (C, gst_uri_handler_new_uri, "gst_uri_handler_new_uri");
end GStreamer.GST_Low_Level.gstreamer_0_10_gst_gsturi_h;
| 46.203297 | 141 | 0.720419 |
39eec5f6aac5fbae6ac286057077ab0e99229445 | 2,251 | ads | Ada | Src/crt.ads | SMerrony/dashera | 74961f34a44cabae414e84537e8baae0ecb373c9 | [
"MIT"
] | 23 | 2021-12-12T15:20:22.000Z | 2022-03-19T19:55:06.000Z | Src/crt.ads | SMerrony/dashera | 74961f34a44cabae414e84537e8baae0ecb373c9 | [
"MIT"
] | 1 | 2022-03-10T00:09:35.000Z | 2022-03-15T08:16:00.000Z | Src/crt.ads | SMerrony/dashera | 74961f34a44cabae414e84537e8baae0ecb373c9 | [
"MIT"
] | 1 | 2022-03-11T19:42:02.000Z | 2022-03-11T19:42:02.000Z | -- Copyright ©2021,2022 Steve Merrony
-- 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 Cairo;
with Gdk.Event;
with Glib; use Glib;
with Glib.Main; use Glib.Main;
with Gtk.Drawing_Area;
with Gtk.Widget;
with BDF_Font;
package Crt is
package Blink_Timeout is new Glib.Main.Generic_Sources (Gtk.Drawing_Area.Gtk_Drawing_Area);
package Redraw_Timeout is new Glib.Main.Generic_Sources (Gtk.Drawing_Area.Gtk_Drawing_Area);
Font_Filename : constant String := "D410-b-12.bdf";
Blink_Period_MS : constant Guint := 500;
type Crt_T is record
DA : Gtk.Drawing_Area.Gtk_Drawing_Area;
Zoom : BDF_Font.Zoom_T;
Blink_State : Boolean;
-- Timeout_ID : Glib.Main.G_Source_ID := 0;
end record;
Tube : Crt_T;
surface : Cairo.Cairo_Surface;
Blink_TO, Redraw_TO : Glib.Main.G_Source_ID;
procedure Init (Zoom : in BDF_Font.Zoom_T);
function Configure_Event_CB
(Self : access Gtk.Widget.Gtk_Widget_Record'Class;
Event : Gdk.Event.Gdk_Event_Configure)
return Boolean;
function Draw_CB
(Self : access Gtk.Widget.Gtk_Widget_Record'Class;
Cr : Cairo.Cairo_Context)
return Boolean;
Unloaded_Character : exception;
end Crt; | 37.516667 | 95 | 0.737006 |
3971b5a250008cb535f09d9dcb66c8ef41988016 | 1,683 | adb | Ada | examples/streams/stream_reader.adb | glencornell/ada-socketcan | 5ea24aff42ee9b91bb44b39a1c957886651ad46b | [
"MIT"
] | 2 | 2020-03-02T10:49:31.000Z | 2020-03-05T18:47:28.000Z | examples/streams/stream_reader.adb | glencornell/ada-socketcan | 5ea24aff42ee9b91bb44b39a1c957886651ad46b | [
"MIT"
] | null | null | null | examples/streams/stream_reader.adb | glencornell/ada-socketcan | 5ea24aff42ee9b91bb44b39a1c957886651ad46b | [
"MIT"
] | null | null | null | -- MIT License
--
-- Copyright (c) 2021 Glen Cornell <[email protected]>
--
-- Permission is hereby granted, free of charge, to any person obtaining a copy
-- of this software and associated documentation files (the "Software"), to deal
-- in the Software without restriction, including without limitation the rights
-- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-- copies of the Software, and to permit persons to whom the Software is
-- furnished to do so, subject to the following conditions:
--
-- The above copyright notice and this permission notice shall be included in all
-- copies or substantial portions of the Software.
--
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-- SOFTWARE.
with Sockets.Can;
with Sockets.Can_Frame;
with Print_Can_Frame;
procedure Stream_Reader is
Socket : Sockets.Can.Socket_Type;
Can_Stream : aliased Sockets.Can.Can_Stream;
Frame : Sockets.Can_Frame.Can_Frame;
If_Name : constant String := "vcan0";
begin
Socket := Sockets.Can.Open(If_Name);
Sockets.Can.Create_Stream (Can_Stream, Socket);
loop
Sockets.Can_Frame.Can_Frame'Read (Can_Stream'Access, Frame);
Print_Can_Frame (Frame, If_Name);
end loop;
end Stream_Reader;
| 41.04878 | 81 | 0.744504 |
dff8716401c40b857d5a415ad31e0ffb621665d3 | 288 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/c_words.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/c_words.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/c_words.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- { dg-do compile }
package body C_Words is
function New_Word (Str : String) return Word is
begin
return (Str'Length, Str);
end New_Word;
function New_Word (Str : String) return C_Word is
begin
return (Str'Length, Str);
end New_Word;
end C_Words;
| 19.2 | 52 | 0.642361 |
18245d4268b9222dda8522d3a6bc32813cb67853 | 381 | ads | Ada | src/apsepp-generic_shared_instance-creator.ads | thierr26/ada-apsepp | 6eb87079ea57707db4ee1e2215fa170af66b1913 | [
"MIT"
] | null | null | null | src/apsepp-generic_shared_instance-creator.ads | thierr26/ada-apsepp | 6eb87079ea57707db4ee1e2215fa170af66b1913 | [
"MIT"
] | null | null | null | src/apsepp-generic_shared_instance-creator.ads | thierr26/ada-apsepp | 6eb87079ea57707db4ee1e2215fa170af66b1913 | [
"MIT"
] | null | null | null | -- Copyright (C) 2019 Thierry Rascle <[email protected]>
-- MIT license. Please refer to the LICENSE file.
generic
with function Allocate return Instance_Type_Access;
with procedure CB is null;
Just_Pretend : Boolean := False;
package Apsepp.Generic_Shared_Instance.Creator is
function Has_Actually_Created return Boolean;
end Apsepp.Generic_Shared_Instance.Creator;
| 29.307692 | 55 | 0.790026 |
d06934a5e470f2db01253ada3c3a44f90188fa1d | 4,763 | ads | Ada | tools-src/gnu/gcc/gcc/ada/layout.ads | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 80 | 2015-01-02T10:14:04.000Z | 2021-06-07T06:29:49.000Z | tools-src/gnu/gcc/gcc/ada/layout.ads | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 9 | 2015-05-14T11:03:12.000Z | 2018-01-04T07:12:58.000Z | tools-src/gnu/gcc/gcc/ada/layout.ads | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- L A Y O U T --
-- --
-- S p e c --
-- --
-- $Revision$
-- --
-- Copyright (C) 2000-2001 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package does front-end layout of types and objects. The result is
-- to annotate the tree with information on size and alignment of types
-- and objects. How much layout is performed depends on the setting of the
-- target dependent parameter Backend_Layout.
with Types; use Types;
package Layout is
-- The following procedures are called from Freeze, so all entities
-- for types and objects that get frozen (which should be all such
-- entities which are seen by the back end) will get layed out by one
-- of these two procedures.
procedure Layout_Type (E : Entity_Id);
-- This procedure may set or adjust the fields Esize, RM_Size and
-- Alignment in the non-generic type or subtype entity E. If the
-- Backend_Layout switch is False, then it is guaranteed that all
-- three fields will be properly set on return. Regardless of the
-- Backend_Layout value, it is guaranteed that all discrete types
-- will have both Esize and RM_Size fields set on return (since
-- these are static values). Note that Layout_Type is not called
-- for generic types, since these play no part in code generation,
-- and hence representation aspects are irrelevant.
procedure Layout_Object (E : Entity_Id);
-- E is either a variable (E_Variable), a constant (E_Constant),
-- a loop parameter (E_Loop_Parameter), or a formal parameter of
-- a non-generic subprogram (E_In_Parameter, E_In_Out_Parameter,
-- or E_Out_Parameter). This procedure may set or adjust the
-- Esize and Alignment fields of E. If Backend_Layout is False,
-- then it is guaranteed that both fields will be properly set
-- on return. If the Esize is still unknown in the latter case,
-- it means that the object must be allocated dynamically, since
-- its length is not known at compile time.
procedure Set_Discrete_RM_Size (Def_Id : Entity_Id);
-- Set proper RM_Size for discrete size, this is normally the minimum
-- number of bits to accommodate the range given, except in the case
-- where the subtype statically matches the first subtype, in which
-- case the size must be copied from the first subtype. For generic
-- types, the RM_Size is simply set to zero. This routine also sets
-- the Is_Constrained flag in Def_Id.
procedure Set_Prim_Alignment (E : Entity_Id);
-- The front end always sets alignments for primitive types by calling this
-- procedure. Note that we have to do this for discrete types (since the
-- Alignment attribute is static), so we might as well do it for all
-- scalar types, since the processing is the same.
end Layout;
| 59.5375 | 79 | 0.558682 |
dfb1684dbb3f02727118bc2e5ea35234bfd2736e | 6,482 | ads | Ada | runtime/ravenscar-sfp-stm32f427/bsp/i-stm32-syscfg.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 12 | 2017-06-08T14:19:57.000Z | 2022-03-09T02:48:59.000Z | runtime/ravenscar-sfp-stm32f427/bsp/i-stm32-syscfg.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 6 | 2017-06-08T13:13:50.000Z | 2020-05-15T09:32:43.000Z | runtime/ravenscar-sfp-stm32f427/bsp/i-stm32-syscfg.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 3 | 2017-06-30T14:05:06.000Z | 2022-02-17T12:20:45.000Z | --
-- Copyright (C) 2016, AdaCore
--
-- This spec has been automatically generated from STM32F429x.svd
pragma Ada_2012;
with Interfaces.Bit_Types;
with System;
package Interfaces.STM32.SYSCFG is
pragma Preelaborate;
pragma No_Elaboration_Code_All;
---------------
-- Registers --
---------------
--------------------
-- MEMRM_Register --
--------------------
subtype MEMRM_MEM_MODE_Field is Interfaces.Bit_Types.UInt3;
subtype MEMRM_FB_MODE_Field is Interfaces.Bit_Types.Bit;
subtype MEMRM_SWP_FMC_Field is Interfaces.Bit_Types.UInt2;
-- memory remap register
type MEMRM_Register is record
-- Memory mapping selection
MEM_MODE : MEMRM_MEM_MODE_Field := 16#0#;
-- unspecified
Reserved_3_7 : Interfaces.Bit_Types.UInt5 := 16#0#;
-- Flash bank mode selection
FB_MODE : MEMRM_FB_MODE_Field := 16#0#;
-- unspecified
Reserved_9_9 : Interfaces.Bit_Types.Bit := 16#0#;
-- FMC memory mapping swap
SWP_FMC : MEMRM_SWP_FMC_Field := 16#0#;
-- unspecified
Reserved_12_31 : Interfaces.Bit_Types.UInt20 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for MEMRM_Register use record
MEM_MODE at 0 range 0 .. 2;
Reserved_3_7 at 0 range 3 .. 7;
FB_MODE at 0 range 8 .. 8;
Reserved_9_9 at 0 range 9 .. 9;
SWP_FMC at 0 range 10 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
------------------
-- PMC_Register --
------------------
subtype PMC_ADC1DC2_Field is Interfaces.Bit_Types.Bit;
subtype PMC_ADC2DC2_Field is Interfaces.Bit_Types.Bit;
subtype PMC_ADC3DC2_Field is Interfaces.Bit_Types.Bit;
subtype PMC_MII_RMII_SEL_Field is Interfaces.Bit_Types.Bit;
-- peripheral mode configuration register
type PMC_Register is record
-- unspecified
Reserved_0_15 : Interfaces.Bit_Types.Short := 16#0#;
-- ADC1DC2
ADC1DC2 : PMC_ADC1DC2_Field := 16#0#;
-- ADC2DC2
ADC2DC2 : PMC_ADC2DC2_Field := 16#0#;
-- ADC3DC2
ADC3DC2 : PMC_ADC3DC2_Field := 16#0#;
-- unspecified
Reserved_19_22 : Interfaces.Bit_Types.UInt4 := 16#0#;
-- Ethernet PHY interface selection
MII_RMII_SEL : PMC_MII_RMII_SEL_Field := 16#0#;
-- unspecified
Reserved_24_31 : Interfaces.Bit_Types.Byte := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PMC_Register use record
Reserved_0_15 at 0 range 0 .. 15;
ADC1DC2 at 0 range 16 .. 16;
ADC2DC2 at 0 range 17 .. 17;
ADC3DC2 at 0 range 18 .. 18;
Reserved_19_22 at 0 range 19 .. 22;
MII_RMII_SEL at 0 range 23 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
---------------------
-- EXTICR_Register --
---------------------
------------------
-- EXTICR1.EXTI --
------------------
-- EXTICR1_EXTI array element
subtype EXTICR1_EXTI_Element is Interfaces.Bit_Types.UInt4;
-- EXTICR1_EXTI array
type EXTICR1_EXTI_Field_Array is array (0 .. 3) of EXTICR1_EXTI_Element
with Component_Size => 4, Size => 16;
-- Type definition for EXTICR1_EXTI
type EXTICR1_EXTI_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- EXTI as a value
Val : Interfaces.Bit_Types.Short;
when True =>
-- EXTI as an array
Arr : EXTICR1_EXTI_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for EXTICR1_EXTI_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- external interrupt configuration register 1
type EXTICR_Register is record
-- EXTI x configuration (x = 0 to 3)
EXTI : EXTICR1_EXTI_Field :=
(As_Array => False, Val => 16#0#);
-- unspecified
Reserved_16_31 : Interfaces.Bit_Types.Short := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EXTICR_Register use record
EXTI at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
--------------------
-- CMPCR_Register --
--------------------
subtype CMPCR_CMP_PD_Field is Interfaces.Bit_Types.Bit;
subtype CMPCR_READY_Field is Interfaces.Bit_Types.Bit;
-- Compensation cell control register
type CMPCR_Register is record
-- Read-only. Compensation cell power-down
CMP_PD : CMPCR_CMP_PD_Field := 16#0#;
-- unspecified
Reserved_1_7 : Interfaces.Bit_Types.UInt7;
-- Read-only. READY
READY : CMPCR_READY_Field := 16#0#;
-- unspecified
Reserved_9_31 : Interfaces.Bit_Types.UInt23;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CMPCR_Register use record
CMP_PD at 0 range 0 .. 0;
Reserved_1_7 at 0 range 1 .. 7;
READY at 0 range 8 .. 8;
Reserved_9_31 at 0 range 9 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- System configuration controller
type SYSCFG_Peripheral is record
-- memory remap register
MEMRM : MEMRM_Register;
-- peripheral mode configuration register
PMC : PMC_Register;
-- external interrupt configuration register 1
EXTICR1 : EXTICR_Register;
-- external interrupt configuration register 2
EXTICR2 : EXTICR_Register;
-- external interrupt configuration register 3
EXTICR3 : EXTICR_Register;
-- external interrupt configuration register 4
EXTICR4 : EXTICR_Register;
-- Compensation cell control register
CMPCR : CMPCR_Register;
end record
with Volatile;
for SYSCFG_Peripheral use record
MEMRM at 0 range 0 .. 31;
PMC at 4 range 0 .. 31;
EXTICR1 at 8 range 0 .. 31;
EXTICR2 at 12 range 0 .. 31;
EXTICR3 at 16 range 0 .. 31;
EXTICR4 at 20 range 0 .. 31;
CMPCR at 32 range 0 .. 31;
end record;
-- System configuration controller
SYSCFG_Periph : aliased SYSCFG_Peripheral
with Import, Address => SYSCFG_Base;
end Interfaces.STM32.SYSCFG;
| 30.720379 | 74 | 0.605523 |
23a4004039f490b488086e5194902f2ae2b22b50 | 104 | adb | Ada | hello-ada/hello-world.adb | florianbussmann/hello-world | f36cade4b04c7cc9e10e81e6a1b1b5c34816895a | [
"MIT"
] | 2 | 2015-03-15T03:13:01.000Z | 2021-05-31T11:55:35.000Z | hello-ada/hello-world.adb | florianbussmann/hello-world | f36cade4b04c7cc9e10e81e6a1b1b5c34816895a | [
"MIT"
] | 1 | 2015-01-28T19:47:01.000Z | 2015-01-28T19:47:01.000Z | hello-ada/hello-world.adb | florianbussmann/hello-world | f36cade4b04c7cc9e10e81e6a1b1b5c34816895a | [
"MIT"
] | 3 | 2015-01-25T00:20:49.000Z | 2015-04-13T03:39:05.000Z | with Ada.Text_IO;
procedure Hello_World is
use Ada.Text_IO;
begin
Put_Line("Hello, World.");
end; | 14.857143 | 30 | 0.721154 |
39d8fce4f6083e9c2bc0f4de5e768399da617caf | 8,138 | ads | Ada | src/el-expressions.ads | My-Colaborations/ada-el | dba689d093357cda0722a1e650358fa5fcaf8157 | [
"Apache-2.0"
] | null | null | null | src/el-expressions.ads | My-Colaborations/ada-el | dba689d093357cda0722a1e650358fa5fcaf8157 | [
"Apache-2.0"
] | null | null | null | src/el-expressions.ads | My-Colaborations/ada-el | dba689d093357cda0722a1e650358fa5fcaf8157 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- EL.Expressions -- Expression Language
-- Copyright (C) 2009, 2010, 2011, 2017, 2020 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
--
-- First, create the expression object:
--
-- E : constant Expression := EL.Expressions.Create_Expression ("obj.count + 3");
--
-- The expression must be evaluated against an expression context.
-- The expression context will resolve variables whose values can change depending
-- on the evaluation context. In the example, ''obj'' is the variable name
-- and ''count'' is the property associated with that variable.
--
-- Value : constant Object := E.Get_Value (Context);
--
-- The ''Value'' holds the result which can be a boolean, an integer, a date,
-- a float number or a string. The value can be converted as follows:
--
-- N : Integer := To_Integer (Value);
--
with EL.Objects;
with Ada.Finalization;
with Ada.Strings.Unbounded;
limited private with EL.Expressions.Nodes;
with EL.Contexts;
with Util.Beans.Methods;
package EL.Expressions is
pragma Preelaborate;
use EL.Objects;
use EL.Contexts;
-- Exception raised when parsing an invalid expression.
Invalid_Expression : exception;
-- Exception raised when a variable cannot be resolved.
Invalid_Variable : exception;
-- Exception raised when a method cannot be found.
Invalid_Method : exception;
-- A parameter is missing in a function call.
Missing_Argument : exception;
-- ------------------------------
-- Expression
-- ------------------------------
type Expression is new Ada.Finalization.Controlled with private;
type Expression_Access is access all Expression'Class;
-- Check whether the expression is a holds a constant value.
function Is_Constant (Expr : Expression'Class) return Boolean;
-- Returns True if the expression is empty (no constant value and no expression).
function Is_Null (Expr : in Expression'Class) return Boolean;
-- Get the value of the expression using the given expression context.
-- Returns an object that holds a typed result.
function Get_Value (Expr : Expression;
Context : ELContext'Class) return Object;
-- Get the expression string that was parsed.
function Get_Expression (Expr : in Expression) return String;
-- Parse an expression and return its representation ready for evaluation.
-- The context is used to resolve the functions. Variables will be
-- resolved during evaluation of the expression.
-- Raises <b>Invalid_Expression</b> if the expression is invalid.
function Create_Expression (Expr : String;
Context : ELContext'Class)
return Expression;
-- Reduce the expression by eliminating known variables and computing
-- constant expressions. The result expression is either another
-- expression or a computed constant value.
function Reduce_Expression (Expr : Expression;
Context : ELContext'Class)
return Expression;
-- Create an EL expression from an object.
function Create_Expression (Bean : in EL.Objects.Object)
return Expression;
-- ------------------------------
-- ValueExpression
-- ------------------------------ --
type Value_Expression is new Expression with private;
type Value_Expression_Access is access all Value_Expression'Class;
-- Set the value of the expression to the given object value.
procedure Set_Value (Expr : in Value_Expression;
Context : in ELContext'Class;
Value : in Object);
-- Returns true if the expression is read-only.
function Is_Readonly (Expr : in Value_Expression;
Context : in ELContext'Class) return Boolean;
overriding
function Reduce_Expression (Expr : Value_Expression;
Context : ELContext'Class)
return Value_Expression;
-- Parse an expression and return its representation ready for evaluation.
function Create_Expression (Expr : String;
Context : ELContext'Class)
return Value_Expression;
function Create_ValueExpression (Bean : EL.Objects.Object)
return Value_Expression;
-- Create a Value_Expression from an expression.
-- Raises Invalid_Expression if the expression in not an lvalue.
function Create_Expression (Expr : Expression'Class)
return Value_Expression;
-- ------------------------------
-- Method Expression
-- ------------------------------
-- A <b>Method_Expression</b> is an expression that refers to a method.
-- Information about the object and method is retrieved by using
-- the <b>Get_Method_Info</b> operation.
type Method_Expression is new EL.Expressions.Expression with private;
type Method_Info is record
Object : EL.Objects.Object;
Binding : Util.Beans.Methods.Method_Binding_Access;
end record;
-- Evaluate the method expression and return the object and method
-- binding to execute the method. The result contains a pointer
-- to the bean object and a method binding. The method binding
-- contains the information to invoke the method
-- (such as an access to the function or procedure).
-- Raises the <b>Invalid_Method</b> exception if the method
-- cannot be resolved.
function Get_Method_Info (Expr : Method_Expression;
Context : ELContext'Class)
return Method_Info;
-- Parse an expression and return its representation ready for evaluation.
-- The context is used to resolve the functions. Variables will be
-- resolved during evaluation of the expression.
-- Raises <b>Invalid_Expression</b> if the expression is invalid.
overriding
function Create_Expression (Expr : String;
Context : EL.Contexts.ELContext'Class)
return Method_Expression;
-- Reduce the expression by eliminating known variables and computing
-- constant expressions. The result expression is either another
-- expression or a computed constant value.
overriding
function Reduce_Expression (Expr : Method_Expression;
Context : EL.Contexts.ELContext'Class)
return Method_Expression;
-- Create a Method_Expression from an expression.
-- Raises Invalid_Expression if the expression in not an lvalue.
function Create_Expression (Expr : Expression'Class)
return Method_Expression;
private
overriding
procedure Adjust (Object : in out Expression);
overriding
procedure Finalize (Object : in out Expression);
type Expression is new Ada.Finalization.Controlled with record
Node : access EL.Expressions.Nodes.ELNode'Class := null;
Value : EL.Objects.Object := EL.Objects.Null_Object;
Expr : Ada.Strings.Unbounded.Unbounded_String;
end record;
type Value_Expression is new Expression with null record;
type Method_Expression is new EL.Expressions.Expression with null record;
end EL.Expressions;
| 40.69 | 85 | 0.64463 |
df42d6312860daa34a21430500151c631fab0f59 | 909 | adb | Ada | src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/array_ptr_renaming/foo.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 31 | 2018-08-01T21:25:24.000Z | 2022-02-14T07:52:34.000Z | src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/array_ptr_renaming/foo.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 40 | 2018-12-03T19:48:52.000Z | 2021-03-10T06:34:26.000Z | src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/array_ptr_renaming/foo.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 20 | 2018-11-16T21:19:22.000Z | 2021-10-18T23:08:24.000Z | -- Copyright 2015-2016 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with System;
with Pack;
procedure Foo is
NT : Pack.Table_Type renames Pack.Table;
NTP : Pack.Table_Ptr_Type renames Pack.Table_Ptr;
begin
NT := NT; -- BREAK
NTP := NTP;
end Foo;
| 34.961538 | 73 | 0.724972 |
4a1caac28d18caebfe969101d8c6be68a16b173b | 5,684 | ads | Ada | source/amf/uml/amf-uml-combined_fragments.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-uml-combined_fragments.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-uml-combined_fragments.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
-- A combined fragment defines an expression of interaction fragments. A
-- combined fragment is defined by an interaction operator and corresponding
-- interaction operands. Through the use of combined fragments the user will
-- be able to describe a number of traces in a compact and concise manner.
------------------------------------------------------------------------------
limited with AMF.UML.Gates.Collections;
with AMF.UML.Interaction_Fragments;
limited with AMF.UML.Interaction_Operands.Collections;
package AMF.UML.Combined_Fragments is
pragma Preelaborate;
type UML_Combined_Fragment is limited interface
and AMF.UML.Interaction_Fragments.UML_Interaction_Fragment;
type UML_Combined_Fragment_Access is
access all UML_Combined_Fragment'Class;
for UML_Combined_Fragment_Access'Storage_Size use 0;
not overriding function Get_Cfragment_Gate
(Self : not null access constant UML_Combined_Fragment)
return AMF.UML.Gates.Collections.Set_Of_UML_Gate is abstract;
-- Getter of CombinedFragment::cfragmentGate.
--
-- Specifies the gates that form the interface between this
-- CombinedFragment and its surroundings
not overriding function Get_Interaction_Operator
(Self : not null access constant UML_Combined_Fragment)
return AMF.UML.UML_Interaction_Operator_Kind is abstract;
-- Getter of CombinedFragment::interactionOperator.
--
-- Specifies the operation which defines the semantics of this combination
-- of InteractionFragments.
not overriding procedure Set_Interaction_Operator
(Self : not null access UML_Combined_Fragment;
To : AMF.UML.UML_Interaction_Operator_Kind) is abstract;
-- Setter of CombinedFragment::interactionOperator.
--
-- Specifies the operation which defines the semantics of this combination
-- of InteractionFragments.
not overriding function Get_Operand
(Self : not null access constant UML_Combined_Fragment)
return AMF.UML.Interaction_Operands.Collections.Ordered_Set_Of_UML_Interaction_Operand is abstract;
-- Getter of CombinedFragment::operand.
--
-- The set of operands of the combined fragment.
end AMF.UML.Combined_Fragments;
| 58 | 106 | 0.526742 |
10348fbffbd0a787b2a150e0f431d2ccbf3039cd | 956 | adb | Ada | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/whatis_array_val/foo.adb | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | 3 | 2021-05-04T17:09:06.000Z | 2021-10-04T07:19:26.000Z | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/whatis_array_val/foo.adb | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | null | null | null | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/whatis_array_val/foo.adb | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | null | null | null | -- Copyright 2012-2020 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with Pck; use Pck;
procedure Foo is
type Color is (Black, Red, Green, Blue, White);
type Full_Table is array (Color) of Integer;
Full : Full_Table := (144, 233, 377, 610, 987);
begin
Do_Nothing (Full'Address); -- STOP
end Foo;
| 36.769231 | 73 | 0.719665 |
4aae35f5f14ead5712730bbbbb5bf11ddc73266d | 6,935 | ads | Ada | src/cbap.ads | darkestkhan/cbap | 5b7744a1714b74f803f7785b51fddfaa47b0cbf8 | [
"0BSD"
] | 6 | 2015-07-01T18:35:54.000Z | 2020-09-21T20:41:24.000Z | src/cbap.ads | darkestkhan/cbap | 5b7744a1714b74f803f7785b51fddfaa47b0cbf8 | [
"0BSD"
] | 1 | 2016-02-29T14:29:58.000Z | 2016-02-29T14:29:58.000Z | src/cbap.ads | darkestkhan/cbap | 5b7744a1714b74f803f7785b51fddfaa47b0cbf8 | [
"0BSD"
] | null | null | null | ------------------------------------------------------------------------------
-- EMAIL: <[email protected]> --
-- License: ISC License (see COPYING file) --
-- --
-- Copyright © 2015 darkestkhan --
------------------------------------------------------------------------------
-- 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 Ada.Containers.Indefinite_Vectors;
------------------------------------------------------------------------------
-- Small and simple callback based library for processing program arguments --
------------------------------------------------------------------------------
---------------------------------------------------------------------------
-- U S A G E --
---------------------------------------------------------------------------
-- First register all callbacks you are interested in, then call
-- Process_Arguments.
--
-- NOTE: "=" sign can't be part of argument name for registered callback.
--
-- Only one callback can be registered per argument, otherwise
-- Constraint_Error is propagated.
---------------------------------------------------------------------------
---------------------------------------------------------------------------
-- Leading single hyphen and double hyphen are stripped (if present) when
-- processing arguments that are placed before first "--" argument,
-- so e.g. "--help", "-help" and "help" are functionally
-- equivalent, treated as if "help" was actually passed in all 3 cases.
-- (you should register callback just for "help", if you register it for
-- "--help" then actually passed argument would have to be "----help" in order
-- for it to trigger said callback)
--
-- In addition if you registered callback as case insensitive, then
-- (using above example) "Help", "HELP", "help" and "HeLp" all would result in
-- call to said callback.
--
-- If Argument_Type is Variable then callback will receive part of argument
-- that is after "=" sign. (ie. "OS=Linux" argument would result in callback
-- receiving only "Linux" as its argument), otherwise actual argument will be
-- passed.
--
-- For Variable, case insensitive callbacks simple rule applies:
-- only variable name is case insensitive, with actual value (when passed to
-- program) being unchanged.
--
-- If argument for which callback is registered is passed few times
-- (ie. ./program help help help) then callback is triggered however many
-- times said argument is detected.
--
-- NOTE that Check for case insensitive callback is being performed first,
-- thus if you happen to register callback for "help" (case insensitive) and
-- "HeLp" (case sensitive) then only the case insensitive one will be called
-- (i.e. "help").
--
-- All arguments with no associated callback are added to Unknown_Arguments
-- vector as long as they appear before first "--" argument.
--
-- All arguments after first "--" (standalone double hyphen) are added to
-- Input_Argument vector (this includes another "--"), w/o any kind of
-- hyphen stripping being performed on them.
--
-- NOTE: No care is taken to ensure that all Input_Arguments
-- (or Unknown_Arguments) are unique.
---------------------------------------------------------------------------
package CBAP is
---------------------------------------------------------------------------
-- Yes, I do realize this is actually vector...
package Argument_Lists is new
Ada.Containers.Indefinite_Vectors (Positive, String);
-- List of all arguments (before first "--" argument) for which callbacks
-- where not registered.
Unknown_Arguments : Argument_Lists.Vector := Argument_Lists.Empty_Vector;
-- List of all arguments after first "--" argument.
Input_Arguments : Argument_Lists.Vector := Argument_Lists.Empty_Vector;
-- Argument_Types decides if argument is just a simple value, or a variable
-- with value assigned to it (difference between "--val" and "--var=val")
type Argument_Types is (Value, Variable);
-- Argument is useful mostly for Variable type of arguments.
type Callbacks is not null access procedure (Argument: in String);
---------------------------------------------------------------------------
-- Register callbacks for processing arguments.
-- @Callback : Action to be performed in case appropriate argument is
-- detected.
-- @Called_On : Argument for which callback is to be performed.
-- @Argument_Type : {Value, Variable}. Value is simple argument that needs no
-- additional parsing. Variable is argument of "Arg_Name=Some_Val" form.
-- When callback is triggered, Value is passed to callback as input, in
-- case of Variable it is content of argument after first "=" that is
-- passed to callback.
-- @Case_Sensitive: Whether or not case is significant. When False all forms
-- of argument are treated as if written in lower case.
procedure Register
( Callback : in Callbacks;
Called_On : in String;
Argument_Type : in Argument_Types := Value;
Case_Sensitive: in Boolean := True
);
-- Raised if Called_On contains "=".
Incorrect_Called_On: exception;
---------------------------------------------------------------------------
-- Parse arguments supplied to program, calling callbacks when argument with
-- associated callback is detected.
-- NOTE: Process_Arguments will call callbacks however many times argument
-- with associated callback is called. So if you have callback for "help",
-- then ./program help help help
-- will result in 3 calls to said callback.
procedure Process_Arguments;
---------------------------------------------------------------------------
end CBAP;
| 52.142857 | 80 | 0.562365 |
dfaf24f386daa7e4953b971182ea218ddb65db0c | 1,118 | adb | Ada | bits/src/shift/bitoperations-shift.adb | vasil-sd/ada-tlsf | c30cfaf5f0b87ebb6e4dd479e50b3f9b11381ddd | [
"MIT"
] | 3 | 2020-02-21T15:42:14.000Z | 2020-04-08T09:42:32.000Z | bits/src/shift/bitoperations-shift.adb | vasil-sd/ada-tlsf | c30cfaf5f0b87ebb6e4dd479e50b3f9b11381ddd | [
"MIT"
] | null | null | null | bits/src/shift/bitoperations-shift.adb | vasil-sd/ada-tlsf | c30cfaf5f0b87ebb6e4dd479e50b3f9b11381ddd | [
"MIT"
] | 1 | 2020-02-21T15:29:26.000Z | 2020-02-21T15:29:26.000Z | pragma Ada_2012;
with Interfaces; use Interfaces;
package body BitOperations.Shift with SPARK_Mode => Off is
-----------------
-- Logic_Right --
-----------------
function Logic_Right (Value : Modular; Amount : Natural) return Modular is
(case Modular'Size is
when 1 .. 8 => Modular (Shift_Right (Unsigned_8 (Value), Amount)),
when 9 .. 16 => Modular (Shift_Right (Unsigned_16 (Value), Amount)),
when 17 .. 32 => Modular (Shift_Right (Unsigned_32 (Value), Amount)),
when others => Modular (Shift_Right (Unsigned_64 (Value), Amount)));
----------------
-- Logic_Left --
----------------
function Logic_Left (Value : Modular; Amount : Natural) return Modular is
(case Modular'Size is
when 1 .. 8 => Modular'Mod (Shift_Left (Unsigned_8 (Value), Amount)),
when 9 .. 16 => Modular'Mod (Shift_Left (Unsigned_16 (Value), Amount)),
when 17 .. 32 => Modular'Mod (Shift_Left (Unsigned_32 (Value), Amount)),
when others => Modular'Mod (Shift_Left (Unsigned_64 (Value), Amount)));
end BitOperations.Shift;
| 37.266667 | 82 | 0.599284 |
10a91cafa9cd63fed882430ad15a511083e4c68c | 4,542 | ads | Ada | source/network-streams.ads | reznikmm/network | d94878500ab8d87310eef5b9c88784e1eb53ba38 | [
"MIT"
] | 1 | 2021-01-14T20:52:45.000Z | 2021-01-14T20:52:45.000Z | source/network-streams.ads | reznikmm/network | d94878500ab8d87310eef5b9c88784e1eb53ba38 | [
"MIT"
] | null | null | null | source/network-streams.ads | reznikmm/network | d94878500ab8d87310eef5b9c88784e1eb53ba38 | [
"MIT"
] | null | null | null | -- SPDX-FileCopyrightText: 2021 Max Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
with Ada.Streams;
with League.Strings;
package Network.Streams is
pragma Preelaborate;
------------------
-- Input Stream --
------------------
type Input_Listener is limited interface;
-- Input stream event listener
type Input_Listener_Access is access all Input_Listener'Class
with Storage_Size => 0;
not overriding procedure Closed
(Self : in out Input_Listener;
Error : League.Strings.Universal_String) is null;
-- Called once a Stream is closed.
not overriding procedure Can_Read
(Self : in out Input_Listener) is null;
-- Called once when it's possible to read data again.
type Input_Stream is limited interface;
-- A stream of Stream_Elements (bytes). Initially the stream doesn't have a
-- listener. It's possible to read data after setting a listener to it
-- until the stream is closed.
type Input_Stream_Access is access all Input_Stream'Class
with Storage_Size => 0;
not overriding function Has_Listener
(Self : Input_Stream) return Boolean is abstract;
-- Return True if Set_Listener was called with not null value.
not overriding function Is_Closed
(Self : Input_Stream) return Boolean is abstract;
-- The Stream isn't open yet or already closed.
not overriding procedure Set_Input_Listener
(Self : in out Input_Stream;
Listener : Input_Listener_Access) is abstract;
-- Assign event listener
not overriding procedure Read
(Self : in out Input_Stream;
Data : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset) is abstract
with Pre'Class => Self.Has_Listener and not Self.Is_Closed;
-- Last is set to index of the last read element. If Last < Data'First it
-- means an incomplete operation, Can_Read notification will be called once
-- operation can be continued. It's not possible to read date before a
-- listener assigned or after the stream is closed.
not overriding procedure Close (Self : in out Input_Stream) is abstract
with Pre'Class => not Self.Is_Closed,
Post'Class => Self.Is_Closed;
-- Close the Stream
-------------------
-- Output Stream --
-------------------
type Output_Listener is limited interface;
-- Output Stream event listener
type Output_Listener_Access is access all Output_Listener'Class
with Storage_Size => 0;
not overriding procedure Closed
(Self : in out Output_Listener;
Error : League.Strings.Universal_String) is null;
-- Called once a Stream is closed.
not overriding procedure Can_Write
(Self : in out Output_Listener) is null;
-- Called once when it's possible to write data again.
type Output_Stream is limited interface;
-- A stream of Stream_Elements (bytes). Initially the stream doesn't have a
-- listener. It's possible to write data after setting a listener to it
-- until the stream is closed.
type Output_Stream_Access is access all Output_Stream'Class
with Storage_Size => 0;
not overriding function Has_Listener
(Self : Output_Stream) return Boolean is abstract;
-- Return True if Set_Listener was called with not null value.
not overriding function Is_Closed
(Self : Output_Stream) return Boolean is abstract;
-- The Stream isn't open yet or already closed.
not overriding procedure Set_Output_Listener
(Self : in out Output_Stream;
Listener : Output_Listener_Access) is abstract;
-- Assign event listener
not overriding procedure Write
(Self : in out Output_Stream;
Data : Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset) is abstract
with Pre'Class => Self.Has_Listener and not Self.Is_Closed;
-- Last is set to index of the last element to be written. If Last <
-- Data'Last it means an incomplete operation, Can_Write notification will
-- be called once operation can be continued. Application is responsible
-- to call this subprogram again for remaining data. It's not possible to
-- read date before a listener assigned or after the stream is closed.
not overriding procedure Close (Self : in out Output_Stream) is abstract
with Pre'Class => not Self.Is_Closed,
Post'Class => Self.Is_Closed;
-- Close the Stream
end Network.Streams;
| 36.336 | 79 | 0.693307 |
df8efeed311f28cdd250f83fe7938a642d3877d7 | 6,076 | ads | Ada | 3-mid/impact/source/3d/collision/narrowphase/impact-d3-manifold.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/impact/source/3d/collision/narrowphase/impact-d3-manifold.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/impact/source/3d/collision/narrowphase/impact-d3-manifold.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | with impact.d3.Containers,
impact.d3.manifold_Point,
impact.d3.Containers,
ada.containers.Vectors;
package impact.d3.Manifold
--
-- impact.d3.Manifold is a contact point cache, it stays persistent as long as objects are overlapping in the broadphase.
--
-- Those contact points are created by the collision narrow phase.
--
-- The cache can be empty, or hold 1,2,3 or 4 points. Some collision algorithms (GJK) might only add one point at a time.
-- updates/refreshes old contact points, and throw them away if necessary (distance becomes too large)
-- reduces the cache to 4 points. When more then 4 points are added, using following rules:
--
-- - The contact point with deepest penetration is always kept, and it tries to maximuze the area covered by the points
--
-- Note that some pairs of objects might have more then one contact manifold.
--
is
use manifold_Point, Math;
gContactBreakingThreshold : math.Real := 0.02; -- maximum contact breaking and merging threshold
type ContactDestroyedCallback is access function (userPersistentData : in Containers.Any_view) return Boolean;
type ContactProcessedCallback is access function (cp : in manifold_Point.item'Class; body0,
body1 : in Containers.Any_view) return Boolean;
gContactDestroyedCallback : ContactDestroyedCallback;
gContactProcessedCallback : ContactProcessedCallback;
type btContactManifoldTypes is (MIN_CONTACT_MANIFOLD_TYPE, BT_PERSISTENT_MANIFOLD_TYPE);
for btContactManifoldTypes use (MIN_CONTACT_MANIFOLD_TYPE => 1024, -- the enum starts at 1024 to avoid type conflicts with impact.d3.Joint
BT_PERSISTENT_MANIFOLD_TYPE => 1025);
MANIFOLD_CACHE_SIZE : constant := 4;
type Public is tagged
record
m_companionIdA,
m_companionIdB,
m_index1a : Integer := 0;
end record;
type Item is new Public with private;
type View is access all Item'Class;
--- Containers
--
type Views is array (Positive range <>) of View;
package Vectors is new ada.Containers.Vectors (Positive, View);
subtype Vector is Vectors.Vector;
-- type Vector is tagged private;
--
-- function Length (Self : in Vector) return ada.Containers.Count_Type;
--
-- procedure append (Self : in out Vector; New_Item : impact.d3.Manifold.Item'Class;
-- Count : Ada.Containers.Count_Type := 1);
--- Forge
--
function to_Manifold (body0,
body1 : in Containers.Any_view;
unused : in Integer;
contactBreakingThreshold : in Real;
contactProcessingThreshold : in Real) return Item;
procedure destruct (Self : in out Item);
--- Attributes
--
function getBody0 (Self : in Item) return Containers.Any_view;
function getBody1 (Self : in Item) return Containers.Any_view;
procedure setBodies (Self : in out Item; body0,
body1 : in Containers.Any_view);
procedure clearUserCache (Self : in out Item; pt : access manifold_Point.item'Class);
function getNumContacts (Self : in Item) return Integer;
function getContactPoint (Self : in Item; index : in Integer) return manifold_Point.item'Class;
function getContactPoint (Self : access Item; index : in Integer) return access manifold_Point.item'Class;
function getContactBreakingThreshold (Self : in Item) return Real; -- todo: get this margin from the current physics/collision environment
function getContactProcessingThreshold (Self : in Item) return Real;
function getCacheEntry (Self : in Item; newPoint : in manifold_Point.item'Class) return Integer;
function addManifoldPoint (Self : access Item; newPoint : in manifold_Point.item) return Integer;
procedure removeContactPoint (Self : in out Item; index : in Integer);
procedure replaceContactPoint (Self : in out Item; newPoint : in manifold_Point.item;
insertIndex : in Integer);
procedure refreshContactPoints (Self : in out Item; trA, trB : in Transform_3d); -- calculated new worldspace coordinates and depth, and reject points that exceed the collision margin
procedure clearManifold (Self : in out Item);
private
type Item is new Public with
record
m_pointCache : manifold_Points (1 .. MANIFOLD_CACHE_SIZE) := (others => to_manifold_Point);
m_body0, -- These two body pointers can point to the physics rigidbody class.
m_body1 : Containers.Any_view; -- Access to Any'Class will allow any rigidbody class.
m_cachedPoints : Integer := 0;
m_contactBreakingThreshold,
m_contactProcessingThreshold : Real;
end record;
function sortCachedPoints (Self : in Item; pt : in manifold_Point.item'Class) return Integer; -- sort cached points so most isolated points come first
-- function findContactPoint (Self : in impact.d3.Manifold; unUsed : access impact.d3.manifold_Point.impact.d3.manifold_Point;
-- numUnused : in Integer;
-- pt : in impact.d3.manifold_Point.impact.d3.manifold_Point) return Integer;
-- package Vectors is new ada.containers.Vectors (Positive, Item);
-- type Vector is new Vectors.Vector with null record;
-- function Length (Self : in Vector) return ada.Containers.Count_Type
-- renames Vectors.Length;
end impact.d3.Manifold;
| 34.327684 | 190 | 0.628539 |
3920a7968b662286a985c25c00ad3d0c940db9bb | 1,397 | ads | Ada | ada-strings-utf_encoding.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 15 | 2018-07-08T07:09:19.000Z | 2021-11-21T09:58:55.000Z | ada-strings-utf_encoding.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 4 | 2019-11-17T20:04:33.000Z | 2021-08-29T21:24:55.000Z | ada-strings-utf_encoding.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 3 | 2020-04-23T11:17:11.000Z | 2021-08-29T19:31:09.000Z | -- Standard Ada library specification
-- Copyright (c) 2004-2016 AXE Consultants
-- Copyright (c) 2004, 2005, 2006 Ada-Europe
-- Copyright (c) 2000 The MITRE Corporation, Inc.
-- Copyright (c) 1992, 1993, 1994, 1995 Intermetrics, Inc.
-- SPDX-License-Identifier: BSD-3-Clause and LicenseRef-AdaReferenceManual
---------------------------------------------------------------------------
package Ada.Strings.UTF_Encoding is
pragma Pure (UTF_Encoding);
-- Declarations common to the string encoding packages
type Encoding_Scheme is (UTF_8, UTF_16BE, UTF_16LE);
subtype UTF_String is String;
subtype UTF_8_String is String;
subtype UTF_16_Wide_String is Wide_String;
Encoding_Error : exception;
BOM_8 : constant UTF_8_String :=
Character'Val(16#EF#) &
Character'Val(16#BB#) &
Character'Val(16#BF#);
BOM_16BE : constant UTF_String :=
Character'Val(16#FE#) &
Character'Val(16#FF#);
BOM_16LE : constant UTF_String :=
Character'Val(16#FF#) &
Character'Val(16#FE#);
BOM_16 : constant UTF_16_Wide_String :=
(1 => Wide_Character'Val(16#FEFF#));
function Encoding (Item : UTF_String;
Default : Encoding_Scheme := UTF_8)
return Encoding_Scheme;
end Ada.Strings.UTF_Encoding;
| 31.75 | 75 | 0.596994 |
10b33e9cb3c7a9dc8ddb033a1e2dfa702db05053 | 1,310 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/a-nlelfu.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/ada/a-nlelfu.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/a-nlelfu.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- ADA.NUMERICS.LONG_ELEMENTARY_FUNCTIONS --
-- --
-- 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_Elementary_Functions;
package Ada.Numerics.Long_Elementary_Functions is
new Ada.Numerics.Generic_Elementary_Functions (Long_Float);
pragma Pure (Long_Elementary_Functions);
| 59.545455 | 78 | 0.361832 |
0ec3aa9ae00b07d3ca6ef52a322ca44f58ac37ad | 26,922 | adb | Ada | .emacs.d/elpa/wisi-3.0.1/wisitoken-parse-lr.adb | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/wisi-3.0.1/wisitoken-parse-lr.adb | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/wisi-3.0.1/wisitoken-parse-lr.adb | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | -- Abstract :
--
-- See spec.
--
-- Copyright (C) 2013-2015, 2017, 2018, 2019 Free Software Foundation, Inc.
--
-- This file is part of the WisiToken package.
--
-- The WisiToken package is free software; you can redistribute it
-- and/or modify it under the terms of the GNU General Public License
-- as published by the Free Software Foundation; either version 3, or
-- (at your option) any later version. The WisiToken package is
-- distributed in the hope that it will be useful, but WITHOUT ANY
-- WARRANTY; without even the implied warranty of MERCHANTABILITY or
-- FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
-- License for more details. You should have received a copy of the
-- GNU General Public License distributed with the WisiToken package;
-- see file GPL.txt. If not, write to the Free Software Foundation,
-- 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
--
-- As a special exception, if other files instantiate generics from
-- this unit, or you link this unit with other files to produce an
-- executable, this unit does not by itself cause the resulting
-- executable to be covered by the GNU General Public License. This
-- exception does not however invalidate any other reasons why the
-- executable file might be covered by the GNU Public License.
pragma License (GPL);
with Ada.Exceptions;
with Ada.Strings.Maps;
with Ada.Strings.Fixed;
with Ada.Text_IO;
with GNATCOLL.Mmap;
package body WisiToken.Parse.LR is
----------
-- Public subprograms, declaration order
function Image (Item : in Parse_Action_Rec; Descriptor : in WisiToken.Descriptor) return String
is
use Ada.Containers;
begin
case Item.Verb is
when Shift =>
return "(Shift," & State_Index'Image (Item.State) & ")";
when Reduce =>
return "(Reduce," & Count_Type'Image (Item.Token_Count) & ", " &
Image (Item.Production.LHS, Descriptor) & "," & Trimmed_Image (Item.Production.RHS) & ")";
when Accept_It =>
return "(Accept It)";
when Error =>
return "(Error)";
end case;
end Image;
procedure Put (Trace : in out WisiToken.Trace'Class; Item : in Parse_Action_Rec)
is
use Ada.Containers;
begin
case Item.Verb is
when Shift =>
Trace.Put ("shift and goto state" & State_Index'Image (Item.State), Prefix => False);
when Reduce =>
Trace.Put
("reduce" & Count_Type'Image (Item.Token_Count) & " tokens to " &
Image (Item.Production.LHS, Trace.Descriptor.all),
Prefix => False);
when Accept_It =>
Trace.Put ("accept it", Prefix => False);
when Error =>
Trace.Put ("ERROR", Prefix => False);
end case;
end Put;
function Equal (Left, Right : in Parse_Action_Rec) return Boolean
is
use all type Ada.Containers.Count_Type;
begin
if Left.Verb = Right.Verb then
case Left.Verb is
when Shift =>
return Left.State = Right.State;
when Reduce | Accept_It =>
return Left.Production.LHS = Right.Production.LHS and Left.Token_Count = Right.Token_Count;
when Error =>
return True;
end case;
else
return False;
end if;
end Equal;
function Is_In (Item : in Parse_Action_Rec; List : in Parse_Action_Node_Ptr) return Boolean
is
Node : Parse_Action_Node_Ptr := List;
begin
loop
exit when Node = null;
if Equal (Item, Node.Item) then
return True;
end if;
Node := Node.Next;
end loop;
return False;
end Is_In;
function Compare (Left, Right : in Token_ID) return SAL.Compare_Result
is begin
if Left < Right then
return SAL.Less;
elsif Left = Right then
return SAL.Equal;
else
return SAL.Greater;
end if;
end Compare;
procedure Add
(List : in out Action_Arrays.Vector;
Symbol : in Token_ID;
Action : in Parse_Action_Rec)
is begin
declare
Node : constant Action_Arrays.Find_Reference_Type := List.Find (Symbol);
begin
if Node.Element /= null then
declare
I : Parse_Action_Node_Ptr := Node.Element.Actions;
begin
loop
exit when I.Next = null;
I := I.Next;
end loop;
I.Next := new Parse_Action_Node'(Action, null);
return;
end;
end if;
end;
List.Insert ((Symbol, new Parse_Action_Node'(Action, null)));
end Add;
function To_Vector (Item : in Kernel_Info_Array) return Kernel_Info_Arrays.Vector
is begin
return Result : Kernel_Info_Arrays.Vector do
Result.Set_First_Last (Item'First, Item'Last);
for I in Item'Range loop
Result (I) := Item (I);
end loop;
end return;
end To_Vector;
function Strict_Image (Item : in Kernel_Info) return String
is begin
return "(" & Trimmed_Image (Item.LHS) & "," & Token_ID'Image (Item.Before_Dot) & "," &
Ada.Containers.Count_Type'Image (Item.Length_After_Dot) & ", " &
(if Item.Recursive then "True" else "False") & ")";
end Strict_Image;
function Strict_Image (Item : in Minimal_Action) return String
is begin
case Item.Verb is
when Shift =>
return "(Shift," & Token_ID'Image (Item.ID) & "," & State_Index'Image (Item.State) & ")";
when Reduce =>
return "(Reduce," & Token_ID'Image (Item.Nonterm) & "," &
Ada.Containers.Count_Type'Image (Item.Token_Count) & ")";
end case;
end Strict_Image;
function Image (Item : in Minimal_Action; Descriptor : in WisiToken.Descriptor) return String
is begin
case Item.Verb is
when Shift =>
return "Shift " & Image (Item.ID, Descriptor);
when Reduce =>
return "Reduce to " & Image (Item.Nonterm, Descriptor);
end case;
end Image;
function To_Vector (Item : in Minimal_Action_Array) return Minimal_Action_Arrays.Vector
is begin
return Result : Minimal_Action_Arrays.Vector do
Result.Set_First_Last (Item'First, Item'Last);
for I in Item'Range loop
Result.Replace_Element (I, Item (I));
end loop;
end return;
end To_Vector;
procedure Add_Action
(State : in out LR.Parse_State;
Symbol : in Token_ID;
State_Index : in WisiToken.State_Index)
is begin
Add (State.Action_List, Symbol, (Shift, State_Index));
end Add_Action;
procedure Add_Action
(State : in out LR.Parse_State;
Symbol : in Token_ID;
Verb : in LR.Parse_Action_Verbs;
Production : in Production_ID;
RHS_Token_Count : in Ada.Containers.Count_Type;
Semantic_Action : in WisiToken.Syntax_Trees.Semantic_Action;
Semantic_Check : in Semantic_Checks.Semantic_Check)
is
Action : constant Parse_Action_Rec :=
(case Verb is
when Reduce => (Reduce, Production, Semantic_Action, Semantic_Check, RHS_Token_Count),
when Accept_It => (Accept_It, Production, Semantic_Action, Semantic_Check, RHS_Token_Count),
when others => raise SAL.Programmer_Error);
begin
Add (State.Action_List, Symbol, Action);
end Add_Action;
procedure Add_Action
(State : in out Parse_State;
Symbols : in Token_ID_Array;
Production : in Production_ID;
RHS_Token_Count : in Ada.Containers.Count_Type;
Semantic_Action : in WisiToken.Syntax_Trees.Semantic_Action;
Semantic_Check : in WisiToken.Semantic_Checks.Semantic_Check)
is begin
-- We assume WisiToken.BNF.Output_Ada_Common.Duplicate_Reduce is True
-- for this state; no conflicts, all the same action.
for Symbol of Symbols loop
Add_Action
(State, Symbol, Reduce, Production, RHS_Token_Count,
Semantic_Action, Semantic_Check);
end loop;
end Add_Action;
procedure Add_Conflict
(State : in out LR.Parse_State;
Symbol : in Token_ID;
Reduce_Production : in Production_ID;
RHS_Token_Count : in Ada.Containers.Count_Type;
Semantic_Action : in WisiToken.Syntax_Trees.Semantic_Action;
Semantic_Check : in Semantic_Checks.Semantic_Check)
is
Conflict : constant Parse_Action_Rec :=
(Reduce, Reduce_Production, Semantic_Action, Semantic_Check, RHS_Token_Count);
Ref : constant Action_Arrays.Find_Reference_Constant_Type := State.Action_List.Find_Constant (Symbol);
Node : Parse_Action_Node_Ptr := Ref.Actions;
begin
loop
exit when Node.Next = null;
Node := Node.Next;
end loop;
Node.Next := new Parse_Action_Node'(Conflict, null);
end Add_Conflict;
procedure Add_Goto
(State : in out LR.Parse_State;
Symbol : in Token_ID;
To_State : in State_Index)
is begin
State.Goto_List.Insert ((Symbol, To_State));
end Add_Goto;
function Goto_For
(Table : in Parse_Table;
State : in State_Index;
ID : in Token_ID)
return Unknown_State_Index
is
Ref : constant Goto_Arrays.Find_Reference_Constant_Type := Table.States (State).Goto_List.Find_Constant (ID);
begin
if Ref.Element = null then
-- We can only get here during error recovery.
return Unknown_State;
else
return Ref.State;
end if;
end Goto_For;
function Action_For
(Table : in Parse_Table;
State : in State_Index;
ID : in Token_ID)
return Parse_Action_Node_Ptr
is
Ref : constant Action_Arrays.Find_Reference_Constant_Type := Table.States (State).Action_List.Find_Constant (ID);
begin
if Ref.Element = null then
return Table.Error_Action;
end if;
return Ref.Actions;
end Action_For;
function Expecting (Table : in Parse_Table; State : in State_Index) return Token_ID_Set
is
Result : Token_ID_Set := (Table.First_Terminal .. Table.Last_Terminal => False);
begin
for Action of Table.States (State).Action_List loop
Result (Action.Symbol) := True;
end loop;
return Result;
end Expecting;
procedure Free_Table (Table : in out Parse_Table_Ptr)
is
procedure Free is new Ada.Unchecked_Deallocation (Parse_Table, Parse_Table_Ptr);
Parse_Action : Parse_Action_Node_Ptr;
Temp_Parse_Action : Parse_Action_Node_Ptr;
begin
if Table = null then
return;
end if;
for State of Table.States loop
for Action of State.Action_List loop
Parse_Action := Action.Actions;
loop
exit when Parse_Action = null;
Temp_Parse_Action := Parse_Action;
Parse_Action := Parse_Action.Next;
Free (Temp_Parse_Action);
end loop;
end loop;
end loop;
Free (Table);
end Free_Table;
function Get_Text_Rep
(File_Name : in String;
McKenzie_Param : in McKenzie_Param_Type;
Actions : in Semantic_Action_Array_Arrays.Vector)
return Parse_Table_Ptr
is
use Ada.Text_IO;
File : GNATCOLL.Mmap.Mapped_File;
Region : GNATCOLL.Mmap.Mapped_Region;
Buffer : GNATCOLL.Mmap.Str_Access;
Buffer_Abs_Last : Integer; -- Buffer'Last, except Buffer has no bounds
Buffer_Last : Integer := 0; -- Last char read from Buffer
Delimiters : constant Ada.Strings.Maps.Character_Set := Ada.Strings.Maps.To_Set (" ;" & ASCII.LF);
function Check_Semicolon return Boolean
is begin
if Buffer (Buffer_Last) = ';' then
-- There is a space, newline, or newline and space after ';'. Leave
-- Buffer_Last on newline for Check_New_Line.
Buffer_Last := Buffer_Last + 1;
return True;
else
return False;
end if;
end Check_Semicolon;
procedure Check_Semicolon
is begin
if Buffer (Buffer_Last) = ';' then
-- There is a space, newline, or newline and space after ';'. Leave
-- Buffer_Last on newline for Check_New_Line.
Buffer_Last := Buffer_Last + 1;
else
raise SAL.Programmer_Error with Error_Message
(File_Name, 1, Ada.Text_IO.Count (Buffer_Last),
"expecting semicolon, found '" & Buffer (Buffer_Last) & "'");
end if;
end Check_Semicolon;
function Check_EOI return Boolean
is begin
return Buffer_Last >= Buffer_Abs_Last;
end Check_EOI;
procedure Check_New_Line
is
use Ada.Strings.Maps;
begin
if Buffer (Buffer_Last) = ASCII.LF then
-- There is a space or semicolon after some newlines.
if Is_In (Buffer (Buffer_Last + 1), Delimiters) then
Buffer_Last := Buffer_Last + 1;
end if;
else
raise SAL.Programmer_Error with Error_Message
(File_Name, 1, Ada.Text_IO.Count (Buffer_Last),
"expecting new_line, found '" & Buffer (Buffer_Last) & "'");
end if;
end Check_New_Line;
type Buffer_Region is record
First : Integer;
Last : Integer;
end record;
function Next_Value return Buffer_Region;
pragma Inline (Next_Value);
function Next_Value return Buffer_Region
is
use Ada.Strings.Fixed;
First : constant Integer := Buffer_Last + 1;
begin
Buffer_Last := Index (Buffer.all, Delimiters, First);
return (First, Buffer_Last - 1);
end Next_Value;
procedure Raise_Gen_Next_Value_Constraint_Error (Name : String; Region : Buffer_Region);
pragma No_Return (Raise_Gen_Next_Value_Constraint_Error);
procedure Raise_Gen_Next_Value_Constraint_Error (Name : String; Region : Buffer_Region)
is begin
-- Factored out from Gen_Next_Value to make Inline efficient.
raise SAL.Programmer_Error with Error_Message
(File_Name, 1, Ada.Text_IO.Count (Region.First),
"expecting " & Name & ", found '" & Buffer (Region.First .. Region.Last) & "'");
end Raise_Gen_Next_Value_Constraint_Error;
generic
type Value_Type is (<>);
Name : in String;
function Gen_Next_Value return Value_Type;
pragma Inline (Gen_Next_Value);
function Gen_Next_Value return Value_Type
is
Region : constant Buffer_Region := Next_Value;
begin
return Value_Type'Value (Buffer (Region.First .. Region.Last));
exception
when Constraint_Error =>
Raise_Gen_Next_Value_Constraint_Error (Name, Region);
end Gen_Next_Value;
function Next_State_Index is new Gen_Next_Value (State_Index, "State_Index");
function Next_Token_ID is new Gen_Next_Value (Token_ID, "Token_ID");
function Next_Integer is new Gen_Next_Value (Integer, "Integer");
function Next_Parse_Action_Verbs is new Gen_Next_Value (Parse_Action_Verbs, "Parse_Action_Verbs");
function Next_Boolean is new Gen_Next_Value (Boolean, "Boolean");
function Next_Count_Type is new Gen_Next_Value (Ada.Containers.Count_Type, "Count_Type");
begin
File := GNATCOLL.Mmap.Open_Read (File_Name);
Region := GNATCOLL.Mmap.Read (File);
Buffer := GNATCOLL.Mmap.Data (Region);
Buffer_Abs_Last := GNATCOLL.Mmap.Last (Region);
declare
use Ada.Containers;
-- We don't read the discriminants in the aggregate, because
-- aggregate evaluation order is not guaranteed.
State_First : constant State_Index := Next_State_Index;
State_Last : constant State_Index := Next_State_Index;
First_Terminal : constant Token_ID := Next_Token_ID;
Last_Terminal : constant Token_ID := Next_Token_ID;
First_Nonterminal : constant Token_ID := Next_Token_ID;
Last_Nonterminal : constant Token_ID := Next_Token_ID;
Table : constant Parse_Table_Ptr := new Parse_Table
(State_First, State_Last, First_Terminal, Last_Terminal, First_Nonterminal, Last_Nonterminal);
begin
Check_New_Line;
Table.McKenzie_Param := McKenzie_Param;
for State of Table.States loop
declare
Actions_Done : Boolean := False;
begin
State.Action_List.Set_Capacity (Next_Count_Type);
loop
declare
Node_I : Action_Node;
Node_J : Parse_Action_Node_Ptr := new Parse_Action_Node;
Action_Done : Boolean := False;
Verb : Parse_Action_Verbs;
begin
Node_I.Actions := Node_J;
loop
Verb := Next_Parse_Action_Verbs;
Node_J.Item :=
(case Verb is
when Shift => (Verb => Shift, others => <>),
when Reduce => (Verb => Reduce, others => <>),
when Accept_It => (Verb => Accept_It, others => <>),
when Error => (Verb => Error));
case Verb is
when Shift =>
Node_J.Item.State := Next_State_Index;
when Reduce | Accept_It =>
Node_J.Item.Production.LHS := Next_Token_ID;
Node_J.Item.Production.RHS := Next_Integer;
if Next_Boolean then
Node_J.Item.Action := Actions
(Node_J.Item.Production.LHS)(Node_J.Item.Production.RHS).Action;
else
Node_J.Item.Action := null;
end if;
if Next_Boolean then
Node_J.Item.Check := Actions
(Node_J.Item.Production.LHS)(Node_J.Item.Production.RHS).Check;
else
Node_J.Item.Check := null;
end if;
Node_J.Item.Token_Count := Next_Count_Type;
when Error =>
raise SAL.Programmer_Error;
end case;
if Check_Semicolon then
Action_Done := True;
Node_I.Symbol := Next_Token_ID;
if Check_Semicolon then
Actions_Done := True;
end if;
end if;
exit when Action_Done;
Node_J.Next := new Parse_Action_Node;
Node_J := Node_J.Next;
end loop;
Check_New_Line;
State.Action_List.Insert (Node_I);
end;
exit when Actions_Done;
end loop;
end;
if Check_Semicolon then
-- No Gotos
null;
else
State.Goto_List.Set_Capacity (Next_Count_Type);
declare
Node : Goto_Node;
begin
loop
Node.Symbol := Next_Token_ID;
Node.State := Next_State_Index;
State.Goto_List.Insert (Node);
exit when Check_Semicolon;
end loop;
end;
end if;
Check_New_Line;
declare
First : constant Count_Type := Next_Count_Type;
Last : constant Integer := Next_Integer;
begin
if Last = -1 then
-- State.Kernel not set for state 0
null;
else
State.Kernel.Set_First_Last (First, Count_Type (Last));
for I in State.Kernel.First_Index .. State.Kernel.Last_Index loop
State.Kernel (I).LHS := Next_Token_ID;
State.Kernel (I).Before_Dot := Next_Token_ID;
State.Kernel (I).Length_After_Dot := Next_Count_Type;
end loop;
end if;
end;
Check_New_Line;
if Check_Semicolon then
-- No minimal action
null;
else
declare
First : constant Count_Type := Next_Count_Type;
Last : constant Count_Type := Next_Count_Type;
begin
State.Minimal_Complete_Actions.Set_First_Last (First, Last);
end;
for I in State.Minimal_Complete_Actions.First_Index .. State.Minimal_Complete_Actions.Last_Index loop
declare
Verb : constant Minimal_Verbs := Next_Parse_Action_Verbs;
ID : Token_ID;
Action_State : State_Index;
Count : Ada.Containers.Count_Type;
begin
case Verb is
when Shift =>
ID := Next_Token_ID;
Action_State := Next_State_Index;
State.Minimal_Complete_Actions.Replace_Element (I, (Shift, ID, Action_State));
when Reduce =>
ID := Next_Token_ID;
Count := Next_Count_Type;
State.Minimal_Complete_Actions.Replace_Element (I, (Reduce, ID, Count));
end case;
end;
end loop;
Check_Semicolon;
end if;
Check_New_Line;
exit when Check_EOI;
end loop;
Table.Error_Action := new Parse_Action_Node'((Verb => Error), null);
return Table;
end;
exception
when Name_Error =>
raise User_Error with "parser table text file '" & File_Name & "' not found.";
when SAL.Programmer_Error =>
raise;
when E : others =>
raise SAL.Programmer_Error with Error_Message
(File_Name, 1, Ada.Text_IO.Count (Buffer_Last),
Ada.Exceptions.Exception_Name (E) & ": " & Ada.Exceptions.Exception_Message (E));
end Get_Text_Rep;
function Compare (Left, Right : in Insert_Delete_Op) return SAL.Compare_Result
is
Left_Token_Index : constant WisiToken.Token_Index :=
(case Insert_Delete_Op_Label'(Left.Op) is
when Insert => Left.Ins_Token_Index,
when Delete => Left.Del_Token_Index);
Right_Token_Index : constant WisiToken.Token_Index :=
(case Insert_Delete_Op_Label'(Right.Op) is
when Insert => Right.Ins_Token_Index,
when Delete => Right.Del_Token_Index);
begin
if Left_Token_Index < Right_Token_Index then
return SAL.Less;
elsif Left_Token_Index = Right_Token_Index then
return SAL.Equal;
else
return SAL.Greater;
end if;
end Compare;
function Equal (Left : in Config_Op; Right : in Insert_Op) return Boolean
is begin
return Left.Op = Insert and then
Left.Ins_ID = Right.Ins_ID and then
Left.Ins_Token_Index = Right.Ins_Token_Index;
end Equal;
function None (Ops : aliased in Config_Op_Arrays.Vector; Op : in Config_Op_Label) return Boolean
is
use Config_Op_Arrays, Config_Op_Array_Refs;
begin
for I in First_Index (Ops) .. Last_Index (Ops) loop
if Constant_Ref (Ops, I).Op /= Op then
return False;
end if;
end loop;
return True;
end None;
function None_Since_FF (Ops : aliased in Config_Op_Arrays.Vector; Op : in Config_Op_Label) return Boolean
is
use Config_Op_Arrays, Config_Op_Array_Refs;
begin
for I in reverse First_Index (Ops) .. Last_Index (Ops) loop
declare
O : Config_Op renames Constant_Ref (Ops, I);
begin
exit when O.Op = Fast_Forward;
if O.Op = Op then
return False;
end if;
end;
end loop;
return True;
end None_Since_FF;
function Only_Since_FF (Ops : aliased in Config_Op_Arrays.Vector; Op : in Config_Op_Label) return Boolean
is
use Config_Op_Arrays, Config_Op_Array_Refs;
use all type Ada.Containers.Count_Type;
begin
if Length (Ops) = 0 or else Constant_Ref (Ops, Last_Index (Ops)).Op /= Op then
return False;
else
for I in reverse First_Index (Ops) .. Last_Index (Ops) loop
declare
O : Config_Op renames Constant_Ref (Ops, I);
begin
exit when O.Op = Fast_Forward;
if O.Op /= Op then
return False;
end if;
end;
end loop;
return True;
end if;
end Only_Since_FF;
function Any (Ops : aliased in Config_Op_Arrays.Vector; Op : in Config_Op_Label) return Boolean
is
use Config_Op_Arrays, Config_Op_Array_Refs;
begin
for I in First_Index (Ops) .. Last_Index (Ops) loop
declare
O : Config_Op renames Constant_Ref (Ops, I);
begin
if O.Op = Op then
return True;
end if;
end;
end loop;
return False;
end Any;
function Valid_Tree_Indices (Stack : in Recover_Stacks.Stack; Depth : in SAL.Base_Peek_Type) return Boolean
is
use all type WisiToken.Syntax_Trees.Node_Index;
begin
for I in 1 .. Depth loop
if Stack.Peek (I).Tree_Index = Syntax_Trees.Invalid_Node_Index then
return False;
end if;
end loop;
return True;
end Valid_Tree_Indices;
procedure Set_Key (Item : in out Configuration; Key : in Integer)
is begin
Item.Cost := Key;
end Set_Key;
procedure Accumulate (Data : in McKenzie_Data; Counts : in out Strategy_Counts)
is
procedure Proc (Config : in Configuration)
is begin
for I in Config.Strategy_Counts'Range loop
Counts (I) := Counts (I) + Config.Strategy_Counts (I);
end loop;
end Proc;
begin
Data.Results.Process (Proc'Unrestricted_Access);
end Accumulate;
end WisiToken.Parse.LR;
| 35.564069 | 119 | 0.583203 |
234338b31faf29be41d258fa8ad1d5391e5f5dfe | 4,697 | adb | Ada | source/textio/a-tifiio.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/textio/a-tifiio.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/textio/a-tifiio.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | with Ada.Text_IO.Formatting;
with System.Formatting.Fixed;
with System.Formatting.Float;
with System.Formatting.Literals.Float;
package body Ada.Text_IO.Fixed_IO is
procedure Put_To_Field (
To : out String;
Fore_Last, Last : out Natural;
Item : Num;
Aft : Field;
Exp : Field);
procedure Put_To_Field (
To : out String;
Fore_Last, Last : out Natural;
Item : Num;
Aft : Field;
Exp : Field)
is
Triming_Sign_Marks : constant System.Formatting.Sign_Marks :=
('-', System.Formatting.No_Sign, System.Formatting.No_Sign);
Aft_Width : constant Field := Field'Max (1, Aft);
begin
if Exp /= 0 then
System.Formatting.Float.Image (
Long_Long_Float (Item),
To,
Fore_Last,
Last,
Signs => Triming_Sign_Marks,
Aft_Width => Aft_Width,
Exponent_Digits_Width => Exp - 1); -- excluding '.'
else
System.Formatting.Fixed.Image (
Long_Long_Float (Item),
To,
Fore_Last,
Last,
Signs => Triming_Sign_Marks,
Aft_Width => Aft_Width);
end if;
end Put_To_Field;
procedure Get_From_Field (
From : String;
Item : out Num;
Last : out Positive);
procedure Get_From_Field (
From : String;
Item : out Num;
Last : out Positive)
is
Base_Item : Long_Long_Float;
Error : Boolean;
begin
System.Formatting.Literals.Float.Get_Literal (
From,
Last,
Base_Item,
Error => Error);
if Error
or else Base_Item not in
Long_Long_Float (Num'First) .. Long_Long_Float (Num'Last)
then
raise Data_Error;
end if;
Item := Num (Base_Item);
end Get_From_Field;
-- implementation
procedure Get (
File : File_Type;
Item : out Num;
Width : Field := 0) is
begin
if Width /= 0 then
declare
S : String (1 .. Width);
Last_1 : Natural;
Last_2 : Natural;
begin
Formatting.Get_Field (File, S, Last_1); -- checking the predicate
Get_From_Field (S (1 .. Last_1), Item, Last_2);
if Last_2 /= Last_1 then
raise Data_Error;
end if;
end;
else
declare
S : constant String :=
Formatting.Get_Numeric_Literal (
File, -- checking the predicate
Real => True);
Last : Natural;
begin
Get_From_Field (S, Item, Last);
if Last /= S'Last then
raise Data_Error;
end if;
end;
end if;
end Get;
procedure Get (
Item : out Num;
Width : Field := 0) is
begin
Get (Current_Input.all, Item, Width);
end Get;
procedure Get (
File : not null File_Access;
Item : out Num;
Width : Field := 0) is
begin
Get (File.all, Item, Width);
end Get;
procedure Put (
File : File_Type;
Item : Num;
Fore : Field := Default_Fore;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp)
is
S : String (
1 ..
Integer'Max (Num'Width, Long_Long_Float'Width) + Aft + Exp);
Fore_Last, Last : Natural;
begin
Put_To_Field (S, Fore_Last, Last, Item, Aft, Exp);
Formatting.Tail (
File, -- checking the predicate
S (1 .. Last),
Last - Fore_Last + Fore);
end Put;
procedure Put (
Item : Num;
Fore : Field := Default_Fore;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp) is
begin
Put (Current_Output.all, Item, Fore, Aft, Exp);
end Put;
procedure Put (
File : not null File_Access;
Item : Num;
Fore : Field := Default_Fore;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp) is
begin
Put (File.all, Item, Fore, Aft, Exp);
end Put;
procedure Get (
From : String;
Item : out Num;
Last : out Positive) is
begin
Formatting.Get_Tail (From, First => Last);
Get_From_Field (From (Last .. From'Last), Item, Last);
end Get;
procedure Put (
To : out String;
Item : Num;
Aft : Field := Default_Aft;
Exp : Field := Default_Exp)
is
S : String (
1 ..
Integer'Max (Num'Width, Long_Long_Float'Width) + Aft + Exp);
Fore_Last, Last : Natural;
begin
Put_To_Field (S, Fore_Last, Last, Item, Aft, Exp);
Formatting.Tail (To, S (1 .. Last));
end Put;
end Ada.Text_IO.Fixed_IO;
| 25.666667 | 77 | 0.541409 |
df470d6e9a7e8841ba5ec703a91ce88e33958026 | 11,098 | ads | Ada | runtime/ravenscar-sfp-stm32f427/math/s-libm.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 12 | 2017-06-08T14:19:57.000Z | 2022-03-09T02:48:59.000Z | runtime/ravenscar-sfp-stm32f427/math/s-libm.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 6 | 2017-06-08T13:13:50.000Z | 2020-05-15T09:32:43.000Z | runtime/ravenscar-sfp-stm32f427/math/s-libm.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 3 | 2017-06-30T14:05:06.000Z | 2022-02-17T12:20:45.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . L I B M --
-- --
-- S p e c --
-- --
-- Copyright (C) 2014-2015, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This is the Ada Cert Math specific version of s-libm.ads
with Ada.Numerics;
package System.Libm is
pragma Pure;
Ln_2 : constant := 0.69314_71805_59945_30941_72321_21458_17656_80755;
Ln_3 : constant := 1.09861_22886_68109_69139_52452_36922_52570_46474;
Half_Ln_2 : constant := Ln_2 / 2.0;
Inv_Ln_2 : constant := 1.0 / Ln_2;
Half_Pi : constant := Ada.Numerics.Pi / 2.0;
Third_Pi : constant := Ada.Numerics.Pi / 3.0;
Quarter_Pi : constant := Ada.Numerics.Pi / 4.0;
Sixth_Pi : constant := Ada.Numerics.Pi / 6.0;
Max_Red_Trig_Arg : constant := 0.26 * Ada.Numerics.Pi;
-- This constant representing the maximum absolute value of the reduced
-- argument of the approximation functions for Sin, Cos and Tan. A value
-- slightly larger than Pi / 4 is used. The reduction doesn't reduce to
-- an interval strictly within +-Pi / 4, as that would complicate the
-- reduction code.
One_Over_Pi : constant := 1.0 / Ada.Numerics.Pi;
Two_Over_Pi : constant := 2.0 / Ada.Numerics.Pi;
Sqrt_2 : constant := 1.41421_35623_73095_04880_16887_24209_69807_85696;
Sqrt_3 : constant := 1.73205_08075_68877_29352_74463_41505_87236_69428;
Root16_Half : constant := 0.95760_32806_98573_64693_63056_35147_91544;
-- Sixteenth root of 0.5
Sqrt_Half : constant := 0.70710_67811_86547_52440_08443_62104;
subtype Quadrant is Integer range 0 .. 3;
generic
type T is digits <>;
with function Sqrt (X : T) return T is <>;
with function Approx_Asin (X : T) return T is <>;
function Generic_Acos (X : T) return T;
generic
type T is digits <>;
with function Approx_Atan (X : T) return T is <>;
function Generic_Atan2 (Y, X : T) return T;
generic
type T is digits <>;
procedure Generic_Pow_Special_Cases
(Left : T;
Right : T;
Is_Special : out Boolean;
Result : out T);
generic
type T is private;
Mantissa : Positive;
with function "-" (X : T) return T is <>;
with function "+" (X, Y : T) return T is <>;
with function "-" (X, Y : T) return T is <>;
with function "*" (X, Y : T) return T is <>;
with function "/" (X, Y : T) return T is <>;
with function "<=" (X, Y : T) return Boolean is <>;
with function "abs" (X : T) return T is <>;
with function Exact (X : Long_Long_Float) return T is <>;
with function Maximum_Relative_Error (X : T) return Float is <>;
with function Sqrt (X : T) return T is <>;
package Generic_Approximations is
Epsilon : constant Float := 2.0**(1 - Mantissa);
-- The approximations in this package will work well for single
-- precision floating point types.
function Approx_Asin (X : T) return T
with Pre => abs X <= Exact (0.25),
Post => abs Approx_Asin'Result <= Exact (Half_Pi);
-- @llr Approx_Asin
-- The Approx_Asin function shallapproximate the mathematical function
-- arcsin (sqrt (x)) / sqrt (x) - 1.0 on -0.25 .. 0.25.
--
-- Ada accuracy requirements:
-- The approximation MRE shall be XXX T'Model_Epsilon.
function Approx_Atan (X : T) return T
with Pre => abs X <= Exact (Sqrt_3),
Post => abs (Approx_Atan'Result) <= Exact (Half_Pi) and then
Maximum_Relative_Error (Approx_Atan'Result) <= 2.0 * Epsilon;
-- @llr Approx_Atan
-- The Approx_Atan approximates the mathematical inverse tangent on
-- -Sqrt (3) .. Sqrt (3)
--
-- Accuracy requirements:
-- The approximation MRE is XXX T'Model_Epsilon
function Approx_Cos (X : T) return T
with Pre => abs (X) <= Exact (Max_Red_Trig_Arg),
Post => abs (Approx_Cos'Result) <= Exact (1.0)
and then Maximum_Relative_Error (Approx_Cos'Result)
<= 2.0 * Epsilon;
-- @llr Approx_Cos
-- The Approx_Cos approximates the mathematical cosine on
-- -0.26 * Pi .. 0.26 * Pi
--
-- Accuracy requirements:
-- The approximation MRE is XXX T'Model_Epsilon
function Approx_Exp (X : T) return T
with Pre => abs (X) <= Exact (Ln_2 / 2.0),
Post => Exact (0.0) <= Approx_Exp'Result and then
Maximum_Relative_Error (Approx_Exp'Result) <= 2.0 * Epsilon;
-- @llr Approx_Exp
-- The Approx_Exp function approximates the mathematical exponent on
-- -Ln (2.0) / 2.0 .. Ln (2.0) / 2.0
--
-- Accuracy requirements:
-- The approximation MRE is XXX T'Model_Epsilon
function Approx_Exp2 (X : T) return T
with Pre => abs (X) <= Exact (Ln_2 / 2.0),
Post => Exact (0.0) <= Approx_Exp2'Result and then
Maximum_Relative_Error (Approx_Exp2'Result) <= 2.0 * Epsilon;
-- @llr Approx_Exp2
-- The Approx_Exp2 function approximates the mathematical function
-- (x-> 2.0 ** x) on -Ln (2.0) / 2.0 .. Ln (2.0) / 2.0
--
-- Accuracy requirements:
-- The approximation MRE is XXX T'Model_Epsilon
function Approx_Log (X : T) return T
with
Pre => Exact (Sqrt_2 / 2.0) <= X and then
X <= Exact (Sqrt_2),
Post => Maximum_Relative_Error (Approx_Log'Result) <= 2.0 * Epsilon;
-- @llr Approx_Log
-- The Approx_Log function approximates the mathematical logarithm on
-- Sqrt (2.0) /2.0 .. Sqrt (2.0)
--
-- Accuracy requirements:
-- The approximation MRE is XXX T'Model_Epsilon
function Approx_Power_Log (X : T) return T;
-- @llr Approx_Power_Log
-- The Approx_Power_Log approximates the function
-- (x -> Log ((x-1) / (x+1), base => 2)) on the interval
-- TODO
--
-- Accuracy requirements:
-- The approximation MRE is XXX T'Model_Epsilon
function Approx_Sin (X : T) return T
with Pre => (abs X) <= Exact (Max_Red_Trig_Arg),
Post => abs Approx_Sin'Result <= Exact (1.0) and then
Maximum_Relative_Error (Approx_Sin'Result) <= 2.0 * Epsilon;
-- @llr Approx_Sin
-- The Approx_Sin function approximates the mathematical sine on
-- -0.26 * Pi .. 0.26 * Pi
--
-- Ada accuracy requirements:
-- The approximation MRE is XXX T'Model_Epsilon
function Approx_Sinh (X : T) return T
with Pre => True, -- The original X >= 0.0 and X <= 1.0, fails ???
Post => abs Approx_Sinh'Result <= Exact
((Ada.Numerics.e - 1.0 / Ada.Numerics.e) / 2.0)
and then Maximum_Relative_Error (Approx_Sinh'Result)
<= 2.0 * Epsilon;
-- @llr Approx_Sinh
-- The Approx_Sinh function approximates the mathematical hyperbolic
-- sine on XXX
--
-- Accuracy requirements:
-- The approximation MRE is XXX T'Model_Epsilon
function Approx_Tan (X : T) return T
with Pre => abs X <= Exact (Max_Red_Trig_Arg),
Post =>
Maximum_Relative_Error (Approx_Tan'Result) <= 2.0 * Epsilon;
-- @llr Approx_Tan
-- The Approx_Tan function approximates the mathematical tangent on
-- -0.26 * Pi .. 0.26 * Pi
--
-- Accuracy requirements:
-- The approximation MRE is XXX T'Model_Epsilon
function Approx_Cot (X : T) return T
with Pre => abs X <= Exact (Max_Red_Trig_Arg),
Post =>
Maximum_Relative_Error (Approx_Cot'Result) <= 2.0 * Epsilon;
-- @llr Approx_Cot
-- The Approx_Cot function approximates the mathematical cotangent on
-- -0.26 * Pi .. 0.26 * Pi
--
-- Accuracy requirements:
-- The approximation MRE is XXX T'Model_Epsilon
function Approx_Tanh (X : T) return T
with Pre => Exact (0.0) <= X and then X <= Exact (Ln_3 / 2.0),
Post => abs (Approx_Tanh'Result) <= Exact (Half_Pi)
and then Maximum_Relative_Error (Approx_Tanh'Result)
<= 2.0 * Epsilon;
-- @llr Approx_Tanh
-- The Approx_Tanh function approximates the mathematical hyperbolic
-- tangent on 0.0 .. Ln (3.0) / 2.0
--
-- Accuracy requirements:
-- The approximation MRE is XXX T'Model_Epsilon
function Asin (X : T) return T
with Pre => abs X <= Exact (1.0),
Post => Maximum_Relative_Error (Asin'Result) <= 400.0 * Epsilon;
-- @llr Asin
-- The Asin function has a maximum relative error of 2 epsilon.
end Generic_Approximations;
end System.Libm;
| 44.931174 | 79 | 0.52568 |
3997797de20eb2b92805b33b2da87955564a202e | 2,338 | ads | Ada | src/lithium-line_parsers.ads | faelys/lithium3 | f167143e2e4d8a968c6608cffe179eb2b05d4c2c | [
"ISC"
] | 1 | 2020-09-10T10:14:35.000Z | 2020-09-10T10:14:35.000Z | src/lithium-line_parsers.ads | faelys/lithium3 | f167143e2e4d8a968c6608cffe179eb2b05d4c2c | [
"ISC"
] | null | null | null | src/lithium-line_parsers.ads | faelys/lithium3 | f167143e2e4d8a968c6608cffe179eb2b05d4c2c | [
"ISC"
] | 1 | 2020-01-06T14:16:55.000Z | 2020-01-06T14:16:55.000Z | ------------------------------------------------------------------------------
-- Copyright (c) 2015-2017, 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. --
------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- Lithium.Line_Parsers provides a stream-based S-expression parser which --
-- reads the input stream line by line, to allow mixed content. --
------------------------------------------------------------------------------
with Ada.Streams;
with Natools.S_Expressions.Atom_Buffers;
with Natools.S_Expressions.Parsers;
package Lithium.Line_Parsers is
pragma Preelaborate;
procedure Append_Line
(Line : in out Natools.S_Expressions.Atom_Buffers.Atom_Buffer;
Source : in out Ada.Streams.Root_Stream_Type'Class;
Finished : out Boolean);
type Parser (Source : access Ada.Streams.Root_Stream_Type'Class)
is limited new Natools.S_Expressions.Parsers.Parser with private;
pragma Preelaborable_Initialization (Parser);
overriding procedure Read_More
(Self : in out Parser;
Buffer : out Natools.S_Expressions.Atom_Buffers.Atom_Buffer);
private
type Parser (Source : access Ada.Streams.Root_Stream_Type'Class)
is limited new Natools.S_Expressions.Parsers.Parser with null record;
end Lithium.Line_Parsers;
| 48.708333 | 78 | 0.576989 |
df045cf6ec1eac0c70c3aa2fdd34fd5076d2190a | 6,438 | ads | Ada | source/vampire-forms.ads | ytomino/vampire | 2ff6c93af53e55c89cab70fedb63accba83bcd92 | [
"OpenSSL",
"Unlicense"
] | 1 | 2016-12-19T13:25:14.000Z | 2016-12-19T13:25:14.000Z | source/vampire-forms.ads | ytomino/vampire | 2ff6c93af53e55c89cab70fedb63accba83bcd92 | [
"OpenSSL",
"Unlicense"
] | null | null | null | source/vampire-forms.ads | ytomino/vampire | 2ff6c93af53e55c89cab70fedb63accba83bcd92 | [
"OpenSSL",
"Unlicense"
] | null | null | null | -- The Village of Vampire by YT, このソースコードはNYSLです
with Ada.Calendar;
with Ada.Streams;
with Ada.Strings.Unbounded;
with Web.HTML;
with Tabula.Casts;
with Tabula.Villages;
package Vampire.Forms is
type Base_Page is (Index_Page, User_Page, User_List_Page, Village_Page);
type Template_Set_Type is (For_Full, For_Mobile);
type Root_Form_Type is abstract tagged limited null record;
-- HTML / template set
function HTML_Version (Form : Root_Form_Type) return Web.HTML.HTML_Version is
abstract;
function Template_Set (Form : Root_Form_Type) return Template_Set_Type is
abstract;
-- 出力用
function Self return String;
function Parameters_To_Index_Page (
Form : Root_Form_Type;
User_Id : String;
User_Password : String)
return Web.Query_Strings is abstract;
function Parameters_To_User_Page (
Form : Root_Form_Type;
User_Id : String;
User_Password : String)
return Web.Query_Strings is abstract;
function Parameters_To_Village_Page (
Form : Root_Form_Type;
Village_Id : Villages.Village_Id;
Day : Integer := -1;
First : Tabula.Villages.Speech_Index'Base := -1;
Last : Tabula.Villages.Speech_Index'Base := -1;
Latest : Tabula.Villages.Speech_Positive_Count'Base := -1;
User_Id : String;
User_Password : String)
return Web.Query_Strings is abstract;
function Parameters_To_Base_Page (
Form : Root_Form_Type'Class;
Base_Page : Forms.Base_Page;
Village_Id : Villages.Village_Id;
User_Id : String;
User_Password : String)
return Web.Query_Strings;
procedure Write_Attribute_Name (
Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Name : in String);
procedure Write_Attribute_Open (
Stream : not null access Ada.Streams.Root_Stream_Type'Class);
procedure Write_Attribute_Close (
Stream : not null access Ada.Streams.Root_Stream_Type'Class);
procedure Write_In_HTML (
Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Form : in Root_Form_Type;
Item : in String;
Pre : in Boolean := False) is abstract;
procedure Write_In_Attribute (
Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Form : in Root_Form_Type;
Item : in String) is abstract;
procedure Write_Link (
Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Form : in Root_Form_Type'Class;
Current_Directory : in String;
Resource : in String;
Parameters : in Web.Query_Strings := Web.String_Maps.Empty_Map);
procedure Write_Link_To_Village_Page (
Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Form : in Root_Form_Type'Class;
Current_Directory : in String;
HTML_Directory : in String;
Log : in Boolean;
Village_Id : in Villages.Village_Id;
Day : Integer := -1;
First : Tabula.Villages.Speech_Index'Base := -1;
Last : Tabula.Villages.Speech_Index'Base := -1;
Latest : Tabula.Villages.Speech_Positive_Count'Base := -1;
User_Id : in String;
User_Password : in String);
function Paging (Form : Root_Form_Type) return Boolean is abstract;
function Speeches_Per_Page (Form : Root_Form_Type)
return Tabula.Villages.Speech_Positive_Count'Base is abstract;
-- ユーザー情報
function Get_User_Id (
Form : Root_Form_Type;
Query_Strings : Web.Query_Strings;
Cookie : Web.Cookie)
return String is abstract;
function Get_User_Password (
Form : Root_Form_Type;
Query_Strings : Web.Query_Strings;
Cookie : Web.Cookie)
return String is abstract;
function Get_New_User_Id (
Form : Root_Form_Type'Class;
Inputs : Web.Query_Strings)
return String;
function Get_New_User_Password (
Form : Root_Form_Type'Class;
Inputs : Web.Query_Strings)
return String;
function Get_New_User_Confirmation_Password (
Form : Root_Form_Type'Class;
Inputs : Web.Query_Strings)
return String;
procedure Set_User (
Form : in out Root_Form_Type;
Cookie : in out Web.Cookie;
New_User_Id : in String;
New_User_Password : in String) is abstract;
-- ページ
function Get_Base_Page (
Form : Root_Form_Type'Class;
Query_Strings : Web.Query_Strings;
Cookie : Web.Cookie)
return Base_Page;
-- 個人ページ
function Is_User_Page (
Form : Root_Form_Type;
Query_Strings : Web.Query_Strings;
Cookie : Web.Cookie)
return Boolean is abstract;
function Is_User_List_Page (
Form : Root_Form_Type'Class;
Query_Strings : Web.Query_Strings)
return Boolean;
-- 村
function Get_Village_Id (
Form : Root_Form_Type;
Query_Strings : Web.Query_Strings)
return Villages.Village_Id is abstract;
function Get_Day (
Form : Root_Form_Type;
Village : Villages.Village_Type'Class;
Query_Strings : Web.Query_Strings)
return Natural is abstract;
function Get_Range (
Form : Root_Form_Type;
Village : Villages.Village_Type'Class;
Day : Natural;
Now : Ada.Calendar.Time;
Query_Strings : Web.Query_Strings)
return Villages.Speech_Range_Type is abstract;
-- コマンド
function Get_Command (
Form : Root_Form_Type'Class;
Inputs : Web.Query_Strings)
return String;
function Get_New_Village_Name (
Form : Root_Form_Type;
Inputs : Web.Query_Strings)
return String is abstract;
function Get_Group (
Form : Root_Form_Type;
Inputs : Web.Query_Strings)
return Integer;
type Joining is record
Work_Index : Casts.Works.Cursor; -- "既定"はNo_Element
Name_Index : Casts.People.Cursor; -- No_Elementにはならない
Request : aliased Ada.Strings.Unbounded.Unbounded_String;
end record;
function Get_Joining (
Form : Root_Form_Type;
Inputs : Web.Query_Strings)
return Joining;
type Mark is (Missing, NG, OK);
function Get_Answered (
Form : Root_Form_Type;
Inputs : Web.Query_Strings)
return Mark;
function Get_Text (
Form : Root_Form_Type;
Inputs : Web.Query_Strings)
return String is abstract;
function Get_Reedit_Kind (
Form : Root_Form_Type'Class;
Inputs : Web.Query_Strings)
return String;
function Get_Action (
Form : Root_Form_Type'Class;
Inputs : Web.Query_Strings)
return String;
function Get_Target (
Form : Root_Form_Type'Class;
Inputs : Web.Query_Strings)
return Villages.Person_Index'Base;
function Get_Special (
Form : Root_Form_Type'Class;
Inputs : Web.Query_Strings)
return Boolean;
procedure Set_Rule (
Form : in Root_Form_Type'Class;
Village : in out Villages.Village_Type'Class;
Inputs : in Web.Query_Strings);
private
function Trim_Name (S : String) return String;
function Trim_Text (S : String) return String;
end Vampire.Forms;
| 25.752 | 78 | 0.746194 |
397e690fe553cdba94d3374cb6b0743e681fd99b | 13,167 | ads | Ada | source/asis/spec/ada-strings-wide_wide_unbounded.ads | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | 4 | 2016-02-05T15:51:56.000Z | 2022-03-25T20:38:32.000Z | source/asis/spec/ada-strings-wide_wide_unbounded.ads | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | null | null | null | source/asis/spec/ada-strings-wide_wide_unbounded.ads | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- A d a r u n - t i m e s p e c i f i c a t i o n --
-- ASIS implementation for Gela project, a portable Ada compiler --
-- http://gela.ada-ru.org --
-- - - - - - - - - - - - - - - - --
-- Read copyright and license at the end of ada.ads file --
------------------------------------------------------------------------------
-- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $
with Ada.Strings.Wide_Wide_Maps;
package Ada.Strings.Wide_Wide_Unbounded is
pragma Preelaborate (Wide_Wide_Unbounded);
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 : in 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 : in Wide_Wide_String)
return Unbounded_Wide_Wide_String;
function To_Unbounded_Wide_Wide_String (Length : in Natural)
return Unbounded_Wide_Wide_String;
function To_Wide_Wide_String (Source : in Unbounded_Wide_Wide_String)
return Wide_Wide_String;
procedure Set_Unbounded_Wide_Wide_String
(Target : out Unbounded_Wide_Wide_String;
Source : in Wide_Wide_String);
procedure Append (Source : in out Unbounded_Wide_Wide_String;
New_Item : in Unbounded_Wide_Wide_String);
procedure Append (Source : in out Unbounded_Wide_Wide_String;
New_Item : in Wide_Wide_String);
procedure Append (Source : in out Unbounded_Wide_Wide_String;
New_Item : in Wide_Wide_Character);
function "&" (Left, Right : in Unbounded_Wide_Wide_String)
return Unbounded_Wide_Wide_String;
function "&" (Left : in Unbounded_Wide_Wide_String;
Right : in Wide_Wide_String)
return Unbounded_Wide_Wide_String;
function "&" (Left : in Wide_Wide_String;
Right : in Unbounded_Wide_Wide_String)
return Unbounded_Wide_Wide_String;
function "&" (Left : in Unbounded_Wide_Wide_String;
Right : in Wide_Wide_Character)
return Unbounded_Wide_Wide_String;
function "&" (Left : in Wide_Wide_Character;
Right : in Unbounded_Wide_Wide_String)
return Unbounded_Wide_Wide_String;
function Element (Source : in Unbounded_Wide_Wide_String;
Index : in Positive)
return Wide_Wide_Character;
procedure Replace_Element (Source : in out Unbounded_Wide_Wide_String;
Index : in Positive;
By : in Wide_Wide_Character);
function Slice (Source : in Unbounded_Wide_Wide_String;
Low : in Positive;
High : in Natural)
return Wide_Wide_String;
function Unbounded_Slice
(Source : in Unbounded_Wide_Wide_String;
Low : in Positive;
High : in Natural)
return Unbounded_Wide_Wide_String;
procedure Unbounded_Slice
(Source : in Unbounded_Wide_Wide_String;
Target : out Unbounded_Wide_Wide_String;
Low : in Positive;
High : in Natural);
function "=" (Left, Right : in Unbounded_Wide_Wide_String) return Boolean;
function "=" (Left : in Unbounded_Wide_Wide_String;
Right : in Wide_Wide_String)
return Boolean;
function "=" (Left : in Wide_Wide_String;
Right : in Unbounded_Wide_Wide_String)
return Boolean;
function "<" (Left, Right : in Unbounded_Wide_Wide_String) return Boolean;
function "<" (Left : in Unbounded_Wide_Wide_String;
Right : in Wide_Wide_String)
return Boolean;
function "<" (Left : in Wide_Wide_String;
Right : in Unbounded_Wide_Wide_String)
return Boolean;
function "<=" (Left, Right : in Unbounded_Wide_Wide_String) return Boolean;
function "<=" (Left : in Unbounded_Wide_Wide_String;
Right : in Wide_Wide_String)
return Boolean;
function "<=" (Left : in Wide_Wide_String;
Right : in Unbounded_Wide_Wide_String)
return Boolean;
function ">" (Left, Right : in Unbounded_Wide_Wide_String) return Boolean;
function ">" (Left : in Unbounded_Wide_Wide_String;
Right : in Wide_Wide_String)
return Boolean;
function ">" (Left : in Wide_Wide_String;
Right : in Unbounded_Wide_Wide_String)
return Boolean;
function ">=" (Left, Right : in Unbounded_Wide_Wide_String) return Boolean;
function ">=" (Left : in Unbounded_Wide_Wide_String;
Right : in Wide_Wide_String)
return Boolean;
function ">=" (Left : in Wide_Wide_String;
Right : in Unbounded_Wide_Wide_String)
return Boolean;
-- Search subprograms
function Index (Source : in Unbounded_Wide_Wide_String;
Pattern : in Wide_Wide_String;
From : in Positive;
Going : in Direction := Forward;
Mapping : in Wide_Wide_Maps.Wide_Wide_Character_Mapping
:= Wide_Wide_Maps.Identity)
return Natural;
function Index
(Source : in Unbounded_Wide_Wide_String;
Pattern : in Wide_Wide_String;
From : in Positive;
Going : in Direction := Forward;
Mapping : in Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function)
return Natural;
function Index (Source : in Unbounded_Wide_Wide_String;
Pattern : in Wide_Wide_String;
Going : in Direction := Forward;
Mapping : in Wide_Wide_Maps.Wide_Wide_Character_Mapping
:= Wide_Wide_Maps.Identity)
return Natural;
function Index
(Source : in Unbounded_Wide_Wide_String;
Pattern : in Wide_Wide_String;
Going : in Direction := Forward;
Mapping : in Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function)
return Natural;
function Index (Source : in Unbounded_Wide_Wide_String;
Set : in Wide_Wide_Maps.Wide_Wide_Character_Set;
From : in Positive;
Test : in Membership := Inside;
Going : in Direction := Forward)
return Natural;
function Index (Source : in Unbounded_Wide_Wide_String;
Set : in Wide_Wide_Maps.Wide_Wide_Character_Set;
Test : in Membership := Inside;
Going : in Direction := Forward) return Natural;
function Index_Non_Blank (Source : in Unbounded_Wide_Wide_String;
From : in Positive;
Going : in Direction := Forward)
return Natural;
function Index_Non_Blank (Source : in Unbounded_Wide_Wide_String;
Going : in Direction := Forward)
return Natural;
function Count (Source : in Unbounded_Wide_Wide_String;
Pattern : in Wide_Wide_String;
Mapping : in Wide_Wide_Maps.Wide_Wide_Character_Mapping
:= Wide_Wide_Maps.Identity)
return Natural;
function Count
(Source : in Unbounded_Wide_Wide_String;
Pattern : in Wide_Wide_String;
Mapping : in Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function)
return Natural;
function Count (Source : in Unbounded_Wide_Wide_String;
Set : in Wide_Wide_Maps.Wide_Wide_Character_Set)
return Natural;
procedure Find_Token (Source : in Unbounded_Wide_Wide_String;
Set : in Wide_Wide_Maps.Wide_Wide_Character_Set;
Test : in Membership;
First : out Positive;
Last : out Natural);
-- Wide_Wide_String translation subprograms
function Translate
(Source : in Unbounded_Wide_Wide_String;
Mapping : in Wide_Wide_Maps.Wide_Wide_Character_Mapping)
return Unbounded_Wide_Wide_String;
procedure Translate
(Source : in out Unbounded_Wide_Wide_String;
Mapping : in Wide_Wide_Maps.Wide_Wide_Character_Mapping);
function Translate
(Source : in Unbounded_Wide_Wide_String;
Mapping : in Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function)
return Unbounded_Wide_Wide_String;
procedure Translate
(Source : in out Unbounded_Wide_Wide_String;
Mapping : in Wide_Wide_Maps.Wide_Wide_Character_Mapping_Function);
-- Wide_Wide_String transformation subprograms
function Replace_Slice (Source : in Unbounded_Wide_Wide_String;
Low : in Positive;
High : in Natural;
By : in Wide_Wide_String)
return Unbounded_Wide_Wide_String;
procedure Replace_Slice (Source : in out Unbounded_Wide_Wide_String;
Low : in Positive;
High : in Natural;
By : in Wide_Wide_String);
function Insert (Source : in Unbounded_Wide_Wide_String;
Before : in Positive;
New_Item : in Wide_Wide_String)
return Unbounded_Wide_Wide_String;
procedure Insert (Source : in out Unbounded_Wide_Wide_String;
Before : in Positive;
New_Item : in Wide_Wide_String);
function Overwrite (Source : in Unbounded_Wide_Wide_String;
Position : in Positive;
New_Item : in Wide_Wide_String)
return Unbounded_Wide_Wide_String;
procedure Overwrite (Source : in out Unbounded_Wide_Wide_String;
Position : in Positive;
New_Item : in Wide_Wide_String);
function Delete (Source : in Unbounded_Wide_Wide_String;
From : in Positive;
Through : in Natural)
return Unbounded_Wide_Wide_String;
procedure Delete (Source : in out Unbounded_Wide_Wide_String;
From : in Positive;
Through : in Natural);
function Trim (Source : in Unbounded_Wide_Wide_String;
Side : in Trim_End)
return Unbounded_Wide_Wide_String;
procedure Trim (Source : in out Unbounded_Wide_Wide_String;
Side : in Trim_End);
function Trim (Source : in Unbounded_Wide_Wide_String;
Left : in Wide_Wide_Maps.Wide_Wide_Character_Set;
Right : in Wide_Wide_Maps.Wide_Wide_Character_Set)
return Unbounded_Wide_Wide_String;
procedure Trim (Source : in out Unbounded_Wide_Wide_String;
Left : in Wide_Wide_Maps.Wide_Wide_Character_Set;
Right : in Wide_Wide_Maps.Wide_Wide_Character_Set);
function Head (Source : in Unbounded_Wide_Wide_String;
Count : in Natural;
Pad : in Wide_Wide_Character := Wide_Wide_Space)
return Unbounded_Wide_Wide_String;
procedure Head (Source : in out Unbounded_Wide_Wide_String;
Count : in Natural;
Pad : in Wide_Wide_Character := Wide_Wide_Space);
function Tail (Source : in Unbounded_Wide_Wide_String;
Count : in Natural;
Pad : in Wide_Wide_Character := Wide_Wide_Space)
return Unbounded_Wide_Wide_String;
procedure Tail (Source : in out Unbounded_Wide_Wide_String;
Count : in Natural;
Pad : in Wide_Wide_Character := Wide_Wide_Space);
function "*" (Left : in Natural;
Right : in Wide_Wide_Character)
return Unbounded_Wide_Wide_String;
function "*" (Left : in Natural;
Right : in Wide_Wide_String)
return Unbounded_Wide_Wide_String;
function "*" (Left : in Natural;
Right : in Unbounded_Wide_Wide_String)
return Unbounded_Wide_Wide_String;
private
pragma Import (Ada, Unbounded_Wide_Wide_String);
pragma Import (Ada, Null_Unbounded_Wide_Wide_String);
end Ada.Strings.Wide_Wide_Unbounded;
| 39.659639 | 78 | 0.593225 |
10a6f7b15b28d23596f04a9eb359c96ec10d905c | 3,659 | adb | Ada | Ada/src/Problem_44.adb | Tim-Tom/project-euler | 177e0043ee93409742ec596c4379251f681b4275 | [
"Unlicense"
] | null | null | null | Ada/src/Problem_44.adb | Tim-Tom/project-euler | 177e0043ee93409742ec596c4379251f681b4275 | [
"Unlicense"
] | null | null | null | Ada/src/Problem_44.adb | Tim-Tom/project-euler | 177e0043ee93409742ec596c4379251f681b4275 | [
"Unlicense"
] | null | null | null | with Ada.Text_IO;
with Ada.Containers.Ordered_Sets;
with Ada.Containers.Doubly_Linked_Lists;
package body Problem_44 is
package IO renames Ada.Text_IO;
package Positive_Set is new Ada.Containers.Ordered_Sets(Element_Type => Positive);
package Positive_List is new Ada.Containers.Doubly_Linked_Lists(Element_Type => Positive);
procedure Solve is
pentagonal_numbers : Positive_Set.Set := Positive_Set.Empty_Set;
compares : Positive_List.List := Positive_List.Empty_List;
largest_generated : Positive := 1;
largest_generated_index : Positive := 1;
maximum_bound : Positive := Positive'Last;
function Is_Pentagonal(number : Positive) return Boolean is
begin
while number > largest_generated loop
largest_generated_index := Positive'Succ(largest_generated_index);
largest_generated := largest_generated_index * (3*largest_generated_index - 1) / 2;
-- IO.Put_Line("Generated " & Positive'Image(largest_generated));
pentagonal_numbers.Insert(largest_generated);
end loop;
return pentagonal_numbers.Contains(number);
end Is_Pentagonal;
procedure Trim_Comparison_List(minimum_bound : Positive) is
cursor : Positive_List.Cursor := compares.First;
function "=" (left,right : Positive_List.Cursor) return Boolean renames Positive_List."=";
begin
while cursor /= Positive_List.No_Element loop
exit when Positive_List.Element(cursor) >= minimum_bound;
compares.Delete(cursor);
end loop;
end Trim_Comparison_List;
pentagonal : Positive := 1;
index : Positive := 1;
begin
pentagonal_numbers.Insert(1);
main_loop:
loop
declare
difference : constant Positive := 3*index + 1;
minimum_bound : Positive renames difference;
begin
exit when minimum_bound > maximum_bound;
Trim_Comparison_List(minimum_bound);
pentagonal := pentagonal + difference;
index := index + 1;
-- IO.Put_Line(Positive'Image(pentagonal));
declare
cursor : Positive_List.Cursor := compares.Last;
function "=" (left,right : Positive_List.Cursor) return Boolean renames Positive_List."=";
begin
check_loop:
while cursor /= Positive_List.No_Element loop
declare
previous_pent : constant Positive := Positive_List.Element(cursor);
begin
if Is_Pentagonal(pentagonal + previous_pent) and then Is_Pentagonal(pentagonal - previous_pent) then
if maximum_bound > pentagonal - previous_pent then
maximum_bound := pentagonal - previous_pent;
-- As far as my analysis goes, this should just be exit check_loop
-- (which is why it's called the maximum bound), but the bound ends
-- up being huge, so we don't really terminate with any celerity.
-- It would require generating over 1 million of these numbers to
-- satisfy that bound.
exit main_loop;
end if;
end if;
Positive_List.Previous(cursor);
end;
end loop check_loop;
end;
compares.Append(pentagonal);
end;
end loop main_loop;
IO.Put_Line(Positive'Image(maximum_bound));
end Solve;
end Problem_44;
| 46.910256 | 121 | 0.609456 |
390be52ff3daa5053877261255f3463b3a844a06 | 20,637 | adb | Ada | arch/ARM/STM32/drivers/stm32-dac.adb | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 192 | 2016-06-01T18:32:04.000Z | 2022-03-26T22:52:31.000Z | arch/ARM/STM32/drivers/stm32-dac.adb | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 239 | 2016-05-26T20:02:01.000Z | 2022-03-31T09:46:56.000Z | arch/ARM/STM32/drivers/stm32-dac.adb | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015, 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. --
-- --
-- --
-- This file is based on: --
-- --
-- @file stm32f4xx_hal_dac.c and stm32f4xx_hal_dac_ex.c --
-- @author MCD Application Team --
-- @version V1.3.1 --
-- @date 25-March-2015 --
-- @brief Header file of DAC HAL module. --
-- --
-- COPYRIGHT(c) 2014 STMicroelectronics --
------------------------------------------------------------------------------
with Ada.Unchecked_Conversion;
with STM32_SVD.DAC; use STM32_SVD.DAC;
package body STM32.DAC is
------------
-- Enable --
------------
procedure Enable
(This : in out Digital_To_Analog_Converter;
Channel : DAC_Channel)
is
begin
case Channel is
when Channel_1 =>
This.CR.EN1 := True;
when Channel_2 =>
This.CR.EN2 := True;
end case;
end Enable;
-------------
-- Disable --
-------------
procedure Disable
(This : in out Digital_To_Analog_Converter;
Channel : DAC_Channel)
is
begin
case Channel is
when Channel_1 =>
This.CR.EN1 := False;
when Channel_2 =>
This.CR.EN2 := False;
end case;
end Disable;
-------------
-- Enabled --
-------------
function Enabled
(This : Digital_To_Analog_Converter;
Channel : DAC_Channel)
return Boolean is
begin
case Channel is
when Channel_1 =>
return This.CR.EN1;
when Channel_2 =>
return This.CR.EN2;
end case;
end Enabled;
----------------
-- Set_Output --
----------------
procedure Set_Output
(This : in out Digital_To_Analog_Converter;
Channel : DAC_Channel;
Value : UInt32;
Resolution : DAC_Resolution;
Alignment : Data_Alignment)
is
begin
case Channel is
when Channel_1 =>
case Resolution is
when DAC_Resolution_12_Bits =>
case Alignment is
when Left_Aligned =>
This.DHR12L1.DACC1DHR :=
UInt12 (Value and Max_12bit_Resolution);
when Right_Aligned =>
This.DHR12R1.DACC1DHR :=
UInt12 (Value and Max_12bit_Resolution);
end case;
when DAC_Resolution_8_Bits =>
This.DHR8R1.DACC1DHR := UInt8 (Value and Max_8bit_Resolution);
end case;
when Channel_2 =>
case Resolution is
when DAC_Resolution_12_Bits =>
case Alignment is
when Left_Aligned =>
This.DHR12L2.DACC2DHR :=
UInt12 (Value and Max_12bit_Resolution);
when Right_Aligned =>
This.DHR12R2.DACC2DHR :=
UInt12 (Value and Max_12bit_Resolution);
end case;
when DAC_Resolution_8_Bits =>
This.DHR8R2.DACC2DHR := UInt8 (Value and Max_8bit_Resolution);
end case;
end case;
end Set_Output;
------------------------------------
-- Trigger_Conversion_By_Software --
------------------------------------
procedure Trigger_Conversion_By_Software
(This : in out Digital_To_Analog_Converter;
Channel : DAC_Channel)
is
begin
case Channel is
when Channel_1 =>
This.SWTRIGR.SWTRIG.Arr (1) := True; -- cleared by hardware
when Channel_2 =>
This.SWTRIGR.SWTRIG.Arr (2) := True; -- cleared by hardware
end case;
end Trigger_Conversion_By_Software;
----------------------------
-- Converted_Output_Value --
----------------------------
function Converted_Output_Value
(This : Digital_To_Analog_Converter;
Channel : DAC_Channel)
return UInt32
is
begin
case Channel is
when Channel_1 =>
return UInt32 (This.DOR1.DACC1DOR);
when Channel_2 =>
return UInt32 (This.DOR2.DACC2DOR);
end case;
end Converted_Output_Value;
------------------------------
-- Set_Dual_Output_Voltages --
------------------------------
procedure Set_Dual_Output_Voltages
(This : in out Digital_To_Analog_Converter;
Channel_1_Value : UInt32;
Channel_2_Value : UInt32;
Resolution : DAC_Resolution;
Alignment : Data_Alignment)
is
begin
case Resolution is
when DAC_Resolution_12_Bits =>
case Alignment is
when Left_Aligned =>
This.DHR12LD.DACC1DHR :=
UInt12 (Channel_1_Value and Max_12bit_Resolution);
This.DHR12LD.DACC2DHR :=
UInt12 (Channel_2_Value and Max_12bit_Resolution);
when Right_Aligned =>
This.DHR12RD.DACC1DHR :=
UInt12 (Channel_1_Value and Max_12bit_Resolution);
This.DHR12RD.DACC2DHR :=
UInt12 (Channel_2_Value and Max_12bit_Resolution);
end case;
when DAC_Resolution_8_Bits =>
This.DHR8RD.DACC1DHR :=
UInt8 (Channel_1_Value and Max_8bit_Resolution);
This.DHR8RD.DACC2DHR :=
UInt8 (Channel_2_Value and Max_8bit_Resolution);
end case;
end Set_Dual_Output_Voltages;
---------------------------------
-- Converted_Dual_Output_Value --
---------------------------------
function Converted_Dual_Output_Value (This : Digital_To_Analog_Converter)
return Dual_Channel_Output
is
Result : Dual_Channel_Output;
begin
Result.Channel_1_Data := UInt16 (This.DOR1.DACC1DOR);
Result.Channel_2_Data := UInt16 (This.DOR2.DACC2DOR);
return Result;
end Converted_Dual_Output_Value;
--------------------------
-- Enable_Output_Buffer --
--------------------------
procedure Enable_Output_Buffer
(This : in out Digital_To_Analog_Converter;
Channel : DAC_Channel)
is
begin
case Channel is
when Channel_1 =>
This.CR.BOFF1 := True;
when Channel_2 =>
This.CR.BOFF2 := True;
end case;
end Enable_Output_Buffer;
---------------------------
-- Disable_Output_Buffer --
---------------------------
procedure Disable_Output_Buffer
(This : in out Digital_To_Analog_Converter;
Channel : DAC_Channel)
is
begin
case Channel is
when Channel_1 =>
This.CR.BOFF1 := False;
when Channel_2 =>
This.CR.BOFF2 := False;
end case;
end Disable_Output_Buffer;
---------------------------
-- Output_Buffer_Enabled --
---------------------------
function Output_Buffer_Enabled
(This : Digital_To_Analog_Converter;
Channel : DAC_Channel)
return Boolean
is
begin
case Channel is
when Channel_1 =>
return This.CR.BOFF1;
when Channel_2 =>
return This.CR.BOFF2;
end case;
end Output_Buffer_Enabled;
--------------------
-- Select_Trigger --
--------------------
procedure Select_Trigger
(This : in out Digital_To_Analog_Converter;
Channel : DAC_Channel;
Trigger : External_Event_Trigger_Selection)
is
begin
case Channel is
when Channel_1 =>
This.CR.TSEL1 :=
External_Event_Trigger_Selection'Enum_Rep (Trigger);
when Channel_2 =>
This.CR.TSEL2 :=
External_Event_Trigger_Selection'Enum_Rep (Trigger);
end case;
end Select_Trigger;
-----------------------
-- Trigger_Selection --
-----------------------
function Trigger_Selection
(This : Digital_To_Analog_Converter;
Channel : DAC_Channel)
return External_Event_Trigger_Selection
is
begin
case Channel is
when Channel_1 =>
return External_Event_Trigger_Selection'Val (This.CR.TSEL1);
when Channel_2 =>
return External_Event_Trigger_Selection'Val (This.CR.TSEL2);
end case;
end Trigger_Selection;
--------------------
-- Enable_Trigger --
--------------------
procedure Enable_Trigger
(This : in out Digital_To_Analog_Converter;
Channel : DAC_Channel)
is
begin
case Channel is
when Channel_1 =>
This.CR.TEN1 := True;
when Channel_2 =>
This.CR.TEN2 := True;
end case;
end Enable_Trigger;
---------------------
-- Disable_Trigger --
---------------------
procedure Disable_Trigger
(This : in out Digital_To_Analog_Converter;
Channel : DAC_Channel)
is
begin
case Channel is
when Channel_1 =>
This.CR.TEN1 := False;
when Channel_2 =>
This.CR.TEN2 := False;
end case;
end Disable_Trigger;
---------------------
-- Trigger_Enabled --
---------------------
function Trigger_Enabled
(This : Digital_To_Analog_Converter;
Channel : DAC_Channel)
return Boolean
is
begin
case Channel is
when Channel_1 =>
return This.CR.TEN1;
when Channel_2 =>
return This.CR.TEN2;
end case;
end Trigger_Enabled;
----------------
-- Enable_DMA --
----------------
procedure Enable_DMA
(This : in out Digital_To_Analog_Converter;
Channel : DAC_Channel)
is
begin
case Channel is
when Channel_1 =>
This.CR.DMAEN1 := True;
when Channel_2 =>
This.CR.DMAEN2 := True;
end case;
end Enable_DMA;
-----------------
-- Disable_DMA --
-----------------
procedure Disable_DMA
(This : in out Digital_To_Analog_Converter;
Channel : DAC_Channel)
is
begin
case Channel is
when Channel_1 =>
This.CR.DMAEN1 := False;
when Channel_2 =>
This.CR.DMAEN2 := False;
end case;
end Disable_DMA;
-----------------
-- DMA_Enabled --
-----------------
function DMA_Enabled
(This : Digital_To_Analog_Converter;
Channel : DAC_Channel)
return Boolean
is
begin
case Channel is
when Channel_1 =>
return This.CR.DMAEN1;
when Channel_2 =>
return This.CR.DMAEN2;
end case;
end DMA_Enabled;
------------
-- Status --
------------
function Status
(This : Digital_To_Analog_Converter;
Flag : DAC_Status_Flag)
return Boolean
is
begin
case Flag is
when DMA_Underrun_Channel_1 =>
return This.SR.DMAUDR1;
when DMA_Underrun_Channel_2 =>
return This.SR.DMAUDR2;
end case;
end Status;
------------------
-- Clear_Status --
------------------
procedure Clear_Status
(This : in out Digital_To_Analog_Converter;
Flag : DAC_Status_Flag)
is
begin
case Flag is
when DMA_Underrun_Channel_1 =>
This.SR.DMAUDR1 := True; -- set to 1 to clear
when DMA_Underrun_Channel_2 =>
This.SR.DMAUDR2 := True; -- set to 1 to clear
end case;
end Clear_Status;
-----------------------
-- Enable_Interrupts --
-----------------------
procedure Enable_Interrupts
(This : in out Digital_To_Analog_Converter;
Source : DAC_Interrupts)
is
begin
case Source is
when DMA_Underrun_Channel_1 =>
This.CR.DMAUDRIE1 := True;
when DMA_Underrun_Channel_2 =>
This.CR.DMAUDRIE2 := True;
end case;
end Enable_Interrupts;
------------------------
-- Disable_Interrupts --
------------------------
procedure Disable_Interrupts
(This : in out Digital_To_Analog_Converter;
Source : DAC_Interrupts)
is
begin
case Source is
when DMA_Underrun_Channel_1 =>
This.CR.DMAUDRIE1 := False;
when DMA_Underrun_Channel_2 =>
This.CR.DMAUDRIE2 := False;
end case;
end Disable_Interrupts;
-----------------------
-- Interrupt_Enabled --
-----------------------
function Interrupt_Enabled
(This : Digital_To_Analog_Converter;
Source : DAC_Interrupts)
return Boolean
is
begin
case Source is
when DMA_Underrun_Channel_1 =>
return This.CR.DMAUDRIE1;
when DMA_Underrun_Channel_2 =>
return This.CR.DMAUDRIE2;
end case;
end Interrupt_Enabled;
----------------------
-- Interrupt_Source --
----------------------
function Interrupt_Source
(This : Digital_To_Analog_Converter)
return DAC_Interrupts
is
begin
if This.CR.DMAUDRIE1 then
return DMA_Underrun_Channel_1;
else
return DMA_Underrun_Channel_2;
end if;
end Interrupt_Source;
-----------------------------
-- Clear_Interrupt_Pending --
-----------------------------
procedure Clear_Interrupt_Pending
(This : in out Digital_To_Analog_Converter;
Channel : DAC_Channel)
is
begin
case Channel is
when Channel_1 =>
This.SR.DMAUDR1 := False;
when Channel_2 =>
This.SR.DMAUDR2 := False;
end case;
end Clear_Interrupt_Pending;
----------------------------
-- Select_Wave_Generation --
----------------------------
procedure Select_Wave_Generation
(This : in out Digital_To_Analog_Converter;
Channel : DAC_Channel;
Selection : Wave_Generation)
is
function As_UInt4 is new Ada.Unchecked_Conversion
(Source => Noise_Wave_Mask_Selection, Target => UInt4);
function As_UInt4 is new Ada.Unchecked_Conversion
(Source => Triangle_Wave_Amplitude_Selection, Target => UInt4);
begin
case Channel is
when Channel_1 =>
This.CR.WAVE1 :=
Wave_Generation_Selection'Enum_Rep (Selection.Kind);
when Channel_2 =>
This.CR.WAVE2 :=
Wave_Generation_Selection'Enum_Rep (Selection.Kind);
end case;
case Selection.Kind is
when No_Wave_Generation =>
null;
when Noise_Wave =>
case Channel is
when Channel_1 =>
This.CR.MAMP1 := As_UInt4 (Selection.Mask);
when Channel_2 =>
This.CR.MAMP2 := As_UInt4 (Selection.Mask);
end case;
when Triangle_Wave =>
case Channel is
when Channel_1 =>
This.CR.MAMP1 := As_UInt4 (Selection.Amplitude);
when Channel_2 =>
This.CR.MAMP2 := As_UInt4 (Selection.Amplitude);
end case;
end case;
end Select_Wave_Generation;
------------------------------
-- Selected_Wave_Generation --
------------------------------
function Selected_Wave_Generation
(This : Digital_To_Analog_Converter;
Channel : DAC_Channel)
return Wave_Generation
is
Kind : Wave_Generation_Selection;
function As_Mask is new Ada.Unchecked_Conversion
(Target => Noise_Wave_Mask_Selection, Source => UInt4);
function As_Amplitude is new Ada.Unchecked_Conversion
(Target => Triangle_Wave_Amplitude_Selection, Source => UInt4);
begin
case Channel is
when Channel_1 =>
Kind := Wave_Generation_Selection'Val (This.CR.WAVE1);
when Channel_2 =>
Kind := Wave_Generation_Selection'Val (This.CR.WAVE2);
end case;
declare
Result : Wave_Generation (Kind);
begin
case Kind is
when No_Wave_Generation =>
null;
when Noise_Wave =>
case Channel is
when Channel_1 =>
Result.Mask := As_Mask (This.CR.MAMP1);
when Channel_2 =>
Result.Mask := As_Mask (This.CR.MAMP2);
end case;
when Triangle_Wave =>
case Channel is
when Channel_1 =>
Result.Amplitude := As_Amplitude (This.CR.MAMP1);
when Channel_2 =>
Result.Amplitude := As_Amplitude (This.CR.MAMP2);
end case;
end case;
return Result;
end;
end Selected_Wave_Generation;
------------------
-- Data_Address --
------------------
function Data_Address
(This : Digital_To_Analog_Converter;
Channel : DAC_Channel;
Resolution : DAC_Resolution;
Alignment : Data_Alignment)
return Address
is
Result : Address;
begin
case Channel is
when Channel_1 =>
case Resolution is
when DAC_Resolution_12_Bits =>
case Alignment is
when Left_Aligned =>
Result := This.DHR12L1'Address;
when Right_Aligned =>
Result := This.DHR12R1'Address;
end case;
when DAC_Resolution_8_Bits =>
Result := This.DHR8R1'Address;
end case;
when Channel_2 =>
case Resolution is
when DAC_Resolution_12_Bits =>
case Alignment is
when Left_Aligned =>
Result := This.DHR12L2'Address;
when Right_Aligned =>
Result := This.DHR12R2'Address;
end case;
when DAC_Resolution_8_Bits =>
Result := This.DHR8R2'Address;
end case;
end case;
return Result;
end Data_Address;
end STM32.DAC;
| 29.822254 | 80 | 0.512962 |
232193efaeb0967442d148230da3f8025941e5ed | 3,231 | ads | Ada | resources/scripts/api/securitytrails.ads | VK9D/AttackSurfaceMappingTool | 2d98de364508e8a10c09fbeebfa576e4671957d4 | [
"Apache-2.0"
] | 1 | 2021-02-22T11:57:22.000Z | 2021-02-22T11:57:22.000Z | resources/scripts/api/securitytrails.ads | VK9D/AttackSurfaceMappingTool | 2d98de364508e8a10c09fbeebfa576e4671957d4 | [
"Apache-2.0"
] | null | null | null | resources/scripts/api/securitytrails.ads | VK9D/AttackSurfaceMappingTool | 2d98de364508e8a10c09fbeebfa576e4671957d4 | [
"Apache-2.0"
] | null | null | null | -- Copyright 2017 Jeff Foley. All rights reserved.
-- Use of this source code is governed by Apache 2 LICENSE that can be found in the LICENSE file.
local json = require("json")
name = "SecurityTrails"
type = "api"
function start()
setratelimit(1)
end
function check()
local c
local cfg = datasrc_config()
if cfg ~= nil then
c = cfg.credentials
end
if (c ~= nil and c.key ~= nil and c.key ~= "") then
return true
end
return false
end
function vertical(ctx, domain)
local c
local cfg = datasrc_config()
if cfg ~= nil then
c = cfg.credentials
end
if (c == nil or c.key == nil or c.key == "") then
return
end
local resp
local vurl = verturl(domain)
-- Check if the response data is in the graph database
if (cfg.ttl ~= nil and cfg.ttl > 0) then
resp = obtain_response(vurl, cfg.ttl)
end
if (resp == nil or resp == "") then
local err
resp, err = request(ctx, {
url=vurl,
headers={
APIKEY=c.key,
['Content-Type']="application/json",
},
})
if (err ~= nil and err ~= "") then
return
end
if (cfg.ttl ~= nil and cfg.ttl > 0) then
cache_response(vurl, resp)
end
end
local j = json.decode(resp)
if (j == nil or #(j.subdomains) == 0) then
return
end
for i, sub in pairs(j.subdomains) do
sendnames(ctx, sub .. "." .. domain)
end
end
function verturl(domain)
return "https://api.securitytrails.com/v1/domain/" .. domain .. "/subdomains"
end
function sendnames(ctx, content)
local names = find(content, subdomainre)
if names == nil then
return
end
local found = {}
for i, v in pairs(names) do
if found[v] == nil then
newname(ctx, v)
found[v] = true
end
end
end
function horizontal(ctx, domain)
local c
local cfg = datasrc_config()
if cfg ~= nil then
c = cfg.credentials
end
if (c == nil or c.key == "") then
return
end
local resp
local hurl = horizonurl(domain)
-- Check if the response data is in the graph database
if (cfg.ttl ~= nil and cfg.ttl > 0) then
resp = obtain_response(hurl, cfg.ttl)
end
if (resp == nil or resp == "") then
local err
resp, err = request(ctx, {
url=hurl,
headers={
APIKEY=c.key,
['Content-Type']="application/json",
},
})
if (err ~= nil and err ~= "") then
return
end
if (cfg.ttl ~= nil and cfg.ttl > 0) then
cache_response(hurl, resp)
end
end
local j = json.decode(resp)
if (j == nil or #(j.records) == 0) then
return
end
assoc = {}
for i, r in pairs(j.records) do
if r.hostname ~= "" then
table.insert(assoc, r.hostname)
end
end
for i, a in pairs(assoc) do
associated(ctx, domain, a)
end
end
function horizonurl(domain)
return "https://api.securitytrails.com/v1/domain/" .. domain .. "/associated"
end
| 21.684564 | 97 | 0.539461 |
df7d52dc2a4fed6f25b4e0381181b514b9809671 | 2,911 | adb | Ada | reuse/ada/stringm.adb | cocolab8/cocktail-src | f708f2a3fc5806e72c8109348a7e0c93304afdaf | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | reuse/ada/stringm.adb | cocolab8/cocktail-src | f708f2a3fc5806e72c8109348a7e0c93304afdaf | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | reuse/ada/stringm.adb | cocolab8/cocktail-src | f708f2a3fc5806e72c8109348a7e0c93304afdaf | [
"ECL-2.0",
"Apache-2.0"
] | null | null | null | -- $Id: StringM.mi,v 1.5 1993/08/18 15:06:51 grosch rel $
-- $Log: StringM.mi,v $
-- Ich, Doktor Josef Grosch, Informatiker, Sept. 1994
with DynArray, Strings, Text_Io;
use Strings, Text_Io;
package body StringM is
package Int_Io is new Integer_IO (Integer); use Int_Io;
package Char_DA is new DynArray (Character); use Char_DA;
InitialMemorySize: constant Integer := 1024 * 16;
MemoryPtr : Char_DA.FlexArray;
MemorySize : Integer;
MemorySpaceLeft : Integer;
MemoryFreePtr : Integer;
function PutString (s: tString) return tStringRef is
StrLength : Integer := Length (s);
NeededSpace : Integer := StrLength + 2;
OldMemorySize : Integer;
StartPtr : Integer := MemoryFreePtr;
t : String (1 .. StrLength) := To_String (s);
begin
while MemorySpaceLeft < NeededSpace loop
OldMemorySize := MemorySize;
ExtendArray (MemoryPtr, MemorySize);
MemorySpaceLeft := MemorySpaceLeft + (MemorySize - OldMemorySize);
end loop;
MemoryPtr (MemoryFreePtr) := Character'Val (StrLength / 256);
MemoryFreePtr := MemoryFreePtr + 1;
MemoryPtr (MemoryFreePtr) := Character'Val (StrLength mod 256);
for i in 1 .. StrLength loop MemoryPtr (MemoryFreePtr + i) := t (i); end loop;
MemoryFreePtr := MemoryFreePtr + StrLength + 1;
MemorySpaceLeft := MemorySpaceLeft - NeededSpace;
return StartPtr;
end PutString;
function GetString (r: tStringRef) return tString is
StrLength : Integer := Length (r);
s : String (1 .. StrLength);
t : tString;
begin
for i in 1 .. StrLength loop s (i) := MemoryPtr (r + i + 1); end loop;
To_tString (s, t);
return t;
end GetString;
function Length (r: tStringRef) return Integer is
begin
return Character'Pos (MemoryPtr (r)) * 256 + Character'Pos (MemoryPtr (r+1));
end Length;
function IsEqual (r: tStringRef; s: tString) return Boolean is
begin
return GetString (r) = s;
end IsEqual;
procedure WriteString (f: File_Type; r: tStringRef) is
begin
for i in r + 2 .. r + 1 + Length (r) loop
Put (f, MemoryPtr (i));
end loop;
end WriteString;
procedure WriteStringMemory is
StringPtr : Integer;
begin
StringPtr := 0;
while StringPtr < MemoryFreePtr loop
Put (Standard_Output, StringPtr, 5);
Put (Standard_Output, ' ');
WriteString (Standard_Output, StringPtr);
New_Line (Standard_Output);
StringPtr := StringPtr + Length (StringPtr) + 2;
end loop;
New_Line (Standard_Output);
Put (Standard_Output, StringPtr, 5);
Put (Standard_Output, " Bytes");
New_Line (Standard_Output);
end WriteStringMemory;
procedure InitStringMemory is
begin
MemorySpaceLeft := MemorySize;
MemoryFreePtr := 0;
end InitStringMemory;
begin
MemorySize := InitialMemorySize;
MakeArray (MemoryPtr, MemorySize);
InitStringMemory;
end StringM;
| 29.704082 | 84 | 0.670903 |
399be96026e7ac4a0b8144ac40fdacf56a13c5d3 | 6,832 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c95078a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c95078a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c95078a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C95078A.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE:
-- CHECK THAT AN EXCEPTION RAISED DURING THE EXECUTION OF AN ACCEPT
-- STATEMENT CAN BE HANDLED WITHIN THE ACCEPT BODY.
-- *** NOTE: This test has been modified since ACVC version 1.11 to -- 9X
-- *** remove incompatibilities associated with the transition -- 9X
-- *** to Ada 9X. -- 9X
-- *** -- 9X
-- HISTORY:
-- DHH 03/21/88 CREATED ORIGINAL TEST.
-- MRM 03/30/93 REMOVED NUMERIC_ERROR FOR 9X COMPATIBILITY
WITH REPORT; USE REPORT;
PROCEDURE C95078A IS
BEGIN
TEST("C95078A", "CHECK THAT AN EXCEPTION RAISED DURING THE " &
"EXECUTION OF AN ACCEPT STATEMENT CAN BE " &
"HANDLED WITHIN THE ACCEPT BODY");
DECLARE
O,PT,QT,R,S,TP,B,C,D :INTEGER := 0;
TASK TYPE PROG_ERR IS
ENTRY START(M,N,A : IN OUT INTEGER);
ENTRY STOP;
END PROG_ERR;
TASK T IS
ENTRY START(M,N,A : IN OUT INTEGER);
ENTRY STOP;
END T;
TYPE REC IS
RECORD
B : PROG_ERR;
END RECORD;
TYPE ACC IS ACCESS PROG_ERR;
SUBTYPE X IS INTEGER RANGE 1 .. 10;
PACKAGE P IS
OBJ : REC;
END P;
TASK BODY PROG_ERR IS
FAULT : X;
BEGIN
ACCEPT START(M,N,A : IN OUT INTEGER) DO
BEGIN
M := IDENT_INT(1);
FAULT := IDENT_INT(11);
FAULT := IDENT_INT(FAULT);
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED("UNEXPECTED ERROR RAISED - " &
"CONSTRAINT - TASK TYPE");
END; -- EXCEPTION
BEGIN
N := IDENT_INT(1);
FAULT := IDENT_INT(5);
FAULT := FAULT/IDENT_INT(0);
FAULT := IDENT_INT(FAULT);
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED("UNEXPECTED ERROR RAISED - " &
"CONSTRAINT - TASK TYPE");
END; -- EXCEPTION
A := IDENT_INT(1);
END START;
ACCEPT STOP;
END PROG_ERR;
TASK BODY T IS
FAULT : X;
BEGIN
ACCEPT START(M,N,A : IN OUT INTEGER) DO
BEGIN
M := IDENT_INT(1);
FAULT := IDENT_INT(11);
FAULT := IDENT_INT(FAULT);
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED("UNEXPECTED ERROR RAISED - " &
"CONSTRAINT - TASK");
END; -- EXCEPTION
BEGIN
N := IDENT_INT(1);
FAULT := IDENT_INT(5);
FAULT := FAULT/IDENT_INT(0);
FAULT := IDENT_INT(FAULT);
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED("UNEXPECTED ERROR RAISED - " &
"CONSTRAINT - TASK");
END; -- EXCEPTION
A := IDENT_INT(1);
END START;
ACCEPT STOP;
END T;
PACKAGE BODY P IS
BEGIN
OBJ.B.START(O,PT,B);
OBJ.B.STOP;
IF O /= IDENT_INT(1) OR PT /= IDENT_INT(1) THEN
FAILED("EXCEPTION HANDLER NEVER ENTERED " &
"PROPERLY - TASK TYPE OBJECT");
END IF;
IF B /= IDENT_INT(1) THEN
FAILED("TASK NOT EXITED PROPERLY - TASK TYPE " &
"OBJECT");
END IF;
END P;
PACKAGE Q IS
OBJ : ACC;
END Q;
PACKAGE BODY Q IS
BEGIN
OBJ := NEW PROG_ERR;
OBJ.START(QT,R,C);
OBJ.STOP;
IF QT /= IDENT_INT(1) OR R /= IDENT_INT(1) THEN
FAILED("EXCEPTION HANDLER NEVER ENTERED " &
"PROPERLY - ACCESS TASK TYPE");
END IF;
IF C /= IDENT_INT(1) THEN
FAILED("TASK NOT EXITED PROPERLY - ACCESS TASK " &
"TYPE");
END IF;
END;
BEGIN
T.START(S,TP,D);
T.STOP;
IF S /= IDENT_INT(1) OR TP /= IDENT_INT(1) THEN
FAILED("EXCEPTION HANDLER NEVER ENTERED PROPERLY " &
"- TASK");
END IF;
IF D /= IDENT_INT(1) THEN
FAILED("TASK NOT EXITED PROPERLY - TASK");
END IF;
END; -- DECLARE
RESULT;
EXCEPTION
WHEN OTHERS =>
FAILED("EXCEPTION NOT HANDLED INSIDE ACCEPT BODY");
RESULT;
END C95078A;
| 34.857143 | 79 | 0.442623 |
23be7673c52980644b5dd7999ec126d6f7bda12a | 2,203 | adb | Ada | thirdparty/adasdl/thin/adasdl/AdaSDL_mixer/playwave_sprogs.adb | Lucretia/old_nehe_ada95 | d0378c3bfce202eb01bf00b57c128735dbe8582d | [
"BSD-3-Clause"
] | null | null | null | thirdparty/adasdl/thin/adasdl/AdaSDL_mixer/playwave_sprogs.adb | Lucretia/old_nehe_ada95 | d0378c3bfce202eb01bf00b57c128735dbe8582d | [
"BSD-3-Clause"
] | null | null | null | thirdparty/adasdl/thin/adasdl/AdaSDL_mixer/playwave_sprogs.adb | Lucretia/old_nehe_ada95 | d0378c3bfce202eb01bf00b57c128735dbe8582d | [
"BSD-3-Clause"
] | null | null | null |
--
-- PLAYWAVE: Port to the Ada programming language of a test application for the
-- the SDL mixer library.
--
-- The original code was written in C by Sam Lantinga http://www.libsdl.org.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 2 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program; if not, write to the Free Software
-- Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
--
-- Ada code written by:
-- Antonio M. F. Vargas --
-- Ponta Delgada - Azores - Portugal --
-- E-mail: [email protected] --
-- http://www.adapower.net/~avargas --
with GNAT.OS_Lib;
with Ada.Text_IO; use Ada.Text_IO;
with SDL.Timer;
package body PlayWave_Sprogs is
package T renames SDL.Timer;
-- ======================================
procedure CleanUp is
begin
if wave /= Mix.null_Chunk_ptr then
Mix.FreeChunk (wave);
wave := Mix.null_Chunk_ptr;
end if;
if audio_open then
Mix.CloseAudio;
audio_open := False;
end if;
SDL.SDL_Quit;
end CleanUp;
-- ======================================
procedure Usage (argv0 : US.Unbounded_String) is
begin
Put_Line ("Usage: " & US.To_String (argv0)
& " [-8] [-r rate] [-l] [-m] <wavefile>");
end Usage;
-- ======================================
procedure the_exit (number : C.int) is
begin
GNAT.OS_Lib.OS_Exit (Integer (number));
end the_exit;
-- ======================================
end PlayWave_Sprogs;
| 30.597222 | 82 | 0.561507 |
233b2454a08c6d83ae475ee15172922204d5627e | 944 | adb | Ada | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/O2_float_param/callee.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 31 | 2018-08-01T21:25:24.000Z | 2022-02-14T07:52:34.000Z | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/O2_float_param/callee.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 40 | 2018-12-03T19:48:52.000Z | 2021-03-10T06:34:26.000Z | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/O2_float_param/callee.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 20 | 2018-11-16T21:19:22.000Z | 2021-10-18T23:08:24.000Z | -- Copyright 2013-2019 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with IO; use IO;
package body Callee is
procedure Increment (Val : in out Float; Msg: String) is
begin
if Val > 200.0 then
Put_Line (Msg);
end if;
Val := Val + 1.0;
end Increment;
end Callee;
| 34.962963 | 73 | 0.702331 |
39970c78a5ccbc1b8e44db60f3ddcbd61125f1c4 | 696 | ads | Ada | src/gpsmodule.ads | Kurinkitos/Twizy-Security | 38f3ad3d7315f67e8e691dde69b740b00b33d7b4 | [
"MIT"
] | 1 | 2018-05-25T07:20:17.000Z | 2018-05-25T07:20:17.000Z | src/gpsmodule.ads | Kurinkitos/Twizy-Security | 38f3ad3d7315f67e8e691dde69b740b00b33d7b4 | [
"MIT"
] | null | null | null | src/gpsmodule.ads | Kurinkitos/Twizy-Security | 38f3ad3d7315f67e8e691dde69b740b00b33d7b4 | [
"MIT"
] | null | null | null | pragma SPARK_Mode(ON);
with Types; use Types;
package gpsModule with SPARK_Mode is
Top_Left : constant Types.Point := (667271.0, 6398091.0, 0.0);
Bottom_Right : constant Types.Point := (677862.0, 6397724.0, 0.0);
function gpstest(Position : Types.Point) return Boolean with
Post => (if Gpstest'Result then (Position.X > Top_Left.X and Position.Y < Top_Left.Y
and Position.X < Bottom_Right.X and Position.Y > Bottom_Right.Y)) and
(if not Gpstest'Result then not (Position.X > Top_Left.X and Position.Y < Top_Left.Y
and Position.X < Bottom_Right.X and Position.Y > Bottom_Right.Y)),
Global => null;
end gpsModule;
| 36.631579 | 98 | 0.658046 |
39625cf7bb85bf3445722e99ef506c90e585061d | 1,634 | ads | Ada | tools/css-commands-list.ads | stcarrez/ada-css | f7c337306094993186c507540701d04a4753b724 | [
"Apache-2.0"
] | 3 | 2017-01-03T22:18:22.000Z | 2017-01-10T07:58:17.000Z | tools/css-commands-list.ads | stcarrez/ada-css | f7c337306094993186c507540701d04a4753b724 | [
"Apache-2.0"
] | null | null | null | tools/css-commands-list.ads | stcarrez/ada-css | f7c337306094993186c507540701d04a4753b724 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- css-commands-list -- List command for CSS tools
-- Copyright (C) 2018, 2020 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
package CSS.Commands.List is
-- ------------------------------
-- List Command
-- ------------------------------
-- This command lists some information about the CSS files.
type Command is new CSS.Commands.Command with null record;
-- Execute the command with the arguments.
overriding
procedure Execute (Cmd : in out Command;
Name : in String;
Args : in Argument_List'Class;
Context : in out CSS.Commands.Context_Type);
-- Write the help associated with the command.
overriding
procedure Help (Cmd : in out Command;
Name : in String;
Context : in out CSS.Commands.Context_Type);
end CSS.Commands.List;
| 40.85 | 76 | 0.577723 |
39de3ff25825b1cc41be4311d4cd0bb253645bbf | 37,142 | adb | Ada | boards/ip_colordetect_test/colordetect/colordetect/.autopilot/db/colorthresholding_9_0_3_2160_3840_1_entry28.adb | Kgfu/PYNQ_HelloWorld | a5197130e7d4a5e7f382c3963349c1c0bd213213 | [
"BSD-3-Clause"
] | null | null | null | boards/ip_colordetect_test/colordetect/colordetect/.autopilot/db/colorthresholding_9_0_3_2160_3840_1_entry28.adb | Kgfu/PYNQ_HelloWorld | a5197130e7d4a5e7f382c3963349c1c0bd213213 | [
"BSD-3-Clause"
] | null | null | null | boards/ip_colordetect_test/colordetect/colordetect/.autopilot/db/colorthresholding_9_0_3_2160_3840_1_entry28.adb | Kgfu/PYNQ_HelloWorld | a5197130e7d4a5e7f382c3963349c1c0bd213213 | [
"BSD-3-Clause"
] | null | null | null | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="15">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName/>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>colorthresholding_9_0_3_2160_3840_1_entry28</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>p_src_mat_rows</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName>FIFO_SRL</coreName>
<coreId>49</coreId>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>p_src_mat_cols</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName>FIFO_SRL</coreName>
<coreId>49</coreId>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>p_src_mat_rows_out</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName>FIFO_SRL</coreName>
<coreId>49</coreId>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_4">
<Value>
<Obj>
<type>1</type>
<id>4</id>
<name>p_src_mat_cols_out</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName>FIFO_SRL</coreName>
<coreId>52</coreId>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name>p_src_mat_rows_read</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control>auto</control>
<opType>fifo</opType>
<implIndex>srl</implIndex>
<coreName>FIFO_SRL</coreName>
<coreId>81</coreId>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>18</item>
<item>19</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.40</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>p_src_mat_rows_out_din</rtlName>
<control/>
<opType/>
<implIndex/>
<coreName/>
<coreId>0</coreId>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>p_src_mat_rows_out_write_ln0</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control>auto</control>
<opType>fifo</opType>
<implIndex>srl</implIndex>
<coreName>FIFO_SRL</coreName>
<coreId>81</coreId>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>22</item>
<item>23</item>
<item>24</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.40</m_delay>
<m_topoIndex>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>p_src_mat_cols_read</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control>auto</control>
<opType>fifo</opType>
<implIndex>srl</implIndex>
<coreName>FIFO_SRL</coreName>
<coreId>81</coreId>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>25</item>
<item>26</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.40</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>empty_50</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>p_src_mat_cols_out_din</rtlName>
<control/>
<opType/>
<implIndex/>
<coreName/>
<coreId>132</coreId>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>p_src_mat_cols_out_write_ln0</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control>auto</control>
<opType>fifo</opType>
<implIndex>srl</implIndex>
<coreName>FIFO_SRL</coreName>
<coreId>81</coreId>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>28</item>
<item>29</item>
<item>30</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.40</m_delay>
<m_topoIndex>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>_ln0</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<coreId>129</coreId>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>7</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="11" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</consts>
<blocks class_id="12" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="13" tracking_level="1" version="0" object_id="_12">
<Obj>
<type>3</type>
<id>16</id>
<name>colorthresholding<9, 0, 3, 2160, 3840, 1>.entry28</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<contextNormFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<control/>
<opType/>
<implIndex/>
<coreName/>
<coreId>1768189039</coreId>
</Obj>
<node_objs>
<count>7</count>
<item_version>0</item_version>
<item>7</item>
<item>8</item>
<item>10</item>
<item>11</item>
<item>12</item>
<item>14</item>
<item>15</item>
</node_objs>
</item>
</blocks>
<edges class_id="14" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="15" tracking_level="1" version="0" object_id="_13">
<id>19</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>7</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="15" object_id="_14">
<id>20</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>8</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="15" object_id="_15">
<id>23</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>10</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="15" object_id="_16">
<id>24</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>10</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="15" object_id="_17">
<id>26</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>11</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="15" object_id="_18">
<id>27</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="15" object_id="_19">
<id>29</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="15" object_id="_20">
<id>30</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="16" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="17" tracking_level="1" version="0" object_id="_21">
<mId>1</mId>
<mTag>colorthresholding<9, 0, 3, 2160, 3840, 1>.entry28</mTag>
<mNormTag>colorthresholding_9_0_3_2160_3840_1_entry28</mNormTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
</cdfg_regions>
<fsm class_id="19" tracking_level="1" version="0" object_id="_22">
<states class_id="20" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="21" tracking_level="1" version="0" object_id="_23">
<id>1</id>
<operations class_id="22" tracking_level="0" version="0">
<count>11</count>
<item_version>0</item_version>
<item class_id="23" tracking_level="1" version="0" object_id="_24">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_25">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_26">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_27">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_28">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_29">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_30">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_31">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_32">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_33">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_34">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="24" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</transitions>
</fsm>
<res class_id="25" tracking_level="1" version="0" object_id="_35">
<dp_component_resource class_id="26" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_resource>
<dp_expression_resource>
<count>1</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>ap_block_state1 ( or ) </first>
<second class_id="28" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="29" tracking_level="0" version="0">
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>1</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>6</count>
<item_version>0</item_version>
<item>
<first>ap_done</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>p_src_mat_cols_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>p_src_mat_cols_out_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>p_src_mat_rows_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>p_src_mat_rows_out_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>real_start</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
</dp_multiplexer_resource>
<dp_register_resource>
<count>3</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>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_done_reg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>start_once_reg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
</dp_register_resource>
<dp_dsp_resource>
<count>0</count>
<item_version>0</item_version>
</dp_dsp_resource>
<dp_component_map class_id="30" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_map>
<dp_expression_map>
<count>0</count>
<item_version>0</item_version>
</dp_expression_map>
<dp_fifo_map>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_map>
<dp_memory_map>
<count>0</count>
<item_version>0</item_version>
</dp_memory_map>
</res>
<node_label_latency class_id="31" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="32" tracking_level="0" version="0">
<first>7</first>
<second class_id="33" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>8</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="34" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="35" tracking_level="0" version="0">
<first>16</first>
<second class_id="36" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="38" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="39" tracking_level="0" version="0">
<first>26</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
<item>
<first>32</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>39</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>45</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>52</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>57</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="41" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="42" tracking_level="0" version="0">
<first>empty_50_fu_57</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>empty_fu_52</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>4</count>
<item_version>0</item_version>
<item>
<first>p_src_mat_cols_read_read_fu_39</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>p_src_mat_rows_read_read_fu_26</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
<item>
<first>write_ln0_write_fu_32</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>write_ln0_write_fu_45</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="43" 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="44" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="45" tracking_level="0" version="0">
<first>p_src_mat_cols</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
</second>
</item>
<item>
<first>p_src_mat_cols_out</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
</second>
</item>
<item>
<first>p_src_mat_rows</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
</second>
</item>
<item>
<first>p_src_mat_rows_out</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core>
<count>4</count>
<item_version>0</item_version>
<item>
<first>1</first>
<second>
<first>1150</first>
<second>10</second>
</second>
</item>
<item>
<first>2</first>
<second>
<first>1150</first>
<second>10</second>
</second>
</item>
<item>
<first>3</first>
<second>
<first>1151</first>
<second>10</second>
</second>
</item>
<item>
<first>4</first>
<second>
<first>1151</first>
<second>10</second>
</second>
</item>
</port2core>
<node2core>
<count>4</count>
<item_version>0</item_version>
<item>
<first>7</first>
<second>
<first>1150</first>
<second>10</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>1151</first>
<second>10</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>1150</first>
<second>10</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>1151</first>
<second>10</second>
</second>
</item>
</node2core>
</syndb>
</boost_serialization>
| 30.245928 | 80 | 0.472269 |
df3d28f5b925b649d58b16b1f9fd9a875d12d72c | 2,473 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-dilomk.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-dilomk.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-dilomk.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . D I M . L O N G _ M K S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2018-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.Dim.Generic_Mks;
package System.Dim.Long_Mks is new System.Dim.Generic_Mks (Long_Float);
| 70.657143 | 78 | 0.384553 |
c58a19dbb07b8364b7f4b76785b10c22e7a8ebb0 | 442 | adb | Ada | source/tasking/machine-pc-linux-gnu/s-multip.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/tasking/machine-pc-linux-gnu/s-multip.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/tasking/machine-pc-linux-gnu/s-multip.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | with C.bits.confname;
with C.unistd;
package body System.Multiprocessors is
use type C.signed_long;
function Number_Of_CPUs return CPU is
Result : C.signed_long;
begin
Result :=
C.unistd.sysconf (
C.bits.confname.Cast (C.unistd.SC_NPROCESSORS_ONLN));
if Result < 0 then
raise Program_Error;
end if;
return CPU (Result);
end Number_Of_CPUs;
end System.Multiprocessors;
| 23.263158 | 65 | 0.660633 |
237e55620ee367c110d8f8eed520210924e368a5 | 3,599 | ads | Ada | source/amf/dd/amf-dg-clip_paths-hash.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/dd/amf-dg-clip_paths-hash.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/dd/amf-dg-clip_paths-hash.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements.Generic_Hash;
function AMF.DG.Clip_Paths.Hash is
new AMF.Elements.Generic_Hash (DG_Clip_Path, DG_Clip_Path_Access);
| 71.98 | 78 | 0.399278 |
39999d47634f0cfd461ee59ca42ffb72959b5b03 | 77 | ads | Ada | src/gpr_tools.ads | persan/gprTools | 0a67ea3179a1a5802ca45014ed00c044a945e5a1 | [
"BSD-3-Clause"
] | 2 | 2015-05-15T16:03:26.000Z | 2018-12-26T19:32:41.000Z | src/gpr_tools.ads | persan/gprTools | 0a67ea3179a1a5802ca45014ed00c044a945e5a1 | [
"BSD-3-Clause"
] | null | null | null | src/gpr_tools.ads | persan/gprTools | 0a67ea3179a1a5802ca45014ed00c044a945e5a1 | [
"BSD-3-Clause"
] | null | null | null | package GPR_Tools is
VERSION : constant String := "2.0.3";
end GPR_Tools;
| 19.25 | 40 | 0.701299 |
205f47f12d3a802cafda676152f6741e8555af33 | 986 | ads | Ada | tests/util.ads | Componolit/libsparkcrypto | 8531a07b6e9f5eb33eae0fa32759b4cbd3509d95 | [
"OpenSSL",
"Unlicense"
] | 30 | 2018-05-18T09:11:50.000Z | 2021-05-18T16:29:14.000Z | tests/util.ads | Componolit/libsparkcrypto | 8531a07b6e9f5eb33eae0fa32759b4cbd3509d95 | [
"OpenSSL",
"Unlicense"
] | 15 | 2018-12-13T07:53:36.000Z | 2019-09-24T19:43:35.000Z | tests/util.ads | Componolit/libsparkcrypto | 8531a07b6e9f5eb33eae0fa32759b4cbd3509d95 | [
"OpenSSL",
"Unlicense"
] | 3 | 2019-04-04T17:41:29.000Z | 2021-05-07T22:28:46.000Z | with LSC.Types;
with LSC.Internal.Types;
with LSC.Internal.Byteorder32;
with LSC.Internal.Byteorder64;
package Util
is
function N (Item : LSC.Internal.Types.Word64) return LSC.Internal.Types.Word64
is (LSC.Internal.Byteorder64.BE_To_Native (Item));
function M (Item : LSC.Internal.Types.Word32) return LSC.Internal.Types.Word32
is (LSC.Internal.Byteorder32.BE_To_Native (Item));
-- Convert byte array to hex string
function B2S (Data : LSC.Types.Bytes) return String;
-- Convert hex string to byte array
function S2B (Data : String) return LSC.Types.Bytes;
-- Convert text to equivalent byte array representation
function T2B (Data : String) return LSC.Types.Bytes;
procedure T2B (Input : String;
Output : out LSC.Types.Bytes;
Last : out LSC.Types.Natural_Index);
-- Convert byte array to equivalent string representation
function B2T (Data : LSC.Types.Bytes) return String;
end Util;
| 30.8125 | 81 | 0.700811 |
cb852e3e8af30442a0d4857ce64e5e04d479278b | 38,140 | adb | Ada | test/halide_data/pldi_camera_ready/big_apps_32_real/conv2d/collateral/conv2d/hls_target/.autopilot/db/linebuffer_Loop_1_pr.bind.adb | David-Durst/embeddedHaskellAetherling | 34c5403e07433e572170699f3bd69c5b5c3eff2d | [
"BSD-3-Clause"
] | 20 | 2019-03-12T20:12:31.000Z | 2022-02-07T04:23:22.000Z | apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d/conv2d_div39/hls_target/.autopilot/db/linebuffer_Loop_1_pr.bind.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | 30 | 2019-07-22T19:25:42.000Z | 2020-06-18T17:58:43.000Z | test/halide_data/pldi_camera_ready/big_apps_32_real/conv2d/collateral/conv2d/hls_target/.autopilot/db/linebuffer_Loop_1_pr.bind.adb | David-Durst/embeddedHaskellAetherling | 34c5403e07433e572170699f3bd69c5b5c3eff2d | [
"BSD-3-Clause"
] | 3 | 2019-10-14T18:07:26.000Z | 2022-01-20T14:36:17.000Z | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="14">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>linebuffer_Loop_1_pr</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>in_axi_stream_V_value_V</name>
<fileName></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>stream&lt;AxiPackedStencil&lt;unsigned int, 1, 1, 1, 1&gt; &gt;.V.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>in_axi_stream_V_last_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>stream&lt;AxiPackedStencil&lt;unsigned int, 1, 1, 1, 1&gt; &gt;.V.last.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>in_stream_V_value_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>FIFO_SRL</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>6</id>
<name></name>
<fileName></fileName>
<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>24</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>indvar_flatten</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>36</item>
<item>37</item>
<item>38</item>
<item>39</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>exitcond_flatten</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>40</item>
<item>42</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>indvar_flatten_next</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>43</item>
<item>45</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>46</item>
<item>47</item>
<item>48</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>empty_16</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d</fileDirectory>
<lineNumber>554</lineNumber>
<contextFuncName>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d</first>
<second class_id="12" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="13" tracking_level="0" version="0">
<first class_id="14" tracking_level="0" version="0">
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&gt;</second>
</first>
<second>554</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>33</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>26</item>
<item>27</item>
<item>28</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>tmp_value_V</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d</fileDirectory>
<lineNumber>554</lineNumber>
<contextFuncName>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&gt;</second>
</first>
<second>554</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</oprand_edges>
<opcode>extractvalue</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d</fileDirectory>
<lineNumber>554</lineNumber>
<contextFuncName>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&gt;</second>
</first>
<second>554</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>31</item>
<item>32</item>
<item>33</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name></name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d</fileDirectory>
<lineNumber>552</lineNumber>
<contextFuncName>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_real/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer&lt;1920, 1080, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, unsigned int&gt;</second>
</first>
<second>552</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>34</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_14">
<Value>
<Obj>
<type>2</type>
<id>35</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_15">
<Value>
<Obj>
<type>2</type>
<id>41</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<const_type>0</const_type>
<content>2073600</content>
</item>
<item class_id_reference="16" object_id="_16">
<Value>
<Obj>
<type>2</type>
<id>44</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_17">
<Obj>
<type>3</type>
<id>7</id>
<name>newFuncRoot</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>6</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_18">
<Obj>
<type>3</type>
<id>12</id>
<name>.preheader.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>8</item>
<item>9</item>
<item>10</item>
<item>11</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_19">
<Obj>
<type>3</type>
<id>21</id>
<name>.preheader4.i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>16</item>
<item>17</item>
<item>18</item>
<item>20</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_20">
<Obj>
<type>3</type>
<id>23</id>
<name>.critedge.exitStub</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>22</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_21">
<id>24</id>
<edge_type>2</edge_type>
<source_obj>12</source_obj>
<sink_obj>6</sink_obj>
</item>
<item class_id_reference="20" object_id="_22">
<id>27</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_23">
<id>28</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_24">
<id>29</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_25">
<id>32</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_26">
<id>33</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_27">
<id>34</id>
<edge_type>2</edge_type>
<source_obj>12</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_28">
<id>36</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_29">
<id>37</id>
<edge_type>2</edge_type>
<source_obj>7</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_30">
<id>38</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_31">
<id>39</id>
<edge_type>2</edge_type>
<source_obj>21</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_32">
<id>40</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_33">
<id>42</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_34">
<id>43</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_35">
<id>45</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_36">
<id>46</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_37">
<id>47</id>
<edge_type>2</edge_type>
<source_obj>21</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_38">
<id>48</id>
<edge_type>2</edge_type>
<source_obj>23</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_39">
<id>108</id>
<edge_type>2</edge_type>
<source_obj>7</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_40">
<id>109</id>
<edge_type>2</edge_type>
<source_obj>12</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_41">
<id>110</id>
<edge_type>2</edge_type>
<source_obj>12</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_42">
<id>111</id>
<edge_type>2</edge_type>
<source_obj>21</source_obj>
<sink_obj>12</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_43">
<mId>1</mId>
<mTag>linebuffer_Loop_1_pr</mTag>
<mType>0</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>2073602</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_44">
<mId>2</mId>
<mTag>Entry</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_45">
<mId>3</mId>
<mTag>Loop 1</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>12</item>
<item>21</item>
</basic_blocks>
<mII>1</mII>
<mDepth>2</mDepth>
<mMinTripCount>2073600</mMinTripCount>
<mMaxTripCount>2073600</mMaxTripCount>
<mMinLatency>2073600</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_46">
<mId>4</mId>
<mTag>Return</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_47">
<states class_id="25" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_48">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_49">
<id>4</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_50">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_51">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_52">
<id>2</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_53">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_54">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_55">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_56">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_57">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_58">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_59">
<id>3</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_60">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_61">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_62">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_63">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_64">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_65">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_66">
<id>4</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_67">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_68">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>12</id>
<sop class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_69">
<inState>3</inState>
<outState>2</outState>
<condition>
<id>20</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_70">
<inState>2</inState>
<outState>4</outState>
<condition>
<id>19</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item class_id="34" tracking_level="0" version="0">
<first class_id="35" tracking_level="0" version="0">
<first>9</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_71">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>21</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>9</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="-1"></res>
<node_label_latency class_id="37" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>6</first>
<second class_id="39" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>8</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="40" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="41" tracking_level="0" version="0">
<first>7</first>
<second class_id="42" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>1</first>
<second>2</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="43" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="1" version="0" object_id="_72">
<region_name>Loop 1</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>12</item>
<item>21</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>2</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="45" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="46" tracking_level="0" version="0">
<first>48</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>56</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>67</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>74</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>80</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>86</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="48" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="49" tracking_level="0" version="0">
<first>exitcond_flatten_fu_74</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_80</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>indvar_flatten_phi_fu_67</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>tmp_value_V_fu_86</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>2</count>
<item_version>0</item_version>
<item>
<first>StgValue_17_write_fu_56</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>empty_16_read_fu_48</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="50" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>4</count>
<item_version>0</item_version>
<item>
<first>63</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>94</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>99</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>4</count>
<item_version>0</item_version>
<item>
<first>exitcond_flatten_reg_90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>indvar_flatten_next_reg_94</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_63</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>tmp_value_V_reg_99</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>1</count>
<item_version>0</item_version>
<item>
<first>63</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>1</count>
<item_version>0</item_version>
<item>
<first>indvar_flatten_reg_63</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="51" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="52" tracking_level="0" version="0">
<first>in_axi_stream_V_last_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
</second>
</item>
<item>
<first>in_axi_stream_V_value_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
</second>
</item>
<item>
<first>in_stream_V_value_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="53" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="54" tracking_level="0" version="0">
<first>3</first>
<second>FIFO_SRL</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 26.213058 | 134 | 0.601468 |
3960ed9401398e44b406478a1e6abb6576ecab36 | 3,686 | ads | Ada | source/streams/machine-apple-darwin/s-nateio.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/streams/machine-apple-darwin/s-nateio.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/streams/machine-apple-darwin/s-nateio.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | pragma License (Unrestricted);
-- implementation unit specialized for POSIX (Darwin, FreeBSD, or Linux)
with Ada.IO_Exceptions;
with Ada.IO_Modes;
with Ada.Streams;
with System.Native_IO;
with C.termios;
package System.Native_Text_IO is
pragma Preelaborate;
subtype Handle_Type is Native_IO.Handle_Type;
-- file management
Default_External : constant Ada.IO_Modes.File_External :=
Ada.IO_Modes.UTF_8;
Default_New_Line : constant Ada.IO_Modes.File_New_Line :=
Ada.IO_Modes.LF;
type Packed_Form is record
Stream_Form : Native_IO.Packed_Form;
External : Ada.IO_Modes.File_External_Spec;
New_Line : Ada.IO_Modes.File_New_Line_Spec;
end record;
pragma Suppress_Initialization (Packed_Form);
pragma Pack (Packed_Form);
-- read / write
subtype Buffer_Type is String (1 .. 6); -- one code-point of UTF-8
subtype DBCS_Buffer_Type is String (1 .. 6); -- unused
procedure To_UTF_8 (
Buffer : aliased DBCS_Buffer_Type;
Last : Natural;
Out_Buffer : out Buffer_Type;
Out_Last : out Natural)
with Import, Convention => Ada, External_Name => "__drake_program_error";
procedure To_DBCS (
Buffer : Buffer_Type;
Last : Natural;
Out_Buffer : aliased out DBCS_Buffer_Type;
Out_Last : out Natural)
with Import, Convention => Ada, External_Name => "__drake_program_error";
procedure Write_Just (
Handle : Handle_Type;
Item : String);
-- terminal
procedure Terminal_Get (
Handle : Handle_Type;
Item : Address;
Length : Ada.Streams.Stream_Element_Offset;
Out_Length : out Ada.Streams.Stream_Element_Offset) -- -1 when error
renames Native_IO.Read;
procedure Terminal_Get_Immediate (
Handle : Handle_Type;
Item : Address;
Length : Ada.Streams.Stream_Element_Offset;
Out_Length : out Ada.Streams.Stream_Element_Offset) -- -1 when error
renames Native_IO.Read;
procedure Terminal_Put (
Handle : Handle_Type;
Item : Address;
Length : Ada.Streams.Stream_Element_Offset;
Out_Length : out Ada.Streams.Stream_Element_Offset) -- -1 when error
renames Native_IO.Write;
procedure Terminal_Size (
Handle : Handle_Type;
Line_Length, Page_Length : out Natural);
procedure Set_Terminal_Size (
Handle : Handle_Type;
Line_Length, Page_Length : Natural);
procedure Terminal_View (
Handle : Handle_Type;
Left, Top : out Positive;
Right, Bottom : out Natural);
function Use_Terminal_Position (Handle : Handle_Type) return Boolean;
procedure Terminal_Position (
Handle : Handle_Type;
Col, Line : out Positive);
procedure Set_Terminal_Position (
Handle : Handle_Type;
Col, Line : Positive);
procedure Set_Terminal_Col (
Handle : Handle_Type;
To : Positive);
procedure Terminal_Clear (
Handle : Handle_Type);
subtype Setting is C.termios.struct_termios;
procedure Set_Non_Canonical_Mode (
Handle : Handle_Type;
Wait : Boolean;
Saved_Settings : aliased out Setting);
procedure Restore (
Handle : Handle_Type;
Settings : aliased Setting);
subtype Output_State is Natural; -- stacking count
procedure Save_State (Handle : Handle_Type; To_State : out Output_State);
procedure Reset_State (Handle : Handle_Type; From_State : Output_State);
-- exceptions
Status_Error : exception
renames Ada.IO_Exceptions.Status_Error;
Device_Error : exception
renames Ada.IO_Exceptions.Device_Error;
Data_Error : exception
renames Ada.IO_Exceptions.Data_Error;
end System.Native_Text_IO;
| 28.796875 | 79 | 0.697233 |
1c25d71fc1eb517a2417fa98018eb36569b3a0ec | 19,295 | adb | Ada | tools-src/gnu/gcc/gcc/ada/csinfo.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 80 | 2015-01-02T10:14:04.000Z | 2021-06-07T06:29:49.000Z | tools-src/gnu/gcc/gcc/ada/csinfo.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 9 | 2015-05-14T11:03:12.000Z | 2018-01-04T07:12:58.000Z | tools-src/gnu/gcc/gcc/ada/csinfo.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT SYSTEM UTILITIES --
-- --
-- C S I N F O --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-2001 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Program to check consistency of sinfo.ads and sinfo.adb. Checks that
-- field name usage is consistent and that assertion cross-reference lists
-- are correct, as well as making sure that all the comments on field name
-- usage are consistent.
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Ada.Strings.Unbounded.Text_IO; use Ada.Strings.Unbounded.Text_IO;
with Ada.Strings.Maps; use Ada.Strings.Maps;
with Ada.Strings.Maps.Constants; use Ada.Strings.Maps.Constants;
with Ada.Text_IO; use Ada.Text_IO;
with GNAT.Spitbol; use GNAT.Spitbol;
with GNAT.Spitbol.Patterns; use GNAT.Spitbol.Patterns;
with GNAT.Spitbol.Table_Boolean;
with GNAT.Spitbol.Table_VString;
procedure CSinfo is
package TB renames GNAT.Spitbol.Table_Boolean;
package TV renames GNAT.Spitbol.Table_VString;
use TB, TV;
Infil : File_Type;
Lineno : Natural := 0;
Err : exception;
-- Raised on fatal error
Done : exception;
-- Raised after error is found to terminate run
WSP : Pattern := Span (' ' & ASCII.HT);
Fields : TV.Table (300);
Fields1 : TV.Table (300);
Refs : TV.Table (300);
Refscopy : TV.Table (300);
Special : TB.Table (50);
Inlines : TV.Table (100);
-- The following define the standard fields used for binary operator,
-- unary operator, and other expression nodes. Numbers in the range 1-5
-- refer to the Fieldn fields. Letters D-R refer to flags:
-- D = Flag4
-- E = Flag5
-- F = Flag6
-- G = Flag7
-- H = Flag8
-- I = Flag9
-- J = Flag10
-- K = Flag11
-- L = Flag12
-- M = Flag13
-- N = Flag14
-- O = Flag15
-- P = Flag16
-- Q = Flag17
-- R = Flag18
Flags : TV.Table (20);
-- Maps flag numbers to letters
N_Fields : Pattern := BreakX ("JL");
E_Fields : Pattern := BreakX ("5EFGHIJLOP");
U_Fields : Pattern := BreakX ("1345EFGHIJKLOPQ");
B_Fields : Pattern := BreakX ("12345EFGHIJKLOPQ");
Line : VString;
Bad : Boolean;
Field : VString := Nul;
Fields_Used : VString := Nul;
Name : VString := Nul;
Next : VString := Nul;
Node : VString := Nul;
Ref : VString := Nul;
Synonym : VString := Nul;
Nxtref : VString := Nul;
Which_Field : aliased VString := Nul;
Node_Search : Pattern := WSP & "-- N_" & Rest * Node;
Break_Punc : Pattern := Break (" .,");
Plus_Binary : Pattern := WSP & "-- plus fields for binary operator";
Plus_Unary : Pattern := WSP & "-- plus fields for unary operator";
Plus_Expr : Pattern := WSP & "-- plus fields for expression";
Break_Syn : Pattern := WSP & "-- " & Break (' ') * Synonym &
" (" & Break (')') * Field;
Break_Field : Pattern := BreakX ('-') * Field;
Get_Field : Pattern := BreakX (Decimal_Digit_Set) &
Span (Decimal_Digit_Set) * Which_Field;
Break_WFld : Pattern := Break (Which_Field'Access);
Get_Funcsyn : Pattern := WSP & "function " & Rest * Synonym;
Extr_Field : Pattern := BreakX ('-') & "-- " & Rest * Field;
Get_Procsyn : Pattern := WSP & "procedure Set_" & Rest * Synonym;
Get_Inline : Pattern := WSP & "pragma Inline (" & Break (')') * Name;
Set_Name : Pattern := "Set_" & Rest * Name;
Func_Rest : Pattern := " function " & Rest * Synonym;
Get_Nxtref : Pattern := Break (',') * Nxtref & ',';
Test_Syn : Pattern := Break ('=') & "= N_" &
(Break (" ,)") or Rest) * Next;
Chop_Comma : Pattern := BreakX (',') * Next;
Return_Fld : Pattern := WSP & "return " & Break (' ') * Field;
Set_Syn : Pattern := " procedure Set_" & Rest * Synonym;
Set_Fld : Pattern := WSP & "Set_" & Break (' ') * Field & " (N, Val)";
Break_With : Pattern := Break ('_') ** Field & "_With_Parent";
type VStringA is array (Natural range <>) of VString;
procedure Next_Line;
-- Read next line trimmed from Infil into Line and bump Lineno
procedure Sort (A : in out VStringA);
-- Sort a (small) array of VString's
procedure Next_Line is
begin
Line := Get_Line (Infil);
Trim (Line);
Lineno := Lineno + 1;
end Next_Line;
procedure Sort (A : in out VStringA) is
Temp : VString;
begin
<<Sort>>
for J in 1 .. A'Length - 1 loop
if A (J) > A (J + 1) then
Temp := A (J);
A (J) := A (J + 1);
A (J + 1) := Temp;
goto Sort;
end if;
end loop;
end Sort;
-- Start of processing for CSinfo
begin
Anchored_Mode := True;
New_Line;
Open (Infil, In_File, "sinfo.ads");
Put_Line ("Check for field name consistency");
-- Setup table for mapping flag numbers to letters
Set (Flags, "4", V ("D"));
Set (Flags, "5", V ("E"));
Set (Flags, "6", V ("F"));
Set (Flags, "7", V ("G"));
Set (Flags, "8", V ("H"));
Set (Flags, "9", V ("I"));
Set (Flags, "10", V ("J"));
Set (Flags, "11", V ("K"));
Set (Flags, "12", V ("L"));
Set (Flags, "13", V ("M"));
Set (Flags, "14", V ("N"));
Set (Flags, "15", V ("O"));
Set (Flags, "16", V ("P"));
Set (Flags, "17", V ("Q"));
Set (Flags, "18", V ("R"));
-- Special fields table. The following fields are not recorded or checked
-- by Csinfo, since they are specially handled. This means that he both
-- the field definitions, and the corresponding subprograms are ignored.
Set (Special, "Analyzed", True);
Set (Special, "Assignment_OK", True);
Set (Special, "Associated_Node", True);
Set (Special, "Cannot_Be_Constant", True);
Set (Special, "Chars", True);
Set (Special, "Comes_From_Source", True);
Set (Special, "Do_Overflow_Check", True);
Set (Special, "Do_Range_Check", True);
Set (Special, "Entity", True);
Set (Special, "Error_Posted", True);
Set (Special, "Etype", True);
Set (Special, "Evaluate_Once", True);
Set (Special, "First_Itype", True);
Set (Special, "Has_Dynamic_Itype", True);
Set (Special, "Has_Dynamic_Range_Check", True);
Set (Special, "Has_Dynamic_Length_Check", True);
Set (Special, "Has_Private_View", True);
Set (Special, "Is_Controlling_Actual", True);
Set (Special, "Is_Overloaded", True);
Set (Special, "Is_Static_Expression", True);
Set (Special, "Left_Opnd", True);
Set (Special, "Must_Not_Freeze", True);
Set (Special, "Parens", True);
Set (Special, "Raises_Constraint_Error", True);
Set (Special, "Right_Opnd", True);
-- Loop to acquire information from node definitions in sinfo.ads,
-- checking for consistency in Op/Flag assignments to each synonym
loop
Bad := False;
Next_Line;
exit when Match (Line, " -- Node Access Functions");
if Match (Line, Node_Search)
and then not Match (Node, Break_Punc)
then
Fields_Used := Nul;
elsif Node = "" then
null;
elsif Line = "" then
Node := Nul;
elsif Match (Line, Plus_Binary) then
Bad := Match (Fields_Used, B_Fields);
elsif Match (Line, Plus_Unary) then
Bad := Match (Fields_Used, U_Fields);
elsif Match (Line, Plus_Expr) then
Bad := Match (Fields_Used, E_Fields);
elsif not Match (Line, Break_Syn) then
null;
elsif Match (Synonym, "plus") then
null;
else
Match (Field, Break_Field);
if not Present (Special, Synonym) then
if Present (Fields, Synonym) then
if Field /= Get (Fields, Synonym) then
Put_Line
("Inconsistent field reference at line" &
Lineno'Img & " for " & Synonym);
raise Done;
end if;
else
Set (Fields, Synonym, Field);
end if;
Set (Refs, Synonym, Node & ',' & Get (Refs, Synonym));
Match (Field, Get_Field);
if Match (Field, "Flag") then
Which_Field := Get (Flags, Which_Field);
end if;
if Match (Fields_Used, Break_WFld) then
Put_Line
("Overlapping field at line " & Lineno'Img &
" for " & Synonym);
raise Done;
end if;
Append (Fields_Used, Which_Field);
Bad := Bad or Match (Fields_Used, N_Fields);
end if;
end if;
if Bad then
Put_Line ("fields conflict with standard fields for node " & Node);
end if;
end loop;
Put_Line (" OK");
New_Line;
Put_Line ("Check for function consistency");
-- Loop through field function definitions to make sure they are OK
Fields1 := Fields;
loop
Next_Line;
exit when Match (Line, " -- Node Update");
if Match (Line, Get_Funcsyn)
and then not Present (Special, Synonym)
then
if not Present (Fields1, Synonym) then
Put_Line
("function on line " & Lineno &
" is for unused synonym");
raise Done;
end if;
Next_Line;
if not Match (Line, Extr_Field) then
raise Err;
end if;
if Field /= Get (Fields1, Synonym) then
Put_Line ("Wrong field in function " & Synonym);
raise Done;
else
Delete (Fields1, Synonym);
end if;
end if;
end loop;
Put_Line (" OK");
New_Line;
Put_Line ("Check for missing functions");
declare
List : TV.Table_Array := Convert_To_Array (Fields1);
begin
if List'Length > 0 then
Put_Line ("No function for field synonym " & List (1).Name);
raise Done;
end if;
end;
-- Check field set procedures
Put_Line (" OK");
New_Line;
Put_Line ("Check for set procedure consistency");
Fields1 := Fields;
loop
Next_Line;
exit when Match (Line, " -- Inline Pragmas");
exit when Match (Line, " -- Iterator Procedures");
if Match (Line, Get_Procsyn)
and then not Present (Special, Synonym)
then
if not Present (Fields1, Synonym) then
Put_Line
("procedure on line " & Lineno & " is for unused synonym");
raise Done;
end if;
Next_Line;
if not Match (Line, Extr_Field) then
raise Err;
end if;
if Field /= Get (Fields1, Synonym) then
Put_Line ("Wrong field in procedure Set_" & Synonym);
raise Done;
else
Delete (Fields1, Synonym);
end if;
end if;
end loop;
Put_Line (" OK");
New_Line;
Put_Line ("Check for missing set procedures");
declare
List : TV.Table_Array := Convert_To_Array (Fields1);
begin
if List'Length > 0 then
Put_Line ("No procedure for field synonym Set_" & List (1).Name);
raise Done;
end if;
end;
Put_Line (" OK");
New_Line;
Put_Line ("Check pragma Inlines are all for existing subprograms");
Clear (Fields1);
while not End_Of_File (Infil) loop
Next_Line;
if Match (Line, Get_Inline)
and then not Present (Special, Name)
then
exit when Match (Name, Set_Name);
if not Present (Fields, Name) then
Put_Line
("Pragma Inline on line " & Lineno &
" does not correspond to synonym");
raise Done;
else
Set (Inlines, Name, Get (Inlines, Name) & 'r');
end if;
end if;
end loop;
Put_Line (" OK");
New_Line;
Put_Line ("Check no pragma Inlines were omitted");
declare
List : TV.Table_Array := Convert_To_Array (Fields);
Nxt : VString := Nul;
begin
for M in List'Range loop
Nxt := List (M).Name;
if Get (Inlines, Nxt) /= "r" then
Put_Line ("Incorrect pragma Inlines for " & Nxt);
raise Done;
end if;
end loop;
end;
Put_Line (" OK");
New_Line;
Clear (Inlines);
Close (Infil);
Open (Infil, In_File, "sinfo.adb");
Lineno := 0;
Put_Line ("Check references in functions in body");
Refscopy := Refs;
loop
Next_Line;
exit when Match (Line, " -- Field Access Functions --");
end loop;
loop
Next_Line;
exit when Match (Line, " -- Field Set Procedures --");
if Match (Line, Func_Rest)
and then not Present (Special, Synonym)
then
Ref := Get (Refs, Synonym);
Delete (Refs, Synonym);
if Ref = "" then
Put_Line
("Function on line " & Lineno & " is for unknown synonym");
raise Err;
end if;
-- Alpha sort of references for this entry
declare
Refa : VStringA (1 .. 100);
N : Natural := 0;
begin
loop
exit when not Match (Ref, Get_Nxtref, Nul);
N := N + 1;
Refa (N) := Nxtref;
end loop;
Sort (Refa (1 .. N));
Next_Line;
Next_Line;
Next_Line;
-- Checking references for one entry
for M in 1 .. N loop
Next_Line;
if not Match (Line, Test_Syn) then
Put_Line ("Expecting N_" & Refa (M) & " at line " & Lineno);
raise Done;
end if;
Match (Next, Chop_Comma);
if Next /= Refa (M) then
Put_Line ("Expecting N_" & Refa (M) & " at line " & Lineno);
raise Done;
end if;
end loop;
Next_Line;
Match (Line, Return_Fld);
if Field /= Get (Fields, Synonym) then
Put_Line
("Wrong field for function " & Synonym & " at line " &
Lineno & " should be " & Get (Fields, Synonym));
raise Done;
end if;
end;
end if;
end loop;
Put_Line (" OK");
New_Line;
Put_Line ("Check for missing functions in body");
declare
List : TV.Table_Array := Convert_To_Array (Refs);
begin
if List'Length /= 0 then
Put_Line ("Missing function " & List (1).Name & " in body");
raise Done;
end if;
end;
Put_Line (" OK");
New_Line;
Put_Line ("Check Set procedures in body");
Refs := Refscopy;
loop
Next_Line;
exit when Match (Line, "end");
exit when Match (Line, " -- Iterator Procedures");
if Match (Line, Set_Syn)
and then not Present (Special, Synonym)
then
Ref := Get (Refs, Synonym);
Delete (Refs, Synonym);
if Ref = "" then
Put_Line
("Function on line " & Lineno & " is for unknown synonym");
raise Err;
end if;
-- Alpha sort of references for this entry
declare
Refa : VStringA (1 .. 100);
N : Natural;
begin
N := 0;
loop
exit when not Match (Ref, Get_Nxtref, Nul);
N := N + 1;
Refa (N) := Nxtref;
end loop;
Sort (Refa (1 .. N));
Next_Line;
Next_Line;
Next_Line;
-- Checking references for one entry
for M in 1 .. N loop
Next_Line;
if not Match (Line, Test_Syn)
or else Next /= Refa (M)
then
Put_Line ("Expecting N_" & Refa (M) & " at line " & Lineno);
raise Err;
end if;
end loop;
loop
Next_Line;
exit when Match (Line, Set_Fld);
end loop;
Match (Field, Break_With);
if Field /= Get (Fields, Synonym) then
Put_Line
("Wrong field for procedure Set_" & Synonym &
" at line " & Lineno & " should be " &
Get (Fields, Synonym));
raise Done;
end if;
Delete (Fields1, Synonym);
end;
end if;
end loop;
Put_Line (" OK");
New_Line;
Put_Line ("Check for missing set procedures in body");
declare
List : TV.Table_Array := Convert_To_Array (Fields1);
begin
if List'Length /= 0 then
Put_Line ("Missing procedure Set_" & List (1).Name & " in body");
raise Done;
end if;
end;
Put_Line (" OK");
New_Line;
Put_Line ("All tests completed successfully, no errors detected");
exception
when Done =>
null;
end CSinfo;
| 30.290424 | 78 | 0.503913 |
206e90d7083efafd0b6f838a3902b11abb913404 | 54,722 | ads | Ada | src/GUI/generated/digit_2.ads | Fabien-Chouteau/coffee-clock | 6b8b8dd8741887c522fcf6f1ce5f1a5b73921b27 | [
"MIT"
] | 7 | 2017-05-17T13:51:47.000Z | 2021-11-11T19:17:50.000Z | src/GUI/generated/digit_2.ads | Fabien-Chouteau/coffee-clock | 6b8b8dd8741887c522fcf6f1ce5f1a5b73921b27 | [
"MIT"
] | null | null | null | src/GUI/generated/digit_2.ads | Fabien-Chouteau/coffee-clock | 6b8b8dd8741887c522fcf6f1ce5f1a5b73921b27 | [
"MIT"
] | null | null | null | -- This file was generated by bmp2ada
with Giza.Image;
with Giza.Image.DMA2D;
use Giza.Image.DMA2D;
package digit_2 is
pragma Style_Checks (Off);
CLUT : aliased constant L4_CLUT_T := (
(R => 0, G => 0, B => 0),
(R => 255, G => 0, B => 0), others => (0, 0, 0));
Data : aliased constant L4_Data_T := (
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17,
17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 16, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
);
Image : constant Giza.Image.Ref := new Giza.Image.DMA2D.Instance'
(Mode => L4, W => 160, H => 195, Length => 15600, L4_CLUT => CLUT'Access, L4_Data => Data'Access);
pragma Style_Checks (On);
end digit_2;
| 165.323263 | 200 | 0.420452 |
23659fbee7baf6da32dfd64ffebced54813fdbfd | 9,842 | adb | Ada | source/amf/uml/amf-internals-umldi_uml_compartmentable_shapes.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-internals-umldi_uml_compartmentable_shapes.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-internals-umldi_uml_compartmentable_shapes.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.Elements;
with AMF.Internals.Element_Collections;
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_Compartmentable_Shapes is
---------------------
-- Get_Compartment --
---------------------
overriding function Get_Compartment
(Self : not null access constant UMLDI_UML_Compartmentable_Shape_Proxy)
return AMF.UMLDI.UML_Compartments.Collections.Ordered_Set_Of_UMLDI_UML_Compartment is
begin
return
AMF.UMLDI.UML_Compartments.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Compartment
(Self.Element)));
end Get_Compartment;
-----------------
-- Get_Is_Icon --
-----------------
overriding function Get_Is_Icon
(Self : not null access constant UMLDI_UML_Compartmentable_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_Compartmentable_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_Compartmentable_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_Compartmentable_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_Compartmentable_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_Compartmentable_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_Compartmentable_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_Compartmentable_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;
-------------------
-- Enter_Element --
-------------------
overriding procedure Enter_Element
(Self : not null access constant UMLDI_UML_Compartmentable_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_Compartmentable_Shape
(AMF.UMLDI.UML_Compartmentable_Shapes.UMLDI_UML_Compartmentable_Shape_Access (Self),
Control);
end if;
end Enter_Element;
-------------------
-- Leave_Element --
-------------------
overriding procedure Leave_Element
(Self : not null access constant UMLDI_UML_Compartmentable_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_Compartmentable_Shape
(AMF.UMLDI.UML_Compartmentable_Shapes.UMLDI_UML_Compartmentable_Shape_Access (Self),
Control);
end if;
end Leave_Element;
-------------------
-- Visit_Element --
-------------------
overriding procedure Visit_Element
(Self : not null access constant UMLDI_UML_Compartmentable_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_Compartmentable_Shape
(Visitor,
AMF.UMLDI.UML_Compartmentable_Shapes.UMLDI_UML_Compartmentable_Shape_Access (Self),
Control);
end if;
end Visit_Element;
end AMF.Internals.UMLDI_UML_Compartmentable_Shapes;
| 41.527426 | 96 | 0.5696 |
1c2eb1fa9e05ebaac2919fbb6fd176f9a8461135 | 8,335 | ads | Ada | src/sdl-video-windows.ads | Fabien-Chouteau/sdlada | f08d72e3f5dcec228d68fb5b6681ea831f81ef47 | [
"Zlib"
] | null | null | null | src/sdl-video-windows.ads | Fabien-Chouteau/sdlada | f08d72e3f5dcec228d68fb5b6681ea831f81ef47 | [
"Zlib"
] | null | null | null | src/sdl-video-windows.ads | Fabien-Chouteau/sdlada | f08d72e3f5dcec228d68fb5b6681ea831f81ef47 | [
"Zlib"
] | null | null | null | --------------------------------------------------------------------------------------------------------------------
-- Copyright (c) 2013-2020, Luke A. Guest
--
-- This software is provided 'as-is', without any express or implied
-- warranty. In no event will the authors be held liable for any damages
-- arising from the use of this software.
--
-- Permission is granted to anyone to use this software for any purpose,
-- including commercial applications, and to alter it and redistribute it
-- freely, subject to the following restrictions:
--
-- 1. The origin of this software must not be misrepresented; you must not
-- claim that you wrote the original software. If you use this software
-- in a product, an acknowledgment in the product documentation would be
-- appreciated but is not required.
--
-- 2. Altered source versions must be plainly marked as such, and must not be
-- misrepresented as being the original software.
--
-- 3. This notice may not be removed or altered from any source
-- distribution.
--------------------------------------------------------------------------------------------------------------------
-- SDL.Video.Windows
--
-- Operating system window access and control.
--------------------------------------------------------------------------------------------------------------------
with Ada.Finalization;
with Ada.Strings.UTF_Encoding;
private with SDL.C_Pointers;
with SDL.Video.Displays;
with SDL.Video.Pixel_Formats;
with SDL.Video.Rectangles;
with SDL.Video.Surfaces;
with System;
package SDL.Video.Windows is
Window_Error : exception;
-- Return a special coordinate value to indicate that you don't care what
-- the window position is. Note that you can still specify a target
-- display.
function Undefined_Window_Position
(Display : Natural := 0) return SDL.Natural_Coordinate;
-- Return a special coordinate value to indicate that the window position
-- should be centered.
function Centered_Window_Position
(Display : Natural := 0) return SDL.Natural_Coordinate;
type Window_Flags is mod 2 ** 32 with
Convention => C;
Windowed : constant Window_Flags := 16#0000_0000#;
Full_Screen : constant Window_Flags := 16#0000_0001#;
OpenGL : constant Window_Flags := 16#0000_0002#;
Shown : constant Window_Flags := 16#0000_0004#;
Hidden : constant Window_Flags := 16#0000_0008#;
Borderless : constant Window_Flags := 16#0000_0010#;
Resizable : constant Window_Flags := 16#0000_0020#;
Minimised : constant Window_Flags := 16#0000_0040#;
Maximised : constant Window_Flags := 16#0000_0080#;
Input_Grabbed : constant Window_Flags := 16#0000_0100#;
Input_Focus : constant Window_Flags := 16#0000_0200#;
Mouse_Focus : constant Window_Flags := 16#0000_0400#;
Full_Screen_Desktop : constant Window_Flags := Full_Screen or 16#0000_1000#;
Foreign : constant Window_Flags := 16#0000_0800#; -- TODO: Not implemented yet.
-- TODO: This isn't raising any exception when I pass a different value for some reason.
subtype Full_Screen_Flags is Window_Flags with
Static_Predicate => Full_Screen_Flags in Windowed | Full_Screen | Full_Screen_Desktop;
type ID is mod 2 ** 32 with
Convention => C;
type Native_Window is private;
-- Allow users to derive new types from this.
type User_Data is tagged private;
type User_Data_Access is access all User_Data'Class;
pragma No_Strict_Aliasing (User_Data_Access);
-- TODO: Check this type!
type Brightness is digits 3 range 0.0 .. 1.0;
-- type Window is tagged limited Private;
type Window is new Ada.Finalization.Limited_Controlled with private;
Null_Window : constant Window;
-- TODO: Normalise the API by adding a destroy sub program and making this one call destroy,
-- see textures for more info.
overriding
procedure Finalize (Self : in out Window);
function Get_Brightness (Self : in Window) return Brightness with
Inline => True;
procedure Set_Brightness (Self : in out Window; How_Bright : in Brightness);
function Get_Data (Self : in Window; Name : in String) return User_Data_Access;
function Set_Data (Self : in out Window; Name : in String; Item : in User_Data_Access) return User_Data_Access;
function Display_Index (Self : in Window) return SDL.Video.Displays.Display_Indices;
procedure Get_Display_Mode (Self : in Window; Mode : out SDL.Video.Displays.Mode);
procedure Set_Display_Mode (Self : in out Window; Mode : in SDL.Video.Displays.Mode);
function Get_Flags (Self : in Window) return Window_Flags;
function From_ID (Window_ID : in ID) return Window;
procedure Get_Gamma_Ramp (Self : in Window; Red, Green, Blue : out SDL.Video.Pixel_Formats.Gamma_Ramp);
procedure Set_Gamma_Ramp (Self : in out Window; Red, Green, Blue : in SDL.Video.Pixel_Formats.Gamma_Ramp);
function Is_Grabbed (Self : in Window) return Boolean with
Inline => True;
procedure Set_Grabbed (Self : in out Window; Grabbed : in Boolean := True) with
Inline => True;
function Get_ID (Self : in Window) return ID with
Inline => True;
function Get_Maximum_Size (Self : in Window) return SDL.Sizes;
procedure Set_Maximum_Size (Self : in out Window; Size : in SDL.Sizes) with
Inline => True;
function Get_Minimum_Size (Self : in Window) return SDL.Sizes;
procedure Set_Minimum_Size (Self : in out Window; Size : in SDL.Sizes) with
Inline => True;
function Pixel_Format (Self : in Window) return SDL.Video.Pixel_Formats.Pixel_Format with
Inline => True;
function Get_Position (Self : in Window) return SDL.Natural_Coordinates;
procedure Set_Position (Self : in out Window; Position : SDL.Natural_Coordinates) with
Inline => True;
function Get_Size (Self : in Window) return SDL.Sizes;
procedure Set_Size (Self : in out Window; Size : in SDL.Sizes) with
Inline => True;
function Get_Surface (Self : in Window) return SDL.Video.Surfaces.Surface;
function Get_Title (Self : in Window) return Ada.Strings.UTF_Encoding.UTF_8_String;
procedure Set_Title (Self : in Window; Title : in Ada.Strings.UTF_Encoding.UTF_8_String);
-- SDL_GetWindowWMInfo
procedure Hide (Self : in Window) with
Inline => True;
procedure Show (Self : in Window) with
Inline => True;
procedure Maximise (Self : in Window) with
Inline => True;
procedure Minimise (Self : in Window) with
Inline => True;
procedure Raise_And_Focus (Self : in Window) with
Inline => True;
procedure Restore (Self : in Window) with
Inline => True;
procedure Set_Mode (Self : in out Window; Flags : in Full_Screen_Flags);
procedure Set_Icon (Self : in out Window; Icon : in SDL.Video.Surfaces.Surface) with
Inline => True;
procedure Update_Surface (Self : in Window);
procedure Update_Surface_Rectangle (Self : in Window; Rectangle : in SDL.Video.Rectangles.Rectangle);
procedure Update_Surface_Rectangles (Self : in Window; Rectangles : in SDL.Video.Rectangles.Rectangle_Arrays);
-- Determine whether any windows have been created.
function Exist return Boolean with
Inline => True;
private
-- TODO: Make this a proper type.
type Native_Window is new System.Address;
type User_Data is new Ada.Finalization.Controlled with null record;
type Window is new Ada.Finalization.Limited_Controlled with
record
Internal : SDL.C_Pointers.Windows_Pointer := null; -- System.Address := System.Null_Address;
Owns : Boolean := True; -- Does this Window type own the Internal data?
end record;
function Get_Internal_Window (Self : in Window) return SDL.C_Pointers.Windows_Pointer with
Export => True,
Convention => Ada;
Null_Window : constant Window := (Ada.Finalization.Limited_Controlled with
Internal => null, -- System.Null_Address,
Owns => True);
Total_Windows_Created : Natural := Natural'First;
procedure Increment_Windows;
procedure Decrement_Windows;
end SDL.Video.Windows;
| 40.2657 | 116 | 0.670786 |
cb3a7711b1cdffdeb6308ff4fb0da35add750b7d | 913 | ads | Ada | tests/src/test_urlsafe.ads | AntonMeep/base64 | 41f0c5dfb95d999e0140b9a575ca3c2ae8c26fe1 | [
"0BSD"
] | null | null | null | tests/src/test_urlsafe.ads | AntonMeep/base64 | 41f0c5dfb95d999e0140b9a575ca3c2ae8c26fe1 | [
"0BSD"
] | null | null | null | tests/src/test_urlsafe.ads | AntonMeep/base64 | 41f0c5dfb95d999e0140b9a575ca3c2ae8c26fe1 | [
"0BSD"
] | null | null | null | with AUnit.Test_Suites;
with AUnit.Test_Fixtures;
package Test_URLSafe is
function Suite return AUnit.Test_Suites.Access_Test_Suite;
private
type Test is new AUnit.Test_Fixtures.Test_Fixture with null record;
procedure Test_Encoding_Empty (Object : in out Test);
procedure Test_Encoding_Pad2 (Object : in out Test);
procedure Test_Encoding_Pad1 (Object : in out Test);
procedure Test_Encoding_Pad0 (Object : in out Test);
procedure Test_Encoding_Big (Object : in out Test);
procedure Test_Encoding_RFC4648 (Object : in out Test);
procedure Test_Decoding_Empty (Object : in out Test);
procedure Test_Decoding_Pad2 (Object : in out Test);
procedure Test_Decoding_Pad1 (Object : in out Test);
procedure Test_Decoding_Pad0 (Object : in out Test);
procedure Test_Decoding_Big (Object : in out Test);
procedure Test_Decoding_RFC4648 (Object : in out Test);
end Test_URLSafe;
| 41.5 | 70 | 0.771084 |
1c3b9b99a090f2509c57dcbc012fa1125101bc89 | 1,547 | ads | Ada | source/tabula-users.ads | ytomino/vampire | 2ff6c93af53e55c89cab70fedb63accba83bcd92 | [
"OpenSSL",
"Unlicense"
] | 1 | 2016-12-19T13:25:14.000Z | 2016-12-19T13:25:14.000Z | source/tabula-users.ads | ytomino/vampire | 2ff6c93af53e55c89cab70fedb63accba83bcd92 | [
"OpenSSL",
"Unlicense"
] | null | null | null | source/tabula-users.ads | ytomino/vampire | 2ff6c93af53e55c89cab70fedb63accba83bcd92 | [
"OpenSSL",
"Unlicense"
] | null | null | null | -- The Village of Vampire by YT, このソースコードはNYSLです
with Ada.Calendar;
with Ada.Strings.Unbounded;
with Tabula.Calendar;
private with Ada.Streams;
package Tabula.Users is
-- Id
Administrator : constant String := "administrator";
function Valid_Id_String (Id : String) return Boolean;
-- Password
type Password_Digest is private;
Null_Password_Digest : constant Password_Digest;
function Digest (Password : String) return Password_Digest;
subtype Password_Digest_Image is String (1 .. 32);
function Image (Digest : Password_Digest) return Password_Digest_Image;
function Value (Image : Password_Digest_Image) return Password_Digest;
-- User Info
type User_Info is record
-- MD5ハッシュ済みパスワード
Password : Password_Digest;
-- ユーザー作成時の情報
Creation_Remote_Addr : Ada.Strings.Unbounded.Unbounded_String;
Creation_Remote_Host : Ada.Strings.Unbounded.Unbounded_String;
Creation_Time : Ada.Calendar.Time := Tabula.Calendar.Null_Time;
-- 最終アクセス時の情報
Last_Remote_Addr : Ada.Strings.Unbounded.Unbounded_String;
Last_Remote_Host : Ada.Strings.Unbounded.Unbounded_String;
Last_Time : Ada.Calendar.Time := Tabula.Calendar.Null_Time;
-- ペナルティなど
Ignore_Request : Boolean := False;
Disallow_New_Village : Boolean := False;
No_Log : Boolean := False;
-- IDを変更した場合
Renamed : aliased Ada.Strings.Unbounded.Unbounded_String;
end record;
private
type Password_Digest is new Ada.Streams.Stream_Element_Array (0 .. 15);
Null_Password_Digest : constant Password_Digest := (others => 0);
end Tabula.Users;
| 28.127273 | 72 | 0.764706 |
0e7214b53cdbca3c8f1a2f4e7651dd4441b91596 | 50 | ads | Ada | src/seminar.ads | aeszter/sharepoint2ics | 9f56213e310914261894ef84c9ac84d309eb0b8d | [
"MIT"
] | null | null | null | src/seminar.ads | aeszter/sharepoint2ics | 9f56213e310914261894ef84c9ac84d309eb0b8d | [
"MIT"
] | null | null | null | src/seminar.ads | aeszter/sharepoint2ics | 9f56213e310914261894ef84c9ac84d309eb0b8d | [
"MIT"
] | null | null | null |
package Seminar is
pragma Pure;
end Seminar;
| 8.333333 | 18 | 0.72 |
3976d7992333c421ec50685f4f56584c1106024a | 752 | adb | Ada | llvm-gcc-4.2-2.9/gcc/testsuite/gnat.dg/boolean_subtype.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 1 | 2016-04-09T02:58:13.000Z | 2016-04-09T02:58:13.000Z | llvm-gcc-4.2-2.9/gcc/testsuite/gnat.dg/boolean_subtype.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/testsuite/gnat.dg/boolean_subtype.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | -- { dg-do compile }
-- { dg-options "-O2" }
procedure boolean_subtype is
subtype Component_T is Boolean;
function Condition return Boolean is
begin
return True;
end;
V : Integer := 0;
function Component_Value return Integer is
begin
V := V + 1;
return V;
end;
Most_Significant : Component_T := False;
Least_Significant : Component_T := True;
begin
if Condition then
Most_Significant := True;
end if;
if Condition then
Least_Significant := Component_T'Val (Component_Value);
end if;
if Least_Significant < Most_Significant then
Least_Significant := Most_Significant;
end if;
if Least_Significant /= True then
raise Program_Error;
end if;
end;
| 17.488372 | 61 | 0.658245 |
109b4925011325f8f80d57040637d6fc3e83f968 | 241,242 | adb | Ada | final-project/repositories/Deep_Learning_Inference_Accelerator_with_CNNIOT/MSOC_final-main/finalconv_hls/parallel_Cin/.autopilot/db/load_cifm_data.adb | bol-edu/2020-fall-ntu | 5e009875dec5a3bbcebd1b3fae327990371d1b6a | [
"MIT"
] | 7 | 2021-02-10T17:59:48.000Z | 2021-09-27T15:02:56.000Z | final-project/repositories/Deep_Learning_Inference_Accelerator_with_CNNIOT/MSOC_final-main/finalconv_hls/parallel_Cin/.autopilot/db/load_cifm_data.adb | bol-edu/2020-fall-ntu | 5e009875dec5a3bbcebd1b3fae327990371d1b6a | [
"MIT"
] | null | null | null | final-project/repositories/Deep_Learning_Inference_Accelerator_with_CNNIOT/MSOC_final-main/finalconv_hls/parallel_Cin/.autopilot/db/load_cifm_data.adb | bol-edu/2020-fall-ntu | 5e009875dec5a3bbcebd1b3fae327990371d1b6a | [
"MIT"
] | 1 | 2022-03-22T01:46:01.000Z | 2022-03-22T01:46:01.000Z | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="15">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName/>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>load_cifm_data</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>cifm</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>cifm</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>512</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>ifm_buff0_0</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ifm_buff0[0]</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>34</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>ifm_buff0_1</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ifm_buff0[1]</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>34</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_4">
<Value>
<Obj>
<type>1</type>
<id>4</id>
<name>ifm_buff0_2</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ifm_buff0[2]</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>34</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_5">
<Value>
<Obj>
<type>1</type>
<id>5</id>
<name>ifm_buff1_0</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ifm_buff1[0]</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>34</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_6">
<Value>
<Obj>
<type>1</type>
<id>6</id>
<name>ifm_buff1_1</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ifm_buff1[1]</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>34</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_7">
<Value>
<Obj>
<type>1</type>
<id>7</id>
<name>ifm_buff1_2</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ifm_buff1[2]</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>34</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_8">
<Value>
<Obj>
<type>1</type>
<id>8</id>
<name>ifm_buff2_0</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ifm_buff2[0]</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>34</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_9">
<Value>
<Obj>
<type>1</type>
<id>9</id>
<name>ifm_buff2_1</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ifm_buff2[1]</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>34</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_10">
<Value>
<Obj>
<type>1</type>
<id>10</id>
<name>ifm_buff2_2</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ifm_buff2[2]</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>34</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>61</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>_ln9</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>9</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>D:\Course\mSOC\final</first>
<second class_id="11" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="12" tracking_level="0" version="0">
<first class_id="13" tracking_level="0" version="0">
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>9</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.76</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>cifm_counter_0</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>97</item>
<item>98</item>
<item>99</item>
<item>100</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>icmp_ln9</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>9</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>9</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>icmp_ln9_fu_246_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>101</item>
<item>103</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.42</m_delay>
<m_topoIndex>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>j</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>28</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>28</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName>j_fu_252_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>104</item>
<item>106</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.82</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>_ln9</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>9</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>9</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>107</item>
<item>108</item>
<item>109</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>zext_ln12</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>12</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>12</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>zext_ln12_fu_258_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>111</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>cifm_read</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>12</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>12</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>512</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>113</item>
<item>114</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>7</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>trunc_ln12</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>12</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>12</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>trunc_ln12_fu_265_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>115</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>8</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>bitcast_ln12</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>12</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>12</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>ifm_buff0_0_d0</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>116</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>9</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>ifm_buff0_0_addr</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>12</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>12</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>117</item>
<item>119</item>
<item>120</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>10</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>ifm_buff0_0_addr_write_ln12</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>12</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>12</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>121</item>
<item>122</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.25</m_delay>
<m_topoIndex>11</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>cifm_a1_load_new</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>13</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>13</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>grp_fu_226_p4</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>124</item>
<item>125</item>
<item>127</item>
<item>129</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>12</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>bitcast_ln13</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>13</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>13</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>ifm_buff0_1_d0</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>130</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>13</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>ifm_buff0_1_addr</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>13</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>13</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>131</item>
<item>132</item>
<item>133</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>14</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>ifm_buff0_1_addr_write_ln13</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>13</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>13</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>134</item>
<item>135</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.25</m_delay>
<m_topoIndex>15</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>cifm_a2_load_new</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>14</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>14</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>grp_fu_236_p4</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>136</item>
<item>137</item>
<item>139</item>
<item>141</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>16</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>bitcast_ln14</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>14</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>14</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>ifm_buff0_2_d0</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>142</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>17</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>ifm_buff0_2_addr</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>14</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>14</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>143</item>
<item>144</item>
<item>145</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>18</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>ifm_buff0_2_addr_write_ln14</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>14</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>14</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>146</item>
<item>147</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.25</m_delay>
<m_topoIndex>19</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>_ln9</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>9</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>9</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>148</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>20</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>_ln32</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>32</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>32</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.76</m_delay>
<m_topoIndex>21</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>j1_0</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>149</item>
<item>150</item>
<item>151</item>
<item>152</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>22</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>icmp_ln32</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>32</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>32</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>icmp_ln32_fu_284_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>153</item>
<item>154</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.42</m_delay>
<m_topoIndex>23</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>j_1</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>32</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>32</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName>j_1_fu_290_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>155</item>
<item>156</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.82</m_delay>
<m_topoIndex>24</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>_ln32</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>32</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>32</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>157</item>
<item>158</item>
<item>159</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>25</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name>cifm_read_1</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>35</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>35</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>512</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>161</item>
<item>162</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>26</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>trunc_ln35</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>35</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>35</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>trunc_ln35_fu_296_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>163</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>27</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name>bitcast_ln35</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>35</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>35</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>ifm_buff1_0_d0</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>164</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>28</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>zext_ln35</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>35</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>35</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>zext_ln35_fu_305_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>165</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>29</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>ifm_buff1_0_addr</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>35</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>35</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>166</item>
<item>167</item>
<item>168</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>30</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name>ifm_buff1_0_addr_write_ln35</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>35</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>35</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>169</item>
<item>170</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.25</m_delay>
<m_topoIndex>31</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>cifm_a1_load_1_new</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>36</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>36</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>grp_fu_226_p4</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>171</item>
<item>172</item>
<item>173</item>
<item>174</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>32</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name>bitcast_ln36</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>36</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>36</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>ifm_buff1_1_d0</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>175</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>33</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>ifm_buff1_1_addr</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>36</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>36</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>176</item>
<item>177</item>
<item>178</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>34</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name>ifm_buff1_1_addr_write_ln36</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>36</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>36</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>179</item>
<item>180</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.25</m_delay>
<m_topoIndex>35</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>59</id>
<name>cifm_a2_load_1_new</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>37</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>37</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>grp_fu_236_p4</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>181</item>
<item>182</item>
<item>183</item>
<item>184</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>36</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name>bitcast_ln37</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>37</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>37</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>ifm_buff1_2_d0</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>185</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>37</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>61</id>
<name>ifm_buff1_2_addr</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>37</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>37</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>186</item>
<item>187</item>
<item>188</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>38</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>62</id>
<name>ifm_buff1_2_addr_write_ln37</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>37</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>37</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>189</item>
<item>190</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.25</m_delay>
<m_topoIndex>39</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name>_ln32</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>32</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>32</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>191</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>40</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>66</id>
<name>_ln54</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>54</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>54</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>160</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.76</m_delay>
<m_topoIndex>41</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>68</id>
<name>j2_0</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>192</item>
<item>193</item>
<item>194</item>
<item>195</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>42</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>69</id>
<name>icmp_ln54</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>54</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>54</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>icmp_ln54_fu_322_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>196</item>
<item>197</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.42</m_delay>
<m_topoIndex>43</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>71</id>
<name>j_2</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>54</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>54</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName>j_2_fu_328_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>198</item>
<item>199</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.82</m_delay>
<m_topoIndex>44</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name>_ln54</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>54</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>54</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>200</item>
<item>201</item>
<item>202</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>45</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>76</id>
<name>cifm_read_2</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>57</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>57</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>512</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>203</item>
<item>204</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>46</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>77</id>
<name>trunc_ln57</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>57</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>57</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>trunc_ln57_fu_334_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>205</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>47</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>78</id>
<name>bitcast_ln57</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>57</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>57</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>ifm_buff2_0_d0</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>206</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>48</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>79</id>
<name>zext_ln57</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>57</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>57</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>zext_ln57_fu_343_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>207</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>49</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>80</id>
<name>ifm_buff2_0_addr</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>57</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>57</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>208</item>
<item>209</item>
<item>210</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>50</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>81</id>
<name>ifm_buff2_0_addr_write_ln57</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>57</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>57</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>211</item>
<item>212</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.25</m_delay>
<m_topoIndex>51</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_62">
<Value>
<Obj>
<type>0</type>
<id>82</id>
<name>cifm_a1_load_2_new</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>58</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>58</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>grp_fu_226_p4</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>213</item>
<item>214</item>
<item>215</item>
<item>216</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>52</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_63">
<Value>
<Obj>
<type>0</type>
<id>83</id>
<name>bitcast_ln58</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>58</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>58</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>ifm_buff2_1_d0</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>217</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>53</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_64">
<Value>
<Obj>
<type>0</type>
<id>84</id>
<name>ifm_buff2_1_addr</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>58</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>58</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>218</item>
<item>219</item>
<item>220</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>54</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_65">
<Value>
<Obj>
<type>0</type>
<id>85</id>
<name>ifm_buff2_1_addr_write_ln58</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>58</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>58</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>221</item>
<item>222</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.25</m_delay>
<m_topoIndex>55</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_66">
<Value>
<Obj>
<type>0</type>
<id>86</id>
<name>cifm_a2_load_2_new</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>59</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>59</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>grp_fu_236_p4</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>223</item>
<item>224</item>
<item>225</item>
<item>226</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>56</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_67">
<Value>
<Obj>
<type>0</type>
<id>87</id>
<name>bitcast_ln59</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>59</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>59</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>ifm_buff2_2_d0</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>227</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>57</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_68">
<Value>
<Obj>
<type>0</type>
<id>88</id>
<name>ifm_buff2_2_addr</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>59</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>59</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>228</item>
<item>229</item>
<item>230</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>58</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_69">
<Value>
<Obj>
<type>0</type>
<id>89</id>
<name>ifm_buff2_2_addr_write_ln59</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>59</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>59</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>231</item>
<item>232</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.25</m_delay>
<m_topoIndex>59</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_70">
<Value>
<Obj>
<type>0</type>
<id>91</id>
<name>_ln54</name>
<fileName>finalconv_Jan19.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>54</lineNumber>
<contextFuncName>load_cifm_data</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalconv_Jan19.cpp</first>
<second>load_cifm_data</second>
</first>
<second>54</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>233</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>60</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_71">
<Value>
<Obj>
<type>0</type>
<id>93</id>
<name>_ln0</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>61</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</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="_72">
<Value>
<Obj>
<type>2</type>
<id>96</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="_73">
<Value>
<Obj>
<type>2</type>
<id>102</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>34</content>
</item>
<item class_id_reference="16" object_id="_74">
<Value>
<Obj>
<type>2</type>
<id>105</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="_75">
<Value>
<Obj>
<type>2</type>
<id>118</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="_76">
<Value>
<Obj>
<type>2</type>
<id>126</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>32</content>
</item>
<item class_id_reference="16" object_id="_77">
<Value>
<Obj>
<type>2</type>
<id>128</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>63</content>
</item>
<item class_id_reference="16" object_id="_78">
<Value>
<Obj>
<type>2</type>
<id>138</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="_79">
<Value>
<Obj>
<type>2</type>
<id>140</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>95</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_80">
<Obj>
<type>3</type>
<id>13</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>12</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_81">
<Obj>
<type>3</type>
<id>19</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>14</item>
<item>15</item>
<item>17</item>
<item>18</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_82">
<Obj>
<type>3</type>
<id>38</id>
<name>hls_label_0</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>15</count>
<item_version>0</item_version>
<item>22</item>
<item>23</item>
<item>24</item>
<item>25</item>
<item>26</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>37</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_83">
<Obj>
<type>3</type>
<id>40</id>
<name>.preheader1.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>1</count>
<item_version>0</item_version>
<item>39</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_84">
<Obj>
<type>3</type>
<id>46</id>
<name>.preheader1</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>41</item>
<item>42</item>
<item>44</item>
<item>45</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_85">
<Obj>
<type>3</type>
<id>65</id>
<name>hls_label_1</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>15</count>
<item_version>0</item_version>
<item>49</item>
<item>50</item>
<item>51</item>
<item>52</item>
<item>53</item>
<item>54</item>
<item>55</item>
<item>56</item>
<item>57</item>
<item>58</item>
<item>59</item>
<item>60</item>
<item>61</item>
<item>62</item>
<item>64</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_86">
<Obj>
<type>3</type>
<id>67</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>1</count>
<item_version>0</item_version>
<item>66</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_87">
<Obj>
<type>3</type>
<id>73</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>4</count>
<item_version>0</item_version>
<item>68</item>
<item>69</item>
<item>71</item>
<item>72</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_88">
<Obj>
<type>3</type>
<id>92</id>
<name>hls_label_2</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>15</count>
<item_version>0</item_version>
<item>76</item>
<item>77</item>
<item>78</item>
<item>79</item>
<item>80</item>
<item>81</item>
<item>82</item>
<item>83</item>
<item>84</item>
<item>85</item>
<item>86</item>
<item>87</item>
<item>88</item>
<item>89</item>
<item>91</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_89">
<Obj>
<type>3</type>
<id>94</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>93</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>132</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_90">
<id>95</id>
<edge_type>2</edge_type>
<source_obj>19</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_91">
<id>97</id>
<edge_type>1</edge_type>
<source_obj>96</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_92">
<id>98</id>
<edge_type>2</edge_type>
<source_obj>13</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_93">
<id>99</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_94">
<id>100</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_95">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_96">
<id>103</id>
<edge_type>1</edge_type>
<source_obj>102</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_97">
<id>104</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_98">
<id>106</id>
<edge_type>1</edge_type>
<source_obj>105</source_obj>
<sink_obj>17</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_99">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_100">
<id>108</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_101">
<id>109</id>
<edge_type>2</edge_type>
<source_obj>40</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_102">
<id>110</id>
<edge_type>2</edge_type>
<source_obj>46</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_103">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_104">
<id>114</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_105">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_106">
<id>116</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_107">
<id>117</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_108">
<id>119</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_109">
<id>120</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_110">
<id>121</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_111">
<id>122</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_112">
<id>125</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_113">
<id>127</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_114">
<id>129</id>
<edge_type>1</edge_type>
<source_obj>128</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_115">
<id>130</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_116">
<id>131</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_117">
<id>132</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_118">
<id>133</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_119">
<id>134</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_120">
<id>135</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_121">
<id>137</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_122">
<id>139</id>
<edge_type>1</edge_type>
<source_obj>138</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_123">
<id>141</id>
<edge_type>1</edge_type>
<source_obj>140</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_124">
<id>142</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_125">
<id>143</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_126">
<id>144</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_127">
<id>145</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_128">
<id>146</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_129">
<id>147</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_130">
<id>148</id>
<edge_type>2</edge_type>
<source_obj>19</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_131">
<id>149</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_132">
<id>150</id>
<edge_type>2</edge_type>
<source_obj>65</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_133">
<id>151</id>
<edge_type>1</edge_type>
<source_obj>96</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_134">
<id>152</id>
<edge_type>2</edge_type>
<source_obj>40</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_135">
<id>153</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_136">
<id>154</id>
<edge_type>1</edge_type>
<source_obj>102</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_137">
<id>155</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_138">
<id>156</id>
<edge_type>1</edge_type>
<source_obj>105</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_139">
<id>157</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_140">
<id>158</id>
<edge_type>2</edge_type>
<source_obj>65</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_141">
<id>159</id>
<edge_type>2</edge_type>
<source_obj>67</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_142">
<id>160</id>
<edge_type>2</edge_type>
<source_obj>73</source_obj>
<sink_obj>66</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_143">
<id>162</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_144">
<id>163</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_145">
<id>164</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_146">
<id>165</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_147">
<id>166</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_148">
<id>167</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_149">
<id>168</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_150">
<id>169</id>
<edge_type>1</edge_type>
<source_obj>51</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_151">
<id>170</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_152">
<id>172</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_153">
<id>173</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_154">
<id>174</id>
<edge_type>1</edge_type>
<source_obj>128</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_155">
<id>175</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_156">
<id>176</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_157">
<id>177</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_158">
<id>178</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>57</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_159">
<id>179</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_160">
<id>180</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_161">
<id>182</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_162">
<id>183</id>
<edge_type>1</edge_type>
<source_obj>138</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_163">
<id>184</id>
<edge_type>1</edge_type>
<source_obj>140</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_164">
<id>185</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>60</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_165">
<id>186</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_166">
<id>187</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_167">
<id>188</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_168">
<id>189</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_169">
<id>190</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>62</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_170">
<id>191</id>
<edge_type>2</edge_type>
<source_obj>46</source_obj>
<sink_obj>64</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_171">
<id>192</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_172">
<id>193</id>
<edge_type>2</edge_type>
<source_obj>92</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_173">
<id>194</id>
<edge_type>1</edge_type>
<source_obj>96</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_174">
<id>195</id>
<edge_type>2</edge_type>
<source_obj>67</source_obj>
<sink_obj>68</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_175">
<id>196</id>
<edge_type>1</edge_type>
<source_obj>68</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_176">
<id>197</id>
<edge_type>1</edge_type>
<source_obj>102</source_obj>
<sink_obj>69</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_177">
<id>198</id>
<edge_type>1</edge_type>
<source_obj>68</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_178">
<id>199</id>
<edge_type>1</edge_type>
<source_obj>105</source_obj>
<sink_obj>71</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_179">
<id>200</id>
<edge_type>1</edge_type>
<source_obj>69</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_180">
<id>201</id>
<edge_type>2</edge_type>
<source_obj>92</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_181">
<id>202</id>
<edge_type>2</edge_type>
<source_obj>94</source_obj>
<sink_obj>72</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_182">
<id>204</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>76</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_183">
<id>205</id>
<edge_type>1</edge_type>
<source_obj>76</source_obj>
<sink_obj>77</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_184">
<id>206</id>
<edge_type>1</edge_type>
<source_obj>77</source_obj>
<sink_obj>78</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_185">
<id>207</id>
<edge_type>1</edge_type>
<source_obj>68</source_obj>
<sink_obj>79</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_186">
<id>208</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_187">
<id>209</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_188">
<id>210</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>80</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_189">
<id>211</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>81</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_190">
<id>212</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>81</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_191">
<id>214</id>
<edge_type>1</edge_type>
<source_obj>76</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_192">
<id>215</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_193">
<id>216</id>
<edge_type>1</edge_type>
<source_obj>128</source_obj>
<sink_obj>82</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_194">
<id>217</id>
<edge_type>1</edge_type>
<source_obj>82</source_obj>
<sink_obj>83</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_195">
<id>218</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_196">
<id>219</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_197">
<id>220</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>84</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_198">
<id>221</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>85</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_199">
<id>222</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>85</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_200">
<id>224</id>
<edge_type>1</edge_type>
<source_obj>76</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_201">
<id>225</id>
<edge_type>1</edge_type>
<source_obj>138</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_202">
<id>226</id>
<edge_type>1</edge_type>
<source_obj>140</source_obj>
<sink_obj>86</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_203">
<id>227</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>87</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_204">
<id>228</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_205">
<id>229</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_206">
<id>230</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>88</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_207">
<id>231</id>
<edge_type>1</edge_type>
<source_obj>87</source_obj>
<sink_obj>89</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_208">
<id>232</id>
<edge_type>1</edge_type>
<source_obj>88</source_obj>
<sink_obj>89</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_209">
<id>233</id>
<edge_type>2</edge_type>
<source_obj>73</source_obj>
<sink_obj>91</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_210">
<id>317</id>
<edge_type>2</edge_type>
<source_obj>13</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_211">
<id>318</id>
<edge_type>2</edge_type>
<source_obj>19</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_212">
<id>319</id>
<edge_type>2</edge_type>
<source_obj>19</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_213">
<id>320</id>
<edge_type>2</edge_type>
<source_obj>38</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_214">
<id>321</id>
<edge_type>2</edge_type>
<source_obj>40</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_215">
<id>322</id>
<edge_type>2</edge_type>
<source_obj>46</source_obj>
<sink_obj>67</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_216">
<id>323</id>
<edge_type>2</edge_type>
<source_obj>46</source_obj>
<sink_obj>65</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_217">
<id>324</id>
<edge_type>2</edge_type>
<source_obj>65</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_218">
<id>325</id>
<edge_type>2</edge_type>
<source_obj>67</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_219">
<id>326</id>
<edge_type>2</edge_type>
<source_obj>73</source_obj>
<sink_obj>94</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_220">
<id>327</id>
<edge_type>2</edge_type>
<source_obj>73</source_obj>
<sink_obj>92</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_221">
<id>328</id>
<edge_type>2</edge_type>
<source_obj>92</source_obj>
<sink_obj>73</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_222">
<mId>1</mId>
<mTag>load_cifm_data</mTag>
<mType>0</mType>
<sub_regions>
<count>7</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
<item>5</item>
<item>6</item>
<item>7</item>
<item>8</item>
</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>108</mMinLatency>
<mMaxLatency>108</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_223">
<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>13</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_224">
<mId>3</mId>
<mTag>Loop 1</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>19</item>
<item>38</item>
</basic_blocks>
<mII>1</mII>
<mDepth>1</mDepth>
<mMinTripCount>34</mMinTripCount>
<mMaxTripCount>34</mMaxTripCount>
<mMinLatency>34</mMinLatency>
<mMaxLatency>34</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_225">
<mId>4</mId>
<mTag>Region 1</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_226">
<mId>5</mId>
<mTag>Loop 2</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>46</item>
<item>65</item>
</basic_blocks>
<mII>1</mII>
<mDepth>1</mDepth>
<mMinTripCount>34</mMinTripCount>
<mMaxTripCount>34</mMaxTripCount>
<mMinLatency>34</mMinLatency>
<mMaxLatency>34</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_227">
<mId>6</mId>
<mTag>Region 2</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>67</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_228">
<mId>7</mId>
<mTag>Loop 3</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>73</item>
<item>92</item>
</basic_blocks>
<mII>1</mII>
<mDepth>1</mDepth>
<mMinTripCount>34</mMinTripCount>
<mMaxTripCount>34</mMaxTripCount>
<mMinLatency>34</mMinLatency>
<mMaxLatency>34</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_229">
<mId>8</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>94</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_230">
<states class_id="25" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_231">
<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="_232">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_233">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_234">
<id>2</id>
<operations>
<count>23</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_235">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_236">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_237">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_238">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_239">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_240">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_241">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_242">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_243">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_244">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_245">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_246">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_247">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_248">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_249">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_250">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_251">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_252">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_253">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_254">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_255">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_256">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_257">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_258">
<id>3</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_259">
<id>39</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_260">
<id>4</id>
<operations>
<count>23</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_261">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_262">
<id>42</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_263">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_264">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_265">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_266">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_267">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_268">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_269">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_270">
<id>51</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_271">
<id>52</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_272">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_273">
<id>54</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_274">
<id>55</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_275">
<id>56</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_276">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_277">
<id>58</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_278">
<id>59</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_279">
<id>60</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_280">
<id>61</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_281">
<id>62</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_282">
<id>63</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_283">
<id>64</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_284">
<id>5</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_285">
<id>66</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_286">
<id>6</id>
<operations>
<count>23</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_287">
<id>68</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_288">
<id>69</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_289">
<id>70</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_290">
<id>71</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_291">
<id>72</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_292">
<id>74</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_293">
<id>75</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_294">
<id>76</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_295">
<id>77</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_296">
<id>78</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_297">
<id>79</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_298">
<id>80</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_299">
<id>81</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_300">
<id>82</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_301">
<id>83</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_302">
<id>84</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_303">
<id>85</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_304">
<id>86</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_305">
<id>87</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_306">
<id>88</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_307">
<id>89</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_308">
<id>90</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_309">
<id>91</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_310">
<id>7</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_311">
<id>93</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_312">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>-1</id>
<sop class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_313">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>-1</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="_314">
<inState>5</inState>
<outState>6</outState>
<condition>
<id>-1</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="_315">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item class_id="34" tracking_level="0" version="0">
<first class_id="35" tracking_level="0" version="0">
<first>15</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_316">
<inState>2</inState>
<outState>2</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>15</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_317">
<inState>4</inState>
<outState>5</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>42</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_318">
<inState>4</inState>
<outState>4</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>42</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_319">
<inState>6</inState>
<outState>7</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>69</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_320">
<inState>6</inState>
<outState>6</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>69</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="_321">
<dp_component_resource class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_resource>
<dp_expression_resource>
<count>9</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>ap_block_state2 ( and ) </first>
<second class_id="39" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="0" version="0">
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_block_state4 ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_block_state6 ( and ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>icmp_ln32_fu_284_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>11</second>
</item>
</second>
</item>
<item>
<first>icmp_ln54_fu_322_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>11</second>
</item>
</second>
</item>
<item>
<first>icmp_ln9_fu_246_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>11</second>
</item>
</second>
</item>
<item>
<first>j_1_fu_290_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>15</second>
</item>
</second>
</item>
<item>
<first>j_2_fu_328_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>15</second>
</item>
</second>
</item>
<item>
<first>j_fu_252_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>15</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>5</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>8</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>41</second>
</item>
</second>
</item>
<item>
<first>cifm_TDATA_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>cifm_counter_0_reg_193</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>9</second>
</item>
</second>
</item>
<item>
<first>j1_0_reg_204</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>9</second>
</item>
</second>
</item>
<item>
<first>j2_0_reg_215</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>9</second>
</item>
</second>
</item>
</dp_multiplexer_resource>
<dp_register_resource>
<count>4</count>
<item_version>0</item_version>
<item>
<first>ap_CS_fsm</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>7</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>7</second>
</item>
</second>
</item>
<item>
<first>cifm_counter_0_reg_193</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>j1_0_reg_204</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>j2_0_reg_215</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>
</dp_register_resource>
<dp_dsp_resource>
<count>0</count>
<item_version>0</item_version>
</dp_dsp_resource>
<dp_component_map class_id="41" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_map>
<dp_expression_map>
<count>6</count>
<item_version>0</item_version>
<item class_id="42" tracking_level="0" version="0">
<first>icmp_ln32_fu_284_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>icmp_ln54_fu_322_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>69</item>
</second>
</item>
<item>
<first>icmp_ln9_fu_246_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>j_1_fu_290_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>j_2_fu_328_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>j_fu_252_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</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>61</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="0" version="0">
<first>12</first>
<second class_id="45" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>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>22</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>77</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>78</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>79</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>80</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>81</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>82</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>84</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>85</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>86</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>87</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>88</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>89</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>91</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>93</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="46" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="47" tracking_level="0" version="0">
<first>13</first>
<second class_id="48" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>67</first>
<second>
<first>4</first>
<second>4</second>
</second>
</item>
<item>
<first>73</first>
<second>
<first>5</first>
<second>5</second>
</second>
</item>
<item>
<first>92</first>
<second>
<first>5</first>
<second>5</second>
</second>
</item>
<item>
<first>94</first>
<second>
<first>6</first>
<second>6</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="49" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="50" tracking_level="1" version="0" object_id="_322">
<region_name>Loop 1</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>19</item>
<item>38</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>1</pipe_depth>
</item>
<item class_id_reference="50" object_id="_323">
<region_name>Loop 2</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>46</item>
<item>65</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>1</pipe_depth>
</item>
<item class_id_reference="50" object_id="_324">
<region_name>Loop 3</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>73</item>
<item>92</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>1</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="51" tracking_level="0" version="0">
<count>45</count>
<item_version>0</item_version>
<item class_id="52" tracking_level="0" version="0">
<first>70</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>23</item>
<item>49</item>
<item>76</item>
</second>
</item>
<item>
<first>76</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>83</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>89</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>96</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>102</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>109</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>115</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>122</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>128</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>135</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>141</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>148</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>154</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>161</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>167</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>174</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>180</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>187</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</second>
</item>
<item>
<first>197</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>208</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>219</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>226</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>28</item>
<item>55</item>
<item>82</item>
</second>
</item>
<item>
<first>236</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>32</item>
<item>59</item>
<item>86</item>
</second>
</item>
<item>
<first>246</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>252</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>258</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>265</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>269</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>274</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>279</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>284</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>290</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>296</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>300</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>305</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>312</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>317</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>322</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>69</item>
</second>
</item>
<item>
<first>328</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>334</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>77</item>
</second>
</item>
<item>
<first>338</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>78</item>
</second>
</item>
<item>
<first>343</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
<item>
<first>350</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>355</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="54" tracking_level="0" version="0">
<count>35</count>
<item_version>0</item_version>
<item class_id="55" tracking_level="0" version="0">
<first>bitcast_ln12_fu_269</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>bitcast_ln13_fu_274</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>bitcast_ln14_fu_279</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>bitcast_ln35_fu_300</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>bitcast_ln36_fu_312</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>bitcast_ln37_fu_317</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>bitcast_ln57_fu_338</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>78</item>
</second>
</item>
<item>
<first>bitcast_ln58_fu_350</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>bitcast_ln59_fu_355</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>87</item>
</second>
</item>
<item>
<first>cifm_counter_0_phi_fu_197</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>grp_fu_226</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>28</item>
<item>55</item>
<item>82</item>
</second>
</item>
<item>
<first>grp_fu_236</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>32</item>
<item>59</item>
<item>86</item>
</second>
</item>
<item>
<first>icmp_ln32_fu_284</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>icmp_ln54_fu_322</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>69</item>
</second>
</item>
<item>
<first>icmp_ln9_fu_246</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>ifm_buff0_0_addr_gep_fu_76</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>ifm_buff0_1_addr_gep_fu_89</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>ifm_buff0_2_addr_gep_fu_102</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>ifm_buff1_0_addr_gep_fu_115</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>ifm_buff1_1_addr_gep_fu_128</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>ifm_buff1_2_addr_gep_fu_141</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>ifm_buff2_0_addr_gep_fu_154</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>80</item>
</second>
</item>
<item>
<first>ifm_buff2_1_addr_gep_fu_167</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>ifm_buff2_2_addr_gep_fu_180</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</second>
</item>
<item>
<first>j1_0_phi_fu_208</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>j2_0_phi_fu_219</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>j_1_fu_290</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>j_2_fu_328</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>j_fu_252</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>trunc_ln12_fu_265</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>trunc_ln35_fu_296</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>trunc_ln57_fu_334</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>77</item>
</second>
</item>
<item>
<first>zext_ln12_fu_258</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>zext_ln35_fu_305</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>zext_ln57_fu_343</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>79</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>1</count>
<item_version>0</item_version>
<item>
<first>grp_read_fu_70</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>23</item>
<item>49</item>
<item>76</item>
</second>
</item>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="56" tracking_level="0" version="0">
<count>9</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>ifm_buff0_0</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>
<first>ifm_buff0_1</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>
<first>ifm_buff0_2</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>
<first>ifm_buff1_0</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>
<first>ifm_buff1_1</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>
<first>ifm_buff1_2</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>
<first>ifm_buff2_0</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>
<first>ifm_buff2_1</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>
<first>ifm_buff2_2</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</second>
</item>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>6</count>
<item_version>0</item_version>
<item>
<first>193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>204</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>215</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>363</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>371</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>379</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>6</count>
<item_version>0</item_version>
<item>
<first>cifm_counter_0_reg_193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>j1_0_reg_204</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>j2_0_reg_215</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>j_1_reg_371</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>j_2_reg_379</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</second>
</item>
<item>
<first>j_reg_363</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>3</count>
<item_version>0</item_version>
<item>
<first>193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>204</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>215</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>3</count>
<item_version>0</item_version>
<item>
<first>cifm_counter_0_reg_193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>j1_0_reg_204</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>j2_0_reg_215</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="59" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="60" tracking_level="0" version="0">
<first>cifm</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>23</item>
<item>49</item>
<item>76</item>
</second>
</item>
</second>
</item>
<item>
<first>ifm_buff0_0(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>store</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
</second>
</item>
<item>
<first>ifm_buff0_1(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>store</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
</second>
</item>
<item>
<first>ifm_buff0_2(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>store</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
</second>
</item>
<item>
<first>ifm_buff1_0(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>store</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
</second>
</item>
<item>
<first>ifm_buff1_1(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>store</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
</second>
</item>
<item>
<first>ifm_buff1_2(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>store</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
</second>
</item>
<item>
<first>ifm_buff2_0(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>store</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
</second>
</item>
<item>
<first>ifm_buff2_1(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>store</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
</second>
</item>
<item>
<first>ifm_buff2_2(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>store</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>89</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="61" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="62" tracking_level="0" version="0">
<first>2</first>
<second>RAM</second>
</item>
<item>
<first>3</first>
<second>RAM</second>
</item>
<item>
<first>4</first>
<second>RAM</second>
</item>
<item>
<first>5</first>
<second>RAM</second>
</item>
<item>
<first>6</first>
<second>RAM</second>
</item>
<item>
<first>7</first>
<second>RAM</second>
</item>
<item>
<first>8</first>
<second>RAM</second>
</item>
<item>
<first>9</first>
<second>RAM</second>
</item>
<item>
<first>10</first>
<second>RAM</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 31.609277 | 80 | 0.459887 |
dca8a1471f2f57ebf7d88752f790aaf33fe11818 | 721 | ada | Ada | Task/Stair-climbing-puzzle/Ada/stair-climbing-puzzle-2.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:38.000Z | 2018-11-09T22:08:38.000Z | Task/Stair-climbing-puzzle/Ada/stair-climbing-puzzle-2.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/Stair-climbing-puzzle/Ada/stair-climbing-puzzle-2.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:40.000Z | 2018-11-09T22:08:40.000Z | with Ada.Numerics.Discrete_Random;
with Ada.Text_IO;
procedure Scaffolding is
package Try is new Ada.Numerics.Discrete_Random (Boolean);
use Try;
Dice : Generator;
Level : Integer := 0;
function Step return Boolean is
begin
if Random (Dice) then
Level := Level + 1;
Ada.Text_IO.Put_Line ("Climbed up to" & Integer'Image (Level));
return True;
else
Level := Level - 1;
Ada.Text_IO.Put_Line ("Fell down to" & Integer'Image (Level));
return False;
end if;
end Step;
procedure Step_Up is
begin
while not Step loop
Step_Up;
end loop;
end Step_Up;
begin
Reset (Dice);
Step_Up;
end Scaffolding;
| 21.848485 | 72 | 0.613037 |
3911ccf2e0e84c34183cd0094c447e0163c564d7 | 14,323 | adb | Ada | source/web/fastcgi/matreshka-fastcgi-descriptors.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/web/fastcgi/matreshka-fastcgi-descriptors.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/web/fastcgi/matreshka-fastcgi-descriptors.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2013, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with League.Strings;
with League.Text_Codecs;
with Matreshka.Internals.Unicode.Characters.Latin;
with Matreshka.FastCGI.Protocol;
package body Matreshka.FastCGI.Descriptors is
use Matreshka.Internals.Unicode.Characters.Latin;
use type Ada.Streams.Stream_Element_Offset;
ASCII_Codec : constant League.Text_Codecs.Text_Codec
:= League.Text_Codecs.Codec
-- (League.Strings.To_Universal_String ("ASCII"));
(League.Strings.To_Universal_String ("ISO-8859-1"));
ISO88591_Codec : constant League.Text_Codecs.Text_Codec
:= League.Text_Codecs.Codec
(League.Strings.To_Universal_String ("ISO-8859-1"));
Field_Separator : constant Ada.Streams.Stream_Element_Array (0 .. 0)
:= (0 => Colon);
End_Mark : constant Ada.Streams.Stream_Element_Array (0 .. 1)
:= (Carriage_Return, Line_Feed);
procedure Send_FCGI_Header
(Self : in out Abstract_Descriptor'Class;
Packet_Type : Matreshka.FastCGI.Protocol.FCGI_Packet_Type;
Content_Length : Matreshka.FastCGI.Protocol.FCGI_Content_Length;
Padding_Length : Matreshka.FastCGI.Protocol.FCGI_Padding_Length);
-- Send FCGI Header.
procedure Send_FCGI_Packet
(Self : in out Abstract_Descriptor'Class;
Packet_Type : Matreshka.FastCGI.Protocol.FCGI_Packet_Type;
Content : Ada.Streams.Stream_Element_Array);
-- Send FCGI packet of specified type and content.
function Compute_Padding_Length
(Content_Length : Matreshka.FastCGI.Protocol.FCGI_Content_Length)
return Matreshka.FastCGI.Protocol.FCGI_Padding_Length;
-- Compute padding length.
----------------------------
-- Compute_Padding_Length --
----------------------------
function Compute_Padding_Length
(Content_Length : Matreshka.FastCGI.Protocol.FCGI_Content_Length)
return Matreshka.FastCGI.Protocol.FCGI_Padding_Length is
begin
return
(if Content_Length mod 8 = 0 then 0 else 8 - Content_Length mod 8);
end Compute_Padding_Length;
----------------------------
-- Internal_Begin_Request --
----------------------------
not overriding procedure Internal_Begin_Request
(Self : in out Abstract_Descriptor;
Socket : GNAT.Sockets.Socket_Type;
Request_Id : Matreshka.FastCGI.FCGI_Request_Identifier) is
begin
Self.Socket := Socket;
Self.Request_Id := Request_Id;
Self.Params_Done := False;
Self.Headers_Done := False;
Self.Stdout_Data.Clear;
Self.Stderr_Data.Clear;
end Internal_Begin_Request;
--------------------------
-- Internal_End_Headers --
--------------------------
procedure Internal_End_Headers
(Self : in out Abstract_Descriptor'Class) is
begin
Self.Headers_Done := True;
Self.Send_FCGI_Packet (Matreshka.FastCGI.Protocol.FCGI_Stdout, End_Mark);
if Self.Params_Done then
-- Flush accumulated data.
Self.Send_FCGI_Packet
(Matreshka.FastCGI.Protocol.FCGI_Stderr,
Self.Stderr_Data.To_Stream_Element_Array);
Self.Stderr_Data.Clear;
Self.Send_FCGI_Packet
(Matreshka.FastCGI.Protocol.FCGI_Stdout,
Self.Stdout_Data.To_Stream_Element_Array);
Self.Stdout_Data.Clear;
end if;
end Internal_End_Headers;
---------------------
-- Internal_Header --
---------------------
procedure Internal_Header
(Self : in out Abstract_Descriptor'Class;
Name : Standard.FastCGI.Field_Names.Field_Name;
Value : Standard.FastCGI.Field_Values.Field_Value)
is
Encoded_Name : constant
League.Stream_Element_Vectors.Stream_Element_Vector
:= ASCII_Codec.Encode (Name.To_Universal_String);
Encoded_Value : constant
League.Stream_Element_Vectors.Stream_Element_Vector
:= ISO88591_Codec.Encode (Value.To_Universal_String);
Content_Length : constant Matreshka.FastCGI.Protocol.FCGI_Content_Length
:= Encoded_Name.Length
+ Field_Separator'Length
+ Encoded_Value.Length
+ End_Mark'Length;
Padding_Length : constant Matreshka.FastCGI.Protocol.FCGI_Padding_Length
:= Compute_Padding_Length (Content_Length);
Padding : constant
Ada.Streams.Stream_Element_Array (1 .. Padding_Length)
:= (others => 0);
Last : Ada.Streams.Stream_Element_Offset;
begin
-- Send FCGI header.
Self.Send_FCGI_Header
(Matreshka.FastCGI.Protocol.FCGI_Stdout,
Content_Length,
Padding_Length);
-- Send HTTP message-header.
GNAT.Sockets.Send_Socket
(Self.Socket, Encoded_Name.To_Stream_Element_Array, Last);
if Last /= Encoded_Name.To_Stream_Element_Array'Last then
raise Program_Error;
end if;
GNAT.Sockets.Send_Socket (Self.Socket, Field_Separator, Last);
if Last /= Field_Separator'Last then
raise Program_Error;
end if;
GNAT.Sockets.Send_Socket
(Self.Socket, Encoded_Value.To_Stream_Element_Array, Last);
if Last /= Encoded_Value.To_Stream_Element_Array'Last then
raise Program_Error;
end if;
GNAT.Sockets.Send_Socket (Self.Socket, End_Mark, Last);
if Last /= End_Mark'Last then
raise Program_Error;
end if;
-- Send FCGI padding.
GNAT.Sockets.Send_Socket (Self.Socket, Padding, Last);
if Last /= Padding'Last then
raise Program_Error;
end if;
end Internal_Header;
---------------------
-- Internal_Params --
---------------------
procedure Internal_Params
(Self : in out Abstract_Descriptor'Class;
Buffer : Ada.Streams.Stream_Element_Array)
is
procedure Decode_Length
(First : in out Ada.Streams.Stream_Element_Offset;
Length : out Ada.Streams.Stream_Element_Offset);
-------------------
-- Decode_Length --
-------------------
procedure Decode_Length
(First : in out Ada.Streams.Stream_Element_Offset;
Length : out Ada.Streams.Stream_Element_Offset)
is
use type Ada.Streams.Stream_Element;
begin
if (Buffer (First) and 16#80#) = 0 then
Length := Ada.Streams.Stream_Element_Offset (Buffer (First));
First := First + 1;
else
Length :=
Ada.Streams.Stream_Element_Offset (Buffer (First) and 16#7F#)
* 2 ** 24
+ Ada.Streams.Stream_Element_Offset (Buffer (First + 1))
* 2 ** 16
+ Ada.Streams.Stream_Element_Offset (Buffer (First + 2))
* 2 ** 8
+ Ada.Streams.Stream_Element_Offset (Buffer (First + 3));
First := First + 4;
end if;
end Decode_Length;
First : Ada.Streams.Stream_Element_Offset := Buffer'First;
Name_Length : Ada.Streams.Stream_Element_Offset;
Value_Length : Ada.Streams.Stream_Element_Offset;
begin
if Buffer'Length = 0 then
Self.Params_Done := True;
-- Flush accumulated stderr data.
if not Self.Stderr_Data.Is_Empty then
Self.Send_FCGI_Packet
(Matreshka.FastCGI.Protocol.FCGI_Stderr,
Self.Stderr_Data.To_Stream_Element_Array);
Self.Stderr_Data.Clear;
end if;
-- Dispatch event.
Self.Internal_End_Params;
else
while First < Buffer'Last loop
Decode_Length (First, Name_Length);
Decode_Length (First, Value_Length);
Self.Internal_Param
(Standard.FastCGI.Field_Names.To_Field_Name
(ASCII_Codec.Decode
(Buffer (First .. First + Name_Length - 1))),
Standard.FastCGI.Field_Values.To_Field_Value
(ISO88591_Codec.Decode
(Buffer
(First + Name_Length
.. First + Name_Length + Value_Length - 1))));
First := First + Name_Length + Value_Length;
end loop;
end if;
end Internal_Params;
---------------------
-- Internal_Stderr --
---------------------
procedure Internal_Stderr
(Self : in out Abstract_Descriptor'Class;
Data : Ada.Streams.Stream_Element_Array) is
begin
if not Self.Params_Done then
Self.Stderr_Data.Append (Data);
else
Self.Send_FCGI_Packet (Matreshka.FastCGI.Protocol.FCGI_Stderr, Data);
end if;
end Internal_Stderr;
---------------------
-- Internal_Stdout --
---------------------
procedure Internal_Stdout
(Self : in out Abstract_Descriptor'Class;
Data : Ada.Streams.Stream_Element_Array) is
begin
if not Self.Params_Done
or not Self.Headers_Done
then
Self.Stdout_Data.Append (Data);
else
Self.Send_FCGI_Packet (Matreshka.FastCGI.Protocol.FCGI_Stdout, Data);
end if;
end Internal_Stdout;
----------------------
-- Send_FCGI_Header --
----------------------
procedure Send_FCGI_Header
(Self : in out Abstract_Descriptor'Class;
Packet_Type : Matreshka.FastCGI.Protocol.FCGI_Packet_Type;
Content_Length : Matreshka.FastCGI.Protocol.FCGI_Content_Length;
Padding_Length : Matreshka.FastCGI.Protocol.FCGI_Padding_Length)
is
Header : Matreshka.FastCGI.Protocol.FCGI_Header;
Raw_Header : Matreshka.FastCGI.Protocol.Raw_FCGI_Header;
for Raw_Header'Address use Header'Address;
pragma Import (Ada, Raw_Header);
Last : Ada.Streams.Stream_Element_Offset;
begin
Matreshka.FastCGI.Protocol.Initialize
(Header, Packet_Type, Self.Request_Id, Content_Length, Padding_Length);
GNAT.Sockets.Send_Socket (Self.Socket, Raw_Header, Last);
if Last /= Raw_Header'Last then
raise Program_Error;
end if;
end Send_FCGI_Header;
----------------------
-- Send_FCGI_Packet --
----------------------
procedure Send_FCGI_Packet
(Self : in out Abstract_Descriptor'Class;
Packet_Type : Matreshka.FastCGI.Protocol.FCGI_Packet_Type;
Content : Ada.Streams.Stream_Element_Array)
is
Padding_Length : constant Matreshka.FastCGI.Protocol.FCGI_Padding_Length
:= Compute_Padding_Length (Content'Length);
Padding : constant
Ada.Streams.Stream_Element_Array (1 .. Padding_Length)
:= (others => 0);
Last : Ada.Streams.Stream_Element_Offset;
begin
Self.Send_FCGI_Header (Packet_Type, Content'Length, Padding_Length);
GNAT.Sockets.Send_Socket (Self.Socket, Content, Last);
if Last /= Content'Last then
raise Program_Error;
end if;
GNAT.Sockets.Send_Socket (Self.Socket, Padding, Last);
if Last /= Padding'Last then
raise Program_Error;
end if;
end Send_FCGI_Packet;
end Matreshka.FastCGI.Descriptors;
| 37.299479 | 79 | 0.572506 |
dcce927ba1c724879f879d8be573a858878ab8f3 | 397 | adb | Ada | longer_integers.adb | hsgrewal/learning-ada | 9a13d2cb46e8e726d2ce8a275a0d23deb565e3df | [
"MIT"
] | null | null | null | longer_integers.adb | hsgrewal/learning-ada | 9a13d2cb46e8e726d2ce8a275a0d23deb565e3df | [
"MIT"
] | null | null | null | longer_integers.adb | hsgrewal/learning-ada | 9a13d2cb46e8e726d2ce8a275a0d23deb565e3df | [
"MIT"
] | null | null | null | -- longer_integers.adb
with Ada.Text_IO; use Ada.Text_IO;
procedure longer_integers is
TestLI : Long_Long_Integer := 4;
begin
Put_Line(" Long_Long_Integer: " & Long_Long_Integer'Image(TestLI));
Put_Line(" Long_Long_Integer min: [ " &
Long_Long_Integer'Image(Long_Long_Integer'First) &
" ] and max : [ " & Long_Long_Integer'Image(Long_Long_Integer'Last) &
" ]");
end longer_integers;
| 28.357143 | 71 | 0.735516 |
39f081229aeb5f5e29a121875a69226518930f98 | 5,181 | adb | Ada | arch/ARM/cortex_m/src/nvic_cm0/cortex_m-nvic.adb | WickedShell/Ada_Drivers_Library | 391866ad37a599347df40a4dbb3bf0721bedabea | [
"BSD-3-Clause"
] | 6 | 2017-05-28T04:37:11.000Z | 2020-11-22T11:26:19.000Z | arch/ARM/cortex_m/src/nvic_cm0/cortex_m-nvic.adb | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2019-08-30T10:57:40.000Z | 2020-02-11T21:34:14.000Z | arch/ARM/cortex_m/src/nvic_cm0/cortex_m-nvic.adb | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2017-02-07T19:42:02.000Z | 2020-11-22T11:26:20.000Z | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015, 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. --
-- --
-- --
-- This file is based on: --
-- --
-- @file stm32f4xx_hal_cortex.c --
-- @author MCD Application Team --
-- @version V1.1.0 --
-- @date 19-June-2014 --
-- @brief CORTEX HAL module driver. --
-- --
-- COPYRIGHT(c) 2014 STMicroelectronics --
------------------------------------------------------------------------------
with Cortex_M_SVD.NVIC; use Cortex_M_SVD.NVIC;
package body Cortex_M.NVIC is
------------------
-- Set_Priority --
------------------
procedure Set_Priority
(IRQn : Interrupt_ID;
Priority : Interrupt_Priority)
is
type As_Array (As_Arr : Boolean := True) is record
case As_Arr is
when True =>
Arr : UInt8_Array (0 .. 3);
when False =>
IPR : UInt32;
end case;
end record with Unchecked_Union, Pack, Size => 32;
IPR_Index : constant Natural := IRQn / 4;
IP_Index : constant Natural := IRQn mod 4;
IPR : As_Array;
begin
IPR.IPR := NVIC_Periph.NVIC_IPR (IPR_Index);
IPR.Arr (IP_Index) := Priority;
NVIC_Periph.NVIC_IPR (IPR_Index) := IPR.IPR;
end Set_Priority;
-------------
-- Enable_ --
-------------
procedure Enable (IRQn : Interrupt_ID) is
begin
NVIC_Periph.NVIC_ISER := Shift_Left (1, IRQn);
end Enable;
-------------
-- Disable --
-------------
procedure Disable (IRQn : Interrupt_ID) is
begin
NVIC_Periph.NVIC_ICER := Shift_Left (1, IRQn);
end Disable;
-------------
-- Enabled --
-------------
function Enabled (IRQn : Interrupt_ID) return Boolean is
begin
return ((NVIC_Periph.NVIC_ISER and Shift_Left (1, IRQn)) /= 0);
end Enabled;
-------------
-- Pending --
-------------
function Pending (IRQn : Interrupt_ID) return Boolean is
begin
return ((NVIC_Periph.NVIC_ISPR and Shift_Left (1, IRQn)) /= 0);
end Pending;
-----------------
-- Set_Pending --
-----------------
procedure Set_Pending (IRQn : Interrupt_ID) is
begin
NVIC_Periph.NVIC_ISPR := Shift_Left (1, IRQn);
end Set_Pending;
-------------------
-- Clear_Pending --
-------------------
procedure Clear_Pending (IRQn : Interrupt_ID) is
begin
NVIC_Periph.NVIC_ICPR := Shift_Left (1, IRQn);
end Clear_Pending;
end Cortex_M.NVIC;
| 39.25 | 78 | 0.469214 |
c5c73129e6059bad2608ec91c1e1c2463b83f609 | 16,415 | ads | Ada | 3-mid/opengl/private/gl/source/wgl/gl-wgl.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/opengl/private/gl/source/wgl/gl-wgl.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/opengl/private/gl/source/wgl/gl-wgl.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | --
-- Copyright (c) 2002-2003, David Holm
-- 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 names of its contributors 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 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;
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-- POSSIBILITY OF SUCH DAMAGE.
--
with Interfaces.C;
with Interfaces.C.Extensions;
with System;
package GL.WGL is
WGL_FONT_LINES : constant := 8#0000#;
WGL_FONT_POLYGONS : constant := 1;
WGL_SWAP_MAIN_PLANE : constant := 1;
WGL_SWAP_OVERLAY1 : constant := 2;
WGL_SWAP_OVERLAY2 : constant := 4;
WGL_SWAP_OVERLAY3 : constant := 8;
WGL_SWAP_OVERLAY4 : constant := 16#0010#;
WGL_SWAP_OVERLAY5 : constant := 16#0020#;
WGL_SWAP_OVERLAY6 : constant := 16#0040#;
WGL_SWAP_OVERLAY7 : constant := 16#0080#;
WGL_SWAP_OVERLAY8 : constant := 16#0100#;
WGL_SWAP_OVERLAY9 : constant := 16#0200#;
WGL_SWAP_OVERLAY10 : constant := 16#0400#;
WGL_SWAP_OVERLAY11 : constant := 16#0800#;
WGL_SWAP_OVERLAY12 : constant := 16#1000#;
WGL_SWAP_OVERLAY13 : constant := 16#2000#;
WGL_SWAP_OVERLAY14 : constant := 16#4000#;
WGL_SWAP_OVERLAY15 : constant := 16#8000#;
WGL_SWAP_UNDERLAY1 : constant := 16#0001_0000#;
WGL_SWAP_UNDERLAY2 : constant := 16#0002_0000#;
WGL_SWAP_UNDERLAY3 : constant := 16#0004_0000#;
WGL_SWAP_UNDERLAY4 : constant := 16#0008_0000#;
WGL_SWAP_UNDERLAY5 : constant := 16#0010_0000#;
WGL_SWAP_UNDERLAY6 : constant := 16#0020_0000#;
WGL_SWAP_UNDERLAY7 : constant := 16#0040_0000#;
WGL_SWAP_UNDERLAY8 : constant := 16#0080_0000#;
WGL_SWAP_UNDERLAY9 : constant := 16#0100_0000#;
WGL_SWAP_UNDERLAY10 : constant := 16#0200_0000#;
WGL_SWAP_UNDERLAY11 : constant := 16#0400_0000#;
WGL_SWAP_UNDERLAY12 : constant := 16#0800_0000#;
WGL_SWAP_UNDERLAY13 : constant := 16#1000_0000#;
WGL_SWAP_UNDERLAY14 : constant := 16#2000_0000#;
WGL_SWAP_UNDERLAY15 : constant := 16#4000_0000#;
type Pixel_Format_Descriptor is
record
nSize : Interfaces.C.short;
nVersion : Interfaces.C.short;
dwFlags : Interfaces.C.long;
iPixelType : Interfaces.C.char;
cColorBits : Interfaces.C.char;
cRedBits : Interfaces.C.char;
cRedShift : Interfaces.C.char;
cGreenBits : Interfaces.C.char;
cGreenShift : Interfaces.C.char;
cBlueBits : Interfaces.C.char;
cBlueShift : Interfaces.C.char;
cAlphaBits : Interfaces.C.char;
cAlphaShift : Interfaces.C.char;
cAccumBits : Interfaces.C.char;
cAccumRedBits : Interfaces.C.char;
cAccumGreenBits : Interfaces.C.char;
cAccumBlueBits : Interfaces.C.char;
cAccumAlphaBits : Interfaces.C.char;
cDepthBits : Interfaces.C.char;
cStencilBits : Interfaces.C.char;
cAuxBuffers : Interfaces.C.char;
iLayerType : Interfaces.C.char;
bReserved : Interfaces.C.char;
dwLayerMask : Interfaces.C.long;
dwVisibleMask : Interfaces.C.long;
dwDamageMask : Interfaces.C.long;
end record;
pragma Convention (C_Pass_By_Copy, Pixel_Format_Descriptor);
type Point_Float is
record
x : Interfaces.C.C_float;
y : Interfaces.C.C_float;
end record;
pragma Convention (C_Pass_By_Copy, Point_Float);
type Glyph_Metrics_Float is
record
gmfBlackBoxX : Interfaces.C.C_float;
gmfBlackBoxY : Interfaces.C.C_float;
gmfptGlyphOrigin : Point_Float;
gmfCellIncX : Interfaces.C.C_float;
gmfCellIncY : Interfaces.C.C_float;
end record;
pragma Convention (C_Pass_By_Copy, Glyph_Metrics_Float);
type COLORREF is new Interfaces.C.long;
type COLORREF_Type is access all COLORREF;
type Layer_Plane_Descriptor is
record
nSize : Interfaces.C.short;
nVersion : Interfaces.C.short;
dwFlags : Interfaces.C.long;
iPixelType : Interfaces.C.char;
cColorBits : Interfaces.C.char;
cRedBits : Interfaces.C.char;
cRedShift : Interfaces.C.char;
cGreenBits : Interfaces.C.char;
cGreenShift : Interfaces.C.char;
cBlueBits : Interfaces.C.char;
cBlueShift : Interfaces.C.char;
cAlphaBits : Interfaces.C.char;
cAlphaShift : Interfaces.C.char;
cAccumBits : Interfaces.C.char;
cAccumRedBits : Interfaces.C.char;
cAccumGreenBits : Interfaces.C.char;
cAccumBlueBits : Interfaces.C.char;
cAccumAlphaBits : Interfaces.C.char;
cDepthBits : Interfaces.C.char;
cStencilBits : Interfaces.C.char;
cAuxBuffers : Interfaces.C.char;
iLayerPlane : Interfaces.C.char;
bReserved : Interfaces.C.char;
crTransparent : COLORREF;
end record;
pragma Convention (C_Pass_By_Copy, Layer_Plane_Descriptor);
type Layer_Plane_Descriptor_Type is access all Layer_Plane_Descriptor;
type Glyph_Metrics_Float_Type is access all Glyph_Metrics_Float;
type Pixel_Format_Descriptor_Type is access all Pixel_Format_Descriptor;
type HANDLE is new Interfaces.C.Extensions.void_ptr;
subtype HDC is HANDLE;
subtype HGLRC is HANDLE;
type PROC is access function return Interfaces.C.int;
function wglDeleteContext (Rendering_Context : HGLRC)
return Interfaces.C.int;
function wglMakeCurrent (Device_Context : HDC;
Rendering_Context : HGLRC)
return Interfaces.C.int;
function wglSetPixelFormat (Device_Context : HDC;
Pixel_Format : Interfaces.C.int;
Pixel_Format_Desc :
access Pixel_Format_Descriptor_Type)
return Interfaces.C.int;
function wglSwapBuffers (Device_Context : HDC)
return Interfaces.C.int;
function wglGetCurrentDC return HANDLE;
function wglCreateContext (Device_Context : HDC)
return HANDLE;
function wglCreateLayerContext (Device_Context : HDC;
Layer_Plane : Interfaces.C.int)
return HANDLE;
function wglGetCurrentContext return HANDLE;
function wglGetProcAddress (Proc_Desc : access Interfaces.C.char) return PROC;
function wglChoosePixelFormat (Device_Context : HDC;
Pixel_Format_Desc :
access Pixel_Format_Descriptor_Type)
return Interfaces.C.int;
function wglCopyContext (Rendering_Context_Source : HGLRC;
Rendering_Context_Dest : HGLRC;
Mask :
Interfaces.C.unsigned)
return Interfaces.C.int;
function wglDescribeLayerPlane (Device_Context : HDC;
Pixel_Format : Interfaces.C.int;
Layer_Plane : Interfaces.C.int;
Bytes : Interfaces.C.unsigned;
Plane_Desc :
Layer_Plane_Descriptor_Type)
return Interfaces.C.int;
function wglDescribePixelFormat (Device_Context : HDC;
Layer_Plane : Interfaces.C.int;
Bytes :
Interfaces.C.unsigned;
Pixel_Format_Desc :
Pixel_Format_Descriptor_Type)
return Interfaces.C.int;
function wglGetLayerPaletteEntries (Device_Context : HDC;
Layer_Plane : Interfaces.C.int;
Start : Interfaces.C.int;
Entries : Interfaces.C.int;
Color_Ref :
access Interfaces.C.long)
return Interfaces.C.int;
function wglGetPixelFormat (Device_Context : HDC)
return Interfaces.C.int;
function wglRealizeLayerPalette (Device_Context : HDC;
Layer_Plane : Interfaces.C.int;
Realize : Boolean)
return Interfaces.C.int;
function wglSetLayerPaletteEntries (Device_Context : HDC;
Layer_Plane : Interfaces.C.int;
Start : Interfaces.C.int;
Entries : Interfaces.C.int;
Color_Reference : COLORREF_Type)
return Interfaces.C.int;
function wglShareLists (Existing_Rendering_Context : HGLRC;
New_Rendering_Context : HGLRC)
return Interfaces.C.int;
function wglSwapLayerBuffers (Device_Context : HDC;
Planes : Interfaces.C.unsigned)
return Interfaces.C.int;
function wglUseFontBitmapsA (Device_Context : HDC;
First : Interfaces.C.unsigned;
Count : Interfaces.C.unsigned;
List_Base : Interfaces.C.unsigned)
return Interfaces.C.int;
function wglUseFontBitmapsW (Device_Context : HDC;
First : Interfaces.C.unsigned;
Count : Interfaces.C.unsigned;
List_Base : Interfaces.C.unsigned)
return Interfaces.C.int;
function wglUseFontOutlinesA (Device_Context : HDC;
First : Interfaces.C.unsigned;
Count : Interfaces.C.unsigned;
List_Base : Interfaces.C.unsigned;
Deviation : Interfaces.C.C_float;
Extrusion : Interfaces.C.C_float;
Format : Interfaces.C.int;
Glyph_Data_Buffer : Glyph_Metrics_Float_Type)
return Interfaces.C.int;
function wglUseFontOutlinesW (Device_Context : HDC;
First : Interfaces.C.unsigned;
Count : Interfaces.C.unsigned;
List_Base : Interfaces.C.unsigned;
Deviation : Interfaces.C.C_float;
Extrusion : Interfaces.C.C_float;
Format : Interfaces.C.int;
Glyph_Data_Buffer : Glyph_Metrics_Float_Type)
return Interfaces.C.int;
function SwapBuffers (Device_Context : HDC) return
Interfaces.C.int;
function ChoosePixelFormat (Device_Context : HDC;
Pixel_Format_Desc :
access Pixel_Format_Descriptor_Type)
return Interfaces.C.int;
function DescribePixelFormat (Device_Context : HDC;
Pixel_Format : Interfaces.C.int;
Bytes : Interfaces.C.unsigned;
Pixel_Format_Desc :
Pixel_Format_Descriptor_Type)
return Interfaces.C.int;
function GetPixelFormat (Device_Context : HDC)
return Interfaces.C.int;
function SetPixelFormat (Device_Context : HDC;
Pixel_Format : Interfaces.C.int;
Pixel_Format_Desc :
access Pixel_Format_Descriptor_Type)
return Interfaces.C.int;
private
pragma Import (StdCall, wglDeleteContext, "wglDeleteContext");
pragma Import (StdCall, wglMakeCurrent, "wglMakeCurrent");
pragma Import (StdCall, wglSetPixelFormat, "wglSetPixelFormat");
pragma Import (StdCall, wglSwapBuffers, "wglSwapBuffers");
pragma Import (StdCall, wglGetCurrentDC, "wglGetCurrentDC");
pragma Import (StdCall, wglCreateContext, "wglCreateContext");
pragma Import (StdCall, wglCreateLayerContext, "wglCreateLayerContext");
pragma Import (StdCall, wglGetCurrentContext, "wglGetCurrentContext");
pragma Import (StdCall, wglGetProcAddress, "wglGetProcAddress");
pragma Import (StdCall, wglChoosePixelFormat, "wglChoosePixelFormat");
pragma Import (StdCall, wglCopyContext, "wglCopyContext");
pragma Import (StdCall, wglDescribeLayerPlane, "wglDescribeLayerPlane");
pragma Import (StdCall, wglDescribePixelFormat, "wglDescribePixelFormat");
pragma Import (StdCall, wglGetLayerPaletteEntries, "wglGetLayerPaletteEntries");
pragma Import (StdCall, wglGetPixelFormat, "wglGetPixelFormat");
pragma Import (StdCall, wglRealizeLayerPalette, "wglRealizeLayerPalette");
pragma Import (StdCall, wglSetLayerPaletteEntries, "wglSetLayerPaletteEntries");
pragma Import (StdCall, wglShareLists, "wglShareLists");
pragma Import (StdCall, wglSwapLayerBuffers, "wglSwapLayerBuffers");
pragma Import (StdCall, wglUseFontBitmapsA, "wglUseFontBitmapsA");
pragma Import (StdCall, wglUseFontBitmapsW, "wglUseFontBitmapsW");
pragma Import (StdCall, wglUseFontOutlinesA, "wglUseFontOutlinesA");
pragma Import (StdCall, wglUseFontOutlinesW, "wglUseFontOutlinesW");
pragma Import (StdCall, SwapBuffers, "SwapBuffers");
pragma Import (StdCall, ChoosePixelFormat, "ChoosePixelFormat");
pragma Import (StdCall, DescribePixelFormat, "DescribePixelFormat");
pragma Import (StdCall, GetPixelFormat, "GetPixelFormat");
pragma Import (StdCall, SetPixelFormat, "SetPixelFormat");
end GL.WGL;
| 44.72752 | 83 | 0.562169 |
dcbd1422984276bd87e1e59e6c1f6f952604460b | 923 | adb | Ada | Read Only/gdb-6.8/gdb/testsuite/gdb.ada/watch_arg/watch.adb | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | Read Only/gdb-6.8/gdb/testsuite/gdb.ada/watch_arg/watch.adb | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | Read Only/gdb-6.8/gdb/testsuite/gdb.ada/watch_arg/watch.adb | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | -- Copyright 2006, 2007, 2008 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
procedure Watch is
procedure Foo (X : access Integer) is
begin
X.all := 3; -- BREAK1
end Foo;
X : aliased Integer := 1;
begin
Foo (X'Access);
X := 2; -- BREAK2
end Watch;
| 30.766667 | 73 | 0.698808 |
20aa5a8aa07d1c5048f0b71fc621f24622061ea2 | 58 | ads | Ada | Ada/inc/Problem_37.ads | Tim-Tom/project-euler | 177e0043ee93409742ec596c4379251f681b4275 | [
"Unlicense"
] | null | null | null | Ada/inc/Problem_37.ads | Tim-Tom/project-euler | 177e0043ee93409742ec596c4379251f681b4275 | [
"Unlicense"
] | null | null | null | Ada/inc/Problem_37.ads | Tim-Tom/project-euler | 177e0043ee93409742ec596c4379251f681b4275 | [
"Unlicense"
] | null | null | null | package Problem_37 is
procedure Solve;
end Problem_37;
| 14.5 | 21 | 0.793103 |
df09195081876b317ededee641da43a6d92c03fc | 2,134 | adb | Ada | examples/test_strings.adb | ytomino/zlib-ada | 432310c122c25c703171f4c3883bd5c47d3bfd22 | [
"Zlib",
"Unlicense"
] | null | null | null | examples/test_strings.adb | ytomino/zlib-ada | 432310c122c25c703171f4c3883bd5c47d3bfd22 | [
"Zlib",
"Unlicense"
] | null | null | null | examples/test_strings.adb | ytomino/zlib-ada | 432310c122c25c703171f4c3883bd5c47d3bfd22 | [
"Zlib",
"Unlicense"
] | null | null | null | with Ada.Command_Line;
with Ada.Streams;
with Ada.Text_IO;
with Ada.Integer_Text_IO;
with zlib.Strings;
procedure test_strings is
use type Ada.Streams.Stream_Element_Offset;
Verbose : Boolean := False;
Text : constant String := "Hello, zlib!";
Buffer : Ada.Streams.Stream_Element_Array (0 .. 1023);
Buffer_Last : Ada.Streams.Stream_Element_Offset := Buffer'First - 1;
Extracted : String (1 .. 1024);
Extracted_Last : Natural := Extracted'First - 1;
begin
for I in 1 .. Ada.Command_Line.Argument_Count loop
if Ada.Command_Line.Argument (I) = "-v" then
Verbose := True;
end if;
end loop;
declare
Stream : zlib.Stream := zlib.Deflate_Init (Header => zlib.GZip);
Text_Last : Natural := Text'First - 1;
Finished : Boolean;
begin
loop
zlib.Strings.Deflate (
Stream,
Text (Text_Last + 1 .. Text'Last),
Text_Last,
Buffer (Buffer_Last + 1 .. Buffer'Last),
Buffer_Last,
Finish => True,
Finished => Finished);
exit when Finished;
end loop;
end;
declare
Stream : zlib.Stream := zlib.Inflate_Init (Header => zlib.GZip);
Infl_Buffer_Last : Ada.Streams.Stream_Element_Offset := Buffer'First - 1;
Finished : Boolean;
begin
loop
zlib.Strings.Inflate (
Stream,
Buffer (Infl_Buffer_Last + 1 .. Buffer_Last),
Infl_Buffer_Last,
Extracted (Extracted_Last + 1 .. Extracted'Last),
Extracted_Last,
Finish => True,
Finished => Finished);
exit when Finished;
end loop;
end;
declare
use Ada.Text_IO, Ada.Integer_Text_IO;
Compressed_Length : constant Natural :=
Integer (Buffer_Last - Buffer'First + 1);
Extracted_Length : constant Natural := Extracted_Last - Extracted'First + 1;
begin
if Verbose then
Ada.Integer_Text_IO.Default_Width := 0;
Put ("source length = ");
Put (Text'Length);
New_Line;
Put ("compressed length = ");
Put (Compressed_Length);
New_Line;
Put ("extracted length = ");
Put (Extracted_Length);
New_Line;
end if;
pragma Assert (Extracted (Extracted'First .. Extracted_Last) = Text);
end;
-- finish
Ada.Text_IO.Put_Line (Ada.Text_IO.Standard_Error.all, "ok");
end test_strings;
| 27.714286 | 78 | 0.688847 |
23d556709dad89b93a940ea5dd50c3f7b9a16842 | 3,165 | ads | Ada | src/main/resources/project-templates/stm32f_leds/src/leds.ads | georgemackayshore/Ada-IntelliJ | 581f87237a610b3142aed20358b955bdca807213 | [
"Apache-2.0"
] | 17 | 2018-10-03T21:31:03.000Z | 2021-01-22T04:16:05.000Z | src/main/resources/project-templates/stm32f_leds/src/leds.ads | georgemackayshore/Ada-IntelliJ | 581f87237a610b3142aed20358b955bdca807213 | [
"Apache-2.0"
] | 20 | 2018-11-01T21:17:09.000Z | 2021-10-01T18:57:20.000Z | src/main/resources/project-templates/stm32f_leds/src/leds.ads | georgemackayshore/Ada-IntelliJ | 581f87237a610b3142aed20358b955bdca807213 | [
"Apache-2.0"
] | 4 | 2020-04-14T15:02:37.000Z | 2022-03-10T20:35:54.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT EXAMPLE --
-- --
-- Copyright (C) 2014, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This file provides declarations for the user LEDs on the STM32F4 Discovery
-- board from ST Microelectronics.
with STM32F4; use STM32F4;
package LEDs is
pragma Elaborate_Body;
type User_LED is (Green, Orange, Red, Blue);
for User_LED use
(Green => 16#1000#,
Orange => 16#2000#,
Red => 16#4000#,
Blue => 16#8000#);
-- As a result of the representation clause, avoid iterating directly over
-- the type since that will require an implicit lookup in the generated
-- code of the loop. Such usage seems unlikely so this direct
-- representation is reasonable, and efficient.
for User_LED'Size use Word'Size;
-- we convert the LED values to Word values in order to write them to
-- the register, so the size must be the same
LED3 : User_LED renames Orange;
LED4 : User_LED renames Green;
LED5 : User_LED renames Red;
LED6 : User_LED renames Blue;
procedure On (This : User_LED) with Inline;
procedure Off (This : User_LED) with Inline;
procedure All_Off with Inline;
procedure All_On with Inline;
end LEDs;
| 48.692308 | 78 | 0.504897 |
d04aa9d30a9fe358c1d77cb388182352302b1d4c | 4,077 | adb | Ada | Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/uninitialized_vars/parse.adb | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/uninitialized_vars/parse.adb | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/uninitialized_vars/parse.adb | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | -- Copyright 2009-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/>.
-- This program declares a bunch of unconstrained objects and
-- discrinimated records; the goal is to check that GDB does not crash
-- when printing them even if they are not initialized.
with Parse_Controlled;
procedure Parse is -- START
A : aliased Integer := 1;
type Access_Type is access all Integer;
type String_Access is access String;
type My_Record is record
Field1 : Access_Type;
Field2 : String (1 .. 2);
end record;
type Discriminants_Record (A : Integer; B : Boolean) is record
C : Float;
end record;
Z : Discriminants_Record := (A => 1, B => False, C => 2.0);
type Variable_Record (A : Boolean := True) is record
case A is
when True =>
B : Integer;
when False =>
C : Float;
D : Integer;
end case;
end record;
Y : Variable_Record := (A => True, B => 1);
Y2 : Variable_Record := (A => False, C => 1.0, D => 2);
Nv : Parse_Controlled.Null_Variant;
type Union_Type (A : Boolean := False) is record
case A is
when True => B : Integer;
when False => C : Float;
end case;
end record;
pragma Unchecked_Union (Union_Type);
Ut : Union_Type := (A => True, B => 3);
type Tagged_Type is tagged record
A : Integer;
B : Character;
end record;
Tt : Tagged_Type := (A => 2, B => 'C');
type Child_Tagged_Type is new Tagged_Type with record
C : Float;
end record;
Ctt : Child_Tagged_Type := (Tt with C => 4.5);
type Child_Tagged_Type2 is new Tagged_Type with null record;
Ctt2 : Child_Tagged_Type2 := (Tt with null record);
type My_Record_Array is array (Natural range <>) of My_Record;
W : My_Record_Array := ((Field1 => A'Access, Field2 => "ab"),
(Field1 => A'Access, Field2 => "rt"));
type Discriminant_Record (Num1, Num2,
Num3, Num4 : Natural) is record
Field1 : My_Record_Array (1 .. Num2);
Field2 : My_Record_Array (Num1 .. 10);
Field3 : My_Record_Array (Num1 .. Num2);
Field4 : My_Record_Array (Num3 .. Num2);
Field5 : My_Record_Array (Num4 .. Num2);
end record;
Dire : Discriminant_Record (1, 7, 3, 0);
type Null_Variant_Part (Discr : Integer) is record
case Discr is
when 1 => Var_1 : Integer;
when 2 => Var_2 : Boolean;
when others => null;
end case;
end record;
Nvp : Null_Variant_Part (3);
type T_Type is array (Positive range <>) of Integer;
type T_Ptr_Type is access T_Type;
T_Ptr : T_Ptr_Type := new T_Type' (13, 17);
T_Ptr2 : T_Ptr_Type := new T_Type' (2 => 13, 3 => 17);
function Foos return String is
begin
return "string";
end Foos;
My_Str : String := Foos;
type Value_Var_Type is ( V_Null, V_Boolean, V_Integer );
type Value_Type( Var : Value_Var_Type := V_Null ) is
record
case Var is
when V_Null =>
null;
when V_Boolean =>
Boolean_Value : Boolean;
when V_Integer =>
Integer_Value : Integer;
end case;
end record;
NBI_N : Value_Type := (Var => V_Null);
NBI_I : Value_Type := (Var => V_Integer, Integer_Value => 18);
NBI_B : Value_Type := (Var => V_Boolean, Boolean_Value => True);
begin
null;
end Parse;
| 31.122137 | 73 | 0.616875 |
20b5c821bc1833170964f31bab4662b298f7a05b | 7,164 | adb | Ada | Comp_Stats_Unit_test.adb | salmoni/CompStats_Statistics_Ada | d008b2813f33fc781d95192321793f1a6ef6d847 | [
"MIT"
] | null | null | null | Comp_Stats_Unit_test.adb | salmoni/CompStats_Statistics_Ada | d008b2813f33fc781d95192321793f1a6ef6d847 | [
"MIT"
] | null | null | null | Comp_Stats_Unit_test.adb | salmoni/CompStats_Statistics_Ada | d008b2813f33fc781d95192321793f1a6ef6d847 | [
"MIT"
] | null | null | null |
with Ada.Text_IO, Ada.Integer_Text_IO, Ada.Float_Text_IO;
use Ada.Text_IO, Ada.Integer_Text_IO, Ada.Float_Text_IO;
with CompStats_Statistics;
use CompStats_Statistics;
procedure Comp_Stats_Unit_test is
Values: CompStats_Statistics.Values_Array(1..20);
Values2 : CompStats_Statistics.Values_Array(1..10);
procedure Test_Get_Count (Values : CompStats_Statistics.Values_Array) is
Result : INTEGER;
begin
Put("Get_Count : ");
Result := Get_Count(Values);
if Result = 20 then
Put("True");
else
Put(" False - ");
Put(Result);
end if;
New_Line;
end Test_Get_Count;
procedure Test_Get_Minimum (Values : CompStats_Statistics.Values_Array) is
Result : FLOAT;
begin
Put("Get_Minimum : ");
Result := Get_Minimum(Values);
if Result = -1.405158 then
Put("True");
else
Put(" False - ");
Put(Result);
end if;
New_Line;
end Test_Get_Minimum;
procedure Test_Get_Maximum (Values : CompStats_Statistics.Values_Array) is
Result : FLOAT;
begin
Put("Get_Maximum : ");
Result := Get_Maximum(Values);
if Result = 2.614303 then
Put("True");
else
Put(" False - ");
Put(Result);
end if;
New_Line;
end Test_Get_Maximum;
procedure Test_Get_Range (Values : CompStats_Statistics.Values_Array) is
Result : FLOAT;
begin
Put("Get_Range : ");
Result := Get_Range(Values);
if Result = 4.019462 then
Put("True");
else
Put(" False - ");
Put(Result);
end if;
New_Line;
end Test_Get_Range;
procedure Test_Get_Sum (Values : CompStats_Statistics.Values_Array) is
Result : FLOAT;
begin
Put("Get_Sum : ");
Result := Get_Sum(Values);
if Result = 4.070304 then
Put("True");
else
Put(" False - ");
Put(Result);
end if;
New_Line;
end Test_Get_Sum;
procedure Test_Get_Mean (Values : CompStats_Statistics.Values_Array) is
Result : FLOAT;
begin
Put("Get_Mean : ");
Result := Get_Mean (Values);
if Result = 0.2035152 then
Put("True");
else
Put(" False - ");
Put(Result);
end if;
New_Line;
end Test_Get_Mean;
procedure Test_Get_Sum_Of_Squares (Values : CompStats_Statistics.Values_Array) is
Result : FLOAT;
begin
Put("Get_Sum_Of_Squares : ");
Result := Get_Sum_Of_Squares (Values);
if Result = 24.19856 then
Put("True");
else
Put(" False - ");
Put(Result);
end if;
New_Line;
end Test_Get_Sum_Of_Squares;
procedure Test_Get_Population_Variance (Values : CompStats_Statistics.Values_Array) is
Result : FLOAT;
begin
Put("Get_Population_Variance : ");
Result := Get_Population_Variance (Values);
if Result = 1.209928 then
Put("True");
else
Put(" False - ");
Put(Result);
end if;
New_Line;
end Test_Get_Population_Variance;
procedure Test_Get_Sample_Variance (Values : CompStats_Statistics.Values_Array) is
Result : FLOAT;
begin
Put("Get_Sample_Variance : ");
Result := Get_Sample_Variance (Values);
if Result = 1.273608 then
Put("True");
else
Put(" False - ");
Put(Result);
end if;
New_Line;
end Test_Get_Sample_Variance;
procedure Test_Get_Population_Standard_Deviation (Values : CompStats_Statistics.Values_Array) is
Result : FLOAT;
begin
Put("Get_Population_Standard_Deviation : ");
Result := Get_Population_Standard_Deviation (Values);
if Result = 1.099967 then
Put("True");
else
Put(" False - ");
Put(Result);
end if;
New_Line;
end Test_Get_Population_Standard_Deviation;
procedure Test_Get_Sample_Standard_Deviation (Values : CompStats_Statistics.Values_Array) is
Result : FLOAT;
begin
Put("Get_Sample_Standard_Deviation : ");
Result := Get_Sample_Standard_Deviation (Values);
if Result = 1.128543 then
Put("True");
else
Put(" False - ");
Put(Result);
end if;
New_Line;
end Test_Get_Sample_Standard_Deviation;
procedure Test_Get_Standard_Error_of_Mean (Values : CompStats_Statistics.Values_Array) is
Result : FLOAT;
begin
Put("Get_Standard_Error_of_Mean : ");
Result := Get_Standard_Error_of_Mean (Values);
if Result = 0.2523498 then
Put("True");
else
Put(" False - ");
Put(Result);
end if;
New_Line;
end Test_Get_Standard_Error_of_Mean;
procedure Test_Get_Coefficient_Of_Variation (Values : CompStats_Statistics.Values_Array) is
Result : FLOAT;
begin
Put("Get_Coefficient_Of_Variation : ");
Result := Get_Coefficient_Of_Variation (Values);
if Result = 5.54525 then
Put("True");
else
Put(" False - ");
Put(Result);
end if;
New_Line;
end Test_Get_Coefficient_Of_Variation;
procedure Test_Get_Unique_Values (Values : CompStats_Statistics.Values_Array) is
begin
Put("Get_Unique_Values : ");
declare
Result : CompStats_Statistics.Values_Array := Get_Unique_Values (Values);
begin
for index in Integer range 1..Result'Length loop
put(Result(index));
put(", ");
end loop;
New_Line;
end;
end Test_Get_Unique_Values;
begin
Values := (0.4926728,-0.9673927, -0.4806392, 1.8226585, -1.3384936, 1.1307992, -0.3709324, 2.6143034, 0.6338060, -1.1862009, -0.5621848, 0.7465022, 1.8787472, -0.1642065, -1.4051581, 0.1519102, 0.1349542, 0.8196982, -0.7524447, 0.8719052);
Values2 := (1.0, 1.0, 1.0, 2.3, 2.3, 2.3, -1.0, -1.0, -6.0, 0.0);
Test_Get_Count (Values);
Test_Get_Minimum (Values);
Test_Get_Maximum (Values);
Test_Get_Range (Values);
Test_Get_Sum (Values);
Test_Get_Mean (Values);
Test_Get_Sum_Of_Squares (Values);
Test_Get_Population_Variance (Values);
Test_Get_Sample_Variance (Values);
Test_Get_Population_Standard_Deviation (Values);
Test_Get_Sample_Standard_Deviation (Values);
Test_Get_Standard_Error_of_Mean (Values);
Test_Get_Coefficient_Of_Variation (Values);
Test_Get_Unique_Values (Values2);
end Comp_Stats_Unit_test;
-- 0.4926728,-0.9673927, -0.4806392, 1.8226585, -1.3384936, 1.1307992, -0.3709324, 2.6143034, 0.6338060, -1.1862009, -0.5621848, 0.7465022, 1.8787472, -0.1642065, -1.4051581, 0.1519102, 0.1349542, 0.8196982, -0.7524447, 0.8719052
| 25.956522 | 243 | 0.588917 |
10769cd696c5f95e9503a0bf786c4c20bfb73bd9 | 9,712 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/s-parame-vxworks.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/ada/s-parame-vxworks.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/s-parame-vxworks.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . P A R A M E T E R S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2014, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This is the default VxWorks version of the package
-- This package defines some system dependent parameters for GNAT. These
-- are values that are referenced by the runtime library and are therefore
-- relevant to the target machine.
-- The parameters whose value is defined in the spec are not generally
-- expected to be changed. If they are changed, it will be necessary to
-- recompile the run-time library.
-- The parameters which are defined by functions can be changed by modifying
-- the body of System.Parameters in file s-parame.adb. A change to this body
-- requires only rebinding and relinking of the application.
-- Note: do not introduce any pragma Inline statements into this unit, since
-- otherwise the relinking and rebinding capability would be deactivated.
package System.Parameters is
pragma Pure;
---------------------------------------
-- Task And Stack Allocation Control --
---------------------------------------
type Task_Storage_Size is new Integer;
-- Type used in tasking units for task storage size
type Size_Type is new Task_Storage_Size;
-- Type used to provide task storage size to runtime
Unspecified_Size : constant Size_Type := Size_Type'First;
-- Value used to indicate that no size type is set
subtype Percentage is Size_Type range -1 .. 100;
Dynamic : constant Size_Type := -1;
-- The secondary stack ratio is a constant between 0 and 100 which
-- determines the percentage of the allocated task stack that is
-- used by the secondary stack (the rest being the primary stack).
-- The special value of minus one indicates that the secondary
-- stack is to be allocated from the heap instead.
Sec_Stack_Percentage : constant Percentage := Dynamic;
-- This constant defines the handling of the secondary stack
Sec_Stack_Dynamic : constant Boolean := Sec_Stack_Percentage = Dynamic;
-- Convenient Boolean for testing for dynamic secondary stack
function Default_Stack_Size return Size_Type;
-- Default task stack size used if none is specified
function Minimum_Stack_Size return Size_Type;
-- Minimum task stack size permitted
function Adjust_Storage_Size (Size : Size_Type) return Size_Type;
-- Given the storage size stored in the TCB, return the Storage_Size
-- value required by the RM for the Storage_Size attribute. The
-- required adjustment is as follows:
--
-- when Size = Unspecified_Size, return Default_Stack_Size
-- when Size < Minimum_Stack_Size, return Minimum_Stack_Size
-- otherwise return given Size
Default_Env_Stack_Size : constant Size_Type := 14_336;
-- Assumed size of the environment task, if no other information
-- is available. This value is used when stack checking is
-- enabled and no GNAT_STACK_LIMIT environment variable is set.
-- This value is chosen as the VxWorks default stack size is 20kB,
-- and a little more than 4kB is necessary for the run time.
Stack_Grows_Down : constant Boolean := True;
-- This constant indicates whether the stack grows up (False) or
-- down (True) in memory as functions are called. It is used for
-- proper implementation of the stack overflow check.
----------------------------------------------
-- Characteristics of types in Interfaces.C --
----------------------------------------------
long_bits : constant := Long_Integer'Size;
-- Number of bits in type long and unsigned_long. The normal convention
-- is that this is the same as type Long_Integer, but this may not be true
-- of all targets.
ptr_bits : constant := Standard'Address_Size;
subtype C_Address is System.Address;
-- Number of bits in Interfaces.C pointers, normally a standard address
C_Malloc_Linkname : constant String := "__gnat_malloc";
-- Name of runtime function used to allocate such a pointer
----------------------------------------------
-- Behavior of Pragma Finalize_Storage_Only --
----------------------------------------------
-- Garbage_Collected is a Boolean constant whose value indicates the
-- effect of the pragma Finalize_Storage_Entry on a controlled type.
-- Garbage_Collected = False
-- The system releases all storage on program termination only,
-- but not other garbage collection occurs, so finalization calls
-- are omitted only for outer level objects can be omitted if
-- pragma Finalize_Storage_Only is used.
-- Garbage_Collected = True
-- The system provides full garbage collection, so it is never
-- necessary to release storage for controlled objects for which
-- a pragma Finalize_Storage_Only is used.
Garbage_Collected : constant Boolean := False;
-- The storage mode for this system (release on program exit)
---------------------
-- Tasking Profile --
---------------------
-- In the following sections, constant parameters are defined to
-- allow some optimizations and fine tuning within the tasking run time
-- based on restrictions on the tasking features.
----------------------
-- Locking Strategy --
----------------------
Single_Lock : constant Boolean := False;
-- Indicates whether a single lock should be used within the tasking
-- run-time to protect internal structures. If True, a single lock
-- will be used, meaning less locking/unlocking operations, but also
-- more global contention. In general, Single_Lock should be set to
-- True on single processor machines, and to False to multi-processor
-- systems, but this can vary from application to application and also
-- depends on the scheduling policy.
-------------------
-- Task Abortion --
-------------------
No_Abort : constant Boolean := False;
-- This constant indicates whether abort statements and asynchronous
-- transfer of control (ATC) are disallowed. If set to True, it is
-- assumed that neither construct is used, and the run time does not
-- need to defer/undefer abort and check for pending actions at
-- completion points. A value of True for No_Abort corresponds to:
-- pragma Restrictions (No_Abort_Statements);
-- pragma Restrictions (Max_Asynchronous_Select_Nesting => 0);
---------------------
-- Task Attributes --
---------------------
Max_Attribute_Count : constant := 16;
-- Number of task attributes stored in the task control block
--------------------
-- Runtime Traces --
--------------------
Runtime_Traces : constant Boolean := False;
-- This constant indicates whether the runtime outputs traces to a
-- predefined output or not (True means that traces are output).
-- See System.Traces for more details.
-----------------------
-- Task Image Length --
-----------------------
Max_Task_Image_Length : constant := 32;
-- This constant specifies the maximum length of a task's image
------------------------------
-- Exception Message Length --
------------------------------
Default_Exception_Msg_Max_Length : constant := 200;
-- This constant specifies the default number of characters to allow
-- in an exception message (200 is minimum required by RM 11.4.1(18)).
end System.Parameters;
| 46.028436 | 78 | 0.589477 |
398e34d3f9f0d339a4e91ebeea5c5b7cfd41f73e | 1,953 | adb | Ada | m3-sys/m3gdb/gdb/gdb/testsuite/gdb.ada/arrayidx/p.adb | brakmic/cm3 | b99e280eca00c322e04e0586951de50108e51343 | [
"BSD-4-Clause-UC",
"BSD-4-Clause",
"BSD-3-Clause"
] | 105 | 2015-03-02T16:58:34.000Z | 2022-03-28T07:17:49.000Z | m3-sys/m3gdb/gdb/gdb/testsuite/gdb.ada/arrayidx/p.adb | ganeshbabuNN/cm3 | 9fb432d44a2ba89575febb38f7c1eb3dca6a3879 | [
"BSD-4-Clause-UC",
"BSD-4-Clause",
"BSD-3-Clause"
] | 145 | 2015-03-18T10:08:17.000Z | 2022-03-31T01:27:08.000Z | m3-sys/m3gdb/gdb/gdb/testsuite/gdb.ada/arrayidx/p.adb | ganeshbabuNN/cm3 | 9fb432d44a2ba89575febb38f7c1eb3dca6a3879 | [
"BSD-4-Clause-UC",
"BSD-4-Clause",
"BSD-3-Clause"
] | 26 | 2015-10-10T09:37:44.000Z | 2022-02-23T02:02:05.000Z | -- Copyright 2005 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 2 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program; if not, write to the Free Software
-- Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
-- MA 02110-1301, USA
procedure P is
type Index is (One, Two, Three);
type Table is array (Integer range 1 .. 3) of Integer;
type ETable is array (Index) of Integer;
type RTable is array (Index range Two .. Three) of Integer;
type UTable is array (Positive range <>) of Integer;
type PTable is array (Index) of Boolean;
pragma Pack (PTable);
function Get_UTable (I : Integer) return UTable is
begin
return Utable'(1 => I, 2 => 2, 3 => 3);
end Get_UTable;
One_Two_Three : Table := (1, 2, 3);
E_One_Two_Three : ETable := (1, 2, 3);
R_Two_Three : RTable := (2, 3);
U_One_Two_Three : UTable := Get_UTable (1);
P_One_Two_Three : PTable := (False, True, True);
Few_Reps : UTable := (1, 2, 3, 3, 3, 3, 3, 4, 5);
Many_Reps : UTable := (1, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 5);
Empty : array (1 .. 0) of Integer := (others => 0);
begin
One_Two_Three (1) := 4; -- START
E_One_Two_Three (One) := 4;
R_Two_Three (Two) := 4;
U_One_Two_Three (U_One_Two_Three'First) := 4;
P_One_Two_Three (One) := True;
Few_Reps (Few_Reps'First) := 2;
Many_Reps (Many_Reps'First) := 2;
Empty := (others => 1);
end P;
| 34.263158 | 74 | 0.656426 |
107fead7d71f7c578bf14e472b0bb1a015fe5e3d | 3,113 | ads | Ada | .emacs.d/elpa/wisi-3.0.1/wisitoken-parse-packrat-procedural.ads | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/wisi-3.0.1/wisitoken-parse-packrat-procedural.ads | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/wisi-3.0.1/wisitoken-parse-packrat-procedural.ads | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | -- Abstract :
--
-- Procedural packrat parser, supporting only direct left recursion.
--
-- Coding style, algorithm is the same as generated by
-- wisi-generate_packrat, but in procedural form.
--
-- References:
--
-- See parent.
--
-- Copyright (C) 2018 - 2019 Free Software Foundation, Inc.
--
-- This library is free software; you can redistribute it and/or modify it
-- under terms of the GNU General Public License as published by the Free
-- Software Foundation; either version 3, or (at your option) any later
-- version. This library is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHAN-
-- TABILITY or FITNESS FOR A PARTICULAR PURPOSE.
-- As a special exception under Section 7 of GPL version 3, you are granted
-- additional permissions described in the GCC Runtime Library Exception,
-- version 3.1, as published by the Free Software Foundation.
pragma License (Modified_GPL);
with WisiToken.Productions;
package WisiToken.Parse.Packrat.Procedural is
-- These types duplicate Packrat.Generated. We keep them separate so
-- we can experiment with ways of implementing indirect left
-- recursion.
type Memo_State is (No_Result, Failure, Success);
subtype Result_States is Memo_State range Failure .. Success;
type Memo_Entry (State : Memo_State := No_Result) is record
case State is
when No_Result =>
null;
when Failure =>
null;
when Success =>
Result : WisiToken.Syntax_Trees.Valid_Node_Index;
Last_Pos : Base_Token_Index;
end case;
end record;
package Memos is new SAL.Gen_Unbounded_Definite_Vectors
(Token_Index, Memo_Entry, Default_Element => (others => <>));
type Derivs is array (Token_ID range <>) of Memos.Vector;
type Parser (First_Nonterminal, Last_Nonterminal : Token_ID) is new Packrat.Parser with
record
Grammar : WisiToken.Productions.Prod_Arrays.Vector;
Start_ID : Token_ID;
Direct_Left_Recursive : Token_ID_Set (First_Nonterminal .. Last_Nonterminal);
Derivs : Procedural.Derivs (First_Nonterminal .. Last_Nonterminal);
end record;
function Create
(Grammar : in WisiToken.Productions.Prod_Arrays.Vector;
Direct_Left_Recursive : in Token_ID_Set;
Start_ID : in Token_ID;
Trace : access WisiToken.Trace'Class;
Lexer : WisiToken.Lexer.Handle;
User_Data : WisiToken.Syntax_Trees.User_Data_Access)
return Procedural.Parser;
overriding procedure Parse (Parser : aliased in out Procedural.Parser);
overriding function Tree (Parser : in Procedural.Parser) return Syntax_Trees.Tree;
overriding function Any_Errors (Parser : in Procedural.Parser) return Boolean
is (False);
-- All errors are reported by Parse raising Syntax_Error.
overriding procedure Put_Errors (Parser : in Procedural.Parser)
is null;
end WisiToken.Parse.Packrat.Procedural;
| 37.059524 | 90 | 0.690652 |
23e64ff498b926b6230247f8dbea106d67baab16 | 4,742 | ads | Ada | llvm-gcc-4.2-2.9/gcc/ada/s-traceb.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 1 | 2016-04-09T02:58:13.000Z | 2016-04-09T02:58:13.000Z | llvm-gcc-4.2-2.9/gcc/ada/s-traceb.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/s-traceb.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . T R A C E B A C K --
-- --
-- S p e c --
-- --
-- Copyright (C) 1999-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. --
-- --
------------------------------------------------------------------------------
-- This package provides a method for generating a traceback of the
-- current execution location. The traceback shows the locations of
-- calls in the call chain, up to either the top or a designated
-- number of levels.
pragma Polling (Off);
-- We must turn polling off for this unit, because otherwise we get
-- elaboration circularities with System.Exception_Tables.
package System.Traceback is
----------------
-- Call_Chain --
----------------
procedure Call_Chain
(Traceback : System.Address;
Max_Len : Natural;
Len : out Natural;
Exclude_Min : System.Address := System.Null_Address;
Exclude_Max : System.Address := System.Null_Address;
Skip_Frames : Natural := 1);
-- Store up to Max_Len code locations in Traceback, corresponding to
-- the current call chain.
--
-- Traceback is the address of an array of addresses where the
-- result will be stored.
--
-- Max_Len is the length of the Traceback array. If the call chain
-- is longer than this, then additional entries are discarded, and
-- the traceback is missing some of the highest level entries.
--
-- Len is the returned actual number of addresses stored
-- in the Traceback array.
--
-- Exclude_Min/Exclude_Max, if non null, provide a range of addresses
-- to ignore from the computation of the traceback.
--
-- Skip_Frames says how many of the most recent calls should at least
-- be excluded from the result, regardless of the exclusion bounds and
-- starting with this procedure itself: 1 means exclude the frame for
-- this procedure, 2 means 1 + exclude the frame for this procedure's
-- caller, ...
--
-- On return, the Traceback array is filled in, and Len indicates
-- the number of stored entries. The first entry is the most recent
-- call, and the last entry is the highest level call.
function C_Call_Chain
(Traceback : System.Address;
Max_Len : Natural)
return Natural;
pragma Export (C, C_Call_Chain, "system__traceback__c_call_chain");
-- Version that can be used directly from C
end System.Traceback;
| 52.688889 | 78 | 0.531843 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.