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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
41fbbf5a4d5871e4b58e638e6322cb0b79591cd0 | 6,822 | adb | Ada | source/nodes/program-nodes-generic_package_renaming_declarations.adb | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/nodes/program-nodes-generic_package_renaming_declarations.adb | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/nodes/program-nodes-generic_package_renaming_declarations.adb | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | 2 | 2019-09-14T23:18:50.000Z | 2019-10-02T10:11:40.000Z | -- Copyright (c) 2019 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
package body Program.Nodes.Generic_Package_Renaming_Declarations is
function Create
(Generic_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Package_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Renames_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Renamed_Package : not null Program.Elements.Expressions.Expression_Access;
With_Token : Program.Lexical_Elements.Lexical_Element_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Semicolon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access)
return Generic_Package_Renaming_Declaration is
begin
return Result : Generic_Package_Renaming_Declaration :=
(Generic_Token => Generic_Token, Package_Token => Package_Token,
Name => Name, Renames_Token => Renames_Token,
Renamed_Package => Renamed_Package, With_Token => With_Token,
Aspects => Aspects, Semicolon_Token => Semicolon_Token,
Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
function Create
(Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Renamed_Package : not null Program.Elements.Expressions
.Expression_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_Generic_Package_Renaming_Declaration is
begin
return Result : Implicit_Generic_Package_Renaming_Declaration :=
(Name => Name, Renamed_Package => Renamed_Package, Aspects => Aspects,
Is_Part_Of_Implicit => Is_Part_Of_Implicit,
Is_Part_Of_Inherited => Is_Part_Of_Inherited,
Is_Part_Of_Instance => Is_Part_Of_Instance, Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
overriding function Name
(Self : Base_Generic_Package_Renaming_Declaration)
return not null Program.Elements.Defining_Names.Defining_Name_Access is
begin
return Self.Name;
end Name;
overriding function Renamed_Package
(Self : Base_Generic_Package_Renaming_Declaration)
return not null Program.Elements.Expressions.Expression_Access is
begin
return Self.Renamed_Package;
end Renamed_Package;
overriding function Aspects
(Self : Base_Generic_Package_Renaming_Declaration)
return Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access is
begin
return Self.Aspects;
end Aspects;
overriding function Generic_Token
(Self : Generic_Package_Renaming_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Generic_Token;
end Generic_Token;
overriding function Package_Token
(Self : Generic_Package_Renaming_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Package_Token;
end Package_Token;
overriding function Renames_Token
(Self : Generic_Package_Renaming_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Renames_Token;
end Renames_Token;
overriding function With_Token
(Self : Generic_Package_Renaming_Declaration)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.With_Token;
end With_Token;
overriding function Semicolon_Token
(Self : Generic_Package_Renaming_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Semicolon_Token;
end Semicolon_Token;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Generic_Package_Renaming_Declaration)
return Boolean is
begin
return Self.Is_Part_Of_Implicit;
end Is_Part_Of_Implicit;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Generic_Package_Renaming_Declaration)
return Boolean is
begin
return Self.Is_Part_Of_Inherited;
end Is_Part_Of_Inherited;
overriding function Is_Part_Of_Instance
(Self : Implicit_Generic_Package_Renaming_Declaration)
return Boolean is
begin
return Self.Is_Part_Of_Instance;
end Is_Part_Of_Instance;
procedure Initialize
(Self : aliased in out Base_Generic_Package_Renaming_Declaration'Class) is
begin
Set_Enclosing_Element (Self.Name, Self'Unchecked_Access);
Set_Enclosing_Element (Self.Renamed_Package, Self'Unchecked_Access);
for Item in Self.Aspects.Each_Element loop
Set_Enclosing_Element (Item.Element, Self'Unchecked_Access);
end loop;
null;
end Initialize;
overriding function Is_Generic_Package_Renaming_Declaration_Element
(Self : Base_Generic_Package_Renaming_Declaration)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Generic_Package_Renaming_Declaration_Element;
overriding function Is_Declaration_Element
(Self : Base_Generic_Package_Renaming_Declaration)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Declaration_Element;
overriding procedure Visit
(Self : not null access Base_Generic_Package_Renaming_Declaration;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is
begin
Visitor.Generic_Package_Renaming_Declaration (Self);
end Visit;
overriding function To_Generic_Package_Renaming_Declaration_Text
(Self : aliased in out Generic_Package_Renaming_Declaration)
return Program.Elements.Generic_Package_Renaming_Declarations
.Generic_Package_Renaming_Declaration_Text_Access is
begin
return Self'Unchecked_Access;
end To_Generic_Package_Renaming_Declaration_Text;
overriding function To_Generic_Package_Renaming_Declaration_Text
(Self : aliased in out Implicit_Generic_Package_Renaming_Declaration)
return Program.Elements.Generic_Package_Renaming_Declarations
.Generic_Package_Renaming_Declaration_Text_Access is
pragma Unreferenced (Self);
begin
return null;
end To_Generic_Package_Renaming_Declaration_Text;
end Program.Nodes.Generic_Package_Renaming_Declarations;
| 36.095238 | 79 | 0.743917 |
575cfc7371c23f507fe99ab5f20c26dfe33a76b6 | 1,029 | ads | Ada | specs/ada/common/tkmrpc-response-ike-nc_reset.ads | DrenfongWong/tkm-rpc | 075d22871cf81d497aac656c7f03a513278b641c | [
"BSD-3-Clause"
] | null | null | null | specs/ada/common/tkmrpc-response-ike-nc_reset.ads | DrenfongWong/tkm-rpc | 075d22871cf81d497aac656c7f03a513278b641c | [
"BSD-3-Clause"
] | null | null | null | specs/ada/common/tkmrpc-response-ike-nc_reset.ads | DrenfongWong/tkm-rpc | 075d22871cf81d497aac656c7f03a513278b641c | [
"BSD-3-Clause"
] | null | null | null | with Tkmrpc.Types;
with Tkmrpc.Operations.Ike;
package Tkmrpc.Response.Ike.Nc_Reset is
Data_Size : constant := 0;
Padding_Size : constant := Response.Body_Size - Data_Size;
subtype Padding_Range is Natural range 1 .. Padding_Size;
subtype Padding_Type is Types.Byte_Sequence (Padding_Range);
type Response_Type is record
Header : Response.Header_Type;
Padding : Padding_Type;
end record;
for Response_Type use record
Header at 0 range 0 .. (Response.Header_Size * 8) - 1;
Padding at Response.Header_Size + Data_Size range
0 .. (Padding_Size * 8) - 1;
end record;
for Response_Type'Size use Response.Response_Size * 8;
Null_Response : constant Response_Type :=
Response_Type'
(Header =>
Response.Header_Type'(Operation => Operations.Ike.Nc_Reset,
Result => Results.Invalid_Operation,
Request_Id => 0),
Padding => Padding_Type'(others => 0));
end Tkmrpc.Response.Ike.Nc_Reset;
| 31.181818 | 67 | 0.662779 |
0674f04e28ce228fb72a1752645c4b04f824e727 | 1,445 | ads | Ada | examples/src/package_9_jobs.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 52 | 2016-07-30T23:00:28.000Z | 2022-02-05T11:54:55.000Z | examples/src/package_9_jobs.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 79 | 2016-08-01T18:36:48.000Z | 2022-02-27T12:14:20.000Z | examples/src/package_9_jobs.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) 2018 onox <[email protected]>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
with Orka.Jobs.System;
package Package_9_Jobs is
package Job_System is new Orka.Jobs.System
(Maximum_Queued_Jobs => 4,
Maximum_Job_Graphs => 1);
type Test_Parallel_Job is new Orka.Jobs.Abstract_Parallel_Job with null record;
function Clone_Job
(Job : Orka.Jobs.Parallel_Job_Ptr;
Length : Positive) return Orka.Jobs.Dependency_Array;
overriding
procedure Execute
(Object : Test_Parallel_Job;
Context : Orka.Jobs.Execution_Context'Class;
From, To : Positive);
type Test_Sequential_Job is new Orka.Jobs.Abstract_Job with record
ID : Natural;
end record;
overriding
procedure Execute
(Object : Test_Sequential_Job;
Context : Orka.Jobs.Execution_Context'Class);
end Package_9_Jobs;
| 30.744681 | 82 | 0.715571 |
5839f2350e217c6b58405103ff3a42f9dff70db8 | 6,154 | ads | Ada | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-trasym.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-trasym.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-trasym.ads | orb-zhuchen/Orb | 6da2404b949ac28bde786e08bf4debe4a27cd3a0 | [
"CNRI-Python-GPL-Compatible",
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . T R A C E B A C K . S Y M B O L I C --
-- --
-- S p e c --
-- --
-- Copyright (C) 1999-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. --
-- --
------------------------------------------------------------------------------
-- Run-time symbolic traceback support
-- The full capability is currently supported on the following targets:
-- GNU/Linux x86, x86_64, ia64
-- Note: on targets other than those listed above, a dummy implementation
-- of the body returns a series of LF separated strings of the form "0x..."
-- corresponding to the addresses.
-- The routines provided in this package assume that your application has been
-- compiled with debugging information turned on, since this information is
-- used to build a symbolic traceback.
-- If you want to retrieve tracebacks from exception occurrences, it is also
-- necessary to invoke the binder with -E switch. Please refer to the gnatbind
-- documentation for more information.
-- Note that it is also possible (and often recommended) to compute symbolic
-- traceback outside the program execution, which in addition allows you to
-- distribute the executable with no debug info:
--
-- - build your executable with debug info
-- - archive this executable
-- - strip a copy of the executable and distribute/deploy this version
-- - at run time, compute absolute traceback (-bargs -E) from your
-- executable and log it using Ada.Exceptions.Exception_Information
-- - off line, compute the symbolic traceback using the executable archived
-- with debug info and addr2line or gdb (using info line *<addr>) on the
-- absolute addresses logged by your application.
-- In order to retrieve symbolic information, functions in this package will
-- read on disk all the debug information of the executable file (found via
-- Argument (0), and looked in the PATH if needed) or shared libraries using
-- OS facilities, and load them in memory, causing a significant cpu and
-- memory overhead.
-- Symbolic traceback from shared libraries is only supported for Windows and
-- Linux. On other targets symbolic tracebacks are only supported for the main
-- executable. You should consider using gdb to obtain symbolic traceback in
-- such cases.
pragma Polling (Off);
-- We must turn polling off for this unit, because otherwise we can get
-- elaboration circularities when polling is turned on.
with Ada.Exceptions;
package System.Traceback.Symbolic is
pragma Elaborate_Body;
function Symbolic_Traceback
(Traceback : System.Traceback_Entries.Tracebacks_Array) return String;
function Symbolic_Traceback_No_Hex
(Traceback : System.Traceback_Entries.Tracebacks_Array) return String;
-- Build a string containing a symbolic traceback of the given call
-- chain. Note: These procedures may be installed by Set_Trace_Decorator,
-- to get a symbolic traceback on all exceptions raised (see
-- System.Exception_Traces).
function Symbolic_Traceback
(E : Ada.Exceptions.Exception_Occurrence) return String;
function Symbolic_Traceback_No_Hex
(E : Ada.Exceptions.Exception_Occurrence) return String;
-- Build string containing symbolic traceback of given exception occurrence
-- In the above, _No_Hex means do not print any hexadecimal addresses, even
-- if the symbol is not available. This is useful for getting deterministic
-- output from tests.
procedure Enable_Cache (Include_Modules : Boolean := False);
-- Read symbolic information from binary files and cache them in memory.
-- This will speed up the above functions but will require more memory. If
-- Include_Modules is true, shared modules (or DLL) will also be cached.
-- This procedure may do nothing if not supported. The profile of this
-- subprogram may change in the future (new parameters can be added
-- with default value), but backward compatibility for direct calls
-- is supported.
end System.Traceback.Symbolic;
| 54.946429 | 79 | 0.600422 |
1231387a6859bf877238c57e83e1ed8d6ba12140 | 1,377 | adb | Ada | source/web-rss.adb | ytomino/web-ada | 376fe024e4c8784bd4350a343a1416b79292fbb5 | [
"FSFAP"
] | 2 | 2015-02-09T21:09:15.000Z | 2021-11-17T19:53:08.000Z | source/web-rss.adb | ytomino/web-ada | 376fe024e4c8784bd4350a343a1416b79292fbb5 | [
"FSFAP"
] | null | null | null | source/web-rss.adb | ytomino/web-ada | 376fe024e4c8784bd4350a343a1416b79292fbb5 | [
"FSFAP"
] | null | null | null | with Web.HTML;
package body Web.RSS is
procedure RSS_Start (
Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Title : in String;
Description : in String;
Link : in String) is
begin
String'Write (
Stream,
"<rss version=""2.0"">" & "<channel>"
& "<docs>http://blogs.law.harvard.edu/tech/rss</docs>" & "<title>");
HTML.Write_In_HTML (Stream, HTML.XHTML, Title);
String'Write (Stream, "</title>" & "<description>");
HTML.Write_In_HTML (Stream, HTML.XHTML, Description);
String'Write (Stream, "</description>" & "<link>");
HTML.Write_In_HTML (Stream, HTML.XHTML, Link);
String'Write (Stream, "</link>");
end RSS_Start;
procedure RSS_Item (
Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Title : in String;
Description : in String;
Link : in String) is
begin
String'Write (Stream, "<item>" & "<title>");
HTML.Write_In_HTML (Stream, HTML.XHTML, Title);
String'Write (Stream, "</title>" & "<description>");
HTML.Write_In_HTML (Stream, HTML.XHTML, Description);
String'Write (Stream, "</description>" & "<link>");
HTML.Write_In_HTML (Stream, HTML.XHTML, Link);
String'Write (Stream, "</link>" & "</item>");
end RSS_Item;
procedure RSS_End (
Stream : not null access Ada.Streams.Root_Stream_Type'Class) is
begin
String'Write (Stream, "</channel>" & "</rss>");
end RSS_End;
end Web.RSS;
| 31.295455 | 72 | 0.668845 |
591f58982691f8035ac2478e872c5d51b0f2122f | 2,549 | adb | Ada | src/asf-contexts-exceptions-iterate.adb | Letractively/ada-asf | da9f85f85666eba7e23fefea661160863b74154d | [
"Apache-2.0"
] | null | null | null | src/asf-contexts-exceptions-iterate.adb | Letractively/ada-asf | da9f85f85666eba7e23fefea661160863b74154d | [
"Apache-2.0"
] | null | null | null | src/asf-contexts-exceptions-iterate.adb | Letractively/ada-asf | da9f85f85666eba7e23fefea661160863b74154d | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- asf-contexts-exceptions -- Exception handlers in faces context
-- Copyright (C) 2011 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.Unchecked_Deallocation;
-- ------------------------------
-- Iterate over the exception events which are in the queue and execute the given procedure.
-- The procedure should return True in <b>Remove</b> to indicate that the exception has been
-- processed.
--
-- Notes: this procedure should not be called directly (use ASF.Contexts.Faces.Iterate).
-- This procedure is separate to avoid circular dependency.
-- ------------------------------
procedure ASF.Contexts.Exceptions.Iterate
(Queue : in out Exception_Queue;
Context : in out ASF.Contexts.Faces.Faces_Context'Class;
Process : not null access procedure (Event : in ASF.Events.Exceptions.Exception_Event'Class;
Remove : out Boolean;
Context : in out Contexts.Faces.Faces_Context'Class)) is
procedure Free is
new Ada.Unchecked_Deallocation (Object => ASF.Events.Exceptions.Exception_Event'Class,
Name => ASF.Events.Exceptions.Exception_Event_Access);
Event : ASF.Events.Exceptions.Exception_Event_Access;
Remove : Boolean := False;
Pos : Natural := 1;
Len : Natural := Natural (Queue.Unhandled_Events.Length);
begin
while Pos <= Len loop
Event := Queue.Unhandled_Events.Element (Pos);
Process (Event.all, Remove, Context);
if Remove then
ASF.Events.Exceptions.Event_Vectors.Delete (Queue.Unhandled_Events, Pos);
Free (Event);
if Len > 0 then
Len := Len - 1;
end if;
else
Pos := Pos + 1;
end if;
end loop;
end ASF.Contexts.Exceptions.Iterate;
| 43.20339 | 97 | 0.619851 |
590ce0d5324673ad2ce68f279c890e6648c6c24e | 1,472 | ads | Ada | src/apsepp-generic_prot_integer.ads | thierr26/ada-apsepp | 6eb87079ea57707db4ee1e2215fa170af66b1913 | [
"MIT"
] | null | null | null | src/apsepp-generic_prot_integer.ads | thierr26/ada-apsepp | 6eb87079ea57707db4ee1e2215fa170af66b1913 | [
"MIT"
] | null | null | null | src/apsepp-generic_prot_integer.ads | thierr26/ada-apsepp | 6eb87079ea57707db4ee1e2215fa170af66b1913 | [
"MIT"
] | null | null | null | -- Copyright (C) 2019 Thierry Rascle <[email protected]>
-- MIT license. Please refer to the LICENSE file.
generic
type Integer_Type is range <>;
package Apsepp.Generic_Prot_Integer is
-- Evaluate the pre-conditions in this package.
pragma Assertion_Policy (Pre => Check);
type O_P_I_Type is private
with Type_Invariant => (
Val (O_P_I_Type) = Integer_Type'First
or else
Val (O_P_I_Type) = Integer_Type'Last
or else
not Sat (O_P_I_Type)
);
function Create (V : Integer_Type; S : Boolean := False) return O_P_I_Type
with Pre => not S or else (V = Integer_Type'First
or else
V = Integer_Type'Last),
Post => Val (Create'Result) = V
and then
Sat (Create'Result) = S;
function Val (X : O_P_I_Type) return Integer_Type;
function Sat (X : O_P_I_Type) return Boolean;
function "+" (X_1, X_2 : O_P_I_Type) return O_P_I_Type
with Pre => Val (X_2) >= 0;
procedure Inc (X : in out O_P_I_Type; By : Integer_Type'Base := 1)
with Pre => By >= 0;
private
type O_P_I_Type is record
Value : Integer_Type := Integer_Type'First;
Saturated : Boolean := False;
end record;
end Apsepp.Generic_Prot_Integer;
| 28.862745 | 77 | 0.545516 |
3dd4bcfc30a875cfa6e1eea31fb8c84cdc495f64 | 668 | adb | Ada | PIM/TP1_Algorithmique/somme_entier_reel.adb | Hathoute/ENSEEIHT | d42f0b0dedb269e6df3b1c006d4d45e52fc518b8 | [
"MIT"
] | 1 | 2021-06-26T21:51:11.000Z | 2021-06-26T21:51:11.000Z | PIM/TP1_Algorithmique/somme_entier_reel.adb | Hathoute/ENSEEIHT | d42f0b0dedb269e6df3b1c006d4d45e52fc518b8 | [
"MIT"
] | null | null | null | PIM/TP1_Algorithmique/somme_entier_reel.adb | Hathoute/ENSEEIHT | d42f0b0dedb269e6df3b1c006d4d45e52fc518b8 | [
"MIT"
] | null | null | null | with Ada.Text_IO; use Ada.Text_IO;
with Ada.Integer_Text_IO; use Ada.Integer_Text_IO;
with Ada.Float_Text_IO; use Ada.Float_Text_IO;
procedure Somme_Entier_Reel is
Entier : Integer; -- l'entier lu au clavier
Reel : Float; -- le réel lu au clavier
Somme : Float; -- la somme de l'entier par le réel
begin
-- Demander l'entier
Get (Entier);
-- Demander le réel
Get (Reel);
-- Calculer la somme de l'entier et du réel
Somme := Float(Entier) + Reel;
-- Afficher la somme
Put ("Somme : ");
Put (Somme, Exp => 0);
-- Exp => 0 signifie utiliser 0 chiffre pour l'exposant (si possible)
New_Line;
end Somme_Entier_Reel;
| 23.857143 | 71 | 0.666168 |
58479a4893780e4570dcbfda4f6b4a838d0c2688 | 4,712 | adb | Ada | arch/ARM/STM32/driversL4x6/stm32-dfsdm.adb | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2018-05-16T03:56:39.000Z | 2019-07-31T13:53:56.000Z | arch/ARM/STM32/driversL4x6/stm32-dfsdm.adb | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | arch/ARM/STM32/driversL4x6/stm32-dfsdm.adb | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | with System; use System;
with STM32_SVD.DFSDM; use STM32_SVD.DFSDM;
with STM32.RCC;
with STM32.SYSCFG;
with System.Machine_Code;
package body STM32.DFSDM
is
procedure Enable
(This : in out DFSDM_Block;
Channel : DFSDM_Channel)
is
begin
case Channel is
when Channel_0 =>
This.CHCFG0R1.CHEN := True;
when Channel_1 =>
This.CHCFG1R1.CHEN := True;
when Channel_2 =>
This.CHCFG2R1.CHEN := True;
when Channel_3 =>
This.CHCFG3R1.CHEN := True;
when Channel_4 =>
This.CHCFG4R1.CHEN := True;
when Channel_5 =>
This.CHCFG5R1.CHEN := True;
when Channel_6 =>
This.CHCFG6R1.CHEN := True;
when Channel_7 =>
This.CHCFG7R1.CHEN := True;
end case;
end Enable;
procedure Disable
(This : in out DFSDM_Block;
Channel : DFSDM_Channel)
is
begin
case Channel is
when Channel_0 =>
This.CHCFG0R1.CHEN := False;
when Channel_1 =>
This.CHCFG1R1.CHEN := False;
when Channel_2 =>
This.CHCFG2R1.CHEN := False;
when Channel_3 =>
This.CHCFG3R1.CHEN := False;
when Channel_4 =>
This.CHCFG4R1.CHEN := False;
when Channel_5 =>
This.CHCFG5R1.CHEN := False;
when Channel_6 =>
This.CHCFG6R1.CHEN := False;
when Channel_7 =>
This.CHCFG7R1.CHEN := False;
end case;
end Disable;
function Enabled
(This : DFSDM_Block;
Channel : DFSDM_Channel) return Boolean
is
begin
case Channel is
when Channel_0 =>
return This.CHCFG0R1.CHEN;
when Channel_1 =>
return This.CHCFG1R1.CHEN;
when Channel_2 =>
return This.CHCFG2R1.CHEN;
when Channel_3 =>
return This.CHCFG3R1.CHEN;
when Channel_4 =>
return This.CHCFG4R1.CHEN;
when Channel_5 =>
return This.CHCFG5R1.CHEN;
when Channel_6 =>
return This.CHCFG6R1.CHEN;
when Channel_7 =>
return This.CHCFG7R1.CHEN;
end case;
end Enabled;
-- procedure Initialize (This : DFSDM_Block)
-- is
-- begin
-- null;
-- DFSDM1.CHCFG0R1.DFSDMEN := True;
-- DFSDM1_Periph.CHCFG0R1.CKOUTSRC := True
-- DFSDM1_Periph.CHCFG0R1.CHCFG0R1.CKOUTDIV := 16#17#;
-- > DFSDM1.CHCFG0R1.DFSDMEN: 0
-- > DFSDM1.CHCFG0R1.CKOUTSRC: 0
-- > DFSDM1.CHCFG0R1.CKOUTDIV[7:0]: 0
-- 2093c2093
-- < DFSDM1.CHCFG5R1.CHEN: 1
-- -- -
-- > DFSDM1.CHCFG5R1.CHEN: 0
-- 2096c2096
-- < DFSDM1.CHCFG5R1.SPICKSEL[1:0]: 1
-- -- -
-- > DFSDM1.CHCFG5R1.SPICKSEL[1:0]: 0
-- 2099,2101c2099,2101
-- < DFSDM1.CHCFG5R2.DTRBS[4:0]: 4
-- < DFSDM1.AWSCD5R.AWFORD[1:0]: 1
-- < DFSDM1.AWSCD5R.AWFOSR[4:0]: 9
-- -- -
-- > DFSDM1.CHCFG5R2.DTRBS[4:0]: 0
-- > DFSDM1.AWSCD5R.AWFORD[1:0]: 0
-- > DFSDM1.AWSCD5R.AWFOSR[4:0]: 0
-- 2142,2144c2142,2144
-- < DFSDM1.DFSDM0_CR1.FAST: 1
-- < DFSDM1.DFSDM0_CR1.RCH[2:0]: 5
-- < DFSDM1.DFSDM0_CR1.RDMAEN: 1
-- -- -
-- > DFSDM1.DFSDM0_CR1.FAST: 0
-- > DFSDM1.DFSDM0_CR1.RCH[2:0]: 0
-- > DFSDM1.DFSDM0_CR1.RDMAEN: 0
-- 2146c2146
-- < DFSDM1.DFSDM0_CR1.RCONT: 1
-- -- -
-- > DFSDM1.DFSDM0_CR1.RCONT: 0
-- 2154c2154
-- < DFSDM1.DFSDM0_CR1.DFEN: 1
-- -- -
-- > DFSDM1.DFSDM0_CR1.DFEN: 0
-- 2165,2166c2165,2166
-- < DFSDM1.DFSDM0_ISR.CKABF[7:0]: 0xff
-- < DFSDM1.DFSDM0_ISR.RCIP: 1
-- -- -
-- > DFSDM1.DFSDM0_ISR.CKABF[7:0]: 0
-- > DFSDM1.DFSDM0_ISR.RCIP: 0
-- 2177,2179c2177,2179
-- < DFSDM1.DFSDM0_JCHGR.JCHG[7:0]: 1
-- < DFSDM1.DFSDM0_FCR.FORD[2:0]: 3
-- < DFSDM1.DFSDM0_FCR.FOSR[9:0]: 0xff
-- -- -
-- > DFSDM1.DFSDM0_JCHGR.JCHG[7:0]: 0
-- > DFSDM1.DFSDM0_FCR.FORD[2:0]: 0
-- > DFSDM1.DFSDM0_FCR.FOSR[9:0]: 0
-- 2183c2183
-- < DFSDM1.DFSDM0_RDATAR.RDATA[23:0]: 0x7b1
-- -- -
-- > DFSDM1.DFSDM0_RDATAR.RDATA[23:0]: 0
-- 2194c2194
-- < DFSDM1.DFSDM0_EXMAX.EXMAX[23:0]: 0x800000
-- -- -
-- > DFSDM1.DFSDM0_EXMAX.EXMAX[23:0]: 0
-- 2196c2196
-- < DFSDM1.DFSDM0_EXMIN.EXMIN[23:0]: 0x7fffff
-- -- -
-- > DFSDM1.DFSDM0_EXMIN.EXMIN[23:0]: 0
-- 2198c2198
-- < DFSDM1.DFSDM0_CNVTIMR.CNVCNT[27:0]: 0x2712
-- -- -
-- > DFSDM1.DFSDM0_CNVTIMR.CNVCNT[27:0]: 0
-- 2235c2235
-- < DFSDM1.DFSDM1_JCHGR.JCHG[7:0]: 1
-- -- -
-- > DFSDM1.DFSDM1_JCHGR.JCHG[7:0]: 0
-- 2252c2252
-- < DFSDM1.DFSDM1_EXMAX.EXMAX[23:0]: 0x800000
-- -- -
-- > DFSDM1.DFSDM1_EXMAX.EXMAX[23:0]: 0
-- 2254c2254
-- < DFSDM1.DFSDM1_EXMIN.EXMIN[23:0]: 0x7fffff
-- -- -
-- > DFSDM1.DFSDM1_EXMIN.EXMIN[23:0]: 0
-- end Initialize;
end STM32.DFSDM;
| 27.395349 | 59 | 0.578947 |
4d99332dbbf18efbd9cc0adb6a3a7aec84049310 | 942 | adb | Ada | software/unittest/estimator/src/ulog.adb | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 12 | 2017-06-08T14:19:57.000Z | 2022-03-09T02:48:59.000Z | software/unittest/estimator/src/ulog.adb | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 6 | 2017-06-08T13:13:50.000Z | 2020-05-15T09:32:43.000Z | software/unittest/estimator/src/ulog.adb | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 3 | 2017-06-30T14:05:06.000Z | 2022-02-17T12:20:45.000Z | package body ulog is
procedure Init is null;
procedure Serialize_Ulog (msg : in Message; len : out Natural; bytes : out HIL.Byte_Array) is null;
procedure Format (msg : in Message; bytes : out HIL.Byte_Array) is null;
procedure Get_Header_Ulog (bytes : in out HIL.Byte_Array;
len : out Natural; valid : out Boolean) is null;
procedure Describe (msg : in Message; namestring : out String) is null;
function Describe_Func (msg : in Message) return String is ("hallo");
function Size (msg : in Message)
return Interfaces.Unsigned_16 is (0);
function Self (msg : in Message) return ULog.Message is (msg);
procedure Get_Serialization (msg : in Message; bytes : out HIL.Byte_Array) is null;
function Get_Size (msg : in Message) return Interfaces.Unsigned_16 is (0);
procedure Get_Format
(msg : in Message;
bytes : out HIL.Byte_Array) is null;
end ulog;
| 52.333333 | 102 | 0.679406 |
57cd1b2eede97f47417ce3dafe0200330b36a5b3 | 984 | adb | Ada | gnu/src/gdb/gdb/testsuite/gdb.ada/arr_arr/foo.adb | ghsecuritylab/ellcc-mirror | b03a4afac74d50cf0987554b8c0cd8209bcb92a2 | [
"BSD-2-Clause"
] | null | null | null | gnu/src/gdb/gdb/testsuite/gdb.ada/arr_arr/foo.adb | ghsecuritylab/ellcc-mirror | b03a4afac74d50cf0987554b8c0cd8209bcb92a2 | [
"BSD-2-Clause"
] | null | null | null | gnu/src/gdb/gdb/testsuite/gdb.ada/arr_arr/foo.adb | ghsecuritylab/ellcc-mirror | b03a4afac74d50cf0987554b8c0cd8209bcb92a2 | [
"BSD-2-Clause"
] | null | null | null | -- Copyright 2014-2015 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with System;
with Pck; use Pck;
procedure Foo is
type Array2_First is array (24 .. 26) of Integer;
type Array2_Second is array (1 .. 2) of Array2_First;
A2 : Array2_Second := ((10, 11, 12), (13, 14, 15));
begin
Do_Nothing (A2'Address); -- START
end Foo;
| 37.846154 | 73 | 0.714431 |
414325c80a9a3b2adea931bbe7cd32d610ca2701 | 3,477 | adb | Ada | bb-runtimes/examples/test-bsp/testfpu.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/examples/test-bsp/testfpu.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/examples/test-bsp/testfpu.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT EXAMPLE --
-- --
-- Copyright (C) 2013, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
pragma Warnings (Off);
with System.BB.CPU_Primitives; use System.BB.CPU_Primitives;
pragma Warnings (On);
with Text_IO; use Text_IO;
with Testdata; use Testdata;
procedure Testfpu (Arg : access Float) is
begin
pragma Debug (Put_Line (" . in Testfpu context"));
Arg.all := Arg.all + 1.0;
Disable_Interrupts;
First_Thread := Test_Context (1)'Access;
Context_Switch;
Enable_Interrupts (0);
pragma Debug (Put_Line
(" . Testfpu got control back after context switch"));
-- Now quietly update the var and switch back.
for J in 1 .. 1002 loop
Arg.all := Arg.all + 1.0;
Disable_Interrupts;
First_Thread := Test_Context (1)'Access;
Context_Switch;
Enable_Interrupts (0);
end loop;
-- Now stop using floating point for 1000 iterations
for J in 1 .. 1000 loop
Disable_Interrupts;
First_Thread := Test_Context (1)'Access;
Context_Switch;
Enable_Interrupts (0);
end loop;
-- Update Arg reflecting last 1000 switches, and return to using the FPU
Arg.all := Arg.all + 1000.0;
loop
Arg.all := Arg.all + 1.0;
Disable_Interrupts;
First_Thread := Test_Context (1)'Access;
Context_Switch;
Enable_Interrupts (0);
end loop;
end Testfpu;
| 46.986486 | 78 | 0.524015 |
416e5cbba800f466ee29e8dc1ec5ef7040dc3282 | 12,180 | adb | Ada | gcc-gcc-7_3_0-release/gcc/ada/xtreeprs.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/xtreeprs.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/xtreeprs.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT SYSTEM UTILITIES --
-- --
-- X T R E E P R S --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2010, 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. --
-- --
------------------------------------------------------------------------------
-- Program to construct the spec of the Treeprs package
-- Input files:
-- sinfo.ads Spec of Sinfo package
-- treeprs.adt Template for Treeprs package
-- Output files:
-- treeprs.ads Spec of Treeprs package
-- Note: this program assumes that sinfo.ads has passed the error checks which
-- are carried out by the CSinfo utility so it does not duplicate these checks
-- An optional argument allows the specification of an output file name to
-- override the default treeprs.ads file name for the generated output file.
with Ada.Command_Line; use Ada.Command_Line;
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Ada.Strings.Unbounded.Text_IO; use Ada.Strings.Unbounded.Text_IO;
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Streams.Stream_IO; use Ada.Streams.Stream_IO;
with GNAT.Spitbol; use GNAT.Spitbol;
with GNAT.Spitbol.Patterns; use GNAT.Spitbol.Patterns;
with GNAT.Spitbol.Table_Boolean; use GNAT.Spitbol.Table_Boolean;
with GNAT.Spitbol.Table_VString; use GNAT.Spitbol.Table_VString;
procedure XTreeprs is
package TB renames GNAT.Spitbol.Table_Boolean;
package TV renames GNAT.Spitbol.Table_VString;
Err : exception;
-- Raised on fatal error
A : VString := Nul;
Ffield : VString := Nul;
Field : VString := Nul;
Fieldno : VString := Nul;
Flagno : VString := Nul;
Line : VString := Nul;
Name : VString := Nul;
Node : VString := Nul;
Outstring : VString := Nul;
Prefix : VString := Nul;
S : VString := Nul;
S1 : VString := Nul;
Syn : VString := Nul;
Synonym : VString := Nul;
Term : VString := Nul;
subtype Sfile is Ada.Streams.Stream_IO.File_Type;
OutS : Sfile;
-- Output file
InS : Ada.Text_IO.File_Type;
-- Read sinfo.ads
InT : Ada.Text_IO.File_Type;
-- Read treeprs.adt
Special : TB.Table (20);
-- Table of special fields. These fields are not included in the table
-- constructed by Xtreeprs, since they are specially handled in treeprs.
-- This means these field definitions are completely ignored.
Names : array (1 .. 500) of VString;
-- Table of names of synonyms
Positions : array (1 .. 500) of Natural;
-- Table of starting positions in Pchars string for synonyms
Strings : TV.Table (300);
-- Contribution of each synonym to Pchars string, indexed by name
Count : Natural := 0;
-- Number of synonyms processed so far
Curpos : Natural := 1;
-- Number of characters generated in Pchars string so far
Lineno : Natural := 0;
-- Line number in sinfo.ads
Field_Base : constant := Character'Pos ('#');
-- Fields 1-5 are represented by the characters #$%&' (i.e. by five
-- contiguous characters starting at # (16#23#)).
Flag_Base : constant := Character'Pos ('(');
-- Flags 1-18 are represented by the characters ()*+,-./0123456789
-- (i.e. by 18 contiguous characters starting at (16#28#)).
Fieldch : Character;
-- Field character, as per above tables
Sp : aliased Natural;
-- Space left on line for Pchars output
wsp : constant Pattern := Span (' ' & ASCII.HT);
Is_Temp : constant Pattern := BreakX ('T') * A & "T e m p l a t e";
Get_Node : constant Pattern := wsp & "-- N_" & Rest * Node;
Tst_Punc : constant Pattern := Break (" ,.");
Get_Syn : constant Pattern := Span (' ') & "-- " & Break (' ') * Synonym
& " (" & Break (')') * Field;
Brk_Min : constant Pattern := Break ('-') * Ffield;
Is_Flag : constant Pattern := "Flag" & Rest * Flagno;
Is_Field : constant Pattern := Rtab (1) & Len (1) * Fieldno;
Is_Syn : constant Pattern := wsp & "N_" & Break (",)") * Syn
& Len (1) * Term;
Brk_Node : constant Pattern := Break (' ') * Node & ' ';
Chop_SP : constant Pattern := Len (Sp'Unrestricted_Access) * S1;
M : Match_Result;
procedure Put_Line (F : Sfile; S : String);
procedure Put_Line (F : Sfile; S : VString);
-- Local version of Put_Line ensures Unix style line endings
procedure Put_Line (F : Sfile; S : String) is
begin
String'Write (Stream (F), S);
Character'Write (Stream (F), ASCII.LF);
end Put_Line;
procedure Put_Line (F : Sfile; S : VString) is
begin
Put_Line (F, To_String (S));
end Put_Line;
-- Start of processing for XTreeprs
begin
Anchored_Mode := True;
if Argument_Count > 0 then
Create (OutS, Out_File, Argument (1));
else
Create (OutS, Out_File, "treeprs.ads");
end if;
Open (InS, In_File, "sinfo.ads");
Open (InT, In_File, "treeprs.adt");
-- Initialize special fields table
Set (Special, "Analyzed", True);
Set (Special, "Cannot_Be_Constant", True);
Set (Special, "Chars", True);
Set (Special, "Comes_From_Source", True);
Set (Special, "Error_Posted", True);
Set (Special, "Etype", True);
Set (Special, "Has_No_Side_Effects", True);
Set (Special, "Is_Controlling_Actual", True);
Set (Special, "Is_Overloaded", True);
Set (Special, "Is_Static_Expression", True);
Set (Special, "Left_Opnd", True);
Set (Special, "Must_Check_Expr", True);
Set (Special, "No_Overflow_Expr", True);
Set (Special, "Paren_Count", True);
Set (Special, "Raises_Constraint_Error", True);
Set (Special, "Right_Opnd", True);
-- Read template header and generate new header
loop
Line := Get_Line (InT);
-- Skip lines describing the template
if Match (Line, "-- This file is a template") then
loop
Line := Get_Line (InT);
exit when Line = "";
end loop;
end if;
exit when Match (Line, "package");
if Match (Line, Is_Temp, M) then
Replace (M, A & " S p e c ");
end if;
Put_Line (OutS, Line);
end loop;
Put_Line (OutS, Line);
-- Copy rest of comments up to template insert point to spec
loop
Line := Get_Line (InT);
exit when Match (Line, "!!TEMPLATE INSERTION POINT");
Put_Line (OutS, Line);
end loop;
-- Here we are doing the actual insertions
Put_Line (OutS, " Pchars : constant String :=");
-- Loop through comments describing nodes, picking up fields
loop
Line := Get_Line (InS);
Lineno := Lineno + 1;
exit when Match (Line, " type Node_Kind");
if Match (Line, Get_Node)
and then not Match (Node, Tst_Punc)
then
Outstring := Node & ' ';
loop
Line := Get_Line (InS);
exit when Line = "";
if Match (Line, Get_Syn)
and then not Match (Synonym, "plus")
and then not Present (Special, Synonym)
then
-- Convert this field into the character used to
-- represent the field according to the table:
-- Field1 '#'
-- Field2 '$'
-- Field3 '%'
-- Field4 '&'
-- Field5 "'"
-- Flag4 '+'
-- Flag5 ','
-- Flag6 '-'
-- Flag7 '.'
-- Flag8 '/'
-- Flag9 '0'
-- Flag10 '1'
-- Flag11 '2'
-- Flag12 '3'
-- Flag13 '4'
-- Flag14 '5'
-- Flag15 '6'
-- Flag16 '7'
-- Flag17 '8'
-- Flag18 '9'
if Match (Field, Brk_Min) then
Field := Ffield;
end if;
if Match (Field, Is_Flag) then
Fieldch := Char (Flag_Base - 1 + N (Flagno));
elsif Match (Field, Is_Field) then
Fieldch := Char (Field_Base - 1 + N (Fieldno));
else
Put_Line
(Standard_Error,
"*** Line " &
Lineno &
" has unrecognized field name " &
Field);
raise Err;
end if;
Append (Outstring, Fieldch & Synonym);
end if;
end loop;
Set (Strings, Node, Outstring);
end if;
end loop;
-- Loop through actual definitions of node kind enumeration literals
loop
loop
Line := Get_Line (InS);
Lineno := Lineno + 1;
exit when Match (Line, Is_Syn);
end loop;
S := Get (Strings, Syn);
Match (S, Brk_Node, "");
Count := Count + 1;
Names (Count) := Syn;
Positions (Count) := Curpos;
Curpos := Curpos + Length (S);
Put_Line (OutS, " -- " & Node);
Prefix := V (" ");
exit when Term = ")";
-- Loop to output the string literal for Pchars
loop
Sp := 79 - 4 - Length (Prefix);
exit when Size (S) <= Sp;
Match (S, Chop_SP, "");
Put_Line (OutS, Prefix & '"' & S1 & """ &");
Prefix := V (" ");
end loop;
Put_Line (OutS, Prefix & '"' & S & """ &");
end loop;
Put_Line (OutS, " """";");
Put_Line (OutS, "");
Put_Line
(OutS, " type Pchar_Pos_Array is array (Node_Kind) of Positive;");
Put_Line
(OutS,
" Pchar_Pos : constant Pchar_Pos_Array := Pchar_Pos_Array'(");
-- Output lines for Pchar_Pos_Array values
for M in 1 .. Count - 1 loop
Name := Rpad ("N_" & Names (M), 40);
Put_Line (OutS, " " & Name & " => " & Positions (M) & ',');
end loop;
Name := Rpad ("N_" & Names (Count), 40);
Put_Line (OutS, " " & Name & " => " & Positions (Count) & ");");
Put_Line (OutS, "");
Put_Line (OutS, "end Treeprs;");
exception
when Err =>
Put_Line (Standard_Error, "*** fatal error");
Set_Exit_Status (1);
end XTreeprs;
| 34.022346 | 79 | 0.507635 |
415a91bb01cbbf67319ae741339385b2e3d977d9 | 3,159 | adb | Ada | src/fltk-widgets-buttons-light-check.adb | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | 1 | 2020-12-18T15:20:13.000Z | 2020-12-18T15:20:13.000Z | src/fltk-widgets-buttons-light-check.adb | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | null | null | null | src/fltk-widgets-buttons-light-check.adb | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | null | null | null |
with
Interfaces.C,
System;
use type
System.Address;
package body FLTK.Widgets.Buttons.Light.Check is
procedure check_button_set_draw_hook
(W, D : in System.Address);
pragma Import (C, check_button_set_draw_hook, "check_button_set_draw_hook");
pragma Inline (check_button_set_draw_hook);
procedure check_button_set_handle_hook
(W, H : in System.Address);
pragma Import (C, check_button_set_handle_hook, "check_button_set_handle_hook");
pragma Inline (check_button_set_handle_hook);
function new_fl_check_button
(X, Y, W, H : in Interfaces.C.int;
Text : in Interfaces.C.char_array)
return System.Address;
pragma Import (C, new_fl_check_button, "new_fl_check_button");
pragma Inline (new_fl_check_button);
procedure free_fl_check_button
(B : in System.Address);
pragma Import (C, free_fl_check_button, "free_fl_check_button");
pragma Inline (free_fl_check_button);
procedure fl_check_button_draw
(W : in System.Address);
pragma Import (C, fl_check_button_draw, "fl_check_button_draw");
pragma Inline (fl_check_button_draw);
function fl_check_button_handle
(W : in System.Address;
E : in Interfaces.C.int)
return Interfaces.C.int;
pragma Import (C, fl_check_button_handle, "fl_check_button_handle");
pragma Inline (fl_check_button_handle);
procedure Finalize
(This : in out Check_Button) is
begin
if This.Void_Ptr /= System.Null_Address and then
This in Check_Button'Class
then
free_fl_check_button (This.Void_Ptr);
This.Void_Ptr := System.Null_Address;
end if;
Finalize (Light_Button (This));
end Finalize;
package body Forge is
function Create
(X, Y, W, H : in Integer;
Text : in String)
return Check_Button is
begin
return This : Check_Button do
This.Void_Ptr := new_fl_check_button
(Interfaces.C.int (X),
Interfaces.C.int (Y),
Interfaces.C.int (W),
Interfaces.C.int (H),
Interfaces.C.To_C (Text));
fl_widget_set_user_data
(This.Void_Ptr,
Widget_Convert.To_Address (This'Unchecked_Access));
check_button_set_draw_hook (This.Void_Ptr, Draw_Hook'Address);
check_button_set_handle_hook (This.Void_Ptr, Handle_Hook'Address);
end return;
end Create;
end Forge;
procedure Draw
(This : in out Check_Button) is
begin
fl_check_button_draw (This.Void_Ptr);
end Draw;
function Handle
(This : in out Check_Button;
Event : in Event_Kind)
return Event_Outcome is
begin
return Event_Outcome'Val
(fl_check_button_handle (This.Void_Ptr, Event_Kind'Pos (Event)));
end Handle;
end FLTK.Widgets.Buttons.Light.Check;
| 26.325 | 84 | 0.610003 |
3daf17d688be9ddec2b2257c12786b2173edd291 | 8,324 | ads | Ada | tests/src/make_ada.ads | TNO/Rejuvenation-Ada | 8113ec28da3923ccde40d76cbab70e0e614f4b75 | [
"BSD-3-Clause"
] | 1 | 2022-03-08T13:00:47.000Z | 2022-03-08T13:00:47.000Z | src/libraries/Rejuvenation_Lib/tests/make_ada.ads | selroc/Renaissance-Ada | 39230b34aced4a9d83831be346ca103136c53715 | [
"BSD-3-Clause"
] | null | null | null | src/libraries/Rejuvenation_Lib/tests/make_ada.ads | selroc/Renaissance-Ada | 39230b34aced4a9d83831be346ca103136c53715 | [
"BSD-3-Clause"
] | null | null | null | with String_Vectors; use String_Vectors;
with String_Vectors_Utils; use String_Vectors_Utils;
with Ada.Containers; use Ada.Containers;
-- TODO:
-- asked Ada expert how to get operators of String_Vectors
-- without also including Ada.Containers
-- See https://gt3-prod-1.adacore.com/#/tickets/UC02-053 for answer...
-- All parameters of the (externally visible)
-- Make-* functions have default values,
-- such that test cases can be easily vary one aspect of a production rule.
package Make_Ada is
subtype ARM_Type_Definition is String;
-- TODO: find good name that satisfy GNATCheck as well
-- TODO: Make production rules type safe
function Make_Subtype_Indication_Index_Constraints
(Subtype_Mark : String := "Integer";
Index_Constraints : Vector := To_Vector ("1..10", 1)) return String;
-- implements production rule
-- subtype_indication ::= [null_exclusion] subtype_mark [constraint]
-- constraint ::= scalar_constraint | composite_constraint
-- composite_constraint ::=
-- index_constraint | discriminant_constraint
-- See
-- http://www.ada-auth.org/standards/rm12_w_tc1/html/RM-3-2-2.html#S0027
function Make_Object_Declaration_Subtype_Indication
(Defining_Identifier_List : Vector := To_Vector ("Name", 1);
Subtype_Indication : String := "Integer"; Expression : String := "";
Aspect_List : Vector := Empty_Vector) return String;
-- implements production rule
--
-- defining_identifier_list :
-- [aliased] [constant] subtype_indication
-- [:= expression] [aspect_specification];
--
-- see
-- http://www.ada-auth.org/standards/rm12_w_tc1/html/RM-3-3-1.html#S0032
-- Note: An absent expression is implemented
-- using the empty string (i.e. "")
function Make_Null_Statement return String;
function Make_Parameter_Association
(Name : String := ""; Value : String := "1") return String;
function Make_Assignment_Statement
(Variable_Name : String := "Name"; Expression : String := "1")
return String;
-- implements production rule
-- assignment_statement ::= variable_name := expression;
-- see http://www.ada-auth.org/standards/rm12_w_tc1/html/RM-5-2.html
-- note LibAdaLang uses destination instead of variable name.
function Make_Procedure_Call_Statement
(Procedure_Name : String := "P";
Actual_Parameter_Part : Vector := Empty_Vector) return String;
-- implements production rule
-- procedure_call_statement ::= procedure_name;
-- | procedure_prefix actual_parameter_part;
-- see http://www.ada-auth.org/standards/rm12_w_tc1/html/RM-6-4.html
function Make_Function_Call
(Function_Name : String := "F";
Actual_Parameter_Part : Vector := Empty_Vector) return String;
-- implements production rule
-- function_call ::= function_name | function_prefix actual_parameter_part
-- see http://www.ada-auth.org/standards/rm12_w_tc1/html/RM-6-4.html
function Make_Enumeration_Type_Definition
(Defining_Identifier_List : Vector := "M" & "F")
return ARM_Type_Definition with
Pre => Defining_Identifier_List.Length > 0;
-- implements production rule
-- enumeration_type_definition ::=
-- (enumeration_literal_specification {, enumeration_literal_specification})
-- see http://www.ada-auth.org/standards/rm12_w_tc1/html/RM-3-5-1.html
function Make_Full_Type_Declaration
(Defining_Identifier : String := "T";
Type_Definition_Instance : ARM_Type_Definition :=
Make_Enumeration_Type_Definition)
return String;
-- implements (part of) production rule
-- full_type_declaration ::=
-- type defining_identifier [known_discriminant_part] is type_definition
-- [aspect_specification];
-- | task_type_declaration
-- | protected_type_declaration
-- see http://www.ada-auth.org/standards/rm12_w_tc1/html/RM-3-2-1.html
function Make_If_Statement
(Condition : String := "C"; Stmts_True : String := Make_Null_Statement;
Elsif_List : Vector := Empty_Vector; Stmts_False : String := "")
return String;
-- implements production rule
-- if_statement ::=
-- if condition then
-- sequence_of_statements
-- {elsif condition then
-- sequence_of_statements}
-- [else
-- sequence_of_statements]
-- end if;
-- see http://www.ada-auth.org/standards/rm12_w_tc1/html/RM-5-3.html
function Make_Handled_Sequence_Of_Statements
(Sequence_Of_Statements : String := Make_Null_Statement;
Exception_Handlers : Vector := Empty_Vector) return String;
-- see http://www.ada-auth.org/standards/rm12_w_tc1/html/RM-11-2.html
function Make_Block_Statement
(Declarative_Part : String := "";
Handled_Sequence_Of_Statements : String :=
Make_Handled_Sequence_Of_Statements)
return String;
-- block_statement ::=
-- [block_statement_identifier:]
-- [declare
-- declarative_part]
-- begin
-- handled_sequence_of_statements
-- end [block_identifier];
-- see http://www.ada-auth.org/standards/rm12_w_tc1/html/RM-5-6.html
private
function Make_Call
(Name : String; Actual_Parameter_Part : Vector) return String;
function Make_Subtype_Indication_Index_Constraints
(Subtype_Mark : String := "Integer";
Index_Constraints : Vector := To_Vector ("1..10", 1)) return String is
(Subtype_Mark & " (" & Join (Index_Constraints, ", ") & ")");
function Make_Object_Declaration_Subtype_Indication
(Defining_Identifier_List : Vector := To_Vector ("Name", 1);
Subtype_Indication : String := "Integer"; Expression : String := "";
Aspect_List : Vector := Empty_Vector) return String is
(Join (Defining_Identifier_List, ", ") & " : " & Subtype_Indication &
(if Expression = "" then "" else " := " & Expression) &
(if Aspect_List.Is_Empty then ""
else " with " & Join (Aspect_List, ", ")) &
";");
function Make_Null_Statement return String is ("null;");
function Make_Assignment_Statement
(Variable_Name : String := "Name"; Expression : String := "1")
return String is
(Variable_Name & " := " & Expression & ";");
function Make_Procedure_Call_Statement
(Procedure_Name : String := "P";
Actual_Parameter_Part : Vector := Empty_Vector) return String is
(Make_Call (Procedure_Name, Actual_Parameter_Part) & ";");
function Make_Function_Call
(Function_Name : String := "F";
Actual_Parameter_Part : Vector := Empty_Vector) return String is
(Make_Call (Function_Name, Actual_Parameter_Part));
function Make_Enumeration_Type_Definition
(Defining_Identifier_List : Vector := "M" & "F")
return ARM_Type_Definition is
("(" & Join (Defining_Identifier_List, ", ") & ")");
function Make_Full_Type_Declaration
(Defining_Identifier : String := "T";
Type_Definition_Instance : ARM_Type_Definition :=
Make_Enumeration_Type_Definition)
return String is
("type " & Defining_Identifier & " is " & Type_Definition_Instance & ";");
function Make_If_Statement
(Condition : String := "C"; Stmts_True : String := Make_Null_Statement;
Elsif_List : Vector := Empty_Vector; Stmts_False : String := "")
return String is
("if " & Condition & " then " & Stmts_True & Join (Elsif_List, "") &
(if Stmts_False = "" then "" else " else " & Stmts_False) & " end if;");
function Make_Handled_Sequence_Of_Statements
(Sequence_Of_Statements : String := Make_Null_Statement;
Exception_Handlers : Vector := Empty_Vector) return String is
(Sequence_Of_Statements & Join (Exception_Handlers));
function Make_Block_Statement
(Declarative_Part : String := "";
Handled_Sequence_Of_Statements : String :=
Make_Handled_Sequence_Of_Statements)
return String is
((if Declarative_Part = "" then "" else "declare " & Declarative_Part) &
" begin " & Handled_Sequence_Of_Statements & " end;");
end Make_Ada;
| 42.040404 | 79 | 0.668909 |
0669ef560077853bf26a36ca2d5a2a37c87fc136 | 73,142 | adb | Ada | final-project/repositories/Deep_Learning_Inference_Accelerator_with_CNNIOT/MSOC_final-main/finalpool_hls/solution1/.autopilot/db/write_row_ifm.sched.adb | bol-edu/2020-fall-ntu | 5e009875dec5a3bbcebd1b3fae327990371d1b6a | [
"MIT"
] | 7 | 2021-02-10T17:59:48.000Z | 2021-09-27T15:02:56.000Z | final-project/repositories/Deep_Learning_Inference_Accelerator_with_CNNIOT/MSOC_final-main/finalpool_hls/solution1/.autopilot/db/write_row_ifm.sched.adb | bol-edu/2020-fall-ntu | 5e009875dec5a3bbcebd1b3fae327990371d1b6a | [
"MIT"
] | null | null | null | final-project/repositories/Deep_Learning_Inference_Accelerator_with_CNNIOT/MSOC_final-main/finalpool_hls/solution1/.autopilot/db/write_row_ifm.sched.adb | bol-edu/2020-fall-ntu | 5e009875dec5a3bbcebd1b3fae327990371d1b6a | [
"MIT"
] | 1 | 2022-03-22T01:46:01.000Z | 2022-03-22T01:46:01.000Z | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="15">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>write_row_ifm</name>
<ret_bitwidth>32</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>cifm</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>cifm</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>512</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>ifm_buff0_0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ifm_buff0[0]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>58</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>ifm_buff0_1</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ifm_buff0[1]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>58</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_4">
<Value>
<Obj>
<type>1</type>
<id>4</id>
<name>ifm_buff0_2</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>ifm_buff0[2]</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>58</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>cifm_counter_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>cifm_counter</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_6">
<Value>
<Obj>
<type>1</type>
<id>6</id>
<name>enable</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>enable</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>27</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>enable_read</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>D:\Course\mSOC\final</first>
<second class_id="11" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="12" tracking_level="0" version="0">
<first class_id="13" tracking_level="0" version="0">
<first>finalpool.cpp</first>
<second>write_row_ifm</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>enable</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>46</item>
<item>47</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>cifm_counter_read_1</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>write_row_ifm</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>cifm_counter</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>49</item>
<item>50</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>_ln80</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>80</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>write_row_ifm</second>
</first>
<second>80</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>51</item>
<item>52</item>
<item>53</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.76</m_delay>
<m_topoIndex>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>add_ln83</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>write_row_ifm</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>54</item>
<item>56</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.55</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>_ln83</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>write_row_ifm</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.76</m_delay>
<m_topoIndex>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>j_0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>58</item>
<item>59</item>
<item>61</item>
<item>62</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>icmp_ln83</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>write_row_ifm</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>63</item>
<item>65</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.42</m_delay>
<m_topoIndex>7</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>j</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>write_row_ifm</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>66</item>
<item>68</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.82</m_delay>
<m_topoIndex>8</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>_ln83</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>write_row_ifm</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>69</item>
<item>70</item>
<item>71</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>9</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>cifm_read</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>86</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>write_row_ifm</second>
</first>
<second>86</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>512</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>73</item>
<item>74</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>10</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>trunc_ln86</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>86</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>write_row_ifm</second>
</first>
<second>86</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>75</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>11</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>bitcast_ln86</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>86</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>write_row_ifm</second>
</first>
<second>86</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>76</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>12</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>zext_ln86</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>86</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>write_row_ifm</second>
</first>
<second>86</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>77</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>13</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>ifm_buff0_0_addr</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>86</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>write_row_ifm</second>
</first>
<second>86</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>78</item>
<item>80</item>
<item>81</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>14</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>ifm_buff0_0_addr_write_ln86</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>86</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>write_row_ifm</second>
</first>
<second>86</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>82</item>
<item>83</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.25</m_delay>
<m_topoIndex>15</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>cifm_a1_load_new6</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>write_row_ifm</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>85</item>
<item>86</item>
<item>88</item>
<item>90</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>16</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>bitcast_ln87</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>write_row_ifm</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>91</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>17</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>ifm_buff0_1_addr</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>write_row_ifm</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>92</item>
<item>93</item>
<item>94</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>18</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>ifm_buff0_1_addr_write_ln87</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>87</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>write_row_ifm</second>
</first>
<second>87</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>95</item>
<item>96</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.25</m_delay>
<m_topoIndex>19</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>cifm_a2_load_new</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>88</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>write_row_ifm</second>
</first>
<second>88</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>97</item>
<item>98</item>
<item>100</item>
<item>102</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>20</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>bitcast_ln88</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>88</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>write_row_ifm</second>
</first>
<second>88</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>103</item>
</oprand_edges>
<opcode>bitcast</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>21</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>ifm_buff0_2_addr</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>88</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>write_row_ifm</second>
</first>
<second>88</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>104</item>
<item>105</item>
<item>106</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>22</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>ifm_buff0_2_addr_write_ln88</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>88</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>write_row_ifm</second>
</first>
<second>88</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>107</item>
<item>108</item>
</oprand_edges>
<opcode>store</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>3.25</m_delay>
<m_topoIndex>23</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>_ln83</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>83</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>write_row_ifm</second>
</first>
<second>83</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>109</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>24</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>_ln0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>110</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.76</m_delay>
<m_topoIndex>25</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>cifm_counter_1</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>78</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>write_row_ifm</second>
</first>
<second>78</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>111</item>
<item>112</item>
<item>113</item>
<item>114</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>26</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>_ln106</name>
<fileName>finalpool.cpp</fileName>
<fileDirectory>D:\Course\mSOC\final</fileDirectory>
<lineNumber>106</lineNumber>
<contextFuncName>write_row_ifm</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>D:\Course\mSOC\final</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>finalpool.cpp</first>
<second>write_row_ifm</second>
</first>
<second>106</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>115</item>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>27</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_34">
<Value>
<Obj>
<type>2</type>
<id>55</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>58</content>
</item>
<item class_id_reference="16" object_id="_35">
<Value>
<Obj>
<type>2</type>
<id>60</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_36">
<Value>
<Obj>
<type>2</type>
<id>64</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<const_type>0</const_type>
<content>58</content>
</item>
<item class_id_reference="16" object_id="_37">
<Value>
<Obj>
<type>2</type>
<id>67</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_38">
<Value>
<Obj>
<type>2</type>
<id>79</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_39">
<Value>
<Obj>
<type>2</type>
<id>87</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>32</content>
</item>
<item class_id_reference="16" object_id="_40">
<Value>
<Obj>
<type>2</type>
<id>89</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>63</content>
</item>
<item class_id_reference="16" object_id="_41">
<Value>
<Obj>
<type>2</type>
<id>99</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>64</content>
</item>
<item class_id_reference="16" object_id="_42">
<Value>
<Obj>
<type>2</type>
<id>101</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>95</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_43">
<Obj>
<type>3</type>
<id>11</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>3</count>
<item_version>0</item_version>
<item>8</item>
<item>9</item>
<item>10</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_44">
<Obj>
<type>3</type>
<id>14</id>
<name>.preheader.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>12</item>
<item>13</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_45">
<Obj>
<type>3</type>
<id>20</id>
<name>.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>15</item>
<item>16</item>
<item>18</item>
<item>19</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_46">
<Obj>
<type>3</type>
<id>39</id>
<name>hls_label_2</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>15</count>
<item_version>0</item_version>
<item>23</item>
<item>24</item>
<item>25</item>
<item>26</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>36</item>
<item>38</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_47">
<Obj>
<type>3</type>
<id>41</id>
<name>.loopexit.loopexit</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_48">
<Obj>
<type>3</type>
<id>44</id>
<name>.loopexit</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>2</count>
<item_version>0</item_version>
<item>42</item>
<item>43</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>60</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_49">
<id>47</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>8</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_50">
<id>50</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_51">
<id>51</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>10</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_52">
<id>52</id>
<edge_type>2</edge_type>
<source_obj>44</source_obj>
<sink_obj>10</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_53">
<id>53</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>10</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_54">
<id>54</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_55">
<id>56</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_56">
<id>57</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>13</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_57">
<id>58</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_58">
<id>59</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_59">
<id>61</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_60">
<id>62</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_61">
<id>63</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_62">
<id>65</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_63">
<id>66</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_64">
<id>68</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>18</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_65">
<id>69</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_66">
<id>70</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_67">
<id>71</id>
<edge_type>2</edge_type>
<source_obj>41</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_68">
<id>74</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>23</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_69">
<id>75</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_70">
<id>76</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_71">
<id>77</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_72">
<id>78</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_73">
<id>80</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_74">
<id>81</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>27</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_75">
<id>82</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_76">
<id>83</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>28</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_77">
<id>86</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_78">
<id>88</id>
<edge_type>1</edge_type>
<source_obj>87</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_79">
<id>90</id>
<edge_type>1</edge_type>
<source_obj>89</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_80">
<id>91</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_81">
<id>92</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_82">
<id>93</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_83">
<id>94</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_84">
<id>95</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_85">
<id>96</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_86">
<id>98</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_87">
<id>100</id>
<edge_type>1</edge_type>
<source_obj>99</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_88">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>101</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_89">
<id>103</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_90">
<id>104</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_91">
<id>105</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_92">
<id>106</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_93">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_94">
<id>108</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>36</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_95">
<id>109</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>38</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_96">
<id>110</id>
<edge_type>2</edge_type>
<source_obj>44</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_97">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_98">
<id>112</id>
<edge_type>2</edge_type>
<source_obj>11</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_99">
<id>113</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_100">
<id>114</id>
<edge_type>2</edge_type>
<source_obj>41</source_obj>
<sink_obj>42</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_101">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_102">
<id>165</id>
<edge_type>2</edge_type>
<source_obj>11</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_103">
<id>166</id>
<edge_type>2</edge_type>
<source_obj>11</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_104">
<id>167</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_105">
<id>168</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_106">
<id>169</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_107">
<id>170</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_108">
<id>171</id>
<edge_type>2</edge_type>
<source_obj>41</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_109">
<mId>1</mId>
<mTag>write_row_ifm</mTag>
<mType>0</mType>
<sub_regions>
<count>4</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
<item>5</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>1</mMinLatency>
<mMaxLatency>60</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_110">
<mId>2</mId>
<mTag>Entry</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>11</item>
<item>14</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_111">
<mId>3</mId>
<mTag>Loop 1</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>20</item>
<item>39</item>
</basic_blocks>
<mII>1</mII>
<mDepth>1</mDepth>
<mMinTripCount>58</mMinTripCount>
<mMaxTripCount>58</mMaxTripCount>
<mMinLatency>58</mMinLatency>
<mMaxLatency>58</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_112">
<mId>4</mId>
<mTag>Region 1</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_113">
<mId>5</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>44</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="-1"></fsm>
<res class_id="-1"></res>
<node_label_latency class_id="26" tracking_level="0" version="0">
<count>27</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>8</first>
<second class_id="28" tracking_level="0" version="0">
<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>0</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="29" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="0" version="0">
<first>11</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="1" version="0" object_id="_114">
<region_name>Loop 1</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>20</item>
<item>39</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>1</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="34" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="35" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="36" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_reg_nodes>
<dp_regname_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core class_id="38" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 26.890441 | 70 | 0.603402 |
591673e7d602b6fd78dda6522f1fc002f29b9842 | 6,331 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/a-cuprqu.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/ada/a-cuprqu.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/a-cuprqu.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- ADA.CONTAINERS.UNBOUNDED_PRIORITY_QUEUES --
-- --
-- S p e c --
-- --
-- Copyright (C) 2011-2016, 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/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
with System;
with Ada.Containers.Ordered_Sets;
with Ada.Containers.Synchronized_Queue_Interfaces;
generic
with package Queue_Interfaces is
new Ada.Containers.Synchronized_Queue_Interfaces (<>);
type Queue_Priority is private;
with function Get_Priority
(Element : Queue_Interfaces.Element_Type) return Queue_Priority is <>;
with function Before
(Left, Right : Queue_Priority) return Boolean is <>;
Default_Ceiling : System.Any_Priority := System.Priority'Last;
package Ada.Containers.Unbounded_Priority_Queues is
pragma Annotate (CodePeer, Skip_Analysis);
pragma Preelaborate;
package Implementation is
-- All identifiers in this unit are implementation defined
pragma Implementation_Defined;
-- We use an ordered set to hold the queue elements. This gives O(lg N)
-- performance in the worst case for Enqueue and Dequeue.
-- Sequence_Number is used to distinguish equivalent items. Each Enqueue
-- uses a higher Sequence_Number, so that a new item is placed after
-- already-enqueued equivalent items.
--
-- At any time, the first set element is the one to be dequeued next (if
-- the queue is not empty).
type Set_Elem is record
Sequence_Number : Count_Type;
Item : Queue_Interfaces.Element_Type;
end record;
function "=" (X, Y : Queue_Interfaces.Element_Type) return Boolean is
(not Before (Get_Priority (X), Get_Priority (Y))
and then not Before (Get_Priority (Y), Get_Priority (X)));
-- Elements are equal if neither is Before the other
function "=" (X, Y : Set_Elem) return Boolean is
(X.Sequence_Number = Y.Sequence_Number and then X.Item = Y.Item);
-- Set_Elems are equal if the elements are equal, and the
-- Sequence_Numbers are equal. This is passed to Ordered_Sets.
function "<" (X, Y : Set_Elem) return Boolean is
(if X.Item = Y.Item
then X.Sequence_Number < Y.Sequence_Number
else Before (Get_Priority (X.Item), Get_Priority (Y.Item)));
-- If the items are equal, Sequence_Number breaks the tie. Otherwise,
-- use Before. This is passed to Ordered_Sets.
pragma Suppress (Container_Checks);
package Sets is new Ada.Containers.Ordered_Sets (Set_Elem);
end Implementation;
use Implementation, Implementation.Sets;
protected type Queue (Ceiling : System.Any_Priority := Default_Ceiling)
with
Priority => Ceiling
is new Queue_Interfaces.Queue with
overriding entry Enqueue (New_Item : Queue_Interfaces.Element_Type);
overriding entry Dequeue (Element : out Queue_Interfaces.Element_Type);
-- The priority queue operation Dequeue_Only_High_Priority had been a
-- protected entry in early drafts of AI05-0159, but it was discovered
-- that that operation as specified was not in fact implementable. The
-- operation was changed from an entry to a protected procedure per the
-- ARG meeting in Edinburgh (June 2011), with a different signature and
-- semantics.
procedure Dequeue_Only_High_Priority
(At_Least : Queue_Priority;
Element : in out Queue_Interfaces.Element_Type;
Success : out Boolean);
overriding function Current_Use return Count_Type;
overriding function Peak_Use return Count_Type;
private
Q_Elems : Set;
-- Elements of the queue
Max_Length : Count_Type := 0;
-- The current length of the queue is the Length of Q_Elems. This is the
-- maximum value of that, so far. Updated by Enqueue.
Next_Sequence_Number : Count_Type := 0;
-- Steadily increasing counter
end Queue;
end Ada.Containers.Unbounded_Priority_Queues;
| 45.876812 | 79 | 0.574949 |
58361d30702b7bd94d548e21a861544303266010 | 905 | adb | Ada | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/complete/aux_pck.adb | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | 3 | 2021-05-04T17:09:06.000Z | 2021-10-04T07:19:26.000Z | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/complete/aux_pck.adb | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | null | null | null | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/complete/aux_pck.adb | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | null | null | null | -- Copyright 2015-2020 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package body Aux_Pck is
procedure Ambiguous_Func is
begin
null;
end Ambiguous_Func;
procedure Ambiguous_Proc is
begin
null;
end Ambiguous_Proc;
end Aux_Pck;
| 31.206897 | 73 | 0.729282 |
3d4779bf1a504b824544d752077a7dec90d0618c | 2,999 | adb | Ada | tools/akt-commands-get.adb | My-Colaborations/ada-keystore | 6ab222c2df81f32309c5a7b4f94a475214ef5ce3 | [
"Apache-2.0"
] | null | null | null | tools/akt-commands-get.adb | My-Colaborations/ada-keystore | 6ab222c2df81f32309c5a7b4f94a475214ef5ce3 | [
"Apache-2.0"
] | null | null | null | tools/akt-commands-get.adb | My-Colaborations/ada-keystore | 6ab222c2df81f32309c5a7b4f94a475214ef5ce3 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- akt-commands-get -- Get content from keystore
-- 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 Ada.Command_Line;
with Ada.Streams;
with Util.Systems.Os;
with Util.Streams.Raw;
with GNAT.Command_Line;
package body AKT.Commands.Get is
Sep : Ada.Streams.Stream_Element_Array (1 .. Util.Systems.Os.Line_Separator'Length);
for Sep'Address use Util.Systems.Os.Line_Separator'Address;
Output : Util.Streams.Raw.Raw_Stream;
-- ------------------------------
-- Get a value from the keystore.
-- ------------------------------
overriding
procedure Execute (Command : in out Command_Type;
Name : in String;
Args : in Argument_List'Class;
Context : in out Context_Type) is
begin
if Args.Get_Count = 0 then
AKT.Commands.Usage (Args, Context, Name);
else
Context.Open_Keystore (Args, Use_Worker => True);
Output.Initialize (File => Util.Systems.Os.STDOUT_FILENO);
for I in Context.First_Arg .. Args.Get_Count loop
declare
Key : constant String := Args.Get_Argument (I);
begin
Context.Wallet.Get (Key, Output);
if not Command.No_Newline then
Output.Write (Sep);
end if;
exception
when Keystore.Not_Found =>
AKT.Commands.Log.Error (-("Value '{0}' not found"), Key);
Ada.Command_Line.Set_Exit_Status (Ada.Command_Line.Failure);
end;
end loop;
end if;
end Execute;
-- ------------------------------
-- Setup the command before parsing the arguments and executing it.
-- ------------------------------
procedure Setup (Command : in out Command_Type;
Config : in out GNAT.Command_Line.Command_Line_Configuration;
Context : in out Context_Type) is
package GC renames GNAT.Command_Line;
begin
Drivers.Command_Type (Command).Setup (Config, Context);
GC.Define_Switch (Config, Command.No_Newline'Access,
"-n", "", -("Do not output the trailing newline"));
end Setup;
end AKT.Commands.Get;
| 38.948052 | 87 | 0.572191 |
577b3a2508d27c93d7497b2f53d7fe1a3afed8af | 302 | ads | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/specs/loop_optimization1_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/specs/loop_optimization1_pkg.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/specs/loop_optimization1_pkg.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- { dg-excess-errors "no code generated" }
generic
type Element_Type is private;
type Index_Type is (<>);
type Constrained_Array_Type is array (Index_Type) of Element_Type;
package Loop_Optimization1_Pkg is
procedure Proc (CA : in out Constrained_Array_Type);
end Loop_Optimization1_Pkg;
| 21.571429 | 68 | 0.768212 |
59b9692efae213d94ccd59d0c6f627820a8b3759 | 25,258 | adb | Ada | src/asis/a4g-get_unit.adb | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 15 | 2015-01-18T23:04:19.000Z | 2022-03-01T20:27:08.000Z | src/asis/a4g-get_unit.adb | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 16 | 2018-06-10T07:09:30.000Z | 2022-03-26T18:28:40.000Z | src/asis/a4g-get_unit.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 4 G . G E T _ U N I T --
-- --
-- B o d y --
-- --
-- Copyright (C) 1995-2011, 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 Ada.Characters.Handling; use Ada.Characters.Handling;
with GNAT.Directory_Operations; use GNAT.Directory_Operations;
with GNAT.OS_Lib; use GNAT.OS_Lib;
with Asis.Errors;
with Asis.Exceptions; use Asis.Exceptions;
with Asis.Set_Get; use Asis.Set_Get;
with A4G.A_Debug; use A4G.A_Debug;
with A4G.A_Opt; use A4G.A_Opt;
with A4G.U_Conv; use A4G.U_Conv;
with A4G.Contt.Dp; use A4G.Contt.Dp;
with A4G.Contt.SD; use A4G.Contt.SD;
with A4G.Contt.TT; use A4G.Contt.TT;
with A4G.Contt.UT; use A4G.Contt.UT; use A4G.Contt;
with A4G.Defaults; use A4G.Defaults;
with A4G.GNAT_Int; use A4G.GNAT_Int;
with A4G.Vcheck; use A4G.Vcheck;
with Output; use Output;
package body A4G.Get_Unit is
-----------------------
-- Local subprograms --
-----------------------
function Convert_To_String (Wide_Name : Wide_String) return String;
-- Takes the name (of a compilation unit) and converts it into String
-- following the GNAT encoding rules as described in Namet.
-----------------------
-- Convert_To_String --
-----------------------
function Convert_To_String (Wide_Name : Wide_String) return String is
begin
if Is_String (Wide_Name) then
return To_String (Wide_Name);
else
Not_Implemented_Yet ("Wide_Character in Unit name");
end if;
end Convert_To_String;
----------------------------
-- Fetch_Unit_By_Ada_Name --
----------------------------
function Fetch_Unit_By_Ada_Name
(Name : String;
Norm_Name : String;
Context : Context_Id;
Spec : Boolean)
return Unit_Id
is
Result_Unit_Id : Unit_Id;
Result_Tree : Tree_Id;
File_Name : String_Access;
-- We use File_Name to obtain the source file name according to
-- the GNAT file name rules (including the krunching rules)
Predefined : Boolean := False;
Success : Boolean := False;
Source_File : String_Access;
-- source to compile, contains all the path information
Tree_File_N : String_Access;
-- tree output file to be retrieved (name)
Tree_File_D : File_Descriptor;
-- tree output file to be retrieved (file descriptor)
Cont_Tree_Mode : constant Tree_Mode := Tree_Processing_Mode (Context);
procedure Get_Source_File;
-- This procedure creates the value of Source_File using the values
-- of Name and Spec. The procedure first tries to get the file
-- containing the body regardless of the value of the Spec parameter.
-- The idea is to get for Spec => True the tree file containing both
-- the spec and the body of the compilation unit. If we get the tree
-- file for the spec only, then latter on we may get into
-- the following problem - the attempt to get the body of the
-- compilation unit will create the tree file for the body, and
-- this tree file will have the same name. As a result, all the
-- references into the tree for spec will become erroneous, and
-- we will have the problem similar to what was reported as 7504-002.
--
-- ??? All this "compile-on-the-fly" Context mode becomes a real
-- mess. May be, we have to get rid of it???
procedure Get_Source_File is
begin
-- The code is really awfull, but probably it would be better to
-- get rid of the "compila-on-the-fly" mode, then to polish
-- the code.
File_Name := Source_From_Unit_Name (Name, False);
-- if needed, the name is krunched here (??? may be, we can already
-- forget about systems with the limitations on the file name
-- length???)
-- Note also, that ASIS cannot work with files which names override
-- the standard GNAT file name convention as a result of
-- Source_File_Name pragma.
Source_File := Locate_In_Search_Path
(C => Context,
File_Name => To_String (File_Name),
Dir_Kind => Source);
if Source_File = null then
Source_File := Locate_Default_File
(File_Name => File_Name,
Dir_Kind => Source);
end if;
if Source_File /= null then
return;
elsif Spec then
File_Name := Source_From_Unit_Name (Name, True);
Source_File := Locate_In_Search_Path
(C => Context,
File_Name => To_String (File_Name),
Dir_Kind => Source);
if Source_File = null then
Source_File := Locate_Default_File
(File_Name => File_Name,
Dir_Kind => Source);
end if;
end if;
if Source_File = null and then
Is_Predefined_File_Name (File_Name)
-- not GNAT, but ASIS Is_Predefined_File_Name function is called
-- here!
then
-- if File_Name is the name of a predefined unit, we shall try
-- the default source search path. See also
-- A4G.Contt.Set_Predefined_Units
File_Name := Source_From_Unit_Name (Name, False);
Predefined := True;
Source_File := Locate_Default_File (File_Name, Source);
if Source_File = null then
File_Name := Source_From_Unit_Name (Name, True);
Source_File := Locate_Default_File (File_Name, Source);
end if;
end if;
end Get_Source_File;
begin
-- we start from looking for a unit in the Unit Name Table
Set_Name_String (Norm_Name);
Result_Unit_Id := Name_Find (Context);
if Result_Unit_Id /= Nil_Unit then
return Result_Unit_Id;
elsif Cont_Tree_Mode = Pre_Created then
if Norm_Name = "standard%s" then
-- For Standard, we have to search twice - first for possible
-- redefinition of Standard, then - for predefined Standard
return Standard_Id;
else
return Nil_Unit;
end if;
end if;
if Spec then
-- The idea is to avoid non-needed recompilations in case if we
-- already have the (tree for the) corresponding body, see F823-027.
A_Name_Buffer (A_Name_Len) := 'b';
Result_Unit_Id := Name_Find (Context);
if Result_Unit_Id /= Nil_Unit then
return Nil_Unit;
end if;
end if;
-- We can be here only if Context was associated in On_The_Fly or Mixed
-- tree processing mode mode, and we have failed to find the required
-- unit among units which are already known to ASIS. Therefore, we
-- have to (try to) create the tree by compiling the source:
Get_Source_File;
if Source_File = null then
if Debug_Mode then
Write_Str ("Fetch_Unit_By_Ada_Name: cannot locate a source file ");
Write_Str ("for " & Name);
Write_Eol;
end if;
return Nil_Unit;
end if;
-- And trying to compile - Source_File contains the reference
-- to the existing source file which has been already successfully
-- located in the Context:
if Debug_Mode then
Write_Str ("Fetch_Unit_By_Ada_Name: "
& "Trying to create a tree on the fly:");
Write_Eol;
Write_Str ("Source file is " & To_String (Source_File));
Write_Eol;
end if;
Create_Tree (Source_File => Source_File,
Context => Context,
Is_Predefined => Predefined,
Success => Success);
if not Success then
if Debug_Mode then
Write_Str ("Failure...");
Write_Eol;
end if;
return Nil_Unit;
end if;
if Debug_Mode then
Write_Str ("Success...");
Write_Eol;
end if;
-- here we have a new tree, successfully created just here. We will
-- read it in, then we will investigate it just in the same way as
-- during opening a Context and then we look into the unit table for
-- the needed unit again
Tree_File_N := Tree_From_Source_Name (File_Name);
-- ??? IT WOULD BE BETTER TO USE STRIP_DIRECTORY (SOURCE_FILE)
-- INSTEAD OF FILE_NAME HERE!!!!!
Tree_File_D := Open_Read (Tree_File_N.all'Address, Binary);
begin
if Debug_Mode then
Write_Str ("Fetch_Unit_By_Ada_Name: trying to read in a tree...");
Write_Eol;
end if;
Tree_In_With_Version_Check (Tree_File_D, Context, Success);
if Success then
if Debug_Mode then
Write_Str ("Fetch_Unit_By_Ada_Name: a tree is read in...");
Write_Eol;
end if;
else
-- This should never happen!
Set_Error_Status
(Status => Asis.Errors.Use_Error,
Diagnosis => "A4G.Get_Unit.Fetch_Unit_By_Ada_Name:"
& ASIS_Line_Terminator
& "problems reading tree file "
& To_String (Tree_File_N));
raise ASIS_Failed;
end if;
exception
when Program_Error |
ASIS_Failed =>
raise;
when Ex : others =>
-- If we are here, we are definitely having a serious problem:
-- we have a tree file which is version-compartible with ASIS,
-- and we can not read it because of some unknown reason.
Set_Current_Cont (Nil_Context_Id);
Set_Current_Tree (Nil_Tree);
-- debug stuff...
if Debug_Flag_O or else
Debug_Lib_Model or else
Debug_Mode
then
Write_Str ("A4G.Get_Unit.Fetch_Unit_By_Ada_Name:");
Write_Eol;
Write_Str ("Cannot read the tree file ");
Write_Str (To_String (Tree_File_N));
Write_Str (" newly created for a source file ");
Write_Str (To_String (Source_File));
Write_Eol;
end if;
Report_ASIS_Bug
(Query_Name => "A4G.Get_Unit.Fetch_Unit_By_Ada_Name" &
" (tree file " & To_String (Tree_File_N) & ")",
Ex => Ex);
end;
Set_Name_String (To_String (Tree_File_N));
Set_Current_Cont (Context);
Result_Tree := Allocate_Tree_Entry;
Set_Current_Tree (Result_Tree);
-- here we have to investigate the newly created tree:
if Tree_Processing_Mode (Context) = Incremental then
begin
NB_Save;
Register_Units (Set_First_New_Unit => True);
Scan_Units_New;
Set_All_Dependencies (Use_First_New_Unit => True);
Reorder_Trees (Context);
exception
when Inconsistent_Incremental_Context =>
-- Erase the old Context information
Increase_ASIS_OS_Time;
Pre_Initialize (Context);
A4G.Contt.Initialize (Context);
-- We still have one good tree
Result_Tree := Allocate_Tree_Entry;
NB_Restore;
Set_Current_Tree (Result_Tree);
-- And we have to extract the information from this tree
Register_Units;
Scan_Units_New;
Set_All_Dependencies;
end;
else
-- For old "on the fly" and mixed mode no enhansment
Register_Units;
Scan_Units_New;
end if;
-- and now - the final attempt to get the needed unit. We have to reset
-- the name buffer - it may be changed by Scan_Units_New:
Set_Name_String (Norm_Name);
Result_Unit_Id := Name_Find (Context);
if Result_Unit_Id = Nil_Unit
and then
Norm_Name = "standard%s"
then
-- For Standard, we have to search twice - first for possible
-- redefinition of Standard, then - for predefined Standard
Result_Unit_Id := Standard_Id;
end if;
return Result_Unit_Id;
end Fetch_Unit_By_Ada_Name;
-----------------------------------
-- Get_Main_Unit_Tree_On_The_Fly --
-----------------------------------
function Get_Main_Unit_Tree_On_The_Fly
(Start_Unit : Unit_Id;
Cont : Context_Id;
Spec : Boolean)
return Unit_Id
is
Start_CU : constant Asis.Compilation_Unit :=
Get_Comp_Unit (Start_Unit, Cont);
Result_Unit_Id : Unit_Id;
Result_Tree : Tree_Id;
File_Name : String_Access;
-- We use File_Name to obtain the source file name according to
-- the GNAT file name rules (including the krunching rules)
Predefined : Boolean := False;
Success : Boolean := False;
S_File_To_Compile : String_Access;
-- source to compile, contains all the path information
Tmp_S_File, Tmp_S_File1 : String_Access;
Tree_File_N : String_Access;
-- tree output file to be retrieved (name)
Tree_File_D : File_Descriptor;
-- tree output file to be retrieved (file descriptor)
procedure Get_Source_File_To_Compile;
-- This procedure creates the value of Source_File using the values
-- of Start_Unit and Spec. If Spec is ON, the full source name of
-- Start_Unit is used. If Spec is OFF, we try to create the source
-- file name from the unit name by applying the standard GNAT file
-- naming rules. This is the weak point of the implementation, because
-- this does not wor for non-standard names
procedure Get_Source_File_To_Compile is
begin
if Spec then
S_File_To_Compile :=
new String'(Source_File (Start_CU) & ASCII.NUL);
else
-- The first thing to do is to try to locate the file with the
-- name computed on the base of the standard GNAT name rules
File_Name := Source_From_Unit_Name (Unit_Name (Start_CU), False);
S_File_To_Compile := Locate_In_Search_Path
(C => Cont,
File_Name => To_String (File_Name),
Dir_Kind => Source);
if S_File_To_Compile = null then
-- Two possibilities:
-- - Start_Unit is a predefined unit
-- - Try to convert spec name into unit body name and to
-- locate it
Tmp_S_File := new String'(Source_File (Start_CU));
Tmp_S_File (Tmp_S_File'Last) := 'b';
Tmp_S_File1 := new String'(Base_Name (Tmp_S_File.all));
if not Is_Predefined_File_Name (Tmp_S_File1) then
S_File_To_Compile := Locate_In_Search_Path
(C => Cont,
File_Name => Tmp_S_File.all,
Dir_Kind => Source);
else
Predefined := True;
S_File_To_Compile :=
Locate_Default_File (Tmp_S_File, Source);
end if;
end if;
end if;
end Get_Source_File_To_Compile;
begin
Get_Source_File_To_Compile;
if S_File_To_Compile = null then
if Debug_Mode then
Write_Str ("Get_Main_Unit_Tree_On_The_Fly: cannot create a main ");
Write_Str ("tree for " & Unit_Name (Start_CU));
Write_Eol;
end if;
return Nil_Unit;
end if;
-- Now we try to compile - Source_File contains the reference
-- to the existing source file which has been already successfully
-- located in the Context:
if Debug_Mode then
Write_Str ("Get_Main_Unit_Tree_On_The_Fly: "
& "Trying to create a main tree on the fly:");
Write_Eol;
Write_Str ("Source file is " & S_File_To_Compile.all);
Write_Eol;
end if;
Create_Tree (Source_File => S_File_To_Compile,
Context => Cont,
Is_Predefined => Predefined,
Success => Success);
if not Success then
if Debug_Mode then
Write_Str ("Failure...");
Write_Eol;
end if;
return Nil_Unit;
end if;
if Debug_Mode then
Write_Str ("Success...");
Write_Eol;
end if;
-- Now we have a new tree, successfully created just here. We have to
-- add it to the incremental Context
Tree_File_N := new String'(Base_Name (S_File_To_Compile.all));
Tree_File_N (Tree_File_N'Last - 1) := 't';
-- ??? What about non-standart file names????
Tree_File_D := Open_Read (Tree_File_N.all'Address, Binary);
begin
if Debug_Mode then
Write_Str ("Get_Main_Unit_Tree_On_The_Fly: read in a tree...");
Write_Eol;
end if;
Tree_In_With_Version_Check (Tree_File_D, Cont, Success);
if Success then
if Debug_Mode then
Write_Str ("Get_Main_Unit_Tree_On_The_Fly: done...");
Write_Eol;
end if;
else
-- This should never happen!
Set_Error_Status
(Status => Asis.Errors.Use_Error,
Diagnosis => "A4G.Get_Unit.Get_Main_Unit_Tree_On_The_Fly:"
& ASIS_Line_Terminator
& "problems reading tree file "
& To_String (Tree_File_N));
raise ASIS_Failed;
end if;
exception
when Program_Error |
ASIS_Failed =>
raise;
when Ex : others =>
-- If we are here, we are definitely having a serious problem:
-- we have a tree file which is version-compartible with ASIS,
-- and we can not read it because of some unknown reason.
Set_Current_Cont (Nil_Context_Id);
Set_Current_Tree (Nil_Tree);
-- debug stuff...
if Debug_Flag_O or else
Debug_Lib_Model or else
Debug_Mode
then
Write_Str ("A4G.Get_Unit.Get_Main_Unit_Tree_On_The_Fly:");
Write_Eol;
Write_Str ("Cannot read the tree file ");
Write_Str (To_String (Tree_File_N));
Write_Str (" newly created for a source file ");
Write_Str (S_File_To_Compile.all);
Write_Eol;
end if;
Report_ASIS_Bug
(Query_Name => "A4G.Get_Unit.Get_Main_Unit_Tree_On_The_Fly" &
" (tree file " & To_String (Tree_File_N) & ")",
Ex => Ex);
end;
Set_Name_String (To_String (Tree_File_N));
Set_Current_Cont (Cont);
Result_Tree := Allocate_Tree_Entry;
Set_Current_Tree (Result_Tree);
-- here we have to investigate the newly created tree:
begin
NB_Save;
Register_Units (Set_First_New_Unit => True);
Scan_Units_New;
Set_All_Dependencies (Use_First_New_Unit => True);
Reorder_Trees (Cont);
exception
when Inconsistent_Incremental_Context =>
-- Erase the old Context information
Increase_ASIS_OS_Time;
Pre_Initialize (Cont);
A4G.Contt.Initialize (Cont);
-- We still have one good tree
Result_Tree := Allocate_Tree_Entry;
NB_Restore;
Set_Current_Tree (Result_Tree);
-- And we have to extract the information from this tree
Register_Units;
Scan_Units_New;
Set_All_Dependencies;
end;
-- and now - forming the result Unit_Id
if Spec then
Result_Unit_Id := Start_Unit;
else
Result_Unit_Id := Get_Body (Cont, Start_Unit);
end if;
return Result_Unit_Id;
end Get_Main_Unit_Tree_On_The_Fly;
------------------
-- Get_One_Unit --
------------------
function Get_One_Unit
(Name : Wide_String;
Context : Context_Id;
Spec : Boolean)
return Unit_Id
is
Unit_Name : constant String := Convert_To_String (Name);
Name_Length : constant Natural := Unit_Name'Length;
Norm_Unit_Name : String (1 .. Name_Length + 2); -- "+ 2" for %(s|b)
Result_Id : Unit_Id;
Is_Unit_Name : Boolean := False;
begin
-- first of all, we have to check if Name can really be
-- treated as Ada unit name:
if Name_Length = 0 then
return Nil_Unit;
end if;
Get_Norm_Unit_Name (U_Name => Unit_Name,
N_U_Name => Norm_Unit_Name,
Spec => Spec,
May_Be_Unit_Name => Is_Unit_Name);
if not Is_Unit_Name then
return Nil_Unit;
end if;
-- Now we are sure that Name has the syntax structure of the Ada
-- unit name, and we have to check whether ASIS has already got
-- to know about this unit in its Unit Table, Norm_Unit_Name has
-- already been prepared for the corresponding search in the
-- Unit Table. If this check fails, we will
-- have to try to compile the Unit from its source:
Result_Id := Fetch_Unit_By_Ada_Name
(Name => Unit_Name,
Norm_Name => Norm_Unit_Name,
Context => Context,
Spec => Spec);
return Result_Id;
end Get_One_Unit;
end A4G.Get_Unit;
| 35.325874 | 79 | 0.536503 |
0bf91d5522d51b87d7f34ebacca343e3c12af36b | 3,283 | adb | Ada | src/fltk-widgets-valuators-sliders-hor_nice.adb | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | 1 | 2020-12-18T15:20:13.000Z | 2020-12-18T15:20:13.000Z | src/fltk-widgets-valuators-sliders-hor_nice.adb | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | null | null | null | src/fltk-widgets-valuators-sliders-hor_nice.adb | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | null | null | null |
with
Interfaces.C.Strings,
System;
use type
System.Address;
package body FLTK.Widgets.Valuators.Sliders.Hor_Nice is
procedure hor_nice_slider_set_draw_hook
(W, D : in System.Address);
pragma Import (C, hor_nice_slider_set_draw_hook, "hor_nice_slider_set_draw_hook");
pragma Inline (hor_nice_slider_set_draw_hook);
procedure hor_nice_slider_set_handle_hook
(W, H : in System.Address);
pragma Import (C, hor_nice_slider_set_handle_hook, "hor_nice_slider_set_handle_hook");
pragma Inline (hor_nice_slider_set_handle_hook);
function new_fl_hor_nice_slider
(X, Y, W, H : in Interfaces.C.int;
Text : in Interfaces.C.char_array)
return System.Address;
pragma Import (C, new_fl_hor_nice_slider, "new_fl_hor_nice_slider");
pragma Inline (new_fl_hor_nice_slider);
procedure free_fl_hor_nice_slider
(D : in System.Address);
pragma Import (C, free_fl_hor_nice_slider, "free_fl_hor_nice_slider");
pragma Inline (free_fl_hor_nice_slider);
procedure fl_hor_nice_slider_draw
(W : in System.Address);
pragma Import (C, fl_hor_nice_slider_draw, "fl_hor_nice_slider_draw");
pragma Inline (fl_hor_nice_slider_draw);
function fl_hor_nice_slider_handle
(W : in System.Address;
E : in Interfaces.C.int)
return Interfaces.C.int;
pragma Import (C, fl_hor_nice_slider_handle, "fl_hor_nice_slider_handle");
pragma Inline (fl_hor_nice_slider_handle);
procedure Finalize
(This : in out Hor_Nice_Slider) is
begin
if This.Void_Ptr /= System.Null_Address and then
This in Hor_Nice_Slider'Class
then
free_fl_hor_nice_slider (This.Void_Ptr);
This.Void_Ptr := System.Null_Address;
end if;
Finalize (Slider (This));
end Finalize;
package body Forge is
function Create
(X, Y, W, H : in Integer;
Text : in String)
return Hor_Nice_Slider is
begin
return This : Hor_Nice_Slider do
This.Void_Ptr := new_fl_hor_nice_slider
(Interfaces.C.int (X),
Interfaces.C.int (Y),
Interfaces.C.int (W),
Interfaces.C.int (H),
Interfaces.C.To_C (Text));
fl_widget_set_user_data
(This.Void_Ptr,
Widget_Convert.To_Address (This'Unchecked_Access));
hor_nice_slider_set_draw_hook (This.Void_Ptr, Draw_Hook'Address);
hor_nice_slider_set_handle_hook (This.Void_Ptr, Handle_Hook'Address);
end return;
end Create;
end Forge;
procedure Draw
(This : in out Hor_Nice_Slider) is
begin
fl_hor_nice_slider_draw (This.Void_Ptr);
end Draw;
function Handle
(This : in out Hor_Nice_Slider;
Event : in Event_Kind)
return Event_Outcome is
begin
return Event_Outcome'Val
(fl_hor_nice_slider_handle (This.Void_Ptr, Event_Kind'Pos (Event)));
end Handle;
end FLTK.Widgets.Valuators.Sliders.Hor_Nice;
| 27.358333 | 90 | 0.624429 |
57ede1698cba0351f1539957495ebe1277ddb86f | 5,525 | adb | Ada | src/nso-json-gnoga_object.adb | SSOCsoft/Log_Reporter | 9351ce0b5bda6909d7b9fac3436a702393188fc9 | [
"MIT"
] | null | null | null | src/nso-json-gnoga_object.adb | SSOCsoft/Log_Reporter | 9351ce0b5bda6909d7b9fac3436a702393188fc9 | [
"MIT"
] | null | null | null | src/nso-json-gnoga_object.adb | SSOCsoft/Log_Reporter | 9351ce0b5bda6909d7b9fac3436a702393188fc9 | [
"MIT"
] | null | null | null | Pragma Ada_2012;
With
Ada.Unchecked_Conversion,
NSO.Types,
--NSO.Types.Report_Objects,
Gnoga.Server.Connection;
Package Body NSO.JSON.Gnoga_Object is
JS_Make_Path : Constant String :=
"let pathing = (str) => "&
" {return Array.from(str).reduceRight( (accumulator, current) =>"&
" {switch (current){"&
" case '[' : accumulator.push(''); break;"&
" case ']' : break;"&
" default: accumulator[accumulator.length-1] = current+accumulator[accumulator.length-1];"&
" };"&
" return accumulator; },['']).reverse();"&
" }; /*pathing*/";
JS_Get_Parameters : Constant String:=
"let collect = () => {"&
" let object = {};"&
" new URLSearchParams( new URL( document.location.href ).search ).forEach((value, key) => {"&
" /* Reflect.has in favor of: object.hasOwnProperty(key) */"&
" if(!Reflect.has(object, key)){"&
" object[key] = value;"&
" return;"&
" }"&
" if(!Array.isArray(object[key])){"&
" object[key] = [object[key]];"&
" }"&
" object[key].push(value);"&
" });"&
" return object;"&
"}; /* collect */";
JS_Build_Object : constant String:=
"let build_obj = (kvp) => {"&
" let object = {};"&
" Object.entries(kvp).forEach(([key, value]) => {"&
" let keyset = pathing( key ).reduce( (acc, cur, x, arr) =>"&
" {const exists = Reflect.has(acc,cur);"&
" const is_last = (x == arr.length-1);"&
" if (exists)"&
" {if (is_last) { acc[cur].push(value); } else {return acc[cur];}}"&
" else"&
" {if (is_last) { acc[cur] = []; acc[cur].push(value);} else { acc[cur]={}; }};"&
" return acc[cur];"&
" },object);"&
" });"&
" return object;"&
"}; /* build_obj */";
JS_Normalize_Object : Constant String:=
"let normalize = (o) => {"&
" let object = {};"&
" Object.entries(o).forEach(([key, value]) => {"&
" if (Array.isArray(value) && (value.length == 1)) { object[key] = value[0]; }"&
" else { object[key] = normalize(value);};"&
" },o);"&
" return object;"&
"}; /* Normalize */";
JS_Parameter_Object : Constant String :=
--"{"&
JS_Make_Path &
JS_Get_Parameters &
JS_Build_Object &
JS_Normalize_Object &
" JSON.stringify( normalize(build_obj(collect())) );"&
"";--"}";
Function Get_JSON(Object : Base_Type'Class) return JSON_Class is
(JSON_Class'Class'Input(
NSO.Types."+"(
Gnoga.Server.Connection.Execute_Script(
ID => Object.Connection_ID,
Script => "JSON.stringify( params )"
) -- Returns the String that is the JSON form-parameters.
) -- Uses the given String as a Stream.
) -- Reads the JSON from the given Stream.
); -- Returns the JSON.
Function Parameters (Object : Form_Object) return JSON_Class is
(JSON_Class'Class'Input(
NSO.Types."+"(
Gnoga.Server.Connection.Execute_Script(
ID => Object.Connection_ID,
Script =>
JS_Parameter_Object
-- "object = {};"&
-- "new URLSearchParams( new URL( document.location.href )"&
-- ".search ).forEach((value, key) => {"&
-- " /* Reflect.has in favor of: object.hasOwnProperty(key) */ "&
-- " if(!Reflect.has(object, key)){"&
-- " object[key] = value;"&
-- " return;"&
-- " }"&
-- " if(!Array.isArray(object[key])){"&
-- " object[key] = [object[key]];"&
-- " }"&
-- " object[key].push(value);"&
-- "});"&
-- "JSON.stringify( object );"
) -- Returns the String that is the JSON form-parameters.
) -- Uses the given String as a Stream.
) -- Reads the JSON from the given Stream.
); -- Returns the JSON.
-- Generic
-- Type Params(<>) is limited private;
-- Type Report(<>) is limited private;
-- Type View (<>) is limited private;
--
-- with Function Get(Object : Params) return Report is <>;
-- with Function Get(Object : Report) return View is <>;
Function Report_View (Object : Form_Object'Class) Return View is
-- Function Submission(Object : Form ) return Params renames Get;
-- Function Parameters(Object : Params) return Report renames Get;
-- Function Processing(Object : Report) return View renames Get;
Form_Data : Form renames Form( Object );
Begin
Return Result : Constant View :=
Processing( Parameters( Submission( Object => Form_Data ) ) );
End Report_View;
Function As_Form (Object : Base_Type'Class) return Form_Object is
Function Convert is new Ada.Unchecked_Conversion(
Source => Base_Type,
Target => Form_Object
);
Base : Base_Type renames Base_Type( Object );
Begin
-- Note: For completeness this should handle upwards-conversion, too.
-- TODO: Add a RENAMES view-conversion branch if the parameter descends from Form_Object.
Return Convert( Base );
End As_Form;
Package Body Generic_Reporter is
Function Generate_Report return View is
( Processing );
End Generic_Reporter;
End NSO.JSON.Gnoga_Object;
| 36.111111 | 101 | 0.535204 |
415fc6038981d1a97cc2aba986defeaf103b7443 | 746 | ads | Ada | src/world.ads | Fabien-Chouteau/motherlode | a97e3f41d189b9725592873b4ae547850ee3a51c | [
"MIT"
] | 2 | 2020-08-24T15:01:37.000Z | 2020-10-16T22:37:07.000Z | src/world.ads | Fabien-Chouteau/motherlode | a97e3f41d189b9725592873b4ae547850ee3a51c | [
"MIT"
] | null | null | null | src/world.ads | Fabien-Chouteau/motherlode | a97e3f41d189b9725592873b4ae547850ee3a51c | [
"MIT"
] | 1 | 2021-01-19T12:00:35.000Z | 2021-01-19T12:00:35.000Z | -- Motherlode
-- Copyright (c) 2020 Fabien Chouteau
package World is
Ground_Width : constant := 30;
Ground_Depth : constant := 600;
type Cell_Kind is (Empty, Dirt, Rock, Coal, Iron, Gold, Diamond)
with Size => 4;
subtype Valuable_Cell is Cell_Kind range Coal .. Diamond;
Cell_Size : constant := 16;
type Ground_Type is array (0 .. (Ground_Depth * Ground_Width) - 1) of Cell_Kind
with Component_Size => Cell_Kind'Size,
Size => Ground_Depth * Ground_Width * Cell_Kind'Size;
Ground : Ground_Type := (others => Empty);
function Get_Cell (CX, CY : Natural) return Cell_Kind;
pragma Inline (Get_Cell);
procedure Generate_Ground;
function Collides (X, Y : Integer) return Boolean;
end World;
| 24.866667 | 82 | 0.683646 |
0eff3a27608f1a5b48cb56741c3fdb663b99a20d | 33,143 | ads | Ada | arch/ARM/Nordic/svd/nrf52/nrf_svd-twis.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 192 | 2016-06-01T18:32:04.000Z | 2022-03-26T22:52:31.000Z | arch/ARM/Nordic/svd/nrf52/nrf_svd-twis.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 239 | 2016-05-26T20:02:01.000Z | 2022-03-31T09:46:56.000Z | arch/ARM/Nordic/svd/nrf52/nrf_svd-twis.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | -- Copyright (c) 2010 - 2018, Nordic Semiconductor ASA
--
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without modification,
-- are permitted provided that the following conditions are met:
--
-- 1. Redistributions of source code must retain the above copyright notice, this
-- list of conditions and the following disclaimer.
--
-- 2. Redistributions in binary form, except as embedded into a Nordic
-- Semiconductor ASA integrated circuit in a product or a software update for
-- such product, 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 Nordic Semiconductor ASA nor the names of its
-- contributors may be used to endorse or promote products derived from this
-- software without specific prior written permission.
--
-- 4. This software, with or without modification, must only be used with a
-- Nordic Semiconductor ASA integrated circuit.
--
-- 5. Any software provided in binary form under this license must not be reverse
-- engineered, decompiled, modified and/or disassembled.
--
-- THIS SOFTWARE IS PROVIDED BY NORDIC SEMICONDUCTOR ASA "AS IS" AND ANY EXPRESS
-- OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
-- OF MERCHANTABILITY, NONINFRINGEMENT, AND FITNESS FOR A PARTICULAR PURPOSE ARE
-- DISCLAIMED. IN NO EVENT SHALL NORDIC SEMICONDUCTOR ASA OR CONTRIBUTORS BE
-- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
-- GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
-- HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
-- LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
-- OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
--
-- This spec has been automatically generated from nrf52.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package NRF_SVD.TWIS is
pragma Preelaborate;
---------------
-- Registers --
---------------
-- Shortcut between WRITE event and SUSPEND task
type SHORTS_WRITE_SUSPEND_Field is
(-- Disable shortcut
Disabled,
-- Enable shortcut
Enabled)
with Size => 1;
for SHORTS_WRITE_SUSPEND_Field use
(Disabled => 0,
Enabled => 1);
-- Shortcut between READ event and SUSPEND task
type SHORTS_READ_SUSPEND_Field is
(-- Disable shortcut
Disabled,
-- Enable shortcut
Enabled)
with Size => 1;
for SHORTS_READ_SUSPEND_Field use
(Disabled => 0,
Enabled => 1);
-- Shortcut register
type SHORTS_Register is record
-- unspecified
Reserved_0_12 : HAL.UInt13 := 16#0#;
-- Shortcut between WRITE event and SUSPEND task
WRITE_SUSPEND : SHORTS_WRITE_SUSPEND_Field := NRF_SVD.TWIS.Disabled;
-- Shortcut between READ event and SUSPEND task
READ_SUSPEND : SHORTS_READ_SUSPEND_Field := NRF_SVD.TWIS.Disabled;
-- unspecified
Reserved_15_31 : HAL.UInt17 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SHORTS_Register use record
Reserved_0_12 at 0 range 0 .. 12;
WRITE_SUSPEND at 0 range 13 .. 13;
READ_SUSPEND at 0 range 14 .. 14;
Reserved_15_31 at 0 range 15 .. 31;
end record;
-- Enable or disable interrupt for STOPPED event
type INTEN_STOPPED_Field is
(-- Disable
Disabled,
-- Enable
Enabled)
with Size => 1;
for INTEN_STOPPED_Field use
(Disabled => 0,
Enabled => 1);
-- Enable or disable interrupt for ERROR event
type INTEN_ERROR_Field is
(-- Disable
Disabled,
-- Enable
Enabled)
with Size => 1;
for INTEN_ERROR_Field use
(Disabled => 0,
Enabled => 1);
-- Enable or disable interrupt for RXSTARTED event
type INTEN_RXSTARTED_Field is
(-- Disable
Disabled,
-- Enable
Enabled)
with Size => 1;
for INTEN_RXSTARTED_Field use
(Disabled => 0,
Enabled => 1);
-- Enable or disable interrupt for TXSTARTED event
type INTEN_TXSTARTED_Field is
(-- Disable
Disabled,
-- Enable
Enabled)
with Size => 1;
for INTEN_TXSTARTED_Field use
(Disabled => 0,
Enabled => 1);
-- Enable or disable interrupt for WRITE event
type INTEN_WRITE_Field is
(-- Disable
Disabled,
-- Enable
Enabled)
with Size => 1;
for INTEN_WRITE_Field use
(Disabled => 0,
Enabled => 1);
-- Enable or disable interrupt for READ event
type INTEN_READ_Field is
(-- Disable
Disabled,
-- Enable
Enabled)
with Size => 1;
for INTEN_READ_Field use
(Disabled => 0,
Enabled => 1);
-- Enable or disable interrupt
type INTEN_Register is record
-- unspecified
Reserved_0_0 : HAL.Bit := 16#0#;
-- Enable or disable interrupt for STOPPED event
STOPPED : INTEN_STOPPED_Field := NRF_SVD.TWIS.Disabled;
-- unspecified
Reserved_2_8 : HAL.UInt7 := 16#0#;
-- Enable or disable interrupt for ERROR event
ERROR : INTEN_ERROR_Field := NRF_SVD.TWIS.Disabled;
-- unspecified
Reserved_10_18 : HAL.UInt9 := 16#0#;
-- Enable or disable interrupt for RXSTARTED event
RXSTARTED : INTEN_RXSTARTED_Field := NRF_SVD.TWIS.Disabled;
-- Enable or disable interrupt for TXSTARTED event
TXSTARTED : INTEN_TXSTARTED_Field := NRF_SVD.TWIS.Disabled;
-- unspecified
Reserved_21_24 : HAL.UInt4 := 16#0#;
-- Enable or disable interrupt for WRITE event
WRITE : INTEN_WRITE_Field := NRF_SVD.TWIS.Disabled;
-- Enable or disable interrupt for READ event
READ : INTEN_READ_Field := NRF_SVD.TWIS.Disabled;
-- unspecified
Reserved_27_31 : HAL.UInt5 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for INTEN_Register use record
Reserved_0_0 at 0 range 0 .. 0;
STOPPED at 0 range 1 .. 1;
Reserved_2_8 at 0 range 2 .. 8;
ERROR at 0 range 9 .. 9;
Reserved_10_18 at 0 range 10 .. 18;
RXSTARTED at 0 range 19 .. 19;
TXSTARTED at 0 range 20 .. 20;
Reserved_21_24 at 0 range 21 .. 24;
WRITE at 0 range 25 .. 25;
READ at 0 range 26 .. 26;
Reserved_27_31 at 0 range 27 .. 31;
end record;
-- Write '1' to Enable interrupt for STOPPED event
type INTENSET_STOPPED_Field is
(-- Read: Disabled
Disabled,
-- Read: Enabled
Enabled)
with Size => 1;
for INTENSET_STOPPED_Field use
(Disabled => 0,
Enabled => 1);
-- Write '1' to Enable interrupt for STOPPED event
type INTENSET_STOPPED_Field_1 is
(-- Reset value for the field
Intenset_Stopped_Field_Reset,
-- Enable
Set)
with Size => 1;
for INTENSET_STOPPED_Field_1 use
(Intenset_Stopped_Field_Reset => 0,
Set => 1);
-- Write '1' to Enable interrupt for ERROR event
type INTENSET_ERROR_Field is
(-- Read: Disabled
Disabled,
-- Read: Enabled
Enabled)
with Size => 1;
for INTENSET_ERROR_Field use
(Disabled => 0,
Enabled => 1);
-- Write '1' to Enable interrupt for ERROR event
type INTENSET_ERROR_Field_1 is
(-- Reset value for the field
Intenset_Error_Field_Reset,
-- Enable
Set)
with Size => 1;
for INTENSET_ERROR_Field_1 use
(Intenset_Error_Field_Reset => 0,
Set => 1);
-- Write '1' to Enable interrupt for RXSTARTED event
type INTENSET_RXSTARTED_Field is
(-- Read: Disabled
Disabled,
-- Read: Enabled
Enabled)
with Size => 1;
for INTENSET_RXSTARTED_Field use
(Disabled => 0,
Enabled => 1);
-- Write '1' to Enable interrupt for RXSTARTED event
type INTENSET_RXSTARTED_Field_1 is
(-- Reset value for the field
Intenset_Rxstarted_Field_Reset,
-- Enable
Set)
with Size => 1;
for INTENSET_RXSTARTED_Field_1 use
(Intenset_Rxstarted_Field_Reset => 0,
Set => 1);
-- Write '1' to Enable interrupt for TXSTARTED event
type INTENSET_TXSTARTED_Field is
(-- Read: Disabled
Disabled,
-- Read: Enabled
Enabled)
with Size => 1;
for INTENSET_TXSTARTED_Field use
(Disabled => 0,
Enabled => 1);
-- Write '1' to Enable interrupt for TXSTARTED event
type INTENSET_TXSTARTED_Field_1 is
(-- Reset value for the field
Intenset_Txstarted_Field_Reset,
-- Enable
Set)
with Size => 1;
for INTENSET_TXSTARTED_Field_1 use
(Intenset_Txstarted_Field_Reset => 0,
Set => 1);
-- Write '1' to Enable interrupt for WRITE event
type INTENSET_WRITE_Field is
(-- Read: Disabled
Disabled,
-- Read: Enabled
Enabled)
with Size => 1;
for INTENSET_WRITE_Field use
(Disabled => 0,
Enabled => 1);
-- Write '1' to Enable interrupt for WRITE event
type INTENSET_WRITE_Field_1 is
(-- Reset value for the field
Intenset_Write_Field_Reset,
-- Enable
Set)
with Size => 1;
for INTENSET_WRITE_Field_1 use
(Intenset_Write_Field_Reset => 0,
Set => 1);
-- Write '1' to Enable interrupt for READ event
type INTENSET_READ_Field is
(-- Read: Disabled
Disabled,
-- Read: Enabled
Enabled)
with Size => 1;
for INTENSET_READ_Field use
(Disabled => 0,
Enabled => 1);
-- Write '1' to Enable interrupt for READ event
type INTENSET_READ_Field_1 is
(-- Reset value for the field
Intenset_Read_Field_Reset,
-- Enable
Set)
with Size => 1;
for INTENSET_READ_Field_1 use
(Intenset_Read_Field_Reset => 0,
Set => 1);
-- Enable interrupt
type INTENSET_Register is record
-- unspecified
Reserved_0_0 : HAL.Bit := 16#0#;
-- Write '1' to Enable interrupt for STOPPED event
STOPPED : INTENSET_STOPPED_Field_1 :=
Intenset_Stopped_Field_Reset;
-- unspecified
Reserved_2_8 : HAL.UInt7 := 16#0#;
-- Write '1' to Enable interrupt for ERROR event
ERROR : INTENSET_ERROR_Field_1 := Intenset_Error_Field_Reset;
-- unspecified
Reserved_10_18 : HAL.UInt9 := 16#0#;
-- Write '1' to Enable interrupt for RXSTARTED event
RXSTARTED : INTENSET_RXSTARTED_Field_1 :=
Intenset_Rxstarted_Field_Reset;
-- Write '1' to Enable interrupt for TXSTARTED event
TXSTARTED : INTENSET_TXSTARTED_Field_1 :=
Intenset_Txstarted_Field_Reset;
-- unspecified
Reserved_21_24 : HAL.UInt4 := 16#0#;
-- Write '1' to Enable interrupt for WRITE event
WRITE : INTENSET_WRITE_Field_1 := Intenset_Write_Field_Reset;
-- Write '1' to Enable interrupt for READ event
READ : INTENSET_READ_Field_1 := Intenset_Read_Field_Reset;
-- unspecified
Reserved_27_31 : HAL.UInt5 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for INTENSET_Register use record
Reserved_0_0 at 0 range 0 .. 0;
STOPPED at 0 range 1 .. 1;
Reserved_2_8 at 0 range 2 .. 8;
ERROR at 0 range 9 .. 9;
Reserved_10_18 at 0 range 10 .. 18;
RXSTARTED at 0 range 19 .. 19;
TXSTARTED at 0 range 20 .. 20;
Reserved_21_24 at 0 range 21 .. 24;
WRITE at 0 range 25 .. 25;
READ at 0 range 26 .. 26;
Reserved_27_31 at 0 range 27 .. 31;
end record;
-- Write '1' to Disable interrupt for STOPPED event
type INTENCLR_STOPPED_Field is
(-- Read: Disabled
Disabled,
-- Read: Enabled
Enabled)
with Size => 1;
for INTENCLR_STOPPED_Field use
(Disabled => 0,
Enabled => 1);
-- Write '1' to Disable interrupt for STOPPED event
type INTENCLR_STOPPED_Field_1 is
(-- Reset value for the field
Intenclr_Stopped_Field_Reset,
-- Disable
Clear)
with Size => 1;
for INTENCLR_STOPPED_Field_1 use
(Intenclr_Stopped_Field_Reset => 0,
Clear => 1);
-- Write '1' to Disable interrupt for ERROR event
type INTENCLR_ERROR_Field is
(-- Read: Disabled
Disabled,
-- Read: Enabled
Enabled)
with Size => 1;
for INTENCLR_ERROR_Field use
(Disabled => 0,
Enabled => 1);
-- Write '1' to Disable interrupt for ERROR event
type INTENCLR_ERROR_Field_1 is
(-- Reset value for the field
Intenclr_Error_Field_Reset,
-- Disable
Clear)
with Size => 1;
for INTENCLR_ERROR_Field_1 use
(Intenclr_Error_Field_Reset => 0,
Clear => 1);
-- Write '1' to Disable interrupt for RXSTARTED event
type INTENCLR_RXSTARTED_Field is
(-- Read: Disabled
Disabled,
-- Read: Enabled
Enabled)
with Size => 1;
for INTENCLR_RXSTARTED_Field use
(Disabled => 0,
Enabled => 1);
-- Write '1' to Disable interrupt for RXSTARTED event
type INTENCLR_RXSTARTED_Field_1 is
(-- Reset value for the field
Intenclr_Rxstarted_Field_Reset,
-- Disable
Clear)
with Size => 1;
for INTENCLR_RXSTARTED_Field_1 use
(Intenclr_Rxstarted_Field_Reset => 0,
Clear => 1);
-- Write '1' to Disable interrupt for TXSTARTED event
type INTENCLR_TXSTARTED_Field is
(-- Read: Disabled
Disabled,
-- Read: Enabled
Enabled)
with Size => 1;
for INTENCLR_TXSTARTED_Field use
(Disabled => 0,
Enabled => 1);
-- Write '1' to Disable interrupt for TXSTARTED event
type INTENCLR_TXSTARTED_Field_1 is
(-- Reset value for the field
Intenclr_Txstarted_Field_Reset,
-- Disable
Clear)
with Size => 1;
for INTENCLR_TXSTARTED_Field_1 use
(Intenclr_Txstarted_Field_Reset => 0,
Clear => 1);
-- Write '1' to Disable interrupt for WRITE event
type INTENCLR_WRITE_Field is
(-- Read: Disabled
Disabled,
-- Read: Enabled
Enabled)
with Size => 1;
for INTENCLR_WRITE_Field use
(Disabled => 0,
Enabled => 1);
-- Write '1' to Disable interrupt for WRITE event
type INTENCLR_WRITE_Field_1 is
(-- Reset value for the field
Intenclr_Write_Field_Reset,
-- Disable
Clear)
with Size => 1;
for INTENCLR_WRITE_Field_1 use
(Intenclr_Write_Field_Reset => 0,
Clear => 1);
-- Write '1' to Disable interrupt for READ event
type INTENCLR_READ_Field is
(-- Read: Disabled
Disabled,
-- Read: Enabled
Enabled)
with Size => 1;
for INTENCLR_READ_Field use
(Disabled => 0,
Enabled => 1);
-- Write '1' to Disable interrupt for READ event
type INTENCLR_READ_Field_1 is
(-- Reset value for the field
Intenclr_Read_Field_Reset,
-- Disable
Clear)
with Size => 1;
for INTENCLR_READ_Field_1 use
(Intenclr_Read_Field_Reset => 0,
Clear => 1);
-- Disable interrupt
type INTENCLR_Register is record
-- unspecified
Reserved_0_0 : HAL.Bit := 16#0#;
-- Write '1' to Disable interrupt for STOPPED event
STOPPED : INTENCLR_STOPPED_Field_1 :=
Intenclr_Stopped_Field_Reset;
-- unspecified
Reserved_2_8 : HAL.UInt7 := 16#0#;
-- Write '1' to Disable interrupt for ERROR event
ERROR : INTENCLR_ERROR_Field_1 := Intenclr_Error_Field_Reset;
-- unspecified
Reserved_10_18 : HAL.UInt9 := 16#0#;
-- Write '1' to Disable interrupt for RXSTARTED event
RXSTARTED : INTENCLR_RXSTARTED_Field_1 :=
Intenclr_Rxstarted_Field_Reset;
-- Write '1' to Disable interrupt for TXSTARTED event
TXSTARTED : INTENCLR_TXSTARTED_Field_1 :=
Intenclr_Txstarted_Field_Reset;
-- unspecified
Reserved_21_24 : HAL.UInt4 := 16#0#;
-- Write '1' to Disable interrupt for WRITE event
WRITE : INTENCLR_WRITE_Field_1 := Intenclr_Write_Field_Reset;
-- Write '1' to Disable interrupt for READ event
READ : INTENCLR_READ_Field_1 := Intenclr_Read_Field_Reset;
-- unspecified
Reserved_27_31 : HAL.UInt5 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for INTENCLR_Register use record
Reserved_0_0 at 0 range 0 .. 0;
STOPPED at 0 range 1 .. 1;
Reserved_2_8 at 0 range 2 .. 8;
ERROR at 0 range 9 .. 9;
Reserved_10_18 at 0 range 10 .. 18;
RXSTARTED at 0 range 19 .. 19;
TXSTARTED at 0 range 20 .. 20;
Reserved_21_24 at 0 range 21 .. 24;
WRITE at 0 range 25 .. 25;
READ at 0 range 26 .. 26;
Reserved_27_31 at 0 range 27 .. 31;
end record;
-- RX buffer overflow detected, and prevented
type ERRORSRC_OVERFLOW_Field is
(-- Error did not occur
Notdetected,
-- Error occurred
Detected)
with Size => 1;
for ERRORSRC_OVERFLOW_Field use
(Notdetected => 0,
Detected => 1);
-- NACK sent after receiving a data byte
type ERRORSRC_DNACK_Field is
(-- Error did not occur
Notreceived,
-- Error occurred
Received)
with Size => 1;
for ERRORSRC_DNACK_Field use
(Notreceived => 0,
Received => 1);
-- TX buffer over-read detected, and prevented
type ERRORSRC_OVERREAD_Field is
(-- Error did not occur
Notdetected,
-- Error occurred
Detected)
with Size => 1;
for ERRORSRC_OVERREAD_Field use
(Notdetected => 0,
Detected => 1);
-- Error source
type ERRORSRC_Register is record
-- RX buffer overflow detected, and prevented
OVERFLOW : ERRORSRC_OVERFLOW_Field := NRF_SVD.TWIS.Notdetected;
-- unspecified
Reserved_1_1 : HAL.Bit := 16#0#;
-- NACK sent after receiving a data byte
DNACK : ERRORSRC_DNACK_Field := NRF_SVD.TWIS.Notreceived;
-- TX buffer over-read detected, and prevented
OVERREAD : ERRORSRC_OVERREAD_Field := NRF_SVD.TWIS.Notdetected;
-- unspecified
Reserved_4_31 : HAL.UInt28 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ERRORSRC_Register use record
OVERFLOW at 0 range 0 .. 0;
Reserved_1_1 at 0 range 1 .. 1;
DNACK at 0 range 2 .. 2;
OVERREAD at 0 range 3 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
-- Status register indicating which address had a match
type MATCH_Register is record
-- Read-only. Which of the addresses in {ADDRESS} matched the incoming
-- address
MATCH : Boolean;
-- unspecified
Reserved_1_31 : HAL.UInt31;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for MATCH_Register use record
MATCH at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
-- Enable or disable TWIS
type ENABLE_ENABLE_Field is
(-- Disable TWIS
Disabled,
-- Enable TWIS
Enabled)
with Size => 4;
for ENABLE_ENABLE_Field use
(Disabled => 0,
Enabled => 9);
-- Enable TWIS
type ENABLE_Register is record
-- Enable or disable TWIS
ENABLE : ENABLE_ENABLE_Field := NRF_SVD.TWIS.Disabled;
-- unspecified
Reserved_4_31 : HAL.UInt28 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ENABLE_Register use record
ENABLE at 0 range 0 .. 3;
Reserved_4_31 at 0 range 4 .. 31;
end record;
-----------------------------------
-- TWIS_PSEL cluster's Registers --
-----------------------------------
subtype SCL_PSEL_PIN_Field is HAL.UInt5;
-- Connection
type SCL_CONNECT_Field is
(-- Connect
Connected,
-- Disconnect
Disconnected)
with Size => 1;
for SCL_CONNECT_Field use
(Connected => 0,
Disconnected => 1);
-- Pin select for SCL signal
type SCL_PSEL_Register is record
-- Pin number
PIN : SCL_PSEL_PIN_Field := 16#1F#;
-- unspecified
Reserved_5_30 : HAL.UInt26 := 16#3FFFFFF#;
-- Connection
CONNECT : SCL_CONNECT_Field := NRF_SVD.TWIS.Disconnected;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SCL_PSEL_Register use record
PIN at 0 range 0 .. 4;
Reserved_5_30 at 0 range 5 .. 30;
CONNECT at 0 range 31 .. 31;
end record;
subtype SDA_PSEL_PIN_Field is HAL.UInt5;
-- Connection
type SDA_CONNECT_Field is
(-- Connect
Connected,
-- Disconnect
Disconnected)
with Size => 1;
for SDA_CONNECT_Field use
(Connected => 0,
Disconnected => 1);
-- Pin select for SDA signal
type SDA_PSEL_Register is record
-- Pin number
PIN : SDA_PSEL_PIN_Field := 16#1F#;
-- unspecified
Reserved_5_30 : HAL.UInt26 := 16#3FFFFFF#;
-- Connection
CONNECT : SDA_CONNECT_Field := NRF_SVD.TWIS.Disconnected;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for SDA_PSEL_Register use record
PIN at 0 range 0 .. 4;
Reserved_5_30 at 0 range 5 .. 30;
CONNECT at 0 range 31 .. 31;
end record;
-- Unspecified
type TWIS_PSEL_Cluster is record
-- Pin select for SCL signal
SCL : aliased SCL_PSEL_Register;
-- Pin select for SDA signal
SDA : aliased SDA_PSEL_Register;
end record
with Size => 64;
for TWIS_PSEL_Cluster use record
SCL at 16#0# range 0 .. 31;
SDA at 16#4# range 0 .. 31;
end record;
----------------------------------
-- TWIS_RXD cluster's Registers --
----------------------------------
subtype MAXCNT_RXD_MAXCNT_Field is HAL.UInt8;
-- Maximum number of bytes in RXD buffer
type MAXCNT_RXD_Register is record
-- Maximum number of bytes in RXD buffer
MAXCNT : MAXCNT_RXD_MAXCNT_Field := 16#0#;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for MAXCNT_RXD_Register use record
MAXCNT at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype AMOUNT_RXD_AMOUNT_Field is HAL.UInt8;
-- Number of bytes transferred in the last RXD transaction
type AMOUNT_RXD_Register is record
-- Read-only. Number of bytes transferred in the last RXD transaction
AMOUNT : AMOUNT_RXD_AMOUNT_Field;
-- unspecified
Reserved_8_31 : HAL.UInt24;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for AMOUNT_RXD_Register use record
AMOUNT at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- RXD EasyDMA channel
type TWIS_RXD_Cluster is record
-- RXD Data pointer
PTR : aliased HAL.UInt32;
-- Maximum number of bytes in RXD buffer
MAXCNT : aliased MAXCNT_RXD_Register;
-- Number of bytes transferred in the last RXD transaction
AMOUNT : aliased AMOUNT_RXD_Register;
end record
with Size => 96;
for TWIS_RXD_Cluster use record
PTR at 16#0# range 0 .. 31;
MAXCNT at 16#4# range 0 .. 31;
AMOUNT at 16#8# range 0 .. 31;
end record;
----------------------------------
-- TWIS_TXD cluster's Registers --
----------------------------------
subtype MAXCNT_TXD_MAXCNT_Field is HAL.UInt8;
-- Maximum number of bytes in TXD buffer
type MAXCNT_TXD_Register is record
-- Maximum number of bytes in TXD buffer
MAXCNT : MAXCNT_TXD_MAXCNT_Field := 16#0#;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for MAXCNT_TXD_Register use record
MAXCNT at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype AMOUNT_TXD_AMOUNT_Field is HAL.UInt8;
-- Number of bytes transferred in the last TXD transaction
type AMOUNT_TXD_Register is record
-- Read-only. Number of bytes transferred in the last TXD transaction
AMOUNT : AMOUNT_TXD_AMOUNT_Field;
-- unspecified
Reserved_8_31 : HAL.UInt24;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for AMOUNT_TXD_Register use record
AMOUNT at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- TXD EasyDMA channel
type TWIS_TXD_Cluster is record
-- TXD Data pointer
PTR : aliased HAL.UInt32;
-- Maximum number of bytes in TXD buffer
MAXCNT : aliased MAXCNT_TXD_Register;
-- Number of bytes transferred in the last TXD transaction
AMOUNT : aliased AMOUNT_TXD_Register;
end record
with Size => 96;
for TWIS_TXD_Cluster use record
PTR at 16#0# range 0 .. 31;
MAXCNT at 16#4# range 0 .. 31;
AMOUNT at 16#8# range 0 .. 31;
end record;
subtype ADDRESS_ADDRESS_Field is HAL.UInt7;
-- Description collection[0]: TWI slave address 0
type ADDRESS_Register is record
-- TWI slave address
ADDRESS : ADDRESS_ADDRESS_Field := 16#0#;
-- unspecified
Reserved_7_31 : HAL.UInt25 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ADDRESS_Register use record
ADDRESS at 0 range 0 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
-- Description collection[0]: TWI slave address 0
type ADDRESS_Registers is array (0 .. 1) of ADDRESS_Register;
-- Enable or disable address matching on ADDRESS[0]
type CONFIG_ADDRESS0_Field is
(-- Disabled
Disabled,
-- Enabled
Enabled)
with Size => 1;
for CONFIG_ADDRESS0_Field use
(Disabled => 0,
Enabled => 1);
-- CONFIG_ADDRESS array
type CONFIG_ADDRESS_Field_Array is array (0 .. 1) of CONFIG_ADDRESS0_Field
with Component_Size => 1, Size => 2;
-- Type definition for CONFIG_ADDRESS
type CONFIG_ADDRESS_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- ADDRESS as a value
Val : HAL.UInt2;
when True =>
-- ADDRESS as an array
Arr : CONFIG_ADDRESS_Field_Array;
end case;
end record
with Unchecked_Union, Size => 2;
for CONFIG_ADDRESS_Field use record
Val at 0 range 0 .. 1;
Arr at 0 range 0 .. 1;
end record;
-- Configuration register for the address match mechanism
type CONFIG_Register is record
-- Enable or disable address matching on ADDRESS[0]
ADDRESS : CONFIG_ADDRESS_Field :=
(As_Array => False, Val => 16#1#);
-- unspecified
Reserved_2_31 : HAL.UInt30 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CONFIG_Register use record
ADDRESS at 0 range 0 .. 1;
Reserved_2_31 at 0 range 2 .. 31;
end record;
subtype ORC_ORC_Field is HAL.UInt8;
-- Over-read character. Character sent out in case of an over-read of the
-- transmit buffer.
type ORC_Register is record
-- Over-read character. Character sent out in case of an over-read of
-- the transmit buffer.
ORC : ORC_ORC_Field := 16#0#;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ORC_Register use record
ORC at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-----------------------------------
-- TWIS_PSEL cluster's Registers --
-----------------------------------
----------------------------------
-- TWIS_RXD cluster's Registers --
----------------------------------
----------------------------------
-- TWIS_TXD cluster's Registers --
----------------------------------
-----------------
-- Peripherals --
-----------------
-- I2C compatible Two-Wire Slave Interface with EasyDMA 0
type TWIS_Peripheral is record
-- Stop TWI transaction
TASKS_STOP : aliased HAL.UInt32;
-- Suspend TWI transaction
TASKS_SUSPEND : aliased HAL.UInt32;
-- Resume TWI transaction
TASKS_RESUME : aliased HAL.UInt32;
-- Prepare the TWI slave to respond to a write command
TASKS_PREPARERX : aliased HAL.UInt32;
-- Prepare the TWI slave to respond to a read command
TASKS_PREPARETX : aliased HAL.UInt32;
-- TWI stopped
EVENTS_STOPPED : aliased HAL.UInt32;
-- TWI error
EVENTS_ERROR : aliased HAL.UInt32;
-- Receive sequence started
EVENTS_RXSTARTED : aliased HAL.UInt32;
-- Transmit sequence started
EVENTS_TXSTARTED : aliased HAL.UInt32;
-- Write command received
EVENTS_WRITE : aliased HAL.UInt32;
-- Read command received
EVENTS_READ : aliased HAL.UInt32;
-- Shortcut register
SHORTS : aliased SHORTS_Register;
-- Enable or disable interrupt
INTEN : aliased INTEN_Register;
-- Enable interrupt
INTENSET : aliased INTENSET_Register;
-- Disable interrupt
INTENCLR : aliased INTENCLR_Register;
-- Error source
ERRORSRC : aliased ERRORSRC_Register;
-- Status register indicating which address had a match
MATCH : aliased MATCH_Register;
-- Enable TWIS
ENABLE : aliased ENABLE_Register;
-- Unspecified
PSEL : aliased TWIS_PSEL_Cluster;
-- RXD EasyDMA channel
RXD : aliased TWIS_RXD_Cluster;
-- TXD EasyDMA channel
TXD : aliased TWIS_TXD_Cluster;
-- Description collection[0]: TWI slave address 0
ADDRESS : aliased ADDRESS_Registers;
-- Configuration register for the address match mechanism
CONFIG : aliased CONFIG_Register;
-- Over-read character. Character sent out in case of an over-read of
-- the transmit buffer.
ORC : aliased ORC_Register;
end record
with Volatile;
for TWIS_Peripheral use record
TASKS_STOP at 16#14# range 0 .. 31;
TASKS_SUSPEND at 16#1C# range 0 .. 31;
TASKS_RESUME at 16#20# range 0 .. 31;
TASKS_PREPARERX at 16#30# range 0 .. 31;
TASKS_PREPARETX at 16#34# range 0 .. 31;
EVENTS_STOPPED at 16#104# range 0 .. 31;
EVENTS_ERROR at 16#124# range 0 .. 31;
EVENTS_RXSTARTED at 16#14C# range 0 .. 31;
EVENTS_TXSTARTED at 16#150# range 0 .. 31;
EVENTS_WRITE at 16#164# range 0 .. 31;
EVENTS_READ at 16#168# range 0 .. 31;
SHORTS at 16#200# range 0 .. 31;
INTEN at 16#300# range 0 .. 31;
INTENSET at 16#304# range 0 .. 31;
INTENCLR at 16#308# range 0 .. 31;
ERRORSRC at 16#4D0# range 0 .. 31;
MATCH at 16#4D4# range 0 .. 31;
ENABLE at 16#500# range 0 .. 31;
PSEL at 16#508# range 0 .. 63;
RXD at 16#534# range 0 .. 95;
TXD at 16#544# range 0 .. 95;
ADDRESS at 16#588# range 0 .. 63;
CONFIG at 16#594# range 0 .. 31;
ORC at 16#5C0# range 0 .. 31;
end record;
-- I2C compatible Two-Wire Slave Interface with EasyDMA 0
TWIS0_Periph : aliased TWIS_Peripheral
with Import, Address => TWIS0_Base;
-- I2C compatible Two-Wire Slave Interface with EasyDMA 1
TWIS1_Periph : aliased TWIS_Peripheral
with Import, Address => TWIS1_Base;
end NRF_SVD.TWIS;
| 31.715789 | 84 | 0.613976 |
414591b9b6fbb91e3e83f65dc22ac94ab0775286 | 1,295 | ads | Ada | tools/hmac-sha1.ads | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | tools/hmac-sha1.ads | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | tools/hmac-sha1.ads | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | ------------------------------------------------------------------------------
-- Copyright (c) 2014, Natacha Porté --
-- --
-- Permission to use, copy, modify, and distribute this software for any --
-- purpose with or without fee is hereby granted, provided that the above --
-- copyright notice and this permission notice appear in all copies. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES --
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF --
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR --
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES --
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN --
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF --
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE. --
------------------------------------------------------------------------------
with HMAC.Main;
with Natools.GNAT_HMAC.SHA1;
procedure HMAC.SHA1 is new HMAC.Main (Natools.GNAT_HMAC.SHA1);
| 61.666667 | 78 | 0.523552 |
591a675585db82eaf490afbd31a38a6131f9c9f6 | 10,521 | adb | Ada | src/libtcod-console.adb | csb6/libtcod-ada | 89c2a75eb357a8468ccb0a6476391a6b388f00b4 | [
"BSD-3-Clause"
] | null | null | null | src/libtcod-console.adb | csb6/libtcod-ada | 89c2a75eb357a8468ccb0a6476391a6b388f00b4 | [
"BSD-3-Clause"
] | null | null | null | src/libtcod-console.adb | csb6/libtcod-ada | 89c2a75eb357a8468ccb0a6476391a6b388f00b4 | [
"BSD-3-Clause"
] | null | null | null | with Ada.Unchecked_Conversion, Interfaces.C.Strings, Interfaces.C.Extensions;
with Libtcod.Color.Conversions;
with error_h, context_init_h, console_init_h, console_printing_h, console_drawing_h;
package body Libtcod.Console is
use Interfaces.C, Interfaces.C.Extensions, Libtcod.Color.Conversions;
use context_h, context_init_h, console_h, console_init_h, console_printing_h,
console_drawing_h;
function Background_Mode_To_Bgflag is new Ada.Unchecked_Conversion
(Source => Background_Mode, Target => TCOD_bkgnd_flag_t);
function Bgflag_to_Background_Mode is new Ada.Unchecked_Conversion
(Source => TCOD_bkgnd_flag_t, Target => Background_Mode);
function To_TCOD_Alignment is new Ada.Unchecked_Conversion
(Source => Alignment_Type, Target => TCOD_alignment_t);
function To_Alignment_Type is new Ada.Unchecked_Conversion
(Source => TCOD_alignment_t, Target => Alignment_Type);
subtype Limited_Controlled is Ada.Finalization.Limited_Controlled;
SDL_Window_Resizable : constant := 16#00000020#;
SDL_Window_Fullscreen : constant := 16#00000001#;
------------------
-- make_context --
------------------
function make_context(w : Width; h : Height; title : String;
resizable : Boolean := True; fullscreen : Boolean := False;
renderer : Renderer_Type := Renderer_SDL2) return Context is
c_title : aliased char_array := To_C(title);
err : error_h.TCOD_Error;
params : aliased TCOD_ContextParams := (columns => int(w), rows => int(h),
renderer_type => Renderer_Type'Pos(renderer),
window_title =>
Strings.To_Chars_Ptr(c_title'Unchecked_Access),
vsync => 1, pixel_width => 0,
pixel_height => 0, argc => 0,
others => <>);
sdl_flags : unsigned := 0;
begin
return result : Context do
if resizable then
sdl_flags := sdl_flags or SDL_Window_Resizable;
end if;
if fullscreen then
sdl_flags := sdl_flags or SDL_Window_Fullscreen;
end if;
params.sdl_window_flags := int(sdl_flags);
err := TCOD_context_new(params'Access, result.data'Address);
if err /= error_h.TCOD_E_OK then
raise Error with Strings.Value(error_h.TCOD_get_error);
end if;
end return;
end make_context;
-----------------
-- make_screen --
-----------------
function make_screen(w : Width; h : Height) return Screen is
begin
return result : Screen :=
Screen'(Limited_Controlled with TCOD_console_new(int(w), int(h))) do
if result.data = null then
raise Program_Error with "TCOD console allocation failed";
end if;
end return;
end make_screen;
--------------
-- Finalize --
--------------
overriding procedure Finalize(self : in out Context) is
begin
TCOD_context_delete(self.data);
end Finalize;
overriding procedure Finalize(self : in out Screen) is
begin
TCOD_console_delete(self.data);
end Finalize;
procedure set_title(title : String) is
c_title : aliased char_array := To_C(title);
begin
TCOD_console_set_window_title(Strings.To_Chars_Ptr(c_title'Unchecked_Access));
end;
procedure set_fullscreen(val : Boolean) is
begin
TCOD_console_set_fullscreen(bool(val));
end;
function is_fullscreen return Boolean is (Boolean(TCOD_console_is_fullscreen));
----------------------
-- is_window_closed --
----------------------
function is_window_closed return Boolean is (Boolean(TCOD_console_is_window_closed));
-------------
-- present --
-------------
procedure present(cxt : in out Context'Class; s : Screen) is
err : error_h.TCOD_Error := TCOD_context_present(cxt.data, s.data, null);
begin
if err /= error_h.TCOD_E_OK then
raise Error with Strings.Value(error_h.TCOD_get_error);
end if;
end;
---------------
-- get_width --
---------------
function get_width(s : Screen) return Width is
(Width(TCOD_console_get_width(s.data)));
----------------
-- get_height --
----------------
function get_height(s : Screen) return Height is
(Height(TCOD_console_get_height(s.data)));
-------------------
-- has_key_color --
-------------------
function has_key_color(s : Screen) return Boolean is
(Boolean(s.data.all.has_key_color));
-------------------
-- set_key_color --
-------------------
procedure set_key_color(s : in out Screen; key_color : RGB_Color) is
begin
TCOD_console_set_key_color(s.data, To_TCOD_ColorRGB(key_color));
end set_key_color;
-------------------
-- get_key_color --
-------------------
function get_key_color(s : Screen) return RGB_Color is
(To_RGB_Color(s.data.all.key_color));
--------------------
-- set_default_fg --
--------------------
procedure set_default_fg(s : in out Screen; fg : RGB_Color) is
begin
TCOD_console_set_default_foreground(s.data, To_TCOD_ColorRGB(fg));
end set_default_fg;
--------------------
-- get_default_fg --
--------------------
function get_default_fg(s : Screen) return RGB_Color is
(To_RGB_Color(TCOD_console_get_default_foreground(s.data)));
--------------------
-- set_default_bg --
--------------------
procedure set_default_bg(s : in out Screen; bg : RGB_Color) is
begin
TCOD_console_set_default_background(s.data, To_TCOD_ColorRGB(bg));
end set_default_bg;
--------------------
-- get_default_bg --
--------------------
function get_default_bg(s : Screen) return RGB_Color is
(To_RGB_Color(TCOD_console_get_default_background(s.data)));
-----------
-- clear --
-----------
procedure clear(s : in out Screen) is
begin
TCOD_console_clear(s.data);
end clear;
------------
-- resize --
------------
procedure resize(s : in out Screen; w : Width; h : Height) is
begin
TCOD_console_resize_u(s.data, int(w), int(h));
end resize;
----------
-- blit --
----------
procedure blit(s : Screen; src_x : X_Pos; src_y : Y_Pos;
w : Width; h : Height; dest : in out Screen;
dest_x : X_Pos; dest_y : Y_Pos) is
begin
TCOD_console_blit(s.data, int(src_x), int(src_y), int(w), int(h),
dest.data, int(dest_x), int(dest_y), 1.0, 1.0);
end blit;
--------------
-- put_char --
--------------
procedure put_char(s : in out Screen; x : X_Pos; y : Y_Pos; ch : Wide_Character) is
begin
TCOD_console_set_char(s.data, int(x), int(y), Wide_Character'Pos(ch));
end put_char;
procedure put_char(s : in out Screen; x : X_Pos; y : Y_Pos; ch : Wide_Character;
mode : Background_Mode) is
begin
TCOD_console_put_char(s.data, int(x), int(y), Wide_Character'Pos(ch),
Background_Mode_To_Bgflag(mode));
end put_char;
procedure put_char(s : in out Screen; x : X_Pos; y : Y_Pos; ch : Wide_Character;
fg_color, bg_color : RGB_Color) is
begin
TCOD_console_put_char_ex(s.data, int(x), int(y), Wide_Character'Pos(ch),
To_TCOD_ColorRGB(fg_color), To_TCOD_ColorRGB(bg_color));
end put_char;
-----------
-- print --
-----------
procedure print(s : in out Screen; x : X_Pos; y : Y_Pos; text : String) is
c_str : aliased char_array := To_C(text);
begin
TCOD_console_print(s.data, int(x), int(y), Strings.To_Chars_Ptr(c_str'Unchecked_Access));
end print;
--------------
-- get_char --
--------------
function get_char(s : Screen; x : X_Pos; y : Y_Pos) return Wide_Character is
(Wide_Character'Val(TCOD_console_get_char(s.data, int(x), int(y))));
-----------------
-- set_char_fg --
-----------------
procedure set_char_fg(s : in out Screen; x : X_Pos; y : Y_Pos; color : RGB_Color) is
begin
TCOD_console_set_char_foreground(s.data, int(x), int(y), To_TCOD_ColorRGB(color));
end set_char_fg;
-----------------
-- get_char_fg --
-----------------
function get_char_fg(s : Screen; x : X_Pos; y : Y_Pos) return RGB_Color is
(To_RGB_Color(TCOD_console_get_char_foreground(s.data, int(x), int(y))));
-----------------
-- set_char_bg --
-----------------
procedure set_char_bg(s : in out Screen; x : X_Pos; y : Y_Pos; color : RGB_Color;
mode : Background_Mode := Background_Set) is
begin
TCOD_console_set_char_background(s.data, int(x), int(y), To_TCOD_ColorRGB(color),
Background_Mode_To_Bgflag(mode));
end set_char_bg;
-----------------
-- get_char_bg --
-----------------
function get_char_bg(s : Screen; x : X_Pos; y : Y_Pos) return RGB_Color is
(To_RGB_Color(TCOD_console_get_char_background(s.data, int(x), int(y))));
-----------------
-- set_bg_mode --
-----------------
procedure set_bg_mode(s : in out Screen; mode : Background_Mode) is
begin
TCOD_console_set_background_flag(s.data, Background_Mode_To_Bgflag(mode));
end set_bg_mode;
-----------------
-- get_bg_mode --
-----------------
function get_bg_mode(s : Screen) return Background_Mode is
(Bgflag_to_Background_Mode(TCOD_console_get_background_flag(s.data)));
-------------------
-- set_alignment --
-------------------
procedure set_alignment(s : in out Screen; alignment : Alignment_Type) is
begin
TCOD_console_set_alignment(s.data, To_TCOD_Alignment(alignment));
end set_alignment;
-------------------
-- get_alignment --
-------------------
function get_alignment(s : Screen) return Alignment_Type is
(To_Alignment_Type(TCOD_console_get_alignment(s.data)));
----------
-- rect --
----------
procedure rect(s : in out Screen; x : X_Pos; y : Y_Pos; w : Width; h : Height;
clear : Boolean := False; bg_flag : Background_Mode := Background_Set) is
begin
TCOD_console_rect(s.data, int(x), int(y), int(w), int(h), bool(clear),
Background_Mode_To_Bgflag(bg_flag));
end rect;
end Libtcod.Console;
| 31.40597 | 95 | 0.579318 |
3d098b3d4d08ac56e3a1104ee37d3515e554ab34 | 30,427 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/a-stwibo.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/ada/a-stwibo.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/a-stwibo.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . S T R I N G S . W I D E _ B O U N D E D --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2015, 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. --
-- --
------------------------------------------------------------------------------
with Ada.Strings.Wide_Maps;
with Ada.Strings.Wide_Superbounded;
package Ada.Strings.Wide_Bounded is
pragma Preelaborate;
generic
Max : Positive;
-- Maximum length of a Bounded_Wide_String
package Generic_Bounded_Length is
Max_Length : constant Positive := Max;
type Bounded_Wide_String is private;
pragma Preelaborable_Initialization (Bounded_Wide_String);
Null_Bounded_Wide_String : constant Bounded_Wide_String;
subtype Length_Range is Natural range 0 .. Max_Length;
function Length (Source : Bounded_Wide_String) return Length_Range;
--------------------------------------------------------
-- Conversion, Concatenation, and Selection Functions --
--------------------------------------------------------
function To_Bounded_Wide_String
(Source : Wide_String;
Drop : Truncation := Error) return Bounded_Wide_String;
function To_Wide_String
(Source : Bounded_Wide_String) return Wide_String;
procedure Set_Bounded_Wide_String
(Target : out Bounded_Wide_String;
Source : Wide_String;
Drop : Truncation := Error);
pragma Ada_05 (Set_Bounded_Wide_String);
function Append
(Left : Bounded_Wide_String;
Right : Bounded_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_String;
function Append
(Left : Bounded_Wide_String;
Right : Wide_String;
Drop : Truncation := Error) return Bounded_Wide_String;
function Append
(Left : Wide_String;
Right : Bounded_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_String;
function Append
(Left : Bounded_Wide_String;
Right : Wide_Character;
Drop : Truncation := Error) return Bounded_Wide_String;
function Append
(Left : Wide_Character;
Right : Bounded_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_String;
procedure Append
(Source : in out Bounded_Wide_String;
New_Item : Bounded_Wide_String;
Drop : Truncation := Error);
procedure Append
(Source : in out Bounded_Wide_String;
New_Item : Wide_String;
Drop : Truncation := Error);
procedure Append
(Source : in out Bounded_Wide_String;
New_Item : Wide_Character;
Drop : Truncation := Error);
function "&"
(Left : Bounded_Wide_String;
Right : Bounded_Wide_String) return Bounded_Wide_String;
function "&"
(Left : Bounded_Wide_String;
Right : Wide_String) return Bounded_Wide_String;
function "&"
(Left : Wide_String;
Right : Bounded_Wide_String) return Bounded_Wide_String;
function "&"
(Left : Bounded_Wide_String;
Right : Wide_Character) return Bounded_Wide_String;
function "&"
(Left : Wide_Character;
Right : Bounded_Wide_String) return Bounded_Wide_String;
function Element
(Source : Bounded_Wide_String;
Index : Positive) return Wide_Character;
procedure Replace_Element
(Source : in out Bounded_Wide_String;
Index : Positive;
By : Wide_Character);
function Slice
(Source : Bounded_Wide_String;
Low : Positive;
High : Natural) return Wide_String;
function Bounded_Slice
(Source : Bounded_Wide_String;
Low : Positive;
High : Natural) return Bounded_Wide_String;
pragma Ada_05 (Bounded_Slice);
procedure Bounded_Slice
(Source : Bounded_Wide_String;
Target : out Bounded_Wide_String;
Low : Positive;
High : Natural);
pragma Ada_05 (Bounded_Slice);
function "="
(Left : Bounded_Wide_String;
Right : Bounded_Wide_String) return Boolean;
function "="
(Left : Bounded_Wide_String;
Right : Wide_String) return Boolean;
function "="
(Left : Wide_String;
Right : Bounded_Wide_String) return Boolean;
function "<"
(Left : Bounded_Wide_String;
Right : Bounded_Wide_String) return Boolean;
function "<"
(Left : Bounded_Wide_String;
Right : Wide_String) return Boolean;
function "<"
(Left : Wide_String;
Right : Bounded_Wide_String) return Boolean;
function "<="
(Left : Bounded_Wide_String;
Right : Bounded_Wide_String) return Boolean;
function "<="
(Left : Bounded_Wide_String;
Right : Wide_String) return Boolean;
function "<="
(Left : Wide_String;
Right : Bounded_Wide_String) return Boolean;
function ">"
(Left : Bounded_Wide_String;
Right : Bounded_Wide_String) return Boolean;
function ">"
(Left : Bounded_Wide_String;
Right : Wide_String) return Boolean;
function ">"
(Left : Wide_String;
Right : Bounded_Wide_String) return Boolean;
function ">="
(Left : Bounded_Wide_String;
Right : Bounded_Wide_String) return Boolean;
function ">="
(Left : Bounded_Wide_String;
Right : Wide_String) return Boolean;
function ">="
(Left : Wide_String;
Right : Bounded_Wide_String) return Boolean;
----------------------
-- Search Functions --
----------------------
function Index
(Source : Bounded_Wide_String;
Pattern : Wide_String;
Going : Direction := Forward;
Mapping : Wide_Maps.Wide_Character_Mapping := Wide_Maps.Identity)
return Natural;
function Index
(Source : Bounded_Wide_String;
Pattern : Wide_String;
Going : Direction := Forward;
Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Natural;
function Index
(Source : Bounded_Wide_String;
Set : Wide_Maps.Wide_Character_Set;
Test : Membership := Inside;
Going : Direction := Forward) return Natural;
function Index
(Source : Bounded_Wide_String;
Pattern : Wide_String;
From : Positive;
Going : Direction := Forward;
Mapping : Wide_Maps.Wide_Character_Mapping := Wide_Maps.Identity)
return Natural;
pragma Ada_05 (Index);
function Index
(Source : Bounded_Wide_String;
Pattern : Wide_String;
From : Positive;
Going : Direction := Forward;
Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Natural;
pragma Ada_05 (Index);
function Index
(Source : Bounded_Wide_String;
Set : Wide_Maps.Wide_Character_Set;
From : Positive;
Test : Membership := Inside;
Going : Direction := Forward) return Natural;
pragma Ada_05 (Index);
function Index_Non_Blank
(Source : Bounded_Wide_String;
Going : Direction := Forward) return Natural;
function Index_Non_Blank
(Source : Bounded_Wide_String;
From : Positive;
Going : Direction := Forward) return Natural;
pragma Ada_05 (Index_Non_Blank);
function Count
(Source : Bounded_Wide_String;
Pattern : Wide_String;
Mapping : Wide_Maps.Wide_Character_Mapping := Wide_Maps.Identity)
return Natural;
function Count
(Source : Bounded_Wide_String;
Pattern : Wide_String;
Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Natural;
function Count
(Source : Bounded_Wide_String;
Set : Wide_Maps.Wide_Character_Set) return Natural;
procedure Find_Token
(Source : Bounded_Wide_String;
Set : Wide_Maps.Wide_Character_Set;
From : Positive;
Test : Membership;
First : out Positive;
Last : out Natural);
pragma Ada_2012 (Find_Token);
procedure Find_Token
(Source : Bounded_Wide_String;
Set : Wide_Maps.Wide_Character_Set;
Test : Membership;
First : out Positive;
Last : out Natural);
------------------------------------
-- String Translation Subprograms --
------------------------------------
function Translate
(Source : Bounded_Wide_String;
Mapping : Wide_Maps.Wide_Character_Mapping)
return Bounded_Wide_String;
procedure Translate
(Source : in out Bounded_Wide_String;
Mapping : Wide_Maps.Wide_Character_Mapping);
function Translate
(Source : Bounded_Wide_String;
Mapping : Wide_Maps.Wide_Character_Mapping_Function)
return Bounded_Wide_String;
procedure Translate
(Source : in out Bounded_Wide_String;
Mapping : Wide_Maps.Wide_Character_Mapping_Function);
---------------------------------------
-- String Transformation Subprograms --
---------------------------------------
function Replace_Slice
(Source : Bounded_Wide_String;
Low : Positive;
High : Natural;
By : Wide_String;
Drop : Truncation := Error) return Bounded_Wide_String;
procedure Replace_Slice
(Source : in out Bounded_Wide_String;
Low : Positive;
High : Natural;
By : Wide_String;
Drop : Truncation := Error);
function Insert
(Source : Bounded_Wide_String;
Before : Positive;
New_Item : Wide_String;
Drop : Truncation := Error) return Bounded_Wide_String;
procedure Insert
(Source : in out Bounded_Wide_String;
Before : Positive;
New_Item : Wide_String;
Drop : Truncation := Error);
function Overwrite
(Source : Bounded_Wide_String;
Position : Positive;
New_Item : Wide_String;
Drop : Truncation := Error) return Bounded_Wide_String;
procedure Overwrite
(Source : in out Bounded_Wide_String;
Position : Positive;
New_Item : Wide_String;
Drop : Truncation := Error);
function Delete
(Source : Bounded_Wide_String;
From : Positive;
Through : Natural) return Bounded_Wide_String;
procedure Delete
(Source : in out Bounded_Wide_String;
From : Positive;
Through : Natural);
---------------------------------
-- String Selector Subprograms --
---------------------------------
function Trim
(Source : Bounded_Wide_String;
Side : Trim_End) return Bounded_Wide_String;
procedure Trim
(Source : in out Bounded_Wide_String;
Side : Trim_End);
function Trim
(Source : Bounded_Wide_String;
Left : Wide_Maps.Wide_Character_Set;
Right : Wide_Maps.Wide_Character_Set) return Bounded_Wide_String;
procedure Trim
(Source : in out Bounded_Wide_String;
Left : Wide_Maps.Wide_Character_Set;
Right : Wide_Maps.Wide_Character_Set);
function Head
(Source : Bounded_Wide_String;
Count : Natural;
Pad : Wide_Character := Wide_Space;
Drop : Truncation := Error) return Bounded_Wide_String;
procedure Head
(Source : in out Bounded_Wide_String;
Count : Natural;
Pad : Wide_Character := Wide_Space;
Drop : Truncation := Error);
function Tail
(Source : Bounded_Wide_String;
Count : Natural;
Pad : Wide_Character := Wide_Space;
Drop : Truncation := Error) return Bounded_Wide_String;
procedure Tail
(Source : in out Bounded_Wide_String;
Count : Natural;
Pad : Wide_Character := Wide_Space;
Drop : Truncation := Error);
------------------------------------
-- String Constructor Subprograms --
------------------------------------
function "*"
(Left : Natural;
Right : Wide_Character) return Bounded_Wide_String;
function "*"
(Left : Natural;
Right : Wide_String) return Bounded_Wide_String;
function "*"
(Left : Natural;
Right : Bounded_Wide_String) return Bounded_Wide_String;
function Replicate
(Count : Natural;
Item : Wide_Character;
Drop : Truncation := Error) return Bounded_Wide_String;
function Replicate
(Count : Natural;
Item : Wide_String;
Drop : Truncation := Error) return Bounded_Wide_String;
function Replicate
(Count : Natural;
Item : Bounded_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_String;
private
-- Most of the implementation is in the separate non generic package
-- Ada.Strings.Wide_Superbounded. Type Bounded_Wide_String is derived
-- from type Wide_Superbounded.Super_String with the maximum length
-- constraint. In almost all cases, the routines in Wide_Superbounded
-- can be called with no requirement to pass the maximum length
-- explicitly, since there is at least one Bounded_Wide_String argument
-- from which the maximum length can be obtained. For all such
-- routines, the implementation in this private part is simply a
-- renaming of the corresponding routine in the super bouded package.
-- The five exceptions are the * and Replicate routines operating on
-- character values. For these cases, we have a routine in the body
-- that calls the superbounded routine passing the maximum length
-- explicitly as an extra parameter.
type Bounded_Wide_String is
new Wide_Superbounded.Super_String (Max_Length);
-- Deriving Bounded_Wide_String from Wide_Superbounded.Super_String is
-- the real trick, it ensures that the type Bounded_Wide_String
-- declared in the generic instantiation is compatible with the
-- Super_String type declared in the Wide_Superbounded package.
Null_Bounded_Wide_String : constant Bounded_Wide_String :=
(Max_Length => Max_Length,
Current_Length => 0,
Data =>
(1 .. Max_Length =>
Wide_Superbounded.Wide_NUL));
pragma Inline (To_Bounded_Wide_String);
procedure Set_Bounded_Wide_String
(Target : out Bounded_Wide_String;
Source : Wide_String;
Drop : Truncation := Error)
renames Set_Super_String;
function Length
(Source : Bounded_Wide_String) return Length_Range
renames Super_Length;
function To_Wide_String
(Source : Bounded_Wide_String) return Wide_String
renames Super_To_String;
function Append
(Left : Bounded_Wide_String;
Right : Bounded_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_String
renames Super_Append;
function Append
(Left : Bounded_Wide_String;
Right : Wide_String;
Drop : Truncation := Error) return Bounded_Wide_String
renames Super_Append;
function Append
(Left : Wide_String;
Right : Bounded_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_String
renames Super_Append;
function Append
(Left : Bounded_Wide_String;
Right : Wide_Character;
Drop : Truncation := Error) return Bounded_Wide_String
renames Super_Append;
function Append
(Left : Wide_Character;
Right : Bounded_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_String
renames Super_Append;
procedure Append
(Source : in out Bounded_Wide_String;
New_Item : Bounded_Wide_String;
Drop : Truncation := Error)
renames Super_Append;
procedure Append
(Source : in out Bounded_Wide_String;
New_Item : Wide_String;
Drop : Truncation := Error)
renames Super_Append;
procedure Append
(Source : in out Bounded_Wide_String;
New_Item : Wide_Character;
Drop : Truncation := Error)
renames Super_Append;
function "&"
(Left : Bounded_Wide_String;
Right : Bounded_Wide_String) return Bounded_Wide_String
renames Concat;
function "&"
(Left : Bounded_Wide_String;
Right : Wide_String) return Bounded_Wide_String
renames Concat;
function "&"
(Left : Wide_String;
Right : Bounded_Wide_String) return Bounded_Wide_String
renames Concat;
function "&"
(Left : Bounded_Wide_String;
Right : Wide_Character) return Bounded_Wide_String
renames Concat;
function "&"
(Left : Wide_Character;
Right : Bounded_Wide_String) return Bounded_Wide_String
renames Concat;
function Element
(Source : Bounded_Wide_String;
Index : Positive) return Wide_Character
renames Super_Element;
procedure Replace_Element
(Source : in out Bounded_Wide_String;
Index : Positive;
By : Wide_Character)
renames Super_Replace_Element;
function Slice
(Source : Bounded_Wide_String;
Low : Positive;
High : Natural) return Wide_String
renames Super_Slice;
function Bounded_Slice
(Source : Bounded_Wide_String;
Low : Positive;
High : Natural) return Bounded_Wide_String
renames Super_Slice;
procedure Bounded_Slice
(Source : Bounded_Wide_String;
Target : out Bounded_Wide_String;
Low : Positive;
High : Natural)
renames Super_Slice;
overriding function "="
(Left : Bounded_Wide_String;
Right : Bounded_Wide_String) return Boolean
renames Equal;
function "="
(Left : Bounded_Wide_String;
Right : Wide_String) return Boolean
renames Equal;
function "="
(Left : Wide_String;
Right : Bounded_Wide_String) return Boolean
renames Equal;
function "<"
(Left : Bounded_Wide_String;
Right : Bounded_Wide_String) return Boolean
renames Less;
function "<"
(Left : Bounded_Wide_String;
Right : Wide_String) return Boolean
renames Less;
function "<"
(Left : Wide_String;
Right : Bounded_Wide_String) return Boolean
renames Less;
function "<="
(Left : Bounded_Wide_String;
Right : Bounded_Wide_String) return Boolean
renames Less_Or_Equal;
function "<="
(Left : Bounded_Wide_String;
Right : Wide_String) return Boolean
renames Less_Or_Equal;
function "<="
(Left : Wide_String;
Right : Bounded_Wide_String) return Boolean
renames Less_Or_Equal;
function ">"
(Left : Bounded_Wide_String;
Right : Bounded_Wide_String) return Boolean
renames Greater;
function ">"
(Left : Bounded_Wide_String;
Right : Wide_String) return Boolean
renames Greater;
function ">"
(Left : Wide_String;
Right : Bounded_Wide_String) return Boolean
renames Greater;
function ">="
(Left : Bounded_Wide_String;
Right : Bounded_Wide_String) return Boolean
renames Greater_Or_Equal;
function ">="
(Left : Bounded_Wide_String;
Right : Wide_String) return Boolean
renames Greater_Or_Equal;
function ">="
(Left : Wide_String;
Right : Bounded_Wide_String) return Boolean
renames Greater_Or_Equal;
function Index
(Source : Bounded_Wide_String;
Pattern : Wide_String;
Going : Direction := Forward;
Mapping : Wide_Maps.Wide_Character_Mapping := Wide_Maps.Identity)
return Natural
renames Super_Index;
function Index
(Source : Bounded_Wide_String;
Pattern : Wide_String;
Going : Direction := Forward;
Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Natural
renames Super_Index;
function Index
(Source : Bounded_Wide_String;
Set : Wide_Maps.Wide_Character_Set;
Test : Membership := Inside;
Going : Direction := Forward) return Natural
renames Super_Index;
function Index
(Source : Bounded_Wide_String;
Pattern : Wide_String;
From : Positive;
Going : Direction := Forward;
Mapping : Wide_Maps.Wide_Character_Mapping := Wide_Maps.Identity)
return Natural
renames Super_Index;
function Index
(Source : Bounded_Wide_String;
Pattern : Wide_String;
From : Positive;
Going : Direction := Forward;
Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Natural
renames Super_Index;
function Index
(Source : Bounded_Wide_String;
Set : Wide_Maps.Wide_Character_Set;
From : Positive;
Test : Membership := Inside;
Going : Direction := Forward) return Natural
renames Super_Index;
function Index_Non_Blank
(Source : Bounded_Wide_String;
Going : Direction := Forward) return Natural
renames Super_Index_Non_Blank;
function Index_Non_Blank
(Source : Bounded_Wide_String;
From : Positive;
Going : Direction := Forward) return Natural
renames Super_Index_Non_Blank;
function Count
(Source : Bounded_Wide_String;
Pattern : Wide_String;
Mapping : Wide_Maps.Wide_Character_Mapping := Wide_Maps.Identity)
return Natural
renames Super_Count;
function Count
(Source : Bounded_Wide_String;
Pattern : Wide_String;
Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Natural
renames Super_Count;
function Count
(Source : Bounded_Wide_String;
Set : Wide_Maps.Wide_Character_Set) return Natural
renames Super_Count;
procedure Find_Token
(Source : Bounded_Wide_String;
Set : Wide_Maps.Wide_Character_Set;
From : Positive;
Test : Membership;
First : out Positive;
Last : out Natural)
renames Super_Find_Token;
procedure Find_Token
(Source : Bounded_Wide_String;
Set : Wide_Maps.Wide_Character_Set;
Test : Membership;
First : out Positive;
Last : out Natural)
renames Super_Find_Token;
function Translate
(Source : Bounded_Wide_String;
Mapping : Wide_Maps.Wide_Character_Mapping)
return Bounded_Wide_String
renames Super_Translate;
procedure Translate
(Source : in out Bounded_Wide_String;
Mapping : Wide_Maps.Wide_Character_Mapping)
renames Super_Translate;
function Translate
(Source : Bounded_Wide_String;
Mapping : Wide_Maps.Wide_Character_Mapping_Function)
return Bounded_Wide_String
renames Super_Translate;
procedure Translate
(Source : in out Bounded_Wide_String;
Mapping : Wide_Maps.Wide_Character_Mapping_Function)
renames Super_Translate;
function Replace_Slice
(Source : Bounded_Wide_String;
Low : Positive;
High : Natural;
By : Wide_String;
Drop : Truncation := Error) return Bounded_Wide_String
renames Super_Replace_Slice;
procedure Replace_Slice
(Source : in out Bounded_Wide_String;
Low : Positive;
High : Natural;
By : Wide_String;
Drop : Truncation := Error)
renames Super_Replace_Slice;
function Insert
(Source : Bounded_Wide_String;
Before : Positive;
New_Item : Wide_String;
Drop : Truncation := Error) return Bounded_Wide_String
renames Super_Insert;
procedure Insert
(Source : in out Bounded_Wide_String;
Before : Positive;
New_Item : Wide_String;
Drop : Truncation := Error)
renames Super_Insert;
function Overwrite
(Source : Bounded_Wide_String;
Position : Positive;
New_Item : Wide_String;
Drop : Truncation := Error) return Bounded_Wide_String
renames Super_Overwrite;
procedure Overwrite
(Source : in out Bounded_Wide_String;
Position : Positive;
New_Item : Wide_String;
Drop : Truncation := Error)
renames Super_Overwrite;
function Delete
(Source : Bounded_Wide_String;
From : Positive;
Through : Natural) return Bounded_Wide_String
renames Super_Delete;
procedure Delete
(Source : in out Bounded_Wide_String;
From : Positive;
Through : Natural)
renames Super_Delete;
function Trim
(Source : Bounded_Wide_String;
Side : Trim_End) return Bounded_Wide_String
renames Super_Trim;
procedure Trim
(Source : in out Bounded_Wide_String;
Side : Trim_End)
renames Super_Trim;
function Trim
(Source : Bounded_Wide_String;
Left : Wide_Maps.Wide_Character_Set;
Right : Wide_Maps.Wide_Character_Set) return Bounded_Wide_String
renames Super_Trim;
procedure Trim
(Source : in out Bounded_Wide_String;
Left : Wide_Maps.Wide_Character_Set;
Right : Wide_Maps.Wide_Character_Set)
renames Super_Trim;
function Head
(Source : Bounded_Wide_String;
Count : Natural;
Pad : Wide_Character := Wide_Space;
Drop : Truncation := Error) return Bounded_Wide_String
renames Super_Head;
procedure Head
(Source : in out Bounded_Wide_String;
Count : Natural;
Pad : Wide_Character := Wide_Space;
Drop : Truncation := Error)
renames Super_Head;
function Tail
(Source : Bounded_Wide_String;
Count : Natural;
Pad : Wide_Character := Wide_Space;
Drop : Truncation := Error) return Bounded_Wide_String
renames Super_Tail;
procedure Tail
(Source : in out Bounded_Wide_String;
Count : Natural;
Pad : Wide_Character := Wide_Space;
Drop : Truncation := Error)
renames Super_Tail;
function "*"
(Left : Natural;
Right : Bounded_Wide_String) return Bounded_Wide_String
renames Times;
function Replicate
(Count : Natural;
Item : Bounded_Wide_String;
Drop : Truncation := Error) return Bounded_Wide_String
renames Super_Replicate;
end Generic_Bounded_Length;
end Ada.Strings.Wide_Bounded;
| 33.001085 | 78 | 0.581687 |
588fd9611d9519bff9ee0b0c00a117632d5c41d9 | 9,497 | ads | Ada | src/servlet-requests-mockup.ads | jquorning/ada-servlet | 97db5fcdd59e01441c717b95a9e081aa7d6a7bbe | [
"Apache-2.0"
] | 6 | 2018-01-04T07:19:46.000Z | 2020-12-27T14:49:44.000Z | src/servlet-requests-mockup.ads | jquorning/ada-servlet | 97db5fcdd59e01441c717b95a9e081aa7d6a7bbe | [
"Apache-2.0"
] | 9 | 2020-12-20T15:29:18.000Z | 2022-02-04T20:13:58.000Z | src/servlet-requests-mockup.ads | jquorning/ada-servlet | 97db5fcdd59e01441c717b95a9e081aa7d6a7bbe | [
"Apache-2.0"
] | 2 | 2021-01-06T08:32:38.000Z | 2022-01-24T23:46:36.000Z | -----------------------------------------------------------------------
-- servlet-requests.mockup -- Servlet Requests mockup
-- Copyright (C) 2010, 2011, 2012, 2013, 2017, 2020 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Strings.Maps;
with Servlet.Responses.Mockup;
with Servlet.Parts.Mockup;
-- The <b>Servlet.Requests.Mockup</b> provides a fake request object to simulate
-- an HTTP request.
package Servlet.Requests.Mockup is
-- ------------------------------
-- Request Mockup
-- ------------------------------
-- The request mockup provides additional procedures to set the request
-- parameters, the URI, the peer address and other read-only values.
type Request is new Servlet.Requests.Request with private;
type Request_Access is access all Request'Class;
-- 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 : Request;
Name : String) return String;
-- 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));
-- Set the parameter
procedure Set_Parameter (Req : in out Request;
Name : in String;
Value : in String);
-- 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;
-- Sets the HTTP method.
procedure Set_Method (Req : in out Request;
Method : in String);
-- 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;
-- Sets the protocol version
procedure Set_Protocol (Req : in out Request;
Protocol : in String);
-- 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;
-- Set the request URI. When <tt>Split</tt> is true, the request parameters are
-- cleared and initialized with the query parameters passed in the URI.
procedure Set_Request_URI (Req : in out Request;
URI : in String;
Split : in Boolean := False);
-- 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;
-- Sets the header
procedure Set_Header (Req : in out Request;
Name : in String;
Value : in String);
-- 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;
-- 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));
-- 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;
-- Sets the peer address
procedure Set_Remote_Addr (Req : in out Request;
Addr : in String);
-- Get the number of parts included in the request.
function Get_Part_Count (Req : in Request) return Natural;
-- 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 Servlet.Parts.Part'Class));
-- 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 Servlet.Parts.Part'Class));
-- Set the request cookie by using the cookie returned in the response.
procedure Set_Cookie (Req : in out Request;
From : in Servlet.Responses.Mockup.Response'Class);
-- Set the session associated with the request.
procedure Set_Session (Req : in out Request;
Session : in Servlet.Sessions.Session);
type Part_Request (Count : Natural) is new Request with private;
-- Set a part to the request.
procedure Set_Part (Req : in out Part_Request;
Position : in Positive;
Name : in String;
Path : in String;
Content_Type : in String);
-- Get the number of parts included in the request.
overriding
function Get_Part_Count (Req : in Part_Request) return Natural;
-- Process the part at the given position and executes the <b>Process</b> operation
-- with the part object.
overriding
procedure Process_Part (Req : in out Part_Request;
Position : in Positive;
Process : not null access
procedure (Data : in Servlet.Parts.Part'Class));
-- Process the part identifed by <b>Id</b> and executes the <b>Process</b> operation
-- with the part object.
overriding
procedure Process_Part (Req : in out Part_Request;
Id : in String;
Process : not null access
procedure (Data : in Servlet.Parts.Part'Class));
private
use Ada.Strings.Unbounded;
type Request is new Servlet.Requests.Request with record
Headers : Util.Strings.Maps.Map;
Parameters : Util.Strings.Maps.Map;
URI : Unbounded_String;
Protocol : Unbounded_String;
Method : Unbounded_String;
Peer : Unbounded_String;
end record;
type Part_Request (Count : Natural) is new Request with record
Parts : Servlet.Parts.Mockup.Part_Array (1 .. Count);
end record;
end Servlet.Requests.Mockup;
| 45.440191 | 88 | 0.610824 |
58c1da21cfc5bccf5444ba493fa45e69ab4024fd | 12,437 | ads | Ada | tools/scitools/conf/understand/ada/ada05/s-stalib.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | 1 | 2020-01-20T21:26:46.000Z | 2020-01-20T21:26:46.000Z | tools/scitools/conf/understand/ada/ada05/s-stalib.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada05/s-stalib.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . S T A N D A R D _ L I B R A R Y --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2005 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
--
--
--
--
--
--
--
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package is included in all programs. It contains declarations that
-- are required to be part of every Ada program. A special mechanism is
-- required to ensure that these are loaded, since it may be the case in
-- some programs that the only references to these required packages are
-- from C code or from code generated directly by Gigi, an in both cases
-- the binder is not aware of such references.
-- System.Standard_Library also includes data that must be present in every
-- program, in particular the definitions of all the standard and also some
-- subprograms that must be present in every program.
-- The binder unconditionally includes s-stalib.ali, which ensures that this
-- package and the packages it references are included in all Ada programs,
-- together with the included data.
pragma Polling (Off);
-- We must turn polling off for this unit, because otherwise we get
-- elaboration circularities with Ada.Exceptions if polling is on.
with System;
with Unchecked_Conversion;
package System.Standard_Library is
pragma Warnings (Off);
pragma Preelaborate_05;
pragma Warnings (On);
type Big_String_Ptr is access all String (Positive);
-- A non-fat pointer type for null terminated strings
function To_Ptr is
new Unchecked_Conversion (System.Address, Big_String_Ptr);
---------------------------------------------
-- Type For Enumeration Image Index Tables --
---------------------------------------------
-- Note: these types are declared at the start of this unit, since
-- they must appear before any enumeration types declared in this
-- unit. Note that the spec of system is already elaborated at
-- this point (since we are a child of system), which means that
-- enumeration types in package System cannot use these types.
type Image_Index_Table_8 is
array (Integer range <>) of Short_Short_Integer;
type Image_Index_Table_16 is
array (Integer range <>) of Short_Integer;
type Image_Index_Table_32 is
array (Integer range <>) of Integer;
-- These types are used to generate the index vector used for enumeration
-- type image tables. See spec of Exp_Imgv in the main GNAT sources for a
-- full description of the data structures that are used here.
-------------------------------------
-- Exception Declarations and Data --
-------------------------------------
type Raise_Action is access procedure;
-- A pointer to a procedure used in the Raise_Hook field
type Exception_Data;
type Exception_Data_Ptr is access all Exception_Data;
-- An equivalent of Exception_Id that is public
type Exception_Code is mod 2 ** Integer'Size;
-- A scalar value bound to some exception data. Typically used for
-- imported or exported exceptions on VMS. Having a separate type for this
-- is useful to enforce consistency throughout the various run-time units
-- handling such codes, and having it unsigned is the most appropriate
-- choice for it's currently single use on VMS.
-- ??? The construction in Cstand has no way to access the proper type
-- node for Exception_Code, and currently uses Standard_Unsigned as a
-- fallback. The representations shall match, and the size clause below
-- is aimed at ensuring that.
for Exception_Code'Size use Integer'Size;
-- The following record defines the underlying representation of exceptions
-- WARNING! Any changes to this may need to be reflectd in the following
-- locations in the compiler and runtime code:
-- 1. The Internal_Exception routine in s-exctab.adb
-- 2. The processing in gigi that tests Not_Handled_By_Others
-- 3. Expand_N_Exception_Declaration in Exp_Ch11
-- 4. The construction of the exception type in Cstand
type Exception_Data is record
Not_Handled_By_Others : Boolean;
-- Normally set False, indicating that the exception is handled in the
-- usual way by others (i.e. an others handler handles the exception).
-- Set True to indicate that this exception is not caught by others
-- handlers, but must be explicitly named in a handler. This latter
-- setting is currently used by the Abort_Signal.
Lang : Character;
-- A character indicating the language raising the exception.
-- Set to "A" for exceptions defined by an Ada program.
-- Set to "V" for imported VMS exceptions.
Name_Length : Natural;
-- Length of fully expanded name of exception
Full_Name : System.Address;
-- Fully expanded name of exception, null terminated
-- You can use To_Ptr to convert this to a string.
HTable_Ptr : Exception_Data_Ptr;
-- Hash table pointer used to link entries together in the hash table
-- built (by Register_Exception in s-exctab.adb) for converting between
-- identities and names.
Import_Code : Exception_Code;
-- Value for imported exceptions. Needed only for the handling of
-- Import/Export_Exception for the VMS case, but present in all
-- implementations (we might well extend this mechanism for other
-- systems in the future).
Raise_Hook : Raise_Action;
-- This field can be used to place a "hook" on an exception. If the
-- value is non-null, then it points to a procedure which is called
-- whenever the exception is raised. This call occurs immediately,
-- before any other actions taken by the raise (and in particular
-- before any unwinding of the stack occurs).
end record;
-- Definitions for standard predefined exceptions defined in Standard,
-- Why are the Nul's necessary here, seems like they should not be
-- required, since Gigi is supposed to add a Nul to each name ???
Constraint_Error_Name : constant String := "CONSTRAINT_ERROR" & ASCII.NUL;
Program_Error_Name : constant String := "PROGRAM_ERROR" & ASCII.NUL;
Storage_Error_Name : constant String := "STORAGE_ERROR" & ASCII.NUL;
Tasking_Error_Name : constant String := "TASKING_ERROR" & ASCII.NUL;
Abort_Signal_Name : constant String := "_ABORT_SIGNAL" & ASCII.NUL;
Numeric_Error_Name : constant String := "NUMERIC_ERROR" & ASCII.NUL;
-- This is used only in the Ada 83 case, but it is not worth having a
-- separate version of s-stalib.ads for use in Ada 83 mode.
Constraint_Error_Def : aliased Exception_Data :=
(Not_Handled_By_Others => False,
Lang => 'A',
Name_Length => Constraint_Error_Name'Length,
Full_Name => Constraint_Error_Name'Address,
HTable_Ptr => null,
Import_Code => 0,
Raise_Hook => null);
Numeric_Error_Def : aliased Exception_Data :=
(Not_Handled_By_Others => False,
Lang => 'A',
Name_Length => Numeric_Error_Name'Length,
Full_Name => Numeric_Error_Name'Address,
HTable_Ptr => null,
Import_Code => 0,
Raise_Hook => null);
Program_Error_Def : aliased Exception_Data :=
(Not_Handled_By_Others => False,
Lang => 'A',
Name_Length => Program_Error_Name'Length,
Full_Name => Program_Error_Name'Address,
HTable_Ptr => null,
Import_Code => 0,
Raise_Hook => null);
Storage_Error_Def : aliased Exception_Data :=
(Not_Handled_By_Others => False,
Lang => 'A',
Name_Length => Storage_Error_Name'Length,
Full_Name => Storage_Error_Name'Address,
HTable_Ptr => null,
Import_Code => 0,
Raise_Hook => null);
Tasking_Error_Def : aliased Exception_Data :=
(Not_Handled_By_Others => False,
Lang => 'A',
Name_Length => Tasking_Error_Name'Length,
Full_Name => Tasking_Error_Name'Address,
HTable_Ptr => null,
Import_Code => 0,
Raise_Hook => null);
Abort_Signal_Def : aliased Exception_Data :=
(Not_Handled_By_Others => True,
Lang => 'A',
Name_Length => Abort_Signal_Name'Length,
Full_Name => Abort_Signal_Name'Address,
HTable_Ptr => null,
Import_Code => 0,
Raise_Hook => null);
pragma Export (C, Constraint_Error_Def, "constraint_error");
pragma Export (C, Numeric_Error_Def, "numeric_error");
pragma Export (C, Program_Error_Def, "program_error");
pragma Export (C, Storage_Error_Def, "storage_error");
pragma Export (C, Tasking_Error_Def, "tasking_error");
pragma Export (C, Abort_Signal_Def, "_abort_signal");
Local_Partition_ID : Natural := 0;
-- This variable contains the local Partition_ID that will be used when
-- building exception occurrences. In distributed mode, it will be
-- set by each partition to the correct value during the elaboration.
type Exception_Trace_Kind is
(RM_Convention,
-- No particular trace is requested, only unhandled exceptions
-- in the environment task (following the RM) will be printed.
-- This is the default behavior.
Every_Raise,
-- Denotes every possible raise event, either explicit or due to
-- a specific language rule, within the context of a task or not.
Unhandled_Raise
-- Denotes the raise events corresponding to exceptions for which
-- there is no user defined handler.
);
-- Provide a way to denote different kinds of automatic traces related
-- to exceptions that can be requested.
Exception_Trace : Exception_Trace_Kind := RM_Convention;
pragma Atomic (Exception_Trace);
-- By default, follow the RM convention.
-----------------
-- Subprograms --
-----------------
procedure Abort_Undefer_Direct;
pragma Inline (Abort_Undefer_Direct);
-- A little procedure that just calls Abort_Undefer.all, for use in
-- clean up procedures, which only permit a simple subprogram name.
procedure Adafinal;
-- Performs the Ada Runtime finalization the first time it is invoked.
-- All subsequent calls are ignored.
end System.Standard_Library;
| 44.898917 | 79 | 0.612125 |
0e7486cc2b664bfc68ee64257145976c1ac84fad | 3,919 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/gnatvsn.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/gnatvsn.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/gnatvsn.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T V S N --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
package body Gnatvsn is
----------------------
-- Copyright_Holder --
----------------------
function Copyright_Holder return String is
begin
return "Free Software Foundation, Inc.";
end Copyright_Holder;
------------------------
-- Gnat_Free_Software --
------------------------
function Gnat_Free_Software return String is
begin
return
"This is free software; see the source for copying conditions." &
ASCII.LF &
"There is NO warranty; not even for MERCHANTABILITY or FITNESS" &
" FOR A PARTICULAR PURPOSE.";
end Gnat_Free_Software;
type char_array is array (Natural range <>) of aliased Character;
Version_String : char_array (0 .. Ver_Len_Max - 1);
-- Import the C string defined in the (language-independent) source file
-- version.c using the zero-based convention of the C language.
-- The size is not the real one, which does not matter since we will
-- check for the nul character in Gnat_Version_String.
pragma Import (C, Version_String, "version_string");
-------------------------
-- Gnat_Version_String --
-------------------------
function Gnat_Version_String return String is
S : String (1 .. Ver_Len_Max);
Pos : Natural := 0;
begin
loop
exit when Version_String (Pos) = ASCII.NUL;
S (Pos + 1) := Version_String (Pos);
Pos := Pos + 1;
exit when Pos = Ver_Len_Max;
end loop;
return S (1 .. Pos);
end Gnat_Version_String;
end Gnatvsn;
| 46.105882 | 78 | 0.451646 |
3d6ee75e8f6e2140008c19afb262a4381699cf3e | 9,742 | adb | Ada | llvm-gcc-4.2-2.9/gcc/ada/gnatxref.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/gnatxref.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/gnatxref.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T X R E F --
-- --
-- B o d y --
-- --
-- Copyright (C) 1998-2005, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Xr_Tabls; use Xr_Tabls;
with Xref_Lib; use Xref_Lib;
with Osint; use Osint;
with Types; use Types;
with Gnatvsn;
with Opt;
with Ada.Strings.Fixed; use Ada.Strings.Fixed;
with Ada.Text_IO; use Ada.Text_IO;
with GNAT.Command_Line; use GNAT.Command_Line;
with GNAT.Strings; use GNAT.Strings;
procedure Gnatxref is
Search_Unused : Boolean := False;
Local_Symbols : Boolean := True;
Prj_File : File_Name_String;
Prj_File_Length : Natural := 0;
Usage_Error : exception;
Full_Path_Name : Boolean := False;
Vi_Mode : Boolean := False;
Read_Only : Boolean := False;
Have_File : Boolean := False;
Der_Info : Boolean := False;
RTS_Specified : String_Access := null;
-- Used to detect multiple use of --RTS= switch
procedure Parse_Cmd_Line;
-- Parse every switch on the command line
procedure Write_Usage;
-- Print a small help page for program usage
--------------------
-- Parse_Cmd_Line --
--------------------
procedure Parse_Cmd_Line is
begin
loop
case
GNAT.Command_Line.Getopt
("a aI: aO: d f g h I: nostdinc nostdlib p: u v -RTS=")
is
when ASCII.NUL =>
exit;
when 'a' =>
if GNAT.Command_Line.Full_Switch = "a" then
Read_Only := True;
elsif GNAT.Command_Line.Full_Switch = "aI" then
Osint.Add_Src_Search_Dir (GNAT.Command_Line.Parameter);
else
Osint.Add_Lib_Search_Dir (GNAT.Command_Line.Parameter);
end if;
when 'd' =>
Der_Info := True;
when 'f' =>
Full_Path_Name := True;
when 'g' =>
Local_Symbols := False;
when 'h' =>
Write_Usage;
when 'I' =>
Osint.Add_Src_Search_Dir (GNAT.Command_Line.Parameter);
Osint.Add_Lib_Search_Dir (GNAT.Command_Line.Parameter);
when 'n' =>
if GNAT.Command_Line.Full_Switch = "nostdinc" then
Opt.No_Stdinc := True;
elsif GNAT.Command_Line.Full_Switch = "nostlib" then
Opt.No_Stdlib := True;
end if;
when 'p' =>
declare
S : constant String := GNAT.Command_Line.Parameter;
begin
Prj_File_Length := S'Length;
Prj_File (1 .. Prj_File_Length) := S;
end;
when 'u' =>
Search_Unused := True;
Vi_Mode := False;
when 'v' =>
Vi_Mode := True;
Search_Unused := False;
-- The only switch starting with -- recognized is --RTS
when '-' =>
-- Check that it is the first time we see this switch
if RTS_Specified = null then
RTS_Specified := new String'(GNAT.Command_Line.Parameter);
elsif RTS_Specified.all /= GNAT.Command_Line.Parameter then
Osint.Fail ("--RTS cannot be specified multiple times");
end if;
Opt.No_Stdinc := True;
Opt.RTS_Switch := True;
declare
Src_Path_Name : constant String_Ptr :=
Get_RTS_Search_Dir
(GNAT.Command_Line.Parameter, Include);
Lib_Path_Name : constant String_Ptr :=
Get_RTS_Search_Dir
(GNAT.Command_Line.Parameter, Objects);
begin
if Src_Path_Name /= null and then Lib_Path_Name /= null then
Add_Search_Dirs (Src_Path_Name, Include);
Add_Search_Dirs (Lib_Path_Name, Objects);
elsif Src_Path_Name = null and then Lib_Path_Name = null then
Osint.Fail ("RTS path not valid: missing " &
"adainclude and adalib directories");
elsif Src_Path_Name = null then
Osint.Fail ("RTS path not valid: missing " &
"adainclude directory");
elsif Lib_Path_Name = null then
Osint.Fail ("RTS path not valid: missing " &
"adalib directory");
end if;
end;
when others =>
Write_Usage;
end case;
end loop;
-- Get the other arguments
loop
declare
S : constant String := GNAT.Command_Line.Get_Argument;
begin
exit when S'Length = 0;
if Ada.Strings.Fixed.Index (S, ":") /= 0 then
Ada.Text_IO.Put_Line
("Only file names are allowed on the command line");
Write_Usage;
end if;
Add_Xref_File (S);
Have_File := True;
end;
end loop;
exception
when GNAT.Command_Line.Invalid_Switch =>
Ada.Text_IO.Put_Line ("Invalid switch : "
& GNAT.Command_Line.Full_Switch);
Write_Usage;
when GNAT.Command_Line.Invalid_Parameter =>
Ada.Text_IO.Put_Line ("Parameter missing for : "
& GNAT.Command_Line.Full_Switch);
Write_Usage;
end Parse_Cmd_Line;
-----------------
-- Write_Usage --
-----------------
procedure Write_Usage is
begin
Put_Line ("GNATXREF " & Gnatvsn.Gnat_Version_String);
Put_Line ("Copyright 1998-2005, AdaCore");
Put_Line ("Usage: gnatxref [switches] file1 file2 ...");
New_Line;
Put_Line (" file ... list of source files to xref, " &
"including with'ed units");
New_Line;
Put_Line ("gnatxref switches:");
Put_Line (" -a Consider all files, even when the ali file is"
& " readonly");
Put_Line (" -aIdir Specify source files search path");
Put_Line (" -aOdir Specify library/object files search path");
Put_Line (" -d Output derived type information");
Put_Line (" -f Output full path name");
Put_Line (" -g Output information only for global symbols");
Put_Line (" -Idir Like -aIdir -aOdir");
Put_Line (" -nostdinc Don't look for sources in the system default"
& " directory");
Put_Line (" -nostdlib Don't look for library files in the system"
& " default directory");
Put_Line (" --RTS=dir specify the default source and object search"
& " path");
Put_Line (" -p file Use file as the default project file");
Put_Line (" -u List unused entities");
Put_Line (" -v Print a 'tags' file for vi");
New_Line;
raise Usage_Error;
end Write_Usage;
begin
Parse_Cmd_Line;
if not Have_File then
Write_Usage;
end if;
Xr_Tabls.Set_Default_Match (True);
-- Find the project file
if Prj_File_Length = 0 then
Xr_Tabls.Create_Project_File
(Default_Project_File (Osint.To_Host_Dir_Spec (".", False).all));
else
Xr_Tabls.Create_Project_File (Prj_File (1 .. Prj_File_Length));
end if;
-- Fill up the table
Search_Xref (Local_Symbols, Read_Only, Der_Info);
if Search_Unused then
Print_Unused (Full_Path_Name);
elsif Vi_Mode then
Print_Vi (Full_Path_Name);
else
Print_Xref (Full_Path_Name);
end if;
exception
when Usage_Error =>
null;
end Gnatxref;
| 35.297101 | 79 | 0.495176 |
29ec818736fb5b48bb76f0c9f5d769b12619d1d5 | 25,786 | adb | Ada | src/sys/serialize/util-serialize-mappers.adb | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | 60 | 2015-01-18T23:05:34.000Z | 2022-03-20T18:56:30.000Z | src/sys/serialize/util-serialize-mappers.adb | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | 20 | 2016-09-15T16:41:30.000Z | 2022-03-29T22:02:32.000Z | src/sys/serialize/util-serialize-mappers.adb | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | 10 | 2015-02-13T04:00:45.000Z | 2022-03-20T18:57:54.000Z | -----------------------------------------------------------------------
-- util-serialize-mappers -- Serialize objects in various formats
-- Copyright (C) 2010, 2011, 2012, 2014, 2017, 2018 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 System.Address_Image;
with Util.Strings;
with Ada.Tags;
with Ada.Exceptions;
with Ada.Unchecked_Deallocation;
package body Util.Serialize.Mappers is
-- The logger
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("Util.Serialize.Mappers",
Util.Log.WARN_LEVEL);
-- -----------------------
-- Execute the mapping operation on the object associated with the current context.
-- The object is extracted from the context and the <b>Execute</b> operation is called.
-- -----------------------
procedure Execute (Handler : in Mapper;
Map : in Mapping'Class;
Ctx : in out Util.Serialize.Contexts.Context'Class;
Value : in Util.Beans.Objects.Object) is
begin
if Handler.Mapper /= null then
Handler.Mapper.all.Execute (Map, Ctx, Value);
end if;
end Execute;
function Is_Proxy (Controller : in Mapper) return Boolean is
begin
return Controller.Is_Proxy_Mapper;
end Is_Proxy;
-- -----------------------
-- Returns true if the mapper is a wildcard node (matches any element).
-- -----------------------
function Is_Wildcard (Controller : in Mapper) return Boolean is
begin
return Controller.Is_Wildcard;
end Is_Wildcard;
-- -----------------------
-- Returns the mapping name.
-- -----------------------
function Get_Name (Controller : in Mapper) return String is
begin
return Ada.Strings.Unbounded.To_String (Controller.Name);
end Get_Name;
-- -----------------------
-- Find the mapper associated with the given name.
-- Returns null if there is no mapper.
-- -----------------------
function Find_Mapper (Controller : in Mapper;
Name : in String;
Attribute : in Boolean := False) return Mapper_Access is
use type Ada.Strings.Unbounded.Unbounded_String;
Node : Mapper_Access := Controller.First_Child;
Recurse : Boolean := True;
Result : Mapper_Access := null;
begin
if Node = null and Controller.Mapper /= null then
return Controller.Mapper.Find_Mapper (Name, Attribute);
end if;
while Node /= null loop
if not Attribute and Node.Is_Wildcard then
Result := Node.Find_Mapper (Name, Attribute);
if Result /= null then
return Result;
else
return Node;
end if;
end if;
if Node.Name = Name then
if (not Attribute and Node.Mapping = null)
or else not Node.Mapping.Is_Attribute
then
return Node;
end if;
if Attribute and Node.Mapping.Is_Attribute then
return Node;
end if;
end if;
if Node.Is_Deep_Wildcard and not Attribute and Node.Mapper /= null and Recurse then
Node := Node.Mapper.First_Child;
Result := Node.Mapper;
Recurse := False;
else
Node := Node.Next_Mapping;
end if;
end loop;
return Result;
end Find_Mapper;
-- -----------------------
-- Find a path component representing a child mapper under <b>From</b> and
-- identified by the given <b>Name</b>. If the mapper is not found, a new
-- Mapper_Node is created.
-- -----------------------
procedure Find_Path_Component (From : in out Mapper'Class;
Name : in String;
Root : in out Mapper_Access;
Result : out Mapper_Access) is
use Ada.Strings.Unbounded;
Node : Mapper_Access := From.First_Child;
Previous : Mapper_Access := null;
Wildcard : constant Boolean := Name = "*";
Deep_Wildcard : constant Boolean := Name = "**";
begin
if Root = null and Deep_Wildcard then
Root := Node;
end if;
if Node = null then
Result := new Mapper;
Result.Name := To_Unbounded_String (Name);
Result.Is_Wildcard := Wildcard or Deep_Wildcard;
Result.Is_Deep_Wildcard := Deep_Wildcard;
From.First_Child := Result;
else
loop
if Node.Name = Name then
Result := Node;
exit;
end if;
if Node.Next_Mapping = null then
Result := new Mapper;
Result.Name := To_Unbounded_String (Name);
Result.Is_Wildcard := Wildcard or Deep_Wildcard;
Result.Is_Deep_Wildcard := Deep_Wildcard;
if not Wildcard and not Deep_Wildcard then
Result.Next_Mapping := Node;
if Previous = null then
From.First_Child := Result;
else
Previous.Next_Mapping := Result;
end if;
else
Node.Next_Mapping := Result;
end if;
exit;
end if;
Previous := Node;
Node := Node.Next_Mapping;
end loop;
end if;
-- For deep wildcard mapping the mapping tree has to somehow redirect and use a
-- root node (ie, the '**' node). Create a proxy node to point to that wildcard root.
-- The wildcard nodes must be checked last and therefore appear at end of the mapping list.
if Root /= null then
Previous := Result;
while Previous.Next_Mapping /= null loop
Previous := Previous.Next_Mapping;
end loop;
if not Previous.Is_Wildcard and not Previous.Is_Deep_Wildcard then
Node := new Mapper;
Node.Name := To_Unbounded_String ("**");
Node.Is_Deep_Wildcard := True;
Node.Mapper := Root;
Previous.Next_Mapping := Node;
end if;
end if;
end Find_Path_Component;
-- -----------------------
-- Build the mapping tree that corresponds to the given <b>Path</b>.
-- Each path component is represented by a <b>Mapper_Node</b> element.
-- The node is created if it does not exists.
-- -----------------------
procedure Build_Path (Into : in out Mapper'Class;
Path : in String;
Last_Pos : out Natural;
Node : out Mapper_Access) is
Pos : Natural;
Root : Mapper_Access := null;
begin
Node := Into'Unchecked_Access;
Last_Pos := Path'First;
loop
Pos := Util.Strings.Index (Source => Path,
Char => '/',
From => Last_Pos);
if Pos = 0 then
Node.Find_Path_Component (Name => Path (Last_Pos .. Path'Last),
Root => Root,
Result => Node);
Last_Pos := Path'Last + 1;
else
Node.Find_Path_Component (Name => Path (Last_Pos .. Pos - 1),
Root => Root,
Result => Node);
Last_Pos := Pos + 1;
end if;
exit when Last_Pos > Path'Last;
end loop;
end Build_Path;
-- -----------------------
-- Add a mapping to associate the given <b>Path</b> to the mapper defined in <b>Map</b>.
-- The <b>Path</b> string describes the matching node using a simplified XPath notation.
-- Example:
-- info/first_name matches: <info><first_name>...</first_name></info>
-- info/a/b/name matches: <info><a><b><name>...</name></b></a></info>
-- */a/b/name matches: <i><i><j><a><b><name>...</name></b></a></j></i></i>
-- **/name matches: <i><name>...</name></i>, <b><c><name>...</name></c></b>
-- -----------------------
procedure Add_Mapping (Into : in out Mapper;
Path : in String;
Map : in Mapper_Access) is
procedure Copy (To : in Mapper_Access;
From : in Mapper_Access);
procedure Add_Mapper (From, To : in Mapper_Access);
function Find_Mapper (From : in Mapper_Access) return Mapper_Access;
procedure Append (To : in Mapper_Access;
Item : in Mapper_Access);
-- For the support of deep wildcard mapping (**), we must map a proxy node mapper
-- to the copy that was made. We maintain a small list of mapper pairs.
-- The implementation is intended to be simple for now...
type Mapper_Pair is record
First : Mapper_Access;
Second : Mapper_Access;
end record;
Node : Mapper_Access;
Last_Pos : Natural;
Mappers : array (1 .. 10) of Mapper_Pair;
procedure Add_Mapper (From, To : in Mapper_Access) is
begin
for I in Mappers'Range loop
if Mappers (I).First = null then
Mappers (I).First := From;
Mappers (I).Second := To;
return;
end if;
end loop;
Log.Error ("Too many wildcard mappers");
raise Mapping_Error with "Too many wildcard mapping, mapping is too complex!";
end Add_Mapper;
function Find_Mapper (From : in Mapper_Access) return Mapper_Access is
begin
for I in Mappers'Range loop
if Mappers (I).First = From then
return Mappers (I).Second;
end if;
end loop;
Log.Error ("Cannot find mapper {0}", System.Address_Image (From.all'Address));
return null;
end Find_Mapper;
procedure Append (To : in Mapper_Access;
Item : in Mapper_Access) is
Node : Mapper_Access := To.First_Child;
begin
if Node = null then
To.First_Child := Item;
else
while Node.Next_Mapping /= null loop
Node := Node.Next_Mapping;
end loop;
Node.Next_Mapping := Item;
end if;
end Append;
procedure Copy (To : in Mapper_Access;
From : in Mapper_Access) is
N : Mapper_Access;
Src : Mapper_Access := From;
begin
while Src /= null loop
N := Src.Clone;
N.Is_Clone := True;
if N.Is_Deep_Wildcard then
if N.Mapper /= null then
N.Mapper := Find_Mapper (N.Mapper);
else
Add_Mapper (Src, N);
end if;
end if;
Append (To, N);
if Src.First_Child /= null then
Copy (N, Src.First_Child);
end if;
Src := Src.Next_Mapping;
end loop;
end Copy;
-- use type Util.Log.Level_Type;
begin
if Log.Get_Level >= Util.Log.INFO_LEVEL then
Log.Info ("Mapping '{0}' for mapper {1}",
Path, Ada.Tags.Expanded_Name (Map'Tag));
end if;
-- Find or build the mapping tree.
Into.Build_Path (Path, Last_Pos, Node);
if Last_Pos < Path'Last then
Log.Warn ("Ignoring the end of mapping path {0}", Path);
end if;
if Node.Mapper /= null then
Log.Warn ("Overriding the mapping {0} for mapper X", Path);
end if;
if Map.First_Child /= null then
Copy (Node, Map.First_Child);
else
Node.Mapper := Map;
end if;
end Add_Mapping;
procedure Add_Mapping (Into : in out Mapper;
Path : in String;
Map : in Mapping_Access) is
use Ada.Strings.Unbounded;
Node : Mapper_Access;
Last_Pos : Natural;
begin
if Log.Get_Level >= Util.Log.INFO_LEVEL then
Log.Info ("Mapping '{0}' for mapper {1}",
Path, Ada.Tags.Expanded_Name (Map'Tag));
end if;
-- Find or build the mapping tree.
Into.Build_Path (Path, Last_Pos, Node);
if Last_Pos < Path'Last then
Log.Warn ("Ignoring the end of mapping path {0}", Path);
end if;
if Node.Mapping /= null then
Log.Warn ("Overriding the mapping {0} for mapper X", Path);
end if;
if Length (Node.Name) = 0 then
Log.Warn ("Mapped name is empty in mapping path {0}", Path);
elsif Element (Node.Name, 1) = '@' then
Delete (Node.Name, 1, 1);
Map.Is_Attribute := True;
else
Map.Is_Attribute := False;
end if;
Node.Mapping := Map;
Node.Mapper := Into'Unchecked_Access;
end Add_Mapping;
-- -----------------------
-- Clone the <b>Handler</b> instance and get a copy of that single object.
-- -----------------------
function Clone (Handler : in Mapper) return Mapper_Access is
Result : constant Mapper_Access := new Mapper;
begin
Result.Name := Handler.Name;
Result.Mapper := Handler.Mapper;
Result.Mapping := Handler.Mapping;
Result.Is_Proxy_Mapper := Handler.Is_Proxy_Mapper;
Result.Is_Clone := True;
Result.Is_Wildcard := Handler.Is_Wildcard;
Result.Is_Deep_Wildcard := Handler.Is_Deep_Wildcard;
return Result;
end Clone;
-- -----------------------
-- Set the name/value pair on the current object. For each active mapping,
-- find whether a rule matches our name and execute it.
-- -----------------------
procedure Set_Member (Handler : in Mapper;
Name : in String;
Value : in Util.Beans.Objects.Object;
Attribute : in Boolean := False;
Context : in out Util.Serialize.Contexts.Context'Class) is
Map : constant Mapper_Access := Mapper'Class (Handler).Find_Mapper (Name, Attribute);
begin
if Map /= null and then Map.Mapping /= null and then Map.Mapper /= null then
Map.Mapper.all.Execute (Map.Mapping.all, Context, Value);
end if;
end Set_Member;
procedure Start_Object (Handler : in Mapper;
Context : in out Util.Serialize.Contexts.Context'Class;
Name : in String) is
begin
if Handler.Mapper /= null then
Handler.Mapper.Start_Object (Context, Name);
end if;
end Start_Object;
procedure Finish_Object (Handler : in Mapper;
Context : in out Util.Serialize.Contexts.Context'Class;
Name : in String) is
begin
if Handler.Mapper /= null then
Handler.Mapper.Finish_Object (Context, Name);
end if;
end Finish_Object;
-- -----------------------
-- Dump the mapping tree on the logger using the INFO log level.
-- -----------------------
procedure Dump (Handler : in Mapper'Class;
Log : in Util.Log.Loggers.Logger'Class;
Prefix : in String := "") is
procedure Dump (Map : in Mapper'Class);
-- -----------------------
-- Dump the mapping description
-- -----------------------
procedure Dump (Map : in Mapper'Class) is
Name : constant String := Ada.Strings.Unbounded.To_String (Map.Name);
begin
if Map.Mapping /= null and then Map.Mapping.Is_Attribute then
Log.Info (" {0}@{1}", Prefix,
Ada.Strings.Unbounded.To_String (Map.Mapping.Name));
else
Log.Info (" {0}/{1}", Prefix, Name);
Dump (Map, Log, Prefix & "/" & Name);
end if;
end Dump;
begin
Iterate (Handler, Dump'Access);
end Dump;
procedure Iterate (Controller : in Mapper;
Process : not null access procedure (Map : in Mapper'Class)) is
Node : Mapper_Access := Controller.First_Child;
begin
-- Pass 1: process the attributes first
while Node /= null loop
if Node.Mapping /= null and then Node.Mapping.Is_Attribute then
Process.all (Node.all);
end if;
Node := Node.Next_Mapping;
end loop;
-- Pass 2: process the elements
Node := Controller.First_Child;
while Node /= null loop
if Node.Mapping = null or else not Node.Mapping.Is_Attribute then
Process.all (Node.all);
end if;
Node := Node.Next_Mapping;
end loop;
end Iterate;
-- -----------------------
-- Finalize the object and release any mapping.
-- -----------------------
overriding
procedure Finalize (Controller : in out Mapper) is
procedure Free is new Ada.Unchecked_Deallocation (Mapper'Class, Mapper_Access);
procedure Free is new Ada.Unchecked_Deallocation (Mapping'Class, Mapping_Access);
Node : Mapper_Access := Controller.First_Child;
Next : Mapper_Access;
begin
Controller.First_Child := null;
while Node /= null loop
Next := Node.Next_Mapping;
Free (Node);
Node := Next;
end loop;
if not Controller.Is_Clone then
Free (Controller.Mapping);
else
Controller.Mapping := null;
end if;
end Finalize;
-- ------------------------------
-- Start a document.
-- ------------------------------
procedure Start_Document (Stream : in out Processing) is
Context : Element_Context_Access;
begin
Context_Stack.Clear (Stream.Stack);
Context_Stack.Push (Stream.Stack);
Context := Context_Stack.Current (Stream.Stack);
Context.Active_Nodes (1) := Stream.Mapping_Tree'Unchecked_Access;
end Start_Document;
-- ------------------------------
-- Push the current context when entering in an element.
-- ------------------------------
procedure Push (Handler : in out Processing) is
begin
Context_Stack.Push (Handler.Stack);
end Push;
-- ------------------------------
-- Pop the context and restore the previous context when leaving an element
-- ------------------------------
procedure Pop (Handler : in out Processing) is
begin
Context_Stack.Pop (Handler.Stack);
end Pop;
function Find_Mapper (Handler : in Processing;
Name : in String) return Util.Serialize.Mappers.Mapper_Access is
pragma Unreferenced (Handler, Name);
begin
return null;
end Find_Mapper;
-- ------------------------------
-- Start a new object associated with the given name. This is called when
-- the '{' is reached. The reader must be updated so that the next
-- <b>Set_Member</b> procedure will associate the name/value pair on the
-- new object.
-- ------------------------------
procedure Start_Object (Handler : in out Processing;
Name : in String;
Logger : in out Util.Log.Logging'Class) is
pragma Unreferenced (Logger);
Current : constant Element_Context_Access := Context_Stack.Current (Handler.Stack);
Next : Element_Context_Access;
Pos : Positive;
begin
Log.Debug ("Start object {0}", Name);
Context_Stack.Push (Handler.Stack);
Next := Context_Stack.Current (Handler.Stack);
if Current /= null then
Pos := 1;
-- Notify we are entering in the given node for each active mapping.
for I in Current.Active_Nodes'Range loop
declare
Node : constant Mappers.Mapper_Access := Current.Active_Nodes (I);
Child : Mappers.Mapper_Access;
begin
exit when Node = null;
Child := Node.Find_Mapper (Name => Name);
if Child = null and then Node.Is_Wildcard then
Child := Node;
end if;
if Child /= null then
Log.Debug ("{0} is matching {1}", Name, Child.Get_Name);
Child.Start_Object (Handler, Name);
Next.Active_Nodes (Pos) := Child;
Pos := Pos + 1;
end if;
end;
end loop;
while Pos <= Next.Active_Nodes'Last loop
Next.Active_Nodes (Pos) := null;
Pos := Pos + 1;
end loop;
else
Next.Active_Nodes (1) := Handler.Mapping_Tree.Find_Mapper (Name);
end if;
end Start_Object;
-- ------------------------------
-- Finish an object associated with the given name. The reader must be
-- updated to be associated with the previous object.
-- ------------------------------
procedure Finish_Object (Handler : in out Processing;
Name : in String;
Logger : in out Util.Log.Logging'Class) is
pragma Unreferenced (Logger);
begin
Log.Debug ("Finish object {0}", Name);
declare
Current : constant Element_Context_Access := Context_Stack.Current (Handler.Stack);
begin
if Current /= null then
-- Notify we are leaving the given node for each active mapping.
for I in Current.Active_Nodes'Range loop
declare
Node : constant Mappers.Mapper_Access := Current.Active_Nodes (I);
begin
exit when Node = null;
Node.Finish_Object (Handler, Name);
end;
end loop;
end if;
end;
Handler.Pop;
end Finish_Object;
procedure Start_Array (Handler : in out Processing;
Name : in String;
Logger : in out Util.Log.Logging'Class) is
pragma Unreferenced (Name, Logger);
begin
Handler.Push;
end Start_Array;
procedure Finish_Array (Handler : in out Processing;
Name : in String;
Count : in Natural;
Logger : in out Util.Log.Logging'Class) is
pragma Unreferenced (Name, Count, Logger);
begin
Handler.Pop;
end Finish_Array;
-- -----------------------
-- Set the name/value pair on the current object. For each active mapping,
-- find whether a rule matches our name and execute it.
-- -----------------------
procedure Set_Member (Handler : in out Processing;
Name : in String;
Value : in Util.Beans.Objects.Object;
Logger : in out Util.Log.Logging'Class;
Attribute : in Boolean := False) is
Current : constant Element_Context_Access := Context_Stack.Current (Handler.Stack);
begin
Log.Debug ("Set member {0}", Name);
if Current /= null then
-- Look each active mapping node.
for I in Current.Active_Nodes'Range loop
declare
Node : constant Mapper_Access := Current.Active_Nodes (I);
begin
exit when Node = null;
Node.Set_Member (Name => Name,
Value => Value,
Attribute => Attribute,
Context => Handler);
exception
when E : Util.Serialize.Mappers.Field_Error =>
Logger.Error (Message => Ada.Exceptions.Exception_Message (E));
when E : Util.Serialize.Mappers.Field_Fatal_Error =>
Logger.Error (Message => Ada.Exceptions.Exception_Message (E));
raise;
-- For other exception, report an error with the field name and value.
when E : others =>
Logger.Error (Message => "Cannot set field '" & Name & "' to '"
& Util.Beans.Objects.To_String (Value) & "': "
& Ada.Exceptions.Exception_Message (E));
raise;
end;
end loop;
end if;
end Set_Member;
procedure Add_Mapping (Handler : in out Processing;
Path : in String;
Mapper : in Util.Serialize.Mappers.Mapper_Access) is
begin
Handler.Mapping_Tree.Add_Mapping (Path, Mapper);
end Add_Mapping;
-- ------------------------------
-- Dump the mapping tree on the logger using the INFO log level.
-- ------------------------------
procedure Dump (Handler : in Processing'Class;
Logger : in Util.Log.Loggers.Logger'Class) is
begin
Util.Serialize.Mappers.Dump (Handler.Mapping_Tree, Logger, "Mapping ");
end Dump;
end Util.Serialize.Mappers;
| 37.864905 | 98 | 0.530171 |
5867b3eb84467d6b478656aee45fe2519e00d1f2 | 202 | ads | Ada | s-fileio.ads | ytomino/gnat4drake | 945795d8705ba4024b07a41b7efe0a9513b441c1 | [
"MIT"
] | null | null | null | s-fileio.ads | ytomino/gnat4drake | 945795d8705ba4024b07a41b7efe0a9513b441c1 | [
"MIT"
] | null | null | null | s-fileio.ads | ytomino/gnat4drake | 945795d8705ba4024b07a41b7efe0a9513b441c1 | [
"MIT"
] | null | null | null | pragma License (Unrestricted);
with System.File_Control_Block;
package System.File_IO is
pragma Preelaborate;
procedure Check_File_Open (File : File_Control_Block.AFCB_Ptr);
end System.File_IO;
| 22.444444 | 66 | 0.806931 |
58cd9ef83b4745daba4b2a39233ec65a5517773f | 1,526 | ads | Ada | src/tests/ahven/ahven-xml_runner.ads | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | 60 | 2015-01-18T23:05:34.000Z | 2022-03-20T18:56:30.000Z | src/tests/ahven/ahven-xml_runner.ads | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | 20 | 2016-09-15T16:41:30.000Z | 2022-03-29T22:02:32.000Z | src/tests/ahven/ahven-xml_runner.ads | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | 10 | 2015-02-13T04:00:45.000Z | 2022-03-20T18:57:54.000Z | --
-- Copyright (c) 2007-2009 Tero Koskinen <[email protected]>
--
-- 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 Ahven.Framework;
with Ahven.Results;
with Ahven.Parameters;
package Ahven.XML_Runner is
procedure Run (Suite : in out Framework.Test_Suite'Class);
-- Run the suite and print the results.
procedure Run (Suite : Framework.Test_Suite_Access);
-- Run the suite and print the results. The routine is
-- identical to the above routine, but takes an access
-- parameter to a test suite.
procedure Report_Results (Result : Results.Result_Collection;
Dir : String);
-- Report results to the given directory.
private
procedure Do_Report (Test_Results : Results.Result_Collection;
Args : Parameters.Parameter_Info);
end Ahven.XML_Runner;
| 41.243243 | 75 | 0.729358 |
5846d3b7a8e62b09bb62fc43560f012b6d2a8703 | 3,777 | adb | Ada | tools-src/gnu/gcc/gcc/ada/s-vallld.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-vallld.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-vallld.adb | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . V A L _ L L D --
-- --
-- B o d y --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992,1993,1994,1995,1996 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.Val_Real; use System.Val_Real;
package body System.Val_LLD is
----------------------------
-- Scan_Long_Long_Decimal --
----------------------------
-- We use the floating-point circuit for now, this will be OK on a PC,
-- but definitely does NOT have the required precision if the longest
-- float type is IEEE double. This must be fixed in the future ???
function Scan_Long_Long_Decimal
(Str : String;
Ptr : access Integer;
Max : Integer;
Scale : Integer)
return Long_Long_Integer
is
Val : Long_Long_Float;
begin
Val := Scan_Real (Str, Ptr, Max);
return Long_Long_Integer (Val * 10.0 ** Scale);
end Scan_Long_Long_Decimal;
-----------------------------
-- Value_Long_Long_Decimal --
-----------------------------
-- Again we cheat and use floating-point ???
function Value_Long_Long_Decimal
(Str : String;
Scale : Integer)
return Long_Long_Integer
is
begin
return Long_Long_Integer (Value_Real (Str) * 10.0 ** Scale);
end Value_Long_Long_Decimal;
end System.Val_LLD;
| 48.423077 | 78 | 0.453005 |
292583f41f55a1b1a82f6e8ed3499d20780c69f8 | 1,965 | ads | Ada | src/conversion.ads | joffreyhuguet/curve25519-spark2014 | 0cfdcd54ba112b135050391a8de260ee7a4ba6c6 | [
"BSD-3-Clause"
] | 4 | 2019-02-25T11:02:34.000Z | 2019-08-08T11:54:04.000Z | src/conversion.ads | joffreyhuguet/curve25519-spark2014 | 0cfdcd54ba112b135050391a8de260ee7a4ba6c6 | [
"BSD-3-Clause"
] | null | null | null | src/conversion.ads | joffreyhuguet/curve25519-spark2014 | 0cfdcd54ba112b135050391a8de260ee7a4ba6c6 | [
"BSD-3-Clause"
] | null | null | null | with Big_Integers; use Big_Integers;
with Types; use Types;
with Construct_Conversion_Array;
package Conversion with
SPARK_Mode,
Ghost
is
pragma Annotate (GNATprove, Terminating, Conversion);
Conversion_Array : constant Conversion_Array_Type
:= Construct_Conversion_Array.Conversion_Array;
-- Conversion_Array is the array constructed in the
-- Construct_Conversion_Array package. It has the
-- property proven in the previous package.
--
-- Conversion_Array = (1, 2**25, 2**51, 2**77, 2**102, 2**128, 2**153,
-- 2**179, 2**204, 2**230, 2**255, 2**281, 2**306,
-- 2**332, 2**357, 2**383, 2**408, 2**434, 2**459)
function Partial_Conversion
(X : Integer_Curve25519;
L : Product_Index_Type)
return Big_Integer
is
(if L = 0
then (+X(0)) * Conversion_Array (0)
else
Partial_Conversion (X, L - 1) + (+X (L)) * Conversion_Array (L))
with
Pre => L in X'Range;
-- Recursive function to convert the array of integers to the integer
-- it represents.
function To_Big_Integer (X : Integer_Curve25519)
return Big_Integer
is
(Partial_Conversion (X, X'Last))
with
Pre => X'Length > 0;
-- Converts an array of 10 32-bits integers to the signed
-- 255-bits integer it represents.
function "+" (X : Integer_Curve25519) return Big_Integer
renames To_Big_Integer;
procedure Equal_To_Conversion
(A, B : Integer_Curve25519;
L : Product_Index_Type)
with
Pre =>
A'Length > 0
and then A'First = 0
and then B'First = 0
and then B'Last <= A'Last
and then L in B'Range
and then (for all J in 0 .. L => A (J) = B (J)),
Post => Partial_Conversion (A, L) = Partial_Conversion (B, L);
-- Lemma to prove that if A (0 .. L) = B (0 .. L) then
-- Partial_Conversion (A, L) = Partial_Conversion (B, L).
end Conversion;
| 31.190476 | 74 | 0.616794 |
29a838bc54c391b526ea7be4fb820f6589368440 | 37 | ads | Ada | test/date/test_date.ads | skill-lang/skillAdaTestSuite | 279ea0c0cd489c2e39d7532a3b68c564497101e2 | [
"BSD-3-Clause"
] | 1 | 2019-02-09T22:04:10.000Z | 2019-02-09T22:04:10.000Z | test/date/test_date.ads | skill-lang/skillAdaTestSuite | 279ea0c0cd489c2e39d7532a3b68c564497101e2 | [
"BSD-3-Clause"
] | null | null | null | test/date/test_date.ads | skill-lang/skillAdaTestSuite | 279ea0c0cd489c2e39d7532a3b68c564497101e2 | [
"BSD-3-Clause"
] | null | null | null | package Test_Date is
end Test_Date;
| 9.25 | 20 | 0.810811 |
577a1f0234e726791c823b6bff1b2b4eaa1e30d4 | 4,236 | adb | Ada | source/web/fastcgi/fastcgi-field_names.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/web/fastcgi/fastcgi-field_names.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/web/fastcgi/fastcgi-field_names.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2013, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
package body FastCGI.Field_Names is
---------
-- "=" --
---------
function "=" (Left : Field_Name; Right : Field_Name) return Boolean is
use type League.Strings.Universal_String;
begin
return
League.Strings.Universal_String (Left)
= League.Strings.Universal_String (Right);
end "=";
-------------------
-- To_Field_Name --
-------------------
function To_Field_Name
(Item : League.Strings.Universal_String) return Field_Name is
begin
return (Item.To_Simple_Uppercase with null record);
end To_Field_Name;
-------------------------
-- To_Universal_String --
-------------------------
function To_Universal_String
(Self : Field_Name'Class) return League.Strings.Universal_String is
begin
return League.Strings.Universal_String (Self);
end To_Universal_String;
end FastCGI.Field_Names;
| 52.296296 | 78 | 0.430831 |
57c293f2b2eac471b4e09ada4942ccfb3495498c | 2,019 | ads | Ada | STM32F4/ToyOBDH/src/hk_data.ads | AntonioRamosNieto/TFG-STM32F429 | d241065e51451199e7066e6ff3cbd207b4c88837 | [
"BSD-3-Clause"
] | null | null | null | STM32F4/ToyOBDH/src/hk_data.ads | AntonioRamosNieto/TFG-STM32F429 | d241065e51451199e7066e6ff3cbd207b4c88837 | [
"BSD-3-Clause"
] | null | null | null | STM32F4/ToyOBDH/src/hk_data.ads | AntonioRamosNieto/TFG-STM32F429 | d241065e51451199e7066e6ff3cbd207b4c88837 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2018, Universidad Politécnica de Madrid --
-- --
-- This 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. This software 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. See the GNU General Public --
-- License for more details. You should have received a copy of the GNU --
-- General Public License distributed with this software; see file --
-- COPYING3. If not, go to http://www.gnu.org/licenses for a complete copy --
-- of the license. --
-- --
------------------------------------------------------------------------------
-- Data types for the housekeeping subsystem
with HAL; use HAL;
package HK_Data is
type Sensor_Reading is new UInt16;
-- Raw temperature sensor reading.
-- To be converted to engineering units on ground.
-- Range is 0 .. 4095 (12 bit ADC) for 3 V reference voltage.
type Mission_Time is new UInt64;
-- Mission time in seconds
type Sensor_Data is
record
Value : Sensor_Reading;
Timestamp : Mission_Time;
end record
with Pack;
-- Sensor reading with timestamp
HK_Log_Length : constant Positive := 5;
-- Length of housekeeping data log to be sent to ground
type HK_Log is array (1 .. HK_Log_Length) of Sensor_Data;
-- Housekeeping data log
end HK_Data;
| 42.0625 | 79 | 0.525012 |
57b66515086cc4be8a54bfa0eed44187a9155e5c | 5,261 | ads | Ada | source/amf/utp/amf-utp-set_timezone_actions-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/utp/amf-utp-set_timezone_actions-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/utp/amf-utp-set_timezone_actions-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Generic_Collections;
package AMF.Utp.Set_Timezone_Actions.Collections is
pragma Preelaborate;
package Utp_Set_Timezone_Action_Collections is
new AMF.Generic_Collections
(Utp_Set_Timezone_Action,
Utp_Set_Timezone_Action_Access);
type Set_Of_Utp_Set_Timezone_Action is
new Utp_Set_Timezone_Action_Collections.Set with null record;
Empty_Set_Of_Utp_Set_Timezone_Action : constant Set_Of_Utp_Set_Timezone_Action;
type Ordered_Set_Of_Utp_Set_Timezone_Action is
new Utp_Set_Timezone_Action_Collections.Ordered_Set with null record;
Empty_Ordered_Set_Of_Utp_Set_Timezone_Action : constant Ordered_Set_Of_Utp_Set_Timezone_Action;
type Bag_Of_Utp_Set_Timezone_Action is
new Utp_Set_Timezone_Action_Collections.Bag with null record;
Empty_Bag_Of_Utp_Set_Timezone_Action : constant Bag_Of_Utp_Set_Timezone_Action;
type Sequence_Of_Utp_Set_Timezone_Action is
new Utp_Set_Timezone_Action_Collections.Sequence with null record;
Empty_Sequence_Of_Utp_Set_Timezone_Action : constant Sequence_Of_Utp_Set_Timezone_Action;
private
Empty_Set_Of_Utp_Set_Timezone_Action : constant Set_Of_Utp_Set_Timezone_Action
:= (Utp_Set_Timezone_Action_Collections.Set with null record);
Empty_Ordered_Set_Of_Utp_Set_Timezone_Action : constant Ordered_Set_Of_Utp_Set_Timezone_Action
:= (Utp_Set_Timezone_Action_Collections.Ordered_Set with null record);
Empty_Bag_Of_Utp_Set_Timezone_Action : constant Bag_Of_Utp_Set_Timezone_Action
:= (Utp_Set_Timezone_Action_Collections.Bag with null record);
Empty_Sequence_Of_Utp_Set_Timezone_Action : constant Sequence_Of_Utp_Set_Timezone_Action
:= (Utp_Set_Timezone_Action_Collections.Sequence with null record);
end AMF.Utp.Set_Timezone_Actions.Collections;
| 57.184783 | 98 | 0.539441 |
414ceec06af1f01eb3fc6e8023c73f660ae0a829 | 10,814 | ads | Ada | tlsf/src/tlsf-block-operations.ads | vasil-sd/ada-tlsf | c30cfaf5f0b87ebb6e4dd479e50b3f9b11381ddd | [
"MIT"
] | 3 | 2020-02-21T15:42:14.000Z | 2020-04-08T09:42:32.000Z | tlsf/src/tlsf-block-operations.ads | vasil-sd/ada-tlsf | c30cfaf5f0b87ebb6e4dd479e50b3f9b11381ddd | [
"MIT"
] | null | null | null | tlsf/src/tlsf-block-operations.ads | vasil-sd/ada-tlsf | c30cfaf5f0b87ebb6e4dd479e50b3f9b11381ddd | [
"MIT"
] | 1 | 2020-02-21T15:29:26.000Z | 2020-02-21T15:29:26.000Z | with TLSF.Config;
with TLSF.Block.Types;
with TLSF.Context;
with TLSF.Proof.Model.Context;
with TLSF.Proof.Model.Block;
package TLSF.Block.Operations with SPARK_Mode is
use TLSF.Config;
package BT renames TLSF.Block.Types;
package TC renames TLSF.Context;
package MB renames TLSF.Proof.Model.Block;
package MC renames TLSF.Proof.Model.Context;
use type BT.Address;
use type BT.Size;
use type MB.Block;
type Block is record
Address : BT.Aligned_Address;
Header : BT.Block_Header;
end record;
function Valid_Block (Ctx : TC.Context;
B : Block)
return Boolean
is (B.Address in Ctx.Memory.Region.First .. Ctx.Memory.Region.Last and then
(B.Header.Prev_Block_Address = BT.Address_Null or else
(B.Header.Prev_Block_Address in Ctx.Memory.Region.First .. Ctx.Memory.Region.Last
and then B.Header.Prev_Block_Address < B.Address))
and then B.Header.Size in BT.Quantum .. Ctx.Memory.Region.Last - B.Address)
with Global => null;
function To_Model (Ctx : TC.Context;
B : Block)
return MB.Block
with
Global => null,
Ghost,
Pre => Valid_Block (Ctx, B),
Post =>
To_Model'Result.Address = B.Address and then
To_Model'Result.Prev_Block_Address = B.Header.Prev_Block_Address and then
To_Model'Result.Size = B.Header.Size;
function Next_Block_Address (Ctx : TC.Context; B : Block)
return BT.Aligned_Address
is (B.Address + B.Header.Size)
with Global => null,
Pre => Valid_Block (Ctx, B),
Post => Next_Block_Address'Result =
MB.Next_Block_Address (To_Model (Ctx, B));
function Is_First_Block (Ctx : TC.Context;
B : Block)
return Boolean
with
Global => (Proof_In => MC.State),
Pre =>
Valid_Block (Ctx, B) and then
MC.Has_Model (Ctx) and then
MB.Valid (MC.Get_Block_Model (Ctx)) and then
MB.In_Model (MC.Get_Block_Model (Ctx), To_Model (Ctx, B)),
Post => Is_First_Block'Result =
MB.Is_First_Block (MC.Get_Block_Model (Ctx), To_Model (Ctx, B));
function Is_Last_Block (Ctx : TC.Context;
B : Block)
return Boolean
with
Global => (Proof_In => MC.State),
Pre =>
Valid_Block(Ctx, B) and then
MC.Has_Model (Ctx) and then
MB.Valid (MC.Get_Block_Model (Ctx)) and then
MB.In_Model (MC.Get_Block_Model (Ctx), To_Model (Ctx, B)),
Post => Is_Last_Block'Result =
MB.Is_Last_Block (MC.Get_Block_Model (Ctx), To_Model (Ctx, B));
function Neighbor_Blocks (Ctx : TC.Context;
Left, Right : Block)
return Boolean
is (Left.Address + Left.Header.Size = Right.Address and then
Right.Header.Prev_Block_Address = Left.Address)
with Pre =>
Valid_Block (Ctx, Left) and then
Valid_Block (Ctx, Right) and then
MC.Has_Model (Ctx) and then
MB.Valid (MC.Get_Block_Model (Ctx)) and then
MB.In_Model (MC.Get_Block_Model (Ctx), To_Model (Ctx, Left)) and then
MB.In_Model (MC.Get_Block_Model (Ctx), To_Model (Ctx, Right)),
Post =>
Neighbor_Blocks'Result = MB.Neighbor_Blocks
(To_Model (Ctx, Left),
To_Model (Ctx, Right));
procedure Get_Next_Block (Ctx : TC.Context;
B : Block;
Next : out Block)
with Global => (Proof_In => MC.State),
Pre => Valid_Block (Ctx, B) and then
MC.Has_Model (Ctx) and then
MB.Valid (MC.Get_Block_Model (Ctx)) and then
MB.In_Model (MC.Get_Block_Model (Ctx), To_Model (Ctx, B)) and then
not Is_Last_Block (Ctx, B) and then
MB.Get_Next (MC.Get_Block_Model (Ctx), To_Model (Ctx, B)).Address
= Next_Block_Address(Ctx, B),
Post => Valid_Block (Ctx, Next) and then
MB.In_Model (MC.Get_Block_Model (Ctx), To_Model (Ctx, Next)) and then
To_Model (Ctx, Next) = MB.Get_Next (MC.Get_Block_Model (Ctx), To_Model (Ctx, B)) and then
Neighbor_Blocks (Ctx, B, Next);
pragma Unevaluated_Use_Of_Old (Allow);
procedure Split_Block (Ctx : TC.Context;
B : Block;
Left_Size, Right_Size : BT.Aligned_Size;
Left, Right : out Block)
with Global => (In_Out => MC.State),
-- PRECONDITION of Split_Block
Pre =>
-- input block is valid regarding current context
Valid_Block (Ctx, B) and then
-- sizes are correct
Left_Size >= Small_Block_Size and then
Right_Size >= Small_Block_Size and then
Left_Size + Right_Size = B.Header.Size and then
-- input block is free and already unlinked from free lists
BT.Is_Block_Free (B.Header) and then
not BT.Is_Block_Linked_To_Free_List (B.Header) and then
-- formal model for current context is present and it is valid
MC.Has_Model (Ctx) and then
MB.Valid (MC.Get_Block_Model (Ctx)) and then
-- input block is reflected into formal model
MB.In_Model (MC.Get_Block_Model (Ctx), To_Model (Ctx, B)),
-- POSCONDITION of Split_Block
Post =>
-- output blocks are valid regarding current context
Valid_Block (Ctx, Left) and then Valid_Block (Ctx, Right)
-- they are free and not linked to any of free lists
and then BT.Is_Block_Free (Left.Header)
and then BT.Is_Block_Free (Right.Header)
and then not BT.Is_Block_Linked_To_Free_List (Left.Header)
and then not BT.Is_Block_Linked_To_Free_List (Right.Header)
-- they are in neighborhood relation
and then Neighbor_Blocks (Ctx, Left, Right)
-- updated formal model is valid
and then MB.Valid (MC.Get_Block_Model (Ctx))
-- and output blocks are reflected into formal model
and then MB.In_Model (MC.Get_Block_Model (Ctx), To_Model (Ctx, Left))
and then MB.In_Model (MC.Get_Block_Model (Ctx), To_Model (Ctx, Right))
-- neighborhood relation is reflected too
and then MB.Neighbor_Blocks (To_Model (Ctx, Left), To_Model (Ctx, Right))
-- being first and last is kept appropriately
and then Is_First_Block (Ctx, B)'Old = Is_First_Block (Ctx, Left)
and then MB.Is_First_Block (MC.Get_Block_Model (Ctx), To_Model (Ctx, B))'Old =
MB.Is_First_Block (MC.Get_Block_Model (Ctx), To_Model (Ctx, Left))
and then Is_First_Block (Ctx, Left) =
MB.Is_First_Block (MC.Get_Block_Model (Ctx), To_Model (Ctx, Left))
and then Is_Last_Block (Ctx, B)'Old = Is_Last_Block (Ctx, Right)
and then MB.Is_Last_Block (MC.Get_Block_Model (Ctx), To_Model (Ctx, B))'Old =
MB.Is_Last_Block (MC.Get_Block_Model (Ctx), To_Model (Ctx, Right))
and then Is_Last_Block (Ctx, Right) =
MB.Is_Last_Block (MC.Get_Block_Model (Ctx), To_Model (Ctx, Right))
-- neighborhood between right and next is kept
and then (if not Is_Last_Block (Ctx, Right) then
MB.Neighbor_Blocks (To_Model (Ctx, Right),
MB.Get_Next (MC.Get_Block_Model (Ctx),
To_Model (Ctx, Right))));
-- function Get_Prev_Free_Block (Ctx : TC.Context;
-- Addr : BT.Aligned_Address;
-- Hdr : BT.Block_Header_Free)
-- return BT.Block_Header_Free
-- with
-- Global => null,
-- Pure_Function,
-- Pre =>
-- BT.Is_Block_Linked_To_Free_List (Hdr) and then
-- MB.Valid (MC.Get_Block_Model (Ctx)) and then
-- In_Model (MC.Get_Block_Model (Ctx), To_Model (Ctx, Addr, Hdr)),
-- Post => MB.Valid (MC.Get_Block_Model (Ctx)) and then
-- In_Model (MC.Get_Block_Model (Ctx), To_Model (Ctx, Addr, Get_Prev_Free_Block'Result));
--
-- function Get_Next_Free_Block (Ctx : TC.Context;
-- Addr : BT.Aligned_Address;
-- Hdr : BT.Block_Header_Free)
-- return BT.Block_Header_Free
-- with
-- Global => null,
-- Pure_Function,
-- Pre =>
-- BT.Is_Block_Linked_To_Free_List (Hdr) and then
-- MB.Valid (MC.Get_Block_Model (Ctx)) and then
-- In_Model (MC.Get_Block_Model (Ctx), To_Model (Ctx, Addr, Hdr)),
-- Post => MB.Valid (MC.Get_Block_Model (Ctx)) and then
-- In_Model (MC.Get_Block_Model (Ctx), To_Model (Ctx, Addr, Get_Next_Free_Block'Result));
--
--
--
private
--
-- function Get_Block_At_Address (Ctx : TC.Context;
-- Addr : Aligned_Address)
-- return Block_Header
-- with
-- Global => null,
-- Pure_Function,
-- Pre =>
-- Addr >= BT.Quantum and then
-- MB.Valid (MC.Get_Block_Model (Ctx)),
-- Post =>
-- MB.Valid (MC.Get_Block_Model (Ctx)) and then
-- MB.In_Model (MC.Get_Block_Model (Ctx),
-- To_Model (Ctx, Addr, Get_Block_At_Address'Result));
--
-- Only possible way to reificate blocks in memory is to use Store_Block
-- Store_Block works only for blocks that are reflected in model
-- So if we load block header from address where it was stored by Store_Block
-- then we may be confident that this block already was reflected in model
-- That is why checking only reflection of block address is sufficient
procedure Load_Block (Ctx : TC.Context;
Addr : BT.Aligned_Address;
B : out Block)
with
Global => (Proof_In => MC.State),
Pre =>
MC.Has_Model (Ctx) and then
MB.Valid (MC.Get_Block_Model (Ctx)) and then
MB.Address_In_Model (MC.Get_Block_Model (Ctx), Addr),
Post =>
B.Address = Addr and then
Valid_Block (Ctx, B) and then
MB.In_Model (MC.Get_Block_Model (Ctx), To_Model (Ctx, B));
-- Stroring blocks is enabled only for blocks that are already reflected
-- in model
procedure Store_Block (Ctx : TC.Context;
B : Block)
with
Global => (Proof_In => MC.State),
Pre =>
Valid_Block (Ctx, B) and then
MC.Has_Model (Ctx) and then
MB.Valid (MC.Get_Block_Model (Ctx)) and then
MB.In_Model (MC.Get_Block_Model (Ctx), To_Model (Ctx, B));
end TLSF.Block.Operations;
| 40.200743 | 95 | 0.590808 |
580a3730a9ee3aca2dc07eb4fd4dea27d433a257 | 9,853 | adb | Ada | gcc-gcc-7_3_0-release/gcc/ada/makeusg.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/makeusg.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/makeusg.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- M A K E U S G --
-- --
-- B o d y --
-- --
-- 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. 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 Makeutl;
with Osint; use Osint;
with Output; use Output;
with Switch; use Switch;
with Usage;
procedure Makeusg is
-- Start of processing for Makeusg
begin
-- Usage line
Write_Str ("Usage: ");
Osint.Write_Program_Name;
Write_Str (" opts name ");
Write_Str ("{[-cargs opts] [-bargs opts] [-largs opts] [-margs opts]}");
Write_Eol;
Write_Eol;
Write_Str (" name is one or more file name from which you");
Write_Str (" can omit the .adb or .ads suffix");
Write_Eol;
Write_Eol;
-- GNATMAKE switches
Write_Str ("gnatmake switches:");
Write_Eol;
Display_Usage_Version_And_Help;
-- Line for -a
Write_Str (" -a Consider all files, even readonly ali files");
Write_Eol;
-- Line for -b
Write_Str (" -b Bind only");
Write_Eol;
-- Line for -B
Write_Str (" -B Build, bind and link full project");
Write_Eol;
-- Line for -c
Write_Str (" -c Compile only");
Write_Eol;
-- Line for -C
Write_Str (" -C Cache source mappings: " &
"invoke compiler with temp mapping file");
Write_Eol;
-- Line for -C=<mapping file>
Write_Str (" -C=mapp Cache source mappings: " &
"invoke compiler with mapping file mapp");
Write_Eol;
-- Line for -d
Write_Str (" -d Display compilation progress");
Write_Eol;
-- Line for -D
Write_Str (" -D dir Specify dir as the object directory");
Write_Eol;
-- Line for -eI
Write_Str (" -eI Index of unit in multi-unit source file");
Write_Eol;
-- Line for -eL
Write_Str (" -eL Follow symbolic links when processing " &
"project files");
Write_Eol;
-- Line for -eS
Write_Str (" -eS Echo commands to stdout instead of stderr");
Write_Eol;
-- Line for -f
Write_Str (" -f Force recompilations of non predefined units");
Write_Eol;
-- Line for -F
Write_Str (" -F Full project path name in brief error messages");
Write_Eol;
-- Line for -i
Write_Str (" -i In place. Replace existing ali file, ");
Write_Str ("or put it with source");
Write_Eol;
-- Line for -jnnn
Write_Str (" -jnum Use nnn processes to compile");
Write_Eol;
-- Line for -k
Write_Str (" -k Keep going after compilation errors");
Write_Eol;
-- Line for -l
Write_Str (" -l Link only");
Write_Eol;
-- Line for -m
Write_Str (" -m Minimal recompilation");
Write_Eol;
-- Line for -M
Write_Str (" -M List object file dependences for Makefile");
Write_Eol;
-- Line for -n
Write_Str (" -n Check objects up to date, output next file ");
Write_Str ("to compile if not");
Write_Eol;
-- Line for -o
Write_Str (" -o name Choose an alternate executable name");
Write_Eol;
-- Line for -p
Write_Str (" -p Create missing obj, lib and exec dirs");
Write_Eol;
-- Line for -P
Write_Str (" -Pproj Use GNAT Project File proj");
Write_Eol;
-- Line for -q
Write_Str (" -q Be quiet/terse");
Write_Eol;
-- Line for -R
Write_Str (" -R Do not use a run_path_option when linking");
Write_Eol;
-- Line for -s
Write_Str (" -s Recompile if compiler switches have changed");
Write_Eol;
-- Line for -u
Write_Str (" -u Unique compilation, only compile the given files");
Write_Eol;
-- Line for -U
Write_Str (" -U Unique compilation for all sources of all projects");
Write_Eol;
-- Line for -v
Write_Str (" -v Display reasons for all (re)compilations");
Write_Eol;
-- Line for -vl
Write_Str (" -vl Verbose output (low verbosity)");
Write_Eol;
-- Line for -vm
Write_Str (" -vm Verbose output (medium verbosity)");
Write_Eol;
-- Line for -vh
Write_Str (" -vh Equivalent to -v (high verbosity)");
Write_Eol;
-- Line for -vPx
Write_Str (" -vPx Specify verbosity when parsing GNAT Project Files");
Write_Eol;
-- Line for -we
Write_Str (" -we Treat all warnings as errors");
Write_Eol;
-- Line for -wn
Write_Str (" -wn Normal warning mode (cancels -we/-ws)");
Write_Eol;
-- Line for -ws
Write_Str (" -ws Suppress all warnings");
Write_Eol;
-- Line for -x
Write_Str (" -x " &
"Allow compilation of needed units external to the projects");
Write_Eol;
-- Line for -X
Write_Str (" -Xnm=val Specify an external reference for GNAT " &
"Project Files");
Write_Eol;
-- Line for -z
Write_Str (" -z No main subprogram (zero main)");
Write_Eol;
Write_Eol;
Write_Str (" --create-map-file Create map file mainprog.map");
Write_Eol;
Write_Str (" --create-map-file=mapfile");
Write_Eol;
Write_Str (" Create map file mapfile");
Write_Eol;
Write_Str (" --keep-temp-files Keep temporary files");
Write_Eol;
Write_Str (" --GCC=command Use this gcc command");
Write_Eol;
Write_Str (" --GNATBIND=command Use this gnatbind command");
Write_Eol;
Write_Str (" --GNATLINK=command Use this gnatlink command");
Write_Eol;
Write_Eol;
-- Source and Library search path switches
Write_Str ("Project, Source and Library search path switches:");
Write_Eol;
-- Line for -aP
Write_Str (" -aPdir Add directory dir to project search path");
Write_Eol;
-- Line for -aL
Write_Str (" -aLdir Skip missing library sources if ali in dir");
Write_Eol;
-- Line for -A
Write_Str (" -Adir like -aLdir -aIdir");
Write_Eol;
-- Line for -aO switch
Write_Str (" -aOdir Specify library/object files search path");
Write_Eol;
-- Line for -aI switch
Write_Str (" -aIdir Specify source files search path");
Write_Eol;
-- Line for -I switch
Write_Str (" -Idir Like -aIdir -aOdir");
Write_Eol;
-- Line for -I- switch
Write_Str (" -I- Don't look for sources & library files");
Write_Str (" in the default directory");
Write_Eol;
-- Line for -L
Write_Str (" -Ldir Look for program libraries also in dir");
Write_Eol;
-- Line for -nostdinc
Write_Str (" -nostdinc Don't look for sources");
Write_Str (" in the system default directory");
Write_Eol;
-- Line for -nostdlib
Write_Str (" -nostdlib Don't look for library files");
Write_Str (" in the system default directory");
Write_Eol;
-- Line for --RTS
Write_Str (" --RTS=dir specify the default source and object search"
& " path");
Write_Eol;
-- Line for --subdirs=
Write_Str (" --subdirs=dir real obj/lib/exec dirs are subdirs");
Write_Eol;
-- Line for --source-info=
Write_Str (" ");
Write_Str (Makeutl.Source_Info_Option);
Write_Str ("file specify a source info file");
Write_Eol;
-- Line for --unchecked-shared-lib-imports
Write_Str (" ");
Write_Str (Makeutl.Unchecked_Shared_Lib_Imports);
Write_Eol;
Write_Str (" Allow shared libraries to import static libraries");
Write_Eol;
Write_Eol;
-- General Compiler, Binder, Linker switches
Write_Str ("To pass an arbitrary switch to the Compiler, ");
Write_Str ("Binder or Linker:");
Write_Eol;
-- Line for -cargs
Write_Str (" -cargs opts opts are passed to the compiler");
Write_Eol;
-- Line for -bargs
Write_Str (" -bargs opts opts are passed to the binder");
Write_Eol;
-- Line for -largs
Write_Str (" -largs opts opts are passed to the linker");
Write_Eol;
-- Line for -margs
Write_Str (" -margs opts opts are passed to gnatmake");
Write_Eol;
-- Add usage information for gcc
Usage;
end Makeusg;
| 24.81864 | 79 | 0.555364 |
589ba6c5bfcd0264946220c477d7c0c57084726c | 15,407 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-altcon.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-altcon.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-altcon.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T . A L T I V E C . C O N V E R S I O N S --
-- --
-- B o d y --
-- --
-- Copyright (C) 2005-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Unchecked_Conversion;
with System; use System;
package body GNAT.Altivec.Conversions is
-- All the vector/view conversions operate similarly: bare unchecked
-- conversion on big endian targets, and elements permutation on little
-- endian targets. We call "Mirroring" the elements permutation process.
-- We would like to provide a generic version of the conversion routines
-- and just have a set of "renaming as body" declarations to satisfy the
-- public interface. This unfortunately prevents inlining, which we must
-- preserve at least for the hard binding.
-- We instead provide a generic version of facilities needed by all the
-- conversion routines and use them repeatedly.
generic
type Vitem_Type is private;
type Varray_Index_Type is range <>;
type Varray_Type is array (Varray_Index_Type) of Vitem_Type;
type Vector_Type is private;
type View_Type is private;
package Generic_Conversions is
subtype Varray is Varray_Type;
-- This provides an easy common way to refer to the type parameter
-- in contexts where a specific instance of this package is "use"d.
procedure Mirror (A : Varray_Type; Into : out Varray_Type);
pragma Inline (Mirror);
-- Mirror the elements of A into INTO, not touching the per-element
-- internal ordering.
-- A procedure with an out parameter is a bit heavier to use than a
-- function but reduces the amount of temporary creations around the
-- call. Instances are typically not front-end inlined. They can still
-- be back-end inlined on request with the proper command-line option.
-- Below are Unchecked Conversion routines for various purposes,
-- relying on internal knowledge about the bits layout in the different
-- types (all 128 value bits blocks).
-- View<->Vector straight bitwise conversions on BE targets
function UNC_To_Vector is
new Ada.Unchecked_Conversion (View_Type, Vector_Type);
function UNC_To_View is
new Ada.Unchecked_Conversion (Vector_Type, View_Type);
-- Varray->Vector/View for returning mirrored results on LE targets
function UNC_To_Vector is
new Ada.Unchecked_Conversion (Varray_Type, Vector_Type);
function UNC_To_View is
new Ada.Unchecked_Conversion (Varray_Type, View_Type);
-- Vector/View->Varray for to-be-permuted source on LE targets
function UNC_To_Varray is
new Ada.Unchecked_Conversion (Vector_Type, Varray_Type);
function UNC_To_Varray is
new Ada.Unchecked_Conversion (View_Type, Varray_Type);
end Generic_Conversions;
package body Generic_Conversions is
procedure Mirror (A : Varray_Type; Into : out Varray_Type) is
begin
for J in A'Range loop
Into (J) := A (A'Last - J + A'First);
end loop;
end Mirror;
end Generic_Conversions;
-- Now we declare the instances and implement the interface function
-- bodies simply calling the instantiated routines.
---------------------
-- Char components --
---------------------
package SC_Conversions is new Generic_Conversions
(signed_char, Vchar_Range, Varray_signed_char, VSC, VSC_View);
function To_Vector (S : VSC_View) return VSC is
use SC_Conversions;
begin
if Default_Bit_Order = High_Order_First then
return UNC_To_Vector (S);
else
declare
M : Varray;
begin
Mirror (UNC_To_Varray (S), Into => M);
return UNC_To_Vector (M);
end;
end if;
end To_Vector;
function To_View (S : VSC) return VSC_View is
use SC_Conversions;
begin
if Default_Bit_Order = High_Order_First then
return UNC_To_View (S);
else
declare
M : Varray;
begin
Mirror (UNC_To_Varray (S), Into => M);
return UNC_To_View (M);
end;
end if;
end To_View;
--
package UC_Conversions is new Generic_Conversions
(unsigned_char, Vchar_Range, Varray_unsigned_char, VUC, VUC_View);
function To_Vector (S : VUC_View) return VUC is
use UC_Conversions;
begin
if Default_Bit_Order = High_Order_First then
return UNC_To_Vector (S);
else
declare
M : Varray;
begin
Mirror (UNC_To_Varray (S), Into => M);
return UNC_To_Vector (M);
end;
end if;
end To_Vector;
function To_View (S : VUC) return VUC_View is
use UC_Conversions;
begin
if Default_Bit_Order = High_Order_First then
return UNC_To_View (S);
else
declare
M : Varray;
begin
Mirror (UNC_To_Varray (S), Into => M);
return UNC_To_View (M);
end;
end if;
end To_View;
--
package BC_Conversions is new Generic_Conversions
(bool_char, Vchar_Range, Varray_bool_char, VBC, VBC_View);
function To_Vector (S : VBC_View) return VBC is
use BC_Conversions;
begin
if Default_Bit_Order = High_Order_First then
return UNC_To_Vector (S);
else
declare
M : Varray;
begin
Mirror (UNC_To_Varray (S), Into => M);
return UNC_To_Vector (M);
end;
end if;
end To_Vector;
function To_View (S : VBC) return VBC_View is
use BC_Conversions;
begin
if Default_Bit_Order = High_Order_First then
return UNC_To_View (S);
else
declare
M : Varray;
begin
Mirror (UNC_To_Varray (S), Into => M);
return UNC_To_View (M);
end;
end if;
end To_View;
----------------------
-- Short components --
----------------------
package SS_Conversions is new Generic_Conversions
(signed_short, Vshort_Range, Varray_signed_short, VSS, VSS_View);
function To_Vector (S : VSS_View) return VSS is
use SS_Conversions;
begin
if Default_Bit_Order = High_Order_First then
return UNC_To_Vector (S);
else
declare
M : Varray;
begin
Mirror (UNC_To_Varray (S), Into => M);
return UNC_To_Vector (M);
end;
end if;
end To_Vector;
function To_View (S : VSS) return VSS_View is
use SS_Conversions;
begin
if Default_Bit_Order = High_Order_First then
return UNC_To_View (S);
else
declare
M : Varray;
begin
Mirror (UNC_To_Varray (S), Into => M);
return UNC_To_View (M);
end;
end if;
end To_View;
--
package US_Conversions is new Generic_Conversions
(unsigned_short, Vshort_Range, Varray_unsigned_short, VUS, VUS_View);
function To_Vector (S : VUS_View) return VUS is
use US_Conversions;
begin
if Default_Bit_Order = High_Order_First then
return UNC_To_Vector (S);
else
declare
M : Varray;
begin
Mirror (UNC_To_Varray (S), Into => M);
return UNC_To_Vector (M);
end;
end if;
end To_Vector;
function To_View (S : VUS) return VUS_View is
use US_Conversions;
begin
if Default_Bit_Order = High_Order_First then
return UNC_To_View (S);
else
declare
M : Varray;
begin
Mirror (UNC_To_Varray (S), Into => M);
return UNC_To_View (M);
end;
end if;
end To_View;
--
package BS_Conversions is new Generic_Conversions
(bool_short, Vshort_Range, Varray_bool_short, VBS, VBS_View);
function To_Vector (S : VBS_View) return VBS is
use BS_Conversions;
begin
if Default_Bit_Order = High_Order_First then
return UNC_To_Vector (S);
else
declare
M : Varray;
begin
Mirror (UNC_To_Varray (S), Into => M);
return UNC_To_Vector (M);
end;
end if;
end To_Vector;
function To_View (S : VBS) return VBS_View is
use BS_Conversions;
begin
if Default_Bit_Order = High_Order_First then
return UNC_To_View (S);
else
declare
M : Varray;
begin
Mirror (UNC_To_Varray (S), Into => M);
return UNC_To_View (M);
end;
end if;
end To_View;
--------------------
-- Int components --
--------------------
package SI_Conversions is new Generic_Conversions
(signed_int, Vint_Range, Varray_signed_int, VSI, VSI_View);
function To_Vector (S : VSI_View) return VSI is
use SI_Conversions;
begin
if Default_Bit_Order = High_Order_First then
return UNC_To_Vector (S);
else
declare
M : Varray;
begin
Mirror (UNC_To_Varray (S), Into => M);
return UNC_To_Vector (M);
end;
end if;
end To_Vector;
function To_View (S : VSI) return VSI_View is
use SI_Conversions;
begin
if Default_Bit_Order = High_Order_First then
return UNC_To_View (S);
else
declare
M : Varray;
begin
Mirror (UNC_To_Varray (S), Into => M);
return UNC_To_View (M);
end;
end if;
end To_View;
--
package UI_Conversions is new Generic_Conversions
(unsigned_int, Vint_Range, Varray_unsigned_int, VUI, VUI_View);
function To_Vector (S : VUI_View) return VUI is
use UI_Conversions;
begin
if Default_Bit_Order = High_Order_First then
return UNC_To_Vector (S);
else
declare
M : Varray;
begin
Mirror (UNC_To_Varray (S), Into => M);
return UNC_To_Vector (M);
end;
end if;
end To_Vector;
function To_View (S : VUI) return VUI_View is
use UI_Conversions;
begin
if Default_Bit_Order = High_Order_First then
return UNC_To_View (S);
else
declare
M : Varray;
begin
Mirror (UNC_To_Varray (S), Into => M);
return UNC_To_View (M);
end;
end if;
end To_View;
--
package BI_Conversions is new Generic_Conversions
(bool_int, Vint_Range, Varray_bool_int, VBI, VBI_View);
function To_Vector (S : VBI_View) return VBI is
use BI_Conversions;
begin
if Default_Bit_Order = High_Order_First then
return UNC_To_Vector (S);
else
declare
M : Varray;
begin
Mirror (UNC_To_Varray (S), Into => M);
return UNC_To_Vector (M);
end;
end if;
end To_Vector;
function To_View (S : VBI) return VBI_View is
use BI_Conversions;
begin
if Default_Bit_Order = High_Order_First then
return UNC_To_View (S);
else
declare
M : Varray;
begin
Mirror (UNC_To_Varray (S), Into => M);
return UNC_To_View (M);
end;
end if;
end To_View;
----------------------
-- Float components --
----------------------
package F_Conversions is new Generic_Conversions
(C_float, Vfloat_Range, Varray_float, VF, VF_View);
function To_Vector (S : VF_View) return VF is
use F_Conversions;
begin
if Default_Bit_Order = High_Order_First then
return UNC_To_Vector (S);
else
declare
M : Varray;
begin
Mirror (UNC_To_Varray (S), Into => M);
return UNC_To_Vector (M);
end;
end if;
end To_Vector;
function To_View (S : VF) return VF_View is
use F_Conversions;
begin
if Default_Bit_Order = High_Order_First then
return UNC_To_View (S);
else
declare
M : Varray;
begin
Mirror (UNC_To_Varray (S), Into => M);
return UNC_To_View (M);
end;
end if;
end To_View;
----------------------
-- Pixel components --
----------------------
package P_Conversions is new Generic_Conversions
(pixel, Vpixel_Range, Varray_pixel, VP, VP_View);
function To_Vector (S : VP_View) return VP is
use P_Conversions;
begin
if Default_Bit_Order = High_Order_First then
return UNC_To_Vector (S);
else
declare
M : Varray;
begin
Mirror (UNC_To_Varray (S), Into => M);
return UNC_To_Vector (M);
end;
end if;
end To_Vector;
function To_View (S : VP) return VP_View is
use P_Conversions;
begin
if Default_Bit_Order = High_Order_First then
return UNC_To_View (S);
else
declare
M : Varray;
begin
Mirror (UNC_To_Varray (S), Into => M);
return UNC_To_View (M);
end;
end if;
end To_View;
end GNAT.Altivec.Conversions;
| 29.916505 | 78 | 0.559486 |
3d557d95b90662c2b851e40251c7eb1b85f4dca7 | 2,184 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c4/c45220f.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/c45220f.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c4/c45220f.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C45220F.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 THE MEMBERSHIP OPERATIONS WORK CORRECTLY FOR DERIVED
-- BOOLEAN TYPES.
-- GLH 08/01/85
WITH REPORT;
PROCEDURE C45220F IS
USE REPORT ;
BEGIN
TEST( "C45220F" , "CHECK MEMBERSHIP OPERATIONS FOR " &
"DERIVED BOOLEAN");
DECLARE
TYPE NEWBOOL IS NEW BOOLEAN;
VAR : NEWBOOL := FALSE ;
CON : CONSTANT NEWBOOL := FALSE ;
BEGIN
IF TRUE NOT IN NEWBOOL OR
VAR NOT IN NEWBOOL OR
CON NOT IN NEWBOOL
THEN
FAILED( "WRONG VALUES FOR 'IN NEWBOOL'" );
END IF;
IF NEWBOOL'(FALSE) IN TRUE..FALSE OR
VAR NOT IN FALSE..TRUE OR
CON IN TRUE..TRUE
THEN
FAILED( "WRONG VALUES FOR 'IN AAA..BBB'" );
END IF;
RESULT ;
END ;
END C45220F ;
| 32.117647 | 79 | 0.596154 |
3dd2cddd46b3864fa184a3fe548745f7d9382b7e | 3,235 | ads | Ada | tools/scitools/conf/understand/ada/ada05/a-decima.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | 1 | 2020-01-20T21:26:46.000Z | 2020-01-20T21:26:46.000Z | tools/scitools/conf/understand/ada/ada05/a-decima.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada05/a-decima.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . D E C I M A L --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2006, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
--
--
--
--
--
--
--
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
package Ada.Decimal is
pragma Pure;
-- The compiler makes a number of assumptions based on the following five
-- constants (e.g. there is an assumption that decimal values can always
-- be represented in 64-bit signed binary form), so code modifications are
-- required to increase these constants.
Max_Scale : constant := +18;
Min_Scale : constant := -18;
Min_Delta : constant := 1.0E-18;
Max_Delta : constant := 1.0E+18;
Max_Decimal_Digits : constant := 18;
generic
type Dividend_Type is delta <> digits <>;
type Divisor_Type is delta <> digits <>;
type Quotient_Type is delta <> digits <>;
type Remainder_Type is delta <> digits <>;
procedure Divide
(Dividend : Dividend_Type;
Divisor : Divisor_Type;
Quotient : out Quotient_Type;
Remainder : out Remainder_Type);
private
pragma Inline (Divide);
end Ada.Decimal;
| 46.214286 | 78 | 0.467388 |
3dada43b7382045f2e312cd024cd10c2cd069a71 | 12,205 | ads | Ada | src/devices/SAMD51/ATSAMD51P19A/sam-device.ads | Fabien-Chouteau/samd51-hal | 54d4b29df100502d8b3e3b4680a198640faa5f4d | [
"BSD-3-Clause"
] | 1 | 2020-02-24T23:19:03.000Z | 2020-02-24T23:19:03.000Z | src/devices/SAMD51/ATSAMD51P20A/sam-device.ads | Fabien-Chouteau/samd51-hal | 54d4b29df100502d8b3e3b4680a198640faa5f4d | [
"BSD-3-Clause"
] | null | null | null | src/devices/SAMD51/ATSAMD51P20A/sam-device.ads | Fabien-Chouteau/samd51-hal | 54d4b29df100502d8b3e3b4680a198640faa5f4d | [
"BSD-3-Clause"
] | null | null | null | with System; use System;
with SAM.TC; use SAM.TC;
with SAM.SERCOM.USART; use SAM.SERCOM.USART;
with SAM.SERCOM.SPI; use SAM.SERCOM.SPI;
with SAM.SERCOM.I2C; use SAM.SERCOM.I2C;
with SAM.SERCOM; use SAM.SERCOM;
with SAM.Port; use SAM.Port;
with SAM.ADC; use SAM.ADC;
-- Generated by a script from an "avr tools device file" (atdf)
package SAM.Device is
-- ADC0 --
ADC0_Internal : aliased SAM.ADC.ADC_Internal
with Import, Address => System'To_Address (16#43001C00#);
ADC0 : aliased SAM.ADC.ADC_Device (ADC0_Internal'Access);
-- ADC1 --
ADC1_Internal : aliased SAM.ADC.ADC_Internal
with Import, Address => System'To_Address (16#43002000#);
ADC1 : aliased SAM.ADC.ADC_Device (ADC1_Internal'Access);
-- PORTA --
PORTA_Internal : aliased Port_Internal
with Import, Address => System'To_Address (16#41008000# + 16#000#);
PORTA : aliased Port_Controller (PORTA_Internal'Access);
PA00 : aliased GPIO_Point (PORTA'Access, 0);
PA01 : aliased GPIO_Point (PORTA'Access, 1);
PA02 : aliased GPIO_Point (PORTA'Access, 2);
PA03 : aliased GPIO_Point (PORTA'Access, 3);
PA04 : aliased GPIO_Point (PORTA'Access, 4);
PA05 : aliased GPIO_Point (PORTA'Access, 5);
PA06 : aliased GPIO_Point (PORTA'Access, 6);
PA07 : aliased GPIO_Point (PORTA'Access, 7);
PA08 : aliased GPIO_Point (PORTA'Access, 8);
PA09 : aliased GPIO_Point (PORTA'Access, 9);
PA10 : aliased GPIO_Point (PORTA'Access, 10);
PA11 : aliased GPIO_Point (PORTA'Access, 11);
PA12 : aliased GPIO_Point (PORTA'Access, 12);
PA13 : aliased GPIO_Point (PORTA'Access, 13);
PA14 : aliased GPIO_Point (PORTA'Access, 14);
PA15 : aliased GPIO_Point (PORTA'Access, 15);
PA16 : aliased GPIO_Point (PORTA'Access, 16);
PA17 : aliased GPIO_Point (PORTA'Access, 17);
PA18 : aliased GPIO_Point (PORTA'Access, 18);
PA19 : aliased GPIO_Point (PORTA'Access, 19);
PA20 : aliased GPIO_Point (PORTA'Access, 20);
PA21 : aliased GPIO_Point (PORTA'Access, 21);
PA22 : aliased GPIO_Point (PORTA'Access, 22);
PA23 : aliased GPIO_Point (PORTA'Access, 23);
PA24 : aliased GPIO_Point (PORTA'Access, 24);
PA25 : aliased GPIO_Point (PORTA'Access, 25);
PA26 : aliased GPIO_Point (PORTA'Access, 26);
PA27 : aliased GPIO_Point (PORTA'Access, 27);
PA28 : aliased GPIO_Point (PORTA'Access, 28);
PA29 : aliased GPIO_Point (PORTA'Access, 29);
PA30 : aliased GPIO_Point (PORTA'Access, 30);
PA31 : aliased GPIO_Point (PORTA'Access, 31);
-- PORTB --
PORTB_Internal : aliased Port_Internal
with Import, Address => System'To_Address (16#41008000# + 16#080#);
PORTB : aliased Port_Controller (PORTB_Internal'Access);
PB00 : aliased GPIO_Point (PORTB'Access, 0);
PB01 : aliased GPIO_Point (PORTB'Access, 1);
PB02 : aliased GPIO_Point (PORTB'Access, 2);
PB03 : aliased GPIO_Point (PORTB'Access, 3);
PB04 : aliased GPIO_Point (PORTB'Access, 4);
PB05 : aliased GPIO_Point (PORTB'Access, 5);
PB06 : aliased GPIO_Point (PORTB'Access, 6);
PB07 : aliased GPIO_Point (PORTB'Access, 7);
PB08 : aliased GPIO_Point (PORTB'Access, 8);
PB09 : aliased GPIO_Point (PORTB'Access, 9);
PB10 : aliased GPIO_Point (PORTB'Access, 10);
PB11 : aliased GPIO_Point (PORTB'Access, 11);
PB12 : aliased GPIO_Point (PORTB'Access, 12);
PB13 : aliased GPIO_Point (PORTB'Access, 13);
PB14 : aliased GPIO_Point (PORTB'Access, 14);
PB15 : aliased GPIO_Point (PORTB'Access, 15);
PB16 : aliased GPIO_Point (PORTB'Access, 16);
PB17 : aliased GPIO_Point (PORTB'Access, 17);
PB18 : aliased GPIO_Point (PORTB'Access, 18);
PB19 : aliased GPIO_Point (PORTB'Access, 19);
PB20 : aliased GPIO_Point (PORTB'Access, 20);
PB21 : aliased GPIO_Point (PORTB'Access, 21);
PB22 : aliased GPIO_Point (PORTB'Access, 22);
PB23 : aliased GPIO_Point (PORTB'Access, 23);
PB24 : aliased GPIO_Point (PORTB'Access, 24);
PB25 : aliased GPIO_Point (PORTB'Access, 25);
PB26 : aliased GPIO_Point (PORTB'Access, 26);
PB27 : aliased GPIO_Point (PORTB'Access, 27);
PB28 : aliased GPIO_Point (PORTB'Access, 28);
PB29 : aliased GPIO_Point (PORTB'Access, 29);
PB30 : aliased GPIO_Point (PORTB'Access, 30);
PB31 : aliased GPIO_Point (PORTB'Access, 31);
-- PORTC --
PORTC_Internal : aliased Port_Internal
with Import, Address => System'To_Address (16#41008000# + 16#100#);
PORTC : aliased Port_Controller (PORTC_Internal'Access);
PC00 : aliased GPIO_Point (PORTC'Access, 0);
PC01 : aliased GPIO_Point (PORTC'Access, 1);
PC02 : aliased GPIO_Point (PORTC'Access, 2);
PC03 : aliased GPIO_Point (PORTC'Access, 3);
PC04 : aliased GPIO_Point (PORTC'Access, 4);
PC05 : aliased GPIO_Point (PORTC'Access, 5);
PC06 : aliased GPIO_Point (PORTC'Access, 6);
PC07 : aliased GPIO_Point (PORTC'Access, 7);
PC08 : aliased GPIO_Point (PORTC'Access, 8);
PC09 : aliased GPIO_Point (PORTC'Access, 9);
PC10 : aliased GPIO_Point (PORTC'Access, 10);
PC11 : aliased GPIO_Point (PORTC'Access, 11);
PC12 : aliased GPIO_Point (PORTC'Access, 12);
PC13 : aliased GPIO_Point (PORTC'Access, 13);
PC14 : aliased GPIO_Point (PORTC'Access, 14);
PC15 : aliased GPIO_Point (PORTC'Access, 15);
PC16 : aliased GPIO_Point (PORTC'Access, 16);
PC17 : aliased GPIO_Point (PORTC'Access, 17);
PC18 : aliased GPIO_Point (PORTC'Access, 18);
PC19 : aliased GPIO_Point (PORTC'Access, 19);
PC20 : aliased GPIO_Point (PORTC'Access, 20);
PC21 : aliased GPIO_Point (PORTC'Access, 21);
PC22 : aliased GPIO_Point (PORTC'Access, 22);
PC23 : aliased GPIO_Point (PORTC'Access, 23);
PC24 : aliased GPIO_Point (PORTC'Access, 24);
PC25 : aliased GPIO_Point (PORTC'Access, 25);
PC26 : aliased GPIO_Point (PORTC'Access, 26);
PC27 : aliased GPIO_Point (PORTC'Access, 27);
PC28 : aliased GPIO_Point (PORTC'Access, 28);
PC29 : aliased GPIO_Point (PORTC'Access, 29);
PC30 : aliased GPIO_Point (PORTC'Access, 30);
PC31 : aliased GPIO_Point (PORTC'Access, 31);
-- PORTD --
PORTD_Internal : aliased Port_Internal
with Import, Address => System'To_Address (16#41008000# + 16#180#);
PORTD : aliased Port_Controller (PORTD_Internal'Access);
PD00 : aliased GPIO_Point (PORTD'Access, 0);
PD01 : aliased GPIO_Point (PORTD'Access, 1);
PD02 : aliased GPIO_Point (PORTD'Access, 2);
PD03 : aliased GPIO_Point (PORTD'Access, 3);
PD04 : aliased GPIO_Point (PORTD'Access, 4);
PD05 : aliased GPIO_Point (PORTD'Access, 5);
PD06 : aliased GPIO_Point (PORTD'Access, 6);
PD07 : aliased GPIO_Point (PORTD'Access, 7);
PD08 : aliased GPIO_Point (PORTD'Access, 8);
PD09 : aliased GPIO_Point (PORTD'Access, 9);
PD10 : aliased GPIO_Point (PORTD'Access, 10);
PD11 : aliased GPIO_Point (PORTD'Access, 11);
PD12 : aliased GPIO_Point (PORTD'Access, 12);
PD13 : aliased GPIO_Point (PORTD'Access, 13);
PD14 : aliased GPIO_Point (PORTD'Access, 14);
PD15 : aliased GPIO_Point (PORTD'Access, 15);
PD16 : aliased GPIO_Point (PORTD'Access, 16);
PD17 : aliased GPIO_Point (PORTD'Access, 17);
PD18 : aliased GPIO_Point (PORTD'Access, 18);
PD19 : aliased GPIO_Point (PORTD'Access, 19);
PD20 : aliased GPIO_Point (PORTD'Access, 20);
PD21 : aliased GPIO_Point (PORTD'Access, 21);
PD22 : aliased GPIO_Point (PORTD'Access, 22);
PD23 : aliased GPIO_Point (PORTD'Access, 23);
PD24 : aliased GPIO_Point (PORTD'Access, 24);
PD25 : aliased GPIO_Point (PORTD'Access, 25);
PD26 : aliased GPIO_Point (PORTD'Access, 26);
PD27 : aliased GPIO_Point (PORTD'Access, 27);
PD28 : aliased GPIO_Point (PORTD'Access, 28);
PD29 : aliased GPIO_Point (PORTD'Access, 29);
PD30 : aliased GPIO_Point (PORTD'Access, 30);
PD31 : aliased GPIO_Point (PORTD'Access, 31);
-- SERCOM0 --
SERCOM0_Internal : aliased SAM.SERCOM.SERCOM_Internal
with Import, Address => System'To_Address (16#40003000#);
SPI0 : aliased SAM.SERCOM.SPI.SPI_Device (SERCOM0_Internal'Access);
I2C0 : aliased SAM.SERCOM.I2C.I2C_Device (SERCOM0_Internal'Access);
USART0 : aliased SAM.SERCOM.USART.USART_Device (SERCOM0_Internal'Access);
-- SERCOM1 --
SERCOM1_Internal : aliased SAM.SERCOM.SERCOM_Internal
with Import, Address => System'To_Address (16#40003400#);
SPI1 : aliased SAM.SERCOM.SPI.SPI_Device (SERCOM1_Internal'Access);
I2C1 : aliased SAM.SERCOM.I2C.I2C_Device (SERCOM1_Internal'Access);
USART1 : aliased SAM.SERCOM.USART.USART_Device (SERCOM1_Internal'Access);
-- SERCOM2 --
SERCOM2_Internal : aliased SAM.SERCOM.SERCOM_Internal
with Import, Address => System'To_Address (16#41012000#);
SPI2 : aliased SAM.SERCOM.SPI.SPI_Device (SERCOM2_Internal'Access);
I2C2 : aliased SAM.SERCOM.I2C.I2C_Device (SERCOM2_Internal'Access);
USART2 : aliased SAM.SERCOM.USART.USART_Device (SERCOM2_Internal'Access);
-- SERCOM3 --
SERCOM3_Internal : aliased SAM.SERCOM.SERCOM_Internal
with Import, Address => System'To_Address (16#41014000#);
SPI3 : aliased SAM.SERCOM.SPI.SPI_Device (SERCOM3_Internal'Access);
I2C3 : aliased SAM.SERCOM.I2C.I2C_Device (SERCOM3_Internal'Access);
USART3 : aliased SAM.SERCOM.USART.USART_Device (SERCOM3_Internal'Access);
-- SERCOM4 --
SERCOM4_Internal : aliased SAM.SERCOM.SERCOM_Internal
with Import, Address => System'To_Address (16#43000000#);
SPI4 : aliased SAM.SERCOM.SPI.SPI_Device (SERCOM4_Internal'Access);
I2C4 : aliased SAM.SERCOM.I2C.I2C_Device (SERCOM4_Internal'Access);
USART4 : aliased SAM.SERCOM.USART.USART_Device (SERCOM4_Internal'Access);
-- SERCOM5 --
SERCOM5_Internal : aliased SAM.SERCOM.SERCOM_Internal
with Import, Address => System'To_Address (16#43000400#);
SPI5 : aliased SAM.SERCOM.SPI.SPI_Device (SERCOM5_Internal'Access);
I2C5 : aliased SAM.SERCOM.I2C.I2C_Device (SERCOM5_Internal'Access);
USART5 : aliased SAM.SERCOM.USART.USART_Device (SERCOM5_Internal'Access);
-- SERCOM6 --
SERCOM6_Internal : aliased SAM.SERCOM.SERCOM_Internal
with Import, Address => System'To_Address (16#43000800#);
SPI6 : aliased SAM.SERCOM.SPI.SPI_Device (SERCOM6_Internal'Access);
I2C6 : aliased SAM.SERCOM.I2C.I2C_Device (SERCOM6_Internal'Access);
USART6 : aliased SAM.SERCOM.USART.USART_Device (SERCOM6_Internal'Access);
-- SERCOM7 --
SERCOM7_Internal : aliased SAM.SERCOM.SERCOM_Internal
with Import, Address => System'To_Address (16#43000C00#);
SPI7 : aliased SAM.SERCOM.SPI.SPI_Device (SERCOM7_Internal'Access);
I2C7 : aliased SAM.SERCOM.I2C.I2C_Device (SERCOM7_Internal'Access);
USART7 : aliased SAM.SERCOM.USART.USART_Device (SERCOM7_Internal'Access);
-- TC0 --
TC0_Internal : aliased SAM.TC.TC_Internal
with Import, Address => System'To_Address (16#40003800#);
TC0 : aliased SAM.TC.TC_Device (TC0_Internal'Access, Master => True);
-- TC1 --
TC1_Internal : aliased SAM.TC.TC_Internal
with Import, Address => System'To_Address (16#40003C00#);
TC1 : aliased SAM.TC.TC_Device (TC1_Internal'Access, Master => False);
-- TC2 --
TC2_Internal : aliased SAM.TC.TC_Internal
with Import, Address => System'To_Address (16#4101A000#);
TC2 : aliased SAM.TC.TC_Device (TC2_Internal'Access, Master => True);
-- TC3 --
TC3_Internal : aliased SAM.TC.TC_Internal
with Import, Address => System'To_Address (16#4101C000#);
TC3 : aliased SAM.TC.TC_Device (TC3_Internal'Access, Master => False);
-- TC4 --
TC4_Internal : aliased SAM.TC.TC_Internal
with Import, Address => System'To_Address (16#42001400#);
TC4 : aliased SAM.TC.TC_Device (TC4_Internal'Access, Master => True);
-- TC5 --
TC5_Internal : aliased SAM.TC.TC_Internal
with Import, Address => System'To_Address (16#42001800#);
TC5 : aliased SAM.TC.TC_Device (TC5_Internal'Access, Master => False);
-- TC6 --
TC6_Internal : aliased SAM.TC.TC_Internal
with Import, Address => System'To_Address (16#43001400#);
TC6 : aliased SAM.TC.TC_Device (TC6_Internal'Access, Master => True);
-- TC7 --
TC7_Internal : aliased SAM.TC.TC_Internal
with Import, Address => System'To_Address (16#43001800#);
TC7 : aliased SAM.TC.TC_Device (TC7_Internal'Access, Master => False);
end SAM.Device;
| 39.11859 | 76 | 0.704302 |
3d08015d4fb715f3f7a8a9146fc0ac519362ae23 | 20,432 | ads | Ada | oeml-sdk/ada/src/model/-models.ads | Ramshreyas/coinapi-sdk | 5b6f8843928e69f74b91dc2bca39f22b96f2b63e | [
"MIT"
] | null | null | null | oeml-sdk/ada/src/model/-models.ads | Ramshreyas/coinapi-sdk | 5b6f8843928e69f74b91dc2bca39f22b96f2b63e | [
"MIT"
] | null | null | null | oeml-sdk/ada/src/model/-models.ads | Ramshreyas/coinapi-sdk | 5b6f8843928e69f74b91dc2bca39f22b96f2b63e | [
"MIT"
] | null | null | null | -- OEML _ REST API
-- This section will provide necessary information about the `CoinAPI OEML REST API` protocol. This API is also available in the Postman application: <a href=\"https://postman.coinapi.io/\" target=\"_blank\">https://postman.coinapi.io/</a>
--
-- The version of the OpenAPI document: v1
-- Contact: [email protected]
--
-- NOTE: This package is auto generated by OpenAPI-Generator 5.2.0.
-- https://openapi-generator.tech
-- Do not edit the class manually.
with Swagger.Streams;
with Ada.Containers.Vectors;
package .Models is
pragma Style_Checks ("-mr");
type RejectReason_Type is
record
end record;
package RejectReason_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => RejectReason_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in RejectReason_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in RejectReason_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out RejectReason_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out RejectReason_Type_Vectors.Vector);
-- ------------------------------
-- MessageReject object.
-- ------------------------------
type MessageReject_Type is
record
P_Type : Swagger.Nullable_UString;
Reject_Reason : .Models.RejectReason_Type;
Exchange_Id : Swagger.Nullable_UString;
Message : Swagger.Nullable_UString;
Rejected_Message : Swagger.Nullable_UString;
end record;
package MessageReject_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => MessageReject_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in MessageReject_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in MessageReject_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out MessageReject_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out MessageReject_Type_Vectors.Vector);
-- ------------------------------
-- JSON validation error.
-- ------------------------------
type ValidationError_Type is
record
P_Type : Swagger.Nullable_UString;
Title : Swagger.Nullable_UString;
Status : Swagger.Number;
Trace_Id : Swagger.Nullable_UString;
Errors : Swagger.Nullable_UString;
end record;
package ValidationError_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => ValidationError_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in ValidationError_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in ValidationError_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out ValidationError_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out ValidationError_Type_Vectors.Vector);
type OrdType_Type is
record
end record;
package OrdType_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => OrdType_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in OrdType_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in OrdType_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out OrdType_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out OrdType_Type_Vectors.Vector);
type OrdStatus_Type is
record
end record;
package OrdStatus_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => OrdStatus_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in OrdStatus_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in OrdStatus_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out OrdStatus_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out OrdStatus_Type_Vectors.Vector);
type OrderCancelAllRequest_Type is
record
Exchange_Id : Swagger.UString;
end record;
package OrderCancelAllRequest_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => OrderCancelAllRequest_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in OrderCancelAllRequest_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in OrderCancelAllRequest_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out OrderCancelAllRequest_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out OrderCancelAllRequest_Type_Vectors.Vector);
type OrderCancelSingleRequest_Type is
record
Exchange_Id : Swagger.UString;
Exchange_Order_Id : Swagger.Nullable_UString;
Client_Order_Id : Swagger.Nullable_UString;
end record;
package OrderCancelSingleRequest_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => OrderCancelSingleRequest_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in OrderCancelSingleRequest_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in OrderCancelSingleRequest_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out OrderCancelSingleRequest_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out OrderCancelSingleRequest_Type_Vectors.Vector);
type OrdSide_Type is
record
end record;
package OrdSide_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => OrdSide_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in OrdSide_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in OrdSide_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out OrdSide_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out OrdSide_Type_Vectors.Vector);
type TimeInForce_Type is
record
end record;
package TimeInForce_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => TimeInForce_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in TimeInForce_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in TimeInForce_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out TimeInForce_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out TimeInForce_Type_Vectors.Vector);
type OrderNewSingleRequest_Type is
record
Exchange_Id : Swagger.UString;
Client_Order_Id : Swagger.UString;
Symbol_Id_Exchange : Swagger.Nullable_UString;
Symbol_Id_Coinapi : Swagger.Nullable_UString;
Amount_Order : Swagger.Number;
Price : Swagger.Number;
Side : .Models.OrdSide_Type;
Order_Type : .Models.OrdType_Type;
Time_In_Force : .Models.TimeInForce_Type;
Expire_Time : Swagger.Nullable_Date;
Exec_Inst : Swagger.UString_Vectors.Vector;
end record;
package OrderNewSingleRequest_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => OrderNewSingleRequest_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in OrderNewSingleRequest_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in OrderNewSingleRequest_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out OrderNewSingleRequest_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out OrderNewSingleRequest_Type_Vectors.Vector);
-- ------------------------------
-- Relay fill information on working orders.
-- ------------------------------
type Fills_Type is
record
Time : Swagger.Nullable_Date;
Price : Swagger.Number;
Amount : Swagger.Number;
end record;
package Fills_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => Fills_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in Fills_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in Fills_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out Fills_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out Fills_Type_Vectors.Vector);
type OrderExecutionReport_Type is
record
Exchange_Id : Swagger.UString;
Client_Order_Id : Swagger.UString;
Symbol_Id_Exchange : Swagger.Nullable_UString;
Symbol_Id_Coinapi : Swagger.Nullable_UString;
Amount_Order : Swagger.Number;
Price : Swagger.Number;
Side : .Models.OrdSide_Type;
Order_Type : .Models.OrdType_Type;
Time_In_Force : .Models.TimeInForce_Type;
Expire_Time : Swagger.Nullable_Date;
Exec_Inst : Swagger.UString_Vectors.Vector;
Client_Order_Id_Format_Exchange : Swagger.UString;
Exchange_Order_Id : Swagger.Nullable_UString;
Amount_Open : Swagger.Number;
Amount_Filled : Swagger.Number;
Avg_Px : Swagger.Number;
Status : .Models.OrdStatus_Type;
Status_History : Swagger.UString_Vectors.Vector_Vectors.Vector;
Error_Message : Swagger.Nullable_UString;
Fills : .Models.Fills_Type_Vectors.Vector;
end record;
package OrderExecutionReport_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => OrderExecutionReport_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in OrderExecutionReport_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in OrderExecutionReport_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out OrderExecutionReport_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out OrderExecutionReport_Type_Vectors.Vector);
type OrderExecutionReportAllOf_Type is
record
Client_Order_Id_Format_Exchange : Swagger.UString;
Exchange_Order_Id : Swagger.Nullable_UString;
Amount_Open : Swagger.Number;
Amount_Filled : Swagger.Number;
Avg_Px : Swagger.Number;
Status : .Models.OrdStatus_Type;
Status_History : Swagger.UString_Vectors.Vector_Vectors.Vector;
Error_Message : Swagger.Nullable_UString;
Fills : .Models.Fills_Type_Vectors.Vector;
end record;
package OrderExecutionReportAllOf_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => OrderExecutionReportAllOf_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in OrderExecutionReportAllOf_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in OrderExecutionReportAllOf_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out OrderExecutionReportAllOf_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out OrderExecutionReportAllOf_Type_Vectors.Vector);
type BalanceData_Type is
record
Asset_Id_Exchange : Swagger.Nullable_UString;
Asset_Id_Coinapi : Swagger.Nullable_UString;
Balance : float;
Available : float;
Locked : float;
Last_Updated_By : Swagger.Nullable_UString;
Rate_Usd : float;
Traded : float;
end record;
package BalanceData_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => BalanceData_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BalanceData_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in BalanceData_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BalanceData_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out BalanceData_Type_Vectors.Vector);
type Balance_Type is
record
Exchange_Id : Swagger.Nullable_UString;
Data : .Models.BalanceData_Type_Vectors.Vector;
end record;
package Balance_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => Balance_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in Balance_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in Balance_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out Balance_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out Balance_Type_Vectors.Vector);
type Position_Type is
record
Exchange_Id : Swagger.Nullable_UString;
Data : .Models.PositionData_Type_Vectors.Vector;
end record;
package Position_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => Position_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in Position_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in Position_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out Position_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out Position_Type_Vectors.Vector);
type PositionData_Type is
record
Symbol_Id_Exchange : Swagger.Nullable_UString;
Symbol_Id_Coinapi : Swagger.Nullable_UString;
Avg_Entry_Price : Swagger.Number;
Quantity : Swagger.Number;
Side : .Models.OrdSide_Type;
Unrealized_Pnl : Swagger.Number;
Leverage : Swagger.Number;
Cross_Margin : Swagger.Nullable_Boolean;
Liquidation_Price : Swagger.Number;
Raw_Data : Swagger.Object;
end record;
package PositionData_Type_Vectors is
new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => PositionData_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in PositionData_Type);
procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class;
Name : in String;
Value : in PositionData_Type_Vectors.Vector);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out PositionData_Type);
procedure Deserialize (From : in Swagger.Value_Type;
Name : in String;
Value : out PositionData_Type_Vectors.Vector);
end .Models;
| 36.355872 | 247 | 0.582322 |
411cdfcdfe3990367af65d9820d5e3d7238e5cdd | 12,030 | ads | Ada | source/league/ucd/matreshka-internals-unicode-ucd-core_001a.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/league/ucd/matreshka-internals-unicode-ucd-core_001a.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/league/ucd/matreshka-internals-unicode-ucd-core_001a.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Localization, Internationalization, Globalization for Ada --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012-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$
------------------------------------------------------------------------------
pragma Restrictions (No_Elaboration_Code);
-- GNAT: enforce generation of preinitialized data section instead of
-- generation of elaboration code.
package Matreshka.Internals.Unicode.Ucd.Core_001A is
pragma Preelaborate;
Group_001A : aliased constant Core_Second_Stage
:= (16#00# .. 16#16# => -- 1A00 .. 1A16
(Other_Letter, Neutral,
Other, A_Letter, O_Letter, Alphabetic,
(Alphabetic
| Grapheme_Base
| ID_Continue
| ID_Start
| XID_Continue
| XID_Start => True,
others => False)),
16#17# .. 16#18# => -- 1A17 .. 1A18
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Combining_Mark,
(Other_Alphabetic
| Alphabetic
| Case_Ignorable
| Grapheme_Extend
| ID_Continue
| XID_Continue => True,
others => False)),
16#19# .. 16#1A# => -- 1A19 .. 1A1A
(Spacing_Mark, Neutral,
Spacing_Mark, Extend, Extend, Combining_Mark,
(Other_Alphabetic
| Alphabetic
| Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#1B# => -- 1A1B
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Combining_Mark,
(Other_Alphabetic
| Alphabetic
| Case_Ignorable
| Grapheme_Extend
| ID_Continue
| XID_Continue => True,
others => False)),
16#1E# .. 16#1F# => -- 1A1E .. 1A1F
(Other_Punctuation, Neutral,
Other, Other, Other, Alphabetic,
(Grapheme_Base => True,
others => False)),
16#20# .. 16#54# => -- 1A20 .. 1A54
(Other_Letter, Neutral,
Other, Other, O_Letter, Complex_Context,
(Alphabetic
| Grapheme_Base
| ID_Continue
| ID_Start
| XID_Continue
| XID_Start => True,
others => False)),
16#55# => -- 1A55
(Spacing_Mark, Neutral,
Spacing_Mark, Extend, Extend, Complex_Context,
(Other_Alphabetic
| Alphabetic
| Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#56# => -- 1A56
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Complex_Context,
(Other_Alphabetic
| Alphabetic
| Case_Ignorable
| Grapheme_Extend
| ID_Continue
| XID_Continue => True,
others => False)),
16#57# => -- 1A57
(Spacing_Mark, Neutral,
Spacing_Mark, Extend, Extend, Complex_Context,
(Other_Alphabetic
| Alphabetic
| Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#58# .. 16#5E# => -- 1A58 .. 1A5E
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Complex_Context,
(Other_Alphabetic
| Alphabetic
| Case_Ignorable
| Grapheme_Extend
| ID_Continue
| XID_Continue => True,
others => False)),
16#60# => -- 1A60
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Complex_Context,
(Case_Ignorable
| Grapheme_Extend
| Grapheme_Link
| ID_Continue
| XID_Continue => True,
others => False)),
16#61# => -- 1A61
(Spacing_Mark, Neutral,
Other, Extend, Extend, Complex_Context,
(Other_Alphabetic
| Alphabetic
| Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#62# => -- 1A62
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Complex_Context,
(Other_Alphabetic
| Alphabetic
| Case_Ignorable
| Grapheme_Extend
| ID_Continue
| XID_Continue => True,
others => False)),
16#63# .. 16#64# => -- 1A63 .. 1A64
(Spacing_Mark, Neutral,
Other, Extend, Extend, Complex_Context,
(Other_Alphabetic
| Alphabetic
| Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#65# .. 16#6C# => -- 1A65 .. 1A6C
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Complex_Context,
(Other_Alphabetic
| Alphabetic
| Case_Ignorable
| Grapheme_Extend
| ID_Continue
| XID_Continue => True,
others => False)),
16#6D# .. 16#72# => -- 1A6D .. 1A72
(Spacing_Mark, Neutral,
Spacing_Mark, Extend, Extend, Complex_Context,
(Other_Alphabetic
| Alphabetic
| Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#73# .. 16#74# => -- 1A73 .. 1A74
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Complex_Context,
(Other_Alphabetic
| Alphabetic
| Case_Ignorable
| Grapheme_Extend
| ID_Continue
| XID_Continue => True,
others => False)),
16#75# .. 16#7C# => -- 1A75 .. 1A7C
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Complex_Context,
(Diacritic
| Case_Ignorable
| Grapheme_Extend
| ID_Continue
| XID_Continue => True,
others => False)),
16#7F# => -- 1A7F
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Combining_Mark,
(Diacritic
| Case_Ignorable
| Grapheme_Extend
| ID_Continue
| XID_Continue => True,
others => False)),
16#80# .. 16#89# => -- 1A80 .. 1A89
(Decimal_Number, Neutral,
Other, Numeric, Numeric, Numeric,
(Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#90# .. 16#99# => -- 1A90 .. 1A99
(Decimal_Number, Neutral,
Other, Numeric, Numeric, Numeric,
(Grapheme_Base
| ID_Continue
| XID_Continue => True,
others => False)),
16#A0# .. 16#A6# => -- 1AA0 .. 1AA6
(Other_Punctuation, Neutral,
Other, Other, Other, Complex_Context,
(Grapheme_Base => True,
others => False)),
16#A7# => -- 1AA7
(Modifier_Letter, Neutral,
Other, Other, O_Letter, Complex_Context,
(Extender
| Alphabetic
| Case_Ignorable
| Grapheme_Base
| ID_Continue
| ID_Start
| XID_Continue
| XID_Start => True,
others => False)),
16#A8# .. 16#AB# => -- 1AA8 .. 1AAB
(Other_Punctuation, Neutral,
Other, Other, S_Term, Complex_Context,
(STerm
| Terminal_Punctuation
| Grapheme_Base => True,
others => False)),
16#AC# .. 16#AD# => -- 1AAC .. 1AAD
(Other_Punctuation, Neutral,
Other, Other, Other, Complex_Context,
(Grapheme_Base => True,
others => False)),
16#B0# .. 16#BD# => -- 1AB0 .. 1ABD
(Nonspacing_Mark, Neutral,
Extend, Extend, Extend, Combining_Mark,
(Diacritic
| Case_Ignorable
| Grapheme_Extend
| ID_Continue
| XID_Continue => True,
others => False)),
16#BE# => -- 1ABE
(Enclosing_Mark, Neutral,
Extend, Extend, Extend, Combining_Mark,
(Case_Ignorable
| Grapheme_Extend => True,
others => False)),
others =>
(Unassigned, Neutral,
Other, Other, Other, Unknown,
(others => False)));
end Matreshka.Internals.Unicode.Ucd.Core_001A;
| 40.918367 | 78 | 0.450125 |
584d163baa296a0315de3a1ed387e46b2b78c636 | 8,797 | adb | Ada | source/amf/uml/amf-internals-uml_package_merges.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-internals-uml_package_merges.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-internals-uml_package_merges.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.Elements;
with AMF.Internals.Element_Collections;
with AMF.Internals.Helpers;
with AMF.Internals.Tables.UML_Attributes;
with AMF.Visitors.UML_Iterators;
with AMF.Visitors.UML_Visitors;
package body AMF.Internals.UML_Package_Merges is
-------------------
-- Enter_Element --
-------------------
overriding procedure Enter_Element
(Self : not null access constant UML_Package_Merge_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.UML_Visitors.UML_Visitor'Class then
AMF.Visitors.UML_Visitors.UML_Visitor'Class
(Visitor).Enter_Package_Merge
(AMF.UML.Package_Merges.UML_Package_Merge_Access (Self),
Control);
end if;
end Enter_Element;
-------------------
-- Leave_Element --
-------------------
overriding procedure Leave_Element
(Self : not null access constant UML_Package_Merge_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.UML_Visitors.UML_Visitor'Class then
AMF.Visitors.UML_Visitors.UML_Visitor'Class
(Visitor).Leave_Package_Merge
(AMF.UML.Package_Merges.UML_Package_Merge_Access (Self),
Control);
end if;
end Leave_Element;
-------------------
-- Visit_Element --
-------------------
overriding procedure Visit_Element
(Self : not null access constant UML_Package_Merge_Proxy;
Iterator : in out AMF.Visitors.Abstract_Iterator'Class;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Iterator in AMF.Visitors.UML_Iterators.UML_Iterator'Class then
AMF.Visitors.UML_Iterators.UML_Iterator'Class
(Iterator).Visit_Package_Merge
(Visitor,
AMF.UML.Package_Merges.UML_Package_Merge_Access (Self),
Control);
end if;
end Visit_Element;
------------------------
-- Get_Merged_Package --
------------------------
overriding function Get_Merged_Package
(Self : not null access constant UML_Package_Merge_Proxy)
return AMF.UML.Packages.UML_Package_Access is
begin
return
AMF.UML.Packages.UML_Package_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Merged_Package
(Self.Element)));
end Get_Merged_Package;
------------------------
-- Set_Merged_Package --
------------------------
overriding procedure Set_Merged_Package
(Self : not null access UML_Package_Merge_Proxy;
To : AMF.UML.Packages.UML_Package_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Merged_Package
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Merged_Package;
---------------------------
-- Get_Receiving_Package --
---------------------------
overriding function Get_Receiving_Package
(Self : not null access constant UML_Package_Merge_Proxy)
return AMF.UML.Packages.UML_Package_Access is
begin
return
AMF.UML.Packages.UML_Package_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Receiving_Package
(Self.Element)));
end Get_Receiving_Package;
---------------------------
-- Set_Receiving_Package --
---------------------------
overriding procedure Set_Receiving_Package
(Self : not null access UML_Package_Merge_Proxy;
To : AMF.UML.Packages.UML_Package_Access) is
begin
AMF.Internals.Tables.UML_Attributes.Internal_Set_Receiving_Package
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Receiving_Package;
----------------
-- Get_Source --
----------------
overriding function Get_Source
(Self : not null access constant UML_Package_Merge_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element is
begin
return
AMF.UML.Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Source
(Self.Element)));
end Get_Source;
----------------
-- Get_Target --
----------------
overriding function Get_Target
(Self : not null access constant UML_Package_Merge_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element is
begin
return
AMF.UML.Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Target
(Self.Element)));
end Get_Target;
-------------------------
-- Get_Related_Element --
-------------------------
overriding function Get_Related_Element
(Self : not null access constant UML_Package_Merge_Proxy)
return AMF.UML.Elements.Collections.Set_Of_UML_Element is
begin
return
AMF.UML.Elements.Collections.Wrap
(AMF.Internals.Element_Collections.Wrap
(AMF.Internals.Tables.UML_Attributes.Internal_Get_Related_Element
(Self.Element)));
end Get_Related_Element;
end AMF.Internals.UML_Package_Merges;
| 41.890476 | 78 | 0.548937 |
318152ca960da8f90564de47d1f4529bfa2a01a2 | 3,619 | ads | Ada | llvm-gcc-4.2-2.9/gcc/ada/s-imgllu.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 1 | 2016-04-09T02:58:13.000Z | 2016-04-09T02:58:13.000Z | llvm-gcc-4.2-2.9/gcc/ada/s-imgllu.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/s-imgllu.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . I M G _ L L U --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2005 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains the routines for supporting the Image attribute for
-- unsigned (modular) integer types larger than Size Unsigned'Size, and also
-- for conversion operations required in Text_IO.Modular_IO for such types.
with System.Unsigned_Types;
package System.Img_LLU is
pragma Pure;
function Image_Long_Long_Unsigned
(V : System.Unsigned_Types.Long_Long_Unsigned)
return String;
-- Computes Long_Long_Unsigned'Image (V) and returns the result.
procedure Set_Image_Long_Long_Unsigned
(V : System.Unsigned_Types.Long_Long_Unsigned;
S : out String;
P : in out Natural);
-- Sets the image of V starting at S (P + 1) with no leading spaces (i.e.
-- Text_IO format where Width = 0), starting at S (P + 1), updating P
-- to point to the last character stored. The caller promises that the
-- buffer is large enough and no check is made for this (Constraint_Error
-- will not be necessarily raised if this is violated since it is perfectly
-- valid to compile this unit with checks off).
end System.Img_LLU;
| 60.316667 | 79 | 0.504007 |
5832a6ac276b4ec22becafecbc2536c2296a3653 | 5,673 | ads | Ada | awa/plugins/awa-storages/src/awa-storages-beans.ads | Letractively/ada-awa | 3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe | [
"Apache-2.0"
] | null | null | null | awa/plugins/awa-storages/src/awa-storages-beans.ads | Letractively/ada-awa | 3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe | [
"Apache-2.0"
] | null | null | null | awa/plugins/awa-storages/src/awa-storages-beans.ads | Letractively/ada-awa | 3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- awa-storages-beans -- Storage Ada Beans
-- Copyright (C) 2012 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.Unbounded;
with AWA.Storages.Models;
with AWA.Storages.Modules;
with ASF.Parts;
with Util.Beans.Objects;
with Util.Beans.Basic;
package AWA.Storages.Beans is
FOLDER_ID_PARAMETER : constant String := "folderId";
-- ------------------------------
-- Upload Bean
-- ------------------------------
-- The <b>Upload_Bean</b> allows to upload a file in the storage space.
type Upload_Bean is new AWA.Storages.Models.Storage_Ref
and Util.Beans.Basic.Bean with record
Module : AWA.Storages.Modules.Storage_Module_Access := null;
end record;
type Upload_Bean_Access is access all Upload_Bean'Class;
-- Get the value identified by the name.
overriding
function Get_Value (From : in Upload_Bean;
Name : in String) return Util.Beans.Objects.Object;
-- Set the value identified by the name.
overriding
procedure Set_Value (From : in out Upload_Bean;
Name : in String;
Value : in Util.Beans.Objects.Object);
-- Save the uploaded file in the storage service.
-- @method
procedure Save_Part (Bean : in out Upload_Bean;
Part : in ASF.Parts.Part'Class);
-- Upload the file.
-- @method
procedure Upload (Bean : in out Upload_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String);
-- Delete the file.
-- @method
procedure Delete (Bean : in out Upload_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String);
-- ------------------------------
-- Folder Bean
-- ------------------------------
-- The <b>Folder_Bean</b> allows to create or update the folder name.
type Folder_Bean is new AWA.Storages.Models.Storage_Folder_Ref
and Util.Beans.Basic.Bean with record
Module : AWA.Storages.Modules.Storage_Module_Access := null;
end record;
type Folder_Bean_Access is access all Folder_Bean'Class;
-- Get the value identified by the name.
overriding
function Get_Value (From : in Folder_Bean;
Name : in String) return Util.Beans.Objects.Object;
-- Set the value identified by the name.
overriding
procedure Set_Value (From : in out Folder_Bean;
Name : in String;
Value : in Util.Beans.Objects.Object);
-- Create or save the folder.
procedure Save (Bean : in out Folder_Bean;
Outcome : in out Ada.Strings.Unbounded.Unbounded_String);
type Init_Flag is (INIT_FOLDER, INIT_FOLDER_LIST, INIT_FILE_LIST);
type Init_Map is array (Init_Flag) of Boolean;
-- ------------------------------
-- Storage List Bean
-- ------------------------------
-- This bean represents a list of storage files for a given folder.
type Storage_List_Bean is new Util.Beans.Basic.Bean with record
Module : AWA.Storages.Modules.Storage_Module_Access := null;
-- Current folder.
Folder : aliased Folder_Bean;
Folder_Bean : Folder_Bean_Access;
-- List of folders.
Folder_List : aliased AWA.Storages.Models.Folder_Info_List_Bean;
Folder_List_Bean : AWA.Storages.Models.Folder_Info_List_Bean_Access;
-- List of files.
Files_List : aliased AWA.Storages.Models.Storage_Info_List_Bean;
Files_List_Bean : AWA.Storages.Models.Storage_Info_List_Bean_Access;
Init_Flags : aliased Init_Map := (others => False);
Flags : access Init_Map;
end record;
type Storage_List_Bean_Access is access all Storage_List_Bean'Class;
-- Load the folder instance.
procedure Load_Folder (Storage : in Storage_List_Bean);
-- Load the list of folders.
procedure Load_Folders (Storage : in Storage_List_Bean);
-- Load the list of files associated with the current folder.
procedure Load_Files (Storage : in Storage_List_Bean);
overriding
function Get_Value (List : in Storage_List_Bean;
Name : in String) return Util.Beans.Objects.Object;
-- Set the value identified by the name.
overriding
procedure Set_Value (From : in out Storage_List_Bean;
Name : in String;
Value : in Util.Beans.Objects.Object);
-- Create the Folder_List_Bean bean instance.
function Create_Folder_List_Bean (Module : in AWA.Storages.Modules.Storage_Module_Access)
return Util.Beans.Basic.Readonly_Bean_Access;
-- Create the Storage_List_Bean bean instance.
function Create_Storage_List_Bean (Module : in AWA.Storages.Modules.Storage_Module_Access)
return Util.Beans.Basic.Readonly_Bean_Access;
end AWA.Storages.Beans;
| 38.591837 | 93 | 0.628063 |
5827251f3e47487c249c1b04fb56d8f07af8f067 | 2,799 | ads | Ada | tools/scitools/conf/understand/ada/ada12/a-sblcin.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | 1 | 2020-01-20T21:26:46.000Z | 2020-01-20T21:26:46.000Z | tools/scitools/conf/understand/ada/ada12/a-sblcin.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada12/a-sblcin.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- ADA.STRINGS.BOUNDED.LESS_CASE_INSENSITIVE --
-- --
-- S p e c --
-- --
-- Copyright (C) 2011, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
generic
with package Bounded is
new Ada.Strings.Bounded.Generic_Bounded_Length (<>);
function Ada.Strings.Bounded.Less_Case_Insensitive
(Left, Right : Bounded.Bounded_String)
return Boolean;
pragma Preelaborate (Ada.Strings.Bounded.Less_Case_Insensitive);
| 65.093023 | 78 | 0.372633 |
312c321d031c50436bbd661abf054015077245a7 | 1,003 | ads | Ada | software/modules/sensors/magnetometer.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 12 | 2017-06-08T14:19:57.000Z | 2022-03-09T02:48:59.000Z | software/modules/sensors/magnetometer.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 6 | 2017-06-08T13:13:50.000Z | 2020-05-15T09:32:43.000Z | software/modules/sensors/magnetometer.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 3 | 2017-06-30T14:05:06.000Z | 2022-02-17T12:20:45.000Z | with Generic_Sensor;
with Units; use Units;
with Units.Vectors; use Units.Vectors;
package Magnetometer with SPARK_Mode is
subtype Magnetometer_Data_Type is Magnetic_Flux_Density_Vector;
-- is record
-- heading : Heading_Type;
-- magnetic_vector : Magnetic_Flux_Density_Vector;
-- orientation : Orientation_Type;
-- end record;
package Magnetometer_Sensor is new Generic_Sensor(Magnetometer_Data_Type); use Magnetometer_Sensor;
subtype Sample_Type is Magnetometer_Sensor.Sample_Type;
type Magnetometer_Tag is new Magnetometer_Sensor.Sensor_Tag with record
null;
end record;
--overriding
procedure initialize (Self : in out Magnetometer_Tag);
--overriding
procedure read_Measurement(Self : in out Magnetometer_Tag);
--procedure compensateOrientation(Self : Magnetometer_Tag; orientation : Orientation_Type);
--function get_Heading(Self : Magnetometer_Tag) return Heading_Type;
Sensor : Magnetometer_Tag;
end Magnetometer;
| 28.657143 | 102 | 0.764706 |
5813638c46b34c119b1dce583bbd953db4836ce0 | 452 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/address_conversion.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/address_conversion.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/address_conversion.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- { dg-do run }
-- { dg-options "-O2" }
with System.Address_To_Access_Conversions;
procedure address_conversion is
type Integer_type1 is new Integer;
type Integer_type2 is new Integer;
package AA is new System.Address_To_Access_Conversions (Integer_type1);
K1 : Integer_type1;
K2 : Integer_type2;
begin
K1 := 1;
K2 := 2;
AA.To_Pointer(K2'Address).all := K1;
if K2 /= 1 then
raise Program_Error;
end if;
end;
| 18.08 | 74 | 0.681416 |
a127ea5078a04c9a1fa85c4d19b3af3e856b1e68 | 4,646 | adb | Ada | 4-high/gel/applet/demo/models/opengl_model/launch_opengl_model.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2022-01-20T07:13:42.000Z | 2022-01-20T07:13:42.000Z | 4-high/gel/applet/demo/models/opengl_model/launch_opengl_model.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | 4-high/gel/applet/demo/models/opengl_model/launch_opengl_model.adb | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | null | null | null | with
gel.Applet.gui_World,
gel.Window.setup,
gel.Camera,
gel.Forge,
gel.Sprite,
physics.Model,
openGL.Model.any,
openGL.Light,
ada.Calendar,
ada.Text_IO,
ada.Exceptions;
pragma Unreferenced (gel.Window.setup);
procedure launch_opengl_Model
--
-- Shows a human head model imported from a wavefront '.obj' file
-- and a human body model imported from a collada '.dae' file.
--
--
is
use ada.Calendar,
ada.Text_IO,
ada.Exceptions;
the_Applet : constant gel.Applet.gui_World.view := gel.Forge.new_gui_Applet ("openGL Model", 500, 500);
the_human_graphics_Model : constant openGL.Model.any.view
:= openGL.Model.any.new_Model (Model => openGL.to_Asset ("./assets/opengl/model/human.obj"),
Texture => openGL.null_Asset,
Texture_is_lucid => False);
the_human_physics_Model : constant physics.Model.view
:= physics.Model.Forge.new_physics_Model (shape_Info => (Kind => physics.Model.Cube,
half_Extents => (4.0, 1.0, 2.0)),
Mass => 1.0);
the_Human : constant gel.Sprite.view
:= gel.Sprite.forge.new_Sprite (Name => "Clarence",
World => the_Applet.gui_World.all'Access,
at_Site => gel.Math.Origin_3D,
graphics_Model => the_human_graphics_Model,
physics_Model => the_human_physics_Model);
the_cobra_graphics_Model : aliased constant openGL.Model.any.view
:= openGL.Model.any.new_Model (Model => openGL.to_Asset ("./assets/oolite_cobra3.obj"),
Texture => openGL.to_Asset ("./assets/oolite_cobra3_diffuse.png"),
Texture_is_lucid => False);
the_cobra_physics_Model : constant physics.Model.view
:= physics.Model.Forge.new_physics_Model (shape_Info => (Kind => physics.Model.Cube,
half_Extents => (4.0, 1.0, 2.0)),
Mass => 0.0);
the_Cobra : constant gel.Sprite.view
:= gel.Sprite.forge.new_Sprite (Name => "Cobra",
World => the_Applet.gui_World.all'Access,
at_Site => gel.Math.Origin_3D,
graphics_Model => the_cobra_graphics_Model,
physics_Model => the_cobra_physics_Model);
the_Ground : constant gel.Sprite.view := gel.Forge.new_box_Sprite (the_Applet.gui_World,
Mass => 0.0,
Size => (50.0, 1.0, 50.0));
next_render_Time : ada.calendar.Time;
begin
the_Applet.gui_World.Gravity_is ((0.0, -9.8, 0.0));
the_Applet.gui_World.add (the_Ground); -- Add ground.
the_Applet.gui_World.add (the_Human); -- Add human.
the_Human.Site_is ((0.0, 5.0, 0.0)); --
-- the_Applet.gui_World.add (the_Cobra); -- Add cobra.
-- the_Cobra.Site_is ((0.0, 5.0, 0.0)); --
the_Applet.gui_Camera.Site_is ((0.0, 1.5, 2.6)); -- Position the camera.
-- the_Applet.gui_Camera.Site_is ((0.0, 100.0, 0.0)); -- Position the camera.
the_Applet.enable_simple_Dolly (in_World => 1); -- Enable user camera control via keyboards.
the_Applet.Dolly.Speed_is (0.1); -- Slow down the rate at which the dolly moves.
-- the_Applet.Dolly.Speed_is (0.5); -- Slow down the rate at which the dolly moves.
-- Set the lights position.
--
declare
Light : openGL.Light.item := the_Applet.Renderer.new_Light;
begin
Light.Site_is ((0.0, 1000.0, 1000.0));
the_Applet.Renderer.set (Light);
end;
next_render_Time := ada.Calendar.clock;
while the_Applet.is_open
loop
the_Applet.freshen; -- Evolve the world, handle any new events and update the display.
next_render_Time := next_render_Time + 1.0/60.0;
delay until next_render_Time;
end loop;
the_Applet.destroy;
exception
when E : others =>
put_Line (Exception_Information (E));
end launch_opengl_Model;
| 38.716667 | 121 | 0.528196 |
5821707ea0c03ebae4e65201c3271098c69e2c8f | 5,007 | ads | Ada | samples/client/petstore/ada/src/client/samples-petstore-clients.ads | laboutiqueofficielle/swagger-codegen | 44cf211917f48f2401434c3e7552b53c03d09b08 | [
"Apache-2.0"
] | null | null | null | samples/client/petstore/ada/src/client/samples-petstore-clients.ads | laboutiqueofficielle/swagger-codegen | 44cf211917f48f2401434c3e7552b53c03d09b08 | [
"Apache-2.0"
] | 2 | 2021-12-16T09:59:46.000Z | 2021-12-16T09:59:48.000Z | samples/client/petstore/ada/src/client/samples-petstore-clients.ads | laboutiqueofficielle/swagger-codegen | 44cf211917f48f2401434c3e7552b53c03d09b08 | [
"Apache-2.0"
] | null | null | null | -- Swagger Petstore
-- This is a sample server Petstore server. You can find out more about Swagger at [http://swagger.io](http://swagger.io) or on [irc.freenode.net, #swagger](http://swagger.io/irc/). For this sample, you can use the api key `special_key` to test the authorization filters.
--
-- OpenAPI spec version: 1.0.0
-- Contact: [email protected]
--
-- NOTE: This package is auto generated by the swagger code generator 2.3.0-SNAPSHOT.
-- https://github.com/swagger-api/swagger-codegen.git
-- Do not edit the class manually.
with Samples.Petstore.Models;
with Swagger.Clients;
package Samples.Petstore.Clients is
type Client_Type is new Swagger.Clients.Client_Type with null record;
-- Add a new pet to the store
procedure Add_Pet
(Client : in out Client_Type;
P_Body : in Samples.Petstore.Models.Pet_Type);
-- Deletes a pet
procedure Delete_Pet
(Client : in out Client_Type;
Pet_Id : in Swagger.Long;
Api_Key : in Swagger.Nullable_UString);
-- Finds Pets by status
-- Multiple status values can be provided with comma separated strings
procedure Find_Pets_By_Status
(Client : in out Client_Type;
Status : in Swagger.Nullable_UString_Vectors.Vector;
Result : out Samples.Petstore.Models.Pet_Type_Vectors.Vector);
-- Finds Pets by tags
-- Multiple tags can be provided with comma separated strings. Use tag1, tag2, tag3 for testing.
procedure Find_Pets_By_Tags
(Client : in out Client_Type;
Tags : in Swagger.Nullable_UString_Vectors.Vector;
Result : out Samples.Petstore.Models.Pet_Type_Vectors.Vector);
-- Find pet by ID
-- Returns a single pet
procedure Get_Pet_By_Id
(Client : in out Client_Type;
Pet_Id : in Swagger.Long;
Result : out Samples.Petstore.Models.Pet_Type);
-- Update an existing pet
procedure Update_Pet
(Client : in out Client_Type;
P_Body : in Samples.Petstore.Models.Pet_Type);
-- Updates a pet in the store with form data
procedure Update_Pet_With_Form
(Client : in out Client_Type;
Pet_Id : in Swagger.Long;
Name : in Swagger.Nullable_UString;
Status : in Swagger.Nullable_UString);
-- uploads an image
procedure Upload_File
(Client : in out Client_Type;
Pet_Id : in Swagger.Long;
Additional_Metadata : in Swagger.Nullable_UString;
File : in Swagger.File_Part_Type;
Result : out Samples.Petstore.Models.ApiResponse_Type);
-- Delete purchase order by ID
-- For valid response try integer IDs with value < 1000. Anything above 1000 or nonintegers will generate API errors
procedure Delete_Order
(Client : in out Client_Type;
Order_Id : in Swagger.UString);
-- Returns pet inventories by status
-- Returns a map of status codes to quantities
procedure Get_Inventory
(Client : in out Client_Type;
Result : out Swagger.Nullable_Integer_Map);
-- Find purchase order by ID
-- For valid response try integer IDs with value <= 5 or > 10. Other values will generated exceptions
procedure Get_Order_By_Id
(Client : in out Client_Type;
Order_Id : in Swagger.Long;
Result : out Samples.Petstore.Models.Order_Type);
-- Place an order for a pet
procedure Place_Order
(Client : in out Client_Type;
P_Body : in Samples.Petstore.Models.Order_Type;
Result : out Samples.Petstore.Models.Order_Type);
-- Create user
-- This can only be done by the logged in user.
procedure Create_User
(Client : in out Client_Type;
P_Body : in Samples.Petstore.Models.User_Type);
-- Creates list of users with given input array
procedure Create_Users_With_Array_Input
(Client : in out Client_Type;
P_Body : in Samples.Petstore.Models.User_Type_Vectors.Vector);
-- Creates list of users with given input array
procedure Create_Users_With_List_Input
(Client : in out Client_Type;
P_Body : in Samples.Petstore.Models.User_Type_Vectors.Vector);
-- Delete user
-- This can only be done by the logged in user.
procedure Delete_User
(Client : in out Client_Type;
Username : in Swagger.UString);
-- Get user by user name
procedure Get_User_By_Name
(Client : in out Client_Type;
Username : in Swagger.UString;
Result : out Samples.Petstore.Models.User_Type);
-- Logs user into the system
procedure Login_User
(Client : in out Client_Type;
Username : in Swagger.UString;
Password : in Swagger.UString;
Result : out Swagger.UString);
-- Logs out current logged in user session
procedure Logout_User
(Client : in out Client_Type);
-- Updated user
-- This can only be done by the logged in user.
procedure Update_User
(Client : in out Client_Type;
Username : in Swagger.UString;
P_Body : in Samples.Petstore.Models.User_Type);
end Samples.Petstore.Clients;
| 35.764286 | 274 | 0.693629 |
57231bdccf31a37fcfdcc79f29d5d32f25fdb309 | 1,679 | ads | Ada | tier-1/xcb/source/thin/xcb-xcb_glx_get_tex_envfv_request_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 2 | 2015-11-12T11:16:20.000Z | 2021-08-24T22:32:04.000Z | tier-1/xcb/source/thin/xcb-xcb_glx_get_tex_envfv_request_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 1 | 2018-06-05T05:19:35.000Z | 2021-11-20T01:13:23.000Z | tier-1/xcb/source/thin/xcb-xcb_glx_get_tex_envfv_request_t.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | null | null | null | -- This file is generated by SWIG. Please do not modify by hand.
--
with Interfaces;
with Interfaces.C;
with Interfaces.C.Pointers;
package xcb.xcb_glx_get_tex_envfv_request_t is
-- Item
--
type Item is record
major_opcode : aliased Interfaces.Unsigned_8;
minor_opcode : aliased Interfaces.Unsigned_8;
length : aliased Interfaces.Unsigned_16;
context_tag : aliased xcb.xcb_glx_context_tag_t;
target : aliased Interfaces.Unsigned_32;
pname : aliased Interfaces.Unsigned_32;
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_glx_get_tex_envfv_request_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_get_tex_envfv_request_t.Item,
Element_Array => xcb.xcb_glx_get_tex_envfv_request_t.Item_Array,
Default_Terminator => (others => <>));
subtype Pointer is C_Pointers.Pointer;
-- Pointer_Array
--
type Pointer_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_glx_get_tex_envfv_request_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_get_tex_envfv_request_t.Pointer,
Element_Array => xcb.xcb_glx_get_tex_envfv_request_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_glx_get_tex_envfv_request_t;
| 28.948276 | 78 | 0.674806 |
58d0ffa5e5b8478ab028526b291cb7d99ff25041 | 16,845 | ads | Ada | awa/plugins/awa-tags/src/model/awa-tags-models.ads | Letractively/ada-awa | 3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe | [
"Apache-2.0"
] | null | null | null | awa/plugins/awa-tags/src/model/awa-tags-models.ads | Letractively/ada-awa | 3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe | [
"Apache-2.0"
] | null | null | null | awa/plugins/awa-tags/src/model/awa-tags-models.ads | Letractively/ada-awa | 3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- AWA.Tags.Models -- AWA.Tags.Models
-----------------------------------------------------------------------
-- File generated by ada-gen DO NOT MODIFY
-- Template used: templates/model/package-spec.xhtml
-- Ada Generator: https://ada-gen.googlecode.com/svn/trunk Revision 1095
-----------------------------------------------------------------------
-- Copyright (C) 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.
-----------------------------------------------------------------------
pragma Warnings (Off, "unit * is not referenced");
with ADO.Sessions;
with ADO.Objects;
with ADO.Statements;
with ADO.SQL;
with ADO.Schemas;
with ADO.Queries;
with ADO.Queries.Loaders;
with Ada.Containers.Vectors;
with Ada.Strings.Unbounded;
with Util.Beans.Objects;
with Util.Beans.Basic.Lists;
pragma Warnings (On, "unit * is not referenced");
package AWA.Tags.Models is
type Tag_Ref is new ADO.Objects.Object_Ref with null record;
type Tagged_Entity_Ref is new ADO.Objects.Object_Ref with null record;
-- --------------------
-- The tag definition.
-- --------------------
-- Create an object key for Tag.
function Tag_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key;
-- Create an object key for Tag from a string.
-- Raises Constraint_Error if the string cannot be converted into the object key.
function Tag_Key (Id : in String) return ADO.Objects.Object_Key;
Null_Tag : constant Tag_Ref;
function "=" (Left, Right : Tag_Ref'Class) return Boolean;
-- Set the tag identifier
procedure Set_Id (Object : in out Tag_Ref;
Value : in ADO.Identifier);
-- Get the tag identifier
function Get_Id (Object : in Tag_Ref)
return ADO.Identifier;
-- Set the tag name
procedure Set_Name (Object : in out Tag_Ref;
Value : in Ada.Strings.Unbounded.Unbounded_String);
procedure Set_Name (Object : in out Tag_Ref;
Value : in String);
-- Get the tag name
function Get_Name (Object : in Tag_Ref)
return Ada.Strings.Unbounded.Unbounded_String;
function Get_Name (Object : in Tag_Ref)
return String;
-- Load the entity identified by 'Id'.
-- Raises the NOT_FOUND exception if it does not exist.
procedure Load (Object : in out Tag_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier);
-- Load the entity identified by 'Id'.
-- Returns True in <b>Found</b> if the object was found and False if it does not exist.
procedure Load (Object : in out Tag_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier;
Found : out Boolean);
-- Find and load the entity.
overriding
procedure Find (Object : in out Tag_Ref;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean);
-- Save the entity. If the entity does not have an identifier, an identifier is allocated
-- and it is inserted in the table. Otherwise, only data fields which have been changed
-- are updated.
overriding
procedure Save (Object : in out Tag_Ref;
Session : in out ADO.Sessions.Master_Session'Class);
-- Delete the entity.
overriding
procedure Delete (Object : in out Tag_Ref;
Session : in out ADO.Sessions.Master_Session'Class);
overriding
function Get_Value (From : in Tag_Ref;
Name : in String) return Util.Beans.Objects.Object;
-- Table definition
TAG_TABLE : constant ADO.Schemas.Class_Mapping_Access;
-- Internal method to allocate the Object_Record instance
overriding
procedure Allocate (Object : in out Tag_Ref);
-- Copy of the object.
procedure Copy (Object : in Tag_Ref;
Into : in out Tag_Ref);
package Tag_Vectors is
new Ada.Containers.Vectors (Index_Type => Natural,
Element_Type => Tag_Ref,
"=" => "=");
subtype Tag_Vector is Tag_Vectors.Vector;
procedure List (Object : in out Tag_Vector;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class);
-- Create an object key for Tagged_Entity.
function Tagged_Entity_Key (Id : in ADO.Identifier) return ADO.Objects.Object_Key;
-- Create an object key for Tagged_Entity from a string.
-- Raises Constraint_Error if the string cannot be converted into the object key.
function Tagged_Entity_Key (Id : in String) return ADO.Objects.Object_Key;
Null_Tagged_Entity : constant Tagged_Entity_Ref;
function "=" (Left, Right : Tagged_Entity_Ref'Class) return Boolean;
-- Set the tag entity identifier
procedure Set_Id (Object : in out Tagged_Entity_Ref;
Value : in ADO.Identifier);
-- Get the tag entity identifier
function Get_Id (Object : in Tagged_Entity_Ref)
return ADO.Identifier;
-- Set Title: Tag model
-- Date: 2013-02-23the database entity to which the tag is associated
procedure Set_For_Entity_Id (Object : in out Tagged_Entity_Ref;
Value : in ADO.Identifier);
-- Get Title: Tag model
-- Date: 2013-02-23the database entity to which the tag is associated
function Get_For_Entity_Id (Object : in Tagged_Entity_Ref)
return ADO.Identifier;
-- Set the entity type
procedure Set_Entity_Type (Object : in out Tagged_Entity_Ref;
Value : in ADO.Entity_Type);
-- Get the entity type
function Get_Entity_Type (Object : in Tagged_Entity_Ref)
return ADO.Entity_Type;
--
procedure Set_Tag (Object : in out Tagged_Entity_Ref;
Value : in AWA.Tags.Models.Tag_Ref'Class);
--
function Get_Tag (Object : in Tagged_Entity_Ref)
return AWA.Tags.Models.Tag_Ref'Class;
-- Load the entity identified by 'Id'.
-- Raises the NOT_FOUND exception if it does not exist.
procedure Load (Object : in out Tagged_Entity_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier);
-- Load the entity identified by 'Id'.
-- Returns True in <b>Found</b> if the object was found and False if it does not exist.
procedure Load (Object : in out Tagged_Entity_Ref;
Session : in out ADO.Sessions.Session'Class;
Id : in ADO.Identifier;
Found : out Boolean);
-- Find and load the entity.
overriding
procedure Find (Object : in out Tagged_Entity_Ref;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean);
-- Save the entity. If the entity does not have an identifier, an identifier is allocated
-- and it is inserted in the table. Otherwise, only data fields which have been changed
-- are updated.
overriding
procedure Save (Object : in out Tagged_Entity_Ref;
Session : in out ADO.Sessions.Master_Session'Class);
-- Delete the entity.
overriding
procedure Delete (Object : in out Tagged_Entity_Ref;
Session : in out ADO.Sessions.Master_Session'Class);
overriding
function Get_Value (From : in Tagged_Entity_Ref;
Name : in String) return Util.Beans.Objects.Object;
-- Table definition
TAGGED_ENTITY_TABLE : constant ADO.Schemas.Class_Mapping_Access;
-- Internal method to allocate the Object_Record instance
overriding
procedure Allocate (Object : in out Tagged_Entity_Ref);
-- Copy of the object.
procedure Copy (Object : in Tagged_Entity_Ref;
Into : in out Tagged_Entity_Ref);
package Tagged_Entity_Vectors is
new Ada.Containers.Vectors (Index_Type => Natural,
Element_Type => Tagged_Entity_Ref,
"=" => "=");
subtype Tagged_Entity_Vector is Tagged_Entity_Vectors.Vector;
procedure List (Object : in out Tagged_Entity_Vector;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class);
-- --------------------
-- The tag information.
-- --------------------
type Tag_Info is new Util.Beans.Basic.Readonly_Bean with record
-- the tag name.
Tag : Ada.Strings.Unbounded.Unbounded_String;
-- the number of references for the tag.
Count : Natural;
end record;
-- Get the bean attribute identified by the given name.
overriding
function Get_Value (From : in Tag_Info;
Name : in String) return Util.Beans.Objects.Object;
package Tag_Info_Beans is
new Util.Beans.Basic.Lists (Element_Type => Tag_Info);
package Tag_Info_Vectors renames Tag_Info_Beans.Vectors;
subtype Tag_Info_List_Bean is Tag_Info_Beans.List_Bean;
type Tag_Info_List_Bean_Access is access all Tag_Info_List_Bean;
-- Run the query controlled by <b>Context</b> and append the list in <b>Object</b>.
procedure List (Object : in out Tag_Info_List_Bean'Class;
Session : in out ADO.Sessions.Session'Class;
Context : in out ADO.Queries.Context'Class);
subtype Tag_Info_Vector is Tag_Info_Vectors.Vector;
-- Run the query controlled by <b>Context</b> and append the list in <b>Object</b>.
procedure List (Object : in out Tag_Info_Vector;
Session : in out ADO.Sessions.Session'Class;
Context : in out ADO.Queries.Context'Class);
Query_Check_Tag : constant ADO.Queries.Query_Definition_Access;
Query_Tag_List : constant ADO.Queries.Query_Definition_Access;
Query_Tag_Search : constant ADO.Queries.Query_Definition_Access;
Query_Tag_List_All : constant ADO.Queries.Query_Definition_Access;
Query_Tag_List_For_Entities : constant ADO.Queries.Query_Definition_Access;
private
TAG_NAME : aliased constant String := "awa_tag";
COL_0_1_NAME : aliased constant String := "id";
COL_1_1_NAME : aliased constant String := "name";
TAG_DEF : aliased constant ADO.Schemas.Class_Mapping :=
(Count => 2,
Table => TAG_NAME'Access,
Members => (
1 => COL_0_1_NAME'Access,
2 => COL_1_1_NAME'Access
)
);
TAG_TABLE : constant ADO.Schemas.Class_Mapping_Access
:= TAG_DEF'Access;
Null_Tag : constant Tag_Ref
:= Tag_Ref'(ADO.Objects.Object_Ref with others => <>);
type Tag_Impl is
new ADO.Objects.Object_Record (Key_Type => ADO.Objects.KEY_INTEGER,
Of_Class => TAG_DEF'Access)
with record
Name : Ada.Strings.Unbounded.Unbounded_String;
end record;
type Tag_Access is access all Tag_Impl;
overriding
procedure Destroy (Object : access Tag_Impl);
overriding
procedure Find (Object : in out Tag_Impl;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean);
overriding
procedure Load (Object : in out Tag_Impl;
Session : in out ADO.Sessions.Session'Class);
procedure Load (Object : in out Tag_Impl;
Stmt : in out ADO.Statements.Query_Statement'Class;
Session : in out ADO.Sessions.Session'Class);
overriding
procedure Save (Object : in out Tag_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
procedure Create (Object : in out Tag_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
overriding
procedure Delete (Object : in out Tag_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
procedure Set_Field (Object : in out Tag_Ref'Class;
Impl : out Tag_Access);
TAGGED_ENTITY_NAME : aliased constant String := "awa_tagged_entity";
COL_0_2_NAME : aliased constant String := "id";
COL_1_2_NAME : aliased constant String := "for_entity_id";
COL_2_2_NAME : aliased constant String := "entity_type";
COL_3_2_NAME : aliased constant String := "tag_id";
TAGGED_ENTITY_DEF : aliased constant ADO.Schemas.Class_Mapping :=
(Count => 4,
Table => TAGGED_ENTITY_NAME'Access,
Members => (
1 => COL_0_2_NAME'Access,
2 => COL_1_2_NAME'Access,
3 => COL_2_2_NAME'Access,
4 => COL_3_2_NAME'Access
)
);
TAGGED_ENTITY_TABLE : constant ADO.Schemas.Class_Mapping_Access
:= TAGGED_ENTITY_DEF'Access;
Null_Tagged_Entity : constant Tagged_Entity_Ref
:= Tagged_Entity_Ref'(ADO.Objects.Object_Ref with others => <>);
type Tagged_Entity_Impl is
new ADO.Objects.Object_Record (Key_Type => ADO.Objects.KEY_INTEGER,
Of_Class => TAGGED_ENTITY_DEF'Access)
with record
For_Entity_Id : ADO.Identifier;
Entity_Type : ADO.Entity_Type;
Tag : AWA.Tags.Models.Tag_Ref;
end record;
type Tagged_Entity_Access is access all Tagged_Entity_Impl;
overriding
procedure Destroy (Object : access Tagged_Entity_Impl);
overriding
procedure Find (Object : in out Tagged_Entity_Impl;
Session : in out ADO.Sessions.Session'Class;
Query : in ADO.SQL.Query'Class;
Found : out Boolean);
overriding
procedure Load (Object : in out Tagged_Entity_Impl;
Session : in out ADO.Sessions.Session'Class);
procedure Load (Object : in out Tagged_Entity_Impl;
Stmt : in out ADO.Statements.Query_Statement'Class;
Session : in out ADO.Sessions.Session'Class);
overriding
procedure Save (Object : in out Tagged_Entity_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
procedure Create (Object : in out Tagged_Entity_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
overriding
procedure Delete (Object : in out Tagged_Entity_Impl;
Session : in out ADO.Sessions.Master_Session'Class);
procedure Set_Field (Object : in out Tagged_Entity_Ref'Class;
Impl : out Tagged_Entity_Access);
package File_1 is
new ADO.Queries.Loaders.File (Path => "tag-queries.xml",
Sha1 => "BFA439EF20901C425F86DB33AD8870BADB46FBEB");
package Def_Taginfo_Check_Tag is
new ADO.Queries.Loaders.Query (Name => "check-tag",
File => File_1.File'Access);
Query_Check_Tag : constant ADO.Queries.Query_Definition_Access
:= Def_Taginfo_Check_Tag.Query'Access;
package Def_Taginfo_Tag_List is
new ADO.Queries.Loaders.Query (Name => "tag-list",
File => File_1.File'Access);
Query_Tag_List : constant ADO.Queries.Query_Definition_Access
:= Def_Taginfo_Tag_List.Query'Access;
package Def_Taginfo_Tag_Search is
new ADO.Queries.Loaders.Query (Name => "tag-search",
File => File_1.File'Access);
Query_Tag_Search : constant ADO.Queries.Query_Definition_Access
:= Def_Taginfo_Tag_Search.Query'Access;
package Def_Taginfo_Tag_List_All is
new ADO.Queries.Loaders.Query (Name => "tag-list-all",
File => File_1.File'Access);
Query_Tag_List_All : constant ADO.Queries.Query_Definition_Access
:= Def_Taginfo_Tag_List_All.Query'Access;
package Def_Taginfo_Tag_List_For_Entities is
new ADO.Queries.Loaders.Query (Name => "tag-list-for-entities",
File => File_1.File'Access);
Query_Tag_List_For_Entities : constant ADO.Queries.Query_Definition_Access
:= Def_Taginfo_Tag_List_For_Entities.Query'Access;
end AWA.Tags.Models;
| 39.083527 | 94 | 0.632532 |
12e380804c949afca875017e6f823845bba80ef7 | 423 | ads | Ada | Sources/Globe_3d/globe_3d-portals.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | 1 | 2019-09-21T09:40:34.000Z | 2019-09-21T09:40:34.000Z | Sources/Globe_3d/globe_3d-portals.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | null | null | null | Sources/Globe_3d/globe_3d-portals.ads | ForYouEyesOnly/Space-Convoy | be4904f6a02695f7c4c5c3c965f4871cd3250003 | [
"MIT"
] | 1 | 2019-09-25T12:29:27.000Z | 2019-09-25T12:29:27.000Z | package GLOBE_3D.Portals is
-- Methods provided for clipping through screen rectangles
procedure Intersect (A, B : Rectangle; C : out Rectangle; non_empty : out Boolean);
procedure Find_bounding_box (
o : Object_3D'Class;
face : Positive;
b : out Rectangle;
success : out Boolean
);
procedure Draw_boundary (main, clip : Rectangle);
end GLOBE_3D.Portals;
| 24.882353 | 86 | 0.647754 |
57f3d487c373c41f2c4226c9b8d1ca8096c839aa | 982 | ads | Ada | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/array_ptr_renaming/pack.ads | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 31 | 2018-08-01T21:25:24.000Z | 2022-02-14T07:52:34.000Z | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/array_ptr_renaming/pack.ads | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 40 | 2018-12-03T19:48:52.000Z | 2021-03-10T06:34:26.000Z | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/array_ptr_renaming/pack.ads | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 20 | 2018-11-16T21:19:22.000Z | 2021-10-18T23:08:24.000Z | -- Copyright 2015-2019 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package Pack is
type Table_Type is
array (Natural range <>) of Integer;
type Table_Ptr_Type is access all Table_Type;
Table : Table_Type := (1 => 10, 2 => 20);
Table_Ptr : aliased Table_Ptr_Type := new Table_Type'(3 => 30, 4 => 40);
end Pack;
| 37.769231 | 75 | 0.711813 |
2f76d639b7c1d3471b0b97e652b2e2ff50deed06 | 32,149 | adb | Ada | llvm-gcc-4.2-2.9/gcc/ada/exp_imgv.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/exp_imgv.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/exp_imgv.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- E X P _ I M G V --
-- --
-- B o d y --
-- --
-- Copyright (C) 2001-2005, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Atree; use Atree;
with Casing; use Casing;
with Checks; use Checks;
with Einfo; use Einfo;
with Exp_Util; use Exp_Util;
with Namet; use Namet;
with Nmake; use Nmake;
with Nlists; use Nlists;
with Opt; use Opt;
with Rtsfind; use Rtsfind;
with Sem_Res; use Sem_Res;
with Sinfo; use Sinfo;
with Snames; use Snames;
with Stand; use Stand;
with Stringt; use Stringt;
with Tbuild; use Tbuild;
with Ttypes; use Ttypes;
with Uintp; use Uintp;
package body Exp_Imgv is
------------------------------------
-- Build_Enumeration_Image_Tables --
------------------------------------
procedure Build_Enumeration_Image_Tables (E : Entity_Id; N : Node_Id) is
Loc : constant Source_Ptr := Sloc (E);
Str : String_Id;
Ind : List_Id;
Lit : Entity_Id;
Nlit : Nat;
Len : Nat;
Estr : Entity_Id;
Eind : Entity_Id;
Ityp : Node_Id;
begin
-- Nothing to do for other than a root enumeration type
if E /= Root_Type (E) then
return;
-- Nothing to do if pragma Discard_Names applies
elsif Discard_Names (E) then
return;
end if;
-- Otherwise tables need constructing
Start_String;
Ind := New_List;
Lit := First_Literal (E);
Len := 1;
Nlit := 0;
loop
Append_To (Ind,
Make_Integer_Literal (Loc, UI_From_Int (Len)));
exit when No (Lit);
Nlit := Nlit + 1;
Get_Unqualified_Decoded_Name_String (Chars (Lit));
if Name_Buffer (1) /= ''' then
Set_Casing (All_Upper_Case);
end if;
Store_String_Chars (Name_Buffer (1 .. Name_Len));
Len := Len + Int (Name_Len);
Next_Literal (Lit);
end loop;
if Len < Int (2 ** (8 - 1)) then
Ityp := Standard_Integer_8;
elsif Len < Int (2 ** (16 - 1)) then
Ityp := Standard_Integer_16;
else
Ityp := Standard_Integer_32;
end if;
Str := End_String;
Estr :=
Make_Defining_Identifier (Loc,
Chars => New_External_Name (Chars (E), 'S'));
Eind :=
Make_Defining_Identifier (Loc,
Chars => New_External_Name (Chars (E), 'N'));
Set_Lit_Strings (E, Estr);
Set_Lit_Indexes (E, Eind);
Insert_Actions (N,
New_List (
Make_Object_Declaration (Loc,
Defining_Identifier => Estr,
Constant_Present => True,
Object_Definition =>
New_Occurrence_Of (Standard_String, Loc),
Expression =>
Make_String_Literal (Loc,
Strval => Str)),
Make_Object_Declaration (Loc,
Defining_Identifier => Eind,
Constant_Present => True,
Object_Definition =>
Make_Constrained_Array_Definition (Loc,
Discrete_Subtype_Definitions => New_List (
Make_Range (Loc,
Low_Bound => Make_Integer_Literal (Loc, 0),
High_Bound => Make_Integer_Literal (Loc, Nlit))),
Component_Definition =>
Make_Component_Definition (Loc,
Aliased_Present => False,
Subtype_Indication => New_Occurrence_Of (Ityp, Loc))),
Expression =>
Make_Aggregate (Loc,
Expressions => Ind))),
Suppress => All_Checks);
end Build_Enumeration_Image_Tables;
----------------------------
-- Expand_Image_Attribute --
----------------------------
-- For all non-enumeration types, and for enumeration types declared
-- in packages Standard or System, typ'Image (Val) expands into:
-- Image_xx (tp (Expr) [, pm])
-- The name xx and type conversion tp (Expr) (called tv below) depend on
-- the root type of Expr. The argument pm is an extra type dependent
-- parameter only used in some cases as follows:
-- For types whose root type is Character
-- xx = Character
-- tv = Character (Expr)
-- For types whose root type is Boolean
-- xx = Boolean
-- tv = Boolean (Expr)
-- For signed integer types with size <= Integer'Size
-- xx = Integer
-- tv = Integer (Expr)
-- For other signed integer types
-- xx = Long_Long_Integer
-- tv = Long_Long_Integer (Expr)
-- For modular types with modulus <= System.Unsigned_Types.Unsigned
-- xx = Unsigned
-- tv = System.Unsigned_Types.Unsigned (Expr)
-- For other modular integer types
-- xx = Long_Long_Unsigned
-- tv = System.Unsigned_Types.Long_Long_Unsigned (Expr)
-- For types whose root type is Wide_Character
-- xx = Wide_Character
-- tv = Wide_Character (Expr)
-- pm = Boolean, true if Ada 2005 mode, False otherwise
-- For types whose root type is Wide_Wide_Character
-- xx = Wide_Wide_haracter
-- tv = Wide_Wide_Character (Expr)
-- For floating-point types
-- xx = Floating_Point
-- tv = Long_Long_Float (Expr)
-- pm = typ'Digits
-- For ordinary fixed-point types
-- xx = Ordinary_Fixed_Point
-- tv = Long_Long_Float (Expr)
-- pm = typ'Aft
-- For decimal fixed-point types with size = Integer'Size
-- xx = Decimal
-- tv = Integer (Expr)
-- pm = typ'Scale
-- For decimal fixed-point types with size > Integer'Size
-- xx = Long_Long_Decimal
-- tv = Long_Long_Integer (Expr)
-- pm = typ'Scale
-- Note: for the decimal fixed-point type cases, the conversion is
-- done literally without scaling (i.e. the actual expression that
-- is generated is Image_xx (tp?(Expr) [, pm])
-- For enumeration types other than those declared packages Standard
-- or System, typ'Image (X) expands into:
-- Image_Enumeration_NN (typ'Pos (X), typS, typI'Address)
-- where typS and typI are the entities constructed as described in
-- the spec for the procedure Build_Enumeration_Image_Tables and NN
-- is 32/16/8 depending on the element type of Lit_Indexes.
procedure Expand_Image_Attribute (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Exprs : constant List_Id := Expressions (N);
Pref : constant Node_Id := Prefix (N);
Ptyp : constant Entity_Id := Entity (Pref);
Rtyp : constant Entity_Id := Root_Type (Ptyp);
Expr : constant Node_Id := Relocate_Node (First (Exprs));
Imid : RE_Id;
Tent : Entity_Id;
Arglist : List_Id;
Func : RE_Id;
Ttyp : Entity_Id;
Func_Ent : Entity_Id;
begin
if Rtyp = Standard_Boolean then
Imid := RE_Image_Boolean;
Tent := Rtyp;
elsif Rtyp = Standard_Character then
Imid := RE_Image_Character;
Tent := Rtyp;
elsif Rtyp = Standard_Wide_Character then
Imid := RE_Image_Wide_Character;
Tent := Rtyp;
elsif Rtyp = Standard_Wide_Wide_Character then
Imid := RE_Image_Wide_Wide_Character;
Tent := Rtyp;
elsif Is_Signed_Integer_Type (Rtyp) then
if Esize (Rtyp) <= Esize (Standard_Integer) then
Imid := RE_Image_Integer;
Tent := Standard_Integer;
else
Imid := RE_Image_Long_Long_Integer;
Tent := Standard_Long_Long_Integer;
end if;
elsif Is_Modular_Integer_Type (Rtyp) then
if Modulus (Rtyp) <= Modulus (RTE (RE_Unsigned)) then
Imid := RE_Image_Unsigned;
Tent := RTE (RE_Unsigned);
else
Imid := RE_Image_Long_Long_Unsigned;
Tent := RTE (RE_Long_Long_Unsigned);
end if;
elsif Is_Decimal_Fixed_Point_Type (Rtyp) then
if UI_To_Int (Esize (Rtyp)) <= Standard_Integer_Size then
Imid := RE_Image_Decimal;
Tent := Standard_Integer;
else
Imid := RE_Image_Long_Long_Decimal;
Tent := Standard_Long_Long_Integer;
end if;
elsif Is_Ordinary_Fixed_Point_Type (Rtyp) then
Imid := RE_Image_Ordinary_Fixed_Point;
Tent := Standard_Long_Long_Float;
elsif Is_Floating_Point_Type (Rtyp) then
Imid := RE_Image_Floating_Point;
Tent := Standard_Long_Long_Float;
-- Only other possibility is user defined enumeration type
else
if Discard_Names (First_Subtype (Ptyp))
or else No (Lit_Strings (Root_Type (Ptyp)))
then
-- When pragma Discard_Names applies to the first subtype,
-- then build (Pref'Pos)'Img.
Rewrite (N,
Make_Attribute_Reference (Loc,
Prefix =>
Make_Attribute_Reference (Loc,
Prefix => Pref,
Attribute_Name => Name_Pos,
Expressions => New_List (Expr)),
Attribute_Name =>
Name_Img));
Analyze_And_Resolve (N, Standard_String);
else
-- Here we get the Image of an enumeration type
Ttyp := Component_Type (Etype (Lit_Indexes (Rtyp)));
if Ttyp = Standard_Integer_8 then
Func := RE_Image_Enumeration_8;
elsif Ttyp = Standard_Integer_16 then
Func := RE_Image_Enumeration_16;
else
Func := RE_Image_Enumeration_32;
end if;
-- Apply a validity check, since it is a bit drastic to
-- get a completely junk image value for an invalid value.
if not Expr_Known_Valid (Expr) then
Insert_Valid_Check (Expr);
end if;
Rewrite (N,
Make_Function_Call (Loc,
Name => New_Occurrence_Of (RTE (Func), Loc),
Parameter_Associations => New_List (
Make_Attribute_Reference (Loc,
Attribute_Name => Name_Pos,
Prefix => New_Occurrence_Of (Ptyp, Loc),
Expressions => New_List (Expr)),
New_Occurrence_Of (Lit_Strings (Rtyp), Loc),
Make_Attribute_Reference (Loc,
Prefix => New_Occurrence_Of (Lit_Indexes (Rtyp), Loc),
Attribute_Name => Name_Address))));
Analyze_And_Resolve (N, Standard_String);
end if;
return;
end if;
-- If we fall through, we have one of the cases that is handled by
-- calling one of the System.Img_xx routines and Imid is set to the
-- RE_Id for the function to be called.
Func_Ent := RTE (Imid);
-- If the function entity is empty, that means we have a case in
-- no run time mode where the operation is not allowed, and an
-- appropriate diagnostic has already been issued.
if No (Func_Ent) then
return;
end if;
-- Otherwise prepare arguments for run-time call
Arglist := New_List (Convert_To (Tent, Relocate_Node (Expr)));
-- For floating-point types, append Digits argument
if Is_Floating_Point_Type (Rtyp) then
Append_To (Arglist,
Make_Attribute_Reference (Loc,
Prefix => New_Reference_To (Ptyp, Loc),
Attribute_Name => Name_Digits));
-- For ordinary fixed-point types, append Aft parameter
elsif Is_Ordinary_Fixed_Point_Type (Rtyp) then
Append_To (Arglist,
Make_Attribute_Reference (Loc,
Prefix => New_Reference_To (Ptyp, Loc),
Attribute_Name => Name_Aft));
-- For decimal, append Scale and also set to do literal conversion
elsif Is_Decimal_Fixed_Point_Type (Rtyp) then
Append_To (Arglist,
Make_Attribute_Reference (Loc,
Prefix => New_Reference_To (Ptyp, Loc),
Attribute_Name => Name_Scale));
Set_Conversion_OK (First (Arglist));
Set_Etype (First (Arglist), Tent);
-- For Wide_Character, append Ada 2005 indication
elsif Rtyp = Standard_Wide_Character then
Append_To (Arglist,
New_Reference_To (Boolean_Literals (Ada_Version >= Ada_05), Loc));
end if;
Rewrite (N,
Make_Function_Call (Loc,
Name => New_Reference_To (Func_Ent, Loc),
Parameter_Associations => Arglist));
Analyze_And_Resolve (N, Standard_String);
end Expand_Image_Attribute;
----------------------------
-- Expand_Value_Attribute --
----------------------------
-- For scalar types derived from Boolean, Character and integer types
-- in package Standard, typ'Value (X) expands into:
-- btyp (Value_xx (X))
-- where btyp is he base type of the prefix, and
-- For types whose root type is Character
-- xx = Character
-- For types whose root type is Wide_Character
-- xx = Wide_Character
-- For types whose root type is Wide_Wide_Character
-- xx = Wide_Wide_Character
-- For types whose root type is Boolean
-- xx = Boolean
-- For signed integer types with size <= Integer'Size
-- xx = Integer
-- For other signed integer types
-- xx = Long_Long_Integer
-- For modular types with modulus <= System.Unsigned_Types.Unsigned
-- xx = Unsigned
-- For other modular integer types
-- xx = Long_Long_Unsigned
-- For floating-point types and ordinary fixed-point types
-- xx = Real
-- For decimal types with size <= Integer'Size, typ'Value (X)
-- expands into
-- btyp?(Value_Decimal (X, typ'Scale));
-- For all other decimal types, typ'Value (X) expands into
-- btyp?(Value_Long_Long_Decimal (X, typ'Scale))
-- For enumeration types other than those derived from types Boolean,
-- Character, Wide_[Wide_]Character in Standard, typ'Value (X) expands to:
-- Enum'Val (Value_Enumeration_NN (typS, typI'Address, Num, X))
-- where typS and typI and the Lit_Strings and Lit_Indexes entities
-- from T's root type entitym and Num is Enum'Pos (Enum'Last). The
-- Value_Enumeration_NN function will search the tables looking for
-- X and return the position number in the table if found which is
-- used to provide the result of 'Value (using Enum'Val). If the
-- value is not found Constraint_Error is raised. The suffix _NN
-- depends on the element type of typI.
procedure Expand_Value_Attribute (N : Node_Id) is
Loc : constant Source_Ptr := Sloc (N);
Typ : constant Entity_Id := Etype (N);
Btyp : constant Entity_Id := Base_Type (Typ);
Rtyp : constant Entity_Id := Root_Type (Typ);
Exprs : constant List_Id := Expressions (N);
Vid : RE_Id;
Args : List_Id;
Func : RE_Id;
Ttyp : Entity_Id;
begin
Args := Exprs;
if Rtyp = Standard_Character then
Vid := RE_Value_Character;
elsif Rtyp = Standard_Boolean then
Vid := RE_Value_Boolean;
elsif Rtyp = Standard_Wide_Character then
Vid := RE_Value_Wide_Character;
elsif Rtyp = Standard_Wide_Wide_Character then
Vid := RE_Value_Wide_Wide_Character;
elsif Rtyp = Base_Type (Standard_Short_Short_Integer)
or else Rtyp = Base_Type (Standard_Short_Integer)
or else Rtyp = Base_Type (Standard_Integer)
then
Vid := RE_Value_Integer;
elsif Is_Signed_Integer_Type (Rtyp) then
Vid := RE_Value_Long_Long_Integer;
elsif Is_Modular_Integer_Type (Rtyp) then
if Modulus (Rtyp) <= Modulus (RTE (RE_Unsigned)) then
Vid := RE_Value_Unsigned;
else
Vid := RE_Value_Long_Long_Unsigned;
end if;
elsif Is_Decimal_Fixed_Point_Type (Rtyp) then
if UI_To_Int (Esize (Rtyp)) <= Standard_Integer_Size then
Vid := RE_Value_Decimal;
else
Vid := RE_Value_Long_Long_Decimal;
end if;
Append_To (Args,
Make_Attribute_Reference (Loc,
Prefix => New_Reference_To (Typ, Loc),
Attribute_Name => Name_Scale));
Rewrite (N,
OK_Convert_To (Btyp,
Make_Function_Call (Loc,
Name => New_Reference_To (RTE (Vid), Loc),
Parameter_Associations => Args)));
Set_Etype (N, Btyp);
Analyze_And_Resolve (N, Btyp);
return;
elsif Is_Real_Type (Rtyp) then
Vid := RE_Value_Real;
-- Only other possibility is user defined enumeration type
else
pragma Assert (Is_Enumeration_Type (Rtyp));
-- Case of pragma Discard_Names, transform the Value
-- attribute to Btyp'Val (Long_Long_Integer'Value (Args))
if Discard_Names (First_Subtype (Typ))
or else No (Lit_Strings (Rtyp))
then
Rewrite (N,
Make_Attribute_Reference (Loc,
Prefix => New_Reference_To (Btyp, Loc),
Attribute_Name => Name_Val,
Expressions => New_List (
Make_Attribute_Reference (Loc,
Prefix =>
New_Occurrence_Of (Standard_Long_Long_Integer, Loc),
Attribute_Name => Name_Value,
Expressions => Args))));
Analyze_And_Resolve (N, Btyp);
-- Here for normal case where we have enumeration tables, this
-- is where we build
-- T'Val (Value_Enumeration_NN (typS, typI'Address, Num, X))
else
Ttyp := Component_Type (Etype (Lit_Indexes (Rtyp)));
if Ttyp = Standard_Integer_8 then
Func := RE_Value_Enumeration_8;
elsif Ttyp = Standard_Integer_16 then
Func := RE_Value_Enumeration_16;
else
Func := RE_Value_Enumeration_32;
end if;
Prepend_To (Args,
Make_Attribute_Reference (Loc,
Prefix => New_Occurrence_Of (Rtyp, Loc),
Attribute_Name => Name_Pos,
Expressions => New_List (
Make_Attribute_Reference (Loc,
Prefix => New_Occurrence_Of (Rtyp, Loc),
Attribute_Name => Name_Last))));
Prepend_To (Args,
Make_Attribute_Reference (Loc,
Prefix => New_Occurrence_Of (Lit_Indexes (Rtyp), Loc),
Attribute_Name => Name_Address));
Prepend_To (Args,
New_Occurrence_Of (Lit_Strings (Rtyp), Loc));
Rewrite (N,
Make_Attribute_Reference (Loc,
Prefix => New_Reference_To (Typ, Loc),
Attribute_Name => Name_Val,
Expressions => New_List (
Make_Function_Call (Loc,
Name =>
New_Reference_To (RTE (Func), Loc),
Parameter_Associations => Args))));
Analyze_And_Resolve (N, Btyp);
end if;
return;
end if;
-- Fall through for all cases except user defined enumeration type
-- and decimal types, with Vid set to the Id of the entity for the
-- Value routine and Args set to the list of parameters for the call.
Rewrite (N,
Convert_To (Btyp,
Make_Function_Call (Loc,
Name => New_Reference_To (RTE (Vid), Loc),
Parameter_Associations => Args)));
Analyze_And_Resolve (N, Btyp);
end Expand_Value_Attribute;
----------------------------
-- Expand_Width_Attribute --
----------------------------
-- The processing here also handles the case of Wide_[Wide_]Width. With the
-- exceptions noted, the processing is identical
-- For scalar types derived from Boolean, character and integer types
-- in package Standard. Note that the Width attribute is computed at
-- compile time for all cases except those involving non-static sub-
-- types. For such subtypes, typ'[Wide_[Wide_]]Width expands into:
-- Result_Type (xx (yy (Ptyp'First), yy (Ptyp'Last)))
-- where
-- For types whose root type is Character
-- xx = Width_Character
-- yy = Character
-- For types whose root type is Wide_Character
-- xx = Wide_Width_Character
-- yy = Character
-- For types whose root type is Wide_Wide_Character
-- xx = Wide_Wide_Width_Character
-- yy = Character
-- For types whose root type is Boolean
-- xx = Width_Boolean
-- yy = Boolean
-- For signed integer types
-- xx = Width_Long_Long_Integer
-- yy = Long_Long_Integer
-- For modular integer types
-- xx = Width_Long_Long_Unsigned
-- yy = Long_Long_Unsigned
-- For types derived from Wide_Character, typ'Width expands into
-- Result_Type (Width_Wide_Character (
-- Wide_Character (typ'First),
-- Wide_Character (typ'Last),
-- and typ'Wide_Width expands into:
-- Result_Type (Wide_Width_Wide_Character (
-- Wide_Character (typ'First),
-- Wide_Character (typ'Last));
-- and typ'Wide_Wide_Width expands into
-- Result_Type (Wide_Wide_Width_Wide_Character (
-- Wide_Character (typ'First),
-- Wide_Character (typ'Last));
-- For types derived from Wide_Wide_Character, typ'Width expands into
-- Result_Type (Width_Wide_Wide_Character (
-- Wide_Wide_Character (typ'First),
-- Wide_Wide_Character (typ'Last),
-- and typ'Wide_Width expands into:
-- Result_Type (Wide_Width_Wide_Wide_Character (
-- Wide_Wide_Character (typ'First),
-- Wide_Wide_Character (typ'Last));
-- and typ'Wide_Wide_Width expands into
-- Result_Type (Wide_Wide_Width_Wide_Wide_Char (
-- Wide_Wide_Character (typ'First),
-- Wide_Wide_Character (typ'Last));
-- For real types, typ'Width and typ'Wide_[Wide_]Width expand into
-- if Ptyp'First > Ptyp'Last then 0 else btyp'Width end if
-- where btyp is the base type. This looks recursive but it isn't
-- because the base type is always static, and hence the expression
-- in the else is reduced to an integer literal.
-- For user defined enumeration types, typ'Width expands into
-- Result_Type (Width_Enumeration_NN
-- (typS,
-- typI'Address,
-- typ'Pos (typ'First),
-- typ'Pos (Typ'Last)));
-- and typ'Wide_Width expands into:
-- Result_Type (Wide_Width_Enumeration_NN
-- (typS,
-- typI,
-- typ'Pos (typ'First),
-- typ'Pos (Typ'Last))
-- Wide_Character_Encoding_Method);
-- and typ'Wide_Wide_Width expands into:
-- Result_Type (Wide_Wide_Width_Enumeration_NN
-- (typS,
-- typI,
-- typ'Pos (typ'First),
-- typ'Pos (Typ'Last))
-- Wide_Character_Encoding_Method);
-- where typS and typI are the enumeration image strings and
-- indexes table, as described in Build_Enumeration_Image_Tables.
-- NN is 8/16/32 for depending on the element type for typI.
procedure Expand_Width_Attribute (N : Node_Id; Attr : Atype := Normal) is
Loc : constant Source_Ptr := Sloc (N);
Typ : constant Entity_Id := Etype (N);
Pref : constant Node_Id := Prefix (N);
Ptyp : constant Entity_Id := Etype (Pref);
Rtyp : constant Entity_Id := Root_Type (Ptyp);
XX : RE_Id;
YY : Entity_Id;
Arglist : List_Id;
Ttyp : Entity_Id;
begin
-- Types derived from Standard.Boolean
if Rtyp = Standard_Boolean then
XX := RE_Width_Boolean;
YY := Rtyp;
-- Types derived from Standard.Character
elsif Rtyp = Standard_Character then
case Attr is
when Normal => XX := RE_Width_Character;
when Wide => XX := RE_Wide_Width_Character;
when Wide_Wide => XX := RE_Wide_Wide_Width_Character;
end case;
YY := Rtyp;
-- Types derived from Standard.Wide_Character
elsif Rtyp = Standard_Wide_Character then
case Attr is
when Normal => XX := RE_Width_Wide_Character;
when Wide => XX := RE_Wide_Width_Wide_Character;
when Wide_Wide => XX := RE_Wide_Wide_Width_Wide_Character;
end case;
YY := Rtyp;
-- Types derived from Standard.Wide_Wide_Character
elsif Rtyp = Standard_Wide_Wide_Character then
case Attr is
when Normal => XX := RE_Width_Wide_Wide_Character;
when Wide => XX := RE_Wide_Width_Wide_Wide_Character;
when Wide_Wide => XX := RE_Wide_Wide_Width_Wide_Wide_Char;
end case;
YY := Rtyp;
-- Signed integer types
elsif Is_Signed_Integer_Type (Rtyp) then
XX := RE_Width_Long_Long_Integer;
YY := Standard_Long_Long_Integer;
-- Modular integer types
elsif Is_Modular_Integer_Type (Rtyp) then
XX := RE_Width_Long_Long_Unsigned;
YY := RTE (RE_Long_Long_Unsigned);
-- Real types
elsif Is_Real_Type (Rtyp) then
Rewrite (N,
Make_Conditional_Expression (Loc,
Expressions => New_List (
Make_Op_Gt (Loc,
Left_Opnd =>
Make_Attribute_Reference (Loc,
Prefix => New_Reference_To (Ptyp, Loc),
Attribute_Name => Name_First),
Right_Opnd =>
Make_Attribute_Reference (Loc,
Prefix => New_Reference_To (Ptyp, Loc),
Attribute_Name => Name_Last)),
Make_Integer_Literal (Loc, 0),
Make_Attribute_Reference (Loc,
Prefix => New_Reference_To (Base_Type (Ptyp), Loc),
Attribute_Name => Name_Width))));
Analyze_And_Resolve (N, Typ);
return;
-- User defined enumeration types
else
pragma Assert (Is_Enumeration_Type (Rtyp));
if Discard_Names (Rtyp) then
-- This is a configurable run-time, or else a restriction is in
-- effect. In either case the attribute cannot be supported. Force
-- a load error from Rtsfind to generate an appropriate message,
-- as is done with other ZFP violations.
declare
pragma Warnings (Off); -- since Discard is unreferenced
Discard : constant Entity_Id := RTE (RE_Null);
pragma Warnings (On);
begin
return;
end;
end if;
Ttyp := Component_Type (Etype (Lit_Indexes (Rtyp)));
case Attr is
when Normal =>
if Ttyp = Standard_Integer_8 then
XX := RE_Width_Enumeration_8;
elsif Ttyp = Standard_Integer_16 then
XX := RE_Width_Enumeration_16;
else
XX := RE_Width_Enumeration_32;
end if;
when Wide =>
if Ttyp = Standard_Integer_8 then
XX := RE_Wide_Width_Enumeration_8;
elsif Ttyp = Standard_Integer_16 then
XX := RE_Wide_Width_Enumeration_16;
else
XX := RE_Wide_Width_Enumeration_32;
end if;
when Wide_Wide =>
if Ttyp = Standard_Integer_8 then
XX := RE_Wide_Wide_Width_Enumeration_8;
elsif Ttyp = Standard_Integer_16 then
XX := RE_Wide_Wide_Width_Enumeration_16;
else
XX := RE_Wide_Wide_Width_Enumeration_32;
end if;
end case;
Arglist :=
New_List (
New_Occurrence_Of (Lit_Strings (Rtyp), Loc),
Make_Attribute_Reference (Loc,
Prefix => New_Occurrence_Of (Lit_Indexes (Rtyp), Loc),
Attribute_Name => Name_Address),
Make_Attribute_Reference (Loc,
Prefix => New_Reference_To (Ptyp, Loc),
Attribute_Name => Name_Pos,
Expressions => New_List (
Make_Attribute_Reference (Loc,
Prefix => New_Reference_To (Ptyp, Loc),
Attribute_Name => Name_First))),
Make_Attribute_Reference (Loc,
Prefix => New_Reference_To (Ptyp, Loc),
Attribute_Name => Name_Pos,
Expressions => New_List (
Make_Attribute_Reference (Loc,
Prefix => New_Reference_To (Ptyp, Loc),
Attribute_Name => Name_Last))));
Rewrite (N,
Convert_To (Typ,
Make_Function_Call (Loc,
Name => New_Reference_To (RTE (XX), Loc),
Parameter_Associations => Arglist)));
Analyze_And_Resolve (N, Typ);
return;
end if;
-- If we fall through XX and YY are set
Arglist := New_List (
Convert_To (YY,
Make_Attribute_Reference (Loc,
Prefix => New_Reference_To (Ptyp, Loc),
Attribute_Name => Name_First)),
Convert_To (YY,
Make_Attribute_Reference (Loc,
Prefix => New_Reference_To (Ptyp, Loc),
Attribute_Name => Name_Last)));
Rewrite (N,
Convert_To (Typ,
Make_Function_Call (Loc,
Name => New_Reference_To (RTE (XX), Loc),
Parameter_Associations => Arglist)));
Analyze_And_Resolve (N, Typ);
end Expand_Width_Attribute;
end Exp_Imgv;
| 33.948258 | 79 | 0.560702 |
41f8606079b511f5ba616315445e97d28cf8549b | 8,263 | ads | Ada | llvm-gcc-4.2-2.9/gcc/ada/a-cdlili.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 1 | 2016-04-09T02:58:13.000Z | 2016-04-09T02:58:13.000Z | llvm-gcc-4.2-2.9/gcc/ada/a-cdlili.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/a-cdlili.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- A D A . C O N T A I N E R S . D O U B L Y _ L I N K E D _ L I S T S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2004-2005, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
with Ada.Finalization;
with Ada.Streams;
generic
type Element_Type is private;
with function "=" (Left, Right : Element_Type)
return Boolean is <>;
package Ada.Containers.Doubly_Linked_Lists is
pragma Preelaborate;
type List is tagged private;
type Cursor is private;
Empty_List : constant List;
No_Element : constant Cursor;
function "=" (Left, Right : List) return Boolean;
function Length (Container : List) return Count_Type;
function Is_Empty (Container : List) return Boolean;
procedure Clear (Container : in out List);
function Element (Position : Cursor) return Element_Type;
procedure Replace_Element
(Container : in out List;
Position : Cursor;
New_Item : Element_Type);
procedure Query_Element
(Position : Cursor;
Process : not null access procedure (Element : Element_Type));
procedure Update_Element
(Container : in out List;
Position : Cursor;
Process : not null access procedure (Element : in out Element_Type));
procedure Move
(Target : in out List;
Source : in out List);
procedure Insert
(Container : in out List;
Before : Cursor;
New_Item : Element_Type;
Count : Count_Type := 1);
procedure Insert
(Container : in out List;
Before : Cursor;
New_Item : Element_Type;
Position : out Cursor;
Count : Count_Type := 1);
procedure Insert
(Container : in out List;
Before : Cursor;
Position : out Cursor;
Count : Count_Type := 1);
procedure Prepend
(Container : in out List;
New_Item : Element_Type;
Count : Count_Type := 1);
procedure Append
(Container : in out List;
New_Item : Element_Type;
Count : Count_Type := 1);
procedure Delete
(Container : in out List;
Position : in out Cursor;
Count : Count_Type := 1);
procedure Delete_First
(Container : in out List;
Count : Count_Type := 1);
procedure Delete_Last
(Container : in out List;
Count : Count_Type := 1);
procedure Reverse_Elements (Container : in out List);
procedure Swap
(Container : in out List;
I, J : Cursor);
procedure Swap_Links
(Container : in out List;
I, J : Cursor);
procedure Splice
(Target : in out List;
Before : Cursor;
Source : in out List);
procedure Splice
(Target : in out List;
Before : Cursor;
Source : in out List;
Position : in out Cursor);
procedure Splice
(Container : in out List;
Before : Cursor;
Position : in out Cursor);
function First (Container : List) return Cursor;
function First_Element (Container : List) return Element_Type;
function Last (Container : List) return Cursor;
function Last_Element (Container : List) return Element_Type;
function Next (Position : Cursor) return Cursor;
procedure Next (Position : in out Cursor);
function Previous (Position : Cursor) return Cursor;
procedure Previous (Position : in out Cursor);
function Find
(Container : List;
Item : Element_Type;
Position : Cursor := No_Element) return Cursor;
function Reverse_Find
(Container : List;
Item : Element_Type;
Position : Cursor := No_Element) return Cursor;
function Contains
(Container : List;
Item : Element_Type) return Boolean;
function Has_Element (Position : Cursor) return Boolean;
procedure Iterate
(Container : List;
Process : not null access procedure (Position : Cursor));
procedure Reverse_Iterate
(Container : List;
Process : not null access procedure (Position : Cursor));
generic
with function "<" (Left, Right : Element_Type) return Boolean is <>;
package Generic_Sorting is
function Is_Sorted (Container : List) return Boolean;
procedure Sort (Container : in out List);
procedure Merge (Target, Source : in out List);
end Generic_Sorting;
private
type Node_Type;
type Node_Access is access Node_Type;
type Node_Type is
limited record
Element : Element_Type;
Next : Node_Access;
Prev : Node_Access;
end record;
use Ada.Finalization;
type List is
new Controlled with record
First : Node_Access;
Last : Node_Access;
Length : Count_Type := 0;
Busy : Natural := 0;
Lock : Natural := 0;
end record;
procedure Adjust (Container : in out List);
procedure Finalize (Container : in out List) renames Clear;
use Ada.Streams;
procedure Read
(Stream : access Root_Stream_Type'Class;
Item : out List);
for List'Read use Read;
procedure Write
(Stream : access Root_Stream_Type'Class;
Item : List);
for List'Write use Write;
Empty_List : constant List := (Controlled with null, null, 0, 0, 0);
type List_Access is access constant List;
for List_Access'Storage_Size use 0;
type Cursor is
record
Container : List_Access;
Node : Node_Access;
end record;
procedure Read
(Stream : access Root_Stream_Type'Class;
Item : out Cursor);
for Cursor'Read use Read;
procedure Write
(Stream : access Root_Stream_Type'Class;
Item : Cursor);
for Cursor'Write use Write;
No_Element : constant Cursor := Cursor'(null, null);
end Ada.Containers.Doubly_Linked_Lists;
| 30.603704 | 78 | 0.568075 |
4dfb04eefee55d608105c606b0ecffc99e09d977 | 1,171 | adb | Ada | dependencies/agar/ada-gui/agar-gui-widget-toolbar.adb | amvb/GUCEF | 08fd423bbb5cdebbe4b70df24c0ae51716b65825 | [
"Apache-2.0"
] | 286 | 2017-07-31T20:05:16.000Z | 2022-03-26T20:26:24.000Z | dependencies/agar/ada-gui/agar-gui-widget-toolbar.adb | amvb/GUCEF | 08fd423bbb5cdebbe4b70df24c0ae51716b65825 | [
"Apache-2.0"
] | 67 | 2017-08-30T18:56:21.000Z | 2021-09-08T03:38:20.000Z | dependencies/agar/ada-gui/agar-gui-widget-toolbar.adb | amvb/GUCEF | 08fd423bbb5cdebbe4b70df24c0ae51716b65825 | [
"Apache-2.0"
] | 31 | 2017-08-14T13:34:12.000Z | 2022-03-14T15:33:49.000Z | package body agar.gui.widget.toolbar is
package cbinds is
function allocate
(parent : widget_access_t;
bar_type : type_t;
num_rows : c.int;
flags : flags_t) return toolbar_access_t;
pragma import (c, allocate, "AG_ToolbarNew");
procedure row
(toolbar : toolbar_access_t;
row_name : c.int);
pragma import (c, row, "AG_ToolbarRow");
end cbinds;
function allocate
(parent : widget_access_t;
bar_type : type_t;
num_rows : natural;
flags : flags_t) return toolbar_access_t is
begin
return cbinds.allocate
(parent => parent,
bar_type => bar_type,
num_rows => c.int (num_rows),
flags => flags);
end allocate;
procedure row
(toolbar : toolbar_access_t;
row_name : natural) is
begin
cbinds.row
(toolbar => toolbar,
row_name => c.int (row_name));
end row;
function widget (toolbar : toolbar_access_t) return widget_access_t is
begin
return agar.gui.widget.box.widget (toolbar.box'access);
end widget;
end agar.gui.widget.toolbar;
| 26.022222 | 72 | 0.603757 |
29c5e57ef8e9451bbd69d5714fb1c54097b43b54 | 401 | adb | Ada | Ada/fizzbuzz.adb | capturemathan/Fizz-Buzz | 9d965ccb70b62ec930cd7f07a2fd8fb637ac8b2f | [
"MIT"
] | 10 | 2020-10-02T14:58:12.000Z | 2020-10-10T16:29:08.000Z | Ada/fizzbuzz.adb | capturemathan/Fizz-Buzz | 9d965ccb70b62ec930cd7f07a2fd8fb637ac8b2f | [
"MIT"
] | 45 | 2020-10-02T12:13:37.000Z | 2020-12-23T14:27:15.000Z | Ada/fizzbuzz.adb | capturemathan/Fizz-Buzz | 9d965ccb70b62ec930cd7f07a2fd8fb637ac8b2f | [
"MIT"
] | 105 | 2020-10-02T12:20:20.000Z | 2020-10-17T15:46:14.000Z | with Ada.Text_IO;
use Ada.Text_IO;
procedure Fizzbuzz is
i : Integer;
begin
i := 1;
for i in Integer range 1 .. 100 loop
if i mod 3 = 0 and i mod 5 = 0 then
Put_Line ("FizzBuzz");
elsif i mod 5 = 0 then
Put_Line("Buzz");
elsif i mod 3 = 0 then
Put_Line("Fizz");
else
Put_Line(Integer'Image(i));
end if;
end loop;
end Fizzbuzz;
| 21.105263 | 41 | 0.563591 |
594e0dd13faf3a1b065d4cf1ea2d094714090cd7 | 693 | ads | Ada | source/required/s-pack07.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/required/s-pack07.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/required/s-pack07.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | pragma License (Unrestricted);
-- implementation unit required by compiler
with System.Packed_Arrays;
package System.Pack_07 is
pragma Preelaborate;
-- It can not be Pure, subprograms would become __attribute__((const)).
type Bits_07 is mod 2 ** 7;
for Bits_07'Size use 7;
package Indexing is new Packed_Arrays.Indexing (Bits_07);
-- required for accessing arrays by compiler
function Get_07 (
Arr : Address;
N : Natural;
Rev_SSO : Boolean)
return Bits_07
renames Indexing.Get;
procedure Set_07 (
Arr : Address;
N : Natural;
E : Bits_07;
Rev_SSO : Boolean)
renames Indexing.Set;
end System.Pack_07;
| 24.75 | 78 | 0.669553 |
3d6d10bba2b05d345e4d92e3b43f7fa505922353 | 126,437 | ads | Ada | src/fonts/geste_fonts-freeserifitalic18pt7b.ads | Fabien-Chouteau/GESTE | 5ac814906fdb49d880db60cbb17279cbbb777336 | [
"BSD-3-Clause"
] | 13 | 2018-07-31T12:11:46.000Z | 2021-11-19T14:16:46.000Z | src/fonts/geste_fonts-freeserifitalic18pt7b.ads | gregkrsak/GESTE | 5ac814906fdb49d880db60cbb17279cbbb777336 | [
"BSD-3-Clause"
] | 1 | 2018-10-22T21:41:59.000Z | 2018-10-22T21:41:59.000Z | src/fonts/geste_fonts-freeserifitalic18pt7b.ads | gregkrsak/GESTE | 5ac814906fdb49d880db60cbb17279cbbb777336 | [
"BSD-3-Clause"
] | 4 | 2020-07-03T10:03:13.000Z | 2022-02-10T03:35:07.000Z | package GESTE_Fonts.FreeSerifItalic18pt7b is
Font : constant Bitmap_Font_Ref;
private
FreeSerifItalic18pt7bBitmaps : aliased constant Font_Bitmap := (
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#,
16#80#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#0E#, 16#00#,
16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#,
16#00#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#03#,
16#00#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#,
16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#,
16#00#, 16#80#, 16#00#, 16#00#, 16#01#, 16#00#, 16#00#, 16#00#, 16#02#,
16#00#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#, 16#00#, 16#10#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#03#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1E#,
16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#06#, 16#08#, 16#00#, 16#00#, 16#0C#, 16#38#, 16#00#, 16#00#, 16#38#,
16#E0#, 16#00#, 16#00#, 16#71#, 16#C0#, 16#00#, 16#00#, 16#C3#, 16#80#,
16#00#, 16#01#, 16#86#, 16#00#, 16#00#, 16#02#, 16#0C#, 16#00#, 16#00#,
16#04#, 16#10#, 16#00#, 16#00#, 16#08#, 16#20#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#C1#, 16#80#, 16#00#, 16#01#, 16#87#, 16#00#, 16#00#,
16#07#, 16#0C#, 16#00#, 16#00#, 16#0C#, 16#18#, 16#00#, 16#00#, 16#18#,
16#70#, 16#00#, 16#00#, 16#60#, 16#C0#, 16#00#, 16#00#, 16#C1#, 16#80#,
16#00#, 16#1F#, 16#FF#, 16#E0#, 16#00#, 16#3F#, 16#FF#, 16#C0#, 16#00#,
16#0C#, 16#38#, 16#00#, 16#00#, 16#38#, 16#60#, 16#00#, 16#00#, 16#60#,
16#C0#, 16#00#, 16#00#, 16#C3#, 16#80#, 16#00#, 16#03#, 16#06#, 16#00#,
16#00#, 16#7F#, 16#FF#, 16#80#, 16#00#, 16#FF#, 16#FF#, 16#00#, 16#00#,
16#30#, 16#60#, 16#00#, 16#00#, 16#61#, 16#C0#, 16#00#, 16#01#, 16#C3#,
16#00#, 16#00#, 16#03#, 16#06#, 16#00#, 16#00#, 16#06#, 16#18#, 16#00#,
16#00#, 16#18#, 16#30#, 16#00#, 16#00#, 16#30#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#03#, 16#00#, 16#00#, 16#00#, 16#04#, 16#00#, 16#00#, 16#00#, 16#08#,
16#00#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#0E#, 16#2E#, 16#00#,
16#00#, 16#38#, 16#CC#, 16#00#, 16#00#, 16#61#, 16#08#, 16#00#, 16#01#,
16#C2#, 16#10#, 16#00#, 16#03#, 16#84#, 16#00#, 16#00#, 16#07#, 16#98#,
16#00#, 16#00#, 16#07#, 16#A0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#,
16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#,
16#07#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#33#,
16#80#, 16#00#, 16#00#, 16#63#, 16#80#, 16#00#, 16#00#, 16#87#, 16#00#,
16#00#, 16#41#, 16#0E#, 16#00#, 16#00#, 16#86#, 16#1C#, 16#00#, 16#03#,
16#0C#, 16#38#, 16#00#, 16#07#, 16#10#, 16#60#, 16#00#, 16#07#, 16#21#,
16#80#, 16#00#, 16#07#, 16#CE#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#,
16#00#, 16#02#, 16#00#, 16#00#, 16#00#, 16#04#, 16#00#, 16#00#, 16#00#,
16#08#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#18#, 16#00#, 16#0F#, 16#E0#,
16#70#, 16#00#, 16#3C#, 16#3F#, 16#40#, 16#00#, 16#F0#, 16#41#, 16#80#,
16#01#, 16#C0#, 16#86#, 16#00#, 16#07#, 16#01#, 16#08#, 16#00#, 16#0E#,
16#02#, 16#30#, 16#00#, 16#1C#, 16#08#, 16#40#, 16#00#, 16#30#, 16#11#,
16#80#, 16#00#, 16#60#, 16#62#, 16#0F#, 16#00#, 16#E0#, 16#8C#, 16#7F#,
16#00#, 16#C6#, 16#31#, 16#E6#, 16#01#, 16#F8#, 16#47#, 16#84#, 16#01#,
16#E1#, 16#8E#, 16#04#, 16#00#, 16#02#, 16#38#, 16#08#, 16#00#, 16#0C#,
16#70#, 16#10#, 16#00#, 16#31#, 16#E0#, 16#40#, 16#00#, 16#63#, 16#80#,
16#80#, 16#01#, 16#87#, 16#03#, 16#00#, 16#02#, 16#0E#, 16#04#, 16#00#,
16#0C#, 16#0E#, 16#38#, 16#00#, 16#10#, 16#1F#, 16#E0#, 16#00#, 16#60#,
16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#,
16#1F#, 16#C0#, 16#00#, 16#00#, 16#71#, 16#80#, 16#00#, 16#00#, 16#C3#,
16#00#, 16#00#, 16#01#, 16#86#, 16#00#, 16#00#, 16#07#, 16#0C#, 16#00#,
16#00#, 16#0E#, 16#30#, 16#00#, 16#00#, 16#1D#, 16#80#, 16#00#, 16#00#,
16#3C#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#03#, 16#70#,
16#FC#, 16#00#, 16#18#, 16#E0#, 16#E0#, 16#00#, 16#E1#, 16#E1#, 16#80#,
16#03#, 16#81#, 16#C3#, 16#00#, 16#0E#, 16#03#, 16#8C#, 16#00#, 16#1C#,
16#07#, 16#90#, 16#00#, 16#38#, 16#07#, 16#40#, 16#00#, 16#70#, 16#0F#,
16#80#, 16#00#, 16#E0#, 16#0F#, 16#00#, 16#01#, 16#E0#, 16#1E#, 16#00#,
16#01#, 16#F0#, 16#DF#, 16#10#, 16#03#, 16#FF#, 16#1F#, 16#C0#, 16#01#,
16#F8#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#,
16#0C#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#70#,
16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#,
16#00#, 16#02#, 16#00#, 16#00#, 16#00#, 16#04#, 16#00#, 16#00#, 16#00#,
16#08#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#40#, 16#00#,
16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#,
16#10#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#01#, 16#80#,
16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#,
16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#01#,
16#C0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#07#, 16#00#,
16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#,
16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#01#,
16#C0#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#03#, 16#00#,
16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#,
16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#,
16#20#, 16#00#, 16#00#, 16#00#, 16#40#, 16#00#, 16#00#, 16#00#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#80#, 16#00#, 16#00#, 16#01#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#04#, 16#00#,
16#00#, 16#00#, 16#04#, 16#00#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#,
16#00#, 16#10#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#,
16#60#, 16#00#, 16#00#, 16#00#, 16#40#, 16#00#, 16#00#, 16#00#, 16#C0#,
16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#,
16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#,
16#38#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#E0#,
16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#,
16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#,
16#38#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#01#, 16#C0#,
16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#,
16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#01#,
16#80#, 16#00#, 16#00#, 16#02#, 16#00#, 16#00#, 16#00#, 16#08#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#60#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#80#,
16#00#, 16#00#, 16#63#, 16#18#, 16#00#, 16#00#, 16#E4#, 16#70#, 16#00#,
16#00#, 16#2B#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#,
16#68#, 16#00#, 16#00#, 16#0F#, 16#4E#, 16#00#, 16#00#, 16#3C#, 16#8E#,
16#00#, 16#00#, 16#31#, 16#8C#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#,
16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#,
16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#,
16#60#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#80#,
16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FE#, 16#00#,
16#0F#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#,
16#30#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#C0#,
16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#,
16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#,
16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#,
16#38#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#80#,
16#00#, 16#00#, 16#02#, 16#00#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#,
16#38#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#01#, 16#C0#,
16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#,
16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#01#,
16#C0#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#,
16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#,
16#01#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#0E#,
16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#,
16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#,
16#0E#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#70#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#01#, 16#8C#, 16#00#, 16#00#,
16#06#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#18#, 16#00#, 16#00#, 16#60#,
16#18#, 16#00#, 16#01#, 16#C0#, 16#30#, 16#00#, 16#03#, 16#00#, 16#60#,
16#00#, 16#0E#, 16#00#, 16#C0#, 16#00#, 16#1C#, 16#03#, 16#80#, 16#00#,
16#70#, 16#07#, 16#00#, 16#00#, 16#E0#, 16#0E#, 16#00#, 16#01#, 16#C0#,
16#1C#, 16#00#, 16#07#, 16#80#, 16#38#, 16#00#, 16#0F#, 16#00#, 16#F0#,
16#00#, 16#1C#, 16#01#, 16#C0#, 16#00#, 16#38#, 16#03#, 16#80#, 16#00#,
16#70#, 16#07#, 16#00#, 16#00#, 16#E0#, 16#1C#, 16#00#, 16#01#, 16#C0#,
16#38#, 16#00#, 16#01#, 16#80#, 16#E0#, 16#00#, 16#03#, 16#01#, 16#80#,
16#00#, 16#07#, 16#06#, 16#00#, 16#00#, 16#06#, 16#18#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#00#,
16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#,
16#03#, 16#80#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#0E#,
16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#,
16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#,
16#07#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#1C#,
16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#,
16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#,
16#0E#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#38#,
16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#,
16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F0#,
16#00#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#61#, 16#F0#, 16#00#,
16#00#, 16#80#, 16#E0#, 16#00#, 16#02#, 16#01#, 16#E0#, 16#00#, 16#00#,
16#01#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#06#,
16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#,
16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#,
16#06#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#60#,
16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#,
16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#01#,
16#80#, 16#40#, 16#00#, 16#06#, 16#00#, 16#80#, 16#00#, 16#1F#, 16#FF#,
16#00#, 16#00#, 16#7F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#03#,
16#FC#, 16#00#, 16#00#, 16#04#, 16#3C#, 16#00#, 16#00#, 16#10#, 16#38#,
16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#,
16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#,
16#38#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#E0#,
16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#,
16#0E#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#38#,
16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#,
16#00#, 16#03#, 16#00#, 16#00#, 16#0E#, 16#0C#, 16#00#, 16#00#, 16#1F#,
16#F0#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#,
16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#,
16#78#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#06#, 16#C0#,
16#00#, 16#00#, 16#1B#, 16#80#, 16#00#, 16#00#, 16#67#, 16#00#, 16#00#,
16#00#, 16#8E#, 16#00#, 16#00#, 16#02#, 16#18#, 16#00#, 16#00#, 16#08#,
16#70#, 16#00#, 16#00#, 16#20#, 16#E0#, 16#00#, 16#00#, 16#81#, 16#80#,
16#00#, 16#02#, 16#07#, 16#00#, 16#00#, 16#0C#, 16#0E#, 16#00#, 16#00#,
16#30#, 16#1C#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#00#, 16#01#, 16#FF#,
16#FE#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#00#,
16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#,
16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#07#, 16#FE#, 16#00#, 16#00#,
16#08#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#40#,
16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#,
16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#E0#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#80#,
16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#,
16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#,
16#C0#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0E#, 16#1C#, 16#00#,
16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#,
16#C0#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#,
16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#,
16#78#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#80#,
16#00#, 16#00#, 16#0E#, 16#F8#, 16#00#, 16#00#, 16#3F#, 16#F8#, 16#00#,
16#00#, 16#F8#, 16#78#, 16#00#, 16#01#, 16#E0#, 16#78#, 16#00#, 16#03#,
16#80#, 16#70#, 16#00#, 16#0F#, 16#00#, 16#E0#, 16#00#, 16#1C#, 16#01#,
16#C0#, 16#00#, 16#38#, 16#03#, 16#80#, 16#00#, 16#70#, 16#07#, 16#00#,
16#00#, 16#E0#, 16#1E#, 16#00#, 16#01#, 16#C0#, 16#38#, 16#00#, 16#03#,
16#80#, 16#70#, 16#00#, 16#03#, 16#01#, 16#C0#, 16#00#, 16#06#, 16#07#,
16#00#, 16#00#, 16#06#, 16#1C#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#C0#, 16#00#, 16#3F#, 16#FF#,
16#00#, 16#00#, 16#40#, 16#0E#, 16#00#, 16#01#, 16#00#, 16#18#, 16#00#,
16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#,
16#03#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#18#,
16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#,
16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#,
16#18#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#01#, 16#C0#,
16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#,
16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#01#,
16#C0#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#FC#, 16#00#, 16#00#, 16#03#, 16#0E#, 16#00#, 16#00#, 16#0C#,
16#0C#, 16#00#, 16#00#, 16#38#, 16#0C#, 16#00#, 16#00#, 16#70#, 16#18#,
16#00#, 16#00#, 16#E0#, 16#30#, 16#00#, 16#01#, 16#C0#, 16#60#, 16#00#,
16#03#, 16#C1#, 16#80#, 16#00#, 16#03#, 16#C6#, 16#00#, 16#00#, 16#07#,
16#F8#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#C0#,
16#00#, 16#00#, 16#67#, 16#80#, 16#00#, 16#03#, 16#87#, 16#80#, 16#00#,
16#0E#, 16#07#, 16#80#, 16#00#, 16#18#, 16#07#, 16#00#, 16#00#, 16#70#,
16#06#, 16#00#, 16#00#, 16#C0#, 16#0E#, 16#00#, 16#01#, 16#80#, 16#18#,
16#00#, 16#03#, 16#80#, 16#30#, 16#00#, 16#03#, 16#00#, 16#E0#, 16#00#,
16#07#, 16#01#, 16#80#, 16#00#, 16#07#, 16#0E#, 16#00#, 16#00#, 16#03#,
16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#0C#, 16#00#, 16#00#,
16#1C#, 16#0C#, 16#00#, 16#00#, 16#70#, 16#18#, 16#00#, 16#00#, 16#E0#,
16#18#, 16#00#, 16#03#, 16#80#, 16#30#, 16#00#, 16#07#, 16#00#, 16#60#,
16#00#, 16#0E#, 16#01#, 16#C0#, 16#00#, 16#3C#, 16#03#, 16#80#, 16#00#,
16#78#, 16#07#, 16#00#, 16#00#, 16#F0#, 16#0E#, 16#00#, 16#00#, 16#E0#,
16#3C#, 16#00#, 16#01#, 16#C0#, 16#70#, 16#00#, 16#03#, 16#C3#, 16#E0#,
16#00#, 16#03#, 16#FF#, 16#80#, 16#00#, 16#03#, 16#E7#, 16#00#, 16#00#,
16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#01#,
16#E0#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#,
16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#,
16#30#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#,
16#3C#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#,
16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#,
16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#,
16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#,
16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#40#, 16#00#, 16#00#, 16#01#,
16#00#, 16#00#, 16#00#, 16#04#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#,
16#07#, 16#E0#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#01#, 16#F0#,
16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#,
16#07#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1F#,
16#00#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#C0#,
16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#,
16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#,
16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#C0#, 16#01#, 16#FF#, 16#FF#,
16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#E0#, 16#00#, 16#FF#, 16#FF#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#,
16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#,
16#07#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#,
16#F8#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#3C#,
16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#,
16#00#, 16#3F#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#0F#,
16#80#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#10#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#06#, 16#18#, 16#00#,
16#00#, 16#0C#, 16#18#, 16#00#, 16#00#, 16#38#, 16#30#, 16#00#, 16#00#,
16#30#, 16#70#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#03#,
16#80#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#,
16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#,
16#04#, 16#00#, 16#00#, 16#00#, 16#10#, 16#00#, 16#00#, 16#00#, 16#20#,
16#00#, 16#00#, 16#00#, 16#80#, 16#00#, 16#00#, 16#01#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#E0#,
16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#01#, 16#FF#,
16#E0#, 16#00#, 16#0F#, 16#81#, 16#F0#, 16#00#, 16#3C#, 16#00#, 16#70#,
16#00#, 16#E0#, 16#00#, 16#70#, 16#03#, 16#C0#, 16#F0#, 16#60#, 16#07#,
16#03#, 16#EC#, 16#60#, 16#1C#, 16#0E#, 16#38#, 16#C0#, 16#38#, 16#38#,
16#70#, 16#80#, 16#70#, 16#60#, 16#E1#, 16#01#, 16#C1#, 16#C1#, 16#82#,
16#03#, 16#83#, 16#03#, 16#04#, 16#07#, 16#06#, 16#06#, 16#08#, 16#0E#,
16#0C#, 16#1C#, 16#30#, 16#0E#, 16#38#, 16#30#, 16#60#, 16#1C#, 16#30#,
16#E1#, 16#80#, 16#38#, 16#73#, 16#C6#, 16#00#, 16#38#, 16#FD#, 16#FC#,
16#00#, 16#38#, 16#E1#, 16#E0#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#,
16#3E#, 16#00#, 16#C0#, 16#00#, 16#3F#, 16#FE#, 16#00#, 16#00#, 16#0F#,
16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#,
16#0C#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#70#,
16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#,
16#00#, 16#0B#, 16#C0#, 16#00#, 16#00#, 16#23#, 16#80#, 16#00#, 16#00#,
16#47#, 16#00#, 16#00#, 16#01#, 16#0E#, 16#00#, 16#00#, 16#06#, 16#1C#,
16#00#, 16#00#, 16#08#, 16#3C#, 16#00#, 16#00#, 16#20#, 16#38#, 16#00#,
16#00#, 16#7F#, 16#F0#, 16#00#, 16#01#, 16#FF#, 16#E0#, 16#00#, 16#06#,
16#01#, 16#C0#, 16#00#, 16#08#, 16#03#, 16#80#, 16#00#, 16#30#, 16#07#,
16#80#, 16#00#, 16#C0#, 16#0F#, 16#00#, 16#01#, 16#80#, 16#0E#, 16#00#,
16#07#, 16#00#, 16#1C#, 16#00#, 16#1E#, 16#00#, 16#7C#, 16#00#, 16#7F#,
16#03#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#00#, 16#00#,
16#07#, 16#FF#, 16#80#, 16#00#, 16#07#, 16#07#, 16#80#, 16#00#, 16#1E#,
16#07#, 16#80#, 16#00#, 16#38#, 16#0F#, 16#00#, 16#00#, 16#70#, 16#1E#,
16#00#, 16#00#, 16#E0#, 16#3C#, 16#00#, 16#03#, 16#80#, 16#F0#, 16#00#,
16#07#, 16#07#, 16#C0#, 16#00#, 16#0F#, 16#FC#, 16#00#, 16#00#, 16#3F#,
16#F8#, 16#00#, 16#00#, 16#78#, 16#7C#, 16#00#, 16#00#, 16#E0#, 16#78#,
16#00#, 16#01#, 16#C0#, 16#78#, 16#00#, 16#07#, 16#80#, 16#F0#, 16#00#,
16#0F#, 16#01#, 16#E0#, 16#00#, 16#1C#, 16#03#, 16#C0#, 16#00#, 16#78#,
16#07#, 16#80#, 16#00#, 16#F0#, 16#1E#, 16#00#, 16#01#, 16#C0#, 16#7C#,
16#00#, 16#03#, 16#81#, 16#F0#, 16#00#, 16#0F#, 16#FF#, 16#C0#, 16#00#,
16#7F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#84#,
16#00#, 16#00#, 16#FF#, 16#F8#, 16#00#, 16#07#, 16#C0#, 16#F0#, 16#00#,
16#1E#, 16#00#, 16#E0#, 16#00#, 16#78#, 16#00#, 16#C0#, 16#01#, 16#E0#,
16#01#, 16#00#, 16#07#, 16#80#, 16#02#, 16#00#, 16#1E#, 16#00#, 16#00#,
16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#,
16#E0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#80#,
16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#,
16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#40#, 16#01#, 16#E0#, 16#01#, 16#80#, 16#01#, 16#E0#,
16#06#, 16#00#, 16#01#, 16#F0#, 16#30#, 16#00#, 16#01#, 16#FF#, 16#C0#,
16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#,
16#80#, 16#00#, 16#07#, 16#FF#, 16#E0#, 16#00#, 16#0F#, 16#03#, 16#E0#,
16#00#, 16#1E#, 16#01#, 16#E0#, 16#00#, 16#3C#, 16#01#, 16#C0#, 16#00#,
16#70#, 16#03#, 16#C0#, 16#00#, 16#E0#, 16#03#, 16#80#, 16#03#, 16#C0#,
16#07#, 16#80#, 16#07#, 16#00#, 16#0F#, 16#00#, 16#0E#, 16#00#, 16#1E#,
16#00#, 16#3C#, 16#00#, 16#3C#, 16#00#, 16#78#, 16#00#, 16#78#, 16#00#,
16#E0#, 16#01#, 16#E0#, 16#01#, 16#C0#, 16#03#, 16#C0#, 16#07#, 16#80#,
16#07#, 16#80#, 16#0F#, 16#00#, 16#1E#, 16#00#, 16#1C#, 16#00#, 16#7C#,
16#00#, 16#78#, 16#00#, 16#F0#, 16#00#, 16#F0#, 16#03#, 16#C0#, 16#01#,
16#C0#, 16#1F#, 16#00#, 16#03#, 16#81#, 16#FC#, 16#00#, 16#0F#, 16#FF#,
16#E0#, 16#00#, 16#7F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#FF#, 16#F8#, 16#00#, 16#07#, 16#FF#, 16#F0#, 16#00#, 16#07#, 16#00#,
16#E0#, 16#00#, 16#1E#, 16#00#, 16#C0#, 16#00#, 16#38#, 16#01#, 16#00#,
16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#40#, 16#00#, 16#03#,
16#80#, 16#80#, 16#00#, 16#07#, 16#03#, 16#00#, 16#00#, 16#0F#, 16#FC#,
16#00#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#00#, 16#70#, 16#30#, 16#00#,
16#00#, 16#E0#, 16#40#, 16#00#, 16#01#, 16#C0#, 16#80#, 16#00#, 16#07#,
16#81#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#,
16#20#, 16#00#, 16#78#, 16#00#, 16#C0#, 16#00#, 16#F0#, 16#01#, 16#00#,
16#01#, 16#C0#, 16#0E#, 16#00#, 16#03#, 16#80#, 16#7C#, 16#00#, 16#0F#,
16#FF#, 16#F0#, 16#00#, 16#7F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#0F#, 16#FF#, 16#F8#, 16#00#, 16#07#, 16#FF#, 16#F0#, 16#00#, 16#07#,
16#00#, 16#E0#, 16#00#, 16#1E#, 16#00#, 16#C0#, 16#00#, 16#3C#, 16#01#,
16#00#, 16#00#, 16#70#, 16#02#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#,
16#03#, 16#C0#, 16#80#, 16#00#, 16#07#, 16#01#, 16#00#, 16#00#, 16#0E#,
16#04#, 16#00#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#00#, 16#7F#, 16#F0#,
16#00#, 16#00#, 16#E0#, 16#40#, 16#00#, 16#01#, 16#C0#, 16#80#, 16#00#,
16#07#, 16#81#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1C#,
16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#,
16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#,
16#0F#, 16#80#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#1F#, 16#82#, 16#00#, 16#00#, 16#FF#, 16#E4#, 16#00#,
16#07#, 16#C0#, 16#F8#, 16#00#, 16#1E#, 16#00#, 16#F0#, 16#00#, 16#78#,
16#00#, 16#C0#, 16#01#, 16#E0#, 16#00#, 16#80#, 16#07#, 16#80#, 16#01#,
16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#,
16#F8#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#C0#,
16#00#, 16#00#, 16#07#, 16#80#, 16#1F#, 16#F0#, 16#0F#, 16#00#, 16#0F#,
16#80#, 16#1C#, 16#00#, 16#1E#, 16#00#, 16#38#, 16#00#, 16#38#, 16#00#,
16#70#, 16#00#, 16#70#, 16#00#, 16#F0#, 16#00#, 16#E0#, 16#00#, 16#E0#,
16#03#, 16#C0#, 16#01#, 16#E0#, 16#07#, 16#00#, 16#01#, 16#F0#, 16#1E#,
16#00#, 16#00#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#F8#, 16#7F#, 16#C0#, 16#07#, 16#C0#, 16#1E#,
16#00#, 16#07#, 16#00#, 16#3C#, 16#00#, 16#1E#, 16#00#, 16#70#, 16#00#,
16#3C#, 16#01#, 16#E0#, 16#00#, 16#70#, 16#03#, 16#C0#, 16#00#, 16#E0#,
16#07#, 16#00#, 16#03#, 16#C0#, 16#0E#, 16#00#, 16#07#, 16#00#, 16#3C#,
16#00#, 16#0E#, 16#00#, 16#78#, 16#00#, 16#3F#, 16#FF#, 16#E0#, 16#00#,
16#7F#, 16#FF#, 16#C0#, 16#00#, 16#E0#, 16#07#, 16#80#, 16#01#, 16#C0#,
16#0E#, 16#00#, 16#07#, 16#80#, 16#1C#, 16#00#, 16#0F#, 16#00#, 16#78#,
16#00#, 16#1C#, 16#00#, 16#F0#, 16#00#, 16#78#, 16#01#, 16#C0#, 16#00#,
16#F0#, 16#03#, 16#80#, 16#01#, 16#C0#, 16#0F#, 16#00#, 16#03#, 16#80#,
16#1E#, 16#00#, 16#0F#, 16#00#, 16#7C#, 16#00#, 16#7F#, 16#C3#, 16#FE#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#C0#,
16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#,
16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#,
16#E0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#00#,
16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#,
16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#01#,
16#C0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#0E#, 16#00#,
16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#,
16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#03#,
16#80#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#00#, 16#00#,
16#7C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#C0#,
16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#,
16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#,
16#70#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#C0#,
16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#,
16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#,
16#E0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#80#,
16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#0E#, 16#1C#, 16#00#, 16#00#,
16#1C#, 16#70#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#1F#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#FF#, 16#00#,
16#07#, 16#C0#, 16#7C#, 16#00#, 16#07#, 16#00#, 16#E0#, 16#00#, 16#1E#,
16#03#, 16#80#, 16#00#, 16#3C#, 16#0C#, 16#00#, 16#00#, 16#70#, 16#30#,
16#00#, 16#00#, 16#E1#, 16#C0#, 16#00#, 16#03#, 16#C6#, 16#00#, 16#00#,
16#07#, 16#38#, 16#00#, 16#00#, 16#0E#, 16#C0#, 16#00#, 16#00#, 16#3F#,
16#80#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#E7#, 16#00#,
16#00#, 16#01#, 16#CF#, 16#00#, 16#00#, 16#07#, 16#8F#, 16#00#, 16#00#,
16#0F#, 16#0E#, 16#00#, 16#00#, 16#1C#, 16#1E#, 16#00#, 16#00#, 16#38#,
16#1C#, 16#00#, 16#00#, 16#F0#, 16#3C#, 16#00#, 16#01#, 16#C0#, 16#3C#,
16#00#, 16#03#, 16#80#, 16#78#, 16#00#, 16#0F#, 16#00#, 16#F8#, 16#00#,
16#7F#, 16#C7#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#,
16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#,
16#1E#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#70#,
16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#,
16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#,
16#3C#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#E0#,
16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#,
16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#20#, 16#00#,
16#78#, 16#00#, 16#80#, 16#00#, 16#F0#, 16#01#, 16#00#, 16#01#, 16#C0#,
16#06#, 16#00#, 16#03#, 16#80#, 16#3C#, 16#00#, 16#0F#, 16#FF#, 16#F0#,
16#00#, 16#7F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#E0#,
16#00#, 16#FC#, 16#07#, 16#C0#, 16#03#, 16#E0#, 16#07#, 16#80#, 16#07#,
16#C0#, 16#0F#, 16#00#, 16#1F#, 16#00#, 16#3E#, 16#00#, 16#7E#, 16#00#,
16#5C#, 16#00#, 16#BC#, 16#00#, 16#B8#, 16#03#, 16#70#, 16#03#, 16#70#,
16#0C#, 16#E0#, 16#06#, 16#F0#, 16#13#, 16#C0#, 16#08#, 16#E0#, 16#67#,
16#80#, 16#11#, 16#C1#, 16#8E#, 16#00#, 16#63#, 16#82#, 16#1C#, 16#00#,
16#C7#, 16#0C#, 16#78#, 16#01#, 16#0E#, 16#30#, 16#E0#, 16#06#, 16#1C#,
16#41#, 16#C0#, 16#0C#, 16#39#, 16#87#, 16#80#, 16#10#, 16#76#, 16#0F#,
16#00#, 16#20#, 16#F8#, 16#1C#, 16#00#, 16#C0#, 16#F0#, 16#38#, 16#01#,
16#81#, 16#C0#, 16#F0#, 16#06#, 16#03#, 16#01#, 16#E0#, 16#0E#, 16#06#,
16#07#, 16#C0#, 16#7F#, 16#08#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#C0#, 16#3F#, 16#80#, 16#07#, 16#80#, 16#1E#, 16#00#, 16#07#, 16#00#,
16#18#, 16#00#, 16#0F#, 16#00#, 16#60#, 16#00#, 16#3E#, 16#00#, 16#C0#,
16#00#, 16#5E#, 16#01#, 16#80#, 16#00#, 16#9C#, 16#02#, 16#00#, 16#03#,
16#3C#, 16#0C#, 16#00#, 16#06#, 16#38#, 16#18#, 16#00#, 16#08#, 16#70#,
16#20#, 16#00#, 16#10#, 16#F0#, 16#40#, 16#00#, 16#60#, 16#E1#, 16#80#,
16#00#, 16#C1#, 16#E3#, 16#00#, 16#01#, 16#01#, 16#C4#, 16#00#, 16#06#,
16#03#, 16#98#, 16#00#, 16#0C#, 16#03#, 16#B0#, 16#00#, 16#18#, 16#07#,
16#40#, 16#00#, 16#20#, 16#0F#, 16#80#, 16#00#, 16#C0#, 16#0F#, 16#00#,
16#01#, 16#80#, 16#1E#, 16#00#, 16#07#, 16#00#, 16#18#, 16#00#, 16#0E#,
16#00#, 16#30#, 16#00#, 16#7F#, 16#00#, 16#20#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#00#, 16#03#,
16#C1#, 16#E0#, 16#00#, 16#1E#, 16#01#, 16#C0#, 16#00#, 16#78#, 16#01#,
16#C0#, 16#01#, 16#E0#, 16#03#, 16#80#, 16#07#, 16#80#, 16#07#, 16#80#,
16#0F#, 16#00#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#1E#, 16#00#, 16#F8#,
16#00#, 16#3C#, 16#01#, 16#E0#, 16#00#, 16#F0#, 16#03#, 16#C0#, 16#01#,
16#E0#, 16#0F#, 16#00#, 16#03#, 16#C0#, 16#1E#, 16#00#, 16#0F#, 16#00#,
16#3C#, 16#00#, 16#1E#, 16#00#, 16#78#, 16#00#, 16#78#, 16#00#, 16#F0#,
16#00#, 16#F0#, 16#00#, 16#E0#, 16#03#, 16#C0#, 16#01#, 16#C0#, 16#0F#,
16#00#, 16#01#, 16#C0#, 16#3C#, 16#00#, 16#03#, 16#C1#, 16#F0#, 16#00#,
16#03#, 16#FF#, 16#80#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#FF#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#80#, 16#00#,
16#0F#, 16#07#, 16#80#, 16#00#, 16#1E#, 16#07#, 16#80#, 16#00#, 16#3C#,
16#0F#, 16#00#, 16#00#, 16#70#, 16#0E#, 16#00#, 16#00#, 16#E0#, 16#1C#,
16#00#, 16#03#, 16#C0#, 16#78#, 16#00#, 16#07#, 16#00#, 16#F0#, 16#00#,
16#0E#, 16#03#, 16#C0#, 16#00#, 16#3C#, 16#1F#, 16#00#, 16#00#, 16#7F#,
16#FC#, 16#00#, 16#00#, 16#EF#, 16#E0#, 16#00#, 16#01#, 16#C0#, 16#00#,
16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#,
16#1C#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#F0#,
16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#,
16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#FF#, 16#C0#,
16#00#, 16#03#, 16#C1#, 16#C0#, 16#00#, 16#0E#, 16#01#, 16#C0#, 16#00#,
16#78#, 16#03#, 16#C0#, 16#01#, 16#E0#, 16#03#, 16#80#, 16#03#, 16#80#,
16#07#, 16#00#, 16#0F#, 16#00#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#1E#,
16#00#, 16#78#, 16#00#, 16#3C#, 16#01#, 16#E0#, 16#00#, 16#78#, 16#03#,
16#C0#, 16#01#, 16#E0#, 16#07#, 16#80#, 16#03#, 16#C0#, 16#1E#, 16#00#,
16#07#, 16#80#, 16#3C#, 16#00#, 16#1E#, 16#00#, 16#78#, 16#00#, 16#3C#,
16#00#, 16#F0#, 16#00#, 16#F0#, 16#01#, 16#E0#, 16#01#, 16#C0#, 16#01#,
16#C0#, 16#07#, 16#80#, 16#03#, 16#80#, 16#1E#, 16#00#, 16#03#, 16#80#,
16#70#, 16#00#, 16#07#, 16#01#, 16#C0#, 16#00#, 16#03#, 16#DE#, 16#00#,
16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#,
16#18#, 16#00#, 16#10#, 16#00#, 16#7F#, 16#C0#, 16#C0#, 16#03#, 16#FF#,
16#FE#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#00#, 16#00#, 16#07#, 16#FF#,
16#80#, 16#00#, 16#0F#, 16#07#, 16#80#, 16#00#, 16#1E#, 16#07#, 16#80#,
16#00#, 16#38#, 16#0F#, 16#00#, 16#00#, 16#70#, 16#1E#, 16#00#, 16#00#,
16#E0#, 16#3C#, 16#00#, 16#03#, 16#80#, 16#F0#, 16#00#, 16#07#, 16#03#,
16#E0#, 16#00#, 16#0F#, 16#FF#, 16#00#, 16#00#, 16#3F#, 16#F8#, 16#00#,
16#00#, 16#71#, 16#C0#, 16#00#, 16#00#, 16#E3#, 16#C0#, 16#00#, 16#01#,
16#C3#, 16#80#, 16#00#, 16#07#, 16#87#, 16#80#, 16#00#, 16#0E#, 16#0F#,
16#00#, 16#00#, 16#1C#, 16#0E#, 16#00#, 16#00#, 16#78#, 16#1E#, 16#00#,
16#00#, 16#F0#, 16#3C#, 16#00#, 16#01#, 16#C0#, 16#38#, 16#00#, 16#03#,
16#80#, 16#78#, 16#00#, 16#0F#, 16#00#, 16#78#, 16#00#, 16#7F#, 16#C0#,
16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E1#, 16#00#, 16#00#, 16#0F#,
16#FE#, 16#00#, 16#00#, 16#3C#, 16#3C#, 16#00#, 16#00#, 16#F0#, 16#10#,
16#00#, 16#01#, 16#C0#, 16#20#, 16#00#, 16#03#, 16#80#, 16#40#, 16#00#,
16#07#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#0F#,
16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#,
16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#,
16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#40#,
16#1C#, 16#00#, 16#00#, 16#80#, 16#38#, 16#00#, 16#01#, 16#00#, 16#70#,
16#00#, 16#02#, 16#00#, 16#E0#, 16#00#, 16#06#, 16#03#, 16#C0#, 16#00#,
16#1F#, 16#0F#, 16#00#, 16#00#, 16#27#, 16#FC#, 16#00#, 16#00#, 16#43#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#FC#, 16#00#,
16#3F#, 16#FF#, 16#F8#, 16#00#, 16#70#, 16#78#, 16#70#, 16#00#, 16#C0#,
16#E0#, 16#60#, 16#01#, 16#01#, 16#C0#, 16#80#, 16#04#, 16#07#, 16#81#,
16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#,
16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#,
16#C0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#00#,
16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#,
16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#03#,
16#80#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#,
16#0F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#1F#,
16#C0#, 16#07#, 16#C0#, 16#0F#, 16#00#, 16#07#, 16#00#, 16#0C#, 16#00#,
16#1E#, 16#00#, 16#30#, 16#00#, 16#3C#, 16#00#, 16#60#, 16#00#, 16#70#,
16#00#, 16#C0#, 16#00#, 16#E0#, 16#01#, 16#00#, 16#03#, 16#C0#, 16#06#,
16#00#, 16#07#, 16#00#, 16#0C#, 16#00#, 16#0E#, 16#00#, 16#10#, 16#00#,
16#3C#, 16#00#, 16#20#, 16#00#, 16#78#, 16#00#, 16#C0#, 16#00#, 16#E0#,
16#01#, 16#80#, 16#01#, 16#C0#, 16#02#, 16#00#, 16#07#, 16#80#, 16#04#,
16#00#, 16#0F#, 16#00#, 16#18#, 16#00#, 16#1C#, 16#00#, 16#20#, 16#00#,
16#38#, 16#00#, 16#C0#, 16#00#, 16#70#, 16#01#, 16#80#, 16#00#, 16#70#,
16#06#, 16#00#, 16#00#, 16#F0#, 16#38#, 16#00#, 16#00#, 16#FF#, 16#E0#,
16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F0#,
16#3F#, 16#80#, 16#0F#, 16#80#, 16#1E#, 16#00#, 16#0E#, 16#00#, 16#38#,
16#00#, 16#1C#, 16#00#, 16#60#, 16#00#, 16#38#, 16#00#, 16#C0#, 16#00#,
16#78#, 16#03#, 16#00#, 16#00#, 16#F0#, 16#04#, 16#00#, 16#00#, 16#E0#,
16#18#, 16#00#, 16#01#, 16#C0#, 16#60#, 16#00#, 16#03#, 16#80#, 16#80#,
16#00#, 16#07#, 16#03#, 16#00#, 16#00#, 16#0E#, 16#04#, 16#00#, 16#00#,
16#1E#, 16#10#, 16#00#, 16#00#, 16#1C#, 16#60#, 16#00#, 16#00#, 16#38#,
16#80#, 16#00#, 16#00#, 16#73#, 16#00#, 16#00#, 16#00#, 16#E4#, 16#00#,
16#00#, 16#01#, 16#D0#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#,
16#03#, 16#80#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#0C#,
16#00#, 16#00#, 16#00#, 16#10#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#,
16#F3#, 16#FC#, 16#3C#, 16#0F#, 16#81#, 16#E0#, 16#18#, 16#0E#, 16#03#,
16#C0#, 16#30#, 16#1C#, 16#03#, 16#80#, 16#60#, 16#38#, 16#07#, 16#00#,
16#C0#, 16#70#, 16#0E#, 16#03#, 16#00#, 16#F0#, 16#3C#, 16#04#, 16#00#,
16#E0#, 16#78#, 16#18#, 16#01#, 16#C1#, 16#70#, 16#20#, 16#03#, 16#82#,
16#E0#, 16#C0#, 16#07#, 16#09#, 16#E1#, 16#00#, 16#0E#, 16#13#, 16#C6#,
16#00#, 16#1C#, 16#43#, 16#88#, 16#00#, 16#38#, 16#87#, 16#30#, 16#00#,
16#72#, 16#0E#, 16#40#, 16#00#, 16#F4#, 16#1D#, 16#80#, 16#00#, 16#F0#,
16#3A#, 16#00#, 16#01#, 16#E0#, 16#78#, 16#00#, 16#03#, 16#80#, 16#F0#,
16#00#, 16#07#, 16#01#, 16#C0#, 16#00#, 16#0C#, 16#03#, 16#80#, 16#00#,
16#18#, 16#02#, 16#00#, 16#00#, 16#20#, 16#04#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#1F#, 16#F0#, 16#FE#, 16#00#, 16#0F#, 16#80#, 16#F8#, 16#00#, 16#0E#,
16#00#, 16#C0#, 16#00#, 16#1E#, 16#03#, 16#00#, 16#00#, 16#3C#, 16#0C#,
16#00#, 16#00#, 16#38#, 16#30#, 16#00#, 16#00#, 16#78#, 16#E0#, 16#00#,
16#00#, 16#71#, 16#80#, 16#00#, 16#00#, 16#F6#, 16#00#, 16#00#, 16#00#,
16#F8#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#C0#,
16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#,
16#00#, 16#67#, 16#00#, 16#00#, 16#01#, 16#8F#, 16#00#, 16#00#, 16#02#,
16#0E#, 16#00#, 16#00#, 16#0C#, 16#1C#, 16#00#, 16#00#, 16#30#, 16#3C#,
16#00#, 16#00#, 16#C0#, 16#38#, 16#00#, 16#03#, 16#00#, 16#78#, 16#00#,
16#1E#, 16#00#, 16#F8#, 16#00#, 16#7F#, 16#0F#, 16#FC#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#1F#, 16#F0#, 16#FC#, 16#00#, 16#0F#, 16#80#, 16#70#, 16#00#,
16#0E#, 16#00#, 16#C0#, 16#00#, 16#1E#, 16#01#, 16#80#, 16#00#, 16#3C#,
16#06#, 16#00#, 16#00#, 16#38#, 16#18#, 16#00#, 16#00#, 16#70#, 16#60#,
16#00#, 16#00#, 16#F1#, 16#80#, 16#00#, 16#00#, 16#E2#, 16#00#, 16#00#,
16#01#, 16#CC#, 16#00#, 16#00#, 16#03#, 16#B0#, 16#00#, 16#00#, 16#07#,
16#C0#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#,
16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#,
16#00#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#07#,
16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#,
16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#FE#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#1F#, 16#FF#, 16#F0#, 16#00#, 16#3F#, 16#FF#, 16#E0#,
16#00#, 16#70#, 16#07#, 16#80#, 16#01#, 16#80#, 16#0E#, 16#00#, 16#02#,
16#00#, 16#38#, 16#00#, 16#04#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#03#,
16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#,
16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#,
16#07#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#78#,
16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#,
16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#80#, 16#00#,
16#F0#, 16#01#, 16#00#, 16#03#, 16#C0#, 16#06#, 16#00#, 16#0F#, 16#00#,
16#38#, 16#00#, 16#1F#, 16#FF#, 16#F0#, 16#00#, 16#7F#, 16#FF#, 16#E0#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#00#,
16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#,
16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#01#,
16#C0#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#06#, 16#00#,
16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#,
16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#03#,
16#80#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#,
16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#,
16#00#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#03#,
16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#,
16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#,
16#01#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#07#,
16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#38#,
16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#,
16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#,
16#00#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#01#,
16#80#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#,
16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#,
16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#,
16#18#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#30#,
16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#,
16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#,
16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#,
16#00#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#03#,
16#80#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#,
16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#,
16#00#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#07#,
16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#,
16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#,
16#01#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#0E#,
16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#,
16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#,
16#03#, 16#80#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#0C#,
16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#,
16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#,
16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#,
16#6C#, 16#00#, 16#00#, 16#01#, 16#9C#, 16#00#, 16#00#, 16#03#, 16#18#,
16#00#, 16#00#, 16#0C#, 16#38#, 16#00#, 16#00#, 16#18#, 16#30#, 16#00#,
16#00#, 16#70#, 16#70#, 16#00#, 16#00#, 16#C0#, 16#60#, 16#00#, 16#03#,
16#80#, 16#E0#, 16#00#, 16#06#, 16#00#, 16#C0#, 16#00#, 16#1C#, 16#01#,
16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#00#, 16#07#,
16#FF#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#,
16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#,
16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#,
16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E6#, 16#00#, 16#00#, 16#0E#,
16#2C#, 16#00#, 16#00#, 16#30#, 16#38#, 16#00#, 16#00#, 16#E0#, 16#60#,
16#00#, 16#03#, 16#80#, 16#C0#, 16#00#, 16#0E#, 16#03#, 16#80#, 16#00#,
16#1C#, 16#06#, 16#00#, 16#00#, 16#70#, 16#0C#, 16#00#, 16#00#, 16#E0#,
16#38#, 16#00#, 16#01#, 16#C0#, 16#F0#, 16#00#, 16#03#, 16#81#, 16#C0#,
16#00#, 16#07#, 16#05#, 16#90#, 16#00#, 16#0E#, 16#17#, 16#60#, 16#00#,
16#1F#, 16#CF#, 16#80#, 16#00#, 16#1F#, 16#0C#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#,
16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#,
16#1C#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#E0#,
16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#,
16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#7C#, 16#00#, 16#00#,
16#39#, 16#FC#, 16#00#, 16#00#, 16#64#, 16#38#, 16#00#, 16#00#, 16#D0#,
16#78#, 16#00#, 16#03#, 16#C0#, 16#70#, 16#00#, 16#07#, 16#00#, 16#E0#,
16#00#, 16#0E#, 16#03#, 16#80#, 16#00#, 16#38#, 16#07#, 16#00#, 16#00#,
16#70#, 16#1C#, 16#00#, 16#00#, 16#E0#, 16#38#, 16#00#, 16#01#, 16#80#,
16#E0#, 16#00#, 16#07#, 16#03#, 16#80#, 16#00#, 16#0E#, 16#0E#, 16#00#,
16#00#, 16#1C#, 16#38#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#,
16#00#, 16#0E#, 16#30#, 16#00#, 16#00#, 16#70#, 16#70#, 16#00#, 16#01#,
16#C0#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#,
16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#,
16#00#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#03#,
16#80#, 16#00#, 16#00#, 16#07#, 16#01#, 16#00#, 16#00#, 16#0F#, 16#0C#,
16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#07#,
16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#,
16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#,
16#01#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#01#, 16#FE#,
16#00#, 16#00#, 16#06#, 16#3C#, 16#00#, 16#00#, 16#38#, 16#38#, 16#00#,
16#00#, 16#E0#, 16#E0#, 16#00#, 16#03#, 16#81#, 16#C0#, 16#00#, 16#06#,
16#03#, 16#80#, 16#00#, 16#1C#, 16#06#, 16#00#, 16#00#, 16#70#, 16#0C#,
16#00#, 16#00#, 16#E0#, 16#38#, 16#00#, 16#01#, 16#C0#, 16#60#, 16#00#,
16#03#, 16#81#, 16#C0#, 16#00#, 16#07#, 16#07#, 16#90#, 16#00#, 16#0E#,
16#17#, 16#60#, 16#00#, 16#1F#, 16#CF#, 16#80#, 16#00#, 16#1E#, 16#0C#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#F0#, 16#00#, 16#00#, 16#0E#, 16#30#, 16#00#, 16#00#, 16#38#, 16#60#,
16#00#, 16#00#, 16#E0#, 16#C0#, 16#00#, 16#03#, 16#83#, 16#00#, 16#00#,
16#0E#, 16#0C#, 16#00#, 16#00#, 16#1C#, 16#70#, 16#00#, 16#00#, 16#7F#,
16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#,
16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#07#, 16#01#, 16#00#, 16#00#,
16#0F#, 16#0C#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#0F#,
16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#33#, 16#00#, 16#00#,
16#00#, 16#C6#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#06#,
16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#,
16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#,
16#1F#, 16#F8#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#0C#,
16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#,
16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#,
16#03#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#1C#,
16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#,
16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#,
16#07#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#18#,
16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#,
16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#04#, 16#00#, 16#00#, 16#00#,
16#30#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#1C#, 16#78#, 16#00#, 16#00#,
16#60#, 16#F0#, 16#00#, 16#01#, 16#C1#, 16#C0#, 16#00#, 16#07#, 16#03#,
16#80#, 16#00#, 16#0E#, 16#07#, 16#00#, 16#00#, 16#1C#, 16#1E#, 16#00#,
16#00#, 16#18#, 16#38#, 16#00#, 16#00#, 16#38#, 16#E0#, 16#00#, 16#00#,
16#1F#, 16#00#, 16#00#, 16#00#, 16#40#, 16#00#, 16#00#, 16#01#, 16#80#,
16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#,
16#00#, 16#13#, 16#F0#, 16#00#, 16#00#, 16#40#, 16#F0#, 16#00#, 16#01#,
16#00#, 16#60#, 16#00#, 16#02#, 16#00#, 16#C0#, 16#00#, 16#04#, 16#01#,
16#80#, 16#00#, 16#0C#, 16#03#, 16#00#, 16#00#, 16#1C#, 16#18#, 16#00#,
16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#00#,
16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#,
16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#01#,
16#C0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#06#, 16#00#,
16#00#, 16#00#, 16#1C#, 16#3C#, 16#00#, 16#00#, 16#38#, 16#FC#, 16#00#,
16#00#, 16#73#, 16#38#, 16#00#, 16#00#, 16#C8#, 16#70#, 16#00#, 16#03#,
16#A1#, 16#C0#, 16#00#, 16#07#, 16#83#, 16#80#, 16#00#, 16#0F#, 16#07#,
16#00#, 16#00#, 16#1C#, 16#0C#, 16#00#, 16#00#, 16#70#, 16#38#, 16#00#,
16#00#, 16#E0#, 16#70#, 16#00#, 16#01#, 16#C0#, 16#C0#, 16#00#, 16#03#,
16#03#, 16#90#, 16#00#, 16#0E#, 16#07#, 16#60#, 16#00#, 16#1C#, 16#0F#,
16#80#, 16#00#, 16#30#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#,
16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#,
16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#,
16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#,
16#01#, 16#80#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#0E#,
16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#,
16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#,
16#03#, 16#10#, 16#00#, 16#00#, 16#0E#, 16#40#, 16#00#, 16#00#, 16#1F#,
16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#07#,
16#00#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#3F#,
16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#,
16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#,
16#01#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#0E#,
16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#,
16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#,
16#03#, 16#80#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#0C#,
16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#,
16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#,
16#06#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#,
16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#,
16#1C#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#E0#,
16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#,
16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#7E#, 16#00#, 16#00#,
16#38#, 16#30#, 16#00#, 16#00#, 16#70#, 16#C0#, 16#00#, 16#00#, 16#C3#,
16#00#, 16#00#, 16#03#, 16#88#, 16#00#, 16#00#, 16#07#, 16#20#, 16#00#,
16#00#, 16#0D#, 16#C0#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#,
16#73#, 16#80#, 16#00#, 16#00#, 16#E7#, 16#00#, 16#00#, 16#01#, 16#87#,
16#00#, 16#00#, 16#03#, 16#0E#, 16#20#, 16#00#, 16#0E#, 16#0E#, 16#80#,
16#00#, 16#1C#, 16#1F#, 16#00#, 16#00#, 16#30#, 16#1C#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#,
16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#,
16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#,
16#E0#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#80#,
16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#,
16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#,
16#C0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#07#, 16#00#,
16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#,
16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#01#,
16#C8#, 16#00#, 16#00#, 16#03#, 16#20#, 16#00#, 16#00#, 16#0E#, 16#C0#,
16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#38#,
16#1C#, 16#00#, 16#F8#, 16#F8#, 16#F8#, 16#00#, 16#72#, 16#73#, 16#30#,
16#00#, 16#C8#, 16#EC#, 16#E0#, 16#03#, 16#A1#, 16#F1#, 16#C0#, 16#07#,
16#83#, 16#43#, 16#80#, 16#0D#, 16#0F#, 16#06#, 16#00#, 16#3C#, 16#1C#,
16#1C#, 16#00#, 16#70#, 16#38#, 16#38#, 16#00#, 16#E0#, 16#60#, 16#70#,
16#01#, 16#C1#, 16#C0#, 16#C0#, 16#07#, 16#03#, 16#83#, 16#90#, 16#0E#,
16#06#, 16#07#, 16#40#, 16#1C#, 16#1C#, 16#0F#, 16#80#, 16#30#, 16#38#,
16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#,
16#3C#, 16#00#, 16#00#, 16#F8#, 16#F8#, 16#00#, 16#00#, 16#72#, 16#30#,
16#00#, 16#00#, 16#C8#, 16#E0#, 16#00#, 16#03#, 16#A1#, 16#C0#, 16#00#,
16#07#, 16#83#, 16#80#, 16#00#, 16#0D#, 16#06#, 16#00#, 16#00#, 16#3C#,
16#1C#, 16#00#, 16#00#, 16#70#, 16#38#, 16#00#, 16#00#, 16#E0#, 16#70#,
16#00#, 16#01#, 16#C0#, 16#C0#, 16#00#, 16#07#, 16#03#, 16#90#, 16#00#,
16#0E#, 16#07#, 16#40#, 16#00#, 16#1C#, 16#0F#, 16#00#, 16#00#, 16#30#,
16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#01#, 16#F8#, 16#00#, 16#00#, 16#0E#, 16#38#, 16#00#, 16#00#, 16#38#,
16#38#, 16#00#, 16#00#, 16#E0#, 16#70#, 16#00#, 16#03#, 16#80#, 16#E0#,
16#00#, 16#0E#, 16#01#, 16#C0#, 16#00#, 16#1C#, 16#03#, 16#80#, 16#00#,
16#78#, 16#07#, 16#00#, 16#00#, 16#E0#, 16#1C#, 16#00#, 16#01#, 16#C0#,
16#38#, 16#00#, 16#03#, 16#80#, 16#E0#, 16#00#, 16#07#, 16#01#, 16#80#,
16#00#, 16#0E#, 16#06#, 16#00#, 16#00#, 16#0E#, 16#38#, 16#00#, 16#00#,
16#0F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#1C#, 16#78#, 16#00#, 16#00#, 16#F9#, 16#F8#, 16#00#, 16#00#,
16#74#, 16#78#, 16#00#, 16#00#, 16#F0#, 16#70#, 16#00#, 16#01#, 16#C0#,
16#E0#, 16#00#, 16#07#, 16#01#, 16#C0#, 16#00#, 16#0E#, 16#03#, 16#80#,
16#00#, 16#18#, 16#07#, 16#00#, 16#00#, 16#30#, 16#1C#, 16#00#, 16#00#,
16#E0#, 16#38#, 16#00#, 16#01#, 16#C0#, 16#E0#, 16#00#, 16#03#, 16#03#,
16#80#, 16#00#, 16#0E#, 16#0E#, 16#00#, 16#00#, 16#1C#, 16#38#, 16#00#,
16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#01#,
16#C0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#07#, 16#00#,
16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#,
16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#01#, 16#F7#, 16#00#, 16#00#, 16#06#, 16#2C#, 16#00#,
16#00#, 16#38#, 16#38#, 16#00#, 16#00#, 16#E0#, 16#70#, 16#00#, 16#03#,
16#80#, 16#C0#, 16#00#, 16#06#, 16#01#, 16#80#, 16#00#, 16#1C#, 16#07#,
16#00#, 16#00#, 16#70#, 16#0E#, 16#00#, 16#00#, 16#E0#, 16#38#, 16#00#,
16#01#, 16#C0#, 16#70#, 16#00#, 16#03#, 16#81#, 16#E0#, 16#00#, 16#07#,
16#05#, 16#80#, 16#00#, 16#0E#, 16#33#, 16#00#, 16#00#, 16#1F#, 16#CE#,
16#00#, 16#00#, 16#1F#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#,
16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#,
16#03#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#1C#,
16#00#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#7C#, 16#70#, 16#00#, 16#00#, 16#39#, 16#F0#,
16#00#, 16#00#, 16#74#, 16#C0#, 16#00#, 16#00#, 16#D0#, 16#00#, 16#00#,
16#01#, 16#A0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#0F#,
16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#,
16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#,
16#03#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#1C#,
16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#A0#, 16#00#, 16#00#, 16#31#,
16#C0#, 16#00#, 16#00#, 16#E1#, 16#80#, 16#00#, 16#01#, 16#C1#, 16#00#,
16#00#, 16#03#, 16#82#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#,
16#07#, 16#80#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#07#,
16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#04#, 16#0E#, 16#00#,
16#00#, 16#0C#, 16#1C#, 16#00#, 16#00#, 16#18#, 16#38#, 16#00#, 16#00#,
16#38#, 16#E0#, 16#00#, 16#00#, 16#4F#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#40#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#,
16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#00#,
16#FF#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#C0#,
16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#,
16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#,
16#70#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#80#,
16#00#, 16#00#, 16#03#, 16#20#, 16#00#, 16#00#, 16#0E#, 16#80#, 16#00#,
16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#0E#, 16#00#,
16#00#, 16#F8#, 16#18#, 16#00#, 16#00#, 16#60#, 16#70#, 16#00#, 16#01#,
16#C0#, 16#E0#, 16#00#, 16#03#, 16#83#, 16#C0#, 16#00#, 16#07#, 16#07#,
16#00#, 16#00#, 16#0C#, 16#1E#, 16#00#, 16#00#, 16#38#, 16#3C#, 16#00#,
16#00#, 16#70#, 16#B8#, 16#00#, 16#00#, 16#E3#, 16#60#, 16#00#, 16#01#,
16#85#, 16#C0#, 16#00#, 16#07#, 16#13#, 16#90#, 16#00#, 16#0E#, 16#46#,
16#40#, 16#00#, 16#1F#, 16#0F#, 16#00#, 16#00#, 16#1C#, 16#1C#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#0C#,
16#00#, 16#00#, 16#F8#, 16#1C#, 16#00#, 16#00#, 16#70#, 16#38#, 16#00#,
16#00#, 16#60#, 16#30#, 16#00#, 16#00#, 16#E0#, 16#60#, 16#00#, 16#01#,
16#C0#, 16#80#, 16#00#, 16#03#, 16#82#, 16#00#, 16#00#, 16#07#, 16#04#,
16#00#, 16#00#, 16#0E#, 16#10#, 16#00#, 16#00#, 16#0C#, 16#40#, 16#00#,
16#00#, 16#19#, 16#00#, 16#00#, 16#00#, 16#34#, 16#00#, 16#00#, 16#00#,
16#70#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#,
16#04#, 16#0C#, 16#00#, 16#F8#, 16#08#, 16#1C#, 16#00#, 16#70#, 16#38#,
16#38#, 16#00#, 16#E0#, 16#70#, 16#30#, 16#00#, 16#C1#, 16#E0#, 16#40#,
16#01#, 16#85#, 16#C0#, 16#80#, 16#03#, 16#93#, 16#82#, 16#00#, 16#07#,
16#23#, 16#08#, 16#00#, 16#0E#, 16#86#, 16#10#, 16#00#, 16#1D#, 16#0C#,
16#40#, 16#00#, 16#3C#, 16#19#, 16#00#, 16#00#, 16#70#, 16#34#, 16#00#,
16#00#, 16#E0#, 16#70#, 16#00#, 16#01#, 16#80#, 16#C0#, 16#00#, 16#01#,
16#01#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#0E#, 16#1C#, 16#00#, 16#00#, 16#7C#, 16#7C#, 16#00#, 16#01#, 16#39#,
16#B0#, 16#00#, 16#00#, 16#3A#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#,
16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#,
16#01#, 16#80#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#1F#,
16#00#, 16#00#, 16#00#, 16#26#, 16#00#, 16#00#, 16#00#, 16#8C#, 16#40#,
16#00#, 16#02#, 16#1D#, 16#80#, 16#00#, 16#38#, 16#3E#, 16#00#, 16#00#,
16#60#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#0C#, 16#0C#, 16#00#, 16#00#, 16#FC#, 16#1C#, 16#00#, 16#00#,
16#38#, 16#38#, 16#00#, 16#00#, 16#70#, 16#30#, 16#00#, 16#00#, 16#70#,
16#20#, 16#00#, 16#00#, 16#E0#, 16#80#, 16#00#, 16#00#, 16#C1#, 16#00#,
16#00#, 16#01#, 16#C2#, 16#00#, 16#00#, 16#03#, 16#88#, 16#00#, 16#00#,
16#07#, 16#30#, 16#00#, 16#00#, 16#06#, 16#40#, 16#00#, 16#00#, 16#0D#,
16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#,
16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#,
16#01#, 16#00#, 16#00#, 16#00#, 16#04#, 16#00#, 16#00#, 16#00#, 16#10#,
16#00#, 16#00#, 16#00#, 16#40#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#,
16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#3F#, 16#F0#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#,
16#00#, 16#81#, 16#00#, 16#00#, 16#02#, 16#06#, 16#00#, 16#00#, 16#00#,
16#08#, 16#00#, 16#00#, 16#00#, 16#20#, 16#00#, 16#00#, 16#00#, 16#80#,
16#00#, 16#00#, 16#02#, 16#00#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#,
16#00#, 16#20#, 16#00#, 16#00#, 16#00#, 16#80#, 16#00#, 16#00#, 16#01#,
16#00#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#,
16#00#, 16#00#, 16#5F#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#38#, 16#00#,
16#00#, 16#07#, 16#20#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#,
16#E0#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#07#, 16#00#,
16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#,
16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#01#,
16#80#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#,
16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#,
16#00#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#0E#,
16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#,
16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#,
16#01#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#07#,
16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#,
16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#,
16#01#, 16#80#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#03#,
16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#18#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#60#,
16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#,
16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#,
16#0C#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#30#,
16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#,
16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#,
16#06#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#18#,
16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#,
16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#,
16#03#, 16#00#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#,
16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#,
16#03#, 16#80#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#0E#,
16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#,
16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#,
16#03#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#1C#,
16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#,
16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#,
16#07#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#38#,
16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#,
16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#,
16#0E#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#70#,
16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#,
16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#F8#,
16#70#, 16#00#, 16#38#, 16#7F#, 16#C0#, 16#00#, 16#00#, 16#1E#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#,
16#00#, 16#00#, 16#00#, 16#00#);
Font_D : aliased constant Bitmap_Font :=
(
Bytes_Per_Glyph => 163,
Glyph_Width => 31,
Glyph_Height => 42,
Data => FreeSerifItalic18pt7bBitmaps'Access);
Font : constant Bitmap_Font_Ref := Font_D'Access;
end GESTE_Fonts.FreeSerifItalic18pt7b;
| 73.552647 | 73 | 0.487247 |
576c84ab267f04232898218d33e98f79f8baade4 | 2,575 | ads | Ada | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-ngcefu.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | 12 | 2017-06-08T14:19:57.000Z | 2022-03-09T02:48:59.000Z | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-ngcefu.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | 6 | 2017-06-08T13:13:50.000Z | 2020-05-15T09:32:43.000Z | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-ngcefu.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | 3 | 2017-06-30T14:05:06.000Z | 2022-02-17T12:20:45.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- ADA.NUMERICS.GENERIC_COMPLEX_ELEMENTARY_FUNCTIONS --
-- --
-- S p e c --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. In accordance with the copyright of that document, you can freely --
-- copy and modify this specification, provided that if you redistribute a --
-- modified version, any changes that you have made are clearly indicated. --
-- --
------------------------------------------------------------------------------
with Ada.Numerics.Generic_Complex_Types;
generic
with package Complex_Types is new Ada.Numerics.Generic_Complex_Types (<>);
use Complex_Types;
package Ada.Numerics.Generic_Complex_Elementary_Functions is
pragma Pure;
function Sqrt (X : Complex) return Complex;
function Log (X : Complex) return Complex;
function Exp (X : Complex) return Complex;
function Exp (X : Imaginary) return Complex;
function "**" (Left : Complex; Right : Complex) return Complex;
function "**" (Left : Complex; Right : Real'Base) return Complex;
function "**" (Left : Real'Base; Right : Complex) return Complex;
function Sin (X : Complex) return Complex;
function Cos (X : Complex) return Complex;
function Tan (X : Complex) return Complex;
function Cot (X : Complex) return Complex;
function Arcsin (X : Complex) return Complex;
function Arccos (X : Complex) return Complex;
function Arctan (X : Complex) return Complex;
function Arccot (X : Complex) return Complex;
function Sinh (X : Complex) return Complex;
function Cosh (X : Complex) return Complex;
function Tanh (X : Complex) return Complex;
function Coth (X : Complex) return Complex;
function Arcsinh (X : Complex) return Complex;
function Arccosh (X : Complex) return Complex;
function Arctanh (X : Complex) return Complex;
function Arccoth (X : Complex) return Complex;
end Ada.Numerics.Generic_Complex_Elementary_Functions;
| 45.982143 | 78 | 0.526214 |
419c933d74cfcef3e975e43ba33da87246b84c77 | 2,008 | adb | Ada | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/excep_handle/foo.adb | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | 3 | 2021-05-04T17:09:06.000Z | 2021-10-04T07:19:26.000Z | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/excep_handle/foo.adb | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | null | null | null | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/excep_handle/foo.adb | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | null | null | null | -- Copyright 2018-2020 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with Pck; use Pck;
procedure Foo is
begin
-- Part 1 of the testcase
begin
raise Constraint_Error;
exception
when Constraint_Error =>
null;
end;
begin
null;
exception
when others =>
null;
end;
begin
raise Storage_Error;
exception
when Storage_Error =>
null;
end;
-- Part 2 of the testcase
begin
raise ABORT_SIGNAL;
exception
when others =>
null;
end;
begin
raise Program_Error;
exception
when Program_Error =>
null;
end;
begin
raise Storage_Error;
exception
when Storage_Error =>
null;
end;
-- Part 3 of the testcase
begin
Global_Var := Global_Var + 1;
raise ABORT_SIGNAL;
exception
when others =>
null;
end;
begin
Global_Var := Global_Var + 1;
raise Constraint_Error;
exception
when Constraint_Error =>
null;
end;
-- Part 4 of the testcase
begin
Global_Var := Global_Var + 1;
raise Program_Error;
exception
when others =>
null;
end;
begin
Global_Var := Global_Var + 1;
raise Program_Error;
exception
when Program_Error =>
null;
end;
end Foo;
| 19.307692 | 73 | 0.62251 |
57e5bc1a2acaf2918826b49c5a03ebcacdaeb45a | 5,019 | ads | Ada | Ada95/samples/sample-form_demo-aux.ads | tizenorg/external.ncurses | eec8a5e3f767faa476f07eb6b54d493fe7920eca | [
"DOC",
"Unlicense"
] | null | null | null | Ada95/samples/sample-form_demo-aux.ads | tizenorg/external.ncurses | eec8a5e3f767faa476f07eb6b54d493fe7920eca | [
"DOC",
"Unlicense"
] | null | null | null | Ada95/samples/sample-form_demo-aux.ads | tizenorg/external.ncurses | eec8a5e3f767faa476f07eb6b54d493fe7920eca | [
"DOC",
"Unlicense"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding Samples --
-- --
-- Sample.Form_Demo.Aux --
-- --
-- S P E C --
-- --
------------------------------------------------------------------------------
-- Copyright (c) 1998-2003,2009 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: Juergen Pfeifer, 1996
-- Version Control
-- $Revision: 1.10 $
-- Binding Version 01.00
------------------------------------------------------------------------------
with Terminal_Interface.Curses; use Terminal_Interface.Curses;
with Terminal_Interface.Curses.Panels; use Terminal_Interface.Curses.Panels;
with Terminal_Interface.Curses.Forms; use Terminal_Interface.Curses.Forms;
package Sample.Form_Demo.Aux is
procedure Geometry (F : Form;
L : out Line_Count;
C : out Column_Count;
Y : out Line_Position;
X : out Column_Position);
-- Calculate the geometry for a panel beeing able to be used to display
-- the menu.
function Create (F : Form;
Title : String;
Lin : Line_Position;
Col : Column_Position) return Panel;
-- Create a panel decorated with a frame and the title at the specified
-- position. The dimension of the panel is derived from the menus layout.
procedure Destroy (F : Form;
P : in out Panel);
-- Destroy all the windowing structures associated with this menu and
-- panel.
function Get_Request (F : Form;
P : Panel;
Handle_CRLF : Boolean := True) return Key_Code;
-- Centralized request driver for all menus in this sample. This
-- gives us a common key binding for all menus.
function Make (Top : Line_Position;
Left : Column_Position;
Text : String) return Field;
-- create a label
function Make (Height : Line_Count := 1;
Width : Column_Count;
Top : Line_Position;
Left : Column_Position;
Off_Screen : Natural := 0) return Field;
-- create a editable field
function Default_Driver (F : Form;
K : Key_Code;
P : Panel) return Boolean;
function Count_Active (F : Form) return Natural;
-- Count the number of active fields in the form
end Sample.Form_Demo.Aux;
| 53.967742 | 78 | 0.46842 |
41f160d513d5e7c209779f783e6cc841fd8827c2 | 79,933 | adb | Ada | hls_video_block/solution1/.autopilot/db/hls_video_block.bind.adb | parker-xilinx/HLS_2d_filter | 25c85715167623c07bd5f06a8747961cdafee616 | [
"Unlicense"
] | 1 | 2019-12-22T12:22:36.000Z | 2019-12-22T12:22:36.000Z | hls_video_block/solution1/.autopilot/db/hls_video_block.bind.adb | parker-xilinx/HLS_2d_filter | 25c85715167623c07bd5f06a8747961cdafee616 | [
"Unlicense"
] | null | null | null | hls_video_block/solution1/.autopilot/db/hls_video_block.bind.adb | parker-xilinx/HLS_2d_filter | 25c85715167623c07bd5f06a8747961cdafee616 | [
"Unlicense"
] | 2 | 2019-12-22T12:22:38.000Z | 2021-04-30T00:59:20.000Z | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="15">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>hls_video_block</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>14</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>VIDEO_IN_V_data_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>INPUT_STREAM.V.data.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>VIDEO_IN_V_keep_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>INPUT_STREAM.V.keep.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</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>VIDEO_IN_V_strb_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>INPUT_STREAM.V.strb.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</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>VIDEO_IN_V_user_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>INPUT_STREAM.V.user.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_5">
<Value>
<Obj>
<type>1</type>
<id>5</id>
<name>VIDEO_IN_V_last_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>INPUT_STREAM.V.last.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_6">
<Value>
<Obj>
<type>1</type>
<id>6</id>
<name>VIDEO_IN_V_id_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>INPUT_STREAM.V.id.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_7">
<Value>
<Obj>
<type>1</type>
<id>7</id>
<name>VIDEO_IN_V_dest_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>INPUT_STREAM.V.dest.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_8">
<Value>
<Obj>
<type>1</type>
<id>8</id>
<name>VIDEO_OUT_V_data_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>OUTPUT_STREAM.V.data.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<direction>1</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="_9">
<Value>
<Obj>
<type>1</type>
<id>9</id>
<name>VIDEO_OUT_V_keep_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>OUTPUT_STREAM.V.keep.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<direction>1</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="_10">
<Value>
<Obj>
<type>1</type>
<id>10</id>
<name>VIDEO_OUT_V_strb_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>OUTPUT_STREAM.V.strb.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<direction>1</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="_11">
<Value>
<Obj>
<type>1</type>
<id>11</id>
<name>VIDEO_OUT_V_user_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>OUTPUT_STREAM.V.user.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>1</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="_12">
<Value>
<Obj>
<type>1</type>
<id>12</id>
<name>VIDEO_OUT_V_last_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>OUTPUT_STREAM.V.last.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>1</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="_13">
<Value>
<Obj>
<type>1</type>
<id>13</id>
<name>VIDEO_OUT_V_id_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>OUTPUT_STREAM.V.id.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>1</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="_14">
<Value>
<Obj>
<type>1</type>
<id>14</id>
<name>VIDEO_OUT_V_dest_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>OUTPUT_STREAM.V.dest.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>1</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>in_tmp_data_V</name>
<fileName>hls_video_block.cpp</fileName>
<fileDirectory>C:\Users\parkerh\Documents\2d_filter_xfopencv</fileDirectory>
<lineNumber>178</lineNumber>
<contextFuncName>hls_video_block</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>C:\Users\parkerh\Documents\2d_filter_xfopencv</first>
<second class_id="11" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="12" tracking_level="0" version="0">
<first class_id="13" tracking_level="0" version="0">
<first>hls_video_block.cpp</first>
<second>hls_video_block</second>
</first>
<second>178</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>in_tmp.data.V</originalName>
<rtlName></rtlName>
<coreName>FIFO</coreName>
</Obj>
<bitwidth>24</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>im_1_data_V</name>
<fileName>hls_video_block.cpp</fileName>
<fileDirectory>C:\Users\parkerh\Documents\2d_filter_xfopencv</fileDirectory>
<lineNumber>179</lineNumber>
<contextFuncName>hls_video_block</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\parkerh\Documents\2d_filter_xfopencv</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_video_block.cpp</first>
<second>hls_video_block</second>
</first>
<second>179</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>im_1.data.V</originalName>
<rtlName></rtlName>
<coreName>FIFO</coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>im_2_data_V</name>
<fileName>hls_video_block.cpp</fileName>
<fileDirectory>C:\Users\parkerh\Documents\2d_filter_xfopencv</fileDirectory>
<lineNumber>180</lineNumber>
<contextFuncName>hls_video_block</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\parkerh\Documents\2d_filter_xfopencv</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_video_block.cpp</first>
<second>hls_video_block</second>
</first>
<second>180</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>im_2.data.V</originalName>
<rtlName></rtlName>
<coreName>FIFO</coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>3</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>out_tmp_data_V</name>
<fileName>hls_video_block.cpp</fileName>
<fileDirectory>C:\Users\parkerh\Documents\2d_filter_xfopencv</fileDirectory>
<lineNumber>181</lineNumber>
<contextFuncName>hls_video_block</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\parkerh\Documents\2d_filter_xfopencv</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_video_block.cpp</first>
<second>hls_video_block</second>
</first>
<second>181</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>out_tmp.data.V</originalName>
<rtlName></rtlName>
<coreName>FIFO</coreName>
</Obj>
<bitwidth>17</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</oprand_edges>
<opcode>alloca</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name></name>
<fileName>hls_video_block.cpp</fileName>
<fileDirectory>C:\Users\parkerh\Documents\2d_filter_xfopencv</fileDirectory>
<lineNumber>189</lineNumber>
<contextFuncName>hls_video_block</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\parkerh\Documents\2d_filter_xfopencv</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_video_block.cpp</first>
<second>hls_video_block</second>
</first>
<second>189</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>10</count>
<item_version>0</item_version>
<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>76</item>
<item>77</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name></name>
<fileName>hls_video_block.cpp</fileName>
<fileDirectory>C:\Users\parkerh\Documents\2d_filter_xfopencv</fileDirectory>
<lineNumber>192</lineNumber>
<contextFuncName>hls_video_block</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\parkerh\Documents\2d_filter_xfopencv</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_video_block.cpp</first>
<second>hls_video_block</second>
</first>
<second>192</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>79</item>
<item>80</item>
<item>81</item>
<item>438</item>
<item>439</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name></name>
<fileName>hls_video_block.cpp</fileName>
<fileDirectory>C:\Users\parkerh\Documents\2d_filter_xfopencv</fileDirectory>
<lineNumber>193</lineNumber>
<contextFuncName>hls_video_block</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\parkerh\Documents\2d_filter_xfopencv</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_video_block.cpp</first>
<second>hls_video_block</second>
</first>
<second>193</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>83</item>
<item>84</item>
<item>85</item>
<item>437</item>
<item>440</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>7</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name></name>
<fileName>hls_video_block.cpp</fileName>
<fileDirectory>C:\Users\parkerh\Documents\2d_filter_xfopencv</fileDirectory>
<lineNumber>194</lineNumber>
<contextFuncName>hls_video_block</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\parkerh\Documents\2d_filter_xfopencv</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_video_block.cpp</first>
<second>hls_video_block</second>
</first>
<second>194</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>5</count>
<item_version>0</item_version>
<item>87</item>
<item>88</item>
<item>89</item>
<item>436</item>
<item>441</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>8</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name></name>
<fileName>hls_video_block.cpp</fileName>
<fileDirectory>C:\Users\parkerh\Documents\2d_filter_xfopencv</fileDirectory>
<lineNumber>197</lineNumber>
<contextFuncName>hls_video_block</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\parkerh\Documents\2d_filter_xfopencv</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_video_block.cpp</first>
<second>hls_video_block</second>
</first>
<second>197</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>12</count>
<item_version>0</item_version>
<item>91</item>
<item>92</item>
<item>93</item>
<item>94</item>
<item>95</item>
<item>96</item>
<item>97</item>
<item>98</item>
<item>99</item>
<item>100</item>
<item>435</item>
<item>442</item>
</oprand_edges>
<opcode>call</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>9</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>59</id>
<name></name>
<fileName>hls_video_block.cpp</fileName>
<fileDirectory>C:\Users\parkerh\Documents\2d_filter_xfopencv</fileDirectory>
<lineNumber>199</lineNumber>
<contextFuncName>hls_video_block</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>C:\Users\parkerh\Documents\2d_filter_xfopencv</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_video_block.cpp</first>
<second>hls_video_block</second>
</first>
<second>199</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>10</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_25">
<Value>
<Obj>
<type>2</type>
<id>61</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_26">
<Value>
<Obj>
<type>2</type>
<id>66</id>
<name>strm2mat</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:strm2mat></content>
</item>
<item class_id_reference="16" object_id="_27">
<Value>
<Obj>
<type>2</type>
<id>75</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<const_type>0</const_type>
<content>921600</content>
</item>
<item class_id_reference="16" object_id="_28">
<Value>
<Obj>
<type>2</type>
<id>78</id>
<name>rgb2gry</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:rgb2gry></content>
</item>
<item class_id_reference="16" object_id="_29">
<Value>
<Obj>
<type>2</type>
<id>82</id>
<name>hls_2DFilter</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:hls_2DFilter></content>
</item>
<item class_id_reference="16" object_id="_30">
<Value>
<Obj>
<type>2</type>
<id>86</id>
<name>gry2rgb</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:gry2rgb></content>
</item>
<item class_id_reference="16" object_id="_31">
<Value>
<Obj>
<type>2</type>
<id>90</id>
<name>mat2strm</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<const_type>6</const_type>
<content><constant:mat2strm></content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_32">
<Obj>
<type>3</type>
<id>60</id>
<name>hls_video_block</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>10</count>
<item_version>0</item_version>
<item>31</item>
<item>34</item>
<item>37</item>
<item>40</item>
<item>46</item>
<item>49</item>
<item>52</item>
<item>55</item>
<item>58</item>
<item>59</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>41</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_33">
<id>62</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_34">
<id>63</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_35">
<id>64</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_36">
<id>65</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_37">
<id>67</id>
<edge_type>1</edge_type>
<source_obj>66</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_38">
<id>68</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_39">
<id>69</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_40">
<id>70</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_41">
<id>71</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_42">
<id>72</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_43">
<id>73</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_44">
<id>74</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_45">
<id>76</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_46">
<id>77</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_47">
<id>79</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_48">
<id>80</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_49">
<id>81</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_50">
<id>83</id>
<edge_type>1</edge_type>
<source_obj>82</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_51">
<id>84</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_52">
<id>85</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_53">
<id>87</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_54">
<id>88</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_55">
<id>89</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_56">
<id>91</id>
<edge_type>1</edge_type>
<source_obj>90</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_57">
<id>92</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_58">
<id>93</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_59">
<id>94</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_60">
<id>95</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_61">
<id>96</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_62">
<id>97</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_63">
<id>98</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_64">
<id>99</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_65">
<id>100</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_66">
<id>435</id>
<edge_type>4</edge_type>
<source_obj>55</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_67">
<id>436</id>
<edge_type>4</edge_type>
<source_obj>52</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_68">
<id>437</id>
<edge_type>4</edge_type>
<source_obj>49</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_69">
<id>438</id>
<edge_type>4</edge_type>
<source_obj>46</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_70">
<id>439</id>
<edge_type>4</edge_type>
<source_obj>46</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_71">
<id>440</id>
<edge_type>4</edge_type>
<source_obj>49</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_72">
<id>441</id>
<edge_type>4</edge_type>
<source_obj>52</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_73">
<id>442</id>
<edge_type>4</edge_type>
<source_obj>55</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_74">
<mId>1</mId>
<mTag>hls_video_block</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>60</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>2772814</mMinLatency>
<mMaxLatency>2772814</mMaxLatency>
<mIsDfPipe>1</mIsDfPipe>
<mDfPipe class_id="23" tracking_level="1" version="0" object_id="_75">
<port_list class_id="24" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port_list>
<process_list class_id="25" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_76">
<type>0</type>
<name>strm2mat_U0</name>
<ssdmobj_id>46</ssdmobj_id>
<pins class_id="27" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_77">
<port class_id="29" tracking_level="1" version="0" object_id="_78">
<name>IN_V_data_V</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id="30" tracking_level="1" version="0" object_id="_79">
<type>0</type>
<name>strm2mat_U0</name>
<ssdmobj_id>46</ssdmobj_id>
</inst>
</item>
<item class_id_reference="28" object_id="_80">
<port class_id_reference="29" object_id="_81">
<name>IN_V_keep_V</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_79"></inst>
</item>
<item class_id_reference="28" object_id="_82">
<port class_id_reference="29" object_id="_83">
<name>IN_V_strb_V</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_79"></inst>
</item>
<item class_id_reference="28" object_id="_84">
<port class_id_reference="29" object_id="_85">
<name>IN_V_user_V</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_79"></inst>
</item>
<item class_id_reference="28" object_id="_86">
<port class_id_reference="29" object_id="_87">
<name>IN_V_last_V</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_79"></inst>
</item>
<item class_id_reference="28" object_id="_88">
<port class_id_reference="29" object_id="_89">
<name>IN_V_id_V</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_79"></inst>
</item>
<item class_id_reference="28" object_id="_90">
<port class_id_reference="29" object_id="_91">
<name>IN_V_dest_V</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_79"></inst>
</item>
<item class_id_reference="28" object_id="_92">
<port class_id_reference="29" object_id="_93">
<name>OUT_size_read</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_79"></inst>
</item>
<item class_id_reference="28" object_id="_94">
<port class_id_reference="29" object_id="_95">
<name>OUT_data_V</name>
<dir>0</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_79"></inst>
</item>
</pins>
</item>
<item class_id_reference="26" object_id="_96">
<type>0</type>
<name>rgb2gry_U0</name>
<ssdmobj_id>49</ssdmobj_id>
<pins>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_97">
<port class_id_reference="29" object_id="_98">
<name>input_mat_data_V</name>
<dir>0</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id="_99">
<type>0</type>
<name>rgb2gry_U0</name>
<ssdmobj_id>49</ssdmobj_id>
</inst>
</item>
<item class_id_reference="28" object_id="_100">
<port class_id_reference="29" object_id="_101">
<name>output_mat_data_V</name>
<dir>0</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_99"></inst>
</item>
</pins>
</item>
<item class_id_reference="26" object_id="_102">
<type>0</type>
<name>hls_2DFilter_U0</name>
<ssdmobj_id>52</ssdmobj_id>
<pins>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_103">
<port class_id_reference="29" object_id="_104">
<name>input_mat_data_V</name>
<dir>0</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id="_105">
<type>0</type>
<name>hls_2DFilter_U0</name>
<ssdmobj_id>52</ssdmobj_id>
</inst>
</item>
<item class_id_reference="28" object_id="_106">
<port class_id_reference="29" object_id="_107">
<name>output_mat_data_V</name>
<dir>0</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_105"></inst>
</item>
</pins>
</item>
<item class_id_reference="26" object_id="_108">
<type>0</type>
<name>gry2rgb_U0</name>
<ssdmobj_id>55</ssdmobj_id>
<pins>
<count>2</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_109">
<port class_id_reference="29" object_id="_110">
<name>input_mat_data_V</name>
<dir>0</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id="_111">
<type>0</type>
<name>gry2rgb_U0</name>
<ssdmobj_id>55</ssdmobj_id>
</inst>
</item>
<item class_id_reference="28" object_id="_112">
<port class_id_reference="29" object_id="_113">
<name>output_mat_data_V</name>
<dir>0</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_111"></inst>
</item>
</pins>
</item>
<item class_id_reference="26" object_id="_114">
<type>0</type>
<name>mat2strm_U0</name>
<ssdmobj_id>58</ssdmobj_id>
<pins>
<count>9</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_115">
<port class_id_reference="29" object_id="_116">
<name>IN_size_read</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id="_117">
<type>0</type>
<name>mat2strm_U0</name>
<ssdmobj_id>58</ssdmobj_id>
</inst>
</item>
<item class_id_reference="28" object_id="_118">
<port class_id_reference="29" object_id="_119">
<name>IN_data_V</name>
<dir>0</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_117"></inst>
</item>
<item class_id_reference="28" object_id="_120">
<port class_id_reference="29" object_id="_121">
<name>OUT_V_data_V</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_117"></inst>
</item>
<item class_id_reference="28" object_id="_122">
<port class_id_reference="29" object_id="_123">
<name>OUT_V_keep_V</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_117"></inst>
</item>
<item class_id_reference="28" object_id="_124">
<port class_id_reference="29" object_id="_125">
<name>OUT_V_strb_V</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_117"></inst>
</item>
<item class_id_reference="28" object_id="_126">
<port class_id_reference="29" object_id="_127">
<name>OUT_V_user_V</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_117"></inst>
</item>
<item class_id_reference="28" object_id="_128">
<port class_id_reference="29" object_id="_129">
<name>OUT_V_last_V</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_117"></inst>
</item>
<item class_id_reference="28" object_id="_130">
<port class_id_reference="29" object_id="_131">
<name>OUT_V_id_V</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_117"></inst>
</item>
<item class_id_reference="28" object_id="_132">
<port class_id_reference="29" object_id="_133">
<name>OUT_V_dest_V</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_117"></inst>
</item>
</pins>
</item>
</process_list>
<channel_list class_id="31" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="32" tracking_level="1" version="0" object_id="_134">
<type>1</type>
<name>in_tmp_data_V</name>
<ssdmobj_id>31</ssdmobj_id>
<ctype>0</ctype>
<depth>100</depth>
<bitwidth>24</bitwidth>
<source class_id_reference="28" object_id="_135">
<port class_id_reference="29" object_id="_136">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_79"></inst>
</source>
<sink class_id_reference="28" object_id="_137">
<port class_id_reference="29" object_id="_138">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_99"></inst>
</sink>
</item>
<item class_id_reference="32" object_id="_139">
<type>1</type>
<name>im_1_data_V</name>
<ssdmobj_id>34</ssdmobj_id>
<ctype>0</ctype>
<depth>100</depth>
<bitwidth>7</bitwidth>
<source class_id_reference="28" object_id="_140">
<port class_id_reference="29" object_id="_141">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_99"></inst>
</source>
<sink class_id_reference="28" object_id="_142">
<port class_id_reference="29" object_id="_143">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_105"></inst>
</sink>
</item>
<item class_id_reference="32" object_id="_144">
<type>1</type>
<name>im_2_data_V</name>
<ssdmobj_id>37</ssdmobj_id>
<ctype>0</ctype>
<depth>100</depth>
<bitwidth>1</bitwidth>
<source class_id_reference="28" object_id="_145">
<port class_id_reference="29" object_id="_146">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_105"></inst>
</source>
<sink class_id_reference="28" object_id="_147">
<port class_id_reference="29" object_id="_148">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_111"></inst>
</sink>
</item>
<item class_id_reference="32" object_id="_149">
<type>1</type>
<name>out_tmp_data_V</name>
<ssdmobj_id>40</ssdmobj_id>
<ctype>0</ctype>
<depth>100</depth>
<bitwidth>17</bitwidth>
<source class_id_reference="28" object_id="_150">
<port class_id_reference="29" object_id="_151">
<name>in</name>
<dir>3</dir>
<type>0</type>
</port>
<inst class_id_reference="30" object_id_reference="_111"></inst>
</source>
<sink class_id_reference="28" object_id="_152">
<port class_id_reference="29" object_id="_153">
<name>out</name>
<dir>3</dir>
<type>1</type>
</port>
<inst class_id_reference="30" object_id_reference="_117"></inst>
</sink>
</item>
</channel_list>
<net_list class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</net_list>
</mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="34" tracking_level="1" version="0" object_id="_154">
<states class_id="35" tracking_level="0" version="0">
<count>12</count>
<item_version>0</item_version>
<item class_id="36" tracking_level="1" version="0" object_id="_155">
<id>1</id>
<operations class_id="37" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="1" version="0" object_id="_156">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_157">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_158">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_159">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="36" object_id="_160">
<id>2</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="38" object_id="_161">
<id>46</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="36" object_id="_162">
<id>3</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="38" object_id="_163">
<id>46</id>
<stage>1</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="36" object_id="_164">
<id>4</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="38" object_id="_165">
<id>49</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="36" object_id="_166">
<id>5</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="38" object_id="_167">
<id>49</id>
<stage>1</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="36" object_id="_168">
<id>6</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="38" object_id="_169">
<id>52</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="36" object_id="_170">
<id>7</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="38" object_id="_171">
<id>52</id>
<stage>1</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="36" object_id="_172">
<id>8</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="38" object_id="_173">
<id>55</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="36" object_id="_174">
<id>9</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="38" object_id="_175">
<id>55</id>
<stage>1</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="36" object_id="_176">
<id>10</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="38" object_id="_177">
<id>58</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="36" object_id="_178">
<id>11</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="38" object_id="_179">
<id>58</id>
<stage>1</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="36" object_id="_180">
<id>12</id>
<operations>
<count>36</count>
<item_version>0</item_version>
<item class_id_reference="38" object_id="_181">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_182">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_183">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_184">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_185">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_186">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_187">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_188">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_189">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_190">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_191">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_192">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_193">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_194">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_195">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_196">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_197">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_198">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_199">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_200">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_201">
<id>38</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_202">
<id>39</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_203">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_204">
<id>42</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_205">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_206">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_207">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_208">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_209">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_210">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_211">
<id>51</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_212">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_213">
<id>54</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_214">
<id>56</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_215">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="38" object_id="_216">
<id>59</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="39" tracking_level="0" version="0">
<count>11</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="1" version="0" object_id="_217">
<inState>1</inState>
<outState>2</outState>
<condition class_id="41" tracking_level="0" version="0">
<id>-1</id>
<sop class_id="42" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="43" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="40" object_id="_218">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="40" object_id="_219">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="40" object_id="_220">
<inState>4</inState>
<outState>5</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="40" object_id="_221">
<inState>5</inState>
<outState>6</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="40" object_id="_222">
<inState>6</inState>
<outState>7</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="40" object_id="_223">
<inState>7</inState>
<outState>8</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="40" object_id="_224">
<inState>8</inState>
<outState>9</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="40" object_id="_225">
<inState>9</inState>
<outState>10</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="40" object_id="_226">
<inState>10</inState>
<outState>11</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="40" object_id="_227">
<inState>11</inState>
<outState>12</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="-1"></res>
<node_label_latency class_id="45" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="46" tracking_level="0" version="0">
<first>31</first>
<second class_id="47" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>3</first>
<second>1</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>5</first>
<second>1</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>7</first>
<second>1</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>9</first>
<second>1</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>11</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="48" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="49" tracking_level="0" version="0">
<first>60</first>
<second class_id="50" tracking_level="0" version="0">
<first>0</first>
<second>11</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="51" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="52" tracking_level="1" version="0" object_id="_228">
<region_name>hls_video_block</region_name>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</basic_blocks>
<nodes>
<count>45</count>
<item_version>0</item_version>
<item>15</item>
<item>16</item>
<item>17</item>
<item>18</item>
<item>19</item>
<item>20</item>
<item>21</item>
<item>22</item>
<item>23</item>
<item>24</item>
<item>25</item>
<item>26</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>36</item>
<item>37</item>
<item>38</item>
<item>39</item>
<item>40</item>
<item>41</item>
<item>42</item>
<item>43</item>
<item>44</item>
<item>45</item>
<item>46</item>
<item>47</item>
<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>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>16</region_type>
<interval>0</interval>
<pipe_depth>0</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="53" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="54" tracking_level="0" version="0">
<first>100</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>104</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>108</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>112</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>116</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>52</item>
<item>52</item>
</second>
</item>
<item>
<first>122</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>58</item>
<item>58</item>
</second>
</item>
<item>
<first>143</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>49</item>
<item>49</item>
</second>
</item>
<item>
<first>149</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>46</item>
<item>46</item>
</second>
</item>
<item>
<first>170</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>55</item>
<item>55</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="56" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="57" tracking_level="0" version="0">
<first>im_1_data_V_fu_104</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>im_2_data_V_fu_108</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>in_tmp_data_V_fu_100</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>out_tmp_data_V_fu_112</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>5</count>
<item_version>0</item_version>
<item>
<first>grp_gry2rgb_fu_170</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>55</item>
<item>55</item>
</second>
</item>
<item>
<first>grp_hls_2DFilter_fu_116</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>52</item>
<item>52</item>
</second>
</item>
<item>
<first>grp_mat2strm_fu_122</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>58</item>
<item>58</item>
</second>
</item>
<item>
<first>grp_rgb2gry_fu_143</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>49</item>
<item>49</item>
</second>
</item>
<item>
<first>grp_strm2mat_fu_149</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>46</item>
<item>46</item>
</second>
</item>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="58" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>4</count>
<item_version>0</item_version>
<item>
<first>176</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>182</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>188</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>194</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>4</count>
<item_version>0</item_version>
<item>
<first>im_1_data_V_reg_182</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>im_2_data_V_reg_188</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>in_tmp_data_V_reg_176</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>out_tmp_data_V_reg_194</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="59" tracking_level="0" version="0">
<count>14</count>
<item_version>0</item_version>
<item class_id="60" tracking_level="0" version="0">
<first>VIDEO_IN_V_data_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>call</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
</second>
</item>
<item>
<first>VIDEO_IN_V_dest_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>call</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
</second>
</item>
<item>
<first>VIDEO_IN_V_id_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>call</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
</second>
</item>
<item>
<first>VIDEO_IN_V_keep_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>call</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
</second>
</item>
<item>
<first>VIDEO_IN_V_last_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>call</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
</second>
</item>
<item>
<first>VIDEO_IN_V_strb_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>call</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
</second>
</item>
<item>
<first>VIDEO_IN_V_user_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>call</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
</second>
</item>
<item>
<first>VIDEO_OUT_V_data_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>call</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
</second>
</item>
<item>
<first>VIDEO_OUT_V_dest_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>call</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
</second>
</item>
<item>
<first>VIDEO_OUT_V_id_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>call</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
</second>
</item>
<item>
<first>VIDEO_OUT_V_keep_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>call</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
</second>
</item>
<item>
<first>VIDEO_OUT_V_last_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>call</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
</second>
</item>
<item>
<first>VIDEO_OUT_V_strb_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>call</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
</second>
</item>
<item>
<first>VIDEO_OUT_V_user_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>call</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="61" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port2core>
<node2core>
<count>4</count>
<item_version>0</item_version>
<item class_id="62" tracking_level="0" version="0">
<first>31</first>
<second>FIFO</second>
</item>
<item>
<first>34</first>
<second>FIFO</second>
</item>
<item>
<first>37</first>
<second>FIFO</second>
</item>
<item>
<first>40</first>
<second>FIFO</second>
</item>
</node2core>
</syndb>
</boost_serialization>
| 26.922533 | 82 | 0.592872 |
3d885baef8f5a9d07aec9b748eff724a7beb012e | 1,153 | ads | Ada | ada/protected_counters.ads | rtoal/enhanced-dining-philosophers | e5305fb975e8eb5a3d6bbbc1ae0a798d278a074d | [
"MIT"
] | null | null | null | ada/protected_counters.ads | rtoal/enhanced-dining-philosophers | e5305fb975e8eb5a3d6bbbc1ae0a798d278a074d | [
"MIT"
] | null | null | null | ada/protected_counters.ads | rtoal/enhanced-dining-philosophers | e5305fb975e8eb5a3d6bbbc1ae0a798d278a074d | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- protected_counters.ads
--
-- This package defines protected type Counter. A counter is basically an in-
-- teger which starts with some initial positive value and is decremented (by
-- 1) by calling tasks. When a task decrements the counter it is informed
-- whether or not it made the counter go to zero. The decrement and test
-- are bound together in a critical section because without this protection,
-- the zero might be missed or discovered by two different tasks!
--
-- Entries:
--
-- Decrement_And_Test_If_Zero (Is_Zero) decrements the counter's value and
-- sets Is_Zero to whether the newly
-- updated value is 0.
------------------------------------------------------------------------------
package Protected_Counters is
protected type Counter (Initial_Value: Positive) is
procedure Decrement_And_Test_If_Zero (Is_Zero: out Boolean);
private
Value: Natural := Initial_Value;
end Counter;
end Protected_Counters;
| 42.703704 | 80 | 0.576756 |
57c7fcdcefacb48a3a4fccfba5c94cea45f2f902 | 3,857 | ads | Ada | llvm-gcc-4.2-2.9/gcc/ada/a-ztflau.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 1 | 2016-04-09T02:58:13.000Z | 2016-04-09T02:58:13.000Z | llvm-gcc-4.2-2.9/gcc/ada/a-ztflau.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/a-ztflau.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . W I D E _ W I D E _ T E X T _ I O . F L O A T _ A U X --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2005, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains the routines for Ada.Wide_Wide_Text_IO.Float_IO that
-- are shared among separate instantiations of this package. The routines
-- in this package are identical semantically to those in Float_IO itself,
-- except that generic parameter Num has been replaced by Long_Long_Float,
-- and the default parameters have been removed because they are supplied
-- explicitly by the calls from within the generic template. Also used by
-- Ada.Wide_Wide_Text_IO.Fixed_IO, and by Ada.Wide_Wide_Text_IO.Decimal_IO.
private package Ada.Wide_Wide_Text_IO.Float_Aux is
procedure Load_Real
(File : File_Type;
Buf : out String;
Ptr : in out Natural);
-- This is an auxiliary routine that is used to load a possibly signed
-- real literal value from the input file into Buf, starting at Ptr + 1.
procedure Get
(File : File_Type;
Item : out Long_Long_Float;
Width : Field);
procedure Gets
(From : String;
Item : out Long_Long_Float;
Last : out Positive);
procedure Put
(File : File_Type;
Item : Long_Long_Float;
Fore : Field;
Aft : Field;
Exp : Field);
procedure Puts
(To : out String;
Item : Long_Long_Float;
Aft : Field;
Exp : Field);
end Ada.Wide_Wide_Text_IO.Float_Aux;
| 51.426667 | 78 | 0.508686 |
2fb34577eee7548da903392d41c42139754b7e10 | 3,277 | adb | Ada | src/sdl-video-windows-makers.adb | Fabien-Chouteau/sdlada | f08d72e3f5dcec228d68fb5b6681ea831f81ef47 | [
"Zlib"
] | 89 | 2015-01-03T01:41:23.000Z | 2022-02-23T18:21:11.000Z | src/sdl-video-windows-makers.adb | Fabien-Chouteau/sdlada | f08d72e3f5dcec228d68fb5b6681ea831f81ef47 | [
"Zlib"
] | 66 | 2015-05-01T00:54:03.000Z | 2022-01-20T04:09:59.000Z | src/sdl-video-windows-makers.adb | Fabien-Chouteau/sdlada | f08d72e3f5dcec228d68fb5b6681ea831f81ef47 | [
"Zlib"
] | 33 | 2015-04-30T23:39:31.000Z | 2022-01-03T13:00:41.000Z | --------------------------------------------------------------------------------------------------------------------
-- Copyright (c) 2013-2020, Luke A. Guest
--
-- This software is provided 'as-is', without any express or implied
-- warranty. In no event will the authors be held liable for any damages
-- arising from the use of this software.
--
-- Permission is granted to anyone to use this software for any purpose,
-- including commercial applications, and to alter it and redistribute it
-- freely, subject to the following restrictions:
--
-- 1. The origin of this software must not be misrepresented; you must not
-- claim that you wrote the original software. If you use this software
-- in a product, an acknowledgment in the product documentation would be
-- appreciated but is not required.
--
-- 2. Altered source versions must be plainly marked as such, and must not be
-- misrepresented as being the original software.
--
-- 3. This notice may not be removed or altered from any source
-- distribution.
--------------------------------------------------------------------------------------------------------------------
with Interfaces.C;
with Interfaces.C.Strings;
private with SDL.C_Pointers;
with SDL.Error;
package body SDL.Video.Windows.Makers is
package C renames Interfaces.C;
use type SDL.C_Pointers.Windows_Pointer;
procedure Create
(Win : in out Window;
Title : in Ada.Strings.UTF_Encoding.UTF_8_String;
Position : in SDL.Natural_Coordinates;
Size : in SDL.Positive_Sizes;
Flags : in Window_Flags := OpenGL) is
function SDL_Create
(Title : C.Strings.chars_ptr;
X, Y, W, H : in C.int;
F : in Window_Flags) return SDL.C_Pointers.Windows_Pointer with
Import => True,
Convention => C,
External_Name => "SDL_CreateWindow";
C_Title_Str : C.Strings.chars_ptr := C.Strings.New_String (Title);
begin
Win.Internal := SDL_Create (C_Title_Str, Position.X, Position.Y, Size.Width, Size.Height, Flags);
C.Strings.Free (C_Title_Str);
if Win.Internal = null then
raise Window_Error with SDL.Error.Get;
end if;
Increment_Windows;
end Create;
procedure Create
(Win : in out Window;
Title : in Ada.Strings.UTF_Encoding.UTF_8_String;
X : in SDL.Natural_Coordinate;
Y : in SDL.Natural_Coordinate;
Width : in SDL.Positive_Dimension;
Height : in SDL.Positive_Dimension;
Flags : in Window_Flags := OpenGL) is
begin
Create (Win, Title, SDL.Natural_Coordinates'(X, Y), SDL.Positive_Sizes'(Width, Height), Flags);
end Create;
procedure Create (Win : in out Window; Native : in Native_Window) is
function SDL_Create_Window_From (Native : Native_Window) return SDL.C_Pointers.Windows_Pointer with
Import => True,
Convention => C,
External_Name => "SDL_CreateWindowFrom";
begin
Win.Internal := SDL_Create_Window_From (Native);
Win.Owns := True;
if Win.Internal = null then
raise Window_Error with SDL.Error.Get;
end if;
Increment_Windows;
end Create;
end SDL.Video.Windows.Makers;
| 36.820225 | 116 | 0.620384 |
2f91633ca9dc13788feb52a5e3a20108440c2868 | 18,129 | adb | Ada | src/implementation/cl-platforms.adb | flyx/OpenCLAda | a03a82842b11edda44c8a85f737f5111d1a522a4 | [
"0BSD"
] | 8 | 2015-02-10T20:04:25.000Z | 2021-06-25T07:46:31.000Z | src/implementation/cl-platforms.adb | flyx/OpenCLAda | a03a82842b11edda44c8a85f737f5111d1a522a4 | [
"0BSD"
] | 1 | 2015-09-10T00:01:55.000Z | 2015-09-10T10:42:23.000Z | src/implementation/cl-platforms.adb | flyx/OpenCLAda | a03a82842b11edda44c8a85f737f5111d1a522a4 | [
"0BSD"
] | 1 | 2017-02-13T23:07:06.000Z | 2017-02-13T23:07:06.000Z | --------------------------------------------------------------------------------
-- Copyright (c) 2013, Felix Krause <[email protected]>
--
-- Permission to use, copy, modify, and/or distribute this software for any
-- purpose with or without fee is hereby granted, provided that the above
-- copyright notice and this permission notice appear in all copies.
--
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
-- WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
-- MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
-- ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
-- WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
-- ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
-- OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
--------------------------------------------------------------------------------
with Ada.Unchecked_Conversion;
with System;
with CL.API;
with CL.Helpers;
with CL.Enumerations;
package body CL.Platforms is
-----------------------------------------------------------------------------
-- Helper instantiations
-----------------------------------------------------------------------------
function Platform_String_Info is
new Helpers.Get_String (Parameter_T => Enumerations.Platform_Info,
C_Getter => API.Get_Platform_Info);
function UInt_Info is
new Helpers.Get_Parameter (Return_T => CL.UInt,
Parameter_T => Enumerations.Device_Info,
C_Getter => API.Get_Device_Info);
function ULong_Info is
new Helpers.Get_Parameter (Return_T => CL.ULong,
Parameter_T => Enumerations.Device_Info,
C_Getter => API.Get_Device_Info);
function Size_Info is
new Helpers.Get_Parameter (Return_T => Size,
Parameter_T => Enumerations.Device_Info,
C_Getter => API.Get_Device_Info);
function Bool_Info is
new Helpers.Get_Parameter (Return_T => CL.Bool,
Parameter_T => Enumerations.Device_Info,
C_Getter => API.Get_Device_Info);
function String_Info is
new Helpers.Get_String (Parameter_T => Enumerations.Device_Info,
C_Getter => API.Get_Device_Info);
-----------------------------------------------------------------------------
-- Implementations
-----------------------------------------------------------------------------
function List return Platform_List is
Platform_Count : aliased UInt;
Error : Enumerations.Error_Code;
begin
Error := API.Get_Platform_IDs (0, System.Null_Address,
Platform_Count'Unchecked_Access);
Helpers.Error_Handler (Error);
declare
Raw_List : Address_List (1 .. Integer (Platform_Count));
Return_List : Platform_List (1 .. Integer (Platform_Count));
begin
Error := API.Get_Platform_IDs (Platform_Count,
Raw_List (1)'Address, null);
Helpers.Error_Handler (Error);
for Index in Raw_List'Range loop
Return_List (Index) := Platform'(Ada.Finalization.Controlled with
Location => Raw_List (Index));
end loop;
return Return_List;
end;
end List;
function Profile (Source : Platform) return String is
begin
return Platform_String_Info (Source, Enumerations.Profile);
end Profile;
function Version (Source : Platform) return String is
begin
return Platform_String_Info (Source, Enumerations.Version);
end Version;
function Name (Source : Platform) return String is
begin
return Platform_String_Info (Source, Enumerations.Name);
end Name;
function Vendor (Source : Platform) return String is
begin
return Platform_String_Info (Source, Enumerations.Vendor);
end Vendor;
function Extensions (Source : Platform) return String is
begin
return Platform_String_Info (Source, Enumerations.Extensions);
end Extensions;
function Devices (Source : Platform; Types : Device_Kind)
return Device_List is
Device_Count : aliased UInt;
Error : Enumerations.Error_Code;
function To_Bitfield is new
Ada.Unchecked_Conversion (Source => Device_Kind,
Target => Bitfield);
begin
Error := API.Get_Device_IDs (Source.Location, To_Bitfield (Types), 0,
System.Null_Address,
Device_Count'Unchecked_Access);
Helpers.Error_Handler (Error);
declare
Raw_List : Address_List (1 .. Integer (Device_Count));
Return_List : Device_List (1 .. Integer (Device_Count));
begin
Error := API.Get_Device_IDs (Source.Location, To_Bitfield (Types),
Device_Count,
Raw_List (1)'Address, null);
Helpers.Error_Handler (Error);
for Index in Raw_List'Range loop
Return_List (Index) := Device'(Ada.Finalization.Controlled with
Location => Raw_List (Index));
end loop;
return Return_List;
end;
end Devices;
function Vendor_ID (Source : Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Vendor_ID);
end Vendor_ID;
function Max_Compute_Units (Source : Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Max_Compute_Units);
end Max_Compute_Units;
function Max_Work_Item_Dimensions (Source : Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Max_Work_Item_Dimensions);
end Max_Work_Item_Dimensions;
function Preferred_Vector_Width_Char (Source : Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Preferred_Vector_Width_Char);
end Preferred_Vector_Width_Char;
function Preferred_Vector_Width_Short (Source : Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Preferred_Vector_Width_Short);
end Preferred_Vector_Width_Short;
function Preferred_Vector_Width_Int (Source : Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Preferred_Vector_Width_Int);
end Preferred_Vector_Width_Int;
function Preferred_Vector_Width_Long (Source : Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Preferred_Vector_Width_Long);
end Preferred_Vector_Width_Long;
function Preferred_Vector_Width_Float (Source : Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Preferred_Vector_Width_Float);
end Preferred_Vector_Width_Float;
function Preferred_Vector_Width_Double (Source : Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Preferred_Vector_Width_Double);
end Preferred_Vector_Width_Double;
function Max_Clock_Frequency (Source : Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Max_Clock_Frequency);
end Max_Clock_Frequency;
function Address_Bits (Source : Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Address_Bits);
end Address_Bits;
function Max_Read_Image_Args (Source : Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Max_Read_Image_Args);
end Max_Read_Image_Args;
function Max_Write_Image_Args (Source : Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Max_Write_Image_Args);
end Max_Write_Image_Args;
function Max_Samplers (Source : Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Max_Samplers);
end Max_Samplers;
function Mem_Base_Addr_Align (Source: Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Mem_Base_Addr_Align);
end Mem_Base_Addr_Align;
function Min_Data_Type_Align_Size (Source : Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Min_Data_Type_Align_Size);
end Min_Data_Type_Align_Size;
function Global_Mem_Cacheline_Size (Source : Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Global_Mem_Cacheline_Size);
end Global_Mem_Cacheline_Size;
function Max_Constant_Args (Source : Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Max_Constant_Args);
end Max_Constant_Args;
function Preferred_Vector_Width_Half (Source : Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Preferred_Vector_Width_Half);
end Preferred_Vector_Width_Half;
function Native_Vector_Width_Char (Source : Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Native_Vector_Width_Char);
end Native_Vector_Width_Char;
function Native_Vector_Width_Short (Source : Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Native_Vector_Width_Short);
end Native_Vector_Width_Short;
function Native_Vector_Width_Int (Source : Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Native_Vector_Width_Int);
end Native_Vector_Width_Int;
function Native_Vector_Width_Long (Source : Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Native_Vector_Width_Long);
end Native_Vector_Width_Long;
function Native_Vector_Width_Float (Source : Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Native_Vector_Width_Float);
end Native_Vector_Width_Float;
function Native_Vector_Width_Double (Source : Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Native_Vector_Width_Double);
end Native_Vector_Width_Double;
function Native_Vector_Width_Half (Source : Device) return UInt is
begin
return UInt_Info (Source, Enumerations.Native_Vector_Width_Half);
end Native_Vector_Width_Half;
function Max_Mem_Alloc_Size (Source : Device) return ULong is
begin
return ULong_Info (Source, Enumerations.Max_Mem_Alloc_Size);
end Max_Mem_Alloc_Size;
function Global_Mem_Cache_Size (Source : Device) return ULong is
begin
return ULong_Info (Source, Enumerations.Global_Mem_Cache_Size);
end Global_Mem_Cache_Size;
function Global_Mem_Size (Source : Device) return ULong is
begin
return ULong_Info (Source, Enumerations.Global_Mem_Size);
end Global_Mem_Size;
function Max_Constant_Buffer_Size (Source : Device) return ULong is
begin
return ULong_Info (Source, Enumerations.Max_Constant_Buffer_Size);
end Max_Constant_Buffer_Size;
function Local_Mem_Size (Source : Device) return ULong is
begin
return ULong_Info (Source, Enumerations.Local_Mem_Size);
end Local_Mem_Size;
function Max_Work_Group_Size (Source : Device) return Size is
begin
return Size_Info (Source, Enumerations.Max_Work_Group_Size);
end Max_Work_Group_Size;
function Image2D_Max_Width (Source : Device) return Size is
begin
return Size_Info (Source, Enumerations.Image2D_Max_Width);
end Image2D_Max_Width;
function Image2D_Max_Height (Source : Device) return Size is
begin
return Size_Info (Source, Enumerations.Image2D_Max_Height);
end Image2D_Max_Height;
function Image3D_Max_Width (Source : Device) return Size is
begin
return Size_Info (Source, Enumerations.Image3D_Max_Width);
end Image3D_Max_Width;
function Image3D_Max_Height (Source : Device) return Size is
begin
return Size_Info (Source, Enumerations.Image3D_Max_Height);
end Image3D_Max_Height;
function Image3D_Max_Depth (Source : Device) return Size is
begin
return Size_Info (Source, Enumerations.Image3D_Max_Depth);
end Image3D_Max_Depth;
function Max_Parameter_Size (Source : Device) return Size is
begin
return Size_Info (Source, Enumerations.Max_Parameter_Size);
end Max_Parameter_Size;
function Profiling_Timer_Resolution (Source : Device) return Size is
begin
return Size_Info (Source, Enumerations.Profiling_Timer_Resolution);
end Profiling_Timer_Resolution;
function Image_Support (Source : Device) return Boolean is
begin
return Boolean (Bool_Info (Source, Enumerations.Image_Support));
end Image_Support;
function Error_Correction_Support (Source : Device) return Boolean is
begin
return Boolean (Bool_Info (Source, Enumerations.Error_Correction_Support));
end Error_Correction_Support;
function Endian_Little (Source : Device) return Boolean is
begin
return Boolean (Bool_Info (Source, Enumerations.Endian_Little));
end Endian_Little;
function Available (Source : Device) return Boolean is
begin
return Boolean (Bool_Info (Source, Enumerations.Available));
end Available;
function Compiler_Available (Source : Device) return Boolean is
begin
return Boolean (Bool_Info (Source, Enumerations.Compiler_Available));
end Compiler_Available;
function Host_Unified_Memory (Source : Device) return Boolean is
begin
return Boolean (Bool_Info (Source, Enumerations.Host_Unified_Memory));
end Host_Unified_Memory;
function Name (Source : Device) return String is
begin
return String_Info (Source, Enumerations.Name);
end Name;
function Vendor (Source : Device) return String is
begin
return String_Info (Source, Enumerations.Vendor);
end Vendor;
function Driver_Version (Source : Device) return String is
begin
return String_Info (Source, Enumerations.Driver_Version);
end Driver_Version;
function Profile (Source : Device) return String is
begin
return String_Info (Source, Enumerations.Profile);
end Profile;
function Version (Source : Device) return String is
begin
return String_Info (Source, Enumerations.Version);
end Version;
function Extensions (Source : Device) return String is
begin
return String_Info (Source, Enumerations.Extensions);
end Extensions;
function OpenCL_C_Version (Source : Device) return String is
begin
return String_Info (Source, Enumerations.OpenCL_C_Version);
end OpenCL_C_Version;
function Max_Work_Item_Sizes (Source : Device) return Size_List is
function Getter is
new Helpers.Get_Parameters (Return_Element_T => Size,
Return_T => Size_List,
Parameter_T => Enumerations.Device_Info,
C_Getter => API.Get_Device_Info);
begin
return Getter (Source, Enumerations.Max_Work_Item_Sizes);
end Max_Work_Item_Sizes;
function Single_Floating_Point_Config (Source : Device)
return Floating_Point_Config is
function Getter is
new Helpers.Get_Parameter (Return_T => Floating_Point_Config,
Parameter_T => Enumerations.Device_Info,
C_Getter => API.Get_Device_Info);
begin
return Getter (Source, Enumerations.Single_FP_Config);
end Single_Floating_Point_Config;
function Memory_Cache_Type (Source : Device) return Memory_Cache_Kind is
function Getter is
new Helpers.Get_Parameter (Return_T => Memory_Cache_Kind,
Parameter_T => Enumerations.Device_Info,
C_Getter => API.Get_Device_Info);
begin
return Getter (Source, Enumerations.Global_Mem_Cache_Type);
end Memory_Cache_Type;
function Local_Memory_Type (Source : Device) return Local_Memory_Kind is
function Getter is
new Helpers.Get_Parameter (Return_T => Local_Memory_Kind,
Parameter_T => Enumerations.Device_Info,
C_Getter => API.Get_Device_Info);
begin
return Getter (Source, Enumerations.Local_Mem_Type);
end Local_Memory_Type;
function Kind (Source : Device) return Device_Kind is
function Getter is
new Helpers.Get_Parameter (Return_T => Device_Kind,
Parameter_T => Enumerations.Device_Info,
C_Getter => API.Get_Device_Info);
begin
return Getter (Source, Enumerations.Dev_Type);
end Kind;
function Execution_Capabilities (Source : Device)
return Capability_Vector is
function Getter is
new Helpers.Get_Parameter (Return_T => Capability_Vector,
Parameter_T => Enumerations.Device_Info,
C_Getter => API.Get_Device_Info);
begin
return Getter (Source, Enumerations.Execution_Capabilities);
end Execution_Capabilities;
function Command_Queue_Properties (Source : Device)
return CQ_Property_Vector is
function Getter is
new Helpers.Get_Parameter (Return_T => CQ_Property_Vector,
Parameter_T => Enumerations.Device_Info,
C_Getter => API.Get_Device_Info);
begin
return Getter (Source, Enumerations.Queue_Properties);
end Command_Queue_Properties;
function Associated_Platform (Source : Device) return Platform'Class is
function Getter is
new Helpers.Get_Parameter (Return_T => System.Address,
Parameter_T => Enumerations.Device_Info,
C_Getter => API.Get_Device_Info);
begin
return Platform'(Ada.Finalization.Controlled with
Location => Getter (Source, Enumerations.Platform));
end Associated_Platform;
end CL.Platforms;
| 38.006289 | 81 | 0.66766 |
584c5dcbbb70110c0fdbefe8306b654a7156bff1 | 6,832 | adb | Ada | source/nodes/program-nodes-if_statements.adb | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/nodes/program-nodes-if_statements.adb | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/nodes/program-nodes-if_statements.adb | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | 2 | 2019-09-14T23:18:50.000Z | 2019-10-02T10:11:40.000Z | -- Copyright (c) 2019 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
package body Program.Nodes.If_Statements is
function Create
(If_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Condition : not null Program.Elements.Expressions.Expression_Access;
Then_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Then_Statements : not null Program.Element_Vectors.Element_Vector_Access;
Elsif_Paths : Program.Elements.Elsif_Paths.Elsif_Path_Vector_Access;
Else_Token : Program.Lexical_Elements.Lexical_Element_Access;
Else_Statements : Program.Element_Vectors.Element_Vector_Access;
End_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
If_Token_2 : not null Program.Lexical_Elements
.Lexical_Element_Access;
Semicolon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access)
return If_Statement is
begin
return Result : If_Statement :=
(If_Token => If_Token, Condition => Condition,
Then_Token => Then_Token, Then_Statements => Then_Statements,
Elsif_Paths => Elsif_Paths, Else_Token => Else_Token,
Else_Statements => Else_Statements, End_Token => End_Token,
If_Token_2 => If_Token_2, Semicolon_Token => Semicolon_Token,
Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
function Create
(Condition : not null Program.Elements.Expressions
.Expression_Access;
Then_Statements : not null Program.Element_Vectors
.Element_Vector_Access;
Elsif_Paths : Program.Elements.Elsif_Paths
.Elsif_Path_Vector_Access;
Else_Statements : Program.Element_Vectors.Element_Vector_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_If_Statement is
begin
return Result : Implicit_If_Statement :=
(Condition => Condition, Then_Statements => Then_Statements,
Elsif_Paths => Elsif_Paths, Else_Statements => Else_Statements,
Is_Part_Of_Implicit => Is_Part_Of_Implicit,
Is_Part_Of_Inherited => Is_Part_Of_Inherited,
Is_Part_Of_Instance => Is_Part_Of_Instance, Enclosing_Element => null)
do
Initialize (Result);
end return;
end Create;
overriding function Condition
(Self : Base_If_Statement)
return not null Program.Elements.Expressions.Expression_Access is
begin
return Self.Condition;
end Condition;
overriding function Then_Statements
(Self : Base_If_Statement)
return not null Program.Element_Vectors.Element_Vector_Access is
begin
return Self.Then_Statements;
end Then_Statements;
overriding function Elsif_Paths
(Self : Base_If_Statement)
return Program.Elements.Elsif_Paths.Elsif_Path_Vector_Access is
begin
return Self.Elsif_Paths;
end Elsif_Paths;
overriding function Else_Statements
(Self : Base_If_Statement)
return Program.Element_Vectors.Element_Vector_Access is
begin
return Self.Else_Statements;
end Else_Statements;
overriding function If_Token
(Self : If_Statement)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.If_Token;
end If_Token;
overriding function Then_Token
(Self : If_Statement)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Then_Token;
end Then_Token;
overriding function Else_Token
(Self : If_Statement)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Else_Token;
end Else_Token;
overriding function End_Token
(Self : If_Statement)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.End_Token;
end End_Token;
overriding function If_Token_2
(Self : If_Statement)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.If_Token_2;
end If_Token_2;
overriding function Semicolon_Token
(Self : If_Statement)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Semicolon_Token;
end Semicolon_Token;
overriding function Is_Part_Of_Implicit
(Self : Implicit_If_Statement)
return Boolean is
begin
return Self.Is_Part_Of_Implicit;
end Is_Part_Of_Implicit;
overriding function Is_Part_Of_Inherited
(Self : Implicit_If_Statement)
return Boolean is
begin
return Self.Is_Part_Of_Inherited;
end Is_Part_Of_Inherited;
overriding function Is_Part_Of_Instance
(Self : Implicit_If_Statement)
return Boolean is
begin
return Self.Is_Part_Of_Instance;
end Is_Part_Of_Instance;
procedure Initialize (Self : aliased in out Base_If_Statement'Class) is
begin
Set_Enclosing_Element (Self.Condition, Self'Unchecked_Access);
for Item in Self.Then_Statements.Each_Element loop
Set_Enclosing_Element (Item.Element, Self'Unchecked_Access);
end loop;
for Item in Self.Elsif_Paths.Each_Element loop
Set_Enclosing_Element (Item.Element, Self'Unchecked_Access);
end loop;
for Item in Self.Else_Statements.Each_Element loop
Set_Enclosing_Element (Item.Element, Self'Unchecked_Access);
end loop;
null;
end Initialize;
overriding function Is_If_Statement_Element
(Self : Base_If_Statement)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_If_Statement_Element;
overriding function Is_Statement_Element
(Self : Base_If_Statement)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Statement_Element;
overriding procedure Visit
(Self : not null access Base_If_Statement;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is
begin
Visitor.If_Statement (Self);
end Visit;
overriding function To_If_Statement_Text
(Self : aliased in out If_Statement)
return Program.Elements.If_Statements.If_Statement_Text_Access is
begin
return Self'Unchecked_Access;
end To_If_Statement_Text;
overriding function To_If_Statement_Text
(Self : aliased in out Implicit_If_Statement)
return Program.Elements.If_Statements.If_Statement_Text_Access is
pragma Unreferenced (Self);
begin
return null;
end To_If_Statement_Text;
end Program.Nodes.If_Statements;
| 32.846154 | 79 | 0.716335 |
5818f634f145f87e2b578a1edc1bacf7a13646c1 | 7,038 | adb | Ada | source/amf/utp/amf-internals-utp_timer_running_actions.adb | 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_timer_running_actions.adb | 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_timer_running_actions.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements;
with AMF.Internals.Helpers;
with AMF.Internals.Tables.Utp_Attributes;
with AMF.UML.Read_Structural_Feature_Actions;
with AMF.Visitors.Utp_Iterators;
with AMF.Visitors.Utp_Visitors;
package body AMF.Internals.Utp_Timer_Running_Actions is
---------------------------------------------
-- Get_Base_Read_Structural_Feature_Action --
---------------------------------------------
overriding function Get_Base_Read_Structural_Feature_Action
(Self : not null access constant Utp_Timer_Running_Action_Proxy)
return AMF.UML.Read_Structural_Feature_Actions.UML_Read_Structural_Feature_Action_Access is
begin
return
AMF.UML.Read_Structural_Feature_Actions.UML_Read_Structural_Feature_Action_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.Utp_Attributes.Internal_Get_Base_Read_Structural_Feature_Action
(Self.Element)));
end Get_Base_Read_Structural_Feature_Action;
---------------------------------------------
-- Set_Base_Read_Structural_Feature_Action --
---------------------------------------------
overriding procedure Set_Base_Read_Structural_Feature_Action
(Self : not null access Utp_Timer_Running_Action_Proxy;
To : AMF.UML.Read_Structural_Feature_Actions.UML_Read_Structural_Feature_Action_Access) is
begin
AMF.Internals.Tables.Utp_Attributes.Internal_Set_Base_Read_Structural_Feature_Action
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (To)));
end Set_Base_Read_Structural_Feature_Action;
-------------------
-- Enter_Element --
-------------------
overriding procedure Enter_Element
(Self : not null access constant Utp_Timer_Running_Action_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.Utp_Visitors.Utp_Visitor'Class then
AMF.Visitors.Utp_Visitors.Utp_Visitor'Class
(Visitor).Enter_Timer_Running_Action
(AMF.Utp.Timer_Running_Actions.Utp_Timer_Running_Action_Access (Self),
Control);
end if;
end Enter_Element;
-------------------
-- Leave_Element --
-------------------
overriding procedure Leave_Element
(Self : not null access constant Utp_Timer_Running_Action_Proxy;
Visitor : in out AMF.Visitors.Abstract_Visitor'Class;
Control : in out AMF.Visitors.Traverse_Control) is
begin
if Visitor in AMF.Visitors.Utp_Visitors.Utp_Visitor'Class then
AMF.Visitors.Utp_Visitors.Utp_Visitor'Class
(Visitor).Leave_Timer_Running_Action
(AMF.Utp.Timer_Running_Actions.Utp_Timer_Running_Action_Access (Self),
Control);
end if;
end Leave_Element;
-------------------
-- Visit_Element --
-------------------
overriding procedure Visit_Element
(Self : not null access constant Utp_Timer_Running_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) is
begin
if Iterator in AMF.Visitors.Utp_Iterators.Utp_Iterator'Class then
AMF.Visitors.Utp_Iterators.Utp_Iterator'Class
(Iterator).Visit_Timer_Running_Action
(Visitor,
AMF.Utp.Timer_Running_Actions.Utp_Timer_Running_Action_Access (Self),
Control);
end if;
end Visit_Element;
end AMF.Internals.Utp_Timer_Running_Actions;
| 51 | 98 | 0.535521 |
570f7298b84cca6f30b692fd2065667ab841a8f2 | 4,521 | adb | Ada | src/fltk-devices-surfaces-image.adb | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | 1 | 2020-12-18T15:20:13.000Z | 2020-12-18T15:20:13.000Z | src/fltk-devices-surfaces-image.adb | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | null | null | null | src/fltk-devices-surfaces-image.adb | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | null | null | null |
with
Interfaces.C,
System;
use type
System.Address;
package body FLTK.Devices.Surfaces.Image is
function new_fl_image_surface
(W, H, R : in Interfaces.C.int)
return System.Address;
pragma Import (C, new_fl_image_surface, "new_fl_image_surface");
pragma Inline (new_fl_image_surface);
procedure free_fl_image_surface
(S : in System.Address);
pragma Import (C, free_fl_image_surface, "free_fl_image_surface");
pragma Inline (free_fl_image_surface);
procedure fl_image_surface_draw
(S, I : in System.Address;
OX, OY : in Interfaces.C.int);
pragma Import (C, fl_image_surface_draw, "fl_image_surface_draw");
pragma Inline (fl_image_surface_draw);
procedure fl_image_surface_draw_decorated_window
(S, I : in System.Address;
OX, OY : in Interfaces.C.int);
pragma Import (C, fl_image_surface_draw_decorated_window,
"fl_image_surface_draw_decorated_window");
pragma Inline (fl_image_surface_draw_decorated_window);
function fl_image_surface_image
(S : in System.Address)
return System.Address;
pragma Import (C, fl_image_surface_image, "fl_image_surface_image");
pragma Inline (fl_image_surface_image);
function fl_image_surface_highres_image
(S : in System.Address)
return System.Address;
pragma Import (C, fl_image_surface_highres_image, "fl_image_surface_highres_image");
pragma Inline (fl_image_surface_highres_image);
procedure fl_image_surface_set_current
(S : in System.Address);
pragma Import (C, fl_image_surface_set_current, "fl_image_surface_set_current");
pragma Inline (fl_image_surface_set_current);
procedure Finalize
(This : in out Image_Surface) is
begin
if This.Void_Ptr /= System.Null_Address and then
This in Image_Surface'Class
then
free_fl_image_surface (This.Void_Ptr);
This.Void_Ptr := System.Null_Address;
end if;
Finalize (Surface_Device (This));
end Finalize;
package body Forge is
function Create
(W, H : in Integer;
Highres : in Boolean := False)
return Image_Surface is
begin
return This : Image_Surface do
This.Void_Ptr := new_fl_image_surface
(Interfaces.C.int (W),
Interfaces.C.int (H),
Boolean'Pos (Highres));
This.High := Highres;
end return;
end Create;
end Forge;
function Is_Highres
(This : in Image_Surface)
return Boolean is
begin
return This.High;
end Is_Highres;
procedure Draw_Widget
(This : in out Image_Surface;
Item : in FLTK.Widgets.Widget'Class;
Offset_X, Offset_Y : in Integer := 0) is
begin
fl_image_surface_draw
(This.Void_Ptr,
Wrapper (Item).Void_Ptr,
Interfaces.C.int (Offset_X),
Interfaces.C.int (Offset_Y));
end Draw_Widget;
procedure Draw_Decorated_Window
(This : in out Image_Surface;
Item : in FLTK.Widgets.Groups.Windows.Window'Class;
Offset_X, Offset_Y : in Integer := 0) is
begin
fl_image_surface_draw_decorated_window
(This.Void_Ptr,
Wrapper (Item).Void_Ptr,
Interfaces.C.int (Offset_X),
Interfaces.C.int (Offset_Y));
end Draw_Decorated_Window;
function Get_Image
(This : in Image_Surface)
return FLTK.Images.RGB.RGB_Image is
begin
return Img : FLTK.Images.RGB.RGB_Image do
Wrapper (Img).Void_Ptr := fl_image_surface_image (This.Void_Ptr);
end return;
end Get_Image;
function Get_Highres_Image
(This : in Image_Surface)
return FLTK.Images.Shared.Shared_Image is
begin
return Img : FLTK.Images.Shared.Shared_Image do
Wrapper (Img).Void_Ptr := fl_image_surface_highres_image (This.Void_Ptr);
end return;
end Get_Highres_Image;
procedure Set_Current
(This : in out Image_Surface) is
begin
fl_image_surface_set_current (This.Void_Ptr);
Current_Ptr := This'Unchecked_Access;
end Set_Current;
end FLTK.Devices.Surfaces.Image;
| 25.834286 | 88 | 0.621765 |
58ae207efe6025fa06d780c1a3a42c2900d7efa9 | 1,054 | ads | Ada | deps/gid/gid-decoding_pnm.ads | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | null | null | null | deps/gid/gid-decoding_pnm.ads | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | null | null | null | deps/gid/gid-decoding_pnm.ads | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | null | null | null | -- Portable pixmap format (PPM)
-- Portable graymap format (PGM)
-- Portable bitmap format (PBM)
private package GID.Decoding_PNM is
--------------------
-- Image decoding --
--------------------
generic
type Primary_color_range is mod <>;
with procedure Set_X_Y (x, y: Natural);
with procedure Put_Pixel (
red, green, blue : Primary_color_range;
alpha : Primary_color_range
);
with procedure Feedback (percents: Natural);
--
procedure Load (image: in out Image_descriptor);
function Get_Token(
stream : Stream_Access;
needs_EOL : Boolean:= False;
single_char : Boolean:= False
)
return String;
function Get_Integer(
stream : Stream_Access;
needs_EOL : Boolean:= False;
single_char : Boolean:= False
)
return Integer;
function Get_Positive_32(
stream : Stream_Access;
needs_EOL : Boolean:= False;
single_char : Boolean:= False
)
return Positive_32;
end GID.Decoding_PNM;
| 23.954545 | 51 | 0.605313 |
3d0429e5b0bf526e66f73a2ea2a86903940b4842 | 98 | adb | Ada | tests/typing/bad/testfile-bool-3.adb | xuedong/mini-ada | 59a8b966cf50ba22a3b5a7cb449f671e4da32e44 | [
"MIT"
] | null | null | null | tests/typing/bad/testfile-bool-3.adb | xuedong/mini-ada | 59a8b966cf50ba22a3b5a7cb449f671e4da32e44 | [
"MIT"
] | 1 | 2019-03-10T19:13:21.000Z | 2019-03-10T19:19:46.000Z | tests/typing/bad/testfile-bool-3.adb | xuedong/mini-ada | 59a8b966cf50ba22a3b5a7cb449f671e4da32e44 | [
"MIT"
] | null | null | null | with Ada.Text_IO; use Ada.Text_IO;
procedure Test is begin if not 1 then new_line; end if; end;
| 19.6 | 60 | 0.744898 |
598c29260186a3f2ddba6fe4eef8cd2811da1348 | 3,720 | ads | Ada | llvm-gcc-4.2-2.9/gcc/ada/a-finali.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 1 | 2016-04-09T02:58:13.000Z | 2016-04-09T02:58:13.000Z | llvm-gcc-4.2-2.9/gcc/ada/a-finali.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/a-finali.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . F I N A L I Z A T I O N --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2005, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.Finalization_Root;
package Ada.Finalization is
pragma Preelaborate;
type Controlled is abstract tagged private;
procedure Initialize (Object : in out Controlled);
procedure Adjust (Object : in out Controlled);
procedure Finalize (Object : in out Controlled);
type Limited_Controlled is abstract tagged limited private;
procedure Initialize (Object : in out Limited_Controlled);
procedure Finalize (Object : in out Limited_Controlled);
private
package SFR renames System.Finalization_Root;
type Controlled is abstract new SFR.Root_Controlled with null record;
function "=" (A, B : Controlled) return Boolean;
-- Need to be defined explictly because we don't want to compare the
-- hidden pointers
type Limited_Controlled is
abstract new SFR.Root_Controlled with null record;
end Ada.Finalization;
| 55.522388 | 78 | 0.502688 |
584c2df6ba686e61b9c39d2d6d904ceb18e2b4f0 | 60,097 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/exp_util.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/exp_util.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/exp_util.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- E X P _ U T I L --
-- --
-- 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. 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. --
-- --
------------------------------------------------------------------------------
-- Package containing utility procedures used throughout the expander
with Exp_Tss; use Exp_Tss;
with Namet; use Namet;
with Rtsfind; use Rtsfind;
with Sinfo; use Sinfo;
with Types; use Types;
with Uintp; use Uintp;
package Exp_Util is
-----------------------------------------------
-- Handling of Actions Associated with Nodes --
-----------------------------------------------
-- The evaluation of certain expression nodes involves the elaboration
-- of associated types and other declarations, and the execution of
-- statement sequences. Expansion routines generating such actions must
-- find an appropriate place in the tree to hang the actions so that
-- they will be evaluated at the appropriate point.
-- Some cases are simple:
-- For an expression occurring in a simple statement that is in a list
-- of statements, the actions are simply inserted into the list before
-- the associated statement.
-- For an expression occurring in a declaration (declarations always
-- appear in lists), the actions are similarly inserted into the list
-- just before the associated declaration.
-- The following special cases arise:
-- For actions associated with the right operand of a short circuit
-- form, the actions are first stored in the short circuit form node
-- in the Actions field. The expansion of these forms subsequently
-- expands the short circuit forms into if statements which can then
-- be moved as described above.
-- For actions appearing in the Condition expression of a while loop,
-- or an elsif clause, the actions are similarly temporarily stored in
-- in the node (N_Elsif_Part or N_Iteration_Scheme) associated with
-- the expression using the Condition_Actions field. Subsequently, the
-- expansion of these nodes rewrites the control structures involved to
-- reposition the actions in normal statement sequence.
-- For actions appearing in the then or else expression of a conditional
-- expression, these actions are similarly placed in the node, using the
-- Then_Actions or Else_Actions field as appropriate. Once again the
-- expansion of the N_If_Expression node rewrites the node so that the
-- actions can be positioned normally.
-- For actions coming from expansion of the expression in an expression
-- with actions node, the action is appended to the list of actions.
-- Basically what we do is to climb up to the tree looking for the
-- proper insertion point, as described by one of the above cases,
-- and then insert the appropriate action or actions.
-- Note if more than one insert call is made specifying the same
-- Assoc_Node, then the actions are elaborated in the order of the
-- calls, and this guarantee is preserved for the special cases above.
procedure Insert_Action
(Assoc_Node : Node_Id;
Ins_Action : Node_Id);
-- Insert the action Ins_Action at the appropriate point as described
-- above. The action is analyzed using the default checks after it is
-- inserted. Assoc_Node is the node with which the action is associated.
procedure Insert_Action
(Assoc_Node : Node_Id;
Ins_Action : Node_Id;
Suppress : Check_Id);
-- Insert the action Ins_Action at the appropriate point as described
-- above. The action is analyzed using the default checks as modified
-- by the given Suppress argument after it is inserted. Assoc_Node is
-- the node with which the action is associated.
procedure Insert_Actions
(Assoc_Node : Node_Id;
Ins_Actions : List_Id);
-- Insert the list of action Ins_Actions at the appropriate point as
-- described above. The actions are analyzed using the default checks
-- after they are inserted. Assoc_Node is the node with which the actions
-- are associated. Ins_Actions may be No_List, in which case the call has
-- no effect.
procedure Insert_Actions
(Assoc_Node : Node_Id;
Ins_Actions : List_Id;
Suppress : Check_Id);
-- Insert the list of action Ins_Actions at the appropriate point as
-- described above. The actions are analyzed using the default checks
-- as modified by the given Suppress argument after they are inserted.
-- Assoc_Node is the node with which the actions are associated.
-- Ins_Actions may be No_List, in which case the call has no effect.
procedure Insert_Action_After
(Assoc_Node : Node_Id;
Ins_Action : Node_Id);
-- Assoc_Node must be a node in a list. Same as Insert_Action but the
-- action will be inserted after N in a manner that is compatible with
-- the transient scope mechanism.
--
-- Note: If several successive calls to Insert_Action_After are made for
-- the same node, they will each in turn be inserted just after the node.
-- This means they will end up being executed in reverse order. Use the
-- call to Insert_Actions_After to insert a list of actions to be executed
-- in the sequence in which they are given in the list.
procedure Insert_Actions_After
(Assoc_Node : Node_Id;
Ins_Actions : List_Id);
-- Assoc_Node must be a node in a list. Same as Insert_Actions but
-- actions will be inserted after N in a manner that is compatible with
-- the transient scope mechanism. This procedure must be used instead
-- of Insert_List_After if Assoc_Node may be in a transient scope.
--
-- Implementation limitation: Assoc_Node must be a statement. We can
-- generalize to expressions if there is a need but this is tricky to
-- implement because of short-circuits (among other things).???
procedure Insert_Declaration (N : Node_Id; Decl : Node_Id);
-- N must be a subexpression (Nkind in N_Subexpr). This is similar to
-- Insert_Action (N, Decl), but inserts Decl outside the expression in
-- which N appears. This is called Insert_Declaration because the intended
-- use is for declarations that have no associated code. We can't go
-- moving other kinds of things out of the current expression, since they
-- could be executed conditionally (e.g. right operand of short circuit,
-- or THEN/ELSE of if expression). This is currently used only in
-- Modify_Tree_For_C mode, where it is needed because in C we have no
-- way of having declarations within an expression (a really annoying
-- limitation).
procedure Insert_Library_Level_Action (N : Node_Id);
-- This procedure inserts and analyzes the node N as an action at the
-- library level for the current unit (i.e. it is attached to the
-- Actions field of the N_Compilation_Aux node for the main unit).
procedure Insert_Library_Level_Actions (L : List_Id);
-- Similar, but inserts a list of actions
-----------------------
-- Other Subprograms --
-----------------------
procedure Activate_Atomic_Synchronization (N : Node_Id);
-- N is a node for which atomic synchronization may be required (it is
-- either an identifier, expanded name, or selected/indexed component or
-- an explicit dereference). The caller has checked the basic conditions
-- (atomic variable appearing and Atomic_Sync not disabled). This function
-- checks if atomic synchronization is required and if so sets the flag
-- and if appropriate generates a warning (in -gnatw.n mode).
procedure Adjust_Condition (N : Node_Id);
-- The node N is an expression whose root-type is Boolean, and which
-- represents a boolean value used as a condition (i.e. a True/False
-- value). This routine handles the case of C and Fortran convention
-- boolean types, which have zero/non-zero semantics rather than the normal
-- 0/1 semantics, and also the case of an enumeration rep clause that
-- specifies a non-standard representation. On return, node N always has
-- the type Standard.Boolean, with a value that is a standard Boolean
-- values of 0/1 for False/True. This procedure is used in two situations.
-- First, the processing for a condition field always calls
-- Adjust_Condition, so that the boolean value presented to the backend is
-- a standard value. Second, for the code for boolean operations such as
-- AND, Adjust_Condition is called on both operands, and then the operation
-- is done in the domain of Standard_Boolean, then Adjust_Result_Type is
-- called on the result to possibly reset the original type. This procedure
-- also takes care of validity checking if Validity_Checks = Tests.
procedure Adjust_Result_Type (N : Node_Id; T : Entity_Id);
-- The processing of boolean operations like AND uses the procedure
-- Adjust_Condition so that it can operate on Standard.Boolean, which is
-- the only boolean type on which the backend needs to be able to implement
-- such operators. This means that the result is also of type
-- Standard.Boolean. In general the type must be reset back to the original
-- type to get proper semantics, and that is the purpose of this procedure.
-- N is the node (of type Standard.Boolean), and T is the desired type. As
-- an optimization, this procedure leaves the type as Standard.Boolean in
-- contexts where this is permissible (in particular for Condition fields,
-- and for operands of other logical operations higher up the tree). The
-- call to this procedure is completely ignored if the argument N is not of
-- type Boolean.
procedure Append_Freeze_Action (T : Entity_Id; N : Node_Id);
-- Add a new freeze action for the given type. The freeze action is
-- attached to the freeze node for the type. Actions will be elaborated in
-- the order in which they are added. Note that the added node is not
-- analyzed. The analyze call is found in Exp_Ch13.Expand_N_Freeze_Entity.
procedure Append_Freeze_Actions (T : Entity_Id; L : List_Id);
-- Adds the given list of freeze actions (declarations or statements) for
-- the given type. The freeze actions are attached to the freeze node for
-- the type. Actions will be elaborated in the order in which they are
-- added, and the actions within the list will be elaborated in list order.
-- Note that the added nodes are not analyzed. The analyze call is found in
-- Exp_Ch13.Expand_N_Freeze_Entity.
procedure Build_Allocate_Deallocate_Proc
(N : Node_Id;
Is_Allocate : Boolean);
-- Create a custom Allocate/Deallocate to be associated with an allocation
-- or deallocation:
--
-- 1) controlled objects
-- 2) class-wide objects
-- 3) any kind of object on a subpool
--
-- N must be an allocator or the declaration of a temporary variable which
-- represents the expression of the original allocator node, otherwise N
-- must be a free statement. If flag Is_Allocate is set, the generated
-- routine is allocate, deallocate otherwise.
function Build_Abort_Undefer_Block
(Loc : Source_Ptr;
Stmts : List_Id;
Context : Node_Id) return Node_Id;
-- Wrap statements Stmts in a block where the AT END handler contains a
-- call to Abort_Undefer_Direct. Context is the node which prompted the
-- inlining of the abort undefer routine. Note that this routine does
-- not install a call to Abort_Defer.
procedure Build_Class_Wide_Expression
(Prag : Node_Id;
Subp : Entity_Id;
Par_Subp : Entity_Id;
Adjust_Sloc : Boolean);
-- Build the expression for an inherited class-wide condition. Prag is
-- the pragma constructed from the corresponding aspect of the parent
-- subprogram, and Subp is the overriding operation, and Par_Subp is
-- the overridden operation that has the condition. Adjust_Sloc is True
-- when the sloc of nodes traversed should be adjusted for the inherited
-- pragma. The routine is also called to check whether an inherited
-- operation that is not overridden but has inherited conditions needs
-- a wrapper, because the inherited condition includes calls to other
-- primitives that have been overridden. In that case the first argument
-- is the expression of the original class-wide aspect. In SPARK_Mode, such
-- operation which are just inherited but have modified pre/postconditions
-- are illegal.
function Build_DIC_Call
(Loc : Source_Ptr;
Obj_Id : Entity_Id;
Typ : Entity_Id) return Node_Id;
-- Build a call to the DIC procedure of type Typ with Obj_Id as the actual
-- parameter.
procedure Build_DIC_Procedure_Body (Typ : Entity_Id);
-- Create the body of the procedure which verifies the assertion expression
-- of pragma Default_Initial_Condition at run time.
procedure Build_DIC_Procedure_Declaration (Typ : Entity_Id);
-- Create the declaration of the procedure which verifies the assertion
-- expression of pragma Default_Initial_Condition at run time.
procedure Build_Procedure_Form (N : Node_Id);
-- Create a procedure declaration which emulates the behavior of a function
-- that returns an array type, for C-compatible generation.
function Build_Runtime_Call (Loc : Source_Ptr; RE : RE_Id) return Node_Id;
-- Build an N_Procedure_Call_Statement calling the given runtime entity.
-- The call has no parameters. The first argument provides the location
-- information for the tree and for error messages. The call node is not
-- analyzed on return, the caller is responsible for analyzing it.
function Build_SS_Mark_Call
(Loc : Source_Ptr;
Mark : Entity_Id) return Node_Id;
-- Build a call to routine System.Secondary_Stack.Mark. Mark denotes the
-- entity of the secondary stack mark.
function Build_SS_Release_Call
(Loc : Source_Ptr;
Mark : Entity_Id) return Node_Id;
-- Build a call to routine System.Secondary_Stack.Release. Mark denotes the
-- entity of the secondary stack mark.
function Build_Task_Image_Decls
(Loc : Source_Ptr;
Id_Ref : Node_Id;
A_Type : Entity_Id;
In_Init_Proc : Boolean := False) return List_Id;
-- Build declaration for a variable that holds an identifying string to be
-- used as a task name. Id_Ref is an identifier if the task is a variable,
-- and a selected or indexed component if the task is component of an
-- object. If it is an indexed component, A_Type is the corresponding array
-- type. Its index types are used to build the string as an image of the
-- index values. For composite types, the result includes two declarations:
-- one for a generated function that computes the image without using
-- concatenation, and one for the variable that holds the result.
--
-- If In_Init_Proc is true, the call is part of the initialization of
-- a component of a composite type, and the enclosing initialization
-- procedure must be flagged as using the secondary stack. If In_Init_Proc
-- is false, the call is for a stand-alone object, and the generated
-- function itself must do its own cleanups.
procedure Build_Transient_Object_Statements
(Obj_Decl : Node_Id;
Fin_Call : out Node_Id;
Hook_Assign : out Node_Id;
Hook_Clear : out Node_Id;
Hook_Decl : out Node_Id;
Ptr_Decl : out Node_Id;
Finalize_Obj : Boolean := True);
-- Subsidiary to the processing of transient objects in transient scopes,
-- if expressions, case expressions, expression_with_action nodes, array
-- aggregates, and record aggregates. Obj_Decl denotes the declaration of
-- the transient object. Generate the following nodes:
--
-- * Fin_Call - the call to [Deep_]Finalize which cleans up the transient
-- object if flag Finalize_Obj is set to True, or finalizes the hook when
-- the flag is False.
--
-- * Hook_Assign - the assignment statement which captures a reference to
-- the transient object in the hook.
--
-- * Hook_Clear - the assignment statement which resets the hook to null
--
-- * Hook_Decl - the declaration of the hook object
--
-- * Ptr_Decl - the full type declaration of the hook type
--
-- These nodes are inserted in specific places depending on the context by
-- the various Process_Transient_xxx routines.
procedure Check_Float_Op_Overflow (N : Node_Id);
-- Called where we could have a floating-point binary operator where we
-- must check for infinities if we are operating in Check_Float_Overflow
-- mode. Note that we don't need to worry about unary operator cases,
-- since for floating-point, abs, unary "-", and unary "+" can never
-- case overflow.
function Component_May_Be_Bit_Aligned (Comp : Entity_Id) return Boolean;
-- This function is in charge of detecting record components that may
-- cause trouble in the back end if an attempt is made to assign the
-- component. The back end can handle such assignments with no problem if
-- the components involved are small (64-bits or less) records or scalar
-- items (including bit-packed arrays represented with modular types) or
-- are both aligned on a byte boundary (starting on a byte boundary, and
-- occupying an integral number of bytes).
--
-- However, problems arise for records larger than 64 bits, or for arrays
-- (other than bit-packed arrays represented with a modular type) if the
-- component starts on a non-byte boundary, or does not occupy an integral
-- number of bytes (i.e. there are some bits possibly shared with fields
-- at the start or beginning of the component). The back end cannot handle
-- loading and storing such components in a single operation.
--
-- This function is used to detect the troublesome situation. it is
-- conservative in the sense that it produces True unless it knows for
-- sure that the component is safe (as outlined in the first paragraph
-- above). The code generation for record and array assignment checks for
-- trouble using this function, and if so the assignment is generated
-- component-wise, which the back end is required to handle correctly.
--
-- Note that in GNAT 3, the back end will reject such components anyway,
-- so the hard work in checking for this case is wasted in GNAT 3, but
-- it is harmless, so it is easier to do it in all cases, rather than
-- conditionalize it in GNAT 5 or beyond.
function Containing_Package_With_Ext_Axioms
(E : Entity_Id) return Entity_Id;
-- Returns the package entity with an external axiomatization containing E,
-- if any, or Empty if none.
procedure Convert_To_Actual_Subtype (Exp : Node_Id);
-- The Etype of an expression is the nominal type of the expression,
-- not the actual subtype. Often these are the same, but not always.
-- For example, a reference to a formal of unconstrained type has the
-- unconstrained type as its Etype, but the actual subtype is obtained by
-- applying the actual bounds. This routine is given an expression, Exp,
-- and (if necessary), replaces it using Rewrite, with a conversion to
-- the actual subtype, building the actual subtype if necessary. If the
-- expression is already of the requested type, then it is unchanged.
function Corresponding_Runtime_Package (Typ : Entity_Id) return RTU_Id;
-- Return the id of the runtime package that will provide support for
-- concurrent type Typ. Currently only protected types are supported,
-- and the returned value is one of the following:
-- System_Tasking_Protected_Objects
-- System_Tasking_Protected_Objects_Entries
-- System_Tasking_Protected_Objects_Single_Entry
function Current_Sem_Unit_Declarations return List_Id;
-- Return the place where it is fine to insert declarations for the
-- current semantic unit. If the unit is a package body, return the
-- visible declarations of the corresponding spec. For RCI stubs, this
-- is necessary because the point at which they are generated may not
-- be the earliest point at which they are used.
function Duplicate_Subexpr
(Exp : Node_Id;
Name_Req : Boolean := False;
Renaming_Req : Boolean := False) return Node_Id;
-- Given the node for a subexpression, this function makes a logical copy
-- of the subexpression, and returns it. This is intended for use when the
-- expansion of an expression needs to repeat part of it. For example,
-- replacing a**2 by a*a requires two references to a which may be a
-- complex subexpression. Duplicate_Subexpr guarantees not to duplicate
-- side effects. If necessary, it generates actions to save the expression
-- value in a temporary, inserting these actions into the tree using
-- Insert_Actions with Exp as the insertion location. The original
-- expression and the returned result then become references to this saved
-- value. Exp must be analyzed on entry. On return, Exp is analyzed, but
-- the caller is responsible for analyzing the returned copy after it is
-- attached to the tree.
--
-- The Name_Req flag is set to ensure that the result is suitable for use
-- in a context requiring a name (for example, the prefix of an attribute
-- reference) (can't this just be a qualification in Ada 2012???).
--
-- The Renaming_Req flag is set to produce an object renaming declaration
-- rather than an object declaration. This is valid only if the expression
-- Exp designates a renamable object. This is used for example in the case
-- of an unchecked deallocation, to make sure the object gets set to null.
--
-- Note that if there are any run time checks in Exp, these same checks
-- will be duplicated in the returned duplicated expression. The two
-- following functions allow this behavior to be modified.
function Duplicate_Subexpr_No_Checks
(Exp : Node_Id;
Name_Req : Boolean := False;
Renaming_Req : Boolean := False;
Related_Id : Entity_Id := Empty;
Is_Low_Bound : Boolean := False;
Is_High_Bound : Boolean := False) return Node_Id;
-- Identical in effect to Duplicate_Subexpr, except that Remove_Checks is
-- called on the result, so that the duplicated expression does not include
-- checks. This is appropriate for use when Exp, the original expression is
-- unconditionally elaborated before the duplicated expression, so that
-- there is no need to repeat any checks.
--
-- Related_Id denotes the entity of the context where Expr appears. Flags
-- Is_Low_Bound and Is_High_Bound specify whether the expression to check
-- is the low or the high bound of a range. These three optional arguments
-- signal Remove_Side_Effects to create an external symbol of the form
-- Chars (Related_Id)_FIRST/_LAST. For suggested use of these parameters
-- see the warning in the body of Sem_Ch3.Process_Range_Expr_In_Decl.
function Duplicate_Subexpr_Move_Checks
(Exp : Node_Id;
Name_Req : Boolean := False;
Renaming_Req : Boolean := False) return Node_Id;
-- Identical in effect to Duplicate_Subexpr, except that Remove_Checks is
-- called on Exp after the duplication is complete, so that the original
-- expression does not include checks. In this case the result returned
-- (the duplicated expression) will retain the original checks. This is
-- appropriate for use when the duplicated expression is sure to be
-- elaborated before the original expression Exp, so that there is no need
-- to repeat the checks.
procedure Ensure_Defined (Typ : Entity_Id; N : Node_Id);
-- This procedure ensures that type referenced by Typ is defined. For the
-- case of a type other than an Itype, nothing needs to be done, since
-- all such types have declaration nodes. For Itypes, an N_Itype_Reference
-- node is generated and inserted as an action on node N. This is typically
-- used to ensure that an Itype is properly defined outside a conditional
-- construct when it is referenced in more than one branch.
function Entry_Names_OK return Boolean;
-- Determine whether it is appropriate to dynamically allocate strings
-- which represent entry [family member] names. These strings are created
-- by the compiler and used by GDB.
procedure Evaluate_Name (Nam : Node_Id);
-- Remove all side effects from a name which appears as part of an object
-- renaming declaration. More comments are needed here that explain how
-- this differs from Force_Evaluation and Remove_Side_Effects ???
procedure Evolve_And_Then (Cond : in out Node_Id; Cond1 : Node_Id);
-- Rewrites Cond with the expression: Cond and then Cond1. If Cond is
-- Empty, then simply returns Cond1 (this allows the use of Empty to
-- initialize a series of checks evolved by this routine, with a final
-- result of Empty indicating that no checks were required). The Sloc field
-- of the constructed N_And_Then node is copied from Cond1.
procedure Evolve_Or_Else (Cond : in out Node_Id; Cond1 : Node_Id);
-- Rewrites Cond with the expression: Cond or else Cond1. If Cond is Empty,
-- then simply returns Cond1 (this allows the use of Empty to initialize a
-- series of checks evolved by this routine, with a final result of Empty
-- indicating that no checks were required). The Sloc field of the
-- constructed N_Or_Else node is copied from Cond1.
procedure Expand_Static_Predicates_In_Choices (N : Node_Id);
-- N is either a case alternative or a variant. The Discrete_Choices field
-- of N points to a list of choices. If any of these choices is the name
-- of a (statically) predicated subtype, then it is rewritten as the series
-- of choices that correspond to the values allowed for the subtype.
procedure Expand_Subtype_From_Expr
(N : Node_Id;
Unc_Type : Entity_Id;
Subtype_Indic : Node_Id;
Exp : Node_Id;
Related_Id : Entity_Id := Empty);
-- Build a constrained subtype from the initial value in object
-- declarations and/or allocations when the type is indefinite (including
-- class-wide). Set Related_Id to request an external name for the subtype
-- rather than an internal temporary.
function Finalize_Address (Typ : Entity_Id) return Entity_Id;
-- Locate TSS primitive Finalize_Address in type Typ. Return Empty if the
-- subprogram is not available.
function Find_Interface_ADT
(T : Entity_Id;
Iface : Entity_Id) return Elmt_Id;
-- Ada 2005 (AI-251): Given a type T implementing the interface Iface,
-- return the element of Access_Disp_Table containing the tag of the
-- interface.
function Find_Interface_Tag
(T : Entity_Id;
Iface : Entity_Id) return Entity_Id;
-- Ada 2005 (AI-251): Given a type T implementing the interface Iface,
-- return the record component containing the tag of Iface.
function Find_Prim_Op (T : Entity_Id; Name : Name_Id) return Entity_Id;
-- Find the first primitive operation of a tagged type T with name Name.
-- This function allows the use of a primitive operation which is not
-- directly visible. If T is a class wide type, then the reference is to an
-- operation of the corresponding root type. It is an error if no primitive
-- operation with the given name is found.
function Find_Prim_Op
(T : Entity_Id;
Name : TSS_Name_Type) return Entity_Id;
-- Find the first primitive operation of type T whose name has the form
-- indicated by the name parameter (i.e. is a type support subprogram
-- with the indicated suffix). This function allows use of a primitive
-- operation which is not directly visible. If T is a class wide type,
-- then the reference is to an operation of the corresponding root type.
function Find_Optional_Prim_Op
(T : Entity_Id; Name : Name_Id) return Entity_Id;
function Find_Optional_Prim_Op
(T : Entity_Id;
Name : TSS_Name_Type) return Entity_Id;
-- Same as Find_Prim_Op, except returns Empty if not found
function Find_Protection_Object (Scop : Entity_Id) return Entity_Id;
-- Traverse the scope stack starting from Scop and look for an entry, entry
-- family, or a subprogram that has a Protection_Object and return it. Must
-- always return a value since the context in which this routine is invoked
-- should always have a protection object.
function Find_Protection_Type (Conc_Typ : Entity_Id) return Entity_Id;
-- Given a protected type or its corresponding record, find the type of
-- field _object.
function Find_Hook_Context (N : Node_Id) return Node_Id;
-- Determine a suitable node on which to attach actions related to N that
-- need to be elaborated unconditionally. In general this is the topmost
-- expression of which N is a subexpression, which in turn may or may not
-- be evaluated, for example if N is the right operand of a short circuit
-- operator.
function Following_Address_Clause (D : Node_Id) return Node_Id;
-- D is the node for an object declaration. This function searches the
-- current declarative part to look for an address clause for the object
-- being declared, and returns the clause if one is found, returns
-- Empty otherwise.
--
-- Note: this function can be costly and must be invoked with special care.
-- Possibly we could introduce a flag at parse time indicating the presence
-- of an address clause to speed this up???
--
-- Note: currently this function does not scan the private part, that seems
-- like a potential bug ???
type Force_Evaluation_Mode is (Relaxed, Strict);
procedure Force_Evaluation
(Exp : Node_Id;
Name_Req : Boolean := False;
Related_Id : Entity_Id := Empty;
Is_Low_Bound : Boolean := False;
Is_High_Bound : Boolean := False;
Mode : Force_Evaluation_Mode := Relaxed);
-- Force the evaluation of the expression right away. Similar behavior
-- to Remove_Side_Effects when Variable_Ref is set to TRUE. That is to
-- say, it removes the side effects and captures the values of the
-- variables. Remove_Side_Effects guarantees that multiple evaluations
-- of the same expression won't generate multiple side effects, whereas
-- Force_Evaluation further guarantees that all evaluations will yield
-- the same result. If Mode is Relaxed then calls to this subprogram have
-- no effect if Exp is side-effect free; if Mode is Strict and Exp is not
-- a static expression then no side-effect check is performed on Exp and
-- temporaries are unconditionally generated.
--
-- Related_Id denotes the entity of the context where Expr appears. Flags
-- Is_Low_Bound and Is_High_Bound specify whether the expression to check
-- is the low or the high bound of a range. These three optional arguments
-- signal Remove_Side_Effects to create an external symbol of the form
-- Chars (Related_Id)_FIRST/_LAST. If Related_Id is set, then exactly one
-- of the Is_xxx_Bound flags must be set. For use of these parameters see
-- the warning in the body of Sem_Ch3.Process_Range_Expr_In_Decl.
function Fully_Qualified_Name_String
(E : Entity_Id;
Append_NUL : Boolean := True) return String_Id;
-- Generates the string literal corresponding to the fully qualified name
-- of entity E, in all upper case, with an ASCII.NUL appended at the end
-- of the name if Append_NUL is True.
procedure Generate_Poll_Call (N : Node_Id);
-- If polling is active, then a call to the Poll routine is built,
-- and then inserted before the given node N and analyzed.
procedure Get_Current_Value_Condition
(Var : Node_Id;
Op : out Node_Kind;
Val : out Node_Id);
-- This routine processes the Current_Value field of the variable Var. If
-- the Current_Value field is null or if it represents a known value, then
-- on return Cond is set to N_Empty, and Val is set to Empty.
--
-- The other case is when Current_Value points to an N_If_Statement or an
-- N_Elsif_Part or a N_Iteration_Scheme node (see description in Einfo for
-- exact details). In this case, Get_Current_Condition digs out the
-- condition, and then checks if the condition is known false, known true,
-- or not known at all. In the first two cases, Get_Current_Condition will
-- return with Op set to the appropriate conditional operator (inverted if
-- the condition is known false), and Val set to the constant value. If the
-- condition is not known, then Op and Val are set for the empty case
-- (N_Empty and Empty).
--
-- The check for whether the condition is true/false unknown depends
-- on the case:
--
-- For an IF, the condition is known true in the THEN part, known false
-- in any ELSIF or ELSE part, and not known outside the IF statement in
-- question.
--
-- For an ELSIF, the condition is known true in the ELSIF part, known
-- FALSE in any subsequent ELSIF, or ELSE part, and not known before the
-- ELSIF, or after the end of the IF statement.
--
-- The caller can use this result to determine the value (for the case of
-- N_Op_Eq), or to determine the result of some other test in other cases
-- (e.g. no access check required if N_Op_Ne Null).
function Get_Stream_Size (E : Entity_Id) return Uint;
-- Return the stream size value of the subtype E
function Has_Access_Constraint (E : Entity_Id) return Boolean;
-- Given object or type E, determine if a discriminant is of an access type
function Has_Annotate_Pragma_For_External_Axiomatization
(E : Entity_Id) return Boolean;
-- Returns whether E is a package entity, for which the initial list of
-- pragmas at the start of the package declaration contains
-- pragma Annotate (GNATprove, External_Axiomatization);
function Homonym_Number (Subp : Entity_Id) return Nat;
-- Here subp is the entity for a subprogram. This routine returns the
-- homonym number used to disambiguate overloaded subprograms in the same
-- scope (the number is used as part of constructed names to make sure that
-- they are unique). The number is the ordinal position on the Homonym
-- chain, counting only entries in the current scope. If an entity is not
-- overloaded, the returned number will be one.
function Inside_Init_Proc return Boolean;
-- Returns True if current scope is within an init proc
function In_Library_Level_Package_Body (Id : Entity_Id) return Boolean;
-- Given an arbitrary entity, determine whether it appears at the library
-- level of a package body.
function In_Unconditional_Context (Node : Node_Id) return Boolean;
-- Node is the node for a statement or a component of a statement. This
-- function determines if the statement appears in a context that is
-- unconditionally executed, i.e. it is not within a loop or a conditional
-- or a case statement etc.
function Is_All_Null_Statements (L : List_Id) return Boolean;
-- Return True if all the items of the list are N_Null_Statement nodes.
-- False otherwise. True for an empty list. It is an error to call this
-- routine with No_List as the argument.
function Is_Displacement_Of_Object_Or_Function_Result
(Obj_Id : Entity_Id) return Boolean;
-- Determine whether Obj_Id is a source entity that has been initialized by
-- either a controlled function call or the assignment of another source
-- object. In both cases the initialization expression is rewritten as a
-- class-wide conversion of Ada.Tags.Displace.
function Is_Finalizable_Transient
(Decl : Node_Id;
Rel_Node : Node_Id) return Boolean;
-- Determine whether declaration Decl denotes a controlled transient which
-- should be finalized. Rel_Node is the related context. Even though some
-- transients are controlled, they may act as renamings of other objects or
-- function calls.
function Is_Fully_Repped_Tagged_Type (T : Entity_Id) return Boolean;
-- Tests given type T, and returns True if T is a non-discriminated tagged
-- type which has a record representation clause that specifies the layout
-- of all the components, including recursively components in all parent
-- types. We exclude discriminated types for convenience, it is extremely
-- unlikely that the special processing associated with the use of this
-- routine is useful for the case of a discriminated type, and testing for
-- component overlap would be a pain.
function Is_Library_Level_Tagged_Type (Typ : Entity_Id) return Boolean;
-- Return True if Typ is a library level tagged type. Currently we use
-- this information to build statically allocated dispatch tables.
function Is_Non_BIP_Func_Call (Expr : Node_Id) return Boolean;
-- Determine whether node Expr denotes a non build-in-place function call
function Is_Object_Access_BIP_Func_Call
(Expr : Node_Id;
Obj_Id : Entity_Id) return Boolean;
-- Determine if Expr denotes a build-in-place function which stores its
-- result in the BIPaccess actual parameter whose prefix must match Obj_Id.
function Is_Possibly_Unaligned_Object (N : Node_Id) return Boolean;
-- Node N is an object reference. This function returns True if it is
-- possible that the object may not be aligned according to the normal
-- default alignment requirement for its type (e.g. if it appears in a
-- packed record, or as part of a component that has a component clause.)
function Is_Possibly_Unaligned_Slice (N : Node_Id) return Boolean;
-- Determine whether the node P is a slice of an array where the slice
-- result may cause alignment problems because it has an alignment that
-- is not compatible with the type. Return True if so.
function Is_Ref_To_Bit_Packed_Array (N : Node_Id) return Boolean;
-- Determine whether the node P is a reference to a bit packed array, i.e.
-- whether the designated object is a component of a bit packed array, or a
-- subcomponent of such a component. If so, then all subscripts in P are
-- evaluated with a call to Force_Evaluation, and True is returned.
-- Otherwise False is returned, and P is not affected.
function Is_Ref_To_Bit_Packed_Slice (N : Node_Id) return Boolean;
-- Determine whether the node P is a reference to a bit packed slice, i.e.
-- whether the designated object is bit packed slice or a component of a
-- bit packed slice. Return True if so.
function Is_Related_To_Func_Return (Id : Entity_Id) return Boolean;
-- Determine whether object Id is related to an expanded return statement.
-- The case concerned is "return Id.all;".
function Is_Renamed_Object (N : Node_Id) return Boolean;
-- Returns True if the node N is a renamed object. An expression is
-- considered to be a renamed object if either it is the Name of an object
-- renaming declaration, or is the prefix of a name which is a renamed
-- object. For example, in:
--
-- x : r renames a (1 .. 2) (1);
--
-- We consider that a (1 .. 2) is a renamed object since it is the prefix
-- of the name in the renaming declaration.
function Is_Secondary_Stack_BIP_Func_Call (Expr : Node_Id) return Boolean;
-- Determine whether Expr denotes a build-in-place function which returns
-- its result on the secondary stack.
function Is_Tag_To_Class_Wide_Conversion
(Obj_Id : Entity_Id) return Boolean;
-- Determine whether object Obj_Id is the result of a tag-to-class-wide
-- type conversion.
function Is_Untagged_Derivation (T : Entity_Id) return Boolean;
-- Returns true if type T is not tagged and is a derived type,
-- or is a private type whose completion is such a type.
function Is_Volatile_Reference (N : Node_Id) return Boolean;
-- Checks if the node N represents a volatile reference, which can be
-- either a direct reference to a variable treated as volatile, or an
-- indexed/selected component where the prefix is treated as volatile,
-- or has Volatile_Components set. A slice of a volatile variable is
-- also volatile.
procedure Kill_Dead_Code (N : Node_Id; Warn : Boolean := False);
-- N represents a node for a section of code that is known to be dead. Any
-- exception handler references and warning messages relating to this code
-- are removed. If Warn is True, a warning will be output at the start of N
-- indicating the deletion of the code. Note that the tree for the deleted
-- code is left intact so that e.g. cross-reference data is still valid.
procedure Kill_Dead_Code (L : List_Id; Warn : Boolean := False);
-- Like the above procedure, but applies to every element in the given
-- list. If Warn is True, a warning will be output at the start of N
-- indicating the deletion of the code.
function Known_Non_Negative (Opnd : Node_Id) return Boolean;
-- Given a node for a subexpression, determines if it represents a value
-- that cannot possibly be negative, and if so returns True. A value of
-- False means that it is not known if the value is positive or negative.
function Known_Non_Null (N : Node_Id) return Boolean;
-- Given a node N for a subexpression of an access type, determines if
-- this subexpression yields a value that is known at compile time to
-- be non-null and returns True if so. Returns False otherwise. It is
-- an error to call this function if N is not of an access type.
function Known_Null (N : Node_Id) return Boolean;
-- Given a node N for a subexpression of an access type, determines if this
-- subexpression yields a value that is known at compile time to be null
-- and returns True if so. Returns False otherwise. It is an error to call
-- this function if N is not of an access type.
function Make_Invariant_Call (Expr : Node_Id) return Node_Id;
-- Expr is an object of a type which Has_Invariants set (and which thus
-- also has an Invariant_Procedure set). If invariants are enabled, this
-- function returns a call to the Invariant procedure passing Expr as the
-- argument, and returns it unanalyzed. If invariants are not enabled,
-- returns a null statement.
function Make_Predicate_Call
(Typ : Entity_Id;
Expr : Node_Id;
Mem : Boolean := False) return Node_Id;
-- Typ is a type with Predicate_Function set. This routine builds a call to
-- this function passing Expr as the argument, and returns it unanalyzed.
-- If Mem is set True, this is the special call for the membership case,
-- and the function called is the Predicate_Function_M if present.
function Make_Predicate_Check
(Typ : Entity_Id;
Expr : Node_Id) return Node_Id;
-- Typ is a type with Predicate_Function set. This routine builds a Check
-- pragma whose first argument is Predicate, and the second argument is
-- a call to the predicate function of Typ with Expr as the argument. If
-- Predicate_Check is suppressed then a null statement is returned instead.
function Make_Subtype_From_Expr
(E : Node_Id;
Unc_Typ : Entity_Id;
Related_Id : Entity_Id := Empty) return Node_Id;
-- Returns a subtype indication corresponding to the actual type of an
-- expression E. Unc_Typ is an unconstrained array or record, or a class-
-- wide type. Set Related_Id to request an external name for the subtype
-- rather than an internal temporary.
function Matching_Standard_Type (Typ : Entity_Id) return Entity_Id;
-- Given a scalar subtype Typ, returns a matching type in standard that
-- has the same object size value. For example, a 16 bit signed type will
-- typically return Standard_Short_Integer. For fixed-point types, this
-- will return integer types of the corresponding size.
function May_Generate_Large_Temp (Typ : Entity_Id) return Boolean;
-- Determines if the given type, Typ, may require a large temporary of the
-- kind that causes back-end trouble if stack checking is enabled. The
-- result is True only the size of the type is known at compile time and
-- large, where large is defined heuristically by the body of this routine.
-- The purpose of this routine is to help avoid generating troublesome
-- temporaries that interfere with stack checking mechanism. Note that the
-- caller has to check whether stack checking is actually enabled in order
-- to guide the expansion (typically of a function call).
function Needs_Constant_Address
(Decl : Node_Id;
Typ : Entity_Id) return Boolean;
-- Check whether the expression in an address clause is restricted to
-- consist of constants, when the object has a nontrivial initialization
-- or is controlled.
function Needs_Finalization (T : Entity_Id) return Boolean;
-- True if type T is controlled, or has controlled subcomponents. Also
-- True if T is a class-wide type, because some type extension might add
-- controlled subcomponents, except that if pragma Restrictions
-- (No_Finalization) applies, this is False for class-wide types.
function Non_Limited_Designated_Type (T : Entity_Id) return Entity_Id;
-- An anonymous access type may designate a limited view. Check whether
-- non-limited view is available during expansion, to examine components
-- or other characteristics of the full type.
function OK_To_Do_Constant_Replacement (E : Entity_Id) return Boolean;
-- This function is used when testing whether or not to replace a reference
-- to entity E by a known constant value. Such replacement must be done
-- only in a scope known to be safe for such replacements. In particular,
-- if we are within a subprogram and the entity E is declared outside the
-- subprogram then we cannot do the replacement, since we do not attempt to
-- trace subprogram call flow. It is also unsafe to replace statically
-- allocated values (since they can be modified outside the scope), and we
-- also inhibit replacement of Volatile or aliased objects since their
-- address might be captured in a way we do not detect. A value of True is
-- returned only if the replacement is safe.
function Possible_Bit_Aligned_Component (N : Node_Id) return Boolean;
-- This function is used during processing the assignment of a record or
-- indexed component. The argument N is either the left hand or right hand
-- side of an assignment, and this function determines if there is a record
-- component reference where the record may be bit aligned in a manner that
-- causes trouble for the back end (see Component_May_Be_Bit_Aligned for
-- further details).
function Power_Of_Two (N : Node_Id) return Nat;
-- Determines if N is a known at compile time value which is of the form
-- 2**K, where K is in the range 1 .. M, where the Esize of N is 2**(M+1).
-- If so, returns the value K, otherwise returns zero. The caller checks
-- that N is of an integer type.
procedure Process_Statements_For_Controlled_Objects (N : Node_Id);
-- N is a node which contains a non-handled statement list. Inspect the
-- statements looking for declarations of controlled objects. If at least
-- one such object is found, wrap the statement list in a block.
function Remove_Init_Call
(Var : Entity_Id;
Rep_Clause : Node_Id) return Node_Id;
-- Look for init_proc call or aggregate initialization statements for
-- variable Var, either among declarations between that of Var and a
-- subsequent Rep_Clause applying to Var, or in the list of freeze actions
-- associated with Var, and if found, remove and return that call node.
procedure Remove_Side_Effects
(Exp : Node_Id;
Name_Req : Boolean := False;
Renaming_Req : Boolean := False;
Variable_Ref : Boolean := False;
Related_Id : Entity_Id := Empty;
Is_Low_Bound : Boolean := False;
Is_High_Bound : Boolean := False;
Check_Side_Effects : Boolean := True);
-- Given the node for a subexpression, this function replaces the node if
-- necessary by an equivalent subexpression that is guaranteed to be side
-- effect free. This is done by extracting any actions that could cause
-- side effects, and inserting them using Insert_Actions into the tree
-- to which Exp is attached. Exp must be analyzed and resolved before the
-- call and is analyzed and resolved on return. Name_Req may only be set to
-- True if Exp has the form of a name, and the effect is to guarantee that
-- any replacement maintains the form of name. If Renaming_Req is set to
-- True, the routine produces an object renaming reclaration capturing the
-- expression. If Variable_Ref is set to True, a variable is considered as
-- side effect (used in implementing Force_Evaluation). Note: after call to
-- Remove_Side_Effects, it is safe to call New_Copy_Tree to obtain a copy
-- of the resulting expression. If Check_Side_Effects is set to True then
-- no action is performed if Exp is known to be side-effect free.
--
-- Related_Id denotes the entity of the context where Expr appears. Flags
-- Is_Low_Bound and Is_High_Bound specify whether the expression to check
-- is the low or the high bound of a range. These three optional arguments
-- signal Remove_Side_Effects to create an external symbol of the form
-- Chars (Related_Id)_FIRST/_LAST. If Related_Id is set, then exactly one
-- of the Is_xxx_Bound flags must be set. For use of these parameters see
-- the warning in the body of Sem_Ch3.Process_Range_Expr_In_Decl.
--
-- The side effects are captured using one of the following methods:
--
-- 1) a constant initialized with the value of the subexpression
-- 2) a renaming of the subexpression
-- 3) a reference to the subexpression
--
-- For elementary types, methods 1) and 2) are used; for composite types,
-- methods 2) and 3) are used. The renaming (method 2) is used only when
-- the subexpression denotes a name, so that it can be elaborated by gigi
-- without evaluating the subexpression.
--
-- Historical note: the reference (method 3) used to be the common fallback
-- method but it gives rise to aliasing issues if the subexpression denotes
-- a name that is not aliased, since it is equivalent to taking the address
-- in this case. The renaming (method 2) used to be applied to any objects
-- in the RM sense, that is to say to the cases where a renaming is legal
-- in Ada. But for some of these cases, most notably functions calls, the
-- renaming cannot be elaborated without evaluating the subexpression, so
-- gigi would resort to method 1) or 3) under the hood for them.
function Represented_As_Scalar (T : Entity_Id) return Boolean;
-- Returns True iff the implementation of this type in code generation
-- terms is scalar. This is true for scalars in the Ada sense, and for
-- packed arrays which are represented by a scalar (modular) type.
function Requires_Cleanup_Actions
(N : Node_Id;
Lib_Level : Boolean) return Boolean;
-- Given a node N, determine whether its declarative and/or statement list
-- contains one of the following:
--
-- 1) controlled objects
-- 2) library-level tagged types
--
-- These cases require special actions on scope exit. The flag Lib_Level
-- is set True if the construct is at library level, and False otherwise.
function Safe_Unchecked_Type_Conversion (Exp : Node_Id) return Boolean;
-- Given the node for an N_Unchecked_Type_Conversion, return True if this
-- is an unchecked conversion that Gigi can handle directly. Otherwise
-- return False if it is one for which the front end must provide a
-- temporary. Note that the node need not be analyzed, and thus the Etype
-- field may not be set, but in that case it must be the case that the
-- Subtype_Mark field of the node is set/analyzed.
procedure Set_Current_Value_Condition (Cnode : Node_Id);
-- Cnode is N_If_Statement, N_Elsif_Part, or N_Iteration_Scheme (the latter
-- when a WHILE condition is present). This call checks whether Condition
-- (Cnode) has embedded expressions of a form that should result in setting
-- the Current_Value field of one or more entities, and if so sets these
-- fields to point to Cnode.
procedure Set_Elaboration_Flag (N : Node_Id; Spec_Id : Entity_Id);
-- N is the node for a subprogram or generic body, and Spec_Id is the
-- entity for the corresponding spec. If an elaboration entity is defined,
-- then this procedure generates an assignment statement to set it True,
-- immediately after the body is elaborated. However, no assignment is
-- generated in the case of library level procedures, since the setting of
-- the flag in this case is generated in the binder. We do that so that we
-- can detect cases where this is the only elaboration action that is
-- required.
procedure Set_Renamed_Subprogram (N : Node_Id; E : Entity_Id);
-- N is an node which is an entity name that represents the name of a
-- renamed subprogram. The node is rewritten to be an identifier that
-- refers directly to the renamed subprogram, given by entity E.
function Side_Effect_Free
(N : Node_Id;
Name_Req : Boolean := False;
Variable_Ref : Boolean := False) return Boolean;
-- Determines if the tree N represents an expression that is known not
-- to have side effects. If this function returns True, then for example
-- a call to Remove_Side_Effects has no effect.
--
-- Name_Req controls the handling of volatile variable references. If
-- Name_Req is False (the normal case), then volatile references are
-- considered to be side effects. If Name_Req is True, then volatility
-- of variables is ignored.
--
-- If Variable_Ref is True, then all variable references are considered to
-- be side effects (regardless of volatility or the setting of Name_Req).
function Side_Effect_Free
(L : List_Id;
Name_Req : Boolean := False;
Variable_Ref : Boolean := False) return Boolean;
-- Determines if all elements of the list L are side-effect free. Name_Req
-- and Variable_Ref are as described above.
procedure Silly_Boolean_Array_Not_Test (N : Node_Id; T : Entity_Id);
-- N is the node for a boolean array NOT operation, and T is the type of
-- the array. This routine deals with the silly case where the subtype of
-- the boolean array is False..False or True..True, where it is required
-- that a Constraint_Error exception be raised (RM 4.5.6(6)).
procedure Silly_Boolean_Array_Xor_Test (N : Node_Id; T : Entity_Id);
-- N is the node for a boolean array XOR operation, and T is the type of
-- the array. This routine deals with the silly case where the subtype of
-- the boolean array is True..True, where a raise of a Constraint_Error
-- exception is required (RM 4.5.6(6)).
function Target_Has_Fixed_Ops
(Left_Typ : Entity_Id;
Right_Typ : Entity_Id;
Result_Typ : Entity_Id) return Boolean;
-- Returns True if and only if the target machine has direct support
-- for fixed-by-fixed multiplications and divisions for the given
-- operand and result types. This is called in package Exp_Fixd to
-- determine whether to expand such operations.
function Type_May_Have_Bit_Aligned_Components
(Typ : Entity_Id) return Boolean;
-- Determines if Typ is a composite type that has within it (looking down
-- recursively at any subcomponents), a record type which has component
-- that may be bit aligned (see Possible_Bit_Aligned_Component). The result
-- is conservative, in that a result of False is decisive. A result of True
-- means that such a component may or may not be present.
procedure Update_Primitives_Mapping
(Inher_Id : Entity_Id;
Subp_Id : Entity_Id);
-- Map primitive operations of the parent type to the corresponding
-- operations of the descendant. Note that the descendant type may not be
-- frozen yet, so we cannot use the dispatch table directly. This is called
-- when elaborating a contract for a subprogram, and when freezing a type
-- extension to verify legality rules on inherited conditions.
procedure Update_Primitives_Mapping_Of_Types
(Par_Typ : Entity_Id;
Deriv_Typ : Entity_Id);
-- Map the primitive operations of parent type Par_Typ to the corresponding
-- primitives of derived type Deriv_Typ.
function Within_Case_Or_If_Expression (N : Node_Id) return Boolean;
-- Determine whether arbitrary node N is within a case or an if expression
function Within_Internal_Subprogram return Boolean;
-- Indicates that some expansion is taking place within the body of a
-- predefined primitive operation. Some expansion activity (e.g. predicate
-- checks) is disabled in such.
private
pragma Inline (Duplicate_Subexpr);
pragma Inline (Force_Evaluation);
pragma Inline (Is_Library_Level_Tagged_Type);
end Exp_Util;
| 53.705987 | 79 | 0.705276 |
29dad78749354ba03f397a3c80bcd7433f6353da | 666 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/derived_aggregate.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/derived_aggregate.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/derived_aggregate.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- { dg-do run }
-- { dg-options "-O2" }
procedure Derived_Aggregate is
type Int is range 1 .. 10;
type Str is array (Int range <>) of Character;
type Parent (D1, D2 : Int; B : Boolean) is
record
S : Str (D1 .. D2);
case B is
when False => C1 : Integer;
when True => C2 : Float;
end case;
end record;
for Parent'Alignment use 8;
type Derived (D : Int) is new Parent (D1 => D, D2 => D, B => False);
function Ident (I : Integer) return integer is
begin
return I;
end;
Y : Derived := (D => 7, S => "b", C1 => Ident (32));
begin
if Parent(Y).D1 /= 7 then
raise Program_Error;
end if;
end;
| 20.181818 | 70 | 0.558559 |
590aadf5c877ddc62fe6f6c1f460e6999048c535 | 18,606 | adb | Ada | regtests/util-serialize-io-xml-tests.adb | My-Colaborations/ada-util | 039b219f8247e541e281bba73b61f683c52db579 | [
"Apache-2.0"
] | null | null | null | regtests/util-serialize-io-xml-tests.adb | My-Colaborations/ada-util | 039b219f8247e541e281bba73b61f683c52db579 | [
"Apache-2.0"
] | null | null | null | regtests/util-serialize-io-xml-tests.adb | My-Colaborations/ada-util | 039b219f8247e541e281bba73b61f683c52db579 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- serialize-io-xml-tests -- Unit tests for XML serialization
-- Copyright (C) 2011, 2012, 2016, 2017, 2018 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.Unbounded;
with Ada.Streams.Stream_IO;
with Util.Test_Caller;
with Util.Log.Loggers;
with Util.Streams.Files;
with Util.Serialize.IO.JSON.Tests;
with Util.Serialize.IO.XML;
with Util.Serialize.Mappers.Record_Mapper;
package body Util.Serialize.IO.XML.Tests is
use Util.Log;
use Util.Tests;
use Ada.Strings.Unbounded;
Log : constant Loggers.Logger := Loggers.Create ("Util.Serialize.IO.Tests");
type Map_Test is record
Value : Natural := 0;
Bool : Boolean := False;
Name : Unbounded_String;
Node : Util.Beans.Objects.Object;
end record;
type Map_Test_Access is access all Map_Test;
type Map_Test_Fields is (FIELD_VALUE, FIELD_BOOL, FIELD_NAME, FIELD_NODE);
function Get_Member (P : in Map_Test;
Field : in Map_Test_Fields) return Util.Beans.Objects.Object;
procedure Set_Member (P : in out Map_Test;
Field : in Map_Test_Fields;
Value : in Util.Beans.Objects.Object);
procedure Set_Member (P : in out Map_Test;
Field : in Map_Test_Fields;
Value : in Util.Beans.Objects.Object) is
begin
case Field is
when FIELD_VALUE =>
P.Value := Natural (Util.Beans.Objects.To_Integer (Value));
when FIELD_BOOL =>
P.Bool := Util.Beans.Objects.To_Boolean (Value);
when FIELD_NAME =>
P.Name := Util.Beans.Objects.To_Unbounded_String (Value);
if P.Name = "raise-field-error" then
raise Util.Serialize.Mappers.Field_Error with "Testing Field_Error exception";
end if;
if P.Name = "raise-field-fatal-error" then
raise Util.Serialize.Mappers.Field_Fatal_Error with "Testing Fatal_Error exception";
end if;
when FIELD_NODE =>
P.Node := Value;
end case;
end Set_Member;
function Get_Member (P : in Map_Test;
Field : in Map_Test_Fields) return Util.Beans.Objects.Object is
begin
case Field is
when FIELD_VALUE =>
return Util.Beans.Objects.To_Object (P.Value);
when FIELD_BOOL =>
return Util.Beans.Objects.To_Object (P.Bool);
when FIELD_NAME =>
return Util.Beans.Objects.To_Object (P.Name);
when FIELD_NODE =>
return P.Node;
end case;
end Get_Member;
package Map_Test_Mapper is
new Util.Serialize.Mappers.Record_Mapper (Element_Type => Map_Test,
Element_Type_Access => Map_Test_Access,
Fields => Map_Test_Fields,
Set_Member => Set_Member);
package Caller is new Util.Test_Caller (Test, "Serialize.IO.XML");
procedure Add_Tests (Suite : in Util.Tests.Access_Test_Suite) is
begin
Caller.Add_Test (Suite, "Test Util.Serialize.IO.XML.Parser",
Test_Parser'Access);
Caller.Add_Test (Suite, "Test Util.Serialize.IO.XML.Parser2",
Test_Parser2'Access);
Caller.Add_Test (Suite, "Test Util.Serialize.IO.XML.Parser Wildcard Mapping",
Test_Parser_Wildcard_Mapping'Access);
Caller.Add_Test (Suite, "Test Util.Serialize.IO.XML.Parser Deep_Wildcard Mapping",
Test_Parser_Deep_Wildcard_Mapping'Access);
Caller.Add_Test (Suite, "Test Util.Serialize.IO.XML.Parser_Error",
Test_Parser_Error'Access);
Caller.Add_Test (Suite, "Test Util.Serialize.IO.XML.Write",
Test_Writer'Access);
Caller.Add_Test (Suite, "Test Util.Serialize.IO.XML.Write",
Test_Output'Access);
end Add_Tests;
-- ------------------------------
-- Test XML de-serialization
-- ------------------------------
procedure Test_Parser (T : in out Test) is
Mapping : aliased Map_Test_Mapper.Mapper;
Result : aliased Map_Test;
Reader : Util.Serialize.IO.XML.Parser;
Mapper : Util.Serialize.Mappers.Processing;
begin
Mapping.Add_Mapping ("name", FIELD_NAME);
Mapping.Add_Mapping ("value", FIELD_VALUE);
Mapping.Add_Mapping ("status", FIELD_BOOL);
Mapping.Add_Mapping ("@bool", FIELD_BOOL);
Mapping.Add_Mapping ("@id", FIELD_VALUE);
Mapper.Add_Mapping ("info/node", Mapping'Unchecked_Access);
Map_Test_Mapper.Set_Context (Mapper, Result'Unchecked_Access);
-- Extract XML and check name, value, status
Reader.Parse_String ("<info><node><name>A</name><value>2</value>"
& "<status>1</status></node></info>", Mapper);
T.Assert (not Reader.Has_Error, "The parser indicates an error");
Assert_Equals (T, "A", Result.Name, "Invalid name");
Assert_Equals (T, 2, Result.Value, "Invalid value");
T.Assert (Result.Bool, "Invalid boolean");
-- Another extraction.
Map_Test_Mapper.Set_Context (Mapper, Result'Unchecked_Access);
Reader.Parse_String ("<info><node><name>B</name><value>20</value>"
& "<status>0</status></node></info>", Mapper);
T.Assert (not Reader.Has_Error, "The parser indicates an error");
Assert_Equals (T, "B", Result.Name, "Invalid name");
Assert_Equals (T, 20, Result.Value, "Invalid value");
T.Assert (not Result.Bool, "Invalid boolean");
-- Another extraction using attribute mappings.
Reader.Parse_String ("<info><node id='23' bool='true'><name>TOTO</name></node></info>",
Mapper);
T.Assert (not Reader.Has_Error, "The parser indicates an error");
Assert_Equals (T, "TOTO", Result.Name, "Invalid name");
Assert_Equals (T, 23, Result.Value, "Invalid value");
T.Assert (Result.Bool, "Invalid boolean");
end Test_Parser;
-- ------------------------------
-- Test XML de-serialization
-- ------------------------------
procedure Test_Parser2 (T : in out Test) is
use type Util.Beans.Objects.Data_Type;
Mapping : aliased Map_Test_Mapper.Mapper;
Result : aliased Map_Test;
Reader : Util.Serialize.IO.XML.Parser;
Mapper : Util.Serialize.Mappers.Processing;
begin
Mapping.Add_Mapping ("node/name", FIELD_NAME);
Mapping.Add_Mapping ("node/value", FIELD_VALUE);
Mapping.Add_Mapping ("node/status", FIELD_BOOL);
Mapping.Add_Mapping ("node/@bool", FIELD_BOOL);
Mapping.Add_Mapping ("node/@id", FIELD_VALUE);
Mapping.Add_Mapping ("node", FIELD_NODE);
Mapper.Add_Mapping ("info", Mapping'Unchecked_Access);
Map_Test_Mapper.Set_Context (Mapper, Result'Unchecked_Access);
Result.Node := Util.Beans.Objects.Null_Object;
-- Extract XML and check name, value, status
Reader.Parse_String ("<info><node><name>A</name><value>2</value>"
& "<status>1</status></node></info>", Mapper);
T.Assert (not Reader.Has_Error, "The parser indicates an error");
Assert_Equals (T, "A", Result.Name, "Invalid name");
Assert_Equals (T, 2, Result.Value, "Invalid value");
T.Assert (Result.Bool, "Invalid boolean");
T.Assert (Util.Beans.Objects.Get_Type (Result.Node) = Util.Beans.Objects.TYPE_STRING,
"Invalid node type");
-- Another extraction.
Reader.Parse_String ("<info><node><name>B</name><value>20</value>"
& "<status>0</status></node></info>", Mapper);
Assert_Equals (T, "B", Result.Name, "Invalid name");
Assert_Equals (T, 20, Result.Value, "Invalid value");
T.Assert (not Result.Bool, "Invalid boolean");
-- Another extraction using attribute mappings.
Reader.Parse_String ("<info><node id='23' bool='true'><name>TOTO</name></node></info>",
Mapper);
Assert_Equals (T, "TOTO", Result.Name, "Invalid name");
Assert_Equals (T, 23, Result.Value, "Invalid value");
T.Assert (Result.Bool, "Invalid boolean");
end Test_Parser2;
-- -----------------------
-- Test wildcard mapping for serialization.
-- -----------------------
procedure Test_Parser_Wildcard_Mapping (T : in out Test) is
use type Util.Beans.Objects.Data_Type;
Mapping : aliased Map_Test_Mapper.Mapper;
Result : aliased Map_Test;
Reader : Util.Serialize.IO.XML.Parser;
Mapper : Util.Serialize.Mappers.Processing;
begin
Mapping.Add_Mapping ("node/*/status", FIELD_BOOL);
Mapping.Add_Mapping ("node/*/name", FIELD_NAME);
Mapping.Add_Mapping ("node/*/value", FIELD_VALUE);
Mapping.Add_Mapping ("node/*/name/@bool", FIELD_BOOL);
Mapping.Add_Mapping ("node/@id", FIELD_VALUE);
Mapping.Add_Mapping ("node", FIELD_NODE);
Mapper.Add_Mapping ("info", Mapping'Unchecked_Access);
Map_Test_Mapper.Set_Context (Mapper, Result'Unchecked_Access);
Result.Node := Util.Beans.Objects.Null_Object;
-- Extract XML and check name, value, status
Reader.Parse_String ("<info><node><inner><name>A</name><value>2</value></inner>"
& "<status>1</status></node></info>", Mapper);
T.Assert (not Reader.Has_Error, "The parser indicates an error");
Assert_Equals (T, "A", Result.Name, "Invalid name");
Assert_Equals (T, 2, Result.Value, "Invalid value");
T.Assert (Result.Bool, "Invalid boolean");
T.Assert (Util.Beans.Objects.Get_Type (Result.Node) = Util.Beans.Objects.TYPE_STRING,
"Invalid node type");
-- Another extraction.
Reader.Parse_String ("<info><node><b><c><d><name>B</name><value>20</value></d></c></b>"
& "<status>0</status></node></info>", Mapper);
Assert_Equals (T, "B", Result.Name, "Invalid name");
Assert_Equals (T, 20, Result.Value, "Invalid value");
T.Assert (not Result.Bool, "Invalid boolean");
-- Another extraction using attribute mappings.
Reader.Parse_String ("<info><node id='23'><name bool='true'>TOTO</name></node></info>",
Mapper);
Assert_Equals (T, "TOTO", Result.Name, "Invalid name");
Assert_Equals (T, 23, Result.Value, "Invalid value");
T.Assert (Result.Bool, "Invalid boolean");
end Test_Parser_Wildcard_Mapping;
-- -----------------------
-- Test (**) wildcard mapping for serialization.
-- -----------------------
procedure Test_Parser_Deep_Wildcard_Mapping (T : in out Test) is
use type Util.Beans.Objects.Data_Type;
Mapping : aliased Map_Test_Mapper.Mapper;
Result : aliased Map_Test;
Reader : Util.Serialize.IO.XML.Parser;
Mapper : Util.Serialize.Mappers.Processing;
begin
Mapping.Add_Mapping ("**/node/@id", FIELD_VALUE);
Mapping.Add_Mapping ("**/node/name", FIELD_NAME);
Mapping.Add_Mapping ("**/node/name/@bool", FIELD_BOOL);
Mapping.Add_Mapping ("**/node", FIELD_NODE);
Mapping.Dump (Log);
Mapper.Add_Mapping ("info", Mapping'Unchecked_Access);
Map_Test_Mapper.Set_Context (Mapper, Result'Unchecked_Access);
Mapper.Dump (Log);
Result.Node := Util.Beans.Objects.Null_Object;
-- Extract XML and check name, value, status
Reader.Parse_String ("<info><node><node id='2'><name bool='1'>A</name>"
& "<value>2</value></node>"
& "<status>1</status></node></info>", Mapper);
T.Assert (not Reader.Has_Error, "The parser indicates an error");
Assert_Equals (T, "A", Result.Name, "Invalid name");
Assert_Equals (T, 2, Result.Value, "Invalid value");
T.Assert (Result.Bool, "Invalid boolean");
T.Assert (Util.Beans.Objects.Get_Type (Result.Node) = Util.Beans.Objects.TYPE_STRING,
"Invalid node type");
Reader.Parse_String ("<info><node><a><b><node id='3'><name bool='0'>B</name>"
& "<d><value>2</value></d></node></b></a>"
& "<status>1</status></node></info>", Mapper);
T.Assert (not Reader.Has_Error, "The parser indicates an error");
Assert_Equals (T, "B", Result.Name, "Invalid name");
Assert_Equals (T, 3, Result.Value, "Invalid value");
T.Assert (not Result.Bool, "Invalid boolean");
T.Assert (Util.Beans.Objects.Get_Type (Result.Node) = Util.Beans.Objects.TYPE_STRING,
"Invalid node type");
end Test_Parser_Deep_Wildcard_Mapping;
-- ------------------------------
-- Test XML de-serialization with some errors.
-- ------------------------------
procedure Test_Parser_Error (T : in out Test) is
procedure Check_Error (Content : in String;
Msg : in String);
procedure Check_Error (Content : in String;
Msg : in String) is
Mapping : aliased Map_Test_Mapper.Mapper;
Result : aliased Map_Test;
Reader : Util.Serialize.IO.XML.Parser;
Mapper : Util.Serialize.Mappers.Processing;
begin
Mapping.Add_Mapping ("node/name", FIELD_NAME);
Mapping.Add_Mapping ("node/value", FIELD_VALUE);
Mapping.Add_Mapping ("node/status", FIELD_BOOL);
Mapping.Add_Mapping ("node/@bool", FIELD_BOOL);
Mapping.Add_Mapping ("node/@id", FIELD_VALUE);
Mapping.Add_Mapping ("node", FIELD_NODE);
Mapper.Add_Mapping ("info", Mapping'Unchecked_Access);
Map_Test_Mapper.Set_Context (Mapper, Result'Unchecked_Access);
Result.Node := Util.Beans.Objects.Null_Object;
-- Extract XML and check name, value, status
Reader.Parse_String (Content, Mapper);
T.Assert (Reader.Has_Error, "No error reported by the parser for an invalid XML: " & Msg);
end Check_Error;
begin
Check_Error ("<info><node><name>A</name><value>2</value>"
& "<status>1</status></node>", "XML element is not closed");
Check_Error ("<info><node><name attr=>A</name><value>2</value>"
& "<status>1</status></node></info>", "XML attribute is not correct");
Check_Error ("<info><node><name attr='x'>A</name><value>&something;</value>"
& "<status>1</status></node></info>", "XML attribute is not correct");
Check_Error ("<info><node><name attr='x'>A</name><value>raise-field-error</value>"
& "<status>1</status></node></info>", "Field_Error exception");
Check_Error ("<info><node><name attr='x'>A</name><value>raise-fatal-error</value>"
& "<status>1</status></node></info>", "Field_Error exception");
Check_Error ("<info><node><name attr='x'>raise-field-error</name><value>3</value>"
& "<status>1</status></node></info>", "Field_Error exception");
Check_Error ("<info><node><name attr='x'>raise-field-fatal-error</name><value>3</value>"
& "<status>1</status></node></info>", "Field_Error exception");
end Test_Parser_Error;
-- ------------------------------
-- Test XML serialization
-- ------------------------------
procedure Test_Writer (T : in out Test) is
function Serialize (Value : in Map_Test) return String;
Mapping : aliased Map_Test_Mapper.Mapper;
Result : aliased Map_Test;
Mapper : Util.Serialize.Mappers.Processing;
function Serialize (Value : in Map_Test) return String is
Buffer : aliased Util.Streams.Texts.Print_Stream;
Output : Util.Serialize.IO.XML.Output_Stream;
begin
Buffer.Initialize (Size => 10000);
Output.Initialize (Output => Buffer'Unchecked_Access);
Mapping.Write (Output, Value);
return Util.Streams.Texts.To_String (Buffer);
end Serialize;
begin
Mapping.Add_Mapping ("name", FIELD_NAME);
Mapping.Add_Mapping ("value", FIELD_VALUE);
Mapping.Add_Mapping ("status", FIELD_BOOL);
-- Mapping.Add_Mapping ("@bool", FIELD_BOOL);
-- Mapping.Add_Mapping ("@id", FIELD_VALUE);
Mapping.Bind (Get_Member'Access);
Mapper.Add_Mapping ("info/node", Mapping'Unchecked_Access);
Result.Name := To_Unbounded_String ("test");
Result.Bool := False;
Result.Value := 23;
declare
XML : constant String := Serialize (Result);
begin
Log.Info ("Serialize XML: {0}", XML);
T.Assert (XML'Length > 0, "Invalid XML serialization");
end;
end Test_Writer;
-- ------------------------------
-- Test the XML output stream generation.
-- ------------------------------
procedure Test_Output (T : in out Test) is
File : aliased Util.Streams.Files.File_Stream;
Buffer : aliased Util.Streams.Texts.Print_Stream;
Stream : Util.Serialize.IO.XML.Output_Stream;
Expect : constant String := Util.Tests.Get_Path ("regtests/expect/test-stream.xml");
Path : constant String := Util.Tests.Get_Test_Path ("regtests/result/test-stream.xml");
begin
File.Create (Mode => Ada.Streams.Stream_IO.Out_File, Name => Path);
Buffer.Initialize (Output => File'Unchecked_Access, Size => 10000);
Stream.Initialize (Output => Buffer'Unchecked_Access);
Util.Serialize.IO.JSON.Tests.Write_Stream (Stream);
Stream.Close;
Util.Tests.Assert_Equal_Files (T => T,
Expect => Expect,
Test => Path,
Message => "XML output serialization");
end Test_Output;
end Util.Serialize.IO.XML.Tests;
| 43.57377 | 99 | 0.600451 |
3dca9fc9a636fbbda600eb0c52e7d794b8d62749 | 3,808 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c8/c83f01b.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/c83f01b.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c8/c83f01b.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C83F01B.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 INSIDE A PACKAGE BODY NESTED WITHIN ANOTHER PACKAGE BODY
-- AN ATTEMPT TO REFERENCE AN IDENTIFIER DECLARED IN THE
-- CORRESPONDING PACKAGE SPECIFICATION
-- IS SUCCESSFUL EVEN IF THE SAME IDENTIFIER IS DECLARED IN THE
-- OUTER PACKAGE (SPECIFICATION OR BODY) OR IN THE
-- ENVIRONMENT SURROUNDING THE OUTER PACKAGE BODY.
-- INTERACTIONS WITH SEPARATE COMPILATION ARE TESTED IN C83F01C ,
-- C83F01D .
-- RM 08 AUGUST 1980
-- JRK 13 NOV 1980
WITH REPORT;
PROCEDURE C83F01B IS
USE REPORT;
X1 , X2 : INTEGER RANGE 1..23 := 17 ;
TYPE T1 IS ( A , B , C) ;
Z : T1 := A ;
BEGIN
TEST( "C83F01B" , "CHECK THAT INSIDE A NESTED PACKAGE BODY" &
" AN ATTEMPT TO REFERENCE AN IDENTIFIER" &
" DECLARED IN THE CORRESPONDING PACKAGE SPECI" &
"FICATION IS SUCCESSFUL EVEN IF THE SAME IDEN" &
"TIFIER IS DECLARED IN THE ENVIRONMENT SURROUND"&
"ING THE PACKAGE BODY" ) ;
COMMENT("SEPARATELY COMPILED PACKAGES ARE TESTED IN C83F01C, -D");
DECLARE
Y1 , Y2 : INTEGER := 100 ;
PACKAGE OUTER IS
Y3 : INTEGER := 100 ;
PACKAGE P IS
X1 : BOOLEAN := FALSE ;
X2 : INTEGER RANGE 1..23 := 11 ;
Y1 , Y3 : BOOLEAN := TRUE ;
Y2 , Y4 : INTEGER := 5 ;
T1 : INTEGER := 6 ;
Z : INTEGER := 7 ;
END P ;
END OUTER ;
X2 : INTEGER := 100 ;
PACKAGE BODY OUTER IS
Y4 : INTEGER := 200 ;
PACKAGE BODY P IS
BEGIN
X1 := NOT X1 AND Y1 AND Y3 ;
Z := Z + T1 ;
Y2 := X2 * Y2 ;
Y4 := X2 * Y4 ;
-- INCORRECT INTERPRETATIONS IN THE FIRST TWO
-- ASSIGNMENTS MANIFEST THEMSELVES AT
-- COMPILE TIME AS TYPE ERRORS
END P ;
END OUTER ;
BEGIN
IF X1 /= 17 OR
Z /= A OR
Y2 /= 100 OR
NOT OUTER.P.X1 OR
OUTER.P.Z /= 13 OR
OUTER.P.Y2 /= 55 OR
OUTER.P.Y4 /= 55
THEN FAILED( "INCORRECT ACCESSING" );
END IF;
END ;
RESULT; -- POSSIBLE ERROR DURING ELABORATION OF P
END C83F01B;
| 29.292308 | 79 | 0.535977 |
58ae87583b93780881d2dc8f9ea1c837e66db7ef | 62 | ads | Ada | adm/code/src/metric.ads | leo-brewin/adm-bssn-numerical | 9e32c201272e9a41e7535475fe381e450b99b058 | [
"MIT"
] | 1 | 2022-01-25T11:36:06.000Z | 2022-01-25T11:36:06.000Z | adm/code/src/metric.ads | leo-brewin/adm-bssn-numerical | 9e32c201272e9a41e7535475fe381e450b99b058 | [
"MIT"
] | null | null | null | adm/code/src/metric.ads | leo-brewin/adm-bssn-numerical | 9e32c201272e9a41e7535475fe381e450b99b058 | [
"MIT"
] | null | null | null | package Metric is
-- empty body, do not delete
end Metric;
| 15.5 | 31 | 0.709677 |
3d4db258cb6c2e7007ffca2915ad00eebdcce03b | 1,362 | ads | Ada | wayland_client_ada/src/wayland-protocols.ads | onox/wayland-ada | 9317b87482af03a650e02543a3cb46f20bb747d0 | [
"Apache-2.0"
] | 5 | 2021-01-11T01:32:16.000Z | 2022-02-03T00:08:11.000Z | wayland_client_ada/src/wayland-protocols.ads | onox/wayland-ada | 9317b87482af03a650e02543a3cb46f20bb747d0 | [
"Apache-2.0"
] | 11 | 2021-01-11T20:12:20.000Z | 2022-02-04T09:47:13.000Z | wayland_client_ada/src/wayland-protocols.ads | onox/wayland-ada | 9317b87482af03a650e02543a3cb46f20bb747d0 | [
"Apache-2.0"
] | null | null | null | -- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2018 - 2019 Joakim Strandberg <[email protected]>
-- Copyright (c) 2020 onox <[email protected]>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
private with Interfaces.C.Strings;
private with Wayland.API;
package Wayland.Protocols is
pragma Preelaborate;
type Interface_Type is tagged limited private;
function Name (Object : Interface_Type) return String;
type Secret_Proxy is limited private;
private
type Secret_Proxy is new Wayland.API.Proxy_Ptr;
type Interface_Type is tagged limited record
My_Interface : Wayland.API.Interface_Ptr;
end record;
function Name (Object : Interface_Type) return String is
(Interfaces.C.Strings.Value (Interfaces.C.Strings.To_Chars_Ptr
(Object.My_Interface.Name)));
end Wayland.Protocols;
| 30.954545 | 76 | 0.740822 |
3d6f5cdf17c2d31e255c528b55da2193ea61b152 | 1,239 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/a-siztio.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/ada/a-siztio.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/a-siztio.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . S H O R T _ I N T E G E R _ W I D E _ W I D E _ T E X T _ I O --
-- --
-- S p e c --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. In accordance with the copyright of that document, you can freely --
-- copy and modify this specification, provided that if you redistribute a --
-- modified version, any changes that you have made are clearly indicated. --
-- --
------------------------------------------------------------------------------
with Ada.Wide_Wide_Text_IO;
package Ada.Short_Integer_Wide_Wide_Text_IO is
new Ada.Wide_Wide_Text_IO.Integer_IO (Short_Integer);
| 61.95 | 78 | 0.330912 |
291b2f04d93dc043c981eec9e6fc4226e95744e9 | 4,126 | ads | Ada | tools-src/gnu/gcc/gcc/ada/a-wtenio.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/a-wtenio.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/a-wtenio.ads | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . W I D E _ T E X T _ I O . E N U M E R A T I O N _ I O --
-- --
-- S p e c --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-2000 Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 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. --
-- --
------------------------------------------------------------------------------
-- In Ada 95, the package Ada.Wide_Text_IO.Enumeration_IO is a subpackage
-- of Wide_Text_IO. In GNAT we make it a child package to avoid loading the
-- necessary code if Enumeration_IO is not instantiated. See the routine
-- Rtsfind.Text_IO_Kludge for a description of how we patch up the difference
-- in semantics so that it is invisible to the Ada programmer.
private generic
type Enum is (<>);
package Ada.Wide_Text_IO.Enumeration_IO is
Default_Width : Field := 0;
Default_Setting : Type_Set := Upper_Case;
procedure Get (File : in File_Type; Item : out Enum);
procedure Get (Item : out Enum);
procedure Put
(File : in File_Type;
Item : in Enum;
Width : in Field := Default_Width;
Set : in Type_Set := Default_Setting);
procedure Put
(Item : in Enum;
Width : in Field := Default_Width;
Set : in Type_Set := Default_Setting);
procedure Get
(From : in Wide_String;
Item : out Enum;
Last : out Positive);
procedure Put
(To : out Wide_String;
Item : in Enum;
Set : in Type_Set := Default_Setting);
end Ada.Wide_Text_IO.Enumeration_IO;
| 52.227848 | 78 | 0.487155 |
df7b0d1fe5eb5e248dd9805ea685c957aea8dcc4 | 3,248 | ads | Ada | Ada95/src/terminal_interface-curses-putwin.ads | neverware-mirrors/ncurses | 931939e0d2765af13962820e59cb6629df3ee638 | [
"X11"
] | 269 | 2015-03-01T21:34:42.000Z | 2022-03-30T23:07:18.000Z | Ada95/src/terminal_interface-curses-putwin.ads | neverware-mirrors/ncurses | 931939e0d2765af13962820e59cb6629df3ee638 | [
"X11"
] | 3 | 2020-10-09T15:00:37.000Z | 2020-10-09T15:05:19.000Z | Ada95/src/terminal_interface-curses-putwin.ads | neverware-mirrors/ncurses | 931939e0d2765af13962820e59cb6629df3ee638 | [
"X11"
] | 97 | 2016-04-25T06:22:54.000Z | 2022-03-30T23:07:19.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT ncurses Binding --
-- --
-- Terminal_Interface.Curses.PutWin --
-- --
-- S P E C --
-- --
------------------------------------------------------------------------------
-- Copyright 2020 Thomas E. Dickey --
-- Copyright 2000-2002,2003 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: Juergen Pfeifer, 1996
-- Version Control:
-- $Revision: 1.5 $
-- Binding Version 01.00
with Ada.Streams.Stream_IO;
package Terminal_Interface.Curses.PutWin is
procedure Put_Window (Win : Window;
File : Ada.Streams.Stream_IO.File_Type);
function Get_Window (File : Ada.Streams.Stream_IO.File_Type) return Window;
end Terminal_Interface.Curses.PutWin;
| 62.461538 | 79 | 0.442426 |
291c4e5234debadc1de7e6370aed75cf21550e31 | 6,299 | adb | Ada | source/actions.adb | jquorning/CELLE | 0584a22bd48464c2727751fca9dbca079e217b0c | [
"blessing"
] | null | null | null | source/actions.adb | jquorning/CELLE | 0584a22bd48464c2727751fca9dbca079e217b0c | [
"blessing"
] | null | null | null | source/actions.adb | jquorning/CELLE | 0584a22bd48464c2727751fca9dbca079e217b0c | [
"blessing"
] | null | null | null | --
-- The author disclaims copyright to this source code. In place of
-- a legal notice, here is a blessing:
--
-- May you do good and not evil.
-- May you find forgiveness for yourself and forgive others.
-- May you share freely, not taking more than you give.
--
---------------------------------------------------------------------------
--
-- This module implements routines use to construct the yy_action[] table.
--
-- The state of the yy_action table under construction is an instance of
-- the following structure.
--
-- The yy_action table maps the pair (state_number, lookahead) into an
-- action_number. The table is an array of integers pairs. The state_number
-- determines an initial offset into the yy_action array. The lookahead
-- value is then added to this initial offset to get an index X into the
-- yy_action array. If the aAction[X].lookahead equals the value of the
-- of the lookahead input, then the value of the action_number output is
-- aAction[X].action. If the lookaheads do not match then the
-- default action for the state_number is returned.
--
-- All actions associated with a single state_number are first entered
-- into aLookahead[] using multiple calls to acttab_action(). Then the
-- actions for that single state_number are placed into the aAction[]
-- array with a single call to acttab_insert(). The acttab_insert() call
-- also resets the aLookahead[] array in preparation for the next
-- state number.
--
with Ada.Containers.Doubly_Linked_Lists;
with Types;
package body Actions is
package Action_Lists is
new Ada.Containers.Doubly_Linked_Lists (Element_Type => Action_Record);
function Action_Cmp (Left, Right : in Action_Record)
return Boolean
is
use type Rules.Index_Number;
use type Types.Symbol_Index;
RC1 : Types.Symbol_Index;
RC : Rules.Index_Number;
begin
RC1 := Left.Symbol.Index - Right.Symbol.Index;
if RC1 = 0 then
RC := Action_Kind'Pos (Left.Kind) - Action_Kind'Pos (Right.Kind);
end if;
if
RC = 0 and
(Left.Kind = Reduce or Left.Kind = Shift_Reduce)
then
RC := Left.X.Rule.Index - Right.X.Rule.Index;
end if;
if RC = 0 then
RC := 0;
-- RC := (int) (ap2 - ap1); -- XXX Pointer
raise Program_Error;
end if;
return RC /= 0;
end Action_Cmp;
-- Free_List : Action_Access := null;
--
-- function Action_New return Action_Access is
-- New_Action : Action_Access;
-- begin
-- if Free_List = null then
-- declare
-- I : Integer;
-- amt : Integer := 100;
-- begin
-- freelist = (struct action *)calloc(amt, sizeof(struct action));
-- if( freelist==0 ){
-- fprintf(stderr,"Unable to allocate memory for a new parser action.");
-- exit(1);
-- }
-- for(i=0; i<amt-1; i++) freelist[i].next = &freelist[i+1];
-- freelist[amt-1].next = 0;
-- end;
-- end if;
-- New_Action := Free_List;
-- Free_List := Free_List.Next;
-- return New_Action;
-- end Action_New;
function Resolve_Conflict (Left : in out Action_Record;
Right : in out Action_Record) return Integer
is
use Symbols;
-- Apx : Action_Access renames Left;
-- Apy : Action_Access renames Right;
Apx : Action_Record renames Left;
Apy : Action_Record renames Right;
Spx : Symbol_Access;
Spy : Symbol_Access;
Error_Count : Natural := 0;
begin
pragma Assert (Apx.Symbol = Apy.Symbol); -- Otherwise there would be no conflict
if Apx.Kind = Shift and Apy.Kind = Shift then
Apy.Kind := SS_Conflict;
Error_Count := Error_Count + 1;
end if;
if Apx.Kind = Shift and Apy.Kind = Reduce then
Spx := Symbol_Access (Apx.Symbol);
Spy := Symbol_Access (Apy.X.Rule.Prec_Symbol);
if Spy = null or Spx.Precedence < 0 or Spy.Precedence < 0 then
-- Not enough precedence information
Apy.Kind := SR_Conflict;
Error_Count := Error_Count + 1;
elsif Spx.Precedence > Spy.Precedence then -- higher precedence wins
Apy.Kind := RD_Resolved;
elsif Spx.Precedence < Spy.Precedence then
Apx.Kind := SH_Resolved;
elsif
Spx.Precedence = Spy.Precedence and
Spx.Association = Right_Association
then -- Use operator
Apy.Kind := RD_Resolved; -- associativity
elsif
Spx.Precedence = Spy.Precedence and
Spx.Association = Left_Association
then -- to break tie
Apx.Kind := SH_Resolved;
else
pragma Assert (Spx.Precedence = Spy.Precedence and
Spx.Association = No_Association);
Apx.Kind := Error;
end if;
elsif Apx.Kind = Reduce and Apy.Kind = Reduce then
Spx := Symbol_Access (Apx.X.Rule.Prec_Symbol);
Spy := Symbol_Access (Apy.X.Rule.Prec_Symbol);
if
Spx = null or Spy = null or Spx.Precedence < 0 or
Spy.Precedence < 0 or Spx.Precedence = Spy.Precedence
then
Apy.Kind := RR_Conflict;
Error_Count := Error_Count + 1;
elsif Spx.Precedence > Spy.Precedence then
Apy.Kind := RD_Resolved;
elsif Spx.Precedence < Spy.Precedence then
Apx.Kind := RD_Resolved;
end if;
else
null;
pragma Assert
(Apx.Kind = SH_Resolved or
Apx.Kind = RD_Resolved or
Apx.Kind = SS_Conflict or
Apx.Kind = SR_Conflict or
Apx.Kind = RR_Conflict or
Apy.Kind = SH_Resolved or
Apy.Kind = RD_Resolved or
Apy.Kind = SS_Conflict or
Apy.Kind = SR_Conflict or
Apy.Kind = RR_Conflict);
-- The REDUCE/SHIFT case cannot happen because SHIFTs come before
-- REDUCEs on the list. If we reach this point it must be because
-- the parser conflict had already been resolved.
end if;
return Error_Count;
end Resolve_Conflict;
end Actions;
| 34.420765 | 88 | 0.59819 |
3d94cf5f4f2d522ec9eb6dc0f0636102047fdcc5 | 13,598 | ads | Ada | vs/zlib/contrib/ada/zlib.ads | mediaexplorer74/dosbox-x | be9f94b740234f7813bf5a063a558cef9dc7f9a6 | [
"MIT"
] | 3 | 2022-02-20T11:06:29.000Z | 2022-03-11T08:16:55.000Z | vs/zlib/contrib/ada/zlib.ads | mediaexplorer74/dosbox-x | be9f94b740234f7813bf5a063a558cef9dc7f9a6 | [
"MIT"
] | null | null | null | vs/zlib/contrib/ada/zlib.ads | mediaexplorer74/dosbox-x | be9f94b740234f7813bf5a063a558cef9dc7f9a6 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- ZLib for Ada thick binding. --
-- --
-- Copyright (C) 2002-2004 Dmitriy Anisimkov --
-- --
-- This library is free software; you can redistribute it and/or modify --
-- it under the terms of the GNU General Public License as published by --
-- the Free Software Foundation; either version 2 of the License, or (at --
-- your option) any later version. --
-- --
-- This library is distributed in the hope that it will be useful, but --
-- WITHOUT ANY WARRANTY; without even the implied warranty of --
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU --
-- General Public License for more details. --
-- --
-- You should have received a copy of the GNU General Public License --
-- along with this library; if not, write to the Free Software Foundation, --
-- Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1335, 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. --
------------------------------------------------------------------------------
-- $Id: zlib.ads,v 1.26 2004/09/06 06:53:19 vagul Exp $
with Ada.Streams;
with Interfaces;
package ZLib is
ZLib_Error : exception;
Status_Error : exception;
type Compression_Level is new Integer range -1 .. 9;
type Flush_Mode is private;
type Compression_Method is private;
type Window_Bits_Type is new Integer range 8 .. 15;
type Memory_Level_Type is new Integer range 1 .. 9;
type Unsigned_32 is new Interfaces.Unsigned_32;
type Strategy_Type is private;
type Header_Type is (None, Auto, Default, GZip);
-- Header type usage have a some limitation for inflate.
-- See comment for Inflate_Init.
subtype Count is Ada.Streams.Stream_Element_Count;
Default_Memory_Level : constant Memory_Level_Type := 8;
Default_Window_Bits : constant Window_Bits_Type := 15;
----------------------------------
-- Compression method constants --
----------------------------------
Deflated : constant Compression_Method;
-- Only one method allowed in this ZLib version
---------------------------------
-- Compression level constants --
---------------------------------
No_Compression : constant Compression_Level := 0;
Best_Speed : constant Compression_Level := 1;
Best_Compression : constant Compression_Level := 9;
Default_Compression : constant Compression_Level := -1;
--------------------------
-- Flush mode constants --
--------------------------
No_Flush : constant Flush_Mode;
-- Regular way for compression, no flush
Partial_Flush : constant Flush_Mode;
-- Will be removed, use Z_SYNC_FLUSH instead
Sync_Flush : constant Flush_Mode;
-- All pending output is flushed to the output buffer and the output
-- is aligned on a byte boundary, so that the decompressor can get all
-- input data available so far. (In particular avail_in is zero after the
-- call if enough output space has been provided before the call.)
-- Flushing may degrade compression for some compression algorithms and so
-- it should be used only when necessary.
Block_Flush : constant Flush_Mode;
-- Z_BLOCK requests that inflate() stop
-- if and when it get to the next deflate block boundary. When decoding the
-- zlib or gzip format, this will cause inflate() to return immediately
-- after the header and before the first block. When doing a raw inflate,
-- inflate() will go ahead and process the first block, and will return
-- when it gets to the end of that block, or when it runs out of data.
Full_Flush : constant Flush_Mode;
-- All output is flushed as with SYNC_FLUSH, and the compression state
-- is reset so that decompression can restart from this point if previous
-- compressed data has been damaged or if random access is desired. Using
-- Full_Flush too often can seriously degrade the compression.
Finish : constant Flush_Mode;
-- Just for tell the compressor that input data is complete.
------------------------------------
-- Compression strategy constants --
------------------------------------
-- RLE stategy could be used only in version 1.2.0 and later.
Filtered : constant Strategy_Type;
Huffman_Only : constant Strategy_Type;
RLE : constant Strategy_Type;
Default_Strategy : constant Strategy_Type;
Default_Buffer_Size : constant := 4096;
type Filter_Type is tagged limited private;
-- The filter is for compression and for decompression.
-- The usage of the type is depend of its initialization.
function Version return String;
pragma Inline (Version);
-- Return string representation of the ZLib version.
procedure Deflate_Init
(Filter : in out Filter_Type;
Level : in Compression_Level := Default_Compression;
Strategy : in Strategy_Type := Default_Strategy;
Method : in Compression_Method := Deflated;
Window_Bits : in Window_Bits_Type := Default_Window_Bits;
Memory_Level : in Memory_Level_Type := Default_Memory_Level;
Header : in Header_Type := Default);
-- Compressor initialization.
-- When Header parameter is Auto or Default, then default zlib header
-- would be provided for compressed data.
-- When Header is GZip, then gzip header would be set instead of
-- default header.
-- When Header is None, no header would be set for compressed data.
procedure Inflate_Init
(Filter : in out Filter_Type;
Window_Bits : in Window_Bits_Type := Default_Window_Bits;
Header : in Header_Type := Default);
-- Decompressor initialization.
-- Default header type mean that ZLib default header is expecting in the
-- input compressed stream.
-- Header type None mean that no header is expecting in the input stream.
-- GZip header type mean that GZip header is expecting in the
-- input compressed stream.
-- Auto header type mean that header type (GZip or Native) would be
-- detected automatically in the input stream.
-- Note that header types parameter values None, GZip and Auto are
-- supported for inflate routine only in ZLib versions 1.2.0.2 and later.
-- Deflate_Init is supporting all header types.
function Is_Open (Filter : in Filter_Type) return Boolean;
pragma Inline (Is_Open);
-- Is the filter opened for compression or decompression.
procedure Close
(Filter : in out Filter_Type;
Ignore_Error : in Boolean := False);
-- Closing the compression or decompressor.
-- If stream is closing before the complete and Ignore_Error is False,
-- The exception would be raised.
generic
with procedure Data_In
(Item : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset);
with procedure Data_Out
(Item : in Ada.Streams.Stream_Element_Array);
procedure Generic_Translate
(Filter : in out Filter_Type;
In_Buffer_Size : in Integer := Default_Buffer_Size;
Out_Buffer_Size : in Integer := Default_Buffer_Size);
-- Compress/decompress data fetch from Data_In routine and pass the result
-- to the Data_Out routine. User should provide Data_In and Data_Out
-- for compression/decompression data flow.
-- Compression or decompression depend on Filter initialization.
function Total_In (Filter : in Filter_Type) return Count;
pragma Inline (Total_In);
-- Returns total number of input bytes read so far
function Total_Out (Filter : in Filter_Type) return Count;
pragma Inline (Total_Out);
-- Returns total number of bytes output so far
function CRC32
(CRC : in Unsigned_32;
Data : in Ada.Streams.Stream_Element_Array)
return Unsigned_32;
pragma Inline (CRC32);
-- Compute CRC32, it could be necessary for make gzip format
procedure CRC32
(CRC : in out Unsigned_32;
Data : in Ada.Streams.Stream_Element_Array);
pragma Inline (CRC32);
-- Compute CRC32, it could be necessary for make gzip format
-------------------------------------------------
-- Below is more complex low level routines. --
-------------------------------------------------
procedure Translate
(Filter : in out Filter_Type;
In_Data : in Ada.Streams.Stream_Element_Array;
In_Last : out Ada.Streams.Stream_Element_Offset;
Out_Data : out Ada.Streams.Stream_Element_Array;
Out_Last : out Ada.Streams.Stream_Element_Offset;
Flush : in Flush_Mode);
-- Compress/decompress the In_Data buffer and place the result into
-- Out_Data. In_Last is the index of last element from In_Data accepted by
-- the Filter. Out_Last is the last element of the received data from
-- Filter. To tell the filter that incoming data are complete put the
-- Flush parameter to Finish.
function Stream_End (Filter : in Filter_Type) return Boolean;
pragma Inline (Stream_End);
-- Return the true when the stream is complete.
procedure Flush
(Filter : in out Filter_Type;
Out_Data : out Ada.Streams.Stream_Element_Array;
Out_Last : out Ada.Streams.Stream_Element_Offset;
Flush : in Flush_Mode);
pragma Inline (Flush);
-- Flushing the data from the compressor.
generic
with procedure Write
(Item : in Ada.Streams.Stream_Element_Array);
-- User should provide this routine for accept
-- compressed/decompressed data.
Buffer_Size : in Ada.Streams.Stream_Element_Offset
:= Default_Buffer_Size;
-- Buffer size for Write user routine.
procedure Write
(Filter : in out Filter_Type;
Item : in Ada.Streams.Stream_Element_Array;
Flush : in Flush_Mode := No_Flush);
-- Compress/Decompress data from Item to the generic parameter procedure
-- Write. Output buffer size could be set in Buffer_Size generic parameter.
generic
with procedure Read
(Item : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset);
-- User should provide data for compression/decompression
-- thru this routine.
Buffer : in out Ada.Streams.Stream_Element_Array;
-- Buffer for keep remaining data from the previous
-- back read.
Rest_First, Rest_Last : in out Ada.Streams.Stream_Element_Offset;
-- Rest_First have to be initialized to Buffer'Last + 1
-- Rest_Last have to be initialized to Buffer'Last
-- before usage.
Allow_Read_Some : in Boolean := False;
-- Is it allowed to return Last < Item'Last before end of data.
procedure Read
(Filter : in out Filter_Type;
Item : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset;
Flush : in Flush_Mode := No_Flush);
-- Compress/Decompress data from generic parameter procedure Read to the
-- Item. User should provide Buffer and initialized Rest_First, Rest_Last
-- indicators. If Allow_Read_Some is True, Read routines could return
-- Last < Item'Last only at end of stream.
private
use Ada.Streams;
pragma Assert (Ada.Streams.Stream_Element'Size = 8);
pragma Assert (Ada.Streams.Stream_Element'Modulus = 2**8);
type Flush_Mode is new Integer range 0 .. 5;
type Compression_Method is new Integer range 8 .. 8;
type Strategy_Type is new Integer range 0 .. 3;
No_Flush : constant Flush_Mode := 0;
Partial_Flush : constant Flush_Mode := 1;
Sync_Flush : constant Flush_Mode := 2;
Full_Flush : constant Flush_Mode := 3;
Finish : constant Flush_Mode := 4;
Block_Flush : constant Flush_Mode := 5;
Filtered : constant Strategy_Type := 1;
Huffman_Only : constant Strategy_Type := 2;
RLE : constant Strategy_Type := 3;
Default_Strategy : constant Strategy_Type := 0;
Deflated : constant Compression_Method := 8;
type Z_Stream;
type Z_Stream_Access is access all Z_Stream;
type Filter_Type is tagged limited record
Strm : Z_Stream_Access;
Compression : Boolean;
Stream_End : Boolean;
Header : Header_Type;
CRC : Unsigned_32;
Offset : Stream_Element_Offset;
-- Offset for gzip header/footer output.
end record;
end ZLib;
| 41.331307 | 82 | 0.629725 |
5747a2458a35d7a0519bcef41ea32e981f014aab | 1,360 | adb | Ada | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/out_of_line_in_inlined/foo_o224_021.adb | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | 3 | 2021-05-04T17:09:06.000Z | 2021-10-04T07:19:26.000Z | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/out_of_line_in_inlined/foo_o224_021.adb | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | null | null | null | contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/out_of_line_in_inlined/foo_o224_021.adb | TheSledgeHammer/2.11BSD | fe61f0b9aaa273783cd027c7b5ec77e95ead2153 | [
"BSD-3-Clause"
] | null | null | null | -- Copyright 2015-2020 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with Bar; use Bar;
procedure Foo_O224_021 is
O1 : constant Object_Type := Get_Str ("Foo");
procedure Child1 is
O2 : constant Object_Type := Get_Str ("Foo");
function Child2 (S : String) return Boolean is -- STOP
begin
for C of S loop
Do_Nothing (C);
if C = 'o' then
return True;
end if;
end loop;
return False;
end Child2;
R : Boolean;
begin
R := Child2 ("Foo");
R := Child2 ("Bar");
R := Child2 ("Foobar");
end Child1;
begin
Child1;
end Foo_O224_021;
| 30.222222 | 73 | 0.618382 |
5916c3a463b04a06264722a39dc15584b0473655 | 800 | ads | Ada | src/utilities/point.ads | SKNZ/BoiteMaker | 882542c7c2b6087a200165f950bd685dcf7ff836 | [
"BSD-3-Clause"
] | null | null | null | src/utilities/point.ads | SKNZ/BoiteMaker | 882542c7c2b6087a200165f950bd685dcf7ff836 | [
"BSD-3-Clause"
] | null | null | null | src/utilities/point.ads | SKNZ/BoiteMaker | 882542c7c2b6087a200165f950bd685dcf7ff836 | [
"BSD-3-Clause"
] | null | null | null | package point is
-- exception en cas de coordonnées invalides
invalid_pos : exception;
type point_t is
record
x, y : float := 0.0;
end record;
-- Bouge le point sur l'axe x
procedure mv_x(point : in out point_t; delta_x : float);
-- Bouge le point sur l'axe y
procedure mv_y(point : in out point_t; delta_y : float);
-- Pointeur de fonction vers une fonction de mv_*
type mv_point_ptr is access procedure (point : in out point_t; delta_axis : float);
-- Constantes pour les pointeurs de fonctions
mv_x_ptr : constant mv_point_ptr := mv_x'access;
mv_y_ptr : constant mv_point_ptr := mv_y'access;
-- Représentation en texte du point
function to_string(point : point_t) return string;
private
end point;
| 28.571429 | 87 | 0.66375 |
59564ce98a54b78aa2623db5266dd085d2127c76 | 3,972 | ads | Ada | src/frontend/Experimental_Ada_ROSE_Connection/dot_asis/dot_asis_library/source/asis_tool_2-element.ads | sourceryinstitute/rose | 9024ff6fcc3889efd8d0948c07992dfdc7e4743a | [
"BSD-3-Clause"
] | null | null | null | src/frontend/Experimental_Ada_ROSE_Connection/dot_asis/dot_asis_library/source/asis_tool_2-element.ads | sourceryinstitute/rose | 9024ff6fcc3889efd8d0948c07992dfdc7e4743a | [
"BSD-3-Clause"
] | 5 | 2019-10-04T16:40:33.000Z | 2020-01-07T15:03:59.000Z | src/frontend/Experimental_Ada_ROSE_Connection/dot_asis/dot_asis_library/source/asis_tool_2-element.ads | sourceryinstitute/rose | 9024ff6fcc3889efd8d0948c07992dfdc7e4743a | [
"BSD-3-Clause"
] | null | null | null | with Asis;
-- GNAT-specific:
with A4G.Int_Knds;
with Types;
with a_nodes_h;
with Dot;
private with Ada.Containers.Doubly_Linked_Lists;
package Asis_Tool_2.Element is
type Class is tagged private; -- Initialized
-- Process an element and all of its components:
procedure Process_Element_Tree
(This : in out Class;
Element : in Asis.Element;
Outputs : in Outputs_Record);
-----------------------------------------------------------------------------
-- This encapsulates the identity of an Element, since sometimes a
-- Node_ID gets reused!
--
type Element_ID is record
Node_ID : Types.Node_ID := Types.Error;
Kind : A4G.Int_Knds.Internal_Element_Kinds :=
A4G.Int_Knds.Not_An_Element;
end record;
-- To get an a_nodes_h.Element_ID:
-- Asis.Element -> Get_Element_ID -> To_Element_ID -> a_nodes_h.Element_ID
-- or
-- Asis.Element -> Get_Element_ID -> a_nodes_h.Element_ID
--
-- To get a string for DOT or text output:
-- a_nodes_h.Element_ID -> To_String -> String (e.g. Element_12001)
--
function Get_Element_ID
(Element : in Asis.Element)
return Element_ID;
-- Turns Node_ID and Kind into one number. Currently (GNAT GPL 2017 ASIS)
-- there are about 800 values in A4G.Int_Knds.Internal_Element_Kinds, so
-- we multiply Node_ID by 1000 and add Kind. Assuming a 32-bit int for
-- a_nodes_h.Element_ID, this means we cannot process Elements with a Node_ID
-- over 1,000,000.
--
-- TODO: Move to anhS
function To_Element_ID
(This : in Element_ID)
return a_nodes_h.Element_ID;
function Get_Element_ID
(Element : in Asis.Element)
return a_nodes_h.Element_ID;
function To_String
(This : in a_nodes_h.Element_ID)
return String;
-- END Element_ID support
-----------------------------------------------------------------------------
-- Add an array of Element IDs to Dot_Label and maybe Dot_Edge, and return
-- an Element_ID_List:
-- LEAKS:
function To_Element_ID_List
(Dot_Label : in out Dot.HTML_Like_Labels.Class;
Outputs : in out Outputs_Record;
This_Element_ID : in a_nodes_h.Element_ID;
Elements_In : in Asis.Element_List;
Dot_Label_Name : in String;
Add_Edges : in Boolean := False;
This_Is_Unit : in Boolean := False)
return a_nodes_h.Element_ID_List;
private
package Element_ID_Lists is new
Ada.Containers.Doubly_Linked_Lists
(Element_Type => a_nodes_h.Element_ID,
"=" => IC."=");
-- Make type and operations directly visible:
type Element_ID_List is new Element_ID_Lists.List with null record;
-- Can't be limited because generic Asis.Iterator.Traverse_Element doesn't
-- want limited state information:
type Class is tagged -- Initialized
record
-- Current, in-progress intermediate output products. These need to be
-- turned into stacks if they are ever used in Post_Operation. Now
-- their usage ends at the end of Pre_Operation:
Dot_Node : Dot.Node_Stmt.Class; -- Initialized
Dot_Label : Dot.HTML_Like_Labels.Class; -- Initialized
A_Element : a_nodes_h.Element_Struct := anhS.Default_Element_Struct;
-- Used when making dot edges to child nodes. Treated s a stack:
Element_IDs : Element_ID_List;
-- Element_ID : a_nodes_h.Element_ID := anhS.Invalid_Element_ID;
-- I would like to just pass Outputs through and not store it in the
-- object, since it is all pointers and we doesn't need to store their
-- values between calls to Process_Element_Tree. Outputs has to go into
-- State_Information in the Traverse_Element instatiation, though, so
-- we'll put it in the object and pass that:
Outputs : Outputs_Record; -- Initialized
end record;
end Asis_Tool_2.Element;
| 36.440367 | 80 | 0.650302 |
3d558a8f2693a31a80a72efb4201e9148ab2b78e | 17,281 | ads | Ada | llvm-gcc-4.2-2.9/gcc/ada/g-debpoo.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-debpoo.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/g-debpoo.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T . D E B U G _ P O O L S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2005, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- 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 packages provides a special implementation of the Ada95 storage pools
-- The goal of this debug pool is to detect incorrect uses of memory
-- (multiple deallocations, access to invalid memory,...). Errors are reported
-- in one of two ways: either by immediately raising an exception, or by
-- printing a message on standard output.
-- You need to instrument your code to use this package: for each access type
-- you want to monitor, you need to add a clause similar to:
-- type Integer_Access is access Integer;
-- for Integer_Access'Storage_Pool use Pool;
-- where Pool is a tagged object declared with
--
-- Pool : GNAT.Debug_Pools.Debug_Pool;
-- This package was designed to be as efficient as possible, but still has an
-- impact on the performance of your code, which depends on the number of
-- allocations, deallocations and, somewhat less, dereferences that your
-- application performs.
-- For each faulty memory use, this debug pool will print several lines
-- of information, including things like the location where the memory
-- was initially allocated, the location where it was freed etc.
-- Physical allocations and deallocations are done through the usual system
-- calls. However, in order to provide proper checks, the debug pool will not
-- release the memory immediately. It keeps released memory around (the amount
-- kept around is configurable) so that it can distinguish between memory that
-- has not been allocated and memory that has been allocated but freed. This
-- also means that this memory cannot be reallocated, preventing what would
-- otherwise be a false indication that freed memory is now allocated.
-- In addition, this package presents several subprograms that help analyze
-- the behavior of your program, by reporting memory leaks, the total amount
-- of memory that was allocated. The pool is also designed to work correctly
-- in conjunction with gnatmem.
-- Finally, a subprogram Print_Pool is provided for use from the debugger
-- Limitations
-- ===========
-- Current limitation of this debug pool: if you use this debug pool for a
-- general access type ("access all"), the pool might report invalid
-- dereferences if the access object is pointing to another object on the
-- stack which was not allocated through a call to "new".
-- This debug pool will respect all alignments specified in your code, but
-- it does that by aligning all objects using Standard'Maximum_Alignment.
-- This allows faster checks, and limits the performance impact of using
-- this pool.
with System; use System;
with System.Storage_Elements; use System.Storage_Elements;
with System.Checked_Pools;
package GNAT.Debug_Pools is
type Debug_Pool is new System.Checked_Pools.Checked_Pool with private;
-- The new debug pool
subtype SSC is System.Storage_Elements.Storage_Count;
Default_Max_Freed : constant SSC := 50_000_000;
Default_Stack_Trace_Depth : constant Natural := 20;
Default_Reset_Content : constant Boolean := False;
Default_Raise_Exceptions : constant Boolean := True;
Default_Advanced_Scanning : constant Boolean := False;
Default_Min_Freed : constant SSC := 0;
-- The above values are constants used for the parameters to Configure
-- if not overridden in the call. See description of Configure for full
-- details on these parameters. If these defaults are not satisfactory,
-- then you need to call Configure to change the default values.
procedure Configure
(Pool : in out Debug_Pool;
Stack_Trace_Depth : Natural := Default_Stack_Trace_Depth;
Maximum_Logically_Freed_Memory : SSC := Default_Max_Freed;
Minimum_To_Free : SSC := Default_Min_Freed;
Reset_Content_On_Free : Boolean := Default_Reset_Content;
Raise_Exceptions : Boolean := Default_Raise_Exceptions;
Advanced_Scanning : Boolean := Default_Advanced_Scanning);
-- Subprogram used to configure the debug pool.
--
-- Stack_Trace_Depth. This parameter controls the maximum depth of stack
-- traces that are output to indicate locations of actions for error
-- conditions such as bad allocations. If set to zero, the debug pool
-- will not try to compute backtraces. This is more efficient but gives
-- less information on problem locations
--
-- Maximum_Logically_Freed_Memory: maximum amount of memory (bytes)
-- that should be kept before starting to physically deallocate some.
-- This value should be non-zero, since having memory that is logically
-- but not physically freed helps to detect invalid memory accesses.
--
-- Minimum_To_Free is the minimum amount of memory that should be freed
-- every time the pool starts physically releasing memory. The algorithm
-- to compute which block should be physically released needs some
-- expensive initialization (see Advanced_Scanning below), and this
-- parameter can be used to limit the performance impact by ensuring
-- that a reasonable amount of memory is freed each time. Even in the
-- advanced scanning mode, marked blocks may be released to match this
-- Minimum_To_Free parameter.
--
-- Reset_Content_On_Free: If true, then the contents of the freed memory
-- is reset to the pattern 16#DEADBEEF#, following an old IBM convention.
-- This helps in detecting invalid memory references from the debugger.
--
-- Raise_Exceptions: If true, the exceptions below will be raised every
-- time an error is detected. If you set this to False, then the action
-- is to generate output on standard error, noting the errors, but to
-- keep running if possible (of course if storage is badly damaged, this
-- attempt may fail. This helps to detect more than one error in a run.
--
-- Advanced_Scanning: If true, the pool will check the contents of all
-- allocated blocks before physically releasing memory. Any possible
-- reference to a logically free block will prevent its deallocation.
-- Note that this algorithm is approximate, and it is recommended
-- that you set Minimum_To_Free to a non-zero value to save time.
--
-- All instantiations of this pool use the same internal tables. However,
-- they do not store the same amount of information for the tracebacks,
-- and they have different counters for maximum logically freed memory.
Accessing_Not_Allocated_Storage : exception;
-- Exception raised if Raise_Exception is True, and an attempt is made
-- to access storage that was never allocated.
Accessing_Deallocated_Storage : exception;
-- Exception raised if Raise_Exception is True, and an attempt is made
-- to access storage that was allocated but has been deallocated.
Freeing_Not_Allocated_Storage : exception;
-- Exception raised if Raise_Exception is True, and an attempt is made
-- to free storage that had not been previously allocated.
Freeing_Deallocated_Storage : exception;
-- Exception raised if Raise_Exception is True, and an attempt is made
-- to free storage that had already been freed.
-- Note on the above exceptions. The distinction between not allocated
-- and deallocated storage is not guaranteed to be accurate in the case
-- where storage is allocated, and then physically freed. Larger values
-- of the parameter Maximum_Logically_Freed_Memory will help to guarantee
-- that this distinction is made more accurately.
generic
with procedure Put_Line (S : String) is <>;
with procedure Put (S : String) is <>;
procedure Print_Info
(Pool : Debug_Pool;
Cumulate : Boolean := False;
Display_Slots : Boolean := False;
Display_Leaks : Boolean := False);
-- Print out information about the High Water Mark, the current and
-- total number of bytes allocated and the total number of bytes
-- deallocated.
--
-- If Display_Slots is true, this subprogram prints a list of all the
-- locations in the application that have done at least one allocation or
-- deallocation. The result might be used to detect places in the program
-- where lots of allocations are taking place. This output is not in any
-- defined order.
--
-- If Cumulate if True, then each stack trace will display the number of
-- allocations that were done either directly, or by the subprograms called
-- at that location (e.g: if there were two physical allocations at a->b->c
-- and a->b->d, then a->b would be reported as performing two allocations).
--
-- If Display_Leaks is true, then each block that has not been deallocated
-- (often called a "memory leak") will be listed, along with the traceback
-- showing where it was allocated. Not that no grouping of the blocks is
-- done, you should use the Dump_Gnatmem procedure below in conjunction
-- with the gnatmem utility.
procedure Print_Info_Stdout
(Pool : Debug_Pool;
Cumulate : Boolean := False;
Display_Slots : Boolean := False;
Display_Leaks : Boolean := False);
-- Standard instantiation of Print_Info to print on standard_output. More
-- convenient to use where this is the intended location, and in particular
-- easier to use from the debugger.
procedure Dump_Gnatmem (Pool : Debug_Pool; File_Name : String);
-- Create an external file on the disk, which can be processed by gnatmem
-- to display the location of memory leaks.
--
-- This provides a nicer output that Print_Info above, and groups similar
-- stack traces together. This also provides an easy way to save the memory
-- status of your program for post-mortem analysis.
--
-- To use this file, use the following command line:
-- gnatmem 5 -i <File_Name> <Executable_Name>
-- If you want all the stack traces to be displayed with 5 levels.
procedure Print_Pool (A : System.Address);
pragma Export (C, Print_Pool, "print_pool");
-- This subprogram is meant to be used from a debugger. Given an address in
-- memory, it will print on standard output the known information about
-- this address (provided, of course, the matching pointer is handled by
-- the Debug_Pool).
--
-- The information includes the stacktrace for the allocation or
-- deallocation of that memory chunck, its current status (allocated or
-- logically freed), etc.
private
-- The following are the standard primitive subprograms for a pool
procedure Allocate
(Pool : in out Debug_Pool;
Storage_Address : out Address;
Size_In_Storage_Elements : Storage_Count;
Alignment : Storage_Count);
-- Allocate a new chunk of memory, and set it up so that the debug pool
-- can check accesses to its data, and report incorrect access later on.
-- The parameters have the same semantics as defined in the ARM95.
procedure Deallocate
(Pool : in out Debug_Pool;
Storage_Address : Address;
Size_In_Storage_Elements : Storage_Count;
Alignment : Storage_Count);
-- Mark a block of memory as invalid. It might not be physically removed
-- immediately, depending on the setup of the debug pool, so that checks
-- are still possible. The parameters have the same semantics as defined
-- in the RM.
function Storage_Size (Pool : Debug_Pool) return SSC;
-- Return the maximal size of data that can be allocated through Pool.
-- Since Pool uses the malloc() system call, all the memory is accessible
-- through the pool
procedure Dereference
(Pool : in out Debug_Pool;
Storage_Address : System.Address;
Size_In_Storage_Elements : Storage_Count;
Alignment : Storage_Count);
-- Check whether a derefence statement is valid, ie whether the pointer
-- was allocated through Pool. As documented above, errors will be
-- reported either by a special error message or an exception, depending
-- on the setup of the storage pool.
-- The parameters have the same semantics as defined in the ARM95.
type Byte_Count is mod System.Max_Binary_Modulus;
-- Type used for maintaining byte counts, needs to be large enough
-- to accomodate counts allowing for repeated use of the same memory.
type Debug_Pool is new System.Checked_Pools.Checked_Pool with record
Stack_Trace_Depth : Natural := Default_Stack_Trace_Depth;
Maximum_Logically_Freed_Memory : SSC := Default_Max_Freed;
Reset_Content_On_Free : Boolean := Default_Reset_Content;
Raise_Exceptions : Boolean := Default_Raise_Exceptions;
Minimum_To_Free : SSC := Default_Min_Freed;
Advanced_Scanning : Boolean := Default_Advanced_Scanning;
Allocated : Byte_Count := 0;
-- Total number of bytes allocated in this pool
Logically_Deallocated : Byte_Count := 0;
-- Total number of bytes logically deallocated in this pool. This is the
-- memory that the application has released, but that the pool has not
-- yet physically released through a call to free(), to detect later
-- accesed to deallocated memory.
Physically_Deallocated : Byte_Count := 0;
-- Total number of bytes that were free()-ed
Marked_Blocks_Deallocated : Boolean := False;
-- Set to true if some mark blocks had to be deallocated in the advanced
-- scanning scheme. Since this is potentially dangereous, this is
-- reported to the user, who might want to rerun his program with a
-- lower Minimum_To_Free value.
High_Water : Byte_Count := 0;
-- Maximum of Allocated - Logically_Deallocated - Physically_Deallocated
First_Free_Block : System.Address := System.Null_Address;
Last_Free_Block : System.Address := System.Null_Address;
-- Pointers to the first and last logically freed blocks
First_Used_Block : System.Address := System.Null_Address;
-- Pointer to the list of currently allocated blocks. This list is
-- used to list the memory leaks in the application on exit, as well as
-- for the advanced freeing algorithms that needs to traverse all these
-- blocks to find possible references to the block being physically
-- freed.
end record;
end GNAT.Debug_Pools;
| 53.009202 | 79 | 0.661594 |
41836e7be711770f2e82962c45fbb781153209ad | 127 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/opt48_pkg2.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/opt48_pkg2.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/opt48_pkg2.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | package body Opt48_Pkg2 is
function F return Rec is
begin
return (12, "Hello world!");
end F;
end Opt48_Pkg2;
| 14.111111 | 34 | 0.653543 |
5964a48a4d4a1ba012e0600eeaa68679da9365a8 | 4,418 | ads | Ada | src/fltk-menu_items.ads | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | 1 | 2020-12-18T15:20:13.000Z | 2020-12-18T15:20:13.000Z | src/fltk-menu_items.ads | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | null | null | null | src/fltk-menu_items.ads | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | null | null | null |
with
FLTK.Widgets;
package FLTK.Menu_Items is
type Menu_Item is new Wrapper with private;
type Menu_Item_Reference (Data : not null access Menu_Item'Class) is limited null record
with Implicit_Dereference => Data;
package Forge is
-- Usually you don't bother with this and just add items
-- to Menus directly using the Add subprograms in that package.
function Create
(Text : in String;
Action : in FLTK.Widgets.Widget_Callback := null;
Shortcut : in Key_Combo := No_Key;
Flags : in Menu_Flag := Flag_Normal)
return Menu_Item;
end Forge;
function Get_Callback
(Item : in Menu_Item)
return FLTK.Widgets.Widget_Callback;
procedure Set_Callback
(Item : in out Menu_Item;
Func : in FLTK.Widgets.Widget_Callback);
procedure Do_Callback
(Item : in out Menu_Item;
Widget : in out FLTK.Widgets.Widget'Class);
function Has_Checkbox
(Item : in Menu_Item)
return Boolean;
function Is_Radio
(Item : in Menu_Item)
return Boolean;
function Get_State
(Item : in Menu_Item)
return Boolean;
procedure Set_State
(Item : in out Menu_Item;
To : in Boolean);
procedure Set_Only
(Item : in out Menu_Item);
function Get_Label
(Item : in Menu_Item)
return String;
procedure Set_Label
(Item : in out Menu_Item;
Text : in String);
function Get_Label_Color
(Item : in Menu_Item)
return Color;
procedure Set_Label_Color
(Item : in out Menu_Item;
To : in Color);
function Get_Label_Font
(Item : in Menu_Item)
return Font_Kind;
procedure Set_Label_Font
(Item : in out Menu_Item;
To : in Font_Kind);
function Get_Label_Size
(Item : in Menu_Item)
return Font_Size;
procedure Set_Label_Size
(Item : in out Menu_Item;
To : in Font_Size);
function Get_Label_Type
(Item : in Menu_Item)
return Label_Kind;
procedure Set_Label_Type
(Item : in out Menu_Item;
To : in Label_Kind);
function Get_Shortcut
(Item : in Menu_Item)
return Key_Combo;
procedure Set_Shortcut
(Item : in out Menu_Item;
To : in Key_Combo);
function Get_Flags
(Item : in Menu_Item)
return Menu_Flag;
procedure Set_Flags
(Item : in out Menu_Item;
To : in Menu_Flag);
procedure Activate
(Item : in out Menu_Item);
procedure Deactivate
(Item : in out Menu_Item);
procedure Show
(Item : in out Menu_Item);
procedure Hide
(Item : in out Menu_Item);
function Is_Active
(Item : in Menu_Item)
return Boolean;
function Is_Visible
(Item : in Menu_Item)
return Boolean;
function Is_Active_And_Visible
(Item : in Menu_Item)
return Boolean;
private
type Menu_Item is new Wrapper with null record;
overriding procedure Finalize
(This : in out Menu_Item);
pragma Inline (Get_Callback);
pragma Inline (Set_Callback);
pragma Inline (Do_Callback);
pragma Inline (Has_Checkbox);
pragma Inline (Is_Radio);
pragma Inline (Get_State);
pragma Inline (Set_State);
pragma Inline (Set_Only);
pragma Inline (Get_Label);
pragma Inline (Set_Label);
pragma Inline (Get_Label_Color);
pragma Inline (Set_Label_Color);
pragma Inline (Get_Label_Font);
pragma Inline (Set_Label_Font);
pragma Inline (Get_Label_Size);
pragma Inline (Set_Label_Size);
pragma Inline (Get_Label_Type);
pragma Inline (Set_Label_Type);
pragma Inline (Get_Shortcut);
pragma Inline (Set_Shortcut);
pragma Inline (Get_Flags);
pragma Inline (Set_Flags);
pragma Inline (Activate);
pragma Inline (Deactivate);
pragma Inline (Show);
pragma Inline (Hide);
pragma Inline (Is_Active);
pragma Inline (Is_Visible);
pragma Inline (Is_Active_And_Visible);
end FLTK.Menu_Items;
| 20.938389 | 92 | 0.592576 |
5888f10ada6d59ff5785b1a5f63b8b74ea5fd881 | 9,660 | adb | Ada | source/amf/uml/amf-internals-tables-primitive_types_metamodel-objects.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-internals-tables-primitive_types_metamodel-objects.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-internals-tables-primitive_types_metamodel-objects.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Internals.Extents;
with AMF.Internals.Tables.CMOF_Constructors;
with AMF.Internals.Tables.CMOF_Element_Table;
with AMF.Internals.Tables.Primitive_Types_String_Data_00;
package body AMF.Internals.Tables.Primitive_Types_Metamodel.Objects is
----------------
-- Initialize --
----------------
procedure Initialize is
Extent : constant AMF.Internals.AMF_Extent
:= AMF.Internals.Extents.Allocate_Extent
(AMF.Internals.Tables.Primitive_Types_String_Data_00.MS_0001'Access);
begin
Base := AMF.Internals.Tables.CMOF_Element_Table.Last;
Initialize_1 (Extent);
Initialize_2 (Extent);
Initialize_3 (Extent);
Initialize_4 (Extent);
Initialize_5 (Extent);
Initialize_6 (Extent);
Initialize_7 (Extent);
Initialize_8 (Extent);
Initialize_9 (Extent);
Initialize_10 (Extent);
Initialize_11 (Extent);
Initialize_12 (Extent);
Initialize_13 (Extent);
Initialize_14 (Extent);
Initialize_15 (Extent);
end Initialize;
------------------
-- Initialize_1 --
------------------
procedure Initialize_1 (Extent : AMF.Internals.AMF_Extent) is
Aux : AMF.Internals.CMOF_Element;
begin
Aux := AMF.Internals.Tables.CMOF_Constructors.Create_CMOF_Package;
AMF.Internals.Extents.Internal_Append (Extent, Aux);
end Initialize_1;
------------------
-- Initialize_2 --
------------------
procedure Initialize_2 (Extent : AMF.Internals.AMF_Extent) is
Aux : AMF.Internals.CMOF_Element;
begin
Aux := AMF.Internals.Tables.CMOF_Constructors.Create_CMOF_Primitive_Type;
AMF.Internals.Extents.Internal_Append (Extent, Aux);
end Initialize_2;
------------------
-- Initialize_3 --
------------------
procedure Initialize_3 (Extent : AMF.Internals.AMF_Extent) is
Aux : AMF.Internals.CMOF_Element;
begin
Aux := AMF.Internals.Tables.CMOF_Constructors.Create_CMOF_Comment;
AMF.Internals.Extents.Internal_Append (Extent, Aux);
end Initialize_3;
------------------
-- Initialize_4 --
------------------
procedure Initialize_4 (Extent : AMF.Internals.AMF_Extent) is
Aux : AMF.Internals.CMOF_Element;
begin
Aux := AMF.Internals.Tables.CMOF_Constructors.Create_CMOF_Primitive_Type;
AMF.Internals.Extents.Internal_Append (Extent, Aux);
end Initialize_4;
------------------
-- Initialize_5 --
------------------
procedure Initialize_5 (Extent : AMF.Internals.AMF_Extent) is
Aux : AMF.Internals.CMOF_Element;
begin
Aux := AMF.Internals.Tables.CMOF_Constructors.Create_CMOF_Comment;
AMF.Internals.Extents.Internal_Append (Extent, Aux);
end Initialize_5;
------------------
-- Initialize_6 --
------------------
procedure Initialize_6 (Extent : AMF.Internals.AMF_Extent) is
Aux : AMF.Internals.CMOF_Element;
begin
Aux := AMF.Internals.Tables.CMOF_Constructors.Create_CMOF_Primitive_Type;
AMF.Internals.Extents.Internal_Append (Extent, Aux);
end Initialize_6;
------------------
-- Initialize_7 --
------------------
procedure Initialize_7 (Extent : AMF.Internals.AMF_Extent) is
Aux : AMF.Internals.CMOF_Element;
begin
Aux := AMF.Internals.Tables.CMOF_Constructors.Create_CMOF_Comment;
AMF.Internals.Extents.Internal_Append (Extent, Aux);
end Initialize_7;
------------------
-- Initialize_8 --
------------------
procedure Initialize_8 (Extent : AMF.Internals.AMF_Extent) is
Aux : AMF.Internals.CMOF_Element;
begin
Aux := AMF.Internals.Tables.CMOF_Constructors.Create_CMOF_Primitive_Type;
AMF.Internals.Extents.Internal_Append (Extent, Aux);
end Initialize_8;
------------------
-- Initialize_9 --
------------------
procedure Initialize_9 (Extent : AMF.Internals.AMF_Extent) is
Aux : AMF.Internals.CMOF_Element;
begin
Aux := AMF.Internals.Tables.CMOF_Constructors.Create_CMOF_Comment;
AMF.Internals.Extents.Internal_Append (Extent, Aux);
end Initialize_9;
-------------------
-- Initialize_10 --
-------------------
procedure Initialize_10 (Extent : AMF.Internals.AMF_Extent) is
Aux : AMF.Internals.CMOF_Element;
begin
Aux := AMF.Internals.Tables.CMOF_Constructors.Create_CMOF_Primitive_Type;
AMF.Internals.Extents.Internal_Append (Extent, Aux);
end Initialize_10;
-------------------
-- Initialize_11 --
-------------------
procedure Initialize_11 (Extent : AMF.Internals.AMF_Extent) is
Aux : AMF.Internals.CMOF_Element;
begin
Aux := AMF.Internals.Tables.CMOF_Constructors.Create_CMOF_Comment;
AMF.Internals.Extents.Internal_Append (Extent, Aux);
end Initialize_11;
-------------------
-- Initialize_12 --
-------------------
procedure Initialize_12 (Extent : AMF.Internals.AMF_Extent) is
Aux : AMF.Internals.CMOF_Element;
begin
Aux := AMF.Internals.Tables.CMOF_Constructors.Create_CMOF_Tag;
AMF.Internals.Extents.Internal_Append (Extent, Aux);
end Initialize_12;
-------------------
-- Initialize_13 --
-------------------
procedure Initialize_13 (Extent : AMF.Internals.AMF_Extent) is
Aux : AMF.Internals.CMOF_Element;
begin
Aux := AMF.Internals.Tables.CMOF_Constructors.Create_CMOF_Tag;
AMF.Internals.Extents.Internal_Append (Extent, Aux);
end Initialize_13;
-------------------
-- Initialize_14 --
-------------------
procedure Initialize_14 (Extent : AMF.Internals.AMF_Extent) is
Aux : AMF.Internals.CMOF_Element;
begin
Aux := AMF.Internals.Tables.CMOF_Constructors.Create_CMOF_Tag;
AMF.Internals.Extents.Internal_Append (Extent, Aux);
end Initialize_14;
-------------------
-- Initialize_15 --
-------------------
procedure Initialize_15 (Extent : AMF.Internals.AMF_Extent) is
Aux : AMF.Internals.CMOF_Element;
begin
Aux := AMF.Internals.Tables.CMOF_Constructors.Create_CMOF_Tag;
AMF.Internals.Extents.Internal_Append (Extent, Aux);
end Initialize_15;
end AMF.Internals.Tables.Primitive_Types_Metamodel.Objects;
| 36.870229 | 81 | 0.546687 |
57f019ab582fac9c2d9dfc7a31e2c6e31624b375 | 4,738 | ads | Ada | src/gl/interface/gl-attributes.ads | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | 79 | 2015-04-20T23:10:02.000Z | 2022-03-04T13:50:56.000Z | src/gl/interface/gl-attributes.ads | Roldak/OpenGLAda | 6807605b7321249d71286fa25231bdfd537d3eac | [
"MIT"
] | 126 | 2015-09-10T10:41:34.000Z | 2022-03-20T11:25:40.000Z | src/gl/interface/gl-attributes.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.Types;
package GL.Attributes is
pragma Preelaborate;
use GL.Types;
type Attribute is new UInt;
-- This function is deprecated for compatibility reasons. Use:
-- 1. Set_Vertex_Attrib_Pointer (other)
-- 2. Set_Vertex_Integer_Attrib_Pointer
-- 3. Set_Vertex_Double_Attrib_Pointer
-- Stride - count of components
-- Offset - count of components
procedure Set_Vertex_Attrib_Pointer (Index : Attribute;
Count : Component_Count;
Kind : Numeric_Type;
Stride, Offset : Size);
pragma Obsolescent
(Entity => Set_Vertex_Attrib_Pointer,
Message => "This subroutine is deprecated. Use the other" &
"Set_Vertex_Attrib_Pointer, Set_Vertex_Integer_Attrib_Pointer, or " &
"Set_Vertex_Double_Attrib_Pointer");
-- Stride - bytes count
-- Offset - bytes count
procedure Set_Vertex_Attrib_Pointer (Index : Attribute;
Count : Component_Count;
Kind : Numeric_Type;
Normalized : Boolean;
Stride, Offset : Size);
procedure Set_Vertex_Integer_Attrib_Pointer (Index : Attribute;
Count : Component_Count;
Kind : Numeric_Type;
Stride, Offset : Size);
procedure Set_Vertex_Double_Attrib_Pointer (Index : Attribute;
Count : Component_Count;
Kind : Numeric_Type;
Stride, Offset : Size);
procedure Enable_Vertex_Attrib_Array (Index : Attribute);
procedure Disable_Vertex_Attrib_Array (Index : Attribute);
procedure Vertex_Attrib_Divisor (Index : Attribute;
Divisor : UInt);
procedure Set_Short (Index : Attribute; Value : Short);
procedure Set_Short (Index : Attribute; V1, V2 : Short);
procedure Set_Short (Index : Attribute; Value : Shorts.Vector2);
procedure Set_Short (Index : Attribute; V1, V2, V3 : Short);
procedure Set_Short (Index : Attribute; Value : Shorts.Vector3);
procedure Set_Short (Index : Attribute; V1, V2, V3, V4 : Short);
procedure Set_Short (Index : Attribute; Value : Shorts.Vector4);
procedure Set_Single (Index : Attribute; Value : Single);
procedure Set_Single (Index : Attribute; V1, V2 : Single);
procedure Set_Single (Index : Attribute; Value : Singles.Vector2);
procedure Set_Single (Index : Attribute; V1, V2, V3 : Single);
procedure Set_Single (Index : Attribute; Value : Singles.Vector3);
procedure Set_Single (Index : Attribute; V1, V2, V3, V4 : Single);
procedure Set_Single (Index : Attribute; Value : Singles.Vector4);
procedure Set_Int (Index : Attribute; Value : Int);
procedure Set_Int (Index : Attribute; V1, V2 : Int);
procedure Set_Int (Index : Attribute; Value : Ints.Vector2);
procedure Set_Int (Index : Attribute; V1, V2, V3 : Int);
procedure Set_Int (Index : Attribute; Value : Ints.Vector3);
procedure Set_Int (Index : Attribute; V1, V2, V3, V4 : Int);
procedure Set_Int (Index : Attribute; Value : Ints.Vector4);
procedure Set_UInt (Index : Attribute; Value : UInt);
procedure Set_UInt (Index : Attribute; V1, V2 : UInt);
procedure Set_UInt (Index : Attribute; Value : UInts.Vector2);
procedure Set_UInt (Index : Attribute; V1, V2, V3 : UInt);
procedure Set_UInt (Index : Attribute; Value : UInts.Vector3);
procedure Set_UInt (Index : Attribute; V1, V2, V3, V4 : UInt);
procedure Set_UInt (Index : Attribute; Value : UInts.Vector4);
procedure Set_Double (Index : Attribute; Value : Double);
procedure Set_Double (Index : Attribute; V1, V2 : Double);
procedure Set_Double (Index : Attribute; Value : Doubles.Vector2);
procedure Set_Double (Index : Attribute; V1, V2, V3 : Double);
procedure Set_Double (Index : Attribute; Value : Doubles.Vector3);
procedure Set_Double (Index : Attribute; V1, V2, V3, V4 : Double);
procedure Set_Double (Index : Attribute; Value : Doubles.Vector4);
end GL.Attributes;
| 52.065934 | 78 | 0.584213 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.