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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
1e4a58113eafa99038189d2e2b5a9f6df54a616e | 6,020 | adb | Ada | src/tk/tk-ttklabelframe.adb | thindil/tashy2 | 43fcbadb33c0062b2c8d6138a8238441dec5fd80 | [
"Apache-2.0"
] | 2 | 2020-12-09T07:27:07.000Z | 2021-10-19T13:31:54.000Z | src/tk/tk-ttklabelframe.adb | thindil/tashy2 | 43fcbadb33c0062b2c8d6138a8238441dec5fd80 | [
"Apache-2.0"
] | null | null | null | src/tk/tk-ttklabelframe.adb | thindil/tashy2 | 43fcbadb33c0062b2c8d6138a8238441dec5fd80 | [
"Apache-2.0"
] | null | null | null | -- Copyright (c) 2021 Bartek thindil Jasicki <[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.Strings.Unbounded; use Ada.Strings.Unbounded;
package body Tk.TtkLabelFrame is
function Create
(Path_Name: Tk_Path_String; Options: Ttk_Label_Frame_Options;
Interpreter: Tcl_Interpreter := Get_Interpreter)
return Ttk_Label_Frame is
Options_String: Unbounded_String := Null_Unbounded_String;
begin
Option_Image
(Name => "borderwidth", Value => Options.Border_Width,
Options_String => Options_String);
Option_Image
(Name => "class", Value => Options.Class,
Options_String => Options_String);
Option_Image
(Name => "cursor", Value => Options.Cursor,
Options_String => Options_String);
Option_Image
(Name => "height", Value => Options.Height,
Options_String => Options_String);
Option_Image
(Name => "labelanchor", Value => Options.Label_Anchor,
Options_String => Options_String);
Option_Image
(Name => "labelwidget", Value => Options.Label_Widget,
Options_String => Options_String);
Option_Image
(Name => "padding", Value => Options.Padding,
Options_String => Options_String);
Option_Image
(Name => "relief", Value => Options.Relief,
Options_String => Options_String);
Option_Image
(Name => "takefocus", Value => Options.Take_Focus,
Options_String => Options_String);
Option_Image
(Name => "text", Value => Options.Text,
Options_String => Options_String);
Option_Image
(Name => "underline", Value => Options.Underline,
Options_String => Options_String);
Option_Image
(Name => "width", Value => Options.Width,
Options_String => Options_String);
Tcl_Eval
(Tcl_Script =>
"ttk::labelframe " & Path_Name & " " &
To_String(Source => Options_String),
Interpreter => Interpreter);
return Get_Widget(Path_Name => Path_Name, Interpreter => Interpreter);
end Create;
procedure Create
(Frame_Widget: out Ttk_Label_Frame; Path_Name: Tk_Path_String;
Options: Ttk_Label_Frame_Options;
Interpreter: Tcl_Interpreter := Get_Interpreter) is
begin
Frame_Widget :=
Create
(Path_Name => Path_Name, Options => Options,
Interpreter => Interpreter);
end Create;
function Get_Options
(Frame_Widget: Ttk_Label_Frame) return Ttk_Label_Frame_Options is
begin
return
Options: Ttk_Label_Frame_Options := Default_Ttk_Label_Frame_Options do
Options.Border_Width :=
Option_Value(Widgt => Frame_Widget, Name => "borderwidth");
Options.Class := Option_Value(Widgt => Frame_Widget, Name => "class");
Options.Cursor :=
Option_Value(Widgt => Frame_Widget, Name => "cursor");
Options.Height :=
Option_Value(Widgt => Frame_Widget, Name => "height");
Options.Label_Anchor :=
Option_Value(Widgt => Frame_Widget, Name => "labelanchor");
Options.Label_Widget :=
Option_Value(Widgt => Frame_Widget, Name => "labelwidget");
Options.Padding :=
Option_Value(Ttk_Widgt => Frame_Widget, Name => "padding");
Options.Relief :=
Option_Value(Widgt => Frame_Widget, Name => "relief");
Options.Take_Focus :=
Option_Value(Widgt => Frame_Widget, Name => "takefocus");
Options.Text := Option_Value(Widgt => Frame_Widget, Name => "text");
Options.Underline :=
Option_Value(Widgt => Frame_Widget, Name => "underline");
Options.Width := Option_Value(Widgt => Frame_Widget, Name => "width");
end return;
end Get_Options;
procedure Configure
(Frame_Widget: Ttk_Label_Frame; Options: Ttk_Label_Frame_Options) is
Options_String: Unbounded_String := Null_Unbounded_String;
begin
Option_Image
(Name => "borderwidth", Value => Options.Border_Width,
Options_String => Options_String);
Option_Image
(Name => "cursor", Value => Options.Cursor,
Options_String => Options_String);
Option_Image
(Name => "height", Value => Options.Height,
Options_String => Options_String);
Option_Image
(Name => "labelanchor", Value => Options.Label_Anchor,
Options_String => Options_String);
Option_Image
(Name => "labelwidget", Value => Options.Label_Widget,
Options_String => Options_String);
Option_Image
(Name => "padding", Value => Options.Padding,
Options_String => Options_String);
Option_Image
(Name => "relief", Value => Options.Relief,
Options_String => Options_String);
Option_Image
(Name => "takefocus", Value => Options.Take_Focus,
Options_String => Options_String);
Option_Image
(Name => "text", Value => Options.Text,
Options_String => Options_String);
Option_Image
(Name => "underline", Value => Options.Underline,
Options_String => Options_String);
Option_Image
(Name => "width", Value => Options.Width,
Options_String => Options_String);
Execute_Widget_Command
(Widgt => Frame_Widget, Command_Name => "configure",
Options => To_String(Source => Options_String));
end Configure;
end Tk.TtkLabelFrame;
| 39.605263 | 79 | 0.640365 |
380791f09201a3992959ebea0189a1d0d63f7771 | 5,301 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce3604a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce3604a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce3604a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- CE3604A.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 GET_LINE MAY BE CALLED TO RETURN AN ENTIRE LINE. ALSO
-- CHECK THAT GET_LINE MAY BE CALLED TO RETURN THE REMAINDER OF A
-- PARTLY READ LINE. ALSO CHECK THAT GET_LINE RETURNS IN THE
-- PARAMETER LAST, THE INDEX VALUE OF THE LAST CHARACTER READ.
-- WHEN NO CHARACTERS ARE READ, LAST IS ONE LESS THAN ITEM'S LOWER
-- BOUND.
-- APPLICABILITY CRITERIA:
-- THIS TEST IS APPLICABLE ONLY TO IMPLEMENTATIONS WHICH SUPPORT
-- TEXT FILES.
-- HISTORY:
-- JLH 09/25/87 COMPLETELY REVISED TEST.
WITH REPORT; USE REPORT;
WITH TEXT_IO; USE TEXT_IO;
PROCEDURE CE3604A IS
BEGIN
TEST ("CE3604A", "CHECK THAT GET_LINE READS LINES APPROPRIATELY " &
"AND CHECK THAT LAST RETURNS THE CORRECT INDEX " &
"VALUE");
DECLARE
FILE : FILE_TYPE;
STR : STRING (1 .. 25);
LAST : NATURAL;
ITEM1 : STRING (2 .. 6);
ITEM2 : STRING (3 .. 6);
CH : CHARACTER;
INCOMPLETE : EXCEPTION;
BEGIN
BEGIN
CREATE (FILE, OUT_FILE, LEGAL_FILE_NAME);
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("USE_ERROR RAISED ON TEXT CREATE " &
"WITH OUT_FILE MODE");
RAISE INCOMPLETE;
WHEN NAME_ERROR =>
NOT_APPLICABLE ("NAME_ERROR RAISED ON TEXT " &
"CREATE WITH OUT_FILE MODE");
RAISE INCOMPLETE;
WHEN OTHERS =>
FAILED ("UNEXPECTED EXCEPTION RAISED ON TEXT " &
"CREATE");
RAISE INCOMPLETE;
END;
PUT (FILE, "FIRST LINE OF INPUT");
NEW_LINE (FILE);
PUT (FILE, "SECOND LINE OF INPUT");
NEW_LINE (FILE);
PUT (FILE, "THIRD LINE OF INPUT");
NEW_LINE (FILE);
NEW_LINE (FILE);
CLOSE (FILE);
BEGIN
OPEN (FILE, IN_FILE, LEGAL_FILE_NAME);
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("USE_ERROR RAISED ON TEXT OPEN " &
"WITH IN_FILE MODE");
RAISE INCOMPLETE;
END;
GET_LINE (FILE, STR, LAST);
BEGIN
IF STR(1..LAST) /= "FIRST LINE OF INPUT" THEN
FAILED ("GET_LINE - RETURN OF ENTIRE LINE");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
FAILED ("CONSTRAINT_ERROR RAISED AFTER " &
"GET_LINE - 1");
END;
GET (FILE, ITEM1);
GET_LINE (FILE, STR, LAST);
BEGIN
IF STR(1..LAST) /= "D LINE OF INPUT" THEN
FAILED ("GET_LINE - REMAINDER OF PARTLY READ LINE");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
FAILED ("CONSTRAINT_ERROR RAISED AFTER " &
"GET_LINE - 2");
END;
GET_LINE (FILE, ITEM1, LAST);
IF LAST /= 6 THEN
FAILED ("INCORRECT VALUE FOR LAST PARAMETER - 1");
END IF;
WHILE NOT END_OF_LINE (FILE) LOOP
GET (FILE, CH);
END LOOP;
GET_LINE (FILE, ITEM1, LAST);
IF LAST /= 1 THEN
FAILED ("INCORRECT VALUE FOR LAST PARAMETER - 2");
END IF;
IF NOT END_OF_LINE (FILE) THEN
FAILED ("END_OF_LINE NOT TRUE");
END IF;
GET_LINE (FILE, ITEM2, LAST);
IF LAST /= 2 THEN
FAILED ("INCORRECT VALUE FOR LAST PARAMETER - 3");
END IF;
BEGIN
DELETE (FILE);
EXCEPTION
WHEN USE_ERROR =>
NULL;
END;
EXCEPTION
WHEN INCOMPLETE =>
NULL;
END;
RESULT;
END CE3604A;
| 32.925466 | 79 | 0.527259 |
1e25f8780415ea3fb2fd3ec3e9d0fa1c0548b645 | 801 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/test_time_stamp.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/test_time_stamp.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/test_time_stamp.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- { dg-do run }
with GNAT.Time_Stamp;
use GNAT.Time_Stamp;
procedure test_time_stamp is
S : constant String := Current_Time;
function NN (S : String) return Boolean is
begin
for J in S'Range loop
if S (J) not in '0' .. '9' then
return True;
end if;
end loop;
return False;
end NN;
begin
if S'Length /= 22
or else S (5) /= '-'
or else S (8) /= '-'
or else S (11) /= ' '
or else S (14) /= ':'
or else S (17) /= ':'
or else S (20) /= '.'
or else NN (S (1 .. 4))
or else NN (S (6 .. 7))
or else NN (S (9 .. 10))
or else NN (S (12 .. 13))
or else NN (S (15 .. 16))
or else NN (S (18 .. 19))
or else NN (S (21 .. 22))
then
raise Program_Error;
end if;
end;
| 21.078947 | 45 | 0.480649 |
1e24843e1caac98b35abaa5f6fd6f925a771ec1e | 12,289 | adb | Ada | tools-src/gnu/gcc/gcc/ada/s-poosiz.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 80 | 2015-01-02T10:14:04.000Z | 2021-06-07T06:29:49.000Z | tools-src/gnu/gcc/gcc/ada/s-poosiz.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 9 | 2015-05-14T11:03:12.000Z | 2018-01-04T07:12:58.000Z | tools-src/gnu/gcc/gcc/ada/s-poosiz.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P O O L _ S I Z E --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-2001 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.Storage_Elements;
with System.Address_To_Access_Conversions;
package body System.Pool_Size is
package SSE renames System.Storage_Elements;
use type SSE.Storage_Offset;
package SC is new Address_To_Access_Conversions (SSE.Storage_Count);
SC_Size : constant
:= SSE.Storage_Count'Object_Size / System.Storage_Unit;
package Variable_Size_Management is
-- Embedded pool that manages allocation of variable-size data.
-- This pool is used as soon as the Elmt_sizS of the pool object is 0.
-- Allocation is done on the first chunk long enough for the request.
-- Deallocation just puts the freed chunk at the beginning of the list.
procedure Initialize (Pool : in out Stack_Bounded_Pool);
procedure Allocate
(Pool : in out Stack_Bounded_Pool;
Address : out System.Address;
Storage_Size : SSE.Storage_Count;
Alignment : SSE.Storage_Count);
procedure Deallocate
(Pool : in out Stack_Bounded_Pool;
Address : System.Address;
Storage_Size : SSE.Storage_Count;
Alignment : SSE.Storage_Count);
end Variable_Size_Management;
package Vsize renames Variable_Size_Management;
--------------
-- Allocate --
--------------
procedure Allocate
(Pool : in out Stack_Bounded_Pool;
Address : out System.Address;
Storage_Size : SSE.Storage_Count;
Alignment : SSE.Storage_Count)
is
begin
if Pool.Elmt_Size = 0 then
Vsize.Allocate (Pool, Address, Storage_Size, Alignment);
elsif Pool.First_Free /= 0 then
Address := Pool.The_Pool (Pool.First_Free)'Address;
Pool.First_Free := SC.To_Pointer (Address).all;
elsif
Pool.First_Empty <= (Pool.Pool_Size - Pool.Aligned_Elmt_Size + 1)
then
Address := Pool.The_Pool (Pool.First_Empty)'Address;
Pool.First_Empty := Pool.First_Empty + Pool.Aligned_Elmt_Size;
else
raise Storage_Error;
end if;
end Allocate;
----------------
-- Deallocate --
----------------
procedure Deallocate
(Pool : in out Stack_Bounded_Pool;
Address : System.Address;
Storage_Size : SSE.Storage_Count;
Alignment : SSE.Storage_Count)
is
begin
if Pool.Elmt_Size = 0 then
Vsize.Deallocate (Pool, Address, Storage_Size, Alignment);
else
SC.To_Pointer (Address).all := Pool.First_Free;
Pool.First_Free := Address - Pool.The_Pool'Address + 1;
end if;
end Deallocate;
----------------
-- Initialize --
----------------
procedure Initialize (Pool : in out Stack_Bounded_Pool) is
Align : constant SSE.Storage_Count :=
SSE.Storage_Count'Max (SSE.Storage_Count'Alignment, Pool.Alignment);
begin
if Pool.Elmt_Size = 0 then
Vsize.Initialize (Pool);
else
Pool.First_Free := 0;
Pool.First_Empty := 1;
-- Compute the size to allocate given the size of the element and
-- the possible Alignment clause
Pool.Aligned_Elmt_Size :=
SSE.Storage_Count'Max (SC_Size,
((Pool.Elmt_Size + Align - 1) / Align) * Align);
end if;
end Initialize;
------------------
-- Storage_Size --
------------------
function Storage_Size
(Pool : Stack_Bounded_Pool)
return SSE.Storage_Count
is
begin
return Pool.Pool_Size;
end Storage_Size;
------------------------------
-- Variable_Size_Management --
------------------------------
package body Variable_Size_Management is
Minimum_Size : constant := 2 * SC_Size;
procedure Set_Size
(Pool : Stack_Bounded_Pool;
Chunk, Size : SSE.Storage_Count);
-- Update the field 'size' of a chunk of available storage
procedure Set_Next
(Pool : Stack_Bounded_Pool;
Chunk, Next : SSE.Storage_Count);
-- Update the field 'next' of a chunk of available storage
function Size
(Pool : Stack_Bounded_Pool;
Chunk : SSE.Storage_Count)
return SSE.Storage_Count;
-- Fetch the field 'size' of a chunk of available storage
function Next
(Pool : Stack_Bounded_Pool;
Chunk : SSE.Storage_Count)
return SSE.Storage_Count;
-- Fetch the field 'next' of a chunk of available storage
function Chunk_Of
(Pool : Stack_Bounded_Pool;
Addr : System.Address)
return SSE.Storage_Count;
-- Give the chunk number in the pool from its Address
--------------
-- Allocate --
--------------
procedure Allocate
(Pool : in out Stack_Bounded_Pool;
Address : out System.Address;
Storage_Size : SSE.Storage_Count;
Alignment : SSE.Storage_Count)
is
Chunk : SSE.Storage_Count;
New_Chunk : SSE.Storage_Count;
Prev_Chunk : SSE.Storage_Count;
Our_Align : constant SSE.Storage_Count :=
SSE.Storage_Count'Max (SSE.Storage_Count'Alignment,
Alignment);
Align_Size : constant SSE.Storage_Count :=
SSE.Storage_Count'Max (
Minimum_Size,
((Storage_Size + Our_Align - 1) / Our_Align) *
Our_Align);
begin
-- Look for the first big enough chunk
Prev_Chunk := Pool.First_Free;
Chunk := Next (Pool, Prev_Chunk);
while Chunk /= 0 and then Size (Pool, Chunk) < Align_Size loop
Prev_Chunk := Chunk;
Chunk := Next (Pool, Chunk);
end loop;
-- Raise storage_error if no big enough chunk available
if Chunk = 0 then
raise Storage_Error;
end if;
-- When the chunk is bigger than what is needed, take appropraite
-- amount and build a new shrinked chunk with the remainder.
if Size (Pool, Chunk) - Align_Size > Minimum_Size then
New_Chunk := Chunk + Align_Size;
Set_Size (Pool, New_Chunk, Size (Pool, Chunk) - Align_Size);
Set_Next (Pool, New_Chunk, Next (Pool, Chunk));
Set_Next (Pool, Prev_Chunk, New_Chunk);
-- If the chunk is the right size, just delete it from the chain
else
Set_Next (Pool, Prev_Chunk, Next (Pool, Chunk));
end if;
Address := Pool.The_Pool (Chunk)'Address;
end Allocate;
--------------
-- Chunk_Of --
--------------
function Chunk_Of
(Pool : Stack_Bounded_Pool;
Addr : System.Address)
return SSE.Storage_Count
is
begin
return 1 + abs (Addr - Pool.The_Pool (1)'Address);
end Chunk_Of;
----------------
-- Deallocate --
----------------
procedure Deallocate
(Pool : in out Stack_Bounded_Pool;
Address : System.Address;
Storage_Size : SSE.Storage_Count;
Alignment : SSE.Storage_Count)
is
Align_Size : constant SSE.Storage_Count :=
((Storage_Size + Alignment - 1) / Alignment) *
Alignment;
Chunk : SSE.Storage_Count := Chunk_Of (Pool, Address);
begin
-- Attach the freed chunk to the chain
Set_Size (Pool, Chunk,
SSE.Storage_Count'Max (Align_Size, Minimum_Size));
Set_Next (Pool, Chunk, Next (Pool, Pool.First_Free));
Set_Next (Pool, Pool.First_Free, Chunk);
end Deallocate;
----------------
-- Initialize --
----------------
procedure Initialize (Pool : in out Stack_Bounded_Pool) is
begin
Pool.First_Free := 1;
if Pool.Pool_Size > Minimum_Size then
Set_Next (Pool, Pool.First_Free, Pool.First_Free + Minimum_Size);
Set_Size (Pool, Pool.First_Free, 0);
Set_Size (Pool, Pool.First_Free + Minimum_Size,
Pool.Pool_Size - Minimum_Size);
Set_Next (Pool, Pool.First_Free + Minimum_Size, 0);
end if;
end Initialize;
----------
-- Next --
----------
function Next
(Pool : Stack_Bounded_Pool;
Chunk : SSE.Storage_Count)
return SSE.Storage_Count
is
begin
return SC.To_Pointer (Pool.The_Pool (Chunk + SC_Size)'Address).all;
end Next;
--------------
-- Set_Next --
--------------
procedure Set_Next
(Pool : Stack_Bounded_Pool;
Chunk, Next : SSE.Storage_Count)
is
begin
SC.To_Pointer (Pool.The_Pool (Chunk + SC_Size)'Address).all := Next;
end Set_Next;
--------------
-- Set_Size --
--------------
procedure Set_Size
(Pool : Stack_Bounded_Pool;
Chunk, Size : SSE.Storage_Count)
is
begin
SC.To_Pointer (Pool.The_Pool (Chunk)'Address).all := Size;
end Set_Size;
----------
-- Size --
----------
function Size
(Pool : Stack_Bounded_Pool;
Chunk : SSE.Storage_Count)
return SSE.Storage_Count
is
begin
return SC.To_Pointer (Pool.The_Pool (Chunk)'Address).all;
end Size;
end Variable_Size_Management;
end System.Pool_Size;
| 34.136111 | 78 | 0.52014 |
13392fe8382de6c62e1594d8280b891a65a97acc | 24,893 | ads | Ada | arch/ARM/STM32/svd/stm32l4x1/stm32_svd-usb.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/stm32l4x1/stm32_svd-usb.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | arch/ARM/STM32/svd/stm32l4x1/stm32_svd-usb.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | -- This spec has been automatically generated from STM32L4x1.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.USB is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype EP0R_EA_Field is HAL.UInt4;
subtype EP0R_STAT_TX_Field is HAL.UInt2;
subtype EP0R_EP_TYPE_Field is HAL.UInt2;
subtype EP0R_STAT_RX_Field is HAL.UInt2;
-- endpoint 0 register
type EP0R_Register is record
-- Endpoint address
EA : EP0R_EA_Field := 16#0#;
-- Status bits, for transmission transfers
STAT_TX : EP0R_STAT_TX_Field := 16#0#;
-- Data Toggle, for transmission transfers
DTOG_TX : Boolean := False;
-- Correct Transfer for transmission
CTR_TX : Boolean := False;
-- Endpoint kind
EP_KIND : Boolean := False;
-- Endpoint type
EP_TYPE : EP0R_EP_TYPE_Field := 16#0#;
-- Setup transaction completed
SETUP : Boolean := False;
-- Status bits, for reception transfers
STAT_RX : EP0R_STAT_RX_Field := 16#0#;
-- Data Toggle, for reception transfers
DTOG_RX : Boolean := False;
-- Correct transfer for reception
CTR_RX : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EP0R_Register use record
EA at 0 range 0 .. 3;
STAT_TX at 0 range 4 .. 5;
DTOG_TX at 0 range 6 .. 6;
CTR_TX at 0 range 7 .. 7;
EP_KIND at 0 range 8 .. 8;
EP_TYPE at 0 range 9 .. 10;
SETUP at 0 range 11 .. 11;
STAT_RX at 0 range 12 .. 13;
DTOG_RX at 0 range 14 .. 14;
CTR_RX at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype EP1R_EA_Field is HAL.UInt4;
subtype EP1R_STAT_TX_Field is HAL.UInt2;
subtype EP1R_EP_TYPE_Field is HAL.UInt2;
subtype EP1R_STAT_RX_Field is HAL.UInt2;
-- endpoint 1 register
type EP1R_Register is record
-- Endpoint address
EA : EP1R_EA_Field := 16#0#;
-- Status bits, for transmission transfers
STAT_TX : EP1R_STAT_TX_Field := 16#0#;
-- Data Toggle, for transmission transfers
DTOG_TX : Boolean := False;
-- Correct Transfer for transmission
CTR_TX : Boolean := False;
-- Endpoint kind
EP_KIND : Boolean := False;
-- Endpoint type
EP_TYPE : EP1R_EP_TYPE_Field := 16#0#;
-- Setup transaction completed
SETUP : Boolean := False;
-- Status bits, for reception transfers
STAT_RX : EP1R_STAT_RX_Field := 16#0#;
-- Data Toggle, for reception transfers
DTOG_RX : Boolean := False;
-- Correct transfer for reception
CTR_RX : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EP1R_Register use record
EA at 0 range 0 .. 3;
STAT_TX at 0 range 4 .. 5;
DTOG_TX at 0 range 6 .. 6;
CTR_TX at 0 range 7 .. 7;
EP_KIND at 0 range 8 .. 8;
EP_TYPE at 0 range 9 .. 10;
SETUP at 0 range 11 .. 11;
STAT_RX at 0 range 12 .. 13;
DTOG_RX at 0 range 14 .. 14;
CTR_RX at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype EP2R_EA_Field is HAL.UInt4;
subtype EP2R_STAT_TX_Field is HAL.UInt2;
subtype EP2R_EP_TYPE_Field is HAL.UInt2;
subtype EP2R_STAT_RX_Field is HAL.UInt2;
-- endpoint 2 register
type EP2R_Register is record
-- Endpoint address
EA : EP2R_EA_Field := 16#0#;
-- Status bits, for transmission transfers
STAT_TX : EP2R_STAT_TX_Field := 16#0#;
-- Data Toggle, for transmission transfers
DTOG_TX : Boolean := False;
-- Correct Transfer for transmission
CTR_TX : Boolean := False;
-- Endpoint kind
EP_KIND : Boolean := False;
-- Endpoint type
EP_TYPE : EP2R_EP_TYPE_Field := 16#0#;
-- Setup transaction completed
SETUP : Boolean := False;
-- Status bits, for reception transfers
STAT_RX : EP2R_STAT_RX_Field := 16#0#;
-- Data Toggle, for reception transfers
DTOG_RX : Boolean := False;
-- Correct transfer for reception
CTR_RX : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EP2R_Register use record
EA at 0 range 0 .. 3;
STAT_TX at 0 range 4 .. 5;
DTOG_TX at 0 range 6 .. 6;
CTR_TX at 0 range 7 .. 7;
EP_KIND at 0 range 8 .. 8;
EP_TYPE at 0 range 9 .. 10;
SETUP at 0 range 11 .. 11;
STAT_RX at 0 range 12 .. 13;
DTOG_RX at 0 range 14 .. 14;
CTR_RX at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype EP3R_EA_Field is HAL.UInt4;
subtype EP3R_STAT_TX_Field is HAL.UInt2;
subtype EP3R_EP_TYPE_Field is HAL.UInt2;
subtype EP3R_STAT_RX_Field is HAL.UInt2;
-- endpoint 3 register
type EP3R_Register is record
-- Endpoint address
EA : EP3R_EA_Field := 16#0#;
-- Status bits, for transmission transfers
STAT_TX : EP3R_STAT_TX_Field := 16#0#;
-- Data Toggle, for transmission transfers
DTOG_TX : Boolean := False;
-- Correct Transfer for transmission
CTR_TX : Boolean := False;
-- Endpoint kind
EP_KIND : Boolean := False;
-- Endpoint type
EP_TYPE : EP3R_EP_TYPE_Field := 16#0#;
-- Setup transaction completed
SETUP : Boolean := False;
-- Status bits, for reception transfers
STAT_RX : EP3R_STAT_RX_Field := 16#0#;
-- Data Toggle, for reception transfers
DTOG_RX : Boolean := False;
-- Correct transfer for reception
CTR_RX : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EP3R_Register use record
EA at 0 range 0 .. 3;
STAT_TX at 0 range 4 .. 5;
DTOG_TX at 0 range 6 .. 6;
CTR_TX at 0 range 7 .. 7;
EP_KIND at 0 range 8 .. 8;
EP_TYPE at 0 range 9 .. 10;
SETUP at 0 range 11 .. 11;
STAT_RX at 0 range 12 .. 13;
DTOG_RX at 0 range 14 .. 14;
CTR_RX at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype EP4R_EA_Field is HAL.UInt4;
subtype EP4R_STAT_TX_Field is HAL.UInt2;
subtype EP4R_EP_TYPE_Field is HAL.UInt2;
subtype EP4R_STAT_RX_Field is HAL.UInt2;
-- endpoint 4 register
type EP4R_Register is record
-- Endpoint address
EA : EP4R_EA_Field := 16#0#;
-- Status bits, for transmission transfers
STAT_TX : EP4R_STAT_TX_Field := 16#0#;
-- Data Toggle, for transmission transfers
DTOG_TX : Boolean := False;
-- Correct Transfer for transmission
CTR_TX : Boolean := False;
-- Endpoint kind
EP_KIND : Boolean := False;
-- Endpoint type
EP_TYPE : EP4R_EP_TYPE_Field := 16#0#;
-- Setup transaction completed
SETUP : Boolean := False;
-- Status bits, for reception transfers
STAT_RX : EP4R_STAT_RX_Field := 16#0#;
-- Data Toggle, for reception transfers
DTOG_RX : Boolean := False;
-- Correct transfer for reception
CTR_RX : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EP4R_Register use record
EA at 0 range 0 .. 3;
STAT_TX at 0 range 4 .. 5;
DTOG_TX at 0 range 6 .. 6;
CTR_TX at 0 range 7 .. 7;
EP_KIND at 0 range 8 .. 8;
EP_TYPE at 0 range 9 .. 10;
SETUP at 0 range 11 .. 11;
STAT_RX at 0 range 12 .. 13;
DTOG_RX at 0 range 14 .. 14;
CTR_RX at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype EP5R_EA_Field is HAL.UInt4;
subtype EP5R_STAT_TX_Field is HAL.UInt2;
subtype EP5R_EP_TYPE_Field is HAL.UInt2;
subtype EP5R_STAT_RX_Field is HAL.UInt2;
-- endpoint 5 register
type EP5R_Register is record
-- Endpoint address
EA : EP5R_EA_Field := 16#0#;
-- Status bits, for transmission transfers
STAT_TX : EP5R_STAT_TX_Field := 16#0#;
-- Data Toggle, for transmission transfers
DTOG_TX : Boolean := False;
-- Correct Transfer for transmission
CTR_TX : Boolean := False;
-- Endpoint kind
EP_KIND : Boolean := False;
-- Endpoint type
EP_TYPE : EP5R_EP_TYPE_Field := 16#0#;
-- Setup transaction completed
SETUP : Boolean := False;
-- Status bits, for reception transfers
STAT_RX : EP5R_STAT_RX_Field := 16#0#;
-- Data Toggle, for reception transfers
DTOG_RX : Boolean := False;
-- Correct transfer for reception
CTR_RX : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EP5R_Register use record
EA at 0 range 0 .. 3;
STAT_TX at 0 range 4 .. 5;
DTOG_TX at 0 range 6 .. 6;
CTR_TX at 0 range 7 .. 7;
EP_KIND at 0 range 8 .. 8;
EP_TYPE at 0 range 9 .. 10;
SETUP at 0 range 11 .. 11;
STAT_RX at 0 range 12 .. 13;
DTOG_RX at 0 range 14 .. 14;
CTR_RX at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype EP6R_EA_Field is HAL.UInt4;
subtype EP6R_STAT_TX_Field is HAL.UInt2;
subtype EP6R_EP_TYPE_Field is HAL.UInt2;
subtype EP6R_STAT_RX_Field is HAL.UInt2;
-- endpoint 6 register
type EP6R_Register is record
-- Endpoint address
EA : EP6R_EA_Field := 16#0#;
-- Status bits, for transmission transfers
STAT_TX : EP6R_STAT_TX_Field := 16#0#;
-- Data Toggle, for transmission transfers
DTOG_TX : Boolean := False;
-- Correct Transfer for transmission
CTR_TX : Boolean := False;
-- Endpoint kind
EP_KIND : Boolean := False;
-- Endpoint type
EP_TYPE : EP6R_EP_TYPE_Field := 16#0#;
-- Setup transaction completed
SETUP : Boolean := False;
-- Status bits, for reception transfers
STAT_RX : EP6R_STAT_RX_Field := 16#0#;
-- Data Toggle, for reception transfers
DTOG_RX : Boolean := False;
-- Correct transfer for reception
CTR_RX : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EP6R_Register use record
EA at 0 range 0 .. 3;
STAT_TX at 0 range 4 .. 5;
DTOG_TX at 0 range 6 .. 6;
CTR_TX at 0 range 7 .. 7;
EP_KIND at 0 range 8 .. 8;
EP_TYPE at 0 range 9 .. 10;
SETUP at 0 range 11 .. 11;
STAT_RX at 0 range 12 .. 13;
DTOG_RX at 0 range 14 .. 14;
CTR_RX at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype EP7R_EA_Field is HAL.UInt4;
subtype EP7R_STAT_TX_Field is HAL.UInt2;
subtype EP7R_EP_TYPE_Field is HAL.UInt2;
subtype EP7R_STAT_RX_Field is HAL.UInt2;
-- endpoint 7 register
type EP7R_Register is record
-- Endpoint address
EA : EP7R_EA_Field := 16#0#;
-- Status bits, for transmission transfers
STAT_TX : EP7R_STAT_TX_Field := 16#0#;
-- Data Toggle, for transmission transfers
DTOG_TX : Boolean := False;
-- Correct Transfer for transmission
CTR_TX : Boolean := False;
-- Endpoint kind
EP_KIND : Boolean := False;
-- Endpoint type
EP_TYPE : EP7R_EP_TYPE_Field := 16#0#;
-- Setup transaction completed
SETUP : Boolean := False;
-- Status bits, for reception transfers
STAT_RX : EP7R_STAT_RX_Field := 16#0#;
-- Data Toggle, for reception transfers
DTOG_RX : Boolean := False;
-- Correct transfer for reception
CTR_RX : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for EP7R_Register use record
EA at 0 range 0 .. 3;
STAT_TX at 0 range 4 .. 5;
DTOG_TX at 0 range 6 .. 6;
CTR_TX at 0 range 7 .. 7;
EP_KIND at 0 range 8 .. 8;
EP_TYPE at 0 range 9 .. 10;
SETUP at 0 range 11 .. 11;
STAT_RX at 0 range 12 .. 13;
DTOG_RX at 0 range 14 .. 14;
CTR_RX at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- control register
type CNTR_Register is record
-- Force USB Reset
FRES : Boolean := True;
-- Power down
PDWN : Boolean := True;
-- Low-power mode
LPMODE : Boolean := False;
-- Force suspend
FSUSP : Boolean := False;
-- Resume request
RESUME : Boolean := False;
-- LPM L1 Resume request
L1RESUME : Boolean := False;
-- unspecified
Reserved_6_6 : HAL.Bit := 16#0#;
-- LPM L1 state request interrupt mask
L1REQM : Boolean := False;
-- Expected start of frame interrupt mask
ESOFM : Boolean := False;
-- Start of frame interrupt mask
SOFM : Boolean := False;
-- USB reset interrupt mask
RESETM : Boolean := False;
-- Suspend mode interrupt mask
SUSPM : Boolean := False;
-- Wakeup interrupt mask
WKUPM : Boolean := False;
-- Error interrupt mask
ERRM : Boolean := False;
-- Packet memory area over / underrun interrupt mask
PMAOVRM : Boolean := False;
-- Correct transfer interrupt mask
CTRM : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CNTR_Register use record
FRES at 0 range 0 .. 0;
PDWN at 0 range 1 .. 1;
LPMODE at 0 range 2 .. 2;
FSUSP at 0 range 3 .. 3;
RESUME at 0 range 4 .. 4;
L1RESUME at 0 range 5 .. 5;
Reserved_6_6 at 0 range 6 .. 6;
L1REQM at 0 range 7 .. 7;
ESOFM at 0 range 8 .. 8;
SOFM at 0 range 9 .. 9;
RESETM at 0 range 10 .. 10;
SUSPM at 0 range 11 .. 11;
WKUPM at 0 range 12 .. 12;
ERRM at 0 range 13 .. 13;
PMAOVRM at 0 range 14 .. 14;
CTRM at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype ISTR_EP_ID_Field is HAL.UInt4;
-- interrupt status register
type ISTR_Register is record
-- Read-only. Endpoint Identifier
EP_ID : ISTR_EP_ID_Field := 16#0#;
-- Read-only. Direction of transaction
DIR : Boolean := False;
-- unspecified
Reserved_5_6 : HAL.UInt2 := 16#0#;
-- LPM L1 state request
L1REQ : Boolean := False;
-- Expected start frame
ESOF : Boolean := False;
-- start of frame
SOF : Boolean := False;
-- reset request
RESET : Boolean := False;
-- Suspend mode request
SUSP : Boolean := False;
-- Wakeup
WKUP : Boolean := False;
-- Error
ERR : Boolean := False;
-- Packet memory area over / underrun
PMAOVR : Boolean := False;
-- Read-only. Correct transfer
CTR : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ISTR_Register use record
EP_ID at 0 range 0 .. 3;
DIR at 0 range 4 .. 4;
Reserved_5_6 at 0 range 5 .. 6;
L1REQ at 0 range 7 .. 7;
ESOF at 0 range 8 .. 8;
SOF at 0 range 9 .. 9;
RESET at 0 range 10 .. 10;
SUSP at 0 range 11 .. 11;
WKUP at 0 range 12 .. 12;
ERR at 0 range 13 .. 13;
PMAOVR at 0 range 14 .. 14;
CTR at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype FNR_FN_Field is HAL.UInt11;
subtype FNR_LSOF_Field is HAL.UInt2;
-- frame number register
type FNR_Register is record
-- Read-only. Frame number
FN : FNR_FN_Field;
-- Read-only. Lost SOF
LSOF : FNR_LSOF_Field;
-- Read-only. Locked
LCK : Boolean;
-- Read-only. Receive data - line status
RXDM : Boolean;
-- Read-only. Receive data + line status
RXDP : Boolean;
-- unspecified
Reserved_16_31 : HAL.UInt16;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for FNR_Register use record
FN at 0 range 0 .. 10;
LSOF at 0 range 11 .. 12;
LCK at 0 range 13 .. 13;
RXDM at 0 range 14 .. 14;
RXDP at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype DADDR_ADD_Field is HAL.UInt7;
-- device address
type DADDR_Register is record
-- Device address
ADD : DADDR_ADD_Field := 16#0#;
-- Enable function
EF : Boolean := False;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DADDR_Register use record
ADD at 0 range 0 .. 6;
EF at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype BTABLE_BTABLE_Field is HAL.UInt13;
-- Buffer table address
type BTABLE_Register is record
-- unspecified
Reserved_0_2 : HAL.UInt3 := 16#0#;
-- Buffer table
BTABLE : BTABLE_BTABLE_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BTABLE_Register use record
Reserved_0_2 at 0 range 0 .. 2;
BTABLE at 0 range 3 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype LPMCSR_BESL_Field is HAL.UInt4;
-- LPM control and status register
type LPMCSR_Register is record
-- LPM support enable
LPMEN : Boolean := False;
-- LPM Token acknowledge enable
LPMACK : Boolean := False;
-- unspecified
Reserved_2_2 : HAL.Bit := 16#0#;
-- Read-only. bRemoteWake value
REMWAKE : Boolean := False;
-- Read-only. BESL value
BESL : LPMCSR_BESL_Field := 16#0#;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for LPMCSR_Register use record
LPMEN at 0 range 0 .. 0;
LPMACK at 0 range 1 .. 1;
Reserved_2_2 at 0 range 2 .. 2;
REMWAKE at 0 range 3 .. 3;
BESL at 0 range 4 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- Battery charging detector
type BCDR_Register is record
-- Battery charging detector
BCDEN : Boolean := False;
-- Data contact detection
DCDEN : Boolean := False;
-- Primary detection
PDEN : Boolean := False;
-- Secondary detection
SDEN : Boolean := False;
-- Read-only. Data contact detection
DCDET : Boolean := False;
-- Read-only. Primary detection
PDET : Boolean := False;
-- Read-only. Secondary detection
SDET : Boolean := False;
-- Read-only. DM pull-up detection status
PS2DET : Boolean := False;
-- unspecified
Reserved_8_14 : HAL.UInt7 := 16#0#;
-- DP pull-up control
DPPU : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BCDR_Register use record
BCDEN at 0 range 0 .. 0;
DCDEN at 0 range 1 .. 1;
PDEN at 0 range 2 .. 2;
SDEN at 0 range 3 .. 3;
DCDET at 0 range 4 .. 4;
PDET at 0 range 5 .. 5;
SDET at 0 range 6 .. 6;
PS2DET at 0 range 7 .. 7;
Reserved_8_14 at 0 range 8 .. 14;
DPPU at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Universal serial bus full-speed device interface
type USB_Peripheral is record
-- endpoint 0 register
EP0R : aliased EP0R_Register;
-- endpoint 1 register
EP1R : aliased EP1R_Register;
-- endpoint 2 register
EP2R : aliased EP2R_Register;
-- endpoint 3 register
EP3R : aliased EP3R_Register;
-- endpoint 4 register
EP4R : aliased EP4R_Register;
-- endpoint 5 register
EP5R : aliased EP5R_Register;
-- endpoint 6 register
EP6R : aliased EP6R_Register;
-- endpoint 7 register
EP7R : aliased EP7R_Register;
-- control register
CNTR : aliased CNTR_Register;
-- interrupt status register
ISTR : aliased ISTR_Register;
-- frame number register
FNR : aliased FNR_Register;
-- device address
DADDR : aliased DADDR_Register;
-- Buffer table address
BTABLE : aliased BTABLE_Register;
-- LPM control and status register
LPMCSR : aliased LPMCSR_Register;
-- Battery charging detector
BCDR : aliased BCDR_Register;
end record
with Volatile;
for USB_Peripheral use record
EP0R at 16#0# range 0 .. 31;
EP1R at 16#4# range 0 .. 31;
EP2R at 16#8# range 0 .. 31;
EP3R at 16#C# range 0 .. 31;
EP4R at 16#10# range 0 .. 31;
EP5R at 16#14# range 0 .. 31;
EP6R at 16#18# range 0 .. 31;
EP7R at 16#1C# range 0 .. 31;
CNTR at 16#40# range 0 .. 31;
ISTR at 16#44# range 0 .. 31;
FNR at 16#48# range 0 .. 31;
DADDR at 16#4C# range 0 .. 31;
BTABLE at 16#50# range 0 .. 31;
LPMCSR at 16#54# range 0 .. 31;
BCDR at 16#58# range 0 .. 31;
end record;
-- Universal serial bus full-speed device interface
USB_FS_Periph : aliased USB_Peripheral
with Import, Address => System'To_Address (16#40006800#);
-- Universal serial bus full-speed device interface
USB_SRAM_Periph : aliased USB_Peripheral
with Import, Address => System'To_Address (16#40006C00#);
end STM32_SVD.USB;
| 35.060563 | 65 | 0.550516 |
2efc5aabc2994a655cf36e3e463b958b57d4591f | 44,080 | adb | Ada | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-coorma.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-coorma.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-coorma.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- A D A . C O N T A I N E R S . O R D E R E D _ M A P S --
-- --
-- B o d y --
-- --
-- Copyright (C) 2004-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/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
with Ada.Unchecked_Deallocation;
with Ada.Containers.Helpers; use Ada.Containers.Helpers;
with Ada.Containers.Red_Black_Trees.Generic_Operations;
pragma Elaborate_All (Ada.Containers.Red_Black_Trees.Generic_Operations);
with Ada.Containers.Red_Black_Trees.Generic_Keys;
pragma Elaborate_All (Ada.Containers.Red_Black_Trees.Generic_Keys);
with System; use type System.Address;
with System.Put_Images;
package body Ada.Containers.Ordered_Maps with
SPARK_Mode => Off
is
pragma Warnings (Off, "variable ""Busy*"" is not referenced");
pragma Warnings (Off, "variable ""Lock*"" is not referenced");
-- See comment in Ada.Containers.Helpers
-----------------------------
-- Node Access Subprograms --
-----------------------------
-- These subprograms provide a functional interface to access fields
-- of a node, and a procedural interface for modifying these values.
function Color (Node : Node_Access) return Color_Type;
pragma Inline (Color);
function Left (Node : Node_Access) return Node_Access;
pragma Inline (Left);
function Parent (Node : Node_Access) return Node_Access;
pragma Inline (Parent);
function Right (Node : Node_Access) return Node_Access;
pragma Inline (Right);
procedure Set_Parent (Node : Node_Access; Parent : Node_Access);
pragma Inline (Set_Parent);
procedure Set_Left (Node : Node_Access; Left : Node_Access);
pragma Inline (Set_Left);
procedure Set_Right (Node : Node_Access; Right : Node_Access);
pragma Inline (Set_Right);
procedure Set_Color (Node : Node_Access; Color : Color_Type);
pragma Inline (Set_Color);
-----------------------
-- Local Subprograms --
-----------------------
function Copy_Node (Source : Node_Access) return Node_Access;
pragma Inline (Copy_Node);
procedure Free (X : in out Node_Access);
function Is_Equal_Node_Node (L, R : Node_Access) return Boolean;
pragma Inline (Is_Equal_Node_Node);
function Is_Greater_Key_Node
(Left : Key_Type;
Right : Node_Access) return Boolean;
pragma Inline (Is_Greater_Key_Node);
function Is_Less_Key_Node
(Left : Key_Type;
Right : Node_Access) return Boolean;
pragma Inline (Is_Less_Key_Node);
--------------------------
-- Local Instantiations --
--------------------------
package Tree_Operations is
new Red_Black_Trees.Generic_Operations (Tree_Types);
procedure Delete_Tree is
new Tree_Operations.Generic_Delete_Tree (Free);
function Copy_Tree is
new Tree_Operations.Generic_Copy_Tree (Copy_Node, Delete_Tree);
use Tree_Operations;
package Key_Ops is
new Red_Black_Trees.Generic_Keys
(Tree_Operations => Tree_Operations,
Key_Type => Key_Type,
Is_Less_Key_Node => Is_Less_Key_Node,
Is_Greater_Key_Node => Is_Greater_Key_Node);
function Is_Equal is
new Tree_Operations.Generic_Equal (Is_Equal_Node_Node);
---------
-- "<" --
---------
function "<" (Left, Right : Cursor) return Boolean is
begin
if Checks and then Left.Node = null then
raise Constraint_Error with "Left cursor of ""<"" equals No_Element";
end if;
if Checks and then Right.Node = null then
raise Constraint_Error with "Right cursor of ""<"" equals No_Element";
end if;
pragma Assert (Vet (Left.Container.Tree, Left.Node),
"Left cursor of ""<"" is bad");
pragma Assert (Vet (Right.Container.Tree, Right.Node),
"Right cursor of ""<"" is bad");
return Left.Node.Key < Right.Node.Key;
end "<";
function "<" (Left : Cursor; Right : Key_Type) return Boolean is
begin
if Checks and then Left.Node = null then
raise Constraint_Error with "Left cursor of ""<"" equals No_Element";
end if;
pragma Assert (Vet (Left.Container.Tree, Left.Node),
"Left cursor of ""<"" is bad");
return Left.Node.Key < Right;
end "<";
function "<" (Left : Key_Type; Right : Cursor) return Boolean is
begin
if Checks and then Right.Node = null then
raise Constraint_Error with "Right cursor of ""<"" equals No_Element";
end if;
pragma Assert (Vet (Right.Container.Tree, Right.Node),
"Right cursor of ""<"" is bad");
return Left < Right.Node.Key;
end "<";
---------
-- "=" --
---------
function "=" (Left, Right : Map) return Boolean is
begin
return Is_Equal (Left.Tree, Right.Tree);
end "=";
---------
-- ">" --
---------
function ">" (Left, Right : Cursor) return Boolean is
begin
if Checks and then Left.Node = null then
raise Constraint_Error with "Left cursor of "">"" equals No_Element";
end if;
if Checks and then Right.Node = null then
raise Constraint_Error with "Right cursor of "">"" equals No_Element";
end if;
pragma Assert (Vet (Left.Container.Tree, Left.Node),
"Left cursor of "">"" is bad");
pragma Assert (Vet (Right.Container.Tree, Right.Node),
"Right cursor of "">"" is bad");
return Right.Node.Key < Left.Node.Key;
end ">";
function ">" (Left : Cursor; Right : Key_Type) return Boolean is
begin
if Checks and then Left.Node = null then
raise Constraint_Error with "Left cursor of "">"" equals No_Element";
end if;
pragma Assert (Vet (Left.Container.Tree, Left.Node),
"Left cursor of "">"" is bad");
return Right < Left.Node.Key;
end ">";
function ">" (Left : Key_Type; Right : Cursor) return Boolean is
begin
if Checks and then Right.Node = null then
raise Constraint_Error with "Right cursor of "">"" equals No_Element";
end if;
pragma Assert (Vet (Right.Container.Tree, Right.Node),
"Right cursor of "">"" is bad");
return Right.Node.Key < Left;
end ">";
------------
-- Adjust --
------------
procedure Adjust is
new Tree_Operations.Generic_Adjust (Copy_Tree);
procedure Adjust (Container : in out Map) is
begin
Adjust (Container.Tree);
end Adjust;
------------
-- Assign --
------------
procedure Assign (Target : in out Map; Source : Map) is
procedure Insert_Item (Node : Node_Access);
pragma Inline (Insert_Item);
procedure Insert_Items is
new Tree_Operations.Generic_Iteration (Insert_Item);
-----------------
-- Insert_Item --
-----------------
procedure Insert_Item (Node : Node_Access) is
begin
Target.Insert (Key => Node.Key, New_Item => Node.Element);
end Insert_Item;
-- Start of processing for Assign
begin
if Target'Address = Source'Address then
return;
end if;
Target.Clear;
Insert_Items (Source.Tree);
end Assign;
-------------
-- Ceiling --
-------------
function Ceiling (Container : Map; Key : Key_Type) return Cursor is
Node : constant Node_Access := Key_Ops.Ceiling (Container.Tree, Key);
begin
if Node = null then
return No_Element;
end if;
return Cursor'(Container'Unrestricted_Access, Node);
end Ceiling;
-----------
-- Clear --
-----------
procedure Clear is new Tree_Operations.Generic_Clear (Delete_Tree);
procedure Clear (Container : in out Map) is
begin
Clear (Container.Tree);
end Clear;
-----------
-- Color --
-----------
function Color (Node : Node_Access) return Color_Type is
begin
return Node.Color;
end Color;
------------------------
-- Constant_Reference --
------------------------
function Constant_Reference
(Container : aliased Map;
Position : Cursor) return Constant_Reference_Type
is
begin
if Checks and then Position.Container = null then
raise Constraint_Error with
"Position cursor has no element";
end if;
if Checks and then Position.Container /= Container'Unrestricted_Access
then
raise Program_Error with
"Position cursor designates wrong map";
end if;
pragma Assert (Vet (Container.Tree, Position.Node),
"Position cursor in Constant_Reference is bad");
declare
T : Tree_Type renames Position.Container.all.Tree;
TC : constant Tamper_Counts_Access :=
T.TC'Unrestricted_Access;
begin
return R : constant Constant_Reference_Type :=
(Element => Position.Node.Element'Access,
Control => (Controlled with TC))
do
Busy (TC.all);
end return;
end;
end Constant_Reference;
function Constant_Reference
(Container : aliased Map;
Key : Key_Type) return Constant_Reference_Type
is
Node : constant Node_Access := Key_Ops.Find (Container.Tree, Key);
begin
if Checks and then Node = null then
raise Constraint_Error with "key not in map";
end if;
declare
T : Tree_Type renames Container'Unrestricted_Access.all.Tree;
TC : constant Tamper_Counts_Access :=
T.TC'Unrestricted_Access;
begin
return R : constant Constant_Reference_Type :=
(Element => Node.Element'Access,
Control => (Controlled with TC))
do
Busy (TC.all);
end return;
end;
end Constant_Reference;
--------------
-- Contains --
--------------
function Contains (Container : Map; Key : Key_Type) return Boolean is
begin
return Find (Container, Key) /= No_Element;
end Contains;
----------
-- Copy --
----------
function Copy (Source : Map) return Map is
begin
return Target : Map do
Target.Assign (Source);
end return;
end Copy;
---------------
-- Copy_Node --
---------------
function Copy_Node (Source : Node_Access) return Node_Access is
Target : constant Node_Access :=
new Node_Type'(Color => Source.Color,
Key => Source.Key,
Element => Source.Element,
Parent => null,
Left => null,
Right => null);
begin
return Target;
end Copy_Node;
------------
-- Delete --
------------
procedure Delete (Container : in out Map; Position : in out Cursor) is
Tree : Tree_Type renames Container.Tree;
begin
if Checks and then Position.Node = null then
raise Constraint_Error with
"Position cursor of Delete equals No_Element";
end if;
if Checks and then Position.Container /= Container'Unrestricted_Access
then
raise Program_Error with
"Position cursor of Delete designates wrong map";
end if;
pragma Assert (Vet (Tree, Position.Node),
"Position cursor of Delete is bad");
Tree_Operations.Delete_Node_Sans_Free (Tree, Position.Node);
Free (Position.Node);
Position.Container := null;
end Delete;
procedure Delete (Container : in out Map; Key : Key_Type) is
X : Node_Access := Key_Ops.Find (Container.Tree, Key);
begin
if Checks and then X = null then
raise Constraint_Error with "key not in map";
end if;
Tree_Operations.Delete_Node_Sans_Free (Container.Tree, X);
Free (X);
end Delete;
------------------
-- Delete_First --
------------------
procedure Delete_First (Container : in out Map) is
X : Node_Access := Container.Tree.First;
begin
if X /= null then
Tree_Operations.Delete_Node_Sans_Free (Container.Tree, X);
Free (X);
end if;
end Delete_First;
-----------------
-- Delete_Last --
-----------------
procedure Delete_Last (Container : in out Map) is
X : Node_Access := Container.Tree.Last;
begin
if X /= null then
Tree_Operations.Delete_Node_Sans_Free (Container.Tree, X);
Free (X);
end if;
end Delete_Last;
-------------
-- Element --
-------------
function Element (Position : Cursor) return Element_Type is
begin
if Checks and then Position.Node = null then
raise Constraint_Error with
"Position cursor of function Element equals No_Element";
end if;
if Checks
and then (Left (Position.Node) = Position.Node
or else
Right (Position.Node) = Position.Node)
then
raise Program_Error with "dangling cursor";
end if;
pragma Assert (Vet (Position.Container.Tree, Position.Node),
"Position cursor of function Element is bad");
return Position.Node.Element;
end Element;
function Element (Container : Map; Key : Key_Type) return Element_Type is
Node : constant Node_Access := Key_Ops.Find (Container.Tree, Key);
begin
if Checks and then Node = null then
raise Constraint_Error with "key not in map";
end if;
return Node.Element;
end Element;
---------------------
-- Equivalent_Keys --
---------------------
function Equivalent_Keys (Left, Right : Key_Type) return Boolean is
begin
if Left < Right
or else Right < Left
then
return False;
else
return True;
end if;
end Equivalent_Keys;
-------------
-- Exclude --
-------------
procedure Exclude (Container : in out Map; Key : Key_Type) is
X : Node_Access := Key_Ops.Find (Container.Tree, Key);
begin
if X /= null then
Tree_Operations.Delete_Node_Sans_Free (Container.Tree, X);
Free (X);
end if;
end Exclude;
--------------
-- Finalize --
--------------
procedure Finalize (Object : in out Iterator) is
begin
if Object.Container /= null then
Unbusy (Object.Container.Tree.TC);
end if;
end Finalize;
----------
-- Find --
----------
function Find (Container : Map; Key : Key_Type) return Cursor is
Node : constant Node_Access := Key_Ops.Find (Container.Tree, Key);
begin
return (if Node = null then No_Element
else Cursor'(Container'Unrestricted_Access, Node));
end Find;
-----------
-- First --
-----------
function First (Container : Map) return Cursor is
T : Tree_Type renames Container.Tree;
begin
if T.First = null then
return No_Element;
else
return Cursor'(Container'Unrestricted_Access, T.First);
end if;
end First;
function First (Object : Iterator) return Cursor is
begin
-- The value of the iterator object's Node component influences the
-- behavior of the First (and Last) selector function.
-- When the Node component is null, this means the iterator object was
-- constructed without a start expression, in which case the (forward)
-- iteration starts from the (logical) beginning of the entire sequence
-- of items (corresponding to Container.First, for a forward iterator).
-- Otherwise, this is iteration over a partial sequence of items. When
-- the Node component is non-null, the iterator object was constructed
-- with a start expression, that specifies the position from which the
-- (forward) partial iteration begins.
if Object.Node = null then
return Object.Container.First;
else
return Cursor'(Object.Container, Object.Node);
end if;
end First;
-------------------
-- First_Element --
-------------------
function First_Element (Container : Map) return Element_Type is
T : Tree_Type renames Container.Tree;
begin
if Checks and then T.First = null then
raise Constraint_Error with "map is empty";
end if;
return T.First.Element;
end First_Element;
---------------
-- First_Key --
---------------
function First_Key (Container : Map) return Key_Type is
T : Tree_Type renames Container.Tree;
begin
if Checks and then T.First = null then
raise Constraint_Error with "map is empty";
end if;
return T.First.Key;
end First_Key;
-----------
-- Floor --
-----------
function Floor (Container : Map; Key : Key_Type) return Cursor is
Node : constant Node_Access := Key_Ops.Floor (Container.Tree, Key);
begin
if Node = null then
return No_Element;
else
return Cursor'(Container'Unrestricted_Access, Node);
end if;
end Floor;
----------
-- Free --
----------
procedure Free (X : in out Node_Access) is
procedure Deallocate is
new Ada.Unchecked_Deallocation (Node_Type, Node_Access);
begin
if X = null then
return;
end if;
X.Parent := X;
X.Left := X;
X.Right := X;
Deallocate (X);
end Free;
------------------------
-- Get_Element_Access --
------------------------
function Get_Element_Access
(Position : Cursor) return not null Element_Access is
begin
return Position.Node.Element'Access;
end Get_Element_Access;
-----------------
-- Has_Element --
-----------------
function Has_Element (Position : Cursor) return Boolean is
begin
return Position /= No_Element;
end Has_Element;
-------------
-- Include --
-------------
procedure Include
(Container : in out Map;
Key : Key_Type;
New_Item : Element_Type)
is
Position : Cursor;
Inserted : Boolean;
begin
Insert (Container, Key, New_Item, Position, Inserted);
if not Inserted then
TE_Check (Container.Tree.TC);
Position.Node.Key := Key;
Position.Node.Element := New_Item;
end if;
end Include;
------------
-- Insert --
------------
procedure Insert
(Container : in out Map;
Key : Key_Type;
New_Item : Element_Type;
Position : out Cursor;
Inserted : out Boolean)
is
function New_Node return Node_Access;
pragma Inline (New_Node);
procedure Insert_Post is
new Key_Ops.Generic_Insert_Post (New_Node);
procedure Insert_Sans_Hint is
new Key_Ops.Generic_Conditional_Insert (Insert_Post);
--------------
-- New_Node --
--------------
function New_Node return Node_Access is
begin
return new Node_Type'(Key => Key,
Element => New_Item,
Color => Red_Black_Trees.Red,
Parent => null,
Left => null,
Right => null);
end New_Node;
-- Start of processing for Insert
begin
Insert_Sans_Hint
(Container.Tree,
Key,
Position.Node,
Inserted);
Position.Container := Container'Unrestricted_Access;
end Insert;
procedure Insert
(Container : in out Map;
Key : Key_Type;
New_Item : Element_Type)
is
Position : Cursor;
pragma Unreferenced (Position);
Inserted : Boolean;
begin
Insert (Container, Key, New_Item, Position, Inserted);
if Checks and then not Inserted then
raise Constraint_Error with "key already in map";
end if;
end Insert;
procedure Insert
(Container : in out Map;
Key : Key_Type;
Position : out Cursor;
Inserted : out Boolean)
is
function New_Node return Node_Access;
pragma Inline (New_Node);
procedure Insert_Post is
new Key_Ops.Generic_Insert_Post (New_Node);
procedure Insert_Sans_Hint is
new Key_Ops.Generic_Conditional_Insert (Insert_Post);
--------------
-- New_Node --
--------------
function New_Node return Node_Access is
begin
return new Node_Type'(Key => Key,
Element => <>,
Color => Red_Black_Trees.Red,
Parent => null,
Left => null,
Right => null);
end New_Node;
-- Start of processing for Insert
begin
Insert_Sans_Hint
(Container.Tree,
Key,
Position.Node,
Inserted);
Position.Container := Container'Unrestricted_Access;
end Insert;
--------------
-- Is_Empty --
--------------
function Is_Empty (Container : Map) return Boolean is
begin
return Container.Tree.Length = 0;
end Is_Empty;
------------------------
-- Is_Equal_Node_Node --
------------------------
function Is_Equal_Node_Node
(L, R : Node_Access) return Boolean
is
begin
if L.Key < R.Key then
return False;
elsif R.Key < L.Key then
return False;
else
return L.Element = R.Element;
end if;
end Is_Equal_Node_Node;
-------------------------
-- Is_Greater_Key_Node --
-------------------------
function Is_Greater_Key_Node
(Left : Key_Type;
Right : Node_Access) return Boolean
is
begin
-- Left > Right same as Right < Left
return Right.Key < Left;
end Is_Greater_Key_Node;
----------------------
-- Is_Less_Key_Node --
----------------------
function Is_Less_Key_Node
(Left : Key_Type;
Right : Node_Access) return Boolean
is
begin
return Left < Right.Key;
end Is_Less_Key_Node;
-------------
-- Iterate --
-------------
procedure Iterate
(Container : Map;
Process : not null access procedure (Position : Cursor))
is
procedure Process_Node (Node : Node_Access);
pragma Inline (Process_Node);
procedure Local_Iterate is
new Tree_Operations.Generic_Iteration (Process_Node);
------------------
-- Process_Node --
------------------
procedure Process_Node (Node : Node_Access) is
begin
Process (Cursor'(Container'Unrestricted_Access, Node));
end Process_Node;
Busy : With_Busy (Container.Tree.TC'Unrestricted_Access);
-- Start of processing for Iterate
begin
Local_Iterate (Container.Tree);
end Iterate;
function Iterate
(Container : Map) return Map_Iterator_Interfaces.Reversible_Iterator'Class
is
begin
-- The value of the Node component influences the behavior of the First
-- and Last selector functions of the iterator object. When the Node
-- component is null (as is the case here), this means the iterator
-- object was constructed without a start expression. This is a
-- complete iterator, meaning that the iteration starts from the
-- (logical) beginning of the sequence of items.
-- Note: For a forward iterator, Container.First is the beginning, and
-- for a reverse iterator, Container.Last is the beginning.
return It : constant Iterator :=
(Limited_Controlled with
Container => Container'Unrestricted_Access,
Node => null)
do
Busy (Container.Tree.TC'Unrestricted_Access.all);
end return;
end Iterate;
function Iterate (Container : Map; Start : Cursor)
return Map_Iterator_Interfaces.Reversible_Iterator'Class
is
begin
-- It was formerly the case that when Start = No_Element, the partial
-- iterator was defined to behave the same as for a complete iterator,
-- and iterate over the entire sequence of items. However, those
-- semantics were unintuitive and arguably error-prone (it is too easy
-- to accidentally create an endless loop), and so they were changed,
-- per the ARG meeting in Denver on 2011/11. However, there was no
-- consensus about what positive meaning this corner case should have,
-- and so it was decided to simply raise an exception. This does imply,
-- however, that it is not possible to use a partial iterator to specify
-- an empty sequence of items.
if Checks and then Start = No_Element then
raise Constraint_Error with
"Start position for iterator equals No_Element";
end if;
if Checks and then Start.Container /= Container'Unrestricted_Access then
raise Program_Error with
"Start cursor of Iterate designates wrong map";
end if;
pragma Assert (Vet (Container.Tree, Start.Node),
"Start cursor of Iterate is bad");
-- The value of the Node component influences the behavior of the First
-- and Last selector functions of the iterator object. When the Node
-- component is non-null (as is the case here), it means that this
-- is a partial iteration, over a subset of the complete sequence of
-- items. The iterator object was constructed with a start expression,
-- indicating the position from which the iteration begins. Note that
-- the start position has the same value irrespective of whether this
-- is a forward or reverse iteration.
return It : constant Iterator :=
(Limited_Controlled with
Container => Container'Unrestricted_Access,
Node => Start.Node)
do
Busy (Container.Tree.TC'Unrestricted_Access.all);
end return;
end Iterate;
---------
-- Key --
---------
function Key (Position : Cursor) return Key_Type is
begin
if Checks and then Position.Node = null then
raise Constraint_Error with
"Position cursor of function Key equals No_Element";
end if;
pragma Assert (Vet (Position.Container.Tree, Position.Node),
"Position cursor of function Key is bad");
return Position.Node.Key;
end Key;
----------
-- Last --
----------
function Last (Container : Map) return Cursor is
T : Tree_Type renames Container.Tree;
begin
if T.Last = null then
return No_Element;
else
return Cursor'(Container'Unrestricted_Access, T.Last);
end if;
end Last;
function Last (Object : Iterator) return Cursor is
begin
-- The value of the iterator object's Node component influences the
-- behavior of the Last (and First) selector function.
-- When the Node component is null, this means the iterator object was
-- constructed without a start expression, in which case the (reverse)
-- iteration starts from the (logical) beginning of the entire sequence
-- (corresponding to Container.Last, for a reverse iterator).
-- Otherwise, this is iteration over a partial sequence of items. When
-- the Node component is non-null, the iterator object was constructed
-- with a start expression, that specifies the position from which the
-- (reverse) partial iteration begins.
if Object.Node = null then
return Object.Container.Last;
else
return Cursor'(Object.Container, Object.Node);
end if;
end Last;
------------------
-- Last_Element --
------------------
function Last_Element (Container : Map) return Element_Type is
T : Tree_Type renames Container.Tree;
begin
if Checks and then T.Last = null then
raise Constraint_Error with "map is empty";
end if;
return T.Last.Element;
end Last_Element;
--------------
-- Last_Key --
--------------
function Last_Key (Container : Map) return Key_Type is
T : Tree_Type renames Container.Tree;
begin
if Checks and then T.Last = null then
raise Constraint_Error with "map is empty";
end if;
return T.Last.Key;
end Last_Key;
----------
-- Left --
----------
function Left (Node : Node_Access) return Node_Access is
begin
return Node.Left;
end Left;
------------
-- Length --
------------
function Length (Container : Map) return Count_Type is
begin
return Container.Tree.Length;
end Length;
----------
-- Move --
----------
procedure Move is
new Tree_Operations.Generic_Move (Clear);
procedure Move (Target : in out Map; Source : in out Map) is
begin
Move (Target => Target.Tree, Source => Source.Tree);
end Move;
----------
-- Next --
----------
procedure Next (Position : in out Cursor) is
begin
Position := Next (Position);
end Next;
function Next (Position : Cursor) return Cursor is
begin
if Position = No_Element then
return No_Element;
end if;
pragma Assert (Vet (Position.Container.Tree, Position.Node),
"Position cursor of Next is bad");
declare
Node : constant Node_Access := Tree_Operations.Next (Position.Node);
begin
if Node = null then
return No_Element;
end if;
return Cursor'(Position.Container, Node);
end;
end Next;
function Next
(Object : Iterator;
Position : Cursor) return Cursor
is
begin
if Position.Container = null then
return No_Element;
end if;
if Checks and then Position.Container /= Object.Container then
raise Program_Error with
"Position cursor of Next designates wrong map";
end if;
return Next (Position);
end Next;
------------
-- Parent --
------------
function Parent (Node : Node_Access) return Node_Access is
begin
return Node.Parent;
end Parent;
--------------
-- Previous --
--------------
procedure Previous (Position : in out Cursor) is
begin
Position := Previous (Position);
end Previous;
function Previous (Position : Cursor) return Cursor is
begin
if Position = No_Element then
return No_Element;
end if;
pragma Assert (Vet (Position.Container.Tree, Position.Node),
"Position cursor of Previous is bad");
declare
Node : constant Node_Access :=
Tree_Operations.Previous (Position.Node);
begin
if Node = null then
return No_Element;
end if;
return Cursor'(Position.Container, Node);
end;
end Previous;
function Previous
(Object : Iterator;
Position : Cursor) return Cursor
is
begin
if Position.Container = null then
return No_Element;
end if;
if Checks and then Position.Container /= Object.Container then
raise Program_Error with
"Position cursor of Previous designates wrong map";
end if;
return Previous (Position);
end Previous;
----------------------
-- Pseudo_Reference --
----------------------
function Pseudo_Reference
(Container : aliased Map'Class) return Reference_Control_Type
is
TC : constant Tamper_Counts_Access :=
Container.Tree.TC'Unrestricted_Access;
begin
return R : constant Reference_Control_Type := (Controlled with TC) do
Busy (TC.all);
end return;
end Pseudo_Reference;
-------------------
-- Query_Element --
-------------------
procedure Query_Element
(Position : Cursor;
Process : not null access procedure (Key : Key_Type;
Element : Element_Type))
is
begin
if Checks and then Position.Node = null then
raise Constraint_Error with
"Position cursor of Query_Element equals No_Element";
end if;
pragma Assert (Vet (Position.Container.Tree, Position.Node),
"Position cursor of Query_Element is bad");
declare
T : Tree_Type renames Position.Container.Tree;
Lock : With_Lock (T.TC'Unrestricted_Access);
K : Key_Type renames Position.Node.Key;
E : Element_Type renames Position.Node.Element;
begin
Process (K, E);
end;
end Query_Element;
---------------
-- Put_Image --
---------------
procedure Put_Image
(S : in out Ada.Strings.Text_Buffers.Root_Buffer_Type'Class; V : Map)
is
First_Time : Boolean := True;
use System.Put_Images;
procedure Put_Key_Value (Position : Cursor);
procedure Put_Key_Value (Position : Cursor) is
begin
if First_Time then
First_Time := False;
else
Simple_Array_Between (S);
end if;
Key_Type'Put_Image (S, Key (Position));
Put_Arrow (S);
Element_Type'Put_Image (S, Element (Position));
end Put_Key_Value;
begin
Array_Before (S);
Iterate (V, Put_Key_Value'Access);
Array_After (S);
end Put_Image;
----------
-- Read --
----------
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Container : out Map)
is
function Read_Node
(Stream : not null access Root_Stream_Type'Class) return Node_Access;
pragma Inline (Read_Node);
procedure Read is
new Tree_Operations.Generic_Read (Clear, Read_Node);
---------------
-- Read_Node --
---------------
function Read_Node
(Stream : not null access Root_Stream_Type'Class) return Node_Access
is
Node : Node_Access := new Node_Type;
begin
Key_Type'Read (Stream, Node.Key);
Element_Type'Read (Stream, Node.Element);
return Node;
exception
when others =>
Free (Node);
raise;
end Read_Node;
-- Start of processing for Read
begin
Read (Stream, Container.Tree);
end Read;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Cursor)
is
begin
raise Program_Error with "attempt to stream map cursor";
end Read;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Reference_Type)
is
begin
raise Program_Error with "attempt to stream reference";
end Read;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Constant_Reference_Type)
is
begin
raise Program_Error with "attempt to stream reference";
end Read;
---------------
-- Reference --
---------------
function Reference
(Container : aliased in out Map;
Position : Cursor) return Reference_Type
is
begin
if Checks and then Position.Container = null then
raise Constraint_Error with
"Position cursor has no element";
end if;
if Checks and then Position.Container /= Container'Unrestricted_Access
then
raise Program_Error with
"Position cursor designates wrong map";
end if;
pragma Assert (Vet (Container.Tree, Position.Node),
"Position cursor in function Reference is bad");
declare
T : Tree_Type renames Position.Container.all.Tree;
TC : constant Tamper_Counts_Access :=
T.TC'Unrestricted_Access;
begin
return R : constant Reference_Type :=
(Element => Position.Node.Element'Access,
Control => (Controlled with TC))
do
Busy (TC.all);
end return;
end;
end Reference;
function Reference
(Container : aliased in out Map;
Key : Key_Type) return Reference_Type
is
Node : constant Node_Access := Key_Ops.Find (Container.Tree, Key);
begin
if Checks and then Node = null then
raise Constraint_Error with "key not in map";
end if;
declare
T : Tree_Type renames Container'Unrestricted_Access.all.Tree;
TC : constant Tamper_Counts_Access :=
T.TC'Unrestricted_Access;
begin
return R : constant Reference_Type :=
(Element => Node.Element'Access,
Control => (Controlled with TC))
do
Busy (TC.all);
end return;
end;
end Reference;
-------------
-- Replace --
-------------
procedure Replace
(Container : in out Map;
Key : Key_Type;
New_Item : Element_Type)
is
Node : constant Node_Access := Key_Ops.Find (Container.Tree, Key);
begin
TE_Check (Container.Tree.TC);
if Checks and then Node = null then
raise Constraint_Error with "key not in map";
end if;
Node.Key := Key;
Node.Element := New_Item;
end Replace;
---------------------
-- Replace_Element --
---------------------
procedure Replace_Element
(Container : in out Map;
Position : Cursor;
New_Item : Element_Type)
is
begin
TE_Check (Container.Tree.TC);
if Checks and then Position.Node = null then
raise Constraint_Error with
"Position cursor of Replace_Element equals No_Element";
end if;
if Checks and then Position.Container /= Container'Unrestricted_Access
then
raise Program_Error with
"Position cursor of Replace_Element designates wrong map";
end if;
pragma Assert (Vet (Container.Tree, Position.Node),
"Position cursor of Replace_Element is bad");
Position.Node.Element := New_Item;
end Replace_Element;
---------------------
-- Reverse_Iterate --
---------------------
procedure Reverse_Iterate
(Container : Map;
Process : not null access procedure (Position : Cursor))
is
procedure Process_Node (Node : Node_Access);
pragma Inline (Process_Node);
procedure Local_Reverse_Iterate is
new Tree_Operations.Generic_Reverse_Iteration (Process_Node);
------------------
-- Process_Node --
------------------
procedure Process_Node (Node : Node_Access) is
begin
Process (Cursor'(Container'Unrestricted_Access, Node));
end Process_Node;
Busy : With_Busy (Container.Tree.TC'Unrestricted_Access);
-- Start of processing for Reverse_Iterate
begin
Local_Reverse_Iterate (Container.Tree);
end Reverse_Iterate;
-----------
-- Right --
-----------
function Right (Node : Node_Access) return Node_Access is
begin
return Node.Right;
end Right;
---------------
-- Set_Color --
---------------
procedure Set_Color
(Node : Node_Access;
Color : Color_Type)
is
begin
Node.Color := Color;
end Set_Color;
--------------
-- Set_Left --
--------------
procedure Set_Left (Node : Node_Access; Left : Node_Access) is
begin
Node.Left := Left;
end Set_Left;
----------------
-- Set_Parent --
----------------
procedure Set_Parent (Node : Node_Access; Parent : Node_Access) is
begin
Node.Parent := Parent;
end Set_Parent;
---------------
-- Set_Right --
---------------
procedure Set_Right (Node : Node_Access; Right : Node_Access) is
begin
Node.Right := Right;
end Set_Right;
--------------------
-- Update_Element --
--------------------
procedure Update_Element
(Container : in out Map;
Position : Cursor;
Process : not null access procedure (Key : Key_Type;
Element : in out Element_Type))
is
begin
if Checks and then Position.Node = null then
raise Constraint_Error with
"Position cursor of Update_Element equals No_Element";
end if;
if Checks and then Position.Container /= Container'Unrestricted_Access
then
raise Program_Error with
"Position cursor of Update_Element designates wrong map";
end if;
pragma Assert (Vet (Container.Tree, Position.Node),
"Position cursor of Update_Element is bad");
declare
T : Tree_Type renames Container.Tree;
Lock : With_Lock (T.TC'Unrestricted_Access);
K : Key_Type renames Position.Node.Key;
E : Element_Type renames Position.Node.Element;
begin
Process (K, E);
end;
end Update_Element;
-----------
-- Write --
-----------
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Container : Map)
is
procedure Write_Node
(Stream : not null access Root_Stream_Type'Class;
Node : Node_Access);
pragma Inline (Write_Node);
procedure Write is
new Tree_Operations.Generic_Write (Write_Node);
----------------
-- Write_Node --
----------------
procedure Write_Node
(Stream : not null access Root_Stream_Type'Class;
Node : Node_Access)
is
begin
Key_Type'Write (Stream, Node.Key);
Element_Type'Write (Stream, Node.Element);
end Write_Node;
-- Start of processing for Write
begin
Write (Stream, Container.Tree);
end Write;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Cursor)
is
begin
raise Program_Error with "attempt to stream map cursor";
end Write;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Reference_Type)
is
begin
raise Program_Error with "attempt to stream reference";
end Write;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Constant_Reference_Type)
is
begin
raise Program_Error with "attempt to stream reference";
end Write;
end Ada.Containers.Ordered_Maps;
| 27.584481 | 79 | 0.571801 |
384c36d9c751c7eb69bc4d19082670da9ac529d4 | 5,211 | ads | Ada | source/amf/utp/amf-internals-utp_get_timezone_actions.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/utp/amf-internals-utp_get_timezone_actions.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/utp/amf-internals-utp_get_timezone_actions.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 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.Internals.Utp_Elements;
with AMF.UML.Read_Structural_Feature_Actions;
with AMF.Utp.Get_Timezone_Actions;
with AMF.Visitors;
package AMF.Internals.Utp_Get_Timezone_Actions is
type Utp_Get_Timezone_Action_Proxy is
limited new AMF.Internals.Utp_Elements.Utp_Element_Proxy
and AMF.Utp.Get_Timezone_Actions.Utp_Get_Timezone_Action with null record;
overriding function Get_Base_Read_Structural_Feature_Action
(Self : not null access constant Utp_Get_Timezone_Action_Proxy)
return AMF.UML.Read_Structural_Feature_Actions.UML_Read_Structural_Feature_Action_Access;
-- Getter of GetTimezoneAction::base_ReadStructuralFeatureAction.
--
overriding procedure Set_Base_Read_Structural_Feature_Action
(Self : not null access Utp_Get_Timezone_Action_Proxy;
To : AMF.UML.Read_Structural_Feature_Actions.UML_Read_Structural_Feature_Action_Access);
-- Setter of GetTimezoneAction::base_ReadStructuralFeatureAction.
--
overriding procedure Enter_Element
(Self : not null access constant Utp_Get_Timezone_Action_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
overriding procedure Leave_Element
(Self : not null access constant Utp_Get_Timezone_Action_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
overriding procedure Visit_Element
(Self : not null access constant Utp_Get_Timezone_Action_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control);
end AMF.Internals.Utp_Get_Timezone_Actions;
| 60.593023 | 96 | 0.521973 |
38463ff6df0068bbe8eb1d7d97091fbc6fa0365b | 31,826 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/sem_attr.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/sem_attr.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/sem_attr.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S E M _ A T T R --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2016, 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 along --
-- with this program; see file COPYING3. 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. --
-- --
------------------------------------------------------------------------------
-- Attribute handling is isolated in a separate package to ease the addition
-- of implementation defined attributes. Logically this processing belongs
-- in chapter 4. See Sem_Ch4 for a description of the relation of the
-- Analyze and Resolve routines for expression components.
-- This spec also documents all GNAT implementation defined pragmas
with Exp_Tss; use Exp_Tss;
with Namet; use Namet;
with Snames; use Snames;
with Types; use Types;
package Sem_Attr is
-----------------------------------------
-- Implementation Dependent Attributes --
-----------------------------------------
-- This section describes the implementation dependent attributes provided
-- in GNAT, as well as constructing an array of flags indicating which
-- attributes these are.
Attribute_Impl_Def : constant Attribute_Class_Array :=
Attribute_Class_Array'(
------------------
-- Abort_Signal --
------------------
Attribute_Abort_Signal => True,
-- Standard'Abort_Signal (Standard is the only allowed prefix) provides
-- the entity for the special exception used to signal task abort or
-- asynchronous transfer of control. Normally this attribute should only
-- be used in the tasking runtime (it is highly peculiar, and completely
-- outside the normal semantics of Ada, for a user program to intercept
-- the abort exception).
------------------
-- Address_Size --
------------------
Attribute_Address_Size => True,
-- Standard'Address_Size (Standard is the only allowed prefix) is
-- a static constant giving the number of bits in an Address. It
-- is used primarily for constructing the definition of Memory_Size
-- in package Standard, but may be freely used in user programs.
-- This is a static attribute.
---------------
-- Asm_Input --
---------------
Attribute_Asm_Input => True,
-- Used only in conjunction with the Asm subprograms in package
-- Machine_Code to construct machine instructions. See documentation
-- in package Machine_Code in file s-maccod.ads.
----------------
-- Asm_Output --
----------------
Attribute_Asm_Output => True,
-- Used only in conjunction with the Asm subprograms in package
-- Machine_Code to construct machine instructions. See documentation
-- in package Machine_Code in file s-maccod.ads.
---------
-- Bit --
---------
Attribute_Bit => True,
-- Obj'Bit, where Obj is any object, yields the bit offset within the
-- storage unit (byte) that contains the first bit of storage allocated
-- for the object. The attribute value is of type Universal_Integer,
-- and is always a non-negative number not exceeding the value of
-- System.Storage_Unit.
--
-- For an object that is a variable or a constant allocated in a
-- register, the value is zero. (The use of this attribute does not
-- force the allocation of a variable to memory).
--
-- For an object that is a formal parameter, this attribute applies to
-- either the matching actual parameter or to a copy of the matching
-- actual parameter.
--
-- For an access object the value is zero. Note that Obj.all'Bit is
-- subject to an Access_Check for the designated object. Similarly
-- for a record component X.C'Bit is subject to a discriminant check
-- and X(I).Bit and X(I1..I2)'Bit are subject to index checks.
--
-- This attribute is designed to be compatible with the DEC Ada
-- definition and implementation of the Bit attribute.
------------------
-- Code_Address --
------------------
Attribute_Code_Address => True,
-- The reference subp'Code_Address, where subp is a subprogram entity,
-- gives the address of the first generated instruction for the sub-
-- program. This is often, but not always the same as the 'Address
-- value, which is the address to be used in a call. The differences
-- occur in the case of a nested procedure (where Address yields the
-- address of the trampoline code used to load the static link), and on
-- some systems which use procedure descriptors (in which case Address
-- yields the address of the descriptor).
-----------------------
-- Default_Bit_Order --
-----------------------
Attribute_Default_Bit_Order => True,
-- Standard'Default_Bit_Order (Standard is the only permissible prefix)
-- provides the value System.Default_Bit_Order as a Pos value (0 for
-- High_Order_First, 1 for Low_Order_First). This is used to construct
-- the definition of Default_Bit_Order in package System. This is a
-- static attribute.
----------------------------------
-- Default_Scalar_Storage_Order --
----------------------------------
Attribute_Default_Scalar_Storage_Order => True,
-- Standard'Default_Scalar_Storage_Order (Standard is the
-- only permissible prefix) provides the current value of the
-- default scalar storage order (as specified using pragma
-- Default_Scalar_Storage_Order, or equal to Default_Bit_Order if
-- unspecified) as a System.Bit_Order value. This is a static attribute.
-----------
-- Deref --
-----------
Attribute_Deref => True,
-- typ'Deref (expr) is valid only if expr is of type System'Address.
-- The result is an object of type typ that is obtained by treating the
-- address as an access-to-typ value that points to the result. It is
-- basically equivalent to (atyp!expr).all where atyp is an access type
-- for the type.
---------------
-- Elab_Body --
---------------
Attribute_Elab_Body => True,
-- This attribute can only be applied to a program unit name. It
-- returns the entity for the corresponding elaboration procedure for
-- elaborating the body of the referenced unit. This is used in the main
-- generated elaboration procedure by the binder, and is not normally
-- used in any other context, but there may be specialized situations in
-- which it is useful to be able to call this elaboration procedure from
-- Ada code, e.g. if it is necessary to do selective reelaboration to
-- fix some error.
--------------------
-- Elab_Subp_Body --
--------------------
Attribute_Elab_Subp_Body => True,
-- This attribute can only be applied to a library level subprogram
-- name and is only relevant in CodePeer mode. It returns the entity
-- for the corresponding elaboration procedure for elaborating the body
-- of the referenced subprogram unit. This is used in the main generated
-- elaboration procedure by the binder in CodePeer mode only.
---------------
-- Elab_Spec --
---------------
Attribute_Elab_Spec => True,
-- This attribute can only be applied to a program unit name. It
-- returns the entity for the corresponding elaboration procedure for
-- elaborating the spec of the referenced unit. This is used in the main
-- generated elaboration procedure by the binder, and is not normally
-- used in any other context, but there may be specialized situations in
-- which it is useful to be able to call this elaboration procedure from
-- Ada code, e.g. if it is necessary to do selective reelaboration to
-- fix some error.
----------------
-- Elaborated --
----------------
Attribute_Elaborated => True,
-- Lunit'Elaborated, where Lunit is a library unit, yields a boolean
-- value indicating whether or not the body of the designated library
-- unit has been elaborated yet.
--------------
-- Enum_Rep --
--------------
Attribute_Enum_Rep => True,
-- For every enumeration subtype S, S'Enum_Rep denotes a function
-- with the following specification:
--
-- function S'Enum_Rep (Arg : S'Base) return universal_integer;
--
-- The function returns the representation value for the given
-- enumeration value. This will be equal to the 'Pos value in the
-- absence of an enumeration representation clause. This is a static
-- attribute (i.e. the result is static if the argument is static).
--------------
-- Enum_Val --
--------------
Attribute_Enum_Val => True,
-- For every enumeration subtype S, S'Enum_Val denotes a function with
-- the following specification:
--
-- function S'Enum_Val (Arg : universal_integer) return S'Base;
--
-- This function performs the inverse transformation to Enum_Rep. Given
-- a representation value for the type, it returns the corresponding
-- enumeration value. Constraint_Error is raised if no value of the
-- enumeration type corresponds to the given integer value.
-----------------------
-- Finalization_Size --
-----------------------
Attribute_Finalization_Size => True,
-- For every object or non-class-wide-type, Finalization_Size returns
-- the size of the hidden header used for finalization purposes as if
-- the object or type was allocated on the heap. The size of the header
-- does take into account any extra padding due to alignment issues.
-----------------
-- Fixed_Value --
-----------------
Attribute_Fixed_Value => True,
-- For every fixed-point type S, S'Fixed_Value denotes a function
-- with the following specification:
--
-- function S'Fixed_Value (Arg : universal_integer) return S;
--
-- The value returned is the fixed-point value V such that
--
-- V = Arg * S'Small
--
-- The effect is thus equivalent to first converting the argument to
-- the integer type used to represent S, and then doing an unchecked
-- conversion to the fixed-point type. This attribute is primarily
-- intended for use in implementation of the input-output functions
-- for fixed-point values.
-----------------------
-- Has_Discriminants --
-----------------------
Attribute_Has_Discriminants => True,
-- Gtyp'Has_Discriminants, where Gtyp is a generic formal type, yields
-- a Boolean value indicating whether or not the actual instantiation
-- type has discriminants.
---------
-- Img --
---------
Attribute_Img => True,
-- The 'Img function is defined for any prefix, P, that denotes an
-- object of scalar type T. P'Img is equivalent to T'Image (P). This
-- is convenient for debugging. For example:
--
-- Put_Line ("X = " & X'Img);
--
-- has the same meaning as the more verbose:
--
-- Put_Line ("X = " & Temperature_Type'Image (X));
--
-- where Temperature_Type is the subtype of the object X.
-------------------
-- Integer_Value --
-------------------
Attribute_Integer_Value => True,
-- For every integer type S, S'Integer_Value denotes a function
-- with the following specification:
--
-- function S'Integer_Value (Arg : universal_fixed) return S;
--
-- The value returned is the integer value V, such that
--
-- Arg = V * fixed-type'Small
--
-- The effect is thus equivalent to first doing an unchecked convert
-- from the fixed-point type to its corresponding implementation type,
-- and then converting the result to the target integer type. This
-- attribute is primarily intended for use in implementation of the
-- standard input-output functions for fixed-point values.
Attribute_Invalid_Value => True,
-- For every scalar type, S'Invalid_Value designates an undefined value
-- of the type. If possible this value is an invalid value, and in fact
-- is identical to the value that would be set if Initialize_Scalars
-- mode were in effect (including the behavior of its value on
-- environment variables or binder switches). The intended use is to
-- set a value where initialization is required (e.g. as a result of the
-- coding standards in use), but logically no initialization is needed,
-- and the value should never be accessed.
Attribute_Loop_Entry => True,
-- For every object of a non-limited type, S'Loop_Entry [(Loop_Name)]
-- denotes the constant value of prefix S at the point of entry into the
-- related loop. The type of the attribute is the type of the prefix.
------------------
-- Machine_Size --
------------------
Attribute_Machine_Size => True,
-- This attribute is identical to the Object_Size attribute. It is
-- provided for compatibility with the DEC attribute of this name.
-----------------------
-- Maximum_Alignment --
-----------------------
Attribute_Maximum_Alignment => True,
-- Standard'Maximum_Alignment (Standard is the only permissible prefix)
-- provides the maximum useful alignment value for the target. This is a
-- static value that can be used to specify the alignment for an object,
-- guaranteeing that it is properly aligned in all cases. The time this
-- is useful is when an external object is imported and its alignment
-- requirements are unknown. This is a static attribute.
--------------------
-- Mechanism_Code --
--------------------
Attribute_Mechanism_Code => True,
-- function'Mechanism_Code yields an integer code for the mechanism
-- used for the result of function, and subprogram'Mechanism_Code (n)
-- yields the mechanism used for formal parameter number n (a static
-- integer value, 1 = first parameter). The code returned is:
--
-- 1 = by copy (value)
-- 2 = by reference
-- 3 = by descriptor (default descriptor type)
-- 4 = by descriptor (UBS unaligned bit string)
-- 5 = by descriptor (UBSB aligned bit string with arbitrary bounds)
-- 6 = by descriptor (UBA unaligned bit array)
-- 7 = by descriptor (S string, also scalar access type parameter)
-- 8 = by descriptor (SB string with arbitrary bounds)
-- 9 = by descriptor (A contiguous array)
-- 10 = by descriptor (NCA non-contiguous array)
--------------------
-- Null_Parameter --
--------------------
Attribute_Null_Parameter => True,
-- A reference T'Null_Parameter denotes an (imaginary) object of type
-- or subtype T allocated at (machine) address zero. The attribute is
-- allowed only as the default expression of a formal parameter, or
-- as an actual expression of a subprogram call. In either case, the
-- subprogram must be imported.
--
-- The identity of the object is represented by the address zero in
-- the argument list, independent of the passing mechanism (explicit
-- or default).
--
-- The reason that this capability is needed is that for a record or
-- other composite object passed by reference, there is no other way
-- of specifying that a zero address should be passed.
-----------------
-- Object_Size --
-----------------
Attribute_Object_Size => True,
-- Type'Object_Size is the same as Type'Size for all types except
-- fixed-point types and discrete types. For fixed-point types and
-- discrete types, this attribute gives the size used for default
-- allocation of objects and components of the size. See section in
-- Einfo ("Handling of Type'Size values") for further details.
-------------------------
-- Passed_By_Reference --
-------------------------
Attribute_Passed_By_Reference => True,
-- T'Passed_By_Reference for any subtype T returns a boolean value that
-- is true if the type is normally passed by reference and false if the
-- type is normally passed by copy in calls. For scalar types, the
-- result is always False and is static. For non-scalar types, the
-- result is non-static (since it is computed by Gigi).
------------------
-- Range_Length --
------------------
Attribute_Range_Length => True,
-- T'Range_Length for any discrete type T yields the number of values
-- represented by the subtype (zero for a null range). The result is
-- static for static subtypes. Note that Range_Length applied to the
-- index subtype of a one dimensional array always gives the same result
-- as Range applied to the array itself. The result is of type universal
-- integer.
---------
-- Ref --
---------
Attribute_Ref => True,
-- System.Address'Ref (Address is the only permissible prefix) is
-- equivalent to System'To_Address, provided for compatibility with
-- other compilers.
------------------
-- Storage_Unit --
------------------
Attribute_Storage_Unit => True,
-- Standard'Storage_Unit (Standard is the only permissible prefix)
-- provides the value System.Storage_Unit, and is intended primarily
-- for constructing this definition in package System (see note above
-- in Default_Bit_Order description). The is a static attribute.
---------------
-- Stub_Type --
---------------
Attribute_Stub_Type => True,
-- The GNAT implementation of remote access-to-classwide types is
-- organised as described in AARM E.4(20.t): a value of an RACW type
-- (designating a remote object) is represented as a normal access
-- value, pointing to a "stub" object which in turn contains the
-- necessary information to contact the designated remote object. A
-- call on any dispatching operation of such a stub object does the
-- remote call, if necessary, using the information in the stub object
-- to locate the target partition, etc.
--
-- For a prefix T that denotes a remote access-to-classwide type,
-- T'Stub_Type denotes the type of the corresponding stub objects.
--
-- By construction, the layout of T'Stub_Type is identical to that of
-- System.Partition_Interface.RACW_Stub_Type (see implementation notes
-- in body of Exp_Dist).
-----------------
-- Target_Name --
-----------------
Attribute_Target_Name => True,
-- Standard'Target_Name yields the string identifying the target for the
-- compilation, taken from Sdefault.Target_Name.
----------------
-- To_Address --
----------------
Attribute_To_Address => True,
-- System'To_Address (System is the only permissible prefix) is a
-- function that takes any integer value, and converts it into an
-- address value. The semantics is to first convert the integer value to
-- type Integer_Address according to normal conversion rules, and then
-- to convert this to an address using the same semantics as the
-- System.Storage_Elements.To_Address function. The important difference
-- is that this is a static attribute so it can be used in
-- initializations in preelaborate packages.
----------------
-- Type_Class --
----------------
Attribute_Type_Class => True,
-- T'Type_Class for any type or subtype T yields the value of the type
-- class for the full type of T. If T is a generic formal type, then the
-- value is the value for the corresponding actual subtype. The value of
-- this attribute is of type System.Aux_DEC.Type_Class, which has the
-- following definition:
--
-- type Type_Class is
-- (Type_Class_Enumeration,
-- Type_Class_Integer,
-- Type_Class_Fixed_Point,
-- Type_Class_Floating_Point,
-- Type_Class_Array,
-- Type_Class_Record,
-- Type_Class_Access,
-- Type_Class_Task,
-- Type_Class_Address);
--
-- Protected types yield the value Type_Class_Task, which thus applies
-- to all concurrent types. This attribute is designed to be compatible
-- with the DEC Ada attribute of the same name.
--
-- Note: if pragma Extend_System is used to merge the definitions of
-- Aux_DEC into System, then the type Type_Class can be referenced
-- as an entity within System, as can its enumeration literals.
------------------------------
-- Universal_Literal_String --
------------------------------
Attribute_Universal_Literal_String => True,
-- The prefix of 'Universal_Literal_String must be a named number.
-- The static result is the string consisting of the characters of
-- the number as defined in the original source. This allows the
-- user program to access the actual text of named numbers without
-- intermediate conversions and without the need to enclose the
-- strings in quotes (which would preclude their use as numbers).
-------------------------
-- Unrestricted_Access --
-------------------------
Attribute_Unrestricted_Access => True,
-- The Unrestricted_Access attribute is similar to Access except that
-- all accessibility and aliased view checks are omitted. This is very
-- much a user-beware attribute. Basically its status is very similar
-- to Address, for which it is a desirable replacement where the value
-- desired is an access type. In other words, its effect is identical
-- to first taking 'Address and then doing an unchecked conversion to
-- a desired access type. Note that in GNAT, but not necessarily in
-- other implementations, the use of static chains for inner level
-- subprograms means that Unrestricted_Access applied to a subprogram
-- yields a value that can be called as long as the subprogram is in
-- scope (normal Ada 95 accessibility rules restrict this usage).
---------------
-- VADS_Size --
---------------
Attribute_VADS_Size => True,
-- Typ'VADS_Size yields the Size value typically yielded by some Ada 83
-- compilers. The differences between VADS_Size and Size is that for
-- scalar types for which no Size has been specified, VADS_Size yields
-- the Object_Size rather than the Value_Size. For example, while
-- Natural'Size is typically 31, the value of Natural'VADS_Size is 32.
-- For all other types, Size and VADS_Size yield the same value.
-------------------
-- Valid_Scalars --
-------------------
Attribute_Valid_Scalars => True,
-- Obj'Valid_Scalars can be applied to any object. The result depends
-- on the type of the object:
--
-- For a scalar type, the result is the same as obj'Valid
--
-- For an array object, the result is True if the result of applying
-- Valid_Scalars to every component is True. For an empty array the
-- result is True.
--
-- For a record object, the result is True if the result of applying
-- Valid_Scalars to every component is True. For class-wide types,
-- only the components of the base type are checked. For variant
-- records, only the components actually present are checked. The
-- discriminants, if any, are also checked. If there are no components
-- or discriminants, the result is True.
--
-- For any other type that has discriminants, the result is True if
-- the result of applying Valid_Scalars to each discriminant is True.
--
-- For all other types, the result is always True
--
-- A warning is given for a trivially True result, when the attribute
-- is applied to an object that is not of scalar, array, or record
-- type, or in the composite case if no scalar subcomponents exist. For
-- a variant record, the warning is given only if none of the variants
-- have scalar subcomponents. In addition, the warning is suppressed
-- for private types, or generic formal types in an instance.
----------------
-- Value_Size --
----------------
Attribute_Value_Size => True,
-- Type'Value_Size is the number of bits required to represent value of
-- the given subtype. It is the same as Type'Size, but, unlike Size, may
-- be set for non-first subtypes. See section in Einfo ("Handling of
-- type'Size values") for further details.
---------------
-- Word_Size --
---------------
Attribute_Word_Size => True,
-- Standard'Word_Size (Standard is the only permissible prefix)
-- provides the value System.Word_Size, and is intended primarily
-- for constructing this definition in package System (see note above
-- in Default_Bit_Order description). This is a static attribute.
others => False);
-- The following table lists all attributes that yield a result of a
-- universal type.
Universal_Type_Attribute : constant array (Attribute_Id) of Boolean :=
(Attribute_Aft => True,
Attribute_Alignment => True,
Attribute_Component_Size => True,
Attribute_Count => True,
Attribute_Delta => True,
Attribute_Digits => True,
Attribute_Exponent => True,
Attribute_First_Bit => True,
Attribute_Fore => True,
Attribute_Last_Bit => True,
Attribute_Length => True,
Attribute_Machine_Emax => True,
Attribute_Machine_Emin => True,
Attribute_Machine_Mantissa => True,
Attribute_Machine_Radix => True,
Attribute_Max_Alignment_For_Allocation => True,
Attribute_Max_Size_In_Storage_Elements => True,
Attribute_Model_Emin => True,
Attribute_Model_Epsilon => True,
Attribute_Model_Mantissa => True,
Attribute_Model_Small => True,
Attribute_Modulus => True,
Attribute_Pos => True,
Attribute_Position => True,
Attribute_Safe_First => True,
Attribute_Safe_Last => True,
Attribute_Scale => True,
Attribute_Size => True,
Attribute_Small => True,
Attribute_Wide_Wide_Width => True,
Attribute_Wide_Width => True,
Attribute_Width => True,
others => False);
-----------------
-- Subprograms --
-----------------
procedure Analyze_Attribute (N : Node_Id);
-- Performs bottom up semantic analysis of an attribute. Note that the
-- parser has already checked that type returning attributes appear only
-- in appropriate contexts (i.e. in subtype marks, or as prefixes for
-- other attributes).
function Name_Implies_Lvalue_Prefix (Nam : Name_Id) return Boolean;
-- Determine whether the name of an attribute reference categorizes its
-- prefix as an lvalue. The following attributes fall under this bracket
-- by directly or indirectly modifying their prefixes.
-- Access
-- Address
-- Input
-- Read
-- Unchecked_Access
-- Unrestricted_Access
procedure Resolve_Attribute (N : Node_Id; Typ : Entity_Id);
-- Performs type resolution of attribute. If the attribute yields a
-- universal value, mark its type as that of the context. On the other
-- hand, if the context itself is universal (as in T'Val (T'Pos (X)), mark
-- the type as being the largest type of that class that can be used at
-- run-time. This is correct since either the value gets folded (in which
-- case it doesn't matter what type of the class we give if, since the
-- folding uses universal arithmetic anyway) or it doesn't get folded (in
-- which case it is going to be dealt with at runtime, and the largest type
-- is right).
function Stream_Attribute_Available
(Typ : Entity_Id;
Nam : TSS_Name_Type;
Partial_View : Entity_Id := Empty) return Boolean;
-- For a limited type Typ, return True if and only if the given attribute
-- is available. For Ada 2005, availability is defined by 13.13.2(36/1).
-- For Ada 95, an attribute is considered to be available if it has been
-- specified using an attribute definition clause for the type, or for its
-- full view, or for an ancestor of either. Parameter Partial_View is used
-- only internally, when checking for an attribute definition clause that
-- is not visible (Ada 95 only).
end Sem_Attr;
| 45.400856 | 79 | 0.592723 |
38bb979abfdeecbf325104b4606fd260204e8637 | 2,021 | ads | Ada | extern/gnat_sdl/gnat_sdl/src/umingw_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/umingw_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/umingw_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;
package umingw_h is
USE_u_u_UUIDOF : constant := 0; -- c:\home\ochem\install\bin\../lib/gcc/i686-pc-mingw32/4.7.3/../../../../i686-pc-mingw32/include/_mingw.h:83
WINVER : constant := 16#0502#; -- c:\home\ochem\install\bin\../lib/gcc/i686-pc-mingw32/4.7.3/../../../../i686-pc-mingw32/include/_mingw.h:248
subtype size_t is unsigned; -- c:\home\ochem\install\bin\../lib/gcc/i686-pc-mingw32/4.7.3/../../../../i686-pc-mingw32/include/_mingw.h:398
subtype ssize_t is int; -- c:\home\ochem\install\bin\../lib/gcc/i686-pc-mingw32/4.7.3/../../../../i686-pc-mingw32/include/_mingw.h:408
subtype intptr_t is int; -- c:\home\ochem\install\bin\../lib/gcc/i686-pc-mingw32/4.7.3/../../../../i686-pc-mingw32/include/_mingw.h:420
subtype uintptr_t is unsigned; -- c:\home\ochem\install\bin\../lib/gcc/i686-pc-mingw32/4.7.3/../../../../i686-pc-mingw32/include/_mingw.h:433
subtype ptrdiff_t is int; -- c:\home\ochem\install\bin\../lib/gcc/i686-pc-mingw32/4.7.3/../../../../i686-pc-mingw32/include/_mingw.h:446
subtype wint_t is unsigned_short; -- c:\home\ochem\install\bin\../lib/gcc/i686-pc-mingw32/4.7.3/../../../../i686-pc-mingw32/include/_mingw.h:462
subtype wctype_t is unsigned_short; -- c:\home\ochem\install\bin\../lib/gcc/i686-pc-mingw32/4.7.3/../../../../i686-pc-mingw32/include/_mingw.h:463
subtype errno_t is int; -- c:\home\ochem\install\bin\../lib/gcc/i686-pc-mingw32/4.7.3/../../../../i686-pc-mingw32/include/_mingw.h:482
subtype uu_time32_t is long; -- c:\home\ochem\install\bin\../lib/gcc/i686-pc-mingw32/4.7.3/../../../../i686-pc-mingw32/include/_mingw.h:487
subtype uu_time64_t is Long_Long_Integer; -- c:\home\ochem\install\bin\../lib/gcc/i686-pc-mingw32/4.7.3/../../../../i686-pc-mingw32/include/_mingw.h:492
subtype time_t is uu_time32_t; -- c:\home\ochem\install\bin\../lib/gcc/i686-pc-mingw32/4.7.3/../../../../i686-pc-mingw32/include/_mingw.h:498
end umingw_h;
| 56.138889 | 156 | 0.665512 |
9aaace30b8e2adb69174808be5c38f79d8c1ff5c | 4,352 | ads | Ada | awa/src/awa-wikis-documents.ads | Letractively/ada-awa | 3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe | [
"Apache-2.0"
] | null | null | null | awa/src/awa-wikis-documents.ads | Letractively/ada-awa | 3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe | [
"Apache-2.0"
] | null | null | null | awa/src/awa-wikis-documents.ads | Letractively/ada-awa | 3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- awa-wikis-documents -- Wiki module
-- Copyright (C) 2011, 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 Ada.Strings.Wide_Wide_Unbounded;
package AWA.Wikis.Documents is
pragma Preelaborate;
use Ada.Strings.Wide_Wide_Unbounded;
type Format_Type is (BOLD, ITALIC, CODE, SUPERSCRIPT, SUBSCRIPT, STRIKEOUT, PREFORMAT);
type Format_Map is array (Format_Type) of Boolean;
-- ------------------------------
-- Document reader
-- ------------------------------
type Document_Reader is limited interface;
type Document_Reader_Access is access all Document_Reader'Class;
-- Add a section header in the document.
procedure Add_Header (Document : in out Document_Reader;
Header : in Unbounded_Wide_Wide_String;
Level : in Positive) is abstract;
-- Add a line break (<br>).
procedure Add_Line_Break (Document : in out Document_Reader) is abstract;
-- Add a paragraph (<p>). Close the previous paragraph if any.
-- The paragraph must be closed at the next paragraph or next header.
procedure Add_Paragraph (Document : in out Document_Reader) is abstract;
-- Add a blockquote (<blockquote>). The level indicates the blockquote nested level.
-- The blockquote must be closed at the next header.
procedure Add_Blockquote (Document : in out Document_Reader;
Level : in Natural) is abstract;
-- Add a list item (<li>). Close the previous paragraph and list item if any.
-- The list item will be closed at the next list item, next paragraph or next header.
procedure Add_List_Item (Document : in out Document_Reader;
Level : in Positive;
Ordered : in Boolean) is abstract;
-- Add an horizontal rule (<hr>).
procedure Add_Horizontal_Rule (Document : in out Document_Reader) is abstract;
-- Add a link.
procedure Add_Link (Document : in out Document_Reader;
Name : in Unbounded_Wide_Wide_String;
Link : in Unbounded_Wide_Wide_String;
Language : in Unbounded_Wide_Wide_String;
Title : in Unbounded_Wide_Wide_String) is abstract;
-- Add an image.
procedure Add_Image (Document : in out Document_Reader;
Link : in Unbounded_Wide_Wide_String;
Alt : in Unbounded_Wide_Wide_String;
Position : in Unbounded_Wide_Wide_String;
Description : in Unbounded_Wide_Wide_String) is abstract;
-- Add a quote.
procedure Add_Quote (Document : in out Document_Reader;
Quote : in Unbounded_Wide_Wide_String;
Link : in Unbounded_Wide_Wide_String;
Language : in Unbounded_Wide_Wide_String) is abstract;
-- Add a text block with the given format.
procedure Add_Text (Document : in out Document_Reader;
Text : in Unbounded_Wide_Wide_String;
Format : in Format_Map) is abstract;
-- Add a text block that is pre-formatted.
procedure Add_Preformatted (Document : in out Document_Reader;
Text : in Unbounded_Wide_Wide_String;
Format : in Unbounded_Wide_Wide_String) is abstract;
-- Finish the document after complete wiki text has been parsed.
procedure Finish (Document : in out Document_Reader) is abstract;
end AWA.Wikis.Documents;
| 45.333333 | 90 | 0.616039 |
38081d34308a4fe0e3dab145c702ca4e0c77cb62 | 5,446 | adb | Ada | src/shared/generic/lsc-internal-ops32.adb | Componolit/libsparkcrypto | 8531a07b6e9f5eb33eae0fa32759b4cbd3509d95 | [
"OpenSSL",
"Unlicense"
] | 30 | 2018-05-18T09:11:50.000Z | 2021-05-18T16:29:14.000Z | src/shared/generic/lsc-internal-ops32.adb | Componolit/libsparkcrypto | 8531a07b6e9f5eb33eae0fa32759b4cbd3509d95 | [
"OpenSSL",
"Unlicense"
] | 15 | 2018-12-13T07:53:36.000Z | 2019-09-24T19:43:35.000Z | src/shared/generic/lsc-internal-ops32.adb | Componolit/libsparkcrypto | 8531a07b6e9f5eb33eae0fa32759b4cbd3509d95 | [
"OpenSSL",
"Unlicense"
] | 3 | 2019-04-04T17:41:29.000Z | 2021-05-07T22:28:46.000Z | -------------------------------------------------------------------------------
-- This file is part of libsparkcrypto.
--
-- Copyright (C) 2010, Alexander Senier
-- Copyright (C) 2010, secunet Security Networks AG
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
--
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
--
-- * Neither the name of the nor the names of its contributors may be used
-- to endorse or promote products derived from this software without
-- specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS
-- BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-- POSSIBILITY OF SUCH DAMAGE.
-------------------------------------------------------------------------------
package body LSC.Internal.Ops32 is
function Bytes_To_Word
(Byte0 : Types.Byte;
Byte1 : Types.Byte;
Byte2 : Types.Byte;
Byte3 : Types.Byte) return Types.Word32
is
begin
return Types.Byte_Array32_To_Word32 (Types.Byte_Array32_Type'(Byte3, Byte2, Byte1, Byte0));
end Bytes_To_Word;
----------------------------------------------------------------------------
function ByteX (Value : Types.Word32;
Position : Types.Byte_Array32_Index) return Types.Byte
is
Temp : Types.Byte_Array32_Type;
begin
Temp := Types.Word32_To_Byte_Array32 (Value);
return Temp (Position);
end ByteX;
----------------------------------------------------------------------------
function Byte0 (Value : Types.Word32) return Types.Byte
is
begin
return ByteX (Value, 3);
end Byte0;
----------------------------------------------------------------------------
function Byte1 (Value : Types.Word32) return Types.Byte
is
begin
return ByteX (Value, 2);
end Byte1;
----------------------------------------------------------------------------
function Byte2 (Value : Types.Word32) return Types.Byte
is
begin
return ByteX (Value, 1);
end Byte2;
----------------------------------------------------------------------------
function Byte3 (Value : Types.Word32) return Types.Byte
is
begin
return ByteX (Value, 0);
end Byte3;
----------------------------------------------------------------------------
function XOR2 (V0, V1 : Types.Word32) return Types.Word32
is
begin
return V0 xor V1;
end XOR2;
----------------------------------------------------------------------------
function XOR3 (V0, V1, V2 : Types.Word32) return Types.Word32
is
begin
return V0 xor V1 xor V2;
end XOR3;
----------------------------------------------------------------------------
function XOR4 (V0, V1, V2, V3 : Types.Word32) return Types.Word32
is
begin
return V0 xor V1 xor V2 xor V3;
end XOR4;
----------------------------------------------------------------------------
function XOR5 (V0, V1, V2, V3, V4 : Types.Word32) return Types.Word32
is
begin
return V0 xor V1 xor V2 xor V3 xor V4;
end XOR5;
----------------------------------------------------------------------------
procedure Block_XOR
(Left : in Types.Word32_Array_Type;
Right : in Types.Word32_Array_Type;
Result : out Types.Word32_Array_Type)
is
begin
for I in Types.Index range Result'First .. Result'Last
loop
Result (I) := XOR2 (Left (I), Right (I));
pragma Loop_Invariant
(for all Pos in Types.Index range Result'First .. I =>
(Result (Pos) = XOR2 (Left (Pos), Right (Pos))));
end loop;
end Block_XOR;
pragma Annotate
(GNATprove, False_Positive,
"""Result"" might not be initialized",
"Initialized in complete loop");
----------------------------------------------------------------------------
procedure Block_Copy
(Source : in Types.Word32_Array_Type;
Dest : in out Types.Word32_Array_Type)
is
begin
for I in Types.Index range Source'First .. Source'Last
loop
Dest (I) := Source (I);
pragma Loop_Invariant
(for all P in Types.Index range Source'First .. I =>
(Dest (P) = Source (P)));
end loop;
end Block_Copy;
end LSC.Internal.Ops32;
| 33.411043 | 97 | 0.535255 |
4be80377847794398d553c6d5cd55f70e33f22ed | 436 | ads | Ada | regtests/server/src/testapi.ads | My-Colaborations/swagger-ada | 95714e5369a45b65bb49e9c85a98ed3b319a2ecc | [
"Apache-2.0"
] | 17 | 2017-09-09T15:52:14.000Z | 2022-01-23T01:18:06.000Z | regtests/server/src/testapi.ads | My-Colaborations/swagger-ada | 95714e5369a45b65bb49e9c85a98ed3b319a2ecc | [
"Apache-2.0"
] | 13 | 2020-10-04T16:04:42.000Z | 2022-03-25T19:33:03.000Z | regtests/server/src/testapi.ads | My-Colaborations/swagger-ada | 95714e5369a45b65bb49e9c85a98ed3b319a2ecc | [
"Apache-2.0"
] | 4 | 2021-01-06T08:43:55.000Z | 2022-03-11T21:45:06.000Z | -- REST API Validation
-- API to validate
-- ------------ EDIT NOTE ------------
-- This file was generated with openapi-generator. You can modify it to implement
-- the server. After you modify this file, you should add the following line
-- to the .openapi-generator-ignore file:
--
-- src/testapi.ads
--
-- Then, you can drop this edit note comment.
-- ------------ EDIT NOTE ------------
package TestAPI is
end TestAPI;
| 29.066667 | 83 | 0.626147 |
38ded42c49cf5c26aee903fd274dcf4252ca7884 | 3,671 | ads | Ada | source/amf/uml/amf-uml-read_is_classified_object_actions-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-read_is_classified_object_actions-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-read_is_classified_object_actions-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.Read_Is_Classified_Object_Actions.Hash is
new AMF.Elements.Generic_Hash (UML_Read_Is_Classified_Object_Action, UML_Read_Is_Classified_Object_Action_Access);
| 73.42 | 116 | 0.412149 |
9ac1dccc57ec7301402bbd1d0a9274dcc1da9686 | 3,984 | ads | Ada | src/nanomsg-socket.ads | landgraf/nanomsg-ada | 6abe8f517c53b2d4c030c4e2736f883371ef9270 | [
"MIT"
] | 2 | 2015-07-28T19:47:19.000Z | 2020-05-29T06:49:50.000Z | src/nanomsg-socket.ads | landgraf/nanomsg-ada | 6abe8f517c53b2d4c030c4e2736f883371ef9270 | [
"MIT"
] | 2 | 2015-11-28T14:02:13.000Z | 2017-10-05T09:21:35.000Z | src/nanomsg-socket.ads | landgraf/nanomsg-ada | 6abe8f517c53b2d4c030c4e2736f883371ef9270 | [
"MIT"
] | null | null | null | -- The MIT License (MIT)
-- Copyright (c) 2015 Pavel Zhukov <[email protected]>
-- Permission is hereby granted, free of charge, to any person obtaining a copy
-- of this software and associated documentation files (the "Software"), to deal
-- in the Software without restriction, including without limitation the rights
-- to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
-- copies of the Software, and to permit persons to whom the Software is
-- furnished to do so, subject to the following conditions:
-- The above copyright notice and this permission notice shall be included in all
-- copies or substantial portions of the Software.
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
-- AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
-- OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
-- SOFTWARE.
with Nanomsg.Domains;
with Nanomsg.Messages;
with Nanomsg.Sockopt;
package Nanomsg.Socket is
Socket_Exception : exception;
type Socket_T is tagged private;
type Socket_Access_T is access all Socket_T;
function Is_Null (Obj : in Socket_T) return Boolean;
procedure Init (Obj : out Socket_T;
Domain : in Nanomsg.Domains.Domain_T;
Protocol : Protocol_T
)
with Post => not Obj.Is_Null;
procedure Close (Obj : in out Socket_T)
with Post => Obj.Is_Null;
procedure Bind (Obj : in out Socket_T;
Address : in String)
with Pre => not Obj.Is_Null;
procedure Connect (Obj : in out Socket_T;
Address : in String)
with Pre => not Obj.Is_Null;
function Get_Fd (Obj : in Socket_T) return Integer;
procedure Send (Obj : in Socket_T;
Message : Nanomsg.Messages.Message_T);
procedure Receive (Obj : in out Socket_T;
Message : out Nanomsg.Messages.Message_T;
Non_Blocking : in Boolean := False);
function Receive (Obj : in out Socket_T;
Message : out Nanomsg.Messages.Message_T;
Non_Blocking : in Boolean := False) return Natural;
procedure Delete_Endpoint (Obj : in out Socket_T);
function Get_Option (Obj : in Socket_T;
Level : in Nanomsg.Sockopt.Option_Level_T;
Name : in Nanomsg.Sockopt.Option_Type_T) return String;
function Get_Option (Obj : in Socket_T;
Level : in Nanomsg.Sockopt.Option_Level_T;
Name : in Nanomsg.Sockopt.Option_Type_T) return Natural;
procedure Set_Option (Obj : in out Socket_T;
Level : in Nanomsg.Sockopt.Option_Level_T;
Name : in Nanomsg.Sockopt.Option_Type_T;
Value : in Natural);
procedure Set_Option (Obj : in out Socket_T;
Level : in Nanomsg.Sockopt.Option_Level_T;
Name : in Nanomsg.Sockopt.Option_Type_T;
Value : in String);
function Is_Ready (Obj : in Socket_T;
To_Send : Boolean := False;
To_Receive : Boolean := True) return Boolean;
function "=" (Left, Right : in Socket_T) return Boolean;
private
type Socket_T is tagged record
Fd : Integer := -1; -- File Descriptor
Domain : Nanomsg.Domains.Domain_T;
Protocol : Protocol_T;
Endpoint : Integer := -1;
end record;
end Nanomsg.Socket;
| 40.653061 | 82 | 0.609689 |
adfcbda7f6ae724d294c995d644deedef4557063 | 3,095 | adb | Ada | st/src/driver.adb | MatrixMike/AdaDemo1 | cbf2ad5a05dc06a8ee11d0780c19f5fd74c8990a | [
"MIT"
] | 1 | 2019-06-27T12:58:28.000Z | 2019-06-27T12:58:28.000Z | st/src/driver.adb | MatrixMike/AdaDemo1 | cbf2ad5a05dc06a8ee11d0780c19f5fd74c8990a | [
"MIT"
] | null | null | null | st/src/driver.adb | MatrixMike/AdaDemo1 | cbf2ad5a05dc06a8ee11d0780c19f5fd74c8990a | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT EXAMPLE --
-- --
-- Copyright (C) 2014, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- 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 LEDs; use LEDs;
with Button; use Button;
with Ada.Real_Time; use Ada.Real_Time;
package body Driver is
type Index is mod 4;
Pattern : constant array (Index) of User_LED := (Orange, Red, Blue, Green);
-- The LEDs are not physically laid out "consecutively" in such a way that
-- we can simply go in enumeral order to get circular rotation. Thus we
-- define this mapping, using a consecutive index to get the physical LED
-- blinking order desired.
task body Controller is
Period : constant Time_Span := Milliseconds (100); -- arbitrary
Next_Start : Time := Clock;
Next_LED : Index := 0;
begin
loop
Off (Pattern (Next_LED));
if Button.Current_Direction = Clockwise then
Next_LED := Next_LED - 1;
else
Next_LED := Next_LED + 1;
end if;
On (Pattern (Next_LED));
Next_Start := Next_Start + Period;
delay until Next_Start;
end loop;
end Controller;
end Driver;
| 48.359375 | 78 | 0.42294 |
13a2c7e281c8afe387193d1f11796312d9bafc3a | 886 | ads | Ada | 3-mid/opengl/private/gl/source/gl_types.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/opengl/private/gl/source/gl_types.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/opengl/private/gl/source/gl_types.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | with
Interfaces.C,
System;
package GL_Types
--
-- Provides openGL types whose definitions may differ amongst platforms.
--
-- This file is generated by the 'generate_GL_types_Spec' tool.
--
is
pragma Pure;
use Interfaces;
subtype GLenum is C.unsigned;
subtype GLboolean is C.unsigned_char;
subtype GLbitfield is C.unsigned;
subtype GLvoid is system.Address;
subtype GLbyte is C.signed_char;
subtype GLshort is C.short;
subtype GLint is C.int;
subtype GLubyte is C.unsigned_char;
subtype GLushort is C.unsigned_short;
subtype GLuint is C.unsigned;
subtype GLsizei is C.int;
subtype GLfloat is C.C_float;
subtype GLclampf is C.C_float;
subtype GLdouble is C.double;
subtype GLclampd is C.double;
subtype GLchar is C.char;
subtype GLfixed is Integer_32;
end GL_Types;
| 26.058824 | 73 | 0.688488 |
1a32063d792e2b1f390f29fab02fb9b0d935aeb6 | 931 | adb | Ada | tests/combat-test_data-tests-guns_container-test_data.adb | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 80 | 2017-04-08T23:14:07.000Z | 2022-02-10T22:30:51.000Z | tests/combat-test_data-tests-guns_container-test_data.adb | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 89 | 2017-06-24T08:18:26.000Z | 2021-11-12T04:37:36.000Z | tests/combat-test_data-tests-guns_container-test_data.adb | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 9 | 2018-04-14T16:37:25.000Z | 2020-03-21T14:33:49.000Z | -- 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.
package body Combat.Test_Data.Tests.Guns_Container.Test_Data is
procedure Set_Up(Gnattest_T: in out Test) is
pragma Unreferenced(Gnattest_T);
begin
null;
end Set_Up;
procedure Tear_Down(Gnattest_T: in out Test) is
pragma Unreferenced(Gnattest_T);
begin
null;
end Tear_Down;
procedure User_Set_Up(Gnattest_T: in out New_Test) is
pragma Unreferenced(Gnattest_T);
begin
null;
end User_Set_Up;
procedure User_Tear_Down(Gnattest_T: in out New_Test) is
pragma Unreferenced(Gnattest_T);
begin
null;
end User_Tear_Down;
end Combat.Test_Data.Tests.Guns_Container.Test_Data;
| 28.212121 | 75 | 0.730397 |
2e32b53d7d0994bf36f4f2157467bed90039ac08 | 64 | ads | Ada | tests/tk-labelframe-test_data.ads | thindil/tashy2 | 43fcbadb33c0062b2c8d6138a8238441dec5fd80 | [
"Apache-2.0"
] | 2 | 2020-12-09T07:27:07.000Z | 2021-10-19T13:31:54.000Z | tests/tk-labelframe-test_data.ads | thindil/tashy2 | 43fcbadb33c0062b2c8d6138a8238441dec5fd80 | [
"Apache-2.0"
] | null | null | null | tests/tk-labelframe-test_data.ads | thindil/tashy2 | 43fcbadb33c0062b2c8d6138a8238441dec5fd80 | [
"Apache-2.0"
] | null | null | null | package Tk.Labelframe.Test_Data is
end Tk.Labelframe.Test_Data;
| 21.333333 | 34 | 0.84375 |
ad6cbc74e50d56e31128debf85eeca352a11e9cd | 3,869 | adb | Ada | source/web/tools/a2js/properties-expressions-allocation.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/web/tools/a2js/properties-expressions-allocation.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/web/tools/a2js/properties-expressions-allocation.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 © 2015, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with Asis.Expressions;
package body Properties.Expressions.Allocation is
----------
-- Code --
----------
function Code
(Engine : access Engines.Contexts.Context;
Element : Asis.Expression;
Name : Engines.Text_Property)
return League.Strings.Universal_String
is
Item : constant Asis.Expression :=
Asis.Expressions.Allocator_Qualified_Expression (Element);
begin
return Engine.Text.Get_Property (Item, Name);
end Code;
end Properties.Expressions.Allocation;
| 59.523077 | 78 | 0.422073 |
2268f5149ade774a24606fb25ace940f4391aebc | 1,514 | ada | Ada | Task/Ternary-logic/Ada/ternary-logic-2.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:38.000Z | 2018-11-09T22:08:38.000Z | Task/Ternary-logic/Ada/ternary-logic-2.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/Ternary-logic/Ada/ternary-logic-2.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:40.000Z | 2018-11-09T22:08:40.000Z | package body Logic is
-- type Ternary is (True, Unknown, False);
function Image(Value: Ternary) return Character is
begin
case Value is
when True => return 'T';
when False => return 'F';
when Unknown => return '?';
end case;
end Image;
function "and"(Left, Right: Ternary) return Ternary is
begin
return Ternary'max(Left, Right);
end "and";
function "or"(Left, Right: Ternary) return Ternary is
begin
return Ternary'min(Left, Right);
end "or";
function "not"(T: Ternary) return Ternary is
begin
case T is
when False => return True;
when Unknown => return Unknown;
when True => return False;
end case;
end "not";
function To_Bool(X: Ternary) return Boolean is
begin
case X is
when True => return True;
when False => return False;
when Unknown => raise Constraint_Error;
end case;
end To_Bool;
function To_Ternary(B: Boolean) return Ternary is
begin
if B then
return True;
else
return False;
end if;
end To_Ternary;
function Equivalent(Left, Right: Ternary) return Ternary is
begin
return To_Ternary(To_Bool(Left) = To_Bool(Right));
exception
when Constraint_Error => return Unknown;
end Equivalent;
function Implies(Condition, Conclusion: Ternary) return Ternary is
begin
return (not Condition) or Conclusion;
end Implies;
end Logic;
| 24.031746 | 69 | 0.616248 |
9a7e503e68c82155f487f17e0a4e60e99460c670 | 198 | ads | Ada | gb_01/src_alt1/root-child.ads | gerr135/gnat_bugs | e2e1c085c96919924c13bef99409766525a76712 | [
"Unlicense"
] | null | null | null | gb_01/src_alt1/root-child.ads | gerr135/gnat_bugs | e2e1c085c96919924c13bef99409766525a76712 | [
"Unlicense"
] | null | null | null | gb_01/src_alt1/root-child.ads | gerr135/gnat_bugs | e2e1c085c96919924c13bef99409766525a76712 | [
"Unlicense"
] | null | null | null | package root.child is
type Base_Type is abstract new Base_Interface with null record;
type Derived_Type is abstract new Base_Type and Derived_Interface with null record;
end root.child;
| 22 | 87 | 0.787879 |
2ea7ba01afaa2b22c708deddd6524c927285247e | 3,392 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c97201d.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/c97201d.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c97201d.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C97201D.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 RENDEZVOUS REQUESTED BY A CONDITIONAL_ENTRY_CALL
-- IS PERFORMED ONLY IF IMMEDIATELY POSSIBLE.
-- CASE D: THE BODY OF THE TASK CONTAINING THE CALLED ENTRY
-- DOES NOT CONTAIN AN ACCEPT_STATEMENT FOR THAT ENTRY -
-- AND THIS FACT IS DETERMINED STATICALLY.
-- RM 4/12/82
WITH REPORT; USE REPORT;
PROCEDURE C97201D IS
ELSE_BRANCH_TAKEN : BOOLEAN := FALSE ;
BEGIN
TEST ("C97201D", "CHECK THAT NO RENDEZVOUS REQUESTED BY" &
" A CONDITIONAL_ENTRY_CALL CAN EVER OCCUR" &
" IN THE ABSENCE OF A CORRESPONDING " &
" ACCEPT_STATEMENT " );
DECLARE
TASK T IS
ENTRY DO_IT_NOW_ORELSE ;
ENTRY KEEP_ALIVE ;
END T ;
TASK BODY T IS
BEGIN
-- NO ACCEPT_STATEMENT FOR THE ENTRY_CALL BEING TESTED
ACCEPT KEEP_ALIVE ; -- TO PREVENT 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
SELECT
T.DO_IT_NOW_ORELSE ;
ELSE -- (I.E. CALLER ADOPTS A NO-WAIT POLICY)
-- THEREFORE THIS BRANCH MUST BE CHOSEN
ELSE_BRANCH_TAKEN := TRUE ;
COMMENT( "ELSE_BRANCH TAKEN" );
END SELECT;
T.KEEP_ALIVE ; -- THIS ALSO UPDATES THE NONLOCALS
END; -- END OF BLOCK CONTAINING THE ENTRY CALL
-- BY NOW, THE TASK IS TERMINATED
IF ELSE_BRANCH_TAKEN THEN
NULL ;
ELSE
FAILED( "RENDEZVOUS ATTEMPTED?" );
END IF;
RESULT;
END C97201D ;
| 32.932039 | 79 | 0.548644 |
3857a0f97ef0c4d134efe8924f146e5fd93d0305 | 20,654 | adb | Ada | .emacs.d/elpa/wisi-3.1.3/wisitoken-bnf-output_ada.adb | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/wisi-3.1.3/wisitoken-bnf-output_ada.adb | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/wisi-3.1.3/wisitoken-bnf-output_ada.adb | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | -- Abstract :
--
-- Output Ada code implementing the grammar defined by input
-- parameters, and a parser for that grammar. The grammar parser
-- actions must be Ada.
--
-- Copyright (C) 2017 - 2020 Free Software Foundation, Inc.
--
-- The WisiToken package is free software; you can redistribute it
-- and/or modify it under terms of the GNU General Public License as
-- published by the Free Software Foundation; either version 3, or
-- (at your option) any later version. This library is distributed in
-- the hope that it will be useful, but WITHOUT ANY WARRANTY; without
-- even the implied warranty of 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.
pragma License (Modified_GPL);
with Ada.Strings.Fixed;
with Ada.Text_IO; use Ada.Text_IO;
with GNAT.Regexp;
with WisiToken.BNF.Generate_Packrat;
with WisiToken.BNF.Generate_Utils;
with WisiToken.BNF.Output_Ada_Common; use WisiToken.BNF.Output_Ada_Common;
with WisiToken.Generate.Packrat;
with WisiToken_Grammar_Runtime;
procedure WisiToken.BNF.Output_Ada
(Input_Data : in WisiToken_Grammar_Runtime.User_Data_Type;
Output_File_Name_Root : in String;
Generate_Data : aliased in WisiToken.BNF.Generate_Utils.Generate_Data;
Packrat_Data : in WisiToken.Generate.Packrat.Data;
Tuple : in Generate_Tuple;
Test_Main : in Boolean;
Multiple_Tuples : in Boolean)
is
Common_Data : Output_Ada_Common.Common_Data := WisiToken.BNF.Output_Ada_Common.Initialize
(Input_Data, Tuple, Output_File_Name_Root, Check_Interface => False);
Gen_Alg_Name : constant String :=
(if Test_Main or Multiple_Tuples
then "_" & Generate_Algorithm_Image (Common_Data.Generate_Algorithm).all
else "");
function Symbol_Regexp (Item : in String) return String
is begin
-- Return a regular expression string that matches Item as a symbol;
-- it must be preceded and followed by non-symbol characters.
--
-- GNAT.Regexp does not have a char for 'end of string', so we hope
-- that doesn't occur. Sigh.
return ".*[ (\.]" & Item & "[ );\.,].*";
end Symbol_Regexp;
procedure Create_Ada_Actions_Body
(Action_Names : not null access WisiToken.Names_Array_Array;
Check_Names : not null access WisiToken.Names_Array_Array;
Label_Count : in Ada.Containers.Count_Type;
Package_Name : in String)
is
use all type Ada.Containers.Count_Type;
use GNAT.Regexp;
use Generate_Utils;
use WisiToken.Generate;
File_Name : constant String := Output_File_Name_Root & "_actions.adb";
User_Data_Regexp : constant Regexp := Compile (Symbol_Regexp ("User_Data"), Case_Sensitive => False);
Tree_Regexp : constant Regexp := Compile (Symbol_Regexp ("Tree"), Case_Sensitive => False);
Nonterm_Regexp : constant Regexp := Compile (Symbol_Regexp ("Nonterm"), Case_Sensitive => False);
Tokens_Regexp : constant Regexp := Compile (Symbol_Regexp ("Tokens"), Case_Sensitive => False);
Body_File : File_Type;
begin
Create (Body_File, Out_File, File_Name);
Set_Output (Body_File);
Indent := 1;
Put_File_Header (Ada_Comment, Use_Tuple => True, Tuple => Tuple);
Put_Raw_Code (Ada_Comment, Input_Data.Raw_Code (Copyright_License));
Put_Raw_Code (Ada_Comment, Input_Data.Raw_Code (Actions_Body_Context));
New_Line;
if Label_Count > 0 then
Put_Line ("with SAL;");
end if;
Put_Line ("package body " & Package_Name & " is");
Indent := Indent + 3;
New_Line;
if Input_Data.Check_Count > 0 then
Indent_Line ("use WisiToken.Semantic_Checks;");
New_Line;
end if;
Put_Raw_Code (Ada_Comment, Input_Data.Raw_Code (Actions_Body_Pre));
-- generate Action and Check subprograms.
for Rule of Input_Data.Tokens.Rules loop
-- No need for a Token_Cursor here, since we only need the
-- nonterminals.
declare
use Ada.Strings.Unbounded;
LHS_ID : constant WisiToken.Token_ID := Find_Token_ID (Generate_Data, -Rule.Left_Hand_Side);
RHS_Index : Integer := 0;
function Is_Elisp (Action : in Unbounded_String) return Boolean
is begin
return Length (Action) >= 6 and then
(Slice (Action, 1, 6) = "(progn" or
Slice (Action, 1, 5) = "wisi-");
end Is_Elisp;
procedure Put_Labels (RHS : in RHS_Type; Line : in String)
is
Output : array (Rule.Labels.First_Index .. Rule.Labels.Last_Index) of Boolean := (others => False);
procedure Update_Output (Label : in String)
is begin
for I in Rule.Labels.First_Index .. Rule.Labels.Last_Index loop
if Label = Rule.Labels (I) then
Output (I) := True;
end if;
end loop;
end Update_Output;
begin
for I in RHS.Tokens.First_Index .. RHS.Tokens.Last_Index loop
if Length (RHS.Tokens (I).Label) > 0 then
declare
Label : constant String := -RHS.Tokens (I).Label;
begin
if Match (Line, Compile (Symbol_Regexp (Label), Case_Sensitive => False)) then
Indent_Line
(Label & " : constant SAL.Peek_Type :=" & SAL.Peek_Type'Image (I) & ";");
Update_Output (Label);
end if;
end;
end if;
end loop;
for I in Rule.Labels.First_Index .. Rule.Labels.Last_Index loop
if not Output (I) and
Match (Line, Compile (Symbol_Regexp (-Rule.Labels (I)), Case_Sensitive => False))
then
Indent_Line (-Rule.Labels (I) & " : constant SAL.Base_Peek_Type := SAL.Base_Peek_Type'First;");
end if;
end loop;
end Put_Labels;
begin
for RHS of Rule.Right_Hand_Sides loop
if Length (RHS.Action) > 0 and then not Is_Elisp (RHS.Action) then
declare
Line : constant String := -RHS.Action;
-- Actually multiple lines; we assume the formatting is adequate.
Name : constant String := Action_Names (LHS_ID)(RHS_Index).all;
Unref_User_Data : Boolean := True;
Unref_Tree : Boolean := True;
Unref_Nonterm : Boolean := True;
Unref_Tokens : Boolean := True;
Need_Comma : Boolean := False;
procedure Check_Unref (Line : in String)
is begin
if Match (Line, User_Data_Regexp) then
Unref_User_Data := False;
end if;
if Match (Line, Tree_Regexp) then
Unref_Tree := False;
end if;
if Match (Line, Nonterm_Regexp) then
Unref_Nonterm := False;
end if;
if Match (Line, Tokens_Regexp) then
Unref_Tokens := False;
end if;
end Check_Unref;
begin
Check_Unref (Line);
Indent_Line ("procedure " & Name);
Indent_Line (" (User_Data : in out WisiToken.Syntax_Trees.User_Data_Type'Class;");
Indent_Line (" Tree : in out WisiToken.Syntax_Trees.Tree;");
Indent_Line (" Nonterm : in WisiToken.Valid_Node_Index;");
Indent_Line (" Tokens : in WisiToken.Valid_Node_Index_Array)");
Indent_Line ("is");
Indent := Indent + 3;
if Unref_User_Data or Unref_Tree or Unref_Nonterm or Unref_Tokens then
Indent_Start ("pragma Unreferenced (");
if Unref_User_Data then
Put ("User_Data");
Need_Comma := True;
end if;
if Unref_Tree then
Put ((if Need_Comma then ", " else "") & "Tree");
Need_Comma := True;
end if;
if Unref_Nonterm then
Put ((if Need_Comma then ", " else "") & "Nonterm");
Need_Comma := True;
end if;
if Unref_Tokens then
Put ((if Need_Comma then ", " else "") & "Tokens");
Need_Comma := True;
end if;
Put_Line (");");
end if;
Put_Labels (RHS, Line);
Indent := Indent - 3;
Indent_Line ("begin");
Indent := Indent + 3;
Indent_Line (Line);
Indent := Indent - 3;
Indent_Line ("end " & Name & ";");
New_Line;
end;
end if;
if Length (RHS.Check) > 0 and then not Is_Elisp (RHS.Check) then
declare
use Ada.Strings.Fixed;
Line : constant String := -RHS.Check;
Name : constant String := Check_Names (LHS_ID)(RHS_Index).all;
Unref_Lexer : constant Boolean := 0 = Index (Line, "Lexer");
Unref_Nonterm : constant Boolean := 0 = Index (Line, "Nonterm");
Unref_Tokens : constant Boolean := 0 = Index (Line, "Tokens");
Unref_Recover : constant Boolean := 0 = Index (Line, "Recover_Active");
Need_Comma : Boolean := False;
begin
Indent_Line ("function " & Name);
Indent_Line (" (Lexer : access constant WisiToken.Lexer.Instance'Class;");
Indent_Line (" Nonterm : in out WisiToken.Recover_Token;");
Indent_Line (" Tokens : in WisiToken.Recover_Token_Array;");
Indent_Line (" Recover_Active : in Boolean)");
Indent_Line (" return WisiToken.Semantic_Checks.Check_Status");
Indent_Line ("is");
Indent := Indent + 3;
if Unref_Lexer or Unref_Nonterm or Unref_Tokens or Unref_Recover then
Indent_Start ("pragma Unreferenced (");
if Unref_Lexer then
Put ("Lexer");
Need_Comma := True;
end if;
if Unref_Nonterm then
Put ((if Need_Comma then ", " else "") & "Nonterm");
Need_Comma := True;
end if;
if Unref_Tokens then
Put ((if Need_Comma then ", " else "") & "Tokens");
Need_Comma := True;
end if;
if Unref_Recover then
Put ((if Need_Comma then ", " else "") & "Recover_Active");
Need_Comma := True;
end if;
Put_Line (");");
end if;
Put_Labels (RHS, Line);
Indent := Indent - 3;
Indent_Line ("begin");
Indent := Indent + 3;
Indent_Line (Line);
Indent := Indent - 3;
Indent_Line ("end " & Name & ";");
New_Line;
end;
end if;
RHS_Index := RHS_Index + 1;
end loop;
end;
end loop;
Put_Raw_Code (Ada_Comment, Input_Data.Raw_Code (Actions_Body_Post));
Put_Line ("end " & Package_Name & ";");
Close (Body_File);
Set_Output (Standard_Output);
end Create_Ada_Actions_Body;
procedure Create_Ada_Main_Body
(Actions_Package_Name : in String;
Main_Package_Name : in String)
is
use WisiToken.Generate;
File_Name : constant String := To_Lower (Main_Package_Name) & ".adb";
re2c_Package_Name : constant String := -Common_Data.Lower_File_Name_Root & "_re2c_c";
Body_File : File_Type;
begin
Create (Body_File, Out_File, File_Name);
Set_Output (Body_File);
Indent := 1;
Put_File_Header (Ada_Comment, Use_Tuple => True, Tuple => Tuple);
Put_Raw_Code (Ada_Comment, Input_Data.Raw_Code (Copyright_License));
New_Line;
if (case Common_Data.Generate_Algorithm is
when LR_Generate_Algorithm => Input_Data.Action_Count > 0 or Input_Data.Check_Count > 0,
when Packrat_Generate_Algorithm | External => Input_Data.Action_Count > 0)
then
Put_Line ("with " & Actions_Package_Name & "; use " & Actions_Package_Name & ";");
end if;
case Common_Data.Lexer is
when None | Elisp_Lexer =>
null;
when re2c_Lexer =>
Put_Line ("with WisiToken.Lexer.re2c;");
Put_Line ("with " & re2c_Package_Name & ";");
end case;
case Common_Data.Generate_Algorithm is
when LR_Generate_Algorithm =>
null;
when Packrat_Gen =>
Put_Line ("with WisiToken.Parse.Packrat.Generated;");
when Packrat_Proc =>
Put_Line ("with WisiToken.Parse.Packrat.Procedural;");
Put_Line ("with WisiToken.Productions;");
when External =>
null;
end case;
Put_Line ("package body " & Main_Package_Name & " is");
Indent := Indent + 3;
New_Line;
case Common_Data.Lexer is
when None | Elisp_Lexer =>
null;
when re2c_Lexer =>
Indent_Line ("package Lexer is new WisiToken.Lexer.re2c");
Indent_Line (" (" & re2c_Package_Name & ".New_Lexer,");
Indent_Line (" " & re2c_Package_Name & ".Free_Lexer,");
Indent_Line (" " & re2c_Package_Name & ".Reset_Lexer,");
Indent_Line (" " & re2c_Package_Name & ".Next_Token);");
New_Line;
end case;
case Common_Data.Generate_Algorithm is
when LR_Generate_Algorithm =>
LR_Create_Create_Parser (Input_Data, Common_Data, Generate_Data);
when Packrat_Gen =>
WisiToken.BNF.Generate_Packrat (Packrat_Data, Generate_Data);
Packrat_Create_Create_Parser (Common_Data, Generate_Data, Packrat_Data);
when Packrat_Proc =>
Packrat_Create_Create_Parser (Common_Data, Generate_Data, Packrat_Data);
when External =>
External_Create_Create_Grammar (Generate_Data);
end case;
Put_Line ("end " & Main_Package_Name & ";");
Close (Body_File);
Set_Output (Standard_Output);
end Create_Ada_Main_Body;
procedure Create_Ada_Test_Main
(Actions_Package_Name : in String;
Main_Package_Name : in String)
is
use WisiToken.Generate;
Generic_Package_Name : constant String :=
(case Common_Data.Generate_Algorithm is
when LR_Generate_Algorithm =>
(if Input_Data.Language_Params.Error_Recover then
(if Common_Data.Text_Rep
then "Gen_LR_Text_Rep_Parser_Run"
else "Gen_LR_Parser_Run")
else
(if Common_Data.Text_Rep
then "Gen_LR_Text_Rep_Parser_No_Recover_Run"
else "Gen_LR_Parser_No_Recover_Run")),
when Packrat_Generate_Algorithm => "Gen_Packrat_Parser_Run",
when External => raise SAL.Programmer_Error);
Unit_Name : constant String := File_Name_To_Ada (Output_File_Name_Root) &
"_" & Generate_Algorithm'Image (Common_Data.Generate_Algorithm) & "_Run";
Default_Language_Runtime_Package : constant String := "WisiToken.Parse.LR.McKenzie_Recover." & File_Name_To_Ada
(Output_File_Name_Root);
File_Name : constant String := To_Lower (Unit_Name) & ".ads";
File : File_Type;
begin
Create (File, Out_File, File_Name);
Set_Output (File);
Indent := 1;
Put_File_Header (Ada_Comment, Use_Tuple => True, Tuple => Tuple);
-- no Copyright_License; just a test file
New_Line;
Put_Line ("with " & Generic_Package_Name & ";");
Put_Line ("with " & Actions_Package_Name & ";");
Put_Line ("with " & Main_Package_Name & ";");
if Input_Data.Language_Params.Error_Recover and
Input_Data.Language_Params.Use_Language_Runtime
then
declare
Pkg : constant String :=
(if -Input_Data.Language_Params.Language_Runtime_Name = ""
then Default_Language_Runtime_Package
else -Input_Data.Language_Params.Language_Runtime_Name);
begin
-- For language-specific names in actions, checks.
Put_Line ("with " & Pkg & ";");
Put_Line ("use " & Pkg & ";");
end;
end if;
Put_Line ("procedure " & Unit_Name & " is new " & Generic_Package_Name);
Put_Line (" (" & Actions_Package_Name & ".Descriptor,");
if Common_Data.Text_Rep then
Put_Line (" """ & Output_File_Name_Root & "_" &
To_Lower (Generate_Algorithm_Image (Tuple.Gen_Alg).all) &
"_parse_table.txt"",");
end if;
if Input_Data.Language_Params.Error_Recover then
if Input_Data.Language_Params.Use_Language_Runtime then
Put_Line ("Fixes'Access, Matching_Begin_Tokens'Access, String_ID_Set'Access,");
else
Put_Line ("null, null, null,");
end if;
end if;
Put_Line (Main_Package_Name & ".Create_Parser);");
Close (File);
Set_Output (Standard_Output);
end Create_Ada_Test_Main;
begin
case Common_Data.Lexer is
when None | re2c_Lexer =>
null;
when Elisp_Lexer =>
raise User_Error with WisiToken.Generate.Error_Message
(Input_Data.Grammar_Lexer.File_Name, 1, "Ada output language does not support " & Lexer_Image
(Common_Data.Lexer).all & " lexer");
end case;
case Tuple.Interface_Kind is
when None =>
null;
when Module | Process =>
raise User_Error with WisiToken.Generate.Error_Message
(Input_Data.Grammar_Lexer.File_Name, 1, "Ada output language does not support setting Interface");
end case;
declare
Main_Package_Name : constant String := File_Name_To_Ada (Output_File_Name_Root & Gen_Alg_Name) & "_Main";
Actions_Package_Name : constant String := File_Name_To_Ada (Output_File_Name_Root) & "_Actions";
begin
if Input_Data.Action_Count > 0 or Input_Data.Check_Count > 0 then
-- Some WisiToken tests have no actions or checks.
Create_Ada_Actions_Body
(Generate_Data.Action_Names, Generate_Data.Check_Names, Input_Data.Label_Count, Actions_Package_Name);
end if;
Create_Ada_Actions_Spec
(Output_File_Name_Root & "_actions.ads", Actions_Package_Name, Input_Data, Common_Data, Generate_Data);
if Tuple.Gen_Alg = External then
Create_External_Main_Spec (Main_Package_Name, Tuple, Input_Data);
Create_Ada_Main_Body (Actions_Package_Name, Main_Package_Name);
else
Create_Ada_Main_Body (Actions_Package_Name, Main_Package_Name);
Create_Ada_Main_Spec (To_Lower (Main_Package_Name) & ".ads", Main_Package_Name, Input_Data, Common_Data);
if Test_Main then
Create_Ada_Test_Main (Actions_Package_Name, Main_Package_Name);
end if;
end if;
end;
exception
when others =>
Set_Output (Standard_Output);
raise;
end WisiToken.BNF.Output_Ada;
| 40.261209 | 117 | 0.56362 |
1e9275408d367a20423815546c1e88435c97361b | 13,155 | ads | Ada | src/gen/gstreamer-gst_low_level-gstreamer_0_10_gst_gstminiobject_h.ads | persan/A-gst | 7a39693d105617adea52680424c862a1a08f7368 | [
"Apache-2.0"
] | 1 | 2018-01-18T00:51:00.000Z | 2018-01-18T00:51:00.000Z | src/gen/gstreamer-gst_low_level-gstreamer_0_10_gst_gstminiobject_h.ads | persan/A-gst | 7a39693d105617adea52680424c862a1a08f7368 | [
"Apache-2.0"
] | null | null | null | src/gen/gstreamer-gst_low_level-gstreamer_0_10_gst_gstminiobject_h.ads | persan/A-gst | 7a39693d105617adea52680424c862a1a08f7368 | [
"Apache-2.0"
] | null | null | null | pragma Ada_2005;
pragma Style_Checks (Off);
pragma Warnings (Off);
with Interfaces.C; use Interfaces.C;
with glib;
with glib.Values;
with System;
with glib;
with System;
-- with GStreamer.GST_Low_Level.glib_2_0_gobject_gparam_h;
with Interfaces.C.Strings;
package GStreamer.GST_Low_Level.gstreamer_0_10_gst_gstminiobject_h is
-- unsupported macro: GST_TYPE_MINI_OBJECT (gst_mini_object_get_type())
-- arg-macro: function GST_IS_MINI_OBJECT (obj)
-- return G_TYPE_CHECK_INSTANCE_TYPE ((obj), GST_TYPE_MINI_OBJECT);
-- arg-macro: function GST_IS_MINI_OBJECT_CLASS (klass)
-- return G_TYPE_CHECK_CLASS_TYPE ((klass), GST_TYPE_MINI_OBJECT);
-- arg-macro: function GST_MINI_OBJECT_GET_CLASS (obj)
-- return G_TYPE_INSTANCE_GET_CLASS ((obj), GST_TYPE_MINI_OBJECT, GstMiniObjectClass);
-- arg-macro: function GST_MINI_OBJECT (obj)
-- return G_TYPE_CHECK_INSTANCE_CAST ((obj), GST_TYPE_MINI_OBJECT, GstMiniObject);
-- arg-macro: function GST_MINI_OBJECT_CLASS (klass)
-- return G_TYPE_CHECK_CLASS_CAST ((klass), GST_TYPE_MINI_OBJECT, GstMiniObjectClass);
-- arg-macro: function GST_MINI_OBJECT_CAST (obj)
-- return (GstMiniObject*)(obj);
-- arg-macro: function GST_MINI_OBJECT_CONST_CAST (obj)
-- return (const GstMiniObject*)(obj);
-- arg-macro: function GST_MINI_OBJECT_FLAGS (obj)
-- return GST_MINI_OBJECT_CAST(obj).flags;
-- arg-macro: procedure GST_MINI_OBJECT_FLAG_IS_SET (obj, flag)
-- notnot(GST_MINI_OBJECT_FLAGS (obj) and (flag))
-- arg-macro: function GST_MINI_OBJECT_FLAG_SET (obj, flag)
-- return GST_MINI_OBJECT_FLAGS (obj) |= (flag);
-- arg-macro: function GST_MINI_OBJECT_FLAG_UNSET (obj, flag)
-- return GST_MINI_OBJECT_FLAGS (obj) &= ~(flag);
-- arg-macro: function GST_VALUE_HOLDS_MINI_OBJECT (value)
-- return G_VALUE_HOLDS(value, GST_TYPE_MINI_OBJECT);
-- arg-macro: function GST_MINI_OBJECT_REFCOUNT (obj)
-- return (GST_MINI_OBJECT_CAST(obj)).refcount;
-- arg-macro: function GST_MINI_OBJECT_REFCOUNT_VALUE (obj)
-- return g_atomic_int_get (and(GST_MINI_OBJECT_CAST(obj)).refcount);
-- unsupported macro: GST_TYPE_PARAM_MINI_OBJECT (gst_param_spec_mini_object_get_type())
-- arg-macro: function GST_IS_PARAM_SPEC_MINI_OBJECT (pspec)
-- return G_TYPE_CHECK_INSTANCE_TYPE ((pspec), GST_TYPE_PARAM_MINI_OBJECT);
-- arg-macro: function GST_PARAM_SPEC_MINI_OBJECT (pspec)
-- return G_TYPE_CHECK_INSTANCE_CAST ((pspec), GST_TYPE_PARAM_MINI_OBJECT, GstParamSpecMiniObject);
-- GStreamer
-- * Copyright (C) 2005 David Schleef <[email protected]>
-- *
-- * gstminiobject.h: Header for GstMiniObject
-- *
-- * This library is free software; you can redistribute it and/or
-- * modify it under the terms of the GNU Library General Public
-- * License as published by the Free Software Foundation; either
-- * version 2 of the License, or (at your option) any later version.
-- *
-- * This library is distributed in the hope that it will be useful,
-- * but WITHOUT ANY WARRANTY; without even the implied warranty of
-- * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
-- * Library General Public License for more details.
-- *
-- * You should have received a copy of the GNU Library General Public
-- * License along with this library; if not, write to the
-- * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
-- * Boston, MA 02111-1307, USA.
--
type GstMiniObject;
--subtype GstMiniObject is u_GstMiniObject; -- gst/gstminiobject.h:41
type GstMiniObjectClass;
--subtype GstMiniObjectClass is u_GstMiniObjectClass; -- gst/gstminiobject.h:42
--*
-- * GstMiniObjectCopyFunction:
-- * @obj: MiniObject to copy
-- *
-- * Virtual function prototype for methods to create copies of instances.
-- *
-- * Returns: reference to cloned instance.
--
type GstMiniObjectCopyFunction is access function (arg1 : access constant GstMiniObject) return access GstMiniObject;
pragma Convention (C, GstMiniObjectCopyFunction); -- gst/gstminiobject.h:52
--*
-- * GstMiniObjectFinalizeFunction:
-- * @obj: MiniObject to finalize
-- *
-- * Virtual function prototype for methods to free ressources used by
-- * mini-objects. Subclasses of the mini object are allowed to revive the
-- * passed object by doing a gst_mini_object_ref(). If the object is not
-- * revived after the finalize function, the memory associated with the
-- * object is freed.
--
type GstMiniObjectFinalizeFunction is access procedure (arg1 : access GstMiniObject);
pragma Convention (C, GstMiniObjectFinalizeFunction); -- gst/gstminiobject.h:63
--*
-- * GST_MINI_OBJECT_FLAGS:
-- * @obj: MiniObject to return flags for.
-- *
-- * This macro returns the entire set of flags for the mini-object.
--
--*
-- * GST_MINI_OBJECT_FLAG_IS_SET:
-- * @obj: MiniObject to check for flags.
-- * @flag: Flag to check for
-- *
-- * This macro checks to see if the given flag is set.
--
--*
-- * GST_MINI_OBJECT_FLAG_SET:
-- * @obj: MiniObject to set flag in.
-- * @flag: Flag to set, can by any number of bits in guint32.
-- *
-- * This macro sets the given bits.
--
--*
-- * GST_MINI_OBJECT_FLAG_UNSET:
-- * @obj: MiniObject to unset flag in.
-- * @flag: Flag to set, must be a single bit in guint32.
-- *
-- * This macro usets the given bits.
--
--*
-- * GST_VALUE_HOLDS_MINI_OBJECT:
-- * @value: the #GValue to check
-- *
-- * Checks if the given #GValue contains a #GST_TYPE_MINI_OBJECT value.
--
--*
-- * GstMiniObjectFlags:
-- * @GST_MINI_OBJECT_FLAG_READONLY: is the miniobject readonly or writable
-- * @GST_MINI_OBJECT_FLAG_RESERVED1: a flag reserved for internal use e.g. as
-- * GST_BUFFER_FLAG_MEDIA4. Since: 0.10.33.
-- * @GST_MINI_OBJECT_FLAG_LAST: first flag that can be used by subclasses.
-- *
-- * Flags for the mini object
--
-- padding
subtype GstMiniObjectFlags is unsigned;
GST_MINI_OBJECT_FLAG_READONLY : constant GstMiniObjectFlags := 1;
GST_MINI_OBJECT_FLAG_RESERVED1 : constant GstMiniObjectFlags := 2;
GST_MINI_OBJECT_FLAG_LAST : constant GstMiniObjectFlags := 16; -- gst/gstminiobject.h:121
--*
-- * GST_MINI_OBJECT_REFCOUNT:
-- * @obj: a #GstMiniObject
-- *
-- * Get access to the reference count field of the mini-object.
--
--*
-- * GST_MINI_OBJECT_REFCOUNT_VALUE:
-- * @obj: a #GstMiniObject
-- *
-- * Get the reference count value of the mini-object.
--
--*
-- * GstMiniObjectWeakNotify:
-- * @data: data that was provided when the weak reference was established
-- * @where_the_mini_object_was: the mini object being finalized
-- *
-- * A #GstMiniObjectWeakNotify function can be added to a mini object as a
-- * callback that gets triggered when the mini object is finalized. Since the
-- * mini object is already being finalized when the #GstMiniObjectWeakNotify is
-- * called, there's not much you could do with the object, apart from e.g. using
-- * its adress as hash-index or the like.
-- *
-- * Since: 0.10.35
-- *
--
type GstMiniObjectWeakNotify is access procedure (arg1 : System.Address; arg2 : access GstMiniObject);
pragma Convention (C, GstMiniObjectWeakNotify); -- gst/gstminiobject.h:152
-- skipped empty struct u_GstMiniObjectPrivate
-- skipped empty struct GstMiniObjectPrivate
--*
-- * GstMiniObject:
-- * @instance: type instance
-- * @refcount: atomic refcount
-- * @flags: extra flags.
-- *
-- * Base class for refcounted lightweight objects.
-- * Ref Func: gst_mini_object_ref
-- * Unref Func: gst_mini_object_unref
-- * Set Value Func: gst_value_set_mini_object
-- * Get Value Func: gst_value_get_mini_object
--
type GstMiniObject is record
instance : aliased GStreamer.GST_Low_Level.glib_2_0_gobject_gtype_h.GTypeInstance; -- gst/gstminiobject.h:170
refcount : aliased GLIB.gint; -- gst/gstminiobject.h:172
flags : aliased GLIB.guint; -- gst/gstminiobject.h:173
priv : System.Address; -- gst/gstminiobject.h:176
end record;
pragma Convention (C_Pass_By_Copy, GstMiniObject); -- gst/gstminiobject.h:169
--< public >
-- with COW
--< private >
type GstMiniObjectClass is record
type_class : aliased GStreamer.GST_Low_Level.glib_2_0_gobject_gtype_h.GTypeClass; -- gst/gstminiobject.h:180
copy : GstMiniObjectCopyFunction; -- gst/gstminiobject.h:182
finalize : GstMiniObjectFinalizeFunction; -- gst/gstminiobject.h:183
u_gst_reserved : System.Address; -- gst/gstminiobject.h:186
end record;
pragma Convention (C_Pass_By_Copy, GstMiniObjectClass); -- gst/gstminiobject.h:179
--< private >
function gst_mini_object_get_type return GLIB.GType; -- gst/gstminiobject.h:189
pragma Import (C, gst_mini_object_get_type, "gst_mini_object_get_type");
function gst_mini_object_new (c_type : GLIB.GType) return access GstMiniObject; -- gst/gstminiobject.h:191
pragma Import (C, gst_mini_object_new, "gst_mini_object_new");
function gst_mini_object_copy (mini_object : access constant GstMiniObject) return access GstMiniObject; -- gst/gstminiobject.h:192
pragma Import (C, gst_mini_object_copy, "gst_mini_object_copy");
function gst_mini_object_is_writable (mini_object : access constant GstMiniObject) return GLIB.gboolean; -- gst/gstminiobject.h:193
pragma Import (C, gst_mini_object_is_writable, "gst_mini_object_is_writable");
function gst_mini_object_make_writable (mini_object : access GstMiniObject) return access GstMiniObject; -- gst/gstminiobject.h:194
pragma Import (C, gst_mini_object_make_writable, "gst_mini_object_make_writable");
-- refcounting
function gst_mini_object_ref (mini_object : access GstMiniObject) return access GstMiniObject; -- gst/gstminiobject.h:197
pragma Import (C, gst_mini_object_ref, "gst_mini_object_ref");
procedure gst_mini_object_unref (mini_object : access GstMiniObject); -- gst/gstminiobject.h:198
pragma Import (C, gst_mini_object_unref, "gst_mini_object_unref");
procedure gst_mini_object_weak_ref
(object : access GstMiniObject;
notify : GstMiniObjectWeakNotify;
data : System.Address); -- gst/gstminiobject.h:199
pragma Import (C, gst_mini_object_weak_ref, "gst_mini_object_weak_ref");
procedure gst_mini_object_weak_unref
(object : access GstMiniObject;
notify : GstMiniObjectWeakNotify;
data : System.Address); -- gst/gstminiobject.h:202
pragma Import (C, gst_mini_object_weak_unref, "gst_mini_object_weak_unref");
procedure gst_mini_object_replace (olddata : System.Address; newdata : access GstMiniObject); -- gst/gstminiobject.h:205
pragma Import (C, gst_mini_object_replace, "gst_mini_object_replace");
-- GParamSpec
type GstParamSpecMiniObject;
--subtype GstParamSpecMiniObject is u_GstParamSpecMiniObject; -- gst/gstminiobject.h:216
--*
-- * GstParamSpecMiniObject:
-- * @parent_instance: private %GParamSpec portion
-- *
-- * A %GParamSpec derived structure that contains the meta data
-- * for %GstMiniObject properties.
--
type GstParamSpecMiniObject is record
parent_instance : aliased GStreamer.GST_Low_Level.glib_2_0_gobject_gparam_h.GParamSpec; -- gst/gstminiobject.h:227
end record;
pragma Convention (C_Pass_By_Copy, GstParamSpecMiniObject); -- gst/gstminiobject.h:225
function gst_param_spec_mini_object_get_type return GLIB.GType; -- gst/gstminiobject.h:231
pragma Import (C, gst_param_spec_mini_object_get_type, "gst_param_spec_mini_object_get_type");
function gst_param_spec_mini_object
(name : Interfaces.C.Strings.chars_ptr;
nick : Interfaces.C.Strings.chars_ptr;
blurb : Interfaces.C.Strings.chars_ptr;
object_type : GLIB.GType;
flags : GStreamer.GST_Low_Level.glib_2_0_gobject_gparam_h.GParamFlags) return access GStreamer.GST_Low_Level.glib_2_0_gobject_gparam_h.GParamSpec; -- gst/gstminiobject.h:233
pragma Import (C, gst_param_spec_mini_object, "gst_param_spec_mini_object");
-- GValue stuff
procedure gst_value_set_mini_object (value : access Glib.Values.GValue; mini_object : access GstMiniObject); -- gst/gstminiobject.h:239
pragma Import (C, gst_value_set_mini_object, "gst_value_set_mini_object");
procedure gst_value_take_mini_object (value : access Glib.Values.GValue; mini_object : access GstMiniObject); -- gst/gstminiobject.h:240
pragma Import (C, gst_value_take_mini_object, "gst_value_take_mini_object");
function gst_value_get_mini_object (value : access constant Glib.Values.GValue) return access GstMiniObject; -- gst/gstminiobject.h:241
pragma Import (C, gst_value_get_mini_object, "gst_value_get_mini_object");
function gst_value_dup_mini_object (value : access constant Glib.Values.GValue) return access GstMiniObject; -- gst/gstminiobject.h:242
pragma Import (C, gst_value_dup_mini_object, "gst_value_dup_mini_object");
end GStreamer.GST_Low_Level.gstreamer_0_10_gst_gstminiobject_h;
| 43.131148 | 180 | 0.729304 |
04a1e565e4a685984219c71d4c0625c2ac0079bf | 66,917 | adb | Ada | src/replicant.adb | kraileth/ravenadm | 02bb13117bafc8887e0c90a4effc63ffcdc90642 | [
"0BSD"
] | null | null | null | src/replicant.adb | kraileth/ravenadm | 02bb13117bafc8887e0c90a4effc63ffcdc90642 | [
"0BSD"
] | null | null | null | src/replicant.adb | kraileth/ravenadm | 02bb13117bafc8887e0c90a4effc63ffcdc90642 | [
"0BSD"
] | null | null | null | -- This file is covered by the Internet Software Consortium (ISC) License
-- Reference: ../License.txt
with Ada.Exceptions;
with Ada.Directories;
with Ada.Containers.Vectors;
with Ada.Characters.Latin_1;
with File_Operations;
with Parameters;
with Signals;
with Unix;
package body Replicant is
package EX renames Ada.Exceptions;
package PM renames Parameters;
package CON renames Ada.Containers;
package DIR renames Ada.Directories;
package LAT renames Ada.Characters.Latin_1;
package FOP renames File_Operations;
--------------------------------------------------------------------------------------------
-- initialize
--------------------------------------------------------------------------------------------
procedure initialize (testmode : Boolean)
is
raven_sysroot : constant String := HT.USS (PM.configuration.dir_sysroot);
mm : constant String := get_master_mount;
sretc : constant String := raven_sysroot & "/usr/share";
maspas : constant String := "/master.passwd";
passwd : constant String := "/passwd";
spwd : constant String := "/spwd.db";
pwd : constant String := "/pwd.db";
rcconf : constant String := "/rc.conf";
hints : constant String := "/ld-elf.so.hints";
nhints : constant String := "/ld.so.hints";
group : constant String := "/group";
ldcnf1 : constant String := "/x86_64-linux-gnu.conf";
ldcnf2 : constant String := "/ld.so.conf";
begin
developer_mode := testmode;
ravenbase := PM.configuration.dir_localbase;
start_abnormal_logging;
DIR.Create_Path (mm);
case platform_type is
when dragonfly |
freebsd |
macos |
netbsd |
openbsd =>
DIR.Copy_File (sretc & passwd, mm & passwd);
DIR.Copy_File (sretc & maspas, mm & maspas);
DIR.Copy_File (sretc & group, mm & group);
when linux |
sunos =>
DIR.Copy_File (sretc & passwd, mm & passwd);
DIR.Copy_File (sretc & group, mm & group);
end case;
case platform_type is
when dragonfly |
freebsd |
netbsd |
openbsd =>
DIR.Copy_File (sretc & spwd, mm & spwd);
DIR.Copy_File (sretc & pwd, mm & pwd);
when linux |
macos |
sunos => null; -- pwd.db not used
end case;
case platform_type is
when dragonfly |
freebsd |
netbsd |
openbsd =>
DIR.Copy_File (sretc & rcconf, mm & rcconf);
when linux |
macos |
sunos => null; -- rc.conf not used
end case;
case platform_type is
when dragonfly =>
DIR.Copy_File (sretc & hints, mm & hints);
when freebsd =>
DIR.Copy_File (sretc & hints, mm & hints);
when netbsd |
openbsd =>
DIR.Copy_File (sretc & nhints, mm & nhints);
when linux =>
DIR.Copy_File (sretc & ldcnf1, mm & ldcnf1);
DIR.Copy_File (sretc & ldcnf2, mm & ldcnf2);
when macos |
sunos => null;
end case;
create_mtree_exc_preinst (mm);
create_mtree_exc_preconfig (mm);
end initialize;
--------------------------------------------------------------------------------------------
-- finalize
--------------------------------------------------------------------------------------------
procedure finalize
is
mm : constant String := get_master_mount;
begin
if DIR.Exists (mm) then
annihilate_directory_tree (mm);
end if;
stop_abnormal_logging;
end finalize;
--------------------------------------------------------------------------------------------
-- get_master_mount
--------------------------------------------------------------------------------------------
function get_master_mount return String is
begin
return HT.USS (PM.configuration.dir_buildbase) & "/" & reference_base;
end get_master_mount;
--------------------------------------------------------------------------------------------
-- get_slave_mount
--------------------------------------------------------------------------------------------
function get_slave_mount (id : builders) return String is
begin
return HT.USS (PM.configuration.dir_buildbase) & "/" & slave_name (id);
end get_slave_mount;
--------------------------------------------------------------------------------------------
-- start_abnormal_logging
--------------------------------------------------------------------------------------------
procedure start_abnormal_logging
is
logpath : constant String := HT.USS (PM.configuration.dir_logs)
& "/logs/" & abnormal_cmd_logname;
begin
if DIR.Exists (logpath) then
DIR.Delete_File (logpath);
end if;
TIO.Create (File => abnormal_log,
Mode => TIO.Out_File,
Name => logpath);
abn_log_ready := True;
exception
when others => abn_log_ready := False;
end start_abnormal_logging;
--------------------------------------------------------------------------------------------
-- stop_abnormal_logging
--------------------------------------------------------------------------------------------
procedure stop_abnormal_logging is
begin
if abn_log_ready then
TIO.Close (abnormal_log);
end if;
end stop_abnormal_logging;
--------------------------------------------------------------------------------------------
-- annihilate_directory_tree
--------------------------------------------------------------------------------------------
procedure annihilate_directory_tree (tree : String)
is
command : constant String := "/bin/rm -rf " & tree;
retry : Boolean := False;
begin
silent_exec (command);
exception
when others =>
-- Only can occur when tmpfs is avoided
if DIR.Exists (tree & "/home") then
folder_access (tree & "/home", unlock);
retry := True;
end if;
if DIR.Exists (tree & "/root") then
folder_access (tree & "/root", unlock);
retry := True;
end if;
if retry then
silent_exec (command);
else
raise scenario_unexpected with "annihilate_directory_tree " & tree & " failed";
end if;
end annihilate_directory_tree;
--------------------------------------------------------------------------------------------
-- annihilate_directory_tree_contents
--------------------------------------------------------------------------------------------
procedure annihilate_directory_tree_contents (tree : String)
is
command : constant String := "/usr/bin/find -s " & tree &
" -depth 1 -maxdepth 1 -exec /bin/rm -rf {} \;";
begin
silent_exec (command);
end annihilate_directory_tree_contents;
--------------------------------------------------------------------------------------------
-- execute
--------------------------------------------------------------------------------------------
procedure execute (command : String)
is
Exit_Status : Integer;
output : HT.Text := Unix.piped_command (command, Exit_Status);
begin
if abn_log_ready and then not HT.IsBlank (output) then
TIO.Put_Line (abnormal_log, HT.USS (output));
end if;
if Exit_Status /= 0 then
raise scenario_unexpected with
command & " => failed with code" & Exit_Status'Img;
end if;
end execute;
--------------------------------------------------------------------------------------------
-- silent_exec
--------------------------------------------------------------------------------------------
procedure silent_exec (command : String)
is
cmd_output : HT.Text;
success : Boolean := Unix.piped_mute_command (command, cmd_output);
begin
if not success then
if abn_log_ready and then not HT.IsBlank (cmd_output) then
TIO.Put_Line (abnormal_log, "piped_mute_command failure:");
TIO.Put_Line (abnormal_log, HT.USS (cmd_output));
end if;
raise scenario_unexpected with
command & " => failed (exit code not 0)";
end if;
end silent_exec;
--------------------------------------------------------------------------------------------
-- append_abnormal_log
--------------------------------------------------------------------------------------------
procedure append_abnormal_log (line : String) is
begin
TIO.Put_Line (abnormal_log, line);
end append_abnormal_log;
--------------------------------------------------------------------------------------------
-- internal_system_command
--------------------------------------------------------------------------------------------
function internal_system_command (command : String) return HT.Text
is
content : HT.Text;
status : Integer;
begin
content := Unix.piped_command (command, status);
if status /= 0 then
raise scenario_unexpected with "cmd: " & command &
" (return code =" & status'Img & ")";
end if;
return content;
end internal_system_command;
--------------------------------------------------------------------------------------------
-- specific_mount_exists
--------------------------------------------------------------------------------------------
function specific_mount_exists (mount_point : String) return Boolean
is
comres : constant String := HT.USS (internal_system_command (df_command));
markers : HT.Line_Markers;
begin
HT.initialize_markers (comres, markers);
loop
exit when not HT.next_line_present (comres, markers);
declare
line : constant String := HT.extract_line (comres, markers);
begin
if HT.contains (line, mount_point) then
return True;
end if;
end;
end loop;
return False;
exception
when others =>
return True;
end specific_mount_exists;
--------------------------------------------------------------------------------------------
-- ravenadm_mounts_exist
--------------------------------------------------------------------------------------------
function ravenadm_mounts_exist return Boolean
is
buildbase : constant String := HT.USS (PM.configuration.dir_buildbase);
comres : constant String := HT.USS (internal_system_command (df_command));
markers : HT.Line_Markers;
begin
HT.initialize_markers (comres, markers);
loop
exit when not HT.next_line_present (comres, markers);
declare
line : constant String := HT.extract_line (comres, markers);
begin
if HT.contains (line, buildbase) then
return True;
end if;
end;
end loop;
return False;
exception
when others =>
return True;
end ravenadm_mounts_exist;
--------------------------------------------------------------------------------------------
-- clear_existing_mounts
--------------------------------------------------------------------------------------------
function clear_existing_mounts return Boolean
is
package crate is new CON.Vectors (Index_Type => Positive,
Element_Type => HT.Text,
"=" => HT.SU."=");
procedure annihilate (cursor : crate.Cursor);
buildbase : constant String := HT.USS (PM.configuration.dir_buildbase);
comres : constant String := HT.USS (internal_system_command (df_command));
markers : HT.Line_Markers;
mpoints : crate.Vector;
procedure annihilate (cursor : crate.Cursor)
is
mountpoint : constant String := HT.USS (crate.Element (cursor));
begin
unmount (mountpoint);
if DIR.Exists (mountpoint) then
DIR.Delete_Directory (mountpoint);
end if;
exception
when others => null;
end annihilate;
begin
HT.initialize_markers (comres, markers);
loop
exit when not HT.next_line_present (comres, markers);
declare
line : constant String := HT.extract_line (comres, markers);
mindex : Natural;
begin
mindex := HT.start_index (line, buildbase);
if mindex > 0 then
mpoints.Append (HT.SUS (line (mindex .. line'Last)));
end if;
end;
end loop;
mpoints.Reverse_Iterate (Process => annihilate'Access);
if ravenadm_mounts_exist then
return False;
end if;
-- No need to remove empty dirs, the upcoming run will do that.
return True;
end clear_existing_mounts;
--------------------------------------------------------------------------------------------
-- disk_workareas_exist
--------------------------------------------------------------------------------------------
function disk_workareas_exist return Boolean
is
Search : DIR.Search_Type;
buildbase : constant String := HT.USS (PM.configuration.dir_buildbase);
result : Boolean := False;
begin
if not DIR.Exists (buildbase) then
return False;
end if;
if DIR.Exists (buildbase & "/Base") then
return True;
end if;
-- SLXX may be present if tmpfs is avoided
DIR.Start_Search (Search => Search,
Directory => buildbase,
Filter => (DIR.Directory => True, others => False),
Pattern => "SL*");
result := DIR.More_Entries (Search => Search);
DIR.End_Search (Search);
return result;
end disk_workareas_exist;
--------------------------------------------------------------------------------------------
-- clear_existing_workareas
--------------------------------------------------------------------------------------------
function clear_existing_workareas return Boolean
is
Search : DIR.Search_Type;
Dir_Ent : DIR.Directory_Entry_Type;
buildbase : constant String := HT.USS (PM.configuration.dir_buildbase);
base : constant String := buildbase & "/Base";
begin
if DIR.Exists (base) then
annihilate_directory_tree (base);
end if;
-- SLXX may be present if tmpfs is avoided
DIR.Start_Search (Search => Search,
Directory => buildbase,
Filter => (DIR.Directory => True, others => False),
Pattern => "SL*");
while DIR.More_Entries (Search => Search) loop
DIR.Get_Next_Entry (Search => Search, Directory_Entry => Dir_Ent);
declare
target : constant String := buildbase & "/" & DIR.Simple_Name (Dir_Ent);
begin
annihilate_directory_tree (target);
end;
end loop;
DIR.End_Search (Search);
return True;
exception
when others => return False;
end clear_existing_workareas;
--------------------------------------------------------------------------------------------
-- create_mtree_exc_preinst
--------------------------------------------------------------------------------------------
procedure create_mtree_exc_preinst (path_to_mm : String)
is
mtreefile : TIO.File_Type;
filename : constant String := path_to_mm & "/mtree.prestage.exclude";
begin
TIO.Create (File => mtreefile, Mode => TIO.Out_File, Name => filename);
write_common_mtree_exclude_base (mtreefile);
write_preinstall_section (mtreefile);
TIO.Close (mtreefile);
end create_mtree_exc_preinst;
--------------------------------------------------------------------------------------------
-- create_mtree_exc_preconfig
--------------------------------------------------------------------------------------------
procedure create_mtree_exc_preconfig (path_to_mm : String)
is
mtreefile : TIO.File_Type;
filename : constant String := path_to_mm & "/mtree.preconfig.exclude";
begin
TIO.Create (File => mtreefile, Mode => TIO.Out_File, Name => filename);
write_common_mtree_exclude_base (mtreefile);
TIO.Close (mtreefile);
end create_mtree_exc_preconfig;
--------------------------------------------------------------------------------------------
-- write_common_mtree_exclude_base
--------------------------------------------------------------------------------------------
procedure write_common_mtree_exclude_base (mtreefile : TIO.File_Type)
is
function write_usr return String;
function opsys_specific return String;
RB : String := LAT.Full_Stop & HT.USS (ravenbase);
function write_usr return String is
begin
if HT.equivalent (ravenbase, bsd_localbase) then
return "./usr/bin" & LAT.LF
& "./usr/include" & LAT.LF
& "./usr/lib" & LAT.LF
& "./usr/lib32" & LAT.LF
& "./usr/share" & LAT.LF;
else
return "./usr" & LAT.LF;
end if;
end write_usr;
function opsys_specific return String is
begin
case platform_type is
when freebsd | dragonfly | netbsd | openbsd =>
return "./libexec" & LAT.LF;
when linux =>
return "./lib" & LAT.LF & "./lib64" & LAT.LF;
when sunos =>
return "./lib" & LAT.LF & "./devices" & LAT.LF;
when macos =>
return "./System" & LAT.LF;
end case;
end opsys_specific;
begin
TIO.Put_Line
(mtreefile,
"./bin" & LAT.LF
& "./ccache" & LAT.LF
& "./construction" & LAT.LF
& "./dev" & LAT.LF
& "./distfiles" & LAT.LF
& "./home" & LAT.LF
& "./packages" & LAT.LF
& "./port" & LAT.LF
& "./proc" & LAT.LF
& "./root" & LAT.LF
& "./tmp" & LAT.LF
& write_usr
& opsys_specific
& "./var/db/rvnfontconfig" & LAT.LF
& "./var/run" & LAT.LF
& "./var/tmp" & LAT.LF
& "./xports" & LAT.LF
& RB & "/toolchain"
);
end write_common_mtree_exclude_base;
--------------------------------------------------------------------------------------------
-- write_preinstall_section
--------------------------------------------------------------------------------------------
procedure write_preinstall_section (mtreefile : TIO.File_Type)
is
RB : String := LAT.Full_Stop & HT.USS (ravenbase);
begin
TIO.Put_Line
(mtreefile,
"./etc/group" & LAT.LF
& "./etc/make.conf" & LAT.LF
& "./etc/make.conf.bak" & LAT.LF
& "./etc/make.nxb.conf" & LAT.LF
& "./etc/master.passwd" & LAT.LF
& "./etc/passwd" & LAT.LF
& "./etc/pwd.db" & LAT.LF
& "./etc/shells" & LAT.LF
& "./etc/spwd.db" & LAT.LF
& "./etc/ld.so.conf.d/x86_64-linux-gnu.conf" & LAT.LF
& "./var/db" & LAT.LF
& "./var/log" & LAT.LF
& "./var/mail" & LAT.LF
& "./var/spool" & LAT.LF
& "./var/tmp" & LAT.LF
& RB & "/etc/gconf/gconf.xml.defaults/%gconf-tree*.xml" & LAT.LF
& RB & "/lib/gio/modules/giomodule.cache" & LAT.LF
& RB & "/share/info/dir" & LAT.LF
& RB & "/share/info" & LAT.LF
& RB & "/share/*/info/dir" & LAT.LF
& RB & "/share/*/info" & LAT.LF
& RB & "/*/ls-R" & LAT.LF
& RB & "/share/octave/octave_packages" & LAT.LF
& RB & "/share/xml/catalog.ports"
);
end write_preinstall_section;
--------------------------------------------------------------------------------------------
-- df_command
--------------------------------------------------------------------------------------------
function df_command return String is
begin
case platform_type is
when freebsd |
macos => return "/bin/df -h";
when dragonfly |
netbsd |
openbsd => return "/bin/df -h -t null,tmpfs,devfs,procfs";
when sunos => return "/usr/sbin/df -h";
when linux => return "/bin/df -h -a";
end case;
end df_command;
--------------------------------------------------------------------------------------------
-- unmount
--------------------------------------------------------------------------------------------
procedure unmount (device_or_node : String; retry_times : Natural := 0)
is
bsd_command : constant String := "/sbin/umount " & device_or_node;
sol_command : constant String := "/usr/sbin/umount " & device_or_node;
lin_command : constant String := "/bin/umount " & device_or_node;
counter : Natural := 0;
success : Boolean := False;
begin
-- failure to unmount causes stderr squawks which messes up curses display
-- Just log it and ignore for now (Add robustness later)
loop
begin
exit when counter > retry_times;
case platform_type is
when dragonfly |
freebsd |
macos |
netbsd |
openbsd => execute (bsd_command);
when linux => execute (lin_command);
when sunos => execute (sol_command);
end case;
success := True;
exit;
exception
when others =>
counter := counter + 1;
delay 10.0;
end;
end loop;
if not success then
raise failed_unmount with device_or_node;
end if;
end unmount;
--------------------------------------------------------------------------------------------
-- mount_nullfs
--------------------------------------------------------------------------------------------
procedure mount_nullfs (target, mount_point : String; mode : mount_mode := readonly)
is
cmd_freebsd : constant String := "/sbin/mount_nullfs";
cmd_dragonfly : constant String := "/sbin/mount_null";
cmd_solaris : constant String := "/sbin/mount -F lofs";
cmd_linux : constant String := "/bin/mount --bind";
cmd_macos : constant String := "/sbin/mount -t nfs";
cmd_openbsd : constant String := "/sbin/mount_nfs";
command : HT.Text;
begin
if not DIR.Exists (mount_point) then
raise scenario_unexpected with
"mount point " & mount_point & " does not exist";
end if;
if not DIR.Exists (target) then
raise scenario_unexpected with
"mount target " & target & " does not exist";
end if;
case platform_type is
when freebsd => command := HT.SUS (cmd_freebsd);
when dragonfly |
netbsd => command := HT.SUS (cmd_dragonfly);
when sunos => command := HT.SUS (cmd_solaris);
when linux => command := HT.SUS (cmd_linux);
when macos => command := HT.SUS (cmd_macos);
when openbsd => command := HT.SUS (cmd_openbsd);
end case;
case mode is
when readonly => HT.SU.Append (command, " -o ro");
when readwrite => null;
end case;
case platform_type is
when macos | openbsd =>
execute (HT.USS (command) & " 127.0.0.1:" & target & " " & mount_point);
when others =>
execute (HT.USS (command) & " " & target & " " & mount_point);
end case;
end mount_nullfs;
--------------------------------------------------------------------------------------------
-- mount_tmpfs
--------------------------------------------------------------------------------------------
procedure mount_tmpfs (mount_point : String; max_size_M : Natural := 0)
is
cmd_freebsd : constant String := "/sbin/mount -t tmpfs";
cmd_dragonfly : constant String := "/sbin/mount_tmpfs";
cmd_solaris : constant String := "/sbin/mount -F tmpfs";
cmd_linux : constant String := "/bin/mount -t tmpfs";
command : HT.Text;
begin
case platform_type is
when freebsd |
netbsd => command := HT.SUS (cmd_freebsd);
when dragonfly => command := HT.SUS (cmd_dragonfly);
when sunos => command := HT.SUS (cmd_solaris);
when linux => command := HT.SUS (cmd_linux);
when macos | -- Not available at all
openbsd => -- Was available, disabled on OpenBSD 6.0 (no maintenance)
raise scenario_unexpected with
"tmpfs not supported on " & platform_type'Img;
end case;
if max_size_M > 0 then
HT.SU.Append (command, " -o size=" & HT.trim (max_size_M'Img) & "M");
end if;
case platform_type is
when sunos => HT.SU.Append (command, " swap " & mount_point);
when freebsd |
dragonfly |
netbsd |
linux => HT.SU.Append (command, " tmpfs " & mount_point);
when macos => null;
when openbsd => null;
end case;
execute (HT.USS (command));
end mount_tmpfs;
--------------------------------------------------------------------------------------------
-- mount_devices
--------------------------------------------------------------------------------------------
procedure mount_devices (path_to_dev : String)
is
bsd_command : constant String := "/sbin/mount -t devfs devfs " & path_to_dev;
lin_command : constant String := "/bin/mount --bind /dev " & path_to_dev;
begin
case platform_type is
when dragonfly |
freebsd |
macos => execute (bsd_command);
when linux => execute (lin_command);
when netbsd |
openbsd |
sunos => mount_nullfs (target => "/dev", mount_point => path_to_dev);
end case;
end mount_devices;
--------------------------------------------------------------------------------------------
-- unmount_devices
--------------------------------------------------------------------------------------------
procedure unmount_devices (path_to_dev : String) is
begin
unmount (path_to_dev);
end unmount_devices;
--------------------------------------------------------------------------------------------
-- mount_procfs
--------------------------------------------------------------------------------------------
procedure mount_procfs (path_to_proc : String)
is
bsd_command : constant String := "/sbin/mount -t procfs proc " & path_to_proc;
net_command : constant String := "/sbin/mount_procfs /proc " & path_to_proc;
lin_command : constant String := "/bin/mount --bind /proc " & path_to_proc;
begin
case platform_type is
when dragonfly |
freebsd => execute (bsd_command);
when netbsd |
openbsd => execute (net_command);
when linux => execute (lin_command);
when sunos => mount_nullfs (target => "/proc", mount_point => path_to_proc);
when macos =>
raise scenario_unexpected with
"procfs not supported on " & platform_type'Img;
end case;
end mount_procfs;
--------------------------------------------------------------------------------------------
-- unmount_procfs
--------------------------------------------------------------------------------------------
procedure unmount_procfs (path_to_proc : String) is
begin
unmount (path_to_proc);
end unmount_procfs;
--------------------------------------------------------------------------------------------
-- mount_hardlink
--------------------------------------------------------------------------------------------
procedure mount_hardlink (target, mount_point, sysroot : String)
is
find_program : constant String := sysroot & "/usr/bin/find ";
copy_program : constant String := sysroot & "/bin/cp -RpPl ";
chmod_program : constant String := sysroot & "/bin/chmod ";
begin
if DIR.Exists (mount_point) then
DIR.Delete_Directory (mount_point);
end if;
execute (copy_program & target & " " & mount_point);
execute (find_program & mount_point & " -type d -exec " & chmod_program & "555 {} +");
end mount_hardlink;
--------------------------------------------------------------------------------------------
-- mount_fullcopy
--------------------------------------------------------------------------------------------
procedure mount_fullcopy (target, mount_point, sysroot : String)
is
find_program : constant String := sysroot & "/usr/bin/find ";
copy_program : constant String := sysroot & "/bin/cp -RpP ";
chmod_program : constant String := sysroot & "/bin/chmod ";
begin
if DIR.Exists (mount_point) then
DIR.Delete_Directory (mount_point);
end if;
execute (copy_program & target & " " & mount_point);
execute (find_program & mount_point & " -type d -exec " & chmod_program & "555 {} +");
end mount_fullcopy;
--------------------------------------------------------------------------------------------
-- location
--------------------------------------------------------------------------------------------
function location (mount_base : String; point : folder) return String is
begin
case point is
when bin => return mount_base & root_bin;
when usr => return mount_base & root_usr;
when dev => return mount_base & root_dev;
when etc => return mount_base & root_etc;
when etc_default => return mount_base & root_etc_default;
when etc_rcd => return mount_base & root_etc_rcd;
when etc_ldsocnf => return mount_base & root_etc_ldsocnf;
when tmp => return mount_base & root_tmp;
when var => return mount_base & root_var;
when home => return mount_base & root_home;
when proc => return mount_base & root_proc;
when root => return mount_base & root_root;
when xports => return mount_base & root_xports;
when port => return mount_base & root_port;
when lib => return mount_base & root_lib;
when lib64 => return mount_base & root_lib64;
when libexec => return mount_base & root_libexec;
when packages => return mount_base & root_packages;
when distfiles => return mount_base & root_distfiles;
when wrkdirs => return mount_base & root_wrkdirs;
when ccache => return mount_base & root_ccache;
when devices => return mount_base & root_devices;
when frameworks => return mount_base & root_frameworks;
when localbase => return mount_base & HT.USS (PM.configuration.dir_localbase);
when toolchain => return mount_base & HT.USS (PM.configuration.dir_localbase) &
toolchain_dir;
end case;
end location;
--------------------------------------------------------------------------------------------
-- mount_target
--------------------------------------------------------------------------------------------
function mount_target (point : folder) return String is
begin
case point is
when xports => return HT.USS (PM.configuration.dir_conspiracy);
when packages => return HT.USS (PM.configuration.dir_packages);
when toolchain => return HT.USS (PM.configuration.dir_toolchain);
when distfiles => return HT.USS (PM.configuration.dir_distfiles);
when ccache => return HT.USS (PM.configuration.dir_ccache);
when others => return "ERROR";
end case;
end mount_target;
--------------------------------------------------------------------------------------------
-- forge_directory
--------------------------------------------------------------------------------------------
procedure forge_directory (target : String) is
begin
DIR.Create_Path (New_Directory => target);
exception
when failed : others =>
TIO.Put_Line (EX.Exception_Information (failed));
raise scenario_unexpected with
"failed to create " & target & " directory";
end forge_directory;
--------------------------------------------------------------------------------------------
-- folder_access
--------------------------------------------------------------------------------------------
procedure folder_access (path : String; operation : folder_operation)
is
-- chattr does not work on tmpfs partitions
-- It appears immutable locking can't be supported on Linux
-- Don't use chflags schg on *BSD as securitylevel > 0 (BSD) will block it
cmd_fallback : constant String := "/bin/chmod";
fback_lock : constant String := " 555 ";
fback_unlock : constant String := " 755 ";
command : HT.Text := HT.SUS (cmd_fallback);
begin
if not DIR.Exists (path) then
return;
end if;
case operation is
when lock => HT.SU.Append (command, fback_lock & path);
when unlock => HT.SU.Append (command, fback_unlock & path);
end case;
execute (HT.USS (command));
end folder_access;
--------------------------------------------------------------------------------------------
-- folder_access
--------------------------------------------------------------------------------------------
procedure set_folder_mode (path : String; operation : folder_operation)
is
cmd : constant String := "/bin/chmod";
oplock : constant String := " 555 ";
opunlock : constant String := " 755 ";
command : HT.Text;
begin
case operation is
when lock => command := HT.SUS (cmd & oplock & path);
when unlock => command := HT.SUS (cmd & opunlock & path);
end case;
execute (HT.USS (command));
end set_folder_mode;
--------------------------------------------------------------------------------------------
-- get_workzone_path
--------------------------------------------------------------------------------------------
function get_workzone_path return String is
begin
return get_slave_mount (workzone_id);
end get_workzone_path;
--------------------------------------------------------------------------------------------
-- launch_workzone
--------------------------------------------------------------------------------------------
procedure launch_workzone
is
zone_base : constant String := get_workzone_path;
begin
forge_directory (zone_base);
if not PM.configuration.avoid_tmpfs then
-- Limit slave to 32Mb
mount_tmpfs (zone_base, 32);
end if;
end launch_workzone;
--------------------------------------------------------------------------------------------
-- destroy_workzone
--------------------------------------------------------------------------------------------
procedure destroy_workzone
is
zone_base : constant String := get_workzone_path;
begin
if not PM.configuration.avoid_tmpfs then
unmount (zone_base, 50);
end if;
annihilate_directory_tree (zone_base);
end destroy_workzone;
--------------------------------------------------------------------------------------------
-- clear_workzone_directory
--------------------------------------------------------------------------------------------
procedure clear_workzone_directory (subpath : String)
is
zone_base : constant String := get_workzone_path;
begin
annihilate_directory_tree (zone_base & "/" & subpath);
end clear_workzone_directory;
--------------------------------------------------------------------------------------------
-- launch_slave
--------------------------------------------------------------------------------------------
procedure launch_slave (id : builders; need_procfs : Boolean := False)
is
slave_base : constant String := get_slave_mount (id);
slave_local : constant String := slave_base & "_localbase";
dir_system : constant String := HT.USS (PM.configuration.dir_sysroot);
lbase : constant String := HT.USS (PM.configuration.dir_localbase);
etc_path : constant String := location (slave_base, etc);
begin
forge_directory (slave_base);
if PM.configuration.avoid_tmpfs then
if lbase = bsd_localbase then
-- /usr is write only, so to build on /usr/local, we need a dedicated mount
-- restriction isn't necessary on mac or openbsd which copies via hardlink
case platform_type is
when macos | openbsd =>
set_folder_mode (slave_base & lbase, unlock);
forge_directory (location (slave_base, toolchain));
when others =>
forge_directory (location (slave_local, toolchain));
mount_nullfs (slave_local, slave_base & lbase, readwrite);
end case;
else
forge_directory (location (slave_base, toolchain));
end if;
else
-- Limit slave to 24Gb, covers localbase + construction mainly
mount_tmpfs (slave_base, 24 * 1024);
if lbase = bsd_localbase then
mount_tmpfs (slave_base & bsd_localbase, 12 * 1024);
end if;
forge_directory (location (slave_base, toolchain));
end if;
for mnt in safefolders'Range loop
forge_directory (location (slave_base, mnt));
end loop;
-- Save a null mount on all platforms (all keeps /xports to the bare minimum)
declare
mk_directory : constant String := mount_target (xports) & "/Mk";
slave_mk : constant String := location (slave_base, xports) & "/Mk";
begin
if PM.configuration.avoid_tmpfs then
mount_hardlink (mk_directory, slave_mk, dir_system);
else
mount_fullcopy (mk_directory, slave_mk, dir_system);
end if;
process_keyword_files (slave_mk, lbase);
end;
case platform_type is
when macos | openbsd =>
mount_hardlink (location (dir_system, bin), location (slave_base, bin), dir_system);
mount_hardlink (location (dir_system, usr), location (slave_base, usr), dir_system);
mount_hardlink (mount_target (toolchain),
location (slave_base, toolchain) & "-off",
dir_system);
preplace_libgcc_s (location (slave_base, toolchain) & "-fallback");
when others =>
mount_nullfs (location (dir_system, bin), location (slave_base, bin));
mount_nullfs (location (dir_system, usr), location (slave_base, usr));
end case;
case platform_type is
when freebsd | dragonfly | netbsd | openbsd =>
-- should be limited to rtld executable
if PM.configuration.avoid_tmpfs then
mount_hardlink (target => location (dir_system, libexec),
mount_point => location (slave_base, libexec),
sysroot => dir_system);
else
-- saves a null mount (at the cost of memory)
mount_fullcopy (target => location (dir_system, libexec),
mount_point => location (slave_base, libexec),
sysroot => dir_system);
end if;
when linux =>
mount_nullfs (location (dir_system, lib), location (slave_base, lib));
mount_nullfs (location (dir_system, lib64), location (slave_base, lib64));
when sunos =>
forge_directory (location (slave_base, devices));
mount_nullfs (location (dir_system, lib), location (slave_base, lib));
mount_nullfs (root_devices, location (slave_base, devices));
when macos =>
forge_directory (location (slave_base, frameworks));
mount_nullfs (location (dir_system, frameworks), location (slave_base, frameworks));
end case;
folder_access (location (slave_base, home), lock);
folder_access (location (slave_base, root), lock);
mount_nullfs (mount_target (packages), location (slave_base, packages), mode => readwrite);
mount_nullfs (mount_target (distfiles), location (slave_base, distfiles), mode => readwrite);
if need_procfs or else
platform_type = linux or else
platform_type = sunos
then
mount_procfs (path_to_proc => location (slave_base, proc));
end if;
if DIR.Exists (mount_target (ccache)) then
mount_nullfs (mount_target (ccache), location (slave_base, ccache), readwrite);
end if;
mount_devices (location (slave_base, dev));
populate_var_folder (location (slave_base, var));
copy_rc_default (etc_path);
copy_resolv_conf (etc_path);
copy_ldconfig_hints (slave_base & "/var/run");
copy_unkindness_IDs (slave_base & "/construction");
fix_macos_resolv (slave_base & "/var/run");
create_make_conf (etc_path);
install_passwd_and_group (etc_path);
create_etc_services (etc_path);
create_etc_shells (etc_path);
create_sun_files (etc_path);
install_linux_ldsoconf (location (slave_base, etc_ldsocnf));
exception
when hiccup : others =>
TIO.Put_Line (abnormal_log,
"LAUNCH SLAVE" & id'Img & " FAILED: " & EX.Exception_Information (hiccup));
Signals.initiate_shutdown;
end launch_slave;
--------------------------------------------------------------------------------------------
-- destroy_slave
--------------------------------------------------------------------------------------------
procedure destroy_slave (id : builders; need_procfs : Boolean := False)
is
slave_base : constant String := get_slave_mount (id);
slave_local : constant String := slave_base & "_localbase";
dir_system : constant String := HT.USS (PM.configuration.dir_sysroot);
lbase : constant String := HT.USS (PM.configuration.dir_localbase);
retry1min : constant Natural := 6;
counter : Natural := 0;
begin
unmount_devices (location (slave_base, dev));
if DIR.Exists (mount_target (ccache)) then
unmount (location (slave_base, ccache), retry1min);
end if;
if need_procfs or else
platform_type = linux or else
platform_type = sunos
then
unmount_procfs (location (slave_base, proc));
end if;
unmount (location (slave_base, distfiles), retry1min);
unmount (location (slave_base, packages), retry1min);
if DIR.Exists (slave_base & toolchain_tag) then
unhook_toolchain (id);
end if;
case platform_type is
when macos | openbsd => null;
when others =>
unmount (location (slave_base, bin));
unmount (location (slave_base, usr));
end case;
case platform_type is
when freebsd | dragonfly | netbsd | openbsd =>
null; -- libexec is copied now
when linux =>
unmount (location (slave_base, lib));
unmount (location (slave_base, lib64));
when sunos =>
unmount (location (slave_base, lib));
unmount (location (slave_base, devices));
when macos =>
unmount (location (slave_base, frameworks));
end case;
if PM.configuration.avoid_tmpfs then
if lbase = bsd_localbase then
case platform_type is
when macos | openbsd => null;
when others =>
unmount (slave_base & lbase, retry1min);
end case;
end if;
annihilate_directory_tree (slave_local);
else
if lbase = bsd_localbase then
unmount (slave_base & lbase, retry1min);
end if;
unmount (slave_base, retry1min * 5);
end if;
annihilate_directory_tree (slave_base);
exception
when hiccup : others =>
TIO.Put_Line (abnormal_log,
"DESTROY SLAVE" & id'Img & " FAILED: " & EX.Exception_Information (hiccup));
Signals.initiate_shutdown;
end destroy_slave;
--------------------------------------------------------------------------------------------
-- hook_toolchain
--------------------------------------------------------------------------------------------
procedure hook_toolchain (id : builders)
is
use type DIR.File_Kind;
slave_base : constant String := get_slave_mount (id);
tc_path : constant String := location (slave_base, toolchain);
forged : TIO.File_Type;
begin
-- When hook_toolchain is called, there very well may be installed packages that
-- brought in gcc libs and installed them at /raven/toolchain.
-- For null-mount systems, the toolchain is mounted over /raven/toolchain, but it's
-- unmounted before package deinstallation.
-- For NFS-mount systems, the toolchain is hardlink-copied at toolchain-off. The
-- toolchain and toolchain-off are renamed toolchain-packages and toolchain respectively.
-- This is reversed during unhooking.
case platform_type is
when macos | openbsd =>
DIR.Rename (Old_Name => tc_path, New_Name => tc_path & "-packaged");
DIR.Rename (Old_Name => tc_path & "-off", New_Name => tc_path);
when others =>
mount_nullfs (mount_target (toolchain), tc_path);
end case;
TIO.Create (File => forged,
Mode => TIO.Out_File,
Name => slave_base & toolchain_tag);
TIO.Close (forged);
end hook_toolchain;
--------------------------------------------------------------------------------------------
-- unhook_toolchain
--------------------------------------------------------------------------------------------
procedure unhook_toolchain (id : builders)
is
use type DIR.File_Kind;
slave_base : constant String := get_slave_mount (id);
tc_path : constant String := location (slave_base, toolchain);
begin
case platform_type is
when macos | openbsd =>
DIR.Rename (Old_Name => tc_path, New_Name => tc_path & "-off");
DIR.Rename (Old_Name => tc_path & "-packaged", New_Name => tc_path);
when others =>
unmount (tc_path);
end case;
DIR.Delete_File (slave_base & toolchain_tag);
end unhook_toolchain;
--------------------------------------------------------------------------------------------
-- slave_name
--------------------------------------------------------------------------------------------
function slave_name (id : builders) return String
is
id_image : constant String := HT.int2str (Integer (id));
suffix : String := "SL00";
begin
if id < 10 then
suffix (4) := id_image (id_image'First);
else
suffix (3 .. 4) := id_image (id_image'First .. id_image'First + 1);
end if;
return suffix;
end slave_name;
--------------------------------------------------------------------------------------------
-- populate_var_folder
--------------------------------------------------------------------------------------------
procedure populate_var_folder (path : String) is
begin
forge_directory (path & "/cache");
forge_directory (path & "/cron");
forge_directory (path & "/db");
forge_directory (path & "/empty");
forge_directory (path & "/games");
forge_directory (path & "/log");
forge_directory (path & "/mail");
forge_directory (path & "/msgs");
forge_directory (path & "/preserve");
forge_directory (path & "/run/sem");
forge_directory (path & "/spool");
forge_directory (path & "/tmp");
end populate_var_folder;
--------------------------------------------------------------------------------------------
-- copy_ldconfig_hints
--------------------------------------------------------------------------------------------
procedure copy_ldconfig_hints (path_to_varrun : String)
is
mm : constant String := get_master_mount;
hints : constant String := "/ld-elf.so.hints";
nhints : constant String := "/ld.so.hints";
begin
case platform_type is
when dragonfly | freebsd =>
DIR.Copy_File (mm & hints, path_to_varrun & hints);
when netbsd | openbsd =>
DIR.Copy_File (mm & nhints, path_to_varrun & nhints);
when macos | linux | sunos => null;
end case;
end copy_ldconfig_hints;
--------------------------------------------------------------------------------------------
-- fix_macos_resolv
--------------------------------------------------------------------------------------------
procedure fix_macos_resolv (path_to_varrun : String)
is
DNSR : constant String := "/mDNSResponder";
path_orig : constant String := "/var/run" & DNSR;
path_dest : constant String := path_to_varrun & DNSR;
errprefix : constant String := "Hardlink failure: ";
begin
case platform_type is
when macos =>
if DIR.Exists (path_orig) then
if not Unix.create_hardlink (path_orig, path_dest) then
TIO.Put_Line (errprefix & "link " & path_dest & " to " & path_orig);
end if;
else
raise scenario_unexpected
with errprefix & path_orig & " is not present on system";
end if;
when others => null;
end case;
end fix_macos_resolv;
--------------------------------------------------------------------------------------------
-- preplace_libgcc_s
--------------------------------------------------------------------------------------------
procedure preplace_libgcc_s (path_to_toolchain : String)
is
mpath : constant String := "/" & default_compiler & "/lib";
dylib : constant String := mpath & "/libgcc_s.1.dylib";
TC : constant String := mount_target (toolchain);
begin
if DIR.Exists (TC & dylib) then
forge_directory (path_to_toolchain & mpath);
DIR.Copy_File (Source_Name => TC & dylib,
Target_Name => path_to_toolchain & dylib);
else
raise scenario_unexpected
with TC & dylib & " is not present on system";
end if;
end preplace_libgcc_s;
--------------------------------------------------------------------------------------------
-- populate_var_folder
--------------------------------------------------------------------------------------------
procedure copy_rc_default (path_to_etc : String)
is
mm : constant String := get_master_mount;
rcconf : constant String := "/rc.conf";
begin
if DIR.Exists (mm & rcconf) then
DIR.Copy_File (Source_Name => mm & rcconf,
Target_Name => path_to_etc & "/defaults" & rcconf);
end if;
end copy_rc_default;
--------------------------------------------------------------------------------------------
-- copy_resolv_conf
--------------------------------------------------------------------------------------------
procedure copy_resolv_conf (path_to_etc : String)
is
procedure install (filename : String);
resolv : constant String := "/resolv.conf";
netconfig : constant String := "/netconfig";
nssconf : constant String := "/nsswitch.conf";
nssfiles : constant String := "/nsswitch.files";
nssdns : constant String := "/nsswitch.dns";
procedure install (filename : String) is
begin
if DIR.Exists ("/etc" & filename) then
DIR.Copy_File (Source_Name => "/etc" & filename,
Target_Name => path_to_etc & filename);
end if;
end install;
begin
install (resolv);
install (netconfig);
install (nssconf);
install (nssfiles);
install (nssdns);
end copy_resolv_conf;
--------------------------------------------------------------------------------------------
-- copy_unkindness_IDs
--------------------------------------------------------------------------------------------
procedure copy_unkindness_IDs (path_to_construction : String)
is
procedure install (filename, new_name : String);
dir_unkindness : constant String := HT.USS (PM.configuration.dir_unkindness);
procedure install (filename, new_name : String) is
begin
if DIR.Exists (filename) then
DIR.Copy_File (Source_Name => filename,
Target_Name => path_to_construction & new_name);
end if;
end install;
begin
if dir_unkindness /= PM.no_unkindness then
install (dir_unkindness & "/custom_UID", "/.UID.custom");
install (dir_unkindness & "/custom_GID", "/.GID.custom");
end if;
end copy_unkindness_IDs;
--------------------------------------------------------------------------------------------
-- install_passwd
--------------------------------------------------------------------------------------------
procedure install_passwd_and_group (path_to_etc : String)
is
procedure install (filename : String);
mm : constant String := get_master_mount;
maspwd : constant String := "/master.passwd";
passwd : constant String := "/passwd";
spwd : constant String := "/spwd.db";
pwd : constant String := "/pwd.db";
group : constant String := "/group";
mtree1 : constant String := "/mtree.preconfig.exclude";
mtree2 : constant String := "/mtree.prestage.exclude";
ldcnf2 : constant String := "/ld.so.conf";
procedure install (filename : String) is
begin
if DIR.Exists (mm & filename) then
DIR.Copy_File (Source_Name => mm & filename,
Target_Name => path_to_etc & filename);
end if;
end install;
begin
install (passwd);
install (maspwd);
install (spwd);
install (pwd);
install (group);
install (mtree1);
install (mtree2);
install (ldcnf2);
end install_passwd_and_group;
--------------------------------------------------------------------------------------------
-- install_linux_ldsoconf
--------------------------------------------------------------------------------------------
procedure install_linux_ldsoconf (path_to_etc_ldsocnf : String)
is
procedure install (filename : String);
mm : constant String := get_master_mount;
ldconf : constant String := "/x86_64-linux-gnu.conf";
procedure install (filename : String) is
begin
if DIR.Exists (mm & filename) then
DIR.Copy_File (Source_Name => mm & filename,
Target_Name => path_to_etc_ldsocnf & filename);
end if;
end install;
begin
install (ldconf);
end install_linux_ldsoconf;
--------------------------------------------------------------------------------------------
-- create_etc_services
--------------------------------------------------------------------------------------------
procedure create_etc_services (path_to_etc : String)
is
svcfile : TIO.File_Type;
begin
TIO.Create (File => svcfile,
Mode => TIO.Out_File,
Name => path_to_etc & "/services");
TIO.Put_Line (svcfile,
"ftp 21/tcp" & LAT.LF &
"ftp 21/udp" & LAT.LF &
"ssh 22/tcp" & LAT.LF &
"ssh 22/udp" & LAT.LF &
"http 80/tcp" & LAT.LF &
"http 80/udp" & LAT.LF &
"https 443/tcp" & LAT.LF &
"https 443/udp" & LAT.LF);
TIO.Close (svcfile);
end create_etc_services;
--------------------------------------------------------------------------------------------
-- create_etc_shells
--------------------------------------------------------------------------------------------
procedure create_etc_shells (path_to_etc : String)
is
shells : TIO.File_Type;
begin
TIO.Create (File => shells,
Mode => TIO.Out_File,
Name => path_to_etc & "/shells");
TIO.Put_Line (shells, "/bin/sh");
TIO.Put_Line (shells, "/bin/csh");
if platform_type = linux then
TIO.Put_Line (shells, "/bin/bash");
end if;
TIO.Close (shells);
end create_etc_shells;
--------------------------------------------------------------------------------------------
-- create_make_conf
--------------------------------------------------------------------------------------------
procedure create_make_conf (path_to_etc : String)
is
procedure override_defaults (label : String; value : HT.Text);
makeconf : TIO.File_Type;
profilemc : constant String := PM.raven_confdir & "/" &
HT.USS (PM.configuration.profile) & "-make.conf";
profile : constant String := HT.USS (PM.configuration.profile);
mjnum : constant Integer := Integer (PM.configuration.jobs_limit);
procedure override_defaults (label : String; value : HT.Text) is
begin
if not (HT.equivalent (value, ports_default)) then
TIO.Put_Line (makeconf, "DEFAULT_VERSIONS+=" & label & "=" & HT.USS (value));
end if;
end override_defaults;
begin
TIO.Create (File => makeconf,
Mode => TIO.Out_File,
Name => path_to_etc & "/make.conf");
TIO.Put_Line
(makeconf,
"RAVENPROFILE=" & profile & LAT.LF &
"RAVENBASE=" & HT.USS (PM.configuration.dir_localbase) & LAT.LF &
"WRKDIRPREFIX=/construction" & LAT.LF &
"DISTDIR=/distfiles" & LAT.LF &
"NUMBER_CPUS=" & HT.int2str (Integer (PM.configuration.number_cores)) & LAT.LF &
"MAKE_JOBS_NUMBER_LIMIT=" & HT.int2str (mjnum));
if developer_mode then
TIO.Put_Line (makeconf, "DEVELOPER=1");
TIO.Put_Line (makeconf, "PATCH_DEBUG=yes");
end if;
if DIR.Exists (HT.USS (PM.configuration.dir_ccache)) then
TIO.Put_Line (makeconf, "BUILD_WITH_CCACHE=yes");
TIO.Put_Line (makeconf, "CCACHE_DIR=/ccache");
end if;
override_defaults ("firebird", PM.configuration.def_firebird);
override_defaults ("lua", PM.configuration.def_lua);
override_defaults ("mysql", PM.configuration.def_mysql_group);
override_defaults ("perl5", PM.configuration.def_perl);
override_defaults ("php", PM.configuration.def_php);
override_defaults ("pgsql", PM.configuration.def_postgresql);
override_defaults ("python3", PM.configuration.def_python3);
override_defaults ("ruby", PM.configuration.def_ruby);
override_defaults ("ssl", PM.configuration.def_ssl);
override_defaults ("tcl", PM.configuration.def_tcl_tk);
concatenate_makeconf (makeconf, profilemc);
TIO.Close (makeconf);
end create_make_conf;
--------------------------------------------------------------------------------------------
-- create_make_conf
--------------------------------------------------------------------------------------------
procedure concatenate_makeconf (makeconf_handle : TIO.File_Type; target_name : String)
is
fragment : TIO.File_Type;
begin
if DIR.Exists (target_name) then
TIO.Open (File => fragment, Mode => TIO.In_File, Name => target_name);
while not TIO.End_Of_File (fragment) loop
declare
Line : String := TIO.Get_Line (fragment);
begin
TIO.Put_Line (makeconf_handle, Line);
end;
end loop;
TIO.Close (fragment);
end if;
exception
when others => null;
end concatenate_makeconf;
--------------------------------------------------------------------------------------------
-- create_sun_files
--------------------------------------------------------------------------------------------
procedure create_sun_files (path_to_etc : String)
is
sun_file : TIO.File_Type;
security : constant String := path_to_etc & "/security";
skel : constant String := path_to_etc & "/skel";
begin
if platform_type /= sunos then
return;
end if;
-- version found in Solaris 10u8
-- #
-- # Copyright 2008 Sun Microsystems, Inc. All rights reserved.
-- # Use is subject to license terms.
-- #
-- #ident "@(#)crypt.conf 1.2 08/05/14 SMI"
-- #
-- # The algorithm name __unix__ is reserved.
--
-- 1 crypt_bsdmd5.so.1
-- 2a crypt_bsdbf.so.1
-- md5 crypt_sunmd5.so.1
-- 5 crypt_sha256.so.1
-- 6 crypt_sha512.so.1
DIR.Create_Path (security);
TIO.Create (sun_file, TIO.Out_File, security & "/crypt.conf");
TIO.Put_Line (sun_file, "1 crypt_bsdmd5.so.1");
TIO.Put_Line (sun_file, "2a crypt_bsdbf.so.1");
TIO.Put_Line (sun_file, "md5 crypt_sunmd5.so.1");
TIO.Put_Line (sun_file, "5 crypt_sha256.so.1");
TIO.Put_Line (sun_file, "6 crypt_sha512.so.1");
TIO.Close (sun_file);
-- Dummy /etc/user_attr to allow useradd to succeed
TIO.Create (sun_file, TIO.Out_File, path_to_etc & "/user_attr");
TIO.Put_Line (sun_file, "adm::::profiles=Log Management");
TIO.Put_Line (sun_file, "lp::::profiles=Printer Management");
TIO.Close (sun_file);
-- Create skel files
DIR.Create_Path (skel);
TIO.Create (sun_file, TIO.Out_File, skel & "/local.cshrc");
TIO.Put_Line (sun_file, "umask 022");
TIO.Put_Line (sun_file, "set path=(/bin /usr/bin /usr/ucb /etc .)");
TIO.Put_Line (sun_file, "if ( $?prompt ) then");
TIO.Put_Line (sun_file, " set history=32");
TIO.Put_Line (sun_file, "endif");
TIO.Close (sun_file);
-- skel/local.login
TIO.Create (sun_file, TIO.Out_File, skel & "/local.login");
TIO.Put_Line (sun_file, "stty -istrip");
TIO.Close (sun_file);
-- skel/local.profile
TIO.Create (sun_file, TIO.Out_File, skel & "/local.profile");
TIO.Put_Line (sun_file, "stty istrip");
TIO.Put_Line (sun_file, "PATH=/usr/bin:/usr/ucb:/etc:.");
TIO.Put_Line (sun_file, "export PATH");
TIO.Close (sun_file);
-- etc/datemsk (extremely pared done)
TIO.Create (sun_file, TIO.Out_File, path_to_etc & "/datemsk");
TIO.Put_Line (sun_file, "%m/%d/%y %H:%M");
TIO.Put_Line (sun_file, "%m%d%H%M%y");
TIO.Close (sun_file);
-- etc/shadow (couple of entries)
TIO.Create (sun_file, TIO.Out_File, path_to_etc & "/shadow");
TIO.Put_Line (sun_file, "root:kF/MO3YejnKKE:6445::::::");
TIO.Put_Line (sun_file, "adm:NP:6445::::::");
TIO.Put_Line (sun_file, "lp:NP:6445::::::");
TIO.Put_Line (sun_file, "nobody:*LK*:6445::::::");
TIO.Put_Line (sun_file, "nobody4:*LK*:6445::::::");
TIO.Close (sun_file);
-- etc/project
TIO.Create (sun_file, TIO.Out_File, path_to_etc & "/project");
TIO.Put_Line (sun_file, "system:0::::");
TIO.Put_Line (sun_file, "user.root:1::::");
TIO.Put_Line (sun_file, "noproject:2::::");
TIO.Put_Line (sun_file, "default:3::::");
TIO.Put_Line (sun_file, "group.staff:10::::");
TIO.Close (sun_file);
end create_sun_files;
--------------------------------------------------------------------------------------------
-- process keyword files
--------------------------------------------------------------------------------------------
procedure process_keyword_files (slave_mk : String; localbase : String)
is
procedure process_file (keyfile : String);
Search : DIR.Search_Type;
Dir_Ent : DIR.Directory_Entry_Type;
keydir : constant String := slave_mk & "/Keywords";
procedure process_file (keyfile : String)
is
contents : constant String := FOP.get_file_contents (keyfile);
lpattern : constant String := "%LOCALBASE%";
modified : Boolean := False;
finaltxt : HT.Text := HT.SUS (contents);
begin
loop
exit when not HT.contains (finaltxt, lpattern);
modified := True;
finaltxt := HT.replace_substring (finaltxt, lpattern, localbase);
end loop;
if modified then
DIR.Delete_File (keyfile);
FOP.dump_contents_to_file (HT.USS (finaltxt), keyfile);
end if;
end process_file;
begin
DIR.Start_Search (Search => Search,
Directory => keydir,
Filter => (DIR.Ordinary_File => True, others => False),
Pattern => "*.ucl");
while DIR.More_Entries (Search => Search) loop
DIR.Get_Next_Entry (Search => Search, Directory_Entry => Dir_Ent);
declare
kfile : constant String := keydir & "/" & DIR.Simple_Name (Dir_Ent);
begin
process_file (kfile);
end;
end loop;
DIR.End_Search (Search);
end process_keyword_files;
end Replicant;
| 39.3398 | 99 | 0.486842 |
38871ec073eccc25458e758f7d2fcfdace9cef19 | 6,943 | ads | Ada | source/nodes/program-nodes-single_task_declarations.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/nodes/program-nodes-single_task_declarations.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/nodes/program-nodes-single_task_declarations.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | 2 | 2019-09-14T23:18:50.000Z | 2019-10-02T10:11:40.000Z | -- Copyright (c) 2019 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Program.Lexical_Elements;
with Program.Elements.Defining_Identifiers;
with Program.Elements.Aspect_Specifications;
with Program.Elements.Expressions;
with Program.Elements.Task_Definitions;
with Program.Elements.Single_Task_Declarations;
with Program.Element_Visitors;
package Program.Nodes.Single_Task_Declarations is
pragma Preelaborate;
type Single_Task_Declaration is
new Program.Nodes.Node
and Program.Elements.Single_Task_Declarations.Single_Task_Declaration
and Program.Elements.Single_Task_Declarations
.Single_Task_Declaration_Text
with private;
function Create
(Task_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
With_Token : Program.Lexical_Elements.Lexical_Element_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Is_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
New_Token : Program.Lexical_Elements.Lexical_Element_Access;
Progenitors : Program.Elements.Expressions.Expression_Vector_Access;
With_Token_2 : Program.Lexical_Elements.Lexical_Element_Access;
Definition : not null Program.Elements.Task_Definitions
.Task_Definition_Access;
Semicolon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access)
return Single_Task_Declaration;
type Implicit_Single_Task_Declaration is
new Program.Nodes.Node
and Program.Elements.Single_Task_Declarations.Single_Task_Declaration
with private;
function Create
(Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Progenitors : Program.Elements.Expressions
.Expression_Vector_Access;
Definition : not null Program.Elements.Task_Definitions
.Task_Definition_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_Single_Task_Declaration
with Pre =>
Is_Part_Of_Implicit or Is_Part_Of_Inherited or Is_Part_Of_Instance;
private
type Base_Single_Task_Declaration is
abstract new Program.Nodes.Node
and Program.Elements.Single_Task_Declarations.Single_Task_Declaration
with record
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Progenitors : Program.Elements.Expressions.Expression_Vector_Access;
Definition : not null Program.Elements.Task_Definitions
.Task_Definition_Access;
end record;
procedure Initialize
(Self : aliased in out Base_Single_Task_Declaration'Class);
overriding procedure Visit
(Self : not null access Base_Single_Task_Declaration;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class);
overriding function Name
(Self : Base_Single_Task_Declaration)
return not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
overriding function Aspects
(Self : Base_Single_Task_Declaration)
return Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
overriding function Progenitors
(Self : Base_Single_Task_Declaration)
return Program.Elements.Expressions.Expression_Vector_Access;
overriding function Definition
(Self : Base_Single_Task_Declaration)
return not null Program.Elements.Task_Definitions.Task_Definition_Access;
overriding function Is_Single_Task_Declaration_Element
(Self : Base_Single_Task_Declaration)
return Boolean;
overriding function Is_Declaration_Element
(Self : Base_Single_Task_Declaration)
return Boolean;
type Single_Task_Declaration is
new Base_Single_Task_Declaration
and Program.Elements.Single_Task_Declarations
.Single_Task_Declaration_Text
with record
Task_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
With_Token : Program.Lexical_Elements.Lexical_Element_Access;
Is_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
New_Token : Program.Lexical_Elements.Lexical_Element_Access;
With_Token_2 : Program.Lexical_Elements.Lexical_Element_Access;
Semicolon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
end record;
overriding function To_Single_Task_Declaration_Text
(Self : aliased in out Single_Task_Declaration)
return Program.Elements.Single_Task_Declarations
.Single_Task_Declaration_Text_Access;
overriding function Task_Token
(Self : Single_Task_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function With_Token
(Self : Single_Task_Declaration)
return Program.Lexical_Elements.Lexical_Element_Access;
overriding function Is_Token
(Self : Single_Task_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function New_Token
(Self : Single_Task_Declaration)
return Program.Lexical_Elements.Lexical_Element_Access;
overriding function With_Token_2
(Self : Single_Task_Declaration)
return Program.Lexical_Elements.Lexical_Element_Access;
overriding function Semicolon_Token
(Self : Single_Task_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
type Implicit_Single_Task_Declaration is
new Base_Single_Task_Declaration
with record
Is_Part_Of_Implicit : Boolean;
Is_Part_Of_Inherited : Boolean;
Is_Part_Of_Instance : Boolean;
end record;
overriding function To_Single_Task_Declaration_Text
(Self : aliased in out Implicit_Single_Task_Declaration)
return Program.Elements.Single_Task_Declarations
.Single_Task_Declaration_Text_Access;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Single_Task_Declaration)
return Boolean;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Single_Task_Declaration)
return Boolean;
overriding function Is_Part_Of_Instance
(Self : Implicit_Single_Task_Declaration)
return Boolean;
end Program.Nodes.Single_Task_Declarations;
| 37.733696 | 79 | 0.745499 |
1e2fac80137a2d54590acf5407519b6801fd7c35 | 6,137 | ads | Ada | .emacs.d/elpa/ada-mode-7.0.1/wisi-ada.ads | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/ada-mode-7.0.1/wisi-ada.ads | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/ada-mode-7.0.1/wisi-ada.ads | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | -- Abstract :
--
-- Ada language specific indent options and functions
--
-- [1] ada.wy
-- [2] ada-indent-user-options.el
--
-- Copyright (C) 2017 - 2020 Free Software Foundation, Inc.
--
-- This library is free software; you can redistribute it and/or modify it
-- under terms of the GNU General Public License as published by the Free
-- Software Foundation; either version 3, or (at your option) any later
-- version. This library is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHAN-
-- TABILITY or FITNESS FOR A PARTICULAR PURPOSE.
-- As a special exception under Section 7 of GPL version 3, you are granted
-- additional permissions described in the GCC Runtime Library Exception,
-- version 3.1, as published by the Free Software Foundation.
pragma License (Modified_GPL);
package Wisi.Ada is
Language_Protocol_Version : constant String := "3";
-- Defines the data passed to Initialize in Params.
--
-- This value must match ada-mode.el
-- ada-wisi-language-protocol-version.
--
-- Only changes once per ada-mode release. Increment as soon as
-- required, record new version in NEWS-ada-mode.text.
-- Indent parameters from [2]
Ada_Indent : Integer := 3;
Ada_Indent_Broken : Integer := 2;
Ada_Indent_Comment_Col_0 : Boolean := False;
Ada_Indent_Comment_GNAT : Boolean := False;
Ada_Indent_Label : Integer := -3;
Ada_Indent_Record_Rel_Type : Integer := 3;
Ada_Indent_Renames : Integer := 2;
Ada_Indent_Return : Integer := 0;
Ada_Indent_Use : Integer := 2;
Ada_Indent_When : Integer := 3;
Ada_Indent_With : Integer := 2;
Ada_Indent_Hanging_Rel_Exp : Boolean := False;
-- Other parameters
End_Names_Optional : Boolean := False;
type Parse_Data_Type is new Wisi.Parse_Data_Type with null record;
overriding
procedure Initialize
(Data : in out Parse_Data_Type;
Lexer : in WisiToken.Lexer.Handle;
Descriptor : access constant WisiToken.Descriptor;
Base_Terminals : in WisiToken.Base_Token_Array_Access;
Post_Parse_Action : in Post_Parse_Action_Type;
Begin_Line : in WisiToken.Line_Number_Type;
End_Line : in WisiToken.Line_Number_Type;
Begin_Indent : in Integer;
Params : in String);
-- Call Wisi_Runtime.Initialize, then:
--
-- If Params /= "", set all language-specific parameters from Params,
-- in declaration order; otherwise keep default values. Boolean is
-- represented by 0 | 1. Parameter values are space delimited.
--
-- Also do any other initialization that Data needs.
overriding
function Indent_Hanging_1
(Data : in out Parse_Data_Type;
Tree : in WisiToken.Syntax_Trees.Tree;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array;
Tree_Indenting : in WisiToken.Syntax_Trees.Valid_Node_Index;
Indenting_Comment : in Boolean;
Delta_1 : in Simple_Indent_Param;
Delta_2 : in Simple_Indent_Param;
Option : in Boolean;
Accumulate : in Boolean)
return Delta_Type;
overriding
procedure Refactor
(Data : in out Parse_Data_Type;
Tree : in WisiToken.Syntax_Trees.Tree;
Action : in Positive;
Edit_Begin : in WisiToken.Buffer_Pos);
----------
-- The following are declared in ada.wy %elisp_indent, and must match
-- Language_Indent_Function.
function Ada_Indent_Aggregate
(Data : in out Wisi.Parse_Data_Type'Class;
Tree : in WisiToken.Syntax_Trees.Tree;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array;
Tree_Indenting : in WisiToken.Syntax_Trees.Valid_Node_Index;
Indenting_Comment : in Boolean;
Args : in Wisi.Indent_Arg_Arrays.Vector)
return Wisi.Delta_Type;
-- [1] ada-indent-aggregate
function Ada_Indent_Renames_0
(Data : in out Wisi.Parse_Data_Type'Class;
Tree : in WisiToken.Syntax_Trees.Tree;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array;
Tree_Indenting : in WisiToken.Syntax_Trees.Valid_Node_Index;
Indenting_Comment : in Boolean;
Args : in Wisi.Indent_Arg_Arrays.Vector)
return Wisi.Delta_Type;
-- [1] ada-indent-renames
function Ada_Indent_Return_0
(Data : in out Wisi.Parse_Data_Type'Class;
Tree : in WisiToken.Syntax_Trees.Tree;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array;
Tree_Indenting : in WisiToken.Syntax_Trees.Valid_Node_Index;
Indenting_Comment : in Boolean;
Args : in Wisi.Indent_Arg_Arrays.Vector)
return Wisi.Delta_Type;
-- [1] ada-indent-return
function Ada_Indent_Record_0
(Data : in out Wisi.Parse_Data_Type'Class;
Tree : in WisiToken.Syntax_Trees.Tree;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array;
Tree_Indenting : in WisiToken.Syntax_Trees.Valid_Node_Index;
Indenting_Comment : in Boolean;
Args : in Wisi.Indent_Arg_Arrays.Vector)
return Wisi.Delta_Type;
-- [1] ada-indent-record
function Ada_Indent_Record_1
(Data : in out Wisi.Parse_Data_Type'Class;
Tree : in WisiToken.Syntax_Trees.Tree;
Tokens : in WisiToken.Syntax_Trees.Valid_Node_Index_Array;
Tree_Indenting : in WisiToken.Syntax_Trees.Valid_Node_Index;
Indenting_Comment : in Boolean;
Args : in Wisi.Indent_Arg_Arrays.Vector)
return Wisi.Delta_Type;
-- [1] ada-indent-record*
end Wisi.Ada;
| 41.748299 | 79 | 0.63109 |
adad387f2dac22e8bc205521c8d3cbe46ad55be4 | 4,883 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/s-tasinf.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-tasinf.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/s-tasinf.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 . T A S K _ I N F O --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2014, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains the definitions and routines associated with the
-- implementation and use of the Task_Info pragma. It is specialized
-- appropriately for targets that make use of this pragma.
-- Note: the compiler generates direct calls to this interface, via Rtsfind.
-- Any changes to this interface may require corresponding compiler changes.
-- The functionality in this unit is now provided by the predefined package
-- System.Multiprocessors and the CPU aspect. This package is obsolescent.
package System.Task_Info is
pragma Obsolescent (Task_Info, "use System.Multiprocessors and CPU aspect");
pragma Preelaborate;
pragma Elaborate_Body;
-- To ensure that a body is allowed
-----------------------------------------
-- Implementation of Task_Info Feature --
-----------------------------------------
-- The Task_Info pragma:
-- pragma Task_Info (EXPRESSION);
-- allows the specification on a task by task basis of a value of type
-- System.Task_Info.Task_Info_Type to be passed to a task when it is
-- created. The specification of this type, and the effect on the task
-- that is created is target dependent.
-- The Task_Info pragma appears within a task definition (compare the
-- definition and implementation of pragma Priority). If no such pragma
-- appears, then the value Unspecified_Task_Info is passed. If a pragma
-- is present, then it supplies an alternative value. If the argument of
-- the pragma is a discriminant reference, then the value can be set on
-- a task by task basis by supplying the appropriate discriminant value.
-- Note that this means that the type used for Task_Info_Type must be
-- suitable for use as a discriminant (i.e. a scalar or access type).
------------------
-- Declarations --
------------------
type Scope_Type is
(Process_Scope,
-- Contend only with threads in same process
System_Scope,
-- Contend with all threads on same CPU
Default_Scope);
type Task_Info_Type is new Scope_Type;
-- Type used for passing information to task create call, using the
-- Task_Info pragma. This type may be specialized for individual
-- implementations, but it must be a type that can be used as a
-- discriminant (i.e. a scalar or access type).
Unspecified_Task_Info : constant Task_Info_Type := Default_Scope;
-- Value passed to task in the absence of a Task_Info pragma
end System.Task_Info;
| 51.946809 | 79 | 0.533279 |
1e204c503ab6934402c4d7d110fafa9fd539ec47 | 3,178 | ads | Ada | tools-src/gnu/gcc/gcc/ada/s-io.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-io.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-io.ads | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M _ I O --
-- --
-- S p e c --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-1998 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. --
-- --
------------------------------------------------------------------------------
-- A simple text I/O package, used for diagnostic output in the runtime,
-- This package is also preelaborated, unlike Text_Io, and can thus be
-- with'ed by preelaborated library units. It includes only Put routines
-- for character, integer, string and a new line function
package System.IO is
pragma Preelaborate (IO);
procedure Put (X : Integer);
procedure Put (C : Character);
procedure Put (S : String);
procedure Put_Line (S : String);
procedure New_Line (Spacing : Positive := 1);
end System.IO;
| 58.851852 | 78 | 0.443046 |
59234ff8d6f98dafc6f4d952439998d7e1cb8d7d | 13,002 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/exp_tss.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/exp_tss.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/exp_tss.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- E X P _ T S S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. 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. --
-- --
------------------------------------------------------------------------------
-- Type Support Subprogram (TSS) handling
with Namet; use Namet;
with Types; use Types;
package Exp_Tss is
-- A type support subprogram (TSS) is an internally generated function or
-- procedure that is associated with a particular type. Examples are the
-- implicit initialization procedure, and subprograms for the Input and
-- Output attributes.
-- A given TSS is either generated once at the point of the declaration of
-- the type, or it is generated as needed in clients, but only one copy is
-- required in any one generated object file. The choice between these two
-- possibilities is made on a TSS-by-TSS basis depending on the estimation
-- of how likely the TSS is to be used. Initialization procedures fall in
-- the first category, for example, since it is likely that any declared
-- type will be used in a context requiring initialization, but the stream
-- attributes use the second approach, since it is more likely that they
-- will not be used at all, or will only be used in one client in any case.
-------------------------
-- Current Limitations --
-------------------------
-- In the current version of this package, only the case of generating a
-- TSS at the point of declaration of the type is accommodated. A clear
-- improvement would be to follow through with the full implementation
-- as described above, and also accommodate the requirement of generating
-- only one copy in a given object file.
-- For now, we deal with the local case by generating duplicate versions
-- of the TSS routine, which is clearly rather inefficient in space usage.
-- This is done by using Make_TSS_Name_Local to generate unique names
-- for the different instances of TSS routines in a given scope.
----------------
-- TSS Naming --
----------------
-- A TSS is identified by its Chars name. The name has the form typXY or
-- typ_<serial>XY, where typ is the type name, and XY are two characters
-- that identify the particular TSS routine. A unique serial number is
-- included for the case where several local instances of the same TSS
-- must be generated (see discussion under Make_TSS_Name_Local).
-- The following codes are used to denote TSSs:
-- Note: When making additions to this list, make the corresponding change
-- to the list in snames.adb-tmpl.
type TSS_Name_Type is new String (1 .. 2);
subtype TNT is TSS_Name_Type;
TSS_Deep_Adjust : constant TNT := "DA"; -- Deep Adjust
TSS_Deep_Finalize : constant TNT := "DF"; -- Deep Finalize
TSS_Deep_Initialize : constant TNT := "DI"; -- Deep Initialize
TSS_Composite_Equality : constant TNT := "EQ"; -- Composite Equality
TSS_Finalize_Address : constant TNT := "FD"; -- Finalize Address
TSS_From_Any : constant TNT := "FA"; -- PolyORB/DSA From_Any
TSS_Init_Proc : constant TNT := "IP"; -- Initialization Procedure
TSS_CPP_Init_Proc : constant TNT := "IC"; -- Init C++ dispatch tables
TSS_RAS_Access : constant TNT := "RA"; -- RAS type access
TSS_RAS_Dereference : constant TNT := "RD"; -- RAS type dereference
TSS_Rep_To_Pos : constant TNT := "RP"; -- Rep to Pos conversion
TSS_Slice_Assign : constant TNT := "SA"; -- Slice assignment
TSS_Stream_Input : constant TNT := "SI"; -- Stream Input attribute
TSS_Stream_Output : constant TNT := "SO"; -- Stream Output attribute
TSS_Stream_Read : constant TNT := "SR"; -- Stream Read attribute
TSS_Stream_Write : constant TNT := "SW"; -- Stream Write attribute
TSS_Put_Image : constant TNT := "PI"; -- Put_Image attribute
TSS_To_Any : constant TNT := "TA"; -- PolyORB/DSA To_Any
TSS_TypeCode : constant TNT := "TC"; -- PolyORB/DSA TypeCode
-- The array below contains all valid TSS names
TSS_Names : constant array (Natural range <>) of TSS_Name_Type :=
(TSS_Deep_Adjust,
TSS_Deep_Finalize,
TSS_Deep_Initialize,
TSS_Composite_Equality,
TSS_Finalize_Address,
TSS_From_Any,
TSS_Init_Proc,
TSS_CPP_Init_Proc,
TSS_RAS_Access,
TSS_RAS_Dereference,
TSS_Rep_To_Pos,
TSS_Slice_Assign,
TSS_Stream_Input,
TSS_Stream_Output,
TSS_Stream_Read,
TSS_Stream_Write,
TSS_Put_Image,
TSS_To_Any,
TSS_TypeCode);
TSS_Null : constant TNT := " ";
-- Dummy entry used to indicated that this is not really a TSS
function Get_TSS_Name (E : Entity_Id) return TSS_Name_Type;
-- Given an entity, if it is a TSS, then return the corresponding TSS
-- name type, otherwise return TSS_Null.
function Make_TSS_Name
(Typ : Entity_Id;
Nam : TSS_Name_Type) return Name_Id;
-- Construct the name as described above for the given TSS routine
-- identified by Nam for the type identified by Typ.
function Make_TSS_Name_Local
(Typ : Entity_Id;
Nam : TSS_Name_Type) return Name_Id;
-- Similar to the above call, but a string of the form _nnn is inserted
-- before the TSS code suffix, where nnn is a unique serial number. This
-- is used when multiple instances of the same TSS routine may be
-- generated in the same scope (see also discussion above of current
-- limitations).
function Make_Init_Proc_Name (Typ : Entity_Id) return Name_Id;
-- Version for init procs, same as Make_TSS_Name (Typ, TSS_Init_Proc)
function Is_CPP_Init_Proc (E : Entity_Id) return Boolean;
-- Version for CPP init procs, same as Is_TSS (E, TSS_CPP_Init_Proc);
function Is_Init_Proc (E : Entity_Id) return Boolean;
-- Version for init procs, same as Is_TSS (E, TSS_Init_Proc);
-- WARNING: There is a matching C declaration of this subprogram in fe.h
function Is_TSS (E : Entity_Id; Nam : TSS_Name_Type) return Boolean;
-- Determines if given entity (E) is the name of a TSS identified by Nam
function Is_TSS (N : Name_Id; Nam : TSS_Name_Type) return Boolean;
-- Same test applied directly to a Name_Id value
-----------------------------------------
-- TSS Data structures and Subprograms --
-----------------------------------------
-- The TSS's for a given type are stored in an element list associated with
-- the type, and referenced from the TSS_Elist field of the N_Freeze_Entity
-- node associated with the type (all types that need TSS's always need to
-- be explicitly frozen, so the N_Freeze_Entity node always exists).
function TSS (Typ : Entity_Id; Nam : TSS_Name_Type) return Entity_Id;
function TSS (Typ : Entity_Id; Nam : Name_Id) return Entity_Id;
-- Finds the TSS with the given name associated with the given type.
-- If no such TSS exists, then Empty is returned.
function Same_TSS (E1, E2 : Entity_Id) return Boolean;
-- Returns True if E1 and E2 are the same kind of TSS, even if the names
-- are different (i.e. if the names of E1 and E2 end with two upper case
-- letters that are the same).
procedure Set_TSS (Typ : Entity_Id; TSS : Entity_Id);
-- This procedure is used to install a newly created TSS. The second
-- argument is the entity for such a new TSS. This entity is placed in the
-- TSS list for the type given as the first argument, replacing an old
-- entry of the same name if one was present. The tree for the body of this
-- TSS, which is not analyzed yet, is placed in the actions field of the
-- freeze node for the type. All such bodies are inserted into the main
-- tree and analyzed at the point at which the freeze node itself is
-- expanded.
procedure Copy_TSS (TSS : Entity_Id; Typ : Entity_Id);
-- Given an existing TSS for another type (which is already installed,
-- analyzed and expanded), install it as the corresponding TSS for Typ.
-- Note that this just copies a reference, not the tree. This can also be
-- used to initially install a TSS in the case where the subprogram for the
-- TSS has already been created and its declaration processed.
function CPP_Init_Proc (Typ : Entity_Id) return Entity_Id;
-- Obtains the CPP_Init TSS entity the given type. The CPP_Init TSS is a
-- procedure used to initialize the C++ part of the primary and secondary
-- dispatch tables of a tagged type derived from CPP types.
function Init_Proc
(Typ : Entity_Id;
Ref : Entity_Id := Empty) return Entity_Id;
-- Obtains the _init TSS entry for the given type. This function call is
-- equivalent to TSS (Typ, Name_uInit). The _init TSS is the procedure
-- used to initialize otherwise uninitialized instances of a type. If
-- there is no _init TSS, then the type requires no initialization. Note
-- that subtypes and implicit types never have an _init TSS since subtype
-- objects are always initialized using the initialization procedure for
-- the corresponding base type (see Base_Init_Proc function). A special
-- case arises for concurrent types. Such types do not themselves have an
-- init proc TSS, but initialization is required. The init proc used is
-- the one for the corresponding record type (see Base_Init_Proc). If
-- Ref is present it is a call to a subprogram whose profile matches the
-- profile of the required constructor (this argument is used to handle
-- non-default CPP constructors).
function Base_Init_Proc
(Typ : Entity_Id;
Ref : Entity_Id := Empty) return Entity_Id;
-- Obtains the _Init TSS entry from the base type of the entity, and also
-- deals with going indirect through the Corresponding_Record_Type field
-- for concurrent objects (which are initialized with the initialization
-- routine for the corresponding record type). Returns Empty if there is no
-- _Init TSS entry for the base type. If Ref is present it is a call to a
-- subprogram whose profile matches the profile of the required constructor
-- (this argument is used to handle non-default CPP constructors).
procedure Set_Init_Proc (Typ : Entity_Id; Init : Entity_Id);
pragma Inline (Set_Init_Proc);
-- The second argument is the _init TSS to be established for the type
-- given as the first argument. Equivalent to Set_TSS (Typ, Init).
function Has_Non_Null_Base_Init_Proc (Typ : Entity_Id) return Boolean;
-- Returns true if the given type has a defined Base_Init_Proc and
-- this init proc is not a null init proc (null init procs occur as
-- a result of the processing for Initialize_Scalars). This function
-- is used to test for the presence of an init proc in cases where
-- a null init proc is considered equivalent to no init proc.
function Find_Inherited_TSS
(Typ : Entity_Id;
Nam : TSS_Name_Type) return Entity_Id;
-- Returns the TSS of name Nam of Typ, or of its closest ancestor defining
-- such a TSS. Empty is returned is neither Typ nor any of its ancestors
-- have such a TSS.
end Exp_Tss;
| 51.595238 | 79 | 0.644055 |
2e7c99d55aebf2de47381f32fa74d9a6b47cb5ef | 25,508 | adb | Ada | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-stratt.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-stratt.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-stratt.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . S T R E A M _ A T T R I B U T E S --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.IO_Exceptions;
with Ada.Streams; use Ada.Streams;
with Ada.Unchecked_Conversion;
with System.Stream_Attributes.XDR;
package body System.Stream_Attributes is
XDR_Flag : Integer;
pragma Import (C, XDR_Flag, "__gl_xdr_stream");
-- This imported value is used to determine whether the build had the
-- binder switch "-xdr" present which enables XDR streaming and sets this
-- flag to 1.
function XDR_Support return Boolean;
pragma Inline (XDR_Support);
-- Return True if XDR streaming should be used. Note that 128-bit integers
-- are not supported by the XDR protocol and will raise Device_Error.
Err : exception renames Ada.IO_Exceptions.End_Error;
-- Exception raised if insufficient data read (note that the RM implies
-- that Data_Error might be the appropriate choice, but AI95-00132
-- decides with a binding interpretation that End_Error is preferred).
SU : constant := System.Storage_Unit;
subtype SEA is Ada.Streams.Stream_Element_Array;
subtype SEO is Ada.Streams.Stream_Element_Offset;
generic function UC renames Ada.Unchecked_Conversion;
-- Subtypes used to define Stream_Element_Array values that map
-- into the elementary types, using unchecked conversion.
Thin_Pointer_Size : constant := System.Address'Size;
Fat_Pointer_Size : constant := System.Address'Size * 2;
subtype S_AD is SEA (1 .. (Fat_Pointer_Size + SU - 1) / SU);
subtype S_AS is SEA (1 .. (Thin_Pointer_Size + SU - 1) / SU);
subtype S_B is SEA (1 .. (Boolean'Size + SU - 1) / SU);
subtype S_C is SEA (1 .. (Character'Size + SU - 1) / SU);
subtype S_F is SEA (1 .. (Float'Size + SU - 1) / SU);
subtype S_I is SEA (1 .. (Integer'Size + SU - 1) / SU);
subtype S_I24 is SEA (1 .. (Integer_24'Size + SU - 1) / SU);
subtype S_LF is SEA (1 .. (Long_Float'Size + SU - 1) / SU);
subtype S_LI is SEA (1 .. (Long_Integer'Size + SU - 1) / SU);
subtype S_LLF is SEA (1 .. (Long_Long_Float'Size + SU - 1) / SU);
subtype S_LLI is SEA (1 .. (Long_Long_Integer'Size + SU - 1) / SU);
subtype S_LLLI is SEA (1 .. (Long_Long_Long_Integer'Size + SU - 1) / SU);
subtype S_LLLU is
SEA (1 .. (UST.Long_Long_Long_Unsigned'Size + SU - 1) / SU);
subtype S_LLU is SEA (1 .. (UST.Long_Long_Unsigned'Size + SU - 1) / SU);
subtype S_LU is SEA (1 .. (UST.Long_Unsigned'Size + SU - 1) / SU);
subtype S_SF is SEA (1 .. (Short_Float'Size + SU - 1) / SU);
subtype S_SI is SEA (1 .. (Short_Integer'Size + SU - 1) / SU);
subtype S_SSI is SEA (1 .. (Short_Short_Integer'Size + SU - 1) / SU);
subtype S_SSU is SEA (1 .. (UST.Short_Short_Unsigned'Size + SU - 1) / SU);
subtype S_SU is SEA (1 .. (UST.Short_Unsigned'Size + SU - 1) / SU);
subtype S_U is SEA (1 .. (UST.Unsigned'Size + SU - 1) / SU);
subtype S_U24 is SEA (1 .. (Unsigned_24'Size + SU - 1) / SU);
subtype S_WC is SEA (1 .. (Wide_Character'Size + SU - 1) / SU);
subtype S_WWC is SEA (1 .. (Wide_Wide_Character'Size + SU - 1) / SU);
-- Unchecked conversions from the elementary type to the stream type
function From_AD is new UC (Fat_Pointer, S_AD);
function From_AS is new UC (Thin_Pointer, S_AS);
function From_F is new UC (Float, S_F);
function From_I is new UC (Integer, S_I);
function From_I24 is new UC (Integer_24, S_I24);
function From_LF is new UC (Long_Float, S_LF);
function From_LI is new UC (Long_Integer, S_LI);
function From_LLF is new UC (Long_Long_Float, S_LLF);
function From_LLI is new UC (Long_Long_Integer, S_LLI);
function From_LLLI is new UC (Long_Long_Long_Integer, S_LLLI);
function From_LLLU is new UC (UST.Long_Long_Long_Unsigned, S_LLLU);
function From_LLU is new UC (UST.Long_Long_Unsigned, S_LLU);
function From_LU is new UC (UST.Long_Unsigned, S_LU);
function From_SF is new UC (Short_Float, S_SF);
function From_SI is new UC (Short_Integer, S_SI);
function From_SSI is new UC (Short_Short_Integer, S_SSI);
function From_SSU is new UC (UST.Short_Short_Unsigned, S_SSU);
function From_SU is new UC (UST.Short_Unsigned, S_SU);
function From_U is new UC (UST.Unsigned, S_U);
function From_U24 is new UC (Unsigned_24, S_U24);
function From_WC is new UC (Wide_Character, S_WC);
function From_WWC is new UC (Wide_Wide_Character, S_WWC);
-- Unchecked conversions from the stream type to elementary type
function To_AD is new UC (S_AD, Fat_Pointer);
function To_AS is new UC (S_AS, Thin_Pointer);
function To_F is new UC (S_F, Float);
function To_I is new UC (S_I, Integer);
function To_I24 is new UC (S_I24, Integer_24);
function To_LF is new UC (S_LF, Long_Float);
function To_LI is new UC (S_LI, Long_Integer);
function To_LLF is new UC (S_LLF, Long_Long_Float);
function To_LLI is new UC (S_LLI, Long_Long_Integer);
function To_LLLI is new UC (S_LLLI, Long_Long_Long_Integer);
function To_LLLU is new UC (S_LLLU, UST.Long_Long_Long_Unsigned);
function To_LLU is new UC (S_LLU, UST.Long_Long_Unsigned);
function To_LU is new UC (S_LU, UST.Long_Unsigned);
function To_SF is new UC (S_SF, Short_Float);
function To_SI is new UC (S_SI, Short_Integer);
function To_SSI is new UC (S_SSI, Short_Short_Integer);
function To_SSU is new UC (S_SSU, UST.Short_Short_Unsigned);
function To_SU is new UC (S_SU, UST.Short_Unsigned);
function To_U is new UC (S_U, UST.Unsigned);
function To_U24 is new UC (S_U24, Unsigned_24);
function To_WC is new UC (S_WC, Wide_Character);
function To_WWC is new UC (S_WWC, Wide_Wide_Character);
-----------------
-- XDR_Support --
-----------------
function XDR_Support return Boolean is
begin
return XDR_Flag = 1;
end XDR_Support;
-----------------
-- Block_IO_OK --
-----------------
function Block_IO_OK return Boolean is
begin
return not XDR_Support;
end Block_IO_OK;
----------
-- I_AD --
----------
function I_AD (Stream : not null access RST) return Fat_Pointer is
T : S_AD;
L : SEO;
begin
if XDR_Support then
return XDR.I_AD (Stream);
end if;
Ada.Streams.Read (Stream.all, T, L);
if L < T'Last then
raise Err;
else
return To_AD (T);
end if;
end I_AD;
----------
-- I_AS --
----------
function I_AS (Stream : not null access RST) return Thin_Pointer is
T : S_AS;
L : SEO;
begin
if XDR_Support then
return XDR.I_AS (Stream);
end if;
Ada.Streams.Read (Stream.all, T, L);
if L < T'Last then
raise Err;
else
return To_AS (T);
end if;
end I_AS;
---------
-- I_B --
---------
function I_B (Stream : not null access RST) return Boolean is
T : S_B;
L : SEO;
begin
if XDR_Support then
return XDR.I_B (Stream);
end if;
Ada.Streams.Read (Stream.all, T, L);
if L < T'Last then
raise Err;
else
return Boolean'Val (T (1));
end if;
end I_B;
---------
-- I_C --
---------
function I_C (Stream : not null access RST) return Character is
T : S_C;
L : SEO;
begin
if XDR_Support then
return XDR.I_C (Stream);
end if;
Ada.Streams.Read (Stream.all, T, L);
if L < T'Last then
raise Err;
else
return Character'Val (T (1));
end if;
end I_C;
---------
-- I_F --
---------
function I_F (Stream : not null access RST) return Float is
T : S_F;
L : SEO;
begin
if XDR_Support then
return XDR.I_F (Stream);
end if;
Ada.Streams.Read (Stream.all, T, L);
if L < T'Last then
raise Err;
else
return To_F (T);
end if;
end I_F;
---------
-- I_I --
---------
function I_I (Stream : not null access RST) return Integer is
T : S_I;
L : SEO;
begin
if XDR_Support then
return XDR.I_I (Stream);
end if;
Ada.Streams.Read (Stream.all, T, L);
if L < T'Last then
raise Err;
else
return To_I (T);
end if;
end I_I;
-----------
-- I_I24 --
-----------
function I_I24 (Stream : not null access RST) return Integer_24 is
T : S_I24;
L : SEO;
begin
if XDR_Support then
return XDR.I_I24 (Stream);
end if;
Ada.Streams.Read (Stream.all, T, L);
if L < T'Last then
raise Err;
else
return To_I24 (T);
end if;
end I_I24;
----------
-- I_LF --
----------
function I_LF (Stream : not null access RST) return Long_Float is
T : S_LF;
L : SEO;
begin
if XDR_Support then
return XDR.I_LF (Stream);
end if;
Ada.Streams.Read (Stream.all, T, L);
if L < T'Last then
raise Err;
else
return To_LF (T);
end if;
end I_LF;
----------
-- I_LI --
----------
function I_LI (Stream : not null access RST) return Long_Integer is
T : S_LI;
L : SEO;
begin
if XDR_Support then
return XDR.I_LI (Stream);
end if;
Ada.Streams.Read (Stream.all, T, L);
if L < T'Last then
raise Err;
else
return To_LI (T);
end if;
end I_LI;
-----------
-- I_LLF --
-----------
function I_LLF (Stream : not null access RST) return Long_Long_Float is
T : S_LLF;
L : SEO;
begin
if XDR_Support then
return XDR.I_LLF (Stream);
end if;
Ada.Streams.Read (Stream.all, T, L);
if L < T'Last then
raise Err;
else
return To_LLF (T);
end if;
end I_LLF;
-----------
-- I_LLI --
-----------
function I_LLI (Stream : not null access RST) return Long_Long_Integer is
T : S_LLI;
L : SEO;
begin
if XDR_Support then
return XDR.I_LLI (Stream);
end if;
Ada.Streams.Read (Stream.all, T, L);
if L < T'Last then
raise Err;
else
return To_LLI (T);
end if;
end I_LLI;
------------
-- I_LLLI --
------------
function I_LLLI (Stream : not null access RST) return Long_Long_Long_Integer
is
T : S_LLLI;
L : SEO;
begin
if XDR_Support then
raise Ada.IO_Exceptions.Device_Error;
end if;
Ada.Streams.Read (Stream.all, T, L);
if L < T'Last then
raise Err;
else
return To_LLLI (T);
end if;
end I_LLLI;
------------
-- I_LLLU --
------------
function I_LLLU
(Stream : not null access RST) return UST.Long_Long_Long_Unsigned
is
T : S_LLLU;
L : SEO;
begin
if XDR_Support then
raise Ada.IO_Exceptions.Device_Error;
end if;
Ada.Streams.Read (Stream.all, T, L);
if L < T'Last then
raise Err;
else
return To_LLLU (T);
end if;
end I_LLLU;
-----------
-- I_LLU --
-----------
function I_LLU
(Stream : not null access RST) return UST.Long_Long_Unsigned
is
T : S_LLU;
L : SEO;
begin
if XDR_Support then
return XDR.I_LLU (Stream);
end if;
Ada.Streams.Read (Stream.all, T, L);
if L < T'Last then
raise Err;
else
return To_LLU (T);
end if;
end I_LLU;
----------
-- I_LU --
----------
function I_LU (Stream : not null access RST) return UST.Long_Unsigned is
T : S_LU;
L : SEO;
begin
if XDR_Support then
return XDR.I_LU (Stream);
end if;
Ada.Streams.Read (Stream.all, T, L);
if L < T'Last then
raise Err;
else
return To_LU (T);
end if;
end I_LU;
----------
-- I_SF --
----------
function I_SF (Stream : not null access RST) return Short_Float is
T : S_SF;
L : SEO;
begin
if XDR_Support then
return XDR.I_SF (Stream);
end if;
Ada.Streams.Read (Stream.all, T, L);
if L < T'Last then
raise Err;
else
return To_SF (T);
end if;
end I_SF;
----------
-- I_SI --
----------
function I_SI (Stream : not null access RST) return Short_Integer is
T : S_SI;
L : SEO;
begin
if XDR_Support then
return XDR.I_SI (Stream);
end if;
Ada.Streams.Read (Stream.all, T, L);
if L < T'Last then
raise Err;
else
return To_SI (T);
end if;
end I_SI;
-----------
-- I_SSI --
-----------
function I_SSI (Stream : not null access RST) return Short_Short_Integer is
T : S_SSI;
L : SEO;
begin
if XDR_Support then
return XDR.I_SSI (Stream);
end if;
Ada.Streams.Read (Stream.all, T, L);
if L < T'Last then
raise Err;
else
return To_SSI (T);
end if;
end I_SSI;
-----------
-- I_SSU --
-----------
function I_SSU
(Stream : not null access RST) return UST.Short_Short_Unsigned
is
T : S_SSU;
L : SEO;
begin
if XDR_Support then
return XDR.I_SSU (Stream);
end if;
Ada.Streams.Read (Stream.all, T, L);
if L < T'Last then
raise Err;
else
return To_SSU (T);
end if;
end I_SSU;
----------
-- I_SU --
----------
function I_SU (Stream : not null access RST) return UST.Short_Unsigned is
T : S_SU;
L : SEO;
begin
if XDR_Support then
return XDR.I_SU (Stream);
end if;
Ada.Streams.Read (Stream.all, T, L);
if L < T'Last then
raise Err;
else
return To_SU (T);
end if;
end I_SU;
---------
-- I_U --
---------
function I_U (Stream : not null access RST) return UST.Unsigned is
T : S_U;
L : SEO;
begin
if XDR_Support then
return XDR.I_U (Stream);
end if;
Ada.Streams.Read (Stream.all, T, L);
if L < T'Last then
raise Err;
else
return To_U (T);
end if;
end I_U;
-----------
-- I_U24 --
-----------
function I_U24 (Stream : not null access RST) return Unsigned_24 is
T : S_U24;
L : SEO;
begin
if XDR_Support then
return XDR.I_U24 (Stream);
end if;
Ada.Streams.Read (Stream.all, T, L);
if L < T'Last then
raise Err;
else
return To_U24 (T);
end if;
end I_U24;
----------
-- I_WC --
----------
function I_WC (Stream : not null access RST) return Wide_Character is
T : S_WC;
L : SEO;
begin
if XDR_Support then
return XDR.I_WC (Stream);
end if;
Ada.Streams.Read (Stream.all, T, L);
if L < T'Last then
raise Err;
else
return To_WC (T);
end if;
end I_WC;
-----------
-- I_WWC --
-----------
function I_WWC (Stream : not null access RST) return Wide_Wide_Character is
T : S_WWC;
L : SEO;
begin
if XDR_Support then
return XDR.I_WWC (Stream);
end if;
Ada.Streams.Read (Stream.all, T, L);
if L < T'Last then
raise Err;
else
return To_WWC (T);
end if;
end I_WWC;
----------
-- W_AD --
----------
procedure W_AD (Stream : not null access RST; Item : Fat_Pointer) is
T : constant S_AD := From_AD (Item);
begin
if XDR_Support then
XDR.W_AD (Stream, Item);
return;
end if;
Ada.Streams.Write (Stream.all, T);
end W_AD;
----------
-- W_AS --
----------
procedure W_AS (Stream : not null access RST; Item : Thin_Pointer) is
T : constant S_AS := From_AS (Item);
begin
if XDR_Support then
XDR.W_AS (Stream, Item);
return;
end if;
Ada.Streams.Write (Stream.all, T);
end W_AS;
---------
-- W_B --
---------
procedure W_B (Stream : not null access RST; Item : Boolean) is
T : S_B;
begin
if XDR_Support then
XDR.W_B (Stream, Item);
return;
end if;
T (1) := Boolean'Pos (Item);
Ada.Streams.Write (Stream.all, T);
end W_B;
---------
-- W_C --
---------
procedure W_C (Stream : not null access RST; Item : Character) is
T : S_C;
begin
if XDR_Support then
XDR.W_C (Stream, Item);
return;
end if;
T (1) := Character'Pos (Item);
Ada.Streams.Write (Stream.all, T);
end W_C;
---------
-- W_F --
---------
procedure W_F (Stream : not null access RST; Item : Float) is
begin
if XDR_Support then
XDR.W_F (Stream, Item);
return;
end if;
Ada.Streams.Write (Stream.all, From_F (Item));
end W_F;
---------
-- W_I --
---------
procedure W_I (Stream : not null access RST; Item : Integer) is
begin
if XDR_Support then
XDR.W_I (Stream, Item);
return;
end if;
Ada.Streams.Write (Stream.all, From_I (Item));
end W_I;
-----------
-- W_I24 --
-----------
procedure W_I24 (Stream : not null access RST; Item : Integer_24) is
begin
if XDR_Support then
XDR.W_I24 (Stream, Item);
return;
end if;
Ada.Streams.Write (Stream.all, From_I24 (Item));
end W_I24;
----------
-- W_LF --
----------
procedure W_LF (Stream : not null access RST; Item : Long_Float) is
begin
if XDR_Support then
XDR.W_LF (Stream, Item);
return;
end if;
Ada.Streams.Write (Stream.all, From_LF (Item));
end W_LF;
----------
-- W_LI --
----------
procedure W_LI (Stream : not null access RST; Item : Long_Integer) is
begin
if XDR_Support then
XDR.W_LI (Stream, Item);
return;
end if;
Ada.Streams.Write (Stream.all, From_LI (Item));
end W_LI;
-----------
-- W_LLF --
-----------
procedure W_LLF (Stream : not null access RST; Item : Long_Long_Float) is
begin
if XDR_Support then
XDR.W_LLF (Stream, Item);
return;
end if;
Ada.Streams.Write (Stream.all, From_LLF (Item));
end W_LLF;
-----------
-- W_LLI --
-----------
procedure W_LLI (Stream : not null access RST; Item : Long_Long_Integer) is
begin
if XDR_Support then
XDR.W_LLI (Stream, Item);
return;
end if;
Ada.Streams.Write (Stream.all, From_LLI (Item));
end W_LLI;
------------
-- W_LLLI --
------------
procedure W_LLLI
(Stream : not null access RST; Item : Long_Long_Long_Integer) is
begin
if XDR_Support then
raise Ada.IO_Exceptions.Device_Error;
end if;
Ada.Streams.Write (Stream.all, From_LLLI (Item));
end W_LLLI;
------------
-- W_LLLU --
------------
procedure W_LLLU
(Stream : not null access RST; Item : UST.Long_Long_Long_Unsigned)
is
begin
if XDR_Support then
raise Ada.IO_Exceptions.Device_Error;
end if;
Ada.Streams.Write (Stream.all, From_LLLU (Item));
end W_LLLU;
-----------
-- W_LLU --
-----------
procedure W_LLU
(Stream : not null access RST; Item : UST.Long_Long_Unsigned)
is
begin
if XDR_Support then
XDR.W_LLU (Stream, Item);
return;
end if;
Ada.Streams.Write (Stream.all, From_LLU (Item));
end W_LLU;
----------
-- W_LU --
----------
procedure W_LU (Stream : not null access RST; Item : UST.Long_Unsigned) is
begin
if XDR_Support then
XDR.W_LU (Stream, Item);
return;
end if;
Ada.Streams.Write (Stream.all, From_LU (Item));
end W_LU;
----------
-- W_SF --
----------
procedure W_SF (Stream : not null access RST; Item : Short_Float) is
begin
if XDR_Support then
XDR.W_SF (Stream, Item);
return;
end if;
Ada.Streams.Write (Stream.all, From_SF (Item));
end W_SF;
----------
-- W_SI --
----------
procedure W_SI (Stream : not null access RST; Item : Short_Integer) is
begin
if XDR_Support then
XDR.W_SI (Stream, Item);
return;
end if;
Ada.Streams.Write (Stream.all, From_SI (Item));
end W_SI;
-----------
-- W_SSI --
-----------
procedure W_SSI
(Stream : not null access RST; Item : Short_Short_Integer)
is
begin
if XDR_Support then
XDR.W_SSI (Stream, Item);
return;
end if;
Ada.Streams.Write (Stream.all, From_SSI (Item));
end W_SSI;
-----------
-- W_SSU --
-----------
procedure W_SSU
(Stream : not null access RST; Item : UST.Short_Short_Unsigned)
is
begin
if XDR_Support then
XDR.W_SSU (Stream, Item);
return;
end if;
Ada.Streams.Write (Stream.all, From_SSU (Item));
end W_SSU;
----------
-- W_SU --
----------
procedure W_SU (Stream : not null access RST; Item : UST.Short_Unsigned) is
begin
if XDR_Support then
XDR.W_SU (Stream, Item);
return;
end if;
Ada.Streams.Write (Stream.all, From_SU (Item));
end W_SU;
---------
-- W_U --
---------
procedure W_U (Stream : not null access RST; Item : UST.Unsigned) is
begin
if XDR_Support then
XDR.W_U (Stream, Item);
return;
end if;
Ada.Streams.Write (Stream.all, From_U (Item));
end W_U;
-----------
-- W_U24 --
-----------
procedure W_U24 (Stream : not null access RST; Item : Unsigned_24) is
begin
if XDR_Support then
XDR.W_U24 (Stream, Item);
return;
end if;
Ada.Streams.Write (Stream.all, From_U24 (Item));
end W_U24;
----------
-- W_WC --
----------
procedure W_WC (Stream : not null access RST; Item : Wide_Character) is
begin
if XDR_Support then
XDR.W_WC (Stream, Item);
return;
end if;
Ada.Streams.Write (Stream.all, From_WC (Item));
end W_WC;
-----------
-- W_WWC --
-----------
procedure W_WWC
(Stream : not null access RST; Item : Wide_Wide_Character)
is
begin
if XDR_Support then
XDR.W_WWC (Stream, Item);
return;
end if;
Ada.Streams.Write (Stream.all, From_WWC (Item));
end W_WWC;
end System.Stream_Attributes;
| 24.316492 | 79 | 0.514113 |
38a305c92cdcca55f8a86c117effa189ff7fe1ab | 7,315 | ads | Ada | src/ascon.ads | jhumphry/Ascon_SPARK | 3ec888b0f62f7c3afa9c76643551d46703d4a112 | [
"0BSD"
] | 1 | 2020-10-14T08:43:14.000Z | 2020-10-14T08:43:14.000Z | src/ascon.ads | jhumphry/Ascon_SPARK | 3ec888b0f62f7c3afa9c76643551d46703d4a112 | [
"0BSD"
] | null | null | null | src/ascon.ads | jhumphry/Ascon_SPARK | 3ec888b0f62f7c3afa9c76643551d46703d4a112 | [
"0BSD"
] | null | null | null | -- Ascon
-- an Ada / SPARK implementation of the Ascon Authenticated Encryption Algorithm
-- created by Christoph Dobraunig, Maria Eichlseder, Florian Mendel and
-- Martin Schläffer
-- Copyright (c) 2016-2018, James Humphry - see LICENSE file for details
pragma Restrictions(No_Implementation_Attributes,
No_Implementation_Units,
No_Obsolescent_Features);
with System.Storage_Elements;
private with Interfaces;
with Ascon_Definitions;
use Ascon_Definitions;
generic
a_rounds : Round_Count := 12;
b_rounds : Round_Count := 6;
b_round_constants_offset : Round_Offset := 6;
rate : Rate_Bits := 64;
package Ascon
with SPARK_Mode => On
is
-- These constants are the same for all variants of Ascon
key_bits : constant := 128;
nonce_bits : constant := 128;
tag_bits : constant := 128;
use System.Storage_Elements;
subtype Key_Type is Storage_Array(0..Storage_Offset(key_bits/8)-1);
-- A Storage_Array subtype containing key material.
subtype Nonce_Type is Storage_Array(0..Storage_Offset(nonce_bits/8)-1);
-- A Storage_Array subtype containing the nonce material. This must be unique
-- per-message.
subtype Tag_Type is Storage_Array(0..Storage_Offset(tag_bits/8)-1);
-- A Storage_Array subtype containing an authentication tag.
Null_Storage_Array : constant Storage_Array(1..0) := (others => 0);
-- A null Storage_Array that can be passed to AEADEnc and AEADDec if one of
-- the associated data or message parameters is not required.
-- High-level API for Ascon
procedure AEADEnc(K : in Key_Type;
N : in Nonce_Type;
A : in Storage_Array;
M : in Storage_Array;
C : out Storage_Array;
T : out Tag_Type)
with Pre => (
(Valid_Storage_Array_Parameter(A) and
Valid_Storage_Array_Parameter(M) and
Valid_Storage_Array_Parameter(C'First, C'Last))
and then C'Length = M'Length
);
-- AEADEnc carries out an authenticated encryption
-- K : key data
-- N : nonce
-- A : optional (unencrypted) associated data
-- M : optional message to be encrypted
-- C : encrypted version of M
-- T : authentication tag for (A,M,Z)
procedure AEADDec(K : in Key_Type;
N : in Nonce_Type;
A : in Storage_Array;
C : in Storage_Array;
T : in Tag_Type;
M : out Storage_Array;
Valid : out Boolean)
with Pre => (
(Valid_Storage_Array_Parameter(A) and
Valid_Storage_Array_Parameter(C) and
Valid_Storage_Array_Parameter(M'First, M'Last))
and then M'Length = C'Length
),
Post => (Valid or (for all I in M'Range => M(I) = 0));
-- AEADEnc carries out an authenticated decryption
-- K : key data
-- N : nonce
-- A : optional (unencrypted) associated data
-- C : optional ciphertext to be decrypted
-- T : authentication tag
-- M : contains the decrypted C or zero if the input does not authenticate
-- Valid : indicates if the input authenticates correctly
type State is private;
-- This type declaration makes the Ascon.Access_Internals package easier to
-- write. It is not intended for normal use.
function Valid_Storage_Array_Parameter(X : in Storage_Array)
return Boolean
with Ghost;
-- This ghost function simplifies the preconditions
function Valid_Storage_Array_Parameter(First : in Storage_Offset;
Last : in Storage_Offset)
return Boolean
with Ghost;
-- This ghost function simplifies the preconditions
private
function Valid_Storage_Array_Parameter(X : in Storage_Array)
return Boolean is
(
if X'First <= 0 then
((Long_Long_Integer (X'Last) < Long_Long_Integer'Last +
Long_Long_Integer (X'First))
and then
X'Last < Storage_Offset'Last - Storage_Offset(rate/8))
else
X'Last < Storage_Offset'Last - Storage_Offset(rate/8)
);
function Valid_Storage_Array_Parameter(First : in Storage_Offset;
Last : in Storage_Offset)
return Boolean is
(
if First <= 0 then
((Long_Long_Integer (Last) < Long_Long_Integer'Last +
Long_Long_Integer (First))
and then
Last < Storage_Offset'Last - Storage_Offset(rate/8))
else
Last < Storage_Offset'Last - Storage_Offset(rate/8)
);
subtype Word is Interfaces.Unsigned_64;
type State is array (Integer range 0..4) of Word;
-- Low-level API for Ascon. These routines can be accessed by instantiating
-- the Ascon.Access_Internals child package
function Make_State return State;
function Initialise (Key : in Key_Type; Nonce : in Nonce_Type) return State;
procedure Absorb (S : in out State; X : in Storage_Array)
with Pre=> (Valid_Storage_Array_Parameter(X));
procedure Encrypt (S : in out State;
M : in Storage_Array;
C : out Storage_Array)
with Relaxed_Initialization => C,
Pre => (
(Valid_Storage_Array_Parameter(M) and
Valid_Storage_Array_Parameter(C'First, C'Last))
and then C'Length = M'Length
),
Post => C'Initialized;
procedure Decrypt (S : in out State;
C : in Storage_Array;
M : out Storage_Array)
with Relaxed_Initialization => M,
Pre => (
(Valid_Storage_Array_Parameter(C) and
Valid_Storage_Array_Parameter(M'First, M'Last))
and then C'Length = M'Length
),
Post => M'Initialized;
procedure Finalise (S : in out State; Key : in Key_Type; Tag : out Tag_Type)
with Relaxed_Initialization => Tag, Post => Tag'Initialized;
-- These compile-time checks test requirements that cannot be expressed
-- in the generic formal parameters. Currently compile-time checks are
-- not supported in GNATprove so the related warnings are suppressed.
pragma Warnings (GNATprove, Off, "Compile_Time_Error");
pragma Compile_Time_Error (key_bits /= tag_bits,
"The tag has to be the same length as the key");
pragma Compile_Time_Error (rate mod 64 /= 0,
"The rate is not a multiple of 64 bits");
pragma Compile_Time_Error (System.Storage_Elements.Storage_Element'Size /= 8,
"This implementation of Ascon cannot work " &
"with Storage_Element'Size /= 8");
pragma Compile_Time_Error (b_rounds + b_round_constants_offset > 12,
"Ascon requires b_rounds +" &
" b_round_constants_offset to be <= 12");
pragma Warnings (GNATprove, On, "Compile_Time_Error");
end Ascon;
| 37.901554 | 80 | 0.604785 |
38e83fb7e8d4aec65c4d92cdc8fff92310fc8b77 | 300,300 | adb | Ada | prj/HLS/solution1/.autopilot/db/singleGUV.adb | VenciFreeman/Compress | 2e7b3b82960333c0005a766ae55470e0e7a21327 | [
"Apache-2.0"
] | 5 | 2020-05-11T20:01:54.000Z | 2022-01-26T15:50:35.000Z | prj/HLS/solution1/.autopilot/db/singleGUV.adb | VenciFreeman/Compress | 2e7b3b82960333c0005a766ae55470e0e7a21327 | [
"Apache-2.0"
] | null | null | null | prj/HLS/solution1/.autopilot/db/singleGUV.adb | VenciFreeman/Compress | 2e7b3b82960333c0005a766ae55470e0e7a21327 | [
"Apache-2.0"
] | 1 | 2021-03-23T20:29:52.000Z | 2021-03-23T20:29:52.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>singleGUV</name>
<ret_bitwidth>32</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>5</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>subimg</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>subimg</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>64</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>u</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>u</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>v</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>v</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_4">
<Value>
<Obj>
<type>1</type>
<id>4</id>
<name>inv</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>inv</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_5">
<Value>
<Obj>
<type>1</type>
<id>5</id>
<name>cosMat</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>cosMat</originalName>
<rtlName/>
<coreName>RAM</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>64</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>79</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>6</id>
<name>G</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>G</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>95</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name>inv_read</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>inv</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>97</item>
<item>98</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>v_read</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>v</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>100</item>
<item>101</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>u_read</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>u</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>102</item>
<item>103</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>v_cast2_cast</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>v_cast2_cast_fu_212_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>104</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>tmp_18</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_18_fu_215_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>106</item>
<item>107</item>
<item>109</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>tmp_19_cast</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_19_cast_fu_222_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>u_cast1_cast</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>u_cast1_cast_fu_226_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>111</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>tmp_19</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_19_fu_229_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>112</item>
<item>113</item>
<item>114</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>tmp_21_cast</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_21_cast_fu_236_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>115</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>tmp</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>C:\Users\Venci\Videos\Project</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>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_fu_173_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>116</item>
<item>118</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>tmp_i</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>62</lineNumber>
<contextFuncName>al</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>al</second>
</first>
<second>62</second>
</item>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_i_fu_179_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>119</item>
<item>121</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>tmp_4</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_4_fu_196_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>122</item>
<item>124</item>
<item>126</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>tmp_i1</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>62</lineNumber>
<contextFuncName>al</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>al</second>
</first>
<second>62</second>
</item>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_i1_fu_185_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>127</item>
<item>128</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>tmp_6</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_6_fu_204_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>129</item>
<item>131</item>
<item>133</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>tmp_7</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>DCT_8x8_2D_dmul_6eOg_U3</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>134</item>
<item>135</item>
</oprand_edges>
<opcode>dmul</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>22</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>2</count>
<item_version>0</item_version>
<item>137</item>
<item>138</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name/>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>73</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>73</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>139</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>x_assign</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>x</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>141</item>
<item>142</item>
<item>143</item>
<item>144</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>x_assign_cast2_cast</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>73</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>73</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>x_assign_cast2_cast_fu_240_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>145</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>tmp_20</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>73</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>73</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_20_fu_244_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>146</item>
<item>147</item>
<item>148</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>tmp_23_cast</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_23_cast_fu_252_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>149</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>tmp_21</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_21_fu_256_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>150</item>
<item>151</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>tmp_24_cast</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_24_cast_fu_261_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>152</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>cosMat_addr</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>153</item>
<item>154</item>
<item>155</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>tmp_22</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_22_fu_266_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>156</item>
<item>157</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>tmp_25_cast</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_25_cast_fu_271_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>158</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>cosMat_addr_1</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>159</item>
<item>160</item>
<item>161</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>exitcond1</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>73</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>73</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>exitcond1_fu_276_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>162</item>
<item>164</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>x</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>73</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>73</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>x</originalName>
<rtlName>x_fu_282_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>165</item>
<item>167</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name/>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>73</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>73</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>168</item>
<item>169</item>
<item>170</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>cosMat_load</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>171</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>tmp_s</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>DCT_8x8_2D_fpext_cud_U1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>172</item>
</oprand_edges>
<opcode>fpext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>tmp_i2</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>62</lineNumber>
<contextFuncName>al</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>al</second>
</first>
<second>62</second>
</item>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_i2_fu_288_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>173</item>
<item>174</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>tmp_2</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_2_fu_294_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>175</item>
<item>176</item>
<item>177</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>cosMat_load_2</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>178</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>tmp_3</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>DCT_8x8_2D_fpext_cud_U1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>179</item>
</oprand_edges>
<opcode>fpext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name/>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>180</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>x_assign_1</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>y</originalName>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>181</item>
<item>182</item>
<item>183</item>
<item>184</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name>x_assign_1_cast1_cas</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>x_assign_1_cast1_cas_fu_301_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>185</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>tmp_23</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_23_fu_305_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>186</item>
<item>187</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name>tmp_26_cast</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_26_cast_fu_310_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>188</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>subimg_addr</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>189</item>
<item>190</item>
<item>191</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>tmp_24</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_24_fu_315_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>192</item>
<item>193</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name>tmp_27_cast</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_27_cast_fu_320_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>194</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>cosMat_addr_2</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>195</item>
<item>196</item>
<item>197</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name>tmp_25</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_25_fu_325_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>198</item>
<item>199</item>
<item>200</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>tmp_29_cast</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_29_cast_fu_333_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>201</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name>tmp_26</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_26_fu_337_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>202</item>
<item>203</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>59</id>
<name>tmp_30_cast</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_30_cast_fu_342_p1</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>204</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name>cosMat_addr_3</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>205</item>
<item>206</item>
<item>207</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>61</id>
<name>exitcond</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>exitcond_fu_347_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>208</item>
<item>209</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>63</id>
<name>y</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>y</originalName>
<rtlName>y_fu_353_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>210</item>
<item>211</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name/>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>212</item>
<item>213</item>
<item>214</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>66</id>
<name>G_load_1</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>215</item>
<item>273</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>67</id>
<name>subimg_load</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>216</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_62">
<Value>
<Obj>
<type>0</type>
<id>68</id>
<name>tmp_8</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>DCT_8x8_2D_fpext_cud_U1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>217</item>
</oprand_edges>
<opcode>fpext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_63">
<Value>
<Obj>
<type>0</type>
<id>69</id>
<name>tmp_9</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>DCT_8x8_2D_dmul_6eOg_U3</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>218</item>
<item>219</item>
</oprand_edges>
<opcode>dmul</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_64">
<Value>
<Obj>
<type>0</type>
<id>70</id>
<name>tmp_1</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>DCT_8x8_2D_dmul_6eOg_U3</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>220</item>
<item>221</item>
</oprand_edges>
<opcode>dmul</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_65">
<Value>
<Obj>
<type>0</type>
<id>71</id>
<name>cosMat_load_1</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>222</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_66">
<Value>
<Obj>
<type>0</type>
<id>72</id>
<name>tmp_5</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>DCT_8x8_2D_fpext_cud_U1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>223</item>
</oprand_edges>
<opcode>fpext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_67">
<Value>
<Obj>
<type>0</type>
<id>73</id>
<name>tmp_10</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>DCT_8x8_2D_dmul_6eOg_U3</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>224</item>
<item>225</item>
</oprand_edges>
<opcode>dmul</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_68">
<Value>
<Obj>
<type>0</type>
<id>74</id>
<name>tmp_11</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>DCT_8x8_2D_fpext_cud_U1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>226</item>
</oprand_edges>
<opcode>fpext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_69">
<Value>
<Obj>
<type>0</type>
<id>75</id>
<name>tmp_i3</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>62</lineNumber>
<contextFuncName>al</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>al</second>
</first>
<second>62</second>
</item>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_i3_fu_359_p2</rtlName>
<coreName/>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>227</item>
<item>228</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_70">
<Value>
<Obj>
<type>0</type>
<id>76</id>
<name>tmp_12</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>tmp_12_fu_365_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>229</item>
<item>230</item>
<item>231</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_71">
<Value>
<Obj>
<type>0</type>
<id>77</id>
<name>tmp_13</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>DCT_8x8_2D_dmul_6eOg_U3</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>232</item>
<item>233</item>
</oprand_edges>
<opcode>dmul</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_72">
<Value>
<Obj>
<type>0</type>
<id>78</id>
<name>tmp_14</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>DCT_8x8_2D_dmul_6eOg_U3</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>234</item>
<item>235</item>
</oprand_edges>
<opcode>dmul</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_73">
<Value>
<Obj>
<type>0</type>
<id>79</id>
<name>tmp_15</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>DCT_8x8_2D_dmul_6eOg_U3</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>236</item>
<item>237</item>
</oprand_edges>
<opcode>dmul</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_74">
<Value>
<Obj>
<type>0</type>
<id>80</id>
<name>cosMat_load_3</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>238</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_75">
<Value>
<Obj>
<type>0</type>
<id>81</id>
<name>tmp_16</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>DCT_8x8_2D_fpext_cud_U1</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>239</item>
</oprand_edges>
<opcode>fpext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_76">
<Value>
<Obj>
<type>0</type>
<id>82</id>
<name>tmp_17</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>DCT_8x8_2D_dmul_6eOg_U3</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>240</item>
<item>241</item>
</oprand_edges>
<opcode>dmul</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_77">
<Value>
<Obj>
<type>0</type>
<id>83</id>
<name>G_2_in_v</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>G_2_in_v_fu_373_p3</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>242</item>
<item>243</item>
<item>244</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_78">
<Value>
<Obj>
<type>0</type>
<id>84</id>
<name>G_2_in</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName>DCT_8x8_2D_dadd_6dEe_U2</rtlName>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>245</item>
<item>246</item>
</oprand_edges>
<opcode>dadd</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_79">
<Value>
<Obj>
<type>0</type>
<id>85</id>
<name>G_1</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>G</originalName>
<rtlName>DCT_8x8_2D_fptrunbkb_U0</rtlName>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>247</item>
</oprand_edges>
<opcode>fptrunc</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_80">
<Value>
<Obj>
<type>0</type>
<id>86</id>
<name/>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>76</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>248</item>
<item>249</item>
<item>271</item>
<item>274</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_81">
<Value>
<Obj>
<type>0</type>
<id>87</id>
<name/>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>250</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_82">
<Value>
<Obj>
<type>0</type>
<id>89</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>140</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_83">
<Value>
<Obj>
<type>0</type>
<id>91</id>
<name>G_load</name>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>251</item>
<item>272</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_84">
<Value>
<Obj>
<type>0</type>
<id>92</id>
<name/>
<fileName>definition.cpp</fileName>
<fileDirectory>..</fileDirectory>
<lineNumber>81</lineNumber>
<contextFuncName>singleGUV</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\Venci\Videos\Project</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>definition.cpp</first>
<second>singleGUV</second>
</first>
<second>81</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>252</item>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>11</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_85">
<Value>
<Obj>
<type>2</type>
<id>94</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="_86">
<Value>
<Obj>
<type>2</type>
<id>108</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_87">
<Value>
<Obj>
<type>2</type>
<id>117</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>0</content>
</item>
<item class_id_reference="16" object_id="_88">
<Value>
<Obj>
<type>2</type>
<id>120</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>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_89">
<Value>
<Obj>
<type>2</type>
<id>123</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>1</const_type>
<content>0.176777</content>
</item>
<item class_id_reference="16" object_id="_90">
<Value>
<Obj>
<type>2</type>
<id>125</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>1</const_type>
<content>0.25</content>
</item>
<item class_id_reference="16" object_id="_91">
<Value>
<Obj>
<type>2</type>
<id>130</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>1</const_type>
<content>0.707107</content>
</item>
<item class_id_reference="16" object_id="_92">
<Value>
<Obj>
<type>2</type>
<id>132</id>
<name>empty</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>1</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_93">
<Value>
<Obj>
<type>2</type>
<id>136</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>1</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_94">
<Value>
<Obj>
<type>2</type>
<id>163</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>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_95">
<Value>
<Obj>
<type>2</type>
<id>166</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>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</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="_96">
<Obj>
<type>3</type>
<id>24</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>18</count>
<item_version>0</item_version>
<item>6</item>
<item>7</item>
<item>8</item>
<item>9</item>
<item>10</item>
<item>11</item>
<item>12</item>
<item>13</item>
<item>14</item>
<item>15</item>
<item>16</item>
<item>17</item>
<item>18</item>
<item>19</item>
<item>20</item>
<item>21</item>
<item>22</item>
<item>23</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_97">
<Obj>
<type>3</type>
<id>39</id>
<name>.loopexit</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>13</count>
<item_version>0</item_version>
<item>25</item>
<item>26</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>37</item>
<item>38</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_98">
<Obj>
<type>3</type>
<id>47</id>
<name>.preheader.preheader</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>7</count>
<item_version>0</item_version>
<item>40</item>
<item>41</item>
<item>42</item>
<item>43</item>
<item>44</item>
<item>45</item>
<item>46</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_99">
<Obj>
<type>3</type>
<id>65</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>16</count>
<item_version>0</item_version>
<item>48</item>
<item>49</item>
<item>50</item>
<item>51</item>
<item>52</item>
<item>53</item>
<item>54</item>
<item>55</item>
<item>56</item>
<item>57</item>
<item>58</item>
<item>59</item>
<item>60</item>
<item>61</item>
<item>63</item>
<item>64</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_100">
<Obj>
<type>3</type>
<id>88</id>
<name>_ifconv</name>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>22</count>
<item_version>0</item_version>
<item>66</item>
<item>67</item>
<item>68</item>
<item>69</item>
<item>70</item>
<item>71</item>
<item>72</item>
<item>73</item>
<item>74</item>
<item>75</item>
<item>76</item>
<item>77</item>
<item>78</item>
<item>79</item>
<item>80</item>
<item>81</item>
<item>82</item>
<item>83</item>
<item>84</item>
<item>85</item>
<item>86</item>
<item>87</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_101">
<Obj>
<type>3</type>
<id>90</id>
<name>.loopexit.loopexit</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>89</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_102">
<Obj>
<type>3</type>
<id>93</id>
<name/>
<fileName/>
<fileDirectory/>
<lineNumber>0</lineNumber>
<contextFuncName/>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName/>
<rtlName/>
<coreName/>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>91</item>
<item>92</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>150</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_103">
<id>95</id>
<edge_type>1</edge_type>
<source_obj>94</source_obj>
<sink_obj>6</sink_obj>
</item>
<item class_id_reference="20" object_id="_104">
<id>98</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_105">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_106">
<id>103</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_107">
<id>104</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_108">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_109">
<id>109</id>
<edge_type>1</edge_type>
<source_obj>108</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_110">
<id>110</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_111">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_112">
<id>113</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_113">
<id>114</id>
<edge_type>1</edge_type>
<source_obj>108</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_114">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_115">
<id>116</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_116">
<id>118</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_117">
<id>119</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_118">
<id>121</id>
<edge_type>1</edge_type>
<source_obj>120</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_119">
<id>122</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_120">
<id>124</id>
<edge_type>1</edge_type>
<source_obj>123</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_121">
<id>126</id>
<edge_type>1</edge_type>
<source_obj>125</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_122">
<id>127</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_123">
<id>128</id>
<edge_type>1</edge_type>
<source_obj>120</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_124">
<id>129</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_125">
<id>131</id>
<edge_type>1</edge_type>
<source_obj>130</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_126">
<id>133</id>
<edge_type>1</edge_type>
<source_obj>132</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_127">
<id>134</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_128">
<id>135</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_129">
<id>137</id>
<edge_type>1</edge_type>
<source_obj>136</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_130">
<id>138</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_131">
<id>139</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_132">
<id>140</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>89</sink_obj>
</item>
<item class_id_reference="20" object_id="_133">
<id>141</id>
<edge_type>1</edge_type>
<source_obj>120</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_134">
<id>142</id>
<edge_type>2</edge_type>
<source_obj>24</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_135">
<id>143</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_136">
<id>144</id>
<edge_type>2</edge_type>
<source_obj>90</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_137">
<id>145</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_138">
<id>147</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_139">
<id>148</id>
<edge_type>1</edge_type>
<source_obj>108</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_140">
<id>149</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_141">
<id>150</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_142">
<id>151</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_143">
<id>152</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_144">
<id>153</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_145">
<id>154</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_146">
<id>155</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_147">
<id>156</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_148">
<id>157</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_149">
<id>158</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_150">
<id>159</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_151">
<id>160</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_152">
<id>161</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_153">
<id>162</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_154">
<id>164</id>
<edge_type>1</edge_type>
<source_obj>163</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_155">
<id>165</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_156">
<id>167</id>
<edge_type>1</edge_type>
<source_obj>166</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_157">
<id>168</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_158">
<id>169</id>
<edge_type>2</edge_type>
<source_obj>47</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_159">
<id>170</id>
<edge_type>2</edge_type>
<source_obj>93</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_160">
<id>171</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_161">
<id>172</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_162">
<id>173</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_163">
<id>174</id>
<edge_type>1</edge_type>
<source_obj>120</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_164">
<id>175</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_165">
<id>176</id>
<edge_type>1</edge_type>
<source_obj>123</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_166">
<id>177</id>
<edge_type>1</edge_type>
<source_obj>125</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_167">
<id>178</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_168">
<id>179</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_169">
<id>180</id>
<edge_type>2</edge_type>
<source_obj>65</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_170">
<id>181</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_171">
<id>182</id>
<edge_type>2</edge_type>
<source_obj>88</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_172">
<id>183</id>
<edge_type>1</edge_type>
<source_obj>120</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_173">
<id>184</id>
<edge_type>2</edge_type>
<source_obj>47</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_174">
<id>185</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_175">
<id>186</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_176">
<id>187</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_177">
<id>188</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>51</sink_obj>
</item>
<item class_id_reference="20" object_id="_178">
<id>189</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_179">
<id>190</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_180">
<id>191</id>
<edge_type>1</edge_type>
<source_obj>51</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_181">
<id>192</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_182">
<id>193</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_183">
<id>194</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_184">
<id>195</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_185">
<id>196</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_186">
<id>197</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_187">
<id>199</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_188">
<id>200</id>
<edge_type>1</edge_type>
<source_obj>108</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_189">
<id>201</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>57</sink_obj>
</item>
<item class_id_reference="20" object_id="_190">
<id>202</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_191">
<id>203</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_192">
<id>204</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>59</sink_obj>
</item>
<item class_id_reference="20" object_id="_193">
<id>205</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_194">
<id>206</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_195">
<id>207</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_196">
<id>208</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>61</sink_obj>
</item>
<item class_id_reference="20" object_id="_197">
<id>209</id>
<edge_type>1</edge_type>
<source_obj>163</source_obj>
<sink_obj>61</sink_obj>
</item>
<item class_id_reference="20" object_id="_198">
<id>210</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_199">
<id>211</id>
<edge_type>1</edge_type>
<source_obj>166</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_200">
<id>212</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_201">
<id>213</id>
<edge_type>2</edge_type>
<source_obj>88</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_202">
<id>214</id>
<edge_type>2</edge_type>
<source_obj>90</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_203">
<id>215</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>66</sink_obj>
</item>
<item class_id_reference="20" object_id="_204">
<id>216</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>67</sink_obj>
</item>
<item class_id_reference="20" object_id="_205">
<id>217</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_206">
<id>218</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>69</sink_obj>
</item>
<item class_id_reference="20" object_id="_207">
<id>219</id>
<edge_type>1</edge_type>
<source_obj>68</source_obj>
<sink_obj>69</sink_obj>
</item>
<item class_id_reference="20" object_id="_208">
<id>220</id>
<edge_type>1</edge_type>
<source_obj>69</source_obj>
<sink_obj>70</sink_obj>
</item>
<item class_id_reference="20" object_id="_209">
<id>221</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>70</sink_obj>
</item>
<item class_id_reference="20" object_id="_210">
<id>222</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>71</sink_obj>
</item>
<item class_id_reference="20" object_id="_211">
<id>223</id>
<edge_type>1</edge_type>
<source_obj>71</source_obj>
<sink_obj>72</sink_obj>
</item>
<item class_id_reference="20" object_id="_212">
<id>224</id>
<edge_type>1</edge_type>
<source_obj>70</source_obj>
<sink_obj>73</sink_obj>
</item>
<item class_id_reference="20" object_id="_213">
<id>225</id>
<edge_type>1</edge_type>
<source_obj>72</source_obj>
<sink_obj>73</sink_obj>
</item>
<item class_id_reference="20" object_id="_214">
<id>226</id>
<edge_type>1</edge_type>
<source_obj>66</source_obj>
<sink_obj>74</sink_obj>
</item>
<item class_id_reference="20" object_id="_215">
<id>227</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_216">
<id>228</id>
<edge_type>1</edge_type>
<source_obj>120</source_obj>
<sink_obj>75</sink_obj>
</item>
<item class_id_reference="20" object_id="_217">
<id>229</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>76</sink_obj>
</item>
<item class_id_reference="20" object_id="_218">
<id>230</id>
<edge_type>1</edge_type>
<source_obj>130</source_obj>
<sink_obj>76</sink_obj>
</item>
<item class_id_reference="20" object_id="_219">
<id>231</id>
<edge_type>1</edge_type>
<source_obj>132</source_obj>
<sink_obj>76</sink_obj>
</item>
<item class_id_reference="20" object_id="_220">
<id>232</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>77</sink_obj>
</item>
<item class_id_reference="20" object_id="_221">
<id>233</id>
<edge_type>1</edge_type>
<source_obj>76</source_obj>
<sink_obj>77</sink_obj>
</item>
<item class_id_reference="20" object_id="_222">
<id>234</id>
<edge_type>1</edge_type>
<source_obj>77</source_obj>
<sink_obj>78</sink_obj>
</item>
<item class_id_reference="20" object_id="_223">
<id>235</id>
<edge_type>1</edge_type>
<source_obj>68</source_obj>
<sink_obj>78</sink_obj>
</item>
<item class_id_reference="20" object_id="_224">
<id>236</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>79</sink_obj>
</item>
<item class_id_reference="20" object_id="_225">
<id>237</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>79</sink_obj>
</item>
<item class_id_reference="20" object_id="_226">
<id>238</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>80</sink_obj>
</item>
<item class_id_reference="20" object_id="_227">
<id>239</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>81</sink_obj>
</item>
<item class_id_reference="20" object_id="_228">
<id>240</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>82</sink_obj>
</item>
<item class_id_reference="20" object_id="_229">
<id>241</id>
<edge_type>1</edge_type>
<source_obj>81</source_obj>
<sink_obj>82</sink_obj>
</item>
<item class_id_reference="20" object_id="_230">
<id>242</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>83</sink_obj>
</item>
<item class_id_reference="20" object_id="_231">
<id>243</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>83</sink_obj>
</item>
<item class_id_reference="20" object_id="_232">
<id>244</id>
<edge_type>1</edge_type>
<source_obj>82</source_obj>
<sink_obj>83</sink_obj>
</item>
<item class_id_reference="20" object_id="_233">
<id>245</id>
<edge_type>1</edge_type>
<source_obj>74</source_obj>
<sink_obj>84</sink_obj>
</item>
<item class_id_reference="20" object_id="_234">
<id>246</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>84</sink_obj>
</item>
<item class_id_reference="20" object_id="_235">
<id>247</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>85</sink_obj>
</item>
<item class_id_reference="20" object_id="_236">
<id>248</id>
<edge_type>1</edge_type>
<source_obj>85</source_obj>
<sink_obj>86</sink_obj>
</item>
<item class_id_reference="20" object_id="_237">
<id>249</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>86</sink_obj>
</item>
<item class_id_reference="20" object_id="_238">
<id>250</id>
<edge_type>2</edge_type>
<source_obj>65</source_obj>
<sink_obj>87</sink_obj>
</item>
<item class_id_reference="20" object_id="_239">
<id>251</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>91</sink_obj>
</item>
<item class_id_reference="20" object_id="_240">
<id>252</id>
<edge_type>1</edge_type>
<source_obj>91</source_obj>
<sink_obj>92</sink_obj>
</item>
<item class_id_reference="20" object_id="_241">
<id>263</id>
<edge_type>2</edge_type>
<source_obj>24</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_242">
<id>264</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>93</sink_obj>
</item>
<item class_id_reference="20" object_id="_243">
<id>265</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_244">
<id>266</id>
<edge_type>2</edge_type>
<source_obj>47</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_245">
<id>267</id>
<edge_type>2</edge_type>
<source_obj>65</source_obj>
<sink_obj>90</sink_obj>
</item>
<item class_id_reference="20" object_id="_246">
<id>268</id>
<edge_type>2</edge_type>
<source_obj>65</source_obj>
<sink_obj>88</sink_obj>
</item>
<item class_id_reference="20" object_id="_247">
<id>269</id>
<edge_type>2</edge_type>
<source_obj>88</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_248">
<id>270</id>
<edge_type>2</edge_type>
<source_obj>90</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_249">
<id>271</id>
<edge_type>4</edge_type>
<source_obj>66</source_obj>
<sink_obj>86</sink_obj>
</item>
<item class_id_reference="20" object_id="_250">
<id>272</id>
<edge_type>4</edge_type>
<source_obj>22</source_obj>
<sink_obj>91</sink_obj>
</item>
<item class_id_reference="20" object_id="_251">
<id>273</id>
<edge_type>4</edge_type>
<source_obj>22</source_obj>
<sink_obj>66</sink_obj>
</item>
<item class_id_reference="20" object_id="_252">
<id>274</id>
<edge_type>4</edge_type>
<source_obj>22</source_obj>
<sink_obj>86</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="_253">
<mId>1</mId>
<mTag>singleGUV</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>1437</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_254">
<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>24</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>4</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_255">
<mId>3</mId>
<mTag>Loop 1</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>8</mMinTripCount>
<mMaxTripCount>8</mMaxTripCount>
<mMinLatency>1432</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_256">
<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>39</item>
<item>47</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>1</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_257">
<mId>5</mId>
<mTag>Loop 1.1</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>65</item>
<item>88</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>8</mMinTripCount>
<mMaxTripCount>8</mMaxTripCount>
<mMinLatency>176</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"/>
</item>
<item class_id_reference="22" object_id="_258">
<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>90</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="_259">
<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>93</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="_260">
<states class_id="25" tracking_level="0" version="0">
<count>29</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_261">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>8</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_262">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_263">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_264">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_265">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_266">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_267">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_268">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_269">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_270">
<id>2</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_271">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_272">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_273">
<id>21</id>
<stage>4</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_274">
<id>3</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_275">
<id>21</id>
<stage>3</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_276">
<id>4</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_277">
<id>21</id>
<stage>2</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_278">
<id>5</id>
<operations>
<count>8</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_279">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_280">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_281">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_282">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_283">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_284">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_285">
<id>21</id>
<stage>1</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_286">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_287">
<id>6</id>
<operations>
<count>19</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_288">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_289">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_290">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_291">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_292">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_293">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_294">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_295">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_296">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_297">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_298">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_299">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_300">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_301">
<id>38</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_302">
<id>40</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_303">
<id>42</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_304">
<id>44</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_305">
<id>91</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_306">
<id>92</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_307">
<id>7</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_308">
<id>40</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_309">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_310">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_311">
<id>44</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_312">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_313">
<id>46</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_314">
<id>8</id>
<operations>
<count>20</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_315">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_316">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_317">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_318">
<id>51</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_319">
<id>52</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_320">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_321">
<id>54</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_322">
<id>55</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_323">
<id>56</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_324">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_325">
<id>58</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_326">
<id>59</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_327">
<id>60</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_328">
<id>61</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_329">
<id>62</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_330">
<id>63</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_331">
<id>64</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_332">
<id>67</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_333">
<id>75</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_334">
<id>89</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_335">
<id>9</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_336">
<id>67</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_337">
<id>68</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_338">
<id>76</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_339">
<id>77</id>
<stage>4</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_340">
<id>10</id>
<operations>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_341">
<id>69</id>
<stage>4</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_342">
<id>77</id>
<stage>3</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_343">
<id>11</id>
<operations>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_344">
<id>69</id>
<stage>3</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_345">
<id>77</id>
<stage>2</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_346">
<id>12</id>
<operations>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_347">
<id>69</id>
<stage>2</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_348">
<id>77</id>
<stage>1</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_349">
<id>13</id>
<operations>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_350">
<id>69</id>
<stage>1</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_351">
<id>78</id>
<stage>4</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_352">
<id>14</id>
<operations>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_353">
<id>70</id>
<stage>4</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_354">
<id>78</id>
<stage>3</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_355">
<id>15</id>
<operations>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_356">
<id>70</id>
<stage>3</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_357">
<id>78</id>
<stage>2</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_358">
<id>16</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_359">
<id>70</id>
<stage>2</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_360">
<id>71</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_361">
<id>78</id>
<stage>1</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_362">
<id>17</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_363">
<id>70</id>
<stage>1</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_364">
<id>71</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_365">
<id>72</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_366">
<id>79</id>
<stage>4</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_367">
<id>18</id>
<operations>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_368">
<id>73</id>
<stage>4</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_369">
<id>79</id>
<stage>3</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_370">
<id>19</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_371">
<id>73</id>
<stage>3</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_372">
<id>79</id>
<stage>2</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_373">
<id>80</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_374">
<id>20</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_375">
<id>73</id>
<stage>2</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_376">
<id>79</id>
<stage>1</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_377">
<id>80</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_378">
<id>81</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_379">
<id>21</id>
<operations>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_380">
<id>73</id>
<stage>1</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_381">
<id>82</id>
<stage>4</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_382">
<id>22</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_383">
<id>82</id>
<stage>3</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_384">
<id>23</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_385">
<id>82</id>
<stage>2</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_386">
<id>24</id>
<operations>
<count>4</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_387">
<id>66</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_388">
<id>74</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_389">
<id>82</id>
<stage>1</stage>
<latency>4</latency>
</item>
<item class_id_reference="28" object_id="_390">
<id>83</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_391">
<id>25</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_392">
<id>84</id>
<stage>4</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_393">
<id>26</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_394">
<id>84</id>
<stage>3</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_395">
<id>27</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_396">
<id>84</id>
<stage>2</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_397">
<id>28</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_398">
<id>84</id>
<stage>1</stage>
<latency>4</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_399">
<id>29</id>
<operations>
<count>3</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_400">
<id>85</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_401">
<id>86</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_402">
<id>87</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>30</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_403">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>37</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="_404">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>38</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="_405">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>39</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="_406">
<inState>4</inState>
<outState>5</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="_407">
<inState>5</inState>
<outState>6</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="_408">
<inState>6</inState>
<outState>7</outState>
<condition>
<id>43</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>35</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_409">
<inState>7</inState>
<outState>8</outState>
<condition>
<id>46</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="_410">
<inState>8</inState>
<outState>9</outState>
<condition>
<id>47</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>61</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_411">
<inState>9</inState>
<outState>10</outState>
<condition>
<id>49</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="_412">
<inState>10</inState>
<outState>11</outState>
<condition>
<id>50</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="_413">
<inState>11</inState>
<outState>12</outState>
<condition>
<id>51</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="_414">
<inState>12</inState>
<outState>13</outState>
<condition>
<id>52</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="_415">
<inState>13</inState>
<outState>14</outState>
<condition>
<id>53</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="_416">
<inState>14</inState>
<outState>15</outState>
<condition>
<id>54</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="_417">
<inState>15</inState>
<outState>16</outState>
<condition>
<id>55</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="_418">
<inState>16</inState>
<outState>17</outState>
<condition>
<id>56</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="_419">
<inState>17</inState>
<outState>18</outState>
<condition>
<id>57</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="_420">
<inState>18</inState>
<outState>19</outState>
<condition>
<id>58</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="_421">
<inState>19</inState>
<outState>20</outState>
<condition>
<id>59</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="_422">
<inState>20</inState>
<outState>21</outState>
<condition>
<id>60</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="_423">
<inState>21</inState>
<outState>22</outState>
<condition>
<id>61</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="_424">
<inState>22</inState>
<outState>23</outState>
<condition>
<id>62</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="_425">
<inState>23</inState>
<outState>24</outState>
<condition>
<id>63</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="_426">
<inState>24</inState>
<outState>25</outState>
<condition>
<id>64</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="_427">
<inState>25</inState>
<outState>26</outState>
<condition>
<id>65</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="_428">
<inState>26</inState>
<outState>27</outState>
<condition>
<id>66</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="_429">
<inState>27</inState>
<outState>28</outState>
<condition>
<id>67</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="_430">
<inState>28</inState>
<outState>29</outState>
<condition>
<id>68</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="_431">
<inState>29</inState>
<outState>8</outState>
<condition>
<id>70</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="_432">
<inState>8</inState>
<outState>6</outState>
<condition>
<id>72</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>61</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="36" tracking_level="1" version="0" object_id="_433">
<dp_component_resource class_id="37" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>DCT_8x8_2D_dadd_6dEe_U2 (DCT_8x8_2D_dadd_6dEe)</first>
<second class_id="39" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="0" version="0">
<first>DSP48E</first>
<second>3</second>
</item>
<item>
<first>FF</first>
<second>430</second>
</item>
<item>
<first>LUT</first>
<second>1130</second>
</item>
</second>
</item>
<item>
<first>DCT_8x8_2D_dmul_6eOg_U3 (DCT_8x8_2D_dmul_6eOg)</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>DSP48E</first>
<second>11</second>
</item>
<item>
<first>FF</first>
<second>275</second>
</item>
<item>
<first>LUT</first>
<second>558</second>
</item>
</second>
</item>
<item>
<first>DCT_8x8_2D_fpext_cud_U1 (DCT_8x8_2D_fpext_cud)</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>DSP48E</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>100</second>
</item>
<item>
<first>LUT</first>
<second>138</second>
</item>
</second>
</item>
<item>
<first>DCT_8x8_2D_fptrunbkb_U0 (DCT_8x8_2D_fptrunbkb)</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>DSP48E</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>128</second>
</item>
<item>
<first>LUT</first>
<second>277</second>
</item>
</second>
</item>
</dp_component_resource>
<dp_expression_resource>
<count>19</count>
<item_version>0</item_version>
<item>
<first>G_2_in_v_fu_373_p3 ( select ) </first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>64</second>
</item>
<item>
<first>(2P2)</first>
<second>64</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>64</second>
</item>
</second>
</item>
<item>
<first>exitcond1_fu_276_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>5</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>exitcond_fu_347_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>5</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>2</second>
</item>
</second>
</item>
<item>
<first>tmp_12_fu_365_p3 ( select ) </first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>62</second>
</item>
<item>
<first>(2P2)</first>
<second>62</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>62</second>
</item>
</second>
</item>
<item>
<first>tmp_21_fu_256_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>8</second>
</item>
<item>
<first>(1P1)</first>
<second>8</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>8</second>
</item>
</second>
</item>
<item>
<first>tmp_22_fu_266_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>8</second>
</item>
<item>
<first>(1P1)</first>
<second>8</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>8</second>
</item>
</second>
</item>
<item>
<first>tmp_23_fu_305_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>8</second>
</item>
<item>
<first>(1P1)</first>
<second>8</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>8</second>
</item>
</second>
</item>
<item>
<first>tmp_24_fu_315_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>8</second>
</item>
<item>
<first>(1P1)</first>
<second>8</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>8</second>
</item>
</second>
</item>
<item>
<first>tmp_26_fu_337_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>8</second>
</item>
<item>
<first>(1P1)</first>
<second>8</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>8</second>
</item>
</second>
</item>
<item>
<first>tmp_2_fu_294_p3 ( select ) </first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>62</second>
</item>
<item>
<first>(2P2)</first>
<second>62</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>62</second>
</item>
</second>
</item>
<item>
<first>tmp_4_fu_196_p3 ( select ) </first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>62</second>
</item>
<item>
<first>(2P2)</first>
<second>62</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>62</second>
</item>
</second>
</item>
<item>
<first>tmp_6_fu_204_p3 ( select ) </first>
<second>
<count>5</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>1</second>
</item>
<item>
<first>(1P1)</first>
<second>62</second>
</item>
<item>
<first>(2P2)</first>
<second>62</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>62</second>
</item>
</second>
</item>
<item>
<first>tmp_fu_173_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>32</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>11</second>
</item>
</second>
</item>
<item>
<first>tmp_i1_fu_185_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</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>tmp_i2_fu_288_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</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>tmp_i3_fu_359_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</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>tmp_i_fu_179_p2 ( icmp ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</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>x_fu_282_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>y_fu_353_p2 ( + ) </first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0P0)</first>
<second>4</second>
</item>
<item>
<first>(1P1)</first>
<second>1</second>
</item>
<item>
<first>FF</first>
<second>0</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
</dp_expression_resource>
<dp_fifo_resource>
<count>0</count>
<item_version>0</item_version>
</dp_fifo_resource>
<dp_memory_resource>
<count>0</count>
<item_version>0</item_version>
</dp_memory_resource>
<dp_multiplexer_resource>
<count>8</count>
<item_version>0</item_version>
<item>
<first>G_fu_42</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>32</second>
</item>
<item>
<first>(2Count)</first>
<second>64</second>
</item>
<item>
<first>LUT</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>ap_NS_fsm</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>30</second>
</item>
<item>
<first>(1Bits)</first>
<second>1</second>
</item>
<item>
<first>(2Count)</first>
<second>30</second>
</item>
<item>
<first>LUT</first>
<second>24</second>
</item>
</second>
</item>
<item>
<first>cosMat_address0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>5</second>
</item>
<item>
<first>(1Bits)</first>
<second>6</second>
</item>
<item>
<first>(2Count)</first>
<second>30</second>
</item>
<item>
<first>LUT</first>
<second>6</second>
</item>
</second>
</item>
<item>
<first>grp_fu_135_p0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>4</second>
</item>
<item>
<first>(1Bits)</first>
<second>32</second>
</item>
<item>
<first>(2Count)</first>
<second>128</second>
</item>
<item>
<first>LUT</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>grp_fu_144_p0</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>6</second>
</item>
<item>
<first>(1Bits)</first>
<second>64</second>
</item>
<item>
<first>(2Count)</first>
<second>384</second>
</item>
<item>
<first>LUT</first>
<second>64</second>
</item>
</second>
</item>
<item>
<first>grp_fu_144_p1</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>6</second>
</item>
<item>
<first>(1Bits)</first>
<second>64</second>
</item>
<item>
<first>(2Count)</first>
<second>384</second>
</item>
<item>
<first>LUT</first>
<second>64</second>
</item>
</second>
</item>
<item>
<first>x_assign_1_reg_121</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>x_assign_reg_110</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>
<first>(0Size)</first>
<second>2</second>
</item>
<item>
<first>(1Bits)</first>
<second>4</second>
</item>
<item>
<first>(2Count)</first>
<second>8</second>
</item>
<item>
<first>LUT</first>
<second>4</second>
</item>
</second>
</item>
</dp_multiplexer_resource>
<dp_register_resource>
<count>27</count>
<item_version>0</item_version>
<item>
<first>G_2_in_reg_530</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>G_2_in_v_reg_525</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>G_fu_42</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>32</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>32</second>
</item>
</second>
</item>
<item>
<first>ap_CS_fsm</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>29</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>29</second>
</item>
</second>
</item>
<item>
<first>cosMat_addr_2_reg_492</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>6</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>6</second>
</item>
</second>
</item>
<item>
<first>cosMat_addr_3_reg_497</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>6</second>
</item>
<item>
<first>(Consts)</first>
<second>0</second>
</item>
<item>
<first>FF</first>
<second>6</second>
</item>
</second>
</item>
<item>
<first>reg_152</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>reg_157</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>reg_163</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>reg_168</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>tmp_16_reg_520</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>tmp_19_cast_reg_434</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>8</second>
</item>
<item>
<first>(Consts)</first>
<second>4</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>tmp_21_cast_reg_444</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>8</second>
</item>
<item>
<first>(Consts)</first>
<second>4</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>tmp_23_cast_reg_454</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>8</second>
</item>
<item>
<first>(Consts)</first>
<second>4</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>tmp_2_reg_482</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>64</second>
</item>
<item>
<first>(Consts)</first>
<second>52</second>
</item>
<item>
<first>FF</first>
<second>12</second>
</item>
</second>
</item>
<item>
<first>tmp_7_reg_449</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>tmp_i1_reg_414</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_i2_reg_477</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_i3_reg_510</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_i_reg_409</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_reg_404</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>u_cast1_cast_reg_439</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>8</second>
</item>
<item>
<first>(Consts)</first>
<second>4</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>v_cast2_cast_reg_429</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>
<first>(Bits)</first>
<second>8</second>
</item>
<item>
<first>(Consts)</first>
<second>4</second>
</item>
<item>
<first>FF</first>
<second>4</second>
</item>
</second>
</item>
<item>
<first>x_assign_1_reg_121</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>x_assign_reg_110</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>x_reg_472</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>y_reg_505</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>
</dp_register_resource>
<dp_component_map class_id="41" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="42" tracking_level="0" version="0">
<first>DCT_8x8_2D_dadd_6dEe_U2 (DCT_8x8_2D_dadd_6dEe)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>DCT_8x8_2D_dmul_6eOg_U3 (DCT_8x8_2D_dmul_6eOg)</first>
<second>
<count>8</count>
<item_version>0</item_version>
<item>21</item>
<item>69</item>
<item>70</item>
<item>73</item>
<item>77</item>
<item>78</item>
<item>79</item>
<item>82</item>
</second>
</item>
<item>
<first>DCT_8x8_2D_fpext_cud_U1 (DCT_8x8_2D_fpext_cud)</first>
<second>
<count>6</count>
<item_version>0</item_version>
<item>41</item>
<item>45</item>
<item>68</item>
<item>72</item>
<item>74</item>
<item>81</item>
</second>
</item>
<item>
<first>DCT_8x8_2D_fptrunbkb_U0 (DCT_8x8_2D_fptrunbkb)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
</dp_component_map>
<dp_expression_map>
<count>19</count>
<item_version>0</item_version>
<item>
<first>G_2_in_v_fu_373_p3 ( select ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>exitcond1_fu_276_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>exitcond_fu_347_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>tmp_12_fu_365_p3 ( select ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</second>
</item>
<item>
<first>tmp_21_fu_256_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>tmp_22_fu_266_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>tmp_23_fu_305_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>tmp_24_fu_315_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>tmp_26_fu_337_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>tmp_2_fu_294_p3 ( select ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>tmp_4_fu_196_p3 ( select ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>tmp_6_fu_204_p3 ( select ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>tmp_fu_173_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>tmp_i1_fu_185_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>tmp_i2_fu_288_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>tmp_i3_fu_359_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>tmp_i_fu_179_p2 ( icmp ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>x_fu_282_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>y_fu_353_p2 ( + ) </first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</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>79</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="0" version="0">
<first>6</first>
<second class_id="45" tracking_level="0" version="0">
<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>
<item>
<first>10</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>1</first>
<second>3</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>5</first>
<second>1</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>5</first>
<second>1</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>23</first>
<second>0</second>
</second>
</item>
<item>
<first>67</first>
<second>
<first>7</first>
<second>1</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>9</first>
<second>3</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>13</first>
<second>3</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>15</first>
<second>1</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>16</first>
<second>0</second>
</second>
</item>
<item>
<first>73</first>
<second>
<first>17</first>
<second>3</second>
</second>
</item>
<item>
<first>74</first>
<second>
<first>23</first>
<second>0</second>
</second>
</item>
<item>
<first>75</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>76</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>77</first>
<second>
<first>8</first>
<second>3</second>
</second>
</item>
<item>
<first>78</first>
<second>
<first>12</first>
<second>3</second>
</second>
</item>
<item>
<first>79</first>
<second>
<first>16</first>
<second>3</second>
</second>
</item>
<item>
<first>80</first>
<second>
<first>18</first>
<second>1</second>
</second>
</item>
<item>
<first>81</first>
<second>
<first>19</first>
<second>0</second>
</second>
</item>
<item>
<first>82</first>
<second>
<first>20</first>
<second>3</second>
</second>
</item>
<item>
<first>83</first>
<second>
<first>23</first>
<second>0</second>
</second>
</item>
<item>
<first>84</first>
<second>
<first>24</first>
<second>3</second>
</second>
</item>
<item>
<first>85</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>86</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>87</first>
<second>
<first>28</first>
<second>0</second>
</second>
</item>
<item>
<first>89</first>
<second>
<first>7</first>
<second>0</second>
</second>
</item>
<item>
<first>91</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>92</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="46" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="47" tracking_level="0" version="0">
<first>24</first>
<second class_id="48" tracking_level="0" version="0">
<first>0</first>
<second>4</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>5</first>
<second>5</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>5</first>
<second>6</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>7</first>
<second>7</second>
</second>
</item>
<item>
<first>88</first>
<second>
<first>7</first>
<second>28</second>
</second>
</item>
<item>
<first>90</first>
<second>
<first>7</first>
<second>7</second>
</second>
</item>
<item>
<first>93</first>
<second>
<first>5</first>
<second>5</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="49" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="50" tracking_level="0" version="0">
<count>56</count>
<item_version>0</item_version>
<item class_id="51" tracking_level="0" version="0">
<first>42</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>6</item>
</second>
</item>
<item>
<first>46</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
<item>
<first>52</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>58</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>64</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>71</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>78</first>
<second>
<count>8</count>
<item_version>0</item_version>
<item>40</item>
<item>40</item>
<item>44</item>
<item>44</item>
<item>71</item>
<item>71</item>
<item>80</item>
<item>80</item>
</second>
</item>
<item>
<first>84</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>91</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>98</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>105</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>67</item>
<item>67</item>
</second>
</item>
<item>
<first>114</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>125</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>132</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>135</first>
<second>
<count>6</count>
<item_version>0</item_version>
<item>41</item>
<item>45</item>
<item>68</item>
<item>72</item>
<item>81</item>
<item>74</item>
</second>
</item>
<item>
<first>140</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>84</item>
<item>84</item>
<item>84</item>
<item>84</item>
</second>
</item>
<item>
<first>144</first>
<second>
<count>32</count>
<item_version>0</item_version>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>77</item>
<item>77</item>
<item>77</item>
<item>77</item>
<item>69</item>
<item>69</item>
<item>69</item>
<item>69</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>70</item>
<item>70</item>
<item>70</item>
<item>70</item>
<item>79</item>
<item>79</item>
<item>79</item>
<item>79</item>
<item>73</item>
<item>73</item>
<item>73</item>
<item>73</item>
<item>82</item>
<item>82</item>
<item>82</item>
<item>82</item>
</second>
</item>
<item>
<first>148</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>91</item>
<item>66</item>
</second>
</item>
<item>
<first>173</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>179</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>185</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>191</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>196</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>204</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>212</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>215</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>222</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>226</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>229</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>236</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>240</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>244</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>252</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>256</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>261</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>266</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>271</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>276</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>282</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>294</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>301</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>305</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>310</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>315</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>320</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>325</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>333</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>337</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>342</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>347</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>353</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>359</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>365</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</second>
</item>
<item>
<first>373</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>380</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>86</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="53" tracking_level="0" version="0">
<count>46</count>
<item_version>0</item_version>
<item class_id="54" tracking_level="0" version="0">
<first>G_1_fu_132</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>85</item>
</second>
</item>
<item>
<first>G_2_in_v_fu_373</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>G_fu_42</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>6</item>
</second>
</item>
<item>
<first>cosMat_addr_1_gep_fu_71</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>cosMat_addr_2_gep_fu_91</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>cosMat_addr_3_gep_fu_98</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>cosMat_addr_gep_fu_64</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>exitcond1_fu_276</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>exitcond_fu_347</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>grp_fu_135</first>
<second>
<count>6</count>
<item_version>0</item_version>
<item>41</item>
<item>45</item>
<item>68</item>
<item>72</item>
<item>81</item>
<item>74</item>
</second>
</item>
<item>
<first>subimg_addr_gep_fu_84</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>tmp_12_fu_365</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</second>
</item>
<item>
<first>tmp_18_fu_215</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>tmp_19_cast_fu_222</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>tmp_19_fu_229</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>tmp_20_fu_244</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>tmp_21_cast_fu_236</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>tmp_21_fu_256</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>tmp_22_fu_266</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>tmp_23_cast_fu_252</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>tmp_23_fu_305</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>tmp_24_cast_fu_261</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>tmp_24_fu_315</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>tmp_25_cast_fu_271</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>tmp_25_fu_325</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>tmp_26_cast_fu_310</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>tmp_26_fu_337</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>tmp_27_cast_fu_320</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>tmp_29_cast_fu_333</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>tmp_2_fu_294</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>tmp_30_cast_fu_342</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>tmp_4_fu_196</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>tmp_6_fu_204</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>tmp_fu_173</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>tmp_i1_fu_185</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>tmp_i2_fu_288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>tmp_i3_fu_359</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>tmp_i_fu_179</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>u_cast1_cast_fu_226</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>v_cast2_cast_fu_212</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>x_assign_1_cast1_cas_fu_301</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>x_assign_1_phi_fu_125</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>x_assign_cast2_cast_fu_240</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>x_assign_phi_fu_114</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>x_fu_282</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>y_fu_353</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>2</count>
<item_version>0</item_version>
<item>
<first>grp_fu_140</first>
<second>
<count>4</count>
<item_version>0</item_version>
<item>84</item>
<item>84</item>
<item>84</item>
<item>84</item>
</second>
</item>
<item>
<first>grp_fu_144</first>
<second>
<count>32</count>
<item_version>0</item_version>
<item>21</item>
<item>21</item>
<item>21</item>
<item>21</item>
<item>77</item>
<item>77</item>
<item>77</item>
<item>77</item>
<item>69</item>
<item>69</item>
<item>69</item>
<item>69</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>78</item>
<item>70</item>
<item>70</item>
<item>70</item>
<item>70</item>
<item>79</item>
<item>79</item>
<item>79</item>
<item>79</item>
<item>73</item>
<item>73</item>
<item>73</item>
<item>73</item>
<item>82</item>
<item>82</item>
<item>82</item>
<item>82</item>
</second>
</item>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>6</count>
<item_version>0</item_version>
<item>
<first>StgValue_141_store_fu_380</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>86</item>
</second>
</item>
<item>
<first>StgValue_37_store_fu_191</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>grp_load_fu_148</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>91</item>
<item>66</item>
</second>
</item>
<item>
<first>inv_read_read_fu_46</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
<item>
<first>u_read_read_fu_58</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>v_read_read_fu_52</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
</dp_fu_nodes_io>
<return_ports>
<count>1</count>
<item_version>0</item_version>
<item>
<first>ap_return</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>92</item>
</second>
</item>
</return_ports>
<dp_mem_port_nodes class_id="55" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="56" tracking_level="0" version="0">
<first class_id="57" tracking_level="0" version="0">
<first>cosMat</first>
<second>0</second>
</first>
<second>
<count>8</count>
<item_version>0</item_version>
<item>40</item>
<item>40</item>
<item>44</item>
<item>44</item>
<item>71</item>
<item>71</item>
<item>80</item>
<item>80</item>
</second>
</item>
<item>
<first>
<first>subimg</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>67</item>
<item>67</item>
</second>
</item>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>34</count>
<item_version>0</item_version>
<item>
<first>110</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>121</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>152</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>41</item>
<item>45</item>
</second>
</item>
<item>
<first>157</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>68</item>
<item>72</item>
<item>74</item>
</second>
</item>
<item>
<first>163</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>77</item>
<item>78</item>
<item>79</item>
</second>
</item>
<item>
<first>168</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>69</item>
<item>70</item>
<item>73</item>
</second>
</item>
<item>
<first>385</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>6</item>
</second>
</item>
<item>
<first>392</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>398</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>404</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>409</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>414</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>419</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>424</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>429</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>434</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>439</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>444</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>449</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>454</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>459</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>464</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>472</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>477</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>482</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>487</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>492</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>497</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>505</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>510</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>515</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</second>
</item>
<item>
<first>520</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>525</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>530</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>34</count>
<item_version>0</item_version>
<item>
<first>G_2_in_reg_530</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>84</item>
</second>
</item>
<item>
<first>G_2_in_v_reg_525</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>83</item>
</second>
</item>
<item>
<first>G_reg_385</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>6</item>
</second>
</item>
<item>
<first>cosMat_addr_1_reg_464</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>cosMat_addr_2_reg_492</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>cosMat_addr_3_reg_497</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>cosMat_addr_reg_459</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>reg_152</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>41</item>
<item>45</item>
</second>
</item>
<item>
<first>reg_157</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>68</item>
<item>72</item>
<item>74</item>
</second>
</item>
<item>
<first>reg_163</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>77</item>
<item>78</item>
<item>79</item>
</second>
</item>
<item>
<first>reg_168</first>
<second>
<count>3</count>
<item_version>0</item_version>
<item>69</item>
<item>70</item>
<item>73</item>
</second>
</item>
<item>
<first>subimg_addr_reg_487</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>tmp_12_reg_515</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</second>
</item>
<item>
<first>tmp_16_reg_520</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>81</item>
</second>
</item>
<item>
<first>tmp_19_cast_reg_434</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>tmp_21_cast_reg_444</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>tmp_23_cast_reg_454</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>tmp_2_reg_482</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>tmp_4_reg_419</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>tmp_6_reg_424</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>tmp_7_reg_449</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>tmp_i1_reg_414</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>tmp_i2_reg_477</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>tmp_i3_reg_510</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</second>
</item>
<item>
<first>tmp_i_reg_409</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>tmp_reg_404</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>u_cast1_cast_reg_439</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>u_read_reg_398</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>v_cast2_cast_reg_429</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>v_read_reg_392</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>x_assign_1_reg_121</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>x_assign_reg_110</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>x_reg_472</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>y_reg_505</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>2</count>
<item_version>0</item_version>
<item>
<first>110</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>121</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>2</count>
<item_version>0</item_version>
<item>
<first>x_assign_1_reg_121</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>x_assign_reg_110</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="58" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="59" tracking_level="0" version="0">
<first>cosMat(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>load</first>
<second>
<count>8</count>
<item_version>0</item_version>
<item>40</item>
<item>40</item>
<item>44</item>
<item>44</item>
<item>71</item>
<item>71</item>
<item>80</item>
<item>80</item>
</second>
</item>
</second>
</item>
<item>
<first>inv</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</second>
</item>
</second>
</item>
<item>
<first>subimg(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>load</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>67</item>
<item>67</item>
</second>
</item>
</second>
</item>
<item>
<first>u</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
</second>
</item>
<item>
<first>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>8</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="60" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="61" tracking_level="0" version="0">
<first>1</first>
<second>RAM</second>
</item>
<item>
<first>5</first>
<second>RAM</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 29.991012 | 80 | 0.433047 |
4bb9bcbc8a72b72505ffb215adcca281ed8e2344 | 976 | ads | Ada | src/flyweights/flyweights.ads | jhumphry/auto_counters | bc7dfabf82febd09facf90371c8c11a628a06266 | [
"0BSD"
] | 5 | 2016-02-22T10:29:26.000Z | 2021-12-18T08:20:12.000Z | src/flyweights/flyweights.ads | jhumphry/auto_counters | bc7dfabf82febd09facf90371c8c11a628a06266 | [
"0BSD"
] | 1 | 2022-02-16T03:38:08.000Z | 2022-02-20T21:11:30.000Z | src/flyweights/flyweights.ads | jhumphry/auto_counters | bc7dfabf82febd09facf90371c8c11a628a06266 | [
"0BSD"
] | null | null | null | -- flyweights.ads
-- A package for ensuring resources are not duplicated in a manner similar
-- to the C++ Boost flyweight classes.
-- Copyright (c) 2016, James Humphry
--
-- Permission to use, copy, modify, and/or distribute this software for any
-- purpose with or without fee is hereby granted, provided that the above
-- copyright notice and this permission notice appear in all copies.
--
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
-- REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
-- AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
-- INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
-- LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
-- OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
-- PERFORMANCE OF THIS SOFTWARE.
package Flyweights is
Flyweights_Error : exception;
end Flyweights;
| 40.666667 | 80 | 0.769467 |
38f79bb41e7e6aef6dc08b0ba2f7394402b6cc89 | 2,022 | ads | Ada | boards/NRF52_DK/src/zfp/adl_config.ads | mbdme26/Ada_Drivers_Library | dc9cc80f5338c9d1ae942dd461eef6a2402e44de | [
"BSD-3-Clause"
] | 192 | 2016-06-01T18:32:04.000Z | 2022-03-26T22:52:31.000Z | boards/NRF52_DK/src/zfp/adl_config.ads | mbdme26/Ada_Drivers_Library | dc9cc80f5338c9d1ae942dd461eef6a2402e44de | [
"BSD-3-Clause"
] | 239 | 2016-05-26T20:02:01.000Z | 2022-03-31T09:46:56.000Z | boards/NRF52_DK/src/zfp/adl_config.ads | mbdme26/Ada_Drivers_Library | dc9cc80f5338c9d1ae942dd461eef6a2402e44de | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | -- This package was generated by the Ada_Drivers_Library project wizard script
package ADL_Config is
Architecture : constant String := "ARM"; -- From board definition
Board : constant String := "NRF52_DK"; -- From command line
Boot_Memory : constant String := "flash"; -- From default value
CPU_Core : constant String := "ARM Cortex-M4F"; -- From mcu definition
Device_Family : constant String := "nRF52"; -- From board definition
Device_Name : constant String := "nRF52832xxAA"; -- From board definition
Has_Custom_Memory_Area_1 : constant Boolean := False; -- From default value
Has_Ravenscar_Full_Runtime : constant String := "False"; -- From board definition
Has_Ravenscar_SFP_Runtime : constant String := "False"; -- From board definition
Has_ZFP_Runtime : constant String := "True"; -- From board definition
Max_Mount_Name_Length : constant := 128; -- From default value
Max_Mount_Points : constant := 2; -- From default value
Max_Path_Length : constant := 1024; -- From default value
Number_Of_Interrupts : constant := 128; -- From MCU definition
Runtime_Name : constant String := "zfp-cortex-m4f"; -- From default value
Runtime_Name_Suffix : constant String := "cortex-m4f"; -- From board definition
Runtime_Profile : constant String := "zfp"; -- From command line
Use_Startup_Gen : constant Boolean := True; -- From command line
Vendor : constant String := "Nordic"; -- From board definition
end ADL_Config;
| 87.913043 | 101 | 0.527695 |
2e9c469a61969424c67e79c9b39e0a79c5a44f8b | 275 | ads | Ada | src/gl/interface/gl-objects-shaders-lists.ads | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | 79 | 2015-04-20T23:10:02.000Z | 2022-03-04T13:50:56.000Z | src/gl/interface/gl-objects-shaders-lists.ads | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | 126 | 2015-09-10T10:41:34.000Z | 2022-03-20T11:25:40.000Z | src/gl/interface/gl-objects-shaders-lists.ads | 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 GL.Objects.Lists;
package GL.Objects.Shaders.Lists is
new GL.Objects.Lists (Shader, Create_From_Id);
pragma Preelaborate (GL.Objects.Shaders.Lists);
| 30.555556 | 71 | 0.756364 |
04b1d71cea8d9cadf462f0e97806cc8ec78498d0 | 1,661 | ads | Ada | tests/natools-chunked_strings-tests-cxa4010.ads | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | tests/natools-chunked_strings-tests-cxa4010.ads | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | tests/natools-chunked_strings-tests-cxa4010.ads | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | ------------------------------------------------------------------------------
-- Copyright (c) 2011, 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. --
------------------------------------------------------------------------------
------------------------------------------------------------------------------
-- Natools.Chunked_Strings.Tests.CXA4010 is the transcription to --
-- Chunked_String of ACATS test CXA4010 for Unbounded_String. --
------------------------------------------------------------------------------
with Natools.Tests;
generic procedure Natools.Chunked_Strings.Tests.CXA4010
(Report : in out Natools.Tests.Reporter'Class);
pragma Preelaborate (CXA4010);
| 61.518519 | 78 | 0.496087 |
382ccbb6db382bfea6c69de92624a4865b80eeaa | 4,718 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c4/c45220a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c4/c45220a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c4/c45220a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C45220A.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 '=' AND '/=' PRODUCE CORRECT RESULTS ON
-- BOOLEAN-TYPE OPERANDS (IN PARTICULAR, FOR OPERANDS HAVING
-- DIFFERENT SUBTYPES).
-- THIS TEST IS DERIVED FROM C45201A.ADA .
-- RM 27 OCTOBER 1980
-- JWC 7/8/85 RENAMED TO -AB
WITH REPORT ;
PROCEDURE C45220A IS
USE REPORT;
SUBTYPE T1 IS BOOLEAN RANGE FALSE..FALSE ;
SUBTYPE T2 IS BOOLEAN RANGE TRUE..TRUE ;
SUBTYPE T3 IS BOOLEAN RANGE FALSE..TRUE ;
SUBTYPE T4 IS T3 RANGE TRUE..TRUE ;
FVAR1 : T1 := FALSE ;
TVAR1 : T2 := TRUE ;
FVAR2 : T3 := FALSE ;
TVAR2 : T4 := TRUE ;
ERROR_COUNT : INTEGER := 0 ; -- INITIAL VALUE ESSENTIAL
PROCEDURE BUMP IS
BEGIN
ERROR_COUNT := ERROR_COUNT + 1 ;
END BUMP ;
BEGIN
TEST( "C45220A" , "CHECK THAT '=' AND '/=' PRODUCE CORRECT" &
" RESULTS ON BOOLEAN-TYPE OPERANDS" ) ;
-- 32 CASES ( 2 * 2 ORDERED PAIRS OF OPERAND VALUES,
-- 2 OPERATORS : '=' , '/=' ,
-- 4 VARIABLE/LITERAL FOR LEFT OPERAND,
-- VARIABLE/LITERAL FOR RIGHT OPERAND.
-- 'BUMP' MEANS 'BUMP THE ERROR COUNT'
FVAR1 := IDENT_BOOL( FALSE ) ;
TVAR1 := IDENT_BOOL( TRUE ) ;
FVAR2 := IDENT_BOOL( FALSE ) ;
TVAR2 := IDENT_BOOL( TRUE ) ;
IF FALSE = FALSE THEN NULL ; ELSE BUMP ; END IF;
IF FVAR1 = FALSE THEN NULL ; ELSE BUMP ; END IF;
IF FALSE = FVAR2 THEN NULL ; ELSE BUMP ; END IF;
IF FVAR2 = FVAR1 THEN NULL ; ELSE BUMP ; END IF;
IF FALSE = TRUE THEN BUMP ; END IF;
IF FVAR1 = TRUE THEN BUMP ; END IF;
IF FALSE = TVAR2 THEN BUMP ; END IF;
IF FVAR2 = TVAR1 THEN BUMP ; END IF;
IF TRUE = FALSE THEN BUMP ; END IF;
IF TRUE = FVAR1 THEN BUMP ; END IF;
IF TVAR2 = FALSE THEN BUMP ; END IF;
IF TVAR1 = FVAR2 THEN BUMP ; END IF;
IF TRUE = TRUE THEN NULL ; ELSE BUMP ; END IF;
IF TVAR1 = TRUE THEN NULL ; ELSE BUMP ; END IF;
IF TRUE = TVAR2 THEN NULL ; ELSE BUMP ; END IF;
IF TVAR2 = TVAR1 THEN NULL ; ELSE BUMP ; END IF;
IF FALSE /= FALSE THEN BUMP ; END IF;
IF FVAR1 /= FALSE THEN BUMP ; END IF;
IF FALSE /= FVAR2 THEN BUMP ; END IF;
IF FVAR2 /= FVAR1 THEN BUMP ; END IF;
IF FALSE /= TRUE THEN NULL ; ELSE BUMP ; END IF;
IF FVAR1 /= TRUE THEN NULL ; ELSE BUMP ; END IF;
IF FALSE /= TVAR2 THEN NULL ; ELSE BUMP ; END IF;
IF FVAR2 /= TVAR1 THEN NULL ; ELSE BUMP ; END IF;
IF TRUE /= FALSE THEN NULL ; ELSE BUMP ; END IF;
IF TRUE /= FVAR1 THEN NULL ; ELSE BUMP ; END IF;
IF TVAR2 /= FALSE THEN NULL ; ELSE BUMP ; END IF;
IF TVAR1 /= FVAR2 THEN NULL ; ELSE BUMP ; END IF;
IF TRUE /= TRUE THEN BUMP ; END IF;
IF TVAR1 /= TRUE THEN BUMP ; END IF;
IF TRUE /= TVAR2 THEN BUMP ; END IF;
IF TVAR2 /= TVAR1 THEN BUMP ; END IF;
IF ERROR_COUNT /=0 THEN
FAILED( "(IN)EQUALITY OF BOOLEAN VALUES - FAILURE1" );
END IF;
RESULT ;
END C45220A;
| 36.292308 | 79 | 0.547266 |
1309315378f2742e24f364019c28b1ff4c5c91b1 | 679 | ads | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/opt46_pkg.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/opt46_pkg.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/opt46_pkg.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | generic
type Table_Component_Type is private;
type Table_Index_Type is range <>;
Table_Low_Bound : Table_Index_Type;
package Opt46_Pkg is
type Table_Type is
array (Table_Index_Type range <>) of Table_Component_Type;
subtype Big_Table_Type is
Table_Type (Table_Low_Bound .. Table_Index_Type'Last);
type Table_Ptr is access all Big_Table_Type;
type Table_Private is private;
type Instance is record
Table : aliased Table_Ptr := null;
P : Table_Private;
end record;
function Last (T : Instance) return Table_Index_Type;
private
type Table_Private is record
Last_Val : Integer;
end record;
end Opt46_Pkg;
| 21.21875 | 63 | 0.723122 |
1e071cad5b91679ababa4cb5be22cf977402ee49 | 8,712 | adb | Ada | src/tiled_code_gen.adb | Fabien-Chouteau/tiled-code-gen | c4ef09eee995793115a7f3fc35f8c17f5d715322 | [
"BSD-3-Clause"
] | 1 | 2020-12-19T21:14:57.000Z | 2020-12-19T21:14:57.000Z | src/tiled_code_gen.adb | Fabien-Chouteau/tiled-code-gen | c4ef09eee995793115a7f3fc35f8c17f5d715322 | [
"BSD-3-Clause"
] | null | null | null | src/tiled_code_gen.adb | Fabien-Chouteau/tiled-code-gen | c4ef09eee995793115a7f3fc35f8c17f5d715322 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- tiled-code-gen --
-- --
-- Copyright (C) 2018 Fabien Chouteau --
-- --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with Ada.Command_Line;
with Ada.Text_IO;
with Ada.Directories; use Ada.Directories;
with TCG.Palette;
with TCG.Maps;
with TCG.Maps.Render;
with TCG.Maps.List;
with TCG.Outputs.PDF;
with TCG.Outputs.GESTE;
with TCG.Outputs.LibGBA;
with TCG.Outputs.RSTE;
with TCG.Tilesets;
use TCG;
with GNAT.Command_Line; use GNAT.Command_Line;
with GNAT.Strings; use GNAT.Strings;
with GNATCOLL.Utils; use GNATCOLL.Utils;
procedure Tiled_Code_Gen is
List : Maps.List.List;
Config : Command_Line_Configuration;
PDF_Enabled : aliased Boolean;
GESTE_Enabled : aliased Boolean;
RSTE_Enabled : aliased Boolean;
GBA_Enabled : aliased Boolean;
BMP_Enabled : aliased Boolean;
Source_Out_Dir : aliased String_Access := new String'("src");
Doc_Out_Dir : aliased String_Access := new String'("doc");
Color_Format_Str : aliased String_Access := new String'("RGB565");
Color_Format : Palette.Output_Color_Format;
Root_Package : aliased String_Access := new String'("Game_Assets");
Tileset : Tilesets.Tileset_Id := Tilesets.Invalid_Tileset;
use type Tilesets.Tileset_Id;
begin
declare
begin
Define_Switch
(Config, PDF_Enabled'Access, "-p",
Long_Switch => "--pdf",
Help => "Generate PDF documentation");
Define_Switch
(Config, GESTE_Enabled'Access, "-g",
Long_Switch => "--geste",
Help => "Generate code for GEneric Sprite and Tile Engine");
Define_Switch
(Config, RSTE_Enabled'Access, "",
Long_Switch => "--rste",
Help => "Generate code for Rust Sprite and Tile Engine");
Define_Switch
(Config, GBA_Enabled'Access, "",
Long_Switch => "--libgba",
Help => "Generate code for Rust Sprite and Tile Engine");
Define_Switch
(Config, BMP_Enabled'Access, "-b",
Long_Switch => "--bmp",
Help => "Generate bitmap images of the maps");
Define_Switch
(Config, Root_Package'Access, "-r:",
Long_Switch => "--root-package-name=",
Help => "Name of the root package of generated sources (default: " &
Root_Package.all & ")");
Define_Switch
(Config, Source_Out_Dir'Access, "-o:",
Long_Switch => "--source-out-dir=",
Help => "Output directory for the generated sources (default: " &
Source_Out_Dir .all & ")");
Define_Switch
(Config, Doc_Out_Dir'Access, "-d:",
Long_Switch => "--doc-out-dir=",
Help => "Output directory for the generated documentation " &
"(default: " & Doc_Out_Dir.all & ")");
Define_Switch
(Config, Color_Format_Str'Access, "-f:",
Long_Switch => "--color-format=",
Help => "Color format used in generated sources (" &
Palette.Supported_Formats & ") (default: " &
Color_Format_Str.all & ")");
Set_Usage
(Config,
"[switches] maps (.tmx) or tilesets (.tsx)",
"Tiled-Code-Gen, a code generator for Tiled the map editor");
Getopt (Config);
exception
when GNAT.Command_Line.Invalid_Switch =>
Ada.Command_Line.Set_Exit_Status (1);
return;
when GNAT.Command_Line.Exit_From_Command_Line =>
return;
end;
-- Checking output color format
if Palette.Format_Supported (Color_Format_Str.all) then
Color_Format := Palette.Convert (Color_Format_Str.all);
else
Ada.Text_IO.Put_Line
(Ada.Text_IO.Standard_Error,
"Unsuported color format: " & Color_Format_Str.all);
Ada.Command_Line.Set_Exit_Status (1);
return;
end if;
-- Processing each Tiled maps
loop
declare
Arg : constant String := Get_Argument (Do_Expansion => True);
begin
exit when Arg'Length = 0;
if Ends_With (Arg, ".tmx") then
List.Append (TCG.Maps.Load (Arg, Base_Name (Arg)));
elsif Ends_With (Arg, ".tsx") then
Tileset := Tilesets.Load (Arg);
Tilesets.Fill_Master_Tileset (Tileset);
else
Ada.Text_IO.Put_Line
(Ada.Text_IO.Standard_Error,
"Unknown file format: '" & Arg & "'");
end if;
end;
end loop;
if List.Is_Empty and then Tileset = Tilesets.Invalid_Tileset then
Display_Help (Config);
return;
end if;
for Map of List loop
TCG.Maps.Fill_Master_Tileset (Map);
end loop;
if GESTE_Enabled then
Outputs.GESTE.Gen_GESTE_Source (Directory => Source_Out_Dir.all,
Root_Package_Name => Root_Package.all,
Format => Color_Format,
Map_List => List);
end if;
if GBA_Enabled then
Outputs.LibGBA.Gen_LibGBA_Source
(Directory => Source_Out_Dir.all,
Root_Package_Name => Root_Package.all,
Map_List => List);
end if;
if RSTE_Enabled then
Outputs.RSTE.Gen_RSTE_Source (Directory => Source_Out_Dir.all,
Root_Module_Name => Root_Package.all,
Format => Color_Format,
Map_List => List);
end if;
if PDF_Enabled then
Outputs.PDF.Gen_PDF_Doc (Doc_Out_Dir.all, "doc.pdf", List);
end if;
if BMP_Enabled then
for M of List loop
TCG.Maps.Render.To_BMP
(M,
Path => Compose (Doc_Out_Dir.all, Maps.Name (M) & ".bmp"),
Background => (255, 255, 255, 255));
end loop;
end if;
if not GESTE_Enabled
and then
not GBA_Enabled
and then
not PDF_Enabled
and then
not BMP_Enabled
then
Ada.Text_IO.Put_Line
(Ada.Text_IO.Standard_Error, "Warning: no generator enabled.");
Ada.Text_IO.Put_Line
(Ada.Text_IO.Standard_Error, "Use --help to see the list of options.");
end if;
end Tiled_Code_Gen;
| 38.378855 | 79 | 0.551079 |
1e913d26e3f23cd9dcaffdd892f6b484ca17325b | 1,604 | adb | Ada | 1A/S5/PIM/tps/tp7/exemple_vecteurs_creux.adb | MOUDDENEHamza/ENSEEIHT | a90b1dee0c8d18a9578153a357278d99405bb534 | [
"Apache-2.0"
] | 4 | 2020-05-02T12:32:32.000Z | 2022-01-12T20:20:35.000Z | 1A/S5/PIM/tps/tp7/exemple_vecteurs_creux.adb | MOUDDENEHamza/ENSEEIHT | a90b1dee0c8d18a9578153a357278d99405bb534 | [
"Apache-2.0"
] | 2 | 2021-01-14T20:03:26.000Z | 2022-01-30T01:10:00.000Z | 1A/S5/PIM/tps/tp7/exemple_vecteurs_creux.adb | MOUDDENEHamza/ENSEEIHT | a90b1dee0c8d18a9578153a357278d99405bb534 | [
"Apache-2.0"
] | 13 | 2020-11-11T21:28:11.000Z | 2022-02-19T13:54:22.000Z | with Ada.Text_IO; use Ada.Text_IO;
with Vecteurs_Creux; use Vecteurs_Creux;
-- Exemple d'utilisation des vecteurs creux.
procedure Exemple_Vecteurs_Creux is
V : T_Vecteur_Creux;
begin
Put_Line ("Début du scénario");
New_Line;
Initialiser (V); -- Initialiser un vecteur creux. Il est nul.
Afficher (V); -- Afficher le vecteur creux à des fins de mise au point.
Put_Line ("Est-ce que le vecteur V est nul : " & Boolean'Image(Est_Nul (V)));
Put ("Version récursive : la composante du vecteur V à l'indice Indice 18 : ");
Put_Line (Float'Image(Composante_Recursif (V, 18)));
Put ("Version itérative : la composante du vecteur V à l'indice Indice 18 : ");
Put_Line (Float'Image(Composante_Iteratif (V, 18)));
Modifier (V, 2, 5.9); -- Modifier la composante (2, 5.9).
Put_Line ("Modifier la composante (2, 5.9)");
Afficher (V); -- Afficher le vecteur creux à des fins de mise au point.
Modifier (V, 3, 1.3); -- Modifier la composante (2, 1.93).
Put_Line ("Modifier la composante (3, 1.3)");
Afficher (V); -- Afficher le vecteur creux à des fins de mise au point.
Modifier (V, 1, 99.15); -- Modifier la composante (1, 99.15).
Put_Line ("Modifier la composante (1, 99.15)");
Afficher (V); -- Afficher le vecteur creux à des fins de mise au point.
Modifier (V, 1, 10.0); -- Modifier la composante (1, 99.15).
Put_Line ("Modifier la composante (1, 99.15)");
Afficher (V); -- Afficher le vecteur creux à des fins de mise au point.
Detruire (V); -- Détruire le vecteur V.
New_Line;
Put_Line ("Fin du scénario");
end Exemple_Vecteurs_Creux;
| 39.121951 | 80 | 0.679551 |
2e0e63166cb12a271bf5c0914b34a7146fd90c2a | 11,732 | ads | Ada | arch/ARM/RP/svd/rp2040/rp_svd-timer.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2018-05-16T03:56:39.000Z | 2019-07-31T13:53:56.000Z | arch/ARM/RP/svd/rp2040/rp_svd-timer.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | arch/ARM/RP/svd/rp2040/rp_svd-timer.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | -- Copyright (c) 2020 Raspberry Pi (Trading) Ltd.
--
-- SPDX-License-Identifier: BSD-3-Clause
-- This spec has been automatically generated from rp2040.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
-- Controls time and alarms\n
-- time is a 64 bit value indicating the time in usec since power-on\n
-- timeh is the top 32 bits of time & timel is the bottom 32 bits\n
-- to change time write to timelw before timehw\n
-- to read time read from timelr before timehr\n
-- An alarm is set by setting alarm_enable and writing to the
-- corresponding alarm register\n
-- When an alarm is pending, the corresponding alarm_running signal
-- will be high\n
-- An alarm can be cancelled before it has finished by clearing the
-- alarm_enable\n
-- When an alarm fires, the corresponding alarm_irq is set and
-- alarm_running is cleared\n
-- To clear the interrupt write a 1 to the corresponding alarm_irq
package RP_SVD.TIMER is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype ARMED_ARMED_Field is HAL.UInt4;
-- Indicates the armed/disarmed status of each alarm.\n A write to the
-- corresponding ALARMx register arms the alarm.\n Alarms automatically
-- disarm upon firing, but writing ones here\n will disarm immediately
-- without waiting to fire.
type ARMED_Register is record
-- Write data bit of one shall clear (set to zero) the corresponding bit
-- in the field.
ARMED : ARMED_ARMED_Field := 16#0#;
-- unspecified
Reserved_4_31 : HAL.UInt28 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ARMED_Register use record
ARMED at 0 range 0 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
-- DBGPAUSE_DBG array
type DBGPAUSE_DBG_Field_Array is array (0 .. 1) of Boolean
with Component_Size => 1, Size => 2;
-- Type definition for DBGPAUSE_DBG
type DBGPAUSE_DBG_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- DBG as a value
Val : HAL.UInt2;
when True =>
-- DBG as an array
Arr : DBGPAUSE_DBG_Field_Array;
end case;
end record
with Unchecked_Union, Size => 2;
for DBGPAUSE_DBG_Field use record
Val at 0 range 0 .. 1;
Arr at 0 range 0 .. 1;
end record;
-- Set bits high to enable pause when the corresponding debug ports are
-- active
type DBGPAUSE_Register is record
-- unspecified
Reserved_0_0 : HAL.Bit := 16#1#;
-- Pause when processor 0 is in debug mode
DBG : DBGPAUSE_DBG_Field := (As_Array => False, Val => 16#1#);
-- unspecified
Reserved_3_31 : HAL.UInt29 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for DBGPAUSE_Register use record
Reserved_0_0 at 0 range 0 .. 0;
DBG at 0 range 1 .. 2;
Reserved_3_31 at 0 range 3 .. 31;
end record;
-- Set high to pause the timer
type PAUSE_Register is record
PAUSE : Boolean := False;
-- unspecified
Reserved_1_31 : HAL.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for PAUSE_Register use record
PAUSE at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
-- Raw Interrupts
type INTR_Register is record
-- Write data bit of one shall clear (set to zero) the corresponding bit
-- in the field.
ALARM_0 : Boolean := False;
-- Write data bit of one shall clear (set to zero) the corresponding bit
-- in the field.
ALARM_1 : Boolean := False;
-- Write data bit of one shall clear (set to zero) the corresponding bit
-- in the field.
ALARM_2 : Boolean := False;
-- Write data bit of one shall clear (set to zero) the corresponding bit
-- in the field.
ALARM_3 : Boolean := False;
-- unspecified
Reserved_4_31 : HAL.UInt28 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for INTR_Register use record
ALARM_0 at 0 range 0 .. 0;
ALARM_1 at 0 range 1 .. 1;
ALARM_2 at 0 range 2 .. 2;
ALARM_3 at 0 range 3 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
-- Interrupt Enable
type INTE_Register is record
ALARM_0 : Boolean := False;
ALARM_1 : Boolean := False;
ALARM_2 : Boolean := False;
ALARM_3 : Boolean := False;
-- unspecified
Reserved_4_31 : HAL.UInt28 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for INTE_Register use record
ALARM_0 at 0 range 0 .. 0;
ALARM_1 at 0 range 1 .. 1;
ALARM_2 at 0 range 2 .. 2;
ALARM_3 at 0 range 3 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
-- Interrupt Force
type INTF_Register is record
ALARM_0 : Boolean := False;
ALARM_1 : Boolean := False;
ALARM_2 : Boolean := False;
ALARM_3 : Boolean := False;
-- unspecified
Reserved_4_31 : HAL.UInt28 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for INTF_Register use record
ALARM_0 at 0 range 0 .. 0;
ALARM_1 at 0 range 1 .. 1;
ALARM_2 at 0 range 2 .. 2;
ALARM_3 at 0 range 3 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
-- Interrupt status after masking & forcing
type INTS_Register is record
-- Read-only.
ALARM_0 : Boolean;
-- Read-only.
ALARM_1 : Boolean;
-- Read-only.
ALARM_2 : Boolean;
-- Read-only.
ALARM_3 : Boolean;
-- unspecified
Reserved_4_31 : HAL.UInt28;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for INTS_Register use record
ALARM_0 at 0 range 0 .. 0;
ALARM_1 at 0 range 1 .. 1;
ALARM_2 at 0 range 2 .. 2;
ALARM_3 at 0 range 3 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Controls time and alarms\n time is a 64 bit value indicating the time in
-- usec since power-on\n timeh is the top 32 bits of time & timel is the
-- bottom 32 bits\n to change time write to timelw before timehw\n to read
-- time read from timelr before timehr\n An alarm is set by setting
-- alarm_enable and writing to the corresponding alarm register\n When an
-- alarm is pending, the corresponding alarm_running signal will be high\n
-- An alarm can be cancelled before it has finished by clearing the
-- alarm_enable\n When an alarm fires, the corresponding alarm_irq is set
-- and alarm_running is cleared\n To clear the interrupt write a 1 to the
-- corresponding alarm_irq
type TIMER_Peripheral is record
-- Write to bits 63:32 of time\n always write timelw before timehw
TIMEHW : aliased HAL.UInt32;
-- Write to bits 31:0 of time\n writes do not get copied to time until
-- timehw is written
TIMELW : aliased HAL.UInt32;
-- Read from bits 63:32 of time\n always read timelr before timehr
TIMEHR : aliased HAL.UInt32;
-- Read from bits 31:0 of time
TIMELR : aliased HAL.UInt32;
-- Arm alarm 0, and configure the time it will fire.\n Once armed, the
-- alarm fires when TIMER_ALARM0 == TIMELR.\n The alarm will disarm
-- itself once it fires, and can\n be disarmed early using the ARMED
-- status register.
ALARM0 : aliased HAL.UInt32;
-- Arm alarm 1, and configure the time it will fire.\n Once armed, the
-- alarm fires when TIMER_ALARM1 == TIMELR.\n The alarm will disarm
-- itself once it fires, and can\n be disarmed early using the ARMED
-- status register.
ALARM1 : aliased HAL.UInt32;
-- Arm alarm 2, and configure the time it will fire.\n Once armed, the
-- alarm fires when TIMER_ALARM2 == TIMELR.\n The alarm will disarm
-- itself once it fires, and can\n be disarmed early using the ARMED
-- status register.
ALARM2 : aliased HAL.UInt32;
-- Arm alarm 3, and configure the time it will fire.\n Once armed, the
-- alarm fires when TIMER_ALARM3 == TIMELR.\n The alarm will disarm
-- itself once it fires, and can\n be disarmed early using the ARMED
-- status register.
ALARM3 : aliased HAL.UInt32;
-- Indicates the armed/disarmed status of each alarm.\n A write to the
-- corresponding ALARMx register arms the alarm.\n Alarms automatically
-- disarm upon firing, but writing ones here\n will disarm immediately
-- without waiting to fire.
ARMED : aliased ARMED_Register;
-- Raw read from bits 63:32 of time (no side effects)
TIMERAWH : aliased HAL.UInt32;
-- Raw read from bits 31:0 of time (no side effects)
TIMERAWL : aliased HAL.UInt32;
-- Set bits high to enable pause when the corresponding debug ports are
-- active
DBGPAUSE : aliased DBGPAUSE_Register;
-- Set high to pause the timer
PAUSE : aliased PAUSE_Register;
-- Raw Interrupts
INTR : aliased INTR_Register;
-- Interrupt Enable
INTE : aliased INTE_Register;
-- Interrupt Force
INTF : aliased INTF_Register;
-- Interrupt status after masking & forcing
INTS : aliased INTS_Register;
end record
with Volatile;
for TIMER_Peripheral use record
TIMEHW at 16#0# range 0 .. 31;
TIMELW at 16#4# range 0 .. 31;
TIMEHR at 16#8# range 0 .. 31;
TIMELR at 16#C# range 0 .. 31;
ALARM0 at 16#10# range 0 .. 31;
ALARM1 at 16#14# range 0 .. 31;
ALARM2 at 16#18# range 0 .. 31;
ALARM3 at 16#1C# range 0 .. 31;
ARMED at 16#20# range 0 .. 31;
TIMERAWH at 16#24# range 0 .. 31;
TIMERAWL at 16#28# range 0 .. 31;
DBGPAUSE at 16#2C# range 0 .. 31;
PAUSE at 16#30# range 0 .. 31;
INTR at 16#34# range 0 .. 31;
INTE at 16#38# range 0 .. 31;
INTF at 16#3C# range 0 .. 31;
INTS at 16#40# range 0 .. 31;
end record;
-- Controls time and alarms\n time is a 64 bit value indicating the time in
-- usec since power-on\n timeh is the top 32 bits of time & timel is the
-- bottom 32 bits\n to change time write to timelw before timehw\n to read
-- time read from timelr before timehr\n An alarm is set by setting
-- alarm_enable and writing to the corresponding alarm register\n When an
-- alarm is pending, the corresponding alarm_running signal will be high\n
-- An alarm can be cancelled before it has finished by clearing the
-- alarm_enable\n When an alarm fires, the corresponding alarm_irq is set
-- and alarm_running is cleared\n To clear the interrupt write a 1 to the
-- corresponding alarm_irq
TIMER_Periph : aliased TIMER_Peripheral
with Import, Address => TIMER_Base;
end RP_SVD.TIMER;
| 38.090909 | 79 | 0.620781 |
38dfbe9aaae0c38b8906f09300ccf037441664a9 | 20,821 | ads | Ada | source/amf/dd/amf-internals-tables-dd_attributes.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/dd/amf-internals-tables-dd_attributes.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/dd/amf-internals-tables-dd_attributes.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.DC;
with AMF.DG;
with AMF.Real_Collections;
with Matreshka.Internals.Strings;
package AMF.Internals.Tables.DD_Attributes is
function Internal_Get_Alignment
(Self : AMF.Internals.AMF_Element)
return AMF.DC.DC_Alignment_Kind;
procedure Internal_Set_Alignment
(Self : AMF.Internals.AMF_Element;
To : AMF.DC.DC_Alignment_Kind);
-- Text => Text::alignment
function Internal_Get_Background_Color
(Self : AMF.Internals.AMF_Element)
return AMF.DC.Optional_DC_Color;
procedure Internal_Set_Background_Color
(Self : AMF.Internals.AMF_Element;
To : AMF.DC.Optional_DC_Color);
-- Canvas => Canvas::backgroundColor
function Internal_Get_Background_Fill
(Self : AMF.Internals.AMF_Element)
return AMF.Internals.AMF_Element;
procedure Internal_Set_Background_Fill
(Self : AMF.Internals.AMF_Element;
To : AMF.Internals.AMF_Element);
-- Canvas => Canvas::backgroundFill
function Internal_Get_Bounds
(Self : AMF.Internals.AMF_Element)
return AMF.DC.DC_Bounds;
procedure Internal_Set_Bounds
(Self : AMF.Internals.AMF_Element;
To : AMF.DC.DC_Bounds);
-- Image => Image::bounds
-- Pattern => Pattern::bounds
-- Rectangle => Rectangle::bounds
-- Text => Text::bounds
function Internal_Get_Canvas
(Self : AMF.Internals.AMF_Element)
return AMF.Internals.AMF_Element;
procedure Internal_Set_Canvas
(Self : AMF.Internals.AMF_Element;
To : AMF.Internals.AMF_Element);
-- LinearGradient => Fill::canvas
-- Marker => Marker::canvas
-- Pattern => Fill::canvas
-- RadialGradient => Fill::canvas
function Internal_Get_Center
(Self : AMF.Internals.AMF_Element)
return AMF.DC.DC_Point;
procedure Internal_Set_Center
(Self : AMF.Internals.AMF_Element;
To : AMF.DC.DC_Point);
-- Circle => Circle::center
-- Ellipse => Ellipse::center
function Internal_Get_Center_X
(Self : AMF.Internals.AMF_Element)
return AMF.Real;
procedure Internal_Set_Center_X
(Self : AMF.Internals.AMF_Element;
To : AMF.Real);
-- RadialGradient => RadialGradient::centerX
function Internal_Get_Center_Y
(Self : AMF.Internals.AMF_Element)
return AMF.Real;
procedure Internal_Set_Center_Y
(Self : AMF.Internals.AMF_Element;
To : AMF.Real);
-- RadialGradient => RadialGradient::centerY
function Internal_Get_Clip_Path
(Self : AMF.Internals.AMF_Element)
return AMF.Internals.AMF_Element;
procedure Internal_Set_Clip_Path
(Self : AMF.Internals.AMF_Element;
To : AMF.Internals.AMF_Element);
-- Canvas => GraphicalElement::clipPath
-- Circle => GraphicalElement::clipPath
-- ClipPath => GraphicalElement::clipPath
-- Ellipse => GraphicalElement::clipPath
-- Group => GraphicalElement::clipPath
-- Image => GraphicalElement::clipPath
-- Line => GraphicalElement::clipPath
-- MarkedElement => GraphicalElement::clipPath
-- Marker => GraphicalElement::clipPath
-- Path => GraphicalElement::clipPath
-- Polygon => GraphicalElement::clipPath
-- Polyline => GraphicalElement::clipPath
-- Rectangle => GraphicalElement::clipPath
-- Text => GraphicalElement::clipPath
function Internal_Get_Clipped_Element
(Self : AMF.Internals.AMF_Element)
return AMF.Internals.AMF_Element;
procedure Internal_Set_Clipped_Element
(Self : AMF.Internals.AMF_Element;
To : AMF.Internals.AMF_Element);
-- ClipPath => ClipPath::clippedElement
function Internal_Get_Command
(Self : AMF.Internals.AMF_Element)
return AMF.DG.Sequence_Of_Path_Command;
-- Path => Path::command
function Internal_Get_Corner_Radius
(Self : AMF.Internals.AMF_Element)
return AMF.Real;
procedure Internal_Set_Corner_Radius
(Self : AMF.Internals.AMF_Element;
To : AMF.Real);
-- Rectangle => Rectangle::cornerRadius
function Internal_Get_Data
(Self : AMF.Internals.AMF_Element)
return Matreshka.Internals.Strings.Shared_String_Access;
procedure Internal_Set_Data
(Self : AMF.Internals.AMF_Element;
To : Matreshka.Internals.Strings.Shared_String_Access);
-- Text => Text::data
function Internal_Get_End
(Self : AMF.Internals.AMF_Element)
return AMF.DC.DC_Point;
procedure Internal_Set_End
(Self : AMF.Internals.AMF_Element;
To : AMF.DC.DC_Point);
-- Line => Line::end
function Internal_Get_End_Marker
(Self : AMF.Internals.AMF_Element)
return AMF.Internals.AMF_Element;
procedure Internal_Set_End_Marker
(Self : AMF.Internals.AMF_Element;
To : AMF.Internals.AMF_Element);
-- Line => MarkedElement::endMarker
-- MarkedElement => MarkedElement::endMarker
-- Path => MarkedElement::endMarker
-- Polygon => MarkedElement::endMarker
-- Polyline => MarkedElement::endMarker
function Internal_Get_Fill
(Self : AMF.Internals.AMF_Element)
return AMF.Internals.AMF_Element;
procedure Internal_Set_Fill
(Self : AMF.Internals.AMF_Element;
To : AMF.Internals.AMF_Element);
-- Style => Style::fill
function Internal_Get_Fill_Color
(Self : AMF.Internals.AMF_Element)
return AMF.DC.Optional_DC_Color;
procedure Internal_Set_Fill_Color
(Self : AMF.Internals.AMF_Element;
To : AMF.DC.Optional_DC_Color);
-- Style => Style::fillColor
function Internal_Get_Fill_Opacity
(Self : AMF.Internals.AMF_Element)
return AMF.Optional_Real;
procedure Internal_Set_Fill_Opacity
(Self : AMF.Internals.AMF_Element;
To : AMF.Optional_Real);
-- Style => Style::fillOpacity
function Internal_Get_Focus_X
(Self : AMF.Internals.AMF_Element)
return AMF.Real;
procedure Internal_Set_Focus_X
(Self : AMF.Internals.AMF_Element;
To : AMF.Real);
-- RadialGradient => RadialGradient::focusX
function Internal_Get_Focus_Y
(Self : AMF.Internals.AMF_Element)
return AMF.Real;
procedure Internal_Set_Focus_Y
(Self : AMF.Internals.AMF_Element;
To : AMF.Real);
-- RadialGradient => RadialGradient::focusY
function Internal_Get_Font_Bold
(Self : AMF.Internals.AMF_Element)
return AMF.Optional_Boolean;
procedure Internal_Set_Font_Bold
(Self : AMF.Internals.AMF_Element;
To : AMF.Optional_Boolean);
-- Style => Style::fontBold
function Internal_Get_Font_Color
(Self : AMF.Internals.AMF_Element)
return AMF.DC.Optional_DC_Color;
procedure Internal_Set_Font_Color
(Self : AMF.Internals.AMF_Element;
To : AMF.DC.Optional_DC_Color);
-- Style => Style::fontColor
function Internal_Get_Font_Italic
(Self : AMF.Internals.AMF_Element)
return AMF.Optional_Boolean;
procedure Internal_Set_Font_Italic
(Self : AMF.Internals.AMF_Element;
To : AMF.Optional_Boolean);
-- Style => Style::fontItalic
function Internal_Get_Font_Name
(Self : AMF.Internals.AMF_Element)
return Matreshka.Internals.Strings.Shared_String_Access;
procedure Internal_Set_Font_Name
(Self : AMF.Internals.AMF_Element;
To : Matreshka.Internals.Strings.Shared_String_Access);
-- Style => Style::fontName
function Internal_Get_Font_Size
(Self : AMF.Internals.AMF_Element)
return AMF.Optional_Real;
procedure Internal_Set_Font_Size
(Self : AMF.Internals.AMF_Element;
To : AMF.Optional_Real);
-- Style => Style::fontSize
function Internal_Get_Font_Strike_Through
(Self : AMF.Internals.AMF_Element)
return AMF.Optional_Boolean;
procedure Internal_Set_Font_Strike_Through
(Self : AMF.Internals.AMF_Element;
To : AMF.Optional_Boolean);
-- Style => Style::fontStrikeThrough
function Internal_Get_Font_Underline
(Self : AMF.Internals.AMF_Element)
return AMF.Optional_Boolean;
procedure Internal_Set_Font_Underline
(Self : AMF.Internals.AMF_Element;
To : AMF.Optional_Boolean);
-- Style => Style::fontUnderline
function Internal_Get_Group
(Self : AMF.Internals.AMF_Element)
return AMF.Internals.AMF_Element;
procedure Internal_Set_Group
(Self : AMF.Internals.AMF_Element;
To : AMF.Internals.AMF_Element);
-- Canvas => GraphicalElement::group
-- Circle => GraphicalElement::group
-- ClipPath => GraphicalElement::group
-- Ellipse => GraphicalElement::group
-- Group => GraphicalElement::group
-- Image => GraphicalElement::group
-- Line => GraphicalElement::group
-- MarkedElement => GraphicalElement::group
-- Marker => GraphicalElement::group
-- Path => GraphicalElement::group
-- Polygon => GraphicalElement::group
-- Polyline => GraphicalElement::group
-- Rectangle => GraphicalElement::group
-- Text => GraphicalElement::group
function Internal_Get_Is_Aspect_Ratio_Preserved
(Self : AMF.Internals.AMF_Element)
return Boolean;
procedure Internal_Set_Is_Aspect_Ratio_Preserved
(Self : AMF.Internals.AMF_Element;
To : Boolean);
-- Image => Image::isAspectRatioPreserved
function Internal_Get_Local_Style
(Self : AMF.Internals.AMF_Element)
return AMF.Internals.AMF_Collection_Of_Element;
-- Canvas => GraphicalElement::localStyle
-- Circle => GraphicalElement::localStyle
-- ClipPath => GraphicalElement::localStyle
-- Ellipse => GraphicalElement::localStyle
-- Group => GraphicalElement::localStyle
-- Image => GraphicalElement::localStyle
-- Line => GraphicalElement::localStyle
-- MarkedElement => GraphicalElement::localStyle
-- Marker => GraphicalElement::localStyle
-- Path => GraphicalElement::localStyle
-- Polygon => GraphicalElement::localStyle
-- Polyline => GraphicalElement::localStyle
-- Rectangle => GraphicalElement::localStyle
-- Text => GraphicalElement::localStyle
function Internal_Get_Member
(Self : AMF.Internals.AMF_Element)
return AMF.Internals.AMF_Collection_Of_Element;
-- Canvas => Group::member
-- ClipPath => Group::member
-- Group => Group::member
-- Marker => Group::member
function Internal_Get_Mid_Marker
(Self : AMF.Internals.AMF_Element)
return AMF.Internals.AMF_Element;
procedure Internal_Set_Mid_Marker
(Self : AMF.Internals.AMF_Element;
To : AMF.Internals.AMF_Element);
-- Line => MarkedElement::midMarker
-- MarkedElement => MarkedElement::midMarker
-- Path => MarkedElement::midMarker
-- Polygon => MarkedElement::midMarker
-- Polyline => MarkedElement::midMarker
function Internal_Get_Packaged_Fill
(Self : AMF.Internals.AMF_Element)
return AMF.Internals.AMF_Collection_Of_Element;
-- Canvas => Canvas::packagedFill
function Internal_Get_Packaged_Marker
(Self : AMF.Internals.AMF_Element)
return AMF.Internals.AMF_Collection_Of_Element;
-- Canvas => Canvas::packagedMarker
function Internal_Get_Packaged_Style
(Self : AMF.Internals.AMF_Element)
return AMF.Internals.AMF_Collection_Of_Element;
-- Canvas => Canvas::packagedStyle
function Internal_Get_Point
(Self : AMF.Internals.AMF_Element)
return AMF.DC.Sequence_Of_DC_Point;
-- Polygon => Polygon::point
-- Polyline => Polyline::point
function Internal_Get_Radii
(Self : AMF.Internals.AMF_Element)
return AMF.DC.DC_Dimension;
procedure Internal_Set_Radii
(Self : AMF.Internals.AMF_Element;
To : AMF.DC.DC_Dimension);
-- Ellipse => Ellipse::radii
function Internal_Get_Radius
(Self : AMF.Internals.AMF_Element)
return AMF.Real;
procedure Internal_Set_Radius
(Self : AMF.Internals.AMF_Element;
To : AMF.Real);
-- Circle => Circle::radius
-- RadialGradient => RadialGradient::radius
function Internal_Get_Reference
(Self : AMF.Internals.AMF_Element)
return AMF.DC.DC_Point;
procedure Internal_Set_Reference
(Self : AMF.Internals.AMF_Element;
To : AMF.DC.DC_Point);
-- Marker => Marker::reference
function Internal_Get_Shared_Style
(Self : AMF.Internals.AMF_Element)
return AMF.Internals.AMF_Collection_Of_Element;
-- Canvas => GraphicalElement::sharedStyle
-- Circle => GraphicalElement::sharedStyle
-- ClipPath => GraphicalElement::sharedStyle
-- Ellipse => GraphicalElement::sharedStyle
-- Group => GraphicalElement::sharedStyle
-- Image => GraphicalElement::sharedStyle
-- Line => GraphicalElement::sharedStyle
-- MarkedElement => GraphicalElement::sharedStyle
-- Marker => GraphicalElement::sharedStyle
-- Path => GraphicalElement::sharedStyle
-- Polygon => GraphicalElement::sharedStyle
-- Polyline => GraphicalElement::sharedStyle
-- Rectangle => GraphicalElement::sharedStyle
-- Text => GraphicalElement::sharedStyle
function Internal_Get_Size
(Self : AMF.Internals.AMF_Element)
return AMF.DC.DC_Dimension;
procedure Internal_Set_Size
(Self : AMF.Internals.AMF_Element;
To : AMF.DC.DC_Dimension);
-- Marker => Marker::size
function Internal_Get_Source
(Self : AMF.Internals.AMF_Element)
return Matreshka.Internals.Strings.Shared_String_Access;
procedure Internal_Set_Source
(Self : AMF.Internals.AMF_Element;
To : Matreshka.Internals.Strings.Shared_String_Access);
-- Image => Image::source
function Internal_Get_Start
(Self : AMF.Internals.AMF_Element)
return AMF.DC.DC_Point;
procedure Internal_Set_Start
(Self : AMF.Internals.AMF_Element;
To : AMF.DC.DC_Point);
-- Line => Line::start
function Internal_Get_Start_Marker
(Self : AMF.Internals.AMF_Element)
return AMF.Internals.AMF_Element;
procedure Internal_Set_Start_Marker
(Self : AMF.Internals.AMF_Element;
To : AMF.Internals.AMF_Element);
-- Line => MarkedElement::startMarker
-- MarkedElement => MarkedElement::startMarker
-- Path => MarkedElement::startMarker
-- Polygon => MarkedElement::startMarker
-- Polyline => MarkedElement::startMarker
function Internal_Get_Stop
(Self : AMF.Internals.AMF_Element)
return AMF.DG.Set_Of_DG_Gradient_Stop;
-- LinearGradient => Gradient::stop
-- RadialGradient => Gradient::stop
function Internal_Get_Stroke_Color
(Self : AMF.Internals.AMF_Element)
return AMF.DC.Optional_DC_Color;
procedure Internal_Set_Stroke_Color
(Self : AMF.Internals.AMF_Element;
To : AMF.DC.Optional_DC_Color);
-- Style => Style::strokeColor
function Internal_Get_Stroke_Dash_Length
(Self : AMF.Internals.AMF_Element)
return AMF.Real_Collections.Sequence_Of_Real;
-- Style => Style::strokeDashLength
function Internal_Get_Stroke_Opacity
(Self : AMF.Internals.AMF_Element)
return AMF.Optional_Real;
procedure Internal_Set_Stroke_Opacity
(Self : AMF.Internals.AMF_Element;
To : AMF.Optional_Real);
-- Style => Style::strokeOpacity
function Internal_Get_Stroke_Width
(Self : AMF.Internals.AMF_Element)
return AMF.Optional_Real;
procedure Internal_Set_Stroke_Width
(Self : AMF.Internals.AMF_Element;
To : AMF.Optional_Real);
-- Style => Style::strokeWidth
function Internal_Get_Tile
(Self : AMF.Internals.AMF_Element)
return AMF.Internals.AMF_Element;
procedure Internal_Set_Tile
(Self : AMF.Internals.AMF_Element;
To : AMF.Internals.AMF_Element);
-- Pattern => Pattern::tile
function Internal_Get_Transform
(Self : AMF.Internals.AMF_Element)
return AMF.DG.Sequence_Of_DG_Transform;
-- Canvas => GraphicalElement::transform
-- Circle => GraphicalElement::transform
-- ClipPath => GraphicalElement::transform
-- Ellipse => GraphicalElement::transform
-- Group => GraphicalElement::transform
-- Image => GraphicalElement::transform
-- Line => GraphicalElement::transform
-- LinearGradient => Fill::transform
-- MarkedElement => GraphicalElement::transform
-- Marker => GraphicalElement::transform
-- Path => GraphicalElement::transform
-- Pattern => Fill::transform
-- Polygon => GraphicalElement::transform
-- Polyline => GraphicalElement::transform
-- RadialGradient => Fill::transform
-- Rectangle => GraphicalElement::transform
-- Text => GraphicalElement::transform
function Internal_Get_X1
(Self : AMF.Internals.AMF_Element)
return AMF.Real;
procedure Internal_Set_X1
(Self : AMF.Internals.AMF_Element;
To : AMF.Real);
-- LinearGradient => LinearGradient::x1
function Internal_Get_X2
(Self : AMF.Internals.AMF_Element)
return AMF.Real;
procedure Internal_Set_X2
(Self : AMF.Internals.AMF_Element;
To : AMF.Real);
-- LinearGradient => LinearGradient::x2
function Internal_Get_Y1
(Self : AMF.Internals.AMF_Element)
return AMF.Real;
procedure Internal_Set_Y1
(Self : AMF.Internals.AMF_Element;
To : AMF.Real);
-- LinearGradient => LinearGradient::y1
function Internal_Get_Y2
(Self : AMF.Internals.AMF_Element)
return AMF.Real;
procedure Internal_Set_Y2
(Self : AMF.Internals.AMF_Element;
To : AMF.Real);
-- LinearGradient => LinearGradient::y2
end AMF.Internals.Tables.DD_Attributes;
| 37.583032 | 78 | 0.651073 |
add346a6b93a64ad8a9b9a04b763c2c1e766070f | 9,297 | ads | Ada | bb-runtimes/src/system/system-pikeos-arm-ravenscar-sfp.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/src/system/system-pikeos-arm-ravenscar-sfp.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/src/system/system-pikeos-arm-ravenscar-sfp.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M --
-- --
-- S p e c --
-- (PikeOS ARM Version) --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This is a Ravenscar sfp version of this package for ARM PikeOS targets
pragma Restrictions (No_Exception_Propagation);
-- Only local exception handling is supported in this profile
pragma Restrictions (No_Exception_Registration);
-- Disable exception name registration. This capability is not used because
-- it is only required by exception stream attributes which are not supported
-- in this run time.
pragma Restrictions (No_Implicit_Dynamic_Code);
-- Pointers to nested subprograms are not allowed in this run time, in order
-- to prevent the compiler from building "trampolines".
pragma Restrictions (No_Finalization);
-- Controlled types are not supported in this run time
pragma Profile (Ravenscar);
-- This is a Ravenscar run time
package System is
pragma Pure;
-- Note that we take advantage of the implementation permission to make
-- this unit Pure instead of Preelaborable; see RM 13.7.1(15). In Ada
-- 2005, this is Pure in any case (AI-362).
pragma No_Elaboration_Code_All;
-- Allow the use of that restriction in units that WITH this unit
type Name is (SYSTEM_NAME_GNAT);
System_Name : constant Name := SYSTEM_NAME_GNAT;
-- System-Dependent Named Numbers
Min_Int : constant := -2 ** (Standard'Max_Integer_Size - 1);
Max_Int : constant := 2 ** (Standard'Max_Integer_Size - 1) - 1;
Max_Binary_Modulus : constant := 2 ** Standard'Max_Integer_Size;
Max_Nonbinary_Modulus : constant := 2 ** Integer'Size - 1;
Max_Base_Digits : constant := Long_Long_Float'Digits;
Max_Digits : constant := Long_Long_Float'Digits;
Max_Mantissa : constant := Standard'Max_Integer_Size - 1;
Fine_Delta : constant := 2.0 ** (-Max_Mantissa);
Tick : constant := 0.000_000_001; -- 1 ns
-- Storage-related Declarations
type Address is private;
pragma Preelaborable_Initialization (Address);
Null_Address : constant Address;
Storage_Unit : constant := 8;
Word_Size : constant := 32;
Memory_Size : constant := 2 ** 32;
-- Address comparison
function "<" (Left, Right : Address) return Boolean;
function "<=" (Left, Right : Address) return Boolean;
function ">" (Left, Right : Address) return Boolean;
function ">=" (Left, Right : Address) return Boolean;
function "=" (Left, Right : Address) return Boolean;
pragma Import (Intrinsic, "<");
pragma Import (Intrinsic, "<=");
pragma Import (Intrinsic, ">");
pragma Import (Intrinsic, ">=");
pragma Import (Intrinsic, "=");
-- Other System-Dependent Declarations
type Bit_Order is (High_Order_First, Low_Order_First);
Default_Bit_Order : constant Bit_Order := Low_Order_First;
pragma Warnings (Off, Default_Bit_Order); -- kill constant condition warning
-- Priority-related Declarations (RM D.1)
-- For simplicity there is a 1-1 correspondence between Ada and PikeOS
-- priorities. PikeOS priority 0 is reserved by the idle thread, so not
-- available to Ada.
-- PikeOS priorities are 0 .. 255
-- Priorities greather than 245 are reserved to the system software (PSSW)
-- This implementation reserves priorities 224-239 to interrupts
-- Priorities 240-245 are reserved to HM and PikeOS exception handlers
Max_Priority : constant Positive := 223;
Max_Interrupt_Priority : constant Positive := 239;
subtype Any_Priority is Integer range 1 .. Max_Interrupt_Priority;
subtype Priority is Any_Priority
range Any_Priority'First .. Max_Priority;
subtype Interrupt_Priority is Any_Priority
range Priority'Last + 1 .. Any_Priority'Last;
Default_Priority : constant Priority :=
(Priority'First + Priority'Last) / 2;
private
type Address is mod Memory_Size;
Null_Address : constant Address := 0;
--------------------------------------
-- System Implementation Parameters --
--------------------------------------
-- These parameters provide information about the target that is used
-- by the compiler. They are in the private part of System, where they
-- can be accessed using the special circuitry in the Targparm unit
-- whose source should be consulted for more detailed descriptions
-- of the individual switch values.
Atomic_Sync_Default : constant Boolean := False;
Backend_Divide_Checks : constant Boolean := False;
Backend_Overflow_Checks : constant Boolean := True;
Command_Line_Args : constant Boolean := False;
Configurable_Run_Time : constant Boolean := True;
Denorm : constant Boolean := True;
Duration_32_Bits : constant Boolean := False;
Exit_Status_Supported : constant Boolean := False;
Fractional_Fixed_Ops : constant Boolean := False;
Frontend_Layout : constant Boolean := False;
Machine_Overflows : constant Boolean := False;
Machine_Rounds : constant Boolean := True;
Preallocated_Stacks : constant Boolean := True;
Signed_Zeros : constant Boolean := True;
Stack_Check_Default : constant Boolean := False;
Stack_Check_Probes : constant Boolean := True;
Stack_Check_Limits : constant Boolean := False;
Support_Aggregates : constant Boolean := True;
Support_Composite_Assign : constant Boolean := True;
Support_Composite_Compare : constant Boolean := True;
Support_Long_Shifts : constant Boolean := True;
Always_Compatible_Rep : constant Boolean := True;
Suppress_Standard_Library : constant Boolean := True;
Use_Ada_Main_Program_Name : constant Boolean := False;
Frontend_Exceptions : constant Boolean := False;
ZCX_By_Default : constant Boolean := True;
-- Select the appropriate entry point, linker script, and libraries for a
-- PikeOS partition.
-- Traditionally the entry point of a native application is _p4_entry. For
-- an APEX application, it is _begin.
-- In order to use the same link options for both personalities, _begin is
-- used for native as well.
pragma Linker_Options
("-u__p4_start" & ASCII.NUL & "-e__p4_start" & ASCII.NUL &
"-u_p4_entry" & ASCII.NUL &
"-nostdlib" & ASCII.NUL &
"-T../ld/arm-app.ld" & ASCII.NUL &
"-T../ld/memory.ld" & ASCII.NUL &
"-lvm" & ASCII.NUL & "-lp4" & ASCII.NUL & "-lstand" & ASCII.NUL &
"-lgcc");
end System;
| 46.024752 | 79 | 0.584597 |
adf1e8eeb997d2b432bcb93bd373dd7f856fb75d | 3,611 | ads | Ada | source/amf/uml/amf-uml-literal_reals-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-literal_reals-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-literal_reals-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.Literal_Reals.Hash is
new AMF.Elements.Generic_Hash (UML_Literal_Real, UML_Literal_Real_Access);
| 72.22 | 78 | 0.402382 |
381386bc686f7046ee890edf16d65bc0f4183432 | 853 | adb | Ada | src/gl/mac/gl-api-mac_os_x.adb | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | 79 | 2015-04-20T23:10:02.000Z | 2022-03-04T13:50:56.000Z | src/gl/mac/gl-api-mac_os_x.adb | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | 126 | 2015-09-10T10:41:34.000Z | 2022-03-20T11:25:40.000Z | src/gl/mac/gl-api-mac_os_x.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"
package body GL.API.Mac_OS_X is
OpenGLFramework_Cached : CFBundleRef;
function OpenGLFramework return CFBundleRef is
use type System.Address;
begin
if OpenGLFramework_Cached = System.Null_Address then
declare
OpenGLFramework_ID : constant CFStringRef
:= CFStringCreateWithCString (System.Null_Address,
IFC.To_C ("com.apple.opengl"),
kCFStringEncodingASCII);
begin
OpenGLFramework_Cached
:= CFBundleGetBundleWithIdentifier (OpenGLFramework_ID);
end;
end if;
return OpenGLFramework_Cached;
end OpenGLFramework;
end GL.API.Mac_OS_X;
| 34.12 | 74 | 0.623681 |
38fe7aeeb4c14d6e515541b2715640bf9fefb295 | 356 | ads | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/limited_with4_pkg.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/limited_with4_pkg.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/limited_with4_pkg.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | with Limited_With4;
package Limited_With4_Pkg is
P1 : Limited_With4.Ptr1 := Limited_With4.Proc1'Access;
P2 : Limited_With4.Ptr2 := Limited_With4.Proc2'Access;
type Rec12 is record
I : Integer;
R : Limited_With4.Rec1;
end record;
type Rec22 is record
I : Integer;
R : Limited_With4.Rec2;
end record;
end Limited_With4_Pkg;
| 17.8 | 56 | 0.710674 |
380db84bfdb5ec7677e34db8751b40590a2338dc | 9,018 | adb | Ada | tools-src/gnu/gcc/gcc/ada/5vinmaop.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 80 | 2015-01-02T10:14:04.000Z | 2021-06-07T06:29:49.000Z | tools-src/gnu/gcc/gcc/ada/5vinmaop.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 9 | 2015-05-14T11:03:12.000Z | 2018-01-04T07:12:58.000Z | tools-src/gnu/gcc/gcc/ada/5vinmaop.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNU ADA RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . I N T E R R U P T _ M A N A G E M E N T . --
-- O P E R A T I O N S --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1991-2000 Florida State University --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNARL is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNARL; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. It is --
-- now maintained by Ada Core Technologies Inc. in cooperation with Florida --
-- State University (http://www.gnat.com). --
-- --
------------------------------------------------------------------------------
-- This is a OpenVMS/Alpha version of this package.
with System.OS_Interface;
-- used for various type, constant, and operations
with System.Tasking;
with System.Tasking.Initialization;
with System.Task_Primitives.Operations;
with System.Task_Primitives.Operations.DEC;
with Unchecked_Conversion;
package body System.Interrupt_Management.Operations is
use System.OS_Interface;
use System.Tasking;
use type unsigned_short;
function To_Address is new Unchecked_Conversion (Task_ID, System.Address);
function To_Task_ID is new Unchecked_Conversion (System.Address, Task_ID);
package POP renames System.Task_Primitives.Operations;
----------------------------
-- Thread_Block_Interrupt --
----------------------------
procedure Thread_Block_Interrupt (Interrupt : Interrupt_ID) is
begin
null;
end Thread_Block_Interrupt;
------------------------------
-- Thread_Unblock_Interrupt --
------------------------------
procedure Thread_Unblock_Interrupt (Interrupt : Interrupt_ID) is
begin
null;
end Thread_Unblock_Interrupt;
------------------------
-- Set_Interrupt_Mask --
------------------------
procedure Set_Interrupt_Mask (Mask : access Interrupt_Mask) is
begin
null;
end Set_Interrupt_Mask;
procedure Set_Interrupt_Mask
(Mask : access Interrupt_Mask;
OMask : access Interrupt_Mask) is
begin
null;
end Set_Interrupt_Mask;
------------------------
-- Get_Interrupt_Mask --
------------------------
procedure Get_Interrupt_Mask (Mask : access Interrupt_Mask) is
begin
null;
end Get_Interrupt_Mask;
--------------------
-- Interrupt_Wait --
--------------------
function To_unsigned_long is new
Unchecked_Conversion (System.Address, unsigned_long);
function Interrupt_Wait (Mask : access Interrupt_Mask)
return Interrupt_ID
is
Self_ID : Task_ID := Self;
Iosb : IO_Status_Block_Type := (0, 0, 0);
Status : Cond_Value_Type;
begin
-- A QIO read is registered. The system call returns immediately
-- after scheduling an AST to be fired when the operation
-- completes.
Sys_QIO
(Status => Status,
Chan => Rcv_Interrupt_Chan,
Func => IO_READVBLK,
Iosb => Iosb,
Astadr =>
POP.DEC.Interrupt_AST_Handler'Access,
Astprm => To_Address (Self_ID),
P1 => To_unsigned_long (Interrupt_Mailbox'Address),
P2 => Interrupt_ID'Size / 8);
pragma Assert ((Status and 1) = 1);
loop
-- Wait to be woken up. Could be that the AST has fired,
-- in which case the Iosb.Status variable will be non-zero,
-- or maybe the wait is being aborted.
POP.Sleep
(Self_ID,
System.Tasking.Interrupt_Server_Blocked_On_Event_Flag);
if Iosb.Status /= 0 then
if (Iosb.Status and 1) = 1
and then Mask (Signal (Interrupt_Mailbox))
then
return Interrupt_Mailbox;
else
return 0;
end if;
else
POP.Unlock (Self_ID);
System.Tasking.Initialization.Undefer_Abort (Self_ID);
System.Tasking.Initialization.Defer_Abort (Self_ID);
POP.Write_Lock (Self_ID);
end if;
end loop;
end Interrupt_Wait;
----------------------------
-- Install_Default_Action --
----------------------------
procedure Install_Default_Action (Interrupt : Interrupt_ID) is
begin
null;
end Install_Default_Action;
---------------------------
-- Install_Ignore_Action --
---------------------------
procedure Install_Ignore_Action (Interrupt : Interrupt_ID) is
begin
null;
end Install_Ignore_Action;
-------------------------
-- Fill_Interrupt_Mask --
-------------------------
procedure Fill_Interrupt_Mask (Mask : access Interrupt_Mask) is
begin
Mask.all := (others => True);
end Fill_Interrupt_Mask;
--------------------------
-- Empty_Interrupt_Mask --
--------------------------
procedure Empty_Interrupt_Mask (Mask : access Interrupt_Mask) is
begin
Mask.all := (others => False);
end Empty_Interrupt_Mask;
---------------------------
-- Add_To_Interrupt_Mask --
---------------------------
procedure Add_To_Interrupt_Mask
(Mask : access Interrupt_Mask;
Interrupt : Interrupt_ID)
is
begin
Mask (Signal (Interrupt)) := True;
end Add_To_Interrupt_Mask;
--------------------------------
-- Delete_From_Interrupt_Mask --
--------------------------------
procedure Delete_From_Interrupt_Mask
(Mask : access Interrupt_Mask;
Interrupt : Interrupt_ID)
is
begin
Mask (Signal (Interrupt)) := False;
end Delete_From_Interrupt_Mask;
---------------
-- Is_Member --
---------------
function Is_Member
(Mask : access Interrupt_Mask;
Interrupt : Interrupt_ID) return Boolean
is
begin
return Mask (Signal (Interrupt));
end Is_Member;
-------------------------
-- Copy_Interrupt_Mask --
-------------------------
procedure Copy_Interrupt_Mask
(X : out Interrupt_Mask;
Y : Interrupt_Mask)
is
begin
X := Y;
end Copy_Interrupt_Mask;
-------------------------
-- Interrupt_Self_Process --
-------------------------
procedure Interrupt_Self_Process (Interrupt : Interrupt_ID) is
Status : Cond_Value_Type;
begin
Sys_QIO
(Status => Status,
Chan => Snd_Interrupt_Chan,
Func => IO_WRITEVBLK,
P1 => To_unsigned_long (Interrupt'Address),
P2 => Interrupt_ID'Size / 8);
pragma Assert ((Status and 1) = 1);
end Interrupt_Self_Process;
begin
Environment_Mask := (others => False);
All_Tasks_Mask := (others => True);
for I in Interrupt_ID loop
if Keep_Unmasked (I) then
Environment_Mask (Signal (I)) := True;
All_Tasks_Mask (Signal (I)) := False;
end if;
end loop;
end System.Interrupt_Management.Operations;
| 32.092527 | 78 | 0.513861 |
2e8956ef14dc91175a99f77f5ce2ec5a6fcb7b07 | 4,363 | ads | Ada | source/amf/mof/xmi/amf-internals-xmi_entity_resolvers.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/mof/xmi/amf-internals-xmi_entity_resolvers.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/mof/xmi/amf-internals-xmi_entity_resolvers.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$
------------------------------------------------------------------------------
-- Simple entity resolver to be used to resolve entities in XMI documents.
--
-- XXX It can be removed once own default entity resolver will be provided by
-- SAX reader.
------------------------------------------------------------------------------
with XML.SAX.Entity_Resolvers;
with XML.SAX.Input_Sources;
package AMF.Internals.XMI_Entity_Resolvers is
type XMI_Entity_Resolver is
limited new XML.SAX.Entity_Resolvers.SAX_Entity_Resolver
with null record;
overriding function Error_String
(Self : XMI_Entity_Resolver)
return League.Strings.Universal_String;
overriding procedure Resolve_Entity
(Self : in out XMI_Entity_Resolver;
Name : League.Strings.Universal_String;
Public_Id : League.Strings.Universal_String;
Base_URI : League.Strings.Universal_String;
System_Id : League.Strings.Universal_String;
Source : out XML.SAX.Input_Sources.SAX_Input_Source_Access;
Success : in out Boolean);
end AMF.Internals.XMI_Entity_Resolvers;
| 60.597222 | 78 | 0.459317 |
1e493246be304d4f853adfc6b377f9fb9d9b2b17 | 1,368 | ads | Ada | libpok/ada/arinc653/apex-timing.ads | codeinspector-sales-demo/pok | 3f3d4700f4f31265670b9ac257b274729433e7ce | [
"BSD-2-Clause"
] | 1 | 2020-11-20T09:56:19.000Z | 2020-11-20T09:56:19.000Z | libpok/ada/arinc653/apex-timing.ads | codeinspector-sales-demo/pok | 3f3d4700f4f31265670b9ac257b274729433e7ce | [
"BSD-2-Clause"
] | null | null | null | libpok/ada/arinc653/apex-timing.ads | codeinspector-sales-demo/pok | 3f3d4700f4f31265670b9ac257b274729433e7ce | [
"BSD-2-Clause"
] | null | null | null | -- POK header
--
-- The following file is a part of the POK project. Any modification should
-- be made according to the POK licence. You CANNOT use this file or a part
-- of a file for your own project.
--
-- For more information on the POK licence, please see our LICENCE FILE
--
-- Please follow the coding guidelines described in doc/CODING_GUIDELINES
--
-- Copyright (c) 2007-2020 POK team
-- ---------------------------------------------------------------------------
-- --
-- TIME constant and type definitions and management services --
-- --
-- ---------------------------------------------------------------------------
package APEX.Timing is
procedure Timed_Wait
(Delay_Time : in System_Time_Type;
Return_Code : out Return_Code_Type);
procedure Periodic_Wait (Return_Code : out Return_Code_Type);
procedure Get_Time
(System_Time : out System_Time_Type;
Return_Code : out Return_Code_Type);
procedure Replenish
(Budget_Time : in System_Time_Type;
Return_Code : out Return_Code_Type);
-- POK BINDINGS
pragma Import (C, Timed_Wait, "TIMED_WAIT");
pragma Import (C, Periodic_Wait, "PERIODIC_WAIT");
pragma Import (C, Get_Time, "GET_TIME");
pragma Import (C, Replenish, "REPLENISH");
-- END OF POK BINDINGS
end Apex.Timing;
| 36.972973 | 78 | 0.597222 |
22609c6c5bd715e478b72ee1e8832ee015c0397b | 3,632 | ads | Ada | source/amf/ocl/amf-ocl-boolean_literal_exps-hash.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-boolean_literal_exps-hash.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-boolean_literal_exps-hash.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012-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.Elements.Generic_Hash;
function AMF.OCL.Boolean_Literal_Exps.Hash is
new AMF.Elements.Generic_Hash (OCL_Boolean_Literal_Exp, OCL_Boolean_Literal_Exp_Access);
| 72.64 | 90 | 0.405837 |
04817f2f11c827839f6ac6cbfd956068691af01e | 5,387 | ads | Ada | testsuite/utils/src/wire_simulation.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 192 | 2016-06-01T18:32:04.000Z | 2022-03-26T22:52:31.000Z | testsuite/utils/src/wire_simulation.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 239 | 2016-05-26T20:02:01.000Z | 2022-03-31T09:46:56.000Z | testsuite/utils/src/wire_simulation.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2017-2018, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- This package provides a simulation of digital signals on an electric wire.
-- It can be used to test algorithms using GPIO_Point like protocol bit
-- banging.
with HAL.GPIO; use HAL.GPIO;
package Wire_Simulation is
Unknown_State : exception;
Invalid_Configuration : exception;
type Virtual_Wire (Default_Pull : GPIO_Pull_Resistor;
Max_Points : Positive) is
tagged limited private;
type Any_Virtual_Wire is access all Virtual_Wire'Class;
function Point (This : in out Virtual_Wire;
Id : Positive)
return Any_GPIO_Point
with Pre => Id <= This.Max_Points;
-- Return the GPIO_Point coresponding to the Id
private
type Wire_State is (High, Low, Unknown);
type Wire_Point is new HAL.GPIO.GPIO_Point with record
Current_Mode : GPIO_Mode := Input;
Current_Pull : GPIO_Pull_Resistor := Floating;
Current_State : Boolean := False;
Wire : Any_Virtual_Wire := null;
end record;
overriding
function Support (This : Wire_Point;
Capa : HAL.GPIO.Capability)
return Boolean
is (case Capa is
when others => True);
overriding
function Mode (This : Wire_Point) return GPIO_Mode is (This.Current_Mode);
overriding
procedure Set_Mode (This : in out Wire_Point;
Mode : GPIO_Config_Mode);
-- Return False if the mode is not available
overriding
function Pull_Resistor (This : Wire_Point)
return GPIO_Pull_Resistor is (This.Current_Pull);
overriding
procedure Set_Pull_Resistor (This : in out Wire_Point;
Pull : GPIO_Pull_Resistor);
overriding
function Set (This : Wire_Point) return Boolean;
overriding
procedure Set (This : in out Wire_Point);
overriding
procedure Clear (This : in out Wire_Point);
overriding
procedure Toggle (This : in out Wire_Point);
type Wire_Point_Array is array (Natural range <>) of aliased Wire_Point;
type Virtual_Wire (Default_Pull : GPIO_Pull_Resistor;
Max_Points : Positive) is
tagged limited record
State : Wire_State := (case Default_Pull is
when Pull_Down => Low,
when Pull_Up => High,
when Floating => Unknown);
Points : aliased Wire_Point_Array (1 .. Max_Points);
end record;
procedure Update_Wire_State (This : in out Virtual_Wire);
function At_Least_One_Output (This : Virtual_Wire) return Boolean;
-- Return True if at least one GPIO point is configured as output
function At_Least_One_Pull_Up (This : Virtual_Wire) return Boolean;
-- Return True if at least one GPIO point is configured as pull up
function At_Least_One_Pull_Down (This : Virtual_Wire) return Boolean;
-- Return True if at least one GPIO point is configured as pull down
end Wire_Simulation;
| 42.417323 | 78 | 0.58604 |
9adfc9eae4ef3bd9729b382f89c45d7945643017 | 499 | ads | Ada | source/strings/a-stmana.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/strings/a-stmana.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/strings/a-stmana.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | pragma License (Unrestricted);
-- implementation unit
with Ada.Strings.Naked_Maps;
package Ada.Strings.Maps.Naked is
pragma Preelaborate;
generic
with function Source return not null Naked_Maps.Character_Set_Access;
function To_Set return Character_Set;
pragma Inline (To_Set);
generic
with function Source return not null Naked_Maps.Character_Mapping_Access;
function To_Mapping return Character_Mapping;
pragma Inline (To_Mapping);
end Ada.Strings.Maps.Naked;
| 27.722222 | 79 | 0.779559 |
2295df9a53c62109df1446a24d079e139683fd03 | 10,627 | adb | Ada | snapgear_linux/user/ncurses/ncurses-5.6/Ada95/samples/ncurses2-acs_display.adb | impedimentToProgress/UCI-BlueChip | 53e5d48b79079eaf60d42f7cb65bb795743d19fc | [
"MIT"
] | null | null | null | snapgear_linux/user/ncurses/ncurses-5.6/Ada95/samples/ncurses2-acs_display.adb | impedimentToProgress/UCI-BlueChip | 53e5d48b79079eaf60d42f7cb65bb795743d19fc | [
"MIT"
] | null | null | null | snapgear_linux/user/ncurses/ncurses-5.6/Ada95/samples/ncurses2-acs_display.adb | impedimentToProgress/UCI-BlueChip | 53e5d48b79079eaf60d42f7cb65bb795743d19fc | [
"MIT"
] | 3 | 2016-06-13T13:20:56.000Z | 2019-12-05T02:31:23.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding Samples --
-- --
-- ncurses --
-- --
-- B O D Y --
-- --
------------------------------------------------------------------------------
-- Copyright (c) 2000-2004,2006 Free Software Foundation, Inc. --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files (the --
-- "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, distribute with modifications, sublicense, and/or sell --
-- copies of the Software, and to permit persons to whom the Software is --
-- furnished to do so, subject to the following conditions: --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. --
-- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, --
-- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR --
-- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR --
-- THE USE OR OTHER DEALINGS IN THE SOFTWARE. --
-- --
-- Except as contained in this notice, the name(s) of the above copyright --
-- holders shall not be used in advertising or otherwise to promote the --
-- sale, use or other dealings in this Software without prior written --
-- authorization. --
------------------------------------------------------------------------------
-- Author: Eugene V. Melaragno <[email protected]> 2000
-- Version Control
-- $Revision: 1.5 $
-- $Date: 2006/06/25 14:24:40 $
-- Binding Version 01.00
------------------------------------------------------------------------------
with ncurses2.util; use ncurses2.util;
with ncurses2.genericPuts;
with Terminal_Interface.Curses; use Terminal_Interface.Curses;
with Ada.Strings.Unbounded;
with Ada.Strings.Fixed;
procedure ncurses2.acs_display is
use Int_IO;
procedure show_upper_chars (first : Integer);
function show_1_acs (N : Integer;
name : String;
code : Attributed_Character)
return Integer;
procedure show_acs_chars;
procedure show_upper_chars (first : Integer) is
C1 : constant Boolean := (first = 128);
last : constant Integer := first + 31;
package p is new ncurses2.genericPuts (200);
use p;
use p.BS;
use Ada.Strings.Unbounded;
tmpa : Unbounded_String;
tmpb : BS.Bounded_String;
begin
Erase;
Switch_Character_Attribute
(Attr => (Bold_Character => True, others => False));
Move_Cursor (Line => 0, Column => 20);
tmpa := To_Unbounded_String ("Display of ");
if C1 then
tmpa := tmpa & "C1";
else
tmpa := tmpa & "GR";
end if;
tmpa := tmpa & " Character Codes ";
myPut (tmpb, first);
Append (tmpa, To_String (tmpb));
Append (tmpa, " to ");
myPut (tmpb, last);
Append (tmpa, To_String (tmpb));
Add (Str => To_String (tmpa));
Switch_Character_Attribute
(On => False,
Attr => (Bold_Character => True, others => False));
Refresh;
for code in first .. last loop
declare
row : constant Line_Position
:= Line_Position (4 + ((code - first) mod 16));
col : constant Column_Position
:= Column_Position (((code - first) / 16) *
Integer (Columns) / 2);
tmp3 : String (1 .. 3);
tmpx : String (1 .. Integer (Columns / 4));
reply : Key_Code;
begin
Put (tmp3, code);
myPut (tmpb, code, 16);
tmpa := To_Unbounded_String (tmp3 & " (" & To_String (tmpb) & ')');
Ada.Strings.Fixed.Move (To_String (tmpa), tmpx,
Justify => Ada.Strings.Right);
Add (Line => row, Column => col,
Str => tmpx & ' ' & ':' & ' ');
if C1 then
Set_NoDelay_Mode (Mode => True);
end if;
Add_With_Immediate_Echo (Ch => Code_To_Char (Key_Code (code)));
-- TODO check this
if C1 then
reply := Getchar;
while reply /= Key_None loop
Add (Ch => Code_To_Char (reply));
Nap_Milli_Seconds (10);
reply := Getchar;
end loop;
Set_NoDelay_Mode (Mode => False);
end if;
end;
end loop;
end show_upper_chars;
function show_1_acs (N : Integer;
name : String;
code : Attributed_Character)
return Integer is
height : constant Integer := 16;
row : constant Line_Position := Line_Position (4 + (N mod height));
col : constant Column_Position := Column_Position ((N / height) *
Integer (Columns) / 2);
tmpx : String (1 .. Integer (Columns) / 3);
begin
Ada.Strings.Fixed.Move (name, tmpx,
Justify => Ada.Strings.Right,
Drop => Ada.Strings.Left);
Add (Line => row, Column => col, Str => tmpx & ' ' & ':' & ' ');
-- we need more room than C because our identifiers are longer
-- 22 chars actually
Add (Ch => code);
return N + 1;
end show_1_acs;
procedure show_acs_chars is
n : Integer;
begin
Erase;
Switch_Character_Attribute
(Attr => (Bold_Character => True, others => False));
Add (Line => 0, Column => 20,
Str => "Display of the ACS Character Set");
Switch_Character_Attribute (On => False,
Attr => (Bold_Character => True,
others => False));
Refresh;
-- the following is useful to generate the below
-- grep '^[ ]*ACS_' ../src/terminal_interface-curses.ads |
-- awk '{print "n := show_1_acs(n, \""$1"\", ACS_Map("$1"));"}'
n := show_1_acs (0, "ACS_Upper_Left_Corner",
ACS_Map (ACS_Upper_Left_Corner));
n := show_1_acs (n, "ACS_Lower_Left_Corner",
ACS_Map (ACS_Lower_Left_Corner));
n := show_1_acs (n, "ACS_Upper_Right_Corner",
ACS_Map (ACS_Upper_Right_Corner));
n := show_1_acs (n, "ACS_Lower_Right_Corner",
ACS_Map (ACS_Lower_Right_Corner));
n := show_1_acs (n, "ACS_Left_Tee", ACS_Map (ACS_Left_Tee));
n := show_1_acs (n, "ACS_Right_Tee", ACS_Map (ACS_Right_Tee));
n := show_1_acs (n, "ACS_Bottom_Tee", ACS_Map (ACS_Bottom_Tee));
n := show_1_acs (n, "ACS_Top_Tee", ACS_Map (ACS_Top_Tee));
n := show_1_acs (n, "ACS_Horizontal_Line",
ACS_Map (ACS_Horizontal_Line));
n := show_1_acs (n, "ACS_Vertical_Line", ACS_Map (ACS_Vertical_Line));
n := show_1_acs (n, "ACS_Plus_Symbol", ACS_Map (ACS_Plus_Symbol));
n := show_1_acs (n, "ACS_Scan_Line_1", ACS_Map (ACS_Scan_Line_1));
n := show_1_acs (n, "ACS_Scan_Line_9", ACS_Map (ACS_Scan_Line_9));
n := show_1_acs (n, "ACS_Diamond", ACS_Map (ACS_Diamond));
n := show_1_acs (n, "ACS_Checker_Board", ACS_Map (ACS_Checker_Board));
n := show_1_acs (n, "ACS_Degree", ACS_Map (ACS_Degree));
n := show_1_acs (n, "ACS_Plus_Minus", ACS_Map (ACS_Plus_Minus));
n := show_1_acs (n, "ACS_Bullet", ACS_Map (ACS_Bullet));
n := show_1_acs (n, "ACS_Left_Arrow", ACS_Map (ACS_Left_Arrow));
n := show_1_acs (n, "ACS_Right_Arrow", ACS_Map (ACS_Right_Arrow));
n := show_1_acs (n, "ACS_Down_Arrow", ACS_Map (ACS_Down_Arrow));
n := show_1_acs (n, "ACS_Up_Arrow", ACS_Map (ACS_Up_Arrow));
n := show_1_acs (n, "ACS_Board_Of_Squares",
ACS_Map (ACS_Board_Of_Squares));
n := show_1_acs (n, "ACS_Lantern", ACS_Map (ACS_Lantern));
n := show_1_acs (n, "ACS_Solid_Block", ACS_Map (ACS_Solid_Block));
n := show_1_acs (n, "ACS_Scan_Line_3", ACS_Map (ACS_Scan_Line_3));
n := show_1_acs (n, "ACS_Scan_Line_7", ACS_Map (ACS_Scan_Line_7));
n := show_1_acs (n, "ACS_Less_Or_Equal", ACS_Map (ACS_Less_Or_Equal));
n := show_1_acs (n, "ACS_Greater_Or_Equal",
ACS_Map (ACS_Greater_Or_Equal));
n := show_1_acs (n, "ACS_PI", ACS_Map (ACS_PI));
n := show_1_acs (n, "ACS_Not_Equal", ACS_Map (ACS_Not_Equal));
n := show_1_acs (n, "ACS_Sterling", ACS_Map (ACS_Sterling));
end show_acs_chars;
c1 : Key_Code;
c : Character := 'a';
begin
loop
case c is
when 'a' =>
show_acs_chars;
when '0' | '1' | '2' | '3' =>
show_upper_chars (ctoi (c) * 32 + 128);
when others =>
null;
end case;
Add (Line => Lines - 3, Column => 0,
Str => "Note: ANSI terminals may not display C1 characters.");
Add (Line => Lines - 2, Column => 0,
Str => "Select: a=ACS, 0=C1, 1,2,3=GR characters, q=quit");
Refresh;
c1 := Getchar;
c := Code_To_Char (c1);
exit when c = 'q' or c = 'x';
end loop;
Pause;
Erase;
End_Windows;
end ncurses2.acs_display;
| 45.609442 | 79 | 0.505599 |
9a9deb78730a7ea9fee5699086fe39ac768bebad | 2,167 | ads | Ada | arch/ARM/STM32/svd/stm32wl5x_cm4/stm32_svd-vrefbuf.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/stm32wl5x_cm4/stm32_svd-vrefbuf.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | arch/ARM/STM32/svd/stm32wl5x_cm4/stm32_svd-vrefbuf.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | -- This spec has been automatically generated from STM32WL5x_CM4.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.VREFBUF is
pragma Preelaborate;
---------------
-- Registers --
---------------
-- control and status register
type CSR_Register is record
-- Voltage reference buffer mode enable
ENVR : Boolean := False;
-- High impedance mode
HIZ : Boolean := True;
-- Voltage reference scale
VRS : Boolean := False;
-- Read-only. Voltage reference buffer ready
VRR : Boolean := False;
-- unspecified
Reserved_4_31 : HAL.UInt28 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CSR_Register use record
ENVR at 0 range 0 .. 0;
HIZ at 0 range 1 .. 1;
VRS at 0 range 2 .. 2;
VRR at 0 range 3 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
subtype CCR_TRIM_Field is HAL.UInt6;
-- calibration control register
type CCR_Register is record
-- Trimming code
TRIM : CCR_TRIM_Field := 16#0#;
-- unspecified
Reserved_6_31 : HAL.UInt26 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CCR_Register use record
TRIM at 0 range 0 .. 5;
Reserved_6_31 at 0 range 6 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Voltage reference buffer
type VREFBUF_Peripheral is record
-- control and status register
CSR : aliased CSR_Register;
-- calibration control register
CCR : aliased CCR_Register;
end record
with Volatile;
for VREFBUF_Peripheral use record
CSR at 16#0# range 0 .. 31;
CCR at 16#4# range 0 .. 31;
end record;
-- Voltage reference buffer
VREFBUF_Periph : aliased VREFBUF_Peripheral
with Import, Address => VREFBUF_Base;
end STM32_SVD.VREFBUF;
| 26.753086 | 69 | 0.59437 |
3815d3e2dc4b505cebbc92c596315e3d9ae1237c | 51,250 | ads | Ada | tools-src/gnu/gcc/gcc/ada/nmake.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/nmake.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/nmake.ads | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- N M A K E --
-- --
-- S p e c --
-- --
-- Generated by xnmake revision 1.2 using --
-- sinfo.ads revision 1.6 --
-- nmake.adt revision 1.1 --
-- --
-- Copyright (C) 1992-2001 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
pragma Style_Checks (All_Checks);
-- Turn off subprogram order checking, since the routines here are
-- generated automatically in order.
with Nlists; use Nlists;
with Types; use Types;
with Uintp; use Uintp;
with Urealp; use Urealp;
package Nmake is
-- This package contains a set of routines used to construct tree nodes
-- using a functional style. There is one routine for each node type defined
-- in Sinfo with the general interface:
-- function Make_xxx (Sloc : Source_Ptr,
-- Field_Name_1 : Field_Name_1_Type [:= default]
-- Field_Name_2 : Field_Name_2_Type [:= default]
-- ...)
-- return Node_Id
-- Only syntactic fields are included (i.e. fields marked as "-Sem" or "-Lib"
-- in the Sinfo spec are excluded). In addition, the following four syntactic
-- fields are excluded:
-- Prev_Ids
-- More_Ids
-- Comes_From_Source
-- Paren_Count
-- since they are very rarely set in expanded code. If they need to be set,
-- to other than the default values (False, False, False, zero), then the
-- appropriate Set_xxx procedures must be used on the returned value.
-- Default values are provided only for flag fields (where the default is
-- False), and for optional fields. An optional field is one where the
-- comment line describing the field contains the string "(set to xxx if".
-- For such fields, a default value of xxx is provided."
-- Warning: since calls to Make_xxx routines are normal function calls, the
-- arguments can be evaluated in any order. This means that at most one such
-- argument can have side effects (e.g. be a call to a parse routine).
function Make_Unused_At_Start (Sloc : Source_Ptr)
return Node_Id;
pragma Inline (Make_Unused_At_Start);
function Make_Unused_At_End (Sloc : Source_Ptr)
return Node_Id;
pragma Inline (Make_Unused_At_End);
function Make_Identifier (Sloc : Source_Ptr;
Chars : Name_Id)
return Node_Id;
pragma Inline (Make_Identifier);
function Make_Integer_Literal (Sloc : Source_Ptr;
Intval : Uint)
return Node_Id;
pragma Inline (Make_Integer_Literal);
function Make_Real_Literal (Sloc : Source_Ptr;
Realval : Ureal)
return Node_Id;
pragma Inline (Make_Real_Literal);
function Make_Character_Literal (Sloc : Source_Ptr;
Chars : Name_Id;
Char_Literal_Value : Char_Code)
return Node_Id;
pragma Inline (Make_Character_Literal);
function Make_String_Literal (Sloc : Source_Ptr;
Strval : String_Id)
return Node_Id;
pragma Inline (Make_String_Literal);
function Make_Pragma (Sloc : Source_Ptr;
Chars : Name_Id;
Pragma_Argument_Associations : List_Id := No_List;
Debug_Statement : Node_Id := Empty)
return Node_Id;
pragma Inline (Make_Pragma);
function Make_Pragma_Argument_Association (Sloc : Source_Ptr;
Chars : Name_Id := No_Name;
Expression : Node_Id)
return Node_Id;
pragma Inline (Make_Pragma_Argument_Association);
function Make_Defining_Identifier (Sloc : Source_Ptr;
Chars : Name_Id)
return Node_Id;
pragma Inline (Make_Defining_Identifier);
function Make_Full_Type_Declaration (Sloc : Source_Ptr;
Defining_Identifier : Node_Id;
Discriminant_Specifications : List_Id := No_List;
Type_Definition : Node_Id)
return Node_Id;
pragma Inline (Make_Full_Type_Declaration);
function Make_Subtype_Declaration (Sloc : Source_Ptr;
Defining_Identifier : Node_Id;
Subtype_Indication : Node_Id)
return Node_Id;
pragma Inline (Make_Subtype_Declaration);
function Make_Subtype_Indication (Sloc : Source_Ptr;
Subtype_Mark : Node_Id;
Constraint : Node_Id)
return Node_Id;
pragma Inline (Make_Subtype_Indication);
function Make_Object_Declaration (Sloc : Source_Ptr;
Defining_Identifier : Node_Id;
Aliased_Present : Boolean := False;
Constant_Present : Boolean := False;
Object_Definition : Node_Id;
Expression : Node_Id := Empty)
return Node_Id;
pragma Inline (Make_Object_Declaration);
function Make_Number_Declaration (Sloc : Source_Ptr;
Defining_Identifier : Node_Id;
Expression : Node_Id)
return Node_Id;
pragma Inline (Make_Number_Declaration);
function Make_Derived_Type_Definition (Sloc : Source_Ptr;
Abstract_Present : Boolean := False;
Subtype_Indication : Node_Id;
Record_Extension_Part : Node_Id := Empty)
return Node_Id;
pragma Inline (Make_Derived_Type_Definition);
function Make_Range_Constraint (Sloc : Source_Ptr;
Range_Expression : Node_Id)
return Node_Id;
pragma Inline (Make_Range_Constraint);
function Make_Range (Sloc : Source_Ptr;
Low_Bound : Node_Id;
High_Bound : Node_Id;
Includes_Infinities : Boolean := False)
return Node_Id;
pragma Inline (Make_Range);
function Make_Enumeration_Type_Definition (Sloc : Source_Ptr;
Literals : List_Id)
return Node_Id;
pragma Inline (Make_Enumeration_Type_Definition);
function Make_Defining_Character_Literal (Sloc : Source_Ptr;
Chars : Name_Id)
return Node_Id;
pragma Inline (Make_Defining_Character_Literal);
function Make_Signed_Integer_Type_Definition (Sloc : Source_Ptr;
Low_Bound : Node_Id;
High_Bound : Node_Id)
return Node_Id;
pragma Inline (Make_Signed_Integer_Type_Definition);
function Make_Modular_Type_Definition (Sloc : Source_Ptr;
Expression : Node_Id)
return Node_Id;
pragma Inline (Make_Modular_Type_Definition);
function Make_Floating_Point_Definition (Sloc : Source_Ptr;
Digits_Expression : Node_Id;
Real_Range_Specification : Node_Id := Empty)
return Node_Id;
pragma Inline (Make_Floating_Point_Definition);
function Make_Real_Range_Specification (Sloc : Source_Ptr;
Low_Bound : Node_Id;
High_Bound : Node_Id)
return Node_Id;
pragma Inline (Make_Real_Range_Specification);
function Make_Ordinary_Fixed_Point_Definition (Sloc : Source_Ptr;
Delta_Expression : Node_Id;
Real_Range_Specification : Node_Id)
return Node_Id;
pragma Inline (Make_Ordinary_Fixed_Point_Definition);
function Make_Decimal_Fixed_Point_Definition (Sloc : Source_Ptr;
Delta_Expression : Node_Id;
Digits_Expression : Node_Id;
Real_Range_Specification : Node_Id := Empty)
return Node_Id;
pragma Inline (Make_Decimal_Fixed_Point_Definition);
function Make_Digits_Constraint (Sloc : Source_Ptr;
Digits_Expression : Node_Id;
Range_Constraint : Node_Id := Empty)
return Node_Id;
pragma Inline (Make_Digits_Constraint);
function Make_Unconstrained_Array_Definition (Sloc : Source_Ptr;
Subtype_Marks : List_Id;
Aliased_Present : Boolean := False;
Subtype_Indication : Node_Id)
return Node_Id;
pragma Inline (Make_Unconstrained_Array_Definition);
function Make_Constrained_Array_Definition (Sloc : Source_Ptr;
Discrete_Subtype_Definitions : List_Id;
Aliased_Present : Boolean := False;
Subtype_Indication : Node_Id)
return Node_Id;
pragma Inline (Make_Constrained_Array_Definition);
function Make_Discriminant_Specification (Sloc : Source_Ptr;
Defining_Identifier : Node_Id;
Discriminant_Type : Node_Id;
Expression : Node_Id := Empty)
return Node_Id;
pragma Inline (Make_Discriminant_Specification);
function Make_Index_Or_Discriminant_Constraint (Sloc : Source_Ptr;
Constraints : List_Id)
return Node_Id;
pragma Inline (Make_Index_Or_Discriminant_Constraint);
function Make_Discriminant_Association (Sloc : Source_Ptr;
Selector_Names : List_Id;
Expression : Node_Id)
return Node_Id;
pragma Inline (Make_Discriminant_Association);
function Make_Record_Definition (Sloc : Source_Ptr;
End_Label : Node_Id := Empty;
Abstract_Present : Boolean := False;
Tagged_Present : Boolean := False;
Limited_Present : Boolean := False;
Component_List : Node_Id;
Null_Present : Boolean := False)
return Node_Id;
pragma Inline (Make_Record_Definition);
function Make_Component_List (Sloc : Source_Ptr;
Component_Items : List_Id;
Variant_Part : Node_Id := Empty;
Null_Present : Boolean := False)
return Node_Id;
pragma Inline (Make_Component_List);
function Make_Component_Declaration (Sloc : Source_Ptr;
Defining_Identifier : Node_Id;
Aliased_Present : Boolean := False;
Subtype_Indication : Node_Id;
Expression : Node_Id := Empty)
return Node_Id;
pragma Inline (Make_Component_Declaration);
function Make_Variant_Part (Sloc : Source_Ptr;
Name : Node_Id;
Variants : List_Id)
return Node_Id;
pragma Inline (Make_Variant_Part);
function Make_Variant (Sloc : Source_Ptr;
Discrete_Choices : List_Id;
Component_List : Node_Id)
return Node_Id;
pragma Inline (Make_Variant);
function Make_Others_Choice (Sloc : Source_Ptr)
return Node_Id;
pragma Inline (Make_Others_Choice);
function Make_Access_To_Object_Definition (Sloc : Source_Ptr;
All_Present : Boolean := False;
Subtype_Indication : Node_Id;
Constant_Present : Boolean := False)
return Node_Id;
pragma Inline (Make_Access_To_Object_Definition);
function Make_Access_Function_Definition (Sloc : Source_Ptr;
Protected_Present : Boolean := False;
Parameter_Specifications : List_Id := No_List;
Subtype_Mark : Node_Id)
return Node_Id;
pragma Inline (Make_Access_Function_Definition);
function Make_Access_Procedure_Definition (Sloc : Source_Ptr;
Protected_Present : Boolean := False;
Parameter_Specifications : List_Id := No_List)
return Node_Id;
pragma Inline (Make_Access_Procedure_Definition);
function Make_Access_Definition (Sloc : Source_Ptr;
Subtype_Mark : Node_Id)
return Node_Id;
pragma Inline (Make_Access_Definition);
function Make_Incomplete_Type_Declaration (Sloc : Source_Ptr;
Defining_Identifier : Node_Id;
Discriminant_Specifications : List_Id := No_List;
Unknown_Discriminants_Present : Boolean := False)
return Node_Id;
pragma Inline (Make_Incomplete_Type_Declaration);
function Make_Explicit_Dereference (Sloc : Source_Ptr;
Prefix : Node_Id)
return Node_Id;
pragma Inline (Make_Explicit_Dereference);
function Make_Indexed_Component (Sloc : Source_Ptr;
Prefix : Node_Id;
Expressions : List_Id)
return Node_Id;
pragma Inline (Make_Indexed_Component);
function Make_Slice (Sloc : Source_Ptr;
Prefix : Node_Id;
Discrete_Range : Node_Id)
return Node_Id;
pragma Inline (Make_Slice);
function Make_Selected_Component (Sloc : Source_Ptr;
Prefix : Node_Id;
Selector_Name : Node_Id)
return Node_Id;
pragma Inline (Make_Selected_Component);
function Make_Attribute_Reference (Sloc : Source_Ptr;
Prefix : Node_Id;
Attribute_Name : Name_Id;
Expressions : List_Id := No_List)
return Node_Id;
pragma Inline (Make_Attribute_Reference);
function Make_Aggregate (Sloc : Source_Ptr;
Expressions : List_Id := No_List;
Component_Associations : List_Id := No_List;
Null_Record_Present : Boolean := False)
return Node_Id;
pragma Inline (Make_Aggregate);
function Make_Component_Association (Sloc : Source_Ptr;
Choices : List_Id;
Expression : Node_Id)
return Node_Id;
pragma Inline (Make_Component_Association);
function Make_Extension_Aggregate (Sloc : Source_Ptr;
Ancestor_Part : Node_Id;
Expressions : List_Id := No_List;
Component_Associations : List_Id := No_List;
Null_Record_Present : Boolean := False)
return Node_Id;
pragma Inline (Make_Extension_Aggregate);
function Make_Null (Sloc : Source_Ptr)
return Node_Id;
pragma Inline (Make_Null);
function Make_And_Then (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_And_Then);
function Make_Or_Else (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Or_Else);
function Make_In (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_In);
function Make_Not_In (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Not_In);
function Make_Op_And (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_And);
function Make_Op_Or (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_Or);
function Make_Op_Xor (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_Xor);
function Make_Op_Eq (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_Eq);
function Make_Op_Ne (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_Ne);
function Make_Op_Lt (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_Lt);
function Make_Op_Le (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_Le);
function Make_Op_Gt (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_Gt);
function Make_Op_Ge (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_Ge);
function Make_Op_Add (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_Add);
function Make_Op_Subtract (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_Subtract);
function Make_Op_Concat (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_Concat);
function Make_Op_Multiply (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_Multiply);
function Make_Op_Divide (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_Divide);
function Make_Op_Mod (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_Mod);
function Make_Op_Rem (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_Rem);
function Make_Op_Expon (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_Expon);
function Make_Op_Plus (Sloc : Source_Ptr;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_Plus);
function Make_Op_Minus (Sloc : Source_Ptr;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_Minus);
function Make_Op_Abs (Sloc : Source_Ptr;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_Abs);
function Make_Op_Not (Sloc : Source_Ptr;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_Not);
function Make_Type_Conversion (Sloc : Source_Ptr;
Subtype_Mark : Node_Id;
Expression : Node_Id)
return Node_Id;
pragma Inline (Make_Type_Conversion);
function Make_Qualified_Expression (Sloc : Source_Ptr;
Subtype_Mark : Node_Id;
Expression : Node_Id)
return Node_Id;
pragma Inline (Make_Qualified_Expression);
function Make_Allocator (Sloc : Source_Ptr;
Expression : Node_Id)
return Node_Id;
pragma Inline (Make_Allocator);
function Make_Null_Statement (Sloc : Source_Ptr)
return Node_Id;
pragma Inline (Make_Null_Statement);
function Make_Label (Sloc : Source_Ptr;
Identifier : Node_Id)
return Node_Id;
pragma Inline (Make_Label);
function Make_Assignment_Statement (Sloc : Source_Ptr;
Name : Node_Id;
Expression : Node_Id)
return Node_Id;
pragma Inline (Make_Assignment_Statement);
function Make_If_Statement (Sloc : Source_Ptr;
Condition : Node_Id;
Then_Statements : List_Id;
Elsif_Parts : List_Id := No_List;
Else_Statements : List_Id := No_List;
End_Span : Uint := No_Uint)
return Node_Id;
pragma Inline (Make_If_Statement);
function Make_Elsif_Part (Sloc : Source_Ptr;
Condition : Node_Id;
Then_Statements : List_Id)
return Node_Id;
pragma Inline (Make_Elsif_Part);
function Make_Case_Statement (Sloc : Source_Ptr;
Expression : Node_Id;
Alternatives : List_Id;
End_Span : Uint := No_Uint)
return Node_Id;
pragma Inline (Make_Case_Statement);
function Make_Case_Statement_Alternative (Sloc : Source_Ptr;
Discrete_Choices : List_Id;
Statements : List_Id)
return Node_Id;
pragma Inline (Make_Case_Statement_Alternative);
function Make_Loop_Statement (Sloc : Source_Ptr;
Identifier : Node_Id := Empty;
Iteration_Scheme : Node_Id := Empty;
Statements : List_Id;
End_Label : Node_Id;
Has_Created_Identifier : Boolean := False)
return Node_Id;
pragma Inline (Make_Loop_Statement);
function Make_Iteration_Scheme (Sloc : Source_Ptr;
Condition : Node_Id := Empty;
Loop_Parameter_Specification : Node_Id := Empty)
return Node_Id;
pragma Inline (Make_Iteration_Scheme);
function Make_Loop_Parameter_Specification (Sloc : Source_Ptr;
Defining_Identifier : Node_Id;
Reverse_Present : Boolean := False;
Discrete_Subtype_Definition : Node_Id)
return Node_Id;
pragma Inline (Make_Loop_Parameter_Specification);
function Make_Block_Statement (Sloc : Source_Ptr;
Identifier : Node_Id := Empty;
Declarations : List_Id := No_List;
Handled_Statement_Sequence : Node_Id;
Has_Created_Identifier : Boolean := False;
Is_Task_Allocation_Block : Boolean := False;
Is_Asynchronous_Call_Block : Boolean := False)
return Node_Id;
pragma Inline (Make_Block_Statement);
function Make_Exit_Statement (Sloc : Source_Ptr;
Name : Node_Id := Empty;
Condition : Node_Id := Empty)
return Node_Id;
pragma Inline (Make_Exit_Statement);
function Make_Goto_Statement (Sloc : Source_Ptr;
Name : Node_Id)
return Node_Id;
pragma Inline (Make_Goto_Statement);
function Make_Subprogram_Declaration (Sloc : Source_Ptr;
Specification : Node_Id)
return Node_Id;
pragma Inline (Make_Subprogram_Declaration);
function Make_Abstract_Subprogram_Declaration (Sloc : Source_Ptr;
Specification : Node_Id)
return Node_Id;
pragma Inline (Make_Abstract_Subprogram_Declaration);
function Make_Function_Specification (Sloc : Source_Ptr;
Defining_Unit_Name : Node_Id;
Parameter_Specifications : List_Id := No_List;
Subtype_Mark : Node_Id)
return Node_Id;
pragma Inline (Make_Function_Specification);
function Make_Procedure_Specification (Sloc : Source_Ptr;
Defining_Unit_Name : Node_Id;
Parameter_Specifications : List_Id := No_List)
return Node_Id;
pragma Inline (Make_Procedure_Specification);
function Make_Designator (Sloc : Source_Ptr;
Name : Node_Id;
Identifier : Node_Id)
return Node_Id;
pragma Inline (Make_Designator);
function Make_Defining_Program_Unit_Name (Sloc : Source_Ptr;
Name : Node_Id;
Defining_Identifier : Node_Id)
return Node_Id;
pragma Inline (Make_Defining_Program_Unit_Name);
function Make_Operator_Symbol (Sloc : Source_Ptr;
Chars : Name_Id;
Strval : String_Id)
return Node_Id;
pragma Inline (Make_Operator_Symbol);
function Make_Defining_Operator_Symbol (Sloc : Source_Ptr;
Chars : Name_Id)
return Node_Id;
pragma Inline (Make_Defining_Operator_Symbol);
function Make_Parameter_Specification (Sloc : Source_Ptr;
Defining_Identifier : Node_Id;
In_Present : Boolean := False;
Out_Present : Boolean := False;
Parameter_Type : Node_Id;
Expression : Node_Id := Empty)
return Node_Id;
pragma Inline (Make_Parameter_Specification);
function Make_Subprogram_Body (Sloc : Source_Ptr;
Specification : Node_Id;
Declarations : List_Id;
Handled_Statement_Sequence : Node_Id;
Bad_Is_Detected : Boolean := False)
return Node_Id;
pragma Inline (Make_Subprogram_Body);
function Make_Procedure_Call_Statement (Sloc : Source_Ptr;
Name : Node_Id;
Parameter_Associations : List_Id := No_List)
return Node_Id;
pragma Inline (Make_Procedure_Call_Statement);
function Make_Function_Call (Sloc : Source_Ptr;
Name : Node_Id;
Parameter_Associations : List_Id := No_List)
return Node_Id;
pragma Inline (Make_Function_Call);
function Make_Parameter_Association (Sloc : Source_Ptr;
Selector_Name : Node_Id;
Explicit_Actual_Parameter : Node_Id)
return Node_Id;
pragma Inline (Make_Parameter_Association);
function Make_Return_Statement (Sloc : Source_Ptr;
Expression : Node_Id := Empty)
return Node_Id;
pragma Inline (Make_Return_Statement);
function Make_Package_Declaration (Sloc : Source_Ptr;
Specification : Node_Id)
return Node_Id;
pragma Inline (Make_Package_Declaration);
function Make_Package_Specification (Sloc : Source_Ptr;
Defining_Unit_Name : Node_Id;
Visible_Declarations : List_Id;
Private_Declarations : List_Id := No_List;
End_Label : Node_Id)
return Node_Id;
pragma Inline (Make_Package_Specification);
function Make_Package_Body (Sloc : Source_Ptr;
Defining_Unit_Name : Node_Id;
Declarations : List_Id;
Handled_Statement_Sequence : Node_Id := Empty)
return Node_Id;
pragma Inline (Make_Package_Body);
function Make_Private_Type_Declaration (Sloc : Source_Ptr;
Defining_Identifier : Node_Id;
Discriminant_Specifications : List_Id := No_List;
Unknown_Discriminants_Present : Boolean := False;
Abstract_Present : Boolean := False;
Tagged_Present : Boolean := False;
Limited_Present : Boolean := False)
return Node_Id;
pragma Inline (Make_Private_Type_Declaration);
function Make_Private_Extension_Declaration (Sloc : Source_Ptr;
Defining_Identifier : Node_Id;
Discriminant_Specifications : List_Id := No_List;
Unknown_Discriminants_Present : Boolean := False;
Abstract_Present : Boolean := False;
Subtype_Indication : Node_Id)
return Node_Id;
pragma Inline (Make_Private_Extension_Declaration);
function Make_Use_Package_Clause (Sloc : Source_Ptr;
Names : List_Id)
return Node_Id;
pragma Inline (Make_Use_Package_Clause);
function Make_Use_Type_Clause (Sloc : Source_Ptr;
Subtype_Marks : List_Id)
return Node_Id;
pragma Inline (Make_Use_Type_Clause);
function Make_Object_Renaming_Declaration (Sloc : Source_Ptr;
Defining_Identifier : Node_Id;
Subtype_Mark : Node_Id;
Name : Node_Id)
return Node_Id;
pragma Inline (Make_Object_Renaming_Declaration);
function Make_Exception_Renaming_Declaration (Sloc : Source_Ptr;
Defining_Identifier : Node_Id;
Name : Node_Id)
return Node_Id;
pragma Inline (Make_Exception_Renaming_Declaration);
function Make_Package_Renaming_Declaration (Sloc : Source_Ptr;
Defining_Unit_Name : Node_Id;
Name : Node_Id)
return Node_Id;
pragma Inline (Make_Package_Renaming_Declaration);
function Make_Subprogram_Renaming_Declaration (Sloc : Source_Ptr;
Specification : Node_Id;
Name : Node_Id)
return Node_Id;
pragma Inline (Make_Subprogram_Renaming_Declaration);
function Make_Generic_Package_Renaming_Declaration (Sloc : Source_Ptr;
Defining_Unit_Name : Node_Id;
Name : Node_Id)
return Node_Id;
pragma Inline (Make_Generic_Package_Renaming_Declaration);
function Make_Generic_Procedure_Renaming_Declaration (Sloc : Source_Ptr;
Defining_Unit_Name : Node_Id;
Name : Node_Id)
return Node_Id;
pragma Inline (Make_Generic_Procedure_Renaming_Declaration);
function Make_Generic_Function_Renaming_Declaration (Sloc : Source_Ptr;
Defining_Unit_Name : Node_Id;
Name : Node_Id)
return Node_Id;
pragma Inline (Make_Generic_Function_Renaming_Declaration);
function Make_Task_Type_Declaration (Sloc : Source_Ptr;
Defining_Identifier : Node_Id;
Discriminant_Specifications : List_Id := No_List;
Task_Definition : Node_Id := Empty)
return Node_Id;
pragma Inline (Make_Task_Type_Declaration);
function Make_Single_Task_Declaration (Sloc : Source_Ptr;
Defining_Identifier : Node_Id;
Task_Definition : Node_Id := Empty)
return Node_Id;
pragma Inline (Make_Single_Task_Declaration);
function Make_Task_Definition (Sloc : Source_Ptr;
Visible_Declarations : List_Id;
Private_Declarations : List_Id := No_List;
End_Label : Node_Id)
return Node_Id;
pragma Inline (Make_Task_Definition);
function Make_Task_Body (Sloc : Source_Ptr;
Defining_Identifier : Node_Id;
Declarations : List_Id;
Handled_Statement_Sequence : Node_Id)
return Node_Id;
pragma Inline (Make_Task_Body);
function Make_Protected_Type_Declaration (Sloc : Source_Ptr;
Defining_Identifier : Node_Id;
Discriminant_Specifications : List_Id := No_List;
Protected_Definition : Node_Id)
return Node_Id;
pragma Inline (Make_Protected_Type_Declaration);
function Make_Single_Protected_Declaration (Sloc : Source_Ptr;
Defining_Identifier : Node_Id;
Protected_Definition : Node_Id)
return Node_Id;
pragma Inline (Make_Single_Protected_Declaration);
function Make_Protected_Definition (Sloc : Source_Ptr;
Visible_Declarations : List_Id;
Private_Declarations : List_Id := No_List;
End_Label : Node_Id)
return Node_Id;
pragma Inline (Make_Protected_Definition);
function Make_Protected_Body (Sloc : Source_Ptr;
Defining_Identifier : Node_Id;
Declarations : List_Id;
End_Label : Node_Id)
return Node_Id;
pragma Inline (Make_Protected_Body);
function Make_Entry_Declaration (Sloc : Source_Ptr;
Defining_Identifier : Node_Id;
Discrete_Subtype_Definition : Node_Id := Empty;
Parameter_Specifications : List_Id := No_List)
return Node_Id;
pragma Inline (Make_Entry_Declaration);
function Make_Accept_Statement (Sloc : Source_Ptr;
Entry_Direct_Name : Node_Id;
Entry_Index : Node_Id := Empty;
Parameter_Specifications : List_Id := No_List;
Handled_Statement_Sequence : Node_Id;
Declarations : List_Id := No_List)
return Node_Id;
pragma Inline (Make_Accept_Statement);
function Make_Entry_Body (Sloc : Source_Ptr;
Defining_Identifier : Node_Id;
Entry_Body_Formal_Part : Node_Id;
Declarations : List_Id;
Handled_Statement_Sequence : Node_Id)
return Node_Id;
pragma Inline (Make_Entry_Body);
function Make_Entry_Body_Formal_Part (Sloc : Source_Ptr;
Entry_Index_Specification : Node_Id := Empty;
Parameter_Specifications : List_Id := No_List;
Condition : Node_Id)
return Node_Id;
pragma Inline (Make_Entry_Body_Formal_Part);
function Make_Entry_Index_Specification (Sloc : Source_Ptr;
Defining_Identifier : Node_Id;
Discrete_Subtype_Definition : Node_Id)
return Node_Id;
pragma Inline (Make_Entry_Index_Specification);
function Make_Entry_Call_Statement (Sloc : Source_Ptr;
Name : Node_Id;
Parameter_Associations : List_Id := No_List)
return Node_Id;
pragma Inline (Make_Entry_Call_Statement);
function Make_Requeue_Statement (Sloc : Source_Ptr;
Name : Node_Id;
Abort_Present : Boolean := False)
return Node_Id;
pragma Inline (Make_Requeue_Statement);
function Make_Delay_Until_Statement (Sloc : Source_Ptr;
Expression : Node_Id)
return Node_Id;
pragma Inline (Make_Delay_Until_Statement);
function Make_Delay_Relative_Statement (Sloc : Source_Ptr;
Expression : Node_Id)
return Node_Id;
pragma Inline (Make_Delay_Relative_Statement);
function Make_Selective_Accept (Sloc : Source_Ptr;
Select_Alternatives : List_Id;
Else_Statements : List_Id := No_List)
return Node_Id;
pragma Inline (Make_Selective_Accept);
function Make_Accept_Alternative (Sloc : Source_Ptr;
Accept_Statement : Node_Id;
Condition : Node_Id := Empty;
Statements : List_Id := Empty_List;
Pragmas_Before : List_Id := No_List)
return Node_Id;
pragma Inline (Make_Accept_Alternative);
function Make_Delay_Alternative (Sloc : Source_Ptr;
Delay_Statement : Node_Id;
Condition : Node_Id := Empty;
Statements : List_Id := Empty_List;
Pragmas_Before : List_Id := No_List)
return Node_Id;
pragma Inline (Make_Delay_Alternative);
function Make_Terminate_Alternative (Sloc : Source_Ptr;
Condition : Node_Id := Empty;
Pragmas_Before : List_Id := No_List;
Pragmas_After : List_Id := No_List)
return Node_Id;
pragma Inline (Make_Terminate_Alternative);
function Make_Timed_Entry_Call (Sloc : Source_Ptr;
Entry_Call_Alternative : Node_Id;
Delay_Alternative : Node_Id)
return Node_Id;
pragma Inline (Make_Timed_Entry_Call);
function Make_Entry_Call_Alternative (Sloc : Source_Ptr;
Entry_Call_Statement : Node_Id;
Statements : List_Id := Empty_List;
Pragmas_Before : List_Id := No_List)
return Node_Id;
pragma Inline (Make_Entry_Call_Alternative);
function Make_Conditional_Entry_Call (Sloc : Source_Ptr;
Entry_Call_Alternative : Node_Id;
Else_Statements : List_Id)
return Node_Id;
pragma Inline (Make_Conditional_Entry_Call);
function Make_Asynchronous_Select (Sloc : Source_Ptr;
Triggering_Alternative : Node_Id;
Abortable_Part : Node_Id)
return Node_Id;
pragma Inline (Make_Asynchronous_Select);
function Make_Triggering_Alternative (Sloc : Source_Ptr;
Triggering_Statement : Node_Id;
Statements : List_Id := Empty_List;
Pragmas_Before : List_Id := No_List)
return Node_Id;
pragma Inline (Make_Triggering_Alternative);
function Make_Abortable_Part (Sloc : Source_Ptr;
Statements : List_Id)
return Node_Id;
pragma Inline (Make_Abortable_Part);
function Make_Abort_Statement (Sloc : Source_Ptr;
Names : List_Id)
return Node_Id;
pragma Inline (Make_Abort_Statement);
function Make_Compilation_Unit (Sloc : Source_Ptr;
Context_Items : List_Id;
Private_Present : Boolean := False;
Unit : Node_Id;
Aux_Decls_Node : Node_Id)
return Node_Id;
pragma Inline (Make_Compilation_Unit);
function Make_Compilation_Unit_Aux (Sloc : Source_Ptr;
Declarations : List_Id := No_List;
Actions : List_Id := No_List;
Pragmas_After : List_Id := No_List)
return Node_Id;
pragma Inline (Make_Compilation_Unit_Aux);
function Make_With_Clause (Sloc : Source_Ptr;
Name : Node_Id;
First_Name : Boolean := True;
Last_Name : Boolean := True)
return Node_Id;
pragma Inline (Make_With_Clause);
function Make_With_Type_Clause (Sloc : Source_Ptr;
Name : Node_Id;
Tagged_Present : Boolean := False)
return Node_Id;
pragma Inline (Make_With_Type_Clause);
function Make_Subprogram_Body_Stub (Sloc : Source_Ptr;
Specification : Node_Id)
return Node_Id;
pragma Inline (Make_Subprogram_Body_Stub);
function Make_Package_Body_Stub (Sloc : Source_Ptr;
Defining_Identifier : Node_Id)
return Node_Id;
pragma Inline (Make_Package_Body_Stub);
function Make_Task_Body_Stub (Sloc : Source_Ptr;
Defining_Identifier : Node_Id)
return Node_Id;
pragma Inline (Make_Task_Body_Stub);
function Make_Protected_Body_Stub (Sloc : Source_Ptr;
Defining_Identifier : Node_Id)
return Node_Id;
pragma Inline (Make_Protected_Body_Stub);
function Make_Subunit (Sloc : Source_Ptr;
Name : Node_Id;
Proper_Body : Node_Id)
return Node_Id;
pragma Inline (Make_Subunit);
function Make_Exception_Declaration (Sloc : Source_Ptr;
Defining_Identifier : Node_Id)
return Node_Id;
pragma Inline (Make_Exception_Declaration);
function Make_Handled_Sequence_Of_Statements (Sloc : Source_Ptr;
Statements : List_Id;
End_Label : Node_Id := Empty;
Exception_Handlers : List_Id := No_List;
At_End_Proc : Node_Id := Empty)
return Node_Id;
pragma Inline (Make_Handled_Sequence_Of_Statements);
function Make_Exception_Handler (Sloc : Source_Ptr;
Choice_Parameter : Node_Id := Empty;
Exception_Choices : List_Id;
Statements : List_Id)
return Node_Id;
pragma Inline (Make_Exception_Handler);
function Make_Raise_Statement (Sloc : Source_Ptr;
Name : Node_Id := Empty)
return Node_Id;
pragma Inline (Make_Raise_Statement);
function Make_Generic_Subprogram_Declaration (Sloc : Source_Ptr;
Specification : Node_Id;
Generic_Formal_Declarations : List_Id)
return Node_Id;
pragma Inline (Make_Generic_Subprogram_Declaration);
function Make_Generic_Package_Declaration (Sloc : Source_Ptr;
Specification : Node_Id;
Generic_Formal_Declarations : List_Id)
return Node_Id;
pragma Inline (Make_Generic_Package_Declaration);
function Make_Package_Instantiation (Sloc : Source_Ptr;
Defining_Unit_Name : Node_Id;
Name : Node_Id;
Generic_Associations : List_Id := No_List)
return Node_Id;
pragma Inline (Make_Package_Instantiation);
function Make_Procedure_Instantiation (Sloc : Source_Ptr;
Defining_Unit_Name : Node_Id;
Name : Node_Id;
Generic_Associations : List_Id := No_List)
return Node_Id;
pragma Inline (Make_Procedure_Instantiation);
function Make_Function_Instantiation (Sloc : Source_Ptr;
Defining_Unit_Name : Node_Id;
Name : Node_Id;
Generic_Associations : List_Id := No_List)
return Node_Id;
pragma Inline (Make_Function_Instantiation);
function Make_Generic_Association (Sloc : Source_Ptr;
Selector_Name : Node_Id := Empty;
Explicit_Generic_Actual_Parameter : Node_Id)
return Node_Id;
pragma Inline (Make_Generic_Association);
function Make_Formal_Object_Declaration (Sloc : Source_Ptr;
Defining_Identifier : Node_Id;
In_Present : Boolean := False;
Out_Present : Boolean := False;
Subtype_Mark : Node_Id;
Expression : Node_Id := Empty)
return Node_Id;
pragma Inline (Make_Formal_Object_Declaration);
function Make_Formal_Type_Declaration (Sloc : Source_Ptr;
Defining_Identifier : Node_Id;
Formal_Type_Definition : Node_Id;
Discriminant_Specifications : List_Id := No_List;
Unknown_Discriminants_Present : Boolean := False)
return Node_Id;
pragma Inline (Make_Formal_Type_Declaration);
function Make_Formal_Private_Type_Definition (Sloc : Source_Ptr;
Abstract_Present : Boolean := False;
Tagged_Present : Boolean := False;
Limited_Present : Boolean := False)
return Node_Id;
pragma Inline (Make_Formal_Private_Type_Definition);
function Make_Formal_Derived_Type_Definition (Sloc : Source_Ptr;
Subtype_Mark : Node_Id;
Private_Present : Boolean := False;
Abstract_Present : Boolean := False)
return Node_Id;
pragma Inline (Make_Formal_Derived_Type_Definition);
function Make_Formal_Discrete_Type_Definition (Sloc : Source_Ptr)
return Node_Id;
pragma Inline (Make_Formal_Discrete_Type_Definition);
function Make_Formal_Signed_Integer_Type_Definition (Sloc : Source_Ptr)
return Node_Id;
pragma Inline (Make_Formal_Signed_Integer_Type_Definition);
function Make_Formal_Modular_Type_Definition (Sloc : Source_Ptr)
return Node_Id;
pragma Inline (Make_Formal_Modular_Type_Definition);
function Make_Formal_Floating_Point_Definition (Sloc : Source_Ptr)
return Node_Id;
pragma Inline (Make_Formal_Floating_Point_Definition);
function Make_Formal_Ordinary_Fixed_Point_Definition (Sloc : Source_Ptr)
return Node_Id;
pragma Inline (Make_Formal_Ordinary_Fixed_Point_Definition);
function Make_Formal_Decimal_Fixed_Point_Definition (Sloc : Source_Ptr)
return Node_Id;
pragma Inline (Make_Formal_Decimal_Fixed_Point_Definition);
function Make_Formal_Subprogram_Declaration (Sloc : Source_Ptr;
Specification : Node_Id;
Default_Name : Node_Id := Empty;
Box_Present : Boolean := False)
return Node_Id;
pragma Inline (Make_Formal_Subprogram_Declaration);
function Make_Formal_Package_Declaration (Sloc : Source_Ptr;
Defining_Identifier : Node_Id;
Name : Node_Id;
Generic_Associations : List_Id := No_List;
Box_Present : Boolean := False)
return Node_Id;
pragma Inline (Make_Formal_Package_Declaration);
function Make_Attribute_Definition_Clause (Sloc : Source_Ptr;
Name : Node_Id;
Chars : Name_Id;
Expression : Node_Id)
return Node_Id;
pragma Inline (Make_Attribute_Definition_Clause);
function Make_Enumeration_Representation_Clause (Sloc : Source_Ptr;
Identifier : Node_Id;
Array_Aggregate : Node_Id)
return Node_Id;
pragma Inline (Make_Enumeration_Representation_Clause);
function Make_Record_Representation_Clause (Sloc : Source_Ptr;
Identifier : Node_Id;
Mod_Clause : Node_Id := Empty;
Component_Clauses : List_Id)
return Node_Id;
pragma Inline (Make_Record_Representation_Clause);
function Make_Component_Clause (Sloc : Source_Ptr;
Component_Name : Node_Id;
Position : Node_Id;
First_Bit : Node_Id;
Last_Bit : Node_Id)
return Node_Id;
pragma Inline (Make_Component_Clause);
function Make_Code_Statement (Sloc : Source_Ptr;
Expression : Node_Id)
return Node_Id;
pragma Inline (Make_Code_Statement);
function Make_Op_Rotate_Left (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_Rotate_Left);
function Make_Op_Rotate_Right (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_Rotate_Right);
function Make_Op_Shift_Left (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_Shift_Left);
function Make_Op_Shift_Right_Arithmetic (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_Shift_Right_Arithmetic);
function Make_Op_Shift_Right (Sloc : Source_Ptr;
Left_Opnd : Node_Id;
Right_Opnd : Node_Id)
return Node_Id;
pragma Inline (Make_Op_Shift_Right);
function Make_Delta_Constraint (Sloc : Source_Ptr;
Delta_Expression : Node_Id;
Range_Constraint : Node_Id := Empty)
return Node_Id;
pragma Inline (Make_Delta_Constraint);
function Make_At_Clause (Sloc : Source_Ptr;
Identifier : Node_Id;
Expression : Node_Id)
return Node_Id;
pragma Inline (Make_At_Clause);
function Make_Mod_Clause (Sloc : Source_Ptr;
Expression : Node_Id;
Pragmas_Before : List_Id)
return Node_Id;
pragma Inline (Make_Mod_Clause);
function Make_Conditional_Expression (Sloc : Source_Ptr;
Expressions : List_Id)
return Node_Id;
pragma Inline (Make_Conditional_Expression);
function Make_Expanded_Name (Sloc : Source_Ptr;
Chars : Name_Id;
Prefix : Node_Id;
Selector_Name : Node_Id)
return Node_Id;
pragma Inline (Make_Expanded_Name);
function Make_Free_Statement (Sloc : Source_Ptr;
Expression : Node_Id)
return Node_Id;
pragma Inline (Make_Free_Statement);
function Make_Freeze_Entity (Sloc : Source_Ptr;
Actions : List_Id := No_List)
return Node_Id;
pragma Inline (Make_Freeze_Entity);
function Make_Implicit_Label_Declaration (Sloc : Source_Ptr;
Defining_Identifier : Node_Id)
return Node_Id;
pragma Inline (Make_Implicit_Label_Declaration);
function Make_Itype_Reference (Sloc : Source_Ptr)
return Node_Id;
pragma Inline (Make_Itype_Reference);
function Make_Raise_Constraint_Error (Sloc : Source_Ptr;
Condition : Node_Id := Empty)
return Node_Id;
pragma Inline (Make_Raise_Constraint_Error);
function Make_Raise_Program_Error (Sloc : Source_Ptr;
Condition : Node_Id := Empty)
return Node_Id;
pragma Inline (Make_Raise_Program_Error);
function Make_Raise_Storage_Error (Sloc : Source_Ptr;
Condition : Node_Id := Empty)
return Node_Id;
pragma Inline (Make_Raise_Storage_Error);
function Make_Reference (Sloc : Source_Ptr;
Prefix : Node_Id)
return Node_Id;
pragma Inline (Make_Reference);
function Make_Subprogram_Info (Sloc : Source_Ptr;
Identifier : Node_Id)
return Node_Id;
pragma Inline (Make_Subprogram_Info);
function Make_Unchecked_Expression (Sloc : Source_Ptr;
Expression : Node_Id)
return Node_Id;
pragma Inline (Make_Unchecked_Expression);
function Make_Unchecked_Type_Conversion (Sloc : Source_Ptr;
Subtype_Mark : Node_Id;
Expression : Node_Id)
return Node_Id;
pragma Inline (Make_Unchecked_Type_Conversion);
function Make_Validate_Unchecked_Conversion (Sloc : Source_Ptr)
return Node_Id;
pragma Inline (Make_Validate_Unchecked_Conversion);
end Nmake;
| 38.13244 | 78 | 0.610302 |
3857992acb84b8c7987888171556f848a69be989 | 949 | adb | Ada | gnu/src/gdb/gdb/testsuite/gdb.ada/taft_type/pck.adb | ghsecuritylab/ellcc-mirror | b03a4afac74d50cf0987554b8c0cd8209bcb92a2 | [
"BSD-2-Clause"
] | null | null | null | gnu/src/gdb/gdb/testsuite/gdb.ada/taft_type/pck.adb | ghsecuritylab/ellcc-mirror | b03a4afac74d50cf0987554b8c0cd8209bcb92a2 | [
"BSD-2-Clause"
] | null | null | null | gnu/src/gdb/gdb/testsuite/gdb.ada/taft_type/pck.adb | ghsecuritylab/ellcc-mirror | b03a4afac74d50cf0987554b8c0cd8209bcb92a2 | [
"BSD-2-Clause"
] | null | null | null | -- Copyright 2008-2015 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package body Pck is
type Empty is record
Month : Integer;
Year : Integer;
end record;
function Create return Wrap is
begin
return (E => new Empty'(Month => 8, Year => 1974));
end Create;
end Pck;
| 31.633333 | 73 | 0.703899 |
0419a8254e251040837e8234a4657db812c7741f | 161 | adb | Ada | ejercicios6/insertar_en_posicion_N.adb | iyan22/AprendeAda | 18bd2a224e5bda30c43d9ceabe0c05278e069ebf | [
"MIT"
] | null | null | null | ejercicios6/insertar_en_posicion_N.adb | iyan22/AprendeAda | 18bd2a224e5bda30c43d9ceabe0c05278e069ebf | [
"MIT"
] | null | null | null | ejercicios6/insertar_en_posicion_N.adb | iyan22/AprendeAda | 18bd2a224e5bda30c43d9ceabe0c05278e069ebf | [
"MIT"
] | null | null | null | with datos; use datos;
procedure Insertar_en_psicion_N (
L : in out Lista;
Num : in Integer ) is
begin
end Insertar_en_psicion_N;
| 10.733333 | 33 | 0.627329 |
4b8f29c7b1eec415a7f0340b8700cbc8033ace00 | 3,895 | ads | Ada | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-pack12.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-pack12.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-pack12.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 1 2 --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2019, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Handling of packed arrays with Component_Size = 12
package System.Pack_12 is
pragma Preelaborate;
Bits : constant := 12;
type Bits_12 is mod 2 ** Bits;
for Bits_12'Size use Bits;
-- In all subprograms below, Rev_SSO is set True if the array has the
-- non-default scalar storage order.
function Get_12
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_12 with Inline;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned.
procedure Set_12
(Arr : System.Address;
N : Natural;
E : Bits_12;
Rev_SSO : Boolean) with Inline;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is set to the given value.
function GetU_12
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_12 with Inline;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned. This version
-- is used when Arr may represent an unaligned address.
procedure SetU_12
(Arr : System.Address;
N : Natural;
E : Bits_12;
Rev_SSO : Boolean) with Inline;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is set to the given value. This version
-- is used when Arr may represent an unaligned address
end System.Pack_12;
| 49.935897 | 78 | 0.474711 |
224e4717cc27b69aafc1f8b4373d330de4eff790 | 187 | ads | Ada | 3-mid/opengl/source/lean/model/opengl-model-capsule.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/opengl/source/lean/model/opengl-model-capsule.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/opengl/source/lean/model/opengl-model-capsule.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | package openGL.Model.capsule
--
-- Provides an abstract base class for capsule models.
--
is
type Item is abstract new openGL.Model.item with null record;
end openGL.Model.capsule;
| 18.7 | 64 | 0.754011 |
1e39fd8f8a34301d1065c37cf438464632d5cfab | 1,550 | ads | Ada | tier-1/xcb/source/thin/xcb-xcb_setup_authenticate_iterator_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_setup_authenticate_iterator_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_setup_authenticate_iterator_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 xcb.xcb_setup_authenticate_t;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_setup_authenticate_iterator_t is
-- Item
--
type Item is record
data : access xcb.xcb_setup_authenticate_t.Item;
the_rem : aliased Interfaces.C.int;
index : aliased Interfaces.C.int;
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_setup_authenticate_iterator_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_setup_authenticate_iterator_t.Item,
Element_Array => xcb.xcb_setup_authenticate_iterator_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_setup_authenticate_iterator_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_setup_authenticate_iterator_t.Pointer,
Element_Array => xcb.xcb_setup_authenticate_iterator_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_setup_authenticate_iterator_t;
| 27.678571 | 77 | 0.680645 |
38a4cabac5d5edb63eb6b87fd6370727fadb0158 | 1,258 | ads | Ada | tests/src/test_simd_avx_swizzle.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 52 | 2016-07-30T23:00:28.000Z | 2022-02-05T11:54:55.000Z | tests/src/test_simd_avx_swizzle.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 79 | 2016-08-01T18:36:48.000Z | 2022-02-27T12:14:20.000Z | tests/src/test_simd_avx_swizzle.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) 2016 onox <[email protected]>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
with AUnit.Test_Suites;
with AUnit.Test_Fixtures;
package Test_SIMD_AVX_Swizzle is
function Suite return AUnit.Test_Suites.Access_Test_Suite;
private
type Test is new AUnit.Test_Fixtures.Test_Fixture with null record;
procedure Test_Shuffle (Object : in out Test);
procedure Test_Shuffle_Across_Lanes (Object : in out Test);
procedure Test_Permute_Lanes (Object : in out Test);
procedure Test_Blend (Object : in out Test);
procedure Test_Transpose_Function (Object : in out Test);
procedure Test_Transpose_Procedure (Object : in out Test);
end Test_SIMD_AVX_Swizzle;
| 34.944444 | 76 | 0.753577 |
1e9085a4f0e830adb1330c6ab22dd74ecedfea97 | 6,297 | ads | Ada | 3-mid/impact/source/2d/orbs/collision/impact-d2-orbs-dynamic_tree.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-dynamic_tree.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-dynamic_tree.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;
package impact.d2.orbs.dynamic_Tree
--
-- A dynamic AABB tree broad-phase, inspired by Nathanael Presson's btDbvt.
--
is
use impact.d2.Math;
b2_nullNode : constant := 0;
-- A node in the dynamic tree. The client does not interact with this directly.
--
type b2DynamicTreeNode_Kind is (with_Parent_index, with_Next_index);
type b2DynamicTreeNode (Kind : b2DynamicTreeNode_Kind := with_parent_index) is
record
aabb : collision.b2AABB; -- This is the fattened AABB.
userData : access Any'Class;
child1 : aliased int32;
child2 : int32;
case Kind is
when with_Parent_index => parent : int32;
when with_Next_index => next : int32;
end case;
end record;
pragma Unchecked_Union (b2DynamicTreeNode);
type b2DynamicTreeNodes is array (int32 range <>) of b2DynamicTreeNode;
function isLeaf (Self : in b2DynamicTreeNode) return Boolean;
-- A dynamic tree arranges data in a binary tree to accelerate
-- queries such as volume queries and ray casts. Leafs are proxies
-- with an AABB. In the tree we expand the proxy AABB by b2_fatAABBFactor
-- so that the proxy AABB is bigger than the client object. This allows the client
-- object to move by small amounts without triggering a tree update.
--
-- Nodes are pooled and relocatable, so we use node indices rather than pointers.
--
type b2DynamicTree is tagged private;
function to_b2DynamicTree return b2DynamicTree; -- Constructing the tree initializes the node pool.
procedure destruct (Self : in out b2DynamicTree); -- Destroy the tree, freeing the node pool.
-- Create a proxy. Provide a tight fitting AABB and a userData pointer.
--
function createProxy (Self : access b2DynamicTree; aabb : in collision.b2AABB;
userData : access Any'Class) return int32;
-- Destroy a proxy. This asserts if the id is invalid.
--
procedure destroyProxy (Self : in out b2DynamicTree; proxyId : int32);
-- Move a proxy with a swepted AABB. If the proxy has moved outside of its fattened AABB,
-- then the proxy is removed from the tree and re-inserted. Otherwise
-- the function returns immediately.
-- Return True if the proxy was re-inserted.
--
function MoveProxy (Self : access b2DynamicTree; proxyId : in int32;
aabb : in collision.b2AABB;
displacement : in b2Vec2) return Boolean;
-- Perform some iterations to re-balance the tree.
--
procedure Rebalance (Self : in out b2DynamicTree; iterations : in int32);
-- Get proxy user data.
-- Return the proxy user data or 0 if the id is invalid.
--
function getUserData (Self : in b2DynamicTree; proxyId : in int32) return access Any'Class;
-- Get the fat AABB for a proxy.
--
function GetFatAABB (Self : in b2DynamicTree; proxyId : int32) return collision.b2AABB;
-- Compute the height of the tree.
--
function ComputeHeight (Self : in b2DynamicTree) return int32;
-- 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 b2DynamicTree; 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 b2DynamicTree; the_Callback : access callback_t;
input : in collision.b2RayCastInput);
-- template <typename T>
-- void RayCast(T* callback, const b2RayCastInput& input) const;
--
-- float32 value = callback->RayCastCallback(subInput, nodeId);
private
type b2DynamicTreeNodes_view is access all b2DynamicTreeNodes;
type b2DynamicTree is tagged
record
m_root : int32;
m_nodes : b2DynamicTreeNodes_view;
m_nodeCount : int32;
m_nodeCapacity : int32;
m_freeList : int32;
m_path : uint32; -- This is used incrementally traverse the tree for re-balancing.
m_insertionCount : int32;
end record;
function AllocateNode (Self : access b2DynamicTree) return int32;
procedure FreeNode (Self : in out b2DynamicTree; nodeId : in int32);
procedure InsertLeaf (Self : in out b2DynamicTree; leafId : in int32);
procedure RemoveLeaf (Self : in out b2DynamicTree; leafId : in int32);
function ComputeHeight (Self : in b2DynamicTree; nodeId : in int32) return int32;
end impact.d2.orbs.dynamic_Tree;
| 34.598901 | 108 | 0.602827 |
38eba4229ff00925b3a6c333ef8adecedea3b2b2 | 5,348 | ads | Ada | testsuite/tests/NA17-007__copyright/g-md5.ads | AdaCore/style_checker | 17108ebfc44375498063ecdad6c6e4430458e60a | [
"CNRI-Python"
] | 2 | 2017-10-22T18:04:26.000Z | 2020-03-06T11:07:41.000Z | testsuite/tests/NA17-007__copyright/g-md5.ads | AdaCore/style_checker | 17108ebfc44375498063ecdad6c6e4430458e60a | [
"CNRI-Python"
] | null | null | null | testsuite/tests/NA17-007__copyright/g-md5.ads | AdaCore/style_checker | 17108ebfc44375498063ecdad6c6e4430458e60a | [
"CNRI-Python"
] | 4 | 2018-05-22T12:08:54.000Z | 2020-12-14T15:25:27.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- G N A T . M D 5 --
-- --
-- S p e c --
-- --
-- XXXXXXXXX (C) 2002-2008, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package implements the MD5 Message-Digest Algorithm as described in
-- RFC 1321. The complete text of RFC 1321 can be found at:
--
-- http://www.ietf.org/rfc/rfc1321.txt
--
-- The implementation is derived from the RSA Data Security, Inc. MD5
-- Message-Digest Algorithm, as described in RFC 1321.
with Ada.Streams;
with Interfaces;
package GNAT.MD5 is
type Context is private;
-- This type is the four-word (16 byte) MD buffer, as described in
-- RFC 1321 (3.3). Its initial value is Initial_Context below.
Initial_Context : constant Context;
-- Initial value of a Context object. May be used to reinitialize
-- a Context value by simple assignment of this value to the object.
procedure Update
(C : in out Context;
Input : String);
procedure Wide_Update
(C : in out Context;
Input : Wide_String);
procedure Update
(C : in out Context;
Input : Ada.Streams.Stream_Element_Array);
-- Modify the Context C. If C has the initial value Initial_Context,
-- then, after a call to one of these procedures, Digest (C) will return
-- the Message-Digest of Input.
--
-- These procedures may be called successively with the same context and
-- different inputs, and these several successive calls will produce
-- the same final context as a call with the concatenation of the inputs.
subtype Message_Digest is String (1 .. 32);
-- The string type returned by function Digest
function Digest (C : Context) return Message_Digest;
-- Extracts the Message-Digest from a context. This function should be
-- used after one or several calls to Update.
function Digest (S : String) return Message_Digest;
function Wide_Digest (W : Wide_String) return Message_Digest;
function Digest
(A : Ada.Streams.Stream_Element_Array)
return Message_Digest;
-- These functions are equivalent to the corresponding Update (or
-- Wide_Update) on a default initialized Context, followed by Digest
-- on the resulting Context.
private
-- Magic numbers
Initial_A : constant := 16#67452301#;
Initial_B : constant := 16#EFCDAB89#;
Initial_C : constant := 16#98BADCFE#;
Initial_D : constant := 16#10325476#;
type Context is record
A : Interfaces.Unsigned_32 := Initial_A;
B : Interfaces.Unsigned_32 := Initial_B;
C : Interfaces.Unsigned_32 := Initial_C;
D : Interfaces.Unsigned_32 := Initial_D;
Buffer : String (1 .. 64) := (others => ASCII.NUL);
Last : Natural := 0;
Length : Natural := 0;
end record;
Initial_Context : constant Context :=
(A => Initial_A, B => Initial_B, C => Initial_C, D => Initial_D,
Buffer => (others => ASCII.NUL), Last => 0, Length => 0);
end GNAT.MD5;
| 47.75 | 78 | 0.544503 |
137c31262622120c8bd818c11c8aa7044fd4531a | 3,772 | ads | Ada | source/web/soap/web_services-soap-headers-encoders-registry.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/web/soap/web_services-soap-headers-encoders-registry.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/web/soap/web_services-soap-headers-encoders-registry.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with Ada.Tags;
package Web_Services.SOAP.Headers.Encoders.Registry is
procedure Register (Header_Tag : Ada.Tags.Tag; Encoder_Tag : Ada.Tags.Tag);
-- Register encoder.
function Resolve
(Message_Tag : Ada.Tags.Tag)
return
not null
Web_Services.SOAP.Headers.Encoders.SOAP_Header_Encoder_Access;
-- Resolve encoder for the given message.
end Web_Services.SOAP.Headers.Encoders.Registry;
| 63.932203 | 78 | 0.423913 |
4bb788b4f33cb19a257cc9fcd65e8365a61b1ed5 | 4,257 | ads | Ada | ordinary/runge_5th.ads | jscparker/math_packages | b112a90338014d5c2dfae3f7265ee30841fb6cfd | [
"ISC",
"MIT"
] | 30 | 2018-12-09T01:15:04.000Z | 2022-03-20T16:14:54.000Z | ordinary/runge_5th.ads | jscparker/math_packages | b112a90338014d5c2dfae3f7265ee30841fb6cfd | [
"ISC",
"MIT"
] | null | null | null | ordinary/runge_5th.ads | jscparker/math_packages | b112a90338014d5c2dfae3f7265ee30841fb6cfd | [
"ISC",
"MIT"
] | null | null | null |
-- PACKAGE Runge_5th
--
-- Package implements the 5th order Runge Kutta of Prince and Dormand.
--
-- The program integrates dY/dt = F (t, Y) where t is the
-- independent variable (e.g. time), vector Y is the dependent
-- variable, and F is some function.
--
-- When high accuracy is required, higher order routines
-- are a good idea; but if very low accuracy is fine, then the 5th order
-- (6 stage) Runge-Kutta might be better. If the equation is
-- is stiff, or if you are forced to take very small step sizes for
-- any other reason, then the lower order method is probably faster.
--
-- NOTES ON USE
--
-- (see runge_8th.ads)
generic
type Real is digits <>;
-- The independent variable has type Real. It's called Time
-- throughout the package as though the differential
-- equation dY/dt = F (t, Y) were time dependent.
type Dyn_Index is range <>;
type Dynamical_Variable is array(Dyn_Index) of Real;
-- The dependent variable.
--
-- To use this routine, reduce higher order differential
-- equations to 1st order.
-- For example a 3rd order equation in X becomes a first order
-- equation in the vector Y = (X, dX/dt, d/dt(dX/dt)).
with function F
(Time : Real;
Y : Dynamical_Variable)
return Dynamical_Variable is <>;
-- Defines the equation to be integrated: dY/dt = F (t, Y).
-- Even if the equation is t or Y
-- independent, it must be entered in this form.
with function "*"
(Left : Real;
Right : Dynamical_Variable)
return Dynamical_Variable is <>;
-- Defines multiplication of the independent by the
-- dependent variable. An operation of this sort must exist by
-- definition of the derivative, dY/dt = (Y(t+dt) - Y(t)) / dt,
-- which requires multiplication of the (inverse) independent
-- variable t, by the Dynamical variable Y (the dependent variable).
with function "+"
(Left : Dynamical_Variable;
Right : Dynamical_Variable)
return Dynamical_Variable is <>;
-- Defines summation of the dependent variable. Again, this
-- operation must exist by the definition of the derivative,
-- dY/dt = (Y(t+dt) - Y(t)) / dt = (Y(t+dt) + (-1)*Y(t)) / dt.
with function "-"
(Left : Dynamical_Variable;
Right : Dynamical_Variable)
return Dynamical_Variable is <>;
with function Norm
(Y1: in Dynamical_Variable) return Real is <>;
-- For error control we need to know the distance between two objects.
-- Norm define a distance between the two vector, Y1 and Y2
-- using: distance = Norm (Y1 - Y2),
-- For example, if Dynamical_Variable is complex, then Norm can
-- be Sqrt (Real (Y1(1)) * Conjugate (Y1(1))));
-- If it is a vector then the metric may be
-- Sqrt (Transpose(Y1(1)) * Y1(1)), etc.
--
-- Recommended: Sum the absolute values of the components of the vector.
package Runge_5th is
type Step_Integer is range 1 .. 2**31-1;
-- The step size Delta_t is never input. Instead
-- you input Starting_Time, Final_Time, and No_Of_Steps.
-- If there is no error control then Delta_t is
-- (Final_Time - Starting_Time) / No_Of_Steps. If there is
-- error control, then the Delta_t given above is the
-- initial choice of Delta_t, but after the first step Delta_t
-- becomes variable.
procedure Integrate
(Final_State : out Dynamical_Variable;
Final_Time : in Real;
Initial_State : in Dynamical_Variable;
Initial_Time : in Real;
No_Of_Steps : in Step_Integer;
Error_Control_Desired : in Boolean := False;
Error_Tolerance : in Real := 1.0E-6);
private
Zero : constant := +0.0;
Half : constant := +0.5;
One : constant := +1.0;
Two : constant := +2.0;
Four : constant := +4.0;
One_Sixteenth : constant := +0.0625;
One_Eighth : constant := +0.125;
One_Fifth : constant := +0.2;
Four_Fifths : constant := +0.8;
Test_of_Runge_Coeffs_Desired : constant Boolean := False;
-- Test exported by Runge_Coeffs_pd_5 prints error msg if failure detected.
-- Make true during testing.
end Runge_5th;
| 36.076271 | 79 | 0.64482 |
ad56822a7b5058ca0d66a310df3b2afc66c7a103 | 19,671 | adb | Ada | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/g-spitbo.adb | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/g-spitbo.adb | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/g-spitbo.adb | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- G N A T . S P I T B O L --
-- --
-- B o d y --
-- --
-- Copyright (C) 1998-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. --
-- --
------------------------------------------------------------------------------
with Ada.Strings; use Ada.Strings;
with Ada.Strings.Unbounded.Aux; use Ada.Strings.Unbounded.Aux;
with GNAT.Debug_Utilities; use GNAT.Debug_Utilities;
with GNAT.IO; use GNAT.IO;
with System.String_Hash;
with Ada.Unchecked_Deallocation;
package body GNAT.Spitbol is
---------
-- "&" --
---------
function "&" (Num : Integer; Str : String) return String is
begin
return S (Num) & Str;
end "&";
function "&" (Str : String; Num : Integer) return String is
begin
return Str & S (Num);
end "&";
function "&" (Num : Integer; Str : VString) return VString is
begin
return S (Num) & Str;
end "&";
function "&" (Str : VString; Num : Integer) return VString is
begin
return Str & S (Num);
end "&";
----------
-- Char --
----------
function Char (Num : Natural) return Character is
begin
return Character'Val (Num);
end Char;
----------
-- Lpad --
----------
function Lpad
(Str : VString;
Len : Natural;
Pad : Character := ' ') return VString
is
begin
if Length (Str) >= Len then
return Str;
else
return Tail (Str, Len, Pad);
end if;
end Lpad;
function Lpad
(Str : String;
Len : Natural;
Pad : Character := ' ') return VString
is
begin
if Str'Length >= Len then
return V (Str);
else
declare
R : String (1 .. Len);
begin
for J in 1 .. Len - Str'Length loop
R (J) := Pad;
end loop;
R (Len - Str'Length + 1 .. Len) := Str;
return V (R);
end;
end if;
end Lpad;
procedure Lpad
(Str : in out VString;
Len : Natural;
Pad : Character := ' ')
is
begin
if Length (Str) >= Len then
return;
else
Tail (Str, Len, Pad);
end if;
end Lpad;
-------
-- N --
-------
function N (Str : VString) return Integer is
S : Big_String_Access;
L : Natural;
begin
Get_String (Str, S, L);
return Integer'Value (S (1 .. L));
end N;
--------------------
-- Reverse_String --
--------------------
function Reverse_String (Str : VString) return VString is
S : Big_String_Access;
L : Natural;
begin
Get_String (Str, S, L);
declare
Result : String (1 .. L);
begin
for J in 1 .. L loop
Result (J) := S (L + 1 - J);
end loop;
return V (Result);
end;
end Reverse_String;
function Reverse_String (Str : String) return VString is
Result : String (1 .. Str'Length);
begin
for J in 1 .. Str'Length loop
Result (J) := Str (Str'Last + 1 - J);
end loop;
return V (Result);
end Reverse_String;
procedure Reverse_String (Str : in out VString) is
S : Big_String_Access;
L : Natural;
begin
Get_String (Str, S, L);
declare
Result : String (1 .. L);
begin
for J in 1 .. L loop
Result (J) := S (L + 1 - J);
end loop;
Set_Unbounded_String (Str, Result);
end;
end Reverse_String;
----------
-- Rpad --
----------
function Rpad
(Str : VString;
Len : Natural;
Pad : Character := ' ') return VString
is
begin
if Length (Str) >= Len then
return Str;
else
return Head (Str, Len, Pad);
end if;
end Rpad;
function Rpad
(Str : String;
Len : Natural;
Pad : Character := ' ') return VString
is
begin
if Str'Length >= Len then
return V (Str);
else
declare
R : String (1 .. Len);
begin
for J in Str'Length + 1 .. Len loop
R (J) := Pad;
end loop;
R (1 .. Str'Length) := Str;
return V (R);
end;
end if;
end Rpad;
procedure Rpad
(Str : in out VString;
Len : Natural;
Pad : Character := ' ')
is
begin
if Length (Str) >= Len then
return;
else
Head (Str, Len, Pad);
end if;
end Rpad;
-------
-- S --
-------
function S (Num : Integer) return String is
Buf : String (1 .. 30);
Ptr : Natural := Buf'Last + 1;
Val : Natural := abs (Num);
begin
loop
Ptr := Ptr - 1;
Buf (Ptr) := Character'Val (Val mod 10 + Character'Pos ('0'));
Val := Val / 10;
exit when Val = 0;
end loop;
if Num < 0 then
Ptr := Ptr - 1;
Buf (Ptr) := '-';
end if;
return Buf (Ptr .. Buf'Last);
end S;
------------
-- Substr --
------------
function Substr
(Str : VString;
Start : Positive;
Len : Natural) return VString
is
S : Big_String_Access;
L : Natural;
begin
Get_String (Str, S, L);
if Start > L then
raise Index_Error;
elsif Start + Len - 1 > L then
raise Length_Error;
else
return V (S (Start .. Start + Len - 1));
end if;
end Substr;
function Substr
(Str : String;
Start : Positive;
Len : Natural) return VString
is
begin
if Start > Str'Length then
raise Index_Error;
elsif Start + Len - 1 > Str'Length then
raise Length_Error;
else
return
V (Str (Str'First + Start - 1 .. Str'First + Start + Len - 2));
end if;
end Substr;
-----------
-- Table --
-----------
package body Table is
procedure Free is new
Ada.Unchecked_Deallocation (Hash_Element, Hash_Element_Ptr);
-----------------------
-- Local Subprograms --
-----------------------
function Hash is new System.String_Hash.Hash
(Character, String, Unsigned_32);
------------
-- Adjust --
------------
overriding procedure Adjust (Object : in out Table) is
Ptr1 : Hash_Element_Ptr;
Ptr2 : Hash_Element_Ptr;
begin
for J in Object.Elmts'Range loop
Ptr1 := Object.Elmts (J)'Unrestricted_Access;
if Ptr1.Name /= null then
loop
Ptr1.Name := new String'(Ptr1.Name.all);
exit when Ptr1.Next = null;
Ptr2 := Ptr1.Next;
Ptr1.Next := new Hash_Element'(Ptr2.all);
Ptr1 := Ptr1.Next;
end loop;
end if;
end loop;
end Adjust;
-----------
-- Clear --
-----------
procedure Clear (T : in out Table) is
Ptr1 : Hash_Element_Ptr;
Ptr2 : Hash_Element_Ptr;
begin
for J in T.Elmts'Range loop
if T.Elmts (J).Name /= null then
Free (T.Elmts (J).Name);
T.Elmts (J).Value := Null_Value;
Ptr1 := T.Elmts (J).Next;
T.Elmts (J).Next := null;
while Ptr1 /= null loop
Ptr2 := Ptr1.Next;
Free (Ptr1.Name);
Free (Ptr1);
Ptr1 := Ptr2;
end loop;
end if;
end loop;
end Clear;
----------------------
-- Convert_To_Array --
----------------------
function Convert_To_Array (T : Table) return Table_Array is
Num_Elmts : Natural := 0;
Elmt : Hash_Element_Ptr;
begin
for J in T.Elmts'Range loop
Elmt := T.Elmts (J)'Unrestricted_Access;
if Elmt.Name /= null then
loop
Num_Elmts := Num_Elmts + 1;
Elmt := Elmt.Next;
exit when Elmt = null;
end loop;
end if;
end loop;
declare
TA : Table_Array (1 .. Num_Elmts);
P : Natural := 1;
begin
for J in T.Elmts'Range loop
Elmt := T.Elmts (J)'Unrestricted_Access;
if Elmt.Name /= null then
loop
Set_Unbounded_String (TA (P).Name, Elmt.Name.all);
TA (P).Value := Elmt.Value;
P := P + 1;
Elmt := Elmt.Next;
exit when Elmt = null;
end loop;
end if;
end loop;
return TA;
end;
end Convert_To_Array;
----------
-- Copy --
----------
procedure Copy (From : Table; To : in out Table) is
Elmt : Hash_Element_Ptr;
begin
Clear (To);
for J in From.Elmts'Range loop
Elmt := From.Elmts (J)'Unrestricted_Access;
if Elmt.Name /= null then
loop
Set (To, Elmt.Name.all, Elmt.Value);
Elmt := Elmt.Next;
exit when Elmt = null;
end loop;
end if;
end loop;
end Copy;
------------
-- Delete --
------------
procedure Delete (T : in out Table; Name : Character) is
begin
Delete (T, String'(1 => Name));
end Delete;
procedure Delete (T : in out Table; Name : VString) is
S : Big_String_Access;
L : Natural;
begin
Get_String (Name, S, L);
Delete (T, S (1 .. L));
end Delete;
procedure Delete (T : in out Table; Name : String) is
Slot : constant Unsigned_32 := Hash (Name) mod T.N + 1;
Elmt : Hash_Element_Ptr := T.Elmts (Slot)'Unrestricted_Access;
Next : Hash_Element_Ptr;
begin
if Elmt.Name = null then
null;
elsif Elmt.Name.all = Name then
Free (Elmt.Name);
if Elmt.Next = null then
Elmt.Value := Null_Value;
return;
else
Next := Elmt.Next;
Elmt.Name := Next.Name;
Elmt.Value := Next.Value;
Elmt.Next := Next.Next;
Free (Next);
return;
end if;
else
loop
Next := Elmt.Next;
if Next = null then
return;
elsif Next.Name.all = Name then
Free (Next.Name);
Elmt.Next := Next.Next;
Free (Next);
return;
else
Elmt := Next;
end if;
end loop;
end if;
end Delete;
----------
-- Dump --
----------
procedure Dump (T : Table; Str : String := "Table") is
Num_Elmts : Natural := 0;
Elmt : Hash_Element_Ptr;
begin
for J in T.Elmts'Range loop
Elmt := T.Elmts (J)'Unrestricted_Access;
if Elmt.Name /= null then
loop
Num_Elmts := Num_Elmts + 1;
Put_Line
(Str & '<' & Image (Elmt.Name.all) & "> = " &
Img (Elmt.Value));
Elmt := Elmt.Next;
exit when Elmt = null;
end loop;
end if;
end loop;
if Num_Elmts = 0 then
Put_Line (Str & " is empty");
end if;
end Dump;
procedure Dump (T : Table_Array; Str : String := "Table_Array") is
begin
if T'Length = 0 then
Put_Line (Str & " is empty");
else
for J in T'Range loop
Put_Line
(Str & '(' & Image (To_String (T (J).Name)) & ") = " &
Img (T (J).Value));
end loop;
end if;
end Dump;
--------------
-- Finalize --
--------------
overriding procedure Finalize (Object : in out Table) is
Ptr1 : Hash_Element_Ptr;
Ptr2 : Hash_Element_Ptr;
begin
for J in Object.Elmts'Range loop
Ptr1 := Object.Elmts (J).Next;
Free (Object.Elmts (J).Name);
while Ptr1 /= null loop
Ptr2 := Ptr1.Next;
Free (Ptr1.Name);
Free (Ptr1);
Ptr1 := Ptr2;
end loop;
end loop;
end Finalize;
---------
-- Get --
---------
function Get (T : Table; Name : Character) return Value_Type is
begin
return Get (T, String'(1 => Name));
end Get;
function Get (T : Table; Name : VString) return Value_Type is
S : Big_String_Access;
L : Natural;
begin
Get_String (Name, S, L);
return Get (T, S (1 .. L));
end Get;
function Get (T : Table; Name : String) return Value_Type is
Slot : constant Unsigned_32 := Hash (Name) mod T.N + 1;
Elmt : Hash_Element_Ptr := T.Elmts (Slot)'Unrestricted_Access;
begin
if Elmt.Name = null then
return Null_Value;
else
loop
if Name = Elmt.Name.all then
return Elmt.Value;
else
Elmt := Elmt.Next;
if Elmt = null then
return Null_Value;
end if;
end if;
end loop;
end if;
end Get;
-------------
-- Present --
-------------
function Present (T : Table; Name : Character) return Boolean is
begin
return Present (T, String'(1 => Name));
end Present;
function Present (T : Table; Name : VString) return Boolean is
S : Big_String_Access;
L : Natural;
begin
Get_String (Name, S, L);
return Present (T, S (1 .. L));
end Present;
function Present (T : Table; Name : String) return Boolean is
Slot : constant Unsigned_32 := Hash (Name) mod T.N + 1;
Elmt : Hash_Element_Ptr := T.Elmts (Slot)'Unrestricted_Access;
begin
if Elmt.Name = null then
return False;
else
loop
if Name = Elmt.Name.all then
return True;
else
Elmt := Elmt.Next;
if Elmt = null then
return False;
end if;
end if;
end loop;
end if;
end Present;
---------
-- Set --
---------
procedure Set (T : in out Table; Name : VString; Value : Value_Type) is
S : Big_String_Access;
L : Natural;
begin
Get_String (Name, S, L);
Set (T, S (1 .. L), Value);
end Set;
procedure Set (T : in out Table; Name : Character; Value : Value_Type) is
begin
Set (T, String'(1 => Name), Value);
end Set;
procedure Set
(T : in out Table;
Name : String;
Value : Value_Type)
is
begin
if Value = Null_Value then
Delete (T, Name);
else
declare
Slot : constant Unsigned_32 := Hash (Name) mod T.N + 1;
Elmt : Hash_Element_Ptr := T.Elmts (Slot)'Unrestricted_Access;
subtype String1 is String (1 .. Name'Length);
begin
if Elmt.Name = null then
Elmt.Name := new String'(String1 (Name));
Elmt.Value := Value;
return;
else
loop
if Name = Elmt.Name.all then
Elmt.Value := Value;
return;
elsif Elmt.Next = null then
Elmt.Next := new Hash_Element'(
Name => new String'(String1 (Name)),
Value => Value,
Next => null);
return;
else
Elmt := Elmt.Next;
end if;
end loop;
end if;
end;
end if;
end Set;
end Table;
----------
-- Trim --
----------
function Trim (Str : VString) return VString is
begin
return Trim (Str, Right);
end Trim;
function Trim (Str : String) return VString is
begin
for J in reverse Str'Range loop
if Str (J) /= ' ' then
return V (Str (Str'First .. J));
end if;
end loop;
return Nul;
end Trim;
procedure Trim (Str : in out VString) is
begin
Trim (Str, Right);
end Trim;
-------
-- V --
-------
function V (Num : Integer) return VString is
Buf : String (1 .. 30);
Ptr : Natural := Buf'Last + 1;
Val : Natural := abs (Num);
begin
loop
Ptr := Ptr - 1;
Buf (Ptr) := Character'Val (Val mod 10 + Character'Pos ('0'));
Val := Val / 10;
exit when Val = 0;
end loop;
if Num < 0 then
Ptr := Ptr - 1;
Buf (Ptr) := '-';
end if;
return V (Buf (Ptr .. Buf'Last));
end V;
end GNAT.Spitbol;
| 25.546753 | 79 | 0.433684 |
c732499f0f073f7a940b5ee262d7454dd78f0743 | 2,440 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/sem_ch11.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/sem_ch11.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/sem_ch11.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S E M _ C H 1 1 --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2013, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. 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. --
-- --
------------------------------------------------------------------------------
with Types; use Types;
package Sem_Ch11 is
procedure Analyze_Exception_Declaration (N : Node_Id);
procedure Analyze_Handled_Statements (N : Node_Id);
procedure Analyze_Raise_Expression (N : Node_Id);
procedure Analyze_Raise_Statement (N : Node_Id);
procedure Analyze_Raise_xxx_Error (N : Node_Id);
procedure Analyze_Exception_Handlers (L : List_Id);
-- Analyze list of exception handlers of a handled statement sequence
end Sem_Ch11;
| 64.210526 | 78 | 0.429508 |
4b23d69010887bbab81fbee16fd03d2833c7afb9 | 3,966 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/debug_a.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/debug_a.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/debug_a.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- D E B U G _ A --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2007, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains data and subprograms to support the A debug switch
-- that is used to generate output showing what node is being analyzed,
-- resolved, evaluated, or expanded.
with Types; use Types;
package Debug_A is
-- Note: the following subprograms are used in a stack like manner, with
-- an exit call matching each entry call. This means that they can keep
-- track of the current node being worked on, with the entry call setting
-- a new value, by pushing the Node_Id value on a stack, and the exit call
-- popping this value off. Atree.Current_Error_Node is set by both the
-- entry and exit routines to point to the current node so that an abort
-- message indicates the node involved as accurately as possible.
procedure Debug_A_Entry (S : String; N : Node_Id);
pragma Inline (Debug_A_Entry);
-- Generates a message prefixed by a sequence of bars showing the nesting
-- depth (depth increases by 1 for a Debug_A_Entry call and is decreased
-- by the corresponding Debug_A_Exit call). Then the string is output
-- (analyzing, expanding etc), followed by the node number and its kind.
-- This output is generated only if the debug A flag is set. If the debug
-- A flag is not set, then no output is generated. This call also sets the
-- Node_Id value in Atree.Current_Error_Node in case a bomb occurs. This
-- is done unconditionally, whether or not the debug A flag is set.
procedure Debug_A_Exit (S : String; N : Node_Id; Comment : String);
pragma Inline (Debug_A_Exit);
-- Generates the corresponding termination message. The message is preceded
-- by a sequence of bars, followed by the string S, the node number, and
-- a trailing comment (e.g. " (already evaluated)"). This output is
-- generated only if the debug A flag is set. If the debug A flag is not
-- set, then no output is generated. This call also resets the value in
-- Atree.Current_Error_Node to what it was before the corresponding call
-- to Debug_A_Entry.
end Debug_A;
| 61.96875 | 79 | 0.552194 |
1e6d39e65fa150add1b9d349cd5441aef12d6a55 | 8,271 | adb | Ada | src/tk/tk-labelframe.adb | thindil/tashy2 | 43fcbadb33c0062b2c8d6138a8238441dec5fd80 | [
"Apache-2.0"
] | 2 | 2020-12-09T07:27:07.000Z | 2021-10-19T13:31:54.000Z | src/tk/tk-labelframe.adb | thindil/tashy2 | 43fcbadb33c0062b2c8d6138a8238441dec5fd80 | [
"Apache-2.0"
] | null | null | null | src/tk/tk-labelframe.adb | thindil/tashy2 | 43fcbadb33c0062b2c8d6138a8238441dec5fd80 | [
"Apache-2.0"
] | null | null | null | -- Copyright (c) 2021 Bartek thindil Jasicki <[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.Strings.Unbounded; use Ada.Strings.Unbounded;
package body Tk.Labelframe is
function Create
(Path_Name: Tk_Path_String; Options: Label_Frame_Create_Options;
Interpreter: Tcl_Interpreter := Get_Interpreter) return Tk_Label_Frame is
Options_String: Unbounded_String := Null_Unbounded_String;
begin
Option_Image
(Name => "background", Value => Options.Background,
Options_String => Options_String);
Option_Image
(Name => "borderwidth", Value => Options.Border_Width,
Options_String => Options_String);
Option_Image
(Name => "class", Value => Options.Class,
Options_String => Options_String);
Option_Image
(Name => "colormap", Value => Options.Color_Map,
Options_String => Options_String);
Option_Image
(Name => "container", Value => Options.Container,
Options_String => Options_String);
Option_Image
(Name => "cursor", Value => Options.Cursor,
Options_String => Options_String);
Option_Image
(Name => "height", Value => Options.Height,
Options_String => Options_String);
Option_Image
(Name => "highlightbackground", Value => Options.Highlight_Background,
Options_String => Options_String);
Option_Image
(Name => "highlightcolot", Value => Options.Highlight_Color,
Options_String => Options_String);
Option_Image
(Name => "highlighthickness", Value => Options.Highlight_Thickness,
Options_String => Options_String);
Option_Image
(Name => "labelwidget", Value => Options.Label_Widget,
Options_String => Options_String);
Option_Image
(Name => "padx", Value => Options.Pad_X,
Options_String => Options_String);
Option_Image
(Name => "pady", Value => Options.Pad_Y,
Options_String => Options_String);
Option_Image
(Name => "relief", Value => Options.Relief,
Options_String => Options_String);
Option_Image
(Name => "takefocus", Value => Options.Take_Focus,
Options_String => Options_String);
Option_Image
(Name => "text", Value => Options.Text,
Options_String => Options_String);
Option_Image
(Name => "visual", Value => Options.Visual,
Options_String => Options_String);
Option_Image
(Name => "width", Value => Options.Width,
Options_String => Options_String);
Option_Image
(Name => "labelanchor", Value => Options.Label_Anchor,
Options_String => Options_String);
Tcl_Eval
(Tcl_Script =>
"labelframe " & Path_Name & " " &
To_String(Source => Options_String),
Interpreter => Interpreter);
return Get_Widget(Path_Name => Path_Name, Interpreter => Interpreter);
end Create;
procedure Create
(Frame_Widget: out Tk_Label_Frame; Path_Name: Tk_Path_String;
Options: Label_Frame_Create_Options;
Interpreter: Tcl_Interpreter := Get_Interpreter) is
begin
Frame_Widget :=
Create
(Path_Name => Path_Name, Options => Options,
Interpreter => Interpreter);
end Create;
function Get_Options
(Frame_Widget: Tk_Label_Frame) return Label_Frame_Create_Options is
begin
return
Options: Label_Frame_Create_Options :=
Label_Frame_Create_Options'
(Class => Null_Tcl_String, Color_Map => Null_Tcl_String,
Container => NONE, Visual => Null_Tcl_String, others => <>)
do
Options.Background :=
Option_Value(Widgt => Frame_Widget, Name => "background");
Options.Border_Width :=
Option_Value(Widgt => Frame_Widget, Name => "borderwidth");
Options.Class := Option_Value(Widgt => Frame_Widget, Name => "class");
Options.Color_Map :=
Option_Value(Widgt => Frame_Widget, Name => "colormap");
Options.Container :=
Option_Value(Widgt => Frame_Widget, Name => "container");
Options.Cursor :=
Option_Value(Widgt => Frame_Widget, Name => "cursor");
Options.Height :=
Option_Value(Widgt => Frame_Widget, Name => "height");
Options.Highlight_Background :=
Option_Value(Widgt => Frame_Widget, Name => "highlightbackground");
Options.Highlight_Color :=
Option_Value(Widgt => Frame_Widget, Name => "highlightcolor");
Options.Highlight_Thickness :=
Option_Value(Widgt => Frame_Widget, Name => "highlightthickness");
Options.Label_Anchor :=
Option_Value(Widgt => Frame_Widget, Name => "labelanchor");
Options.Label_Widget :=
Option_Value(Widgt => Frame_Widget, Name => "labelwidget");
Options.Pad_X := Option_Value(Widgt => Frame_Widget, Name => "padx");
Options.Pad_Y := Option_Value(Widgt => Frame_Widget, Name => "pady");
Options.Relief :=
Option_Value(Widgt => Frame_Widget, Name => "relief");
Options.Take_Focus :=
Option_Value(Widgt => Frame_Widget, Name => "takefocus");
Options.Text := Option_Value(Widgt => Frame_Widget, Name => "text");
Options.Visual :=
Option_Value(Widgt => Frame_Widget, Name => "visual");
Options.Width := Option_Value(Widgt => Frame_Widget, Name => "width");
end return;
end Get_Options;
overriding procedure Configure
(Frame_Widget: Tk_Label_Frame; Options: Label_Frame_Options) is
Options_String: Unbounded_String := Null_Unbounded_String;
begin
Option_Image
(Name => "background", Value => Options.Background,
Options_String => Options_String);
Option_Image
(Name => "borderwidth", Value => Options.Border_Width,
Options_String => Options_String);
Option_Image
(Name => "cursor", Value => Options.Cursor,
Options_String => Options_String);
Option_Image
(Name => "height", Value => Options.Height,
Options_String => Options_String);
Option_Image
(Name => "highlightbackground", Value => Options.Highlight_Background,
Options_String => Options_String);
Option_Image
(Name => "highlightcolot", Value => Options.Highlight_Color,
Options_String => Options_String);
Option_Image
(Name => "highlighthickness", Value => Options.Highlight_Thickness,
Options_String => Options_String);
Option_Image
(Name => "labelwidget", Value => Options.Label_Widget,
Options_String => Options_String);
Option_Image
(Name => "padx", Value => Options.Pad_X,
Options_String => Options_String);
Option_Image
(Name => "pady", Value => Options.Pad_Y,
Options_String => Options_String);
Option_Image
(Name => "relief", Value => Options.Relief,
Options_String => Options_String);
Option_Image
(Name => "takefocus", Value => Options.Take_Focus,
Options_String => Options_String);
Option_Image
(Name => "text", Value => Options.Text,
Options_String => Options_String);
Option_Image
(Name => "width", Value => Options.Width,
Options_String => Options_String);
Option_Image
(Name => "labelanchor", Value => Options.Label_Anchor,
Options_String => Options_String);
Execute_Widget_Command
(Widgt => Frame_Widget, Command_Name => "configure",
Options => To_String(Source => Options_String));
end Configure;
end Tk.Labelframe;
| 41.355 | 79 | 0.635473 |
388c9d8c2c8c38f6874d27e6f11ae53780b2bb1e | 10,961 | adb | Ada | src/asf-requests-mockup.adb | Letractively/ada-asf | da9f85f85666eba7e23fefea661160863b74154d | [
"Apache-2.0"
] | null | null | null | src/asf-requests-mockup.adb | Letractively/ada-asf | da9f85f85666eba7e23fefea661160863b74154d | [
"Apache-2.0"
] | null | null | null | src/asf-requests-mockup.adb | Letractively/ada-asf | da9f85f85666eba7e23fefea661160863b74154d | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- asf.requests.mockup -- ASF Requests mockup
-- Copyright (C) 2010, 2011, 2012, 2013 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
package body ASF.Requests.Mockup is
function Find (Map : in Util.Strings.Maps.Map;
Name : in String) return String;
-- ------------------------------
-- Find and return the string associated with a key in the map.
-- ------------------------------
function Find (Map : in Util.Strings.Maps.Map;
Name : in String) return String is
Pos : constant Util.Strings.Maps.Cursor := Map.Find (Name);
begin
if Util.Strings.Maps.Has_Element (Pos) then
return Util.Strings.Maps.Element (Pos);
else
return "";
end if;
end Find;
-- ------------------------------
-- Returns the value of a request parameter as a String, or null if the
-- parameter does not exist. Request parameters are extra information sent with
-- the request. For HTTP servlets, parameters are contained in the query string
-- or posted form data.
--
-- You should only use this method when you are sure the parameter has only one
-- value. If the parameter might have more than one value, use
-- Get_Parameter_Values(String).
--
-- If you use this method with a multivalued parameter, the value returned is
-- equal to the first value in the array returned by Get_Parameter_Values.
--
-- If the parameter data was sent in the request body, such as occurs with
-- an HTTP POST request, then reading the body directly via getInputStream()
-- or getReader() can interfere with the execution of this method.
-- ------------------------------
function Get_Parameter (Req : in Request;
Name : in String) return String is
begin
return Find (Req.Parameters, Name);
end Get_Parameter;
-- ------------------------------
-- Iterate over the request parameters and executes the <b>Process</b> procedure.
-- ------------------------------
procedure Iterate_Parameters (Req : in Request;
Process : not null access
procedure (Name : in String;
Value : in String)) is
procedure Process_Wrapper (Position : in Util.Strings.Maps.Cursor);
procedure Process_Wrapper (Position : in Util.Strings.Maps.Cursor) is
begin
Process.all (Name => Util.Strings.Maps.Key (Position),
Value => Util.Strings.Maps.Element (Position));
end Process_Wrapper;
begin
Req.Parameters.Iterate (Process => Process_Wrapper'Access);
end Iterate_Parameters;
-- ------------------------------
-- Set the parameter
-- ------------------------------
procedure Set_Parameter (Req : in out Request;
Name : in String;
Value : in String) is
begin
Req.Parameters.Include (Name, Value);
end Set_Parameter;
-- ------------------------------
-- Returns the name of the HTTP method with which this request was made,
-- for example, GET, POST, or PUT. Same as the value of the CGI variable
-- REQUEST_METHOD.
-- ------------------------------
function Get_Method (Req : in Request) return String is
begin
return To_String (Req.Method);
end Get_Method;
-- ------------------------------
-- Sets the HTTP method.
-- ------------------------------
procedure Set_Method (Req : in out Request;
Method : in String) is
begin
Req.Method := To_Unbounded_String (Method);
end Set_Method;
-- ------------------------------
-- Returns the name and version of the protocol the request uses in the form
-- protocol/majorVersion.minorVersion, for example, HTTP/1.1. For HTTP servlets,
-- the value returned is the same as the value of the CGI variable SERVER_PROTOCOL.
-- ------------------------------
function Get_Protocol (Req : in Request) return String is
begin
return To_String (Req.Protocol);
end Get_Protocol;
-- ------------------------------
-- Sets the protocol version
-- ------------------------------
procedure Set_Protocol (Req : in out Request;
Protocol : in String) is
begin
Req.Protocol := To_Unbounded_String (Protocol);
end Set_Protocol;
-- ------------------------------
-- Returns the part of this request's URL from the protocol name up to the query
-- string in the first line of the HTTP request. The web container does not decode
-- this String. For example:
-- First line of HTTP request Returned Value
-- POST /some/path.html HTTP/1.1 /some/path.html
-- GET http://foo.bar/a.html HTTP/1.0 /a.html
-- HEAD /xyz?a=b HTTP/1.1 /xyz
-- ------------------------------
function Get_Request_URI (Req : in Request) return String is
begin
return To_String (Req.URI);
end Get_Request_URI;
-- ------------------------------
-- Set the request URI.
-- ------------------------------
procedure Set_Request_URI (Req : in out Request;
URI : in String) is
begin
Req.URI := To_Unbounded_String (URI);
end Set_Request_URI;
-- ------------------------------
-- Returns the value of the specified request header as a String. If the request
-- did not include a header of the specified name, this method returns null.
-- If there are multiple headers with the same name, this method returns the
-- first head in the request. The header name is case insensitive. You can use
-- this method with any request header.
-- ------------------------------
function Get_Header (Req : in Request;
Name : in String) return String is
begin
return Find (Req.Headers, Name);
end Get_Header;
-- ------------------------------
-- Sets the header
-- ------------------------------
procedure Set_Header (Req : in out Request;
Name : in String;
Value : in String) is
begin
Req.Headers.Include (Name, Value);
end Set_Header;
-- ------------------------------
-- Returns all the values of the specified request header as an Enumeration
-- of String objects.
--
-- Some headers, such as Accept-Language can be sent by clients as several headers
-- each with a different value rather than sending the header as a comma
-- separated list.
--
-- If the request did not include any headers of the specified name, this method
-- returns an empty Enumeration. The header name is case insensitive. You can use
-- this method with any request header.
-- ------------------------------
function Get_Headers (Req : in Request;
Name : in String) return String is
begin
return Find (Req.Headers, Name);
end Get_Headers;
-- ------------------------------
-- Iterate over the request headers and executes the <b>Process</b> procedure.
-- ------------------------------
procedure Iterate_Headers (Req : in Request;
Process : not null access
procedure (Name : in String;
Value : in String)) is
procedure Process_Wrapper (Position : in Util.Strings.Maps.Cursor);
procedure Process_Wrapper (Position : in Util.Strings.Maps.Cursor) is
begin
Process.all (Name => Util.Strings.Maps.Key (Position),
Value => Util.Strings.Maps.Element (Position));
end Process_Wrapper;
begin
Req.Headers.Iterate (Process => Process_Wrapper'Access);
end Iterate_Headers;
-- ------------------------------
-- Returns the Internet Protocol (IP) address of the client or last proxy that
-- sent the request. For HTTP servlets, same as the value of the CGI variable
-- REMOTE_ADDR.
-- ------------------------------
function Get_Remote_Addr (Req : in Request) return String is
begin
return To_String (Req.Peer);
end Get_Remote_Addr;
-- ------------------------------
-- Sets the peer address
-- ------------------------------
procedure Set_Remote_Addr (Req : in out Request;
Addr : in String) is
begin
Req.Peer := To_Unbounded_String (Addr);
end Set_Remote_Addr;
-- ------------------------------
-- Get the number of parts included in the request.
-- ------------------------------
function Get_Part_Count (Req : in Request) return Natural is
pragma Unreferenced (Req);
begin
return 0;
end Get_Part_Count;
-- ------------------------------
-- Process the part at the given position and executes the <b>Process</b> operation
-- with the part object.
-- ------------------------------
procedure Process_Part (Req : in out Request;
Position : in Positive;
Process : not null access
procedure (Data : in ASF.Parts.Part'Class)) is
begin
null;
end Process_Part;
-- ------------------------------
-- Process the part identifed by <b>Id</b> and executes the <b>Process</b> operation
-- with the part object.
-- ------------------------------
procedure Process_Part (Req : in out Request;
Id : in String;
Process : not null access
procedure (Data : in ASF.Parts.Part'Class)) is
begin
null;
end Process_Part;
-- ------------------------------
-- Set the request cookie by using the cookie returned in the response.
-- ------------------------------
procedure Set_Cookie (Req : in out Request;
From : in ASF.Responses.Mockup.Response'Class) is
C : constant String := From.Get_Header ("Set-Cookie");
begin
Req.Set_Header ("Cookie", C);
end Set_Cookie;
end ASF.Requests.Mockup;
| 39.858182 | 88 | 0.53809 |
1e417f89958032f3c8c0569d5987fbd8d57f2a05 | 3,407 | ads | Ada | 3-mid/impact/source/3d/collision/shapes/impact-d3-shape-concave-static_plane.ads | 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-shape-concave-static_plane.ads | 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-shape-concave-static_plane.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | with impact.d3.Shape.concave,
impact.d3.triangle_Callback;
package impact.d3.Shape.concave.static_plane
--
-- Simulates an infinite non-moving (static) collision plane.
--
is
type Item is new impact.d3.Shape.concave.Item with private;
--- Forge
--
function to_static_plane_Shape (planeNormal : in math.Vector_3;
planeConstant : in math.Real ) return Item;
overriding procedure destruct (Self : in out Item);
--- Attributes
--
-- function localGetSupportingVertex (Self : in Item; vec : in Vector_3) return Vector_3;
-- function localGetSupportingVertexWithoutMargin (Self : in Item; vec : in Vector_3) return Vector_3;
-- procedure batchedUnitVectorGetSupportingVertexWithoutMargin (Self : in Item; vectors : in Vector_3_array;
-- supportVerticesOut : out Vector_3_array;
-- numVectors : in Integer );
overriding procedure getAabb (Self : in Item; t : in Transform_3d;
aabbMin, aabbMax : out Vector_3) ;
--
-- 'getAabb's default implementation is brute force, expected derived classes to implement a fast dedicated version
-- procedure setMargin (Self : in out Item; margin : in Scalar) ;
-- function getMargin (Self : in Item) return Scalar ;
overriding procedure calculateLocalInertia (Self : in Item; mass : in math.Real;
inertia : out math.Vector_3);
overriding function getName (Self : in Item) return String ;
-- function getRadius (Self : in Item) return math.Real;
overriding procedure setLocalScaling (Self : in out Item; scaling : in math.Vector_3);
overriding function getLocalScaling (Self : in Item) return math.Vector_3;
function getPlaneNormal (Self : in Item) return math.Vector_3;
function getPlaneConstant (Self : in Item) return math.Real;
overriding procedure processAllTriangles (Self : in Item; callback : access impact.d3.triangle_Callback.Item'Class;
aabbMin, aabbMax : in math.Vector_3);
private
type Item is new impact.d3.Shape.concave.Item with
record
m_localAabbMin,
m_localAabbMax : math.Vector_3;
m_planeNormal : math.Vector_3;
m_planeConstant : math.Real;
m_localScaling : math.Vector_3;
end record;
end impact.d3.Shape.concave.static_plane;
-- ATTRIBUTE_ALIGNED16(class) impact.d3.Shape.concave.static_plane : public impact.d3.Shape.concave
-- {
-- public:
--
--
-- const impact.d3.Vector& getPlaneNormal() const
-- {
-- return m_planeNormal;
-- }
--
-- const impact.d3.Scalar& getPlaneConstant() const
-- {
-- return m_planeConstant;
-- }
--
-- //debugging
-- virtual const char* getName()const {return "STATICPLANE";}
--
-- };
| 27.475806 | 132 | 0.550631 |
1e690b83b97114453b9cce3c6257c8be68d31a78 | 1,147 | ads | Ada | src/core/util.ads | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | 60 | 2015-01-18T23:05:34.000Z | 2022-03-20T18:56:30.000Z | src/core/util.ads | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | 20 | 2016-09-15T16:41:30.000Z | 2022-03-29T22:02:32.000Z | src/core/util.ads | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | 10 | 2015-02-13T04:00:45.000Z | 2022-03-20T18:57:54.000Z | -----------------------------------------------------------------------
-- util -- Various Utility Packages
-- Copyright (C) 2001, 2002, 2003, 2009, 2010, 2011, 2012, 2013, 2017 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
package Util is
pragma Pure;
-- Library SVN identification
SVN_URL : constant String := "https://ada-util.googlecode.com/svn/trunk";
-- Revision used (must run 'make version' to update)
SVN_REV : constant Positive := 723;
end Util;
| 39.551724 | 86 | 0.626853 |
2ebe40d4d09157423ba6873adda3b6520599afca | 862 | adb | Ada | source/environment/machine-apple-darwin/s-nacoli.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/environment/machine-apple-darwin/s-nacoli.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/environment/machine-apple-darwin/s-nacoli.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | with System.Address_To_Constant_Access_Conversions;
with System.Startup;
with System.Zero_Terminated_Strings;
with C;
package body System.Native_Command_Line is
function Argument_Count return Natural is
begin
return Startup.argc - 1;
end Argument_Count;
function Argument (Number : Natural) return String is
subtype Fixed_char_const_ptr_array is C.char_const_ptr_array (C.size_t);
type char_const_ptr_array_const_ptr is
access constant Fixed_char_const_ptr_array
with Convention => C;
package Conv is
new Address_To_Constant_Access_Conversions (
Fixed_char_const_ptr_array,
char_const_ptr_array_const_ptr);
begin
return Zero_Terminated_Strings.Value (
Conv.To_Pointer (Startup.argv) (C.size_t (Number)));
end Argument;
end System.Native_Command_Line;
| 31.925926 | 78 | 0.743619 |
adf581688586843d04a83eed178d1b5a79acc352 | 6,365 | adb | Ada | oeml-sdk/ada/src/client/-clients.adb | AllSafeCybercurity/coinapi-sdk | 013afdeba75f8ba849cbb8d25245535f483cba76 | [
"MIT"
] | 357 | 2017-05-29T15:09:19.000Z | 2022-03-30T15:34:10.000Z | oeml-sdk/ada/src/client/-clients.adb | AllSafeCybercurity/coinapi-sdk | 013afdeba75f8ba849cbb8d25245535f483cba76 | [
"MIT"
] | 68 | 2017-12-15T15:39:14.000Z | 2022-02-11T11:28:17.000Z | oeml-sdk/ada/src/client/-clients.adb | AllSafeCybercurity/coinapi-sdk | 013afdeba75f8ba849cbb8d25245535f483cba76 | [
"MIT"
] | 199 | 2017-06-01T07:51:14.000Z | 2022-03-25T11:52:28.000Z | -- OEML _ REST API
-- This section will provide necessary information about the `CoinAPI OEML REST API` protocol. <br/> This API is also available in the Postman application: <a href=\"https://postman.coinapi.io/\" target=\"_blank\">https://postman.coinapi.io/</a> <br/><br/> Implemented Standards: * [HTTP1.0](https://datatracker.ietf.org/doc/html/rfc1945) * [HTTP1.1](https://datatracker.ietf.org/doc/html/rfc2616) * [HTTP2.0](https://datatracker.ietf.org/doc/html/rfc7540)
--
-- The version of the OpenAPI document: v1
-- Contact: [email protected]
--
-- NOTE: This package is auto generated by OpenAPI-Generator 5.2.1.
-- https://openapi-generator.tech
-- Do not edit the class manually.
pragma Warnings (Off, "*is not referenced");
with Swagger.Streams;
package body .Clients is
pragma Style_Checks ("-mr");
-- Get balances
-- Get current currency balance from all or single exchange.
procedure V_1Balances_Get
(Client : in out Client_Type;
Exchange_Id : in Swagger.Nullable_UString;
Result : out .Models.Balance_Type_Vectors.Vector) is
URI : Swagger.Clients.URI_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((Swagger.Clients.APPLICATION_JSON,
Swagger.Clients.APPLICTION_JSON));
URI.Add_Param ("exchange_id", Exchange_Id);
URI.Set_Path ("/v1/balances");
Client.Call (Swagger.Clients.GET, URI, Reply);
.Models.Deserialize (Reply, "", Result);
end V_1Balances_Get;
-- Cancel all orders request
-- This request cancels all open orders on single specified exchange.
procedure V_1Orders_Cancel_All_Post
(Client : in out Client_Type;
Order_Cancel_All_Request_Type : in .Models.OrderCancelAllRequest_Type;
Result : out .Models.MessageReject_Type) is
URI : Swagger.Clients.URI_Type;
Req : Swagger.Clients.Request_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((Swagger.Clients.APPLICATION_JSON,
Swagger.Clients.APPLICTION_JSON));
Client.Initialize (Req, (1 => Swagger.Clients.APPLICATION_JSON));
.Models.Serialize (Req.Stream, "", Order_Cancel_All_Request_Type);
URI.Set_Path ("/v1/orders/cancel/all");
Client.Call (Swagger.Clients.POST, URI, Req, Reply);
.Models.Deserialize (Reply, "", Result);
end V_1Orders_Cancel_All_Post;
-- Cancel order request
-- Request cancel for an existing order. The order can be canceled using the `client_order_id` or `exchange_order_id`.
procedure V_1Orders_Cancel_Post
(Client : in out Client_Type;
Order_Cancel_Single_Request_Type : in .Models.OrderCancelSingleRequest_Type;
Result : out .Models.OrderExecutionReport_Type) is
URI : Swagger.Clients.URI_Type;
Req : Swagger.Clients.Request_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((Swagger.Clients.APPLICATION_JSON,
Swagger.Clients.APPLICTION_JSON));
Client.Initialize (Req, (1 => Swagger.Clients.APPLICATION_JSON));
.Models.Serialize (Req.Stream, "", Order_Cancel_Single_Request_Type);
URI.Set_Path ("/v1/orders/cancel");
Client.Call (Swagger.Clients.POST, URI, Req, Reply);
.Models.Deserialize (Reply, "", Result);
end V_1Orders_Cancel_Post;
-- Get open orders
-- Get last execution reports for open orders across all or single exchange.
procedure V_1Orders_Get
(Client : in out Client_Type;
Exchange_Id : in Swagger.Nullable_UString;
Result : out .Models.OrderExecutionReport_Type_Vectors.Vector) is
URI : Swagger.Clients.URI_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((Swagger.Clients.APPLICATION_JSON,
Swagger.Clients.APPLICTION_JSON));
URI.Add_Param ("exchange_id", Exchange_Id);
URI.Set_Path ("/v1/orders");
Client.Call (Swagger.Clients.GET, URI, Reply);
.Models.Deserialize (Reply, "", Result);
end V_1Orders_Get;
-- Send new order
-- This request creating new order for the specific exchange.
procedure V_1Orders_Post
(Client : in out Client_Type;
Order_New_Single_Request_Type : in .Models.OrderNewSingleRequest_Type;
Result : out .Models.OrderExecutionReport_Type) is
URI : Swagger.Clients.URI_Type;
Req : Swagger.Clients.Request_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((Swagger.Clients.APPLICATION_JSON,
Swagger.Clients.APPLICTION_JSON));
Client.Initialize (Req, (1 => Swagger.Clients.APPLICATION_JSON));
.Models.Serialize (Req.Stream, "", Order_New_Single_Request_Type);
URI.Set_Path ("/v1/orders");
Client.Call (Swagger.Clients.POST, URI, Req, Reply);
.Models.Deserialize (Reply, "", Result);
end V_1Orders_Post;
-- Get order execution report
-- Get the last order execution report for the specified order. The requested order does not need to be active or opened.
procedure V_1Orders_Status_Client_Order_Id_Get
(Client : in out Client_Type;
Client_Order_Id : in Swagger.UString;
Result : out .Models.OrderExecutionReport_Type) is
URI : Swagger.Clients.URI_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((1 => Swagger.Clients.APPLICATION_JSON));
URI.Set_Path ("/v1/orders/status/{client_order_id}");
URI.Set_Path_Param ("client_order_id", Client_Order_Id);
Client.Call (Swagger.Clients.GET, URI, Reply);
.Models.Deserialize (Reply, "", Result);
end V_1Orders_Status_Client_Order_Id_Get;
-- Get open positions
-- Get current open positions across all or single exchange.
procedure V_1Positions_Get
(Client : in out Client_Type;
Exchange_Id : in Swagger.Nullable_UString;
Result : out .Models.Position_Type_Vectors.Vector) is
URI : Swagger.Clients.URI_Type;
Reply : Swagger.Value_Type;
begin
Client.Set_Accept ((Swagger.Clients.APPLICATION_JSON,
Swagger.Clients.APPLICTION_JSON));
URI.Add_Param ("exchange_id", Exchange_Id);
URI.Set_Path ("/v1/positions");
Client.Call (Swagger.Clients.GET, URI, Reply);
.Models.Deserialize (Reply, "", Result);
end V_1Positions_Get;
end .Clients;
| 43.29932 | 468 | 0.685467 |
1e83dd1ad4758738d39639a082bdca3548d6096f | 5,282 | ads | Ada | tools/akt-commands.ads | thierr26/ada-keystore | 25099a9df3ce9b48a401148eb1b84442011759a0 | [
"Apache-2.0"
] | null | null | null | tools/akt-commands.ads | thierr26/ada-keystore | 25099a9df3ce9b48a401148eb1b84442011759a0 | [
"Apache-2.0"
] | null | null | null | tools/akt-commands.ads | thierr26/ada-keystore | 25099a9df3ce9b48a401148eb1b84442011759a0 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- akt-commands -- Ada Keystore Tool commands
-- Copyright (C) 2019 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Keystore.Passwords;
with Keystore.Passwords.GPG;
with Util.Commands;
with Keystore;
private with Util.Log.Loggers;
private with Keystore.Files;
private with Keystore.Passwords.Keys;
private with Ada.Finalization;
private with GNAT.Command_Line;
private with GNAT.Strings;
package AKT.Commands is
Error : exception;
subtype Argument_List is Util.Commands.Argument_List;
type Context_Type is limited private;
-- Print the command usage.
procedure Usage (Args : in Argument_List'Class;
Context : in out Context_Type;
Name : in String := "");
-- Open the keystore file using the password password.
-- When `Use_Worker` is set, a workers of N tasks is created and assigned to the keystore
-- for the decryption and encryption process.
procedure Open_Keystore (Context : in out Context_Type;
Args : in Argument_List'Class;
Use_Worker : in Boolean := False);
-- Open the keystore file and change the password.
procedure Change_Password (Context : in out Context_Type;
Args : in Argument_List'Class;
New_Password : in out Keystore.Passwords.Provider'Class;
Config : in Keystore.Wallet_Config;
Mode : in Keystore.Mode_Type);
-- Execute the command with its arguments.
procedure Execute (Name : in String;
Args : in Argument_List'Class;
Context : in out Context_Type);
procedure Parse (Context : in out Context_Type;
Arguments : out Util.Commands.Dynamic_Argument_List);
procedure Parse_Range (Value : in String;
Config : in out Keystore.Wallet_Config);
-- Get the keystore file path.
function Get_Keystore_Path (Context : in out Context_Type;
Args : in Argument_List'Class) return String;
private
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("AKT.Commands");
package GC renames GNAT.Command_Line;
procedure Initialize (Context : in out Keystore.Passwords.GPG.Context_Type);
type Context_Type is limited new Ada.Finalization.Limited_Controlled with record
Wallet : Keystore.Files.Wallet_File;
Info : Keystore.Wallet_Info;
Config : Keystore.Wallet_Config := Keystore.Secure_Config;
Workers : Keystore.Task_Manager_Access;
Provider : Keystore.Passwords.Provider_Access;
Key_Provider : Keystore.Passwords.Keys.Key_Provider_Access;
Slot : Keystore.Key_Slot;
Worker_Count : aliased Integer := 1;
Version : aliased Boolean := False;
Verbose : aliased Boolean := False;
Debug : aliased Boolean := False;
Dump : aliased Boolean := False;
Zero : aliased Boolean := False;
Config_File : aliased GNAT.Strings.String_Access;
Wallet_File : aliased GNAT.Strings.String_Access;
Data_Path : aliased GNAT.Strings.String_Access;
Wallet_Key_File : aliased GNAT.Strings.String_Access;
Password_File : aliased GNAT.Strings.String_Access;
Password_Env : aliased GNAT.Strings.String_Access;
Unsafe_Password : aliased GNAT.Strings.String_Access;
Password_Socket : aliased GNAT.Strings.String_Access;
Password_Command : aliased GNAT.Strings.String_Access;
Password_Askpass : aliased Boolean := False;
No_Password_Opt : Boolean := False;
Command_Config : GC.Command_Line_Configuration;
First_Arg : Positive := 1;
GPG : Keystore.Passwords.GPG.Context_Type;
end record;
-- Initialize the commands.
overriding
procedure Initialize (Context : in out Context_Type);
overriding
procedure Finalize (Context : in out Context_Type);
procedure Setup_Password_Provider (Context : in out Context_Type);
procedure Setup_Key_Provider (Context : in out Context_Type);
-- Setup the command before parsing the arguments and executing it.
procedure Setup (Config : in out GC.Command_Line_Configuration;
Context : in out Context_Type);
end AKT.Commands;
| 42.596774 | 93 | 0.633094 |
389dc3a00a1c3c5c1767e881e0fe48d2ba7652be | 8,038 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/i-pacdec.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/i-pacdec.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/i-pacdec.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- I N T E R F A C E S . P A C K E D _ D E C I M A L --
-- --
-- S p e c --
-- (Version for IBM Mainframe Packed Decimal Format) --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This unit defines the packed decimal format used by GNAT in response to
-- a specification of Machine_Radix 10 for a decimal fixed-point type. The
-- format and operations are completely encapsulated in this unit, so all
-- that is necessary to compile using different packed decimal formats is
-- to replace this single unit.
-- Note that the compiler access the spec of this unit during compilation
-- to obtain the data length that needs allocating, so the correct version
-- of the spec must be available to the compiler, and must correspond to
-- the spec and body made available to the linker, and all units of a given
-- program must be compiled with the same version of the spec and body.
-- This consistency will be enforced automatically using the normal binder
-- consistency checking, since any unit declaring Machine_Radix 10 types or
-- containing operations on such data will implicitly with Packed_Decimal.
with System;
package Interfaces.Packed_Decimal is
------------------------
-- Format Description --
------------------------
-- IBM Mainframe packed decimal format uses a byte string of length one
-- to 10 bytes, with the most significant byte first. Each byte contains
-- two decimal digits (with the high order digit in the left nibble, and
-- the low order four bits contain the sign, using the following code:
-- 16#A# 2#1010# positive
-- 16#B# 2#1011# negative
-- 16#C# 2#1100# positive (preferred representation)
-- 16#D# 2#1101# negative (preferred representation)
-- 16#E# 2#1110# positive
-- 16#F# 2#1011# positive
-- In this package, all six sign representations are interpreted as
-- shown above when an operand is read, when an operand is written,
-- the preferred representations are always used. Constraint_Error
-- is raised if any other bit pattern is found in the sign nibble,
-- or if a digit nibble contains an invalid digit code.
-- Some examples follow:
-- 05 76 3C +5763
-- 00 01 1D -11
-- 00 04 4E +44 (non-standard sign)
-- 00 00 00 invalid (incorrect sign nibble)
-- 0A 01 1C invalid (bad digit)
------------------
-- Length Array --
------------------
-- The following array must be declared in exactly the form shown, since
-- the compiler accesses the associated tree to determine the size to be
-- allocated to a machine radix 10 type, depending on the number of digits.
subtype Byte_Length is Positive range 1 .. 10;
-- Range of possible byte lengths
Packed_Size : constant array (1 .. 18) of Byte_Length :=
(01 => 01, -- Length in bytes for digits 1
02 => 02, -- Length in bytes for digits 2
03 => 02, -- Length in bytes for digits 2
04 => 03, -- Length in bytes for digits 2
05 => 03, -- Length in bytes for digits 2
06 => 04, -- Length in bytes for digits 2
07 => 04, -- Length in bytes for digits 2
08 => 05, -- Length in bytes for digits 2
09 => 05, -- Length in bytes for digits 2
10 => 06, -- Length in bytes for digits 2
11 => 06, -- Length in bytes for digits 2
12 => 07, -- Length in bytes for digits 2
13 => 07, -- Length in bytes for digits 2
14 => 08, -- Length in bytes for digits 2
15 => 08, -- Length in bytes for digits 2
16 => 09, -- Length in bytes for digits 2
17 => 09, -- Length in bytes for digits 2
18 => 10); -- Length in bytes for digits 2
-------------------------
-- Conversion Routines --
-------------------------
subtype D32 is Positive range 1 .. 9;
-- Used to represent number of digits in a packed decimal value that
-- can be represented in a 32-bit binary signed integer form.
subtype D64 is Positive range 10 .. 18;
-- Used to represent number of digits in a packed decimal value that
-- requires a 64-bit signed binary integer for representing all values.
function Packed_To_Int32 (P : System.Address; D : D32) return Integer_32;
-- The argument P is the address of a packed decimal value and D is the
-- number of digits (in the range 1 .. 9, as implied by the subtype).
-- The returned result is the corresponding signed binary value. The
-- exception Constraint_Error is raised if the input is invalid.
function Packed_To_Int64 (P : System.Address; D : D64) return Integer_64;
-- The argument P is the address of a packed decimal value and D is the
-- number of digits (in the range 10 .. 18, as implied by the subtype).
-- The returned result is the corresponding signed binary value. The
-- exception Constraint_Error is raised if the input is invalid.
procedure Int32_To_Packed (V : Integer_32; P : System.Address; D : D32);
-- The argument V is a signed binary integer, which is converted to
-- packed decimal format and stored using P, the address of a packed
-- decimal item of D digits (D is in the range 1-9). Constraint_Error
-- is raised if V is out of range of this number of digits.
procedure Int64_To_Packed (V : Integer_64; P : System.Address; D : D64);
-- The argument V is a signed binary integer, which is converted to
-- packed decimal format and stored using P, the address of a packed
-- decimal item of D digits (D is in the range 10-18). Constraint_Error
-- is raised if V is out of range of this number of digits.
end Interfaces.Packed_Decimal;
| 53.586667 | 79 | 0.56743 |
1ea4d30dd9f6093a28b0adcc19074846f754798f | 20,132 | adb | Ada | src/natools-s_expressions-parsers.adb | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | src/natools-s_expressions-parsers.adb | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | src/natools-s_expressions-parsers.adb | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | ------------------------------------------------------------------------------
-- Copyright (c) 2013-2014, Natacha Porté --
-- --
-- Permission to use, copy, modify, and distribute this software for any --
-- purpose with or without fee is hereby granted, provided that the above --
-- copyright notice and this permission notice appear in all copies. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES --
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF --
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR --
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES --
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN --
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF --
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. --
------------------------------------------------------------------------------
with Natools.S_Expressions.Encodings;
package body Natools.S_Expressions.Parsers is
----------------------
-- Parser Interface --
----------------------
procedure Reset (Self : in out Parser; Hard : in Boolean := False) is
Null_Stack : Lockable.Lock_Stack;
begin
Self.Internal := (State => Waiting);
Self.Next_Event := Events.End_Of_Input;
Self.Latest := Events.Error;
Self.Level := 0;
Self.Lock_Stack := Null_Stack;
Self.Locked := False;
if Hard then
Self.Pending.Hard_Reset;
Self.Buffer.Hard_Reset;
else
Self.Pending.Soft_Reset;
Self.Buffer.Soft_Reset;
end if;
end Reset;
overriding function Current_Event (Self : in Parser) return Events.Event is
begin
if Self.Locked then
return Events.End_Of_Input;
else
return Self.Latest;
end if;
end Current_Event;
overriding function Current_Atom (Self : in Parser) return Atom is
begin
if Self.Locked or Self.Latest /= Events.Add_Atom then
raise Program_Error;
end if;
return Self.Buffer.Data;
end Current_Atom;
overriding function Current_Level (Self : in Parser) return Natural is
begin
if Self.Locked then
return 0;
else
return Self.Level - Lockable.Current_Level (Self.Lock_Stack);
end if;
end Current_Level;
overriding procedure Query_Atom
(Self : in Parser;
Process : not null access procedure (Data : in Atom)) is
begin
if Self.Locked or Self.Latest /= Events.Add_Atom then
raise Program_Error;
end if;
Self.Buffer.Query (Process);
end Query_Atom;
overriding procedure Read_Atom
(Self : in Parser;
Data : out Atom;
Length : out Count) is
begin
if Self.Locked or Self.Latest /= Events.Add_Atom then
raise Program_Error;
end if;
Self.Buffer.Peek (Data, Length);
end Read_Atom;
overriding procedure Next
(Self : in out Parser;
Event : out Events.Event)
is
O : Octet;
begin
if Self.Locked then
Event := Events.End_Of_Input;
return;
end if;
Self.Latest := Events.Error;
loop
-- Process pending events
if Self.Next_Event /= Events.End_Of_Input then
Self.Latest := Self.Next_Event;
Self.Next_Event := Events.End_Of_Input;
case Self.Latest is
when Events.Open_List =>
Self.Level := Self.Level + 1;
when Events.Close_List =>
if Self.Level > 0 then
Self.Level := Self.Level - 1;
end if;
when others => null;
end case;
exit;
end if;
-- Read a single octet from source
if Self.Pending.Length = 0 then
Read_More (Parser'Class (Self), Self.Pending);
if Self.Pending.Length = 0 then
Self.Latest := Events.End_Of_Input;
exit;
end if;
Self.Pending.Invert;
end if;
Self.Pending.Pop (O);
-- Process octet
case Self.Internal.State is
when Waiting =>
Self.Buffer.Soft_Reset;
case O is
when 0 | Encodings.Space | Encodings.HT
| Encodings.CR | Encodings.LF
| Encodings.VT | Encodings.FF =>
null;
when Encodings.List_Begin =>
Self.Latest := Events.Open_List;
Self.Level := Self.Level + 1;
when Encodings.List_End =>
Self.Latest := Events.Close_List;
if Self.Level > 0 then
Self.Level := Self.Level - 1;
end if;
when Encodings.Base64_Atom_Begin =>
Self.Internal
:= (State => Base64_Atom,
Chunk => (Data => <>, Length => 0));
when Encodings.Base64_Expr_Begin =>
Self.Internal
:= (State => Base64_Expr,
Chunk => (Data => <>, Length => 0));
when Encodings.Hex_Atom_Begin =>
Self.Internal := (State => Hex_Atom, Nibble_Buffer => 0);
when Encodings.Quoted_Atom_Begin =>
Self.Internal :=
(State => Quoted_Atom,
Escape => (Data => <>, Length => 0));
when Encodings.Digit_0 .. Encodings.Digit_9 =>
Self.Internal := (State => Number);
Atom_Buffers.Append (Self.Buffer, O);
when others =>
Self.Internal := (State => Token);
Atom_Buffers.Append (Self.Buffer, O);
end case;
when Base64_Atom | Base64_Expr =>
if Encodings.Is_Base64_Digit (O) then
Self.Internal.Chunk.Data (Self.Internal.Chunk.Length) := O;
Self.Internal.Chunk.Length := Self.Internal.Chunk.Length + 1;
if Self.Internal.Chunk.Length = 4 then
Self.Buffer.Append
(Encodings.Decode_Base64 (Self.Internal.Chunk.Data));
Self.Internal.Chunk.Length := 0;
end if;
elsif (O = Encodings.Base64_Atom_End
and Self.Internal.State = Base64_Atom)
or (O = Encodings.Base64_Expr_End
and Self.Internal.State = Base64_Expr)
then
Self.Buffer.Append (Encodings.Decode_Base64
(Self.Internal.Chunk.Data
(0 .. Self.Internal.Chunk.Length - 1)));
if Self.Internal.State = Base64_Atom then
Self.Latest := Events.Add_Atom;
else
Self.Pending.Append_Reverse (Self.Buffer.Data);
Self.Buffer.Soft_Reset;
end if;
Self.Internal := (State => Waiting);
end if;
when Hex_Atom =>
if Encodings.Is_Hex_Digit (O) then
if Encodings.Is_Hex_Digit (Self.Internal.Nibble_Buffer) then
Self.Buffer.Append
(Encodings.Decode_Hex (Self.Internal.Nibble_Buffer, O));
Self.Internal.Nibble_Buffer := 0;
else
Self.Internal.Nibble_Buffer := O;
end if;
elsif O = Encodings.Hex_Atom_End then
Self.Latest := Events.Add_Atom;
Self.Internal := (State => Waiting);
end if;
when Number =>
case O is
when Encodings.Digit_0 .. Encodings.Digit_9 =>
Self.Buffer.Append (O);
when Encodings.Verbatim_Begin =>
Self.Internal := (State => Verbatim_Atom, Size => 0);
for I in 1 .. Self.Buffer.Length loop
Self.Internal.Size := Self.Internal.Size * 10
+ Count (Self.Buffer.Element (I)
- Encodings.Digit_0);
end loop;
Self.Buffer.Soft_Reset;
if Self.Internal.Size = 0 then
Self.Latest := Events.Add_Atom;
Self.Internal := (State => Waiting);
else
Self.Buffer.Preallocate (Self.Internal.Size);
end if;
when 0 | Encodings.Space | Encodings.HT
| Encodings.CR | Encodings.LF
| Encodings.VT | Encodings.FF =>
Self.Latest := Events.Add_Atom;
Self.Internal := (State => Waiting);
when Encodings.List_Begin =>
Self.Internal := (State => Waiting);
Self.Next_Event := Events.Open_List;
Self.Latest := Events.Add_Atom;
when Encodings.List_End =>
Self.Internal := (State => Waiting);
Self.Next_Event := Events.Close_List;
Self.Latest := Events.Add_Atom;
when Encodings.Base64_Atom_Begin =>
Self.Internal
:= (State => Base64_Atom,
Chunk => (Data => <>, Length => 0));
Self.Buffer.Soft_Reset;
when Encodings.Base64_Expr_Begin =>
Self.Internal
:= (State => Base64_Expr,
Chunk => (Data => <>, Length => 0));
Self.Buffer.Soft_Reset;
when Encodings.Hex_Atom_Begin =>
Self.Internal := (State => Hex_Atom, Nibble_Buffer => 0);
Self.Buffer.Soft_Reset;
when Encodings.Quoted_Atom_Begin =>
Self.Internal
:= (State => Quoted_Atom,
Escape => (Data => <>, Length => 0));
Self.Buffer.Soft_Reset;
when others =>
Self.Buffer.Append (O);
Self.Internal := (State => Token);
end case;
when Quoted_Atom =>
case Self.Internal.Escape.Length is
when 0 =>
case O is
when Encodings.Escape =>
Self.Internal.Escape.Data (0) := O;
Self.Internal.Escape.Length := 1;
when Encodings.Quoted_Atom_End =>
Self.Internal := (State => Waiting);
Self.Latest := Events.Add_Atom;
when others =>
Self.Buffer.Append (O);
end case;
when 1 =>
case O is
when Character'Pos ('b') =>
Self.Buffer.Append (8);
Self.Internal.Escape.Length := 0;
when Character'Pos ('t') =>
Self.Buffer.Append (9);
Self.Internal.Escape.Length := 0;
when Character'Pos ('n') =>
Self.Buffer.Append (10);
Self.Internal.Escape.Length := 0;
when Character'Pos ('v') =>
Self.Buffer.Append (11);
Self.Internal.Escape.Length := 0;
when Character'Pos ('f') =>
Self.Buffer.Append (12);
Self.Internal.Escape.Length := 0;
when Character'Pos ('r') =>
Self.Buffer.Append (13);
Self.Internal.Escape.Length := 0;
when Character'Pos (''') | Encodings.Escape
| Encodings.Quoted_Atom_End =>
Self.Buffer.Append (O);
Self.Internal.Escape.Length := 0;
when Encodings.Digit_0 .. Encodings.Digit_0 + 3
| Character'Pos ('x')
| Encodings.CR | Encodings.LF =>
Self.Internal.Escape.Data (1) := O;
Self.Internal.Escape.Length := 2;
when others =>
Self.Buffer.Append (Self.Internal.Escape.Data (0));
Self.Pending.Append (O);
Self.Internal.Escape.Length := 0;
end case;
when 2 =>
if (Self.Internal.Escape.Data (1)
in Encodings.Digit_0 .. Encodings.Digit_0 + 3
and O in Encodings.Digit_0 .. Encodings.Digit_0 + 7)
or (Self.Internal.Escape.Data (1) = Character'Pos ('x')
and then Encodings.Is_Hex_Digit (O))
then
Self.Internal.Escape.Data (2) := O;
Self.Internal.Escape.Length := 3;
elsif Self.Internal.Escape.Data (1) = Encodings.CR
or Self.Internal.Escape.Data (1) = Encodings.LF
then
Self.Internal.Escape.Length := 0;
if not ((O = Encodings.CR or O = Encodings.LF)
and O /= Self.Internal.Escape.Data (1))
then
Self.Pending.Append (O);
end if;
else
Self.Buffer.Append
((Self.Internal.Escape.Data (0),
Self.Internal.Escape.Data (1)));
Self.Pending.Append (O);
Self.Internal.Escape.Length := 0;
end if;
when 3 =>
if Self.Internal.Escape.Data (1)
= Character'Pos ('x')
then
if Encodings.Is_Hex_Digit (O) then
Self.Buffer.Append
(Encodings.Decode_Hex
(Self.Internal.Escape.Data (2), O));
else
Self.Buffer.Append
((Self.Internal.Escape.Data (0),
Self.Internal.Escape.Data (1),
Self.Internal.Escape.Data (2)));
Self.Pending.Append (O);
end if;
else
pragma Assert (Self.Internal.Escape.Data (1)
in Encodings.Digit_0 .. Encodings.Digit_0 + 3);
if O in Encodings.Digit_0 .. Encodings.Digit_0 + 7 then
Atom_Buffers.Append
(Self.Buffer,
(Self.Internal.Escape.Data (1)
- Encodings.Digit_0)
* 2**6 +
(Self.Internal.Escape.Data (2)
- Encodings.Digit_0)
* 2**3 +
(O - Encodings.Digit_0));
else
Self.Buffer.Append
((Self.Internal.Escape.Data (0),
Self.Internal.Escape.Data (1),
Self.Internal.Escape.Data (2)));
Self.Pending.Append (O);
end if;
end if;
Self.Internal.Escape.Length := 0;
when 4 =>
raise Program_Error;
end case;
when Token =>
case O is
when 0 | Encodings.Space | Encodings.HT
| Encodings.CR | Encodings.LF
| Encodings.VT | Encodings.FF =>
Self.Internal := (State => Waiting);
Self.Latest := Events.Add_Atom;
when Encodings.List_Begin =>
Self.Internal := (State => Waiting);
Self.Next_Event := Events.Open_List;
Self.Latest := Events.Add_Atom;
when Encodings.List_End =>
Self.Internal := (State => Waiting);
Self.Next_Event := Events.Close_List;
Self.Latest := Events.Add_Atom;
when others =>
Self.Buffer.Append (O);
end case;
when Verbatim_Atom =>
Self.Buffer.Append (O);
pragma Assert (Self.Buffer.Length <= Self.Internal.Size);
if Self.Buffer.Length = Self.Internal.Size then
Self.Internal := (State => Waiting);
Self.Latest := Events.Add_Atom;
end if;
end case;
exit when Self.Latest /= Events.Error;
end loop;
if Self.Latest = Events.Close_List
and then Self.Level < Lockable.Current_Level (Self.Lock_Stack)
then
Self.Locked := True;
Event := Events.End_Of_Input;
else
Event := Self.Latest;
end if;
end Next;
overriding procedure Lock
(Self : in out Parser;
State : out Lockable.Lock_State) is
begin
Lockable.Push_Level (Self.Lock_Stack, Self.Level, State);
end Lock;
overriding procedure Unlock
(Self : in out Parser;
State : in out Lockable.Lock_State;
Finish : in Boolean := True)
is
Previous_Level : constant Natural
:= Lockable.Current_Level (Self.Lock_Stack);
Event : Events.Event;
begin
Lockable.Pop_Level (Self.Lock_Stack, State);
State := Lockable.Null_State;
if Finish then
Event := Self.Current_Event;
loop
case Event is
when Events.Open_List | Events.Add_Atom =>
null;
when Events.Close_List =>
exit when Self.Level < Previous_Level;
when Events.Error | Events.End_Of_Input =>
exit;
end case;
Self.Next (Event);
end loop;
end if;
Self.Locked := Self.Level < Lockable.Current_Level (Self.Lock_Stack);
end Unlock;
-------------------
-- Stream Parser --
-------------------
overriding procedure Read_More
(Self : in out Stream_Parser;
Buffer : out Atom_Buffers.Atom_Buffer)
is
Item : Ada.Streams.Stream_Element_Array (1 .. 128);
Last : Ada.Streams.Stream_Element_Offset;
begin
Self.Input.Read (Item, Last);
if Last in Item'Range then
Buffer.Append (Item (Item'First .. Last));
end if;
end Read_More;
-------------------
-- Memory Parser --
-------------------
not overriding function Create
(Data : in Ada.Streams.Stream_Element_Array)
return Memory_Parser is
begin
return P : Memory_Parser do
P.Pending.Append (Data);
P.Pending.Invert;
end return;
end Create;
not overriding function Create_From_String
(Data : in String) return Memory_Parser is
begin
return Create (To_Atom (Data));
end Create_From_String;
end Natools.S_Expressions.Parsers;
| 38.419847 | 79 | 0.460461 |
38be55fa655af501a07002dceb3df0b8a9c27076 | 8,867 | adb | Ada | llvm-gcc-4.2-2.9/gcc/ada/a-tiinau.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/a-tiinau.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/a-tiinau.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . T E X T _ I O . I N T E G E R _ A U X --
-- --
-- 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. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Text_IO.Generic_Aux; use Ada.Text_IO.Generic_Aux;
with System.Img_BIU; use System.Img_BIU;
with System.Img_Int; use System.Img_Int;
with System.Img_LLB; use System.Img_LLB;
with System.Img_LLI; use System.Img_LLI;
with System.Img_LLW; use System.Img_LLW;
with System.Img_WIU; use System.Img_WIU;
with System.Val_Int; use System.Val_Int;
with System.Val_LLI; use System.Val_LLI;
package body Ada.Text_IO.Integer_Aux is
-----------------------
-- Local Subprograms --
-----------------------
procedure Load_Integer
(File : File_Type;
Buf : out String;
Ptr : in out Natural);
-- This is an auxiliary routine that is used to load a possibly signed
-- integer literal value from the input file into Buf, starting at Ptr + 1.
-- On return, Ptr is set to the last character stored.
-------------
-- Get_Int --
-------------
procedure Get_Int
(File : File_Type;
Item : out Integer;
Width : Field)
is
Buf : String (1 .. Field'Last);
Ptr : aliased Integer := 1;
Stop : Integer := 0;
begin
if Width /= 0 then
Load_Width (File, Width, Buf, Stop);
String_Skip (Buf, Ptr);
else
Load_Integer (File, Buf, Stop);
end if;
Item := Scan_Integer (Buf, Ptr'Access, Stop);
Check_End_Of_Field (Buf, Stop, Ptr, Width);
end Get_Int;
-------------
-- Get_LLI --
-------------
procedure Get_LLI
(File : File_Type;
Item : out Long_Long_Integer;
Width : Field)
is
Buf : String (1 .. Field'Last);
Ptr : aliased Integer := 1;
Stop : Integer := 0;
begin
if Width /= 0 then
Load_Width (File, Width, Buf, Stop);
String_Skip (Buf, Ptr);
else
Load_Integer (File, Buf, Stop);
end if;
Item := Scan_Long_Long_Integer (Buf, Ptr'Access, Stop);
Check_End_Of_Field (Buf, Stop, Ptr, Width);
end Get_LLI;
--------------
-- Gets_Int --
--------------
procedure Gets_Int
(From : String;
Item : out Integer;
Last : out Positive)
is
Pos : aliased Integer;
begin
String_Skip (From, Pos);
Item := Scan_Integer (From, Pos'Access, From'Last);
Last := Pos - 1;
exception
when Constraint_Error =>
raise Data_Error;
end Gets_Int;
--------------
-- Gets_LLI --
--------------
procedure Gets_LLI
(From : String;
Item : out Long_Long_Integer;
Last : out Positive)
is
Pos : aliased Integer;
begin
String_Skip (From, Pos);
Item := Scan_Long_Long_Integer (From, Pos'Access, From'Last);
Last := Pos - 1;
exception
when Constraint_Error =>
raise Data_Error;
end Gets_LLI;
------------------
-- Load_Integer --
------------------
procedure Load_Integer
(File : File_Type;
Buf : out String;
Ptr : in out Natural)
is
Hash_Loc : Natural;
Loaded : Boolean;
begin
Load_Skip (File);
Load (File, Buf, Ptr, '+', '-');
Load_Digits (File, Buf, Ptr, Loaded);
if Loaded then
-- Deal with based literal (note : is ok replacement for #)
Load (File, Buf, Ptr, '#', ':', Loaded);
if Loaded then
Hash_Loc := Ptr;
Load_Extended_Digits (File, Buf, Ptr);
Load (File, Buf, Ptr, Buf (Hash_Loc));
end if;
-- Deal with exponent
Load (File, Buf, Ptr, 'E', 'e', Loaded);
if Loaded then
-- Note: it is strange to allow a minus sign, since the syntax
-- does not, but that is what ACVC test CE3704F, case (6) wants.
Load (File, Buf, Ptr, '+', '-');
Load_Digits (File, Buf, Ptr);
end if;
end if;
end Load_Integer;
-------------
-- Put_Int --
-------------
procedure Put_Int
(File : File_Type;
Item : Integer;
Width : Field;
Base : Number_Base)
is
Buf : String (1 .. Integer'Max (Field'Last, Width));
Ptr : Natural := 0;
begin
if Base = 10 and then Width = 0 then
Set_Image_Integer (Item, Buf, Ptr);
elsif Base = 10 then
Set_Image_Width_Integer (Item, Width, Buf, Ptr);
else
Set_Image_Based_Integer (Item, Base, Width, Buf, Ptr);
end if;
Put_Item (File, Buf (1 .. Ptr));
end Put_Int;
-------------
-- Put_LLI --
-------------
procedure Put_LLI
(File : File_Type;
Item : Long_Long_Integer;
Width : Field;
Base : Number_Base)
is
Buf : String (1 .. Integer'Max (Field'Last, Width));
Ptr : Natural := 0;
begin
if Base = 10 and then Width = 0 then
Set_Image_Long_Long_Integer (Item, Buf, Ptr);
elsif Base = 10 then
Set_Image_Width_Long_Long_Integer (Item, Width, Buf, Ptr);
else
Set_Image_Based_Long_Long_Integer (Item, Base, Width, Buf, Ptr);
end if;
Put_Item (File, Buf (1 .. Ptr));
end Put_LLI;
--------------
-- Puts_Int --
--------------
procedure Puts_Int
(To : out String;
Item : Integer;
Base : Number_Base)
is
Buf : String (1 .. Integer'Max (Field'Last, To'Length));
Ptr : Natural := 0;
begin
if Base = 10 then
Set_Image_Width_Integer (Item, To'Length, Buf, Ptr);
else
Set_Image_Based_Integer (Item, Base, To'Length, Buf, Ptr);
end if;
if Ptr > To'Length then
raise Layout_Error;
else
To (To'First .. To'First + Ptr - 1) := Buf (1 .. Ptr);
end if;
end Puts_Int;
--------------
-- Puts_LLI --
--------------
procedure Puts_LLI
(To : out String;
Item : Long_Long_Integer;
Base : Number_Base)
is
Buf : String (1 .. Integer'Max (Field'Last, To'Length));
Ptr : Natural := 0;
begin
if Base = 10 then
Set_Image_Width_Long_Long_Integer (Item, To'Length, Buf, Ptr);
else
Set_Image_Based_Long_Long_Integer (Item, Base, To'Length, Buf, Ptr);
end if;
if Ptr > To'Length then
raise Layout_Error;
else
To (To'First .. To'First + Ptr - 1) := Buf (1 .. Ptr);
end if;
end Puts_LLI;
end Ada.Text_IO.Integer_Aux;
| 29.655518 | 79 | 0.50344 |
38e01898d51be7962983b2f9a33fc9e3ce1e49fa | 227 | ads | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/specs/renaming2_pkg2.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/renaming2_pkg2.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/specs/renaming2_pkg2.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | package Renaming2_Pkg2 is
type Root is private;
private
type Root (D : Boolean := False) is record
case D is
when True => N : Natural;
when False => null;
end case;
end record;
end Renaming2_Pkg2;
| 15.133333 | 44 | 0.638767 |
38873e41174d8562350f3ac4ae0757358df690a4 | 555 | adb | Ada | bead/bead2/2/Garden_Pkg.adb | balintsoos/LearnAda | 9d2fc76209f6e15b4fa91b4b39107ae6cc7e7114 | [
"MIT"
] | null | null | null | bead/bead2/2/Garden_Pkg.adb | balintsoos/LearnAda | 9d2fc76209f6e15b4fa91b4b39107ae6cc7e7114 | [
"MIT"
] | null | null | null | bead/bead2/2/Garden_Pkg.adb | balintsoos/LearnAda | 9d2fc76209f6e15b4fa91b4b39107ae6cc7e7114 | [
"MIT"
] | 1 | 2021-07-16T16:15:11.000Z | 2021-07-16T16:15:11.000Z | with Ada.Text_IO, tools;
use Ada.Text_IO;
package body Garden_Pkg is
package Position_Generator is new tools.Random_Generator(Position);
function GetRandPos return Position is
begin
return Position_Generator.GetRandom;
end GetRandPos;
function GetField(pos : Position) return Boolean is
begin
return Garden(pos);
end GetField;
procedure SprayField(pos : Position) is
begin
Garden(pos) := true;
end SprayField;
procedure SprayAbsorbed is
begin
Garden := (1..10 => false);
end SprayAbsorbed;
end Garden_Pkg;
| 19.137931 | 69 | 0.733333 |
2e419e6bd31dbc4448c9433d2f64759f8a646f12 | 89 | ads | Ada | tests/nonsmoke/functional/CompileTests/experimental_ada_tests/tests/function_body_stub.ads | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | 488 | 2015-01-09T08:54:48.000Z | 2022-03-30T07:15:46.000Z | tests/nonsmoke/functional/CompileTests/experimental_ada_tests/tests/function_body_stub.ads | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | 174 | 2015-01-28T18:41:32.000Z | 2022-03-31T16:51:05.000Z | tests/nonsmoke/functional/CompileTests/experimental_ada_tests/tests/function_body_stub.ads | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | 146 | 2015-04-27T02:48:34.000Z | 2022-03-04T07:32:53.000Z | package function_body_stub is
function Inner return integer;
end function_body_stub;
| 22.25 | 34 | 0.831461 |
0470c3b5a012c4fbeea10b68ee731e09f4f16a15 | 1,232 | adb | Ada | src/tools/Rejuvenation_Find_And_Replace/src/rejuvenation_find_and_replace.adb | selroc/Renaissance-Ada | 39230b34aced4a9d83831be346ca103136c53715 | [
"BSD-3-Clause"
] | 1 | 2022-03-08T13:00:47.000Z | 2022-03-08T13:00:47.000Z | src/tools/Rejuvenation_Find_And_Replace/src/rejuvenation_find_and_replace.adb | selroc/Renaissance-Ada | 39230b34aced4a9d83831be346ca103136c53715 | [
"BSD-3-Clause"
] | null | null | null | src/tools/Rejuvenation_Find_And_Replace/src/rejuvenation_find_and_replace.adb | selroc/Renaissance-Ada | 39230b34aced4a9d83831be346ca103136c53715 | [
"BSD-3-Clause"
] | null | null | null | with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Ada.Text_IO; use Ada.Text_IO;
with Libadalang.Common; use Libadalang.Common;
with Rejuvenation; use Rejuvenation;
with Rejuvenation.Find_And_Replacer; use Rejuvenation.Find_And_Replacer;
with Rejuvenation.Patterns; use Rejuvenation.Patterns;
with Rejuvenation.Simple_Factory; use Rejuvenation.Simple_Factory;
procedure Rejuvenation_Find_And_Replace is
Find_Pattern : constant Pattern :=
Make_Pattern ("$S_F ($S_Arg1, $S_Arg2);", Call_Stmt_Rule);
-- Swap arguments - of course resulting in illegal program ;-)
Replace_Pattern : constant Pattern :=
Make_Pattern ("$S_F ($S_Arg2, $S_Arg1);", Call_Stmt_Rule);
Project_Name : constant String := "C:\path\to\your.gpr";
UFiles : constant Unbounded_Strings.Vector :=
Get_Ada_Source_Files_From_Project (Project_Name);
begin
for UFile of UFiles loop
declare
File : constant String := To_String (UFile);
begin
if Find_And_Replace (File, Find_Pattern, Replace_Pattern) then
Put_Line ("Changed - " & File);
end if;
end;
end loop;
end Rejuvenation_Find_And_Replace;
| 39.741935 | 72 | 0.688312 |
1ec8fafd8989a669ae624ff00de053ff32b3d1a0 | 178 | ada | Ada | Task/Generate-lower-case-ASCII-alphabet/Ada/generate-lower-case-ascii-alphabet-3.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:38.000Z | 2018-11-09T22:08:38.000Z | Task/Generate-lower-case-ASCII-alphabet/Ada/generate-lower-case-ascii-alphabet-3.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/Generate-lower-case-ASCII-alphabet/Ada/generate-lower-case-ascii-alphabet-3.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:40.000Z | 2018-11-09T22:08:40.000Z | B : Arr_Type (1 .. 26);
begin
B(B'First) := 'a';
for I in B'First .. B'Last-1 loop
B(I+1) := Lower_Case'Succ(B(I));
end loop; -- now all the B(I) are different
| 25.428571 | 46 | 0.539326 |
386eaa17d2b0fc1c1395a405864ae227a7ff4c39 | 20,679 | ads | Ada | stm32f0/stm32f030x/svd/stm32_svd-i2c.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 1 | 2021-04-06T07:57:56.000Z | 2021-04-06T07:57:56.000Z | stm32f0/stm32f030x/svd/stm32_svd-i2c.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | null | null | null | stm32f0/stm32f030x/svd/stm32_svd-i2c.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 STM32F030.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with System;
package STM32_SVD.I2C is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype CR1_PE_Field is STM32_SVD.Bit;
subtype CR1_TXIE_Field is STM32_SVD.Bit;
subtype CR1_RXIE_Field is STM32_SVD.Bit;
subtype CR1_ADDRIE_Field is STM32_SVD.Bit;
subtype CR1_NACKIE_Field is STM32_SVD.Bit;
subtype CR1_STOPIE_Field is STM32_SVD.Bit;
subtype CR1_TCIE_Field is STM32_SVD.Bit;
subtype CR1_ERRIE_Field is STM32_SVD.Bit;
subtype CR1_DNF_Field is STM32_SVD.UInt4;
subtype CR1_ANFOFF_Field is STM32_SVD.Bit;
subtype CR1_SWRST_Field is STM32_SVD.Bit;
subtype CR1_TXDMAEN_Field is STM32_SVD.Bit;
subtype CR1_RXDMAEN_Field is STM32_SVD.Bit;
subtype CR1_SBC_Field is STM32_SVD.Bit;
subtype CR1_NOSTRETCH_Field is STM32_SVD.Bit;
subtype CR1_WUPEN_Field is STM32_SVD.Bit;
subtype CR1_GCEN_Field is STM32_SVD.Bit;
subtype CR1_SMBHEN_Field is STM32_SVD.Bit;
subtype CR1_SMBDEN_Field is STM32_SVD.Bit;
subtype CR1_ALERTEN_Field is STM32_SVD.Bit;
subtype CR1_PECEN_Field is STM32_SVD.Bit;
-- Control register 1
type CR1_Register is record
-- Peripheral enable
PE : CR1_PE_Field := 16#0#;
-- TX Interrupt enable
TXIE : CR1_TXIE_Field := 16#0#;
-- RX Interrupt enable
RXIE : CR1_RXIE_Field := 16#0#;
-- Address match interrupt enable (slave only)
ADDRIE : CR1_ADDRIE_Field := 16#0#;
-- Not acknowledge received interrupt enable
NACKIE : CR1_NACKIE_Field := 16#0#;
-- STOP detection Interrupt enable
STOPIE : CR1_STOPIE_Field := 16#0#;
-- Transfer Complete interrupt enable
TCIE : CR1_TCIE_Field := 16#0#;
-- Error interrupts enable
ERRIE : CR1_ERRIE_Field := 16#0#;
-- Digital noise filter
DNF : CR1_DNF_Field := 16#0#;
-- Analog noise filter OFF
ANFOFF : CR1_ANFOFF_Field := 16#0#;
-- Write-only. Software reset
SWRST : CR1_SWRST_Field := 16#0#;
-- DMA transmission requests enable
TXDMAEN : CR1_TXDMAEN_Field := 16#0#;
-- DMA reception requests enable
RXDMAEN : CR1_RXDMAEN_Field := 16#0#;
-- Slave byte control
SBC : CR1_SBC_Field := 16#0#;
-- Clock stretching disable
NOSTRETCH : CR1_NOSTRETCH_Field := 16#0#;
-- Wakeup from STOP enable
WUPEN : CR1_WUPEN_Field := 16#0#;
-- General call enable
GCEN : CR1_GCEN_Field := 16#0#;
-- SMBus Host address enable
SMBHEN : CR1_SMBHEN_Field := 16#0#;
-- SMBus Device Default address enable
SMBDEN : CR1_SMBDEN_Field := 16#0#;
-- SMBUS alert enable
ALERTEN : CR1_ALERTEN_Field := 16#0#;
-- PEC enable
PECEN : CR1_PECEN_Field := 16#0#;
-- unspecified
Reserved_24_31 : STM32_SVD.Byte := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR1_Register use record
PE at 0 range 0 .. 0;
TXIE at 0 range 1 .. 1;
RXIE at 0 range 2 .. 2;
ADDRIE at 0 range 3 .. 3;
NACKIE at 0 range 4 .. 4;
STOPIE at 0 range 5 .. 5;
TCIE at 0 range 6 .. 6;
ERRIE at 0 range 7 .. 7;
DNF at 0 range 8 .. 11;
ANFOFF at 0 range 12 .. 12;
SWRST at 0 range 13 .. 13;
TXDMAEN at 0 range 14 .. 14;
RXDMAEN at 0 range 15 .. 15;
SBC at 0 range 16 .. 16;
NOSTRETCH at 0 range 17 .. 17;
WUPEN at 0 range 18 .. 18;
GCEN at 0 range 19 .. 19;
SMBHEN at 0 range 20 .. 20;
SMBDEN at 0 range 21 .. 21;
ALERTEN at 0 range 22 .. 22;
PECEN at 0 range 23 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
subtype CR2_SADD0_Field is STM32_SVD.Bit;
subtype CR2_SADD1_Field is STM32_SVD.UInt7;
subtype CR2_SADD8_Field is STM32_SVD.UInt2;
subtype CR2_RD_WRN_Field is STM32_SVD.Bit;
subtype CR2_ADD10_Field is STM32_SVD.Bit;
subtype CR2_HEAD10R_Field is STM32_SVD.Bit;
subtype CR2_START_Field is STM32_SVD.Bit;
subtype CR2_STOP_Field is STM32_SVD.Bit;
subtype CR2_NACK_Field is STM32_SVD.Bit;
subtype CR2_NBYTES_Field is STM32_SVD.Byte;
subtype CR2_RELOAD_Field is STM32_SVD.Bit;
subtype CR2_AUTOEND_Field is STM32_SVD.Bit;
subtype CR2_PECBYTE_Field is STM32_SVD.Bit;
-- Control register 2
type CR2_Register is record
-- Slave address bit 0 (master mode)
SADD0 : CR2_SADD0_Field := 16#0#;
-- Slave address bit 7:1 (master mode)
SADD1 : CR2_SADD1_Field := 16#0#;
-- Slave address bit 9:8 (master mode)
SADD8 : CR2_SADD8_Field := 16#0#;
-- Transfer direction (master mode)
RD_WRN : CR2_RD_WRN_Field := 16#0#;
-- 10-bit addressing mode (master mode)
ADD10 : CR2_ADD10_Field := 16#0#;
-- 10-bit address header only read direction (master receiver mode)
HEAD10R : CR2_HEAD10R_Field := 16#0#;
-- Start generation
START : CR2_START_Field := 16#0#;
-- Stop generation (master mode)
STOP : CR2_STOP_Field := 16#0#;
-- NACK generation (slave mode)
NACK : CR2_NACK_Field := 16#0#;
-- Number of bytes
NBYTES : CR2_NBYTES_Field := 16#0#;
-- NBYTES reload mode
RELOAD : CR2_RELOAD_Field := 16#0#;
-- Automatic end mode (master mode)
AUTOEND : CR2_AUTOEND_Field := 16#0#;
-- Packet error checking byte
PECBYTE : CR2_PECBYTE_Field := 16#0#;
-- unspecified
Reserved_27_31 : STM32_SVD.UInt5 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR2_Register use record
SADD0 at 0 range 0 .. 0;
SADD1 at 0 range 1 .. 7;
SADD8 at 0 range 8 .. 9;
RD_WRN at 0 range 10 .. 10;
ADD10 at 0 range 11 .. 11;
HEAD10R at 0 range 12 .. 12;
START at 0 range 13 .. 13;
STOP at 0 range 14 .. 14;
NACK at 0 range 15 .. 15;
NBYTES at 0 range 16 .. 23;
RELOAD at 0 range 24 .. 24;
AUTOEND at 0 range 25 .. 25;
PECBYTE at 0 range 26 .. 26;
Reserved_27_31 at 0 range 27 .. 31;
end record;
subtype OAR1_OA1_0_Field is STM32_SVD.Bit;
subtype OAR1_OA1_1_Field is STM32_SVD.UInt7;
subtype OAR1_OA1_8_Field is STM32_SVD.UInt2;
subtype OAR1_OA1MODE_Field is STM32_SVD.Bit;
subtype OAR1_OA1EN_Field is STM32_SVD.Bit;
-- Own address register 1
type OAR1_Register is record
-- Interface address
OA1_0 : OAR1_OA1_0_Field := 16#0#;
-- Interface address
OA1_1 : OAR1_OA1_1_Field := 16#0#;
-- Interface address
OA1_8 : OAR1_OA1_8_Field := 16#0#;
-- Own Address 1 10-bit mode
OA1MODE : OAR1_OA1MODE_Field := 16#0#;
-- unspecified
Reserved_11_14 : STM32_SVD.UInt4 := 16#0#;
-- Own Address 1 enable
OA1EN : OAR1_OA1EN_Field := 16#0#;
-- unspecified
Reserved_16_31 : STM32_SVD.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OAR1_Register use record
OA1_0 at 0 range 0 .. 0;
OA1_1 at 0 range 1 .. 7;
OA1_8 at 0 range 8 .. 9;
OA1MODE at 0 range 10 .. 10;
Reserved_11_14 at 0 range 11 .. 14;
OA1EN at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype OAR2_OA2_Field is STM32_SVD.UInt7;
subtype OAR2_OA2MSK_Field is STM32_SVD.UInt3;
subtype OAR2_OA2EN_Field is STM32_SVD.Bit;
-- Own address register 2
type OAR2_Register is record
-- unspecified
Reserved_0_0 : STM32_SVD.Bit := 16#0#;
-- Interface address
OA2 : OAR2_OA2_Field := 16#0#;
-- Own Address 2 masks
OA2MSK : OAR2_OA2MSK_Field := 16#0#;
-- unspecified
Reserved_11_14 : STM32_SVD.UInt4 := 16#0#;
-- Own Address 2 enable
OA2EN : OAR2_OA2EN_Field := 16#0#;
-- unspecified
Reserved_16_31 : STM32_SVD.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OAR2_Register use record
Reserved_0_0 at 0 range 0 .. 0;
OA2 at 0 range 1 .. 7;
OA2MSK at 0 range 8 .. 10;
Reserved_11_14 at 0 range 11 .. 14;
OA2EN at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype TIMINGR_SCLL_Field is STM32_SVD.Byte;
subtype TIMINGR_SCLH_Field is STM32_SVD.Byte;
subtype TIMINGR_SDADEL_Field is STM32_SVD.UInt4;
subtype TIMINGR_SCLDEL_Field is STM32_SVD.UInt4;
subtype TIMINGR_PRESC_Field is STM32_SVD.UInt4;
-- Timing register
type TIMINGR_Register is record
-- SCL low period (master mode)
SCLL : TIMINGR_SCLL_Field := 16#0#;
-- SCL high period (master mode)
SCLH : TIMINGR_SCLH_Field := 16#0#;
-- Data hold time
SDADEL : TIMINGR_SDADEL_Field := 16#0#;
-- Data setup time
SCLDEL : TIMINGR_SCLDEL_Field := 16#0#;
-- unspecified
Reserved_24_27 : STM32_SVD.UInt4 := 16#0#;
-- Timing prescaler
PRESC : TIMINGR_PRESC_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for TIMINGR_Register use record
SCLL at 0 range 0 .. 7;
SCLH at 0 range 8 .. 15;
SDADEL at 0 range 16 .. 19;
SCLDEL at 0 range 20 .. 23;
Reserved_24_27 at 0 range 24 .. 27;
PRESC at 0 range 28 .. 31;
end record;
subtype TIMEOUTR_TIMEOUTA_Field is STM32_SVD.UInt12;
subtype TIMEOUTR_TIDLE_Field is STM32_SVD.Bit;
subtype TIMEOUTR_TIMOUTEN_Field is STM32_SVD.Bit;
subtype TIMEOUTR_TIMEOUTB_Field is STM32_SVD.UInt12;
subtype TIMEOUTR_TEXTEN_Field is STM32_SVD.Bit;
-- Status register 1
type TIMEOUTR_Register is record
-- Bus timeout A
TIMEOUTA : TIMEOUTR_TIMEOUTA_Field := 16#0#;
-- Idle clock timeout detection
TIDLE : TIMEOUTR_TIDLE_Field := 16#0#;
-- unspecified
Reserved_13_14 : STM32_SVD.UInt2 := 16#0#;
-- Clock timeout enable
TIMOUTEN : TIMEOUTR_TIMOUTEN_Field := 16#0#;
-- Bus timeout B
TIMEOUTB : TIMEOUTR_TIMEOUTB_Field := 16#0#;
-- unspecified
Reserved_28_30 : STM32_SVD.UInt3 := 16#0#;
-- Extended clock timeout enable
TEXTEN : TIMEOUTR_TEXTEN_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for TIMEOUTR_Register use record
TIMEOUTA at 0 range 0 .. 11;
TIDLE at 0 range 12 .. 12;
Reserved_13_14 at 0 range 13 .. 14;
TIMOUTEN at 0 range 15 .. 15;
TIMEOUTB at 0 range 16 .. 27;
Reserved_28_30 at 0 range 28 .. 30;
TEXTEN at 0 range 31 .. 31;
end record;
subtype ISR_TXE_Field is STM32_SVD.Bit;
subtype ISR_TXIS_Field is STM32_SVD.Bit;
subtype ISR_RXNE_Field is STM32_SVD.Bit;
subtype ISR_ADDR_Field is STM32_SVD.Bit;
subtype ISR_NACKF_Field is STM32_SVD.Bit;
subtype ISR_STOPF_Field is STM32_SVD.Bit;
subtype ISR_TC_Field is STM32_SVD.Bit;
subtype ISR_TCR_Field is STM32_SVD.Bit;
subtype ISR_BERR_Field is STM32_SVD.Bit;
subtype ISR_ARLO_Field is STM32_SVD.Bit;
subtype ISR_OVR_Field is STM32_SVD.Bit;
subtype ISR_PECERR_Field is STM32_SVD.Bit;
subtype ISR_TIMEOUT_Field is STM32_SVD.Bit;
subtype ISR_ALERT_Field is STM32_SVD.Bit;
subtype ISR_BUSY_Field is STM32_SVD.Bit;
subtype ISR_DIR_Field is STM32_SVD.Bit;
subtype ISR_ADDCODE_Field is STM32_SVD.UInt7;
-- Interrupt and Status register
type ISR_Register is record
-- Transmit data register empty (transmitters)
TXE : ISR_TXE_Field := 16#1#;
-- Transmit interrupt status (transmitters)
TXIS : ISR_TXIS_Field := 16#0#;
-- Read-only. Receive data register not empty (receivers)
RXNE : ISR_RXNE_Field := 16#0#;
-- Read-only. Address matched (slave mode)
ADDR : ISR_ADDR_Field := 16#0#;
-- Read-only. Not acknowledge received flag
NACKF : ISR_NACKF_Field := 16#0#;
-- Read-only. Stop detection flag
STOPF : ISR_STOPF_Field := 16#0#;
-- Read-only. Transfer Complete (master mode)
TC : ISR_TC_Field := 16#0#;
-- Read-only. Transfer Complete Reload
TCR : ISR_TCR_Field := 16#0#;
-- Read-only. Bus error
BERR : ISR_BERR_Field := 16#0#;
-- Read-only. Arbitration lost
ARLO : ISR_ARLO_Field := 16#0#;
-- Read-only. Overrun/Underrun (slave mode)
OVR : ISR_OVR_Field := 16#0#;
-- Read-only. PEC Error in reception
PECERR : ISR_PECERR_Field := 16#0#;
-- Read-only. Timeout or t_low detection flag
TIMEOUT : ISR_TIMEOUT_Field := 16#0#;
-- Read-only. SMBus alert
ALERT : ISR_ALERT_Field := 16#0#;
-- unspecified
Reserved_14_14 : STM32_SVD.Bit := 16#0#;
-- Read-only. Bus busy
BUSY : ISR_BUSY_Field := 16#0#;
-- Read-only. Transfer direction (Slave mode)
DIR : ISR_DIR_Field := 16#0#;
-- Read-only. Address match code (Slave mode)
ADDCODE : ISR_ADDCODE_Field := 16#0#;
-- unspecified
Reserved_24_31 : STM32_SVD.Byte := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ISR_Register use record
TXE at 0 range 0 .. 0;
TXIS at 0 range 1 .. 1;
RXNE at 0 range 2 .. 2;
ADDR at 0 range 3 .. 3;
NACKF at 0 range 4 .. 4;
STOPF at 0 range 5 .. 5;
TC at 0 range 6 .. 6;
TCR at 0 range 7 .. 7;
BERR at 0 range 8 .. 8;
ARLO at 0 range 9 .. 9;
OVR at 0 range 10 .. 10;
PECERR at 0 range 11 .. 11;
TIMEOUT at 0 range 12 .. 12;
ALERT at 0 range 13 .. 13;
Reserved_14_14 at 0 range 14 .. 14;
BUSY at 0 range 15 .. 15;
DIR at 0 range 16 .. 16;
ADDCODE at 0 range 17 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
subtype ICR_ADDRCF_Field is STM32_SVD.Bit;
subtype ICR_NACKCF_Field is STM32_SVD.Bit;
subtype ICR_STOPCF_Field is STM32_SVD.Bit;
subtype ICR_BERRCF_Field is STM32_SVD.Bit;
subtype ICR_ARLOCF_Field is STM32_SVD.Bit;
subtype ICR_OVRCF_Field is STM32_SVD.Bit;
subtype ICR_PECCF_Field is STM32_SVD.Bit;
subtype ICR_TIMOUTCF_Field is STM32_SVD.Bit;
subtype ICR_ALERTCF_Field is STM32_SVD.Bit;
-- Interrupt clear register
type ICR_Register is record
-- unspecified
Reserved_0_2 : STM32_SVD.UInt3 := 16#0#;
-- Write-only. Address Matched flag clear
ADDRCF : ICR_ADDRCF_Field := 16#0#;
-- Write-only. Not Acknowledge flag clear
NACKCF : ICR_NACKCF_Field := 16#0#;
-- Write-only. Stop detection flag clear
STOPCF : ICR_STOPCF_Field := 16#0#;
-- unspecified
Reserved_6_7 : STM32_SVD.UInt2 := 16#0#;
-- Write-only. Bus error flag clear
BERRCF : ICR_BERRCF_Field := 16#0#;
-- Write-only. Arbitration lost flag clear
ARLOCF : ICR_ARLOCF_Field := 16#0#;
-- Write-only. Overrun/Underrun flag clear
OVRCF : ICR_OVRCF_Field := 16#0#;
-- Write-only. PEC Error flag clear
PECCF : ICR_PECCF_Field := 16#0#;
-- Write-only. Timeout detection flag clear
TIMOUTCF : ICR_TIMOUTCF_Field := 16#0#;
-- Write-only. Alert flag clear
ALERTCF : ICR_ALERTCF_Field := 16#0#;
-- unspecified
Reserved_14_31 : STM32_SVD.UInt18 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for ICR_Register use record
Reserved_0_2 at 0 range 0 .. 2;
ADDRCF at 0 range 3 .. 3;
NACKCF at 0 range 4 .. 4;
STOPCF at 0 range 5 .. 5;
Reserved_6_7 at 0 range 6 .. 7;
BERRCF at 0 range 8 .. 8;
ARLOCF at 0 range 9 .. 9;
OVRCF at 0 range 10 .. 10;
PECCF at 0 range 11 .. 11;
TIMOUTCF at 0 range 12 .. 12;
ALERTCF at 0 range 13 .. 13;
Reserved_14_31 at 0 range 14 .. 31;
end record;
subtype PECR_PEC_Field is STM32_SVD.Byte;
-- PEC register
type PECR_Register is record
-- Read-only. Packet error checking register
PEC : PECR_PEC_Field;
-- unspecified
Reserved_8_31 : STM32_SVD.UInt24;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PECR_Register use record
PEC at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype RXDR_RXDATA_Field is STM32_SVD.Byte;
-- Receive data register
type RXDR_Register is record
-- Read-only. 8-bit receive data
RXDATA : RXDR_RXDATA_Field;
-- unspecified
Reserved_8_31 : STM32_SVD.UInt24;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for RXDR_Register use record
RXDATA at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype TXDR_TXDATA_Field is STM32_SVD.Byte;
-- Transmit data register
type TXDR_Register is record
-- 8-bit transmit data
TXDATA : TXDR_TXDATA_Field := 16#0#;
-- unspecified
Reserved_8_31 : STM32_SVD.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for TXDR_Register use record
TXDATA at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Inter-integrated circuit
type I2C_Peripheral is record
-- Control register 1
CR1 : aliased CR1_Register;
-- Control register 2
CR2 : aliased CR2_Register;
-- Own address register 1
OAR1 : aliased OAR1_Register;
-- Own address register 2
OAR2 : aliased OAR2_Register;
-- Timing register
TIMINGR : aliased TIMINGR_Register;
-- Status register 1
TIMEOUTR : aliased TIMEOUTR_Register;
-- Interrupt and Status register
ISR : aliased ISR_Register;
-- Interrupt clear register
ICR : aliased ICR_Register;
-- PEC register
PECR : aliased PECR_Register;
-- Receive data register
RXDR : aliased RXDR_Register;
-- Transmit data register
TXDR : aliased TXDR_Register;
end record
with Volatile;
for I2C_Peripheral use record
CR1 at 16#0# range 0 .. 31;
CR2 at 16#4# range 0 .. 31;
OAR1 at 16#8# range 0 .. 31;
OAR2 at 16#C# range 0 .. 31;
TIMINGR at 16#10# range 0 .. 31;
TIMEOUTR at 16#14# range 0 .. 31;
ISR at 16#18# range 0 .. 31;
ICR at 16#1C# range 0 .. 31;
PECR at 16#20# range 0 .. 31;
RXDR at 16#24# range 0 .. 31;
TXDR at 16#28# range 0 .. 31;
end record;
-- Inter-integrated circuit
I2C1_Periph : aliased I2C_Peripheral
with Import, Address => System'To_Address (16#40005400#);
-- Inter-integrated circuit
I2C2_Periph : aliased I2C_Peripheral
with Import, Address => System'To_Address (16#40005800#);
end STM32_SVD.I2C;
| 37.05914 | 74 | 0.591808 |
adc87f996c9195ebc735ab3f180640f4e05dd777 | 2,483 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c8/c85005f.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/c8/c85005f.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c8/c85005f.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C85005F.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, FOR A RENAMED VARIABLE DESIGNATED BY AN ACCESS VALUE,
-- A CHANGE IN THE ACCESS VALUE DOES NOT AFFECT WHICH VARIABLE IS
-- DENOTED BY THE NEW NAME.
-- HISTORY:
-- JET 07/26/88 CREATED ORIGINAL TEST.
WITH REPORT; USE REPORT;
PROCEDURE C85005F IS
TYPE ACC IS ACCESS INTEGER;
BUMP : INTEGER := 0;
A : ACC := NULL;
FUNCTION GET_POINTER RETURN ACC IS
BEGIN
BUMP := IDENT_INT(BUMP) + 1;
RETURN NEW INTEGER'(BUMP);
END GET_POINTER;
BEGIN
TEST ("C85005F", "CHECK THAT, FOR A RENAMED VARIABLE DESIGNATED " &
"BY AN ACCESS VALUE, A CHANGE IN THE ACCESS " &
"VALUE DOES NOT AFFECT WHICH VARIABLE IS " &
"DENOTED BY THE NEW NAME");
A := GET_POINTER;
DECLARE
X1 : INTEGER RENAMES A.ALL;
X2 : INTEGER RENAMES GET_POINTER.ALL;
BEGIN
A := GET_POINTER;
IF X1 /= 1 THEN
FAILED("CHANGING ACCESS VALUE CHANGED RENAMED VARIABLE");
END IF;
IF X2 /= 2 THEN
FAILED("INCORRECT RESULT FROM FUNCTION AS PREFIX");
END IF;
END;
RESULT;
END C85005F;
| 34.486111 | 79 | 0.622634 |
2e80ed3de8fea230711262f23cce02f97be58a77 | 5,118 | adb | Ada | tools-src/gnu/gcc/gcc/ada/s-pack49.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 80 | 2015-01-02T10:14:04.000Z | 2021-06-07T06:29:49.000Z | tools-src/gnu/gcc/gcc/ada/s-pack49.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 9 | 2015-05-14T11:03:12.000Z | 2018-01-04T07:12:58.000Z | tools-src/gnu/gcc/gcc/ada/s-pack49.adb | 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 . P A C K _ 4 9 --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-1999 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.Storage_Elements;
with System.Unsigned_Types;
with Unchecked_Conversion;
package body System.Pack_49 is
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_49;
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;
function To_Ref is new
Unchecked_Conversion (System.Address, Cluster_Ref);
------------
-- Get_49 --
------------
function Get_49 (Arr : System.Address; N : Natural) return Bits_49 is
C : constant Cluster_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8));
begin
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 Get_49;
------------
-- Set_49 --
------------
procedure Set_49 (Arr : System.Address; N : Natural; E : Bits_49) is
C : constant Cluster_Ref := To_Ref (Arr + Bits * Ofs (Uns (N) / 8));
begin
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 Set_49;
end System.Pack_49;
| 43.008403 | 78 | 0.47245 |
c7b173d232203435e2190a855a984e37113fe70c | 2,974 | adb | Ada | tests/unit_tests/keccakf_lane_tests.adb | damaki/libkeccak | d06217e525f7927380690d6c37b485bdbe8aa96e | [
"BSD-3-Clause"
] | 26 | 2015-09-20T17:52:38.000Z | 2021-07-29T21:47:04.000Z | tests/unit_tests/keccakf_lane_tests.adb | damaki/libkeccak | d06217e525f7927380690d6c37b485bdbe8aa96e | [
"BSD-3-Clause"
] | 3 | 2019-03-12T16:01:36.000Z | 2020-05-23T13:06:43.000Z | tests/unit_tests/keccakf_lane_tests.adb | damaki/libkeccak | d06217e525f7927380690d6c37b485bdbe8aa96e | [
"BSD-3-Clause"
] | 2 | 2019-04-15T18:02:19.000Z | 2020-11-22T11:22:18.000Z | -------------------------------------------------------------------------------
-- Copyright (c) 2019, Daniel King
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
-- * Redistributions of source code must retain the above copyright
-- notice, this list of conditions and the following disclaimer.
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
-- * The name of the copyright holder may not be used to endorse or promote
-- Products derived from this software without specific prior written
-- permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE FOR ANY
-- DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
-- (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
-- LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
-- ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
-- THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-------------------------------------------------------------------------------
with AUnit.Assertions; use AUnit.Assertions;
with Keccak.Types; use Keccak.Types;
package body KeccakF_Lane_Tests is
-- Test that XORing bytes into a (zeroed) state, then extracting them
-- yields the original data.
--
-- This ensures that XOR_Bits_Into_State and Extract_Bits both use the
-- same mapping to the internal state.
procedure Test_XOR_Extract(T : in out Test) is
State_Size_Bytes : constant Positive := State_Size_Bits / 8;
S : State;
Data_In : Byte_Array (1 .. State_Size_Bytes);
Data_Out : Byte_Array (1 .. State_Size_Bytes);
begin
for I in Data_In'Range loop
Data_In (I) := Keccak.Types.Byte (I mod 256);
end loop;
for N in 1 .. State_Size_Bytes loop
Init_State (S);
XOR_Bits_Into_State (A => S,
Data => Data_In,
Bit_Len => N * 8);
Data_Out := (others => 16#AA#);
Extract_Bits (A => S,
Data => Data_Out (1 .. N),
Bit_Len => N * 8);
Assert (Data_In (1 .. N) = Data_Out (1 .. N),
"Failed for N = " & Integer'Image (N));
end loop;
end Test_XOR_Extract;
end KeccakF_Lane_Tests;
| 41.305556 | 79 | 0.630128 |
1352508b0adfe06263894459622855487d4bcece | 2,460 | adb | Ada | source/tasking/a-synbar.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/tasking/a-synbar.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/tasking/a-synbar.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | with System.Synchronous_Objects.Abortable;
with System.Tasks;
package body Ada.Synchronous_Barriers is
procedure Do_Wait (
Object : in out Synchronous_Barrier;
Notified : out Boolean;
Aborted : out Boolean);
procedure Do_Wait (
Object : in out Synchronous_Barrier;
Notified : out Boolean;
Aborted : out Boolean)
is
Order : Natural;
begin
System.Synchronous_Objects.Enter (Object.Mutex);
Object.Blocked := Object.Blocked + 1;
Order := Object.Blocked rem Object.Release_Threshold;
Notified := Order = 1 or else Object.Release_Threshold = 1; -- first one
if Order = 0 then
System.Synchronous_Objects.Set (Object.Event);
Aborted := System.Tasks.Is_Aborted;
Object.Unblocked := Object.Unblocked + 1;
else
loop
System.Synchronous_Objects.Leave (Object.Mutex);
System.Synchronous_Objects.Abortable.Wait (Object.Event, Aborted);
System.Synchronous_Objects.Enter (Object.Mutex);
exit when Object.Blocked >= Object.Release_Threshold
or else Aborted;
end loop;
Object.Unblocked := Object.Unblocked + 1;
end if;
if Object.Unblocked = Object.Release_Threshold then
Object.Blocked := Object.Blocked - Object.Release_Threshold;
Object.Unblocked := 0;
if Object.Blocked < Object.Release_Threshold then
System.Synchronous_Objects.Reset (Object.Event);
end if;
end if;
System.Synchronous_Objects.Leave (Object.Mutex);
end Do_Wait;
-- implementation
procedure Wait_For_Release (
The_Barrier : in out Synchronous_Barrier;
Notified : out Boolean)
is
Aborted : Boolean;
begin
System.Tasks.Enable_Abort;
Do_Wait (The_Barrier, Notified, Aborted => Aborted);
System.Tasks.Disable_Abort (Aborted);
end Wait_For_Release;
overriding procedure Initialize (Object : in out Synchronous_Barrier) is
begin
Object.Blocked := 0;
Object.Unblocked := 0;
System.Synchronous_Objects.Initialize (Object.Mutex);
System.Synchronous_Objects.Initialize (Object.Event);
end Initialize;
overriding procedure Finalize (Object : in out Synchronous_Barrier) is
begin
System.Synchronous_Objects.Finalize (Object.Mutex);
System.Synchronous_Objects.Finalize (Object.Event);
end Finalize;
end Ada.Synchronous_Barriers;
| 34.166667 | 78 | 0.67439 |
c775ff2177c5f2da986ce893c074e5f41b908edd | 1,524 | adb | Ada | out/euler26.adb | Melyodas/metalang | 399a9f1a71402c979d7f8024d4f98f081c80e771 | [
"BSD-2-Clause"
] | 22 | 2017-04-24T10:00:45.000Z | 2021-04-01T10:11:05.000Z | out/euler26.adb | Melyodas/metalang | 399a9f1a71402c979d7f8024d4f98f081c80e771 | [
"BSD-2-Clause"
] | 12 | 2017-03-26T18:34:21.000Z | 2019-03-21T19:13:03.000Z | out/euler26.adb | Melyodas/metalang | 399a9f1a71402c979d7f8024d4f98f081c80e771 | [
"BSD-2-Clause"
] | 7 | 2017-10-14T13:33:33.000Z | 2021-03-18T15:18:50.000Z |
with ada.text_io, ada.Integer_text_IO, Ada.Text_IO.Text_Streams, Ada.Strings.Fixed, Interfaces.C;
use ada.text_io, ada.Integer_text_IO, Ada.Strings, Ada.Strings.Fixed, Interfaces.C;
procedure euler26 is
type stringptr is access all char_array;
procedure PString(s : stringptr) is
begin
String'Write (Text_Streams.Stream (Current_Output), To_Ada(s.all));
end;
procedure PInt(i : in Integer) is
begin
String'Write (Text_Streams.Stream (Current_Output), Trim(Integer'Image(i), Left));
end;
type e is Array (Integer range <>) of Integer;
type e_PTR is access e;
function periode(restes : in e_PTR; c : in Integer; d : in Integer; b : in Integer) return Integer is
reste : Integer;
len : Integer;
chiffre : Integer;
a : Integer;
begin
len := c;
a := d;
while a /= 0 loop
chiffre := a / b;
reste := a rem b;
for i in integer range 0..len - 1 loop
if restes(i) = reste
then
return len - i;
end if;
end loop;
restes(len) := reste;
len := len + 1;
a := reste * 10;
end loop;
return 0;
end;
t : e_PTR;
p : Integer;
mi : Integer;
m : Integer;
begin
t := new e (0..999);
for j in integer range 0..999 loop
t(j) := 0;
end loop;
m := 0;
mi := 0;
for i in integer range 1..1000 loop
p := periode(t, 0, 1, i);
if p > m
then
mi := i;
m := p;
end if;
end loop;
PInt(mi);
PString(new char_array'( To_C("" & Character'Val(10))));
PInt(m);
PString(new char_array'( To_C("" & Character'Val(10))));
end;
| 22.746269 | 101 | 0.621391 |
29abd80147f6050e22c4fdab80fbfeb6fe709c14 | 7,300 | adb | Ada | gcc-gcc-7_3_0-release/gcc/ada/mlib-tgt-specific-vxworks.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/ada/mlib-tgt-specific-vxworks.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/mlib-tgt-specific-vxworks.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- M L I B . T G T . S P E C I F I C --
-- (VxWorks Version) --
-- --
-- B o d y --
-- --
-- Copyright (C) 2003-2013, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. 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 is the VxWorks version of the body
with Sdefault;
package body MLib.Tgt.Specific is
-----------------------
-- Local Subprograms --
-----------------------
function Get_Target_Suffix return String;
-- Returns the required suffix for some utilities
-- (such as ar and ranlib) that depend on the real target.
-- Non default subprograms
function Archive_Builder return String;
function Archive_Indexer return String;
procedure Build_Dynamic_Library
(Ofiles : Argument_List;
Options : Argument_List;
Interfaces : Argument_List;
Lib_Filename : String;
Lib_Dir : String;
Symbol_Data : Symbol_Record;
Driver_Name : Name_Id := No_Name;
Lib_Version : String := "";
Auto_Init : Boolean := False);
function DLL_Ext return String;
function Dynamic_Option return String;
function Library_Major_Minor_Id_Supported return Boolean;
function PIC_Option return String;
function Standalone_Library_Auto_Init_Is_Supported return Boolean;
function Support_For_Libraries return Library_Support;
---------------------
-- Archive_Builder --
---------------------
function Archive_Builder return String is
begin
return "ar" & Get_Target_Suffix;
end Archive_Builder;
---------------------
-- Archive_Indexer --
---------------------
function Archive_Indexer return String is
begin
return "ranlib" & Get_Target_Suffix;
end Archive_Indexer;
---------------------------
-- Build_Dynamic_Library --
---------------------------
procedure Build_Dynamic_Library
(Ofiles : Argument_List;
Options : Argument_List;
Interfaces : Argument_List;
Lib_Filename : String;
Lib_Dir : String;
Symbol_Data : Symbol_Record;
Driver_Name : Name_Id := No_Name;
Lib_Version : String := "";
Auto_Init : Boolean := False)
is
pragma Unreferenced (Ofiles);
pragma Unreferenced (Options);
pragma Unreferenced (Interfaces);
pragma Unreferenced (Lib_Filename);
pragma Unreferenced (Lib_Dir);
pragma Unreferenced (Symbol_Data);
pragma Unreferenced (Driver_Name);
pragma Unreferenced (Lib_Version);
pragma Unreferenced (Auto_Init);
begin
null;
end Build_Dynamic_Library;
-------------
-- DLL_Ext --
-------------
function DLL_Ext return String is
begin
return "";
end DLL_Ext;
--------------------
-- Dynamic_Option --
--------------------
function Dynamic_Option return String is
begin
return "";
end Dynamic_Option;
-----------------------
-- Get_Target_Suffix --
-----------------------
function Get_Target_Suffix return String is
Target_Name : constant String := Sdefault.Target_Name.all;
Index : Positive := Target_Name'First;
begin
while Index < Target_Name'Last
and then Target_Name (Index + 1) /= '-'
loop
Index := Index + 1;
end loop;
if Target_Name (Target_Name'First .. Index) = "m68k" then
return "68k";
elsif Target_Name (Target_Name'First .. Index) = "mips" then
return "mips";
elsif Target_Name (Target_Name'First .. Index) = "powerpc" then
return "ppc";
elsif Target_Name (Target_Name'First .. Index) = "sparc" then
return "sparc";
elsif Target_Name (Target_Name'First .. Index) = "sparc64" then
return "sparc64";
elsif Target_Name (Target_Name'First .. Index) = "arm" then
return "arm";
elsif Target_Name (Target_Name'First .. Index) = "i586" then
return "pentium";
else
return "";
end if;
end Get_Target_Suffix;
--------------------------------------
-- Library_Major_Minor_Id_Supported --
--------------------------------------
function Library_Major_Minor_Id_Supported return Boolean is
begin
return False;
end Library_Major_Minor_Id_Supported;
----------------
-- PIC_Option --
----------------
function PIC_Option return String is
begin
return "";
end PIC_Option;
-----------------------------------------------
-- Standalone_Library_Auto_Init_Is_Supported --
-----------------------------------------------
function Standalone_Library_Auto_Init_Is_Supported return Boolean is
begin
return False;
end Standalone_Library_Auto_Init_Is_Supported;
---------------------------
-- Support_For_Libraries --
---------------------------
function Support_For_Libraries return Library_Support is
begin
return Static_Only;
end Support_For_Libraries;
begin
Archive_Builder_Ptr := Archive_Builder'Access;
Archive_Indexer_Ptr := Archive_Indexer'Access;
Build_Dynamic_Library_Ptr := Build_Dynamic_Library'Access;
DLL_Ext_Ptr := DLL_Ext'Access;
Dynamic_Option_Ptr := Dynamic_Option'Access;
PIC_Option_Ptr := PIC_Option'Access;
Library_Major_Minor_Id_Supported_Ptr :=
Library_Major_Minor_Id_Supported'Access;
Standalone_Library_Auto_Init_Is_Supported_Ptr :=
Standalone_Library_Auto_Init_Is_Supported'Access;
Support_For_Libraries_Ptr := Support_For_Libraries'Access;
end MLib.Tgt.Specific;
| 33.486239 | 78 | 0.536575 |
0492a1dffae3bcd7bddc9e2f5a489cb3ca84a2a3 | 3,827 | adb | Ada | registrar-executive-unit_entry-execute-source_pack.adb | annexi-strayline/AURA | fbbc4bc963ee82872a67e088b68f0565ba5b50a7 | [
"BSD-3-Clause"
] | 13 | 2021-09-28T18:14:32.000Z | 2022-02-09T17:48:53.000Z | registrar-executive-unit_entry-execute-source_pack.adb | annexi-strayline/AURA | fbbc4bc963ee82872a67e088b68f0565ba5b50a7 | [
"BSD-3-Clause"
] | 9 | 2021-09-28T19:18:25.000Z | 2022-01-14T22:54:06.000Z | registrar-executive-unit_entry-execute-source_pack.adb | annexi-strayline/AURA | fbbc4bc963ee82872a67e088b68f0565ba5b50a7 | [
"BSD-3-Clause"
] | 1 | 2021-10-21T21:19:08.000Z | 2021-10-21T21:19:08.000Z | ------------------------------------------------------------------------------
-- --
-- Ada User Repository Annex (AURA) --
-- ANNEXI-STRAYLINE Reference Implementation --
-- --
-- Core --
-- --
-- ------------------------------------------------------------------------ --
-- --
-- Copyright (C) 2020, 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. --
-- --
------------------------------------------------------------------------------
separate (Registrar.Executive.Unit_Entry.Execute)
package body Source_Pack is
--------------------
-- Discard_Source --
--------------------
procedure Discard_Source is
begin
Registrar.Source_Files.Allocation.Discard
(File => Source,
Checkout => Stream);
end Discard_Source;
end Source_Pack;
| 61.725806 | 78 | 0.402927 |
1ed6e25b08954696af91bcb4c9bfc986670ce45e | 4,865 | ads | Ada | source/amf/uml/amf-uml-packages-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-uml-packages-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-uml-packages-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.UML.Packages.Collections is
pragma Preelaborate;
package UML_Package_Collections is
new AMF.Generic_Collections
(UML_Package,
UML_Package_Access);
type Set_Of_UML_Package is
new UML_Package_Collections.Set with null record;
Empty_Set_Of_UML_Package : constant Set_Of_UML_Package;
type Ordered_Set_Of_UML_Package is
new UML_Package_Collections.Ordered_Set with null record;
Empty_Ordered_Set_Of_UML_Package : constant Ordered_Set_Of_UML_Package;
type Bag_Of_UML_Package is
new UML_Package_Collections.Bag with null record;
Empty_Bag_Of_UML_Package : constant Bag_Of_UML_Package;
type Sequence_Of_UML_Package is
new UML_Package_Collections.Sequence with null record;
Empty_Sequence_Of_UML_Package : constant Sequence_Of_UML_Package;
private
Empty_Set_Of_UML_Package : constant Set_Of_UML_Package
:= (UML_Package_Collections.Set with null record);
Empty_Ordered_Set_Of_UML_Package : constant Ordered_Set_Of_UML_Package
:= (UML_Package_Collections.Ordered_Set with null record);
Empty_Bag_Of_UML_Package : constant Bag_Of_UML_Package
:= (UML_Package_Collections.Bag with null record);
Empty_Sequence_Of_UML_Package : constant Sequence_Of_UML_Package
:= (UML_Package_Collections.Sequence with null record);
end AMF.UML.Packages.Collections;
| 52.880435 | 78 | 0.502775 |
13c5fad81e21736674c24d2a9f28f11a83a7621d | 34,761 | adb | Ada | clients/ada/generated/src/model/-models.adb | shinesolutions/swagger-aem | b41f1ae3d23917de38ca5cf116cbcc173368d1e8 | [
"Apache-2.0"
] | 39 | 2016-10-02T06:45:12.000Z | 2021-09-08T20:39:53.000Z | clients/ada-server/generated/src/model/-models.adb | shinesolutions/swagger-aem | b41f1ae3d23917de38ca5cf116cbcc173368d1e8 | [
"Apache-2.0"
] | 35 | 2016-11-02T05:06:34.000Z | 2021-09-03T06:03:08.000Z | clients/ada-server/generated/src/model/-models.adb | shinesolutions/swagger-aem | b41f1ae3d23917de38ca5cf116cbcc173368d1e8 | [
"Apache-2.0"
] | 23 | 2016-11-07T04:14:42.000Z | 2021-02-15T09:49:13.000Z | -- Adobe Experience Manager (AEM) API
-- Swagger AEM is an OpenAPI specification for Adobe Experience Manager (AEM) API
--
-- The version of the OpenAPI document: 3.5.0_pre.0
-- Contact: [email protected]
--
-- NOTE: This package is auto generated by OpenAPI-Generator 5.2.1.
-- https://openapi-generator.tech
-- Do not edit the class manually.
package body .Models is
pragma Style_Checks ("-mr");
pragma Warnings (Off, "*use clause for package*");
use Swagger.Streams;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in InstallStatusStatus_Type) is
begin
Into.Start_Entity (Name);
Into.Write_Entity ("finished", Value.Finished);
Into.Write_Entity ("itemCount", Value.Item_Count);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in InstallStatusStatus_Type_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out InstallStatusStatus_Type) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Swagger.Streams.Deserialize (Object, "finished", Value.Finished);
Swagger.Streams.Deserialize (Object, "itemCount", Value.Item_Count);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out InstallStatusStatus_Type_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : InstallStatusStatus_Type;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in InstallStatus_Type) is
begin
Into.Start_Entity (Name);
Serialize (Into, "status", Value.Status);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in InstallStatus_Type_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out InstallStatus_Type) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Deserialize (Object, "status", Value.Status);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out InstallStatus_Type_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : InstallStatus_Type;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in SamlConfigurationPropertyItemsString_Type) is
begin
Into.Start_Entity (Name);
Into.Write_Entity ("name", Value.Name);
Into.Write_Entity ("optional", Value.Optional);
Into.Write_Entity ("is_set", Value.Is_Set);
Into.Write_Entity ("type", Value.P_Type);
Into.Write_Entity ("value", Value.Value);
Into.Write_Entity ("description", Value.Description);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in SamlConfigurationPropertyItemsString_Type_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out SamlConfigurationPropertyItemsString_Type) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Swagger.Streams.Deserialize (Object, "name", Value.Name);
Swagger.Streams.Deserialize (Object, "optional", Value.Optional);
Swagger.Streams.Deserialize (Object, "is_set", Value.Is_Set);
Swagger.Streams.Deserialize (Object, "type", Value.P_Type);
Swagger.Streams.Deserialize (Object, "value", Value.Value);
Swagger.Streams.Deserialize (Object, "description", Value.Description);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out SamlConfigurationPropertyItemsString_Type_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : SamlConfigurationPropertyItemsString_Type;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in SamlConfigurationPropertyItemsBoolean_Type) is
begin
Into.Start_Entity (Name);
Into.Write_Entity ("name", Value.Name);
Into.Write_Entity ("optional", Value.Optional);
Into.Write_Entity ("is_set", Value.Is_Set);
Into.Write_Entity ("type", Value.P_Type);
Into.Write_Entity ("value", Value.Value);
Into.Write_Entity ("description", Value.Description);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in SamlConfigurationPropertyItemsBoolean_Type_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out SamlConfigurationPropertyItemsBoolean_Type) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Swagger.Streams.Deserialize (Object, "name", Value.Name);
Swagger.Streams.Deserialize (Object, "optional", Value.Optional);
Swagger.Streams.Deserialize (Object, "is_set", Value.Is_Set);
Swagger.Streams.Deserialize (Object, "type", Value.P_Type);
Swagger.Streams.Deserialize (Object, "value", Value.Value);
Swagger.Streams.Deserialize (Object, "description", Value.Description);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out SamlConfigurationPropertyItemsBoolean_Type_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : SamlConfigurationPropertyItemsBoolean_Type;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in TruststoreItems_Type) is
begin
Into.Start_Entity (Name);
Into.Write_Entity ("alias", Value.Alias);
Into.Write_Entity ("entryType", Value.Entry_Type);
Into.Write_Entity ("subject", Value.Subject);
Into.Write_Entity ("issuer", Value.Issuer);
Into.Write_Entity ("notBefore", Value.Not_Before);
Into.Write_Entity ("notAfter", Value.Not_After);
Into.Write_Entity ("serialNumber", Value.Serial_Number);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in TruststoreItems_Type_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out TruststoreItems_Type) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Swagger.Streams.Deserialize (Object, "alias", Value.Alias);
Swagger.Streams.Deserialize (Object, "entryType", Value.Entry_Type);
Swagger.Streams.Deserialize (Object, "subject", Value.Subject);
Swagger.Streams.Deserialize (Object, "issuer", Value.Issuer);
Swagger.Streams.Deserialize (Object, "notBefore", Value.Not_Before);
Swagger.Streams.Deserialize (Object, "notAfter", Value.Not_After);
Swagger.Streams.Deserialize (Object, "serialNumber", Value.Serial_Number);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out TruststoreItems_Type_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : TruststoreItems_Type;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in TruststoreInfo_Type) is
begin
Into.Start_Entity (Name);
Serialize (Into, "aliases", Value.Aliases);
Into.Write_Entity ("exists", Value.Exists);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in TruststoreInfo_Type_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out TruststoreInfo_Type) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Deserialize (Object, "aliases", Value.Aliases);
Swagger.Streams.Deserialize (Object, "exists", Value.Exists);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out TruststoreInfo_Type_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : TruststoreInfo_Type;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in KeystoreChainItems_Type) is
begin
Into.Start_Entity (Name);
Into.Write_Entity ("subject", Value.Subject);
Into.Write_Entity ("issuer", Value.Issuer);
Into.Write_Entity ("notBefore", Value.Not_Before);
Into.Write_Entity ("notAfter", Value.Not_After);
Into.Write_Entity ("serialNumber", Value.Serial_Number);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in KeystoreChainItems_Type_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out KeystoreChainItems_Type) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Swagger.Streams.Deserialize (Object, "subject", Value.Subject);
Swagger.Streams.Deserialize (Object, "issuer", Value.Issuer);
Swagger.Streams.Deserialize (Object, "notBefore", Value.Not_Before);
Swagger.Streams.Deserialize (Object, "notAfter", Value.Not_After);
Swagger.Streams.Deserialize (Object, "serialNumber", Value.Serial_Number);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out KeystoreChainItems_Type_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : KeystoreChainItems_Type;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in KeystoreItems_Type) is
begin
Into.Start_Entity (Name);
Into.Write_Entity ("alias", Value.Alias);
Into.Write_Entity ("entryType", Value.Entry_Type);
Into.Write_Entity ("algorithm", Value.Algorithm);
Into.Write_Entity ("format", Value.Format);
Serialize (Into, "chain", Value.Chain);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in KeystoreItems_Type_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out KeystoreItems_Type) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Swagger.Streams.Deserialize (Object, "alias", Value.Alias);
Swagger.Streams.Deserialize (Object, "entryType", Value.Entry_Type);
Swagger.Streams.Deserialize (Object, "algorithm", Value.Algorithm);
Swagger.Streams.Deserialize (Object, "format", Value.Format);
Deserialize (Object, "chain", Value.Chain);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out KeystoreItems_Type_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : KeystoreItems_Type;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in KeystoreInfo_Type) is
begin
Into.Start_Entity (Name);
Serialize (Into, "aliases", Value.Aliases);
Into.Write_Entity ("exists", Value.Exists);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in KeystoreInfo_Type_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out KeystoreInfo_Type) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Deserialize (Object, "aliases", Value.Aliases);
Swagger.Streams.Deserialize (Object, "exists", Value.Exists);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out KeystoreInfo_Type_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : KeystoreInfo_Type;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in SamlConfigurationPropertyItemsArray_Type) is
begin
Into.Start_Entity (Name);
Into.Write_Entity ("name", Value.Name);
Into.Write_Entity ("optional", Value.Optional);
Into.Write_Entity ("is_set", Value.Is_Set);
Into.Write_Entity ("type", Value.P_Type);
Serialize (Into, "values", Value.Values);
Into.Write_Entity ("description", Value.Description);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in SamlConfigurationPropertyItemsArray_Type_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out SamlConfigurationPropertyItemsArray_Type) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Swagger.Streams.Deserialize (Object, "name", Value.Name);
Swagger.Streams.Deserialize (Object, "optional", Value.Optional);
Swagger.Streams.Deserialize (Object, "is_set", Value.Is_Set);
Swagger.Streams.Deserialize (Object, "type", Value.P_Type);
Swagger.Streams.Deserialize (Object, "values", Value.Values);
Swagger.Streams.Deserialize (Object, "description", Value.Description);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out SamlConfigurationPropertyItemsArray_Type_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : SamlConfigurationPropertyItemsArray_Type;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in SamlConfigurationPropertyItemsLong_Type) is
begin
Into.Start_Entity (Name);
Into.Write_Entity ("name", Value.Name);
Into.Write_Entity ("optional", Value.Optional);
Into.Write_Entity ("is_set", Value.Is_Set);
Into.Write_Entity ("type", Value.P_Type);
Into.Write_Entity ("value", Value.Value);
Into.Write_Entity ("description", Value.Description);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in SamlConfigurationPropertyItemsLong_Type_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out SamlConfigurationPropertyItemsLong_Type) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Swagger.Streams.Deserialize (Object, "name", Value.Name);
Swagger.Streams.Deserialize (Object, "optional", Value.Optional);
Swagger.Streams.Deserialize (Object, "is_set", Value.Is_Set);
Swagger.Streams.Deserialize (Object, "type", Value.P_Type);
Swagger.Streams.Deserialize (Object, "value", Value.Value);
Swagger.Streams.Deserialize (Object, "description", Value.Description);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out SamlConfigurationPropertyItemsLong_Type_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : SamlConfigurationPropertyItemsLong_Type;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in SamlConfigurationProperties_Type) is
begin
Into.Start_Entity (Name);
Serialize (Into, "path", Value.Path);
Serialize (Into, "service.ranking", Value.Service_Ranking);
Serialize (Into, "idpUrl", Value.Idp_Url);
Serialize (Into, "idpCertAlias", Value.Idp_Cert_Alias);
Serialize (Into, "idpHttpRedirect", Value.Idp_Http_Redirect);
Serialize (Into, "serviceProviderEntityId", Value.Service_Provider_Entity_Id);
Serialize (Into, "assertionConsumerServiceURL", Value.Assertion_Consumer_Service_URL);
Serialize (Into, "spPrivateKeyAlias", Value.Sp_Private_Key_Alias);
Serialize (Into, "keyStorePassword", Value.Key_Store_Password);
Serialize (Into, "defaultRedirectUrl", Value.Default_Redirect_Url);
Serialize (Into, "userIDAttribute", Value.User_IDAttribute);
Serialize (Into, "useEncryption", Value.Use_Encryption);
Serialize (Into, "createUser", Value.Create_User);
Serialize (Into, "addGroupMemberships", Value.Add_Group_Memberships);
Serialize (Into, "groupMembershipAttribute", Value.Group_Membership_Attribute);
Serialize (Into, "defaultGroups", Value.Default_Groups);
Serialize (Into, "nameIdFormat", Value.Name_Id_Format);
Serialize (Into, "synchronizeAttributes", Value.Synchronize_Attributes);
Serialize (Into, "handleLogout", Value.Handle_Logout);
Serialize (Into, "logoutUrl", Value.Logout_Url);
Serialize (Into, "clockTolerance", Value.Clock_Tolerance);
Serialize (Into, "digestMethod", Value.Digest_Method);
Serialize (Into, "signatureMethod", Value.Signature_Method);
Serialize (Into, "userIntermediatePath", Value.User_Intermediate_Path);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in SamlConfigurationProperties_Type_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out SamlConfigurationProperties_Type) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Deserialize (Object, "path", Value.Path);
Deserialize (Object, "service.ranking", Value.Service_Ranking);
Deserialize (Object, "idpUrl", Value.Idp_Url);
Deserialize (Object, "idpCertAlias", Value.Idp_Cert_Alias);
Deserialize (Object, "idpHttpRedirect", Value.Idp_Http_Redirect);
Deserialize (Object, "serviceProviderEntityId", Value.Service_Provider_Entity_Id);
Deserialize (Object, "assertionConsumerServiceURL", Value.Assertion_Consumer_Service_URL);
Deserialize (Object, "spPrivateKeyAlias", Value.Sp_Private_Key_Alias);
Deserialize (Object, "keyStorePassword", Value.Key_Store_Password);
Deserialize (Object, "defaultRedirectUrl", Value.Default_Redirect_Url);
Deserialize (Object, "userIDAttribute", Value.User_IDAttribute);
Deserialize (Object, "useEncryption", Value.Use_Encryption);
Deserialize (Object, "createUser", Value.Create_User);
Deserialize (Object, "addGroupMemberships", Value.Add_Group_Memberships);
Deserialize (Object, "groupMembershipAttribute", Value.Group_Membership_Attribute);
Deserialize (Object, "defaultGroups", Value.Default_Groups);
Deserialize (Object, "nameIdFormat", Value.Name_Id_Format);
Deserialize (Object, "synchronizeAttributes", Value.Synchronize_Attributes);
Deserialize (Object, "handleLogout", Value.Handle_Logout);
Deserialize (Object, "logoutUrl", Value.Logout_Url);
Deserialize (Object, "clockTolerance", Value.Clock_Tolerance);
Deserialize (Object, "digestMethod", Value.Digest_Method);
Deserialize (Object, "signatureMethod", Value.Signature_Method);
Deserialize (Object, "userIntermediatePath", Value.User_Intermediate_Path);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out SamlConfigurationProperties_Type_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : SamlConfigurationProperties_Type;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in SamlConfigurationInfo_Type) is
begin
Into.Start_Entity (Name);
Into.Write_Entity ("pid", Value.Pid);
Into.Write_Entity ("title", Value.Title);
Into.Write_Entity ("description", Value.Description);
Into.Write_Entity ("bundle_location", Value.Bundle_Location);
Into.Write_Entity ("service_location", Value.Service_Location);
Serialize (Into, "properties", Value.Properties);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in SamlConfigurationInfo_Type_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out SamlConfigurationInfo_Type) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Swagger.Streams.Deserialize (Object, "pid", Value.Pid);
Swagger.Streams.Deserialize (Object, "title", Value.Title);
Swagger.Streams.Deserialize (Object, "description", Value.Description);
Swagger.Streams.Deserialize (Object, "bundle_location", Value.Bundle_Location);
Swagger.Streams.Deserialize (Object, "service_location", Value.Service_Location);
Deserialize (Object, "properties", Value.Properties);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out SamlConfigurationInfo_Type_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : SamlConfigurationInfo_Type;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BundleDataProp_Type) is
begin
Into.Start_Entity (Name);
Into.Write_Entity ("key", Value.Key);
Into.Write_Entity ("value", Value.Value);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BundleDataProp_Type_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BundleDataProp_Type) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Swagger.Streams.Deserialize (Object, "key", Value.Key);
Swagger.Streams.Deserialize (Object, "value", Value.Value);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BundleDataProp_Type_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : BundleDataProp_Type;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BundleData_Type) is
begin
Into.Start_Entity (Name);
Into.Write_Entity ("id", Value.Id);
Into.Write_Entity ("name", Value.Name);
Into.Write_Entity ("fragment", Value.Fragment);
Into.Write_Entity ("stateRaw", Value.State_Raw);
Into.Write_Entity ("state", Value.State);
Into.Write_Entity ("version", Value.Version);
Into.Write_Entity ("symbolicName", Value.Symbolic_Name);
Into.Write_Entity ("category", Value.Category);
Serialize (Into, "props", Value.Props);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BundleData_Type_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BundleData_Type) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Swagger.Streams.Deserialize (Object, "id", Value.Id);
Swagger.Streams.Deserialize (Object, "name", Value.Name);
Swagger.Streams.Deserialize (Object, "fragment", Value.Fragment);
Swagger.Streams.Deserialize (Object, "stateRaw", Value.State_Raw);
Swagger.Streams.Deserialize (Object, "state", Value.State);
Swagger.Streams.Deserialize (Object, "version", Value.Version);
Swagger.Streams.Deserialize (Object, "symbolicName", Value.Symbolic_Name);
Swagger.Streams.Deserialize (Object, "category", Value.Category);
Deserialize (Object, "props", Value.Props);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BundleData_Type_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : BundleData_Type;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BundleInfo_Type) is
begin
Into.Start_Entity (Name);
Into.Write_Entity ("status", Value.Status);
Serialize (Into, "s", Value.S);
Serialize (Into, "data", Value.Data);
Into.End_Entity (Name);
end Serialize;
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BundleInfo_Type_Vectors.Vector) is
begin
Into.Start_Array (Name);
for Item of Value loop
Serialize (Into, "", Item);
end loop;
Into.End_Array (Name);
end Serialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BundleInfo_Type) is
Object : Swagger.Value_Type;
begin
Swagger.Streams.Deserialize (From, Name, Object);
Swagger.Streams.Deserialize (Object, "status", Value.Status);
Swagger.Streams.Deserialize (Object, "s", Value.S);
Deserialize (Object, "data", Value.Data);
end Deserialize;
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BundleInfo_Type_Vectors.Vector) is
List : Swagger.Value_Array_Type;
Item : BundleInfo_Type;
begin
Value.Clear;
Swagger.Streams.Deserialize (From, Name, List);
for Data of List loop
Deserialize (Data, "", Item);
Value.Append (Item);
end loop;
end Deserialize;
end .Models;
| 38.240924 | 99 | 0.627888 |
c72d2d3be6bda66f4a24d703b91b5182fc6ccd71 | 18,838 | adb | Ada | src/asis/asis-clauses.adb | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 15 | 2015-01-18T23:04:19.000Z | 2022-03-01T20:27:08.000Z | src/asis/asis-clauses.adb | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 16 | 2018-06-10T07:09:30.000Z | 2022-03-26T18:28:40.000Z | src/asis/asis-clauses.adb | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 3 | 2015-11-11T18:00:14.000Z | 2022-01-30T23:08:45.000Z | ------------------------------------------------------------------------------
-- --
-- ASIS-for-GNAT IMPLEMENTATION COMPONENTS --
-- --
-- A S I S . C L A U S E S --
-- --
-- B o d y --
-- --
-- Copyright (C) 1995-2012, Free Software Foundation, Inc. --
-- --
-- ASIS-for-GNAT is free software; you can redistribute it and/or modify it --
-- under terms of the GNU General Public License as published by the Free --
-- Software Foundation; either version 2, or (at your option) any later --
-- version. ASIS-for-GNAT is distributed in the hope that it will be use- --
-- ful, but WITHOUT ANY WARRANTY; without even the implied warranty of MER- --
-- CHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General --
-- Public License for more details. You should have received a copy of the --
-- GNU General Public License distributed with ASIS-for-GNAT; see file --
-- COPYING. If not, write to the Free Software Foundation, 51 Franklin --
-- Street, Fifth Floor, Boston, MA 02110-1301, USA. --
-- --
-- --
-- --
-- --
-- --
-- --
-- --
-- --
-- ASIS-for-GNAT was originally developed by the ASIS-for-GNAT team at the --
-- Software Engineering Laboratory of the Swiss Federal Institute of --
-- Technology (LGL-EPFL) in Lausanne, Switzerland, in cooperation with the --
-- Scientific Research Computer Center of Moscow State University (SRCC --
-- MSU), Russia, with funding partially provided by grants from the Swiss --
-- National Science Foundation and the Swiss Academy of Engineering --
-- Sciences. ASIS-for-GNAT is now maintained by AdaCore --
-- (http://www.adacore.com). --
-- --
------------------------------------------------------------------------------
with Asis.Errors; use Asis.Errors;
with Asis.Exceptions; use Asis.Exceptions;
with Asis.Set_Get; use Asis.Set_Get;
with A4G.Mapping; use A4G.Mapping;
with A4G.Vcheck; use A4G.Vcheck;
with Atree; use Atree;
with Namet; use Namet;
with Nlists; use Nlists;
with Sinfo; use Sinfo;
with Snames; use Snames;
package body Asis.Clauses is
Package_Name : constant String := "Asis.Clauses.";
------------------
-- Clause_Names --
------------------
function Clause_Names (Clause : Asis.Element) return Asis.Element_List is
Arg_Kind : constant Internal_Element_Kinds := Int_Kind (Clause);
Arg_Node : Node_Id;
Result_List : List_Id;
Result_Len : Natural := 1;
Withed_Uname : Node_Id;
begin
Check_Validity (Clause, Package_Name & "Clause_Names");
if not (Arg_Kind = A_Use_Package_Clause or else
Arg_Kind = A_Use_Type_Clause or else
Arg_Kind = A_Use_All_Type_Clause or else -- Ada 2012
Arg_Kind = A_With_Clause)
then
Raise_ASIS_Inappropriate_Element
(Package_Name & "Clause_Names",
Wrong_Kind => Arg_Kind);
end if;
Arg_Node := Node (Clause);
if Arg_Kind = A_With_Clause then
-- first, computing the number of names listed in the argument
-- with clause
-- Note that we should skip implicit with cleause that may be added
-- by front-end
while not (Comes_From_Source (Arg_Node)
and then
Last_Name (Arg_Node))
loop
if Comes_From_Source (Arg_Node) then
Result_Len := Result_Len + 1;
end if;
Arg_Node := Next (Arg_Node);
end loop;
declare
Result_List : Asis.Element_List (1 .. Result_Len);
begin
Arg_Node := Node (Clause);
for I in 1 .. Result_Len loop
Withed_Uname := Sinfo.Name (Arg_Node);
Result_List (I) := Node_To_Element_New
(Starting_Element => Clause,
Node => Withed_Uname);
Arg_Node := Next (Arg_Node);
while Present (Arg_Node)
and then
not Comes_From_Source (Arg_Node)
loop
Arg_Node := Next (Arg_Node);
end loop;
end loop;
return Result_List;
end;
else
if Nkind (Arg_Node) = N_Use_Package_Clause then
Result_List := Names (Arg_Node);
else
Result_List := Subtype_Marks (Arg_Node);
end if;
return N_To_E_List_New (List => Result_List,
Starting_Element => Clause);
end if;
exception
when ASIS_Inappropriate_Element =>
raise;
when ASIS_Failed =>
if Status_Indicator = Unhandled_Exception_Error then
Add_Call_Information
(Outer_Call => Package_Name & "Clause_Names",
Argument => Clause);
end if;
raise;
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Clause_Names",
Ex => Ex,
Arg_Element => Clause);
end Clause_Names;
-------------------------------
-- Component_Clause_Position --
-------------------------------
function Component_Clause_Position
(Clause : Asis.Component_Clause)
return Asis.Expression
is
Arg_Kind : constant Internal_Element_Kinds := Int_Kind (Clause);
Arg_Node : Node_Id;
begin
Check_Validity (Clause, Package_Name & "Component_Clause_Position");
if not (Arg_Kind = A_Component_Clause) then
Raise_ASIS_Inappropriate_Element
(Package_Name & "Component_Clause_Position",
Wrong_Kind => Arg_Kind);
end if;
Arg_Node := Node (Clause);
return Node_To_Element_New (Node => Position (Arg_Node),
Starting_Element => Clause);
exception
when ASIS_Inappropriate_Element =>
raise;
when ASIS_Failed =>
if Status_Indicator = Unhandled_Exception_Error then
Add_Call_Information
(Outer_Call => Package_Name & "Component_Clause_Position",
Argument => Clause);
end if;
raise;
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Component_Clause_Position",
Ex => Ex,
Arg_Element => Clause);
end Component_Clause_Position;
----------------------------
-- Component_Clause_Range --
----------------------------
function Component_Clause_Range
(Clause : Asis.Component_Clause)
return Asis.Discrete_Range
is
Arg_Kind : constant Internal_Element_Kinds := Int_Kind (Clause);
Arg_Node : Node_Id;
begin
Check_Validity (Clause, Package_Name & "Component_Clause_Range");
if not (Arg_Kind = A_Component_Clause) then
Raise_ASIS_Inappropriate_Element
(Package_Name & "Component_Clause_Range",
Wrong_Kind => Arg_Kind);
end if;
Arg_Node := Node (Clause);
return Node_To_Element_New
(Node => Arg_Node,
Internal_Kind => A_Discrete_Simple_Expression_Range,
Starting_Element => Clause);
exception
when ASIS_Inappropriate_Element =>
raise;
when ASIS_Failed =>
if Status_Indicator = Unhandled_Exception_Error then
Add_Call_Information
(Outer_Call => Package_Name & "Component_Clause_Range",
Argument => Clause);
end if;
raise;
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Component_Clause_Range",
Ex => Ex,
Arg_Element => Clause);
end Component_Clause_Range;
-----------------------
-- Component_Clauses --
-----------------------
function Component_Clauses
(Clause : Asis.Representation_Clause;
Include_Pragmas : Boolean := False)
return Asis.Component_Clause_List
is
Arg_Kind : constant Internal_Element_Kinds := Int_Kind (Clause);
Arg_Node : Node_Id;
begin
Check_Validity (Clause, Package_Name & "Component_Clauses");
if not (Arg_Kind = A_Record_Representation_Clause) then
Raise_ASIS_Inappropriate_Element
(Package_Name & "Component_Clauses",
Wrong_Kind => Arg_Kind);
end if;
Arg_Node := Node (Clause);
return N_To_E_List_New
(List => Component_Clauses (Arg_Node),
Include_Pragmas => Include_Pragmas,
Starting_Element => Clause);
exception
when ASIS_Inappropriate_Element =>
raise;
when ASIS_Failed =>
if Status_Indicator = Unhandled_Exception_Error then
Add_Call_Information
(Outer_Call => Package_Name & "Component_Clauses",
Argument => Clause,
Bool_Par => Include_Pragmas);
end if;
raise;
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Component_Clauses",
Ex => Ex,
Arg_Element => Clause,
Bool_Par_ON => Include_Pragmas);
end Component_Clauses;
---------------------------
-- Mod_Clause_Expression --
---------------------------
function Mod_Clause_Expression
(Clause : Asis.Representation_Clause)
return Asis.Expression
is
Arg_Kind : constant Internal_Element_Kinds := Int_Kind (Clause);
Arg_Node : Node_Id;
Mod_Clause_Node : Node_Id;
begin
Check_Validity (Clause, Package_Name & "Mod_Clause_Expression");
if not (Arg_Kind = A_Record_Representation_Clause) then
Raise_ASIS_Inappropriate_Element
(Package_Name & "Mod_Clause_Expression",
Wrong_Kind => Arg_Kind);
end if;
Arg_Node := Node (Clause);
Mod_Clause_Node := Next (Arg_Node);
if Nkind (Mod_Clause_Node) = N_Attribute_Definition_Clause and then
From_At_Mod (Mod_Clause_Node)
then
Mod_Clause_Node := Sinfo.Expression (Mod_Clause_Node);
else
Mod_Clause_Node := Empty;
end if;
if No (Mod_Clause_Node) then
return Asis.Nil_Element;
else
return Node_To_Element_New
(Node => Mod_Clause_Node,
Starting_Element => Clause);
end if;
exception
when ASIS_Inappropriate_Element =>
raise;
when ASIS_Failed =>
if Status_Indicator = Unhandled_Exception_Error then
Add_Call_Information
(Outer_Call => Package_Name & "Mod_Clause_Expression",
Argument => Clause);
end if;
raise;
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Mod_Clause_Expression",
Ex => Ex,
Arg_Element => Clause);
end Mod_Clause_Expression;
--------------------------------------
-- Representation_Clause_Expression --
--------------------------------------
function Representation_Clause_Expression
(Clause : Asis.Representation_Clause)
return Asis.Expression
is
Arg_Kind : constant Internal_Element_Kinds := Int_Kind (Clause);
Arg_Node : Node_Id;
Result_Node : Node_Id;
Result_Kind : Internal_Element_Kinds := Not_An_Element;
begin
Check_Validity (Clause,
Package_Name & "Representation_Clause_Expression");
if not (Arg_Kind = An_Attribute_Definition_Clause or else
Arg_Kind = An_Enumeration_Representation_Clause or else
Arg_Kind = An_At_Clause)
then
Raise_ASIS_Inappropriate_Element
(Package_Name & "Representation_Clause_Expression",
Wrong_Kind => Arg_Kind);
end if;
Arg_Node := Node (Clause);
if Nkind (Arg_Node) = N_Enumeration_Representation_Clause then
Result_Node := Array_Aggregate (Arg_Node);
if Present (Expressions (Result_Node)) then
Result_Kind := A_Positional_Array_Aggregate;
else
Result_Kind := A_Named_Array_Aggregate;
end if;
else
Result_Node := Sinfo.Expression (Arg_Node);
end if;
return Node_To_Element_New (Node => Result_Node,
Internal_Kind => Result_Kind,
Starting_Element => Clause);
exception
when ASIS_Inappropriate_Element =>
raise;
when ASIS_Failed =>
if Status_Indicator = Unhandled_Exception_Error then
Add_Call_Information
(Outer_Call => Package_Name & "Representation_Clause_Expression",
Argument => Clause);
end if;
raise;
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Representation_Clause_Expression",
Ex => Ex,
Arg_Element => Clause);
end Representation_Clause_Expression;
--------------------------------
-- Representation_Clause_Name --
--------------------------------
function Representation_Clause_Name
(Clause : Asis.Clause)
return Asis.Name
is
Arg_Kind : constant Internal_Element_Kinds := Int_Kind (Clause);
Arg_Node : Node_Id;
Result_Node : Node_Id;
Result_Element : Element;
Result_Kind : Internal_Element_Kinds := Not_An_Element;
Attr_Des : Name_Id;
-- needed for special processing of attribute definition clause
begin
Check_Validity (Clause, Package_Name & "Representation_Clause_Name");
if not (Arg_Kind = An_Attribute_Definition_Clause or else
Arg_Kind = An_Enumeration_Representation_Clause or else
Arg_Kind = A_Record_Representation_Clause or else
Arg_Kind = An_At_Clause or else
Arg_Kind = A_Component_Clause)
then
Raise_ASIS_Inappropriate_Element
(Package_Name & "Representation_Clause_Name",
Wrong_Kind => Arg_Kind);
end if;
Arg_Node := Node (Clause);
if Nkind (Arg_Node) = N_Attribute_Definition_Clause then
-- for An_Attribute_Definition_Clause argument we have to return
-- as the result the Element of An_Attribute_Reference kind.
-- The tree does not contain the structures for attribute reference
-- in this case (and it should not, because, according to RM 95,
-- there is no attribute reference in the syntax structure of
-- an attribute definition clause, so we have to "emulate"
-- the result Elemet of An_Attribute_Reference kind on the base
-- of the same node
-- first, we have to define the exact kind of the "artificial"
-- attribute reference to be returned
Attr_Des := Chars (Arg_Node);
case Attr_Des is
when Name_Address =>
Result_Kind := An_Address_Attribute;
when Name_Alignment =>
Result_Kind := An_Alignment_Attribute;
when Name_Bit_Order =>
Result_Kind := A_Bit_Order_Attribute;
when Name_Component_Size =>
Result_Kind := A_Component_Size_Attribute;
when Name_External_Tag =>
Result_Kind := An_External_Tag_Attribute;
when Name_Input =>
Result_Kind := An_Input_Attribute;
when Name_Machine_Radix =>
Result_Kind := A_Machine_Radix_Attribute;
when Name_Output =>
Result_Kind := An_Output_Attribute;
when Name_Read =>
Result_Kind := A_Read_Attribute;
when Name_Size =>
Result_Kind := A_Size_Attribute;
when Name_Small =>
Result_Kind := A_Small_Attribute;
when Name_Storage_Size =>
Result_Kind := A_Storage_Size_Attribute;
when Name_Storage_Pool =>
Result_Kind := A_Storage_Pool_Attribute;
when Name_Write =>
Result_Kind := A_Write_Attribute;
when others =>
-- "others" means Name_Object_Size and Name_Value_Size
Result_Kind := An_Implementation_Defined_Attribute;
end case;
Result_Element := Clause;
Set_Int_Kind (Result_Element, Result_Kind);
return Result_Element;
elsif Nkind (Arg_Node) = N_Component_Clause then
Result_Node := Component_Name (Arg_Node);
else
Result_Node := Sinfo.Identifier (Arg_Node);
end if;
return Node_To_Element_New (Node => Result_Node,
Starting_Element => Clause);
exception
when ASIS_Inappropriate_Element =>
raise;
when ASIS_Failed =>
if Status_Indicator = Unhandled_Exception_Error then
Add_Call_Information
(Outer_Call => Package_Name & "Representation_Clause_Name",
Argument => Clause);
end if;
raise;
when Ex : others =>
Report_ASIS_Bug
(Query_Name => Package_Name & "Representation_Clause_Name",
Ex => Ex,
Arg_Element => Clause);
end Representation_Clause_Name;
end Asis.Clauses;
| 35.277154 | 79 | 0.538327 |
ad14abe7c37918f9164deae0178edc2f8755e4d5 | 3,083 | adb | Ada | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/g-ctrl_c.adb | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/g-ctrl_c.adb | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/g-ctrl_c.adb | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- G N A T . C T R L _ C --
-- --
-- B o d y --
-- --
-- Copyright (C) 2002-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. --
-- --
------------------------------------------------------------------------------
package body GNAT.Ctrl_C is
type C_Handler_Type is access procedure;
pragma Convention (C, C_Handler_Type);
Ada_Handler : Handler_Type;
procedure C_Handler;
pragma Convention (C, C_Handler);
---------------
-- C_Handler --
---------------
procedure C_Handler is
begin
Ada_Handler.all;
end C_Handler;
---------------------
-- Install_Handler --
---------------------
procedure Install_Handler (Handler : Handler_Type) is
procedure Internal (Handler : C_Handler_Type);
pragma Import (C, Internal, "__gnat_install_int_handler");
begin
Ada_Handler := Handler;
Internal (C_Handler'Access);
end Install_Handler;
end GNAT.Ctrl_C;
| 48.171875 | 78 | 0.415504 |
1eff16dfa12d382cf71daf111ed250332ff17bf8 | 3,484 | ads | Ada | arch/ARM/STM32/drivers/dma_interrupts/stm32-dma-interrupts.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 192 | 2016-06-01T18:32:04.000Z | 2022-03-26T22:52:31.000Z | arch/ARM/STM32/drivers/dma_interrupts/stm32-dma-interrupts.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 239 | 2016-05-26T20:02:01.000Z | 2022-03-31T09:46:56.000Z | arch/ARM/STM32/drivers/dma_interrupts/stm32-dma-interrupts.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2016-2018, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with Ada.Interrupts;
package STM32.DMA.Interrupts is
protected type DMA_Interrupt_Controller
(Controller : not null access DMA_Controller;
Stream : DMA_Stream_Selector;
ID : Ada.Interrupts.Interrupt_ID;
Priority : System.Interrupt_Priority)
is
pragma Interrupt_Priority (Priority);
procedure Start_Transfer (Source : Address;
Destination : Address;
Data_Count : UInt16);
procedure Abort_Transfer (Result : out DMA_Error_Code);
procedure Clear_Transfer_State;
function Buffer_Error return Boolean;
entry Wait_For_Completion (Status : out DMA_Error_Code);
private
procedure Interrupt_Handler;
pragma Attach_Handler (Interrupt_Handler, ID);
No_Transfer_In_Progess : Boolean := True;
Last_Status : DMA_Error_Code := DMA_No_Error;
Had_Buffer_Error : Boolean := False;
end DMA_Interrupt_Controller;
type DMA_Interrupt_Controller_Access is access all DMA_Interrupt_Controller;
end STM32.DMA.Interrupts;
| 50.492754 | 79 | 0.557979 |
adf0681e95d7b45f4d53992fc77656eccc1cc058 | 824 | ads | Ada | firmware/coreboot/3rdparty/libgfxinit/common/hw-gfx-gma-port_detect.ads | fabiojna02/OpenCellular | 45b6a202d6b2e2485c89955b9a6da920c4d56ddb | [
"CC-BY-4.0",
"BSD-3-Clause"
] | 1 | 2019-11-04T07:11:25.000Z | 2019-11-04T07:11:25.000Z | firmware/coreboot/3rdparty/libgfxinit/common/hw-gfx-gma-port_detect.ads | aimin-wang/OpenCellular | 5308146bf7edf43cc81c0e4d15305b711117070a | [
"CC-BY-4.0",
"BSD-3-Clause"
] | 13 | 2018-10-12T21:29:09.000Z | 2018-10-25T20:06:51.000Z | firmware/coreboot/3rdparty/libgfxinit/common/hw-gfx-gma-port_detect.ads | aimin-wang/OpenCellular | 5308146bf7edf43cc81c0e4d15305b711117070a | [
"CC-BY-4.0",
"BSD-3-Clause"
] | null | null | null | --
-- Copyright (C) 2016-2017 secunet Security Networks AG
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 2 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
private package HW.GFX.GMA.Port_Detect is
procedure Initialize;
procedure Hotplug_Detect
(Port : in Active_Port_Type;
Detected : out Boolean);
procedure Clear_Hotplug_Detect (Port : Active_Port_Type);
end HW.GFX.GMA.Port_Detect;
| 31.692308 | 71 | 0.745146 |
389bccf2feeeaa48da1a856ec450a90073f5f7dd | 23,007 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-chzla9.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-chzla9.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-chzla9.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . C H A R A C T E R S . W I D E _ W I D E _ L A T I N _ 9 --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package provides definitions analogous to those in the GNAT package
-- Ada.Characters.Latin_9 except that the type of the various constants is
-- Wide_Wide_Character instead of Character. The provision of this package
-- is in accordance with the implementation permission in RM (A.3.3(27)).
package Ada.Characters.Wide_Wide_Latin_9 is
pragma Pure;
------------------------
-- Control Characters --
------------------------
NUL : constant Wide_Wide_Character := Wide_Wide_Character'Val (0);
SOH : constant Wide_Wide_Character := Wide_Wide_Character'Val (1);
STX : constant Wide_Wide_Character := Wide_Wide_Character'Val (2);
ETX : constant Wide_Wide_Character := Wide_Wide_Character'Val (3);
EOT : constant Wide_Wide_Character := Wide_Wide_Character'Val (4);
ENQ : constant Wide_Wide_Character := Wide_Wide_Character'Val (5);
ACK : constant Wide_Wide_Character := Wide_Wide_Character'Val (6);
BEL : constant Wide_Wide_Character := Wide_Wide_Character'Val (7);
BS : constant Wide_Wide_Character := Wide_Wide_Character'Val (8);
HT : constant Wide_Wide_Character := Wide_Wide_Character'Val (9);
LF : constant Wide_Wide_Character := Wide_Wide_Character'Val (10);
VT : constant Wide_Wide_Character := Wide_Wide_Character'Val (11);
FF : constant Wide_Wide_Character := Wide_Wide_Character'Val (12);
CR : constant Wide_Wide_Character := Wide_Wide_Character'Val (13);
SO : constant Wide_Wide_Character := Wide_Wide_Character'Val (14);
SI : constant Wide_Wide_Character := Wide_Wide_Character'Val (15);
DLE : constant Wide_Wide_Character := Wide_Wide_Character'Val (16);
DC1 : constant Wide_Wide_Character := Wide_Wide_Character'Val (17);
DC2 : constant Wide_Wide_Character := Wide_Wide_Character'Val (18);
DC3 : constant Wide_Wide_Character := Wide_Wide_Character'Val (19);
DC4 : constant Wide_Wide_Character := Wide_Wide_Character'Val (20);
NAK : constant Wide_Wide_Character := Wide_Wide_Character'Val (21);
SYN : constant Wide_Wide_Character := Wide_Wide_Character'Val (22);
ETB : constant Wide_Wide_Character := Wide_Wide_Character'Val (23);
CAN : constant Wide_Wide_Character := Wide_Wide_Character'Val (24);
EM : constant Wide_Wide_Character := Wide_Wide_Character'Val (25);
SUB : constant Wide_Wide_Character := Wide_Wide_Character'Val (26);
ESC : constant Wide_Wide_Character := Wide_Wide_Character'Val (27);
FS : constant Wide_Wide_Character := Wide_Wide_Character'Val (28);
GS : constant Wide_Wide_Character := Wide_Wide_Character'Val (29);
RS : constant Wide_Wide_Character := Wide_Wide_Character'Val (30);
US : constant Wide_Wide_Character := Wide_Wide_Character'Val (31);
-------------------------------------
-- ISO 646 Graphic Wide_Wide_Characters --
-------------------------------------
Space : constant Wide_Wide_Character := ' '; -- WC'Val(32)
Exclamation : constant Wide_Wide_Character := '!'; -- WC'Val(33)
Quotation : constant Wide_Wide_Character := '"'; -- WC'Val(34)
Number_Sign : constant Wide_Wide_Character := '#'; -- WC'Val(35)
Dollar_Sign : constant Wide_Wide_Character := '$'; -- WC'Val(36)
Percent_Sign : constant Wide_Wide_Character := '%'; -- WC'Val(37)
Ampersand : constant Wide_Wide_Character := '&'; -- WC'Val(38)
Apostrophe : constant Wide_Wide_Character := '''; -- WC'Val(39)
Left_Parenthesis : constant Wide_Wide_Character := '('; -- WC'Val(40)
Right_Parenthesis : constant Wide_Wide_Character := ')'; -- WC'Val(41)
Asterisk : constant Wide_Wide_Character := '*'; -- WC'Val(42)
Plus_Sign : constant Wide_Wide_Character := '+'; -- WC'Val(43)
Comma : constant Wide_Wide_Character := ','; -- WC'Val(44)
Hyphen : constant Wide_Wide_Character := '-'; -- WC'Val(45)
Minus_Sign : Wide_Wide_Character renames Hyphen;
Full_Stop : constant Wide_Wide_Character := '.'; -- WC'Val(46)
Solidus : constant Wide_Wide_Character := '/'; -- WC'Val(47)
-- Decimal digits '0' though '9' are at positions 48 through 57
Colon : constant Wide_Wide_Character := ':'; -- WC'Val(58)
Semicolon : constant Wide_Wide_Character := ';'; -- WC'Val(59)
Less_Than_Sign : constant Wide_Wide_Character := '<'; -- WC'Val(60)
Equals_Sign : constant Wide_Wide_Character := '='; -- WC'Val(61)
Greater_Than_Sign : constant Wide_Wide_Character := '>'; -- WC'Val(62)
Question : constant Wide_Wide_Character := '?'; -- WC'Val(63)
Commercial_At : constant Wide_Wide_Character := '@'; -- WC'Val(64)
-- Letters 'A' through 'Z' are at positions 65 through 90
Left_Square_Bracket : constant Wide_Wide_Character := '['; -- WC'Val (91)
Reverse_Solidus : constant Wide_Wide_Character := '\'; -- WC'Val (92)
Right_Square_Bracket : constant Wide_Wide_Character := ']'; -- WC'Val (93)
Circumflex : constant Wide_Wide_Character := '^'; -- WC'Val (94)
Low_Line : constant Wide_Wide_Character := '_'; -- WC'Val (95)
Grave : constant Wide_Wide_Character := '`'; -- WC'Val (96)
LC_A : constant Wide_Wide_Character := 'a'; -- WC'Val (97)
LC_B : constant Wide_Wide_Character := 'b'; -- WC'Val (98)
LC_C : constant Wide_Wide_Character := 'c'; -- WC'Val (99)
LC_D : constant Wide_Wide_Character := 'd'; -- WC'Val (100)
LC_E : constant Wide_Wide_Character := 'e'; -- WC'Val (101)
LC_F : constant Wide_Wide_Character := 'f'; -- WC'Val (102)
LC_G : constant Wide_Wide_Character := 'g'; -- WC'Val (103)
LC_H : constant Wide_Wide_Character := 'h'; -- WC'Val (104)
LC_I : constant Wide_Wide_Character := 'i'; -- WC'Val (105)
LC_J : constant Wide_Wide_Character := 'j'; -- WC'Val (106)
LC_K : constant Wide_Wide_Character := 'k'; -- WC'Val (107)
LC_L : constant Wide_Wide_Character := 'l'; -- WC'Val (108)
LC_M : constant Wide_Wide_Character := 'm'; -- WC'Val (109)
LC_N : constant Wide_Wide_Character := 'n'; -- WC'Val (110)
LC_O : constant Wide_Wide_Character := 'o'; -- WC'Val (111)
LC_P : constant Wide_Wide_Character := 'p'; -- WC'Val (112)
LC_Q : constant Wide_Wide_Character := 'q'; -- WC'Val (113)
LC_R : constant Wide_Wide_Character := 'r'; -- WC'Val (114)
LC_S : constant Wide_Wide_Character := 's'; -- WC'Val (115)
LC_T : constant Wide_Wide_Character := 't'; -- WC'Val (116)
LC_U : constant Wide_Wide_Character := 'u'; -- WC'Val (117)
LC_V : constant Wide_Wide_Character := 'v'; -- WC'Val (118)
LC_W : constant Wide_Wide_Character := 'w'; -- WC'Val (119)
LC_X : constant Wide_Wide_Character := 'x'; -- WC'Val (120)
LC_Y : constant Wide_Wide_Character := 'y'; -- WC'Val (121)
LC_Z : constant Wide_Wide_Character := 'z'; -- WC'Val (122)
Left_Curly_Bracket : constant Wide_Wide_Character := '{'; -- WC'Val (123)
Vertical_Line : constant Wide_Wide_Character := '|'; -- WC'Val (124)
Right_Curly_Bracket : constant Wide_Wide_Character := '}'; -- WC'Val (125)
Tilde : constant Wide_Wide_Character := '~'; -- WC'Val (126)
DEL : constant Wide_Wide_Character :=
Wide_Wide_Character'Val (127);
--------------------------------------
-- ISO 6429 Control Wide_Wide_Characters --
--------------------------------------
IS4 : Wide_Wide_Character renames FS;
IS3 : Wide_Wide_Character renames GS;
IS2 : Wide_Wide_Character renames RS;
IS1 : Wide_Wide_Character renames US;
Reserved_128
: constant Wide_Wide_Character := Wide_Wide_Character'Val (128);
Reserved_129
: constant Wide_Wide_Character := Wide_Wide_Character'Val (129);
BPH : constant Wide_Wide_Character := Wide_Wide_Character'Val (130);
NBH : constant Wide_Wide_Character := Wide_Wide_Character'Val (131);
Reserved_132
: constant Wide_Wide_Character := Wide_Wide_Character'Val (132);
NEL : constant Wide_Wide_Character := Wide_Wide_Character'Val (133);
SSA : constant Wide_Wide_Character := Wide_Wide_Character'Val (134);
ESA : constant Wide_Wide_Character := Wide_Wide_Character'Val (135);
HTS : constant Wide_Wide_Character := Wide_Wide_Character'Val (136);
HTJ : constant Wide_Wide_Character := Wide_Wide_Character'Val (137);
VTS : constant Wide_Wide_Character := Wide_Wide_Character'Val (138);
PLD : constant Wide_Wide_Character := Wide_Wide_Character'Val (139);
PLU : constant Wide_Wide_Character := Wide_Wide_Character'Val (140);
RI : constant Wide_Wide_Character := Wide_Wide_Character'Val (141);
SS2 : constant Wide_Wide_Character := Wide_Wide_Character'Val (142);
SS3 : constant Wide_Wide_Character := Wide_Wide_Character'Val (143);
DCS : constant Wide_Wide_Character := Wide_Wide_Character'Val (144);
PU1 : constant Wide_Wide_Character := Wide_Wide_Character'Val (145);
PU2 : constant Wide_Wide_Character := Wide_Wide_Character'Val (146);
STS : constant Wide_Wide_Character := Wide_Wide_Character'Val (147);
CCH : constant Wide_Wide_Character := Wide_Wide_Character'Val (148);
MW : constant Wide_Wide_Character := Wide_Wide_Character'Val (149);
SPA : constant Wide_Wide_Character := Wide_Wide_Character'Val (150);
EPA : constant Wide_Wide_Character := Wide_Wide_Character'Val (151);
SOS : constant Wide_Wide_Character := Wide_Wide_Character'Val (152);
Reserved_153
: constant Wide_Wide_Character := Wide_Wide_Character'Val (153);
SCI : constant Wide_Wide_Character := Wide_Wide_Character'Val (154);
CSI : constant Wide_Wide_Character := Wide_Wide_Character'Val (155);
ST : constant Wide_Wide_Character := Wide_Wide_Character'Val (156);
OSC : constant Wide_Wide_Character := Wide_Wide_Character'Val (157);
PM : constant Wide_Wide_Character := Wide_Wide_Character'Val (158);
APC : constant Wide_Wide_Character := Wide_Wide_Character'Val (159);
-----------------------------------
-- Other Graphic Wide_Wide_Characters --
-----------------------------------
-- Wide_Wide_Character positions 160 (16#A0#) .. 175 (16#AF#)
No_Break_Space
: constant Wide_Wide_Character := Wide_Wide_Character'Val (160);
NBSP : Wide_Wide_Character renames No_Break_Space;
Inverted_Exclamation
: constant Wide_Wide_Character := Wide_Wide_Character'Val (161);
Cent_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (162);
Pound_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (163);
Euro_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (164);
Yen_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (165);
UC_S_Caron : constant Wide_Wide_Character := Wide_Wide_Character'Val (166);
Section_Sign
: constant Wide_Wide_Character := Wide_Wide_Character'Val (167);
LC_S_Caron : constant Wide_Wide_Character := Wide_Wide_Character'Val (168);
Copyright_Sign
: constant Wide_Wide_Character := Wide_Wide_Character'Val (169);
Feminine_Ordinal_Indicator
: constant Wide_Wide_Character := Wide_Wide_Character'Val (170);
Left_Angle_Quotation
: constant Wide_Wide_Character := Wide_Wide_Character'Val (171);
Not_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (172);
Soft_Hyphen : constant Wide_Wide_Character := Wide_Wide_Character'Val (173);
Registered_Trade_Mark_Sign
: constant Wide_Wide_Character := Wide_Wide_Character'Val (174);
Macron : constant Wide_Wide_Character := Wide_Wide_Character'Val (175);
-- Wide_Wide_Character positions 176 (16#B0#) .. 191 (16#BF#)
Degree_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (176);
Ring_Above : Wide_Wide_Character renames Degree_Sign;
Plus_Minus_Sign
: constant Wide_Wide_Character := Wide_Wide_Character'Val (177);
Superscript_Two
: constant Wide_Wide_Character := Wide_Wide_Character'Val (178);
Superscript_Three
: constant Wide_Wide_Character := Wide_Wide_Character'Val (179);
UC_Z_Caron : constant Wide_Wide_Character := Wide_Wide_Character'Val (180);
Micro_Sign : constant Wide_Wide_Character := Wide_Wide_Character'Val (181);
Pilcrow_Sign
: constant Wide_Wide_Character := Wide_Wide_Character'Val (182);
Paragraph_Sign
: Wide_Wide_Character renames Pilcrow_Sign;
Middle_Dot : constant Wide_Wide_Character := Wide_Wide_Character'Val (183);
LC_Z_Caron : constant Wide_Wide_Character := Wide_Wide_Character'Val (184);
Superscript_One
: constant Wide_Wide_Character := Wide_Wide_Character'Val (185);
Masculine_Ordinal_Indicator
: constant Wide_Wide_Character := Wide_Wide_Character'Val (186);
Right_Angle_Quotation
: constant Wide_Wide_Character := Wide_Wide_Character'Val (187);
UC_Ligature_OE
: constant Wide_Wide_Character := Wide_Wide_Character'Val (188);
LC_Ligature_OE
: constant Wide_Wide_Character := Wide_Wide_Character'Val (189);
UC_Y_Diaeresis
: constant Wide_Wide_Character := Wide_Wide_Character'Val (190);
Inverted_Question
: constant Wide_Wide_Character := Wide_Wide_Character'Val (191);
-- Wide_Wide_Character positions 192 (16#C0#) .. 207 (16#CF#)
UC_A_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (192);
UC_A_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (193);
UC_A_Circumflex
: constant Wide_Wide_Character := Wide_Wide_Character'Val (194);
UC_A_Tilde : constant Wide_Wide_Character := Wide_Wide_Character'Val (195);
UC_A_Diaeresis
: constant Wide_Wide_Character := Wide_Wide_Character'Val (196);
UC_A_Ring : constant Wide_Wide_Character := Wide_Wide_Character'Val (197);
UC_AE_Diphthong
: constant Wide_Wide_Character := Wide_Wide_Character'Val (198);
UC_C_Cedilla
: constant Wide_Wide_Character := Wide_Wide_Character'Val (199);
UC_E_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (200);
UC_E_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (201);
UC_E_Circumflex
: constant Wide_Wide_Character := Wide_Wide_Character'Val (202);
UC_E_Diaeresis
: constant Wide_Wide_Character := Wide_Wide_Character'Val (203);
UC_I_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (204);
UC_I_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (205);
UC_I_Circumflex
: constant Wide_Wide_Character := Wide_Wide_Character'Val (206);
UC_I_Diaeresis
: constant Wide_Wide_Character := Wide_Wide_Character'Val (207);
-- Wide_Wide_Character positions 208 (16#D0#) .. 223 (16#DF#)
UC_Icelandic_Eth
: constant Wide_Wide_Character := Wide_Wide_Character'Val (208);
UC_N_Tilde : constant Wide_Wide_Character := Wide_Wide_Character'Val (209);
UC_O_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (210);
UC_O_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (211);
UC_O_Circumflex
: constant Wide_Wide_Character := Wide_Wide_Character'Val (212);
UC_O_Tilde : constant Wide_Wide_Character := Wide_Wide_Character'Val (213);
UC_O_Diaeresis
: constant Wide_Wide_Character := Wide_Wide_Character'Val (214);
Multiplication_Sign
: constant Wide_Wide_Character := Wide_Wide_Character'Val (215);
UC_O_Oblique_Stroke
: constant Wide_Wide_Character := Wide_Wide_Character'Val (216);
UC_U_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (217);
UC_U_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (218);
UC_U_Circumflex
: constant Wide_Wide_Character := Wide_Wide_Character'Val (219);
UC_U_Diaeresis
: constant Wide_Wide_Character := Wide_Wide_Character'Val (220);
UC_Y_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (221);
UC_Icelandic_Thorn
: constant Wide_Wide_Character := Wide_Wide_Character'Val (222);
LC_German_Sharp_S
: constant Wide_Wide_Character := Wide_Wide_Character'Val (223);
-- Wide_Wide_Character positions 224 (16#E0#) .. 239 (16#EF#)
LC_A_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (224);
LC_A_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (225);
LC_A_Circumflex
: constant Wide_Wide_Character := Wide_Wide_Character'Val (226);
LC_A_Tilde : constant Wide_Wide_Character := Wide_Wide_Character'Val (227);
LC_A_Diaeresis
: constant Wide_Wide_Character := Wide_Wide_Character'Val (228);
LC_A_Ring : constant Wide_Wide_Character := Wide_Wide_Character'Val (229);
LC_AE_Diphthong
: constant Wide_Wide_Character := Wide_Wide_Character'Val (230);
LC_C_Cedilla
: constant Wide_Wide_Character := Wide_Wide_Character'Val (231);
LC_E_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (232);
LC_E_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (233);
LC_E_Circumflex
: constant Wide_Wide_Character := Wide_Wide_Character'Val (234);
LC_E_Diaeresis
: constant Wide_Wide_Character := Wide_Wide_Character'Val (235);
LC_I_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (236);
LC_I_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (237);
LC_I_Circumflex
: constant Wide_Wide_Character := Wide_Wide_Character'Val (238);
LC_I_Diaeresis
: constant Wide_Wide_Character := Wide_Wide_Character'Val (239);
-- Wide_Wide_Character positions 240 (16#F0#) .. 255 (16#FF)
LC_Icelandic_Eth
: constant Wide_Wide_Character := Wide_Wide_Character'Val (240);
LC_N_Tilde : constant Wide_Wide_Character := Wide_Wide_Character'Val (241);
LC_O_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (242);
LC_O_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (243);
LC_O_Circumflex
: constant Wide_Wide_Character := Wide_Wide_Character'Val (244);
LC_O_Tilde : constant Wide_Wide_Character := Wide_Wide_Character'Val (245);
LC_O_Diaeresis
: constant Wide_Wide_Character := Wide_Wide_Character'Val (246);
Division_Sign
: constant Wide_Wide_Character := Wide_Wide_Character'Val (247);
LC_O_Oblique_Stroke
: constant Wide_Wide_Character := Wide_Wide_Character'Val (248);
LC_U_Grave : constant Wide_Wide_Character := Wide_Wide_Character'Val (249);
LC_U_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (250);
LC_U_Circumflex
: constant Wide_Wide_Character := Wide_Wide_Character'Val (251);
LC_U_Diaeresis
: constant Wide_Wide_Character := Wide_Wide_Character'Val (252);
LC_Y_Acute : constant Wide_Wide_Character := Wide_Wide_Character'Val (253);
LC_Icelandic_Thorn
: constant Wide_Wide_Character := Wide_Wide_Character'Val (254);
LC_Y_Diaeresis
: constant Wide_Wide_Character := Wide_Wide_Character'Val (255);
------------------------------------------------
-- Summary of Changes from Latin-1 => Latin-9 --
------------------------------------------------
-- 164 Currency => Euro_Sign
-- 166 Broken_Bar => UC_S_Caron
-- 168 Diaeresis => LC_S_Caron
-- 180 Acute => UC_Z_Caron
-- 184 Cedilla => LC_Z_Caron
-- 188 Fraction_One_Quarter => UC_Ligature_OE
-- 189 Fraction_One_Half => LC_Ligature_OE
-- 190 Fraction_Three_Quarters => UC_Y_Diaeresis
end Ada.Characters.Wide_Wide_Latin_9;
| 59.143959 | 79 | 0.631938 |
04f2371d5b094827b861fc5c2e5f8b9ea5eee948 | 5,497 | ads | Ada | llvm-gcc-4.2-2.9/gcc/ada/g-hesorg.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/g-hesorg.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/g-hesorg.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- G N A T . H E A P _ S O R T _ G --
-- --
-- S p e c --
-- --
-- Copyright (C) 1995-2005, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Heapsort generic package using formal procedures
-- This package provides a generic heapsort routine that can be used with
-- different types of data.
-- See also GNAT.Heap_Sort, a version that works with subprogram access
-- parameters, allowing code sharing. The generic version is slightly more
-- efficient but does not allow code sharing and has an interface that is
-- more awkward to use. The generic version is also Pure, while the access
-- subprogram version can only be Preelaborate.
-- There is also GNAT.Heap_Sort_A, which is now considered obsolete, but
-- was an older version working with subprogram parameters. This version
-- is retained for backwards compatibility with old versions of GNAT.
-- This heapsort algorithm uses approximately N*log(N) compares in the
-- worst case and is in place with no additional storage required. See
-- the body for exact details of the algorithm used.
generic
-- The data to be sorted is assumed to be indexed by integer values from
-- 1 to N, where N is the number of items to be sorted. In addition, the
-- index value zero is used for a temporary location used during the sort.
with procedure Move (From : Natural; To : Natural);
-- A procedure that moves the data item with index value From to the data
-- item with index value To (the old value in To being lost). An index
-- value of zero is used for moves from and to a single temporary location.
-- For best efficiency, this routine should be marked as inlined.
with function Lt (Op1, Op2 : Natural) return Boolean;
-- A function that compares two items and returns True if the item with
-- index Op1 is less than the item with Index Op2, and False if the Op1
-- item is greater than the Op2 item. If the two items are equal, then
-- it does not matter whether True or False is returned (it is slightly
-- more efficient to return False). For best efficiency, this routine
-- should be marked as inlined.
-- Note on use of temporary location
-- There are two ways of providing for the index value zero to represent
-- a temporary value. Either an extra location can be allocated at the
-- start of the array, or alternatively the Move and Lt subprograms can
-- test for the case of zero and treat it specially. In any case it is
-- desirable to specify the two subprograms as inlined and the tests for
-- zero will in this case be resolved at instantiation time.
package GNAT.Heap_Sort_G is
pragma Pure;
procedure Sort (N : Natural);
-- This procedures sorts items in the range from 1 to N into ascending
-- order making calls to Lt to do required comparisons, and Move to move
-- items around. Note that, as described above, both Move and Lt use a
-- single temporary location with index value zero. This sort is not
-- stable, i.e. the order of equal elements in the input is not preserved.
end GNAT.Heap_Sort_G;
| 59.75 | 79 | 0.579771 |
Subsets and Splits