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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
106ff57bd6dc72a464a1713def32fc388e92e17f | 2,154 | ads | Ada | disorderly/disorderly-basic_rand-clock_entropy.ads | jscparker/math_packages | b112a90338014d5c2dfae3f7265ee30841fb6cfd | [
"ISC",
"MIT"
] | 30 | 2018-12-09T01:15:04.000Z | 2022-03-20T16:14:54.000Z | disorderly/disorderly-basic_rand-clock_entropy.ads | jscparker/math_packages | b112a90338014d5c2dfae3f7265ee30841fb6cfd | [
"ISC",
"MIT"
] | null | null | null | disorderly/disorderly-basic_rand-clock_entropy.ads | jscparker/math_packages | b112a90338014d5c2dfae3f7265ee30841fb6cfd | [
"ISC",
"MIT"
] | null | null | null |
-------------------------------------------------------------------------------
-- package Disorderly.Basic_Rand.Clock_Entropy, Random Number Initialization
-- Copyright (C) 1995-2018 Jonathan S. Parker
--
-- 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.
-------------------------------------------------------------------------------
-- PACKAGE Disorderly.Basic_Rand.Clock_Entropy
--
-- Clock provides a few bits of entropy to help find a unique initial seed.
--
-- Calendar.Clock is used here by procedure Reset to help choose the initial
-- State, S, for calls to the random number generator, Get_Rand.
--
-- Want Disorderly.Basic_Rand to be a Pure package, and thread-safe, but
-- Package Calendar is not pure. That is why the Calendar based
-- Reset is placed here, a child package of Disorderly.Basic_Rand.
--
package Disorderly.Basic_Rand.Clock_Entropy is
procedure Reset (S : out State);
-- procedure Reset_with_Calendar initializes State S.
-- It calls Calendar (along with 2 calls to the delay statement) in
-- an attempt to get a unique State each time Reset is called.
--
-- All we need is 1 bit of difference between the outputs of two
-- successive calls to Ada.Calendar.Clock, and the two 256 bit
-- states generated by the successive calls will have no apparent
-- similarities. (Not remotely good enough for cryptography, but
-- very useful for Monte-Carlo applications.)
end Disorderly.Basic_Rand.Clock_Entropy;
| 46.826087 | 79 | 0.701486 |
399b89d6efd3d4973c4f0aaa3a57f65fb26cacf7 | 781 | ads | Ada | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/display_nested/pack.ads | 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/display_nested/pack.ads | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | null | null | null | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/display_nested/pack.ads | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | null | null | null | -- Copyright 2019-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/>.
package Pack is
procedure Do_Nothing (S : String);
end Pack;
| 37.190476 | 73 | 0.734955 |
23eb301e5b6c33ba55c7ba06c059a4a13c3f7dda | 3,473 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/a/a74205f.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/a/a74205f.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/a/a74205f.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- A74205F.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- CHECK THAT FOR AN ACCESS TYPE WHOSE DESIGNATED TYPE IS A PRIVATE TYPE
-- ADDITIONAL OPERATIONS FOR THE ACCESS TYPE WHICH DEPEND ON
-- CHARACTERISTICS OF THE FULL DECLARATION OF THE PRIVATE TYPE ARE MADE
-- AVAILABLE AT THE EARLIEST PLACE WITHIN THE IMMEDIATE SCOPE OF THE
-- ACCESS TYPE DECLARATION AND AFTER THE FULL DECLARATION OF THE PRIVATE
-- TYPE.
-- (1) CHECK FOR COMPONENT SELECTION WITH RECORD TYPES
-- (2) CHECK FOR INDEXED COMPONENTS AND SLICES WITH ARRAY TYPES
-- (3) CHECK FOR USE OF 'FIRST, 'LAST, 'RANGE, AND 'LENGTH WITH ARRAY
-- TYPES
-- DSJ 5/5/83
WITH REPORT ;
PROCEDURE A74205F IS
USE REPORT ;
BEGIN
TEST("A74205F", "CHECK THAT ADDITIONAL OPERATIONS OF ACCESS TYPES "
& "OF PRIVATE TYPES ARE AVAILABLE AT THE EARLIEST "
& "PLACE IN THE IMMEDIATE SCOPE OF THE ACCESS TYPE "
& "AND AFTER THE FULL DECLARATION") ;
DECLARE
PACKAGE PACK1 IS
TYPE T1 IS PRIVATE ;
TYPE T2 IS PRIVATE ;
PACKAGE PACK2 IS
TYPE ACC1 IS ACCESS T1 ;
TYPE ACC2 IS ACCESS T2 ;
END PACK2 ;
PRIVATE
TYPE T1 IS ARRAY ( 1 .. 2 ) OF INTEGER ;
TYPE T2 IS
RECORD
C1, C2 : INTEGER ;
END RECORD ;
END PACK1 ;
PACKAGE BODY PACK1 IS
A1 : PACK2.ACC1 := NEW T1'(2,4) ; -- LEGAL
A2 : PACK2.ACC1 := NEW T1'(6,8) ; -- LEGAL
R1 : PACK2.ACC2 := NEW T2'(3,5) ; -- LEGAL
R2 : PACK2.ACC2 := NEW T2'(7,9) ; -- LEGAL
PACKAGE BODY PACK2 IS
X1 : INTEGER := A1(1) ; -- LEGAL
X2 : INTEGER := A1'FIRST ; -- LEGAL
X3 : INTEGER := A1'LAST ; -- LEGAL
X4 : INTEGER := A1'LENGTH ; -- LEGAL
B1 : BOOLEAN := 3 IN A1'RANGE ; -- LEGAL
X5 : INTEGER := R1.C1 ; -- LEGAL
END PACK2 ;
END PACK1 ;
BEGIN
NULL ;
END ;
RESULT ;
END A74205F ;
| 36.946809 | 79 | 0.564066 |
1061524acc961c50f37b201b880da656b64f345a | 3,250 | adb | Ada | src/support_utils/support_utils-line_stuff-suffix_line_io.adb | finleyexp/whitakers-words | 9c07fe7e96ac15dc3262b82a37f6ea69947f458b | [
"FTL"
] | 204 | 2015-06-12T21:22:55.000Z | 2022-03-28T10:50:16.000Z | src/support_utils/support_utils-line_stuff-suffix_line_io.adb | finleyexp/whitakers-words | 9c07fe7e96ac15dc3262b82a37f6ea69947f458b | [
"FTL"
] | 98 | 2015-06-15T22:17:04.000Z | 2021-10-01T18:17:55.000Z | src/support_utils/support_utils-line_stuff-suffix_line_io.adb | finleyexp/whitakers-words | 9c07fe7e96ac15dc3262b82a37f6ea69947f458b | [
"FTL"
] | 50 | 2015-06-16T22:42:24.000Z | 2021-12-29T16:53:08.000Z | -- WORDS, a Latin dictionary, by Colonel William Whitaker (USAF, Retired)
--
-- Copyright William A. Whitaker (1936–2010)
--
-- This is a free program, which means it is proper to copy it and pass
-- it on to your friends. Consider it a developmental item for which
-- there is no charge. However, just for form, it is Copyrighted
-- (c). Permission is hereby freely given for any and all use of program
-- and data. You can sell it as your own, but at least tell me.
--
-- This version is distributed without obligation, but the developer
-- would appreciate comments and suggestions.
--
-- All parts of the WORDS system, source code and data files, are made freely
-- available to anyone who wishes to use them, for whatever purpose.
separate (Support_Utils.Line_Stuff)
package body Suffix_Line_Io is
use Part_Of_Speech_Type_IO;
use Suffix_Entry_Io;
Spacer : Character := ' ';
procedure Get (F : in File_Type; P : out Suffix_Line) is
begin
Get (F, P.Pofs);
Get (F, Spacer);
Get (F, P.Fix);
Get (F, Spacer);
Get (F, P.Connect);
Get (F, Spacer);
Get (F, P.Entr);
Get (F, Spacer);
Get (F, P.Mean);
end Get;
procedure Get (P : out Suffix_Line) is
begin
Get (P.Pofs);
Get (Spacer);
Get (P.Fix);
Get (Spacer);
Get (P.Connect);
Get (Spacer);
Get (P.Entr);
Get (Spacer);
Get (P.Mean);
end Get;
procedure Put (F : in File_Type; P : in Suffix_Line) is
begin
Put (F, P.Pofs);
Put (F, ' ');
Put (F, P.Fix);
Put (F, ' ');
Put (F, P.Connect);
Put (F, ' ');
Put (F, P.Entr);
Put (F, ' ');
Put (F, P.Mean);
end Put;
procedure Put (P : in Suffix_Line) is
begin
Put (P.Pofs);
Put (' ');
Put (P.Fix);
Put (' ');
Put (P.Connect);
Put (' ');
Put (P.Entr);
Put (' ');
Put (P.Mean);
end Put;
procedure Get (S : in String; P : out Suffix_Line; Last : out Integer) is
L : Integer := S'First - 1;
M : Integer := 0;
begin
M := L + Dictionary_Kind_IO.Default_Width;
Get (S (L + 1 .. S'Last), P.Pofs, L);
L := M;
L := L + 1;
M := L + Max_Stem_Size;
P.Fix := S (L + 1 .. M);
L := M;
L := L + 1;
P.Connect := S (L + 1);
L := L + 1;
M := L + Suffix_Entry_Io.Default_Width;
Get (S (L + 1 .. S'Last), P.Entr, L);
L := M + 1;
M := L + Max_Meaning_Size;
P.Mean := S (L + 1 .. M);
Last := M;
end Get;
procedure Put (S : out String; P : in Suffix_Line) is
L : Integer := S'First - 1;
M : Integer := 0;
begin
M := L + Dictionary_Kind_IO.Default_Width;
Put (S (L + 1 .. M), P.Pofs);
L := M + 1;
S (L) := ' ';
M := L + Max_Stem_Size;
S (L + 1 .. M) := P.Fix;
L := M + 1;
S (L) := ' ';
M := L + 1;
S (L + 1) := P.Connect;
L := M + 1;
S (L) := ' ';
M := L + Suffix_Entry_Io.Default_Width;
Put (S (L + 1 .. M), P.Entr);
L := M + 1;
S (L) := ' ';
M := L + Max_Meaning_Size;
S (L + 1 .. M) := P.Mean;
S (M + 1 .. S'Last) := (others => ' ');
end Put;
end Suffix_Line_Io;
| 26.639344 | 77 | 0.512923 |
39b453287456ed3a4e87dc18aded58a9fcf23eb4 | 9,427 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/cc/cc1227a.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/cc/cc1227a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/cc/cc1227a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- CC1227A.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, WHEN DERIVING FROM A FORMAL TYPE, THAT ALL THE PREDEFINED
-- OPERATIONS ASSOCIATED WITH THE CLASS OF THE FORMAL TYPE ARE
-- DECLARED FOR THE DERIVED TYPE.
-- HISTORY:
-- BCB 04/04/88 CREATED ORIGINAL TEST.
WITH REPORT; USE REPORT;
WITH SYSTEM; USE SYSTEM;
PROCEDURE CC1227A IS
GENERIC
TYPE FORM IS RANGE <>;
PACKAGE P IS
TYPE DER_FORM IS NEW FORM;
FUNCTION IDENT_DER(X : DER_FORM) RETURN DER_FORM;
FUNCTION IDENT_ADR(Y : ADDRESS) RETURN ADDRESS;
END P;
PACKAGE BODY P IS
DER_VAR : DER_FORM;
DER_FORM_BASE_FIRST : DER_FORM;
DER_FORM_FIRST : DER_FORM;
DER_FORM_LAST : DER_FORM;
DER_FORM_SIZE : DER_FORM;
DER_FORM_WIDTH : DER_FORM;
DER_FORM_POS : DER_FORM;
DER_FORM_VAL : DER_FORM;
DER_FORM_SUCC : DER_FORM;
DER_FORM_PRED : DER_FORM;
DER_FORM_IMAGE : STRING(1..5);
DER_FORM_VALUE : DER_FORM;
DER_VAR_SIZE : DER_FORM;
DER_VAR_ADDRESS : ADDRESS;
DER_EQUAL, DER_UNEQUAL : DER_FORM;
DER_GREATER : DER_FORM;
DER_MOD, DER_REM : DER_FORM;
DER_ABS, DER_EXP : DER_FORM;
INT : INTEGER := 5;
FUNCTION IDENT_DER(X : DER_FORM) RETURN DER_FORM IS
BEGIN
IF EQUAL(3,3) THEN
RETURN X;
END IF;
RETURN 0;
END IDENT_DER;
FUNCTION IDENT_ADR(Y : ADDRESS) RETURN ADDRESS IS
X : DER_FORM;
BEGIN
IF EQUAL(3,3) THEN
RETURN Y;
END IF;
RETURN X'ADDRESS;
END IDENT_ADR;
BEGIN
TEST ("CC1227A", "CHECK, WHEN DERIVING FROM A FORMAL TYPE, " &
"THAT ALL THE PREDEFINED OPERATIONS " &
"ASSOCIATED WITH THE CLASS OF THE FORMAL " &
"TYPE ARE DECLARED FOR THE DERIVED TYPE");
DER_VAR := IDENT_DER(1);
IF DER_VAR /= 1 THEN
FAILED ("IMPROPER VALUE FROM ASSIGNMENT OPERATION");
END IF;
IF DER_VAR NOT IN DER_FORM THEN
FAILED ("IMPROPER RESULT FROM MEMBERSHIP TEST");
END IF;
DER_VAR := DER_FORM'(2);
IF DER_VAR /= IDENT_DER(2) THEN
FAILED ("IMPROPER RESULT FROM QUALIFICATION");
END IF;
DER_VAR := DER_FORM(INT);
IF DER_VAR /= IDENT_DER(5) THEN
FAILED ("IMPROPER RESULT FROM EXPLICIT CONVERSION - " &
"INTEGER");
END IF;
DER_VAR := DER_FORM(3.0);
IF DER_VAR /= IDENT_DER(3) THEN
FAILED ("IMPROPER RESULT FROM EXPLICIT CONVERSION - " &
"FLOAT");
END IF;
DER_VAR := 1_000;
IF DER_VAR /= IDENT_DER(1000) THEN
FAILED ("IMPROPER RESULT FROM IMPLICIT CONVERSION");
END IF;
DER_FORM_BASE_FIRST := DER_FORM'BASE'FIRST;
DER_FORM_FIRST := DER_FORM'FIRST;
IF DER_FORM_BASE_FIRST /= IDENT_DER(DER_FORM_FIRST) THEN
FAILED ("IMPROPER VALUE FOR DER_FORM'BASE'FIRST");
END IF;
IF DER_FORM_FIRST /= IDENT_DER(DER_FORM'FIRST) THEN
FAILED ("IMPROPER VALUE FOR DER_FORM'FIRST");
END IF;
DER_FORM_LAST := DER_FORM'LAST;
IF DER_FORM_LAST /= IDENT_DER(DER_FORM'LAST) THEN
FAILED ("IMPROPER VALUE FOR DER_FORM'LAST");
END IF;
DER_FORM_SIZE := DER_FORM(DER_FORM'SIZE);
IF DER_FORM_SIZE /= IDENT_DER(DER_FORM(DER_FORM'SIZE)) THEN
FAILED ("IMPROPER VALUE FOR DER_FORM'SIZE");
END IF;
DER_FORM_WIDTH := DER_FORM(DER_FORM'WIDTH);
IF DER_FORM_WIDTH /= IDENT_DER(DER_FORM(DER_FORM'WIDTH)) THEN
FAILED ("IMPROPER VALUE FOR DER_FORM'WIDTH");
END IF;
DER_FORM_POS := DER_FORM(DER_FORM'POS(DER_VAR));
IF DER_FORM_POS /= IDENT_DER(DER_FORM(DER_FORM'POS(DER_VAR)))
THEN FAILED ("IMPROPER VALUE FOR DER_FORM'POS(DER_VAR)");
END IF;
DER_FORM_VAL := DER_FORM'VAL(DER_VAR);
IF DER_FORM_VAL /= IDENT_DER(DER_FORM'VAL(DER_VAR)) THEN
FAILED ("IMPROPER VALUE FOR DER_FORM'VAL(DER_VAR)");
END IF;
DER_FORM_SUCC := DER_FORM'SUCC(DER_VAR);
IF DER_FORM_SUCC /= IDENT_DER(DER_FORM'SUCC(DER_VAR)) THEN
FAILED ("IMPROPER VALUE FOR DER_FORM'SUCC(DER_VAR)");
END IF;
DER_FORM_PRED := DER_FORM'PRED(DER_VAR);
IF DER_FORM_PRED /= IDENT_DER(DER_FORM'PRED(DER_VAR)) THEN
FAILED ("IMPROPER VALUE FOR DER_FORM'PRED(DER_VAR)");
END IF;
DER_FORM_IMAGE := DER_FORM'IMAGE(DER_VAR);
IF DER_FORM_IMAGE(2..5) /= "1000" THEN
FAILED ("IMPROPER VALUE FOR DER_FORM'IMAGE(DER_VAR)");
END IF;
DER_FORM_VALUE := DER_FORM'VALUE(DER_FORM_IMAGE);
IF DER_FORM_VALUE /= IDENT_DER(1000) THEN
FAILED ("IMPROPER VALUE FOR DER_FORM'VALUE" &
"(DER_FORM_IMAGE)");
END IF;
DER_VAR_SIZE := DER_FORM(DER_VAR'SIZE);
IF DER_VAR_SIZE /= IDENT_DER(DER_FORM(DER_VAR'SIZE)) THEN
FAILED ("IMPROPER VALUE FOR DER_VAR'SIZE");
END IF;
DER_VAR_ADDRESS := DER_VAR'ADDRESS;
IF DER_VAR_ADDRESS /= IDENT_ADR(DER_VAR'ADDRESS) THEN
FAILED ("IMPROPER VALUE FOR DER_VAR'ADDRESS");
END IF;
DER_EQUAL := IDENT_DER(1000);
IF DER_VAR /= DER_EQUAL THEN
FAILED ("IMPROPER RESULT FROM INEQUALITY OPERATOR");
END IF;
DER_UNEQUAL := IDENT_DER(500);
IF DER_VAR = DER_UNEQUAL THEN
FAILED ("IMPROPER RESULT FROM EQUALITY OPERATOR");
END IF;
IF DER_VAR < DER_UNEQUAL THEN
FAILED ("IMPROPER RESULT FROM LESS THAN OPERATOR");
END IF;
IF DER_VAR <= DER_UNEQUAL THEN
FAILED ("IMPROPER RESULT FROM LESS THAN OR EQUAL TO " &
"OPERATOR");
END IF;
DER_GREATER := IDENT_DER(1500);
IF DER_VAR > DER_GREATER THEN
FAILED ("IMPROPER RESULT FROM GREATER THAN OPERATOR");
END IF;
IF DER_VAR >= DER_GREATER THEN
FAILED ("IMPROPER RESULT FROM GREATER THAN OR EQUAL " &
"TO OPERATOR");
END IF;
DER_VAR := DER_VAR + DER_EQUAL;
IF DER_VAR /= IDENT_DER(2000) THEN
FAILED ("IMPROPER RESULT FROM ADDITION OPERATOR");
END IF;
DER_VAR := DER_VAR - DER_EQUAL;
IF DER_VAR /= IDENT_DER(1000) THEN
FAILED ("IMPROPER RESULT FROM SUBTRACTION OPERATOR");
END IF;
DER_VAR := DER_VAR * IDENT_DER(2);
IF DER_VAR /= IDENT_DER(2000) THEN
FAILED ("IMPROPER RESULT FROM MULTIPLICATION OPERATOR");
END IF;
DER_VAR := DER_VAR / IDENT_DER(2);
IF DER_VAR /= IDENT_DER(1000) THEN
FAILED ("IMPROPER RESULT FROM DIVISION OPERATOR");
END IF;
DER_MOD := DER_GREATER MOD DER_VAR;
IF DER_MOD /= IDENT_DER(500) THEN
FAILED ("IMPROPER RESULT FROM MOD OPERATOR");
END IF;
DER_REM := DER_GREATER REM DER_VAR;
IF DER_REM /= IDENT_DER(500) THEN
FAILED ("IMPROPER RESULT FROM REM OPERATOR");
END IF;
DER_ABS := ABS(IDENT_DER(-1500));
IF DER_ABS /= IDENT_DER(DER_GREATER) THEN
FAILED ("IMPROPER RESULT FROM ABS OPERATOR");
END IF;
DER_EXP := IDENT_DER(2) ** IDENT_INT(2);
IF DER_EXP /= IDENT_DER(4) THEN
FAILED ("IMPROPER RESULT FROM EXPONENTIATION OPERATOR");
END IF;
RESULT;
END P;
PACKAGE PACK IS NEW P(INTEGER);
BEGIN
NULL;
END CC1227A;
| 32.506897 | 79 | 0.567731 |
1cca940faba059bb3b9792599d1f06f0f7687499 | 1,413 | ads | Ada | extern/gnat_sdl/gnat_sdl/src/malloc_h.ads | AdaCore/training_material | 6651eb2c53f8c39649b8e0b3c757bc8ff963025a | [
"CC-BY-4.0"
] | 15 | 2020-10-07T08:56:45.000Z | 2022-02-08T23:13:22.000Z | extern/gnat_sdl/gnat_sdl/src/malloc_h.ads | AdaCore/training_material | 6651eb2c53f8c39649b8e0b3c757bc8ff963025a | [
"CC-BY-4.0"
] | 20 | 2020-11-05T14:35:20.000Z | 2022-01-13T15:59:33.000Z | extern/gnat_sdl/gnat_sdl/src/malloc_h.ads | AdaCore/training_material | 6651eb2c53f8c39649b8e0b3c757bc8ff963025a | [
"CC-BY-4.0"
] | 6 | 2020-10-08T15:57:06.000Z | 2021-08-31T12:03:08.000Z | pragma Ada_2005;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
with umingw_h;
package malloc_h is
-- arg-macro: procedure alloca (x)
-- __builtin_alloca((x))
type u_heapinfo is record
u_pentry : access int; -- c:\home\ochem\install\bin\../lib/gcc/i686-pc-mingw32/4.7.3/../../../../i686-pc-mingw32/include/malloc.h:47
u_size : aliased umingw_h.size_t; -- c:\home\ochem\install\bin\../lib/gcc/i686-pc-mingw32/4.7.3/../../../../i686-pc-mingw32/include/malloc.h:48
u_useflag : aliased int; -- c:\home\ochem\install\bin\../lib/gcc/i686-pc-mingw32/4.7.3/../../../../i686-pc-mingw32/include/malloc.h:49
end record;
pragma Convention (C_Pass_By_Copy, u_heapinfo); -- c:\home\ochem\install\bin\../lib/gcc/i686-pc-mingw32/4.7.3/../../../../i686-pc-mingw32/include/malloc.h:46
-- skipped func _resetstkoflw
-- skipped func _set_malloc_crt_max_wait
-- skipped func _expand
-- skipped func _msize
-- skipped func _get_sbh_threshold
-- skipped func _set_sbh_threshold
-- skipped func _set_amblksiz
-- skipped func _get_amblksiz
-- skipped func _heapadd
-- skipped func _heapchk
-- skipped func _heapmin
-- skipped func _heapset
-- skipped func _heapwalk
-- skipped func _heapused
-- skipped func _get_heap_handle
-- skipped func _MarkAllocaS
-- skipped func _freea
end malloc_h;
| 26.660377 | 161 | 0.669498 |
10778ce699c62581391e30215b20ef75fe218584 | 3,807 | adb | Ada | source/core/web-core-connectables-slots_0-slots_1-slots_2.adb | godunko/adawebui | ee524325fe701ef0a655cd0624e0ba701f0e8955 | [
"BSD-3-Clause"
] | 2 | 2020-01-31T07:00:09.000Z | 2021-06-25T15:50:00.000Z | source/core/web-core-connectables-slots_0-slots_1-slots_2.adb | godunko/adawebui | ee524325fe701ef0a655cd0624e0ba701f0e8955 | [
"BSD-3-Clause"
] | null | null | null | source/core/web-core-connectables-slots_0-slots_1-slots_2.adb | godunko/adawebui | ee524325fe701ef0a655cd0624e0ba701f0e8955 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2016-2020, 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: 5703 $ $Date: 2017-01-20 22:17:20 +0300 (Fri, 20 Jan 2017) $
------------------------------------------------------------------------------
package body Web.Core.Connectables.Slots_0.Slots_1.Slots_2 is
---------------------
-- Create_Slot_End --
---------------------
not overriding function Create_Slot_End
(Self : Slot) return not null Slot_End_Access is
begin
raise Program_Error with "Slot.Create_Slot_End must be overrided";
return null;
end Create_Slot_End;
end Web.Core.Connectables.Slots_0.Slots_1.Slots_2;
| 64.525424 | 78 | 0.420016 |
fbacc8cfdd0557823b541798a87e5cba78c326ac | 18,497 | adb | Ada | tools/xml2ayacc/encoding/auto/encodings-maps-cp_1255.adb | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | 4 | 2016-02-05T15:51:56.000Z | 2022-03-25T20:38:32.000Z | tools/xml2ayacc/encoding/auto/encodings-maps-cp_1255.adb | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | null | null | null | tools/xml2ayacc/encoding/auto/encodings-maps-cp_1255.adb | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | null | null | null | -- Auto generated file. Don't edit
-- Read copyright and license at the end of this file
package body Encodings.Maps.CP_1255 is
Forward : Forward_Map (Character'Val(16#80#) .. Character'Last) :=
(Wide_Character'Val(16#20AC#),
Wide_Character'Val(16#FFFF#),
Wide_Character'Val(16#201A#),
Wide_Character'Val( 16#192#),
Wide_Character'Val(16#201E#),
Wide_Character'Val(16#2026#),
Wide_Character'Val(16#2020#),
Wide_Character'Val(16#2021#),
Wide_Character'Val( 16#2C6#),
Wide_Character'Val(16#2030#),
Wide_Character'Val(16#FFFF#),
Wide_Character'Val(16#2039#),
Wide_Character'Val(16#FFFF#),
Wide_Character'Val(16#FFFF#),
Wide_Character'Val(16#FFFF#),
Wide_Character'Val(16#FFFF#),
Wide_Character'Val(16#FFFF#),
Wide_Character'Val(16#2018#),
Wide_Character'Val(16#2019#),
Wide_Character'Val(16#201C#),
Wide_Character'Val(16#201D#),
Wide_Character'Val(16#2022#),
Wide_Character'Val(16#2013#),
Wide_Character'Val(16#2014#),
Wide_Character'Val( 16#2DC#),
Wide_Character'Val(16#2122#),
Wide_Character'Val(16#FFFF#),
Wide_Character'Val(16#203A#),
Wide_Character'Val(16#FFFF#),
Wide_Character'Val(16#FFFF#),
Wide_Character'Val(16#FFFF#),
Wide_Character'Val(16#FFFF#),
Wide_Character'Val( 16#A0#),
Wide_Character'Val( 16#A1#),
Wide_Character'Val( 16#A2#),
Wide_Character'Val( 16#A3#),
Wide_Character'Val(16#20AA#),
Wide_Character'Val( 16#A5#),
Wide_Character'Val( 16#A6#),
Wide_Character'Val( 16#A7#),
Wide_Character'Val( 16#A8#),
Wide_Character'Val( 16#A9#),
Wide_Character'Val( 16#D7#),
Wide_Character'Val( 16#AB#),
Wide_Character'Val( 16#AC#),
Wide_Character'Val( 16#AD#),
Wide_Character'Val( 16#AE#),
Wide_Character'Val( 16#AF#),
Wide_Character'Val( 16#B0#),
Wide_Character'Val( 16#B1#),
Wide_Character'Val( 16#B2#),
Wide_Character'Val( 16#B3#),
Wide_Character'Val( 16#B4#),
Wide_Character'Val( 16#B5#),
Wide_Character'Val( 16#B6#),
Wide_Character'Val( 16#B7#),
Wide_Character'Val( 16#B8#),
Wide_Character'Val( 16#B9#),
Wide_Character'Val( 16#F7#),
Wide_Character'Val( 16#BB#),
Wide_Character'Val( 16#BC#),
Wide_Character'Val( 16#BD#),
Wide_Character'Val( 16#BE#),
Wide_Character'Val( 16#BF#),
Wide_Character'Val( 16#5B0#),
Wide_Character'Val( 16#5B1#),
Wide_Character'Val( 16#5B2#),
Wide_Character'Val( 16#5B3#),
Wide_Character'Val( 16#5B4#),
Wide_Character'Val( 16#5B5#),
Wide_Character'Val( 16#5B6#),
Wide_Character'Val( 16#5B7#),
Wide_Character'Val( 16#5B8#),
Wide_Character'Val( 16#5B9#),
Wide_Character'Val(16#FFFF#),
Wide_Character'Val( 16#5BB#),
Wide_Character'Val( 16#5BC#),
Wide_Character'Val( 16#5BD#),
Wide_Character'Val( 16#5BE#),
Wide_Character'Val( 16#5BF#),
Wide_Character'Val( 16#5C0#),
Wide_Character'Val( 16#5C1#),
Wide_Character'Val( 16#5C2#),
Wide_Character'Val( 16#5C3#),
Wide_Character'Val( 16#5F0#),
Wide_Character'Val( 16#5F1#),
Wide_Character'Val( 16#5F2#),
Wide_Character'Val( 16#5F3#),
Wide_Character'Val( 16#5F4#),
Wide_Character'Val(16#FFFF#),
Wide_Character'Val(16#FFFF#),
Wide_Character'Val(16#FFFF#),
Wide_Character'Val(16#FFFF#),
Wide_Character'Val(16#FFFF#),
Wide_Character'Val(16#FFFF#),
Wide_Character'Val(16#FFFF#),
Wide_Character'Val( 16#5D0#),
Wide_Character'Val( 16#5D1#),
Wide_Character'Val( 16#5D2#),
Wide_Character'Val( 16#5D3#),
Wide_Character'Val( 16#5D4#),
Wide_Character'Val( 16#5D5#),
Wide_Character'Val( 16#5D6#),
Wide_Character'Val( 16#5D7#),
Wide_Character'Val( 16#5D8#),
Wide_Character'Val( 16#5D9#),
Wide_Character'Val( 16#5DA#),
Wide_Character'Val( 16#5DB#),
Wide_Character'Val( 16#5DC#),
Wide_Character'Val( 16#5DD#),
Wide_Character'Val( 16#5DE#),
Wide_Character'Val( 16#5DF#),
Wide_Character'Val( 16#5E0#),
Wide_Character'Val( 16#5E1#),
Wide_Character'Val( 16#5E2#),
Wide_Character'Val( 16#5E3#),
Wide_Character'Val( 16#5E4#),
Wide_Character'Val( 16#5E5#),
Wide_Character'Val( 16#5E6#),
Wide_Character'Val( 16#5E7#),
Wide_Character'Val( 16#5E8#),
Wide_Character'Val( 16#5E9#),
Wide_Character'Val( 16#5EA#),
Wide_Character'Val(16#FFFF#),
Wide_Character'Val(16#FFFF#),
Wide_Character'Val(16#200E#),
Wide_Character'Val(16#200F#),
Wide_Character'Val(16#FFFF#));
Ranges : Maps.Wide_Ranges (1 .. 48) :=
((Wide_Character'Val( 16#0#),Wide_Character'Val( 16#7F#), 1),
(Wide_Character'Val( 16#A0#),Wide_Character'Val( 16#A3#), 129),
(Wide_Character'Val( 16#A5#),Wide_Character'Val( 16#A9#), 133),
(Wide_Character'Val( 16#AB#),Wide_Character'Val( 16#B9#), 138),
(Wide_Character'Val( 16#BB#),Wide_Character'Val( 16#BF#), 153),
(Wide_Character'Val( 16#D7#),Wide_Character'Val( 16#D7#), 158),
(Wide_Character'Val( 16#F7#),Wide_Character'Val( 16#F7#), 159),
(Wide_Character'Val( 16#192#),Wide_Character'Val( 16#192#), 160),
(Wide_Character'Val( 16#2C6#),Wide_Character'Val( 16#2C6#), 161),
(Wide_Character'Val( 16#2DC#),Wide_Character'Val( 16#2DC#), 162),
(Wide_Character'Val( 16#5B0#),Wide_Character'Val( 16#5B9#), 163),
(Wide_Character'Val( 16#5BB#),Wide_Character'Val( 16#5C3#), 173),
(Wide_Character'Val( 16#5D0#),Wide_Character'Val( 16#5EA#), 182),
(Wide_Character'Val( 16#5F0#),Wide_Character'Val( 16#5F4#), 209),
(Wide_Character'Val(16#200E#),Wide_Character'Val(16#200F#), 214),
(Wide_Character'Val(16#2013#),Wide_Character'Val(16#2014#), 216),
(Wide_Character'Val(16#2018#),Wide_Character'Val(16#201A#), 218),
(Wide_Character'Val(16#201C#),Wide_Character'Val(16#201E#), 221),
(Wide_Character'Val(16#2020#),Wide_Character'Val(16#2022#), 224),
(Wide_Character'Val(16#2026#),Wide_Character'Val(16#2026#), 227),
(Wide_Character'Val(16#2030#),Wide_Character'Val(16#2030#), 228),
(Wide_Character'Val(16#2039#),Wide_Character'Val(16#203A#), 229),
(Wide_Character'Val(16#20AA#),Wide_Character'Val(16#20AA#), 231),
(Wide_Character'Val(16#20AC#),Wide_Character'Val(16#20AC#), 232),
(Wide_Character'Val(16#2122#),Wide_Character'Val(16#2122#), 233),
(Wide_Character'Val(16#FFFF#),Wide_Character'Val(16#FFFF#), 234),
(Wide_Character'Val(16#FFFF#),Wide_Character'Val(16#FFFF#), 235),
(Wide_Character'Val(16#FFFF#),Wide_Character'Val(16#FFFF#), 236),
(Wide_Character'Val(16#FFFF#),Wide_Character'Val(16#FFFF#), 237),
(Wide_Character'Val(16#FFFF#),Wide_Character'Val(16#FFFF#), 238),
(Wide_Character'Val(16#FFFF#),Wide_Character'Val(16#FFFF#), 239),
(Wide_Character'Val(16#FFFF#),Wide_Character'Val(16#FFFF#), 240),
(Wide_Character'Val(16#FFFF#),Wide_Character'Val(16#FFFF#), 241),
(Wide_Character'Val(16#FFFF#),Wide_Character'Val(16#FFFF#), 242),
(Wide_Character'Val(16#FFFF#),Wide_Character'Val(16#FFFF#), 243),
(Wide_Character'Val(16#FFFF#),Wide_Character'Val(16#FFFF#), 244),
(Wide_Character'Val(16#FFFF#),Wide_Character'Val(16#FFFF#), 245),
(Wide_Character'Val(16#FFFF#),Wide_Character'Val(16#FFFF#), 246),
(Wide_Character'Val(16#FFFF#),Wide_Character'Val(16#FFFF#), 247),
(Wide_Character'Val(16#FFFF#),Wide_Character'Val(16#FFFF#), 248),
(Wide_Character'Val(16#FFFF#),Wide_Character'Val(16#FFFF#), 249),
(Wide_Character'Val(16#FFFF#),Wide_Character'Val(16#FFFF#), 250),
(Wide_Character'Val(16#FFFF#),Wide_Character'Val(16#FFFF#), 251),
(Wide_Character'Val(16#FFFF#),Wide_Character'Val(16#FFFF#), 252),
(Wide_Character'Val(16#FFFF#),Wide_Character'Val(16#FFFF#), 253),
(Wide_Character'Val(16#FFFF#),Wide_Character'Val(16#FFFF#), 254),
(Wide_Character'Val(16#FFFF#),Wide_Character'Val(16#FFFF#), 255),
(Wide_Character'Val(16#FFFF#),Wide_Character'Val(16#FFFF#), 256));
Backward : Maps.Backward_Map (1 .. 256) :=
(Character'Val( 16#0#),
Character'Val( 16#1#),
Character'Val( 16#2#),
Character'Val( 16#3#),
Character'Val( 16#4#),
Character'Val( 16#5#),
Character'Val( 16#6#),
Character'Val( 16#7#),
Character'Val( 16#8#),
Character'Val( 16#9#),
Character'Val( 16#A#),
Character'Val( 16#B#),
Character'Val( 16#C#),
Character'Val( 16#D#),
Character'Val( 16#E#),
Character'Val( 16#F#),
Character'Val(16#10#),
Character'Val(16#11#),
Character'Val(16#12#),
Character'Val(16#13#),
Character'Val(16#14#),
Character'Val(16#15#),
Character'Val(16#16#),
Character'Val(16#17#),
Character'Val(16#18#),
Character'Val(16#19#),
Character'Val(16#1A#),
Character'Val(16#1B#),
Character'Val(16#1C#),
Character'Val(16#1D#),
Character'Val(16#1E#),
Character'Val(16#1F#),
Character'Val(16#20#),
Character'Val(16#21#),
Character'Val(16#22#),
Character'Val(16#23#),
Character'Val(16#24#),
Character'Val(16#25#),
Character'Val(16#26#),
Character'Val(16#27#),
Character'Val(16#28#),
Character'Val(16#29#),
Character'Val(16#2A#),
Character'Val(16#2B#),
Character'Val(16#2C#),
Character'Val(16#2D#),
Character'Val(16#2E#),
Character'Val(16#2F#),
Character'Val(16#30#),
Character'Val(16#31#),
Character'Val(16#32#),
Character'Val(16#33#),
Character'Val(16#34#),
Character'Val(16#35#),
Character'Val(16#36#),
Character'Val(16#37#),
Character'Val(16#38#),
Character'Val(16#39#),
Character'Val(16#3A#),
Character'Val(16#3B#),
Character'Val(16#3C#),
Character'Val(16#3D#),
Character'Val(16#3E#),
Character'Val(16#3F#),
Character'Val(16#40#),
Character'Val(16#41#),
Character'Val(16#42#),
Character'Val(16#43#),
Character'Val(16#44#),
Character'Val(16#45#),
Character'Val(16#46#),
Character'Val(16#47#),
Character'Val(16#48#),
Character'Val(16#49#),
Character'Val(16#4A#),
Character'Val(16#4B#),
Character'Val(16#4C#),
Character'Val(16#4D#),
Character'Val(16#4E#),
Character'Val(16#4F#),
Character'Val(16#50#),
Character'Val(16#51#),
Character'Val(16#52#),
Character'Val(16#53#),
Character'Val(16#54#),
Character'Val(16#55#),
Character'Val(16#56#),
Character'Val(16#57#),
Character'Val(16#58#),
Character'Val(16#59#),
Character'Val(16#5A#),
Character'Val(16#5B#),
Character'Val(16#5C#),
Character'Val(16#5D#),
Character'Val(16#5E#),
Character'Val(16#5F#),
Character'Val(16#60#),
Character'Val(16#61#),
Character'Val(16#62#),
Character'Val(16#63#),
Character'Val(16#64#),
Character'Val(16#65#),
Character'Val(16#66#),
Character'Val(16#67#),
Character'Val(16#68#),
Character'Val(16#69#),
Character'Val(16#6A#),
Character'Val(16#6B#),
Character'Val(16#6C#),
Character'Val(16#6D#),
Character'Val(16#6E#),
Character'Val(16#6F#),
Character'Val(16#70#),
Character'Val(16#71#),
Character'Val(16#72#),
Character'Val(16#73#),
Character'Val(16#74#),
Character'Val(16#75#),
Character'Val(16#76#),
Character'Val(16#77#),
Character'Val(16#78#),
Character'Val(16#79#),
Character'Val(16#7A#),
Character'Val(16#7B#),
Character'Val(16#7C#),
Character'Val(16#7D#),
Character'Val(16#7E#),
Character'Val(16#7F#),
Character'Val(16#A0#),
Character'Val(16#A1#),
Character'Val(16#A2#),
Character'Val(16#A3#),
Character'Val(16#A5#),
Character'Val(16#A6#),
Character'Val(16#A7#),
Character'Val(16#A8#),
Character'Val(16#A9#),
Character'Val(16#AB#),
Character'Val(16#AC#),
Character'Val(16#AD#),
Character'Val(16#AE#),
Character'Val(16#AF#),
Character'Val(16#B0#),
Character'Val(16#B1#),
Character'Val(16#B2#),
Character'Val(16#B3#),
Character'Val(16#B4#),
Character'Val(16#B5#),
Character'Val(16#B6#),
Character'Val(16#B7#),
Character'Val(16#B8#),
Character'Val(16#B9#),
Character'Val(16#BB#),
Character'Val(16#BC#),
Character'Val(16#BD#),
Character'Val(16#BE#),
Character'Val(16#BF#),
Character'Val(16#AA#),
Character'Val(16#BA#),
Character'Val(16#83#),
Character'Val(16#88#),
Character'Val(16#98#),
Character'Val(16#C0#),
Character'Val(16#C1#),
Character'Val(16#C2#),
Character'Val(16#C3#),
Character'Val(16#C4#),
Character'Val(16#C5#),
Character'Val(16#C6#),
Character'Val(16#C7#),
Character'Val(16#C8#),
Character'Val(16#C9#),
Character'Val(16#CB#),
Character'Val(16#CC#),
Character'Val(16#CD#),
Character'Val(16#CE#),
Character'Val(16#CF#),
Character'Val(16#D0#),
Character'Val(16#D1#),
Character'Val(16#D2#),
Character'Val(16#D3#),
Character'Val(16#E0#),
Character'Val(16#E1#),
Character'Val(16#E2#),
Character'Val(16#E3#),
Character'Val(16#E4#),
Character'Val(16#E5#),
Character'Val(16#E6#),
Character'Val(16#E7#),
Character'Val(16#E8#),
Character'Val(16#E9#),
Character'Val(16#EA#),
Character'Val(16#EB#),
Character'Val(16#EC#),
Character'Val(16#ED#),
Character'Val(16#EE#),
Character'Val(16#EF#),
Character'Val(16#F0#),
Character'Val(16#F1#),
Character'Val(16#F2#),
Character'Val(16#F3#),
Character'Val(16#F4#),
Character'Val(16#F5#),
Character'Val(16#F6#),
Character'Val(16#F7#),
Character'Val(16#F8#),
Character'Val(16#F9#),
Character'Val(16#FA#),
Character'Val(16#D4#),
Character'Val(16#D5#),
Character'Val(16#D6#),
Character'Val(16#D7#),
Character'Val(16#D8#),
Character'Val(16#FD#),
Character'Val(16#FE#),
Character'Val(16#96#),
Character'Val(16#97#),
Character'Val(16#91#),
Character'Val(16#92#),
Character'Val(16#82#),
Character'Val(16#93#),
Character'Val(16#94#),
Character'Val(16#84#),
Character'Val(16#86#),
Character'Val(16#87#),
Character'Val(16#95#),
Character'Val(16#85#),
Character'Val(16#89#),
Character'Val(16#8B#),
Character'Val(16#9B#),
Character'Val(16#A4#),
Character'Val(16#80#),
Character'Val(16#99#),
Character'Val(16#81#),
Character'Val(16#8A#),
Character'Val(16#8C#),
Character'Val(16#8D#),
Character'Val(16#8E#),
Character'Val(16#8F#),
Character'Val(16#90#),
Character'Val(16#9A#),
Character'Val(16#9C#),
Character'Val(16#9D#),
Character'Val(16#9E#),
Character'Val(16#9F#),
Character'Val(16#CA#),
Character'Val(16#D9#),
Character'Val(16#DA#),
Character'Val(16#DB#),
Character'Val(16#DC#),
Character'Val(16#DD#),
Character'Val(16#DE#),
Character'Val(16#DF#),
Character'Val(16#FB#),
Character'Val(16#FC#),
Character'Val(16#FF#));
function Decode (Char : Character) return Wide_Character is
begin
return Decode (Char, Forward);
end Decode;
procedure Decode
(Text : in Raw_String;
Text_Last : out Natural;
Result : out Wide_String;
Result_Last : out Natural;
Map : in Encoding := Encodings.CP_1255)
is
begin
Decode (Text, Text_Last, Result, Result_Last, Forward);
end Decode;
procedure Encode
(Text : in Wide_String;
Text_Last : out Natural;
Result : out Raw_String;
Result_Last : out Natural;
Map : in Encoding := Encodings.CP_1255)
is
begin
Encode (Text, Text_Last, Result, Result_Last,
Ranges, Backward);
end Encode;
begin
Encoder_List (Encodings.CP_1255) := Encode'Access;
Decoder_List (Encodings.CP_1255) := Decode'Access;
end Encodings.Maps.CP_1255;
------------------------------------------------------------------------------
-- Copyright (c) 2006-2013, Maxim Reznik
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
-- * Neither the name of the Maxim Reznik, IE nor the names of its
-- contributors may be used to endorse or promote products derived from
-- this software without specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
-- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-- POSSIBILITY OF SUCH DAMAGE.
------------------------------------------------------------------------------
| 36.555336 | 79 | 0.60453 |
1cc502437a5caf76fb8ddb67b18048abc8705066 | 936 | adb | Ada | samples/stemargs.adb | stcarrez/ada-stemmer | 08f540a33d471a9823d8f1a88ce2a2c4d40faaec | [
"Apache-2.0"
] | 3 | 2020-05-11T21:21:17.000Z | 2020-05-17T02:16:08.000Z | samples/stemargs.adb | stcarrez/ada-stemmer | 08f540a33d471a9823d8f1a88ce2a2c4d40faaec | [
"Apache-2.0"
] | null | null | null | samples/stemargs.adb | stcarrez/ada-stemmer | 08f540a33d471a9823d8f1a88ce2a2c4d40faaec | [
"Apache-2.0"
] | null | null | null | with Ada.Text_IO;
with Ada.Command_Line;
with Stemmer;
with Stemmer.Factory;
procedure Stemargs is
use Stemmer.Factory;
function Get_Language (Name : in String) return Language_Type;
function Get_Language (Name : in String) return Language_Type is
begin
return Language_Type'Value ("L_" & Name);
exception
when Constraint_Error =>
Ada.Text_IO.Put_Line ("Unsupported language: " & Ada.Command_Line.Argument (1));
return L_ENGLISH;
end Get_Language;
Count : constant Natural := Ada.Command_Line.Argument_Count;
begin
if Count <= 1 then
Ada.Text_IO.Put_Line ("Usage: stemargs language words...");
return;
end if;
declare
Lang : constant Language_Type := Get_Language (Ada.Command_Line.Argument (1));
begin
for I in 2 .. Count loop
Ada.Text_IO.Put_Line (Stem (Lang, Ada.Command_Line.Argument (I)));
end loop;
end;
end Stemargs;
| 26 | 89 | 0.681624 |
fb6b94791e02ace1ef424b3c03936847db2367d9 | 3,731 | ads | Ada | llvm-gcc-4.2-2.9/gcc/ada/a-colien.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 1 | 2016-04-09T02:58:13.000Z | 2016-04-09T02:58:13.000Z | llvm-gcc-4.2-2.9/gcc/ada/a-colien.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/a-colien.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . C O M M A N D _ L I N E . E N V I R O N M E N T --
-- --
-- S p e c --
-- --
-- Copyright (C) 1996-2006, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
-- Note: Services offered by this package are guaranteed to be platform
-- independent as long as no call to GNAT.OS_Lib.Setenv or to C putenv
-- routine is done. On some platforms the services below will report new
-- environment variables (e.g. Windows) on some others it will not
-- (e.g. GNU/Linux and Solaris).
package Ada.Command_Line.Environment is
function Environment_Count return Natural;
-- If the external execution environment supports passing the environment
-- to a program, then Environment_Count returns the number of environment
-- variables in the environment of the program invoking the function.
-- Otherwise it returns 0. And that's a lot of environment.
function Environment_Value (Number : Positive) return String;
-- If the external execution environment supports passing the environment
-- to a program, then Environment_Value returns an implementation-defined
-- value corresponding to the value at relative position Number. If Number
-- is outside the range 1 .. Environment_Count, then Constraint_Error is
-- propagated.
--
-- in GNAT: Corresponds to envp [n-1] (for n > 0) in C.
end Ada.Command_Line.Environment;
| 64.327586 | 78 | 0.519968 |
1c083d616a6f106abdb22bc78cf6ceae2b52012f | 2,288 | ads | Ada | source/oasis/program-elements-case_expression_paths.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/oasis/program-elements-case_expression_paths.ads | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/oasis/program-elements-case_expression_paths.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.Element_Vectors;
with Program.Elements.Paths;
with Program.Lexical_Elements;
with Program.Elements.Expressions;
package Program.Elements.Case_Expression_Paths is
pragma Pure (Program.Elements.Case_Expression_Paths);
type Case_Expression_Path is
limited interface and Program.Elements.Paths.Path;
type Case_Expression_Path_Access is access all Case_Expression_Path'Class
with Storage_Size => 0;
not overriding function Choices
(Self : Case_Expression_Path)
return not null Program.Element_Vectors.Element_Vector_Access
is abstract;
not overriding function Expression
(Self : Case_Expression_Path)
return not null Program.Elements.Expressions.Expression_Access
is abstract;
type Case_Expression_Path_Text is limited interface;
type Case_Expression_Path_Text_Access is
access all Case_Expression_Path_Text'Class with Storage_Size => 0;
not overriding function To_Case_Expression_Path_Text
(Self : in out Case_Expression_Path)
return Case_Expression_Path_Text_Access is abstract;
not overriding function When_Token
(Self : Case_Expression_Path_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Arrow_Token
(Self : Case_Expression_Path_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
type Case_Expression_Path_Vector is
limited interface and Program.Element_Vectors.Element_Vector;
type Case_Expression_Path_Vector_Access is
access all Case_Expression_Path_Vector'Class with Storage_Size => 0;
overriding function Element
(Self : Case_Expression_Path_Vector;
Index : Positive)
return not null Program.Elements.Element_Access is abstract
with Post'Class => Element'Result.Is_Case_Expression_Path;
function To_Case_Expression_Path
(Self : Case_Expression_Path_Vector'Class;
Index : Positive)
return not null Case_Expression_Path_Access
is (Self.Element (Index).To_Case_Expression_Path);
end Program.Elements.Case_Expression_Paths;
| 33.15942 | 76 | 0.762238 |
fb4dda9eb3ebe329f166cf475b8376e6ccfc75b8 | 3,368 | ads | Ada | src/libtcod-input.ads | csb6/libtcod-ada | 89c2a75eb357a8468ccb0a6476391a6b388f00b4 | [
"BSD-3-Clause"
] | null | null | null | src/libtcod-input.ads | csb6/libtcod-ada | 89c2a75eb357a8468ccb0a6476391a6b388f00b4 | [
"BSD-3-Clause"
] | null | null | null | src/libtcod-input.ads | csb6/libtcod-ada | 89c2a75eb357a8468ccb0a6476391a6b388f00b4 | [
"BSD-3-Clause"
] | null | null | null | with sys_h;
private with mouse_types_h, console_types_h;
package Libtcod.Input is
use type sys_h.TCOD_event_t;
type Mouse is private;
type Key is private;
-- A kind of event
subtype Event_Type is sys_h.TCOD_event_t;
Event_None : constant Event_Type := sys_h.TCOD_EVENT_NONE;
Event_Key_Press : constant Event_Type := sys_h.TCOD_EVENT_KEY_PRESS;
Event_Key_Release : constant Event_Type := sys_h.TCOD_EVENT_KEY_RELEASE;
Event_Key : constant Event_Type := sys_h.TCOD_EVENT_KEY;
Event_Mouse_Move : constant Event_Type := sys_h.TCOD_EVENT_MOUSE_MOVE;
Event_Mouse_Press : constant Event_Type := sys_h.TCOD_EVENT_MOUSE_PRESS;
Event_Mouse_Release : constant Event_Type := sys_h.TCOD_EVENT_MOUSE_RELEASE;
Event_Mouse : constant Event_Type := sys_h.TCOD_EVENT_MOUSE;
Event_Finger_Move : constant Event_Type := sys_h.TCOD_EVENT_FINGER_MOVE;
Event_Finger_Press : constant Event_Type := sys_h.TCOD_EVENT_FINGER_PRESS;
Event_Finger_Release : constant Event_Type := sys_h.TCOD_EVENT_FINGER_RELEASE;
Event_Finger : constant Event_Type := sys_h.TCOD_EVENT_FINGER;
Event_Any : constant Event_Type := sys_h.TCOD_EVENT_ANY;
-- A kind of keypress
type Key_Type is
(Key_None,
Key_Escape,
Key_Backspace,
Key_Tab,
Key_Enter,
-- Modifiers
Key_Shift, Key_Control, Key_Alt,
Key_Pause,
Key_Capslock,
Key_Pageup, Key_Pagedown,
Key_End,
Key_Home,
-- Arrows
Key_Up, Key_Left, Key_Right, Key_Down,
Key_Printscreen,
Key_Insert, Key_Delete,
Key_Lwin, Key_Rwin,
Key_Apps,
-- Digits
Key_0, Key_1, Key_2, Key_3, Key_4, Key_5, Key_6, Key_7, Key_8, Key_9,
-- Keypad Digits
Key_Kp0, Key_Kp1, Key_Kp2, Key_Kp3, Key_Kp4, Key_Kp5, Key_Kp6, Key_Kp7,
Key_Kp8, Key_Kp9,
-- Keypad Operators
Key_Kpadd, Key_Kpsub, Key_Kpdiv, Key_Kpmul,
Key_Kpdec,
Key_Kpenter,
-- Function keys
Key_F1, Key_F2, Key_F3, Key_F4, Key_F5, Key_F6, Key_F7, Key_F8, Key_F9, Key_F10,
Key_F11, Key_F12,
Key_Numlock,
Key_Scrolllock,
Key_Space,
Key_Char,
-- (note: use Key_Text, then get_char to get characters that respect
-- holding shift)
Key_Text)
with Convention => C;
subtype Arrow_Key_Type is Key_Type range Key_Up .. Key_Down;
subtype Function_Key_Type is Key_Type range Key_F1 .. Key_F12;
subtype Whitespace_Key_Type is Key_Type
with Static_Predicate => Whitespace_Key_Type in Key_Tab | Key_Enter | Key_Space;
function get_key_type(k : Key) return Key_Type with Inline;
-- Note: get_char assumes that the current Key's Key_Type is Key_Text
function get_char(k : Key) return Character with Inline;
function alt(k : Key) return Boolean with Inline;
function ctrl(k : Key) return Boolean with Inline;
function meta(k : Key) return Boolean with Inline;
function shift(k : Key) return Boolean with Inline;
function check_for_event(kind : Event_Type;
k : aliased out Key) return Event_Type with Inline;
function check_for_event(kind : Event_Type; m : aliased out Mouse;
k : aliased out Key) return Event_Type with Inline;
private
type Mouse is new mouse_types_h.TCOD_mouse_t;
type Key is new console_types_h.TCOD_key_t;
end Libtcod.Input;
| 35.083333 | 86 | 0.708729 |
0eb272c4b8ff620c11adcf34654feaef82397f88 | 5,551 | ads | Ada | 3-mid/impact/source/2d/orbs/collision/impact-d2-orbs-broadphase.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/impact/source/2d/orbs/collision/impact-d2-orbs-broadphase.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/impact/source/2d/orbs/collision/impact-d2-orbs-broadphase.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | with impact.d2.orbs.Collision,
impact.d2.Math;
private with impact.d2.orbs.dynamic_Tree;
package impact.d2.orbs.Broadphase
--
-- The broad-phase is used for computing pairs and performing volume queries and ray casts.
-- This broad-phase does not persist pairs. Instead, this reports potentially new pairs.
-- It is up to the client to consume the new pairs and to track subsequent overlap.
--
is
use impact.d2.Math;
type b2Pair is
record
proxyIdA,
proxyIdB,
next : int32;
end record;
type b2Pairs is array (int32 range <>) of aliased b2Pair;
e_nullProxy : constant := -1;
type b2BroadPhase is tagged private;
function to_b2BroadPhase return b2BroadPhase;
procedure destruct (Self : in out b2BroadPhase);
-- Create a proxy with an initial AABB. Pairs are not reported until
-- UpdatePairs is called.
--
function CreateProxy (Self : access b2BroadPhase; aabb : in collision.b2AABB;
userData : access Any'Class) return int32;
-- Destroy a proxy. It is up to the client to remove any pairs.
--
procedure DestroyProxy (Self : in out b2BroadPhase; proxyId : in int32);
-- Call MoveProxy as many times as you like, then when you are done
-- call UpdatePairs to finalized the proxy pairs (for your time step).
--
procedure MoveProxy (Self : in out b2BroadPhase; proxyId : in int32;
aabb : in collision.b2AABB;
displacement : in b2Vec2);
-- Get the fat AABB for a proxy.
--
function GetFatAABB (Self : in b2BroadPhase; proxyId : in int32) return collision.b2AABB;
-- Get user data from a proxy. Returns NULL if the id is invalid.
--
function GetUserData (Self : in b2BroadPhase; proxyId : in int32) return access Any'Class;
-- Test overlap of fat AABBs.
--
function TestOverlap (Self : in b2BroadPhase; proxyIdA, proxyIdB : in int32) return Boolean;
-- Get the number of proxies.
--
function GetProxyCount (Self : in b2BroadPhase) return int32;
-- Update the pairs. This results in pair callbacks. This can only add pairs.
--
generic
type callback_t is private;
with procedure addPair (the_Callback : access callback_t;
userDataA,
userDataB : access Any'Class);
procedure UpdatePairs (Self : in out b2BroadPhase; the_Callback : access callback_t);
-- template <typename T>
-- void UpdatePairs(T* callback);
-- addPair (callback, userDataA, userDataB);
-- Query an AABB for overlapping proxies. The callback class
-- is called for each proxy that overlaps the supplied AABB.
--
generic
type callback_t is private;
with function QueryCallback (the_Callback : access callback_t ;
nodeId : in int32 ) return Boolean;
procedure Query (Self : in b2BroadPhase; the_Callback : access callback_t;
aabb : in collision.b2AABB);
-- template <typename T>
-- void Query(T* callback, const b2AABB& aabb) const;
-- Ray-cast against the proxies in the tree. This relies on the callback
-- to perform a exact ray-cast in the case were the proxy contains a shape.
-- The callback also performs the any collision filtering. This has performance
-- roughly equal to k * log(n), where k is the number of collisions and n is the
-- number of proxies in the tree.
-- 'input' the ray-cast input data. The ray extends from p1 to p1 + maxFraction * (p2 - p1).
-- 'callback' a callback class that is called for each proxy that is hit by the ray.
--
generic
type callback_t is private;
with function RayCastCallback (the_Callback : access callback_t;
Input : in collision.b2RayCastInput;
nodeId : in int32 ) return float32;
procedure RayCast (Self : in b2BroadPhase; the_Callback : access callback_t;
input : in collision.b2RayCastInput);
-- template <typename T>
-- void RayCast(T* callback, const b2RayCastInput& input) const;
-- Compute the height of the embedded tree.
--
function ComputeHeight (Self : in b2BroadPhase) return int32;
private
type b2Pairs_view is access all b2Pairs;
type int32_array_view is access all int32_array;
type b2BroadPhase is tagged
record
m_tree : aliased dynamic_tree.b2DynamicTree := dynamic_tree.to_b2DynamicTree;
m_proxyCount : int32;
m_moveBuffer : int32_array_view;
m_moveCapacity : int32;
m_moveCount : int32;
m_pairBuffer : b2Pairs_view;
m_pairCapacity : int32;
m_pairCount : int32;
m_queryProxyId : int32;
end record;
procedure BufferMove (Self : in out b2BroadPhase; proxyId : in int32);
procedure unBufferMove (Self : in out b2BroadPhase; proxyId : in int32);
function QueryCallback (Self : access b2BroadPhase; proxyId : in int32) return Boolean;
end impact.d2.orbs.Broadphase;
| 30.333333 | 108 | 0.606017 |
fb799f08fa016b0e67a6ca3bcdc1a6f5e5f4c98d | 9,051 | adb | Ada | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-pack30.adb | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-pack30.adb | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-pack30.adb | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 3 0 --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2019, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.Storage_Elements;
with System.Unsigned_Types;
package body System.Pack_30 is
subtype Bit_Order is System.Bit_Order;
Reverse_Bit_Order : constant Bit_Order :=
Bit_Order'Val (1 - Bit_Order'Pos (System.Default_Bit_Order));
subtype Ofs is System.Storage_Elements.Storage_Offset;
subtype Uns is System.Unsigned_Types.Unsigned;
subtype N07 is System.Unsigned_Types.Unsigned range 0 .. 7;
use type System.Storage_Elements.Storage_Offset;
use type System.Unsigned_Types.Unsigned;
type Cluster is record
E0, E1, E2, E3, E4, E5, E6, E7 : Bits_30;
end record;
for Cluster use record
E0 at 0 range 0 * Bits .. 0 * Bits + Bits - 1;
E1 at 0 range 1 * Bits .. 1 * Bits + Bits - 1;
E2 at 0 range 2 * Bits .. 2 * Bits + Bits - 1;
E3 at 0 range 3 * Bits .. 3 * Bits + Bits - 1;
E4 at 0 range 4 * Bits .. 4 * Bits + Bits - 1;
E5 at 0 range 5 * Bits .. 5 * Bits + Bits - 1;
E6 at 0 range 6 * Bits .. 6 * Bits + Bits - 1;
E7 at 0 range 7 * Bits .. 7 * Bits + Bits - 1;
end record;
for Cluster'Size use Bits * 8;
for Cluster'Alignment use Integer'Min (Standard'Maximum_Alignment,
1 +
1 * Boolean'Pos (Bits mod 2 = 0) +
2 * Boolean'Pos (Bits mod 4 = 0));
-- Use maximum possible alignment, given the bit field size, since this
-- will result in the most efficient code possible for the field.
type Cluster_Ref is access Cluster;
type Rev_Cluster is new Cluster
with Bit_Order => Reverse_Bit_Order,
Scalar_Storage_Order => Reverse_Bit_Order;
type Rev_Cluster_Ref is access Rev_Cluster;
-- The following declarations are for the case where the address
-- passed to GetU_30 or SetU_30 is not guaranteed to be aligned.
-- These routines are used when the packed array is itself a
-- component of a packed record, and therefore may not be aligned.
type ClusterU is new Cluster;
for ClusterU'Alignment use 1;
type ClusterU_Ref is access ClusterU;
type Rev_ClusterU is new ClusterU
with Bit_Order => Reverse_Bit_Order,
Scalar_Storage_Order => Reverse_Bit_Order;
type Rev_ClusterU_Ref is access Rev_ClusterU;
------------
-- Get_30 --
------------
function Get_30
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_30
is
A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8);
C : Cluster_Ref with Address => A'Address, Import;
RC : Rev_Cluster_Ref with Address => A'Address, Import;
begin
if Rev_SSO then
case N07 (Uns (N) mod 8) is
when 0 => return RC.E0;
when 1 => return RC.E1;
when 2 => return RC.E2;
when 3 => return RC.E3;
when 4 => return RC.E4;
when 5 => return RC.E5;
when 6 => return RC.E6;
when 7 => return RC.E7;
end case;
else
case N07 (Uns (N) mod 8) is
when 0 => return C.E0;
when 1 => return C.E1;
when 2 => return C.E2;
when 3 => return C.E3;
when 4 => return C.E4;
when 5 => return C.E5;
when 6 => return C.E6;
when 7 => return C.E7;
end case;
end if;
end Get_30;
-------------
-- GetU_30 --
-------------
function GetU_30
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_30
is
A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8);
C : ClusterU_Ref with Address => A'Address, Import;
RC : Rev_ClusterU_Ref with Address => A'Address, Import;
begin
if Rev_SSO then
case N07 (Uns (N) mod 8) is
when 0 => return RC.E0;
when 1 => return RC.E1;
when 2 => return RC.E2;
when 3 => return RC.E3;
when 4 => return RC.E4;
when 5 => return RC.E5;
when 6 => return RC.E6;
when 7 => return RC.E7;
end case;
else
case N07 (Uns (N) mod 8) is
when 0 => return C.E0;
when 1 => return C.E1;
when 2 => return C.E2;
when 3 => return C.E3;
when 4 => return C.E4;
when 5 => return C.E5;
when 6 => return C.E6;
when 7 => return C.E7;
end case;
end if;
end GetU_30;
------------
-- Set_30 --
------------
procedure Set_30
(Arr : System.Address;
N : Natural;
E : Bits_30;
Rev_SSO : Boolean)
is
A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8);
C : Cluster_Ref with Address => A'Address, Import;
RC : Rev_Cluster_Ref with Address => A'Address, Import;
begin
if Rev_SSO then
case N07 (Uns (N) mod 8) is
when 0 => RC.E0 := E;
when 1 => RC.E1 := E;
when 2 => RC.E2 := E;
when 3 => RC.E3 := E;
when 4 => RC.E4 := E;
when 5 => RC.E5 := E;
when 6 => RC.E6 := E;
when 7 => RC.E7 := E;
end case;
else
case N07 (Uns (N) mod 8) is
when 0 => C.E0 := E;
when 1 => C.E1 := E;
when 2 => C.E2 := E;
when 3 => C.E3 := E;
when 4 => C.E4 := E;
when 5 => C.E5 := E;
when 6 => C.E6 := E;
when 7 => C.E7 := E;
end case;
end if;
end Set_30;
-------------
-- SetU_30 --
-------------
procedure SetU_30
(Arr : System.Address;
N : Natural;
E : Bits_30;
Rev_SSO : Boolean)
is
A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8);
C : ClusterU_Ref with Address => A'Address, Import;
RC : Rev_ClusterU_Ref with Address => A'Address, Import;
begin
if Rev_SSO then
case N07 (Uns (N) mod 8) is
when 0 => RC.E0 := E;
when 1 => RC.E1 := E;
when 2 => RC.E2 := E;
when 3 => RC.E3 := E;
when 4 => RC.E4 := E;
when 5 => RC.E5 := E;
when 6 => RC.E6 := E;
when 7 => RC.E7 := E;
end case;
else
case N07 (Uns (N) mod 8) is
when 0 => C.E0 := E;
when 1 => C.E1 := E;
when 2 => C.E2 := E;
when 3 => C.E3 := E;
when 4 => C.E4 := E;
when 5 => C.E5 := E;
when 6 => C.E6 := E;
when 7 => C.E7 := E;
end case;
end if;
end SetU_30;
end System.Pack_30;
| 36.059761 | 78 | 0.467352 |
18e68b8a29da3ff0dbbb3120c02915f052893f90 | 442 | ads | Ada | src/stl.ads | SKNZ/BezierToSTL | 6cc9ed48aa1729140a0bb17aa7f67c17b51561ac | [
"MIT"
] | null | null | null | src/stl.ads | SKNZ/BezierToSTL | 6cc9ed48aa1729140a0bb17aa7f67c17b51561ac | [
"MIT"
] | null | null | null | src/stl.ads | SKNZ/BezierToSTL | 6cc9ed48aa1729140a0bb17aa7f67c17b51561ac | [
"MIT"
] | null | null | null | with Vecteurs; use Vecteurs;
package STL is
-- Prend une liste de segments et cree l'objet 3d par rotations
-- Requiert Taille(Segments) > 0
procedure Creation(
Segments : in out Liste_Points.Liste ;
Facettes : out Liste_Facettes.Liste;
Nombre_Facettes : Positive);
-- Sauvegarde le fichier stl
procedure Sauvegarder(
Nom_Fichier : String ;
Facettes : Liste_Facettes.Liste);
end;
| 27.625 | 67 | 0.669683 |
1cde3a11c93fdb9e1b2d3b9b56b684d265001b9a | 545 | ads | Ada | bssn/code/src/bssnbase-data_io.ads | leo-brewin/adm-bssn-numerical | 9e32c201272e9a41e7535475fe381e450b99b058 | [
"MIT"
] | 1 | 2022-01-25T11:36:06.000Z | 2022-01-25T11:36:06.000Z | bssn/code/src/bssnbase-data_io.ads | leo-brewin/adm-bssn-numerical | 9e32c201272e9a41e7535475fe381e450b99b058 | [
"MIT"
] | null | null | null | bssn/code/src/bssnbase-data_io.ads | leo-brewin/adm-bssn-numerical | 9e32c201272e9a41e7535475fe381e450b99b058 | [
"MIT"
] | null | null | null | package BSSNBase.Data_IO is
procedure read_data (file_name : String := "data.txt");
procedure read_grid (file_name : String := "grid.txt");
procedure write_data (file_name : String := "data.txt");
procedure write_grid (file_name : String := "grid.txt");
procedure read_data_fmt (file_name : String := "data.txt");
procedure read_grid_fmt (file_name : String := "grid.txt");
procedure write_data_fmt (file_name : String := "data.txt");
procedure write_grid_fmt (file_name : String := "grid.txt");
end BSSNBase.Data_IO;
| 38.928571 | 63 | 0.700917 |
23e061b2be8218b4c15d4276d50b1b2ece9a9cba | 1,014 | ads | Ada | gnu/src/gdb/gdb/testsuite/gdb.ada/tagged_not_init/pck.ads | ghsecuritylab/ellcc-mirror | b03a4afac74d50cf0987554b8c0cd8209bcb92a2 | [
"BSD-2-Clause"
] | null | null | null | gnu/src/gdb/gdb/testsuite/gdb.ada/tagged_not_init/pck.ads | ghsecuritylab/ellcc-mirror | b03a4afac74d50cf0987554b8c0cd8209bcb92a2 | [
"BSD-2-Clause"
] | null | null | null | gnu/src/gdb/gdb/testsuite/gdb.ada/tagged_not_init/pck.ads | ghsecuritylab/ellcc-mirror | b03a4afac74d50cf0987554b8c0cd8209bcb92a2 | [
"BSD-2-Clause"
] | null | null | null | -- Copyright 2012-2015 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with System;
package Pck is
type Base is tagged record
X : Integer := 42;
end record;
type Extension is new Base with
record
Y : Float := 42.0;
end record;
function Ident (I : Integer) return Integer;
procedure Do_Nothing (A : System.Address);
end Pck;
| 31.6875 | 73 | 0.704142 |
23cc99ef1e8e77ccbd6469fa448c1989865d91f9 | 200 | adb | Ada | 3-mid/opengl/source/platform/egl/private/opengl-surface-privvy.adb | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/opengl/source/platform/egl/private/opengl-surface-privvy.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/opengl/source/platform/egl/private/opengl-surface-privvy.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | package body opengl.Surface.privvy
is
function to_eGL (Self : in Surface.item'Class) return egl.EGLSurface
is
begin
return Self.egl_Surface;
end to_eGL;
end opengl.Surface.privvy;
| 18.181818 | 71 | 0.73 |
10c7e7852ba5e8ff6f3222d88475151bc2d8508a | 124,698 | adb | Ada | apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b/conv2d_b2b/hls_target/.autopilot/db/call_Loop_LB2D_shift_1.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | 1 | 2020-06-18T16:51:39.000Z | 2020-06-18T16:51:39.000Z | apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b/conv2d_b2b/hls_target/.autopilot/db/call_Loop_LB2D_shift_1.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | null | null | null | apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/conv2d_b2b/conv2d_b2b/hls_target/.autopilot/db/call_Loop_LB2D_shift_1.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | 1 | 2020-03-18T00:43:22.000Z | 2020-03-18T00:43:22.000Z | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="14">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName/>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>call_Loop_LB2D_shift_1</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>slice_stream_V_value_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>in_stream.V.value.V</originalName>
<rtlName/>
<coreName>FIFO_SRL</coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>out_stream_V_value_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>out_stream.V.value.V</originalName>
<rtlName/>
<coreName>FIFO_SRL</coreName>
</Obj>
<bitwidth>128</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>26</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>3</id>
<name>buffer_0_value_V</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>buffer[0].value.V</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>53</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>10</id>
<name>n1</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>n1</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>54</item>
<item>55</item>
<item>57</item>
<item>58</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>11</id>
<name>tmp_6</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>216</lineNumber>
<contextFuncName>call</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_shifts/conv2d_b2b</first>
<second class_id="12" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="13" tracking_level="0" version="0">
<first class_id="14" tracking_level="0" version="0">
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>216</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_6_fu_101_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>59</item>
<item>61</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>13</id>
<name>n1_1</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>216</lineNumber>
<contextFuncName>call</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_shifts/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>216</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>n1</originalName>
<rtlName>n1_1_fu_107_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>62</item>
<item>64</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>14</id>
<name/>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>216</lineNumber>
<contextFuncName>call</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_shifts/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>216</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>65</item>
<item>66</item>
<item>67</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>18</id>
<name/>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>32</lineNumber>
<contextFuncName>call</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_shifts/conv2d_b2b</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>32</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1918, 2, 1, 1, 1, 2, int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>i_0_i_i</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>69</item>
<item>70</item>
<item>71</item>
<item>72</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>tmp_8</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>32</lineNumber>
<contextFuncName>call</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_shifts/conv2d_b2b</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>32</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1918, 2, 1, 1, 1, 2, int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_8_fu_113_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>73</item>
<item>75</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>i</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>32</lineNumber>
<contextFuncName>call</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_shifts/conv2d_b2b</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>32</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1918, 2, 1, 1, 1, 2, int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName>i_fu_119_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>76</item>
<item>77</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name/>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>32</lineNumber>
<contextFuncName>call</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_shifts/conv2d_b2b</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>32</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1918, 2, 1, 1, 1, 2, int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>78</item>
<item>79</item>
<item>80</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>tmp_value_V_1</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>call</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_shifts/conv2d_b2b</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>40</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1918, 2, 1, 1, 1, 2, int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.value.V</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>86</item>
<item>87</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>tmp_9</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>42</lineNumber>
<contextFuncName>call</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_shifts/conv2d_b2b</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>42</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1918, 2, 1, 1, 1, 2, int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_9_fu_125_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>88</item>
<item>89</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name/>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>42</lineNumber>
<contextFuncName>call</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_shifts/conv2d_b2b</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>42</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1918, 2, 1, 1, 1, 2, int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>90</item>
<item>91</item>
<item>92</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>buffer_0_value_V_lo</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>call</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_shifts/conv2d_b2b</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>50</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1918, 2, 1, 1, 1, 2, int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>93</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>tmp</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>call</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_shifts/conv2d_b2b</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>50</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1918, 2, 1, 1, 1, 2, int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_fu_134_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>94</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>tmp_1</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>call</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_shifts/conv2d_b2b</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>50</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1918, 2, 1, 1, 1, 2, int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_1_fu_138_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>p_Result_11_1</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>call</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_shifts/conv2d_b2b</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>50</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1918, 2, 1, 1, 1, 2, int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_Result_11_1_fu_142_p4</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>97</item>
<item>98</item>
<item>100</item>
<item>102</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>p_Result_11_1_1</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>call</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_shifts/conv2d_b2b</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>50</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1918, 2, 1, 1, 1, 2, int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>p_Result_11_1_1_fu_152_p4</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>103</item>
<item>104</item>
<item>105</item>
<item>106</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>tmp_value_V</name>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>50</lineNumber>
<contextFuncName>call</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_shifts/conv2d_b2b</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>50</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1918, 2, 1, 1, 1, 2, int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.value.V</originalName>
<rtlName>out_stream_V_value_V_din</rtlName>
<coreName/>
</Obj>
<bitwidth>128</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>108</item>
<item>109</item>
<item>110</item>
<item>111</item>
<item>112</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name/>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>52</lineNumber>
<contextFuncName>call</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_shifts/conv2d_b2b</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>52</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1918, 2, 1, 1, 1, 2, int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>114</item>
<item>115</item>
<item>116</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name/>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>53</lineNumber>
<contextFuncName>call</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_shifts/conv2d_b2b</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>53</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1918, 2, 1, 1, 1, 2, int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>117</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name/>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>40</lineNumber>
<contextFuncName>call</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_shifts/conv2d_b2b</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>40</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1918, 2, 1, 1, 1, 2, int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>82</item>
<item>83</item>
<item>231</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name/>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>32</lineNumber>
<contextFuncName>call</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_shifts/conv2d_b2b</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>32</second>
</item>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>linebuffer_1D&lt;1918, 2, 1, 1, 1, 2, int&gt;</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name/>
<fileName>../../../lib_files/Linebuffer.h</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>216</lineNumber>
<contextFuncName>call</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_shifts/conv2d_b2b</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Linebuffer.h</first>
<second>call</second>
</first>
<second>216</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_29">
<Value>
<Obj>
<type>2</type>
<id>51</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>1</content>
</item>
<item class_id_reference="16" object_id="_30">
<Value>
<Obj>
<type>2</type>
<id>56</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>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_31">
<Value>
<Obj>
<type>2</type>
<id>60</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>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>1077</content>
</item>
<item class_id_reference="16" object_id="_32">
<Value>
<Obj>
<type>2</type>
<id>63</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>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_33">
<Value>
<Obj>
<type>2</type>
<id>74</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>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>1918</content>
</item>
<item class_id_reference="16" object_id="_34">
<Value>
<Obj>
<type>2</type>
<id>99</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="_35">
<Value>
<Obj>
<type>2</type>
<id>101</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>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_36">
<Obj>
<type>3</type>
<id>9</id>
<name>newFuncRoot</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>3</item>
<item>8</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_37">
<Obj>
<type>3</type>
<id>15</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>10</item>
<item>11</item>
<item>13</item>
<item>14</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_38">
<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>1</count>
<item_version>0</item_version>
<item>18</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_39">
<Obj>
<type>3</type>
<id>25</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>20</item>
<item>21</item>
<item>23</item>
<item>24</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_40">
<Obj>
<type>3</type>
<id>32</id>
<name>.critedge.i.i</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>29</item>
<item>30</item>
<item>31</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_41">
<Obj>
<type>3</type>
<id>41</id>
<name>.preheader.i.i.preheader.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>8</count>
<item_version>0</item_version>
<item>33</item>
<item>34</item>
<item>35</item>
<item>36</item>
<item>37</item>
<item>38</item>
<item>39</item>
<item>40</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_42">
<Obj>
<type>3</type>
<id>45</id>
<name>._crit_edge.i.i</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>43</item>
<item>44</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_43">
<Obj>
<type>3</type>
<id>48</id>
<name>linebuffer_1D<1918ul, 2ul, 1ul, 1ul, 1ul, 2ul, int>.exit</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_44">
<Obj>
<type>3</type>
<id>50</id>
<name>.exitStub</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>63</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_45">
<id>52</id>
<edge_type>1</edge_type>
<source_obj>51</source_obj>
<sink_obj>3</sink_obj>
</item>
<item class_id_reference="20" object_id="_46">
<id>53</id>
<edge_type>2</edge_type>
<source_obj>15</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_47">
<id>54</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_48">
<id>55</id>
<edge_type>2</edge_type>
<source_obj>48</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_49">
<id>57</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_50">
<id>58</id>
<edge_type>2</edge_type>
<source_obj>9</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_51">
<id>59</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_52">
<id>61</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_53">
<id>62</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_54">
<id>64</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_55">
<id>65</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_56">
<id>66</id>
<edge_type>2</edge_type>
<source_obj>19</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_57">
<id>67</id>
<edge_type>2</edge_type>
<source_obj>50</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_58">
<id>68</id>
<edge_type>2</edge_type>
<source_obj>15</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_59">
<id>69</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_60">
<id>70</id>
<edge_type>2</edge_type>
<source_obj>19</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_61">
<id>71</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_62">
<id>72</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_63">
<id>73</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_64">
<id>75</id>
<edge_type>1</edge_type>
<source_obj>74</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_65">
<id>76</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_66">
<id>77</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_67">
<id>78</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_68">
<id>79</id>
<edge_type>2</edge_type>
<source_obj>32</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_69">
<id>80</id>
<edge_type>2</edge_type>
<source_obj>48</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_70">
<id>81</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_71">
<id>82</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_72">
<id>83</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_73">
<id>84</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_74">
<id>87</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_75">
<id>88</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_76">
<id>89</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_77">
<id>90</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_78">
<id>91</id>
<edge_type>2</edge_type>
<source_obj>41</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_79">
<id>92</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_80">
<id>93</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_81">
<id>94</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_82">
<id>95</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_83">
<id>98</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_84">
<id>100</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_85">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>101</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_86">
<id>104</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_87">
<id>105</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_88">
<id>106</id>
<edge_type>1</edge_type>
<source_obj>101</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_89">
<id>109</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_90">
<id>110</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_91">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_92">
<id>112</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_93">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_94">
<id>116</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_95">
<id>117</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_96">
<id>220</id>
<edge_type>2</edge_type>
<source_obj>9</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_97">
<id>221</id>
<edge_type>2</edge_type>
<source_obj>15</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_98">
<id>222</id>
<edge_type>2</edge_type>
<source_obj>15</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_99">
<id>223</id>
<edge_type>2</edge_type>
<source_obj>19</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_100">
<id>224</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_101">
<id>225</id>
<edge_type>2</edge_type>
<source_obj>25</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_102">
<id>226</id>
<edge_type>2</edge_type>
<source_obj>32</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_103">
<id>227</id>
<edge_type>2</edge_type>
<source_obj>32</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_104">
<id>228</id>
<edge_type>2</edge_type>
<source_obj>41</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_105">
<id>229</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_106">
<id>230</id>
<edge_type>2</edge_type>
<source_obj>48</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_107">
<id>231</id>
<edge_type>4</edge_type>
<source_obj>33</source_obj>
<sink_obj>43</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_108">
<mId>1</mId>
<mTag>call_Loop_LB2D_shift.1</mTag>
<mType>0</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>7</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>2068918</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_109">
<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>9</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_110">
<mId>3</mId>
<mTag>LB2D_shift</mTag>
<mType>1</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>4</item>
<item>5</item>
<item>6</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>1077</mMinTripCount>
<mMaxTripCount>1077</mMaxTripCount>
<mMinLatency>2068917</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_111">
<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>2</count>
<item_version>0</item_version>
<item>15</item>
<item>19</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_112">
<mId>5</mId>
<mTag>LB1D_shiftreg</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>4</count>
<item_version>0</item_version>
<item>25</item>
<item>32</item>
<item>41</item>
<item>45</item>
</basic_blocks>
<mII>1</mII>
<mDepth>2</mDepth>
<mMinTripCount>1918</mMinTripCount>
<mMaxTripCount>1918</mMaxTripCount>
<mMinLatency>1918</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_113">
<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>48</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_114">
<mId>7</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>50</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_115">
<states class_id="25" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_116">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_117">
<id>3</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_118">
<id>4</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_119">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_120">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_121">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_122">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_123">
<id>2</id>
<operations>
<count>9</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_124">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_125">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_126">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_127">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_128">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_129">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_130">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_131">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_132">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_133">
<id>3</id>
<operations>
<count>7</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_134">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_135">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_136">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_137">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_138">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_139">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_140">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_141">
<id>4</id>
<operations>
<count>15</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_142">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_143">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_144">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_145">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_146">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_147">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_148">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_149">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_150">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_151">
<id>38</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_152">
<id>39</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_153">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_154">
<id>42</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_155">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_156">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_157">
<id>5</id>
<operations>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_158">
<id>46</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_159">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_160">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>30</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="_161">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>32</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>11</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_162">
<inState>5</inState>
<outState>2</outState>
<condition>
<id>40</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="_163">
<inState>4</inState>
<outState>3</outState>
<condition>
<id>42</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="_164">
<inState>3</inState>
<outState>5</outState>
<condition>
<id>41</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>21</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_165">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>43</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>21</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="_166">
<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>10</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>ap_block_pp0_stage0_flag00001001 ( 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_state1 ( or ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_block_state4_pp0_stage0_iter1 ( or ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_enable_pp0 ( xor ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>2</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter1 ( xor ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>2</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>i_fu_119_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>11</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>38</second>
</item>
<item>
<first>LUT</first>
<second>16</second>
</item>
</second>
</item>
<item>
<first>n1_1_fu_107_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>11</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>38</second>
</item>
<item>
<first>LUT</first>
<second>16</second>
</item>
</second>
</item>
<item>
<first>tmp_6_fu_101_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>11</second>
</item>
<item>
<first>(1P1)</first>
<second>11</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>6</second>
</item>
</second>
</item>
<item>
<first>tmp_8_fu_113_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>11</second>
</item>
<item>
<first>(1P1)</first>
<second>9</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>6</second>
</item>
</second>
</item>
<item>
<first>tmp_9_fu_125_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>11</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>6</second>
</item>
</second>
</item>
</dp_expression_resource>
<dp_fifo_resource>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_resource>
<dp_memory_resource>
<count>0</count>
<item_version>0</item_version>
</dp_memory_resource>
<dp_multiplexer_resource>
<count>7</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>5</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>5</second>
</item>
<item>
<first>LUT</first>
<second>27</second>
</item>
</second>
</item>
<item>
<first>ap_done</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter1</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>3</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>3</second>
</item>
<item>
<first>LUT</first>
<second>15</second>
</item>
</second>
</item>
<item>
<first>i_0_i_i_reg_90</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>11</second>
</item>
<item>
<first>(2Count)</first>
<second>22</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>n1_reg_79</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>11</second>
</item>
<item>
<first>(2Count)</first>
<second>22</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>out_stream_V_value_V_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
<item>
<first>slice_stream_V_value_V_blk_n</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>2</second>
</item>
<item>
<first>LUT</first>
<second>9</second>
</item>
</second>
</item>
</dp_multiplexer_resource>
<dp_register_resource>
<count>10</count>
<item_version>0</item_version>
<item>
<first>ap_CS_fsm</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>4</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>ap_done_reg</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter0</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>ap_enable_reg_pp0_iter1</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>buffer_0_value_V_fu_62</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>64</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>64</second>
</item>
</second>
</item>
<item>
<first>i_0_i_i_reg_90</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>11</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>11</second>
</item>
</second>
</item>
<item>
<first>n1_1_reg_190</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>11</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>11</second>
</item>
</second>
</item>
<item>
<first>n1_reg_79</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>11</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>11</second>
</item>
</second>
</item>
<item>
<first>tmp_8_reg_195</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
<item>
<first>tmp_9_reg_204</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>1</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>1</second>
</item>
</second>
</item>
</dp_register_resource>
<dp_component_map class_id="41" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_component_map>
<dp_expression_map>
<count>5</count>
<item_version>0</item_version>
<item class_id="42" tracking_level="0" version="0">
<first>i_fu_119_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>n1_1_fu_107_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>tmp_6_fu_101_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>tmp_8_fu_113_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>tmp_9_fu_125_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</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>26</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="0" version="0">
<first>3</first>
<second class_id="45" 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>1</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="46" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="47" tracking_level="0" version="0">
<first>9</first>
<second class_id="48" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>2</first>
<second>3</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="49" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="50" tracking_level="1" version="0" object_id="_167">
<region_name>LB1D_shiftreg</region_name>
<basic_blocks>
<count>4</count>
<item_version>0</item_version>
<item>25</item>
<item>32</item>
<item>41</item>
<item>45</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>2</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="51" tracking_level="0" version="0">
<count>17</count>
<item_version>0</item_version>
<item class_id="52" tracking_level="0" version="0">
<first>62</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>3</item>
</second>
</item>
<item>
<first>66</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>72</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>83</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>94</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>101</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>107</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>113</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>119</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>125</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>131</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>134</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>138</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>142</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>152</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>162</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>175</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="54" tracking_level="0" version="0">
<count>13</count>
<item_version>0</item_version>
<item class_id="55" tracking_level="0" version="0">
<first>buffer_0_value_V_fu_62</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>3</item>
</second>
</item>
<item>
<first>i_0_i_i_phi_fu_94</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>i_fu_119</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>n1_1_fu_107</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>n1_phi_fu_83</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>p_Result_11_1_1_fu_152</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>p_Result_11_1_fu_142</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>tmp_1_fu_138</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>tmp_6_fu_101</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>tmp_8_fu_113</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>tmp_9_fu_125</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>tmp_fu_134</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>tmp_value_V_fu_162</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</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>StgValue_38_write_fu_72</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>StgValue_41_store_fu_175</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>buffer_0_value_V_lo_load_fu_131</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>tmp_value_V_1_read_fu_66</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="56" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>8</count>
<item_version>0</item_version>
<item>
<first>79</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>180</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>3</item>
</second>
</item>
<item>
<first>186</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>190</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>195</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>199</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>204</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>8</count>
<item_version>0</item_version>
<item>
<first>buffer_0_value_V_reg_180</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>3</item>
</second>
</item>
<item>
<first>i_0_i_i_reg_90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>i_reg_199</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</second>
</item>
<item>
<first>n1_1_reg_190</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>n1_reg_79</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>tmp_6_reg_186</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>tmp_8_reg_195</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>tmp_9_reg_204</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>2</count>
<item_version>0</item_version>
<item>
<first>79</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>2</count>
<item_version>0</item_version>
<item>
<first>i_0_i_i_reg_90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>n1_reg_79</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="57" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="58" tracking_level="0" version="0">
<first>out_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>39</item>
</second>
</item>
</second>
</item>
<item>
<first>slice_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>29</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="59" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="60" tracking_level="0" version="0">
<first>1</first>
<second>FIFO_SRL</second>
</item>
<item>
<first>2</first>
<second>FIFO_SRL</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 31.158921 | 136 | 0.442044 |
23160a04801a5f0a2bc2ad4f51146c624cd750a3 | 3,358 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/pprint.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/pprint.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/pprint.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- P P R I N T --
-- --
-- S p e c --
-- --
-- Copyright (C) 2008-2015, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package (pretty print) contains a routine for printing an expression
-- given its node in the syntax tree. Contrarily to the Sprint package, this
-- routine tries to obtain "pretty" output that can be used for e.g. error
-- messages.
with Types; use Types;
with Urealp; use Urealp;
package Pprint is
generic
-- ??? The generic parameters should be removed.
with function Real_Image (U : Ureal) return String;
with function String_Image (S : String_Id) return String;
with function Ident_Image (Expr : Node_Id;
Orig_Expr : Node_Id;
Expand_Type : Boolean) return String;
-- Will be called for printing N_Identifier and N_Defining_Identifier
-- nodes
-- ??? Expand_Type argument should be removed
Hide_Parameter_Blocks : Boolean := False;
-- If true, then "Parameter_Block.Field_Name.all" is
-- instead displayed as "Field_Name".
function Expression_Image
(Expr : Node_Id;
Default : String) return String;
-- Given a Node for an expression, return a String that is meaningful for
-- the programmer. If the expression comes from source, it is copied from
-- there.
-- Subexpressions outside of the maximum depth (3), the maximal number of
-- accepted nodes (24), and the maximal number of list elements (3), are
-- replaced by the default string.
end Pprint;
| 52.46875 | 78 | 0.492853 |
d076061e2673e9e4f8900060a426ec6fc878da97 | 1,119 | adb | Ada | src/gdb/gdb-7.11/gdb/testsuite/gdb.ada/frame_args/pck.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/frame_args/pck.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/frame_args/pck.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 20 | 2018-11-16T21:19:22.000Z | 2021-10-18T23:08:24.000Z | -- Copyright 2007-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/>.
package body Pck is
procedure Break_Me is
begin
null;
end Break_Me;
procedure Call_Me (Int : Integer;
Flt : Float;
Bln : Boolean;
Ary : Arr;
Chr : Character;
Sad : System.Address;
Rec : Struct)
is
begin
Break_Me;
end Call_Me;
end Pck;
| 30.243243 | 73 | 0.626452 |
39165ca37ec831424ee1ce9eb38d4fe2052d2929 | 2,023 | ads | Ada | tools/scitools/conf/understand/ada/ada95/s-strequ.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | 1 | 2020-01-20T21:26:46.000Z | 2020-01-20T21:26:46.000Z | tools/scitools/conf/understand/ada/ada95/s-strequ.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada95/s-strequ.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNU ADA RUNTIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . S T R _ E Q U A L --
-- --
-- S p e c --
-- --
-- $Revision: 2 $ --
-- --
-- Copyright (c) 1992,1993,1994 NYU, All Rights Reserved --
-- --
-- The GNAT library is free software; you can redistribute it and/or modify --
-- it under terms of the GNU Library General Public License as published by --
-- the Free Software Foundation; either version 2, or (at your option) any --
-- later version. The GNAT 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 --
-- the GNAT library; see the file COPYING.LIB. If not, write to the Free --
-- Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. --
-- --
------------------------------------------------------------------------------
-- Runtime function used to compare two strings (i.e. Standard."=")
function System.Str_Equal (A, B : String) return Boolean;
| 69.758621 | 78 | 0.375185 |
1c7944fca08f058c5d45ccf2e94fd35217c1dd81 | 531 | ads | Ada | bits/src/search/bitoperations-search.ads | vasil-sd/ada-tlsf | c30cfaf5f0b87ebb6e4dd479e50b3f9b11381ddd | [
"MIT"
] | 3 | 2020-02-21T15:42:14.000Z | 2020-04-08T09:42:32.000Z | bits/src/search/bitoperations-search.ads | vasil-sd/ada-tlsf | c30cfaf5f0b87ebb6e4dd479e50b3f9b11381ddd | [
"MIT"
] | null | null | null | bits/src/search/bitoperations-search.ads | vasil-sd/ada-tlsf | c30cfaf5f0b87ebb6e4dd479e50b3f9b11381ddd | [
"MIT"
] | 1 | 2020-02-21T15:29:26.000Z | 2020-02-21T15:29:26.000Z | with BitOperations.Types;
with BitOperations.Shift;
with BitOperations.Mask;
with Interfaces;
generic
with package Types is new BitOperations.Types (<>);
package BitOperations.Search with SPARK_Mode, Pure, Preelaborate is
use Types;
package Shift is new BitOperations.Shift(Types);
package Mask is new BitOperations.Mask(Types);
use Shift;
function Most_Significant_Bit(Value : Modular) return Bit_Position
with Pure_Function, Global => null,
Pre => Value /= 0;
end BitOperations.Search;
| 24.136364 | 69 | 0.740113 |
cbb3e3684ad0f908647db1238b0155ea2182879d | 2,757 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-soliop__mingw.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-soliop__mingw.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-soliop__mingw.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T . S O C K E T S . L I N K E R _ O P T I O N S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2001-2020, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package is used to provide target specific linker_options for the
-- support of sockets as required by the package GNAT.Sockets.
-- This is the Windows/NT version of this package
-- This package should not be directly with'ed by an application program
package GNAT.Sockets.Linker_Options is
private
pragma Linker_Options ("-lws2_32");
end GNAT.Sockets.Linker_Options;
| 64.116279 | 78 | 0.420747 |
fb264843f6fb52fa390fe37d490a8e43f3d5aa05 | 1,187 | adb | Ada | src/apsepp-scope_bound_locks-private_handler.adb | thierr26/ada-apsepp | 6eb87079ea57707db4ee1e2215fa170af66b1913 | [
"MIT"
] | null | null | null | src/apsepp-scope_bound_locks-private_handler.adb | thierr26/ada-apsepp | 6eb87079ea57707db4ee1e2215fa170af66b1913 | [
"MIT"
] | null | null | null | src/apsepp-scope_bound_locks-private_handler.adb | thierr26/ada-apsepp | 6eb87079ea57707db4ee1e2215fa170af66b1913 | [
"MIT"
] | null | null | null | -- Copyright (C) 2019 Thierry Rascle <[email protected]>
-- MIT license. Please refer to the LICENSE file.
package body Apsepp.Scope_Bound_Locks.Private_Handler is
----------------------------------------------------------------------------
protected body Protected_Handler is
-----------------------------------------------------
procedure Do_Lock (Lock : SB_Lock_Access;
Actually_Locked : out Boolean) is
begin
Actually_Locked := not Locked (Lock.all);
Lock.Is_Locked := True;
if Actually_Locked and then Lock.Lock_CB /= null then
Lock.Lock_CB.all;
end if;
end Do_Lock;
-----------------------------------------------------
procedure Do_Unlock (Lock : SB_Lock_Access) is
begin
if Lock.Unlock_CB /= null then
Lock.Unlock_CB.all;
end if;
Lock.Is_Locked := False;
end Do_Unlock;
-----------------------------------------------------
end Protected_Handler;
----------------------------------------------------------------------------
end Apsepp.Scope_Bound_Locks.Private_Handler;
| 26.377778 | 79 | 0.442291 |
23279bcc7e999599f1d502dd34ebc38ece85a6d6 | 25,952 | ads | Ada | include/sf-network-ftp.ads | Fabien-Chouteau/ASFML | 52a013554bcfb6150e0d6391871356c1443a6b93 | [
"Zlib"
] | null | null | null | include/sf-network-ftp.ads | Fabien-Chouteau/ASFML | 52a013554bcfb6150e0d6391871356c1443a6b93 | [
"Zlib"
] | null | null | null | include/sf-network-ftp.ads | Fabien-Chouteau/ASFML | 52a013554bcfb6150e0d6391871356c1443a6b93 | [
"Zlib"
] | null | null | null | --//////////////////////////////////////////////////////////
-- SFML - Simple and Fast Multimedia Library
-- Copyright (C) 2007-2015 Laurent Gomila ([email protected])
-- This software is provided 'as-is', without any express or implied warranty.
-- In no event will the authors be held liable for any damages arising from the use of this software.
-- Permission is granted to anyone to use this software for any purpose,
-- including commercial applications, and to alter it and redistribute it freely,
-- subject to the following restrictions:
-- 1. The origin of this software must not be misrepresented;
-- you must not claim that you wrote the original software.
-- If you use this software in a product, an acknowledgment
-- in the product documentation would be appreciated but is not required.
-- 2. Altered source versions must be plainly marked as such,
-- and must not be misrepresented as being the original software.
-- 3. This notice may not be removed or altered from any source distribution.
--//////////////////////////////////////////////////////////
--//////////////////////////////////////////////////////////
with Sf.Network.IpAddress;
with Sf.System.Time;
package Sf.Network.Ftp is
--//////////////////////////////////////////////////////////
--//////////////////////////////////////////////////////////
--//////////////////////////////////////////////////////////
--//////////////////////////////////////////////////////////
--//////////////////////////////////////////////////////////
--/ @brief Enumeration of transfer modes
--/
--//////////////////////////////////////////////////////////
--/< Binary mode (file is transfered as a sequence of bytes)
--/< Text mode using ASCII encoding
--/< Text mode using EBCDIC encoding
type sfFtpTransferMode is
(sfFtpBinary,
sfFtpAscii,
sfFtpEbcdic);
--//////////////////////////////////////////////////////////
--/ @brief Status codes possibly returned by a FTP response
--/
--//////////////////////////////////////////////////////////
-- 1xx: the requested action is being initiated,
-- expect another reply before proceeding with a new command
--/< Restart marker reply
--/< Service ready in N minutes
--/< Data connection already opened, transfer starting
--/< File status ok, about to open data connection
-- 2xx: the requested action has been successfully completed
--/< Command ok
--/< Command not implemented
--/< System status, or system help reply
--/< Directory status
--/< File status
--/< Help message
--/< NAME system type, where NAME is an official system name from the list in the Assigned Numbers document
--/< Service ready for new user
--/< Service closing control connection
--/< Data connection open, no transfer in progress
--/< Closing data connection, requested file action successful
--/< Entering passive mode
--/< User logged in, proceed. Logged out if appropriate
--/< Requested file action ok
--/< PATHNAME created
-- 3xx: the command has been accepted, but the requested action
-- is dormant, pending receipt of further information
--/< User name ok, need password
--/< Need account for login
--/< Requested file action pending further information
-- 4xx: the command was not accepted and the requested action did not take place,
-- but the error condition is temporary and the action may be requested again
--/< Service not available, closing control connection
--/< Can't open data connection
--/< Connection closed, transfer aborted
--/< Requested file action not taken
--/< Requested action aborted, local error in processing
--/< Requested action not taken; insufficient storage space in system, file unavailable
-- 5xx: the command was not accepted and
-- the requested action did not take place
--/< Syntax error, command unrecognized
--/< Syntax error in parameters or arguments
--/< Command not implemented
--/< Bad sequence of commands
--/< Command not implemented for that parameter
--/< Not logged in
--/< Need account for storing files
--/< Requested action not taken, file unavailable
--/< Requested action aborted, page type unknown
--/< Requested file action aborted, exceeded storage allocation
--/< Requested action not taken, file name not allowed
-- 10xx: SFML custom codes
--/< Response is not a valid FTP one
--/< Connection with server failed
--/< Connection with server closed
--/< Invalid file to upload / download
subtype sfFtpStatus is sfUint32;
sfFtpRestartMarkerReply : constant sfFtpStatus := 110;
sfFtpServiceReadySoon : constant sfFtpStatus := 120;
sfFtpDataConnectionAlreadyOpened : constant sfFtpStatus := 125;
sfFtpOpeningDataConnection : constant sfFtpStatus := 150;
sfFtpOk : constant sfFtpStatus := 200;
sfFtpPointlessCommand : constant sfFtpStatus := 202;
sfFtpSystemStatus : constant sfFtpStatus := 211;
sfFtpDirectoryStatus : constant sfFtpStatus := 212;
sfFtpFileStatus : constant sfFtpStatus := 213;
sfFtpHelpMessage : constant sfFtpStatus := 214;
sfFtpSystemType : constant sfFtpStatus := 215;
sfFtpServiceReady : constant sfFtpStatus := 220;
sfFtpClosingConnection : constant sfFtpStatus := 221;
sfFtpDataConnectionOpened : constant sfFtpStatus := 225;
sfFtpClosingDataConnection : constant sfFtpStatus := 226;
sfFtpEnteringPassiveMode : constant sfFtpStatus := 227;
sfFtpLoggedIn : constant sfFtpStatus := 230;
sfFtpFileActionOk : constant sfFtpStatus := 250;
sfFtpDirectoryOk : constant sfFtpStatus := 257;
sfFtpNeedPassword : constant sfFtpStatus := 331;
sfFtpNeedAccountToLogIn : constant sfFtpStatus := 332;
sfFtpNeedInformation : constant sfFtpStatus := 350;
sfFtpServiceUnavailable : constant sfFtpStatus := 421;
sfFtpDataConnectionUnavailable : constant sfFtpStatus := 425;
sfFtpTransferAborted : constant sfFtpStatus := 426;
sfFtpFileActionAborted : constant sfFtpStatus := 450;
sfFtpLocalError : constant sfFtpStatus := 451;
sfFtpInsufficientStorageSpace : constant sfFtpStatus := 452;
sfFtpCommandUnknown : constant sfFtpStatus := 500;
sfFtpParametersUnknown : constant sfFtpStatus := 501;
sfFtpCommandNotImplemented : constant sfFtpStatus := 502;
sfFtpBadCommandSequence : constant sfFtpStatus := 503;
sfFtpParameterNotImplemented : constant sfFtpStatus := 504;
sfFtpNotLoggedIn : constant sfFtpStatus := 530;
sfFtpNeedAccountToStore : constant sfFtpStatus := 532;
sfFtpFileUnavailable : constant sfFtpStatus := 550;
sfFtpPageTypeUnknown : constant sfFtpStatus := 551;
sfFtpNotEnoughMemory : constant sfFtpStatus := 552;
sfFtpFilenameNotAllowed : constant sfFtpStatus := 553;
sfFtpInvalidResponse : constant sfFtpStatus := 1000;
sfFtpConnectionFailed : constant sfFtpStatus := 1001;
sfFtpConnectionClosed : constant sfFtpStatus := 1002;
sfFtpInvalidFile : constant sfFtpStatus := 1003;
package ListingResponse is
--//////////////////////////////////////////////////////////
--/ @brief Destroy a FTP listing response
--/
--/ @param ftpListingResponse Ftp listing response to destroy
--/
--//////////////////////////////////////////////////////////
procedure destroy (ftpListingResponse : sfFtpListingResponse_Ptr);
--//////////////////////////////////////////////////////////
--/ @brief Check if a FTP listing response status code means a success
--/
--/ This function is defined for convenience, it is
--/ equivalent to testing if the status code is < 400.
--/
--/ @param ftpListingResponse Ftp listing response
--/
--/ @return sfTrue if the status is a success, sfFalse if it is a failure
--/
--//////////////////////////////////////////////////////////
function isOk (ftpListingResponse : sfFtpListingResponse_Ptr) return sfBool;
--//////////////////////////////////////////////////////////
--/ @brief Get the status code of a FTP listing response
--/
--/ @param ftpListingResponse Ftp listing response
--/
--/ @return Status code
--/
--//////////////////////////////////////////////////////////
function getStatus (ftpListingResponse : sfFtpListingResponse_Ptr) return sfFtpStatus;
--//////////////////////////////////////////////////////////
--/ @brief Get the full message contained in a FTP listing response
--/
--/ @param ftpListingResponse Ftp listing response
--/
--/ @return The response message
--/
--//////////////////////////////////////////////////////////
function getMessage (ftpListingResponse : sfFtpListingResponse_Ptr) return String;
--//////////////////////////////////////////////////////////
--/ @brief Return the number of directory/file names contained in a FTP listing response
--/
--/ @param ftpListingResponse Ftp listing response
--/
--/ @return Total number of names available
--/
--//////////////////////////////////////////////////////////
function getCount (ftpListingResponse : sfFtpListingResponse_Ptr) return sfSize_t;
--//////////////////////////////////////////////////////////
--/ @brief Return a directory/file name contained in a FTP listing response
--/
--/ @param ftpListingResponse Ftp listing response
--/ @param index Index of the name to get (in range [0 .. getCount])
--/
--/ @return The requested name
--/
--//////////////////////////////////////////////////////////
function getName (ftpListingResponse : sfFtpListingResponse_Ptr; index : sfSize_t) return String;
private
pragma Import (C, destroy, "sfFtpListingResponse_destroy");
pragma Import (C, isOk, "sfFtpListingResponse_isOk");
pragma Import (C, getStatus, "sfFtpListingResponse_getStatus");
pragma Import (C, getCount, "sfFtpListingResponse_getCount");
end ListingResponse;
package DirectoryResponse is
--//////////////////////////////////////////////////////////
--/ @brief Destroy a FTP directory response
--/
--/ @param ftpDirectoryResponse Ftp directory response to destroy
--/
--//////////////////////////////////////////////////////////
procedure destroy (ftpDirectoryResponse : sfFtpDirectoryResponse_Ptr);
--//////////////////////////////////////////////////////////
--/ @brief Check if a FTP directory response status code means a success
--/
--/ This function is defined for convenience, it is
--/ equivalent to testing if the status code is < 400.
--/
--/ @param ftpDirectoryResponse Ftp directory response
--/
--/ @return sfTrue if the status is a success, sfFalse if it is a failure
--/
--//////////////////////////////////////////////////////////
function isOk (ftpDirectoryResponse : sfFtpDirectoryResponse_Ptr) return sfBool;
--//////////////////////////////////////////////////////////
--/ @brief Get the status code of a FTP directory response
--/
--/ @param ftpDirectoryResponse Ftp directory response
--/
--/ @return Status code
--/
--//////////////////////////////////////////////////////////
function getStatus (ftpDirectoryResponse : sfFtpDirectoryResponse_Ptr) return sfFtpStatus;
--//////////////////////////////////////////////////////////
--/ @brief Get the full message contained in a FTP directory response
--/
--/ @param ftpDirectoryResponse Ftp directory response
--/
--/ @return The response message
--/
--//////////////////////////////////////////////////////////
function getMessage (ftpDirectoryResponse : sfFtpDirectoryResponse_Ptr) return String;
--//////////////////////////////////////////////////////////
--/ @brief Get the directory returned in a FTP directory response
--/
--/ @param ftpDirectoryResponse Ftp directory response
--/
--/ @return Directory name
--/
--//////////////////////////////////////////////////////////
function getDirectory (ftpDirectoryResponse : sfFtpDirectoryResponse_Ptr) return String;
private
pragma Import (C, destroy, "sfFtpDirectoryResponse_destroy");
pragma Import (C, isOk, "sfFtpDirectoryResponse_isOk");
pragma Import (C, getStatus, "sfFtpDirectoryResponse_getStatus");
end DirectoryResponse;
package Response is
--//////////////////////////////////////////////////////////
--/ @brief Destroy a FTP response
--/
--/ @param ftpResponse Ftp response to destroy
--/
--//////////////////////////////////////////////////////////
procedure destroy (ftpResponse : sfFtpResponse_Ptr);
--//////////////////////////////////////////////////////////
--/ @brief Check if a FTP response status code means a success
--/
--/ This function is defined for convenience, it is
--/ equivalent to testing if the status code is < 400.
--/
--/ @param ftpResponse Ftp response object
--/
--/ @return sfTrue if the status is a success, sfFalse if it is a failure
--/
--//////////////////////////////////////////////////////////
function isOk (ftpResponse : sfFtpResponse_Ptr) return sfBool;
--//////////////////////////////////////////////////////////
--/ @brief Get the status code of a FTP response
--/
--/ @param ftpResponse Ftp response object
--/
--/ @return Status code
--/
--//////////////////////////////////////////////////////////
function getStatus (ftpResponse : sfFtpResponse_Ptr) return sfFtpStatus;
--//////////////////////////////////////////////////////////
--/ @brief Get the full message contained in a FTP response
--/
--/ @param ftpResponse Ftp response object
--/
--/ @return The response message
--/
--//////////////////////////////////////////////////////////
function getMessage (ftpResponse : sfFtpResponse_Ptr) return String;
private
pragma Import (C, destroy, "sfFtpResponse_destroy");
pragma Import (C, isOk, "sfFtpResponse_isOk");
pragma Import (C, getStatus, "sfFtpResponse_getStatus");
end Response;
--//////////////////////////////////////////////////////////
--/ @brief Create a new Ftp object
--/
--/ @return A new sfFtp object
--/
--//////////////////////////////////////////////////////////
function create return sfFtp_Ptr;
--//////////////////////////////////////////////////////////
--/ @brief Destroy a Ftp object
--/
--/ @param ftp Ftp object to destroy
--/
--//////////////////////////////////////////////////////////
procedure destroy (ftp : sfFtp_Ptr);
--//////////////////////////////////////////////////////////
--/ @brief Connect to the specified FTP server
--/
--/ The port should be 21, which is the standard
--/ port used by the FTP protocol. You shouldn't use a different
--/ value, unless you really know what you do.
--/ This function tries to connect to the server so it may take
--/ a while to complete, especially if the server is not
--/ reachable. To avoid blocking your application for too long,
--/ you can use a timeout. Using 0 means that the
--/ system timeout will be used (which is usually pretty long).
--/
--/ @param ftp Ftp object
--/ @param server Name or address of the FTP server to connect to
--/ @param port Port used for the connection
--/ @param timeout Maximum time to wait
--/
--/ @return Server response to the request
--/
--//////////////////////////////////////////////////////////
function connect
(ftp : sfFtp_Ptr;
server : Sf.Network.IpAddress.sfIpAddress;
port : sfUint16;
timeout : Sf.System.Time.sfTime) return sfFtpResponse_Ptr;
--//////////////////////////////////////////////////////////
--/ @brief Log in using an anonymous account
--/
--/ Logging in is mandatory after connecting to the server.
--/ Users that are not logged in cannot perform any operation.
--/
--/ @param ftp Ftp object
--/
--/ @return Server response to the request
--/
--//////////////////////////////////////////////////////////
function loginAnonymous (ftp : sfFtp_Ptr) return sfFtpResponse_Ptr;
--//////////////////////////////////////////////////////////
--/ @brief Log in using a username and a password
--/
--/ Logging in is mandatory after connecting to the server.
--/ Users that are not logged in cannot perform any operation.
--/
--/ @param ftp Ftp object
--/ @param name User name
--/ @param password Password
--/
--/ @return Server response to the request
--/
--//////////////////////////////////////////////////////////
function login
(ftp : sfFtp_Ptr;
name : String;
password : String) return sfFtpResponse_Ptr;
--//////////////////////////////////////////////////////////
--/ @brief Close the connection with the server
--/
--/ @param ftp Ftp object
--/
--/ @return Server response to the request
--/
--//////////////////////////////////////////////////////////
function disconnect (ftp : sfFtp_Ptr) return sfFtpResponse_Ptr;
--//////////////////////////////////////////////////////////
--/ @brief Send a null command to keep the connection alive
--/
--/ This command is useful because the server may close the
--/ connection automatically if no command is sent.
--/
--/ @param ftp Ftp object
--/
--/ @return Server response to the request
--/
--//////////////////////////////////////////////////////////
function keepAlive (ftp : sfFtp_Ptr) return sfFtpResponse_Ptr;
--//////////////////////////////////////////////////////////
--/ @brief Get the current working directory
--/
--/ The working directory is the root path for subsequent
--/ operations involving directories and/or filenames.
--/
--/ @param ftp Ftp object
--/
--/ @return Server response to the request
--/
--//////////////////////////////////////////////////////////
function getWorkingDirectory (ftp : sfFtp_Ptr) return sfFtpResponse_Ptr;
--//////////////////////////////////////////////////////////
--/ @brief Get the contents of the given directory
--/
--/ This function retrieves the sub-directories and files
--/ contained in the given directory. It is not recursive.
--/ The @a directory parameter is relative to the current
--/ working directory.
--/
--/ @param ftp Ftp object
--/ @param directory Directory to list
--/
--/ @return Server response to the request
--/
--//////////////////////////////////////////////////////////
function getDirectoryListing (ftp : sfFtp_Ptr; directory : String) return sfFtpResponse_Ptr;
--//////////////////////////////////////////////////////////
--/ @brief Change the current working directory
--/
--/ The new directory must be relative to the current one.
--/
--/ @param ftp Ftp object
--/ @param directory New working directory
--/
--/ @return Server response to the request
--/
--//////////////////////////////////////////////////////////
function changeDirectory (ftp : sfFtp_Ptr;
directory : String) return sfFtpResponse_Ptr;
--//////////////////////////////////////////////////////////
--/ @brief Go to the parent directory of the current one
--/
--/ @param ftp Ftp object
--/
--/ @return Server response to the request
--/
--//////////////////////////////////////////////////////////
function parentDirectory (ftp : sfFtp_Ptr) return sfFtpResponse_Ptr;
--//////////////////////////////////////////////////////////
--/ @brief Create a new directory
--/
--/ The new directory is created as a child of the current
--/ working directory.
--/
--/ @param ftp Ftp object
--/ @param name Name of the directory to create
--/
--/ @return Server response to the request
--/
--//////////////////////////////////////////////////////////
function createDirectory (ftp : sfFtp_Ptr;
name : String) return sfFtpResponse_Ptr;
--//////////////////////////////////////////////////////////
--/ @brief Remove an existing directory
--/
--/ The directory to remove must be relative to the
--/ current working directory.
--/ Use this function with caution, the directory will
--/ be removed permanently!
--/
--/ @param ftp Ftp object
--/ @param name Name of the directory to remove
--/
--/ @return Server response to the request
--/
--//////////////////////////////////////////////////////////
function deleteDirectory (ftp : sfFtp_Ptr; name : String) return sfFtpResponse_Ptr;
--//////////////////////////////////////////////////////////
--/ @brief Rename an existing file
--/
--/ The filenames must be relative to the current working
--/ directory.
--/
--/ @param ftp Ftp object
--/ @param file File to rename
--/ @param newName New name of the file
--/
--/ @return Server response to the request
--/
--//////////////////////////////////////////////////////////
function renameFile
(ftp : sfFtp_Ptr;
file : String;
newName : String) return sfFtpResponse_Ptr;
--//////////////////////////////////////////////////////////
--/ @brief Remove an existing file
--/
--/ The file name must be relative to the current working
--/ directory.
--/ Use this function with caution, the file will be
--/ removed permanently!
--/
--/ @param ftp Ftp object
--/ @param name File to remove
--/
--/ @return Server response to the request
--/
--//////////////////////////////////////////////////////////
function deleteFile (ftp : sfFtp_Ptr;
name : String) return sfFtpResponse_Ptr;
--//////////////////////////////////////////////////////////
--/ @brief Download a file from a FTP server
--/
--/ The filename of the distant file is relative to the
--/ current working directory of the server, and the local
--/ destination path is relative to the current directory
--/ of your application.
--/
--/ @param ftp Ftp object
--/ @param remoteFile Filename of the distant file to download
--/ @param localPath Where to put to file on the local computer
--/ @param mode Transfer mode
--/
--/ @return Server response to the request
--/
--//////////////////////////////////////////////////////////
function download
(ftp : sfFtp_Ptr;
remoteFile : String;
localPath : String;
mode : sfFtpTransferMode) return sfFtpResponse_Ptr;
--//////////////////////////////////////////////////////////
--/ @brief Upload a file to a FTP server
--/
--/ The name of the local file is relative to the current
--/ working directory of your application, and the
--/ remote path is relative to the current directory of the
--/ FTP server.
--/
--/ @param ftp Ftp object
--/ @param localFile Path of the local file to upload
--/ @param remotePath Where to put to file on the server
--/ @param mode Transfer mode
--/ @param append Pass sfTrue to append to or sfFalse to overwrite the remote file if it already exists
--/
--/ @return Server response to the request
--/
--//////////////////////////////////////////////////////////
function upload
(ftp : sfFtp_Ptr;
localFile : String;
remotePath : String;
mode : sfFtpTransferMode;
append : sfBool) return sfFtpResponse_Ptr;
--//////////////////////////////////////////////////////////
--/ @brief Send a command to the FTP server
--/
--/ While the most often used commands are provided as
--/ specific functions, this function can be used to send
--/ any FTP command to the server. If the command requires
--/ one or more parameters, they can be specified in
--/ @a parameter. Otherwise you should pass NULL.
--/ If the server returns information, you can extract it
--/ from the response using sfResponse_getMessage().
--/
--/ @param ftp Ftp object
--/ @param command Command to send
--/ @param parameter Command parameter
--/
--/ @return Server response to the request
--/
--//////////////////////////////////////////////////////////
function sendCommand
(ftp : sfFtp_Ptr;
command : String;
parameter : String) return sfFtpResponse_Ptr;
private
pragma Convention (C, sfFtpTransferMode);
pragma Import (C, create, "sfFtp_create");
pragma Import (C, destroy, "sfFtp_destroy");
pragma Import (C, connect, "sfFtp_connect");
pragma Import (C, loginAnonymous, "sfFtp_loginAnonymous");
pragma Import (C, disconnect, "sfFtp_disconnect");
pragma Import (C, keepAlive, "sfFtp_keepAlive");
pragma Import (C, getWorkingDirectory, "sfFtp_getWorkingDirectory");
pragma Import (C, getDirectoryListing, "sfFtp_getDirectoryListing");
pragma Import (C, parentDirectory, "sfFtp_parentDirectory");
end Sf.Network.Ftp;
| 41.193651 | 110 | 0.532714 |
1c1c7860332c3638a56102f4ea37b0003149dd21 | 10,310 | ads | Ada | llvm-gcc-4.2-2.9/gcc/ada/a-ciorse.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 1 | 2016-04-09T02:58:13.000Z | 2016-04-09T02:58:13.000Z | llvm-gcc-4.2-2.9/gcc/ada/a-ciorse.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/a-ciorse.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- A D A . C O N T A I N E R S . --
-- I N D E F I N I T E _ O R D E R E D _ S E T S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2004-2005, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
with Ada.Containers.Red_Black_Trees;
with Ada.Finalization;
with Ada.Streams;
generic
type Element_Type (<>) is private;
with function "<" (Left, Right : Element_Type) return Boolean is <>;
with function "=" (Left, Right : Element_Type) return Boolean is <>;
package Ada.Containers.Indefinite_Ordered_Sets is
pragma Preelaborate;
function Equivalent_Elements (Left, Right : Element_Type) return Boolean;
type Set is tagged private;
type Cursor is private;
Empty_Set : constant Set;
No_Element : constant Cursor;
function "=" (Left, Right : Set) return Boolean;
function Equivalent_Sets (Left, Right : Set) return Boolean;
function To_Set (New_Item : Element_Type) return Set;
function Length (Container : Set) return Count_Type;
function Is_Empty (Container : Set) return Boolean;
procedure Clear (Container : in out Set);
function Element (Position : Cursor) return Element_Type;
procedure Replace_Element
(Container : in out Set;
Position : Cursor;
New_Item : Element_Type);
procedure Query_Element
(Position : Cursor;
Process : not null access procedure (Element : Element_Type));
procedure Move (Target : in out Set; Source : in out Set);
procedure Insert
(Container : in out Set;
New_Item : Element_Type;
Position : out Cursor;
Inserted : out Boolean);
procedure Insert
(Container : in out Set;
New_Item : Element_Type);
procedure Include
(Container : in out Set;
New_Item : Element_Type);
procedure Replace
(Container : in out Set;
New_Item : Element_Type);
procedure Exclude
(Container : in out Set;
Item : Element_Type);
procedure Delete
(Container : in out Set;
Item : Element_Type);
procedure Delete
(Container : in out Set;
Position : in out Cursor);
procedure Delete_First (Container : in out Set);
procedure Delete_Last (Container : in out Set);
procedure Union (Target : in out Set; Source : Set);
function Union (Left, Right : Set) return Set;
function "or" (Left, Right : Set) return Set renames Union;
procedure Intersection (Target : in out Set; Source : Set);
function Intersection (Left, Right : Set) return Set;
function "and" (Left, Right : Set) return Set renames Intersection;
procedure Difference (Target : in out Set; Source : Set);
function Difference (Left, Right : Set) return Set;
function "-" (Left, Right : Set) return Set renames Difference;
procedure Symmetric_Difference (Target : in out Set; Source : Set);
function Symmetric_Difference (Left, Right : Set) return Set;
function "xor" (Left, Right : Set) return Set renames Symmetric_Difference;
function Overlap (Left, Right : Set) return Boolean;
function Is_Subset (Subset : Set; Of_Set : Set) return Boolean;
function First (Container : Set) return Cursor;
function First_Element (Container : Set) return Element_Type;
function Last (Container : Set) return Cursor;
function Last_Element (Container : Set) return Element_Type;
function Next (Position : Cursor) return Cursor;
procedure Next (Position : in out Cursor);
function Previous (Position : Cursor) return Cursor;
procedure Previous (Position : in out Cursor);
function Find (Container : Set; Item : Element_Type) return Cursor;
function Floor (Container : Set; Item : Element_Type) return Cursor;
function Ceiling (Container : Set; Item : Element_Type) return Cursor;
function Contains (Container : Set; Item : Element_Type) return Boolean;
function Has_Element (Position : Cursor) return Boolean;
function "<" (Left, Right : Cursor) return Boolean;
function ">" (Left, Right : Cursor) return Boolean;
function "<" (Left : Cursor; Right : Element_Type) return Boolean;
function ">" (Left : Cursor; Right : Element_Type) return Boolean;
function "<" (Left : Element_Type; Right : Cursor) return Boolean;
function ">" (Left : Element_Type; Right : Cursor) return Boolean;
procedure Iterate
(Container : Set;
Process : not null access procedure (Position : Cursor));
procedure Reverse_Iterate
(Container : Set;
Process : not null access procedure (Position : Cursor));
generic
type Key_Type (<>) is private;
with function Key (Element : Element_Type) return Key_Type;
with function "<" (Left, Right : Key_Type) return Boolean is <>;
package Generic_Keys is
function Equivalent_Keys (Left, Right : Key_Type) return Boolean;
function Key (Position : Cursor) return Key_Type;
function Element (Container : Set; Key : Key_Type) return Element_Type;
procedure Replace
(Container : in out Set;
Key : Key_Type;
New_Item : Element_Type);
procedure Exclude (Container : in out Set; Key : Key_Type);
procedure Delete (Container : in out Set; Key : Key_Type);
function Find
(Container : Set;
Key : Key_Type) return Cursor;
function Floor
(Container : Set;
Key : Key_Type) return Cursor;
function Ceiling
(Container : Set;
Key : Key_Type) return Cursor;
function Contains
(Container : Set;
Key : Key_Type) return Boolean;
procedure Update_Element_Preserving_Key
(Container : in out Set;
Position : Cursor;
Process : not null access
procedure (Element : in out Element_Type));
end Generic_Keys;
private
type Node_Type;
type Node_Access is access Node_Type;
type Element_Access is access Element_Type;
type Node_Type is limited record
Parent : Node_Access;
Left : Node_Access;
Right : Node_Access;
Color : Red_Black_Trees.Color_Type := Red_Black_Trees.Red;
Element : Element_Access;
end record;
package Tree_Types is new Red_Black_Trees.Generic_Tree_Types
(Node_Type,
Node_Access);
type Set is new Ada.Finalization.Controlled with record
Tree : Tree_Types.Tree_Type;
end record;
procedure Adjust (Container : in out Set);
procedure Finalize (Container : in out Set) renames Clear;
use Red_Black_Trees;
use Tree_Types;
use Ada.Finalization;
use Ada.Streams;
type Set_Access is access all Set;
for Set_Access'Storage_Size use 0;
type Cursor is record
Container : Set_Access;
Node : Node_Access;
end record;
procedure Write
(Stream : access Root_Stream_Type'Class;
Item : Cursor);
for Cursor'Write use Write;
procedure Read
(Stream : access Root_Stream_Type'Class;
Item : out Cursor);
for Cursor'Read use Read;
No_Element : constant Cursor := Cursor'(null, null);
procedure Write
(Stream : access Root_Stream_Type'Class;
Container : Set);
for Set'Write use Write;
procedure Read
(Stream : access Root_Stream_Type'Class;
Container : out Set);
for Set'Read use Read;
Empty_Set : constant Set :=
(Controlled with Tree => (First => null,
Last => null,
Root => null,
Length => 0,
Busy => 0,
Lock => 0));
end Ada.Containers.Indefinite_Ordered_Sets;
| 32.626582 | 78 | 0.586227 |
0e7834b0e986ac6063bb30478436a2e10c9806fc | 458 | adb | Ada | ada/prime/main.adb | rn7s2/src | ec7d2a3fabb9ce25950fb546e16ac47d571043e1 | [
"WTFPL"
] | 1 | 2021-02-12T16:20:03.000Z | 2021-02-12T16:20:03.000Z | ada/prime/main.adb | rn7s2/src | ec7d2a3fabb9ce25950fb546e16ac47d571043e1 | [
"WTFPL"
] | null | null | null | ada/prime/main.adb | rn7s2/src | ec7d2a3fabb9ce25950fb546e16ac47d571043e1 | [
"WTFPL"
] | null | null | null | with Ada.Text_IO; use Ada.Text_IO;
with Ada.Numerics.Aux; use Ada.Numerics.Aux;
with Prime_Ada; use Prime_Ada;
procedure Main is
begin
declare
n : Integer;
begin
for i in 1 .. 6 loop
n := Integer (Pow (Double (10), Double (i)));
Put ("n = ");
Put_Line (Integer'Image (n));
Get_Prime (n);
Put (Integer'Image (cnt));
Put_Line (" prime numbers found.");
end loop;
end;
end Main;
| 22.9 | 54 | 0.567686 |
395cded931f71974b454777ff997a880dff0d2aa | 5,016 | adb | Ada | 3-mid/impact/source/3d/collision/shapes/impact-d3-striding_mesh-triangle_index_vertex_array.adb | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/impact/source/3d/collision/shapes/impact-d3-striding_mesh-triangle_index_vertex_array.adb | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/impact/source/3d/collision/shapes/impact-d3-striding_mesh-triangle_index_vertex_array.adb | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | -- #include "impact.d3.striding_Mesh.triangle_index_vertex_array.h"
package body impact.d3.striding_Mesh.triangle_index_vertex_array
--
--
--
is
procedure addIndexedMesh (Self : in out Item; mesh : in btIndexedMesh)
is
begin
Self.m_indexedMeshes.append (mesh);
-- Self.m_indexedMeshes[m_indexedMeshes.size()-1].m_indexType = indexType;
end addIndexedMesh;
overriding function getNumSubParts (Self : in Item) return Natural
is
begin
return Natural (Self.m_indexedMeshes.Length);
end getNumSubParts;
function getIndexedMeshArray (Self : access Item) return access IndexedMeshArray
is
begin
return Self.m_indexedMeshes'Access;
end getIndexedMeshArray;
overriding procedure destruct (Self : in out Item)
is
begin
null;
end destruct;
overriding procedure getLockedVertexIndexBase (Self : in out Item; vertexbase : out impact.d3.Containers.real_Pointer;
stride : in out Integer;
indexbase : out swig.Pointers.unsigned_Pointer;
indexstride : in out Integer;
numfaces : in out Integer;
subpart : in Integer := 0)
is
pragma Assert (subpart < Self.getNumSubParts);
mesh : btIndexedMesh renames Self.m_indexedMeshes (subpart);
begin
-- numverts := mesh.m_numVertices;
vertexbase := mesh.m_vertexBase;
-- vertexStride := mesh.m_vertexStride;
numfaces := mesh.m_numTriangles;
indexbase := mesh.m_triangleIndexBase;
indexstride := mesh.m_triangleIndexStride;
-- indicestype := mesh.m_indexType;
-- type = mesh.m_vertexType;
end getLockedVertexIndexBase;
overriding procedure getLockedReadOnlyVertexIndexBase (Self : in Item; vertexbase : out impact.d3.Containers.real_Pointer;
numverts : out Integer;
stride : out Integer;
indexbase : out swig.Pointers.unsigned_Pointer; -- unsigned_char_Pointer;
indexstride : out Integer;
numfaces : out Integer;
subpart : in Integer := 0)
is
mesh : btIndexedMesh renames Self.m_indexedMeshes (subpart);
begin
numverts := mesh.m_numVertices;
vertexbase := mesh.m_vertexBase;
-- type = mesh.m_vertexType;
Stride := mesh.m_vertexStride;
numfaces := mesh.m_numTriangles;
indexbase := mesh.m_triangleIndexBase;
indexstride := mesh.m_triangleIndexStride;
-- indicestype := mesh.m_indexType;
end getLockedReadOnlyVertexIndexBase;
overriding procedure unLockVertexBase (Self : in out Item; subpart : in Integer)
is
pragma Unreferenced (Self, subpart);
begin
return;
end unLockVertexBase;
overriding procedure unLockReadOnlyVertexBase (Self : in Item; subpart : in Integer)
is
pragma Unreferenced (Self, subpart);
begin
return;
end unLockReadOnlyVertexBase;
overriding procedure setPremadeAabb (Self : in out Item; aabbMin, aabbMax : in math.Vector_3)
is
begin
Self.m_aabbMin := aabbMin;
Self.m_aabbMax := aabbMax;
Self.m_hasAabb := True;
end setPremadeAabb;
overriding procedure getPremadeAabb (Self : in Item; aabbMin, aabbMax : out math.Vector_3)
is
begin
aabbMin := Self.m_aabbMin;
aabbMax := Self.m_aabbMax;
end getPremadeAabb;
overriding function hasPremadeAabb (Self : in Item) return Boolean
is
begin
return Self.m_hasAabb;
end hasPremadeAabb;
end impact.d3.striding_Mesh.triangle_index_vertex_array;
-- Just to be backwards compatible ...
--
-- impact.d3.striding_Mesh.triangle_index_vertex_array::impact.d3.striding_Mesh.triangle_index_vertex_array(int numTriangles,int* triangleIndexBase,int triangleIndexStride,int numVertices,impact.d3.Scalar* vertexBase,int vertexStride)
-- : m_hasAabb(0)
-- {
-- btIndexedMesh mesh;
--
-- mesh.m_numTriangles = numTriangles;
-- mesh.m_triangleIndexBase = (const unsigned char *)triangleIndexBase;
-- mesh.m_triangleIndexStride = triangleIndexStride;
-- mesh.m_numVertices = numVertices;
-- mesh.m_vertexBase = (const unsigned char *)vertexBase;
-- mesh.m_vertexStride = vertexStride;
--
-- addIndexedMesh(mesh);
--
-- }
| 25.08 | 235 | 0.583333 |
d0dd5b8dec960d1e9e618acbf83b2870bee70d58 | 3,590 | adb | Ada | word_lists.adb | cborao/Ada-P1-words | cd7efda343b9321062455061bd565bf66f275272 | [
"MIT"
] | null | null | null | word_lists.adb | cborao/Ada-P1-words | cd7efda343b9321062455061bd565bf66f275272 | [
"MIT"
] | null | null | null | word_lists.adb | cborao/Ada-P1-words | cd7efda343b9321062455061bd565bf66f275272 | [
"MIT"
] | null | null | null | with Ada.Text_IO;
with Ada.Unchecked_Deallocation;
package body Word_Lists is
procedure Add_Word (List: in out Word_List_Type;
Word: in ASU.Unbounded_String) is
Aux: Word_List_Type;
Included: Boolean;
begin
Included := False;
if List = null then
List := new Cell;
List.Word := Word;
List.Count := List.Count + 1;
Aux := List;
Included := True;
else
Aux := List;
-- La segunda palabra es igual a la primera
if ASU.To_String(List.Word) = ASU.To_String(Word) then
List.Count := List.Count + 1;
Included := True;
end if;
--Recorre la lista
while Aux.Next /= null and not Included loop
--Ada.Text_IO.Put_Line ("entra en bucle");
if ASU.To_String(Aux.Word) = ASU.To_String(Word) then
Aux.Count := Aux.Count + 1;
Included := True;
end if;
Aux := Aux.Next;
end loop;
--Recorre la última celda de la lista
if Aux.Next = null and not Included then
if ASU.To_String(Aux.Word) = ASU.To_String(Word) then
Aux.Count := Aux.Count + 1;
Included := True;
end if;
end if;
--Si no está en la lista, añade una celda
if not Included then
Aux.Next := new Cell;
Aux := Aux.Next;
Aux.Word := Word;
Aux.Count := Aux.Count + 1;
end if;
end if;
end Add_Word;
procedure Delete_Word (List: in out Word_List_Type;
Word: in ASU.Unbounded_String) is
Aux: Word_List_Type;
Previous: Word_List_Type;
Found: Boolean;
procedure Free is new Ada.Unchecked_Deallocation (Cell, Word_List_Type);
begin
Found := False;
Aux := List;
Previous := Aux;
while Aux /= null loop
if ASU.To_String(Previous.Word) = ASU.To_String(Word) then
List := List.Next;
Free(Aux);
Found := True;
elsif ASU.To_String(Aux.Word) = ASU.To_String(Word) then
Previous.Next := Aux.Next;
Free(Aux);
Found := True;
else
Previous := Aux;
Aux := Aux.Next;
end if;
end loop;
if not Found then
raise Word_List_Error;
end if;
end Delete_Word;
procedure Search_Word (List: in Word_List_Type;
Word: in ASU.Unbounded_String;
Count: out Natural) is
Finder: Word_List_Type;
Found: Boolean;
begin
Finder := List;
Count := 0;
Found := False;
while Finder /= null loop
if ASU.To_String(Finder.Word) = ASU.To_String(Word) then
Count := Finder.Count;
Found := True;
end if;
Finder := Finder.Next;
end loop;
if not Found then
raise Word_List_Error;
end if;
end Search_Word;
procedure Max_Word (List: in Word_List_Type;
Word: out ASU.Unbounded_String;
Count: out Natural) is
Maxim: Word_List_Type;
begin
Maxim := List;
Count := 0;
while Maxim.next /= null loop
if Maxim.Count > Count then
Count := Maxim.Count;
Word := Maxim.Word;
end if;
Maxim := Maxim.Next;
end loop;
if Maxim.Next = null and Maxim.Count > Count then
Count := Maxim.Count;
Word := Maxim.Word;
end if;
exception
--Si no hay ninguna palabra
when Constraint_Error =>
Ada.Text_IO.Put_Line("No words.");
end Max_Word;
procedure Print_All (List: in Word_List_Type) is
Printer : Word_List_Type;
Printed : Boolean;
begin
Printer := List;
Printed := False;
Ada.Text_IO.New_Line;
while Printer /= null loop
Ada.Text_IO.Put("|" & ASU.To_String(Printer.Word) & "| - " );
Ada.Text_IO.Put_Line(Integer'Image(Printer.Count));
Printed := True;
Printer := Printer.Next;
end loop;
if not Printed then
Ada.Text_IO.Put_Line("No words.");
end if;
end Print_All;
end Word_Lists;
| 19.301075 | 74 | 0.639554 |
fbcc30e0eed4da5812e1723ffb9e881382c4a783 | 220 | ada | Ada | Task/Sorting-algorithms-Shell-sort/Ada/sorting-algorithms-shell-sort-1.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:38.000Z | 2018-11-09T22:08:38.000Z | Task/Sorting-algorithms-Shell-sort/Ada/sorting-algorithms-shell-sort-1.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/Sorting-algorithms-Shell-sort/Ada/sorting-algorithms-shell-sort-1.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:40.000Z | 2018-11-09T22:08:40.000Z | generic
type Element_Type is digits <>;
type Index_Type is (<>);
type Array_Type is array(Index_Type range <>) of Element_Type;
package Shell_Sort is
procedure Sort(Item : in out Array_Type);
end Shell_Sort;
| 27.5 | 65 | 0.731818 |
1ca199623f5a4fba403d1ad8446e9bd0622a0fe1 | 6,020 | ads | Ada | source/amf/uml/amf-umldi-uml_class_or_composite_structure_diagrams-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-umldi-uml_class_or_composite_structure_diagrams-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-umldi-uml_class_or_composite_structure_diagrams-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Generic_Collections;
package AMF.UMLDI.UML_Class_Or_Composite_Structure_Diagrams.Collections is
pragma Preelaborate;
package UMLDI_UML_Class_Or_Composite_Structure_Diagram_Collections is
new AMF.Generic_Collections
(UMLDI_UML_Class_Or_Composite_Structure_Diagram,
UMLDI_UML_Class_Or_Composite_Structure_Diagram_Access);
type Set_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram is
new UMLDI_UML_Class_Or_Composite_Structure_Diagram_Collections.Set with null record;
Empty_Set_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram : constant Set_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram;
type Ordered_Set_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram is
new UMLDI_UML_Class_Or_Composite_Structure_Diagram_Collections.Ordered_Set with null record;
Empty_Ordered_Set_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram : constant Ordered_Set_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram;
type Bag_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram is
new UMLDI_UML_Class_Or_Composite_Structure_Diagram_Collections.Bag with null record;
Empty_Bag_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram : constant Bag_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram;
type Sequence_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram is
new UMLDI_UML_Class_Or_Composite_Structure_Diagram_Collections.Sequence with null record;
Empty_Sequence_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram : constant Sequence_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram;
private
Empty_Set_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram : constant Set_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram
:= (UMLDI_UML_Class_Or_Composite_Structure_Diagram_Collections.Set with null record);
Empty_Ordered_Set_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram : constant Ordered_Set_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram
:= (UMLDI_UML_Class_Or_Composite_Structure_Diagram_Collections.Ordered_Set with null record);
Empty_Bag_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram : constant Bag_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram
:= (UMLDI_UML_Class_Or_Composite_Structure_Diagram_Collections.Bag with null record);
Empty_Sequence_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram : constant Sequence_Of_UMLDI_UML_Class_Or_Composite_Structure_Diagram
:= (UMLDI_UML_Class_Or_Composite_Structure_Diagram_Collections.Sequence with null record);
end AMF.UMLDI.UML_Class_Or_Composite_Structure_Diagrams.Collections;
| 65.434783 | 144 | 0.598173 |
fb60f704792d90831f98f35990325abd6c835b37 | 3,859 | ads | Ada | unicode-ucd-generate_normalization_quick_check_body.ads | annexi-strayline/ASAP-Unicode | a34b52c41378c3cfe777e59bfee634caa64767d6 | [
"BSD-3-Clause"
] | 1 | 2021-11-08T01:20:55.000Z | 2021-11-08T01:20:55.000Z | unicode-ucd-generate_normalization_quick_check_body.ads | annexi-strayline/ASAP-Unicode | a34b52c41378c3cfe777e59bfee634caa64767d6 | [
"BSD-3-Clause"
] | null | null | null | unicode-ucd-generate_normalization_quick_check_body.ads | annexi-strayline/ASAP-Unicode | a34b52c41378c3cfe777e59bfee634caa64767d6 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Unicode Utilities --
-- --
-- Normalization Form Utilities --
-- Quick Check Query Facilities --
-- --
-- ------------------------------------------------------------------------ --
-- --
-- Copyright (C) 2019, ANNEXI-STRAYLINE Trans-Human Ltd. --
-- All rights reserved. --
-- --
-- Original Contributors: --
-- * Richard Wai (ANNEXI-STRAYLINE) --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- --
-- * Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A --
-- PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- This unit parses UnicodeData.txt to generate the subprogram bodies for
-- the normalization quick check units.
generic
Form_Code: in String; -- E.g. "C", "KC"
NormProps_Path: in String := "DerivedNormalizationProps.txt";
Body_Path : in String;
-- note The Body file is open in Create mode.
procedure Unicode.UCD.Generate_Normalization_Quick_Check_Body;
| 65.40678 | 78 | 0.418502 |
102add8a498fd6b491a9a6270d71bd28aa858a52 | 9,417 | ads | Ada | source/amf/uml/amf-internals-uml_includes.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-internals-uml_includes.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-internals-uml_includes.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.Internals.UML_Named_Elements;
with AMF.UML.Dependencies.Collections;
with AMF.UML.Elements.Collections;
with AMF.UML.Includes;
with AMF.UML.Named_Elements;
with AMF.UML.Namespaces;
with AMF.UML.Packages.Collections;
with AMF.UML.String_Expressions;
with AMF.UML.Use_Cases;
with AMF.Visitors;
package AMF.Internals.UML_Includes is
type UML_Include_Proxy is
limited new AMF.Internals.UML_Named_Elements.UML_Named_Element_Proxy
and AMF.UML.Includes.UML_Include with null record;
overriding function Get_Addition
(Self : not null access constant UML_Include_Proxy)
return AMF.UML.Use_Cases.UML_Use_Case_Access;
-- Getter of Include::addition.
--
-- References the use case that is to be included.
overriding procedure Set_Addition
(Self : not null access UML_Include_Proxy;
To : AMF.UML.Use_Cases.UML_Use_Case_Access);
-- Setter of Include::addition.
--
-- References the use case that is to be included.
overriding function Get_Including_Case
(Self : not null access constant UML_Include_Proxy)
return AMF.UML.Use_Cases.UML_Use_Case_Access;
-- Getter of Include::includingCase.
--
-- References the use case which will include the addition and owns the
-- include relationship.
overriding procedure Set_Including_Case
(Self : not null access UML_Include_Proxy;
To : AMF.UML.Use_Cases.UML_Use_Case_Access);
-- Setter of Include::includingCase.
--
-- References the use case which will include the addition and owns the
-- include relationship.
overriding function Get_Source
(Self : not null access constant UML_Include_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element;
-- Getter of DirectedRelationship::source.
--
-- Specifies the sources of the DirectedRelationship.
overriding function Get_Target
(Self : not null access constant UML_Include_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element;
-- Getter of DirectedRelationship::target.
--
-- Specifies the targets of the DirectedRelationship.
overriding function Get_Related_Element
(Self : not null access constant UML_Include_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element;
-- Getter of Relationship::relatedElement.
--
-- Specifies the elements related by the Relationship.
overriding function Get_Client_Dependency
(Self : not null access constant UML_Include_Proxy)
return AMF.UML.Dependencies.Collections.Set_Of_UML_Dependency;
-- Getter of NamedElement::clientDependency.
--
-- Indicates the dependencies that reference the client.
overriding function Get_Name_Expression
(Self : not null access constant UML_Include_Proxy)
return AMF.UML.String_Expressions.UML_String_Expression_Access;
-- Getter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding procedure Set_Name_Expression
(Self : not null access UML_Include_Proxy;
To : AMF.UML.String_Expressions.UML_String_Expression_Access);
-- Setter of NamedElement::nameExpression.
--
-- The string expression used to define the name of this named element.
overriding function Get_Namespace
(Self : not null access constant UML_Include_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Getter of NamedElement::namespace.
--
-- Specifies the namespace that owns the NamedElement.
overriding function Get_Qualified_Name
(Self : not null access constant UML_Include_Proxy)
return AMF.Optional_String;
-- Getter of NamedElement::qualifiedName.
--
-- A name which allows the NamedElement to be identified within a
-- hierarchy of nested Namespaces. It is constructed from the names of the
-- containing namespaces starting at the root of the hierarchy and ending
-- with the name of the NamedElement itself.
overriding function All_Owning_Packages
(Self : not null access constant UML_Include_Proxy)
return AMF.UML.Packages.Collections.Set_Of_UML_Package;
-- Operation NamedElement::allOwningPackages.
--
-- The query allOwningPackages() returns all the directly or indirectly
-- owning packages.
overriding function Is_Distinguishable_From
(Self : not null access constant UML_Include_Proxy;
N : AMF.UML.Named_Elements.UML_Named_Element_Access;
Ns : AMF.UML.Namespaces.UML_Namespace_Access)
return Boolean;
-- Operation NamedElement::isDistinguishableFrom.
--
-- The query isDistinguishableFrom() determines whether two NamedElements
-- may logically co-exist within a Namespace. By default, two named
-- elements are distinguishable if (a) they have unrelated types or (b)
-- they have related types but different names.
overriding function Namespace
(Self : not null access constant UML_Include_Proxy)
return AMF.UML.Namespaces.UML_Namespace_Access;
-- Operation NamedElement::namespace.
--
-- Missing derivation for NamedElement::/namespace : Namespace
overriding procedure Enter_Element
(Self : not null access constant UML_Include_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Leave_Element
(Self : not null access constant UML_Include_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of visitor interface.
overriding procedure Visit_Element
(Self : not null access constant UML_Include_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
-- Dispatch call to corresponding subprogram of iterator interface.
end AMF.Internals.UML_Includes;
| 47.80203 | 78 | 0.619306 |
20fb76a50eb2e5b61ee5124dc2c94977b317116c | 1,113 | adb | Ada | src/stbiwrapper.adb | sebsgit/textproc | 2f12d6a030425e937ee0c6a67dcff6828fc1331f | [
"MIT"
] | null | null | null | src/stbiwrapper.adb | sebsgit/textproc | 2f12d6a030425e937ee0c6a67dcff6828fc1331f | [
"MIT"
] | null | null | null | src/stbiwrapper.adb | sebsgit/textproc | 2f12d6a030425e937ee0c6a67dcff6828fc1331f | [
"MIT"
] | null | null | null | package body StbiWrapper is
function load(filename: C.Strings.chars_ptr; x: IntPtr.Pointer; y: IntPtr.Pointer; channels_in_file: IntPtr.Pointer; desired_channels: C.int) return UCharPtr.Pointer
with
import => True,
Convention => C,
External_Name => "stbi_load";
procedure free(ptr: UCharPtr.Pointer)
with
Import => True,
Convention => C,
External_Name => "stbi_image_free";
function load(filename: C.Strings.chars_ptr; desired_channels: C.int := 3) return ImageData
is
result: ImageData;
x, y, channels: aliased C.int;
begin
result.pixels := load(filename, x'Unchecked_Access, y'Unchecked_Access, channels'Unchecked_Access, desired_channels);
result.width := x;
result.height := y;
result.nChannels := channels;
return result;
end load;
procedure free(data: ImageData) is
begin
free(data.pixels);
end free;
function check(data: ImageData) return Boolean
is
begin
return data.width > 0 and data.height > 0 and data.nChannels in 1 .. 4;
end check;
end StbiWrapper;
| 29.289474 | 168 | 0.667565 |
10a2d7428bc643471fb590c84d94449b7ea011f6 | 1,436 | ads | Ada | resources/scripts/api/spyse.ads | mehrdad-shokri/amass | bf4df987c63d0509bf3e94cba2e4448855fc0805 | [
"Apache-2.0"
] | 1 | 2021-03-27T09:57:11.000Z | 2021-03-27T09:57:11.000Z | resources/scripts/api/spyse.ads | rishuranjanofficial/Amass | a7e3d07febafae6220032121a1b1c4f508e16ec0 | [
"Apache-2.0"
] | null | null | null | resources/scripts/api/spyse.ads | rishuranjanofficial/Amass | a7e3d07febafae6220032121a1b1c4f508e16ec0 | [
"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 = "Spyse"
type = "api"
function start()
setratelimit(2)
end
function vertical(ctx, domain)
if (api == nil or api.key == "") then
return
end
local resp
local vurl = buildurl(domain)
-- Check if the response data is in the graph database
if (api.ttl ~= nil and api.ttl > 0) then
resp = obtain_response(vurl, api.ttl)
end
if (resp == nil or resp == "") then
local err
resp, err = request({
url=vurl,
headers={['Authorization']="Bearer " .. api.key},
})
if (err ~= nil and err ~= "") then
return
end
if (api.ttl ~= nil and api.ttl > 0) then
cache_response(vurl, resp)
end
end
local d = json.decode(resp)
if (d == nil or #(d['data'].items) == 0) then
return
end
for i, item in pairs(d['data'].items) do
sendnames(ctx, item.name)
end
end
function buildurl(domain)
return "https://api.spyse.com/v3/data/domain/subdomain?limit=100&domain=" .. domain
end
function sendnames(ctx, content)
local names = find(content, subdomainre)
if names == nil then
return
end
for i, v in pairs(names) do
newname(ctx, v)
end
end
| 22.092308 | 97 | 0.581476 |
df45dd579246b6667667c21832e2d93a4e2a7369 | 12,455 | ads | Ada | arch/ARM/STM32/svd/stm32l4x3/stm32_svd-gpio.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2018-05-16T03:56:39.000Z | 2019-07-31T13:53:56.000Z | arch/ARM/STM32/svd/stm32l4x3/stm32_svd-gpio.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | arch/ARM/STM32/svd/stm32l4x3/stm32_svd-gpio.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | -- This spec has been automatically generated from STM32L4x3.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.GPIO is
pragma Preelaborate;
---------------
-- Registers --
---------------
-- MODER array element
subtype MODER_Element is HAL.UInt2;
-- MODER array
type MODER_Field_Array is array (0 .. 15) of MODER_Element
with Component_Size => 2, Size => 32;
-- GPIO port mode register
type MODER_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- MODER as a value
Val : HAL.UInt32;
when True =>
-- MODER as an array
Arr : MODER_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for MODER_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- OTYPER_OT array
type OTYPER_OT_Field_Array is array (0 .. 15) of Boolean
with Component_Size => 1, Size => 16;
-- Type definition for OTYPER_OT
type OTYPER_OT_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- OT as a value
Val : HAL.UInt16;
when True =>
-- OT as an array
Arr : OTYPER_OT_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for OTYPER_OT_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- GPIO port output type register
type OTYPER_Register is record
-- Port x configuration bits (y = 0..15)
OT : OTYPER_OT_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for OTYPER_Register use record
OT at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- OSPEEDR array element
subtype OSPEEDR_Element is HAL.UInt2;
-- OSPEEDR array
type OSPEEDR_Field_Array is array (0 .. 15) of OSPEEDR_Element
with Component_Size => 2, Size => 32;
-- GPIO port output speed register
type OSPEEDR_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- OSPEEDR as a value
Val : HAL.UInt32;
when True =>
-- OSPEEDR as an array
Arr : OSPEEDR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for OSPEEDR_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- PUPDR array element
subtype PUPDR_Element is HAL.UInt2;
-- PUPDR array
type PUPDR_Field_Array is array (0 .. 15) of PUPDR_Element
with Component_Size => 2, Size => 32;
-- GPIO port pull-up/pull-down register
type PUPDR_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- PUPDR as a value
Val : HAL.UInt32;
when True =>
-- PUPDR as an array
Arr : PUPDR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for PUPDR_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- IDR array
type IDR_Field_Array is array (0 .. 15) of Boolean
with Component_Size => 1, Size => 16;
-- Type definition for IDR
type IDR_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- IDR as a value
Val : HAL.UInt16;
when True =>
-- IDR as an array
Arr : IDR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for IDR_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- GPIO port input data register
type IDR_Register is record
-- Read-only. Port input data (y = 0..15)
IDR : IDR_Field;
-- unspecified
Reserved_16_31 : HAL.UInt16;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for IDR_Register use record
IDR at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- ODR array
type ODR_Field_Array is array (0 .. 15) of Boolean
with Component_Size => 1, Size => 16;
-- Type definition for ODR
type ODR_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- ODR as a value
Val : HAL.UInt16;
when True =>
-- ODR as an array
Arr : ODR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for ODR_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- GPIO port output data register
type ODR_Register is record
-- Port output data (y = 0..15)
ODR : ODR_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ODR_Register use record
ODR at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- BSRR_BS array
type BSRR_BS_Field_Array is array (0 .. 15) of Boolean
with Component_Size => 1, Size => 16;
-- Type definition for BSRR_BS
type BSRR_BS_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- BS as a value
Val : HAL.UInt16;
when True =>
-- BS as an array
Arr : BSRR_BS_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for BSRR_BS_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- BSRR_BR array
type BSRR_BR_Field_Array is array (0 .. 15) of Boolean
with Component_Size => 1, Size => 16;
-- Type definition for BSRR_BR
type BSRR_BR_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- BR as a value
Val : HAL.UInt16;
when True =>
-- BR as an array
Arr : BSRR_BR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for BSRR_BR_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- GPIO port bit set/reset register
type BSRR_Register is record
-- Write-only. Port x set bit y (y= 0..15)
BS : BSRR_BS_Field := (As_Array => False, Val => 16#0#);
-- Write-only. Port x set bit y (y= 0..15)
BR : BSRR_BR_Field := (As_Array => False, Val => 16#0#);
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for BSRR_Register use record
BS at 0 range 0 .. 15;
BR at 0 range 16 .. 31;
end record;
-- LCKR_LCK array
type LCKR_LCK_Field_Array is array (0 .. 15) of Boolean
with Component_Size => 1, Size => 16;
-- Type definition for LCKR_LCK
type LCKR_LCK_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- LCK as a value
Val : HAL.UInt16;
when True =>
-- LCK as an array
Arr : LCKR_LCK_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for LCKR_LCK_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- GPIO port configuration lock register
type LCKR_Register is record
-- Port x lock bit y (y= 0..15)
LCK : LCKR_LCK_Field := (As_Array => False, Val => 16#0#);
-- Port x lock bit y (y= 0..15)
LCKK : Boolean := False;
-- unspecified
Reserved_17_31 : HAL.UInt15 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for LCKR_Register use record
LCK at 0 range 0 .. 15;
LCKK at 0 range 16 .. 16;
Reserved_17_31 at 0 range 17 .. 31;
end record;
-- AFRL array element
subtype AFRL_Element is HAL.UInt4;
-- AFRL array
type AFRL_Field_Array is array (0 .. 7) of AFRL_Element
with Component_Size => 4, Size => 32;
-- GPIO alternate function low register
type AFRL_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- AFRL as a value
Val : HAL.UInt32;
when True =>
-- AFRL as an array
Arr : AFRL_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for AFRL_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- AFRH array element
subtype AFRH_Element is HAL.UInt4;
-- AFRH array
type AFRH_Field_Array is array (8 .. 15) of AFRH_Element
with Component_Size => 4, Size => 32;
-- GPIO alternate function high register
type AFRH_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- AFRH as a value
Val : HAL.UInt32;
when True =>
-- AFRH as an array
Arr : AFRH_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for AFRH_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- General-purpose I/Os
type GPIO_Peripheral is record
-- GPIO port mode register
MODER : aliased MODER_Register;
-- GPIO port output type register
OTYPER : aliased OTYPER_Register;
-- GPIO port output speed register
OSPEEDR : aliased OSPEEDR_Register;
-- GPIO port pull-up/pull-down register
PUPDR : aliased PUPDR_Register;
-- GPIO port input data register
IDR : aliased IDR_Register;
-- GPIO port output data register
ODR : aliased ODR_Register;
-- GPIO port bit set/reset register
BSRR : aliased BSRR_Register;
-- GPIO port configuration lock register
LCKR : aliased LCKR_Register;
-- GPIO alternate function low register
AFRL : aliased AFRL_Register;
-- GPIO alternate function high register
AFRH : aliased AFRH_Register;
end record
with Volatile;
for GPIO_Peripheral use record
MODER at 16#0# range 0 .. 31;
OTYPER at 16#4# range 0 .. 31;
OSPEEDR at 16#8# range 0 .. 31;
PUPDR at 16#C# range 0 .. 31;
IDR at 16#10# range 0 .. 31;
ODR at 16#14# range 0 .. 31;
BSRR at 16#18# range 0 .. 31;
LCKR at 16#1C# range 0 .. 31;
AFRL at 16#20# range 0 .. 31;
AFRH at 16#24# range 0 .. 31;
end record;
-- General-purpose I/Os
GPIOA_Periph : aliased GPIO_Peripheral
with Import, Address => GPIOA_Base;
-- General-purpose I/Os
GPIOB_Periph : aliased GPIO_Peripheral
with Import, Address => GPIOB_Base;
-- General-purpose I/Os
GPIOC_Periph : aliased GPIO_Peripheral
with Import, Address => GPIOC_Base;
-- General-purpose I/Os
GPIOD_Periph : aliased GPIO_Peripheral
with Import, Address => GPIOD_Base;
-- General-purpose I/Os
GPIOE_Periph : aliased GPIO_Peripheral
with Import, Address => GPIOE_Base;
-- General-purpose I/Os
GPIOH_Periph : aliased GPIO_Peripheral
with Import, Address => GPIOH_Base;
end STM32_SVD.GPIO;
| 27.926009 | 79 | 0.586271 |
0e1a16f933e6802672dcfe4d0b1d898da90b3e66 | 2,873 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/s-finroo.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-finroo.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/s-finroo.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 . F I N A L I Z A T I O N _ R O O T --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2012, 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 unit provides the basic support for controlled (finalizable) types
package System.Finalization_Root is
pragma Preelaborate;
-- The base for types Controlled and Limited_Controlled declared in Ada.
-- Finalization.
type Root_Controlled is abstract tagged null record;
procedure Adjust (Object : in out Root_Controlled);
procedure Finalize (Object : in out Root_Controlled);
procedure Initialize (Object : in out Root_Controlled);
end System.Finalization_Root;
| 61.12766 | 78 | 0.437174 |
10d71c4e036f3861d4b9b5247afecefe71eee98f | 657 | ada | Ada | examples/Ada/psenvpub.ada | dcramer/zguide | a07fe97c4c597e6401b4281ae07c3a156590f4c6 | [
"Zed",
"X11",
"MIT"
] | 2 | 2015-09-24T19:53:04.000Z | 2015-11-06T10:22:53.000Z | examples/Ada/psenvpub.ada | gaubert/zguide | e24c02481c47b129a37f261d1109140572f255f4 | [
"Zed",
"X11",
"MIT"
] | null | null | null | examples/Ada/psenvpub.ada | gaubert/zguide | e24c02481c47b129a37f261d1109140572f255f4 | [
"Zed",
"X11",
"MIT"
] | null | null | null | No-one has translated the psenvpub example into Ada yet. Be the first to create
psenvpub in Ada and get one free Internet! If you're the author of the Ada
binding, this is a great way to get people to use 0MQ in Ada.
To submit a new translation email it to [email protected]. Please:
* Stick to identical functionality and naming used in examples so that readers
can easily compare languages.
* You MUST place your name as author in the examples so readers can contact you.
* You MUST state in the email that you license your code under the MIT/X11
license.
Subscribe to this list at http://lists.zeromq.org/mailman/listinfo/zeromq-dev.
| 46.928571 | 80 | 0.776256 |
105285c9913d375775b9d6688e6414ad1b3cc255 | 3,019 | ads | Ada | linear_algebra/bidiagonal.ads | jscparker/math_packages | b112a90338014d5c2dfae3f7265ee30841fb6cfd | [
"ISC",
"MIT"
] | 30 | 2018-12-09T01:15:04.000Z | 2022-03-20T16:14:54.000Z | linear_algebra/bidiagonal.ads | jscparker/math_packages | b112a90338014d5c2dfae3f7265ee30841fb6cfd | [
"ISC",
"MIT"
] | null | null | null | linear_algebra/bidiagonal.ads | jscparker/math_packages | b112a90338014d5c2dfae3f7265ee30841fb6cfd | [
"ISC",
"MIT"
] | null | null | null |
--
-- procedure Bi_Diagonalize
--
-- Transforms matrix A into bi-diagonal matrix B,
--
-- U' * A * V = B
--
-- The diagonal and superdiagonals of B are non-zero. All other elements
-- of B are zero.
--
-- U and V are orthogonal matrices - constructed from the products of 2 x 2
-- Givens rotation matrices. Here, U matrix has the same shape as A, and V
-- is a square matrix with the same number of columns a A. (V has the same
-- shape as A'*A = A_transpose * A.)
--
-- Can have more Rows than Columns, but not more Columns than Rows.
--
generic
type Real is digits <>;
type Col_Index is range <>;
type Row_Index is range <>;
-- Must have Col_Index'First = Row_Index'First. This is checked.
-- (Want the diagonal to be A(i, i).)
type A_Matrix is array(Row_Index, Col_Index) of Real;
type U_Matrix is array(Row_Index, Row_Index) of Real;
type V_Matrix is array(Col_Index, Col_Index) of Real;
package Bidiagonal is
function U_Identity return U_Matrix;
function V_Identity return V_Matrix;
-- Row_Index must contain Col_Index in its range:
pragma Assert (Row_Index (Col_Index'First) >= Row_Index'First);
pragma Assert (Row_Index (Col_Index'Last) <= Row_Index'Last);
-- A is the matrix to be transformed with a series of Givens rotations:
-- A = U * B * V'. U and V are orthogonal matrices.
--
-- The procedure only operates on square matrices, or matrices with more
-- rows than columns.
--
-- Procedure checks: pragma Assert (No_of_Rows >= No_of_Cols);
--
-- Initial_V_Matrix = Identity, unless you preprocessed A with an L*Q
-- transform, in which case Initial_V_Matrix = Q, and use L for argument A.
--
-- Starting_Row is set to Starting_Col:
procedure Bi_Diagonalize
(A : in out A_Matrix; -- A becomes the B in A = U * B * V'
V : out V_Matrix; -- Need to input Initial_V_Matrix below.
U : out U_Matrix; -- Initialized with Identity.
Initial_V_Matrix : in V_Matrix; -- Normally must use function V_Identity.
Initial_U_Matrix : in U_Matrix; -- Normally just use function U_Identity.
Starting_Col : in Col_Index := Col_Index'First;
Final_Col : in Col_Index := Col_Index'Last;
Final_Row : in Row_Index := Row_Index'Last;
Matrix_U_Desired : in Boolean := True;
Matrix_V_Desired : in Boolean := True);
procedure Zero_Shift_Bidiagonal_QR
(A : in out A_Matrix; -- A becomes the B in A = U * B * V'
V : in out V_Matrix; --
U : in out U_Matrix; -- Initialized with Identity
Starting_Col : in Col_Index := Col_Index'First;
Final_Col : in Col_Index := Col_Index'Last;
Final_Row : in Row_Index := Row_Index'Last;
Matrix_U_Desired : in Boolean := True;
Matrix_V_Desired : in Boolean := True);
end Bidiagonal;
| 36.817073 | 84 | 0.629347 |
23d174faf3ff8b17583308d78832297c53abb0bb | 2,832 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-traent.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-traent.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-traent.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . T R A C E B A C K _ E N T R I E S --
-- --
-- B o d y --
-- --
-- Copyright (C) 2003-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. --
-- --
------------------------------------------------------------------------------
pragma Compiler_Unit_Warning;
package body System.Traceback_Entries is
------------
-- PC_For --
------------
function PC_For (TB_Entry : Traceback_Entry) return System.Address is
begin
return TB_Entry;
end PC_For;
------------------
-- TB_Entry_For --
------------------
function TB_Entry_For (PC : System.Address) return Traceback_Entry is
begin
return PC;
end TB_Entry_For;
end System.Traceback_Entries;
| 51.490909 | 78 | 0.407133 |
fb07a0a4bec812dda63299b960a1ce713dd4b1d8 | 2,710 | ads | Ada | boards/MicroBit/src/microbit-display.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2018-05-16T03:56:39.000Z | 2019-07-31T13:53:56.000Z | boards/MicroBit/src/microbit-display.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | boards/MicroBit/src/microbit-display.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2016, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
package MicroBit.Display is
subtype Coord is Natural range 0 .. 4;
procedure Set (X, Y : Coord);
-- Set one pixels
procedure Clear (X, Y : Coord);
-- Clear one pixels
procedure Clear;
-- Clear all the pixels
procedure Display (C : Character);
-- Display a character on the screen
end MicroBit.Display;
| 55.306122 | 78 | 0.521033 |
20db54616aba99f60be031501de3c61b6cc99160 | 322 | ads | Ada | resources/scripts/archive/archivetoday.ads | hartley94ad/Amass | 7bce52e401398e6c218ce53fe356dc524b058a49 | [
"Apache-2.0"
] | 1 | 2021-02-22T11:57:22.000Z | 2021-02-22T11:57:22.000Z | resources/scripts/archive/archivetoday.ads | hartley94ad/Amass | 7bce52e401398e6c218ce53fe356dc524b058a49 | [
"Apache-2.0"
] | null | null | null | resources/scripts/archive/archivetoday.ads | hartley94ad/Amass | 7bce52e401398e6c218ce53fe356dc524b058a49 | [
"Apache-2.0"
] | null | null | null | -- Copyright 2017-2021 Jeff Foley. All rights reserved.
-- Use of this source code is governed by Apache 2 LICENSE that can be found in the LICENSE file.
name = "ArchiveToday"
type = "archive"
function start()
setratelimit(5)
end
function vertical(ctx, domain)
scrape(ctx, "http://archive.is/*." .. domain)
end
| 23 | 97 | 0.714286 |
206f219ae6e3824f143fd54d8fdd9d9bd7c6f15a | 14,162 | adb | Ada | source/amf/mof/amf.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/mof/amf.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/mof/amf.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 © 2010-2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
package body AMF is
use type League.Strings.Universal_String;
---------
-- "<" --
---------
function "<"
(Left : Optional_String; Right : Optional_String) return Boolean is
begin
if Left.Is_Empty xor Right.Is_Empty then
return Left.Is_Empty;
elsif Left.Is_Empty or Right.Is_Empty then
return False;
else
return Left.Value < Right.Value;
end if;
end "<";
---------
-- "<" --
---------
function "<"
(Left : Optional_String;
Right : League.Strings.Universal_String) return Boolean is
begin
if Left.Is_Empty then
return True;
else
return Left.Value < Right;
end if;
end "<";
---------
-- "<" --
---------
function "<"
(Left : League.Strings.Universal_String;
Right : Optional_String) return Boolean is
begin
if Right.Is_Empty then
return False;
else
return Left < Right.Value;
end if;
end "<";
---------
-- "<" --
---------
function "<"
(Left : Unlimited_Natural; Right : Unlimited_Natural) return Boolean is
begin
if Left.Unlimited xor Right.Unlimited then
return Left.Unlimited < Right.Unlimited;
elsif Left.Unlimited or Right.Unlimited then
return False;
else
return Left.Value < Right.Value;
end if;
end "<";
---------
-- "<" --
---------
function "<" (Left : Unlimited_Natural; Right : Integer) return Boolean is
begin
if Left.Unlimited then
return False;
else
return Left.Value < Right;
end if;
end "<";
---------
-- "<" --
---------
function "<" (Left : Integer; Right : Unlimited_Natural) return Boolean is
begin
if Right.Unlimited then
return True;
else
return Left < Right.Value;
end if;
end "<";
----------
-- "<=" --
----------
function "<="
(Left : Optional_String; Right : Optional_String) return Boolean is
begin
if Left.Is_Empty xor Right.Is_Empty then
return Left.Is_Empty;
elsif Left.Is_Empty or Right.Is_Empty then
return True;
else
return Left.Value <= Right.Value;
end if;
end "<=";
----------
-- "<=" --
----------
function "<="
(Left : Optional_String;
Right : League.Strings.Universal_String) return Boolean is
begin
if Left.Is_Empty then
return True;
else
return Left.Value <= Right;
end if;
end "<=";
----------
-- "<=" --
----------
function "<="
(Left : League.Strings.Universal_String;
Right : Optional_String) return Boolean is
begin
if Right.Is_Empty then
return False;
else
return Left <= Right.Value;
end if;
end "<=";
----------
-- "<=" --
----------
function "<="
(Left : Unlimited_Natural; Right : Unlimited_Natural) return Boolean is
begin
if Left.Unlimited xor Right.Unlimited then
return Left.Unlimited < Right.Unlimited;
elsif Left.Unlimited or Right.Unlimited then
return True;
else
return Left.Value <= Right.Value;
end if;
end "<=";
----------
-- "<=" --
----------
function "<=" (Left : Unlimited_Natural; Right : Integer) return Boolean is
begin
if Left.Unlimited then
return False;
else
return Left.Value <= Right;
end if;
end "<=";
----------
-- "<=" --
----------
function "<=" (Left : Integer; Right : Unlimited_Natural) return Boolean is
begin
if Right.Unlimited then
return True;
else
return Left <= Right.Value;
end if;
end "<=";
---------
-- "=" --
---------
function "="
(Left : Optional_String; Right : Optional_String) return Boolean is
begin
if Left.Is_Empty xor Right.Is_Empty then
return False;
elsif Left.Is_Empty then
return True;
else
return Left.Value = Right.Value;
end if;
end "=";
---------
-- "=" --
---------
function "="
(Left : Optional_String;
Right : League.Strings.Universal_String) return Boolean is
begin
if Left.Is_Empty then
return False;
else
return Left.Value = Right;
end if;
end "=";
---------
-- "=" --
---------
function "="
(Left : League.Strings.Universal_String;
Right : Optional_String) return Boolean is
begin
if Right.Is_Empty then
return False;
else
return Left = Right.Value;
end if;
end "=";
---------
-- "=" --
---------
function "=" (Left : Integer; Right : Unlimited_Natural) return Boolean is
begin
return not Right.Unlimited and then Left = Right.Value;
end "=";
---------
-- "=" --
---------
function "=" (Left : Unlimited_Natural; Right : Integer) return Boolean is
begin
return not Left.Unlimited and then Left.Value = Right;
end "=";
---------
-- "=" --
---------
function "=" (Left : Optional_Integer; Right : Integer) return Boolean is
begin
return not Left.Is_Empty and then Left.Value = Right;
end "=";
---------
-- "=" --
---------
function "=" (Left : Integer; Right : Optional_Integer) return Boolean is
begin
return not Right.Is_Empty and then Left = Right.Value;
end "=";
---------
-- "=" --
---------
function "="
(Left : Optional_Unlimited_Natural;
Right : Unlimited_Natural) return Boolean is
begin
return not Left.Is_Empty and then Left.Value = Right;
end "=";
---------
-- "=" --
---------
function "="
(Left : Unlimited_Natural;
Right : Optional_Unlimited_Natural) return Boolean is
begin
return not Right.Is_Empty and then Left = Right.Value;
end "=";
---------
-- "=" --
---------
function "="
(Left : Optional_Unlimited_Natural;
Right : Optional_Integer) return Boolean is
begin
return
(Left.Is_Empty and Right.Is_Empty)
or (not Left.Is_Empty
and then not Right.Is_Empty
and then Left.Value = Right.Value);
end "=";
---------
-- "=" --
---------
function "="
(Left : Optional_Integer;
Right : Optional_Unlimited_Natural) return Boolean is
begin
return
(Left.Is_Empty and Right.Is_Empty)
or (not Left.Is_Empty
and then not Right.Is_Empty
and then Left.Value = Right.Value);
end "=";
---------
-- "=" --
---------
function "="
(Left : Optional_Unlimited_Natural; Right : Integer) return Boolean is
begin
return not Left.Is_Empty and then Left.Value = Right;
end "=";
---------
-- "=" --
---------
function "="
(Left : Integer; Right : Optional_Unlimited_Natural) return Boolean is
begin
return not Right.Is_Empty and then Left = Right.Value;
end "=";
---------
-- ">" --
---------
function ">"
(Left : Optional_String; Right : Optional_String) return Boolean is
begin
if Left.Is_Empty xor Right.Is_Empty then
return Right.Is_Empty;
elsif Left.Is_Empty or Right.Is_Empty then
return False;
else
return Left.Value > Right.Value;
end if;
end ">";
---------
-- ">" --
---------
function ">"
(Left : Optional_String;
Right : League.Strings.Universal_String) return Boolean is
begin
if Left.Is_Empty then
return False;
else
return Left.Value > Right;
end if;
end ">";
---------
-- ">" --
---------
function ">"
(Left : League.Strings.Universal_String;
Right : Optional_String) return Boolean is
begin
if Right.Is_Empty then
return True;
else
return Left > Right.Value;
end if;
end ">";
---------
-- ">" --
---------
function ">"
(Left : Unlimited_Natural; Right : Unlimited_Natural) return Boolean is
begin
if Left.Unlimited xor Right.Unlimited then
return Left.Unlimited > Right.Unlimited;
elsif Left.Unlimited or Right.Unlimited then
return False;
else
return Left.Value > Right.Value;
end if;
end ">";
---------
-- ">" --
---------
function ">" (Left : Unlimited_Natural; Right : Integer) return Boolean is
begin
if Left.Unlimited then
return True;
else
return Left.Value > Right;
end if;
end ">";
---------
-- ">" --
---------
function ">" (Left : Integer; Right : Unlimited_Natural) return Boolean is
begin
if Right.Unlimited then
return False;
else
return Left > Right.Value;
end if;
end ">";
----------
-- ">=" --
----------
function ">="
(Left : Optional_String; Right : Optional_String) return Boolean is
begin
if Left.Is_Empty xor Right.Is_Empty then
return Right.Is_Empty;
elsif Left.Is_Empty or Right.Is_Empty then
return True;
else
return Left.Value >= Right.Value;
end if;
end ">=";
----------
-- ">=" --
----------
function ">="
(Left : Optional_String;
Right : League.Strings.Universal_String) return Boolean is
begin
if Left.Is_Empty then
return False;
else
return Left.Value >= Right;
end if;
end ">=";
----------
-- ">=" --
----------
function ">="
(Left : League.Strings.Universal_String;
Right : Optional_String) return Boolean is
begin
if Right.Is_Empty then
return True;
else
return Left >= Right.Value;
end if;
end ">=";
----------
-- ">=" --
----------
function ">="
(Left : Unlimited_Natural; Right : Unlimited_Natural) return Boolean is
begin
if Left.Unlimited xor Right.Unlimited then
return Left.Unlimited > Right.Unlimited;
elsif Left.Unlimited or Right.Unlimited then
return True;
else
return Left.Value >= Right.Value;
end if;
end ">=";
----------
-- ">=" --
----------
function ">=" (Left : Unlimited_Natural; Right : Integer) return Boolean is
begin
if Left.Unlimited then
return True;
else
return Left.Value >= Right;
end if;
end ">=";
----------
-- ">=" --
----------
function ">=" (Left : Integer; Right : Unlimited_Natural) return Boolean is
begin
if Right.Unlimited then
return False;
else
return Left >= Right.Value;
end if;
end ">=";
end AMF;
| 23.922297 | 78 | 0.489196 |
1c3dfb505e90e72fb46c1ada364f730dae3bb656 | 4,402 | adb | Ada | bead/bead1/J_String_Pkg.adb | balintsoos/LearnAda | 9d2fc76209f6e15b4fa91b4b39107ae6cc7e7114 | [
"MIT"
] | null | null | null | bead/bead1/J_String_Pkg.adb | balintsoos/LearnAda | 9d2fc76209f6e15b4fa91b4b39107ae6cc7e7114 | [
"MIT"
] | null | null | null | bead/bead1/J_String_Pkg.adb | balintsoos/LearnAda | 9d2fc76209f6e15b4fa91b4b39107ae6cc7e7114 | [
"MIT"
] | 1 | 2021-07-16T16:15:11.000Z | 2021-07-16T16:15:11.000Z | package body J_String_Pkg is
function Create(Str : String) return J_String is
S : J_String(Str'length);
begin
S.value := Str;
return S;
end Create;
function Value_Of(S : J_String) return String is
Str : String(1 .. S.size);
begin
Str := S.value;
return Str;
end Value_Of;
function Char_At(S : J_String; P : Positive) return Character is
begin
return S.value(P);
end Char_At;
function Compare_To(S_Left, S_Right : J_String) return Boolean is
begin
return S_Left.value = S_Right.value;
end Compare_To;
function Concat(S_Left, S_Right : J_String) return J_String is
S : J_String(S_Left.size + S_Right.size);
begin
S.value := S_Left.value & S_Right.value;
return S;
end Concat;
function Contains(S : J_String; Pattern : String) return Boolean is
begin
return Index_Of(S, Pattern) /= -1;
end Contains;
function Ends_With(S : J_String; Ch : Character) return Boolean is
begin
return S.value(S.size) = Ch;
end Ends_With;
function Ends_With(S : J_String; Pattern : String) return Boolean is
l : Boolean := true;
begin
if Pattern'length > S.size then
return false;
end if;
for i in S.size - Pattern'length + 1 .. S.size loop
if S.value(i) /= Pattern(i - S.size + Pattern'length) then
l := false;
end if;
end loop;
return l;
end Ends_With;
function "="(S_Left, S_Right : J_String) return Boolean is
begin
return Compare_To(S_Left, S_Right);
end "=";
function Index_Of(S : J_String; Ch : Character) return Integer is
begin
return Index_Of(S, Ch, 1);
end Index_Of;
function Index_Of(S : J_String; Ch : Character; From_Index : Positive) return Integer is
index : Integer := -1;
begin
if From_Index > S.size then
return index;
end if;
for i in From_Index .. S.size loop
if S.value(i) = Ch then
index := i;
exit;
end if;
end loop;
return index;
end Index_Of;
function Index_Of(S : J_String; Pattern : String) return Integer is
index : Integer := -1;
l : Boolean := true;
begin
if Pattern'length > S.size then
return index;
end if;
for i in 1 .. (S.size - Pattern'length + 1) loop
l := true;
for j in 1 .. Pattern'length loop
if S.value(i + j - 1) /= Pattern(j) then
l := false;
exit;
end if;
end loop;
if l then
index := i;
end if;
end loop;
return index;
end Index_Of;
function Is_Empty(S : J_String) return Boolean is
begin
return S.size = 0;
end Is_Empty;
function Last_Index_Of(S : J_String; Ch : Character) return Integer is
begin
return Last_Index_Of(S, Ch, S.size);
end Last_Index_Of;
function Last_Index_Of(S : J_String; Ch : Character; From_Index : Positive) return Integer is
index : Integer := -1;
begin
if From_Index > S.size then
return index;
end if;
for i in 1 .. From_Index loop
if S.value(i) = Ch then
index := i;
end if;
end loop;
return index;
end Last_Index_Of;
function Length(S : J_String) return Natural is
begin
return S.size;
end Length;
function Replace(S : J_String; Old_Ch, New_Ch : Character) return J_String is
New_S : J_String := S;
begin
for i in 1 .. New_S.size loop
if New_S.value(i) = Old_Ch then
New_S.value(i) := New_Ch;
end if;
end loop;
return New_S;
end Replace;
function Starts_With(S : J_String; Ch : Character) return Boolean is
begin
return S.value(1) = Ch;
end Starts_With;
function Starts_With(S : J_String; Pattern : String) return Boolean is
l : Boolean := true;
begin
if Pattern'length > S.size then
return false;
end if;
for i in 1 .. Pattern'length loop
if S.value(i) /= Pattern(i) then
l := false;
end if;
end loop;
return l;
end Starts_With;
function Substring(S : J_String; Begin_Index : Positive) return J_String is
begin
return Substring(S, Begin_Index, S.size);
end Substring;
function Substring(S : J_String; Begin_Index, End_Index : Positive) return J_String is
New_S : J_String(End_Index - Begin_Index + 1);
begin
for i in Begin_Index .. End_Index loop
New_S.value(i - Begin_Index + 1) := S.value(i);
end loop;
return New_s;
end Substring;
end J_String_Pkg;
| 24.320442 | 95 | 0.632894 |
1c26e1255b1b35be9a1d0c46ca359aaa61c37527 | 241 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/rep_clause2.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/rep_clause2.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/rep_clause2.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 Rep_Clause2 is
procedure Assign (From : Data; Offset : Positive; I : Index; To : out Bit_Array) is
begin
To (Offset .. Offset + 7) := Bit_Array (Conv (From.D(I).S.N));
end;
end Rep_Clause2;
| 21.909091 | 86 | 0.630705 |
10df65578442f5facd0f7c1c23f1f0475d89f241 | 9,319 | ads | Ada | llvm-gcc-4.2-2.9/gcc/ada/output.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/output.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/output.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- O U T P U T --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2005, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- 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 contains low level output routines used by the compiler
-- for writing error messages and informational output. It is also used
-- by the debug source file output routines (see Sprintf.Print_Eol).
with Hostparm; use Hostparm;
with Types; use Types;
package Output is
pragma Elaborate_Body;
type Output_Proc is access procedure (S : String);
-- This type is used for the Set_Special_Output procedure. If this
-- procedure is called, then instead of lines being written to
-- standard error or standard output, a call is made to the given
-- procedure for each line, passing the line with an end of line
-- character (which is a single ASCII.LF character, even in systems
-- which normally use CR/LF or some other sequence for line end).
-----------------
-- Subprograms --
-----------------
procedure Set_Special_Output (P : Output_Proc);
-- Sets subsequent output to call procedure P. If P is null, then
-- the call cancels the effect of a previous call, reverting the
-- output to standard error or standard output depending on the
-- mode at the time of previous call. Any exception generated by
-- by calls to P is simply propagated to the caller of the routine
-- causing the write operation.
procedure Cancel_Special_Output;
-- Cancels the effect of a call to Set_Special_Output, if any.
-- The output is then directed to standard error or standard output
-- depending on the last call to Set_Standard_Error or Set_Standard_Output.
-- It is never an error to call Cancel_Special_Output. It has the same
-- effect as calling Set_Special_Output (null).
procedure Set_Standard_Error;
-- Sets subsequent output to appear on the standard error file (whatever
-- that might mean for the host operating system, if anything) when
-- no special output is in effect. When a special output is in effect,
-- the output will appear on standard error only after special output
-- has been cancelled.
procedure Set_Standard_Output;
-- Sets subsequent output to appear on the standard output file (whatever
-- that might mean for the host operating system, if anything) when
-- no special output is in effect. When a special output is in effect,
-- the output will appear on standard output only after special output
-- has been cancelled. Output to standard output is the default mode
-- before any call to either of the Set procedures.
procedure Write_Char (C : Character);
-- Write one character to the standard output file. Note that the
-- character should not be LF or CR (use Write_Eol for end of line)
procedure Write_Erase_Char (C : Character);
-- If last character in buffer matches C, erase it, otherwise no effect
procedure Write_Eol;
-- Write an end of line (whatever is required by the system in use,
-- e.g. CR/LF for DOS, or LF for Unix) to the standard output file.
-- This routine also empties the line buffer, actually writing it
-- to the file. Note that Write_Eol is the only routine that causes
-- any actual output to be written.
procedure Write_Int (Val : Int);
-- Write an integer value with no leading blanks or zeroes. Negative
-- values are preceded by a minus sign).
procedure Write_Str (S : String);
-- Write a string of characters to the standard output file. Note that
-- end of line is handled separately using WRITE_EOL, so the string
-- should not contain either of the characters LF or CR, but it may
-- contain horizontal tab characters.
procedure Write_Line (S : String);
-- Equivalent to Write_Str (S) followed by Write_Eol;
function Column return Pos;
pragma Inline (Column);
-- Returns the number of the column about to be written (e.g. a value
-- of 1 means the current line is empty).
-------------------------
-- Buffer Save/Restore --
-------------------------
-- This facility allows the current line buffer to be saved and restored
type Saved_Output_Buffer is private;
-- Type used for Save/Restore_Buffer
Buffer_Max : constant := Hostparm.Max_Line_Length;
-- Maximal size of a buffered output line
function Save_Output_Buffer return Saved_Output_Buffer;
-- Save current line buffer and reset line buffer to empty
procedure Restore_Output_Buffer (S : Saved_Output_Buffer);
-- Restore previously saved output buffer. The value in S is not affected
-- so it is legtimate to restore a buffer more than once.
--------------------------
-- Debugging Procedures --
--------------------------
-- The following procedures are intended only for debugging purposes,
-- for temporary insertion into the text in environments where a debugger
-- is not available. They all have non-standard very short lower case
-- names, precisely to make sure that they are only used for debugging!
procedure w (C : Character);
-- Dump quote, character quote, followed by line return
procedure w (S : String);
-- Dump string followed by line return
procedure w (V : Int);
-- Dump integer followed by line return
procedure w (B : Boolean);
-- Dump Boolean followed by line return
procedure w (L : String; C : Character);
-- Dump contents of string followed by blank, quote, character, quote
procedure w (L : String; S : String);
-- Dump two strings separated by blanks, followed by line return
procedure w (L : String; V : Int);
-- Dump contents of string followed by blank, integer, line return
procedure w (L : String; B : Boolean);
-- Dump contents of string followed by blank, Boolean, line return
private
-- Note: the following buffer and column position are maintained by the
-- subprograms defined in this package, and cannot be directly modified or
-- accessed by a client.
Buffer : String (1 .. Buffer_Max + 1);
for Buffer'Alignment use 4;
-- Buffer used to build output line. We do line buffering because it
-- is needed for the support of the debug-generated-code option (-gnatD).
-- Historically it was first added because on VMS, line buffering is
-- needed with certain file formats. So in any case line buffering must
-- be retained for this purpose, even if other reasons disappear. Note
-- any attempt to write more output to a line than can fit in the buffer
-- will be silently ignored. The alignment clause improves the efficiency
-- of the save/restore procedures.
Next_Col : Positive range 1 .. Buffer'Length + 1 := 1;
-- Column about to be written
type Saved_Output_Buffer is record
Buffer : String (1 .. Buffer_Max + 1);
Next_Col : Positive;
end record;
end Output;
| 47.789744 | 79 | 0.617877 |
c557c3d52bc73f8420ae3bd89646ecdaa46b2dc6 | 1,597 | ads | Ada | tier-1/xcb/source/thin/xcb-xcb_open_font_request_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 2 | 2015-11-12T11:16:20.000Z | 2021-08-24T22:32:04.000Z | tier-1/xcb/source/thin/xcb-xcb_open_font_request_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 1 | 2018-06-05T05:19:35.000Z | 2021-11-20T01:13:23.000Z | tier-1/xcb/source/thin/xcb-xcb_open_font_request_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | null | null | null | -- This file is generated by SWIG. Please do not modify by hand.
--
with Interfaces;
with swig;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_open_font_request_t is
-- Item
--
type Item is record
major_opcode : aliased Interfaces.Unsigned_8;
pad0 : aliased Interfaces.Unsigned_8;
length : aliased Interfaces.Unsigned_16;
fid : aliased xcb.xcb_font_t;
name_len : aliased Interfaces.Unsigned_16;
pad1 : aliased swig.int8_t_Array (0 .. 1);
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C.size_t range <>) of aliased xcb.xcb_open_font_request_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_open_font_request_t.Item,
Element_Array => xcb.xcb_open_font_request_t.Item_Array,
Default_Terminator => (others => <>));
subtype Pointer is C_Pointers.Pointer;
-- Pointer_Array
--
type Pointer_Array is
array
(Interfaces.C.size_t range <>) of aliased xcb.xcb_open_font_request_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_open_font_request_t.Pointer,
Element_Array => xcb.xcb_open_font_request_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_open_font_request_t;
| 28.017544 | 76 | 0.65623 |
4a1fec23fba1d646e1bcec97c132752758ff4ede | 20,906 | adb | Ada | opengl/src/implementation/gl-objects-textures.adb | Cre8or/OpenGLAda | 91f12a2d4ca2aa7379dd8c83c80e4eca45fd0c06 | [
"MIT"
] | 79 | 2015-04-20T23:10:02.000Z | 2022-03-04T13:50:56.000Z | opengl/src/implementation/gl-objects-textures.adb | Cre8or/OpenGLAda | 91f12a2d4ca2aa7379dd8c83c80e4eca45fd0c06 | [
"MIT"
] | 126 | 2015-09-10T10:41:34.000Z | 2022-03-20T11:25:40.000Z | opengl/src/implementation/gl-objects-textures.adb | Cre8or/OpenGLAda | 91f12a2d4ca2aa7379dd8c83c80e4eca45fd0c06 | [
"MIT"
] | 20 | 2015-03-17T07:15:57.000Z | 2022-02-02T17:12:11.000Z | -- part of OpenGLAda, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "COPYING"
with Ada.Unchecked_Conversion;
with Ada.Containers.Indefinite_Hashed_Maps;
with GL.API;
with GL.Helpers;
with GL.Enums.Getter;
with GL.Enums.Indexes;
with GL.Enums.Textures;
package body GL.Objects.Textures is
use type Low_Level.Enums.Texture_Kind;
function Width (Object : Texture_Proxy; Level : Mipmap_Level) return Size is
Ret : Size;
begin
API.Get_Tex_Level_Parameter_Size (Object.Kind, Level,
Enums.Textures.Width, Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Width;
function Height (Object : Texture_Proxy; Level : Mipmap_Level) return Size is
Ret : Size;
begin
API.Get_Tex_Level_Parameter_Size (Object.Kind, Level,
Enums.Textures.Height, Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Height;
function Depth (Object : Texture_Proxy; Level : Mipmap_Level) return Size is
Ret : Size;
begin
API.Get_Tex_Level_Parameter_Size (Object.Kind, Level,
Enums.Textures.Depth_Size, Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Depth;
function Format (Object : Texture_Proxy; Level : Mipmap_Level)
return Pixels.Internal_Format is
Ret : Pixels.Internal_Format;
begin
API.Get_Tex_Level_Parameter_Format (Object.Kind, Level,
Enums.Textures.Internal_Format, Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Format;
function Red_Type (Object : Texture_Proxy; Level : Mipmap_Level)
return Pixels.Channel_Data_Type is
Ret : Pixels.Channel_Data_Type;
begin
API.Get_Tex_Level_Parameter_Type (Object.Kind, Level,
Enums.Textures.Red_Type, Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Red_Type;
function Green_Type (Object : Texture_Proxy; Level : Mipmap_Level)
return Pixels.Channel_Data_Type is
Ret : Pixels.Channel_Data_Type;
begin
API.Get_Tex_Level_Parameter_Type (Object.Kind, Level,
Enums.Textures.Green_Type, Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Green_Type;
function Blue_Type (Object : Texture_Proxy; Level : Mipmap_Level)
return Pixels.Channel_Data_Type is
Ret : Pixels.Channel_Data_Type;
begin
API.Get_Tex_Level_Parameter_Type (Object.Kind, Level,
Enums.Textures.Blue_Type, Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Blue_Type;
function Alpha_Type (Object : Texture_Proxy; Level : Mipmap_Level)
return Pixels.Channel_Data_Type is
Ret : Pixels.Channel_Data_Type;
begin
API.Get_Tex_Level_Parameter_Type (Object.Kind, Level,
Enums.Textures.Alpha_Type, Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Alpha_Type;
function Depth_Type (Object : Texture_Proxy; Level : Mipmap_Level)
return Pixels.Channel_Data_Type is
Ret : Pixels.Channel_Data_Type;
begin
API.Get_Tex_Level_Parameter_Type (Object.Kind, Level,
Enums.Textures.Depth_Type, Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Depth_Type;
function Red_Size (Object : Texture_Proxy; Level : Mipmap_Level)
return Size is
Ret : Size;
begin
API.Get_Tex_Level_Parameter_Size (Object.Kind, Level,
Enums.Textures.Red_Size, Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Red_Size;
function Green_Size (Object : Texture_Proxy; Level : Mipmap_Level)
return Size is
Ret : Size;
begin
API.Get_Tex_Level_Parameter_Size (Object.Kind, Level,
Enums.Textures.Green_Size, Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Green_Size;
function Blue_Size (Object : Texture_Proxy; Level : Mipmap_Level)
return Size is
Ret : Size;
begin
API.Get_Tex_Level_Parameter_Size (Object.Kind, Level,
Enums.Textures.Blue_Size, Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Blue_Size;
function Alpha_Size (Object : Texture_Proxy; Level : Mipmap_Level)
return Size is
Ret : Size;
begin
API.Get_Tex_Level_Parameter_Size (Object.Kind, Level,
Enums.Textures.Alpha_Size, Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Alpha_Size;
function Depth_Size (Object : Texture_Proxy; Level : Mipmap_Level)
return Size is
Ret : Size;
begin
API.Get_Tex_Level_Parameter_Size (Object.Kind, Level,
Enums.Textures.Depth_Size, Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Depth_Size;
function Compressed (Object : Texture_Proxy; Level : Mipmap_Level)
return Boolean is
Ret : Low_Level.Bool;
begin
API.Get_Tex_Level_Parameter_Bool (Object.Kind, Level,
Enums.Textures.Compressed, Ret);
Raise_Exception_On_OpenGL_Error;
return Boolean (Ret);
end Compressed;
function Compressed_Image_Size (Object : Texture_Proxy; Level : Mipmap_Level)
return Size is
Ret : Size;
begin
API.Get_Tex_Level_Parameter_Size (Object.Kind, Level,
Enums.Textures.Compressed_Image_Size,
Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Compressed_Image_Size;
function Raw_Kind (Object : Texture_Proxy)
return Low_Level.Enums.Texture_Kind is
begin
return Object.Kind;
end Raw_Kind;
function Hash (Key : Low_Level.Enums.Texture_Kind)
return Ada.Containers.Hash_Type is
function Value is new Ada.Unchecked_Conversion
(Source => Low_Level.Enums.Texture_Kind, Target => Low_Level.Enum);
begin
return Ada.Containers.Hash_Type (Value (Key));
end Hash;
package Texture_Maps is new Ada.Containers.Indefinite_Hashed_Maps
(Key_Type => Low_Level.Enums.Texture_Kind,
Element_Type => Texture'Class,
Hash => Hash,
Equivalent_Keys => Low_Level.Enums."=");
use type Texture_Maps.Cursor;
Current_Textures : Texture_Maps.Map;
procedure Bind (Target : Texture_Target; Object : Texture'Class) is
Cursor : constant Texture_Maps.Cursor
:= Current_Textures.Find (Target.Kind);
begin
if Cursor = Texture_Maps.No_Element or else
Texture_Maps.Element (Cursor).Reference.GL_Id /= Object.Reference.GL_Id
then
API.Bind_Texture (Target.Kind, Object.Reference.GL_Id);
Raise_Exception_On_OpenGL_Error;
if Cursor = Texture_Maps.No_Element then
Current_Textures.Insert (Target.Kind, Object);
else
Current_Textures.Replace_Element (Cursor, Object);
end if;
end if;
end Bind;
function Is_Texture (Texture : UInt) return Boolean is
Ret : Boolean;
begin
Ret := API.Is_Texture (Texture);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Is_Texture;
function Current_Texture (Target : Texture_Target) return Texture'Class is
Cursor : constant Texture_Maps.Cursor
:= Current_Textures.Find (Target.Kind);
begin
if Cursor /= Texture_Maps.No_Element then
return Texture_Maps.Element (Cursor);
else
raise No_Object_Bound_Exception with Target.Kind'Img;
end if;
end Current_Texture;
overriding
procedure Internal_Create_Id (Object : Texture; Id : out UInt) is
pragma Unreferenced (Object);
begin
API.Gen_Textures (1, Id);
Raise_Exception_On_OpenGL_Error;
end Internal_Create_Id;
overriding
procedure Internal_Release_Id (Object : Texture; Id : UInt) is
pragma Unreferenced (Object);
begin
API.Delete_Textures (1, (1 => Id));
Raise_Exception_On_OpenGL_Error;
end Internal_Release_Id;
procedure Invalidate_Image (Object : Texture; Level : Mipmap_Level) is
begin
API.Invalidate_Tex_Image (Object.Reference.GL_Id, Level);
Raise_Exception_On_OpenGL_Error;
end Invalidate_Image;
procedure Invalidate_Sub_Image (Object : Texture; Level : Mipmap_Level;
X, Y, Z : Int; Width, Height, Depth : Size)
is
begin
API.Invalidate_Tex_Sub_Image (Object.Reference.GL_Id, Level, X, Y, Z,
Width, Height, Depth);
Raise_Exception_On_OpenGL_Error;
end Invalidate_Sub_Image;
procedure Set_Minifying_Filter (Target : Texture_Target;
Filter : Minifying_Function) is
begin
API.Tex_Parameter_Min_Filter (Target.Kind, Enums.Textures.Min_Filter,
Filter);
Raise_Exception_On_OpenGL_Error;
end Set_Minifying_Filter;
function Minifying_Filter (Target : Texture_Target)
return Minifying_Function is
function Convert is new Ada.Unchecked_Conversion
(Source => Int, Target => Minifying_Function);
Ret : Int;
begin
API.Get_Tex_Parameter_Int (Target.Kind, Enums.Textures.Min_Filter,
Ret);
Raise_Exception_On_OpenGL_Error;
return Convert (Ret);
end Minifying_Filter;
procedure Set_Magnifying_Filter (Target : Texture_Target;
Filter : Magnifying_Function) is
begin
API.Tex_Parameter_Mag_Filter (Target.Kind, Enums.Textures.Mag_Filter,
Filter);
Raise_Exception_On_OpenGL_Error;
end Set_Magnifying_Filter;
function Magnifying_Filter (Target : Texture_Target)
return Magnifying_Function is
function Convert is new Ada.Unchecked_Conversion
(Source => Int, Target => Minifying_Function);
Ret : Int;
begin
API.Get_Tex_Parameter_Int (Target.Kind, Enums.Textures.Mag_Filter,
Ret);
Raise_Exception_On_OpenGL_Error;
return Convert (Ret);
end Magnifying_Filter;
procedure Set_Minimum_LoD (Target : Texture_Target; Level : Double) is
begin
API.Tex_Parameter_Float (Target.Kind, Enums.Textures.Min_LoD,
Single (Level));
Raise_Exception_On_OpenGL_Error;
end Set_Minimum_LoD;
function Minimum_LoD (Target : Texture_Target) return Double is
Ret : Single;
begin
API.Get_Tex_Parameter_Float (Target.Kind, Enums.Textures.Min_LoD,
Ret);
Raise_Exception_On_OpenGL_Error;
return Double (Ret);
end Minimum_LoD;
procedure Set_Maximum_LoD (Target : Texture_Target; Level : Double) is
begin
API.Tex_Parameter_Float (Target.Kind, Enums.Textures.Max_LoD,
Single (Level));
Raise_Exception_On_OpenGL_Error;
end Set_Maximum_LoD;
function Maximum_LoD (Target : Texture_Target) return Double is
Ret : Single;
begin
API.Get_Tex_Parameter_Float (Target.Kind, Enums.Textures.Max_LoD,
Ret);
Raise_Exception_On_OpenGL_Error;
return Double (Ret);
end Maximum_LoD;
procedure Set_Lowest_Mipmap_Level (Target : Texture_Target;
Level : Mipmap_Level) is
begin
API.Tex_Parameter_Int (Target.Kind, Enums.Textures.Base_Level, Level);
Raise_Exception_On_OpenGL_Error;
end Set_Lowest_Mipmap_Level;
function Lowest_Mipmap_Level (Target : Texture_Target) return Mipmap_Level is
Ret : Int;
begin
API.Get_Tex_Parameter_Int (Target.Kind, Enums.Textures.Base_Level,
Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Lowest_Mipmap_Level;
procedure Set_Highest_Mipmap_Level (Target : Texture_Target;
Level : Mipmap_Level) is
begin
API.Tex_Parameter_Int (Target.Kind, Enums.Textures.Max_Level, Level);
Raise_Exception_On_OpenGL_Error;
end Set_Highest_Mipmap_Level;
function Highest_Mipmap_Level (Target : Texture_Target)
return Mipmap_Level is
Ret : Int;
begin
API.Get_Tex_Parameter_Int (Target.Kind, Enums.Textures.Max_Level,
Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Highest_Mipmap_Level;
procedure Set_X_Wrapping (Target : Texture_Target; Mode : Wrapping_Mode) is
begin
API.Tex_Parameter_Wrap_Mode (Target.Kind, Enums.Textures.Wrap_S,
Mode);
Raise_Exception_On_OpenGL_Error;
end Set_X_Wrapping;
function X_Wrapping (Target : Texture_Target) return Wrapping_Mode is
Ret : Wrapping_Mode;
begin
API.Get_Tex_Parameter_Wrap_Mode (Target.Kind, Enums.Textures.Wrap_S,
Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end X_Wrapping;
procedure Set_Y_Wrapping (Target : Texture_Target; Mode : Wrapping_Mode) is
begin
API.Tex_Parameter_Wrap_Mode (Target.Kind, Enums.Textures.Wrap_T,
Mode);
Raise_Exception_On_OpenGL_Error;
end Set_Y_Wrapping;
function Y_Wrapping (Target : Texture_Target) return Wrapping_Mode is
Ret : Wrapping_Mode;
begin
API.Get_Tex_Parameter_Wrap_Mode (Target.Kind, Enums.Textures.Wrap_T,
Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Y_Wrapping;
procedure Set_Z_Wrapping (Target : Texture_Target; Mode : Wrapping_Mode) is
begin
API.Tex_Parameter_Wrap_Mode (Target.Kind, Enums.Textures.Wrap_R,
Mode);
Raise_Exception_On_OpenGL_Error;
end Set_Z_Wrapping;
function Z_Wrapping (Target : Texture_Target) return Wrapping_Mode is
Ret : Wrapping_Mode;
begin
API.Get_Tex_Parameter_Wrap_Mode (Target.Kind, Enums.Textures.Wrap_R,
Ret);
Raise_Exception_On_OpenGL_Error;
return Ret;
end Z_Wrapping;
procedure Set_Border_Color (Target : Texture_Target; Color : Colors.Color) is
Raw : constant Single_Array := Helpers.Float_Array (Color);
begin
API.Tex_Parameter_Floats (Target.Kind, Enums.Textures.Border_Color,
Raw);
Raise_Exception_On_OpenGL_Error;
end Set_Border_Color;
function Border_Color (Target : Texture_Target) return Colors.Color is
Raw : Single_Array (1 .. 4);
begin
API.Get_Tex_Parameter_Floats (Target.Kind, Enums.Textures.Border_Color,
Raw);
Raise_Exception_On_OpenGL_Error;
return Helpers.Color (Raw);
end Border_Color;
procedure Set_Texture_Priority (Target : Texture_Target;
Value : Priority) is
begin
API.Tex_Parameter_Float (Target.Kind, Enums.Textures.Priority,
Single (Value));
Raise_Exception_On_OpenGL_Error;
end Set_Texture_Priority;
function Texture_Priority (Target : Texture_Target) return Priority is
Ret : Single;
begin
API.Get_Tex_Parameter_Float (Target.Kind, Enums.Textures.Priority, Ret);
Raise_Exception_On_OpenGL_Error;
return Priority (Ret);
end Texture_Priority;
procedure Toggle_Compare_X_To_Texture (Target : Texture_Target;
Enabled : Boolean) is
Value : Enums.Textures.Compare_Kind;
begin
if Enabled then
Value := Enums.Textures.Compare_R_To_Texture;
else
Value := Enums.Textures.None;
end if;
API.Tex_Parameter_Comp_Mode (Target.Kind, Enums.Textures.Compare_Mode,
Value);
Raise_Exception_On_OpenGL_Error;
end Toggle_Compare_X_To_Texture;
function Compare_X_To_Texture_Enabled (Target : Texture_Target)
return Boolean is
use type Enums.Textures.Compare_Kind;
Value : Enums.Textures.Compare_Kind;
begin
API.Get_Tex_Parameter_Comp_Mode (Target.Kind, Enums.Textures.Compare_Mode,
Value);
Raise_Exception_On_OpenGL_Error;
return Value = Enums.Textures.Compare_R_To_Texture;
end Compare_X_To_Texture_Enabled;
procedure Set_Compare_Function (Target : Texture_Target;
Func : Compare_Function) is
begin
API.Tex_Parameter_Comp_Func (Target.Kind, Enums.Textures.Compare_Func,
Func);
Raise_Exception_On_OpenGL_Error;
end Set_Compare_Function;
function Current_Compare_Function (Target : Texture_Target)
return Compare_Function is
Value : Compare_Function;
begin
API.Get_Tex_Parameter_Comp_Func (Target.Kind, Enums.Textures.Compare_Func,
Value);
Raise_Exception_On_OpenGL_Error;
return Value;
end Current_Compare_Function;
procedure Set_Depth_Texture_Mode (Target : Texture_Target;
Mode : Depth_Mode) is
begin
API.Tex_Parameter_Depth_Mode (Target.Kind, Enums.Textures.Depth, Mode);
Raise_Exception_On_OpenGL_Error;
end Set_Depth_Texture_Mode;
function Depth_Texture_Mode (Target : Texture_Target) return Depth_Mode is
Value : Depth_Mode;
begin
API.Get_Tex_Parameter_Depth_Mode (Target.Kind, Enums.Textures.Depth,
Value);
Raise_Exception_On_OpenGL_Error;
return Value;
end Depth_Texture_Mode;
procedure Toggle_Mipmap_Autoupdate (Target : Texture_Target;
Enabled : Boolean) is
begin
API.Tex_Parameter_Bool (Target.Kind, Enums.Textures.Generate_Mipmap,
Low_Level.Bool (Enabled));
Raise_Exception_On_OpenGL_Error;
end Toggle_Mipmap_Autoupdate;
function Mipmap_Autoupdate_Enabled (Target : Texture_Target)
return Boolean is
Value : Low_Level.Bool;
begin
API.Get_Tex_Parameter_Bool (Target.Kind, Enums.Textures.Generate_Mipmap,
Value);
Raise_Exception_On_OpenGL_Error;
return Boolean (Value);
end Mipmap_Autoupdate_Enabled;
procedure Generate_Mipmap (Target : Texture_Target) is
begin
API.Generate_Mipmap (Target.Kind);
Raise_Exception_On_OpenGL_Error;
end Generate_Mipmap;
function Raw_Type (Target : Texture_Target)
return Low_Level.Enums.Texture_Kind is
begin
return Target.Kind;
end Raw_Type;
procedure Set_Active_Unit (Unit : Texture_Unit) is
package Texture_Indexing is new Enums.Indexes
(Enums.Textures.Texture_Unit_Start_Rep,
Enums.Getter.Max_Combined_Texture_Image_Units);
begin
API.Active_Texture (Texture_Indexing.Representation (Unit));
Raise_Exception_On_OpenGL_Error;
end Set_Active_Unit;
function Active_Unit return Texture_Unit is
package Texture_Indexing is new Enums.Indexes
(Enums.Textures.Texture_Unit_Start_Rep,
Enums.Getter.Max_Combined_Texture_Image_Units);
Raw_Unit : aliased Int := Enums.Textures.Texture_Unit_Start_Rep;
begin
API.Get_Integer (Enums.Getter.Active_Texture, Raw_Unit'Access);
return Texture_Indexing.Value (Raw_Unit);
end Active_Unit;
function Texture_Unit_Count return Natural is
Count : aliased Int;
begin
API.Get_Integer (Enums.Getter.Max_Combined_Texture_Image_Units,
Count'Access);
return Natural (Count);
end Texture_Unit_Count;
function Format_For_Loading_Empty_Texture
(Internal_Format : Pixels.Internal_Format) return Pixels.Data_Format is
use GL.Pixels;
begin
case Internal_Format is
when Depth_Component | Depth_Component16 | Depth_Component24 |
Depth_Component32 => return Depth_Component;
when others => return Red;
end case;
end Format_For_Loading_Empty_Texture;
end GL.Objects.Textures;
| 35.920962 | 80 | 0.642112 |
dc7bef447e9372fd2ecac2ece6abc6524692ed8f | 5,318 | adb | Ada | source/web/tools/wsdl2ada/wsdl-driver.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/web/tools/wsdl2ada/wsdl-driver.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/web/tools/wsdl2ada/wsdl-driver.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Tools Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012-2014, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with Ada.Command_Line;
with League.Application;
with XML.SAX.File_Input_Sources;
with XML.SAX.Simple_Readers;
with WSDL.Analyzer;
with WSDL.AST.Descriptions;
pragma Unreferenced (WSDL.AST.Descriptions);
-- GNAT Pro 7.2.0w (20130423): package is needed to access to type's
-- components.
with WSDL.Debug;
with WSDL.Generator;
with WSDL.Iterators.Containment;
with WSDL.Parsers;
with WSDL.Name_Resolvers;
procedure WSDL.Driver is
Source : aliased XML.SAX.File_Input_Sources.File_Input_Source;
Handler : aliased WSDL.Parsers.WSDL_Parser;
Reader : aliased XML.SAX.Simple_Readers.Simple_Reader;
begin
-- Load document.
Reader.Set_Content_Handler (Handler'Unchecked_Access);
Source.Open_By_File_Name (League.Application.Arguments.Element (1));
Reader.Parse (Source'Unchecked_Access);
-- Resolve names.
declare
Resolver : WSDL.Name_Resolvers.Name_Resolver;
Iterator : WSDL.Iterators.Containment.Containment_Iterator;
Control : WSDL.Iterators.Traverse_Control := WSDL.Iterators.Continue;
begin
Resolver.Set_Root (Handler.Get_Description);
Iterator.Visit
(Resolver, WSDL.AST.Node_Access (Handler.Get_Description), Control);
end;
-- Analyze.
declare
Analyzer : WSDL.Analyzer.Analyzer;
Iterator : WSDL.Iterators.Containment.Containment_Iterator;
Control : WSDL.Iterators.Traverse_Control := WSDL.Iterators.Continue;
begin
Analyzer.Set_Root (Handler.Get_Description);
Iterator.Visit
(Analyzer, WSDL.AST.Node_Access (Handler.Get_Description), Control);
end;
-- WSDL.Debug.Dump (Handler.Get_Description);
-- Generate code.
WSDL.Generator.Generate (Handler.Get_Description);
exception
when WSDL.WSDL_Error =>
-- It means that detedted error was reported and processing was
-- terminated. Set exit status to report presence of some error.
Ada.Command_Line.Set_Exit_Status (Ada.Command_Line.Failure);
end WSDL.Driver;
| 47.061947 | 78 | 0.516171 |
1c0c003237665be51dc5c152b4821bf3dfe46f28 | 1,844 | ads | Ada | 3-mid/opengl/source/lean/text/opengl-glyph.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/opengl/source/lean/text/opengl-glyph.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/opengl/source/lean/text/opengl-glyph.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | with
freeType_c.FT_GlyphSlot,
openGL.GlyphImpl;
package openGL.Glyph
--
-- Glyph is the base class for openGL glyphs.
--
-- It provides the interface between Freetype glyphs and their openGL
-- renderable counterparts.
--
-- This is an abstract class and derived classes must implement the 'Render' function.
--
is
type Item is abstract tagged private;
---------
-- Forge
--
procedure destruct (Self : in out Item);
--------------
-- Attributes
--
function Advance (Self : in Item) return Real; -- Return the advance width for this glyph.
function BBox (Self : in Item) return Bounds; -- Return the bounding box for this glyph.
function Error (Self : in Item) return GlyphImpl.Error_Kind; -- Return the current error code.
--------------
--- Operations
--
function render (Self : in Item; Pen : in Vector_3;
renderMode : in Integer) return Vector_3
is abstract;
--
-- Renders this glyph at the current pen position.
--
-- Pen: The current pen position.
-- renderMode: Render mode to display.
---
-- Returns the advance distance for this glyph.
private
type Item is abstract tagged
record
Impl : GlyphImpl.view; -- Internal FTGL FTGlyph implementation object. For private use only.
end record;
procedure define (Self : in out Item; glyth_Slot : in freetype_c.FT_GlyphSlot.item);
--
-- glyth_Slot: The Freetype glyph to be processed.
procedure define (Self : in out Item; pImpl : in GlyphImpl.view);
--
-- Internal FTGL FTGlyph constructor. For private use only.
--
-- pImpl: An internal implementation object. Will be destroyed upon FTGlyph deletion.
end openGL.Glyph;
| 26.724638 | 111 | 0.621475 |
10b02bba5d650f7c0903e17259427fc85e53bc5d | 1,891 | ads | Ada | extern/gnat_sdl/gnat_sdl2/src/malloc_h.ads | AdaCore/training_material | 6651eb2c53f8c39649b8e0b3c757bc8ff963025a | [
"CC-BY-4.0"
] | 15 | 2020-10-07T08:56:45.000Z | 2022-02-08T23:13:22.000Z | extern/gnat_sdl/gnat_sdl2/src/malloc_h.ads | AdaCore/training_material | 6651eb2c53f8c39649b8e0b3c757bc8ff963025a | [
"CC-BY-4.0"
] | 20 | 2020-11-05T14:35:20.000Z | 2022-01-13T15:59:33.000Z | extern/gnat_sdl/gnat_sdl2/src/malloc_h.ads | AdaCore/training_material | 6651eb2c53f8c39649b8e0b3c757bc8ff963025a | [
"CC-BY-4.0"
] | 6 | 2020-10-08T15:57:06.000Z | 2021-08-31T12:03:08.000Z | pragma Ada_2005;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
with stddef_h;
package malloc_h is
-- arg-macro: procedure alloca (x)
-- __builtin_alloca((x))
--*
-- * This file has no copyright assigned and is placed in the Public Domain.
-- * This file is part of the mingw-w64 runtime package.
-- * No warranty is given; refer to the file DISCLAIMER.PD within this package.
--
-- Return codes for _heapwalk()
-- Values for _heapinfo.useflag
-- The structure used to walk through the heap with _heapwalk.
type u_heapinfo is record
u_pentry : access int; -- d:\install\gpl2018\x86_64-pc-mingw32\include\malloc.h:47
u_size : aliased stddef_h.size_t; -- d:\install\gpl2018\x86_64-pc-mingw32\include\malloc.h:48
u_useflag : aliased int; -- d:\install\gpl2018\x86_64-pc-mingw32\include\malloc.h:49
end record;
pragma Convention (C_Pass_By_Copy, u_heapinfo); -- d:\install\gpl2018\x86_64-pc-mingw32\include\malloc.h:46
-- Make sure that X86intrin.h doesn't produce here collisions.
-- Users should really use MS provided versions
-- skipped func __mingw_aligned_malloc
-- skipped func __mingw_aligned_free
-- skipped func __mingw_aligned_offset_realloc
-- skipped func __mingw_aligned_realloc
-- skipped func _resetstkoflw
-- skipped func _set_malloc_crt_max_wait
-- skipped func _expand
-- skipped func _msize
-- skipped func _get_sbh_threshold
-- skipped func _set_sbh_threshold
-- skipped func _set_amblksiz
-- skipped func _get_amblksiz
-- skipped func _heapadd
-- skipped func _heapchk
-- skipped func _heapmin
-- skipped func _heapset
-- skipped func _heapwalk
-- skipped func _heapused
-- skipped func _get_heap_handle
-- skipped func _MarkAllocaS
-- skipped func _freea
end malloc_h;
| 26.263889 | 111 | 0.702274 |
18e8931b31c6fdb728c5bb79f9460c074df5c631 | 2,880 | ads | Ada | tools-src/gnu/gcc/gcc/ada/s-exnlin.ads | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 80 | 2015-01-02T10:14:04.000Z | 2021-06-07T06:29:49.000Z | tools-src/gnu/gcc/gcc/ada/s-exnlin.ads | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 9 | 2015-05-14T11:03:12.000Z | 2018-01-04T07:12:58.000Z | tools-src/gnu/gcc/gcc/ada/s-exnlin.ads | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUNTIME COMPONENTS --
-- --
-- S Y S T E M . E X N _ L I N T --
-- --
-- S p e c --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992,1993,1994 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. --
-- --
------------------------------------------------------------------------------
-- Long_Integer exponentiation (checks off)
with System.Exn_Gen;
package System.Exn_LInt is
pragma Pure (Exn_LInt);
function Exn_Long_Integer is
new System.Exn_Gen.Exn_Integer_Type (Long_Integer);
end System.Exn_LInt;
| 61.276596 | 78 | 0.423264 |
1c938711aa9d1681fba7fb3a3a5898aa46fe909f | 1,606 | adb | Ada | src/arch/socs/stm32f439/soc-rng.adb | PThierry/ewok-kernel | e9c23cb3fd0afd8378bc27418778e1117d5e16cc | [
"Apache-2.0"
] | 65 | 2018-09-26T09:10:11.000Z | 2022-01-30T21:17:37.000Z | src/arch/socs/stm32f439/soc-rng.adb | PThierry/ewok-kernel | e9c23cb3fd0afd8378bc27418778e1117d5e16cc | [
"Apache-2.0"
] | 22 | 2019-04-07T15:15:54.000Z | 2020-10-15T12:45:54.000Z | src/arch/socs/stm32f439/soc-rng.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.devmap;
with soc.rcc;
package body soc.rng
with spark_mode => off
is
last_random : unsigned_32;
procedure init
(success : out boolean)
is
begin
soc.rcc.enable_clock (soc.devmap.RNG);
RNG.CR.RNGEN := true;
loop
exit when RNG.SR.DRDY;
end loop;
if RNG.SR.SECS or RNG.SR.CECS then
success := false;
else
success := true;
end if;
last_random := RNG.DR.RNDATA;
end init;
procedure random
(rand : out unsigned_32;
success : out boolean)
is
begin
loop
exit when RNG.SR.DRDY;
end loop;
rand := RNG.DR.RNDATA;
if rand = last_random or RNG.SR.SECS then
success := false;
else
success := true;
end if;
end random;
end soc.rng;
| 21.131579 | 79 | 0.62142 |
fb528de5ad0519968aa2d4103f2e384a940a89e8 | 37,744 | ads | Ada | arch/ARM/STM32/svd/stm32l4x3/stm32_svd-adc.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2018-05-16T03:56:39.000Z | 2019-07-31T13:53:56.000Z | arch/ARM/STM32/svd/stm32l4x3/stm32_svd-adc.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | arch/ARM/STM32/svd/stm32l4x3/stm32_svd-adc.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | -- This spec has been automatically generated from STM32L4x3.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.ADC is
pragma Preelaborate;
---------------
-- Registers --
---------------
-- ISR_AWD array
type ISR_AWD_Field_Array is array (1 .. 3) of Boolean
with Component_Size => 1, Size => 3;
-- Type definition for ISR_AWD
type ISR_AWD_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- AWD as a value
Val : HAL.UInt3;
when True =>
-- AWD as an array
Arr : ISR_AWD_Field_Array;
end case;
end record
with Unchecked_Union, Size => 3;
for ISR_AWD_Field use record
Val at 0 range 0 .. 2;
Arr at 0 range 0 .. 2;
end record;
-- interrupt and status register
type ISR_Register is record
-- ADRDY
ADRDY : Boolean := False;
-- EOSMP
EOSMP : Boolean := False;
-- EOC
EOC : Boolean := False;
-- EOS
EOS : Boolean := False;
-- OVR
OVR : Boolean := False;
-- JEOC
JEOC : Boolean := False;
-- JEOS
JEOS : Boolean := False;
-- AWD1
AWD : ISR_AWD_Field := (As_Array => False, Val => 16#0#);
-- JQOVF
JQOVF : Boolean := False;
-- unspecified
Reserved_11_31 : HAL.UInt21 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ISR_Register use record
ADRDY at 0 range 0 .. 0;
EOSMP at 0 range 1 .. 1;
EOC at 0 range 2 .. 2;
EOS at 0 range 3 .. 3;
OVR at 0 range 4 .. 4;
JEOC at 0 range 5 .. 5;
JEOS at 0 range 6 .. 6;
AWD at 0 range 7 .. 9;
JQOVF at 0 range 10 .. 10;
Reserved_11_31 at 0 range 11 .. 31;
end record;
-- interrupt enable register
type IER_Register is record
-- ADRDYIE
ADRDYIE : Boolean := False;
-- EOSMPIE
EOSMPIE : Boolean := False;
-- EOCIE
EOCIE : Boolean := False;
-- EOSIE
EOSIE : Boolean := False;
-- OVRIE
OVRIE : Boolean := False;
-- JEOCIE
JEOCIE : Boolean := False;
-- JEOSIE
JEOSIE : Boolean := False;
-- AWD1IE
AWD1IE : Boolean := False;
-- AWD2IE
AWD2IE : Boolean := False;
-- AWD3IE
AWD3IE : Boolean := False;
-- JQOVFIE
JQOVFIE : Boolean := False;
-- unspecified
Reserved_11_31 : HAL.UInt21 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for IER_Register use record
ADRDYIE at 0 range 0 .. 0;
EOSMPIE at 0 range 1 .. 1;
EOCIE at 0 range 2 .. 2;
EOSIE at 0 range 3 .. 3;
OVRIE at 0 range 4 .. 4;
JEOCIE at 0 range 5 .. 5;
JEOSIE at 0 range 6 .. 6;
AWD1IE at 0 range 7 .. 7;
AWD2IE at 0 range 8 .. 8;
AWD3IE at 0 range 9 .. 9;
JQOVFIE at 0 range 10 .. 10;
Reserved_11_31 at 0 range 11 .. 31;
end record;
-- control register
type CR_Register is record
-- ADEN
ADEN : Boolean := False;
-- ADDIS
ADDIS : Boolean := False;
-- ADSTART
ADSTART : Boolean := False;
-- JADSTART
JADSTART : Boolean := False;
-- ADSTP
ADSTP : Boolean := False;
-- JADSTP
JADSTP : Boolean := False;
-- unspecified
Reserved_6_27 : HAL.UInt22 := 16#0#;
-- ADVREGEN
ADVREGEN : Boolean := False;
-- DEEPPWD
DEEPPWD : Boolean := False;
-- ADCALDIF
ADCALDIF : Boolean := False;
-- ADCAL
ADCAL : Boolean := False;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CR_Register use record
ADEN at 0 range 0 .. 0;
ADDIS at 0 range 1 .. 1;
ADSTART at 0 range 2 .. 2;
JADSTART at 0 range 3 .. 3;
ADSTP at 0 range 4 .. 4;
JADSTP at 0 range 5 .. 5;
Reserved_6_27 at 0 range 6 .. 27;
ADVREGEN at 0 range 28 .. 28;
DEEPPWD at 0 range 29 .. 29;
ADCALDIF at 0 range 30 .. 30;
ADCAL at 0 range 31 .. 31;
end record;
subtype CFGR_RES_Field is HAL.UInt2;
subtype CFGR_EXTSEL_Field is HAL.UInt4;
subtype CFGR_EXTEN_Field is HAL.UInt2;
subtype CFGR_DISCNUM_Field is HAL.UInt3;
subtype CFGR_AWDCH1CH_Field is HAL.UInt5;
-- configuration register
type CFGR_Register is record
-- DMAEN
DMAEN : Boolean := False;
-- DMACFG
DMACFG : Boolean := False;
-- unspecified
Reserved_2_2 : HAL.Bit := 16#0#;
-- RES
RES : CFGR_RES_Field := 16#0#;
-- ALIGN
ALIGN : Boolean := False;
-- EXTSEL
EXTSEL : CFGR_EXTSEL_Field := 16#0#;
-- EXTEN
EXTEN : CFGR_EXTEN_Field := 16#0#;
-- OVRMOD
OVRMOD : Boolean := False;
-- CONT
CONT : Boolean := False;
-- AUTDLY
AUTDLY : Boolean := False;
-- unspecified
Reserved_15_15 : HAL.Bit := 16#0#;
-- DISCEN
DISCEN : Boolean := False;
-- DISCNUM
DISCNUM : CFGR_DISCNUM_Field := 16#0#;
-- JDISCEN
JDISCEN : Boolean := False;
-- JQM
JQM : Boolean := False;
-- AWD1SGL
AWD1SGL : Boolean := False;
-- AWD1EN
AWD1EN : Boolean := False;
-- JAWD1EN
JAWD1EN : Boolean := False;
-- JAUTO
JAUTO : Boolean := False;
-- AWDCH1CH
AWDCH1CH : CFGR_AWDCH1CH_Field := 16#0#;
-- JQDIS
JQDIS : Boolean := False;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CFGR_Register use record
DMAEN at 0 range 0 .. 0;
DMACFG at 0 range 1 .. 1;
Reserved_2_2 at 0 range 2 .. 2;
RES at 0 range 3 .. 4;
ALIGN at 0 range 5 .. 5;
EXTSEL at 0 range 6 .. 9;
EXTEN at 0 range 10 .. 11;
OVRMOD at 0 range 12 .. 12;
CONT at 0 range 13 .. 13;
AUTDLY at 0 range 14 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
DISCEN at 0 range 16 .. 16;
DISCNUM at 0 range 17 .. 19;
JDISCEN at 0 range 20 .. 20;
JQM at 0 range 21 .. 21;
AWD1SGL at 0 range 22 .. 22;
AWD1EN at 0 range 23 .. 23;
JAWD1EN at 0 range 24 .. 24;
JAUTO at 0 range 25 .. 25;
AWDCH1CH at 0 range 26 .. 30;
JQDIS at 0 range 31 .. 31;
end record;
subtype CFGR2_OVSR_Field is HAL.UInt3;
subtype CFGR2_OVSS_Field is HAL.UInt4;
-- configuration register
type CFGR2_Register is record
-- DMAEN
ROVSE : Boolean := False;
-- DMACFG
JOVSE : Boolean := False;
-- RES
OVSR : CFGR2_OVSR_Field := 16#0#;
-- ALIGN
OVSS : CFGR2_OVSS_Field := 16#0#;
-- EXTSEL
TOVS : Boolean := False;
-- EXTEN
ROVSM : Boolean := False;
-- unspecified
Reserved_11_31 : HAL.UInt21 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CFGR2_Register use record
ROVSE at 0 range 0 .. 0;
JOVSE at 0 range 1 .. 1;
OVSR at 0 range 2 .. 4;
OVSS at 0 range 5 .. 8;
TOVS at 0 range 9 .. 9;
ROVSM at 0 range 10 .. 10;
Reserved_11_31 at 0 range 11 .. 31;
end record;
-- SMPR1_SMP array element
subtype SMPR1_SMP_Element is HAL.UInt3;
-- SMPR1_SMP array
type SMPR1_SMP_Field_Array is array (0 .. 9) of SMPR1_SMP_Element
with Component_Size => 3, Size => 30;
-- Type definition for SMPR1_SMP
type SMPR1_SMP_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- SMP as a value
Val : HAL.UInt30;
when True =>
-- SMP as an array
Arr : SMPR1_SMP_Field_Array;
end case;
end record
with Unchecked_Union, Size => 30;
for SMPR1_SMP_Field use record
Val at 0 range 0 .. 29;
Arr at 0 range 0 .. 29;
end record;
-- sample time register 1
type SMPR1_Register is record
-- SMP0
SMP : SMPR1_SMP_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_30_31 : HAL.UInt2 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SMPR1_Register use record
SMP at 0 range 0 .. 29;
Reserved_30_31 at 0 range 30 .. 31;
end record;
-- SMPR2_SMP array element
subtype SMPR2_SMP_Element is HAL.UInt3;
-- SMPR2_SMP array
type SMPR2_SMP_Field_Array is array (10 .. 18) of SMPR2_SMP_Element
with Component_Size => 3, Size => 27;
-- Type definition for SMPR2_SMP
type SMPR2_SMP_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- SMP as a value
Val : HAL.UInt27;
when True =>
-- SMP as an array
Arr : SMPR2_SMP_Field_Array;
end case;
end record
with Unchecked_Union, Size => 27;
for SMPR2_SMP_Field use record
Val at 0 range 0 .. 26;
Arr at 0 range 0 .. 26;
end record;
-- sample time register 2
type SMPR2_Register is record
-- SMP10
SMP : SMPR2_SMP_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_27_31 : HAL.UInt5 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SMPR2_Register use record
SMP at 0 range 0 .. 26;
Reserved_27_31 at 0 range 27 .. 31;
end record;
subtype TR1_LT1_Field is HAL.UInt12;
subtype TR1_HT1_Field is HAL.UInt12;
-- watchdog threshold register 1
type TR1_Register is record
-- LT1
LT1 : TR1_LT1_Field := 16#0#;
-- unspecified
Reserved_12_15 : HAL.UInt4 := 16#0#;
-- HT1
HT1 : TR1_HT1_Field := 16#FFF#;
-- unspecified
Reserved_28_31 : HAL.UInt4 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for TR1_Register use record
LT1 at 0 range 0 .. 11;
Reserved_12_15 at 0 range 12 .. 15;
HT1 at 0 range 16 .. 27;
Reserved_28_31 at 0 range 28 .. 31;
end record;
subtype TR2_LT2_Field is HAL.UInt8;
subtype TR2_HT2_Field is HAL.UInt8;
-- watchdog threshold register
type TR2_Register is record
-- LT2
LT2 : TR2_LT2_Field := 16#0#;
-- unspecified
Reserved_8_15 : HAL.UInt8 := 16#0#;
-- HT2
HT2 : TR2_HT2_Field := 16#FF#;
-- unspecified
Reserved_24_31 : HAL.UInt8 := 16#F#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for TR2_Register use record
LT2 at 0 range 0 .. 7;
Reserved_8_15 at 0 range 8 .. 15;
HT2 at 0 range 16 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
subtype TR3_LT3_Field is HAL.UInt8;
subtype TR3_HT3_Field is HAL.UInt8;
-- watchdog threshold register 3
type TR3_Register is record
-- LT3
LT3 : TR3_LT3_Field := 16#0#;
-- unspecified
Reserved_8_15 : HAL.UInt8 := 16#0#;
-- HT3
HT3 : TR3_HT3_Field := 16#FF#;
-- unspecified
Reserved_24_31 : HAL.UInt8 := 16#F#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for TR3_Register use record
LT3 at 0 range 0 .. 7;
Reserved_8_15 at 0 range 8 .. 15;
HT3 at 0 range 16 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
subtype SQR1_L_Field is HAL.UInt4;
subtype SQR1_SQ1_Field is HAL.UInt5;
subtype SQR1_SQ2_Field is HAL.UInt5;
subtype SQR1_SQ3_Field is HAL.UInt5;
subtype SQR1_SQ4_Field is HAL.UInt5;
-- regular sequence register 1
type SQR1_Register is record
-- L
L : SQR1_L_Field := 16#0#;
-- unspecified
Reserved_4_5 : HAL.UInt2 := 16#0#;
-- SQ1
SQ1 : SQR1_SQ1_Field := 16#0#;
-- unspecified
Reserved_11_11 : HAL.Bit := 16#0#;
-- SQ2
SQ2 : SQR1_SQ2_Field := 16#0#;
-- unspecified
Reserved_17_17 : HAL.Bit := 16#0#;
-- SQ3
SQ3 : SQR1_SQ3_Field := 16#0#;
-- unspecified
Reserved_23_23 : HAL.Bit := 16#0#;
-- SQ4
SQ4 : SQR1_SQ4_Field := 16#0#;
-- unspecified
Reserved_29_31 : HAL.UInt3 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SQR1_Register use record
L at 0 range 0 .. 3;
Reserved_4_5 at 0 range 4 .. 5;
SQ1 at 0 range 6 .. 10;
Reserved_11_11 at 0 range 11 .. 11;
SQ2 at 0 range 12 .. 16;
Reserved_17_17 at 0 range 17 .. 17;
SQ3 at 0 range 18 .. 22;
Reserved_23_23 at 0 range 23 .. 23;
SQ4 at 0 range 24 .. 28;
Reserved_29_31 at 0 range 29 .. 31;
end record;
subtype SQR2_SQ5_Field is HAL.UInt5;
subtype SQR2_SQ6_Field is HAL.UInt5;
subtype SQR2_SQ7_Field is HAL.UInt5;
subtype SQR2_SQ8_Field is HAL.UInt5;
subtype SQR2_SQ9_Field is HAL.UInt5;
-- regular sequence register 2
type SQR2_Register is record
-- SQ5
SQ5 : SQR2_SQ5_Field := 16#0#;
-- unspecified
Reserved_5_5 : HAL.Bit := 16#0#;
-- SQ6
SQ6 : SQR2_SQ6_Field := 16#0#;
-- unspecified
Reserved_11_11 : HAL.Bit := 16#0#;
-- SQ7
SQ7 : SQR2_SQ7_Field := 16#0#;
-- unspecified
Reserved_17_17 : HAL.Bit := 16#0#;
-- SQ8
SQ8 : SQR2_SQ8_Field := 16#0#;
-- unspecified
Reserved_23_23 : HAL.Bit := 16#0#;
-- SQ9
SQ9 : SQR2_SQ9_Field := 16#0#;
-- unspecified
Reserved_29_31 : HAL.UInt3 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SQR2_Register use record
SQ5 at 0 range 0 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
SQ6 at 0 range 6 .. 10;
Reserved_11_11 at 0 range 11 .. 11;
SQ7 at 0 range 12 .. 16;
Reserved_17_17 at 0 range 17 .. 17;
SQ8 at 0 range 18 .. 22;
Reserved_23_23 at 0 range 23 .. 23;
SQ9 at 0 range 24 .. 28;
Reserved_29_31 at 0 range 29 .. 31;
end record;
subtype SQR3_SQ10_Field is HAL.UInt5;
subtype SQR3_SQ11_Field is HAL.UInt5;
subtype SQR3_SQ12_Field is HAL.UInt5;
subtype SQR3_SQ13_Field is HAL.UInt5;
subtype SQR3_SQ14_Field is HAL.UInt5;
-- regular sequence register 3
type SQR3_Register is record
-- SQ10
SQ10 : SQR3_SQ10_Field := 16#0#;
-- unspecified
Reserved_5_5 : HAL.Bit := 16#0#;
-- SQ11
SQ11 : SQR3_SQ11_Field := 16#0#;
-- unspecified
Reserved_11_11 : HAL.Bit := 16#0#;
-- SQ12
SQ12 : SQR3_SQ12_Field := 16#0#;
-- unspecified
Reserved_17_17 : HAL.Bit := 16#0#;
-- SQ13
SQ13 : SQR3_SQ13_Field := 16#0#;
-- unspecified
Reserved_23_23 : HAL.Bit := 16#0#;
-- SQ14
SQ14 : SQR3_SQ14_Field := 16#0#;
-- unspecified
Reserved_29_31 : HAL.UInt3 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SQR3_Register use record
SQ10 at 0 range 0 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
SQ11 at 0 range 6 .. 10;
Reserved_11_11 at 0 range 11 .. 11;
SQ12 at 0 range 12 .. 16;
Reserved_17_17 at 0 range 17 .. 17;
SQ13 at 0 range 18 .. 22;
Reserved_23_23 at 0 range 23 .. 23;
SQ14 at 0 range 24 .. 28;
Reserved_29_31 at 0 range 29 .. 31;
end record;
subtype SQR4_SQ15_Field is HAL.UInt5;
subtype SQR4_SQ16_Field is HAL.UInt5;
-- regular sequence register 4
type SQR4_Register is record
-- SQ15
SQ15 : SQR4_SQ15_Field := 16#0#;
-- unspecified
Reserved_5_5 : HAL.Bit := 16#0#;
-- SQ16
SQ16 : SQR4_SQ16_Field := 16#0#;
-- unspecified
Reserved_11_31 : HAL.UInt21 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SQR4_Register use record
SQ15 at 0 range 0 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
SQ16 at 0 range 6 .. 10;
Reserved_11_31 at 0 range 11 .. 31;
end record;
subtype DR_regularDATA_Field is HAL.UInt16;
-- regular Data Register
type DR_Register is record
-- Read-only. regularDATA
regularDATA : DR_regularDATA_Field;
-- unspecified
Reserved_16_31 : HAL.UInt16;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for DR_Register use record
regularDATA at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype JSQR_JL_Field is HAL.UInt2;
subtype JSQR_JEXTSEL_Field is HAL.UInt4;
subtype JSQR_JEXTEN_Field is HAL.UInt2;
subtype JSQR_JSQ1_Field is HAL.UInt5;
subtype JSQR_JSQ2_Field is HAL.UInt5;
subtype JSQR_JSQ3_Field is HAL.UInt5;
subtype JSQR_JSQ4_Field is HAL.UInt5;
-- injected sequence register
type JSQR_Register is record
-- JL
JL : JSQR_JL_Field := 16#0#;
-- JEXTSEL
JEXTSEL : JSQR_JEXTSEL_Field := 16#0#;
-- JEXTEN
JEXTEN : JSQR_JEXTEN_Field := 16#0#;
-- JSQ1
JSQ1 : JSQR_JSQ1_Field := 16#0#;
-- unspecified
Reserved_13_13 : HAL.Bit := 16#0#;
-- JSQ2
JSQ2 : JSQR_JSQ2_Field := 16#0#;
-- unspecified
Reserved_19_19 : HAL.Bit := 16#0#;
-- JSQ3
JSQ3 : JSQR_JSQ3_Field := 16#0#;
-- unspecified
Reserved_25_25 : HAL.Bit := 16#0#;
-- JSQ4
JSQ4 : JSQR_JSQ4_Field := 16#0#;
-- unspecified
Reserved_31_31 : HAL.Bit := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for JSQR_Register use record
JL at 0 range 0 .. 1;
JEXTSEL at 0 range 2 .. 5;
JEXTEN at 0 range 6 .. 7;
JSQ1 at 0 range 8 .. 12;
Reserved_13_13 at 0 range 13 .. 13;
JSQ2 at 0 range 14 .. 18;
Reserved_19_19 at 0 range 19 .. 19;
JSQ3 at 0 range 20 .. 24;
Reserved_25_25 at 0 range 25 .. 25;
JSQ4 at 0 range 26 .. 30;
Reserved_31_31 at 0 range 31 .. 31;
end record;
subtype OFR1_OFFSET1_Field is HAL.UInt12;
subtype OFR1_OFFSET1_CH_Field is HAL.UInt5;
-- offset register 1
type OFR1_Register is record
-- OFFSET1
OFFSET1 : OFR1_OFFSET1_Field := 16#0#;
-- unspecified
Reserved_12_25 : HAL.UInt14 := 16#0#;
-- OFFSET1_CH
OFFSET1_CH : OFR1_OFFSET1_CH_Field := 16#0#;
-- OFFSET1_EN
OFFSET1_EN : Boolean := False;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for OFR1_Register use record
OFFSET1 at 0 range 0 .. 11;
Reserved_12_25 at 0 range 12 .. 25;
OFFSET1_CH at 0 range 26 .. 30;
OFFSET1_EN at 0 range 31 .. 31;
end record;
subtype OFR2_OFFSET2_Field is HAL.UInt12;
subtype OFR2_OFFSET2_CH_Field is HAL.UInt5;
-- offset register 2
type OFR2_Register is record
-- OFFSET2
OFFSET2 : OFR2_OFFSET2_Field := 16#0#;
-- unspecified
Reserved_12_25 : HAL.UInt14 := 16#0#;
-- OFFSET2_CH
OFFSET2_CH : OFR2_OFFSET2_CH_Field := 16#0#;
-- OFFSET2_EN
OFFSET2_EN : Boolean := False;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for OFR2_Register use record
OFFSET2 at 0 range 0 .. 11;
Reserved_12_25 at 0 range 12 .. 25;
OFFSET2_CH at 0 range 26 .. 30;
OFFSET2_EN at 0 range 31 .. 31;
end record;
subtype OFR3_OFFSET3_Field is HAL.UInt12;
subtype OFR3_OFFSET3_CH_Field is HAL.UInt5;
-- offset register 3
type OFR3_Register is record
-- OFFSET3
OFFSET3 : OFR3_OFFSET3_Field := 16#0#;
-- unspecified
Reserved_12_25 : HAL.UInt14 := 16#0#;
-- OFFSET3_CH
OFFSET3_CH : OFR3_OFFSET3_CH_Field := 16#0#;
-- OFFSET3_EN
OFFSET3_EN : Boolean := False;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for OFR3_Register use record
OFFSET3 at 0 range 0 .. 11;
Reserved_12_25 at 0 range 12 .. 25;
OFFSET3_CH at 0 range 26 .. 30;
OFFSET3_EN at 0 range 31 .. 31;
end record;
subtype OFR4_OFFSET4_Field is HAL.UInt12;
subtype OFR4_OFFSET4_CH_Field is HAL.UInt5;
-- offset register 4
type OFR4_Register is record
-- OFFSET4
OFFSET4 : OFR4_OFFSET4_Field := 16#0#;
-- unspecified
Reserved_12_25 : HAL.UInt14 := 16#0#;
-- OFFSET4_CH
OFFSET4_CH : OFR4_OFFSET4_CH_Field := 16#0#;
-- OFFSET4_EN
OFFSET4_EN : Boolean := False;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for OFR4_Register use record
OFFSET4 at 0 range 0 .. 11;
Reserved_12_25 at 0 range 12 .. 25;
OFFSET4_CH at 0 range 26 .. 30;
OFFSET4_EN at 0 range 31 .. 31;
end record;
subtype JDR1_JDATA1_Field is HAL.UInt16;
-- injected data register 1
type JDR1_Register is record
-- Read-only. JDATA1
JDATA1 : JDR1_JDATA1_Field;
-- unspecified
Reserved_16_31 : HAL.UInt16;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for JDR1_Register use record
JDATA1 at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype JDR2_JDATA2_Field is HAL.UInt16;
-- injected data register 2
type JDR2_Register is record
-- Read-only. JDATA2
JDATA2 : JDR2_JDATA2_Field;
-- unspecified
Reserved_16_31 : HAL.UInt16;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for JDR2_Register use record
JDATA2 at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype JDR3_JDATA3_Field is HAL.UInt16;
-- injected data register 3
type JDR3_Register is record
-- Read-only. JDATA3
JDATA3 : JDR3_JDATA3_Field;
-- unspecified
Reserved_16_31 : HAL.UInt16;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for JDR3_Register use record
JDATA3 at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype JDR4_JDATA4_Field is HAL.UInt16;
-- injected data register 4
type JDR4_Register is record
-- Read-only. JDATA4
JDATA4 : JDR4_JDATA4_Field;
-- unspecified
Reserved_16_31 : HAL.UInt16;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for JDR4_Register use record
JDATA4 at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype AWD2CR_AWD2CH_Field is HAL.UInt19;
-- Analog Watchdog 2 Configuration Register
type AWD2CR_Register is record
-- AWD2CH
AWD2CH : AWD2CR_AWD2CH_Field := 16#0#;
-- unspecified
Reserved_19_31 : HAL.UInt13 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for AWD2CR_Register use record
AWD2CH at 0 range 0 .. 18;
Reserved_19_31 at 0 range 19 .. 31;
end record;
subtype AWD3CR_AWD3CH_Field is HAL.UInt19;
-- Analog Watchdog 3 Configuration Register
type AWD3CR_Register is record
-- AWD3CH
AWD3CH : AWD3CR_AWD3CH_Field := 16#0#;
-- unspecified
Reserved_19_31 : HAL.UInt13 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for AWD3CR_Register use record
AWD3CH at 0 range 0 .. 18;
Reserved_19_31 at 0 range 19 .. 31;
end record;
subtype DIFSEL_DIFSEL_1_15_Field is HAL.UInt15;
subtype DIFSEL_DIFSEL_16_18_Field is HAL.UInt3;
-- Differential Mode Selection Register 2
type DIFSEL_Register is record
-- Read-only. Differential mode for channel 0
DIFSEL_0 : Boolean := False;
-- Differential mode for channels 15 to 1
DIFSEL_1_15 : DIFSEL_DIFSEL_1_15_Field := 16#0#;
-- Read-only. Differential mode for channels 18 to 16
DIFSEL_16_18 : DIFSEL_DIFSEL_16_18_Field := 16#0#;
-- unspecified
Reserved_19_31 : HAL.UInt13 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for DIFSEL_Register use record
DIFSEL_0 at 0 range 0 .. 0;
DIFSEL_1_15 at 0 range 1 .. 15;
DIFSEL_16_18 at 0 range 16 .. 18;
Reserved_19_31 at 0 range 19 .. 31;
end record;
subtype CALFACT_CALFACT_S_Field is HAL.UInt7;
subtype CALFACT_CALFACT_D_Field is HAL.UInt7;
-- Calibration Factors
type CALFACT_Register is record
-- CALFACT_S
CALFACT_S : CALFACT_CALFACT_S_Field := 16#0#;
-- unspecified
Reserved_7_15 : HAL.UInt9 := 16#0#;
-- CALFACT_D
CALFACT_D : CALFACT_CALFACT_D_Field := 16#0#;
-- unspecified
Reserved_23_31 : HAL.UInt9 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CALFACT_Register use record
CALFACT_S at 0 range 0 .. 6;
Reserved_7_15 at 0 range 7 .. 15;
CALFACT_D at 0 range 16 .. 22;
Reserved_23_31 at 0 range 23 .. 31;
end record;
-- ADC Common status register
type CSR_Register is record
-- Read-only. ADDRDY_MST
ADDRDY_MST : Boolean;
-- Read-only. EOSMP_MST
EOSMP_MST : Boolean;
-- Read-only. EOC_MST
EOC_MST : Boolean;
-- Read-only. EOS_MST
EOS_MST : Boolean;
-- Read-only. OVR_MST
OVR_MST : Boolean;
-- Read-only. JEOC_MST
JEOC_MST : Boolean;
-- Read-only. JEOS_MST
JEOS_MST : Boolean;
-- Read-only. AWD1_MST
AWD1_MST : Boolean;
-- Read-only. AWD2_MST
AWD2_MST : Boolean;
-- Read-only. AWD3_MST
AWD3_MST : Boolean;
-- Read-only. JQOVF_MST
JQOVF_MST : Boolean;
-- unspecified
Reserved_11_15 : HAL.UInt5;
-- Read-only. ADRDY_SLV
ADRDY_SLV : Boolean;
-- Read-only. EOSMP_SLV
EOSMP_SLV : Boolean;
-- Read-only. End of regular conversion of the slave ADC
EOC_SLV : Boolean;
-- Read-only. End of regular sequence flag of the slave ADC
EOS_SLV : Boolean;
-- Read-only. Overrun flag of the slave ADC
OVR_SLV : Boolean;
-- Read-only. End of injected conversion flag of the slave ADC
JEOC_SLV : Boolean;
-- Read-only. End of injected sequence flag of the slave ADC
JEOS_SLV : Boolean;
-- Read-only. Analog watchdog 1 flag of the slave ADC
AWD1_SLV : Boolean;
-- Read-only. Analog watchdog 2 flag of the slave ADC
AWD2_SLV : Boolean;
-- Read-only. Analog watchdog 3 flag of the slave ADC
AWD3_SLV : Boolean;
-- Read-only. Injected Context Queue Overflow flag of the slave ADC
JQOVF_SLV : Boolean;
-- unspecified
Reserved_27_31 : HAL.UInt5;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CSR_Register use record
ADDRDY_MST at 0 range 0 .. 0;
EOSMP_MST at 0 range 1 .. 1;
EOC_MST at 0 range 2 .. 2;
EOS_MST at 0 range 3 .. 3;
OVR_MST at 0 range 4 .. 4;
JEOC_MST at 0 range 5 .. 5;
JEOS_MST at 0 range 6 .. 6;
AWD1_MST at 0 range 7 .. 7;
AWD2_MST at 0 range 8 .. 8;
AWD3_MST at 0 range 9 .. 9;
JQOVF_MST at 0 range 10 .. 10;
Reserved_11_15 at 0 range 11 .. 15;
ADRDY_SLV at 0 range 16 .. 16;
EOSMP_SLV at 0 range 17 .. 17;
EOC_SLV at 0 range 18 .. 18;
EOS_SLV at 0 range 19 .. 19;
OVR_SLV at 0 range 20 .. 20;
JEOC_SLV at 0 range 21 .. 21;
JEOS_SLV at 0 range 22 .. 22;
AWD1_SLV at 0 range 23 .. 23;
AWD2_SLV at 0 range 24 .. 24;
AWD3_SLV at 0 range 25 .. 25;
JQOVF_SLV at 0 range 26 .. 26;
Reserved_27_31 at 0 range 27 .. 31;
end record;
subtype CCR_DUAL_Field is HAL.UInt5;
subtype CCR_DELAY_Field is HAL.UInt4;
subtype CCR_MDMA_Field is HAL.UInt2;
subtype CCR_CKMODE_Field is HAL.UInt2;
subtype CCR_PRESC_Field is HAL.UInt4;
-- ADC common control register
type CCR_Register is record
-- Dual ADC mode selection
DUAL : CCR_DUAL_Field := 16#0#;
-- unspecified
Reserved_5_7 : HAL.UInt3 := 16#0#;
-- Delay between 2 sampling phases
DELAY_k : CCR_DELAY_Field := 16#0#;
-- unspecified
Reserved_12_12 : HAL.Bit := 16#0#;
-- DMA configuration (for multi-ADC mode)
DMACFG : Boolean := False;
-- Direct memory access mode for multi ADC mode
MDMA : CCR_MDMA_Field := 16#0#;
-- ADC clock mode
CKMODE : CCR_CKMODE_Field := 16#0#;
-- ADC prescaler
PRESC : CCR_PRESC_Field := 16#0#;
-- VREFINT enable
VREFEN : Boolean := False;
-- CH17SEL
CH17SEL : Boolean := False;
-- CH18SEL
CH18SEL : Boolean := False;
-- unspecified
Reserved_25_31 : HAL.UInt7 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCR_Register use record
DUAL at 0 range 0 .. 4;
Reserved_5_7 at 0 range 5 .. 7;
DELAY_k at 0 range 8 .. 11;
Reserved_12_12 at 0 range 12 .. 12;
DMACFG at 0 range 13 .. 13;
MDMA at 0 range 14 .. 15;
CKMODE at 0 range 16 .. 17;
PRESC at 0 range 18 .. 21;
VREFEN at 0 range 22 .. 22;
CH17SEL at 0 range 23 .. 23;
CH18SEL at 0 range 24 .. 24;
Reserved_25_31 at 0 range 25 .. 31;
end record;
subtype CDR_RDATA_MST_Field is HAL.UInt16;
subtype CDR_RDATA_SLV_Field is HAL.UInt16;
-- ADC common regular data register for dual and triple modes
type CDR_Register is record
-- Read-only. Regular data of the master ADC
RDATA_MST : CDR_RDATA_MST_Field;
-- Read-only. Regular data of the slave ADC
RDATA_SLV : CDR_RDATA_SLV_Field;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CDR_Register use record
RDATA_MST at 0 range 0 .. 15;
RDATA_SLV at 0 range 16 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Analog-to-Digital Converter
type ADC1_Peripheral is record
-- interrupt and status register
ISR : aliased ISR_Register;
-- interrupt enable register
IER : aliased IER_Register;
-- control register
CR : aliased CR_Register;
-- configuration register
CFGR : aliased CFGR_Register;
-- configuration register
CFGR2 : aliased CFGR2_Register;
-- sample time register 1
SMPR1 : aliased SMPR1_Register;
-- sample time register 2
SMPR2 : aliased SMPR2_Register;
-- watchdog threshold register 1
TR1 : aliased TR1_Register;
-- watchdog threshold register
TR2 : aliased TR2_Register;
-- watchdog threshold register 3
TR3 : aliased TR3_Register;
-- regular sequence register 1
SQR1 : aliased SQR1_Register;
-- regular sequence register 2
SQR2 : aliased SQR2_Register;
-- regular sequence register 3
SQR3 : aliased SQR3_Register;
-- regular sequence register 4
SQR4 : aliased SQR4_Register;
-- regular Data Register
DR : aliased DR_Register;
-- injected sequence register
JSQR : aliased JSQR_Register;
-- offset register 1
OFR1 : aliased OFR1_Register;
-- offset register 2
OFR2 : aliased OFR2_Register;
-- offset register 3
OFR3 : aliased OFR3_Register;
-- offset register 4
OFR4 : aliased OFR4_Register;
-- injected data register 1
JDR1 : aliased JDR1_Register;
-- injected data register 2
JDR2 : aliased JDR2_Register;
-- injected data register 3
JDR3 : aliased JDR3_Register;
-- injected data register 4
JDR4 : aliased JDR4_Register;
-- Analog Watchdog 2 Configuration Register
AWD2CR : aliased AWD2CR_Register;
-- Analog Watchdog 3 Configuration Register
AWD3CR : aliased AWD3CR_Register;
-- Differential Mode Selection Register 2
DIFSEL : aliased DIFSEL_Register;
-- Calibration Factors
CALFACT : aliased CALFACT_Register;
end record
with Volatile;
for ADC1_Peripheral use record
ISR at 16#0# range 0 .. 31;
IER at 16#4# range 0 .. 31;
CR at 16#8# range 0 .. 31;
CFGR at 16#C# range 0 .. 31;
CFGR2 at 16#10# range 0 .. 31;
SMPR1 at 16#14# range 0 .. 31;
SMPR2 at 16#18# range 0 .. 31;
TR1 at 16#20# range 0 .. 31;
TR2 at 16#24# range 0 .. 31;
TR3 at 16#28# range 0 .. 31;
SQR1 at 16#30# range 0 .. 31;
SQR2 at 16#34# range 0 .. 31;
SQR3 at 16#38# range 0 .. 31;
SQR4 at 16#3C# range 0 .. 31;
DR at 16#40# range 0 .. 31;
JSQR at 16#4C# range 0 .. 31;
OFR1 at 16#60# range 0 .. 31;
OFR2 at 16#64# range 0 .. 31;
OFR3 at 16#68# range 0 .. 31;
OFR4 at 16#6C# range 0 .. 31;
JDR1 at 16#80# range 0 .. 31;
JDR2 at 16#84# range 0 .. 31;
JDR3 at 16#88# range 0 .. 31;
JDR4 at 16#8C# range 0 .. 31;
AWD2CR at 16#A0# range 0 .. 31;
AWD3CR at 16#A4# range 0 .. 31;
DIFSEL at 16#B0# range 0 .. 31;
CALFACT at 16#B4# range 0 .. 31;
end record;
-- Analog-to-Digital Converter
ADC1_Periph : aliased ADC1_Peripheral
with Import, Address => ADC1_Base;
-- Analog-to-Digital Converter
ADC2_Periph : aliased ADC1_Peripheral
with Import, Address => ADC2_Base;
-- Analog-to-Digital Converter
ADC3_Periph : aliased ADC1_Peripheral
with Import, Address => ADC3_Base;
-- Analog-to-Digital Converter
type ADC123_Common_Peripheral is record
-- ADC Common status register
CSR : aliased CSR_Register;
-- ADC common control register
CCR : aliased CCR_Register;
-- ADC common regular data register for dual and triple modes
CDR : aliased CDR_Register;
end record
with Volatile;
for ADC123_Common_Peripheral use record
CSR at 16#0# range 0 .. 31;
CCR at 16#8# range 0 .. 31;
CDR at 16#C# range 0 .. 31;
end record;
-- Analog-to-Digital Converter
ADC123_Common_Periph : aliased ADC123_Common_Peripheral
with Import, Address => ADC123_Common_Base;
end STM32_SVD.ADC;
| 31.824621 | 76 | 0.564143 |
10272a49ae14e9b24343221608887bd0c9973c92 | 245 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/capture_value.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/capture_value.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/capture_value.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- { dg-do run }
procedure capture_value is
x : integer := 0;
begin
declare
z : integer renames x;
begin
z := 3;
x := 5;
z := z + 1;
if z /= 6 then
raise Program_Error;
end if;
end;
end;
| 14.411765 | 29 | 0.477551 |
1c441236f89f3bb0a3bd79c16fa83d886815505d | 6,868 | ads | Ada | src/Sym_Expr/test/test_report.ads | fintatarta/eugen | 2c384838ff0e81b51172310ce5d0e47d71ffd4fd | [
"MIT"
] | null | null | null | src/Sym_Expr/test/test_report.ads | fintatarta/eugen | 2c384838ff0e81b51172310ce5d0e47d71ffd4fd | [
"MIT"
] | null | null | null | src/Sym_Expr/test/test_report.ads | fintatarta/eugen | 2c384838ff0e81b51172310ce5d0e47d71ffd4fd | [
"MIT"
] | null | null | null | -----------------------------------------------------------------------------
-- Symbolic Expressions (symexpr)
--
-- Copyright (C) 2012, Riccardo Bernardini
--
-- This file is part of symexpr.
--
-- symexpr is free software: you can redistribute it and/or modify
-- it under the terms of the Lesser GNU General Public License as published by
-- the Free Software Foundation, either version 3 of the License, or
-- (at your option) any later version.
--
-- symexpr 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 Lesser GNU General Public License
-- along with gclp. If not, see <http://www.gnu.org/licenses/>.
----------------------------------------------------------------------------
-- -*- Mode: Ada -*-
-- Filename : test_report.ads
-- Description : Handy package to print test results
-- Author : Riccardo Bernardini
-- Created On : Thu Jul 3 07:49:02 2008
-- Last Modified By: .
-- Last Modified On: .
-- Update Count : 0
-- Status : Beta
--
-- This package provides some procedures which can be handy
-- when writing test code. Our reference model is the
-- following: a test program contains several "test suites",
-- where each suite is just a collection of sets. A suite
-- is SUCCESSful if all the tests in the suite passed.
--
-- A variable of type Reporter_Type is an object which can keep
-- track of the passed/not passed test/suites. The way to
-- use a Reporter_Type is quite simple:
--
-- Reporter : Reporter_Type; -- Create the object
--
-- while ... loop -- first test suite
--
-- new_result(Rep => reporter, -- Accumulate test
-- OK => expected = actual); -- results
-- end loop;
--
-- new_suite(reporter); -- start a new suite
--
-- while ... loop -- second test suite
--
-- if (OK) then
-- success(reporter); -- An alternative way
-- else -- of accumulating
-- failure(reporter); -- test results
-- end if;
-- end loop;
--
-- final(reporter); -- Print final report
-- -- and set Exit_Status
--
--
-- Each time New_Suite is called it prints on the stdout
-- a string of type
--
-- Passed ... out of ... tests: (SUCCESS | FAILED)
--
with Ada.Command_Line;
with Ada.Containers.Doubly_Linked_Lists;
with Ada.Strings.Unbounded, Text_Io;
use Ada.Strings.Unbounded, Text_Io;
package Test_Report is
package CL renames Ada.Command_Line;
type Reporter_Type is tagged private;
procedure Be_Verbose (This : in out Reporter_Type;
Flag : in Boolean := True);
--
-- By default the reports are printed to the standard error. This
-- procedure allows one to change such a default.
--
procedure Set_Output (This : in out Reporter_Type;
File : in File_Access);
procedure Set_Tab (This : in out Reporter_Type;
Tab : in Positive);
--
-- Start a new suite. It is possible to give to the suite
-- a descriptive name. This function implicitly closes the
-- current suite and prints the corresponding results.
--
procedure New_Suite (This : in out Reporter_Type;
Name : in String := "");
--
-- Register the result of a new test.
--
procedure New_Result (This : in out Reporter_Type;
Ok : in Boolean);
--
-- Equivalent to New_Result(This, True);
--
procedure Success (This : in out Reporter_Type);
--
-- Equivalent to New_Result(This, False);
--
procedure Failure (This : in out Reporter_Type);
--
-- Print a final report and, if required, sets the
-- exit status to Success if and only if all the
-- tests succeded.
--
procedure Final (This : in out Reporter_Type;
Set_Status : in Boolean := True);
--
-- Generic procedure to run an "array of tests". Typically
-- Test_Case will be a record which holds the values necessary
-- for the tests. For example, in order to test a "sum" function
-- one could write
--
-- type Sum_Case is
-- record
-- Left, Right : Integer;
-- Expected : Integer;
-- end record;
--
-- type Sum_Case_Array is
-- array(positive range <>) of Sum_Case;
--
-- Cases : Sum_Case_Array := ((left => 4, right => 3, result => 7),
-- (left => 2, right => 3, result => 5),
-- (left => 3, right => 5, result => 8));
--
-- function Check_Sum(X : Sum_Case)
-- return Boolean is
-- begin
-- return (Sum(X.Left, X.Right) = X.Result);
-- end Check_Sum;
--
-- Finally, the procedure would be instantiated
--
-- procedure Sum_Test is
-- new Do_Suite (Test_Case => Sum_Case,
-- Test_Case_Array => Sum_Case_Array,
-- Check => Check_Sum);
--
-- and run as
--
-- Sum_Test(Reporter, Cases);
--
generic
type Test_Case is private;
type Test_Case_Array is
array(Positive range <>) of Test_Case;
with function Check(This_Case : Test_Case) return Boolean;
procedure Do_Suite (This : in out Reporter_Type;
Cases : in Test_Case_Array;
Name : in String := "");
private
package Boolean_Lists is
new Ada.Containers.Doubly_Linked_Lists (Boolean);
type Reporter_Type is tagged
record
Status : CL.Exit_Status := CL.Success;
N_Suites : Natural := 0;
N_Suite_OK : Natural := 0;
N_Tests : Natural := 0;
N_Test_OK : Natural := 0;
Name : Unbounded_String;
Output_To : File_Access := Standard_Error;
Verbose : Boolean := False;
Tab : Positive := 35;
Suite_Results : Boolean_Lists.List;
end record;
end Test_Report;
-- Maybe Obsolete --
-- procedure Do_Report (This : in out Reporter_Type;
-- Num_Trials : in Positive;
-- Num_Success : in Natural;
-- Name : in String := "";
-- Set_Status : in Boolean := True);
| 32.861244 | 83 | 0.541642 |
23b6d8fee6372b588e0028bb98deb5770f2e099e | 14,113 | adb | Ada | modular_hashing-xxhash64.adb | annexi-strayline/ASAP-Modular_Hashing | a4684ca2030c2e8e33ae53a1fb08afc960d44fc2 | [
"BSD-3-Clause"
] | null | null | null | modular_hashing-xxhash64.adb | annexi-strayline/ASAP-Modular_Hashing | a4684ca2030c2e8e33ae53a1fb08afc960d44fc2 | [
"BSD-3-Clause"
] | null | null | null | modular_hashing-xxhash64.adb | annexi-strayline/ASAP-Modular_Hashing | a4684ca2030c2e8e33ae53a1fb08afc960d44fc2 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Modular Hash Infrastructure --
-- --
-- xxHash64 --
-- --
-- Pedantic Implementation --
-- --
-- ------------------------------------------------------------------------ --
-- --
-- Copyright (C) 2021, ANNEXI-STRAYLINE Trans-Human Ltd. --
-- All rights reserved. --
-- --
-- Original Contributors: --
-- * Richard Wai (ANNEXI-STRAYLINE) --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- --
-- * Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A --
-- PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- This implementation follows the official xxHash algorithm specification as
-- described at https://github.com/Cyan4973/xxHash (v 0.8.0).
--
-- The specification contains the following copyright notice:
--
-- Copyright (c) Yann Collet
--
-- Permission is granted to copy and distribute this document for any purpose
-- and without charge, including translations into other languages and
-- incorporation into compilations, provided that the copyright notice and this
-- notice are preserved, and that any substantive changes or deletions from the
-- original are clearly marked. Distribution of this document is unlimited.
package body Modular_Hashing.xxHash64 is
--
-- XXH64_Hash
--
function "<" (Left, Right : XXH64_Hash) return Boolean is
(Left.Digest < Right.Digest);
function ">" (Left, Right : XXH64_Hash) return Boolean is
(Left.Digest > Right.Digest);
function "=" (Left, Right : XXH64_Hash) return Boolean is
(Left.Digest = Right.Digest);
------------
-- Binary --
------------
function Binary (Value: XXH64_Hash) return Hash_Binary_Value is
V: Accumulator_Type := Value.Digest;
begin
return Bin: Hash_Binary_Value (1 .. XXH64_Hash_Bytes) do
for Byte of Bin loop
Byte := Unsigned_8 (V and 16#FF#);
V := Shift_Right (V, 8);
end loop;
end return;
end Binary;
--
-- XXH64_Engine
--
----------------
-- Lane_Round --
----------------
-- This is used during both Stripe_Round and Digest
procedure Lane_Round (Accumulator: in out Accumulator_Type;
Lane : in Accumulator_Type)
with Inline is begin
Accumulator := Accumulator + (Lane * PRIME64_2);
Accumulator := Rotate_Left (Accumulator, 31);
Accumulator := Accumulator * PRIME64_1;
end;
------------------
-- Stripe_Round -- "Step 2"
------------------
-- Stripe_Round executes one full strip round (32-bytes) on the engine.
-- This consumes the entire 32-byte Buffer (which must be full)
procedure Stripe_Round (Engine: in out XXH64_Engine) with
Inline,
Pre => Engine.Last_Element = Engine.Buffer'Last
is
Lanes : Accumulator_Array;
Accumulators: Accumulator_Array renames Engine.Accumulators;
begin
-- For each lane, load the value and then run the round on the
-- accumulator. This is designed for simd, and we'll try to structure
-- this to give the compiler as much of a chance as possible to see the
-- obvious simd conditions
-- Load lanes
declare
I: Stream_Element_Offset := Engine.Buffer'First;
begin
for Lane of Lanes loop
for Byte of reverse Engine.Buffer(I .. I + 7) loop
Lane := Shift_Left (Lane, 8);
Lane := Lane + Accumulator_Type (Byte);
end loop;
I := I + 8;
end loop;
end;
for I in Lanes'Range loop
-- The actual rounds
Lane_Round (Accumulators(I), Lanes(I));
end loop;
Engine.Last_Element := Engine.Buffer'First - 1;
end Stripe_Round;
-----------
-- Write --
-----------
procedure Write (Engine : in out XXH64_Engine;
Item : in Stream_Element_Array)
is
Last_Load: Stream_Element_Offset := Item'First - 1;
procedure Load_Round with Inline, Pre => Last_Load < Item'Last is
Buffer_Space: Stream_Element_Offset
:= Engine.Buffer'Last - Engine.Last_Element;
Load_First: constant Stream_Element_Offset := Last_Load + 1;
Load_Last : Stream_Element_Offset;
Load_Size : Stream_Element_Offset := Buffer_Space;
New_Last_Element: Stream_Element_Offset;
begin
pragma Assert (Buffer_Space > 0);
-- Load in as many bytes as we can into the buffer. If we hit 16
-- bytes, we call a Stripe_Round.
Load_Last := Load_First + Buffer_Space - 1;
if Load_Last > Item'Last then
Load_Last := Item'Last;
Load_Size := Load_Last - Load_First + 1;
end if;
New_Last_Element := Engine.Last_Element + Load_Size;
Engine.Buffer (Engine.Last_Element + 1 .. New_Last_Element)
:= Item (Load_First .. Load_Last);
Last_Load := Load_Last;
Engine.Last_Element := New_Last_Element;
if New_Last_Element = Engine.Buffer'Last then
Stripe_Round (Engine);
end if;
end;
begin
if Item'Length = 0 then return; end if;
while Last_Load < Item'Last loop
Load_Round;
end loop;
Engine.Input_Total := Engine.Input_Total + Item'Length;
end Write;
-----------
-- Reset --
-----------
procedure Reset (Engine : in out XXH64_Engine) is
begin
Engine.Last_Element := Engine.Buffer'First - 1;
Engine.Input_Total := 0;
Engine.Accumulators := Accumulators_Initial;
end Reset;
------------
-- Digest --
------------
function Digest (Engine : in out XXH64_Engine) return Hash'Class is
Lane_Accumulators: Accumulator_Array renames Engine.Accumulators;
Hash_Accumulator : Accumulator_Type;
-- Steps as per the xxHash spec
procedure Step_1_Short with Inline; -- Step 1 with < 16 byte total input
-- Step 2. Process Stripes is done in Write
procedure Step_3 with Inline; -- Accumulator Convergence
procedure Step_4 with Inline; -- Add input length
procedure Step_5 with Inline; -- Consume remaining input
procedure Step_6 with Inline; -- Final mix (avalanche)
-- Step 1 Short
procedure Step_1_Short is
-- This is invoked when Digest is called before 16 or more bytes have
-- been written to the engine
begin
Hash_Accumulator := PRIME64_5;
end;
-- Step 3: Accumulator Convergence
procedure Step_3 is
procedure Merge_Accumulator (Source: in Accumulator_Type)
with Inline is
Dope: Accumulator_Type := 0;
begin
Lane_Round (Accumulator => Dope, Lane => Source);
Hash_Accumulator := Hash_Accumulator xor Dope;
Hash_Accumulator := Hash_Accumulator * PRIME64_1;
Hash_Accumulator := Hash_Accumulator + PRIME64_4;
end;
begin
Hash_Accumulator
:= Rotate_Left (Lane_Accumulators(1), 1)
+ Rotate_Left (Lane_Accumulators(2), 7)
+ Rotate_Left (Lane_Accumulators(3), 12)
+ Rotate_Left (Lane_Accumulators(4), 18);
for Source of Lane_Accumulators loop
Merge_Accumulator (Source);
end loop;
end;
-- Step 4: Add input length
procedure Step_4 is begin
Hash_Accumulator := Hash_Accumulator + Engine.Input_Total;
end;
-- Step 5: Consume remaining input
procedure Step_5 is
Lane: Accumulator_Type := 0;
Dope: Accumulator_Type;
Mark: Stream_Element_Offset := Engine.Buffer'First;
begin
pragma Assert (Engine.Last_Element < Engine.Buffer'Last);
while (Engine.Last_Element - Mark) >= 7 loop
-- Note that since we are shifting the lane 8 x 8bits,
-- the initial value of Lane does not matter at all,
-- so we don't need to clear it every time
for Byte of reverse Engine.Buffer (Mark .. Mark + 7) loop
Lane := Shift_Left (Lane, 8);
Lane := Lane + Accumulator_Type (Byte);
end loop;
Dope := 0;
Lane_Round (Accumulator => Dope, Lane => Lane);
Hash_Accumulator := Hash_Accumulator xor Dope;
Hash_Accumulator := Rotate_Left (Hash_Accumulator, 27);
Hash_Accumulator := Hash_Accumulator * PRIME64_1;
Hash_Accumulator := Hash_Accumulator + PRIME64_4;
Mark := Mark + 8;
end loop;
while (Engine.Last_Element - Mark) >= 3 loop
Lane := 0;
-- Lane does need to be cleared here because we're only
-- loading a 32-bit number!
for Byte of reverse Engine.Buffer (Mark .. Mark + 3) loop
Lane := Shift_Left (Lane, 8);
Lane := Lane + Accumulator_Type (Byte);
end loop;
Hash_Accumulator := Hash_Accumulator xor (Lane * PRIME64_1);
Hash_Accumulator := Rotate_Left (Hash_Accumulator, 23);
Hash_Accumulator := Hash_Accumulator * PRIME64_2;
Hash_Accumulator := Hash_Accumulator + PRIME64_3;
Mark := Mark + 4;
end loop;
while Mark <= Engine.Last_Element loop
Lane := Accumulator_Type (Engine.Buffer(Mark));
Hash_Accumulator := Hash_Accumulator xor (Lane * PRIME64_5);
Hash_Accumulator := Rotate_Left (Hash_Accumulator, 11);
Hash_Accumulator := Hash_Accumulator * PRIME64_1;
Mark := Mark + 1;
end loop;
end;
-- Step 6: Final mix (avalanche)
procedure Step_6 is
Acc: Accumulator_Type renames Hash_Accumulator;
begin
Acc := Acc xor Shift_Right (Acc, 33);
Acc := Acc * PRIME64_2;
Acc := Acc xor Shift_Right (Acc, 29);
Acc := Acc * PRIME64_3;
Acc := Acc xor Shift_Right (Acc, 32);
end Step_6;
begin
if Engine.Input_Total < 32 then
-- If the total input is less than 32, we need to "manually"
-- initialize the accumulator. If we have done any rounds ("Step 2")
-- to process 32-byte "stripes", then we would use "Step 3" to
-- initialize Hash_Accumulator from the Engine's accumulators.
Hash_Accumulator := PRIME64_5;
else
-- Normal completion (Converge the engine accumulators into the hash
-- accumulator)
Step_3;
end if;
Step_4;
Step_5;
Step_6;
return XXH64_Hash'(Digest => Hash_Accumulator);
end Digest;
end Modular_Hashing.xxHash64;
| 38.771978 | 79 | 0.525402 |
1c4bdb6f4d9a98092d26a6af3426982e58b6d34e | 5,507 | ads | Ada | src/annotation_processor/implementation/yaml-events-context.ads | robdaemon/AdaYaml | 2cb52c5e7eee3a2d9951945d5ddb4eeddc088f6e | [
"MIT"
] | null | null | null | src/annotation_processor/implementation/yaml-events-context.ads | robdaemon/AdaYaml | 2cb52c5e7eee3a2d9951945d5ddb4eeddc088f6e | [
"MIT"
] | null | null | null | src/annotation_processor/implementation/yaml-events-context.ads | robdaemon/AdaYaml | 2cb52c5e7eee3a2d9951945d5ddb4eeddc088f6e | [
"MIT"
] | null | null | null | -- part of AdaYaml, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "copying.txt"
private with Ada.Containers.Hashed_Maps;
with Yaml.Events.Store;
package Yaml.Events.Context is
type Reference is tagged private;
type Cursor is private;
type Local_Scope_Cursor is private;
type Generated_Store_Cursor is private;
type Symbol_Cursor is private;
type Location_Type is (Generated, Local, Document, Stream, External, None);
function Create (External : Store.Reference := Store.New_Store)
return Reference;
function External_Store (Object : Reference) return Store.Accessor;
function Stream_Store (Object : Reference) return Store.Accessor;
function Document_Store (Object : Reference) return Store.Accessor;
function Transformed_Store (Object : Reference) return Store.Accessor;
function Local_Store (Object : Reference; Position : Local_Scope_Cursor)
return Store.Accessor;
function Local_Store_Ref (Object : Reference; Position : Local_Scope_Cursor)
return Store.Optional_Reference;
function Generated_Store (Object : Reference;
Position : Generated_Store_Cursor)
return Store.Accessor;
function Generated_Store_Ref (Object : Reference;
Position : Generated_Store_Cursor)
return Store.Optional_Reference;
function Position (Object : Reference; Alias : Text.Reference) return Cursor;
function Location (Position : Cursor) return Location_Type;
procedure Create_Local_Store (Object : Reference;
Position : out Local_Scope_Cursor);
procedure Create_Local_Symbol_Scope (Object : Reference;
Position : out Local_Scope_Cursor);
procedure Release_Local_Store (Object : Reference;
Position : Local_Scope_Cursor);
procedure Create_Generated_Store (Object : Reference;
Position : out Generated_Store_Cursor);
procedure Release_Generated_Store (Object : Reference;
Position : Generated_Store_Cursor);
procedure Create_Symbol (Object : Reference;
Scope : Local_Scope_Cursor;
Name : Text.Reference;
Position : out Symbol_Cursor);
procedure Update_Symbol (Object : Reference;
Scope : Local_Scope_Cursor;
Position : Symbol_Cursor;
New_Value : Cursor);
function Symbol_Name (Position : Symbol_Cursor) return Text.Reference;
No_Element : constant Cursor;
No_Local_Store : constant Local_Scope_Cursor;
function Is_Anchored (Pos : Cursor) return Boolean;
function Retrieve (Pos : Cursor) return Store.Stream_Reference
with Pre => Pos /= No_Element;
function First (Pos : Cursor) return Event with Pre => Pos /= No_Element;
function Exists_In_Ouput (Position : Cursor) return Boolean;
procedure Set_Exists_In_Output (Position : in out Cursor);
procedure Get_Store_And_Cursor
(Position : Cursor; Target : out Store.Optional_Reference;
Element_Position : out Events.Store.Element_Cursor);
function To_Cursor (Object : Reference;
Parent : Store.Optional_Reference;
Element_Position : Events.Store.Element_Cursor)
return Cursor;
private
type Cursor is record
Target : Store.Optional_Reference;
Anchored_Position : Events.Store.Anchor_Cursor;
Element_Position : Events.Store.Element_Cursor;
Target_Location : Location_Type;
end record;
package Symbol_Tables is new Ada.Containers.Hashed_Maps
(Text.Reference, Cursor, Text.Hash, Text."=");
type Symbol_Table_Pointer is access Symbol_Tables.Map;
type Local_Scope is record
Events : Store.Optional_Reference;
Symbols : Symbol_Table_Pointer;
end record;
type Scope_Array is array (Positive range <>) of Local_Scope;
type Scope_Array_Pointer is access Scope_Array;
type Data_Array is array (Positive range <>) of Store.Optional_Reference;
type Data_Array_Pointer is access Data_Array;
type Instance is limited new Refcount_Base with record
Generated_Data : Data_Array_Pointer;
Document_Data, Stream_Data, External_Data, Transformed_Data :
Store.Reference;
Local_Scopes : Scope_Array_Pointer := null;
Local_Scope_Count, Generated_Data_Count : Natural := 0;
end record;
overriding procedure Finalize (Object : in out Instance);
type Local_Scope_Cursor is new Natural;
type Generated_Store_Cursor is new Natural;
type Symbol_Cursor is new Symbol_Tables.Cursor;
type Reference is new Ada.Finalization.Controlled with record
Data : not null access Instance := raise Constraint_Error with "uninitialized context instance!";
end record;
overriding procedure Adjust (Object : in out Reference);
overriding procedure Finalize (Object : in out Reference);
No_Element : constant Cursor :=
(Target => Store.Null_Reference,
Element_Position => Events.Store.No_Element,
Anchored_Position => Events.Store.No_Anchor,
Target_Location => None);
No_Local_Store : constant Local_Scope_Cursor := 0;
end Yaml.Events.Context;
| 39.618705 | 103 | 0.675685 |
107ac8bffcd746881c8639faac21f71c9d4a4a88 | 5,849 | ads | Ada | ada_gui-gnoga-gui-location.ads | jrcarter/Ada_GUI | 65a829c55dec91fd48a0b72f88d76137768bf4fb | [
"BSD-3-Clause"
] | 19 | 2018-03-18T18:07:14.000Z | 2022-03-30T03:10:12.000Z | ada_gui-gnoga-gui-location.ads | jrcarter/Ada_GUI | 65a829c55dec91fd48a0b72f88d76137768bf4fb | [
"BSD-3-Clause"
] | 4 | 2021-08-23T12:52:06.000Z | 2022-03-31T10:48:43.000Z | ada_gui-gnoga-gui-location.ads | jrcarter/Ada_GUI | 65a829c55dec91fd48a0b72f88d76137768bf4fb | [
"BSD-3-Clause"
] | null | null | null | -- Ada_GUI implementation based on Gnoga. Adapted 2021
-- --
-- GNOGA - The GNU Omnificent GUI for Ada --
-- --
-- G N O G A . G U I . L O C A T I O N --
-- --
-- S p e c --
-- --
-- --
-- Copyright (C) 2014 David Botton --
-- --
-- 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 --
-- 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/>. --
-- --
-- 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. --
-- --
-- For more information please go to http://www.gnoga.com --
------------------------------------------------------------------------------
package Ada_GUI.Gnoga.Gui.Location is
-------------------------------------------------------------------------
-- Location_Type
-------------------------------------------------------------------------
-- Location_Type is the class encapsulating the DOM Location node
-- To use, access via Window_Type.Location
type Location_Type is new Gnoga.Gui.Base_Type with private;
type Location_Access is access all Location_Type;
type Pointer_To_Location_Class is access all Location_Type'Class;
-------------------------------------------------------------------------
-- Location_Type - Properties
-------------------------------------------------------------------------
procedure URL (Location : in out Location_Type; Value : in String);
function URL (Location : Location_Type) return String;
-- Setting URL will navigate the browser from the current location and
-- close the current Gnoga Connection.
procedure Hash (Location : in out Location_Type; Value : in String);
function Hash (Location : Location_Type) return String;
procedure Host (Location : in out Location_Type; Value : in String);
function Host (Location : Location_Type) return String;
procedure Host_Name (Location : in out Location_Type; Value : in String);
function Host_Name (Location : Location_Type) return String;
function Origin (Location : Location_Type) return String;
procedure Path_Name (Location : in out Location_Type; Value : in String);
function Path_Name (Location : Location_Type) return String;
procedure Port (Location : in out Location_Type; Value : in String);
function Port (Location : Location_Type) return String;
procedure Protocol (Location : in out Location_Type; Value : in String);
function Protocol (Location : Location_Type) return String;
procedure Search (Location : in out Location_Type; Value : in String);
function Search (Location : Location_Type) return String;
function Parse (URL : in String; Encoding : String := "")
return Gnoga.Data_Map_Type;
-- Parse form GET parameters in URL (typically from Search function)
-- to Data_Map_Type
-- Supported encodings are ISO-8859-1 (default)
-- and UTF-8 (typically from Input_Encoding function)
-------------------------------------------------------------------------
-- Location_Type - Methods
-------------------------------------------------------------------------
procedure Reload (Location : in out Location_Type);
-- Reload the current page
procedure Replace (Location : in out Location_Type; URL : in String);
-- Replace the current page with URL (the current page will be removed
-- from the browser history)
procedure Assign (Location : in out Location_Type; URL : in String);
-- Assign URL to the current page, the current page will be available
-- using the back button.
private
type Location_Type is new Gnoga.Gui.Base_Type with null record;
end Ada_GUI.Gnoga.Gui.Location;
| 54.663551 | 78 | 0.517695 |
10f705c019c44e97d0d314767e153725825add4d | 10,471 | adb | Ada | project/adl/arch/ARM/Nordic/drivers/nrf51-twi.adb | corentingay/adaboy | 68f08afa246c8255a42897376d375edcb4e2efc2 | [
"MIT"
] | null | null | null | project/adl/arch/ARM/Nordic/drivers/nrf51-twi.adb | corentingay/adaboy | 68f08afa246c8255a42897376d375edcb4e2efc2 | [
"MIT"
] | null | null | null | project/adl/arch/ARM/Nordic/drivers/nrf51-twi.adb | corentingay/adaboy | 68f08afa246c8255a42897376d375edcb4e2efc2 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2016, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with NRF51_SVD.TWI; use NRF51_SVD.TWI;
package body nRF51.TWI is
procedure Stop_Sequence (This : in out TWI_Master'Class);
-------------------
-- Stop_Sequence --
-------------------
procedure Stop_Sequence (This : in out TWI_Master'Class) is
begin
-- Stop sequence
This.Periph.EVENTS_STOPPED := 0;
This.Periph.TASKS_STOP := 1;
while This.Periph.EVENTS_STOPPED = 0 loop
null;
end loop;
end Stop_Sequence;
------------
-- Enable --
------------
procedure Enable (This : in out TWI_Master) is
begin
This.Periph.ENABLE.ENABLE := Enabled;
end Enable;
-------------
-- Disable --
-------------
procedure Disable (This : in out TWI_Master) is
begin
This.Periph.ENABLE.ENABLE := Disabled;
end Disable;
-------------
-- Enabled --
-------------
function Enabled (This : TWI_Master) return Boolean is
begin
return This.Periph.ENABLE.ENABLE = Enabled;
end Enabled;
---------------
-- Configure --
---------------
procedure Configure
(This : in out TWI_Master;
SCL, SDA : GPIO_Pin_Index;
Speed : TWI_Speed)
is
begin
This.Periph.PSELSCL := UInt32 (SCL);
This.Periph.PSELSDA := UInt32 (SDA);
This.Periph.FREQUENCY := (case Speed is
when TWI_100kbps => 16#0198_0000#,
when TWI_250kbps => 16#0400_0000#,
when TWI_400kbps => 16#0668_0000#);
end Configure;
----------------
-- Disconnect --
----------------
procedure Disconnect (This : in out TWI_Master) is
begin
This.Periph.PSELSCL := 16#FFFF_FFFF#;
This.Periph.PSELSDA := 16#FFFF_FFFF#;
end Disconnect;
---------------------
-- Master_Transmit --
---------------------
overriding procedure Master_Transmit
(This : in out TWI_Master;
Addr : I2C_Address;
Data : I2C_Data;
Status : out I2C_Status;
Timeout : Natural := 1000)
is
pragma Unreferenced (Timeout);
Index : Integer := Data'First + 1;
Evt_Err : UInt32;
Err_Src : ERRORSRC_Register with Unreferenced;
begin
if Data'Length = 0 then
Status := Ok;
return;
end if;
-- Clear errors
This.Periph.ERRORSRC.OVERRUN := Errorsrc_Overrun_Field_Reset;
This.Periph.ERRORSRC.ANACK := Errorsrc_Anack_Field_Reset;
This.Periph.ERRORSRC.DNACK := Errorsrc_Dnack_Field_Reset;
-- Set Address
This.Periph.ADDRESS.ADDRESS := UInt7 (Addr / 2);
-- Prepare first byte
This.Periph.TXD.TXD := Data (Data'First);
-- Start TX sequence
This.Periph.TASKS_STARTTX := 1;
loop
loop
Evt_Err := This.Periph.EVENTS_ERROR;
if Evt_Err /= 0 then
Err_Src := This.Periph.ERRORSRC;
Status := Err_Error;
-- Clear the error
This.Periph.EVENTS_ERROR := 0;
-- Stop sequence
This.Periph.TASKS_STOP := 1;
return;
end if;
exit when This.Periph.EVENTS_TXDSENT /= 0;
end loop;
-- Clear the event
This.Periph.EVENTS_TXDSENT := 0;
exit when Index > Data'Last;
This.Periph.TXD.TXD := Data (Index);
Index := Index + 1;
end loop;
if This.Do_Stop_Sequence then
Stop_Sequence (This);
end if;
Status := Ok;
end Master_Transmit;
--------------------
-- Master_Receive --
--------------------
overriding procedure Master_Receive
(This : in out TWI_Master;
Addr : I2C_Address;
Data : out I2C_Data;
Status : out I2C_Status;
Timeout : Natural := 1000)
is
pragma Unreferenced (Timeout);
begin
if Data'Length = 0 then
Status := Ok;
return;
end if;
-- Clear errors
This.Periph.ERRORSRC.OVERRUN := Clear;
This.Periph.ERRORSRC.ANACK := Clear;
This.Periph.ERRORSRC.DNACK := Clear;
-- Set Address
This.Periph.ADDRESS.ADDRESS := UInt7 (Addr);
-- Configure SHORTS to automatically suspend TWI port when receiving a
-- byte.
This.Periph.SHORTS.BB_SUSPEND := Enabled;
This.Periph.SHORTS.BB_STOP := Disabled;
-- Start RX sequence
This.Periph.TASKS_STARTRX := 1;
for Index in Data'Range loop
loop
if This.Periph.EVENTS_ERROR /= 0 then
Status := Err_Error;
-- Clear the error
This.Periph.EVENTS_ERROR := 0;
Stop_Sequence (This);
return;
end if;
exit when This.Periph.EVENTS_RXDREADY /= 0;
end loop;
if Index = Data'Last and then This.Do_Stop_Sequence then
-- Configure SHORTS to automatically stop the TWI port and produce
-- a STOP event on the bus when receiving a byte.
This.Periph.SHORTS.BB_SUSPEND := Disabled;
This.Periph.SHORTS.BB_STOP := Enabled;
end if;
-- Clear the event
This.Periph.EVENTS_RXDREADY := 0;
Data (Index) := This.Periph.RXD.RXD;
end loop;
Status := Ok;
end Master_Receive;
---------------
-- Mem_Write --
---------------
overriding procedure Mem_Write
(This : in out TWI_Master;
Addr : I2C_Address;
Mem_Addr : UInt16;
Mem_Addr_Size : I2C_Memory_Address_Size;
Data : I2C_Data;
Status : out I2C_Status;
Timeout : Natural := 1000)
is
begin
This.Do_Stop_Sequence := False;
case Mem_Addr_Size is
when Memory_Size_8b =>
This.Master_Transmit (Addr => Addr,
Data => (0 => UInt8 (Mem_Addr)),
Status => Status,
Timeout => Timeout);
when Memory_Size_16b =>
This.Master_Transmit (Addr => Addr,
Data => (UInt8 (Shift_Right (Mem_Addr, 8)),
UInt8 (Mem_Addr and 16#FF#)),
Status => Status,
Timeout => Timeout);
end case;
This.Do_Stop_Sequence := True;
if Status /= Ok then
return;
end if;
This.Master_Transmit (Addr => Addr,
Data => Data,
Status => Status,
Timeout => Timeout);
end Mem_Write;
--------------
-- Mem_Read --
--------------
overriding procedure Mem_Read
(This : in out TWI_Master;
Addr : I2C_Address;
Mem_Addr : UInt16;
Mem_Addr_Size : I2C_Memory_Address_Size;
Data : out I2C_Data;
Status : out I2C_Status;
Timeout : Natural := 1000)
is
begin
This.Do_Stop_Sequence := False;
case Mem_Addr_Size is
when Memory_Size_8b =>
This.Master_Transmit (Addr => Addr,
Data => (0 => UInt8 (Mem_Addr)),
Status => Status,
Timeout => Timeout);
when Memory_Size_16b =>
This.Master_Transmit (Addr => Addr,
Data => (UInt8 (Shift_Right (Mem_Addr, 8)),
UInt8 (Mem_Addr and 16#FF#)),
Status => Status,
Timeout => Timeout);
end case;
This.Do_Stop_Sequence := True;
if Status /= Ok then
return;
end if;
This.Master_Receive (Addr => Addr,
Data => Data,
Status => Status,
Timeout => Timeout);
end Mem_Read;
end nRF51.TWI;
| 31.16369 | 80 | 0.496323 |
39a2f3b8a36c18200e6702d9cc6ad52bce2f79fa | 1,920 | adb | Ada | src/extraction-subp_overrides.adb | TNO/Dependency_Graph_Extractor-Ada | cfcc9132cf181e4db5139c14150f221efa69a6d6 | [
"BSD-3-Clause"
] | null | null | null | src/extraction-subp_overrides.adb | TNO/Dependency_Graph_Extractor-Ada | cfcc9132cf181e4db5139c14150f221efa69a6d6 | [
"BSD-3-Clause"
] | null | null | null | src/extraction-subp_overrides.adb | TNO/Dependency_Graph_Extractor-Ada | cfcc9132cf181e4db5139c14150f221efa69a6d6 | [
"BSD-3-Clause"
] | null | null | null | with Extraction.Node_Edge_Types;
with Extraction.Utilities;
package body Extraction.Subp_Overrides is
procedure Extract_Nodes
(Node : LAL.Ada_Node'Class; Graph : Graph_Operations.Graph_Context)
is
begin
if Utilities.Is_Relevant_Basic_Decl (Node)
and then Node.As_Basic_Decl.P_Is_Subprogram
then
declare
Decl : constant LAL.Basic_Decl := Node.As_Basic_Decl;
Base_Decls : constant LAL.Basic_Decl_Array :=
Decl.P_Base_Subp_Declarations;
begin
-- Add all subprograms that are overriden even if external.
for Base_Decl of Base_Decls loop
Graph.Write_Node (Base_Decl);
end loop;
end;
end if;
end Extract_Nodes;
procedure Extract_Edges
(Node : LAL.Ada_Node'Class; Graph : Graph_Operations.Graph_Context)
is
begin
if Utilities.Is_Relevant_Basic_Decl (Node)
and then Node.As_Basic_Decl.P_Is_Subprogram
then
declare
Decl : constant LAL.Basic_Decl := Node.As_Basic_Decl;
Base_Decls : constant LAL.Basic_Decl_Array :=
Decl.P_Base_Subp_Declarations;
begin
if (for some Base_Decl of Base_Decls => Base_Decl = Decl)
then -- Ignore implementations later in the same file.
for Base_Decl of Base_Decls loop
if Base_Decl /= Decl
then
-- Ignore Decl itself, which will be in the set,
-- unless it is an implementation later in the same file.
Graph.Write_Edge
(Base_Decl, Decl,
Node_Edge_Types.Edge_Type_Is_Overridden_By);
end if;
end loop;
end if;
end;
end if;
end Extract_Edges;
end Extraction.Subp_Overrides;
| 34.285714 | 79 | 0.589583 |
fb77af392bc017d8ceee4cc7a422e7e3a2599227 | 4,209 | adb | Ada | source/web/spikedog/daemon/aws/spikedog-aws_driver.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/web/spikedog/daemon/aws/spikedog-aws_driver.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/web/spikedog/daemon/aws/spikedog-aws_driver.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 © 2016-2017, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with Ada.Exceptions;
with Ada.Text_IO;
with AWS.Server;
with League.Strings;
with Servlet.Application;
procedure Spikedog.AWS_Driver is
begin
begin
Servlet.Application.Initialize
(Application_Name =>
League.Strings.To_Universal_String ("Spikedog Application Server"),
Application_Version =>
League.Strings.To_Universal_String ("0.1"),
Organization_Name =>
League.Strings.To_Universal_String ("Matreshka Project"),
Organization_Domain =>
League.Strings.To_Universal_String ("forge.ada-ru.org"));
exception
when E : others =>
Ada.Text_IO.Put_Line
(Ada.Text_IO.Standard_Error,
Ada.Exceptions.Exception_Information (E));
end;
-- Wait till built-in HTTP server is running.
AWS.Server.Wait (AWS.Server.No_Server);
end Spikedog.AWS_Driver;
| 54.662338 | 78 | 0.447137 |
2076d1292f28faa14d343f01e72081905aa2e0c1 | 1,036 | adb | Ada | gdb/testsuite/gdb.ada/bp_on_var/pck.adb | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | 1 | 2020-10-14T03:24:35.000Z | 2020-10-14T03:24:35.000Z | gdb/testsuite/gdb.ada/bp_on_var/pck.adb | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | null | null | null | gdb/testsuite/gdb.ada/bp_on_var/pck.adb | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | null | null | null | -- Copyright 2012-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 body Pck is
My_Hidden_Variable : Integer := 0;
procedure Do_Something (I : in out Integer) is
begin
if My_Hidden_Variable > 10 then
My_Hidden_Variable := 0;
end if;
I := I + My_Hidden_Variable;
My_Hidden_Variable := My_Hidden_Variable + 1;
end Do_Something;
end Pck;
| 37 | 73 | 0.71332 |
1c7e9c3d76fdc8a3ca22f807c33358c28dc544cb | 24,490 | ads | Ada | stm32l0/stm32l0x1/svd/stm32_svd-rtc.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 1 | 2021-04-06T07:57:56.000Z | 2021-04-06T07:57:56.000Z | stm32l0/stm32l0x1/svd/stm32_svd-rtc.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | null | null | null | stm32l0/stm32l0x1/svd/stm32_svd-rtc.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 2 | 2018-05-29T13:59:31.000Z | 2019-02-03T19:48:08.000Z | -- This spec has been automatically generated from STM32L0x1.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with System;
package STM32_SVD.RTC is
pragma Preelaborate;
---------------
-- Registers --
---------------
-- RTC time register
type TR_Register is record
-- Second units in BCD format
SU : STM32_SVD.UInt4;
-- Second tens in BCD format
ST : STM32_SVD.UInt3;
-- unspecified
Reserved_7_7 : STM32_SVD.Bit;
-- Minute units in BCD format
MNU : STM32_SVD.UInt4;
-- Minute tens in BCD format
MNT : STM32_SVD.UInt3;
-- unspecified
Reserved_15_15 : STM32_SVD.Bit;
-- Hour units in BCD format
HU : STM32_SVD.UInt4;
-- Hour tens in BCD format
HT : STM32_SVD.UInt2;
-- AM/PM notation
PM : STM32_SVD.Bit;
-- unspecified
Reserved_23_31 : STM32_SVD.UInt9;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for TR_Register use record
SU at 0 range 0 .. 3;
ST at 0 range 4 .. 6;
Reserved_7_7 at 0 range 7 .. 7;
MNU at 0 range 8 .. 11;
MNT at 0 range 12 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
HU at 0 range 16 .. 19;
HT at 0 range 20 .. 21;
PM at 0 range 22 .. 22;
Reserved_23_31 at 0 range 23 .. 31;
end record;
-- RTC date register
type DR_Register is record
-- Date units in BCD format
DU : STM32_SVD.UInt4;
-- Date tens in BCD format
DT : STM32_SVD.UInt2;
-- unspecified
Reserved_6_7 : STM32_SVD.UInt2;
-- Month units in BCD format
MU : STM32_SVD.UInt4;
-- Month tens in BCD format
MT : STM32_SVD.Bit;
-- Week day units
WDU : STM32_SVD.UInt3;
-- Year units in BCD format
YU : STM32_SVD.UInt4;
-- Year tens in BCD format
YT : STM32_SVD.UInt4;
-- unspecified
Reserved_24_31 : STM32_SVD.Byte;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for DR_Register use record
DU at 0 range 0 .. 3;
DT at 0 range 4 .. 5;
Reserved_6_7 at 0 range 6 .. 7;
MU at 0 range 8 .. 11;
MT at 0 range 12 .. 12;
WDU at 0 range 13 .. 15;
YU at 0 range 16 .. 19;
YT at 0 range 20 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
-- RTC control register
type CR_Register is record
-- Wakeup clock selection
WUCKSEL : STM32_SVD.UInt3;
-- Time-stamp event active edge
TSEDGE : STM32_SVD.Bit;
-- RTC_REFIN reference clock detection enable (50 or 60 Hz)
REFCKON : STM32_SVD.Bit;
-- Bypass the shadow registers
BYPSHAD : STM32_SVD.Bit;
-- Hour format
FMT : STM32_SVD.Bit;
-- unspecified
Reserved_7_7 : STM32_SVD.Bit;
-- Alarm A enable
ALRAE : STM32_SVD.Bit;
-- Alarm B enable
ALRBE : STM32_SVD.Bit;
-- Wakeup timer enable
WUTE : STM32_SVD.Bit;
-- timestamp enable
TSE : STM32_SVD.Bit;
-- Alarm A interrupt enable
ALRAIE : STM32_SVD.Bit;
-- Alarm B interrupt enable
ALRBIE : STM32_SVD.Bit;
-- Wakeup timer interrupt enable
WUTIE : STM32_SVD.Bit;
-- Time-stamp interrupt enable
TSIE : STM32_SVD.Bit;
-- Write-only. Add 1 hour (summer time change)
ADD1H : STM32_SVD.Bit;
-- Write-only. Subtract 1 hour (winter time change)
SUB1H : STM32_SVD.Bit;
-- Backup
BKP : STM32_SVD.Bit;
-- Calibration output selection
COSEL : STM32_SVD.Bit;
-- Output polarity
POL : STM32_SVD.Bit;
-- Output selection
OSEL : STM32_SVD.UInt2;
-- Calibration output enable
COE : STM32_SVD.Bit;
-- unspecified
Reserved_24_31 : STM32_SVD.Byte;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CR_Register use record
WUCKSEL at 0 range 0 .. 2;
TSEDGE at 0 range 3 .. 3;
REFCKON at 0 range 4 .. 4;
BYPSHAD at 0 range 5 .. 5;
FMT at 0 range 6 .. 6;
Reserved_7_7 at 0 range 7 .. 7;
ALRAE at 0 range 8 .. 8;
ALRBE at 0 range 9 .. 9;
WUTE at 0 range 10 .. 10;
TSE at 0 range 11 .. 11;
ALRAIE at 0 range 12 .. 12;
ALRBIE at 0 range 13 .. 13;
WUTIE at 0 range 14 .. 14;
TSIE at 0 range 15 .. 15;
ADD1H at 0 range 16 .. 16;
SUB1H at 0 range 17 .. 17;
BKP at 0 range 18 .. 18;
COSEL at 0 range 19 .. 19;
POL at 0 range 20 .. 20;
OSEL at 0 range 21 .. 22;
COE at 0 range 23 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
-- RTC initialization and status register
type ISR_Register is record
-- Read-only. Alarm A write flag
ALRAWF : STM32_SVD.Bit;
-- Read-only. Alarm B write flag
ALRBWF : STM32_SVD.Bit;
-- Read-only. Wakeup timer write flag
WUTWF : STM32_SVD.Bit;
-- Read-only. Shift operation pending
SHPF : STM32_SVD.Bit;
-- Read-only. Initialization status flag
INITS : STM32_SVD.Bit;
-- Registers synchronization flag
RSF : STM32_SVD.Bit;
-- Read-only. Initialization flag
INITF : STM32_SVD.Bit;
-- Initialization mode
INIT : STM32_SVD.Bit;
-- Alarm A flag
ALRAF : STM32_SVD.Bit;
-- Alarm B flag
ALRBF : STM32_SVD.Bit;
-- Wakeup timer flag
WUTF : STM32_SVD.Bit;
-- Time-stamp flag
TSF : STM32_SVD.Bit;
-- Time-stamp overflow flag
TSOVF : STM32_SVD.Bit;
-- RTC_TAMP1 detection flag
TAMP1F : STM32_SVD.Bit;
-- RTC_TAMP2 detection flag
TAMP2F : STM32_SVD.Bit;
-- unspecified
Reserved_15_31 : STM32_SVD.UInt17;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ISR_Register use record
ALRAWF at 0 range 0 .. 0;
ALRBWF at 0 range 1 .. 1;
WUTWF at 0 range 2 .. 2;
SHPF at 0 range 3 .. 3;
INITS at 0 range 4 .. 4;
RSF at 0 range 5 .. 5;
INITF at 0 range 6 .. 6;
INIT at 0 range 7 .. 7;
ALRAF at 0 range 8 .. 8;
ALRBF at 0 range 9 .. 9;
WUTF at 0 range 10 .. 10;
TSF at 0 range 11 .. 11;
TSOVF at 0 range 12 .. 12;
TAMP1F at 0 range 13 .. 13;
TAMP2F at 0 range 14 .. 14;
Reserved_15_31 at 0 range 15 .. 31;
end record;
-- RTC prescaler register
type PRER_Register is record
-- Synchronous prescaler factor
PREDIV_S : STM32_SVD.UInt16;
-- Asynchronous prescaler factor
PREDIV_A : STM32_SVD.UInt7;
-- unspecified
Reserved_23_31 : STM32_SVD.UInt9;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for PRER_Register use record
PREDIV_S at 0 range 0 .. 15;
PREDIV_A at 0 range 16 .. 22;
Reserved_23_31 at 0 range 23 .. 31;
end record;
-- RTC wakeup timer register
type WUTR_Register is record
-- Wakeup auto-reload value bits
WUT : STM32_SVD.UInt16;
-- unspecified
Reserved_16_31 : STM32_SVD.UInt16;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for WUTR_Register use record
WUT at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- RTC alarm A register
type ALRMAR_Register is record
-- Second units in BCD format.
SU : STM32_SVD.UInt4;
-- Second tens in BCD format.
ST : STM32_SVD.UInt3;
-- Alarm A seconds mask
MSK1 : STM32_SVD.Bit;
-- Minute units in BCD format.
MNU : STM32_SVD.UInt4;
-- Minute tens in BCD format.
MNT : STM32_SVD.UInt3;
-- Alarm A minutes mask
MSK2 : STM32_SVD.Bit;
-- Hour units in BCD format.
HU : STM32_SVD.UInt4;
-- Hour tens in BCD format.
HT : STM32_SVD.UInt2;
-- AM/PM notation
PM : STM32_SVD.Bit;
-- Alarm A hours mask
MSK3 : STM32_SVD.Bit;
-- Date units or day in BCD format.
DU : STM32_SVD.UInt4;
-- Date tens in BCD format.
DT : STM32_SVD.UInt2;
-- Week day selection
WDSEL : STM32_SVD.Bit;
-- Alarm A date mask
MSK4 : STM32_SVD.Bit;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ALRMAR_Register use record
SU at 0 range 0 .. 3;
ST at 0 range 4 .. 6;
MSK1 at 0 range 7 .. 7;
MNU at 0 range 8 .. 11;
MNT at 0 range 12 .. 14;
MSK2 at 0 range 15 .. 15;
HU at 0 range 16 .. 19;
HT at 0 range 20 .. 21;
PM at 0 range 22 .. 22;
MSK3 at 0 range 23 .. 23;
DU at 0 range 24 .. 27;
DT at 0 range 28 .. 29;
WDSEL at 0 range 30 .. 30;
MSK4 at 0 range 31 .. 31;
end record;
-- RTC alarm B register
type ALRMBR_Register is record
-- Second units in BCD format
SU : STM32_SVD.UInt4;
-- Second tens in BCD format
ST : STM32_SVD.UInt3;
-- Alarm B seconds mask
MSK1 : STM32_SVD.Bit;
-- Minute units in BCD format
MNU : STM32_SVD.UInt4;
-- Minute tens in BCD format
MNT : STM32_SVD.UInt3;
-- Alarm B minutes mask
MSK2 : STM32_SVD.Bit;
-- Hour units in BCD format
HU : STM32_SVD.UInt4;
-- Hour tens in BCD format
HT : STM32_SVD.UInt2;
-- AM/PM notation
PM : STM32_SVD.Bit;
-- Alarm B hours mask
MSK3 : STM32_SVD.Bit;
-- Date units or day in BCD format
DU : STM32_SVD.UInt4;
-- Date tens in BCD format
DT : STM32_SVD.UInt2;
-- Week day selection
WDSEL : STM32_SVD.Bit;
-- Alarm B date mask
MSK4 : STM32_SVD.Bit;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ALRMBR_Register use record
SU at 0 range 0 .. 3;
ST at 0 range 4 .. 6;
MSK1 at 0 range 7 .. 7;
MNU at 0 range 8 .. 11;
MNT at 0 range 12 .. 14;
MSK2 at 0 range 15 .. 15;
HU at 0 range 16 .. 19;
HT at 0 range 20 .. 21;
PM at 0 range 22 .. 22;
MSK3 at 0 range 23 .. 23;
DU at 0 range 24 .. 27;
DT at 0 range 28 .. 29;
WDSEL at 0 range 30 .. 30;
MSK4 at 0 range 31 .. 31;
end record;
-- write protection register
type WPR_Register is record
-- Write-only. Write protection key
KEY : STM32_SVD.Byte;
-- unspecified
Reserved_8_31 : STM32_SVD.UInt24;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for WPR_Register use record
KEY at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- RTC sub second register
type SSR_Register is record
-- Read-only. Sub second value
SS : STM32_SVD.UInt16;
-- unspecified
Reserved_16_31 : STM32_SVD.UInt16;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SSR_Register use record
SS at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- RTC shift control register
type SHIFTR_Register is record
-- Write-only. Subtract a fraction of a second
SUBFS : STM32_SVD.UInt15;
-- unspecified
Reserved_15_30 : STM32_SVD.UInt16;
-- Write-only. Add one second
ADD1S : STM32_SVD.Bit;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SHIFTR_Register use record
SUBFS at 0 range 0 .. 14;
Reserved_15_30 at 0 range 15 .. 30;
ADD1S at 0 range 31 .. 31;
end record;
-- RTC timestamp time register
type TSTR_Register is record
-- Read-only. Second units in BCD format.
SU : STM32_SVD.UInt4;
-- Read-only. Second tens in BCD format.
ST : STM32_SVD.UInt3;
-- unspecified
Reserved_7_7 : STM32_SVD.Bit;
-- Read-only. Minute units in BCD format.
MNU : STM32_SVD.UInt4;
-- Read-only. Minute tens in BCD format.
MNT : STM32_SVD.UInt3;
-- unspecified
Reserved_15_15 : STM32_SVD.Bit;
-- Read-only. Hour units in BCD format.
HU : STM32_SVD.UInt4;
-- Read-only. Hour tens in BCD format.
HT : STM32_SVD.UInt2;
-- Read-only. AM/PM notation
PM : STM32_SVD.Bit;
-- unspecified
Reserved_23_31 : STM32_SVD.UInt9;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for TSTR_Register use record
SU at 0 range 0 .. 3;
ST at 0 range 4 .. 6;
Reserved_7_7 at 0 range 7 .. 7;
MNU at 0 range 8 .. 11;
MNT at 0 range 12 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
HU at 0 range 16 .. 19;
HT at 0 range 20 .. 21;
PM at 0 range 22 .. 22;
Reserved_23_31 at 0 range 23 .. 31;
end record;
-- RTC timestamp date register
type TSDR_Register is record
-- Read-only. Date units in BCD format
DU : STM32_SVD.UInt4;
-- Read-only. Date tens in BCD format
DT : STM32_SVD.UInt2;
-- unspecified
Reserved_6_7 : STM32_SVD.UInt2;
-- Read-only. Month units in BCD format
MU : STM32_SVD.UInt4;
-- Read-only. Month tens in BCD format
MT : STM32_SVD.Bit;
-- Read-only. Week day units
WDU : STM32_SVD.UInt3;
-- unspecified
Reserved_16_31 : STM32_SVD.UInt16;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for TSDR_Register use record
DU at 0 range 0 .. 3;
DT at 0 range 4 .. 5;
Reserved_6_7 at 0 range 6 .. 7;
MU at 0 range 8 .. 11;
MT at 0 range 12 .. 12;
WDU at 0 range 13 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- RTC time-stamp sub second register
type TSSSR_Register is record
-- Read-only. Sub second value
SS : STM32_SVD.UInt16;
-- unspecified
Reserved_16_31 : STM32_SVD.UInt16;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for TSSSR_Register use record
SS at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- RTC calibration register
type CALR_Register is record
-- Calibration minus
CALM : STM32_SVD.UInt9;
-- unspecified
Reserved_9_12 : STM32_SVD.UInt4;
-- Use a 16-second calibration cycle period
CALW16 : STM32_SVD.Bit;
-- Use an 8-second calibration cycle period
CALW8 : STM32_SVD.Bit;
-- Increase frequency of RTC by 488.5 ppm
CALP : STM32_SVD.Bit;
-- unspecified
Reserved_16_31 : STM32_SVD.UInt16;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CALR_Register use record
CALM at 0 range 0 .. 8;
Reserved_9_12 at 0 range 9 .. 12;
CALW16 at 0 range 13 .. 13;
CALW8 at 0 range 14 .. 14;
CALP at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- RTC tamper configuration register
type TAMPCR_Register is record
-- RTC_TAMP1 input detection enable
TAMP1E : STM32_SVD.Bit;
-- Active level for RTC_TAMP1 input
TAMP1TRG : STM32_SVD.Bit;
-- Tamper interrupt enable
TAMPIE : STM32_SVD.Bit;
-- RTC_TAMP2 input detection enable
TAMP2E : STM32_SVD.Bit;
-- Active level for RTC_TAMP2 input
TAMP2_TRG : STM32_SVD.Bit;
-- unspecified
Reserved_5_6 : STM32_SVD.UInt2;
-- Activate timestamp on tamper detection event
TAMPTS : STM32_SVD.Bit;
-- Tamper sampling frequency
TAMPFREQ : STM32_SVD.UInt3;
-- RTC_TAMPx filter count
TAMPFLT : STM32_SVD.UInt2;
-- RTC_TAMPx precharge duration
TAMPPRCH : STM32_SVD.UInt2;
-- RTC_TAMPx pull-up disable
TAMPPUDIS : STM32_SVD.Bit;
-- Tamper 1 interrupt enable
TAMP1IE : STM32_SVD.Bit;
-- Tamper 1 no erase
TAMP1NOERASE : STM32_SVD.Bit;
-- Tamper 1 mask flag
TAMP1MF : STM32_SVD.Bit;
-- Tamper 2 interrupt enable
TAMP2IE : STM32_SVD.Bit;
-- Tamper 2 no erase
TAMP2NOERASE : STM32_SVD.Bit;
-- Tamper 2 mask flag
TAMP2MF : STM32_SVD.Bit;
-- unspecified
Reserved_22_31 : STM32_SVD.UInt10;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for TAMPCR_Register use record
TAMP1E at 0 range 0 .. 0;
TAMP1TRG at 0 range 1 .. 1;
TAMPIE at 0 range 2 .. 2;
TAMP2E at 0 range 3 .. 3;
TAMP2_TRG at 0 range 4 .. 4;
Reserved_5_6 at 0 range 5 .. 6;
TAMPTS at 0 range 7 .. 7;
TAMPFREQ at 0 range 8 .. 10;
TAMPFLT at 0 range 11 .. 12;
TAMPPRCH at 0 range 13 .. 14;
TAMPPUDIS at 0 range 15 .. 15;
TAMP1IE at 0 range 16 .. 16;
TAMP1NOERASE at 0 range 17 .. 17;
TAMP1MF at 0 range 18 .. 18;
TAMP2IE at 0 range 19 .. 19;
TAMP2NOERASE at 0 range 20 .. 20;
TAMP2MF at 0 range 21 .. 21;
Reserved_22_31 at 0 range 22 .. 31;
end record;
-- RTC alarm A sub second register
type ALRMASSR_Register is record
-- Sub seconds value
SS : STM32_SVD.UInt15;
-- unspecified
Reserved_15_23 : STM32_SVD.UInt9;
-- Mask the most-significant bits starting at this bit
MASKSS : STM32_SVD.UInt4;
-- unspecified
Reserved_28_31 : STM32_SVD.UInt4;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ALRMASSR_Register use record
SS at 0 range 0 .. 14;
Reserved_15_23 at 0 range 15 .. 23;
MASKSS at 0 range 24 .. 27;
Reserved_28_31 at 0 range 28 .. 31;
end record;
-- RTC alarm B sub second register
type ALRMBSSR_Register is record
-- Sub seconds value
SS : STM32_SVD.UInt15;
-- unspecified
Reserved_15_23 : STM32_SVD.UInt9;
-- Mask the most-significant bits starting at this bit
MASKSS : STM32_SVD.UInt4;
-- unspecified
Reserved_28_31 : STM32_SVD.UInt4;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ALRMBSSR_Register use record
SS at 0 range 0 .. 14;
Reserved_15_23 at 0 range 15 .. 23;
MASKSS at 0 range 24 .. 27;
Reserved_28_31 at 0 range 28 .. 31;
end record;
-- option register
type OR_Register is record
-- RTC_ALARM on PC13 output type
RTC_ALARM_TYPE : STM32_SVD.Bit;
-- RTC_ALARM on PC13 output type
RTC_OUT_RMP : STM32_SVD.Bit;
-- unspecified
Reserved_2_31 : STM32_SVD.UInt30;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for OR_Register use record
RTC_ALARM_TYPE at 0 range 0 .. 0;
RTC_OUT_RMP at 0 range 1 .. 1;
Reserved_2_31 at 0 range 2 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Real-time clock
type RTC_Peripheral is record
-- RTC time register
TR : aliased TR_Register;
-- RTC date register
DR : aliased DR_Register;
-- RTC control register
CR : aliased CR_Register;
-- RTC initialization and status register
ISR : aliased ISR_Register;
-- RTC prescaler register
PRER : aliased PRER_Register;
-- RTC wakeup timer register
WUTR : aliased WUTR_Register;
-- RTC alarm A register
ALRMAR : aliased ALRMAR_Register;
-- RTC alarm B register
ALRMBR : aliased ALRMBR_Register;
-- write protection register
WPR : aliased WPR_Register;
-- RTC sub second register
SSR : aliased SSR_Register;
-- RTC shift control register
SHIFTR : aliased SHIFTR_Register;
-- RTC timestamp time register
TSTR : aliased TSTR_Register;
-- RTC timestamp date register
TSDR : aliased TSDR_Register;
-- RTC time-stamp sub second register
TSSSR : aliased TSSSR_Register;
-- RTC calibration register
CALR : aliased CALR_Register;
-- RTC tamper configuration register
TAMPCR : aliased TAMPCR_Register;
-- RTC alarm A sub second register
ALRMASSR : aliased ALRMASSR_Register;
-- RTC alarm B sub second register
ALRMBSSR : aliased ALRMBSSR_Register;
-- option register
OR_k : aliased OR_Register;
-- RTC backup registers
BKP0R : aliased STM32_SVD.UInt32;
-- RTC backup registers
BKP1R : aliased STM32_SVD.UInt32;
-- RTC backup registers
BKP2R : aliased STM32_SVD.UInt32;
-- RTC backup registers
BKP3R : aliased STM32_SVD.UInt32;
-- RTC backup registers
BKP4R : aliased STM32_SVD.UInt32;
end record
with Volatile;
for RTC_Peripheral use record
TR at 16#0# range 0 .. 31;
DR at 16#4# range 0 .. 31;
CR at 16#8# range 0 .. 31;
ISR at 16#C# range 0 .. 31;
PRER at 16#10# range 0 .. 31;
WUTR at 16#14# range 0 .. 31;
ALRMAR at 16#1C# range 0 .. 31;
ALRMBR at 16#20# range 0 .. 31;
WPR at 16#24# range 0 .. 31;
SSR at 16#28# range 0 .. 31;
SHIFTR at 16#2C# range 0 .. 31;
TSTR at 16#30# range 0 .. 31;
TSDR at 16#34# range 0 .. 31;
TSSSR at 16#38# range 0 .. 31;
CALR at 16#3C# range 0 .. 31;
TAMPCR at 16#40# range 0 .. 31;
ALRMASSR at 16#44# range 0 .. 31;
ALRMBSSR at 16#48# range 0 .. 31;
OR_k at 16#4C# range 0 .. 31;
BKP0R at 16#50# range 0 .. 31;
BKP1R at 16#54# range 0 .. 31;
BKP2R at 16#58# range 0 .. 31;
BKP3R at 16#5C# range 0 .. 31;
BKP4R at 16#60# range 0 .. 31;
end record;
-- Real-time clock
RTC_Periph : aliased RTC_Peripheral
with Import, Address => RTC_Base;
end STM32_SVD.RTC;
| 33.593964 | 66 | 0.548795 |
233b8500b5ffa7e0184f57f717f8805ffd06c70d | 836 | adb | Ada | src/glfw/v3/glfw-windows-clipboard.adb | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | 79 | 2015-04-20T23:10:02.000Z | 2022-03-04T13:50:56.000Z | src/glfw/v3/glfw-windows-clipboard.adb | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | 126 | 2015-09-10T10:41:34.000Z | 2022-03-20T11:25:40.000Z | src/glfw/v3/glfw-windows-clipboard.adb | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | 20 | 2015-03-17T07:15:57.000Z | 2022-02-02T17:12:11.000Z | -- part of OpenGLAda, (c) 2017 Felix Krause
-- released under the terms of the MIT license, see the file "COPYING"
with Interfaces.C.Strings;
with Glfw.API;
package body Glfw.Windows.Clipboard is
function Get (Object : not null access Window'Class) return String is
use type Interfaces.C.Strings.chars_ptr;
Raw : constant Interfaces.C.Strings.chars_ptr
:= API.Get_Clipboard_String (Object.Handle);
begin
if Raw = Interfaces.C.Strings.Null_Ptr then
raise Operation_Exception with "Could not get clipboard string";
end if;
return Interfaces.C.Strings.Value (Raw);
end Get;
procedure Set (Object : not null access Window'Class; Value : String) is
begin
API.Set_Clipboard_String (Object.Handle, Interfaces.C.To_C (Value));
end Set;
end Glfw.Windows.Clipboard;
| 29.857143 | 75 | 0.70933 |
18eb4eda2b4a90f05467fb54636e0a0ac2a9507b | 3,788 | ads | Ada | source/amf/ocl/amf-ocl-iterator_exps.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/ocl/amf-ocl-iterator_exps.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/ocl/amf-ocl-iterator_exps.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-2013, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.OCL.Loop_Exps;
package AMF.OCL.Iterator_Exps is
pragma Preelaborate;
type OCL_Iterator_Exp is limited interface
and AMF.OCL.Loop_Exps.OCL_Loop_Exp;
type OCL_Iterator_Exp_Access is
access all OCL_Iterator_Exp'Class;
for OCL_Iterator_Exp_Access'Storage_Size use 0;
end AMF.OCL.Iterator_Exps;
| 63.133333 | 78 | 0.418163 |
206a5b236e070a88c14844dbbc85758603ba9aea | 1,253 | adb | Ada | ada-exceptions/main.adb | dksmiffs/gnatmake-examples | 237c0cd9fe8d4788f8898509319a3a665d2233b1 | [
"MIT"
] | null | null | null | ada-exceptions/main.adb | dksmiffs/gnatmake-examples | 237c0cd9fe8d4788f8898509319a3a665d2233b1 | [
"MIT"
] | null | null | null | ada-exceptions/main.adb | dksmiffs/gnatmake-examples | 237c0cd9fe8d4788f8898509319a3a665d2233b1 | [
"MIT"
] | null | null | null | with Ada.Text_IO; use Ada.Text_IO;
procedure Main is
begin
-- Guide: http://archive.adaic.com/standards/83lrm/html/lrm-11-01.html
declare
PP : Positive;
P2 : Positive;
begin
P2 := 5;
PP := 3 - P2; -- intentionally violate Positive range constraint
exception
when Constraint_Error =>
Put_Line("HANDLED: violate range constraint gives Constraint_Error");
end;
declare
SS : String(1..4);
PP : Positive;
begin
PP := 5;
SS(PP) := 'X'; -- intentionally violate SS's index constraint
exception
when Constraint_Error =>
Put_Line("HANDLED: violate index constraint gives Constraint_Error");
end;
declare
type Liquid is (None, Water);
type Glass (Contents : Liquid) is
record
Weight : Positive;
case Contents is
when Water =>
Ounces : Positive;
when None =>
null;
end case;
end record;
GG : Glass(None);
begin
GG.Ounces := 5; -- intentionally access variant record component that
-- doesn't exist for GG
exception
when Constraint_Error =>
Put_Line("HANDLED: violate variant record component existance gives"
& " Constraint_Error");
end;
end Main;
| 24.096154 | 75 | 0.62091 |
1010ed258cb758c65fb0e520a11b97a607cfc0d3 | 968 | ads | Ada | regtests/wiki-testsuite.ads | jquorning/ada-wiki | 21dcbeb3897499ee4b4a85353f8a782e154c0a43 | [
"Apache-2.0"
] | 18 | 2015-10-26T21:32:08.000Z | 2021-11-30T10:38:51.000Z | regtests/wiki-testsuite.ads | jquorning/ada-wiki | 21dcbeb3897499ee4b4a85353f8a782e154c0a43 | [
"Apache-2.0"
] | 2 | 2018-03-18T08:22:06.000Z | 2022-02-16T22:15:05.000Z | regtests/wiki-testsuite.ads | jquorning/ada-wiki | 21dcbeb3897499ee4b4a85353f8a782e154c0a43 | [
"Apache-2.0"
] | 2 | 2019-04-05T17:10:34.000Z | 2022-02-13T20:50:56.000Z | -----------------------------------------------------------------------
-- wiki-testsuite - Wiki Test suite
-- Copyright (C) 2015 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Tests;
package Wiki.Testsuite is
function Suite return Util.Tests.Access_Test_Suite;
end Wiki.Testsuite;
| 37.230769 | 76 | 0.631198 |
1c624519413a87e90ed11ccabecf7233c3f98e1d | 2,462 | ads | Ada | source/libgela/gela.ads | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | 4 | 2016-02-05T15:51:56.000Z | 2022-03-25T20:38:32.000Z | source/libgela/gela.ads | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | null | null | null | source/libgela/gela.ads | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- G E L A A S I S --
-- ASIS implementation for Gela project, a portable Ada compiler --
-- http://gela.ada-ru.org --
-- - - - - - - - - - - - - - - - --
-- Read copyright and license at the end of this file --
------------------------------------------------------------------------------
-- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $
-- Purpose:
package Gela is
pragma Pure (Gela);
end Gela;
------------------------------------------------------------------------------
-- Copyright (c) 2006, Maxim Reznik
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
-- * Neither the name of the Maxim Reznik, IE nor the names of its
-- contributors may be used to endorse or promote products derived from
-- this software without specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
-- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-- POSSIBILITY OF SUCH DAMAGE.
------------------------------------------------------------------------------
| 55.954545 | 79 | 0.572299 |
20bbacc0267ca7b06a483f9f1108146bd76405c9 | 2,783 | ads | Ada | example/src/clic_ex-commands-config.ads | alire-project/clic | e57e289e4825e1ce4be96b5cdd1979a02a08c8ba | [
"MIT"
] | 9 | 2021-08-30T16:11:30.000Z | 2021-11-06T22:41:17.000Z | example/src/clic_ex-commands-config.ads | alire-project/clic | e57e289e4825e1ce4be96b5cdd1979a02a08c8ba | [
"MIT"
] | 8 | 2021-09-05T09:20:31.000Z | 2022-03-09T10:07:52.000Z | example/src/clic_ex-commands-config.ads | alire-project/clic | e57e289e4825e1ce4be96b5cdd1979a02a08c8ba | [
"MIT"
] | 2 | 2021-09-16T14:17:20.000Z | 2021-09-21T09:11:23.000Z | with AAA.Strings;
with CLIC.Subcommand;
with CLIC.Config;
package CLIC_Ex.Commands.Config is
type Instance
is limited new CLIC.Subcommand.Command
with private;
overriding
function Name (Cmd : Instance) return CLIC.Subcommand.Identifier
is ("config");
overriding
function Switch_Parsing (This : Instance)
return CLIC.Subcommand.Switch_Parsing_Kind
is (CLIC.Subcommand.Parse_All);
overriding
procedure Execute (Cmd : in out Instance;
Args : AAA.Strings.Vector);
overriding
procedure Setup_Switches
(Cmd : in out Instance;
Config : in out CLIC.Subcommand.Switches_Configuration);
overriding
function Short_Description (Cmd : Instance) return String
is ("List, Get, Set or Unset configuration options");
overriding
function Usage_Custom_Parameters (Cmd : Instance) return String is
("[--list] [--show-origin] [key_regex] |" &
" --get <key> |" &
" --set <key> <value> |" &
" --unset <key>");
overriding
function Long_Description (Cmd : Instance)
return AAA.Strings.Vector
is
(AAA.Strings.Empty_Vector
.Append ("Provides a command line interface to the Alire configuration" &
" option files.")
.New_Line
.Append ("Option names (keys) can use lowercase and uppercase" &
" alphanumeric characters")
.Append ("from the Latin alphabet. Underscores and dashes can also be" &
" used except as")
.Append ("first or last character. Dot '.' is used to specify" &
" sub-categories, e.g.")
.Append ("'user.name' or 'user.email'.")
.New_Line
.Append ("Option values can be integers, float, Boolean (true or" &
" false) or strings. The")
.Append ("type detection is automatic, e.g. 10 is integer, 10.1 is" &
" float, true is")
.Append ("Boolean. You can force a value to be set a string by using" &
" double-quotes, e.g.")
.Append ("""10.1"" or ""true"". Extra type checking is used for" &
" built-in options (see below).")
.New_Line
.Append ("Built-in configuration options:"));
private
type Instance
is limited new CLIC.Subcommand.Command with record
Config : CLIC.Config.Instance;
Show_Origin : aliased Boolean := False;
List : aliased Boolean := False;
Get : aliased Boolean := False;
Set : aliased Boolean := False;
Unset : aliased Boolean := False;
Global : aliased Boolean := False;
Builtins_Doc : aliased Boolean := False;
end record;
end CLIC_Ex.Commands.Config;
| 33.130952 | 79 | 0.598994 |
1cd440f44f94d084d8025b01f0d0b9ed52dc38ca | 3,515 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/cd/cd4051b.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/cd/cd4051b.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/cd/cd4051b.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- CD4051B.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE:
-- CHECK THAT A RECORD REPRESENTATION CLAUSE WHICH CHANGES THE
-- ORDER OF THE COMPONENT STORAGE CAN BE GIVEN FOR A DERIVED TYPE
-- WHOSE PARENT TYPE IS A RECORD WITHOUT A DISCRIMINANT.
-- HISTORY:
-- BCB 03/20/89 CHANGED EXTENSION FROM '.ADA' TO '.DEP'.
-- RJW 08/25/87 CREATED ORIGINAL TEST.
WITH REPORT; USE REPORT;
WITH SYSTEM;
PROCEDURE CD4051B IS
UNITS_PER_INTEGER : CONSTANT :=
(INTEGER'SIZE + SYSTEM.STORAGE_UNIT - 1) /
SYSTEM.STORAGE_UNIT;
TYPE BASIC_CLAUSE IS RECORD
INT_COMP : INTEGER;
CHAR_COMP : CHARACTER;
END RECORD;
TYPE CHECK_CLAUSE IS NEW BASIC_CLAUSE;
FOR CHECK_CLAUSE USE
RECORD
INT_COMP AT 1*UNITS_PER_INTEGER
RANGE 0..INTEGER'SIZE - 1;
CHAR_COMP AT 0
RANGE 0..CHARACTER'SIZE - 1;
END RECORD;
CHECK_RECORD : CHECK_CLAUSE := (1, 'A');
BEGIN
TEST ("CD4051B", "CHECK THAT A RECORD REPRESENTATION " &
"CLAUSE WHICH CHANGES THE ORDER OF COMPONENT " &
"STORAGE CAN BE GIVEN FOR A DERIVED TYPE " &
"WHOSE PARENT TYPE IS IS A RECORD TYPE " &
"WITHOUT DISCRIMINANTS");
IF CHECK_RECORD.INT_COMP'FIRST_BIT /= 0 THEN
FAILED ("INCORRECT VALUE FOR FIRST_BIT OF INT_COMP");
END IF;
IF CHECK_RECORD.INT_COMP'LAST_BIT /= INTEGER'SIZE - 1 THEN
FAILED ("INCORRECT VALUE FOR LAST_BIT OF INT_COMP");
END IF;
IF CHECK_RECORD.INT_COMP'POSITION /=
IDENT_INT (UNITS_PER_INTEGER) THEN
FAILED ("INCORRECT VALUE FOR POSITION OF INT_COMP");
END IF;
IF CHECK_RECORD.CHAR_COMP'FIRST_BIT /= IDENT_INT (0) THEN
FAILED ("INCORRECT VALUE FOR FIRST_BIT OF CHAR_COMP");
END IF;
IF CHECK_RECORD.CHAR_COMP'LAST_BIT /=
IDENT_INT (CHARACTER'SIZE - 1) THEN
FAILED ("INCORRECT VALUE FOR LAST_BIT OF CHAR_COMP");
END IF;
IF CHECK_RECORD.CHAR_COMP'POSITION /=
IDENT_INT (0) THEN
FAILED ("INCORRECT VALUE FOR POSITION OF CHAR_COMP");
END IF;
RESULT;
END CD4051B;
| 37 | 79 | 0.62276 |
d03201c27a26f0997c764637434337a14bf9d422 | 331 | adb | Ada | examples/stm32f0/spi/main.adb | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 1 | 2021-04-06T07:57:56.000Z | 2021-04-06T07:57:56.000Z | examples/stm32f0/spi/main.adb | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | null | null | null | examples/stm32f0/spi/main.adb | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 2 | 2018-05-29T13:59:31.000Z | 2019-02-03T19:48:08.000Z | with STM32GD.SPI;
with STM32GD.SPI.Peripheral;
with STM32GD.Board; use STM32GD.Board;
procedure Main is
package SPI is new STM32GD.SPI.Peripheral (SPI => STM32GD.SPI.SPI_1);
Data : STM32GD.SPI.SPI_Data_8b := (0, 1, 2, 3, 4, 5, 6, 7);
begin
Init;
SPI.Init;
loop
SPI.Transfer (Data);
end loop;
end Main;
| 17.421053 | 72 | 0.661631 |
235df46a69639289fefefe24fa35b8079cb2a629 | 3,162 | ads | Ada | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-vade32.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-vade32.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-vade32.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . V A L _ D E C I M A L _ 3 2 --
-- --
-- S p e c --
-- --
-- Copyright (C) 2020-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains routines for scanning values for decimal fixed point
-- types up to 32-bit mantissa, for use in Text_IO.Decimal_IO, and the Value
-- attribute for such decimal types.
with Interfaces;
with System.Arith_32;
with System.Value_D;
package System.Val_Decimal_32 is
pragma Preelaborate;
subtype Int32 is Interfaces.Integer_32;
subtype Uns32 is Interfaces.Unsigned_32;
package Impl is new Value_D (Int32, Uns32, Arith_32.Scaled_Divide32);
function Scan_Decimal32
(Str : String;
Ptr : not null access Integer;
Max : Integer;
Scale : Integer) return Int32
renames Impl.Scan_Decimal;
function Value_Decimal32 (Str : String; Scale : Integer) return Int32
renames Impl.Value_Decimal;
end System.Val_Decimal_32;
| 53.59322 | 78 | 0.407653 |
1cb48fcff4b66a8209c482f0f6fba4440ce6b972 | 4,123 | ads | Ada | source/core/web-core-connectables-slots_0.ads | godunko/adawebui | ee524325fe701ef0a655cd0624e0ba701f0e8955 | [
"BSD-3-Clause"
] | 2 | 2020-01-31T07:00:09.000Z | 2021-06-25T15:50:00.000Z | source/core/web-core-connectables-slots_0.ads | godunko/adawebui | ee524325fe701ef0a655cd0624e0ba701f0e8955 | [
"BSD-3-Clause"
] | null | null | null | source/core/web-core-connectables-slots_0.ads | godunko/adawebui | ee524325fe701ef0a655cd0624e0ba701f0e8955 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2016-2020, 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: 5703 $ $Date: 2017-01-20 22:17:20 +0300 (Fri, 20 Jan 2017) $
------------------------------------------------------------------------------
package Web.Core.Connectables.Slots_0 is
pragma Preelaborate;
-- type Slot (<>) is abstract tagged limited private;
-- XXX GNATLLVM: instantiation erorr of Slot_1.
type Slot is abstract tagged limited private;
type Signal is limited interface;
not overriding procedure Connect
(Self : in out Signal;
Slot : Web.Core.Connectables.Slots_0.Slot'Class) is abstract;
private
type Slot_End_0 is abstract new Slot_End_Base with null record;
not overriding procedure Invoke (Self : in out Slot_End_0) is abstract;
type Slot is abstract tagged limited null record;
not overriding function Create_Slot_End
(Self : Slot) return not null Slot_End_Access;
end Web.Core.Connectables.Slots_0;
| 58.070423 | 78 | 0.454038 |
d0667b22fa01d27fcf00aa4b16391e394ab36052 | 11,722 | ads | Ada | orka/src/orka/interface/orka-rendering-buffers-mapped.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 52 | 2016-07-30T23:00:28.000Z | 2022-02-05T11:54:55.000Z | orka/src/orka/interface/orka-rendering-buffers-mapped.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 79 | 2016-08-01T18:36:48.000Z | 2022-02-27T12:14:20.000Z | orka/src/orka/interface/orka-rendering-buffers-mapped.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 4 | 2018-04-28T22:36:26.000Z | 2020-11-14T23:00:29.000Z | -- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2017 onox <[email protected]>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
private with Orka.Rendering.Buffers.Pointers;
package Orka.Rendering.Buffers.Mapped is
pragma Preelaborate;
type IO_Mode is (Read, Write);
type Mapped_Buffer
(Kind : Orka.Types.Element_Type;
Mode : IO_Mode) is abstract new Bindable_Buffer with private;
overriding
function Length (Object : Mapped_Buffer) return Natural;
-- Number of elements in the buffer
-----------------------------------------------------------------------------
overriding
procedure Bind
(Object : Mapped_Buffer;
Target : Indexed_Buffer_Target;
Index : Natural);
-- Bind the buffer object to the binding point at the given index of
-- the target
overriding
procedure Bind (Object : Mapped_Buffer; Target : Buffer_Target);
-- Bind the buffer object to the target
-----------------------------------------------------------------------------
procedure Write_Data
(Object : Mapped_Buffer;
Data : UByte_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : UShort_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : UInt_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Byte_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Short_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Int_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Half_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Single_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Double_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
-----------------------------------------------------------------------------
procedure Write_Data
(Object : Mapped_Buffer;
Data : Orka.Types.Singles.Vector4_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Orka.Types.Singles.Matrix4_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Orka.Types.Doubles.Vector4_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Orka.Types.Doubles.Matrix4_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Indirect.Arrays_Indirect_Command_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Indirect.Elements_Indirect_Command_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Data : Indirect.Dispatch_Indirect_Command_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Write and Offset + Data'Length <= Object.Length;
-----------------------------------------------------------------------------
procedure Write_Data
(Object : Mapped_Buffer;
Value : Orka.Types.Singles.Vector4;
Offset : Natural)
with Pre => Object.Mode = Write and Offset < Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Value : Orka.Types.Singles.Matrix4;
Offset : Natural)
with Pre => Object.Mode = Write and Offset < Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Value : Orka.Types.Doubles.Vector4;
Offset : Natural)
with Pre => Object.Mode = Write and Offset < Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Value : Orka.Types.Doubles.Matrix4;
Offset : Natural)
with Pre => Object.Mode = Write and Offset < Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Value : Indirect.Arrays_Indirect_Command;
Offset : Natural)
with Pre => Object.Mode = Write and Offset < Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Value : Indirect.Elements_Indirect_Command;
Offset : Natural)
with Pre => Object.Mode = Write and Offset < Object.Length;
procedure Write_Data
(Object : Mapped_Buffer;
Value : Indirect.Dispatch_Indirect_Command;
Offset : Natural)
with Pre => Object.Mode = Write and Offset < Object.Length;
-----------------------------------------------------------------------------
procedure Read_Data
(Object : Mapped_Buffer;
Data : out UByte_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out UShort_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out UInt_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Byte_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Short_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Int_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Half_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Single_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Double_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
-----------------------------------------------------------------------------
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Orka.Types.Singles.Vector4_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Orka.Types.Singles.Matrix4_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Orka.Types.Doubles.Vector4_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Orka.Types.Doubles.Matrix4_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Indirect.Arrays_Indirect_Command_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Indirect.Elements_Indirect_Command_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
procedure Read_Data
(Object : Mapped_Buffer;
Data : out Indirect.Dispatch_Indirect_Command_Array;
Offset : Natural := 0)
with Pre => Object.Mode = Read and Offset + Data'Length <= Object.Length;
private
use Orka.Types;
type Mapped_Buffer
(Kind : Orka.Types.Element_Type; Mode : IO_Mode)
is new Bindable_Buffer with record
Buffer : Buffers.Buffer (Kind);
Offset : Natural;
-- Offset in number of elements to the start of the buffer
--
-- Initially zero and incremented by Length whenever the index is
-- advanced if the buffer is mapped persistent.
case Kind is
-- Numeric types
when UByte_Type =>
Pointer_UByte : Pointers.UByte.Pointer;
when UShort_Type =>
Pointer_UShort : Pointers.UShort.Pointer;
when UInt_Type =>
Pointer_UInt : Pointers.UInt.Pointer;
when Byte_Type =>
Pointer_Byte : Pointers.Byte.Pointer;
when Short_Type =>
Pointer_Short : Pointers.Short.Pointer;
when Int_Type =>
Pointer_Int : Pointers.Int.Pointer;
when Half_Type =>
Pointer_Half : Pointers.Half.Pointer;
when Single_Type =>
Pointer_Single : Pointers.Single.Pointer;
when Double_Type =>
Pointer_Double : Pointers.Double.Pointer;
-- Composite types
when Single_Vector_Type =>
Pointer_SV : Pointers.Single_Vector4.Pointer;
when Double_Vector_Type =>
Pointer_DV : Pointers.Double_Vector4.Pointer;
when Single_Matrix_Type =>
Pointer_SM : Pointers.Single_Matrix4.Pointer;
when Double_Matrix_Type =>
Pointer_DM : Pointers.Double_Matrix4.Pointer;
when Arrays_Command_Type =>
Pointer_AC : Pointers.Arrays_Command.Pointer;
when Elements_Command_Type =>
Pointer_EC : Pointers.Elements_Command.Pointer;
when Dispatch_Command_Type =>
Pointer_DC : Pointers.Dispatch_Command.Pointer;
end case;
end record;
procedure Map
(Object : in out Mapped_Buffer;
Length : Size;
Flags : GL.Objects.Buffers.Access_Bits);
end Orka.Rendering.Buffers.Mapped;
| 33.587393 | 80 | 0.625491 |
39bf159defa0248eb48aaabb12f1e87ec04666a8 | 4,115 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c97301e.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/c97301e.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c97301e.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C97301E.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- CHECK THAT A TIMED_ENTRY_CALL DELAYS FOR AT LEAST THE SPECIFIED
-- AMOUNT OF TIME IF A RENDEZVOUS IS NOT POSSIBLE.
-- CASE E: THE BODY OF THE TASK CONTAINING THE CALLED ENTRY
-- DOES NOT CONTAIN AN ACCEPT_STATEMENT FOR THAT ENTRY -
-- (THE ENTRY BELONGS TO AN ENTRY FAMILY; SOME FAMILY MEMBERS
-- ARE "ACCEPTABLE", BUT NOT THE CALLED ONE.)
-- RJW 3/31/86
with Impdef;
WITH REPORT; USE REPORT;
WITH CALENDAR; USE CALENDAR;
PROCEDURE C97301E IS
OR_BRANCH_TAKEN : BOOLEAN := FALSE;
BEGIN
TEST ("C97301E", "CHECK THAT A TIMED_ENTRY_CALL DELAYS FOR AT " &
"LEAST THE SPECIFIED AMOUNT OF TIME " &
"IN THE ABSENCE OF A CORRESPONDING " &
"ACCEPT_STATEMENT " );
DECLARE
WAIT_TIME : DURATION := 3.0 * Impdef.One_Second;
START_TIME : TIME;
STOP_TIME : TIME;
SUBTYPE SHORT IS INTEGER RANGE 10..20 ;
KEEP_ALIVE : INTEGER := 15 ;
TASK T IS
ENTRY DO_IT_NOW_OR_WAIT ( SHORT ) ;
END T ;
TASK BODY T IS
BEGIN
-- NO ACCEPT_STATEMENT FOR THE ENTRY_CALL BEING TESTED.
ACCEPT DO_IT_NOW_OR_WAIT ( IDENT_INT(15) );
-- THIS ALSO PREVENTS THIS SERVER
-- TASK FROM TERMINATING IF
-- UPON ACTIVATION
-- IT GETS TO RUN
-- AHEAD OF THE CALLER (WHICH
-- WOULD LEAD TO A SUBSEQUENT
-- TASKING_ERROR AT THE TIME
-- OF THE NO-WAIT CALL).
END ;
BEGIN
START_TIME := CLOCK;
SELECT
T.DO_IT_NOW_OR_WAIT (10) ; -- ACCEPT_STATEMENT HAS 15.
OR
-- THEREFORE THIS BRANCH MUST BE CHOSEN.
DELAY WAIT_TIME;
STOP_TIME := CLOCK;
IF STOP_TIME >= (WAIT_TIME + START_TIME) THEN
NULL;
ELSE
FAILED ( "INSUFFICIENT DELAY" );
END IF;
OR_BRANCH_TAKEN := TRUE ;
COMMENT( "OR_BRANCH TAKEN" );
END SELECT;
T.DO_IT_NOW_OR_WAIT (KEEP_ALIVE) ;
EXCEPTION
WHEN TASKING_ERROR =>
FAILED ( "TASKING ERROR" );
END; -- END OF BLOCK CONTAINING THE TIMED ENTRY CALL.
-- BY NOW, TASK T IS TERMINATED.
IF OR_BRANCH_TAKEN THEN
NULL ;
ELSE
FAILED( "RENDEZVOUS ATTEMPTED" );
END IF;
RESULT;
END C97301E ;
| 34.579832 | 79 | 0.535844 |
fbec9e9f189f65373500246a8b9f15400521ec7c | 5,294 | ads | Ada | source/amf/utp/amf-utp-timer_running_actions-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/utp/amf-utp-timer_running_actions-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/utp/amf-utp-timer_running_actions-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Generic_Collections;
package AMF.Utp.Timer_Running_Actions.Collections is
pragma Preelaborate;
package Utp_Timer_Running_Action_Collections is
new AMF.Generic_Collections
(Utp_Timer_Running_Action,
Utp_Timer_Running_Action_Access);
type Set_Of_Utp_Timer_Running_Action is
new Utp_Timer_Running_Action_Collections.Set with null record;
Empty_Set_Of_Utp_Timer_Running_Action : constant Set_Of_Utp_Timer_Running_Action;
type Ordered_Set_Of_Utp_Timer_Running_Action is
new Utp_Timer_Running_Action_Collections.Ordered_Set with null record;
Empty_Ordered_Set_Of_Utp_Timer_Running_Action : constant Ordered_Set_Of_Utp_Timer_Running_Action;
type Bag_Of_Utp_Timer_Running_Action is
new Utp_Timer_Running_Action_Collections.Bag with null record;
Empty_Bag_Of_Utp_Timer_Running_Action : constant Bag_Of_Utp_Timer_Running_Action;
type Sequence_Of_Utp_Timer_Running_Action is
new Utp_Timer_Running_Action_Collections.Sequence with null record;
Empty_Sequence_Of_Utp_Timer_Running_Action : constant Sequence_Of_Utp_Timer_Running_Action;
private
Empty_Set_Of_Utp_Timer_Running_Action : constant Set_Of_Utp_Timer_Running_Action
:= (Utp_Timer_Running_Action_Collections.Set with null record);
Empty_Ordered_Set_Of_Utp_Timer_Running_Action : constant Ordered_Set_Of_Utp_Timer_Running_Action
:= (Utp_Timer_Running_Action_Collections.Ordered_Set with null record);
Empty_Bag_Of_Utp_Timer_Running_Action : constant Bag_Of_Utp_Timer_Running_Action
:= (Utp_Timer_Running_Action_Collections.Bag with null record);
Empty_Sequence_Of_Utp_Timer_Running_Action : constant Sequence_Of_Utp_Timer_Running_Action
:= (Utp_Timer_Running_Action_Collections.Sequence with null record);
end AMF.Utp.Timer_Running_Actions.Collections;
| 57.543478 | 100 | 0.542312 |
397932444275a6bf108f22f471d06204ffedc185 | 13,954 | adb | Ada | src/natools-smaz.adb | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | src/natools-smaz.adb | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | src/natools-smaz.adb | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | ------------------------------------------------------------------------------
-- Copyright (c) 2016-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. --
------------------------------------------------------------------------------
package body Natools.Smaz is
use type Ada.Streams.Stream_Element_Offset;
procedure Find_Entry
(Dict : in Dictionary;
Template : in String;
Index : out Ada.Streams.Stream_Element;
Length : out Natural);
-- Try to find the longest entry in Dict that is a prefix of Template,
-- setting Length to 0 when no such entry exists.
function To_String (Data : in Ada.Streams.Stream_Element_Array)
return String;
-- Convert a stream element array into a string
function Verbatim_Size (Dict : Dictionary; Original_Size : Natural)
return Ada.Streams.Stream_Element_Count;
-- Return the number of bytes needed by the verbatim encoding
-- of Original_Size bytes.
------------------------------
-- Local Helper Subprograms --
------------------------------
procedure Find_Entry
(Dict : in Dictionary;
Template : in String;
Index : out Ada.Streams.Stream_Element;
Length : out Natural)
is
I : Ada.Streams.Stream_Element;
N : Natural;
begin
Index := Ada.Streams.Stream_Element'Last;
Length := 0;
for Last in reverse Template'Range loop
N := Dict.Hash (Template (Template'First .. Last));
if N <= Natural (Dict.Dict_Last) then
I := Ada.Streams.Stream_Element (N);
if Dict_Entry (Dict, I) = Template (Template'First .. Last) then
Index := I;
Length := 1 + Last - Template'First;
return;
end if;
end if;
end loop;
end Find_Entry;
function To_String (Data : in Ada.Streams.Stream_Element_Array)
return String is
begin
return Result : String (1 .. Data'Length) do
for I in Result'Range loop
Result (I) := Character'Val (Data
(Data'First + Ada.Streams.Stream_Element_Offset (I - 1)));
end loop;
end return;
end To_String;
function Verbatim_Size (Dict : Dictionary; Original_Size : Natural)
return Ada.Streams.Stream_Element_Count
is
Verbatim1_Max_Size : constant Ada.Streams.Stream_Element_Count
:= Ada.Streams.Stream_Element_Count
(Ada.Streams.Stream_Element'Last - Dict.Dict_Last)
- Boolean'Pos (Dict.Variable_Length_Verbatim);
Verbatim2_Max_Size : constant Ada.Streams.Stream_Element_Count
:= Ada.Streams.Stream_Element_Count (Ada.Streams.Stream_Element'Last)
+ Verbatim1_Max_Size;
Remaining : Ada.Streams.Stream_Element_Count
:= Ada.Streams.Stream_Element_Count (Original_Size);
Overhead : Ada.Streams.Stream_Element_Count := 0;
begin
if Dict.Variable_Length_Verbatim then
if Remaining >= Verbatim2_Max_Size then
declare
Full_Blocks : constant Ada.Streams.Stream_Element_Count
:= Remaining / Verbatim2_Max_Size;
begin
Overhead := Overhead + 2 * Full_Blocks;
Remaining := Remaining - Verbatim2_Max_Size * Full_Blocks;
end;
end if;
if Remaining > Verbatim1_Max_Size then
Overhead := Overhead + 2;
Remaining := 0;
end if;
end if;
declare
Block_Count : constant Ada.Streams.Stream_Element_Count
:= (Remaining + Verbatim1_Max_Size - 1) / Verbatim1_Max_Size;
begin
Overhead := Overhead + Block_Count;
end;
return Overhead + Ada.Streams.Stream_Element_Count (Original_Size);
end Verbatim_Size;
----------------------
-- Public Interface --
----------------------
function Dict_Entry
(Dict : in Dictionary;
Index : in Ada.Streams.Stream_Element)
return String
is
First : constant Positive := Dict.Offsets (Index);
Last : Natural := Dict.Values'Last;
begin
if Index + 1 in Dict.Offsets'Range then
Last := Dict.Offsets (Index + 1) - 1;
end if;
return Dict.Values (First .. Last);
end Dict_Entry;
function Compressed_Upper_Bound
(Dict : in Dictionary;
Input : in String)
return Ada.Streams.Stream_Element_Count is
begin
return Verbatim_Size (Dict, Input'Length);
end Compressed_Upper_Bound;
procedure Compress
(Dict : in Dictionary;
Input : in String;
Output_Buffer : out Ada.Streams.Stream_Element_Array;
Output_Last : out Ada.Streams.Stream_Element_Offset)
is
procedure Find_Entry;
Verbatim1_Max_Size : constant Natural
:= Natural (Ada.Streams.Stream_Element'Last - Dict.Dict_Last)
- Boolean'Pos (Dict.Variable_Length_Verbatim);
Verbatim2_Max_Size : constant Natural
:= Natural (Ada.Streams.Stream_Element'Last)
+ Verbatim1_Max_Size;
Input_Index : Positive := Input'First;
Length : Natural;
Word : Ada.Streams.Stream_Element;
procedure Find_Entry is
begin
Find_Entry
(Dict,
Input (Input_Index
.. Natural'Min (Input_Index + Dict.Max_Word_Length - 1,
Input'Last)),
Word,
Length);
end Find_Entry;
Previous_Verbatim_Beginning : Natural := 0;
Previous_Verbatim_Last : Ada.Streams.Stream_Element_Offset := 0;
begin
Output_Last := Output_Buffer'First - 1;
Find_Entry;
Main_Loop :
while Input_Index in Input'Range loop
Data_In_Dict :
while Length > 0 loop
Output_Last := Output_Last + 1;
Output_Buffer (Output_Last) := Word;
Input_Index := Input_Index + Length;
exit Main_Loop when Input_Index not in Input'Range;
Find_Entry;
end loop Data_In_Dict;
Verbatim_Block :
declare
Beginning : Positive := Input_Index;
Verbatim_Length, Block_Length : Natural;
begin
Verbatim_Scan :
while Length = 0 and Input_Index in Input'Range loop
Input_Index := Input_Index + 1;
Find_Entry;
end loop Verbatim_Scan;
Verbatim_Length := Input_Index - Beginning;
if Previous_Verbatim_Beginning > 0
and then Output_Last + Verbatim_Size (Dict, Verbatim_Length)
>= Previous_Verbatim_Last + Verbatim_Size
(Dict, Input_Index - Previous_Verbatim_Beginning)
then
Beginning := Previous_Verbatim_Beginning;
Output_Last := Previous_Verbatim_Last;
Verbatim_Length := Input_Index - Beginning;
else
Previous_Verbatim_Beginning := Beginning;
Previous_Verbatim_Last := Output_Last;
end if;
Verbatim_Encode :
while Verbatim_Length > 0 loop
if Dict.Variable_Length_Verbatim
and then Verbatim_Length > Verbatim1_Max_Size
then
Block_Length := Natural'Min
(Verbatim_Length, Verbatim2_Max_Size);
Output_Buffer (Output_Last + 1)
:= Ada.Streams.Stream_Element'Last;
Output_Buffer (Output_Last + 2) := Ada.Streams.Stream_Element
(Block_Length - Verbatim1_Max_Size);
Output_Last := Output_Last + 2;
else
Block_Length := Natural'Min
(Verbatim_Length, Verbatim1_Max_Size);
Output_Last := Output_Last + 1;
Output_Buffer (Output_Last)
:= Ada.Streams.Stream_Element'Last
- Ada.Streams.Stream_Element
(Block_Length - 1
+ Boolean'Pos (Dict.Variable_Length_Verbatim));
end if;
Verbatim_Copy :
for I in Beginning .. Beginning + Block_Length - 1 loop
Output_Last := Output_Last + 1;
Output_Buffer (Output_Last) := Character'Pos (Input (I));
end loop Verbatim_Copy;
Verbatim_Length := Verbatim_Length - Block_Length;
Beginning := Beginning + Block_Length;
end loop Verbatim_Encode;
end Verbatim_Block;
end loop Main_Loop;
end Compress;
function Compress (Dict : in Dictionary; Input : in String)
return Ada.Streams.Stream_Element_Array
is
Result : Ada.Streams.Stream_Element_Array
(1 .. Compressed_Upper_Bound (Dict, Input));
Last : Ada.Streams.Stream_Element_Offset;
begin
Compress (Dict, Input, Result, Last);
return Result (Result'First .. Last);
end Compress;
function Decompressed_Length
(Dict : in Dictionary;
Input : in Ada.Streams.Stream_Element_Array)
return Natural
is
Result : Natural := 0;
Verbatim_Code_Count : constant Ada.Streams.Stream_Element_Offset
:= Ada.Streams.Stream_Element_Offset
(Ada.Streams.Stream_Element'Last - Dict.Dict_Last);
Input_Index : Ada.Streams.Stream_Element_Offset := Input'First;
Input_Byte : Ada.Streams.Stream_Element;
Verbatim_Length : Ada.Streams.Stream_Element_Offset;
begin
while Input_Index in Input'Range loop
Input_Byte := Input (Input_Index);
if Input_Byte in Dict.Offsets'Range then
Result := Result + Dict_Entry (Dict, Input_Byte)'Length;
Input_Index := Input_Index + 1;
else
if not Dict.Variable_Length_Verbatim then
Verbatim_Length := Ada.Streams.Stream_Element_Offset
(Ada.Streams.Stream_Element'Last - Input_Byte) + 1;
elsif Input_Byte < Ada.Streams.Stream_Element'Last then
Verbatim_Length := Ada.Streams.Stream_Element_Offset
(Ada.Streams.Stream_Element'Last - Input_Byte);
else
Input_Index := Input_Index + 1;
Verbatim_Length := Ada.Streams.Stream_Element_Offset
(Input (Input_Index)) + Verbatim_Code_Count - 1;
end if;
Result := Result + Positive (Verbatim_Length);
Input_Index := Input_Index + Verbatim_Length + 1;
end if;
end loop;
return Result;
end Decompressed_Length;
procedure Decompress
(Dict : in Dictionary;
Input : in Ada.Streams.Stream_Element_Array;
Output_Buffer : out String;
Output_Last : out Natural)
is
procedure Append (S : in String);
procedure Append (S : in Ada.Streams.Stream_Element_Array);
procedure Append (S : in String) is
begin
Output_Buffer (Output_Last + 1 .. Output_Last + S'Length) := S;
Output_Last := Output_Last + S'Length;
end Append;
procedure Append (S : in Ada.Streams.Stream_Element_Array) is
begin
Append (To_String (S));
end Append;
Verbatim_Code_Count : constant Ada.Streams.Stream_Element_Offset
:= Ada.Streams.Stream_Element_Offset
(Ada.Streams.Stream_Element'Last - Dict.Dict_Last);
Input_Index : Ada.Streams.Stream_Element_Offset := Input'First;
Input_Byte : Ada.Streams.Stream_Element;
Verbatim_Length : Ada.Streams.Stream_Element_Offset;
begin
Output_Last := Output_Buffer'First - 1;
while Input_Index in Input'Range loop
Input_Byte := Input (Input_Index);
if Input_Byte in Dict.Offsets'Range then
Append (Dict_Entry (Dict, Input_Byte));
Input_Index := Input_Index + 1;
else
if not Dict.Variable_Length_Verbatim then
Verbatim_Length := Ada.Streams.Stream_Element_Offset
(Ada.Streams.Stream_Element'Last - Input_Byte) + 1;
elsif Input_Byte < Ada.Streams.Stream_Element'Last then
Verbatim_Length := Ada.Streams.Stream_Element_Offset
(Ada.Streams.Stream_Element'Last - Input_Byte);
else
Input_Index := Input_Index + 1;
Verbatim_Length := Ada.Streams.Stream_Element_Offset
(Input (Input_Index)) + Verbatim_Code_Count - 1;
end if;
Append (Input (Input_Index + 1 .. Input_Index + Verbatim_Length));
Input_Index := Input_Index + Verbatim_Length + 1;
end if;
end loop;
end Decompress;
function Decompress
(Dict : in Dictionary; Input : in Ada.Streams.Stream_Element_Array)
return String
is
Result : String (1 .. Decompressed_Length (Dict, Input));
Last : Natural;
begin
Decompress (Dict, Input, Result, Last);
pragma Assert (Last = Result'Last);
return Result;
end Decompress;
end Natools.Smaz;
| 35.963918 | 79 | 0.597463 |
dfb55e21287313beed2a7003c24a21764116ca40 | 1,478 | ads | Ada | tier-1/xcb/source/thin/xcb-xcb_glx_get_minmax_parameterfv_cookie_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 2 | 2015-11-12T11:16:20.000Z | 2021-08-24T22:32:04.000Z | tier-1/xcb/source/thin/xcb-xcb_glx_get_minmax_parameterfv_cookie_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 1 | 2018-06-05T05:19:35.000Z | 2021-11-20T01:13:23.000Z | tier-1/xcb/source/thin/xcb-xcb_glx_get_minmax_parameterfv_cookie_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | null | null | null | -- This file is generated by SWIG. Please do not modify by hand.
--
with Interfaces.C;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_glx_get_minmax_parameterfv_cookie_t is
-- Item
--
type Item is record
sequence : aliased Interfaces.C.unsigned;
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb
.xcb_glx_get_minmax_parameterfv_cookie_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_get_minmax_parameterfv_cookie_t.Item,
Element_Array => xcb.xcb_glx_get_minmax_parameterfv_cookie_t.Item_Array,
Default_Terminator => (others => <>));
subtype Pointer is C_Pointers.Pointer;
-- Pointer_Array
--
type Pointer_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb
.xcb_glx_get_minmax_parameterfv_cookie_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_get_minmax_parameterfv_cookie_t.Pointer,
Element_Array =>
xcb.xcb_glx_get_minmax_parameterfv_cookie_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_glx_get_minmax_parameterfv_cookie_t;
| 26.392857 | 78 | 0.684032 |
fbfef966878ec702df79695e10bc7d7931c6ae9a | 5,588 | ads | Ada | CSV/src/csv.ads | marcbejerano/ada-tools | 49a7cc29100535e82d17d9d6f9878d1272ca6ec7 | [
"BSD-3-Clause"
] | 2 | 2015-08-05T07:02:49.000Z | 2016-08-25T16:39:21.000Z | CSV/src/csv.ads | marcbejerano/ada-tools | 49a7cc29100535e82d17d9d6f9878d1272ca6ec7 | [
"BSD-3-Clause"
] | null | null | null | CSV/src/csv.ads | marcbejerano/ada-tools | 49a7cc29100535e82d17d9d6f9878d1272ca6ec7 | [
"BSD-3-Clause"
] | null | null | null | -- @(#)File: csv.ads
-- @(#)Last changed: Aug 6 2015 10:07:13
-- @(#)Purpose: Character Separated Value (CSV) file support
-- @(#)Author: Marc Bejerano <[email protected]>
-- @(#)Copyright: Copyright (C) 2015, Marc Bejerano, All Rights Reserved
-- @(#)Product: None
-- @(#)License: BSD3
--
-- Copyright (c) 2015, Marc Bejerano
-- 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 ada-tools 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.
-- RFC4180 https://tools.ietf.org/html/rfc4180
with Ada.Containers.Vectors;
with Ada.Strings.Unbounded;
with Ada.Text_IO;
package CSV is
package ASU renames Ada.Strings.Unbounded;
use ASU;
package String_Vectors is new Ada.Containers.Vectors(Natural, Unbounded_String);
use String_Vectors;
type CSV_Record is new String_Vectors.Vector with null record;
--
-- Return the size of the CSV record. This function just returns the length
-- of the container (vector).
-- @param rec CSV record
-- @return Size of the record, in columns
--
function Size(rec: in CSV_Record) return Natural;
--
-- Retrieve the CSV record value at the given index. If the given index falls
-- outside of the range of available columns then a Constraint_Error will be
-- raised.
-- @param rec CSV record
-- @param index Column index
-- @return CSV column value
--
function Get(rec: in CSV_Record;
index: in Natural) return String;
--
-- Update the CSV element at the given column index with the supplied value.
-- If the given index falls outside of the range of available columns then
-- a Constraint_Error will be raised.
-- @param rec CSV record
-- @param index Column index
-- @param value New column value
--
procedure Set(rec: in out CSV_Record;
index: in Natural;
value: in String);
type CSV_File is tagged limited private;
--
-- Open the CSV file for reading and/or writing.
-- @param csv CSV object
-- @param file_name Name of the CSV file
-- @param mode File mode (In_File, Out_File, or In_Out_File)
-- @param has_header True if this CSV file has a header line
--
procedure Open(csv: in out CSV_File;
file_name: in String;
mode: in Ada.Text_IO.File_Mode := Ada.Text_IO.In_File;
delimiter: in String := ",";
has_header: in Boolean := false);
--
-- Close the CSV file.
-- @param csv CSV file
--
procedure Close(csv: in out CSV_File);
--
-- Return the column index for the named column. IF the named column does
-- not exist in the headers then a Contraint_Error will be thrown.
-- @param csv CSV File
-- @param column_name Name of column to look up
-- @return Index of the named column
--
function Column_Index(csv: in CSV_File;
column_name: in String) return Natural;
--
-- Read the next line from the CSV file. If there are no more lines in the
-- file to read then an End_Error will be raised.
-- @param csv CSV File
-- @param delimiter Delimiter override (supercedes the CSV file object)
-- @return CSV_Record
--
function Read(csv: in CSV_File'Class;
delimiter: in String := ",") return CSV_Record;
--
-- Write the given CSV record into the provede CSV file using the delimiter
-- specified. If the use_quotes is set to True then all columns will be
-- emitted surrounded by double quotes and all quotes inside those columns
-- will be escaped (by double-quoting the double-quotes).
-- @param csv CSV File
-- @param rec CSV Record
-- @param delimiter Column delimiter
-- @param use_quotes Force column quotes
--
procedure Write(csv: in CSV_File'Class;
rec: in CSV_Record;
delimiter: in String := ",";
use_quotes: in Boolean := True);
private
type CSV_File is tagged limited record
headers: CSV_Record;
file: Ada.text_IO.File_Type;
delim: Character := ',';
end record;
end CSV;
| 37.503356 | 84 | 0.67126 |
39a99cbcd96dcbdc8bc67a724f537a66596b9109 | 11,861 | ads | Ada | sources/local_message_passing.ads | HeisenbugLtd/msg_passing | 985d9065bae68fb8dace8b8dcadd1a7e6f5a9fbe | [
"WTFPL"
] | null | null | null | sources/local_message_passing.ads | HeisenbugLtd/msg_passing | 985d9065bae68fb8dace8b8dcadd1a7e6f5a9fbe | [
"WTFPL"
] | null | null | null | sources/local_message_passing.ads | HeisenbugLtd/msg_passing | 985d9065bae68fb8dace8b8dcadd1a7e6f5a9fbe | [
"WTFPL"
] | null | null | null | ------------------------------------------------------------------------
-- Copyright (C) 2010-2020 by Heisenbug Ltd. ([email protected])
--
-- This work is free. You can redistribute it and/or modify it under
-- the terms of the Do What The Fuck You Want To Public License,
-- Version 2, as published by Sam Hocevar. See the LICENSE file for
-- more details.
------------------------------------------------------------------------
pragma License (Unrestricted);
------------------------------------------------------------------------
-- Local_Message_Passing
--
-- Generic package providing mailbox communication channels.
--
-- All mailboxes instantiated from this package can be shared by name
-- between different tasks without needing the specific package where
-- the mailbox is located.
--
-- The order of exporting and importing calls is not important, the
-- underlying mailbox sharing mechanism takes care of suspending a
-- caller until its requested mailbox becomes available.
--
------------------------------------------------------------------------
with Ada.Real_Time;
with Mailbox_Sharing;
generic
type Message is private;
package Local_Message_Passing is
-- A mailbox with this name has already been exported.
Already_Exported : exception renames
Mailbox_Sharing.Already_Exported;
-- If a mailbox can not be connected to within the given duration,
-- this exception will be raised.
No_Such_Mailbox : exception renames
Mailbox_Sharing.No_Such_Mailbox;
-- If more than the supported number of mailboxes (see package
-- Mailbox_Sharing) are exported, this exception will be raised.
Too_Many_Mailboxes : exception renames
Mailbox_Sharing.Too_Many_Mailboxes;
---------------------------------------------------------------------
-- Mailbox
--
-- A package can own a mailbox by declaring an object of type
-- Mailbox with an appropriate queue length (Size).
--
-- Please note that a size of 0 is supported in the technical
-- sense, but then the queue will always be empty and full at the
-- same time, any calling task will block on both send and receive.
---------------------------------------------------------------------
type Mailbox (Size : Natural) is limited private;
---------------------------------------------------------------------
-- Handle
--
-- To actually use the mailbox, "Open_Mailbox" must be called to
-- create a handle to it. The mailbox itself has no operations at
-- all, all operations on the mailbox are done through the handle.
--
-- To make the mailbox available to other processes, it must be
-- exported with an unique name. Any process wishing to connect to
-- such a published mailbox may call "Import_Mailbox" then, which -
-- upon success - makes a handle to that mailbox available to the
-- calling process.
--
-- Because the handle type is also private, uses like
-- "Export_Mailbox (Handle.all)" are not allowed (outside of this
-- package or children, that is), thus only the owning package is
-- able to create such a handle directly from a mailbox declaration
-- (unless its mailbox declaration would be made public).
--
-- Also make it limited to disallow free copying of this handle.
-- It is technically safe to pass around this handle once it has
-- been properly obtained (after all, it's just a reference), but
-- there is also no technical reason to do so.
---------------------------------------------------------------------
type Handle is limited private;
---------------------------------------------------------------------
-- Open_Mailbox
--
-- "Constructor" function.
-- Re-Initialises the mailbox for use and also "returns" its handle.
-- If Export_Name is given, the mailbox is exported via the (local)
-- sharing mechanism.
---------------------------------------------------------------------
procedure Open_Mailbox (Mbx : in out Mailbox;
Hnd : out Handle;
Export_Name : in String := "");
---------------------------------------------------------------------
-- Import_Mailbox
--
-- Imports a named mailbox for use by calling process.
--
-- If the name for the mailbox does not exist and does not become
-- available during the given Max_Wait timespan, No_Such_Mailbox
-- will be raised.
---------------------------------------------------------------------
procedure Import_Mailbox (Name : in String;
Hnd : out Handle;
Max_Wait : in Ada.Real_Time.Time_Span);
--
-- Actual messaging functions.
--
---------------------------------------------------------------------
-- Conditional_Send
--
-- Puts a message into the mailbox, if it is not full yet.
-- Returns True for the Success parameter if the message has been
-- deposited.
---------------------------------------------------------------------
procedure Conditional_Send (Mbx : in Handle;
Msg : in Message;
Success : out Boolean);
---------------------------------------------------------------------
-- Send
--
-- Puts a message into the mailbox. If the mailbox is full, the
-- caller gets blocked until a slot becomes available.
---------------------------------------------------------------------
procedure Send (Mbx : in Handle;
Msg : in Message);
---------------------------------------------------------------------
-- Timed_Send (Send_Until)
--
-- Puts a message into the mailbox. Just like Send it blocks, but at
-- most until the time specified.
---------------------------------------------------------------------
procedure Timed_Send (Mbx : in Handle;
Msg : in Message;
Latest : in Ada.Real_Time.Time;
Success : out Boolean);
---------------------------------------------------------------------
-- Timed_Send (Send_For)
--
-- Puts a message into the mailbox. Just like Send it blocks, but at
-- most for the time span specified.
---------------------------------------------------------------------
procedure Timed_Send (Mbx : in Handle;
Msg : in Message;
Max_Wait : in Ada.Real_Time.Time_Span;
Success : out Boolean);
---------------------------------------------------------------------
-- Conditional_Receive
--
-- Retrieves a message from the mailbox. If the mailbox is empty,
-- the Success parameter will be False. If it is True the message
-- parameter will contain the message received.
---------------------------------------------------------------------
procedure Conditional_Receive (Mbx : in Handle;
Msg : out Message;
Success : out Boolean);
---------------------------------------------------------------------
-- Receive
--
-- Retrieves a message from the mailbox. If the mailbox is empty,
-- the caller gets blocked until a message becomes available.
---------------------------------------------------------------------
procedure Receive (Mbx : in Handle;
Msg : out Message);
---------------------------------------------------------------------
-- Timed_Receive (Receive_Until)
--
-- Retrieves a message from the mailbox. Just like Receive it blocks
-- until a message becomes available, but at most until the time
-- specified.
---------------------------------------------------------------------
procedure Timed_Receive (Mbx : in Handle;
Msg : out Message;
Latest : in Ada.Real_Time.Time;
Success : out Boolean);
---------------------------------------------------------------------
-- Timed_Receive (Receive_For)
--
-- Retrieves a message from the mailbox. Just like Receive it blocks
-- until a message becomes available, but at most for the time span
-- specified.
---------------------------------------------------------------------
procedure Timed_Receive (Mbx : in Handle;
Msg : out Message;
Max_Wait : in Ada.Real_Time.Time_Span;
Success : out Boolean);
private
---------------------------------------------------------------------
-- Message_Queue
--
-- All messages of a mailbox are stored in a fixed size queue.
---------------------------------------------------------------------
type Message_Queue is array (Positive range <>) of Message;
---------------------------------------------------------------------
-- Handle
--
-- The actual mailbox handle.
---------------------------------------------------------------------
type Handle is access all Mailbox;
---------------------------------------------------------------------
-- Mailbox
--
-- A mailbox is implemented as a protected type.
---------------------------------------------------------------------
protected type Mailbox (Size : Natural) is
------------------------------------------------------------------
-- Mailbox.Clear
--
-- Initialisation. Clears the internal queue.
------------------------------------------------------------------
procedure Clear;
------------------------------------------------------------------
-- Mailbox.Try_Put
--
-- Unblocking send.
------------------------------------------------------------------
procedure Try_Put (Msg : in Message;
Success : out Boolean);
------------------------------------------------------------------
-- Mailbox.Put
--
-- Blocking send.
------------------------------------------------------------------
entry Put (Msg : in Message);
------------------------------------------------------------------
-- Mailbox.Try_Get
--
-- Unblocking read.
------------------------------------------------------------------
procedure Try_Get (Msg : out Message;
Success : out Boolean);
------------------------------------------------------------------
-- Mailbox.Get
--
-- Blocking read.
------------------------------------------------------------------
entry Get (Msg : out Message);
-- Reading virtual channels shall only happen for the mailbox
-- owner. This means, we can bind the Reader VC onto the mailbox
-- type instead of the handle.
private
-- The message queue if the mailbox is used locally (same CPU).
Msg_Queue : Message_Queue (1 .. Size);
-- The queue is implemented like a ring buffer so that always the
-- oldest message is retrieved if there is more than one. Thus we
-- need to keep track of the beginning and end of the buffer.
--
-- The default values here are only given for safety purposes.
-- It is expected that before using a mailbox "Init_Mailbox" is
-- called which re-initialises the mailbox.
Num_Messages : Natural := 0;
Latest : Natural := 1;
Oldest : Natural := 1;
end Mailbox;
end Local_Message_Passing;
| 41.764085 | 72 | 0.446337 |
1c9f22cabc194dce7c94cdedaf0d5751762c4135 | 2,509 | ada | Ada | Task/Chat-server/Ada/chat-server.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:38.000Z | 2018-11-09T22:08:38.000Z | Task/Chat-server/Ada/chat-server.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/Chat-server/Ada/chat-server.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:40.000Z | 2018-11-09T22:08:40.000Z | with Ada.Containers.Vectors;
with Ada.Command_Line; use Ada.Command_Line;
with Ada.Exceptions; use Ada.Exceptions;
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Sockets; use Sockets;
procedure Chat_Server is
package Client_Vectors is new Ada.Containers.Vectors
(Element_Type => Socket_FD, Index_Type => Positive);
All_Clients : Client_Vectors.Vector;
procedure Write (S : String) is
procedure Output (Position : Client_Vectors.Cursor) is
Sock : Socket_FD := Client_Vectors.Element (Position);
begin
Put_Line (Sock, S);
end Output;
begin
All_Clients.Iterate (Output'Access);
end Write;
task type Client_Task is
entry Start (FD : Socket_FD);
end Client_Task;
task body Client_Task is
Sock : Socket_FD;
Sock_ID : Positive;
Name : Unbounded_String;
begin
select
accept Start (FD : Socket_FD) do
Sock := FD;
end Start;
or
terminate;
end select;
while Name = Null_Unbounded_String loop
Put (Sock, "Enter Name:");
Name := To_Unbounded_String (Get_Line (Sock));
end loop;
Write (To_String (Name) & " joined.");
All_Clients.Append (Sock);
Sock_ID := All_Clients.Find_Index (Sock);
loop
declare
Input : String := Get_Line (Sock);
begin
Write (To_String (Name) & ": " & Input);
end;
end loop;
exception
when Connection_Closed =>
Put_Line ("Connection closed");
Shutdown (Sock, Both);
All_Clients.Delete (Sock_ID);
Write (To_String (Name) & " left.");
end Client_Task;
Accepting_Socket : Socket_FD;
Incoming_Socket : Socket_FD;
type Client_Access is access Client_Task;
Dummy : Client_Access;
begin
if Argument_Count /= 1 then
Raise_Exception (Constraint_Error'Identity,
"Usage: " & Command_Name & " port");
end if;
Socket (Accepting_Socket, PF_INET, SOCK_STREAM);
Setsockopt (Accepting_Socket, SOL_SOCKET, SO_REUSEADDR, 1);
Bind (Accepting_Socket, Positive'Value (Argument (1)));
Listen (Accepting_Socket);
loop
Put_Line ("Waiting for new connection");
Accept_Socket (Accepting_Socket, Incoming_Socket);
Put_Line ("New connection acknowledged");
Dummy := new Client_Task;
Dummy.Start (Incoming_Socket);
end loop;
end Chat_Server;
| 29.174419 | 63 | 0.635313 |
d096e105f9e11d9982adc2b7c8b87ab3d555e879 | 451 | ads | Ada | tests/src/test_navigation.ads | TNO/Rejuvenation-Ada | 8113ec28da3923ccde40d76cbab70e0e614f4b75 | [
"BSD-3-Clause"
] | 1 | 2022-03-08T13:00:47.000Z | 2022-03-08T13:00:47.000Z | src/libraries/Rejuvenation_Lib/tests/test_navigation.ads | selroc/Renaissance-Ada | 39230b34aced4a9d83831be346ca103136c53715 | [
"BSD-3-Clause"
] | null | null | null | src/libraries/Rejuvenation_Lib/tests/test_navigation.ads | selroc/Renaissance-Ada | 39230b34aced4a9d83831be346ca103136c53715 | [
"BSD-3-Clause"
] | null | null | null | with AUnit; use AUnit;
with AUnit.Test_Cases; use AUnit.Test_Cases;
package Test_Navigation is
type Navigation_Test_Case is
new Test_Case with null record;
overriding procedure Register_Tests
(T : in out Navigation_Test_Case);
-- Register routines to be run
overriding function Name
(T : Navigation_Test_Case)
return Message_String;
-- Provide name identifying the test case
end Test_Navigation;
| 23.736842 | 45 | 0.722838 |
dcd8ab2e2a43d35b89e30f981124cbf8553ee874 | 3,558 | adb | Ada | tests/api/compare/main.adb | pmderodat/ada-toml | 1bc843e35520ca1d1861d52cfb9121d51ec9075b | [
"BSD-3-Clause"
] | 19 | 2019-03-25T15:32:12.000Z | 2022-03-22T13:15:57.000Z | tests/compare/main.adb | mosteo/ada-toml | d3454cdd51fa04098cdc76d2d30dd56f79a650e6 | [
"BSD-3-Clause"
] | 8 | 2019-04-14T10:09:23.000Z | 2021-09-10T11:03:38.000Z | tests/compare/main.adb | mosteo/ada-toml | d3454cdd51fa04098cdc76d2d30dd56f79a650e6 | [
"BSD-3-Clause"
] | 3 | 2019-04-12T08:42:24.000Z | 2021-06-24T12:59:46.000Z | with Ada.Text_IO;
with TOML;
procedure Main is
procedure Assert (Predicate : Boolean; Message : String);
-- If Predicate is false, emit the given error Message
procedure Assert_Eq (Left, Right : TOML.TOML_Value; Message : String);
-- Shortcut for Assert (TOML.Equals (Left, Right), Message)
procedure Assert_Ne (Left, Right : TOML.TOML_Value; Message : String);
-- Shortcut for Assert (not TOML.Equals (Left, Right), Message)
------------
-- Assert --
------------
procedure Assert (Predicate : Boolean; Message : String) is
begin
if not Predicate then
Ada.Text_IO.Put_Line ("Test failed: " & Message);
end if;
end Assert;
---------------
-- Assert_Eq --
---------------
procedure Assert_Eq (Left, Right : TOML.TOML_Value; Message : String) is
begin
Assert (TOML.Equals (Left, Right), Message);
end Assert_Eq;
---------------
-- Assert_Ne --
---------------
procedure Assert_Ne (Left, Right : TOML.TOML_Value; Message : String) is
begin
Assert (not TOML.Equals (Left, Right), Message);
end Assert_Ne;
use TOML;
begin
Assert_Ne
(Create_String ("ABCD"), Create_Integer (0), "different kinds");
Assert_Eq
(Create_Boolean (True), Create_Boolean (True), "same boolean");
Assert_Ne
(Create_Boolean (True), Create_Boolean (False), "different boolean");
Assert_Eq
(Create_Integer (0), Create_Integer (0), "same integer");
Assert_Ne
(Create_Integer (0), Create_Integer (1), "different integer");
Assert_Eq
(Create_String ("ABCD"), Create_String ("ABCD"), "same string");
Assert_Ne
(Create_String ("ABCD"), Create_String ("ABCDE"), "different string");
declare
Empty_1 : constant TOML_Value := Create_Array;
Empty_2 : constant TOML_Value := Create_Array;
One_Int_1 : constant TOML_Value := Create_Array;
One_Int_2 : constant TOML_Value := Create_Array;
Two_Ints : constant TOML_Value := Create_Array;
One_String : constant TOML_Value := Create_Array;
begin
One_Int_1.Append (Create_Integer (0));
One_Int_2.Append (Create_Integer (0));
Two_Ints.Append (Create_Integer (0));
Two_Ints.Append (Create_Integer (1));
One_String.Append (Create_String ("ABCD"));
Assert_Eq (Empty_1, Empty_2, "empty arrays");
Assert_Ne (Empty_1, One_Int_1, "different array length");
Assert_Eq (One_Int_1, One_Int_2, "same int array");
Assert_Ne (One_Int_1, Two_Ints, "different int array");
Assert_Ne (One_Int_1, One_String, "different array item kind");
end;
declare
Empty_1 : constant TOML_Value := Create_Table;
Empty_2 : constant TOML_Value := Create_Table;
Same_Key_1 : constant TOML_Value := Create_Table;
Same_Key_2 : constant TOML_Value := Create_Table;
Same_Key_3 : constant TOML_Value := Create_Table;
Different_Key : constant TOML_Value := Create_Table;
begin
Same_Key_1.Set ("key", Create_Boolean (True));
Same_Key_2.Set ("key", Create_Boolean (True));
Same_Key_3.Set ("key", Create_Boolean (False));
Different_Key.Set ("KEY", Create_Boolean (True));
Assert_Eq (Empty_1, Empty_2, "empty tables");
Assert_Ne (Empty_1, Same_Key_1, "different table size");
Assert_Eq (Same_Key_1, Same_Key_2, "same table content");
Assert_Ne (Same_Key_1, Same_Key_3, "different member value");
Assert_Ne (Same_Key_1, Different_Key, "different key");
end;
Ada.Text_IO.Put_Line ("Done");
end Main;
| 31.210526 | 75 | 0.652333 |
236009d09ee92aa965bec3d5b2ba6985396fc601 | 2,707 | ads | Ada | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/g-sestin.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/g-sestin.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/g-sestin.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- G N A T . S E C O N D A R Y _ S T A C K _ I N F O --
-- --
-- S p e c --
-- --
-- Copyright (C) 2004-2019, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package provides facilities for obtaining information on secondary
-- stack usage. See System.Secondary_Stack for documentation.
with System.Secondary_Stack;
package GNAT.Secondary_Stack_Info is
function SS_Get_Max return Long_Long_Integer
renames System.Secondary_Stack.SS_Get_Max;
end GNAT.Secondary_Stack_Info;
| 62.953488 | 78 | 0.418914 |
10fd2921f542b7ac977e244dd8792da520ee4869 | 369 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/bit_packed_array1.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/bit_packed_array1.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/bit_packed_array1.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- PR ada/33788
-- Origin: Oliver Kellogg <[email protected]>
-- { dg-do compile }
package body Bit_Packed_Array1 is
procedure Generate_Callforward is
Compiler_Crash : String :=
Laser_Illuminator_Code_Group_T'Image
(MADR.ISF.Laser_Illuminator_Code (0));
begin
null;
end Generate_Callforward;
end Bit_Packed_Array1;
| 21.705882 | 54 | 0.699187 |
c5052e400d69d8479e7b8479a754528b059c9e5f | 19,560 | adb | Ada | boards/ip_colordetect/colordetect/colordetect/.autopilot/db/colorthresholding_9_0_3_2160_3840_1_Block_colorthresholding_9_0_3_2160_3840_1_exit_proc.sched.adb | Kgfu/PYNQ_HelloWorld | a5197130e7d4a5e7f382c3963349c1c0bd213213 | [
"BSD-3-Clause"
] | null | null | null | boards/ip_colordetect/colordetect/colordetect/.autopilot/db/colorthresholding_9_0_3_2160_3840_1_Block_colorthresholding_9_0_3_2160_3840_1_exit_proc.sched.adb | Kgfu/PYNQ_HelloWorld | a5197130e7d4a5e7f382c3963349c1c0bd213213 | [
"BSD-3-Clause"
] | null | null | null | boards/ip_colordetect/colordetect/colordetect/.autopilot/db/colorthresholding_9_0_3_2160_3840_1_Block_colorthresholding_9_0_3_2160_3840_1_exit_proc.sched.adb | Kgfu/PYNQ_HelloWorld | a5197130e7d4a5e7f382c3963349c1c0bd213213 | [
"BSD-3-Clause"
] | null | null | null | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="15">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>colorthresholding_9_0_3_2160_3840_1_Block_colorthresholding_9_0_3_2160_3840_1_exit_proc</name>
<ret_bitwidth>32</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>p_src_mat_rows</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>49</coreId>
</Obj>
<bitwidth>16</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></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>49</coreId>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>5</id>
<name>img_height</name>
<fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_colorthresholding.hpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>152</lineNumber>
<contextFuncName>colorthresholding&lt;9, 0, 3, 2160, 3840, 1&gt;</contextFuncName>
<contextNormFuncName>colorthresholding_9_0_3_2160_3840_1_s</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second class_id="11" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="12" tracking_level="0" version="0">
<first class_id="13" tracking_level="0" version="0">
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_colorthresholding.hpp</first>
<second>colorthresholding&lt;9, 0, 3, 2160, 3840, 1&gt;</second>
</first>
<second>152</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>img_height</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>20</coreId>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>12</item>
<item>13</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="_4">
<Value>
<Obj>
<type>0</type>
<id>6</id>
<name>img_width</name>
<fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_colorthresholding.hpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>153</lineNumber>
<contextFuncName>colorthresholding&lt;9, 0, 3, 2160, 3840, 1&gt;</contextFuncName>
<contextNormFuncName>colorthresholding_9_0_3_2160_3840_1_s</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_colorthresholding.hpp</first>
<second>colorthresholding&lt;9, 0, 3, 2160, 3840, 1&gt;</second>
</first>
<second>153</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>img_width</originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>1886414848</coreId>
</Obj>
<bitwidth>16</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>14</item>
<item>15</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.40</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name>mrv</name>
<fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_colorthresholding.hpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>152</lineNumber>
<contextFuncName>colorthresholding&lt;9, 0, 3, 2160, 3840, 1&gt;</contextFuncName>
<contextNormFuncName>colorthresholding_9_0_3_2160_3840_1_s</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_colorthresholding.hpp</first>
<second>colorthresholding&lt;9, 0, 3, 2160, 3840, 1&gt;</second>
</first>
<second>152</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>113</coreId>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>17</item>
<item>18</item>
</oprand_edges>
<opcode>insertvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>mrv_1</name>
<fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_colorthresholding.hpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>152</lineNumber>
<contextFuncName>colorthresholding&lt;9, 0, 3, 2160, 3840, 1&gt;</contextFuncName>
<contextNormFuncName>colorthresholding_9_0_3_2160_3840_1_s</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_colorthresholding.hpp</first>
<second>colorthresholding&lt;9, 0, 3, 2160, 3840, 1&gt;</second>
</first>
<second>152</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>113</coreId>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>19</item>
<item>20</item>
</oprand_edges>
<opcode>insertvalue</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>_ln152</name>
<fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_colorthresholding.hpp</fileName>
<fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory>
<lineNumber>152</lineNumber>
<contextFuncName>colorthresholding&lt;9, 0, 3, 2160, 3840, 1&gt;</contextFuncName>
<contextNormFuncName>colorthresholding_9_0_3_2160_3840_1_s</contextNormFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/imgproc/xf_colorthresholding.hpp</first>
<second>colorthresholding&lt;9, 0, 3, 2160, 3840, 1&gt;</second>
</first>
<second>152</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>113</coreId>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_8">
<Value>
<Obj>
<type>2</type>
<id>16</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>49</coreId>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>5</const_type>
<content><undef></content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_9">
<Obj>
<type>3</type>
<id>10</id>
<name>colorthresholding<9, 0, 3, 2160, 3840, 1>_Block_colorthresholding<9, 0, 3, 2160, 3840, 1>_.exit_proc</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<contextNormFuncName></contextNormFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<control></control>
<opType></opType>
<implIndex></implIndex>
<coreName></coreName>
<coreId>1768189039</coreId>
</Obj>
<node_objs>
<count>5</count>
<item_version>0</item_version>
<item>5</item>
<item>6</item>
<item>7</item>
<item>8</item>
<item>9</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_10">
<id>13</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>5</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_11">
<id>15</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>6</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_12">
<id>17</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>7</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_13">
<id>18</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>7</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_14">
<id>19</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="20" object_id="_15">
<id>20</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>8</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_16">
<id>21</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_17">
<mId>1</mId>
<mTag>colorthresholding<9, 0, 3, 2160, 3840, 1>_Block_colorthresholding<9, 0, 3, 2160, 3840, 1>_.exit_proc</mTag>
<mNormTag>colorthresholding_9_0_3_2160_3840_1_Block_colorthresholding_9_0_3_2160_3840_1_exit_proc</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>10</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="-1"></fsm>
<res class_id="-1"></res>
<node_label_latency class_id="26" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>5</first>
<second class_id="28" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>6</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>7</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>8</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="29" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="0" version="0">
<first>10</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="32" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="34" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="35" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_reg_nodes>
<dp_regname_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="36" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core>
<count>0</count>
<item_version>0</item_version>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 31.908646 | 139 | 0.644018 |
2011420a8c1ac5b5d82d92822dd96ea5d4ca7a9a | 4,020 | ads | Ada | src/wiki-streams-text_io.ads | jquorning/ada-wiki | 21dcbeb3897499ee4b4a85353f8a782e154c0a43 | [
"Apache-2.0"
] | 18 | 2015-10-26T21:32:08.000Z | 2021-11-30T10:38:51.000Z | src/wiki-streams-text_io.ads | jquorning/ada-wiki | 21dcbeb3897499ee4b4a85353f8a782e154c0a43 | [
"Apache-2.0"
] | 2 | 2018-03-18T08:22:06.000Z | 2022-02-16T22:15:05.000Z | src/wiki-streams-text_io.ads | jquorning/ada-wiki | 21dcbeb3897499ee4b4a85353f8a782e154c0a43 | [
"Apache-2.0"
] | 2 | 2019-04-05T17:10:34.000Z | 2022-02-13T20:50:56.000Z | -----------------------------------------------------------------------
-- wiki-streams-text_io -- Text_IO input output streams
-- Copyright (C) 2016, 2020 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Wide_Wide_Text_IO;
with Ada.Finalization;
-- === Text_IO Input and Output streams ===
-- The `Wiki.Streams.Text_IO` package defines the `File_Input_Stream` and
-- the `File_Output_Stream` types which use the `Ada.Wide_Wide_Text_IO` package
-- to read or write the output streams.
--
-- By default the `File_Input_Stream` is configured to read the standard input.
-- The `Open` procedure can be used to read from a file knowing its name.
--
-- The `File_Output_Stream` is configured to write on the standard output.
-- The `Open` and `Create` procedure can be used to write on a file.
--
package Wiki.Streams.Text_IO is
type File_Input_Stream is limited new Ada.Finalization.Limited_Controlled
and Wiki.Streams.Input_Stream with private;
type File_Input_Stream_Access is access all File_Input_Stream'Class;
-- Open the file and prepare to read the input stream.
procedure Open (Stream : in out File_Input_Stream;
Path : in String;
Form : in String := "");
-- Read one character from the input stream and return False to the <tt>Eof</tt> indicator.
-- When there is no character to read, return True in the <tt>Eof</tt> indicator.
overriding
procedure Read (Input : in out File_Input_Stream;
Char : out Wiki.Strings.WChar;
Eof : out Boolean);
-- Close the file.
procedure Close (Stream : in out File_Input_Stream);
-- Close the stream.
overriding
procedure Finalize (Stream : in out File_Input_Stream);
type File_Output_Stream is limited new Ada.Finalization.Limited_Controlled
and Wiki.Streams.Output_Stream with private;
type File_Output_Stream_Access is access all File_Output_Stream'Class;
-- Open the file and prepare to write the output stream.
procedure Open (Stream : in out File_Output_Stream;
Path : in String;
Form : in String := "");
-- Create the file and prepare to write the output stream.
procedure Create (Stream : in out File_Output_Stream;
Path : in String;
Form : in String := "");
-- Close the file.
procedure Close (Stream : in out File_Output_Stream);
-- Write the string to the output stream.
overriding
procedure Write (Stream : in out File_Output_Stream;
Content : in Wiki.Strings.WString);
-- Write a single character to the output stream.
overriding
procedure Write (Stream : in out File_Output_Stream;
Char : in Wiki.Strings.WChar);
-- Close the stream.
overriding
procedure Finalize (Stream : in out File_Output_Stream);
private
type File_Input_Stream is limited new Ada.Finalization.Limited_Controlled
and Wiki.Streams.Input_Stream with record
File : Ada.Wide_Wide_Text_IO.File_Type;
end record;
type File_Output_Stream is limited new Ada.Finalization.Limited_Controlled
and Wiki.Streams.Output_Stream with record
File : Ada.Wide_Wide_Text_IO.File_Type;
Stdout : Boolean := True;
end record;
end Wiki.Streams.Text_IO;
| 39.411765 | 95 | 0.669154 |
23bf70c2811e7f9bc5c35d10235f4c3fcc9874c6 | 1,648 | adb | Ada | tests/tk-toplevel-toplevel_options_test_data.adb | thindil/tashy2 | 43fcbadb33c0062b2c8d6138a8238441dec5fd80 | [
"Apache-2.0"
] | 2 | 2020-12-09T07:27:07.000Z | 2021-10-19T13:31:54.000Z | tests/tk-toplevel-toplevel_options_test_data.adb | thindil/tashy2 | 43fcbadb33c0062b2c8d6138a8238441dec5fd80 | [
"Apache-2.0"
] | null | null | null | tests/tk-toplevel-toplevel_options_test_data.adb | thindil/tashy2 | 43fcbadb33c0062b2c8d6138a8238441dec5fd80 | [
"Apache-2.0"
] | null | null | null | -- This package is intended to set up and tear down the test environment.
-- Once created by GNATtest, this package will never be overwritten
-- automatically. Contents of this package can be modified in any way
-- except for sections surrounded by a 'read only' marker.
with Ada.Environment_Variables; use Ada.Environment_Variables;
package body Tk.TopLevel.TopLevel_Options_Test_Data is
Local_TopLevel_Options: aliased GNATtest_Generated.GNATtest_Standard.Tk
.TopLevel
.TopLevel_Options;
procedure Set_Up(Gnattest_T: in out Test_TopLevel_Options) is
begin
GNATtest_Generated.GNATtest_Standard.Tk.Widget.Widget_Options_Test_Data
.Widget_Options_Tests
.Set_Up
(GNATtest_Generated.GNATtest_Standard.Tk.Widget
.Widget_Options_Test_Data
.Widget_Options_Tests
.Test_Widget_Options
(Gnattest_T));
Gnattest_T.Fixture := Local_TopLevel_Options'Access;
end Set_Up;
procedure Tear_Down(Gnattest_T: in out Test_TopLevel_Options) is
TopLevel: Tk_Toplevel;
begin
GNATtest_Generated.GNATtest_Standard.Tk.Widget.Widget_Options_Test_Data
.Widget_Options_Tests
.Tear_Down
(GNATtest_Generated.GNATtest_Standard.Tk.Widget
.Widget_Options_Test_Data
.Widget_Options_Tests
.Test_Widget_Options
(Gnattest_T));
if Value("DISPLAY", "")'Length = 0 then
return;
end if;
TopLevel := Get_Widget(".mydialog");
if TopLevel /= Null_Widget then
Destroy(TopLevel);
end if;
end Tear_Down;
end Tk.TopLevel.TopLevel_Options_Test_Data;
| 35.06383 | 77 | 0.712985 |
10c5306b9a9e6ed83e7bd35280432f21ca16c5db | 752 | ads | Ada | tests/nonsmoke/functional/CompileTests/experimental_ada_tests/unit_2.ads | ucd-plse/rose | 17db6454e8baba0014e30a8ec23df1a11ac55a0c | [
"BSD-3-Clause"
] | 488 | 2015-01-09T08:54:48.000Z | 2022-03-30T07:15:46.000Z | tests/nonsmoke/functional/CompileTests/experimental_ada_tests/unit_2.ads | ucd-plse/rose | 17db6454e8baba0014e30a8ec23df1a11ac55a0c | [
"BSD-3-Clause"
] | 174 | 2015-01-28T18:41:32.000Z | 2022-03-31T16:51:05.000Z | tests/nonsmoke/functional/CompileTests/experimental_ada_tests/tests/unit_2.ads | passlab/rexompiler | 5494df3766ab606e230c5f1785b438a019c9e353 | [
"BSD-3-Clause"
] | 146 | 2015-04-27T02:48:34.000Z | 2022-03-04T07:32:53.000Z | with Ada.Strings.Unbounded;
package Unit_2 is
type Range_Type is new Integer range 1 .. 10;
procedure Do_It (This : in Range_Type);
Dont_Like_5 : Exception;
private
package Parent_Class is
type Object is abstract tagged record
Component_1 : Integer := 2;
end record;
procedure Method_1
(This : in out Object);
end Parent_Class;
package Child_Class is
type Object is new Parent_Class.Object with record
Component_2 : Integer := 10;
end record;
overriding
procedure Method_1
(This : in out Object);
function Method_2
(This : in out Object;
Param_1 : in Integer)
return Integer;
end Child_Class;
end Unit_2;
| 17.904762 | 56 | 0.630319 |
fba591d2200e6dd0a711a06f6243199b13d398c5 | 3,148 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-stobbu.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-stobbu.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-stobbu.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- ADA.STRINGS.TEXT_OUTPUT.BIT_BUCKETS --
-- --
-- B o d y --
-- --
-- Copyright (C) 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. --
-- --
------------------------------------------------------------------------------
package body Ada.Strings.Text_Output.Bit_Buckets is
type Bit_Bucket_Type is new Sink with null record;
overriding procedure Full_Method (S : in out Bit_Bucket_Type);
overriding procedure Flush_Method (S : in out Bit_Bucket_Type);
The_Bit_Bucket : aliased Bit_Bucket_Type
(Chunk_Length => Default_Chunk_Length);
function Bit_Bucket return Sink_Access is (The_Bit_Bucket'Access);
overriding procedure Full_Method (S : in out Bit_Bucket_Type)
renames Flush_Method;
overriding procedure Flush_Method (S : in out Bit_Bucket_Type) is
begin
S.Last := 0;
end Flush_Method;
begin
The_Bit_Bucket.Indent_Amount := 0;
The_Bit_Bucket.Cur_Chunk := The_Bit_Bucket.Initial_Chunk'Access;
end Ada.Strings.Text_Output.Bit_Buckets;
| 58.296296 | 78 | 0.466328 |
c50ac18c7436cf9ec2887ed41732350344c8ba7b | 509 | ads | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/specs/noinline1.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/specs/noinline1.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/specs/noinline1.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- { dg-do compile }
package Noinline1 is
procedure Proc1;
pragma Inline (Proc1);
pragma No_Inline (Proc1); -- { dg-warning "both specified" }
procedure Proc2;
pragma No_Inline (Proc2);
pragma Inline (Proc2); -- { dg-warning "both specified" }
procedure Proc3;
pragma Inline_Always (Proc3);
pragma No_Inline (Proc3); -- { dg-error "mutually exclusive" }
procedure Proc4;
pragma No_Inline (Proc4);
pragma Inline_Always (Proc4); -- { dg-error "mutually exclusive" }
end Noinline1;
| 23.136364 | 68 | 0.689587 |
fb35374515b495b3f30f485a5553930048ecc4d8 | 606 | ads | Ada | src/finalization/my_class.ads | shintakezou/adaplayground | be5f8a096fe59439f7e444298dab4cf9820f8a03 | [
"MIT"
] | null | null | null | src/finalization/my_class.ads | shintakezou/adaplayground | be5f8a096fe59439f7e444298dab4cf9820f8a03 | [
"MIT"
] | null | null | null | src/finalization/my_class.ads | shintakezou/adaplayground | be5f8a096fe59439f7e444298dab4cf9820f8a03 | [
"MIT"
] | null | null | null | with Ada.Finalization;
with Interfaces; use Interfaces;
package My_Class is
type Object is
new Ada.Finalization.Limited_Controlled with private;
overriding
procedure Initialize (O : in out Object);
overriding
procedure Finalize (O : in out Object);
procedure Write (O : in Object);
-- write the object?
private
type Buffer is array (Positive range <>) of Unsigned_32;
type Buffer_Ptr is access Buffer;
type Object is
new Ada.Finalization.Limited_Controlled
with record
A : Buffer_Ptr;
end record;
end My_Class;
| 20.896552 | 59 | 0.669967 |
1c732ce139835bc69ccdc636b30f2d8e1c24772f | 17,393 | adb | Ada | llvm-gcc-4.2-2.9/gcc/ada/expander.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/expander.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/expander.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- E X P A N D E R --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2006, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Atree; use Atree;
with Debug_A; use Debug_A;
with Errout; use Errout;
with Exp_Aggr; use Exp_Aggr;
with Exp_Attr; use Exp_Attr;
with Exp_Ch2; use Exp_Ch2;
with Exp_Ch3; use Exp_Ch3;
with Exp_Ch4; use Exp_Ch4;
with Exp_Ch5; use Exp_Ch5;
with Exp_Ch6; use Exp_Ch6;
with Exp_Ch7; use Exp_Ch7;
with Exp_Ch8; use Exp_Ch8;
with Exp_Ch9; use Exp_Ch9;
with Exp_Ch11; use Exp_Ch11;
with Exp_Ch12; use Exp_Ch12;
with Exp_Ch13; use Exp_Ch13;
with Exp_Prag; use Exp_Prag;
with Opt; use Opt;
with Rtsfind; use Rtsfind;
with Sem; use Sem;
with Sem_Ch8; use Sem_Ch8;
with Sem_Util; use Sem_Util;
with Sinfo; use Sinfo;
with Table;
package body Expander is
----------------
-- Local Data --
----------------
-- The following table is used to save values of the Expander_Active
-- flag when they are saved by Expander_Mode_Save_And_Set. We use an
-- extendible table (which is a bit of overkill) because it is easier
-- than figuring out a maximum value or bothering with range checks!
package Expander_Flags is new Table.Table (
Table_Component_Type => Boolean,
Table_Index_Type => Int,
Table_Low_Bound => 0,
Table_Initial => 32,
Table_Increment => 200,
Table_Name => "Expander_Flags");
------------
-- Expand --
------------
procedure Expand (N : Node_Id) is
begin
-- If we were analyzing a default expression the Full_Analysis flag
-- must be off. If we are in expansion mode then we must be
-- performing a full analysis. If we are analyzing a generic then
-- Expansion must be off.
pragma Assert
(not (Full_Analysis and then In_Default_Expression)
and then (Full_Analysis or else not Expander_Active)
and then not (Inside_A_Generic and then Expander_Active));
-- There are three reasons for the Expander_Active flag to be false.
--
-- The first is when are not generating code. In this mode the
-- Full_Analysis flag indicates whether we are performing a complete
-- analysis, in which case Full_Analysis = True or a pre-analysis in
-- which case Full_Analysis = False. See the spec of Sem for more
-- info on this.
--
-- The second reason for the Expander_Active flag to be False is that
-- we are performing a pre-analysis. During pre-analysis all
-- expansion activity is turned off to make sure nodes are
-- semantically decorated but no extra nodes are generated. This is
-- for instance needed for the first pass of aggregate semantic
-- processing. Note that in this case the Full_Analysis flag is set
-- to False because the node will subsequently be re-analyzed with
-- expansion on (see the spec of sem).
-- Finally, expansion is turned off in a regular compilation if there
-- are serious errors. In that case there will be no further expansion,
-- but one cleanup action may be required: if a transient scope was
-- created (e.g. for a function that returns an unconstrained type)
-- the scope may still be on the stack, and must be removed explicitly,
-- given that the expansion actions that would normally process it will
-- not take place. This prevents cascaded errors due to stack mismatch.
if not Expander_Active then
Set_Analyzed (N, Full_Analysis);
if Serious_Errors_Detected > 0
and then Scope_Is_Transient
then
Scope_Stack.Table
(Scope_Stack.Last).Actions_To_Be_Wrapped_Before := No_List;
Scope_Stack.Table
(Scope_Stack.Last).Actions_To_Be_Wrapped_After := No_List;
Pop_Scope;
end if;
return;
else
Debug_A_Entry ("expanding ", N);
-- Processing depends on node kind. For full details on the expansion
-- activity required in each case, see bodies of corresponding
-- expand routines
begin
case Nkind (N) is
when N_Abort_Statement =>
Expand_N_Abort_Statement (N);
when N_Accept_Statement =>
Expand_N_Accept_Statement (N);
when N_Aggregate =>
Expand_N_Aggregate (N);
when N_Allocator =>
Expand_N_Allocator (N);
when N_And_Then =>
Expand_N_And_Then (N);
when N_Assignment_Statement =>
Expand_N_Assignment_Statement (N);
when N_Asynchronous_Select =>
Expand_N_Asynchronous_Select (N);
when N_Attribute_Definition_Clause =>
Expand_N_Attribute_Definition_Clause (N);
when N_Attribute_Reference =>
Expand_N_Attribute_Reference (N);
when N_Block_Statement =>
Expand_N_Block_Statement (N);
when N_Case_Statement =>
Expand_N_Case_Statement (N);
when N_Conditional_Entry_Call =>
Expand_N_Conditional_Entry_Call (N);
when N_Conditional_Expression =>
Expand_N_Conditional_Expression (N);
when N_Delay_Relative_Statement =>
Expand_N_Delay_Relative_Statement (N);
when N_Delay_Until_Statement =>
Expand_N_Delay_Until_Statement (N);
when N_Entry_Body =>
Expand_N_Entry_Body (N);
when N_Entry_Call_Statement =>
Expand_N_Entry_Call_Statement (N);
when N_Entry_Declaration =>
Expand_N_Entry_Declaration (N);
when N_Exception_Declaration =>
Expand_N_Exception_Declaration (N);
when N_Exception_Renaming_Declaration =>
Expand_N_Exception_Renaming_Declaration (N);
when N_Exit_Statement =>
Expand_N_Exit_Statement (N);
when N_Expanded_Name =>
Expand_N_Expanded_Name (N);
when N_Explicit_Dereference =>
Expand_N_Explicit_Dereference (N);
when N_Extension_Aggregate =>
Expand_N_Extension_Aggregate (N);
when N_Freeze_Entity =>
Expand_N_Freeze_Entity (N);
when N_Full_Type_Declaration =>
Expand_N_Full_Type_Declaration (N);
when N_Function_Call =>
Expand_N_Function_Call (N);
when N_Generic_Instantiation =>
Expand_N_Generic_Instantiation (N);
when N_Goto_Statement =>
Expand_N_Goto_Statement (N);
when N_Handled_Sequence_Of_Statements =>
Expand_N_Handled_Sequence_Of_Statements (N);
when N_Identifier =>
Expand_N_Identifier (N);
when N_Indexed_Component =>
Expand_N_Indexed_Component (N);
when N_If_Statement =>
Expand_N_If_Statement (N);
when N_In =>
Expand_N_In (N);
when N_Loop_Statement =>
Expand_N_Loop_Statement (N);
when N_Not_In =>
Expand_N_Not_In (N);
when N_Null =>
Expand_N_Null (N);
when N_Object_Declaration =>
Expand_N_Object_Declaration (N);
when N_Object_Renaming_Declaration =>
Expand_N_Object_Renaming_Declaration (N);
when N_Op_Add =>
Expand_N_Op_Add (N);
when N_Op_Abs =>
Expand_N_Op_Abs (N);
when N_Op_And =>
Expand_N_Op_And (N);
when N_Op_Concat =>
Expand_N_Op_Concat (N);
when N_Op_Divide =>
Expand_N_Op_Divide (N);
when N_Op_Eq =>
Expand_N_Op_Eq (N);
when N_Op_Expon =>
Expand_N_Op_Expon (N);
when N_Op_Ge =>
Expand_N_Op_Ge (N);
when N_Op_Gt =>
Expand_N_Op_Gt (N);
when N_Op_Le =>
Expand_N_Op_Le (N);
when N_Op_Lt =>
Expand_N_Op_Lt (N);
when N_Op_Minus =>
Expand_N_Op_Minus (N);
when N_Op_Mod =>
Expand_N_Op_Mod (N);
when N_Op_Multiply =>
Expand_N_Op_Multiply (N);
when N_Op_Ne =>
Expand_N_Op_Ne (N);
when N_Op_Not =>
Expand_N_Op_Not (N);
when N_Op_Or =>
Expand_N_Op_Or (N);
when N_Op_Plus =>
Expand_N_Op_Plus (N);
when N_Op_Rem =>
Expand_N_Op_Rem (N);
when N_Op_Rotate_Left =>
Expand_N_Op_Rotate_Left (N);
when N_Op_Rotate_Right =>
Expand_N_Op_Rotate_Right (N);
when N_Op_Shift_Left =>
Expand_N_Op_Shift_Left (N);
when N_Op_Shift_Right =>
Expand_N_Op_Shift_Right (N);
when N_Op_Shift_Right_Arithmetic =>
Expand_N_Op_Shift_Right_Arithmetic (N);
when N_Op_Subtract =>
Expand_N_Op_Subtract (N);
when N_Op_Xor =>
Expand_N_Op_Xor (N);
when N_Or_Else =>
Expand_N_Or_Else (N);
when N_Package_Body =>
Expand_N_Package_Body (N);
when N_Package_Declaration =>
Expand_N_Package_Declaration (N);
when N_Package_Renaming_Declaration =>
Expand_N_Package_Renaming_Declaration (N);
when N_Pragma =>
Expand_N_Pragma (N);
when N_Procedure_Call_Statement =>
Expand_N_Procedure_Call_Statement (N);
when N_Protected_Type_Declaration =>
Expand_N_Protected_Type_Declaration (N);
when N_Protected_Body =>
Expand_N_Protected_Body (N);
when N_Qualified_Expression =>
Expand_N_Qualified_Expression (N);
when N_Raise_Statement =>
Expand_N_Raise_Statement (N);
when N_Raise_Constraint_Error =>
Expand_N_Raise_Constraint_Error (N);
when N_Raise_Program_Error =>
Expand_N_Raise_Program_Error (N);
when N_Raise_Storage_Error =>
Expand_N_Raise_Storage_Error (N);
when N_Real_Literal =>
Expand_N_Real_Literal (N);
when N_Record_Representation_Clause =>
Expand_N_Record_Representation_Clause (N);
when N_Requeue_Statement =>
Expand_N_Requeue_Statement (N);
when N_Return_Statement =>
Expand_N_Return_Statement (N);
when N_Selected_Component =>
Expand_N_Selected_Component (N);
when N_Selective_Accept =>
Expand_N_Selective_Accept (N);
when N_Single_Task_Declaration =>
Expand_N_Single_Task_Declaration (N);
when N_Slice =>
Expand_N_Slice (N);
when N_Subtype_Indication =>
Expand_N_Subtype_Indication (N);
when N_Subprogram_Body =>
Expand_N_Subprogram_Body (N);
when N_Subprogram_Body_Stub =>
Expand_N_Subprogram_Body_Stub (N);
when N_Subprogram_Declaration =>
Expand_N_Subprogram_Declaration (N);
when N_Subprogram_Info =>
Expand_N_Subprogram_Info (N);
when N_Task_Body =>
Expand_N_Task_Body (N);
when N_Task_Type_Declaration =>
Expand_N_Task_Type_Declaration (N);
when N_Timed_Entry_Call =>
Expand_N_Timed_Entry_Call (N);
when N_Type_Conversion =>
Expand_N_Type_Conversion (N);
when N_Unchecked_Expression =>
Expand_N_Unchecked_Expression (N);
when N_Unchecked_Type_Conversion =>
Expand_N_Unchecked_Type_Conversion (N);
when N_Variant_Part =>
Expand_N_Variant_Part (N);
-- For all other node kinds, no expansion activity is required
when others => null;
end case;
exception
when RE_Not_Available =>
return;
end;
-- Set result as analyzed and then do a possible transient wrap. The
-- transient wrap must be done after the Analyzed flag is set on, so
-- that we do not get a recursive attempt to expand the node N.
Set_Analyzed (N);
-- Deal with transient scopes
if Scope_Is_Transient and then N = Node_To_Be_Wrapped then
case Nkind (N) is
when N_Statement_Other_Than_Procedure_Call |
N_Procedure_Call_Statement =>
Wrap_Transient_Statement (N);
when N_Object_Declaration |
N_Object_Renaming_Declaration |
N_Subtype_Declaration =>
Wrap_Transient_Declaration (N);
when others => Wrap_Transient_Expression (N);
end case;
end if;
Debug_A_Exit ("expanding ", N, " (done)");
end if;
end Expand;
---------------------------
-- Expander_Mode_Restore --
---------------------------
procedure Expander_Mode_Restore is
begin
-- Not active (has no effect) in ASIS mode (see comments in spec of
-- Expander_Mode_Save_And_Set).
if ASIS_Mode then
return;
end if;
-- Otherwise restore the flag
Expander_Active := Expander_Flags.Table (Expander_Flags.Last);
Expander_Flags.Decrement_Last;
-- Keep expander off if serious errors detected. In this case we do
-- not need expansion, and continued expansion may cause cascaded
-- errors or compiler bombs.
if Serious_Errors_Detected /= 0 then
Expander_Active := False;
end if;
end Expander_Mode_Restore;
--------------------------------
-- Expander_Mode_Save_And_Set --
--------------------------------
procedure Expander_Mode_Save_And_Set (Status : Boolean) is
begin
-- Not active (has no effect) in ASIS mode (see comments in spec of
-- Expander_Mode_Save_And_Set).
if ASIS_Mode then
return;
end if;
-- Otherwise save and set the flag
Expander_Flags.Increment_Last;
Expander_Flags.Table (Expander_Flags.Last) := Expander_Active;
Expander_Active := Status;
end Expander_Mode_Save_And_Set;
end Expander;
| 33.448077 | 79 | 0.535215 |
fb7f116bba29d095393a16cf246a986c70008aca | 12,459 | ads | Ada | arch/ARM/STM32/svd/stm32wb55x/stm32_svd-gpio.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2018-05-16T03:56:39.000Z | 2019-07-31T13:53:56.000Z | arch/ARM/STM32/svd/stm32wb55x/stm32_svd-gpio.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | arch/ARM/STM32/svd/stm32wb55x/stm32_svd-gpio.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | -- This spec has been automatically generated from STM32WB55x.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.GPIO is
pragma Preelaborate;
---------------
-- Registers --
---------------
-- MODER_MODE array element
subtype MODER_MODE_Element is HAL.UInt2;
-- MODER_MODE array
type MODER_MODE_Field_Array is array (0 .. 15) of MODER_MODE_Element
with Component_Size => 2, Size => 32;
type MODER_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- MODE as a value
Val : HAL.UInt32;
when True =>
-- MODE as an array
Arr : MODER_MODE_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access,
Bit_Order => System.Low_Order_First;
for MODER_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- OTYPER_OT array
type OTYPER_OT_Field_Array is array (0 .. 15) of Boolean
with Component_Size => 1, Size => 16;
-- Type definition for OTYPER_OT
type OTYPER_OT_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- OT as a value
Val : HAL.UInt16;
when True =>
-- OT as an array
Arr : OTYPER_OT_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for OTYPER_OT_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
type OTYPER_Register is record
OT : OTYPER_OT_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OTYPER_Register use record
OT at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- OSPEEDR_OSPEED array element
subtype OSPEEDR_OSPEED_Element is HAL.UInt2;
-- OSPEEDR_OSPEED array
type OSPEEDR_OSPEED_Field_Array is array (0 .. 15)
of OSPEEDR_OSPEED_Element
with Component_Size => 2, Size => 32;
type OSPEEDR_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- OSPEED as a value
Val : HAL.UInt32;
when True =>
-- OSPEED as an array
Arr : OSPEEDR_OSPEED_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access,
Bit_Order => System.Low_Order_First;
for OSPEEDR_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- PUPDR_PUPD array element
subtype PUPDR_PUPD_Element is HAL.UInt2;
-- PUPDR_PUPD array
type PUPDR_PUPD_Field_Array is array (0 .. 15) of PUPDR_PUPD_Element
with Component_Size => 2, Size => 32;
type PUPDR_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- PUPD as a value
Val : HAL.UInt32;
when True =>
-- PUPD as an array
Arr : PUPDR_PUPD_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access,
Bit_Order => System.Low_Order_First;
for PUPDR_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- IDR_ID array
type IDR_ID_Field_Array is array (0 .. 15) of Boolean
with Component_Size => 1, Size => 16;
-- Type definition for IDR_ID
type IDR_ID_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- ID as a value
Val : HAL.UInt16;
when True =>
-- ID as an array
Arr : IDR_ID_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for IDR_ID_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
type IDR_Register is record
ID : IDR_ID_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IDR_Register use record
ID at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- ODR_OD array
type ODR_OD_Field_Array is array (0 .. 15) of Boolean
with Component_Size => 1, Size => 16;
-- Type definition for ODR_OD
type ODR_OD_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- OD as a value
Val : HAL.UInt16;
when True =>
-- OD as an array
Arr : ODR_OD_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for ODR_OD_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
type ODR_Register is record
OD : ODR_OD_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ODR_Register use record
OD at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- BSRR_BS array
type BSRR_BS_Field_Array is array (0 .. 15) of Boolean
with Component_Size => 1, Size => 16;
-- Type definition for BSRR_BS
type BSRR_BS_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- BS as a value
Val : HAL.UInt16;
when True =>
-- BS as an array
Arr : BSRR_BS_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for BSRR_BS_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- BSRR_BR array
type BSRR_BR_Field_Array is array (0 .. 15) of Boolean
with Component_Size => 1, Size => 16;
-- Type definition for BSRR_BR
type BSRR_BR_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- BR as a value
Val : HAL.UInt16;
when True =>
-- BR as an array
Arr : BSRR_BR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for BSRR_BR_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
type BSRR_Register is record
BS : BSRR_BS_Field := (As_Array => False, Val => 16#0#);
BR : BSRR_BR_Field := (As_Array => False, Val => 16#0#);
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BSRR_Register use record
BS at 0 range 0 .. 15;
BR at 0 range 16 .. 31;
end record;
-- LCKR_LCK array
type LCKR_LCK_Field_Array is array (0 .. 15) of Boolean
with Component_Size => 1, Size => 16;
-- Type definition for LCKR_LCK
type LCKR_LCK_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- LCK as a value
Val : HAL.UInt16;
when True =>
-- LCK as an array
Arr : LCKR_LCK_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for LCKR_LCK_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
type LCKR_Register is record
LCK : LCKR_LCK_Field := (As_Array => False, Val => 16#0#);
LCKK : Boolean := False;
-- unspecified
Reserved_17_31 : HAL.UInt15 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for LCKR_Register use record
LCK at 0 range 0 .. 15;
LCKK at 0 range 16 .. 16;
Reserved_17_31 at 0 range 17 .. 31;
end record;
-- AFRL_AFSEL array element
subtype AFRL_AFSEL_Element is HAL.UInt4;
-- AFRL_AFSEL array
type AFRL_AFSEL_Field_Array is array (0 .. 7) of AFRL_AFSEL_Element
with Component_Size => 4, Size => 32;
type AFRL_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- AFSEL as a value
Val : HAL.UInt32;
when True =>
-- AFSEL as an array
Arr : AFRL_AFSEL_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access,
Bit_Order => System.Low_Order_First;
for AFRL_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- AFRH_AFSEL array element
subtype AFRH_AFSEL_Element is HAL.UInt4;
-- AFRH_AFSEL array
type AFRH_AFSEL_Field_Array is array (8 .. 15) of AFRH_AFSEL_Element
with Component_Size => 4, Size => 32;
type AFRH_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- AFSEL as a value
Val : HAL.UInt32;
when True =>
-- AFSEL as an array
Arr : AFRH_AFSEL_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access,
Bit_Order => System.Low_Order_First;
for AFRH_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- BRR_BR array
type BRR_BR_Field_Array is array (0 .. 15) of Boolean
with Component_Size => 1, Size => 16;
-- Type definition for BRR_BR
type BRR_BR_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- BR as a value
Val : HAL.UInt16;
when True =>
-- BR as an array
Arr : BRR_BR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for BRR_BR_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
type BRR_Register is record
BR : BRR_BR_Field := (As_Array => False, Val => 16#0#);
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BRR_Register use record
BR at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
type GPIO_Peripheral is record
MODER : aliased MODER_Register;
OTYPER : aliased OTYPER_Register;
OSPEEDR : aliased OSPEEDR_Register;
PUPDR : aliased PUPDR_Register;
IDR : aliased IDR_Register;
ODR : aliased ODR_Register;
BSRR : aliased BSRR_Register;
LCKR : aliased LCKR_Register;
AFRL : aliased AFRL_Register;
AFRH : aliased AFRH_Register;
BRR : aliased BRR_Register;
end record
with Volatile;
for GPIO_Peripheral use record
MODER at 16#0# range 0 .. 31;
OTYPER at 16#4# range 0 .. 31;
OSPEEDR at 16#8# range 0 .. 31;
PUPDR at 16#C# range 0 .. 31;
IDR at 16#10# range 0 .. 31;
ODR at 16#14# range 0 .. 31;
BSRR at 16#18# range 0 .. 31;
LCKR at 16#1C# range 0 .. 31;
AFRL at 16#20# range 0 .. 31;
AFRH at 16#24# range 0 .. 31;
BRR at 16#28# range 0 .. 31;
end record;
GPIOA_Periph : aliased GPIO_Peripheral
with Import, Address => System'To_Address (16#48000000#);
GPIOB_Periph : aliased GPIO_Peripheral
with Import, Address => System'To_Address (16#48000400#);
GPIOC_Periph : aliased GPIO_Peripheral
with Import, Address => System'To_Address (16#48000800#);
GPIOD_Periph : aliased GPIO_Peripheral
with Import, Address => System'To_Address (16#48000C00#);
GPIOE_Periph : aliased GPIO_Peripheral
with Import, Address => System'To_Address (16#48001000#);
GPIOH_Periph : aliased GPIO_Peripheral
with Import, Address => System'To_Address (16#48001C00#);
end STM32_SVD.GPIO;
| 27.564159 | 76 | 0.586082 |
df8586670c8cdd582da60fe87088d1c296dcc70c | 4,678 | ads | Ada | tools/scitools/conf/understand/ada/ada05/s-bitops.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | 1 | 2020-01-20T21:26:46.000Z | 2020-01-20T21:26:46.000Z | tools/scitools/conf/understand/ada/ada05/s-bitops.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada05/s-bitops.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . B I T _ O P S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2005, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
--
--
--
--
--
--
--
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Operations on packed bit strings
with System;
package System.Bit_Ops is
-- Note: in all the following routines, the System.Address parameters
-- represent the address of the first byte of an array used to represent
-- a packed array (of type System.Unsigned_Types.Packed_Bytes{1,2,4})
-- The length in bits is passed as a separate parameter. Note that all
-- addresses must be of byte aligned arrays.
procedure Bit_And
(Left : System.Address;
Llen : Natural;
Right : System.Address;
Rlen : Natural;
Result : System.Address);
-- Bitwise "and" of given bit string with result being placed in Result.
-- The and operation is allowed to destroy unused bits in the last byte,
-- i.e. to leave them set in an undefined manner. Note that Left, Right
-- and Result always have the same length in bits (Len).
function Bit_Eq
(Left : System.Address;
Llen : Natural;
Right : System.Address;
Rlen : Natural) return Boolean;
-- Left and Right are the addresses of two bit packed arrays with Llen
-- and Rlen being the respective length in bits. The routine compares the
-- two bit strings for equality, being careful not to include the unused
-- bits in the final byte. Note that the result is always False if Rlen
-- is not equal to Llen.
procedure Bit_Not
(Opnd : System.Address;
Len : Natural;
Result : System.Address);
-- Bitwise "not" of given bit string with result being placed in Result.
-- The not operation is allowed to destroy unused bits in the last byte,
-- i.e. to leave them set in an undefined manner. Note that Result and
-- Opnd always have the same length in bits (Len).
procedure Bit_Or
(Left : System.Address;
Llen : Natural;
Right : System.Address;
Rlen : Natural;
Result : System.Address);
-- Bitwise "or" of given bit string with result being placed in Result.
-- The or operation is allowed to destroy unused bits in the last byte,
-- i.e. to leave them set in an undefined manner. Note that Left, Right
-- and Result always have the same length in bits (Len).
procedure Bit_Xor
(Left : System.Address;
Llen : Natural;
Right : System.Address;
Rlen : Natural;
Result : System.Address);
-- Bitwise "xor" of given bit string with result being placed in Result.
-- The xor operation is allowed to destroy unused bits in the last byte,
-- i.e. to leave them set in an undefined manner. Note that Left, Right
-- and Result always have the same length in bits (Len).
end System.Bit_Ops;
| 46.78 | 78 | 0.541257 |
dfb74b90258cad6f6d13d7fddc1a344ef0f46e0b | 3,632 | ads | Ada | source/amf/uml/amf-uml-connectable_elements-hash.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-uml-connectable_elements-hash.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-uml-connectable_elements-hash.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements.Generic_Hash;
function AMF.UML.Connectable_Elements.Hash is
new AMF.Elements.Generic_Hash (UML_Connectable_Element, UML_Connectable_Element_Access);
| 72.64 | 90 | 0.405837 |
df877cfb3b78295eba8654df2e9ba840ce1bfd7f | 6,894 | ads | Ada | awa/src/awa-events-services.ads | fuzzysloth/ada-awa | f9b921eeea29841667a028f2fc4528e4385d247a | [
"Apache-2.0"
] | null | null | null | awa/src/awa-events-services.ads | fuzzysloth/ada-awa | f9b921eeea29841667a028f2fc4528e4385d247a | [
"Apache-2.0"
] | null | null | null | awa/src/awa-events-services.ads | fuzzysloth/ada-awa | f9b921eeea29841667a028f2fc4528e4385d247a | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- awa-events-services -- AWA Event Manager
-- Copyright (C) 2012, 2016 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Finalization;
with Ada.Containers.Doubly_Linked_Lists;
with Util.Strings;
with EL.Expressions;
with EL.Beans;
with AWA.Events.Models;
with AWA.Events.Queues;
with AWA.Events.Queues.Maps;
with AWA.Events.Dispatchers;
limited with AWA.Applications;
package AWA.Events.Services is
-- ------------------------------
-- Event manager
-- ------------------------------
-- The <b>Event_Manager</b> manages the dispatch of event to the right event queue
-- or to the event action. The event manager holds a list of actions that must be
-- triggered for a particular event/queue pair. Such list is created and initialized
-- when the application is configured. It never changes.
type Event_Manager is tagged limited private;
type Event_Manager_Access is access all Event_Manager'Class;
-- Find the event queue identified by the given name.
function Find_Queue (Manager : in Event_Manager;
Name : in String) return AWA.Events.Queues.Queue_Ref;
-- Add the event queue in the registry.
procedure Add_Queue (Manager : in out Event_Manager;
Queue : in AWA.Events.Queues.Queue_Ref);
-- Send the event to the modules that subscribed to it.
-- The event is sent on each event queue. Event queues will dispatch the event
-- by invoking immediately or later on the <b>Dispatch</b> operation. The synchronous
-- or asynchronous reception of the event depends on the event queue.
procedure Send (Manager : in Event_Manager;
Event : in Module_Event'Class);
-- Set the event message type which correspond to the <tt>Kind</tt> event index.
procedure Set_Message_Type (Manager : in Event_Manager;
Event : in out AWA.Events.Models.Message_Ref;
Kind : in Event_Index);
-- Set the event queue associated with the event message. The event queue identified by
-- <tt>Name</tt> is searched to find the <tt>Queue_Ref</tt> instance.
procedure Set_Event_Queue (Manager : in Event_Manager;
Event : in out AWA.Events.Models.Message_Ref;
Name : in String);
-- Dispatch the event identified by <b>Event</b> and associated with the event
-- queue <b>Queue</b>. The event actions which are associated with the event are
-- executed synchronously.
procedure Dispatch (Manager : in Event_Manager;
Queue : in AWA.Events.Queues.Queue_Ref;
Event : in Module_Event'Class);
-- Add an action invoked when the event identified by <b>Event</b> is sent.
-- The event is posted on the queue identified by <b>Queue</b>.
-- When the event queue dispatches the event, the Ada bean identified by the method action
-- represented by <b>Action</b> is created and initialized by evaluating and setting the
-- parameters defined in <b>Params</b>. The action method is then invoked.
procedure Add_Action (Manager : in out Event_Manager;
Event : in String;
Queue : in AWA.Events.Queues.Queue_Ref;
Action : in EL.Expressions.Method_Expression;
Params : in EL.Beans.Param_Vectors.Vector);
-- Add a dispatcher to process the event queues matching the <b>Match</b> string.
-- The dispatcher can create up to <b>Count</b> tasks running at the priority <b>Priority</b>.
procedure Add_Dispatcher (Manager : in out Event_Manager;
Match : in String;
Count : in Positive;
Priority : in Positive);
type Application_Access is access all AWA.Applications.Application'Class;
-- Initialize the event manager.
procedure Initialize (Manager : in out Event_Manager;
App : in Application_Access);
-- Start the event manager. The dispatchers are configured to dispatch the event queues
-- and tasks are started to process asynchronous events.
procedure Start (Manager : in out Event_Manager);
-- Stop the event manager.
procedure Stop (Manager : in out Event_Manager);
-- Get the application associated with the event manager.
function Get_Application (Manager : in Event_Manager) return Application_Access;
private
use AWA.Events.Queues;
-- An event queue associated with a dispatcher.
type Queue_Dispatcher is record
Queue : AWA.Events.Queues.Queue_Ref;
Dispatcher : AWA.Events.Dispatchers.Dispatcher_Access := null;
Model : AWA.Events.Models.Queue_Ref;
end record;
-- Finalize the queue dispatcher releasing the dispatcher memory.
procedure Finalize (Object : in out Queue_Dispatcher);
-- A list of event queue dispatcher.
package Queue_Dispatcher_Lists is
new Ada.Containers.Doubly_Linked_Lists (Element_Type => Queue_Dispatcher);
-- A list of event queues for a given event.
type Event_Queues is record
Queues : Queue_Dispatcher_Lists.List;
Name : Util.Strings.Name_Access;
Event : AWA.Events.Models.Message_Type_Ref;
end record;
-- Finalize the event queues and the dispatchers.
procedure Finalize (Object : in out Event_Queues);
-- An array of event queue actions.
type Event_Queues_Array is array (Event_Index range <>) of Event_Queues;
type Event_Queues_Array_Access is access all Event_Queues_Array;
type Event_Manager is new Ada.Finalization.Limited_Controlled with record
Actions : Event_Queues_Array_Access := null;
Queues : AWA.Events.Queues.Maps.Map;
Application : Application_Access := null;
Dispatchers : AWA.Events.Dispatchers.Dispatcher_Access_Array := (others => null);
end record;
-- Finalize the event manager by releasing the allocated storage.
overriding
procedure Finalize (Manager : in out Event_Manager);
end AWA.Events.Services;
| 44.192308 | 98 | 0.659559 |
c57b44190a3266e3838834744fa4e52bfd2d942c | 96,614 | adb | Ada | hls_video_processor/solution1/.autopilot/db/Loop_loop_height_pro.bind.adb | bopopescu/hdmi-led | 73b04e0b07a51840ffc014c9f7b1575493be80b4 | [
"MIT"
] | 1 | 2021-04-27T01:33:32.000Z | 2021-04-27T01:33:32.000Z | hls_video_processor/solution1/.autopilot/db/Loop_loop_height_pro.bind.adb | bopopescu/hdmi-led | 73b04e0b07a51840ffc014c9f7b1575493be80b4 | [
"MIT"
] | null | null | null | hls_video_processor/solution1/.autopilot/db/Loop_loop_height_pro.bind.adb | bopopescu/hdmi-led | 73b04e0b07a51840ffc014c9f7b1575493be80b4 | [
"MIT"
] | 2 | 2020-07-09T12:12:30.000Z | 2021-05-23T22:00:42.000Z | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="15">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>Loop_loop_height_pro</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>img_adjusted_data_stream_0_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>FIFO</coreName>
</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>img_adjusted_data_stream_1_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</coreName>
</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>img_adjusted_data_stream_2_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</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_4">
<Value>
<Obj>
<type>1</type>
<id>4</id>
<name>img_out_data_stream_0_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</coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_5">
<Value>
<Obj>
<type>1</type>
<id>5</id>
<name>img_out_data_stream_1_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</coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_6">
<Value>
<Obj>
<type>1</type>
<id>6</id>
<name>img_out_data_stream_2_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</coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>22</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name></name>
<fileName>hls_video_processor/hls_video_processor.cpp</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>173</lineNumber>
<contextFuncName>int32_to_uint8</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>C:\Users\byronxu\Documents\6.S193</first>
<second class_id="11" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="12" tracking_level="0" version="0">
<first class_id="13" tracking_level="0" version="0">
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>hls_video_processor</second>
</first>
<second>431</second>
</item>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>int32_to_uint8</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.76</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>t_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>r.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>59</item>
<item>60</item>
<item>61</item>
<item>62</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>exitcond113_i1</name>
<fileName>hls_video_processor/hls_video_processor.cpp</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>173</lineNumber>
<contextFuncName>int32_to_uint8</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>hls_video_processor</second>
</first>
<second>431</second>
</item>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>int32_to_uint8</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>63</item>
<item>65</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.36</m_delay>
<m_topoIndex>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>r_V</name>
<fileName>hls_video_processor/hls_video_processor.cpp</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>173</lineNumber>
<contextFuncName>int32_to_uint8</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>hls_video_processor</second>
</first>
<second>431</second>
</item>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>int32_to_uint8</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>r.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>66</item>
<item>68</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.78</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name></name>
<fileName>hls_video_processor/hls_video_processor.cpp</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>173</lineNumber>
<contextFuncName>int32_to_uint8</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>hls_video_processor</second>
</first>
<second>431</second>
</item>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>int32_to_uint8</second>
</first>
<second>173</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>69</item>
<item>70</item>
<item>71</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name></name>
<fileName>hls_video_processor/hls_video_processor.cpp</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>174</lineNumber>
<contextFuncName>int32_to_uint8</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>hls_video_processor</second>
</first>
<second>431</second>
</item>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>int32_to_uint8</second>
</first>
<second>174</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>87</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>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>t_V_2</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>c.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>74</item>
<item>75</item>
<item>76</item>
<item>77</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>8</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>exitcond_i1</name>
<fileName>hls_video_processor/hls_video_processor.cpp</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>174</lineNumber>
<contextFuncName>int32_to_uint8</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>hls_video_processor</second>
</first>
<second>431</second>
</item>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>int32_to_uint8</second>
</first>
<second>174</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>78</item>
<item>80</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>9</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>c_V</name>
<fileName>hls_video_processor/hls_video_processor.cpp</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>174</lineNumber>
<contextFuncName>int32_to_uint8</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>hls_video_processor</second>
</first>
<second>431</second>
</item>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>int32_to_uint8</second>
</first>
<second>174</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>c.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>81</item>
<item>83</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>10</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name></name>
<fileName>hls_video_processor/hls_video_processor.cpp</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>174</lineNumber>
<contextFuncName>int32_to_uint8</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>hls_video_processor</second>
</first>
<second>431</second>
</item>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>int32_to_uint8</second>
</first>
<second>174</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>84</item>
<item>85</item>
<item>86</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>11</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>tmp_46</name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>679</lineNumber>
<contextFuncName>read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</first>
<second>operator&gt;&gt;</second>
</first>
<second>711</second>
</item>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</first>
<second>read</second>
</first>
<second>679</second>
</item>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>hls_video_processor</second>
</first>
<second>431</second>
</item>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>int32_to_uint8</second>
</first>
<second>179</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>89</item>
<item>90</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>2.88</m_delay>
<m_topoIndex>12</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>tmp_47</name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>679</lineNumber>
<contextFuncName>read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</first>
<second>operator&gt;&gt;</second>
</first>
<second>711</second>
</item>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</first>
<second>read</second>
</first>
<second>679</second>
</item>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>hls_video_processor</second>
</first>
<second>431</second>
</item>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>int32_to_uint8</second>
</first>
<second>179</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>91</item>
<item>92</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>2.88</m_delay>
<m_topoIndex>13</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>tmp</name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>679</lineNumber>
<contextFuncName>read</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</first>
<second>operator&gt;&gt;</second>
</first>
<second>711</second>
</item>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</first>
<second>read</second>
</first>
<second>679</second>
</item>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>hls_video_processor</second>
</first>
<second>431</second>
</item>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>int32_to_uint8</second>
</first>
<second>179</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>93</item>
<item>94</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>2.88</m_delay>
<m_topoIndex>14</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>tmp_36</name>
<fileName>hls_video_processor/hls_video_processor.cpp</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>184</lineNumber>
<contextFuncName>int32_to_uint8</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>hls_video_processor</second>
</first>
<second>431</second>
</item>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>int32_to_uint8</second>
</first>
<second>184</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>96</item>
<item>97</item>
<item>99</item>
<item>101</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>15</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>tmp_37</name>
<fileName>hls_video_processor/hls_video_processor.cpp</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>184</lineNumber>
<contextFuncName>int32_to_uint8</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>hls_video_processor</second>
</first>
<second>431</second>
</item>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>int32_to_uint8</second>
</first>
<second>184</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>102</item>
<item>103</item>
<item>104</item>
<item>105</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="_22">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>tmp_38</name>
<fileName>hls_video_processor/hls_video_processor.cpp</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>184</lineNumber>
<contextFuncName>int32_to_uint8</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>hls_video_processor</second>
</first>
<second>431</second>
</item>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>int32_to_uint8</second>
</first>
<second>184</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>106</item>
<item>107</item>
<item>108</item>
<item>109</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>17</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name></name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>703</lineNumber>
<contextFuncName>write</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</first>
<second>operator&lt;&lt;</second>
</first>
<second>717</second>
</item>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</first>
<second>write</second>
</first>
<second>703</second>
</item>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>hls_video_processor</second>
</first>
<second>431</second>
</item>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>int32_to_uint8</second>
</first>
<second>188</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>111</item>
<item>112</item>
<item>113</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>2.88</m_delay>
<m_topoIndex>18</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name></name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>703</lineNumber>
<contextFuncName>write</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</first>
<second>operator&lt;&lt;</second>
</first>
<second>717</second>
</item>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</first>
<second>write</second>
</first>
<second>703</second>
</item>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>hls_video_processor</second>
</first>
<second>431</second>
</item>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>int32_to_uint8</second>
</first>
<second>188</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>114</item>
<item>115</item>
<item>116</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>2.88</m_delay>
<m_topoIndex>19</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name></name>
<fileName>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>703</lineNumber>
<contextFuncName>write</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</first>
<second>operator&lt;&lt;</second>
</first>
<second>717</second>
</item>
<item>
<first>
<first>C:/Xilinx/Vivado/2018.3/common/technology/autopilot/hls/hls_video_core.h</first>
<second>write</second>
</first>
<second>703</second>
</item>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>hls_video_processor</second>
</first>
<second>431</second>
</item>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>int32_to_uint8</second>
</first>
<second>188</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>117</item>
<item>118</item>
<item>119</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>2.88</m_delay>
<m_topoIndex>20</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name></name>
<fileName>hls_video_processor/hls_video_processor.cpp</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>174</lineNumber>
<contextFuncName>int32_to_uint8</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>hls_video_processor</second>
</first>
<second>431</second>
</item>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>int32_to_uint8</second>
</first>
<second>174</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>120</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>21</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name></name>
<fileName>hls_video_processor/hls_video_processor.cpp</fileName>
<fileDirectory>C:\Users\byronxu\Documents\6.S193</fileDirectory>
<lineNumber>173</lineNumber>
<contextFuncName>int32_to_uint8</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\byronxu\Documents\6.S193</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>hls_video_processor</second>
</first>
<second>431</second>
</item>
<item>
<first>
<first>hls_video_processor/hls_video_processor.cpp</first>
<second>int32_to_uint8</second>
</first>
<second>173</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>72</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>22</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>55</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>
<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="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="_29">
<Value>
<Obj>
<type>2</type>
<id>58</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_30">
<Value>
<Obj>
<type>2</type>
<id>64</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>30</content>
</item>
<item class_id_reference="16" object_id="_31">
<Value>
<Obj>
<type>2</type>
<id>67</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_32">
<Value>
<Obj>
<type>2</type>
<id>73</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_33">
<Value>
<Obj>
<type>2</type>
<id>79</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<const_type>0</const_type>
<content>60</content>
</item>
<item class_id_reference="16" object_id="_34">
<Value>
<Obj>
<type>2</type>
<id>82</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_35">
<Value>
<Obj>
<type>2</type>
<id>98</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>4</content>
</item>
<item class_id_reference="16" object_id="_36">
<Value>
<Obj>
<type>2</type>
<id>100</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>11</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_37">
<Obj>
<type>3</type>
<id>14</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>13</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_38">
<Obj>
<type>3</type>
<id>20</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>15</item>
<item>16</item>
<item>18</item>
<item>19</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_39">
<Obj>
<type>3</type>
<id>24</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>23</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_40">
<Obj>
<type>3</type>
<id>30</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>25</item>
<item>26</item>
<item>28</item>
<item>29</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_41">
<Obj>
<type>3</type>
<id>51</id>
<name>operator>>.exit.i1</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>10</count>
<item_version>0</item_version>
<item>36</item>
<item>37</item>
<item>38</item>
<item>40</item>
<item>41</item>
<item>42</item>
<item>45</item>
<item>46</item>
<item>47</item>
<item>50</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_42">
<Obj>
<type>3</type>
<id>54</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_43">
<Obj>
<type>3</type>
<id>56</id>
<name>int32_to_uint8.exit.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>55</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>52</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_44">
<id>57</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_45">
<id>59</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_46">
<id>60</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_47">
<id>61</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_48">
<id>62</id>
<edge_type>2</edge_type>
<source_obj>54</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_49">
<id>63</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_50">
<id>65</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_51">
<id>66</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_52">
<id>68</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_53">
<id>69</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_54">
<id>70</id>
<edge_type>2</edge_type>
<source_obj>24</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_55">
<id>71</id>
<edge_type>2</edge_type>
<source_obj>56</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_56">
<id>72</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_57">
<id>74</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_58">
<id>75</id>
<edge_type>2</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="_59">
<id>76</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_60">
<id>77</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_61">
<id>78</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_62">
<id>80</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_63">
<id>81</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_64">
<id>83</id>
<edge_type>1</edge_type>
<source_obj>82</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_65">
<id>84</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_66">
<id>85</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_67">
<id>86</id>
<edge_type>2</edge_type>
<source_obj>54</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_68">
<id>87</id>
<edge_type>2</edge_type>
<source_obj>30</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_69">
<id>90</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_70">
<id>92</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_71">
<id>94</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_72">
<id>97</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_73">
<id>99</id>
<edge_type>1</edge_type>
<source_obj>98</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_74">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_75">
<id>103</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_76">
<id>104</id>
<edge_type>1</edge_type>
<source_obj>98</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_77">
<id>105</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_78">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_79">
<id>108</id>
<edge_type>1</edge_type>
<source_obj>98</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_80">
<id>109</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_81">
<id>112</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_82">
<id>113</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_83">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_84">
<id>116</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_85">
<id>118</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_86">
<id>119</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_87">
<id>120</id>
<edge_type>2</edge_type>
<source_obj>30</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_88">
<id>286</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_89">
<id>287</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_90">
<id>288</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_91">
<id>289</id>
<edge_type>2</edge_type>
<source_obj>24</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_92">
<id>290</id>
<edge_type>2</edge_type>
<source_obj>30</source_obj>
<sink_obj>54</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_93">
<id>291</id>
<edge_type>2</edge_type>
<source_obj>30</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_94">
<id>292</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_95">
<id>293</id>
<edge_type>2</edge_type>
<source_obj>54</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_96">
<mId>1</mId>
<mTag>Loop_loop_height_pro</mTag>
<mType>0</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>7</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>1891</mMinLatency>
<mMaxLatency>1891</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_97">
<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>14</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_98">
<mId>3</mId>
<mTag>loop_height</mTag>
<mType>1</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>4</item>
<item>5</item>
<item>6</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>30</mMinTripCount>
<mMaxTripCount>30</mMaxTripCount>
<mMinLatency>1890</mMinLatency>
<mMaxLatency>1890</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_99">
<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>2</count>
<item_version>0</item_version>
<item>20</item>
<item>24</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_100">
<mId>5</mId>
<mTag>loop_width</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>30</item>
<item>51</item>
</basic_blocks>
<mII>1</mII>
<mDepth>2</mDepth>
<mMinTripCount>60</mMinTripCount>
<mMaxTripCount>60</mMaxTripCount>
<mMinLatency>60</mMinLatency>
<mMaxLatency>60</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_101">
<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>54</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_102">
<mId>7</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>56</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_103">
<states class_id="25" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_104">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_105">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_106">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_107">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_108">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_109">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_110">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_111">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_112">
<id>2</id>
<operations>
<count>9</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_113">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_114">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_115">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_116">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_117">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_118">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_119">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_120">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_121">
<id>55</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_122">
<id>3</id>
<operations>
<count>5</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_123">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_124">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_125">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_126">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_127">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_128">
<id>4</id>
<operations>
<count>20</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_129">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_130">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_131">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_132">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_133">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_134">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_135">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_136">
<id>38</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_137">
<id>39</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_138">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_139">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_140">
<id>42</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_141">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_142">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_143">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_144">
<id>46</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_145">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_146">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_147">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_148">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_149">
<id>5</id>
<operations>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_150">
<id>52</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_151">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_152">
<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="_153">
<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>16</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_154">
<inState>5</inState>
<outState>2</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="_155">
<inState>4</inState>
<outState>3</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="_156">
<inState>3</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>26</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_157">
<inState>3</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>26</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>22</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>13</first>
<second class_id="39" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>47</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>53</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="40" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="41" tracking_level="0" version="0">
<first>14</first>
<second class_id="42" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>3</first>
<second>3</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="43" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="1" version="0" object_id="_158">
<region_name>loop_width</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>30</item>
<item>51</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>2</pipe_depth>
</item>
<item class_id_reference="44" object_id="_159">
<region_name>hls_label_6</region_name>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</basic_blocks>
<nodes>
<count>6</count>
<item_version>0</item_version>
<item>43</item>
<item>44</item>
<item>45</item>
<item>46</item>
<item>47</item>
<item>48</item>
</nodes>
<anchor_node>43</anchor_node>
<region_type>1</region_type>
<interval>0</interval>
<pipe_depth>0</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="45" tracking_level="0" version="0">
<count>15</count>
<item_version>0</item_version>
<item class_id="46" tracking_level="0" version="0">
<first>72</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>78</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>84</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>97</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>104</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>115</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>126</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>133</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>139</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>145</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>151</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>157</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>168</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>179</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="48" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="49" tracking_level="0" version="0">
<first>c_V_fu_151</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>exitcond113_i1_fu_133</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>exitcond_i1_fu_145</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>r_V_fu_139</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>t_V_2_phi_fu_126</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>t_V_phi_fu_115</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>tmp_36_fu_157</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>tmp_37_fu_168</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>tmp_38_fu_179</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</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>6</count>
<item_version>0</item_version>
<item>
<first>StgValue_41_write_fu_90</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>StgValue_42_write_fu_97</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>StgValue_43_write_fu_104</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>tmp_46_read_fu_72</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>tmp_47_read_fu_78</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>tmp_read_fu_84</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</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>6</count>
<item_version>0</item_version>
<item>
<first>111</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>122</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>190</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>194</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>199</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>203</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>6</count>
<item_version>0</item_version>
<item>
<first>c_V_reg_203</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>exitcond113_i1_reg_190</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>exitcond_i1_reg_199</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>r_V_reg_194</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>t_V_2_reg_122</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>t_V_reg_111</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>2</count>
<item_version>0</item_version>
<item>
<first>111</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>122</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>2</count>
<item_version>0</item_version>
<item>
<first>t_V_2_reg_122</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>t_V_reg_111</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="51" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="52" tracking_level="0" version="0">
<first>img_adjusted_data_stream_0_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>36</item>
</second>
</item>
</second>
</item>
<item>
<first>img_adjusted_data_stream_1_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>37</item>
</second>
</item>
</second>
</item>
<item>
<first>img_adjusted_data_stream_2_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>38</item>
</second>
</item>
</second>
</item>
<item>
<first>img_out_data_stream_0_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>45</item>
</second>
</item>
</second>
</item>
<item>
<first>img_out_data_stream_1_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>46</item>
</second>
</item>
</second>
</item>
<item>
<first>img_out_data_stream_2_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>47</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="53" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="54" tracking_level="0" version="0">
<first>1</first>
<second>FIFO</second>
</item>
<item>
<first>2</first>
<second>FIFO</second>
</item>
<item>
<first>3</first>
<second>FIFO</second>
</item>
<item>
<first>4</first>
<second>FIFO</second>
</item>
<item>
<first>5</first>
<second>FIFO</second>
</item>
<item>
<first>6</first>
<second>FIFO</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 27.509681 | 100 | 0.574937 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.