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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
ad1fa8c4e6725e763f050006e95225554e3a1152 | 12,167 | ads | Ada | source/league/ucd/matreshka-internals-unicode-ucd-core_0025.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_0025.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_0025.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_0025 is
pragma Preelaborate;
Group_0025 : aliased constant Core_Second_Stage
:= (16#4C# .. 16#4F# => -- 254C .. 254F
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Pattern_Syntax
| Grapheme_Base => True,
others => False)),
16#74# => -- 2574
(Other_Symbol, Neutral,
Other, Other, Other, Ambiguous,
(Pattern_Syntax
| Grapheme_Base => True,
others => False)),
16#75# .. 16#7F# => -- 2575 .. 257F
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Pattern_Syntax
| Grapheme_Base => True,
others => False)),
16#90# .. 16#91# => -- 2590 .. 2591
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Pattern_Syntax
| Grapheme_Base => True,
others => False)),
16#96# .. 16#9F# => -- 2596 .. 259F
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Pattern_Syntax
| Grapheme_Base => True,
others => False)),
16#A0# .. 16#A1# => -- 25A0 .. 25A1
(Other_Symbol, Ambiguous,
Other, Other, Other, Ambiguous,
(Other_Math
| Pattern_Syntax
| Grapheme_Base
| Math => True,
others => False)),
16#A2# => -- 25A2
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Pattern_Syntax
| Grapheme_Base => True,
others => False)),
16#AA# .. 16#AD# => -- 25AA .. 25AD
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Pattern_Syntax
| Grapheme_Base => True,
others => False)),
16#AE# .. 16#B1# => -- 25AE .. 25B1
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Other_Math
| Pattern_Syntax
| Grapheme_Base
| Math => True,
others => False)),
16#B2# .. 16#B3# => -- 25B2 .. 25B3
(Other_Symbol, Ambiguous,
Other, Other, Other, Ambiguous,
(Other_Math
| Pattern_Syntax
| Grapheme_Base
| Math => True,
others => False)),
16#B4# .. 16#B5# => -- 25B4 .. 25B5
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Other_Math
| Pattern_Syntax
| Grapheme_Base
| Math => True,
others => False)),
16#B6# => -- 25B6
(Other_Symbol, Ambiguous,
Other, Other, Other, Ambiguous,
(Other_Math
| Pattern_Syntax
| Grapheme_Base
| Math => True,
others => False)),
16#B7# => -- 25B7
(Math_Symbol, Ambiguous,
Other, Other, Other, Ambiguous,
(Pattern_Syntax
| Grapheme_Base
| Math => True,
others => False)),
16#B8# .. 16#BB# => -- 25B8 .. 25BB
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Pattern_Syntax
| Grapheme_Base => True,
others => False)),
16#BC# .. 16#BD# => -- 25BC .. 25BD
(Other_Symbol, Ambiguous,
Other, Other, Other, Ambiguous,
(Other_Math
| Pattern_Syntax
| Grapheme_Base
| Math => True,
others => False)),
16#BE# .. 16#BF# => -- 25BE .. 25BF
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Other_Math
| Pattern_Syntax
| Grapheme_Base
| Math => True,
others => False)),
16#C0# => -- 25C0
(Other_Symbol, Ambiguous,
Other, Other, Other, Ambiguous,
(Other_Math
| Pattern_Syntax
| Grapheme_Base
| Math => True,
others => False)),
16#C1# => -- 25C1
(Math_Symbol, Ambiguous,
Other, Other, Other, Ambiguous,
(Pattern_Syntax
| Grapheme_Base
| Math => True,
others => False)),
16#C2# .. 16#C5# => -- 25C2 .. 25C5
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Pattern_Syntax
| Grapheme_Base => True,
others => False)),
16#C6# .. 16#C7# => -- 25C6 .. 25C7
(Other_Symbol, Ambiguous,
Other, Other, Other, Ambiguous,
(Other_Math
| Pattern_Syntax
| Grapheme_Base
| Math => True,
others => False)),
16#C9# => -- 25C9
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Pattern_Syntax
| Grapheme_Base => True,
others => False)),
16#CA# => -- 25CA
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Other_Math
| Pattern_Syntax
| Grapheme_Base
| Math => True,
others => False)),
16#CB# => -- 25CB
(Other_Symbol, Ambiguous,
Other, Other, Other, Ambiguous,
(Other_Math
| Pattern_Syntax
| Grapheme_Base
| Math => True,
others => False)),
16#CC# .. 16#CD# => -- 25CC .. 25CD
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Pattern_Syntax
| Grapheme_Base => True,
others => False)),
16#CF# .. 16#D1# => -- 25CF .. 25D1
(Other_Symbol, Ambiguous,
Other, Other, Other, Ambiguous,
(Other_Math
| Pattern_Syntax
| Grapheme_Base
| Math => True,
others => False)),
16#D2# .. 16#D3# => -- 25D2 .. 25D3
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Other_Math
| Pattern_Syntax
| Grapheme_Base
| Math => True,
others => False)),
16#D4# .. 16#E1# => -- 25D4 .. 25E1
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Pattern_Syntax
| Grapheme_Base => True,
others => False)),
16#E2# => -- 25E2
(Other_Symbol, Ambiguous,
Other, Other, Other, Ambiguous,
(Other_Math
| Pattern_Syntax
| Grapheme_Base
| Math => True,
others => False)),
16#E4# => -- 25E4
(Other_Symbol, Ambiguous,
Other, Other, Other, Ambiguous,
(Other_Math
| Pattern_Syntax
| Grapheme_Base
| Math => True,
others => False)),
16#E6# => -- 25E6
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Pattern_Syntax
| Grapheme_Base => True,
others => False)),
16#E7# .. 16#EC# => -- 25E7 .. 25EC
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Other_Math
| Pattern_Syntax
| Grapheme_Base
| Math => True,
others => False)),
16#ED# .. 16#EE# => -- 25ED .. 25EE
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Pattern_Syntax
| Grapheme_Base => True,
others => False)),
16#F0# .. 16#F7# => -- 25F0 .. 25F7
(Other_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Pattern_Syntax
| Grapheme_Base => True,
others => False)),
16#F8# .. 16#FF# => -- 25F8 .. 25FF
(Math_Symbol, Neutral,
Other, Other, Other, Alphabetic,
(Pattern_Syntax
| Grapheme_Base
| Math => True,
others => False)),
others =>
(Other_Symbol, Ambiguous,
Other, Other, Other, Ambiguous,
(Pattern_Syntax
| Grapheme_Base => True,
others => False)));
end Matreshka.Internals.Unicode.Ucd.Core_0025;
| 40.421927 | 78 | 0.436098 |
2e8f587179656d47efb8a24b08ab29a22b6a4f8f | 6,913 | adb | Ada | awa/plugins/awa-sysadmin/src/awa-sysadmin-modules.adb | My-Colaborations/ada-awa | cc2dee291a14e4df0dbc9c10285bf284a7f1caa8 | [
"Apache-2.0"
] | 81 | 2015-01-18T23:02:30.000Z | 2022-03-19T17:34:57.000Z | awa/plugins/awa-sysadmin/src/awa-sysadmin-modules.adb | My-Colaborations/ada-awa | cc2dee291a14e4df0dbc9c10285bf284a7f1caa8 | [
"Apache-2.0"
] | 20 | 2015-12-09T19:26:19.000Z | 2022-03-23T14:32:43.000Z | awa/plugins/awa-sysadmin/src/awa-sysadmin-modules.adb | My-Colaborations/ada-awa | cc2dee291a14e4df0dbc9c10285bf284a7f1caa8 | [
"Apache-2.0"
] | 16 | 2015-06-29T02:44:06.000Z | 2021-09-23T18:47:50.000Z | -----------------------------------------------------------------------
-- awa-sysadmin-modules -- Module sysadmin
-- Copyright (C) 2019, 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 AWA.Applications;
with AWA.Modules.Get;
with AWA.Modules.Beans;
with AWA.Sysadmin.Models;
with Util.Log.Loggers;
with ADO.Sessions;
with ADO.Statements;
with ADO.Queries;
with ADO.Utils.Serialize;
with Servlet.Rest;
with Swagger.Servers.Operation;
with AWA.Sysadmin.Beans;
package body AWA.Sysadmin.Modules is
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("Awa.Sysadmin.Module");
package Register is new AWA.Modules.Beans (Module => Sysadmin_Module,
Module_Access => Sysadmin_Module_Access);
procedure List_Users
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
procedure List_Sessions
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
procedure List_Jobs
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type);
package API_List_Users is
new Swagger.Servers.Operation (Handler => List_Users,
Method => Swagger.Servers.GET,
URI => "/sysadmin/api/v1/users");
package API_List_Sessions is
new Swagger.Servers.Operation (Handler => List_Sessions,
Method => Swagger.Servers.GET,
URI => "/sysadmin/api/v1/sessions");
package API_List_Jobs is
new Swagger.Servers.Operation (Handler => List_Jobs,
Method => Swagger.Servers.GET,
URI => "/sysadmin/api/v1/jobs");
procedure List_Users
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type) is
pragma Unreferenced (Req, Reply);
Module : constant Sysadmin_Module_Access := Get_Sysadmin_Module;
Session : constant ADO.Sessions.Session := Module.Get_Session;
Query : ADO.Queries.Context;
Stmt : ADO.Statements.Query_Statement;
begin
Log.Info ("List users");
Query.Set_Query (AWA.Sysadmin.Models.Query_Sysadmin_User_List);
Stmt := Session.Create_Statement (Query);
Stmt.Execute;
Stream.Start_Document;
ADO.Utils.Serialize.Write_Query (Stream, "", Stmt);
Stream.End_Document;
Context.Set_Status (200);
end List_Users;
procedure List_Sessions
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type) is
pragma Unreferenced (Req, Reply);
Module : constant Sysadmin_Module_Access := Get_Sysadmin_Module;
Session : constant ADO.Sessions.Session := Module.Get_Session;
Query : ADO.Queries.Context;
Stmt : ADO.Statements.Query_Statement;
begin
Log.Info ("List sessions");
Query.Set_Query (AWA.Sysadmin.Models.Query_Sysadmin_Session_List);
Stmt := Session.Create_Statement (Query);
Stmt.Execute;
Stream.Start_Document;
ADO.Utils.Serialize.Write_Query (Stream, "", Stmt);
Stream.End_Document;
Context.Set_Status (200);
end List_Sessions;
procedure List_Jobs
(Req : in out Swagger.Servers.Request'Class;
Reply : in out Swagger.Servers.Response'Class;
Stream : in out Swagger.Servers.Output_Stream'Class;
Context : in out Swagger.Servers.Context_Type) is
pragma Unreferenced (Req, Reply);
Module : constant Sysadmin_Module_Access := Get_Sysadmin_Module;
Session : constant ADO.Sessions.Session := Module.Get_Session;
Query : ADO.Queries.Context;
Stmt : ADO.Statements.Query_Statement;
begin
Log.Info ("List jobs");
Query.Set_Query (AWA.Sysadmin.Models.Query_Sysadmin_Job_List);
Stmt := Session.Create_Statement (Query);
Stmt.Execute;
Stream.Start_Document;
ADO.Utils.Serialize.Write_Query (Stream, "", Stmt);
Stream.End_Document;
Context.Set_Status (200);
end List_Jobs;
-- ------------------------------
-- Initialize the sysadmin module.
-- ------------------------------
overriding
procedure Initialize (Plugin : in out Sysadmin_Module;
App : in AWA.Modules.Application_Access;
Props : in ASF.Applications.Config) is
begin
Log.Info ("Initializing the sysadmin module");
App.Add_Servlet ("sysadmin", Plugin.API_Servlet'Unchecked_Access);
App.Add_Filter ("sysadmin-filter", Plugin.API_Filter'Unchecked_Access);
Register.Register (Plugin => Plugin,
Name => "AWA.Sysadmin.Beans.Authenticate_Bean",
Handler => AWA.Sysadmin.Beans.Create_Authenticate_Bean'Access);
App.Add_Mapping (Name => "sysadmin", Pattern => "/sysadmin/api/*");
AWA.Modules.Module (Plugin).Initialize (App, Props);
Servlet.Rest.Register (App.all, API_List_Users.Definition);
Servlet.Rest.Register (App.all, API_List_Sessions.Definition);
Servlet.Rest.Register (App.all, API_List_Jobs.Definition);
end Initialize;
-- ------------------------------
-- Get the sysadmin module.
-- ------------------------------
function Get_Sysadmin_Module return Sysadmin_Module_Access is
function Get is new AWA.Modules.Get (Sysadmin_Module, Sysadmin_Module_Access, NAME);
begin
return Get;
end Get_Sysadmin_Module;
end AWA.Sysadmin.Modules;
| 37.983516 | 93 | 0.639809 |
1dab95817826d5c7476de4c16c427a2a08e4ef96 | 796 | ads | Ada | Read Only/gdb-6.8/gdb/testsuite/gdb.ada/arrayptr/pck.ads | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | Read Only/gdb-6.8/gdb/testsuite/gdb.ada/arrayptr/pck.ads | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | Read Only/gdb-6.8/gdb/testsuite/gdb.ada/arrayptr/pck.ads | samyvic/OS-Project | 1622bc1641876584964effd91d65ef02e92728e1 | [
"Apache-2.0"
] | null | null | null | -- Copyright 2008 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with System;
package Pck is
procedure Do_Nothing (A : System.Address);
end Pck;
| 34.608696 | 73 | 0.734925 |
50c5ecb3c4377eb4d962916c4d900b3b77630cc9 | 96 | adb | Ada | examples/typeclass.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | examples/typeclass.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | examples/typeclass.adb | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | procedure typeclass is
begin
case Integer'Type_Class is
when others => null;
end case;
end;
| 13.714286 | 27 | 0.75 |
c7abd8e5b1472028ef788593a2816db4d6975dd2 | 814 | adb | Ada | 3-mid/opengl/source/opengl-conversions.adb | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/opengl/source/opengl-conversions.adb | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/opengl/source/opengl-conversions.adb | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | package body openGL.Conversions
is
function to_Vector_4 (From : in lucid_Color) return Vector_4
is
begin
return (to_Real (From.Primary.Red),
to_Real (From.Primary.Green),
to_Real (From.Primary.Blue),
to_Real (From.Opacity));
end to_Vector_4;
function to_Vector_4 (From : in light_Color) return Vector_4
is
begin
return (From.Red,
From.Green,
From.Blue,
From.Opacity);
end to_Vector_4;
function to_light_Color (From : in lucid_Color) return light_Color
is
begin
return (to_Real (From.Primary.Red),
to_Real (From.Primary.Green),
to_Real (From.Primary.Blue),
to_Real (From.Opacity));
end to_light_Color;
end openGL.Conversions;
| 22 | 69 | 0.605651 |
c7fe93ed6b3f002e1fdf27f4e4c03b87a158814d | 3,822 | ads | Ada | llvm-gcc-4.2-2.9/gcc/ada/s-pooloc.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-pooloc.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/s-pooloc.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . P O O L _ L O C A L --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
with System.Storage_Elements;
with System.Pool_Global;
package System.Pool_Local is
pragma Elaborate_Body;
-- Needed to ensure that library routines can execute allocators
----------------------------
-- Unbounded_Reclaim_Pool --
----------------------------
-- Allocation strategy:
-- Call to malloc/free for each Allocate/Deallocate
-- no user specifiable size
-- Space of allocated objects is reclaimed at pool finalization
-- Manages a list of allocated objects
type Unbounded_Reclaim_Pool is new
System.Pool_Global.Unbounded_No_Reclaim_Pool with
record
First : System.Address := Null_Address;
end record;
-- function Storage_Size is inherited
procedure Allocate
(Pool : in out Unbounded_Reclaim_Pool;
Address : out System.Address;
Storage_Size : System.Storage_Elements.Storage_Count;
Alignment : System.Storage_Elements.Storage_Count);
procedure Deallocate
(Pool : in out Unbounded_Reclaim_Pool;
Address : System.Address;
Storage_Size : System.Storage_Elements.Storage_Count;
Alignment : System.Storage_Elements.Storage_Count);
procedure Finalize (Pool : in out Unbounded_Reclaim_Pool);
end System.Pool_Local;
| 50.96 | 78 | 0.498953 |
3d99b04232af4ebd3fa638c45429da3450f41ba0 | 1,008 | adb | Ada | gdb/testsuite/gdb.ada/arr_enum_idx_w_gap/foo_q418_043.adb | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | 1 | 2020-10-14T03:24:35.000Z | 2020-10-14T03:24:35.000Z | gdb/testsuite/gdb.ada/arr_enum_idx_w_gap/foo_q418_043.adb | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | null | null | null | gdb/testsuite/gdb.ada/arr_enum_idx_w_gap/foo_q418_043.adb | greyblue9/binutils-gdb | 05377632b124fe7600eea7f4ee0e9a35d1b0cbdc | [
"BSD-3-Clause"
] | null | null | null | -- Copyright 2018-2021 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
procedure Foo_Q418_043 is
type Index is (Index1, Index2);
Size : constant Integer := 10;
for Index use (Index1 => 1, Index2 => Size);
type Array_Index_Enum is array (Index) of Integer;
A : Array_Index_Enum :=(others => 42);
begin
A(Index2) := 4242; --BREAK
end Foo_Q418_043;
| 40.32 | 73 | 0.719246 |
581760b240473045112841a941312970bc17d1f4 | 4,771 | ads | Ada | samples/client/petstore/ada/src/client/samples-petstore-clients.ads | pcoltau/openapi-generator | 00abb4780c4ac8cfde9301071b653f062555cc79 | [
"Apache-2.0"
] | 3 | 2020-01-24T13:34:52.000Z | 2021-12-07T17:45:15.000Z | samples/client/petstore/ada/src/client/samples-petstore-clients.ads | pcoltau/openapi-generator | 00abb4780c4ac8cfde9301071b653f062555cc79 | [
"Apache-2.0"
] | 10 | 2019-06-28T09:01:45.000Z | 2022-02-26T12:19:16.000Z | samples/client/petstore/ada/src/client/samples-petstore-clients.ads | pcoltau/openapi-generator | 00abb4780c4ac8cfde9301071b653f062555cc79 | [
"Apache-2.0"
] | 4 | 2019-04-08T17:06:09.000Z | 2020-06-09T18:16:08.000Z | -- OpenAPI Petstore
-- This is a sample server Petstore server. For this sample, you can use the api key `special_key` to test the authorization filters.
--
-- OpenAPI spec version: 1.0.0
--
--
-- NOTE: This package is auto generated by OpenAPI-Generator 4.0.0-SNAPSHOT.
-- https://openapi-generator.tech
-- 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.PetType);
-- 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.UString_Vectors.Vector;
Result : out Samples.Petstore.Models.PetType_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.UString_Vectors.Vector;
Result : out Samples.Petstore.Models.PetType_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.PetType);
-- Update an existing pet
procedure Update_Pet
(Client : in out Client_Type;
P_Body : in Samples.Petstore.Models.PetType);
-- 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.ApiResponseType);
-- 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.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.OrderType);
-- Place an order for a pet
procedure Place_Order
(Client : in out Client_Type;
P_Body : in Samples.Petstore.Models.OrderType;
Result : out Samples.Petstore.Models.OrderType);
-- 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.UserType);
-- 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.UserType_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.UserType_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.UserType);
-- 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.UserType);
end Samples.Petstore.Clients;
| 33.836879 | 134 | 0.689164 |
57d3057945a8d8a679f4777c006ce1a35ccc076d | 13,379 | ads | Ada | source/conformance/generated/conformance-conformance.ads | mgrojo/protobuf | ffc50782c0c5bbb60e8f1504fcfc5a5fbafdb7dd | [
"MIT"
] | 12 | 2020-05-04T09:30:21.000Z | 2022-02-08T21:47:32.000Z | source/conformance/generated/conformance-conformance.ads | mgrojo/protobuf | ffc50782c0c5bbb60e8f1504fcfc5a5fbafdb7dd | [
"MIT"
] | 6 | 2021-03-16T15:17:33.000Z | 2022-03-31T21:32:47.000Z | source/conformance/generated/conformance-conformance.ads | mgrojo/protobuf | ffc50782c0c5bbb60e8f1504fcfc5a5fbafdb7dd | [
"MIT"
] | 1 | 2021-03-16T15:09:27.000Z | 2021-03-16T15:09:27.000Z | with Ada.Finalization;
with Ada.Streams;
with League.Stream_Element_Vectors;
with League.String_Vectors;
with League.Strings;
with PB_Support.Vectors;
package Conformance.Conformance is
type Wire_Format is (UNSPECIFIED, PROTOBUF, JSON, JSPB, TEXT_FORMAT);
for Wire_Format use
(UNSPECIFIED => 0, PROTOBUF => 1, JSON => 2, JSPB => 3,
TEXT_FORMAT => 4);
package Wire_Format_Vectors is new PB_Support.Vectors (Wire_Format);
type Test_Category is
(UNSPECIFIED_TEST, BINARY_TEST, JSON_TEST,
JSON_IGNORE_UNKNOWN_PARSING_TEST, JSPB_TEST, TEXT_FORMAT_TEST);
for Test_Category use
(UNSPECIFIED_TEST => 0,
BINARY_TEST => 1,
JSON_TEST => 2,
JSON_IGNORE_UNKNOWN_PARSING_TEST => 3,
JSPB_TEST => 4,
TEXT_FORMAT_TEST => 5);
package Test_Category_Vectors is new PB_Support.Vectors (Test_Category);
type Failure_Set_Vector is tagged private
with Variable_Indexing => Get_Failure_Set_Variable_Reference,
Constant_Indexing => Get_Failure_Set_Constant_Reference;
type Conformance_Request_Vector is tagged private
with Variable_Indexing => Get_Conformance_Request_Variable_Reference,
Constant_Indexing => Get_Conformance_Request_Constant_Reference;
type Conformance_Response_Vector is tagged private
with Variable_Indexing => Get_Conformance_Response_Variable_Reference,
Constant_Indexing => Get_Conformance_Response_Constant_Reference;
type Jspb_Encoding_Config_Vector is tagged private
with Variable_Indexing => Get_Jspb_Encoding_Config_Variable_Reference,
Constant_Indexing => Get_Jspb_Encoding_Config_Constant_Reference;
type Failure_Set is
record
Failure : League.String_Vectors.Universal_String_Vector;
end record;
type Optional_Failure_Set (Is_Set : Boolean := False) is
record
case Is_Set is
when True =>
Value : Conformance.Failure_Set;
when False =>
null;
end case;
end record;
function Length (Self : Failure_Set_Vector) return Natural;
procedure Clear (Self : in out Failure_Set_Vector);
procedure Append (Self : in out Failure_Set_Vector; V : Failure_Set);
type Failure_Set_Variable_Reference
(Element : not null access Failure_Set) is null record
with Implicit_Dereference => Element;
not overriding function Get_Failure_Set_Variable_Reference
(Self : aliased in out Failure_Set_Vector;
Index : Positive)
return Failure_Set_Variable_Reference
with Inline;
type Failure_Set_Constant_Reference
(Element : not null access constant Failure_Set) is null record
with Implicit_Dereference => Element;
not overriding function Get_Failure_Set_Constant_Reference
(Self : aliased Failure_Set_Vector;
Index : Positive)
return Failure_Set_Constant_Reference
with Inline;
type Conformance_Response_Variant_Kind is
(Result_Not_Set,
Parse_Error_Kind,
Serialize_Error_Kind,
Runtime_Error_Kind,
Protobuf_Payload_Kind,
Json_Payload_Kind,
Skipped_Kind ,
Jspb_Payload_Kind,
Text_Payload_Kind);
type Conformance_Response_Variant
(Result : Conformance_Response_Variant_Kind := Result_Not_Set) is
record
case Result is
when Result_Not_Set =>
null;
when Parse_Error_Kind =>
Parse_Error : League.Strings.Universal_String;
when Serialize_Error_Kind =>
Serialize_Error : League.Strings.Universal_String;
when Runtime_Error_Kind =>
Runtime_Error : League.Strings.Universal_String;
when Protobuf_Payload_Kind =>
Protobuf_Payload : League.Stream_Element_Vectors
.Stream_Element_Vector;
when Json_Payload_Kind =>
Json_Payload : League.Strings.Universal_String;
when Skipped_Kind =>
Skipped : League.Strings.Universal_String;
when Jspb_Payload_Kind =>
Jspb_Payload : League.Strings.Universal_String;
when Text_Payload_Kind =>
Text_Payload : League.Strings.Universal_String;
end case;
end record;
type Conformance_Response is
record
Variant : Conformance_Response_Variant;
end record;
type Optional_Conformance_Response (Is_Set : Boolean := False) is
record
case Is_Set is
when True =>
Value : Conformance.Conformance_Response;
when False =>
null;
end case;
end record;
function Length (Self : Conformance_Response_Vector) return Natural;
procedure Clear (Self : in out Conformance_Response_Vector);
procedure Append
(Self : in out Conformance_Response_Vector;
V : Conformance_Response);
type Conformance_Response_Variable_Reference
(Element : not null access Conformance_Response) is null record
with Implicit_Dereference => Element;
not overriding function Get_Conformance_Response_Variable_Reference
(Self : aliased in out Conformance_Response_Vector;
Index : Positive)
return Conformance_Response_Variable_Reference
with Inline;
type Conformance_Response_Constant_Reference
(Element : not null access constant Conformance_Response) is null record
with Implicit_Dereference => Element;
not overriding function Get_Conformance_Response_Constant_Reference
(Self : aliased Conformance_Response_Vector;
Index : Positive)
return Conformance_Response_Constant_Reference
with Inline;
type Jspb_Encoding_Config is
record
Use_Jspb_Array_Any_Format : Boolean := False;
end record;
type Optional_Jspb_Encoding_Config (Is_Set : Boolean := False) is
record
case Is_Set is
when True =>
Value : Conformance.Jspb_Encoding_Config;
when False =>
null;
end case;
end record;
function Length (Self : Jspb_Encoding_Config_Vector) return Natural;
procedure Clear (Self : in out Jspb_Encoding_Config_Vector);
procedure Append
(Self : in out Jspb_Encoding_Config_Vector;
V : Jspb_Encoding_Config);
type Jspb_Encoding_Config_Variable_Reference
(Element : not null access Jspb_Encoding_Config) is null record
with Implicit_Dereference => Element;
not overriding function Get_Jspb_Encoding_Config_Variable_Reference
(Self : aliased in out Jspb_Encoding_Config_Vector;
Index : Positive)
return Jspb_Encoding_Config_Variable_Reference
with Inline;
type Jspb_Encoding_Config_Constant_Reference
(Element : not null access constant Jspb_Encoding_Config) is null record
with Implicit_Dereference => Element;
not overriding function Get_Jspb_Encoding_Config_Constant_Reference
(Self : aliased Jspb_Encoding_Config_Vector;
Index : Positive)
return Jspb_Encoding_Config_Constant_Reference
with Inline;
type Conformance_Request_Variant_Kind is
(Payload_Not_Set,
Protobuf_Payload_Kind,
Json_Payload_Kind,
Jspb_Payload_Kind,
Text_Payload_Kind);
type Conformance_Request_Variant
(Payload : Conformance_Request_Variant_Kind := Payload_Not_Set) is
record
case Payload is
when Payload_Not_Set =>
null;
when Protobuf_Payload_Kind =>
Protobuf_Payload : League.Stream_Element_Vectors
.Stream_Element_Vector;
when Json_Payload_Kind =>
Json_Payload : League.Strings.Universal_String;
when Jspb_Payload_Kind =>
Jspb_Payload : League.Strings.Universal_String;
when Text_Payload_Kind =>
Text_Payload : League.Strings.Universal_String;
end case;
end record;
type Conformance_Request is
record
Requested_Output_Format : Conformance.Wire_Format :=
Conformance.UNSPECIFIED;
Message_Type : League.Strings.Universal_String;
Test_Category : Conformance.Test_Category :=
Conformance.UNSPECIFIED_TEST;
Jspb_Encoding_Options : Conformance.Optional_Jspb_Encoding_Config;
Print_Unknown_Fields : Boolean := False;
Variant : Conformance_Request_Variant;
end record;
type Optional_Conformance_Request (Is_Set : Boolean := False) is
record
case Is_Set is
when True =>
Value : Conformance.Conformance_Request;
when False =>
null;
end case;
end record;
function Length (Self : Conformance_Request_Vector) return Natural;
procedure Clear (Self : in out Conformance_Request_Vector);
procedure Append
(Self : in out Conformance_Request_Vector;
V : Conformance_Request);
type Conformance_Request_Variable_Reference
(Element : not null access Conformance_Request) is null record
with Implicit_Dereference => Element;
not overriding function Get_Conformance_Request_Variable_Reference
(Self : aliased in out Conformance_Request_Vector;
Index : Positive)
return Conformance_Request_Variable_Reference
with Inline;
type Conformance_Request_Constant_Reference
(Element : not null access constant Conformance_Request) is null record
with Implicit_Dereference => Element;
not overriding function Get_Conformance_Request_Constant_Reference
(Self : aliased Conformance_Request_Vector;
Index : Positive)
return Conformance_Request_Constant_Reference
with Inline;
private
procedure Read_Failure_Set
(Stream : access Ada.Streams.Root_Stream_Type'Class;
V : out Failure_Set);
procedure Write_Failure_Set
(Stream : access Ada.Streams.Root_Stream_Type'Class;
V : Failure_Set);
for Failure_Set'Read use Read_Failure_Set;
for Failure_Set'Write use Write_Failure_Set;
type Failure_Set_Array is array (Positive range <>) of aliased Failure_Set;
type Failure_Set_Array_Access is access Failure_Set_Array;
type Failure_Set_Vector is
new Ada.Finalization.Controlled
with record
Data : Failure_Set_Array_Access;
Length : Natural := 0;
end record;
overriding procedure Adjust (Self : in out Failure_Set_Vector);
overriding procedure Finalize (Self : in out Failure_Set_Vector);
procedure Read_Conformance_Request
(Stream : access Ada.Streams.Root_Stream_Type'Class;
V : out Conformance_Request);
procedure Write_Conformance_Request
(Stream : access Ada.Streams.Root_Stream_Type'Class;
V : Conformance_Request);
for Conformance_Request'Read use Read_Conformance_Request;
for Conformance_Request'Write use Write_Conformance_Request;
type Conformance_Request_Array is
array (Positive range <>) of aliased Conformance_Request;
type Conformance_Request_Array_Access is access Conformance_Request_Array;
type Conformance_Request_Vector is
new Ada.Finalization.Controlled
with record
Data : Conformance_Request_Array_Access;
Length : Natural := 0;
end record;
overriding procedure Adjust (Self : in out Conformance_Request_Vector);
overriding procedure Finalize (Self : in out Conformance_Request_Vector);
procedure Read_Conformance_Response
(Stream : access Ada.Streams.Root_Stream_Type'Class;
V : out Conformance_Response);
procedure Write_Conformance_Response
(Stream : access Ada.Streams.Root_Stream_Type'Class;
V : Conformance_Response);
for Conformance_Response'Read use Read_Conformance_Response;
for Conformance_Response'Write use Write_Conformance_Response;
type Conformance_Response_Array is
array (Positive range <>) of aliased Conformance_Response;
type Conformance_Response_Array_Access is access Conformance_Response_Array;
type Conformance_Response_Vector is
new Ada.Finalization.Controlled
with record
Data : Conformance_Response_Array_Access;
Length : Natural := 0;
end record;
overriding procedure Adjust (Self : in out Conformance_Response_Vector);
overriding procedure Finalize (Self : in out Conformance_Response_Vector);
procedure Read_Jspb_Encoding_Config
(Stream : access Ada.Streams.Root_Stream_Type'Class;
V : out Jspb_Encoding_Config);
procedure Write_Jspb_Encoding_Config
(Stream : access Ada.Streams.Root_Stream_Type'Class;
V : Jspb_Encoding_Config);
for Jspb_Encoding_Config'Read use Read_Jspb_Encoding_Config;
for Jspb_Encoding_Config'Write use Write_Jspb_Encoding_Config;
type Jspb_Encoding_Config_Array is
array (Positive range <>) of aliased Jspb_Encoding_Config;
type Jspb_Encoding_Config_Array_Access is access Jspb_Encoding_Config_Array;
type Jspb_Encoding_Config_Vector is
new Ada.Finalization.Controlled
with record
Data : Jspb_Encoding_Config_Array_Access;
Length : Natural := 0;
end record;
overriding procedure Adjust (Self : in out Jspb_Encoding_Config_Vector);
overriding procedure Finalize (Self : in out Jspb_Encoding_Config_Vector);
end Conformance.Conformance; | 33.531328 | 79 | 0.713506 |
ad5ec5dd0628b5c5cf10ecb93428873da09f3283 | 3,540 | ads | Ada | src/asf-applications-messages-factory.ads | Letractively/ada-asf | da9f85f85666eba7e23fefea661160863b74154d | [
"Apache-2.0"
] | null | null | null | src/asf-applications-messages-factory.ads | Letractively/ada-asf | da9f85f85666eba7e23fefea661160863b74154d | [
"Apache-2.0"
] | null | null | null | src/asf-applications-messages-factory.ads | Letractively/ada-asf | da9f85f85666eba7e23fefea661160863b74154d | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- applications.messages-factory -- Application Message Factory
-- Copyright (C) 2011, 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 ASF.Contexts.Faces;
with ASF.Utils;
package ASF.Applications.Messages.Factory is
-- Get a localized message. The message identifier is composed of a resource bundle name
-- prefix and a bundle key. The prefix and key are separated by the first '.'.
-- If the message identifier does not contain any prefix, the default bundle is "messages".
function Get_Message (Context : in ASF.Contexts.Faces.Faces_Context'Class;
Message_Id : in String) return String;
-- Build a localized message.
function Get_Message (Context : in ASF.Contexts.Faces.Faces_Context'Class;
Message_Id : in String;
Severity : in Messages.Severity := ERROR) return Message;
-- Build a localized message and format the message with one argument.
function Get_Message (Context : in ASF.Contexts.Faces.Faces_Context'Class;
Message_Id : in String;
Param1 : in String;
Severity : in Messages.Severity := ERROR) return Message;
-- Build a localized message and format the message with two argument.
function Get_Message (Context : in ASF.Contexts.Faces.Faces_Context'Class;
Message_Id : in String;
Param1 : in String;
Param2 : in String;
Severity : in Messages.Severity := ERROR) return Message;
-- Build a localized message and format the message with some arguments.
function Get_Message (Context : in ASF.Contexts.Faces.Faces_Context'Class;
Message_Id : in String;
Args : in ASF.Utils.Object_Array;
Severity : in Messages.Severity := ERROR) return Message;
-- Add a localized global message in the current faces context.
procedure Add_Message (Message_Id : in String;
Severity : in Messages.Severity := ERROR);
-- Add a localized global message in the faces context.
procedure Add_Message (Context : in out ASF.Contexts.Faces.Faces_Context'Class;
Message_Id : in String;
Param1 : in String;
Severity : in Messages.Severity := ERROR);
-- Add a localized global message in the faces context.
procedure Add_Message (Context : in out ASF.Contexts.Faces.Faces_Context'Class;
Message_Id : in String;
Severity : in Messages.Severity := ERROR);
end ASF.Applications.Messages.Factory;
| 51.304348 | 95 | 0.60565 |
2e9197a25951cad78cdeb306f7c418b07d129ce2 | 136,383 | adb | Ada | model_multistart/0/hls4ml_prj/myproject_prj/solution1/.autopilot/db/conv_2d_large_cl_1.bind.adb | filipemlins/nas-hls4ml | b35afc4f684d803d352776c40f3a6cbbf47c4b1c | [
"MIT"
] | null | null | null | model_multistart/0/hls4ml_prj/myproject_prj/solution1/.autopilot/db/conv_2d_large_cl_1.bind.adb | filipemlins/nas-hls4ml | b35afc4f684d803d352776c40f3a6cbbf47c4b1c | [
"MIT"
] | null | null | null | model_multistart/0/hls4ml_prj/myproject_prj/solution1/.autopilot/db/conv_2d_large_cl_1.bind.adb | filipemlins/nas-hls4ml | b35afc4f684d803d352776c40f3a6cbbf47c4b1c | [
"MIT"
] | null | null | null | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="15">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>conv_2d_large_cl_1</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>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>data.V</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<direction>0</direction>
<if_type>1</if_type>
<array_size>1024</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>res_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>res.V</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<direction>1</direction>
<if_type>1</if_type>
<array_size>6728</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>37</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_3">
<Value>
<Obj>
<type>0</type>
<id>5</id>
<name>data_col_V</name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>197</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</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>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>197</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>data_col.V</originalName>
<rtlName></rtlName>
<coreName>RAM</coreName>
</Obj>
<bitwidth>14</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>1</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>6</id>
<name>res_V_assign</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>RAM</coreName>
</Obj>
<bitwidth>14</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>2</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>204</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>204</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>65</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="_6">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>66</item>
<item>67</item>
<item>69</item>
<item>70</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>4</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>phi_mul</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>13</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>71</item>
<item>72</item>
<item>74</item>
<item>75</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>5</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>next_mul</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>13</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>76</item>
<item>78</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.67</m_delay>
<m_topoIndex>6</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>tmp</name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>204</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>204</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>79</item>
<item>81</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.36</m_delay>
<m_topoIndex>7</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>i_7</name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>204</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>204</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>82</item>
<item>84</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.78</m_delay>
<m_topoIndex>8</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>204</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>204</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>85</item>
<item>86</item>
<item>87</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>9</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>206</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>206</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>88</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>10</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>j</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>5</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>89</item>
<item>90</item>
<item>91</item>
<item>92</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>12</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>tmp_s</name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>206</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>206</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>93</item>
<item>94</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.36</m_delay>
<m_topoIndex>13</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>j_1</name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>206</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>206</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>j</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>95</item>
<item>96</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.78</m_delay>
<m_topoIndex>14</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>206</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>206</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>97</item>
<item>98</item>
<item>99</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>15</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>208</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>208</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>101</item>
<item>102</item>
<item>103</item>
<item>104</item>
<item>105</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>16</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_dense_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>276</lineNumber>
<contextFuncName>dense_large&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3_mult&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>209</second>
</item>
<item>
<first>
<first>firmware/nnet_utils/nnet_dense_large.h</first>
<second>dense_large&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3_mult&gt;</second>
</first>
<second>276</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>7</count>
<item_version>0</item_version>
<item>107</item>
<item>108</item>
<item>109</item>
<item>152</item>
<item>153</item>
<item>203</item>
<item>204</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>18</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>tmp_77</name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>212</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>212</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>111</item>
<item>112</item>
<item>114</item>
</oprand_edges>
<opcode>bitconcatenate</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>19</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>tmp_135_cast_cast</name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>211</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>211</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>115</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
<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="_21">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>211</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>211</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>116</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>1.76</m_delay>
<m_topoIndex>21</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>k</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>k</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>118</item>
<item>119</item>
<item>120</item>
<item>121</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>0.00</m_delay>
<m_topoIndex>22</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>k_cast4_cast</name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>211</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>211</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>122</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>23</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>tmp_78</name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>211</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>211</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>123</item>
<item>125</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.30</m_delay>
<m_topoIndex>24</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>k_1</name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>211</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>211</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>k</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>4</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>126</item>
<item>128</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.73</m_delay>
<m_topoIndex>25</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>211</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>211</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>129</item>
<item>130</item>
<item>131</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>26</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>tmp1</name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>212</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>212</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>132</item>
<item>133</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.91</m_delay>
<m_topoIndex>27</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>tmp1_cast</name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>212</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>212</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>134</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>28</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>tmp_79</name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>212</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>212</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>135</item>
<item>136</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.67</m_delay>
<m_topoIndex>29</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>tmp_80</name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>212</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>212</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>137</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>34</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>tmp_81</name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>212</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>212</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>138</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>30</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>res_V_assign_addr</name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>212</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>212</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>139</item>
<item>141</item>
<item>142</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>31</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name>res_V_assign_load</name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>212</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>212</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>14</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>143</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
<m_isOnCriticalPath>0</m_isOnCriticalPath>
<m_isLCDNode>0</m_isLCDNode>
<m_isStartOfPath>0</m_isStartOfPath>
<m_delay>2.32</m_delay>
<m_topoIndex>32</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>res_V_addr</name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>212</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>212</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>144</item>
<item>145</item>
<item>146</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>35</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>212</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>212</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>147</item>
<item>148</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>36</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>211</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>211</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>149</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>37</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>206</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>206</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>150</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>33</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>204</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>204</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>151</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>17</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name></name>
<fileName>firmware/nnet_utils/nnet_conv2d_large.h</fileName>
<fileDirectory>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</fileDirectory>
<lineNumber>217</lineNumber>
<contextFuncName>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/filipe/MEGA/GitHub/nas-hls4ml/model_multistart/0/hls4ml_prj</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>firmware/nnet_utils/nnet_conv2d_large.h</first>
<second>conv_2d_large_cl&lt;ap_fixed&lt;14, 2, 0, 0, 0&gt;, ap_fixed&lt;14, 2, 0, 0, 0&gt;, config3&gt;</second>
</first>
<second>217</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>11</m_topoIndex>
<m_clusterGroupNumber>-1</m_clusterGroupNumber>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>13</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_40">
<Value>
<Obj>
<type>2</type>
<id>62</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="_41">
<Value>
<Obj>
<type>2</type>
<id>68</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_42">
<Value>
<Obj>
<type>2</type>
<id>73</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>13</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_43">
<Value>
<Obj>
<type>2</type>
<id>77</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>13</bitwidth>
</Value>
<const_type>0</const_type>
<content>232</content>
</item>
<item class_id_reference="16" object_id="_44">
<Value>
<Obj>
<type>2</type>
<id>80</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>29</content>
</item>
<item class_id_reference="16" object_id="_45">
<Value>
<Obj>
<type>2</type>
<id>83</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>5</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_46">
<Value>
<Obj>
<type>2</type>
<id>100</id>
<name>im2col_2d_cl_1</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:im2col_2d_cl.1></content>
</item>
<item class_id_reference="16" object_id="_47">
<Value>
<Obj>
<type>2</type>
<id>106</id>
<name>dense_large_rf_gt_ni_1</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:dense_large_rf_gt_ni.1></content>
</item>
<item class_id_reference="16" object_id="_48">
<Value>
<Obj>
<type>2</type>
<id>113</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>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_49">
<Value>
<Obj>
<type>2</type>
<id>117</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>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_50">
<Value>
<Obj>
<type>2</type>
<id>124</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>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_51">
<Value>
<Obj>
<type>2</type>
<id>127</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>4</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_52">
<Value>
<Obj>
<type>2</type>
<id>140</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>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_53">
<Obj>
<type>3</type>
<id>8</id>
<name>arrayctor.loop1.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>3</count>
<item_version>0</item_version>
<item>5</item>
<item>6</item>
<item>7</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_54">
<Obj>
<type>3</type>
<id>16</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>6</count>
<item_version>0</item_version>
<item>9</item>
<item>10</item>
<item>11</item>
<item>12</item>
<item>14</item>
<item>15</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_55">
<Obj>
<type>3</type>
<id>20</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_56">
<Obj>
<type>3</type>
<id>26</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>21</item>
<item>22</item>
<item>24</item>
<item>25</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_57">
<Obj>
<type>3</type>
<id>34</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>5</count>
<item_version>0</item_version>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_58">
<Obj>
<type>3</type>
<id>41</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>5</count>
<item_version>0</item_version>
<item>35</item>
<item>36</item>
<item>37</item>
<item>39</item>
<item>40</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_59">
<Obj>
<type>3</type>
<id>53</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>10</count>
<item_version>0</item_version>
<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>
</node_objs>
</item>
<item class_id_reference="18" object_id="_60">
<Obj>
<type>3</type>
<id>56</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_61">
<Obj>
<type>3</type>
<id>59</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_62">
<Obj>
<type>3</type>
<id>61</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>91</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_63">
<id>63</id>
<edge_type>1</edge_type>
<source_obj>62</source_obj>
<sink_obj>5</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_64">
<id>64</id>
<edge_type>1</edge_type>
<source_obj>62</source_obj>
<sink_obj>6</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_65">
<id>65</id>
<edge_type>2</edge_type>
<source_obj>16</source_obj>
<sink_obj>7</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_66">
<id>66</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_67">
<id>67</id>
<edge_type>2</edge_type>
<source_obj>59</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_68">
<id>69</id>
<edge_type>1</edge_type>
<source_obj>68</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_69">
<id>70</id>
<edge_type>2</edge_type>
<source_obj>8</source_obj>
<sink_obj>9</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_70">
<id>71</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>10</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_71">
<id>72</id>
<edge_type>2</edge_type>
<source_obj>59</source_obj>
<sink_obj>10</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_72">
<id>74</id>
<edge_type>1</edge_type>
<source_obj>73</source_obj>
<sink_obj>10</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_73">
<id>75</id>
<edge_type>2</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="_74">
<id>76</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>11</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_75">
<id>78</id>
<edge_type>1</edge_type>
<source_obj>77</source_obj>
<sink_obj>11</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_76">
<id>79</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="_77">
<id>81</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>12</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_78">
<id>82</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_79">
<id>84</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>14</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_80">
<id>85</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_81">
<id>86</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_82">
<id>87</id>
<edge_type>2</edge_type>
<source_obj>61</source_obj>
<sink_obj>15</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_83">
<id>88</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>19</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_84">
<id>89</id>
<edge_type>1</edge_type>
<source_obj>68</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_85">
<id>90</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_86">
<id>91</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_87">
<id>92</id>
<edge_type>2</edge_type>
<source_obj>56</source_obj>
<sink_obj>21</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_88">
<id>93</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_89">
<id>94</id>
<edge_type>1</edge_type>
<source_obj>80</source_obj>
<sink_obj>22</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_90">
<id>95</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_91">
<id>96</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>24</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_92">
<id>97</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_93">
<id>98</id>
<edge_type>2</edge_type>
<source_obj>34</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_94">
<id>99</id>
<edge_type>2</edge_type>
<source_obj>59</source_obj>
<sink_obj>25</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_95">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>100</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_96">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_97">
<id>103</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_98">
<id>104</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_99">
<id>105</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>29</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_100">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>106</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_101">
<id>108</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_102">
<id>109</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_103">
<id>112</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_104">
<id>114</id>
<edge_type>1</edge_type>
<source_obj>113</source_obj>
<sink_obj>31</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_105">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>32</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_106">
<id>116</id>
<edge_type>2</edge_type>
<source_obj>41</source_obj>
<sink_obj>33</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_107">
<id>118</id>
<edge_type>1</edge_type>
<source_obj>117</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_108">
<id>119</id>
<edge_type>2</edge_type>
<source_obj>34</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_109">
<id>120</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_110">
<id>121</id>
<edge_type>2</edge_type>
<source_obj>53</source_obj>
<sink_obj>35</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_111">
<id>122</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="_112">
<id>123</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_113">
<id>125</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>37</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_114">
<id>126</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_115">
<id>128</id>
<edge_type>1</edge_type>
<source_obj>127</source_obj>
<sink_obj>39</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_116">
<id>129</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_117">
<id>130</id>
<edge_type>2</edge_type>
<source_obj>53</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_118">
<id>131</id>
<edge_type>2</edge_type>
<source_obj>56</source_obj>
<sink_obj>40</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_119">
<id>132</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_120">
<id>133</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>43</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_121">
<id>134</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>44</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_122">
<id>135</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_123">
<id>136</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>45</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_124">
<id>137</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>46</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_125">
<id>138</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>47</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_126">
<id>139</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_127">
<id>141</id>
<edge_type>1</edge_type>
<source_obj>140</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_128">
<id>142</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>48</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_129">
<id>143</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>49</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_130">
<id>144</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_131">
<id>145</id>
<edge_type>1</edge_type>
<source_obj>140</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_132">
<id>146</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>50</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_133">
<id>147</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_134">
<id>148</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>51</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_135">
<id>149</id>
<edge_type>2</edge_type>
<source_obj>41</source_obj>
<sink_obj>52</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_136">
<id>150</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>55</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_137">
<id>151</id>
<edge_type>2</edge_type>
<source_obj>16</source_obj>
<sink_obj>58</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_138">
<id>152</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_139">
<id>153</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_140">
<id>191</id>
<edge_type>2</edge_type>
<source_obj>8</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_141">
<id>192</id>
<edge_type>2</edge_type>
<source_obj>16</source_obj>
<sink_obj>61</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_142">
<id>193</id>
<edge_type>2</edge_type>
<source_obj>16</source_obj>
<sink_obj>20</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_143">
<id>194</id>
<edge_type>2</edge_type>
<source_obj>20</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_144">
<id>195</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>59</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_145">
<id>196</id>
<edge_type>2</edge_type>
<source_obj>26</source_obj>
<sink_obj>34</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_146">
<id>197</id>
<edge_type>2</edge_type>
<source_obj>34</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_147">
<id>198</id>
<edge_type>2</edge_type>
<source_obj>41</source_obj>
<sink_obj>56</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_148">
<id>199</id>
<edge_type>2</edge_type>
<source_obj>41</source_obj>
<sink_obj>53</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
<item class_id_reference="20" object_id="_149">
<id>200</id>
<edge_type>2</edge_type>
<source_obj>53</source_obj>
<sink_obj>41</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_150">
<id>201</id>
<edge_type>2</edge_type>
<source_obj>56</source_obj>
<sink_obj>26</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_151">
<id>202</id>
<edge_type>2</edge_type>
<source_obj>59</source_obj>
<sink_obj>16</sink_obj>
<is_back_edge>1</is_back_edge>
</item>
<item class_id_reference="20" object_id="_152">
<id>203</id>
<edge_type>4</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="_153">
<id>204</id>
<edge_type>4</edge_type>
<source_obj>29</source_obj>
<sink_obj>30</sink_obj>
<is_back_edge>0</is_back_edge>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_154">
<mId>1</mId>
<mTag>conv_2d_large_cl.1</mTag>
<mType>0</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>10</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>949548</mMinLatency>
<mMaxLatency>1945292</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_155">
<mId>2</mId>
<mTag>Entry</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>8</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="_156">
<mId>3</mId>
<mTag>HeightLoop</mTag>
<mType>1</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>4</item>
<item>5</item>
<item>9</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>29</mMinTripCount>
<mMaxTripCount>29</mMaxTripCount>
<mMinLatency>949547</mMinLatency>
<mMaxLatency>1945291</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_157">
<mId>4</mId>
<mTag>Region 1</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>16</item>
<item>20</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="_158">
<mId>5</mId>
<mTag>WidthLoop</mTag>
<mType>1</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>6</item>
<item>7</item>
<item>8</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>29</mMinTripCount>
<mMaxTripCount>29</mMaxTripCount>
<mMinLatency>32741</mMinLatency>
<mMaxLatency>67077</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_159">
<mId>6</mId>
<mTag>Region 2</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>26</item>
<item>34</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>2287</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_160">
<mId>7</mId>
<mTag>FiltLoop</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>41</item>
<item>53</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>8</mMinTripCount>
<mMaxTripCount>8</mMaxTripCount>
<mMinLatency>24</mMinLatency>
<mMaxLatency>24</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_161">
<mId>8</mId>
<mTag>Region 3</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_162">
<mId>9</mId>
<mTag>Region 4</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>59</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="_163">
<mId>10</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>61</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>0</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_164">
<states class_id="25" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_165">
<id>1</id>
<operations class_id="27" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="28" tracking_level="1" version="0" object_id="_166">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_167">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_168">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_169">
<id>2</id>
<operations>
<count>11</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_170">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_171">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_172">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_173">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_174">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_175">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_176">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_177">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_178">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_179">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_180">
<id>60</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_181">
<id>3</id>
<operations>
<count>8</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_182">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_183">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_184">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_185">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_186">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_187">
<id>29</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_188">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_189">
<id>58</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_190">
<id>4</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_191">
<id>29</id>
<stage>1</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_192">
<id>5</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_193">
<id>30</id>
<stage>2</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_194">
<id>6</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_195">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_196">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_197">
<id>30</id>
<stage>1</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_198">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_199">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_200">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_201">
<id>7</id>
<operations>
<count>14</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_202">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_203">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_204">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_205">
<id>38</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_206">
<id>39</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_207">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_208">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_209">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_210">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_211">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_212">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_213">
<id>49</id>
<stage>2</stage>
<latency>2</latency>
</item>
<item class_id_reference="28" object_id="_214">
<id>54</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_215">
<id>55</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_216">
<id>8</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_217">
<id>49</id>
<stage>1</stage>
<latency>2</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_218">
<id>9</id>
<operations>
<count>5</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_219">
<id>42</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_220">
<id>46</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_221">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_222">
<id>51</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_223">
<id>52</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>11</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_224">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>-1</id>
<sop class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_225">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item class_id="34" tracking_level="0" version="0">
<first class_id="35" tracking_level="0" version="0">
<first>12</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_226">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>22</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_227">
<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="30" object_id="_228">
<inState>5</inState>
<outState>6</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>0</count>
<item_version>0</item_version>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_229">
<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="30" object_id="_230">
<inState>7</inState>
<outState>8</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>37</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_231">
<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="30" object_id="_232">
<inState>9</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="30" object_id="_233">
<inState>7</inState>
<outState>3</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>37</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_234">
<inState>3</inState>
<outState>2</outState>
<condition>
<id>-1</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>22</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="-1"></res>
<node_label_latency class_id="37" tracking_level="0" version="0">
<count>37</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>5</first>
<second class_id="39" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>6</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>7</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>2</first>
<second>1</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>4</first>
<second>1</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>6</first>
<second>1</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>8</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>6</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="40" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="41" tracking_level="0" version="0">
<first>8</first>
<second class_id="42" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>2</first>
<second>5</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>6</first>
<second>6</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>6</first>
<second>8</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>6</first>
<second>6</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="43" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="44" tracking_level="0" version="0">
<count>27</count>
<item_version>0</item_version>
<item class_id="45" tracking_level="0" version="0">
<first>54</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>5</item>
</second>
</item>
<item>
<first>58</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>6</item>
</second>
</item>
<item>
<first>62</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>68</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>49</item>
<item>49</item>
</second>
</item>
<item>
<first>74</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>81</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>91</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>103</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>115</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>127</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>134</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>30</item>
<item>30</item>
</second>
</item>
<item>
<first>144</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>29</item>
<item>29</item>
</second>
</item>
<item>
<first>155</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>161</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>167</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>173</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>179</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>185</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>197</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>201</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>207</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>213</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>218</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>222</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>228</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>233</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="47" tracking_level="0" version="0">
<count>23</count>
<item_version>0</item_version>
<item class_id="48" tracking_level="0" version="0">
<first>data_col_V_alloca_fu_54</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>5</item>
</second>
</item>
<item>
<first>i_7_fu_167</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>i_phi_fu_91</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>j_1_fu_179</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>j_phi_fu_115</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>k_1_fu_207</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>k_cast4_cast_fu_197</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>k_phi_fu_127</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>next_mul_fu_155</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>phi_mul_phi_fu_103</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>res_V_addr_gep_fu_74</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>res_V_assign_addr_gep_fu_62</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>res_V_assign_alloca_fu_58</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>6</item>
</second>
</item>
<item>
<first>tmp1_cast_fu_218</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>tmp1_fu_213</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>tmp_135_cast_cast_fu_193</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>tmp_77_fu_185</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>tmp_78_fu_201</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>tmp_79_fu_222</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>tmp_80_fu_233</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>tmp_81_fu_228</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>tmp_fu_161</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>tmp_s_fu_173</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>2</count>
<item_version>0</item_version>
<item>
<first>grp_dense_large_rf_gt_ni_1_fu_134</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>30</item>
<item>30</item>
</second>
</item>
<item>
<first>grp_im2col_2d_cl_1_fu_144</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>29</item>
<item>29</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="49" tracking_level="0" version="0">
<count>5</count>
<item_version>0</item_version>
<item class_id="50" tracking_level="0" version="0">
<first class_id="51" tracking_level="0" version="0">
<first>outidx7</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>
<first>res_V</first>
<second>0</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>
<first>res_V_assign</first>
<second>0</second>
</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>49</item>
<item>49</item>
</second>
</item>
<item>
<first>
<first>res_V_assign</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>
<first>w3_V</first>
<second>100</second>
</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>12</count>
<item_version>0</item_version>
<item>
<first>87</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>99</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>111</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>123</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>237</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>245</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>253</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>258</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>266</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>271</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>276</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>281</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>12</count>
<item_version>0</item_version>
<item>
<first>i_7_reg_245</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>14</item>
</second>
</item>
<item>
<first>i_reg_87</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>j_1_reg_253</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>24</item>
</second>
</item>
<item>
<first>j_reg_111</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>k_1_reg_266</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>k_reg_123</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>next_mul_reg_237</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>phi_mul_reg_99</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>res_V_assign_addr_reg_276</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>res_V_assign_load_reg_281</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>tmp_135_cast_cast_reg_258</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>tmp_79_reg_271</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>4</count>
<item_version>0</item_version>
<item>
<first>87</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>99</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>111</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>123</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>4</count>
<item_version>0</item_version>
<item>
<first>i_reg_87</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>j_reg_111</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>k_reg_123</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>phi_mul_reg_99</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="52" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="53" tracking_level="0" version="0">
<first>res_V(p0)</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>store</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="54" tracking_level="0" version="0">
<count>2</count>
<item_version>0</item_version>
<item class_id="55" tracking_level="0" version="0">
<first>1</first>
<second>RAM</second>
</item>
<item>
<first>2</first>
<second>RAM</second>
</item>
</port2core>
<node2core>
<count>2</count>
<item_version>0</item_version>
<item>
<first>5</first>
<second>RAM</second>
</item>
<item>
<first>6</first>
<second>RAM</second>
</item>
</node2core>
</syndb>
</boost_serialization>
| 27.613485 | 160 | 0.606828 |
2ecd2f2d17aa4233c969d467854eda2986f732e6 | 4,323 | ads | Ada | tools/scitools/conf/understand/ada/ada05/g-traceb.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/g-traceb.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada05/g-traceb.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- G N A T . T R A C E B A C K --
-- --
-- S p e c --
-- --
-- Copyright (C) 1999-2005, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
--
--
--
--
--
--
--
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Run-time non-symbolic traceback support
-- This package provides a method for generating a traceback of the
-- current execution location. The traceback shows the locations of
-- calls in the call chain, up to either the top or a designated
-- number of levels.
-- The traceback information is in the form of absolute code locations.
-- These code locations may be converted to corresponding source locations
-- using the external addr2line utility, or from within GDB.
-- In order to use this facility, in some cases the binder must be invoked
-- with -E switch (store the backtrace with exception occurence). Please
-- refer to gnatbind documentation for more information.
-- To analyze the code locations later using addr2line or gdb, the necessary
-- units must be compiled with the debugging switch -g in the usual manner.
-- Note that it is not necessary to compile with -g to use Call_Chain. In
-- other words, the following sequence of steps can be used:
-- Compile without -g
-- Run the program, and call Call_Chain
-- Recompile with -g
-- Use addr2line to interpret the absolute call locations (note that
-- addr2line expects addresses in hexadecimal format).
-- This capability is currently supported on the following targets:
-- All x86 ports
-- AiX PowerPC
-- HP-UX
-- Irix
-- Solaris sparc
-- Tru64
-- VxWorks PowerPC
-- VxWorks Alpha
with System;
with Ada.Exceptions.Traceback;
package GNAT.Traceback is
pragma Elaborate_Body;
subtype Code_Loc is System.Address;
-- Code location used in building tracebacks
subtype Tracebacks_Array is Ada.Exceptions.Traceback.Tracebacks_Array;
-- Traceback array used to hold a generated traceback list
----------------
-- Call_Chain --
----------------
procedure Call_Chain (Traceback : out Tracebacks_Array; Len : out Natural);
-- Store up to Traceback'Length tracebacks corresponding to the current
-- call chain. The first entry stored corresponds to the deepest level
-- of subprogram calls. Len shows the number of traceback entries stored.
-- It will be equal to Traceback'Length unless the entire traceback is
-- shorter, in which case positions in Traceback past the Len position
-- are undefined on return.
end GNAT.Traceback;
| 45.03125 | 78 | 0.551238 |
2ef349aab2d1284a057a9eba237f85b61a3645da | 80,856 | adb | Ada | fpga/wave/.autopilot/db/in_structure.sched.adb | dorin-ionita/RustHPC | 903e5dd8f09213a5cc33f5e651d687e234944e84 | [
"MIT"
] | 2 | 2021-06-22T19:23:55.000Z | 2021-07-03T16:47:01.000Z | fpga/wave/.autopilot/db/in_structure.sched.adb | dorin-ionita/RustHPC | 903e5dd8f09213a5cc33f5e651d687e234944e84 | [
"MIT"
] | 60 | 2019-11-05T14:12:34.000Z | 2021-06-21T22:31:17.000Z | fpga/wave/.autopilot/db/in_structure.sched.adb | dorin-ionita/wireless-models-experiments | 903e5dd8f09213a5cc33f5e651d687e234944e84 | [
"MIT"
] | null | null | null | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="14">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>in_structure</name>
<ret_bitwidth>1</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>x</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>x</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>y</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>y</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="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>scenario_nr_struct</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>
<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>scenario_structure_c</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>
<direction>0</direction>
<if_type>1</if_type>
<array_size>80</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>37</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>5</id>
<name>y_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>y</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>52</item>
<item>53</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>6</id>
<name>x_read</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>x</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>54</item>
<item>55</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>7</id>
<name>scenario_nr_struct_l</name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>72</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>/home/dorin</first>
<second class_id="12" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="13" tracking_level="0" version="0">
<first class_id="14" tracking_level="0" version="0">
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>72</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>56</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name></name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>72</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>72</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>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>i</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>31</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>59</item>
<item>60</item>
<item>61</item>
<item>62</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>i_cast</name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>72</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>72</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>63</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>tmp</name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>72</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>72</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>64</item>
<item>65</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>i_8</name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>72</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>72</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>i</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>31</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>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name></name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>72</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>72</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>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>tmp_s</name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>72</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>72</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>34</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>73</item>
<item>74</item>
<item>76</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>17</id>
<name>tmp_283</name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>74</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>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>scenario_structure_c</name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</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>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>tmp_284</name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>72</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>72</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>34</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>82</item>
<item>84</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>tmp_285</name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>86</item>
<item>88</item>
<item>89</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>scenario_structure_c_34</name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>90</item>
<item>91</item>
<item>92</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>tmp_286</name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>72</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>72</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>34</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>93</item>
<item>95</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>tmp_287</name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>96</item>
<item>97</item>
<item>98</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>scenario_structure_c_35</name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>99</item>
<item>100</item>
<item>101</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>tmp_288</name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>72</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>72</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>34</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>102</item>
<item>104</item>
</oprand_edges>
<opcode>or</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>tmp_289</name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>64</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>105</item>
<item>106</item>
<item>107</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>scenario_structure_c_36</name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>108</item>
<item>109</item>
<item>110</item>
</oprand_edges>
<opcode>getelementptr</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>scenario_structure_c_37</name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>74</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>111</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>tmp_160</name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>74</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>112</item>
<item>113</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name></name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>74</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>114</item>
<item>115</item>
<item>116</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>scenario_structure_c_38</name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>74</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>117</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>tmp_161</name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>74</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>118</item>
<item>119</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name></name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>74</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>74</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>120</item>
<item>121</item>
<item>122</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>scenario_structure_c_39</name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>75</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>123</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>tmp_162</name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>75</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>124</item>
<item>125</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name></name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>75</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>126</item>
<item>127</item>
<item>128</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>scenario_structure_c_40</name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>75</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>129</item>
</oprand_edges>
<opcode>load</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>tmp_163</name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>75</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>130</item>
<item>131</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name></name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>75</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>132</item>
<item>133</item>
<item>134</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name></name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>76</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>76</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>135</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name></name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>72</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>72</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>136</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>p_0</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>138</item>
<item>139</item>
<item>141</item>
<item>142</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name></name>
<fileName>wave2/.apc/main.c</fileName>
<fileDirectory>/home/dorin</fileDirectory>
<lineNumber>79</lineNumber>
<contextFuncName>in_structure</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dorin</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>wave2/.apc/main.c</first>
<second>in_structure</second>
</first>
<second>79</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>143</item>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_42">
<Value>
<Obj>
<type>2</type>
<id>58</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>31</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_43">
<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>31</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_44">
<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>3</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_45">
<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="_46">
<Value>
<Obj>
<type>2</type>
<id>83</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>34</bitwidth>
</Value>
<const_type>0</const_type>
<content>6</content>
</item>
<item class_id_reference="16" object_id="_47">
<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>30</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_48">
<Value>
<Obj>
<type>2</type>
<id>94</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>34</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_49">
<Value>
<Obj>
<type>2</type>
<id>103</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>34</bitwidth>
</Value>
<const_type>0</const_type>
<content>3</content>
</item>
<item class_id_reference="16" object_id="_50">
<Value>
<Obj>
<type>2</type>
<id>137</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>1</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_51">
<Value>
<Obj>
<type>2</type>
<id>140</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>1</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_52">
<Obj>
<type>3</type>
<id>9</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>4</count>
<item_version>0</item_version>
<item>5</item>
<item>6</item>
<item>7</item>
<item>8</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_53">
<Obj>
<type>3</type>
<id>15</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>5</count>
<item_version>0</item_version>
<item>10</item>
<item>11</item>
<item>12</item>
<item>13</item>
<item>14</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_54">
<Obj>
<type>3</type>
<id>31</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>15</count>
<item_version>0</item_version>
<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>
</node_objs>
</item>
<item class_id_reference="18" object_id="_55">
<Obj>
<type>3</type>
<id>35</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>32</item>
<item>33</item>
<item>34</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_56">
<Obj>
<type>3</type>
<id>39</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>36</item>
<item>37</item>
<item>38</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_57">
<Obj>
<type>3</type>
<id>43</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>40</item>
<item>41</item>
<item>42</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_58">
<Obj>
<type>3</type>
<id>45</id>
<name>._crit_edge3</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>44</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_59">
<Obj>
<type>3</type>
<id>47</id>
<name>._crit_edge1</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>46</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_60">
<Obj>
<type>3</type>
<id>50</id>
<name>._crit_edge</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>48</item>
<item>49</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>87</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_61">
<id>53</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>5</sink_obj>
</item>
<item class_id_reference="20" object_id="_62">
<id>55</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>6</sink_obj>
</item>
<item class_id_reference="20" object_id="_63">
<id>56</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>7</sink_obj>
</item>
<item class_id_reference="20" object_id="_64">
<id>57</id>
<edge_type>2</edge_type>
<source_obj>15</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_65">
<id>59</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_66">
<id>60</id>
<edge_type>2</edge_type>
<source_obj>9</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_67">
<id>61</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_68">
<id>62</id>
<edge_type>2</edge_type>
<source_obj>47</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_69">
<id>63</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_70">
<id>64</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_71">
<id>65</id>
<edge_type>1</edge_type>
<source_obj>7</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_72">
<id>66</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_73">
<id>68</id>
<edge_type>1</edge_type>
<source_obj>67</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_74">
<id>69</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_75">
<id>70</id>
<edge_type>2</edge_type>
<source_obj>50</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_76">
<id>71</id>
<edge_type>2</edge_type>
<source_obj>31</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_77">
<id>74</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_78">
<id>76</id>
<edge_type>1</edge_type>
<source_obj>75</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_79">
<id>77</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_80">
<id>78</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_81">
<id>80</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_82">
<id>81</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_83">
<id>82</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_84">
<id>84</id>
<edge_type>1</edge_type>
<source_obj>83</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_85">
<id>88</id>
<edge_type>1</edge_type>
<source_obj>87</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_86">
<id>89</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_87">
<id>90</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_88">
<id>91</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_89">
<id>92</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_90">
<id>93</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_91">
<id>95</id>
<edge_type>1</edge_type>
<source_obj>94</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_92">
<id>97</id>
<edge_type>1</edge_type>
<source_obj>87</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_93">
<id>98</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_94">
<id>99</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_95">
<id>100</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_96">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_97">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_98">
<id>104</id>
<edge_type>1</edge_type>
<source_obj>103</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_99">
<id>106</id>
<edge_type>1</edge_type>
<source_obj>87</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_100">
<id>107</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_101">
<id>108</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_102">
<id>109</id>
<edge_type>1</edge_type>
<source_obj>79</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_103">
<id>110</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_104">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_105">
<id>112</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_106">
<id>113</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_107">
<id>114</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_108">
<id>115</id>
<edge_type>2</edge_type>
<source_obj>47</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_109">
<id>116</id>
<edge_type>2</edge_type>
<source_obj>35</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_110">
<id>117</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_111">
<id>118</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_112">
<id>119</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_113">
<id>120</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_114">
<id>121</id>
<edge_type>2</edge_type>
<source_obj>47</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_115">
<id>122</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_116">
<id>123</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_117">
<id>124</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_118">
<id>125</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_119">
<id>126</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_120">
<id>127</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_121">
<id>128</id>
<edge_type>2</edge_type>
<source_obj>43</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_122">
<id>129</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_123">
<id>130</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_124">
<id>131</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_125">
<id>132</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_126">
<id>133</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_127">
<id>134</id>
<edge_type>2</edge_type>
<source_obj>50</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_128">
<id>135</id>
<edge_type>2</edge_type>
<source_obj>47</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_129">
<id>136</id>
<edge_type>2</edge_type>
<source_obj>15</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_130">
<id>138</id>
<edge_type>1</edge_type>
<source_obj>137</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_131">
<id>139</id>
<edge_type>2</edge_type>
<source_obj>15</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_132">
<id>141</id>
<edge_type>1</edge_type>
<source_obj>140</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_133">
<id>142</id>
<edge_type>2</edge_type>
<source_obj>43</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_134">
<id>143</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_135">
<id>144</id>
<edge_type>2</edge_type>
<source_obj>9</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_136">
<id>145</id>
<edge_type>2</edge_type>
<source_obj>15</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_137">
<id>146</id>
<edge_type>2</edge_type>
<source_obj>15</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_138">
<id>147</id>
<edge_type>2</edge_type>
<source_obj>31</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_139">
<id>148</id>
<edge_type>2</edge_type>
<source_obj>31</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_140">
<id>149</id>
<edge_type>2</edge_type>
<source_obj>35</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_141">
<id>150</id>
<edge_type>2</edge_type>
<source_obj>35</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_142">
<id>151</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_143">
<id>152</id>
<edge_type>2</edge_type>
<source_obj>39</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_144">
<id>153</id>
<edge_type>2</edge_type>
<source_obj>43</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_145">
<id>154</id>
<edge_type>2</edge_type>
<source_obj>43</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_146">
<id>155</id>
<edge_type>2</edge_type>
<source_obj>45</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_147">
<id>156</id>
<edge_type>2</edge_type>
<source_obj>47</source_obj>
<sink_obj>15</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="21" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="22" tracking_level="1" version="0" object_id="_148">
<mId>1</mId>
<mTag>in_structure</mTag>
<mType>0</mType>
<sub_regions>
<count>3</count>
<item_version>0</item_version>
<item>2</item>
<item>3</item>
<item>4</item>
</sub_regions>
<basic_blocks>
<count>0</count>
<item_version>0</item_version>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>-1</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_149">
<mId>2</mId>
<mTag>Entry</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_150">
<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>7</count>
<item_version>0</item_version>
<item>15</item>
<item>31</item>
<item>35</item>
<item>39</item>
<item>43</item>
<item>45</item>
<item>47</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>-1</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_151">
<mId>4</mId>
<mTag>Return</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></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>37</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>5</first>
<second class_id="28" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>6</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>7</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>8</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>12</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>18</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>19</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>20</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>21</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>2</first>
<second>1</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>3</first>
<second>1</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>4</first>
<second>1</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="29" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="0" version="0">
<first>9</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>1</first>
<second>2</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>2</first>
<second>3</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>3</first>
<second>4</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>4</first>
<second>5</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>5</first>
<second>5</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>5</first>
<second>5</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>5</first>
<second>5</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="32" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="33" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="34" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="35" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_reg_nodes>
<dp_regname_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="36" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 25.571157 | 70 | 0.580192 |
1a1308c7b1f8daf204dd57b5709c591cddd2f8ee | 7,765 | adb | Ada | source/amf/uml/amf-internals-tables-umldi_notification.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-umldi_notification.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-umldi_notification.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.CMOF.Properties;
with AMF.Internals.Helpers;
with AMF.Internals.Listener_Registry;
with AMF.UMLDI.Holders.UML_Association_Or_Connector_Or_Link_Shape_Kinds;
with AMF.UMLDI.Holders.UML_Interaction_Table_Label_Kinds;
with AMF.UMLDI.Holders.UML_Interaction_Diagram_Kinds;
with AMF.UMLDI.Holders.UML_Navigability_Notation_Kinds;
package body AMF.Internals.Tables.UMLDI_Notification is
--------------------------
-- Notify_Attribute_Set --
--------------------------
procedure Notify_Attribute_Set
(Element : AMF.Internals.AMF_Element;
Property : AMF.Internals.CMOF_Element;
Old_Value : AMF.UMLDI.UMLDI_UML_Association_Or_Connector_Or_Link_Shape_Kind;
New_Value : AMF.UMLDI.UMLDI_UML_Association_Or_Connector_Or_Link_Shape_Kind) is
begin
AMF.Internals.Listener_Registry.Notify_Attribute_Set
(AMF.Internals.Helpers.To_Element (Element),
AMF.CMOF.Properties.CMOF_Property_Access
(AMF.Internals.Helpers.To_Element (Property)),
(Is_Empty => True),
AMF.UMLDI.Holders.UML_Association_Or_Connector_Or_Link_Shape_Kinds.To_Holder (Old_Value),
AMF.UMLDI.Holders.UML_Association_Or_Connector_Or_Link_Shape_Kinds.To_Holder (New_Value));
end Notify_Attribute_Set;
--------------------------
-- Notify_Attribute_Set --
--------------------------
procedure Notify_Attribute_Set
(Element : AMF.Internals.AMF_Element;
Property : AMF.Internals.CMOF_Element;
Old_Value : AMF.UMLDI.Optional_UMLDI_UML_Inherited_State_Border_Kind;
New_Value : AMF.UMLDI.Optional_UMLDI_UML_Inherited_State_Border_Kind) is
begin
AMF.Internals.Listener_Registry.Notify_Attribute_Set
(AMF.Internals.Helpers.To_Element (Element),
AMF.CMOF.Properties.CMOF_Property_Access
(AMF.Internals.Helpers.To_Element (Property)),
(Is_Empty => True),
AMF.UMLDI.Holders.To_Holder (Old_Value),
AMF.UMLDI.Holders.To_Holder (New_Value));
end Notify_Attribute_Set;
--------------------------
-- Notify_Attribute_Set --
--------------------------
procedure Notify_Attribute_Set
(Element : AMF.Internals.AMF_Element;
Property : AMF.Internals.CMOF_Element;
Old_Value : AMF.UMLDI.UMLDI_UML_Interaction_Table_Label_Kind;
New_Value : AMF.UMLDI.UMLDI_UML_Interaction_Table_Label_Kind) is
begin
AMF.Internals.Listener_Registry.Notify_Attribute_Set
(AMF.Internals.Helpers.To_Element (Element),
AMF.CMOF.Properties.CMOF_Property_Access
(AMF.Internals.Helpers.To_Element (Property)),
(Is_Empty => True),
AMF.UMLDI.Holders.UML_Interaction_Table_Label_Kinds.To_Holder (Old_Value),
AMF.UMLDI.Holders.UML_Interaction_Table_Label_Kinds.To_Holder (New_Value));
end Notify_Attribute_Set;
--------------------------
-- Notify_Attribute_Set --
--------------------------
procedure Notify_Attribute_Set
(Element : AMF.Internals.AMF_Element;
Property : AMF.Internals.CMOF_Element;
Old_Value : AMF.UMLDI.UMLDI_UML_Interaction_Diagram_Kind;
New_Value : AMF.UMLDI.UMLDI_UML_Interaction_Diagram_Kind) is
begin
AMF.Internals.Listener_Registry.Notify_Attribute_Set
(AMF.Internals.Helpers.To_Element (Element),
AMF.CMOF.Properties.CMOF_Property_Access
(AMF.Internals.Helpers.To_Element (Property)),
(Is_Empty => True),
AMF.UMLDI.Holders.UML_Interaction_Diagram_Kinds.To_Holder (Old_Value),
AMF.UMLDI.Holders.UML_Interaction_Diagram_Kinds.To_Holder (New_Value));
end Notify_Attribute_Set;
--------------------------
-- Notify_Attribute_Set --
--------------------------
procedure Notify_Attribute_Set
(Element : AMF.Internals.AMF_Element;
Property : AMF.Internals.CMOF_Element;
Old_Value : AMF.UMLDI.UMLDI_UML_Navigability_Notation_Kind;
New_Value : AMF.UMLDI.UMLDI_UML_Navigability_Notation_Kind) is
begin
AMF.Internals.Listener_Registry.Notify_Attribute_Set
(AMF.Internals.Helpers.To_Element (Element),
AMF.CMOF.Properties.CMOF_Property_Access
(AMF.Internals.Helpers.To_Element (Property)),
(Is_Empty => True),
AMF.UMLDI.Holders.UML_Navigability_Notation_Kinds.To_Holder (Old_Value),
AMF.UMLDI.Holders.UML_Navigability_Notation_Kinds.To_Holder (New_Value));
end Notify_Attribute_Set;
end AMF.Internals.Tables.UMLDI_Notification;
| 51.766667 | 98 | 0.570895 |
57c4ea906c1a0344b9547a96e12fc489eb651f94 | 1,595 | ada | Ada | Task/Anagrams-Deranged-anagrams/Ada/anagrams-deranged-anagrams.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:38.000Z | 2018-11-09T22:08:38.000Z | Task/Anagrams-Deranged-anagrams/Ada/anagrams-deranged-anagrams.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/Anagrams-Deranged-anagrams/Ada/anagrams-deranged-anagrams.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:40.000Z | 2018-11-09T22:08:40.000Z | with Ada.Text_IO; use Ada.Text_IO;
with Ada.Containers.Generic_Array_Sort;
with Ada.Containers.Indefinite_Vectors;
procedure Danagrams is
package StringVector is new Ada.Containers.Indefinite_Vectors
(Positive, String);
procedure StrSort is new Ada.Containers.Generic_Array_Sort
(Index_Type => Positive,
Element_Type => Character,
Array_Type => String);
function Derange (s1 : String; s2 : String) return Boolean is begin
for i in s1'Range loop
if (s1 (i) = s2 (i)) then return False; end if;
end loop;
return True;
end Derange;
File : File_Type;
len, foundlen : Positive := 1;
Vect, SVect : StringVector.Vector;
index, p1, p2 : StringVector.Extended_Index := 0;
begin
Open (File, In_File, "unixdict.txt");
while not End_Of_File (File) loop
declare str : String := Get_Line (File);
begin
len := str'Length;
if len > foundlen then
Vect.Append (str);
StrSort (str);
index := 0;
loop -- Loop through anagrams by index in vector of sorted strings
index := SVect.Find_Index (str, index + 1);
exit when index = StringVector.No_Index;
if Derange (Vect.Last_Element, Vect.Element (index)) then
p1 := Vect.Last_Index; p2 := index;
foundlen := len;
end if;
end loop;
SVect.Append (str);
end if;
end;
end loop;
Close (File);
Put_Line (Vect.Element (p1) & " " & Vect.Element (p2));
end Danagrams;
| 34.673913 | 79 | 0.596238 |
ad2abab5e7eb2c76d540cc00561d5415a5ec0227 | 1,094 | ads | Ada | src/keystore-passwords-cmds.ads | thierr26/ada-keystore | 25099a9df3ce9b48a401148eb1b84442011759a0 | [
"Apache-2.0"
] | null | null | null | src/keystore-passwords-cmds.ads | thierr26/ada-keystore | 25099a9df3ce9b48a401148eb1b84442011759a0 | [
"Apache-2.0"
] | null | null | null | src/keystore-passwords-cmds.ads | thierr26/ada-keystore | 25099a9df3ce9b48a401148eb1b84442011759a0 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- keystore-passwords-cmds -- External command based password provider
-- 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.
-----------------------------------------------------------------------
package Keystore.Passwords.Cmds is
-- Create a password provider that reads runs a command to get the password.
function Create (Command : in String) return Provider_Access;
end Keystore.Passwords.Cmds;
| 43.76 | 80 | 0.648995 |
4124328b0d9d271b6a00d6ada8f2bed0b6391251 | 5,426 | ads | Ada | source/amf/uml/amf-uml-deployment_specifications-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-uml-deployment_specifications-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-uml-deployment_specifications-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Generic_Collections;
package AMF.UML.Deployment_Specifications.Collections is
pragma Preelaborate;
package UML_Deployment_Specification_Collections is
new AMF.Generic_Collections
(UML_Deployment_Specification,
UML_Deployment_Specification_Access);
type Set_Of_UML_Deployment_Specification is
new UML_Deployment_Specification_Collections.Set with null record;
Empty_Set_Of_UML_Deployment_Specification : constant Set_Of_UML_Deployment_Specification;
type Ordered_Set_Of_UML_Deployment_Specification is
new UML_Deployment_Specification_Collections.Ordered_Set with null record;
Empty_Ordered_Set_Of_UML_Deployment_Specification : constant Ordered_Set_Of_UML_Deployment_Specification;
type Bag_Of_UML_Deployment_Specification is
new UML_Deployment_Specification_Collections.Bag with null record;
Empty_Bag_Of_UML_Deployment_Specification : constant Bag_Of_UML_Deployment_Specification;
type Sequence_Of_UML_Deployment_Specification is
new UML_Deployment_Specification_Collections.Sequence with null record;
Empty_Sequence_Of_UML_Deployment_Specification : constant Sequence_Of_UML_Deployment_Specification;
private
Empty_Set_Of_UML_Deployment_Specification : constant Set_Of_UML_Deployment_Specification
:= (UML_Deployment_Specification_Collections.Set with null record);
Empty_Ordered_Set_Of_UML_Deployment_Specification : constant Ordered_Set_Of_UML_Deployment_Specification
:= (UML_Deployment_Specification_Collections.Ordered_Set with null record);
Empty_Bag_Of_UML_Deployment_Specification : constant Bag_Of_UML_Deployment_Specification
:= (UML_Deployment_Specification_Collections.Bag with null record);
Empty_Sequence_Of_UML_Deployment_Specification : constant Sequence_Of_UML_Deployment_Specification
:= (UML_Deployment_Specification_Collections.Sequence with null record);
end AMF.UML.Deployment_Specifications.Collections;
| 58.978261 | 108 | 0.554184 |
ad62137acaefcbc7c50c36065daa548e42a93423 | 614 | ads | Ada | test/src/test_keyboard_window.ads | Fabien-Chouteau/Giza | 9f6c167666dbba8f0e5f0ba3e33825c0b3f399bd | [
"BSD-3-Clause"
] | 7 | 2017-10-18T02:40:24.000Z | 2020-12-19T22:41:19.000Z | test/src/test_keyboard_window.ads | Fabien-Chouteau/Giza | 9f6c167666dbba8f0e5f0ba3e33825c0b3f399bd | [
"BSD-3-Clause"
] | null | null | null | test/src/test_keyboard_window.ads | Fabien-Chouteau/Giza | 9f6c167666dbba8f0e5f0ba3e33825c0b3f399bd | [
"BSD-3-Clause"
] | 2 | 2019-05-06T08:30:26.000Z | 2020-11-22T11:27:27.000Z | with Basic_Test_Window; use Basic_Test_Window;
with Giza.Widget.Keyboards;
package Test_Keyboard_Window is
type Keyboard_Window is new Test_Window with private;
type Keyboard_Window_Ref is access all Keyboard_Window;
overriding
procedure On_Init (This : in out Keyboard_Window);
overriding
procedure On_Displayed (This : in out Keyboard_Window) is null;
overriding
procedure On_Hidden (This : in out Keyboard_Window) is null;
private
type Keyboard_Window is new Test_Window with record
Keyboard : aliased Giza.Widget.Keyboards.Instance;
end record;
end Test_Keyboard_Window;
| 30.7 | 66 | 0.786645 |
ad83af4b8cfbb8530fb0212931988d2ea97b041e | 7,624 | adb | Ada | source/nodes/program-nodes-package_instantiations.adb | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/nodes/program-nodes-package_instantiations.adb | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | null | null | null | source/nodes/program-nodes-package_instantiations.adb | reznikmm/gela | 20134f1d154fb763812e73860c6f4b04f353df79 | [
"MIT"
] | 1 | 2019-10-16T09:05:27.000Z | 2019-10-16T09:05:27.000Z | -- SPDX-FileCopyrightText: 2019 Max Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-------------------------------------------------------------
package body Program.Nodes.Package_Instantiations is
function Create
(Package_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Name : not null Program.Elements.Defining_Names
.Defining_Name_Access;
Is_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
New_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Generic_Package_Name : not null Program.Elements.Expressions
.Expression_Access;
Left_Bracket_Token : Program.Lexical_Elements.Lexical_Element_Access;
Parameters : Program.Elements.Parameter_Associations
.Parameter_Association_Vector_Access;
Right_Bracket_Token : Program.Lexical_Elements.Lexical_Element_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 Package_Instantiation is
begin
return Result : Package_Instantiation :=
(Package_Token => Package_Token, Name => Name, Is_Token => Is_Token,
New_Token => New_Token, Generic_Package_Name => Generic_Package_Name,
Left_Bracket_Token => Left_Bracket_Token, Parameters => Parameters,
Right_Bracket_Token => Right_Bracket_Token, 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;
Generic_Package_Name : not null Program.Elements.Expressions
.Expression_Access;
Parameters : Program.Elements.Parameter_Associations
.Parameter_Association_Vector_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_Package_Instantiation is
begin
return Result : Implicit_Package_Instantiation :=
(Name => Name, Generic_Package_Name => Generic_Package_Name,
Parameters => Parameters, 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_Package_Instantiation)
return not null Program.Elements.Defining_Names.Defining_Name_Access is
begin
return Self.Name;
end Name;
overriding function Generic_Package_Name
(Self : Base_Package_Instantiation)
return not null Program.Elements.Expressions.Expression_Access is
begin
return Self.Generic_Package_Name;
end Generic_Package_Name;
overriding function Parameters
(Self : Base_Package_Instantiation)
return Program.Elements.Parameter_Associations
.Parameter_Association_Vector_Access is
begin
return Self.Parameters;
end Parameters;
overriding function Aspects
(Self : Base_Package_Instantiation)
return Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access is
begin
return Self.Aspects;
end Aspects;
overriding function Package_Token
(Self : Package_Instantiation)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Package_Token;
end Package_Token;
overriding function Is_Token
(Self : Package_Instantiation)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Is_Token;
end Is_Token;
overriding function New_Token
(Self : Package_Instantiation)
return not null Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.New_Token;
end New_Token;
overriding function Left_Bracket_Token
(Self : Package_Instantiation)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Left_Bracket_Token;
end Left_Bracket_Token;
overriding function Right_Bracket_Token
(Self : Package_Instantiation)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.Right_Bracket_Token;
end Right_Bracket_Token;
overriding function With_Token
(Self : Package_Instantiation)
return Program.Lexical_Elements.Lexical_Element_Access is
begin
return Self.With_Token;
end With_Token;
overriding function Semicolon_Token
(Self : Package_Instantiation)
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_Package_Instantiation)
return Boolean is
begin
return Self.Is_Part_Of_Implicit;
end Is_Part_Of_Implicit;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Package_Instantiation)
return Boolean is
begin
return Self.Is_Part_Of_Inherited;
end Is_Part_Of_Inherited;
overriding function Is_Part_Of_Instance
(Self : Implicit_Package_Instantiation)
return Boolean is
begin
return Self.Is_Part_Of_Instance;
end Is_Part_Of_Instance;
procedure Initialize (Self : in out Base_Package_Instantiation'Class) is
begin
Set_Enclosing_Element (Self.Name, Self'Unchecked_Access);
Set_Enclosing_Element (Self.Generic_Package_Name, Self'Unchecked_Access);
for Item in Self.Parameters.Each_Element loop
Set_Enclosing_Element (Item.Element, Self'Unchecked_Access);
end loop;
for Item in Self.Aspects.Each_Element loop
Set_Enclosing_Element (Item.Element, Self'Unchecked_Access);
end loop;
null;
end Initialize;
overriding function Is_Package_Instantiation
(Self : Base_Package_Instantiation)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Package_Instantiation;
overriding function Is_Declaration
(Self : Base_Package_Instantiation)
return Boolean is
pragma Unreferenced (Self);
begin
return True;
end Is_Declaration;
overriding procedure Visit
(Self : not null access Base_Package_Instantiation;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is
begin
Visitor.Package_Instantiation (Self);
end Visit;
overriding function To_Package_Instantiation_Text
(Self : in out Package_Instantiation)
return Program.Elements.Package_Instantiations
.Package_Instantiation_Text_Access is
begin
return Self'Unchecked_Access;
end To_Package_Instantiation_Text;
overriding function To_Package_Instantiation_Text
(Self : in out Implicit_Package_Instantiation)
return Program.Elements.Package_Instantiations
.Package_Instantiation_Text_Access is
pragma Unreferenced (Self);
begin
return null;
end To_Package_Instantiation_Text;
end Program.Nodes.Package_Instantiations;
| 34.497738 | 79 | 0.723111 |
2ef1cf6e5acb6218de2bc5dc0138cd850ad68223 | 5,467 | ads | Ada | source/league/league-regexps.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/league/league-regexps.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/league/league-regexps.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 © 2010, 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$
------------------------------------------------------------------------------
private with Ada.Finalization;
with League.Strings;
private with Matreshka.Internals.Regexps;
package League.Regexps is
pragma Preelaborate;
type Regexp_Pattern is tagged private;
pragma Preelaborable_Initialization (Regexp_Pattern);
type Regexp_Match is tagged private;
pragma Preelaborable_Initialization (Regexp_Match);
--------------------
-- Regexp_Pattern --
--------------------
function Compile
(Expression : League.Strings.Universal_String'Class) return Regexp_Pattern;
function Find_Match
(Self : Regexp_Pattern'Class;
String : League.Strings.Universal_String'Class)
return Regexp_Match;
------------------
-- Regexp_Match --
------------------
function Is_Matched (Self : Regexp_Match'Class) return Boolean;
function Capture_Count (Self : Regexp_Match'Class) return Natural;
function Capture
(Self : Regexp_Match'Class) return League.Strings.Universal_String;
function Capture
(Self : Regexp_Match'Class;
Number : Positive) return League.Strings.Universal_String;
function First_Index (Self : Regexp_Match'Class) return Positive;
function First_Index
(Self : Regexp_Match'Class;
Number : Positive) return Natural;
function Last_Index (Self : Regexp_Match'Class) return Natural;
function Last_Index
(Self : Regexp_Match'Class;
Number : Positive) return Natural;
private
type Regexp_Pattern is new Ada.Finalization.Controlled with record
Shared : Matreshka.Internals.Regexps.Shared_Pattern_Access
:= Matreshka.Internals.Regexps.Empty_Shared_Pattern'Access;
end record;
overriding procedure Adjust (Self : in out Regexp_Pattern);
overriding procedure Finalize (Self : in out Regexp_Pattern);
type Regexp_Match is new Ada.Finalization.Controlled with record
Shared : Matreshka.Internals.Regexps.Shared_Match_Access
:= Matreshka.Internals.Regexps.Empty_Shared_Match'Access;
end record;
overriding procedure Adjust (Self : in out Regexp_Match);
overriding procedure Finalize (Self : in out Regexp_Match);
end League.Regexps;
| 46.726496 | 79 | 0.522773 |
41c628d3b74cde8384d933d56f3549ab7bf698d0 | 4,187 | ads | Ada | source/amf/ocl/amf-ocl-call_exps.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/ocl/amf-ocl-call_exps.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/ocl/amf-ocl-call_exps.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012-2013, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.OCL.Ocl_Expressions;
package AMF.OCL.Call_Exps is
pragma Preelaborate;
type OCL_Call_Exp is limited interface
and AMF.OCL.Ocl_Expressions.OCL_Ocl_Expression;
type OCL_Call_Exp_Access is
access all OCL_Call_Exp'Class;
for OCL_Call_Exp_Access'Storage_Size use 0;
not overriding function Get_Source
(Self : not null access constant OCL_Call_Exp)
return AMF.OCL.Ocl_Expressions.OCL_Ocl_Expression_Access is abstract;
-- Getter of CallExp::source.
--
not overriding procedure Set_Source
(Self : not null access OCL_Call_Exp;
To : AMF.OCL.Ocl_Expressions.OCL_Ocl_Expression_Access) is abstract;
-- Setter of CallExp::source.
--
end AMF.OCL.Call_Exps;
| 58.152778 | 78 | 0.446382 |
395201ae75ced1a97c188c5f38a130a1f6f41d71 | 1,652 | adb | Ada | examples/trivial_example.adb | AntonMeep/parse_args | 907bcb470a21b36b625b942bfeade06eed048ec6 | [
"0BSD"
] | 9 | 2015-12-08T17:06:54.000Z | 2022-03-28T09:44:20.000Z | examples/trivial_example.adb | AntonMeep/parse_args | 907bcb470a21b36b625b942bfeade06eed048ec6 | [
"0BSD"
] | 1 | 2022-03-30T20:17:18.000Z | 2022-03-30T20:58:34.000Z | examples/trivial_example.adb | AntonMeep/parse_args | 907bcb470a21b36b625b942bfeade06eed048ec6 | [
"0BSD"
] | 2 | 2017-01-07T17:31:48.000Z | 2022-03-28T09:36:42.000Z | -- trivial_example.adb
-- A very simple example of the use of Parse_Args
-- Copyright (c) 2015, James Humphry
--
-- Permission to use, copy, modify, and/or distribute this software for any
-- purpose with or without fee is hereby granted, provided that the above
-- copyright notice and this permission notice appear in all copies.
--
-- THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
-- REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
-- AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
-- INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
-- LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE
-- OR OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
-- PERFORMANCE OF THIS SOFTWARE.
with Ada.Text_IO; use Ada.Text_IO;
with Parse_Args; use Parse_Args;
procedure Trivial_Example is
AP : Argument_Parser;
begin
AP.Add_Option(Make_Boolean_Option(False), "help", 'h',
Usage => "Display this help text");
AP.Add_Option(Make_Boolean_Option(False), "foo", 'f',
Usage => "The foo option");
AP.Set_Prologue("A demonstration of the Parse_Args library.");
AP.Parse_Command_Line;
if AP.Parse_Success then
if AP.Boolean_Value("help") then
AP.Usage;
else
Put("Option foo is: ");
Put((if AP.Boolean_Value("foo") then "true" else "false"));
New_Line;
end if;
else
Put_Line("Error while parsing command-line arguments: ");
Put_Line(AP.Parse_Message);
end if;
end Trivial_Example;
| 35.148936 | 80 | 0.703995 |
ad0c0baf5a6d59afc800c1f7e09662c73f2068fd | 239 | adb | Ada | org.conqat.engine.sourcecode/test-data/org.conqat.engine.sourcecode.coverage.volume/case2.adb | assessorgeneral/ConQAT | 2a462f23f22c22aa9d01a7a204453d1be670ba60 | [
"Apache-2.0"
] | 1 | 2020-04-28T20:06:30.000Z | 2020-04-28T20:06:30.000Z | org.conqat.engine.sourcecode/test-data/org.conqat.engine.sourcecode.coverage.volume/case2.adb | assessorgeneral/ConQAT | 2a462f23f22c22aa9d01a7a204453d1be670ba60 | [
"Apache-2.0"
] | null | null | null | org.conqat.engine.sourcecode/test-data/org.conqat.engine.sourcecode.coverage.volume/case2.adb | assessorgeneral/ConQAT | 2a462f23f22c22aa9d01a7a204453d1be670ba60 | [
"Apache-2.0"
] | null | null | null | with Ada.Text_IO;
procedure Hello is
package IO renames Ada.Text_IO;
X: Integer := 4;
begin
case X is
when 1 =>
Walk_The_Dog;
when 5 =>
Launch_Nuke;
when 8 | 10 =>
Sell_All_Stock;
end case;
end Hello;
| 14.9375 | 32 | 0.610879 |
ad502ae0d6fda4edbcd849b4072d55d84003f719 | 937 | adb | Ada | tests/mobs-test_data-tests-protomobs_container-test_data.adb | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 80 | 2017-04-08T23:14:07.000Z | 2022-02-10T22:30:51.000Z | tests/mobs-test_data-tests-protomobs_container-test_data.adb | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 89 | 2017-06-24T08:18:26.000Z | 2021-11-12T04:37:36.000Z | tests/mobs-test_data-tests-protomobs_container-test_data.adb | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 9 | 2018-04-14T16:37:25.000Z | 2020-03-21T14:33:49.000Z | -- This package is intended to set up and tear down the test environment.
-- Once created by GNATtest, this package will never be overwritten
-- automatically. Contents of this package can be modified in any way
-- except for sections surrounded by a 'read only' marker.
package body Mobs.Test_Data.Tests.ProtoMobs_Container.Test_Data is
procedure Set_Up(Gnattest_T: in out Test) is
pragma Unreferenced(Gnattest_T);
begin
null;
end Set_Up;
procedure Tear_Down(Gnattest_T: in out Test) is
pragma Unreferenced(Gnattest_T);
begin
null;
end Tear_Down;
procedure User_Set_Up(Gnattest_T: in out New_Test) is
pragma Unreferenced(Gnattest_T);
begin
null;
end User_Set_Up;
procedure User_Tear_Down(Gnattest_T: in out New_Test) is
pragma Unreferenced(Gnattest_T);
begin
null;
end User_Tear_Down;
end Mobs.Test_Data.Tests.ProtoMobs_Container.Test_Data;
| 28.393939 | 75 | 0.732124 |
c7323af58fe070f6836d51f49b40d7d45c5b0849 | 2,363 | ads | Ada | src/replicant-platform.ads | jfouquart/synth | cf9f4e394723266805799807ca9dd422e333cb2e | [
"0BSD"
] | null | null | null | src/replicant-platform.ads | jfouquart/synth | cf9f4e394723266805799807ca9dd422e333cb2e | [
"0BSD"
] | null | null | null | src/replicant-platform.ads | jfouquart/synth | cf9f4e394723266805799807ca9dd422e333cb2e | [
"0BSD"
] | null | null | null | -- This file is covered by the Internet Software Consortium (ISC) License
-- Reference: ../License.txt
package Replicant.Platform is
-- returns platform-specific df command
function df_command return String;
-- platform-specific version of file command
function file_type_command return String;
-- Calculate both types of package ABI as a function of platform
function determine_package_architecture return package_abi;
-- Return platform-specific command for swapinfo
function swapinfo_command return String;
-- Return load averages (platform specific)
function get_instant_load return Float;
function get_5_minute_load return Float;
-- Return value of ncpu (from syctl query)
function get_number_cpus return Positive;
-- Return true if file is executable (platform-specific)
function file_is_executable (filename : String) return Boolean;
-- Return true if file is dynamically linked (platform-specific)
function dynamically_linked (base, filename : String) return Boolean;
-- In order to do scanning in a clean environment prior to the true build
-- Returns True on success
function standalone_pkg8_install (id : builders) return Boolean;
-- Required for building first pkg(8) and bmake(8) for pkgsrc
-- They are just copies of hosts versions
function host_pkgsrc_mk_install (id : builders) return Boolean;
function host_pkgsrc_bmake_install (id : builders) return Boolean;
function host_pkgsrc_digest_install (id : builders) return Boolean;
function host_pkgsrc_pkg8_install (id : builders) return Boolean;
-- Cache variables that spawn to get populated to extended make.conf
procedure cache_port_variables (path_to_mm : String);
-- Shell for interactive use
function interactive_shell return String;
private
function isolate_arch_from_file_type (fileinfo : String) return filearch;
-- Derived from /usr/bin/file -b <slave>/bin/sh
function get_arch_from_bourne_shell return String;
-- Get OSVERSION from <sys/param.h>
function get_osversion_from_param_header return String;
-- common logic for instant and 5-minute load average
function load_core (instant_load : Boolean) return Float;
-- equivalent to chmod 755 <fullpath>
procedure set_file_as_executable (fullpath : String);
end Replicant.Platform;
| 36.353846 | 77 | 0.758781 |
add16097d7cabe5e5acd81bd4bc3cdfdf4d66e66 | 3,649 | ads | Ada | 3-mid/impact/source/3d/dynamics/joints/impact-d3-solver_constraint.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/impact/source/3d/dynamics/joints/impact-d3-solver_constraint.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/impact/source/3d/dynamics/joints/impact-d3-solver_constraint.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | limited
with impact.d3.Object.rigid;
with ada.Containers.Vectors;
package impact.d3.solver_Constraint
--
-- 1D constraint along a normal axis between bodyA and bodyB. It can be combined to solve contact and friction constraints.
--
is
type union1_Kind is (solverBodyA, companionIdA);
type union1 (Kind : union1_Kind := solverBodyA) is
record
case Kind is
when solverBodyA => m_solverBodyA : access impact.d3.Object.rigid.Item'Class;
when companionIdA => m_companionIdA : Integer;
end case;
end record;
type union2_Kind is (solverBodyB, companionIdB);
type union2 (Kind : union2_Kind := solverBodyB) is
record
case Kind is
when solverBodyB => m_solverBodyB : access impact.d3.Object.rigid.Item'Class;
when companionIdB => m_companionIdB : Integer;
end case;
end record;
type solver_ConstraintType is (BT_SOLVER_CONTACT_1D,
BT_SOLVER_FRICTION_1D);
type Item is
record
m_relpos1CrossNormal,
m_contactNormal : aliased c_Vector_3;
m_relpos2CrossNormal : aliased c_Vector_3;
-- impact.d3.Vector m_contactNormal2;//usually m_contactNormal2 == -m_contactNormal
m_angularComponentA,
m_angularComponentB : math.Vector_3;
m_appliedPushImpulse,
m_appliedImpulse : math.Real;
m_friction,
m_jacDiagABInv : math.Real;
m_numConsecutiveRowsPerKernel : Integer;
m_frictionIndex : Integer;
union1 : impact.d3.solver_Constraint.union1;
union2 : impact.d3.solver_Constraint.union2;
m_originalContactPoint : access Any'Class;
m_rhs,
m_cfm,
m_lowerLimit,
m_upperLimit : aliased math.Real;
m_rhsPenetration : math.Real;
end record;
type View is access all Item;
function new_solver_Constraint return View;
procedure free (Self : in out View);
--- Containers
--
package Vectors is new ada.Containers.Vectors (Positive, View);
subtype btConstraintArray is Vectors.Vector;
null_Constraint : constant Item := (m_relpos1CrossNormal |
m_relpos2CrossNormal |
m_contactNormal => (0.0, 0.0, 0.0),
m_angularComponentA |
m_angularComponentB => (0.0, 0.0, 0.0),
m_appliedPushImpulse |
m_appliedImpulse |
m_friction |
m_jacDiagABInv => 0.0,
m_numConsecutiveRowsPerKernel |
m_frictionIndex => 0,
union1 => (kind => solverBodyA, m_solverBodyA => null),
union2 => (kind => solverBodyB, m_solverBodyB => null),
m_originalContactPoint => null,
m_rhs |
m_cfm |
m_lowerLimit |
m_upperLimit |
m_rhsPenetration => 0.0);
end impact.d3.solver_Constraint;
| 28.960317 | 124 | 0.501781 |
1ad503c6dee1bfcdaba2540f7a4f131c8c00e95c | 45,366 | adb | Ada | llvm-gcc-4.2-2.9/gcc/ada/exp_dbug.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_dbug.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/exp_dbug.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- E X P _ D B U G --
-- --
-- B o d y --
-- --
-- Copyright (C) 1996-2006, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Alloc; use Alloc;
with Atree; use Atree;
with Debug; use Debug;
with Einfo; use Einfo;
with Namet; use Namet;
with Nlists; use Nlists;
with Nmake; use Nmake;
with Opt; use Opt;
with Output; use Output;
with Sem_Eval; use Sem_Eval;
with Sem_Util; use Sem_Util;
with Sinfo; use Sinfo;
with Snames; use Snames;
with Stand; use Stand;
with Stringt; use Stringt;
with Table;
with Urealp; use Urealp;
package body Exp_Dbug is
-- The following table is used to queue up the entities passed as
-- arguments to Qualify_Entity_Names for later processing when
-- Qualify_All_Entity_Names is called.
package Name_Qualify_Units is new Table.Table (
Table_Component_Type => Node_Id,
Table_Index_Type => Nat,
Table_Low_Bound => 1,
Table_Initial => Alloc.Name_Qualify_Units_Initial,
Table_Increment => Alloc.Name_Qualify_Units_Increment,
Table_Name => "Name_Qualify_Units");
--------------------------------
-- Use of Qualification Flags --
--------------------------------
-- There are two flags used to keep track of qualification of entities
-- Has_Fully_Qualified_Name
-- Has_Qualified_Name
-- The difference between these is as follows. Has_Qualified_Name is
-- set to indicate that the name has been qualified as required by the
-- spec of this package. As described there, this may involve the full
-- qualification for the name, but for some entities, notably procedure
-- local variables, this full qualification is not required.
-- The flag Has_Fully_Qualified_Name is set if indeed the name has been
-- fully qualified in the Ada sense. If Has_Fully_Qualified_Name is set,
-- then Has_Qualified_Name is also set, but the other way round is not
-- the case.
-- Consider the following example:
-- with ...
-- procedure X is
-- B : Ddd.Ttt;
-- procedure Y is ..
-- Here B is a procedure local variable, so it does not need fully
-- qualification. The flag Has_Qualified_Name will be set on the
-- first attempt to qualify B, to indicate that the job is done
-- and need not be redone.
-- But Y is qualified as x__y, since procedures are always fully
-- qualified, so the first time that an attempt is made to qualify
-- the name y, it will be replaced by x__y, and both flags are set.
-- Why the two flags? Well there are cases where we derive type names
-- from object names. As noted in the spec, type names are always
-- fully qualified. Suppose for example that the backend has to build
-- a padded type for variable B. then it will construct the PAD name
-- from B, but it requires full qualification, so the fully qualified
-- type name will be x__b___PAD. The two flags allow the circuit for
-- building this name to realize efficiently that b needs further
-- qualification.
--------------------
-- Homonym_Suffix --
--------------------
-- The string defined here (and its associated length) is used to
-- gather the homonym string that will be appended to Name_Buffer
-- when the name is complete. Strip_Suffixes appends to this string
-- as does Append_Homonym_Number, and Output_Homonym_Numbers_Suffix
-- appends the string to the end of Name_Buffer.
Homonym_Numbers : String (1 .. 256);
Homonym_Len : Natural := 0;
----------------------
-- Local Procedures --
----------------------
procedure Add_Uint_To_Buffer (U : Uint);
-- Add image of universal integer to Name_Buffer, updating Name_Len
procedure Add_Real_To_Buffer (U : Ureal);
-- Add nnn_ddd to Name_Buffer, where nnn and ddd are integer values of
-- the normalized numerator and denominator of the given real value.
procedure Append_Homonym_Number (E : Entity_Id);
-- If the entity E has homonyms in the same scope, then make an entry
-- in the Homonym_Numbers array, bumping Homonym_Count accordingly.
function Bounds_Match_Size (E : Entity_Id) return Boolean;
-- Determine whether the bounds of E match the size of the type. This is
-- used to determine whether encoding is required for a discrete type.
procedure Output_Homonym_Numbers_Suffix;
-- If homonym numbers are stored, then output them into Name_Buffer
procedure Prepend_String_To_Buffer (S : String);
-- Prepend given string to the contents of the string buffer, updating
-- the value in Name_Len (i.e. string is added at start of buffer).
procedure Prepend_Uint_To_Buffer (U : Uint);
-- Prepend image of universal integer to Name_Buffer, updating Name_Len
procedure Qualify_Entity_Name (Ent : Entity_Id);
-- If not already done, replaces the Chars field of the given entity
-- with the appropriate fully qualified name.
procedure Strip_Suffixes (BNPE_Suffix_Found : in out Boolean);
-- Given an qualified entity name in Name_Buffer, remove any plain X or
-- X{nb} qualification suffix. The contents of Name_Buffer is not changed
-- but Name_Len may be adjusted on return to remove the suffix. If a
-- BNPE suffix is found and stripped, then BNPE_Suffix_Found is set to
-- True. If no suffix is found, then BNPE_Suffix_Found is not modified.
-- This routine also searches for a homonym suffix, and if one is found
-- it is also stripped, and the entries are added to the global homonym
-- list (Homonym_Numbers) so that they can later be put back.
------------------------
-- Add_Real_To_Buffer --
------------------------
procedure Add_Real_To_Buffer (U : Ureal) is
begin
Add_Uint_To_Buffer (Norm_Num (U));
Add_Str_To_Name_Buffer ("_");
Add_Uint_To_Buffer (Norm_Den (U));
end Add_Real_To_Buffer;
------------------------
-- Add_Uint_To_Buffer --
------------------------
procedure Add_Uint_To_Buffer (U : Uint) is
begin
if U < 0 then
Add_Uint_To_Buffer (-U);
Add_Char_To_Name_Buffer ('m');
else
UI_Image (U, Decimal);
Add_Str_To_Name_Buffer (UI_Image_Buffer (1 .. UI_Image_Length));
end if;
end Add_Uint_To_Buffer;
---------------------------
-- Append_Homonym_Number --
---------------------------
procedure Append_Homonym_Number (E : Entity_Id) is
procedure Add_Nat_To_H (Nr : Nat);
-- Little procedure to append Nr to Homonym_Numbers
------------------
-- Add_Nat_To_H --
------------------
procedure Add_Nat_To_H (Nr : Nat) is
begin
if Nr >= 10 then
Add_Nat_To_H (Nr / 10);
end if;
Homonym_Len := Homonym_Len + 1;
Homonym_Numbers (Homonym_Len) :=
Character'Val (Nr mod 10 + Character'Pos ('0'));
end Add_Nat_To_H;
-- Start of processing for Append_Homonym_Number
begin
if Has_Homonym (E) then
declare
H : Entity_Id := Homonym (E);
Nr : Nat := 1;
begin
while Present (H) loop
if Scope (H) = Scope (E) then
Nr := Nr + 1;
end if;
H := Homonym (H);
end loop;
if Homonym_Len > 0 then
Homonym_Len := Homonym_Len + 1;
Homonym_Numbers (Homonym_Len) := '_';
end if;
Add_Nat_To_H (Nr);
end;
end if;
end Append_Homonym_Number;
-----------------------
-- Bounds_Match_Size --
-----------------------
function Bounds_Match_Size (E : Entity_Id) return Boolean is
Siz : Uint;
begin
if not Is_OK_Static_Subtype (E) then
return False;
elsif Is_Integer_Type (E)
and then Subtypes_Statically_Match (E, Base_Type (E))
then
return True;
-- Here we check if the static bounds match the natural size, which is
-- the size passed through with the debugging information. This is the
-- Esize rounded up to 8, 16, 32 or 64 as appropriate.
else
declare
Umark : constant Uintp.Save_Mark := Uintp.Mark;
Result : Boolean;
begin
if Esize (E) <= 8 then
Siz := Uint_8;
elsif Esize (E) <= 16 then
Siz := Uint_16;
elsif Esize (E) <= 32 then
Siz := Uint_32;
else
Siz := Uint_64;
end if;
if Is_Modular_Integer_Type (E) or else Is_Enumeration_Type (E) then
Result :=
Expr_Rep_Value (Type_Low_Bound (E)) = 0
and then
2 ** Siz - Expr_Rep_Value (Type_High_Bound (E)) = 1;
else
Result :=
Expr_Rep_Value (Type_Low_Bound (E)) + 2 ** (Siz - 1) = 0
and then
2 ** (Siz - 1) - Expr_Rep_Value (Type_High_Bound (E)) = 1;
end if;
Release (Umark);
return Result;
end;
end if;
end Bounds_Match_Size;
--------------------------------
-- Debug_Renaming_Declaration --
--------------------------------
function Debug_Renaming_Declaration (N : Node_Id) return Node_Id is
Loc : constant Source_Ptr := Sloc (N);
Ent : constant Node_Id := Defining_Entity (N);
Nam : constant Node_Id := Name (N);
Rnm : Name_Id;
Ren : Node_Id;
Lit : Entity_Id;
Typ : Entity_Id;
Res : Node_Id;
Def : Entity_Id;
function Output_Subscript (N : Node_Id; S : String) return Boolean;
-- Outputs a single subscript value as ?nnn (subscript is compile time
-- known value with value nnn) or as ?e (subscript is local constant
-- with name e), where S supplies the proper string to use for ?.
-- Returns False if the subscript is not of an appropriate type to
-- output in one of these two forms. The result is prepended to the
-- name stored in Name_Buffer.
----------------------
-- Output_Subscript --
----------------------
function Output_Subscript (N : Node_Id; S : String) return Boolean is
begin
if Compile_Time_Known_Value (N) then
Prepend_Uint_To_Buffer (Expr_Value (N));
elsif Nkind (N) = N_Identifier
and then Scope (Entity (N)) = Scope (Ent)
and then Ekind (Entity (N)) = E_Constant
then
Prepend_String_To_Buffer (Get_Name_String (Chars (Entity (N))));
else
return False;
end if;
Prepend_String_To_Buffer (S);
return True;
end Output_Subscript;
-- Start of processing for Debug_Renaming_Declaration
begin
if not Comes_From_Source (N)
and then not Needs_Debug_Info (Ent)
then
return Empty;
end if;
-- Prepare entity name for type declaration
Get_Name_String (Chars (Ent));
case Nkind (N) is
when N_Object_Renaming_Declaration =>
Add_Str_To_Name_Buffer ("___XR");
when N_Exception_Renaming_Declaration =>
Add_Str_To_Name_Buffer ("___XRE");
when N_Package_Renaming_Declaration =>
Add_Str_To_Name_Buffer ("___XRP");
-- If it is a child unit create a fully qualified name, to
-- disambiguate multiple child units with the same name and
-- different parents.
if Is_Child_Unit (Ent) then
Prepend_String_To_Buffer ("__");
Prepend_String_To_Buffer
(Get_Name_String (Chars (Scope (Ent))));
end if;
when others =>
return Empty;
end case;
Rnm := Name_Find;
-- Get renamed entity and compute suffix
Name_Len := 0;
Ren := Nam;
loop
case Nkind (Ren) is
when N_Identifier =>
exit;
when N_Expanded_Name =>
-- The entity field for an N_Expanded_Name is on the expanded
-- name node itself, so we are done here too.
exit;
when N_Selected_Component =>
Prepend_String_To_Buffer
(Get_Name_String (Chars (Selector_Name (Ren))));
Prepend_String_To_Buffer ("XR");
Ren := Prefix (Ren);
when N_Indexed_Component =>
declare
X : Node_Id := Last (Expressions (Ren));
begin
while Present (X) loop
if not Output_Subscript (X, "XS") then
Set_Materialize_Entity (Ent);
return Empty;
end if;
Prev (X);
end loop;
end;
Ren := Prefix (Ren);
when N_Slice =>
Typ := Etype (First_Index (Etype (Nam)));
if not Output_Subscript (Type_High_Bound (Typ), "XS") then
Set_Materialize_Entity (Ent);
return Empty;
end if;
if not Output_Subscript (Type_Low_Bound (Typ), "XL") then
Set_Materialize_Entity (Ent);
return Empty;
end if;
Ren := Prefix (Ren);
when N_Explicit_Dereference =>
Set_Materialize_Entity (Ent);
Prepend_String_To_Buffer ("XA");
Ren := Prefix (Ren);
-- For now, anything else simply results in no translation
when others =>
Set_Materialize_Entity (Ent);
return Empty;
end case;
end loop;
Prepend_String_To_Buffer ("___XE");
-- For now, the literal name contains only the suffix. The Entity_Id
-- value for the name is used to create a link from this literal name
-- to the renamed entity using the Debug_Renaming_Link field. Then the
-- Qualify_Entity_Name procedure uses this link to create the proper
-- fully qualified name.
-- The reason we do things this way is that we really need to copy the
-- qualification of the renamed entity, and it is really much easier to
-- do this after the renamed entity has itself been fully qualified.
Lit := Make_Defining_Identifier (Loc, Chars => Name_Enter);
Set_Debug_Renaming_Link (Lit, Entity (Ren));
-- Return the appropriate enumeration type
Def := Make_Defining_Identifier (Loc, Chars => Rnm);
Res :=
Make_Full_Type_Declaration (Loc,
Defining_Identifier => Def,
Type_Definition =>
Make_Enumeration_Type_Definition (Loc,
Literals => New_List (Lit)));
Set_Needs_Debug_Info (Def);
Set_Needs_Debug_Info (Lit);
Set_Discard_Names (Defining_Identifier (Res));
return Res;
-- If we get an exception, just figure it is a case that we cannot
-- successfully handle using our current approach, since this is
-- only for debugging, no need to take the compilation with us!
exception
when others =>
return Make_Null_Statement (Loc);
end Debug_Renaming_Declaration;
----------------------
-- Get_Encoded_Name --
----------------------
-- Note: see spec for details on encodings
procedure Get_Encoded_Name (E : Entity_Id) is
Has_Suffix : Boolean;
begin
-- If not generating code, there is no need to create encoded
-- names, and problems when the back-end is called to annotate
-- types without full code generation. See comments at beginning
-- of Get_External_Name_With_Suffix for additional details.
if Operating_Mode /= Generate_Code then
return;
end if;
Get_Name_String (Chars (E));
-- Nothing to do if we do not have a type
if not Is_Type (E)
-- Or if this is an enumeration base type
or else (Is_Enumeration_Type (E)
and then E = Base_Type (E))
-- Or if this is a dummy type for a renaming
or else (Name_Len >= 3 and then
Name_Buffer (Name_Len - 2 .. Name_Len) = "_XR")
or else (Name_Len >= 4 and then
(Name_Buffer (Name_Len - 3 .. Name_Len) = "_XRE"
or else
Name_Buffer (Name_Len - 3 .. Name_Len) = "_XRP"))
-- For all these cases, just return the name unchanged
then
Name_Buffer (Name_Len + 1) := ASCII.Nul;
return;
end if;
Has_Suffix := True;
-- Fixed-point case
if Is_Fixed_Point_Type (E) then
Get_External_Name_With_Suffix (E, "XF_");
Add_Real_To_Buffer (Delta_Value (E));
if Small_Value (E) /= Delta_Value (E) then
Add_Str_To_Name_Buffer ("_");
Add_Real_To_Buffer (Small_Value (E));
end if;
-- Vax floating-point case
elsif Vax_Float (E) then
if Digits_Value (Base_Type (E)) = 6 then
Get_External_Name_With_Suffix (E, "XFF");
elsif Digits_Value (Base_Type (E)) = 9 then
Get_External_Name_With_Suffix (E, "XFF");
else
pragma Assert (Digits_Value (Base_Type (E)) = 15);
Get_External_Name_With_Suffix (E, "XFG");
end if;
-- Discrete case where bounds do not match size
elsif Is_Discrete_Type (E)
and then not Bounds_Match_Size (E)
then
declare
Lo : constant Node_Id := Type_Low_Bound (E);
Hi : constant Node_Id := Type_High_Bound (E);
Lo_Con : constant Boolean := Compile_Time_Known_Value (Lo);
Hi_Con : constant Boolean := Compile_Time_Known_Value (Hi);
Lo_Discr : constant Boolean :=
Nkind (Lo) = N_Identifier
and then
Ekind (Entity (Lo)) = E_Discriminant;
Hi_Discr : constant Boolean :=
Nkind (Hi) = N_Identifier
and then
Ekind (Entity (Hi)) = E_Discriminant;
Lo_Encode : constant Boolean := Lo_Con or Lo_Discr;
Hi_Encode : constant Boolean := Hi_Con or Hi_Discr;
Biased : constant Boolean := Has_Biased_Representation (E);
begin
if Biased then
Get_External_Name_With_Suffix (E, "XB");
else
Get_External_Name_With_Suffix (E, "XD");
end if;
if Lo_Encode or Hi_Encode then
if Biased then
Add_Str_To_Name_Buffer ("_");
else
if Lo_Encode then
if Hi_Encode then
Add_Str_To_Name_Buffer ("LU_");
else
Add_Str_To_Name_Buffer ("L_");
end if;
else
Add_Str_To_Name_Buffer ("U_");
end if;
end if;
if Lo_Con then
Add_Uint_To_Buffer (Expr_Rep_Value (Lo));
elsif Lo_Discr then
Get_Name_String_And_Append (Chars (Entity (Lo)));
end if;
if Lo_Encode and Hi_Encode then
Add_Str_To_Name_Buffer ("__");
end if;
if Hi_Con then
Add_Uint_To_Buffer (Expr_Rep_Value (Hi));
elsif Hi_Discr then
Get_Name_String_And_Append (Chars (Entity (Hi)));
end if;
end if;
end;
-- For all other cases, the encoded name is the normal type name
else
Has_Suffix := False;
Get_External_Name (E, Has_Suffix);
end if;
if Debug_Flag_B and then Has_Suffix then
Write_Str ("**** type ");
Write_Name (Chars (E));
Write_Str (" is encoded as ");
Write_Str (Name_Buffer (1 .. Name_Len));
Write_Eol;
end if;
Name_Buffer (Name_Len + 1) := ASCII.NUL;
end Get_Encoded_Name;
-----------------------
-- Get_External_Name --
-----------------------
procedure Get_External_Name (Entity : Entity_Id; Has_Suffix : Boolean) is
E : Entity_Id := Entity;
Kind : Entity_Kind;
procedure Get_Qualified_Name_And_Append (Entity : Entity_Id);
-- Appends fully qualified name of given entity to Name_Buffer
-----------------------------------
-- Get_Qualified_Name_And_Append --
-----------------------------------
procedure Get_Qualified_Name_And_Append (Entity : Entity_Id) is
begin
-- If the entity is a compilation unit, its scope is Standard,
-- there is no outer scope, and the no further qualification
-- is required.
-- If the front end has already computed a fully qualified name,
-- then it is also the case that no further qualification is
-- required
if Present (Scope (Scope (Entity)))
and then not Has_Fully_Qualified_Name (Entity)
then
Get_Qualified_Name_And_Append (Scope (Entity));
Add_Str_To_Name_Buffer ("__");
Get_Name_String_And_Append (Chars (Entity));
Append_Homonym_Number (Entity);
else
Get_Name_String_And_Append (Chars (Entity));
end if;
end Get_Qualified_Name_And_Append;
-- Start of processing for Get_External_Name
begin
Name_Len := 0;
-- If this is a child unit, we want the child
if Nkind (E) = N_Defining_Program_Unit_Name then
E := Defining_Identifier (Entity);
end if;
Kind := Ekind (E);
-- Case of interface name being used
if (Kind = E_Procedure or else
Kind = E_Function or else
Kind = E_Constant or else
Kind = E_Variable or else
Kind = E_Exception)
and then Present (Interface_Name (E))
and then No (Address_Clause (E))
and then not Has_Suffix
then
Add_String_To_Name_Buffer (Strval (Interface_Name (E)));
-- All other cases besides the interface name case
else
-- If this is a library level subprogram (i.e. a subprogram that is a
-- compilation unit other than a subunit), then we prepend _ada_ to
-- ensure distinctions required as described in the spec.
-- Check explicitly for child units, because those are not flagged
-- as Compilation_Units by lib. Should they be ???
if Is_Subprogram (E)
and then (Is_Compilation_Unit (E) or Is_Child_Unit (E))
and then not Has_Suffix
then
Add_Str_To_Name_Buffer ("_ada_");
end if;
-- If the entity is a subprogram instance that is not a compilation
-- unit, generate the name of the original Ada entity, which is the
-- one gdb needs.
if Is_Generic_Instance (E)
and then Is_Subprogram (E)
and then not Is_Compilation_Unit (Scope (E))
and then (Ekind (Scope (E)) = E_Package
or else
Ekind (Scope (E)) = E_Package_Body)
and then Present (Related_Instance (Scope (E)))
then
E := Related_Instance (Scope (E));
end if;
Get_Qualified_Name_And_Append (E);
end if;
Name_Buffer (Name_Len + 1) := ASCII.Nul;
end Get_External_Name;
-----------------------------------
-- Get_External_Name_With_Suffix --
-----------------------------------
procedure Get_External_Name_With_Suffix
(Entity : Entity_Id;
Suffix : String)
is
Has_Suffix : constant Boolean := (Suffix /= "");
begin
-- If we are not in code generation mode, this procedure may still be
-- called from Back_End (more specifically - from gigi for doing type
-- representation annotation or some representation-specific checks).
-- But in this mode there is no need to mess with external names.
-- Furthermore, the call causes difficulties in this case because the
-- string representing the homonym number is not correctly reset as a
-- part of the call to Output_Homonym_Numbers_Suffix (which is not
-- called in gigi).
if Operating_Mode /= Generate_Code then
return;
end if;
Get_External_Name (Entity, Has_Suffix);
if Has_Suffix then
Add_Str_To_Name_Buffer ("___");
Add_Str_To_Name_Buffer (Suffix);
Name_Buffer (Name_Len + 1) := ASCII.Nul;
end if;
end Get_External_Name_With_Suffix;
--------------------------
-- Get_Variant_Encoding --
--------------------------
procedure Get_Variant_Encoding (V : Node_Id) is
Choice : Node_Id;
procedure Choice_Val (Typ : Character; Choice : Node_Id);
-- Output encoded value for a single choice value. Typ is the key
-- character ('S', 'F', or 'T') that precedes the choice value.
----------------
-- Choice_Val --
----------------
procedure Choice_Val (Typ : Character; Choice : Node_Id) is
begin
if Nkind (Choice) = N_Integer_Literal then
Add_Char_To_Name_Buffer (Typ);
Add_Uint_To_Buffer (Intval (Choice));
-- Character literal with no entity present (this is the case
-- Standard.Character or Standard.Wide_Character as root type)
elsif Nkind (Choice) = N_Character_Literal
and then No (Entity (Choice))
then
Add_Char_To_Name_Buffer (Typ);
Add_Uint_To_Buffer (Char_Literal_Value (Choice));
else
declare
Ent : constant Entity_Id := Entity (Choice);
begin
if Ekind (Ent) = E_Enumeration_Literal then
Add_Char_To_Name_Buffer (Typ);
Add_Uint_To_Buffer (Enumeration_Rep (Ent));
else
pragma Assert (Ekind (Ent) = E_Constant);
Choice_Val (Typ, Constant_Value (Ent));
end if;
end;
end if;
end Choice_Val;
-- Start of processing for Get_Variant_Encoding
begin
Name_Len := 0;
Choice := First (Discrete_Choices (V));
while Present (Choice) loop
if Nkind (Choice) = N_Others_Choice then
Add_Char_To_Name_Buffer ('O');
elsif Nkind (Choice) = N_Range then
Choice_Val ('R', Low_Bound (Choice));
Choice_Val ('T', High_Bound (Choice));
elsif Is_Entity_Name (Choice)
and then Is_Type (Entity (Choice))
then
Choice_Val ('R', Type_Low_Bound (Entity (Choice)));
Choice_Val ('T', Type_High_Bound (Entity (Choice)));
elsif Nkind (Choice) = N_Subtype_Indication then
declare
Rang : constant Node_Id :=
Range_Expression (Constraint (Choice));
begin
Choice_Val ('R', Low_Bound (Rang));
Choice_Val ('T', High_Bound (Rang));
end;
else
Choice_Val ('S', Choice);
end if;
Next (Choice);
end loop;
Name_Buffer (Name_Len + 1) := ASCII.NUL;
if Debug_Flag_B then
declare
VP : constant Node_Id := Parent (V); -- Variant_Part
CL : constant Node_Id := Parent (VP); -- Component_List
RD : constant Node_Id := Parent (CL); -- Record_Definition
FT : constant Node_Id := Parent (RD); -- Full_Type_Declaration
begin
Write_Str ("**** variant for type ");
Write_Name (Chars (Defining_Identifier (FT)));
Write_Str (" is encoded as ");
Write_Str (Name_Buffer (1 .. Name_Len));
Write_Eol;
end;
end if;
end Get_Variant_Encoding;
------------------------------------
-- Get_Secondary_DT_External_Name --
------------------------------------
procedure Get_Secondary_DT_External_Name
(Typ : Entity_Id;
Ancestor_Typ : Entity_Id;
Suffix_Index : Int) is
begin
Get_External_Name (Typ, Has_Suffix => False);
if Ancestor_Typ /= Typ then
declare
Len : constant Natural := Name_Len;
Save_Str : constant String (1 .. Name_Len)
:= Name_Buffer (1 .. Name_Len);
begin
Get_External_Name (Ancestor_Typ, Has_Suffix => False);
-- Append the extended name of the ancestor to the
-- extended name of Typ
Name_Buffer (Len + 2 .. Len + Name_Len + 1) :=
Name_Buffer (1 .. Name_Len);
Name_Buffer (1 .. Len) := Save_Str;
Name_Buffer (Len + 1) := '_';
Name_Len := Len + Name_Len + 1;
end;
end if;
Add_Nat_To_Name_Buffer (Suffix_Index);
end Get_Secondary_DT_External_Name;
---------------------------------
-- Make_Packed_Array_Type_Name --
---------------------------------
function Make_Packed_Array_Type_Name
(Typ : Entity_Id;
Csize : Uint)
return Name_Id
is
begin
Get_Name_String (Chars (Typ));
Add_Str_To_Name_Buffer ("___XP");
Add_Uint_To_Buffer (Csize);
return Name_Find;
end Make_Packed_Array_Type_Name;
-----------------------------------
-- Output_Homonym_Numbers_Suffix --
-----------------------------------
procedure Output_Homonym_Numbers_Suffix is
J : Natural;
begin
if Homonym_Len > 0 then
-- Check for all 1's, in which case we do not output
J := 1;
loop
exit when Homonym_Numbers (J) /= '1';
-- If we reached end of string we do not output
if J = Homonym_Len then
Homonym_Len := 0;
return;
end if;
exit when Homonym_Numbers (J + 1) /= '_';
J := J + 2;
end loop;
-- If we exit the loop then suffix must be output
Add_Str_To_Name_Buffer ("__");
Add_Str_To_Name_Buffer (Homonym_Numbers (1 .. Homonym_Len));
Homonym_Len := 0;
end if;
end Output_Homonym_Numbers_Suffix;
------------------------------
-- Prepend_String_To_Buffer --
------------------------------
procedure Prepend_String_To_Buffer (S : String) is
N : constant Integer := S'Length;
begin
Name_Buffer (1 + N .. Name_Len + N) := Name_Buffer (1 .. Name_Len);
Name_Buffer (1 .. N) := S;
Name_Len := Name_Len + N;
end Prepend_String_To_Buffer;
----------------------------
-- Prepend_Uint_To_Buffer --
----------------------------
procedure Prepend_Uint_To_Buffer (U : Uint) is
begin
if U < 0 then
Prepend_String_To_Buffer ("m");
Prepend_Uint_To_Buffer (-U);
else
UI_Image (U, Decimal);
Prepend_String_To_Buffer (UI_Image_Buffer (1 .. UI_Image_Length));
end if;
end Prepend_Uint_To_Buffer;
------------------------------
-- Qualify_All_Entity_Names --
------------------------------
procedure Qualify_All_Entity_Names is
E : Entity_Id;
Ent : Entity_Id;
begin
for J in Name_Qualify_Units.First .. Name_Qualify_Units.Last loop
E := Defining_Entity (Name_Qualify_Units.Table (J));
Qualify_Entity_Name (E);
Ent := First_Entity (E);
while Present (Ent) loop
Qualify_Entity_Name (Ent);
Next_Entity (Ent);
-- There are odd cases where Last_Entity (E) = E. This happens
-- in the case of renaming of packages. This test avoids getting
-- stuck in such cases.
exit when Ent = E;
end loop;
end loop;
end Qualify_All_Entity_Names;
-------------------------
-- Qualify_Entity_Name --
-------------------------
procedure Qualify_Entity_Name (Ent : Entity_Id) is
Full_Qualify_Name : String (1 .. Name_Buffer'Length);
Full_Qualify_Len : Natural := 0;
-- Used to accumulate fully qualified name of subprogram
procedure Fully_Qualify_Name (E : Entity_Id);
-- Used to qualify a subprogram or type name, where full
-- qualification up to Standard is always used. Name is set
-- in Full_Qualify_Name with the length in Full_Qualify_Len.
-- Note that this routine does not prepend the _ada_ string
-- required for library subprograms (this is done in the back end).
function Is_BNPE (S : Entity_Id) return Boolean;
-- Determines if S is a BNPE, i.e. Body-Nested Package Entity, which
-- is defined to be a package which is immediately nested within a
-- package body.
function Qualify_Needed (S : Entity_Id) return Boolean;
-- Given a scope, determines if the scope is to be included in the
-- fully qualified name, True if so, False if not.
procedure Set_BNPE_Suffix (E : Entity_Id);
-- Recursive routine to append the BNPE qualification suffix. Works
-- from right to left with E being the current entity in the list.
-- The result does NOT have the trailing n's and trailing b stripped.
-- The caller must do this required stripping.
procedure Set_Entity_Name (E : Entity_Id);
-- Internal recursive routine that does most of the work. This routine
-- leaves the result sitting in Name_Buffer and Name_Len.
BNPE_Suffix_Needed : Boolean := False;
-- Set true if a body-nested package entity suffix is required
Save_Chars : constant Name_Id := Chars (Ent);
-- Save original name
------------------------
-- Fully_Qualify_Name --
------------------------
procedure Fully_Qualify_Name (E : Entity_Id) is
Discard : Boolean := False;
begin
-- Ignore empty entry (can happen in error cases)
if No (E) then
return;
-- If this we are qualifying entities local to a generic
-- instance, use the name of the original instantiation,
-- not that of the anonymous subprogram in the wrapper
-- package, so that gdb doesn't have to know about these.
elsif Is_Generic_Instance (E)
and then Is_Subprogram (E)
and then not Comes_From_Source (E)
and then not Is_Compilation_Unit (Scope (E))
then
Fully_Qualify_Name (Related_Instance (Scope (E)));
return;
end if;
-- If we reached fully qualified name, then just copy it
if Has_Fully_Qualified_Name (E) then
Get_Name_String (Chars (E));
Strip_Suffixes (Discard);
Full_Qualify_Name (1 .. Name_Len) := Name_Buffer (1 .. Name_Len);
Full_Qualify_Len := Name_Len;
Set_Has_Fully_Qualified_Name (Ent);
-- Case of non-fully qualified name
else
if Scope (E) = Standard_Standard then
Set_Has_Fully_Qualified_Name (Ent);
else
Fully_Qualify_Name (Scope (E));
Full_Qualify_Name (Full_Qualify_Len + 1) := '_';
Full_Qualify_Name (Full_Qualify_Len + 2) := '_';
Full_Qualify_Len := Full_Qualify_Len + 2;
end if;
if Has_Qualified_Name (E) then
Get_Unqualified_Name_String (Chars (E));
else
Get_Name_String (Chars (E));
end if;
-- A special check here, we never add internal block or loop
-- names, since they intefere with debugging. We identify these
-- by the fact that they start with an upper case B or L.
-- But do add these if what we are qualifying is a __clean
-- procedure since those need to be made unique.
if (Name_Buffer (1) = 'B' or else Name_Buffer (1) = 'L')
and then (not Debug_Flag_VV)
and then Full_Qualify_Len > 2
and then Chars (Ent) /= Name_uClean
then
Full_Qualify_Len := Full_Qualify_Len - 2;
else
Full_Qualify_Name
(Full_Qualify_Len + 1 .. Full_Qualify_Len + Name_Len) :=
Name_Buffer (1 .. Name_Len);
Full_Qualify_Len := Full_Qualify_Len + Name_Len;
Append_Homonym_Number (E);
end if;
end if;
if Is_BNPE (E) then
BNPE_Suffix_Needed := True;
end if;
end Fully_Qualify_Name;
-------------
-- Is_BNPE --
-------------
function Is_BNPE (S : Entity_Id) return Boolean is
begin
return
Ekind (S) = E_Package
and then Is_Package_Body_Entity (S);
end Is_BNPE;
--------------------
-- Qualify_Needed --
--------------------
function Qualify_Needed (S : Entity_Id) return Boolean is
begin
-- If we got all the way to Standard, then we have certainly
-- fully qualified the name, so set the flag appropriately,
-- and then return False, since we are most certainly done!
if S = Standard_Standard then
Set_Has_Fully_Qualified_Name (Ent, True);
return False;
-- Otherwise figure out if further qualification is required
else
return
Is_Subprogram (Ent)
or else
Ekind (Ent) = E_Subprogram_Body
or else
(Ekind (S) /= E_Block
and then not Is_Dynamic_Scope (S));
end if;
end Qualify_Needed;
---------------------
-- Set_BNPE_Suffix --
---------------------
procedure Set_BNPE_Suffix (E : Entity_Id) is
S : constant Entity_Id := Scope (E);
begin
if Qualify_Needed (S) then
Set_BNPE_Suffix (S);
if Is_BNPE (E) then
Add_Char_To_Name_Buffer ('b');
else
Add_Char_To_Name_Buffer ('n');
end if;
else
Add_Char_To_Name_Buffer ('X');
end if;
end Set_BNPE_Suffix;
---------------------
-- Set_Entity_Name --
---------------------
procedure Set_Entity_Name (E : Entity_Id) is
S : constant Entity_Id := Scope (E);
begin
-- If we reach an already qualified name, just take the encoding
-- except that we strip the package body suffixes, since these
-- will be separately put on later.
if Has_Qualified_Name (E) then
Get_Name_String_And_Append (Chars (E));
Strip_Suffixes (BNPE_Suffix_Needed);
-- If the top level name we are adding is itself fully
-- qualified, then that means that the name that we are
-- preparing for the Fully_Qualify_Name call will also
-- generate a fully qualified name.
if Has_Fully_Qualified_Name (E) then
Set_Has_Fully_Qualified_Name (Ent);
end if;
-- Case where upper level name is not encoded yet
else
-- Recurse if further qualification required
if Qualify_Needed (S) then
Set_Entity_Name (S);
Add_Str_To_Name_Buffer ("__");
end if;
-- Otherwise get name and note if it is a NPBE
Get_Name_String_And_Append (Chars (E));
if Is_BNPE (E) then
BNPE_Suffix_Needed := True;
end if;
Append_Homonym_Number (E);
end if;
end Set_Entity_Name;
-- Start of processing for Qualify_Entity_Name
begin
if Has_Qualified_Name (Ent) then
return;
-- Here is where we create the proper link for renaming
elsif Ekind (Ent) = E_Enumeration_Literal
and then Present (Debug_Renaming_Link (Ent))
then
Name_Len := 0;
Qualify_Entity_Name (Debug_Renaming_Link (Ent));
Get_Name_String (Chars (Ent));
Prepend_String_To_Buffer
(Get_Name_String (Chars (Debug_Renaming_Link (Ent))));
Set_Chars (Ent, Name_Enter);
Set_Has_Qualified_Name (Ent);
return;
elsif Is_Subprogram (Ent)
or else Ekind (Ent) = E_Subprogram_Body
or else Is_Type (Ent)
then
Fully_Qualify_Name (Ent);
Name_Len := Full_Qualify_Len;
Name_Buffer (1 .. Name_Len) := Full_Qualify_Name (1 .. Name_Len);
elsif Qualify_Needed (Scope (Ent)) then
Name_Len := 0;
Set_Entity_Name (Ent);
else
Set_Has_Qualified_Name (Ent);
return;
end if;
-- Fall through with a fully qualified name in Name_Buffer/Name_Len
Output_Homonym_Numbers_Suffix;
-- Add body-nested package suffix if required
if BNPE_Suffix_Needed
and then Ekind (Ent) /= E_Enumeration_Literal
then
Set_BNPE_Suffix (Ent);
-- Strip trailing n's and last trailing b as required. note that
-- we know there is at least one b, or no suffix would be generated.
while Name_Buffer (Name_Len) = 'n' loop
Name_Len := Name_Len - 1;
end loop;
Name_Len := Name_Len - 1;
end if;
Set_Chars (Ent, Name_Enter);
Set_Has_Qualified_Name (Ent);
if Debug_Flag_BB then
Write_Str ("*** ");
Write_Name (Save_Chars);
Write_Str (" qualified as ");
Write_Name (Chars (Ent));
Write_Eol;
end if;
end Qualify_Entity_Name;
--------------------------
-- Qualify_Entity_Names --
--------------------------
procedure Qualify_Entity_Names (N : Node_Id) is
begin
Name_Qualify_Units.Append (N);
end Qualify_Entity_Names;
--------------------
-- Strip_Suffixes --
--------------------
procedure Strip_Suffixes (BNPE_Suffix_Found : in out Boolean) is
SL : Natural;
begin
-- Search for and strip BNPE suffix
for J in reverse 2 .. Name_Len loop
if Name_Buffer (J) = 'X' then
Name_Len := J - 1;
BNPE_Suffix_Found := True;
exit;
end if;
exit when Name_Buffer (J) /= 'b' and then Name_Buffer (J) /= 'n';
end loop;
-- Search for and strip homonym numbers suffix
for J in reverse 2 .. Name_Len - 2 loop
if Name_Buffer (J) = '_'
and then Name_Buffer (J + 1) = '_'
then
if Name_Buffer (J + 2) in '0' .. '9' then
if Homonym_Len > 0 then
Homonym_Len := Homonym_Len + 1;
Homonym_Numbers (Homonym_Len) := '-';
end if;
SL := Name_Len - (J + 1);
Homonym_Numbers (Homonym_Len + 1 .. Homonym_Len + SL) :=
Name_Buffer (J + 2 .. Name_Len);
Name_Len := J - 1;
Homonym_Len := Homonym_Len + SL;
end if;
exit;
end if;
end loop;
end Strip_Suffixes;
end Exp_Dbug;
| 32.921626 | 79 | 0.554666 |
2e6fdf6107b8f72724c96f9c2297f89527dc61d4 | 9,265 | ads | Ada | arch/ARM/STM32/svd/stm32l4x2/stm32_svd-opamp.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2018-05-16T03:56:39.000Z | 2019-07-31T13:53:56.000Z | arch/ARM/STM32/svd/stm32l4x2/stm32_svd-opamp.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | arch/ARM/STM32/svd/stm32l4x2/stm32_svd-opamp.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | -- This spec has been automatically generated from STM32L4x2.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.OPAMP is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype OPAMP1_CSR_OPAMODE_Field is HAL.UInt2;
subtype OPAMP1_CSR_PGA_GAIN_Field is HAL.UInt2;
subtype OPAMP1_CSR_VM_SEL_Field is HAL.UInt2;
-- OPAMP1 control/status register
type OPAMP1_CSR_Register is record
-- Operational amplifier Enable
OPAEN : Boolean := False;
-- Operational amplifier Low Power Mode
OPALPM : Boolean := False;
-- Operational amplifier PGA mode
OPAMODE : OPAMP1_CSR_OPAMODE_Field := 16#0#;
-- Operational amplifier Programmable amplifier gain value
PGA_GAIN : OPAMP1_CSR_PGA_GAIN_Field := 16#0#;
-- unspecified
Reserved_6_7 : HAL.UInt2 := 16#0#;
-- Inverting input selection
VM_SEL : OPAMP1_CSR_VM_SEL_Field := 16#0#;
-- Non inverted input selection
VP_SEL : Boolean := False;
-- unspecified
Reserved_11_11 : HAL.Bit := 16#0#;
-- Calibration mode enabled
CALON : Boolean := False;
-- Calibration selection
CALSEL : Boolean := False;
-- allows to switch from AOP offset trimmed values to AOP offset
USERTRIM : Boolean := False;
-- Operational amplifier calibration output
CALOUT : Boolean := False;
-- unspecified
Reserved_16_30 : HAL.UInt15 := 16#0#;
-- Operational amplifier power supply range for stability
OPA_RANGE : Boolean := False;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OPAMP1_CSR_Register use record
OPAEN at 0 range 0 .. 0;
OPALPM at 0 range 1 .. 1;
OPAMODE at 0 range 2 .. 3;
PGA_GAIN at 0 range 4 .. 5;
Reserved_6_7 at 0 range 6 .. 7;
VM_SEL at 0 range 8 .. 9;
VP_SEL at 0 range 10 .. 10;
Reserved_11_11 at 0 range 11 .. 11;
CALON at 0 range 12 .. 12;
CALSEL at 0 range 13 .. 13;
USERTRIM at 0 range 14 .. 14;
CALOUT at 0 range 15 .. 15;
Reserved_16_30 at 0 range 16 .. 30;
OPA_RANGE at 0 range 31 .. 31;
end record;
subtype OPAMP1_OTR_TRIMOFFSETN_Field is HAL.UInt5;
subtype OPAMP1_OTR_TRIMOFFSETP_Field is HAL.UInt5;
-- OPAMP1 offset trimming register in normal mode
type OPAMP1_OTR_Register is record
-- Trim for NMOS differential pairs
TRIMOFFSETN : OPAMP1_OTR_TRIMOFFSETN_Field := 16#0#;
-- unspecified
Reserved_5_7 : HAL.UInt3 := 16#0#;
-- Trim for PMOS differential pairs
TRIMOFFSETP : OPAMP1_OTR_TRIMOFFSETP_Field := 16#0#;
-- unspecified
Reserved_13_31 : HAL.UInt19 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OPAMP1_OTR_Register use record
TRIMOFFSETN at 0 range 0 .. 4;
Reserved_5_7 at 0 range 5 .. 7;
TRIMOFFSETP at 0 range 8 .. 12;
Reserved_13_31 at 0 range 13 .. 31;
end record;
subtype OPAMP1_LPOTR_TRIMLPOFFSETN_Field is HAL.UInt5;
subtype OPAMP1_LPOTR_TRIMLPOFFSETP_Field is HAL.UInt5;
-- OPAMP1 offset trimming register in low-power mode
type OPAMP1_LPOTR_Register is record
-- Trim for NMOS differential pairs
TRIMLPOFFSETN : OPAMP1_LPOTR_TRIMLPOFFSETN_Field := 16#0#;
-- unspecified
Reserved_5_7 : HAL.UInt3 := 16#0#;
-- Trim for PMOS differential pairs
TRIMLPOFFSETP : OPAMP1_LPOTR_TRIMLPOFFSETP_Field := 16#0#;
-- unspecified
Reserved_13_31 : HAL.UInt19 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OPAMP1_LPOTR_Register use record
TRIMLPOFFSETN at 0 range 0 .. 4;
Reserved_5_7 at 0 range 5 .. 7;
TRIMLPOFFSETP at 0 range 8 .. 12;
Reserved_13_31 at 0 range 13 .. 31;
end record;
subtype OPAMP2_CSR_OPAMODE_Field is HAL.UInt2;
subtype OPAMP2_CSR_PGA_GAIN_Field is HAL.UInt2;
subtype OPAMP2_CSR_VM_SEL_Field is HAL.UInt2;
-- OPAMP2 control/status register
type OPAMP2_CSR_Register is record
-- Operational amplifier Enable
OPAEN : Boolean := False;
-- Operational amplifier Low Power Mode
OPALPM : Boolean := False;
-- Operational amplifier PGA mode
OPAMODE : OPAMP2_CSR_OPAMODE_Field := 16#0#;
-- Operational amplifier Programmable amplifier gain value
PGA_GAIN : OPAMP2_CSR_PGA_GAIN_Field := 16#0#;
-- unspecified
Reserved_6_7 : HAL.UInt2 := 16#0#;
-- Inverting input selection
VM_SEL : OPAMP2_CSR_VM_SEL_Field := 16#0#;
-- Non inverted input selection
VP_SEL : Boolean := False;
-- unspecified
Reserved_11_11 : HAL.Bit := 16#0#;
-- Calibration mode enabled
CALON : Boolean := False;
-- Calibration selection
CALSEL : Boolean := False;
-- allows to switch from AOP offset trimmed values to AOP offset
USERTRIM : Boolean := False;
-- Operational amplifier calibration output
CALOUT : Boolean := False;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OPAMP2_CSR_Register use record
OPAEN at 0 range 0 .. 0;
OPALPM at 0 range 1 .. 1;
OPAMODE at 0 range 2 .. 3;
PGA_GAIN at 0 range 4 .. 5;
Reserved_6_7 at 0 range 6 .. 7;
VM_SEL at 0 range 8 .. 9;
VP_SEL at 0 range 10 .. 10;
Reserved_11_11 at 0 range 11 .. 11;
CALON at 0 range 12 .. 12;
CALSEL at 0 range 13 .. 13;
USERTRIM at 0 range 14 .. 14;
CALOUT at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype OPAMP2_OTR_TRIMOFFSETN_Field is HAL.UInt5;
subtype OPAMP2_OTR_TRIMOFFSETP_Field is HAL.UInt5;
-- OPAMP2 offset trimming register in normal mode
type OPAMP2_OTR_Register is record
-- Trim for NMOS differential pairs
TRIMOFFSETN : OPAMP2_OTR_TRIMOFFSETN_Field := 16#0#;
-- unspecified
Reserved_5_7 : HAL.UInt3 := 16#0#;
-- Trim for PMOS differential pairs
TRIMOFFSETP : OPAMP2_OTR_TRIMOFFSETP_Field := 16#0#;
-- unspecified
Reserved_13_31 : HAL.UInt19 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OPAMP2_OTR_Register use record
TRIMOFFSETN at 0 range 0 .. 4;
Reserved_5_7 at 0 range 5 .. 7;
TRIMOFFSETP at 0 range 8 .. 12;
Reserved_13_31 at 0 range 13 .. 31;
end record;
subtype OPAMP2_LPOTR_TRIMLPOFFSETN_Field is HAL.UInt5;
subtype OPAMP2_LPOTR_TRIMLPOFFSETP_Field is HAL.UInt5;
-- OPAMP2 offset trimming register in low-power mode
type OPAMP2_LPOTR_Register is record
-- Trim for NMOS differential pairs
TRIMLPOFFSETN : OPAMP2_LPOTR_TRIMLPOFFSETN_Field := 16#0#;
-- unspecified
Reserved_5_7 : HAL.UInt3 := 16#0#;
-- Trim for PMOS differential pairs
TRIMLPOFFSETP : OPAMP2_LPOTR_TRIMLPOFFSETP_Field := 16#0#;
-- unspecified
Reserved_13_31 : HAL.UInt19 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for OPAMP2_LPOTR_Register use record
TRIMLPOFFSETN at 0 range 0 .. 4;
Reserved_5_7 at 0 range 5 .. 7;
TRIMLPOFFSETP at 0 range 8 .. 12;
Reserved_13_31 at 0 range 13 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Operational amplifiers
type OPAMP_Peripheral is record
-- OPAMP1 control/status register
OPAMP1_CSR : aliased OPAMP1_CSR_Register;
-- OPAMP1 offset trimming register in normal mode
OPAMP1_OTR : aliased OPAMP1_OTR_Register;
-- OPAMP1 offset trimming register in low-power mode
OPAMP1_LPOTR : aliased OPAMP1_LPOTR_Register;
-- OPAMP2 control/status register
OPAMP2_CSR : aliased OPAMP2_CSR_Register;
-- OPAMP2 offset trimming register in normal mode
OPAMP2_OTR : aliased OPAMP2_OTR_Register;
-- OPAMP2 offset trimming register in low-power mode
OPAMP2_LPOTR : aliased OPAMP2_LPOTR_Register;
end record
with Volatile;
for OPAMP_Peripheral use record
OPAMP1_CSR at 16#0# range 0 .. 31;
OPAMP1_OTR at 16#4# range 0 .. 31;
OPAMP1_LPOTR at 16#8# range 0 .. 31;
OPAMP2_CSR at 16#10# range 0 .. 31;
OPAMP2_OTR at 16#14# range 0 .. 31;
OPAMP2_LPOTR at 16#18# range 0 .. 31;
end record;
-- Operational amplifiers
OPAMP_Periph : aliased OPAMP_Peripheral
with Import, Address => System'To_Address (16#40007800#);
end STM32_SVD.OPAMP;
| 36.333333 | 71 | 0.627847 |
2e7431ce75d9402660cd4241b72447c28c437762 | 3,639 | adb | Ada | host/stm32gd-rtc.adb | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 1 | 2021-04-06T07:57:56.000Z | 2021-04-06T07:57:56.000Z | host/stm32gd-rtc.adb | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | null | null | null | host/stm32gd-rtc.adb | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 2 | 2018-05-29T13:59:31.000Z | 2019-02-03T19:48:08.000Z | with STM32_SVD; use STM32_SVD;
with STM32_SVD.PWR; use STM32_SVD.PWR;
with STM32_SVD.EXTI; use STM32_SVD.EXTI;
with STM32_SVD.RCC; use STM32_SVD.RCC;
with STM32_SVD.RTC; use STM32_SVD.RTC;
package body STM32GD.RTC is
procedure Unlock is
begin
RTC_Periph.WPR.KEY := 16#CA#;
RTC_Periph.WPR.KEY := 16#53#;
end Unlock;
procedure Lock is
begin
RTC_Periph.WPR.KEY := 16#FF#;
end Lock;
procedure Read (Date_Time : out Date_Time_Type) is
begin
Date_Time.Day := Natural(RTC_Periph.DR.DU) + Natural(RTC_Periph.DR.DT) * 10;
Date_Time.Month := Natural(RTC_Periph.DR.MU) + Natural(RTC_Periph.DR.MT) * 10;
Date_Time.Year := Natural(RTC_Periph.DR.YU) + Natural(RTC_Periph.DR.YT) * 10;
Date_Time.Hour := Natural(RTC_Periph.TR.HU) + Natural(RTC_Periph.TR.HT) * 10;
Date_Time.Minute := Natural(RTC_Periph.TR.MNU) + Natural(RTC_Periph.TR.MNT) * 10;
Date_Time.Second := Natural(RTC_Periph.TR.SU) + Natural(RTC_Periph.TR.ST) * 10;
end Read;
procedure Print (Date_Time : Date_Time_Type) is
begin
-- Put (Integer'Image (Date_Time.Year));
-- Put (Integer'Image (Date_Time.Month));
-- Put (Integer'Image (Date_Time.Day));
-- Put (Integer'Image (Date_Time.Hour));
-- Put (Integer'Image (Date_Time.Minute));
-- Put_Line (Integer'Image (Date_Time.Second));
null;
end Print;
procedure Add_Seconds (Date_Time : in out Date_Time_Type ;
Second_Delta : Second_Delta_Type) is
Total_Seconds : Natural;
begin
Total_Seconds :=
Date_Time.Second +
Date_Time.Minute * 60 +
Date_Time.Hour * 60 * 60 + Second_Delta;
Date_Time.Second := Total_Seconds mod 60;
Date_Time.Minute := Total_Seconds mod (60 * 60) / 60;
Date_Time.Hour := Total_Seconds / 3600;
if Total_Seconds / (60 * 60) > Hour_Type'Last then
Total_Seconds := Total_Seconds - Hour_Type'Last * (60 * 60);
end if;
Date_Time.Hour := Total_Seconds / (60 * 60);
end Add_Seconds;
procedure Add_Minutes (Date_Time : in out Date_Time_Type ;
Minute_Delta : Minute_Delta_Type) is
Total_Minutes : Natural;
begin
Total_Minutes := Date_Time.Minute + Date_Time.Hour * 60 + Minute_Delta;
Date_Time.Minute := Total_Minutes mod 60;
if Total_Minutes / 60 > Hour_Type'Last then
Total_Minutes := Total_Minutes - Hour_Type'Last * 60;
end if;
Date_Time.Hour := Total_Minutes / 60;
end Add_Minutes;
procedure Set_Alarm (Date_Time : Date_Time_Type) is
begin
Unlock;
RTC_Periph.ISR.ALRAF := 0;
RTC_Periph.CR.ALRAE := 0;
while RTC_Periph.ISR.ALRAWF = 0 loop
null;
end loop;
RTC_Periph.ALRMAR := (
MSK1 => 0,
ST => UInt3 (Date_Time.Second / 10),
SU => UInt4 (Date_Time.Second mod 10),
MSK2 => 0,
MNT => UInt3 (Date_Time.Minute / 10),
MNU => UInt4 (Date_Time.Minute mod 10),
MSK3 => 0,
PM => 0,
HT => UInt2 (Date_Time.Hour / 10),
HU => UInt4 (Date_Time.Hour mod 10),
MSK4 => 1, WDSEL => 0, DT => 0, DU => 0);
RTC_Periph.CR.ALRAE := 1;
RTC_Periph.CR.ALRAIE := 1;
Lock;
EXTI_Periph.IMR.MR.Arr (17) := 1;
EXTI_Periph.RTSR.TR.Arr (17) := 1;
end Set_Alarm;
procedure Init is
begin
RCC_Periph.APB1ENR.PWREN := 1;
RCC_Periph.CSR.LSION := 1;
while RCC_Periph.CSR.LSIRDY = 0 loop
null;
end loop;
PWR_Periph.CR.DBP := 1;
RCC_Periph.BDCR.RTCEN := 1;
RCC_Periph.BDCR.RTCSEL := 2#10#;
end Init;
end STM32GD.RTC;
| 33.081818 | 87 | 0.6205 |
ade14d26d9d1bde59ae26280a0267b1f7dfcc403 | 45,045 | ads | Ada | json-unbounded_codecs.ads | annexi-strayline/ASAP-JSON | 8788f7466dfbd751fd8a3bc2d87b236f933ef858 | [
"BSD-3-Clause"
] | 1 | 2021-09-29T09:47:21.000Z | 2021-09-29T09:47:21.000Z | json-unbounded_codecs.ads | annexi-strayline/ASAP-JSON | 8788f7466dfbd751fd8a3bc2d87b236f933ef858 | [
"BSD-3-Clause"
] | null | null | null | json-unbounded_codecs.ads | annexi-strayline/ASAP-JSON | 8788f7466dfbd751fd8a3bc2d87b236f933ef858 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- JSON Parser/Constructor --
-- --
-- ------------------------------------------------------------------------ --
-- --
-- Copyright (C) 2020-2021, ANNEXI-STRAYLINE Trans-Human Ltd. --
-- All rights reserved. --
-- --
-- Original Contributors: --
-- * Richard Wai (ANNEXI-STRAYLINE) --
-- * Ensi Martini (ANNEXI-STRAYLINE) --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- --
-- * Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A --
-- PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- This is the unbounded codec
with Ada.Iterator_Interfaces;
private with Interfaces;
private with Ada.Finalization;
private with System.Storage_Pools.Subpools;
private with JSON.Fast_Slab_Allocators;
private with JSON.Parser_Machine;
package JSON.Unbounded_Codecs is
----------------
-- JSON_Value --
----------------
-- JSON_Values represent active members of an object, or elements of an
-- array, within a Codec
type JSON_Value(<>) is tagged limited private;
function Kind (Value: JSON_Value) return JSON_Value_Kind;
function Parent_Kind (Value: JSON_Value) return JSON_Structure_Kind;
-- Returns the structure kind of the Parent structure of Value
-- (JSON_Object or JSON_Array).
--
-- Invoking Parent_Kind on the Root object raises Contraint_Error
function Name (Value: JSON_Value) return JSON_String_Value with
Pre'Class => Value.Parent_Kind = JSON_Object;
function UTF8_Name (Value: JSON_Value) return UTF_8_String with
Pre'Class => Value.Parent_Kind = JSON_Object;
-- Returns the name of Value, if it is an Object Member.
-- Constraint_Error is raised if Value is not an Object Member.
function Index (Value: JSON_Value) return Natural;
-- Returns a zero-based index of Value in its structure. This value can be
-- produced for Object Members or Array Elements, but this Index can only
-- be used to index JSON_Array JSON_Structures. In both cases, Index is
-- in the order of deserialization or appendage of the value.
function Value (Value: JSON_Value) return Boolean;
function Value (Value: JSON_Value) return JSON_Integer_Value;
function Value (Value: JSON_Value) return JSON_Float_Value;
function Value (Value: JSON_Value) return JSON_String_Value;
function UTF8_Value (Value: JSON_Value) return UTF_8_String;
-- If the Kind of Value is incompatible with the expected return type,
-- a Discriminent_Check will fail at runtime
-- Note that for structural Kinds (JSON_Object and JSON_Array), the
-- corresponding JSON_Value can be used as an index value for the
-- Unbounded_JSON_Codec
-- Value editing operations --
procedure Value (Target: in out JSON_Value;
Value : in Boolean;
Mutate: in Boolean := False)
with Pre'Class =>
(if not Mutate then Target.Kind in JSON_Boolean | JSON_Null);
procedure Value (Target: in out JSON_Value;
Value : in JSON_Integer_Value;
Mutate: in Boolean := False)
with Pre'Class =>
(if not Mutate then Target.Kind in JSON_Integer | JSON_Null);
procedure Value (Target: in out JSON_Value;
Value : in JSON_Float_Value;
Mutate: in Boolean := False)
with Pre'Class =>
(if not Mutate then Target.Kind in JSON_Float | JSON_Null);
procedure Value (Target: in out JSON_Value;
Value : in JSON_String_Value;
Mutate: in Boolean := False)
with Pre'Class =>
(if not Mutate then Target.Kind in JSON_String | JSON_Null);
-- Sets the value of Target. If Mutate is False, Constraint_Error is
-- raised if the Kind of Target does not fit the type of Value.
--
-- Otherwise, is Mutuate is True, the Target is mutated into the
-- Kind associated with the type of Value.
--
-- Null values can always be set to any type, regardless of the
-- value of Mutate.
--
-- Note: Mutating a JSON_String value to a non-string value
-- of any kind causes the dynamically allocated value to be lost,
-- and the underlying storage is not reclaimed until the codec is
-- finalized.
--
-- It is certainly pathelogical to be mutating any Values frequently
-- or many times, but in the case of JSON_String values specifically,
-- this could appear to cause a memory leak until the Codec is
-- finalized. This behaviour is a result of the performance and low
-- memory fragmentation design, and the sane assumption that these
-- sorts of mutations will not happen more than once per JSON_String
-- value.
procedure Nullify (Target: in out JSON_Value);
-- Sets Target to a 'null' value.
type JSON_Value_Reference (Ref: not null access JSON_Value) is
null record with Implicit_Dereference => Ref;
type JSON_Value_Constant_Reference
(Ref: not null access constant JSON_Value) is
null record with Implicit_Dereference => Ref;
--------------------
-- JSON_Structure --
--------------------
type JSON_Structure is tagged limited private with
Constant_Indexing => Constant_Reference,
Iterator_Element => JSON_Value,
Default_Iterator => Iterate;
-- Represents the root of a JSON_Object or JSON_Array, and is referenced via
-- a corresponding JSON_Object or JSON_Array JSON_Value
function Kind (Structure: JSON_Structure) return JSON_Structure_Kind;
function Length (Structure: JSON_Structure) return Natural;
-- Returns the number of Elements or Members that are direct children of
-- Structure
-- Array indexing --
subtype JSON_Array_Index is Natural;
-- Using the Javascript convention for zero-based indexing
function Constant_Reference (Structure: JSON_Structure;
Index : JSON_Array_Index)
return JSON_Value_Constant_Reference with
Pre'Class => Structure.Kind = JSON_Array and Index < Structure.Length;
-- Index is a Javascript-style, zero-based array index. Note that,
-- internally, the Codec represents the entire JSON object as a tree, and
-- therefore Arrays are internally linked-lists. In order to provide the
-- expected runtime qualities, the first access of a JSON_Array object via
-- this index-based (Constant_)Reference operation causes the array to be
-- "vectorized". Vectorization is done "lazily" since it encurs a
-- potentially high memory cost.
--
-- If the Index is out of range (> Length), Contraint_Error is raised.
-- Object indexing --
function Has_Member (Structure: JSON_Structure; Name: JSON_String_Value)
return Boolean with
Pre'Class => Structure.Kind = JSON_Object;
-- Returns True iff Structure contains a member named Name.
-- A Discrimint_Check fails if Structure is not a JSON_Object.
function Constant_Reference (Structure: JSON_Structure;
Name : JSON_String_Value)
return JSON_Value_Constant_Reference with
Pre'Class => Structure.Has_Member (Name);
-- Name must be a direct name for a member in the the first level
-- of Structure (which must also be an object). Paths cannot be used on
-- JSON_Structure objects. For path indexing, use the Unbounded_JSON_Codec
-- Lookup indexing operations
--
-- If Has_Member (Name) = False, Constraint_Error is raised.
-- Structure Iteration --
type JSON_Structure_Cursor is limited private;
function Has_Value (Position: JSON_Structure_Cursor) return Boolean;
function Constant_Reference (Structure: JSON_Structure;
Position : JSON_Structure_Cursor)
return JSON_Value_Constant_Reference with
Pre'Class => Has_Value (Position);
-- Constraint_Error is raised if Position is not a valid cursor, either
-- because it is null, or because it belongs to a different codec.
package JSON_Structure_Iterators is new Ada.Iterator_Interfaces
(Cursor => JSON_Structure_Cursor,
Has_Element => Has_Value);
function Iterate (Structure: JSON_Structure) return
JSON_Structure_Iterators.Reversible_Iterator'Class;
----------------------------
-- JSON_Mutable_Structure --
----------------------------
type JSON_Mutable_Structure is new JSON_Structure with private with
Variable_Indexing => Reference;
-- JSON_Mutable_Structures are obtained via the Unbounded_JSON_Codec Delve
-- operation, and can be used to obtain variable references for all values
-- within the underlying structure value.
not overriding
function Reference (Structure: in out JSON_Mutable_Structure;
Index : in JSON_Array_Index)
return JSON_Value_Reference with
Pre'Class => Structure.Kind = JSON_Array and Index < Structure.Length;
not overriding
function Reference (Structure: in out JSON_Mutable_Structure;
Name : in JSON_String_Value)
return JSON_Value_Reference with
Pre'Class => Structure.Has_Member (Name);
not overriding
function Reference (Structure: in out JSON_Mutable_Structure;
Position : in JSON_Structure_Cursor)
return JSON_Value_Reference with
Pre'Class => Has_Value (Position);
-- Structure Building --
not overriding
function Append_Null_Member (Structure: in out JSON_Mutable_Structure;
Name : in JSON_String_Value)
return JSON_Value_Reference
with Pre'Class => Structure.Kind = JSON_Object and Name'Length > 0,
Post'Class => Append_Null_Member'Result.Ref.Kind = JSON_Null;
not overriding
function Append_Null_Element (Structure: in out JSON_Mutable_Structure)
return JSON_Value_Reference
with
Pre'Class => Structure.Kind = JSON_Array,
Post'Class => Append_Null_Element'Result.Ref.Kind = JSON_Null;
-- Appends a new null value member or element to the structure, and returns
-- a reference to the new value. The new value can then be mutated normally
not overriding
function Append_Structural_Member
(Structure: in out JSON_Mutable_Structure;
Name : in JSON_String_Value;
Kind : in JSON_Structure_Kind)
return JSON_Value_Reference
with Pre'Class => Structure.Kind = JSON_Object;
not overriding
function Append_Structural_Element
(Structure: in out JSON_Mutable_Structure;
Kind : in JSON_Structure_Kind)
return JSON_Value_Reference
with Pre'Class => Structure.Kind = JSON_Array;
-- Appends a new structure of Kind to Strucure, and returns a reference.
-- The returned reference can be used to obtain a JSON_(Mutable_)Structure
-- from the Codec.
--------------------------
-- Unbounded_JSON_Codec --
--------------------------
type Unbounded_JSON_Codec(<>) is tagged limited private with
Variable_Indexing => Lookup,
Constant_Indexing => Constant_Lookup;
-- Note that the indexing aspects of the codec are intended to facilitate
-- direct path-based lookup. Iteration over the entire Tree can easily be
-- acheived by iterating over the value of Root
-- Tree-wide lookup --
function Path_Exists (Codec: Unbounded_JSON_Codec;
Path : in JSON_String_Value)
return Boolean;
function Lookup (Codec: aliased in out Unbounded_JSON_Codec;
Path : in JSON_String_Value)
return JSON_Value_Reference
with Pre'Class => Codec.Path_Exists (Path);
function Constant_Lookup (Codec: aliased Unbounded_JSON_Codec;
Path : JSON_String_Value)
return JSON_Value_Constant_Reference
with Pre'Class => Codec.Path_Exists (Path);
-- Path is a dot-notation, javascript-style path to a member within some
-- hierarchy of JSON Objects in the Codec. Note that it is the
-- responsibility of the user to ensure name uniqueness, and to avoid using
-- '.' in names of members. Doing so may potentially cause unexpected
-- double-registration errors when deserializing or encoding.
--
-- If Path is not valid (no value exists), a Constraint_Error will be raised
-- due to the null exclusion of the returned reference type.
--
-- Paths CAN include array indexing ("[x]"). These follow javascript
-- conventions (zero-based indexing)
--
-- A hash table is used to accelerate path indexing, making this approach
-- extremely efficient for extracting expected items.
--
-- Examples of Lookup indexing:
--
-- declare
-- My_Codec: Unbounded_JSON_Codec := Unbounded_JSON_Codec'Input (...);
-- begin
-- if My_Codec("Country.Canada.Toronto.Temperatures[0]").Value > 20.0 then
-- ..
-- if My_Codec("My_3D_Array[12][1][0]").Kind = JSON_Null then
--
-- My_Codec("Sender_ID").Value (My_ID); -- Set the ID
function Root (Codec: aliased in out Unbounded_JSON_Codec)
return JSON_Mutable_Structure'Class;
function Constant_Root (Codec: aliased Unbounded_JSON_Codec)
return JSON_Structure'Class;
-- Returns the root structure the represents the entire deserialized
-- JSON object
--
-- If the tree is not Ready, Program_Error is raised.
function Delve (Codec : aliased in out Unbounded_JSON_Codec;
Structure: aliased in out JSON_Value'Class)
return JSON_Mutable_Structure'Class with
Pre'Class => Structure.Kind in JSON_Structure_Kind;
function Constant_Delve (Codec : aliased Unbounded_JSON_Codec;
Structure: aliased JSON_Value'Class)
return JSON_Structure'Class with
Pre'Class => Structure.Kind in JSON_Structure_Kind;
-- Delve effectivly converts a Structure JSON_Value_Reference into a
-- JSON_Structure object that can then be inspected.
--
-- Structure shall be a reference obtained from Codec, otherwise
-- Program_Error is raised.
--
-- Failing the precondition can result in a null check or a discriminent
-- check failure.
-- Construction --
function Construction_Codec (Format : JSON_Structure_Kind := JSON_Object;
Write_Only: Boolean := True)
return Unbounded_JSON_Codec;
-- Initializes a new Codec that is intended for object construction and
-- later serialization.
--
-- Format sets the Kind of the Root structure.
--
-- If Write_Only is True, paths are not registered, and path-based indexing
-- is not available. This improves performance and reduces memory usage for
-- constructions.
-- Parsing and Generation --
function Valid (Codec: Unbounded_JSON_Codec) return Boolean;
-- Returns False if the parser has discovered an invalid condition,
-- including for reasons not necessarily related to the parser (such as an
-- End_Error)
function Invalid_Because_End_Error (Codec: Unbounded_JSON_Codec)
return Boolean
with
Pre'Class => not Codec.Valid;
-- Returns True iff the inValid condition was specifically caused by the
-- raising of Ada.IO_Exceptions.End_Error, indicating the end of a stream.
--
-- The will only be useful when doing stream deserializations
function Error_Message (Codec: Unbounded_JSON_Codec) return String with
Pre'Class => not Codec.Valid;
-- Returns a messages explaining why the parser considers the input to
-- be invalid, which is prepended to a "Line:Column:" indication to
-- give an indication of where the error occured.
--
-- If the tree is Valid, Constraint_Error is raised
function Serialized_Length (Codec: in Unbounded_JSON_Codec)
return Natural;
-- Returns the number of ** UTF_8 ** characters required to serialize
-- (generate) the JSON string representation of the Root object. Note
-- that this value is generated by executing a Serialize dry-run and
-- metering the output.
procedure Serialize (Codec : in Unbounded_JSON_Codec;
Output: out UTF_8_String) with
Pre'Class => Output'Length = Codec.Serialized_Length;
-- Generates a UTF-8 encoded JSON string serialized from the tree.
-- If Output is not large enough, Constraint_Error is raised.
-- If Output is too large, the remaining space is filled with
-- whitespace.
function Serialize (Codec: in Unbounded_JSON_Codec)
return UTF_8_String with
Post'Class => Serialize'Result'Length = Codec.Serialized_Length;
-- Generates a UTF-8 encoded JSON string serialized from the tree. This
-- process is two-pass, since Serialized_Length is invoked to size the
-- returned string.
procedure Serialize
(Output_Stream: not null access Ada.Streams.Root_Stream_Type'Class;
Codec : in Unbounded_JSON_Codec);
-- Generates a UTF-8 encoded JSON string serialized from the tree, and
-- writes it to Output_Stream. Note that this is the most efficient
-- approach, as it is always single-pass.
-- -- NOTE --
-- Deserialization of a Codec never leaves the Codec in an inconsistent
-- state, even if the input is invalid. Serializing a Codec where Valid is
-- False will always produce valid JSON, however the contents of the Codec
-- will likely be incompelete.
function Deserialize (Input: UTF_8_String) return Unbounded_JSON_Codec;
-- Beware of extremely large Inputs. Input is converted into a
-- Wide_Wide_String, and if that fails (such as due to a Storage_Error),
-- the Codec will be invalidated with an "Emergency Stop", which may not
-- be a very helpful message without reading this comment.
function Deserialize
(Source: not null access Ada.Streams.Root_Stream_Type'Class)
return Unbounded_JSON_Codec;
function Deserialize
(Source: not null access Ada.Streams.Root_Stream_Type'Class;
Limits: Codec_Limits)
return Unbounded_JSON_Codec;
function Time_Bounded_Deserialize
(Source: not null access Ada.Streams.Root_Stream_Type'Class;
Budget: in Duration)
return Unbounded_JSON_Codec;
function Time_Bounded_Deserialize
(Source: not null access Ada.Streams.Root_Stream_Type'Class;
Limits: Codec_Limits;
Budget: in Duration)
return Unbounded_JSON_Codec;
-- Given a stream that shall be a UTF-8 text stream encoding a JSON
-- object, Deserialize parses the stream until a complete JSON object
-- has been deserialized.
--
-- Deserialize suppresses any exceptions experienced during the
-- deserialization process. If any such exception occurs, the Codec
-- returned, but is marked inValid.
--
-- The user should check Valid immediately after initializing a Codec
-- with Deserialize, or using 'Input.
--
-- In trule exceptional cases, if the Codec experiences exceptions during
-- initialization of the Unbounded_JSON_Codec object itself (likely
-- a Storage_Error), that exception is propegated.
--
-- This approach to error handling is intended for defensive server
-- environments where any erronious input is discarded as quickly as
-- possible, and the offending client disconnected.
--
-- For more complex error handling, particularily is client feedback
-- is needed, the user should implement their own processes via the
-- FSM_Push facilities
--
-- The Time_Bounded_Deserialize permutations implement integrated
-- "slow loris" attack protection by aborting the decode if the total
-- time spent decoding exceeds Budget before the decode completes.
--
-- The elapsed time is checked after each unicode character is decoded
-- from the Source stream.
--
-- A "slow loris" attack is when a client sends single character
-- transmissions at a rate that is (optimally) just below the connection's
-- receive timeout, thus allowing for a connection to remain active for
-- an extreme amount of time. These permuations thus protect against this
-- buy defining a hard deadline by which the decode operation must complete
procedure Disallowed_Read
(Stream: not null access Ada.Streams.Root_Stream_Type'Class;
Item : out Unbounded_JSON_Codec)
with No_Return;
-- 'Read is not supported, since Codecs are stateful, and thus would require
-- an in-out mode parameter. Invoking 'Read thus raised Program_Error.
for Unbounded_JSON_Codec'Write use Serialize;
for Unbounded_JSON_Codec'Output use Serialize;
for Unbounded_JSON_Codec'Read use Disallowed_Read;
for Unbounded_JSON_Codec'Input use Deserialize;
------------------------------
-- Unbounded_FSM_JSON_Codec --
------------------------------
type Unbounded_FSM_JSON_Codec is limited new Unbounded_JSON_Codec with
private;
-- Default initialized Unbounded_FSM_JSON_Codecs do not have valid
-- Roots. It must be initialized via repeated calls to FSM_Push as
-- described below.
not overriding
function Input_Limited_FSM (Limits: Codec_Limits)
return Unbounded_FSM_JSON_Codec;
-- Used to initalize a codec with input limits for the parser.
not overriding
procedure FSM_Push (Codec : in out Unbounded_FSM_JSON_Codec;
Next_Character: in Wide_Wide_Character;
Halt : out Boolean);
not overriding
procedure FSM_Push (Codec : in out Unbounded_FSM_JSON_Codec;
Next_Characters: in Wide_Wide_String;
Halt : out Boolean);
-- Drives the Finite State Machine parser directly with a single character
-- or sequence of characters.
--
-- FSM_Push should be invoked with new input until Halt is set to True.
--
-- The FSM will Halt for one of two reasons: Either it finished parsing
-- a complete JSON object, or it encountered invalid JSON.
--
-- If Valid is True and Halt is also True, the deserialization has completed
-- successfully.
--
-- Calling FSM_Push after Halt was signaled will have no effect on the
-- Codec, but will cause Error_Message to report encode an incorrect
-- position.
--
-- FSM_Push is not expected to raise exceptions related to the input.
--
-- These operations are exposed to allow for more direct control of
-- Deserialization streaming, particularily to prevent "slow loris" attacks.
--
-- ** FSM_Push must only be called from a Codec initailized from **
-- ** Manual_Parser, otherwise Program_Error is raised. **
--
-- Advanced Users:
-- ---------------
-- The Codec remains "consistent" during parsing, even in the event of an
-- inValid state. This means that the Codec can be queried and even modified
-- before parsing is completed, at the possible risk of exceptions. However
-- there is no danger of errnoneous execution other un-safe effects.
--
-- This could be potentialy useful for doing very early validation of
-- JSON blobs
not overriding
function Root_Initialized (Codec: Unbounded_FSM_JSON_Codec) return Boolean;
-- Returns True if the Root structure exists. This is useful for proactively
-- avoiding exceptions by querying Root before the FSM Halts. (See note for
-- "Advanced Users" above)
for Unbounded_FSM_JSON_Codec'Write use Serialize;
for Unbounded_FSM_JSON_Codec'Output use Serialize;
for Unbounded_FSM_JSON_Codec'Read use Disallowed_Read;
for Unbounded_FSM_JSON_Codec'Input use Deserialize;
-- Note that all of the deserialization operations work just as for regular
-- Unbounded_JSON_Codecs, but these operations drive the same internal FSM,
-- and will render FSM_Push useless, since the FSM state will Halted
-- immediately after deserialization in all cases, and new input will be
-- ignored.
private
--------------------------
-- Fast_Slab_Allocators --
--------------------------
-- A custom subpool-capable storage pool optimized to maximize performance,
-- and especially to minimize heap fragmentation for very high-throughput,
-- long-uptime server applications.
--
-- Each Unbounded_JSON_Codec allocates all items from its own Subpool, and
-- all deallocation occurs at finalization. Additionally, heap allocations
-- are done in constant-size (should be page-sized) allocations (slabs).
-- The Slab size can be set via the AURA configuration package with the
-- configuration value Unbounded_Codec_Slab_Size
package Fast_Slab_Allocators renames JSON.Fast_Slab_Allocators;
-- GNAT Bug workaround. See the Fast_Slab_Allocators spec for details.
Slab_Pool: Fast_Slab_Allocators.Slab_Pool_Designator
renames Fast_Slab_Allocators.Global_Slab_Pool;
subtype Subpool_Handle is System.Storage_Pools.Subpools.Subpool_Handle;
use type Subpool_Handle;
------------------
-- Slab_Strings --
------------------
-- Slab_String is a slab allocator-friendly (low fragmentation) unbounded
-- non-contigious string type
package Slab_Strings is
type Slab_String is private;
type Slab_String_Access is access Slab_String with
Storage_Pool => Slab_Pool;
-- Slab_String is kind of a super-private type. If it was general exposed
-- to the outside world, it would be limited. In this case, it is
-- non-limited to permit the mutability of JSON_Value objectes
--
-- Copying a Slab_String will not cause anything crazy to happen, except
-- that it might eventually result in a corrupted string, since two
-- "separate" strings would ultimately start overwriting eachother,
-- however it would still remain technically memory safe, since all
-- slab allocations are deallocated on dinalization of the entire Codec
--
-- Never make copies of Slab_String objects. Either use Transfer, or
-- or ensure the "original" is never used after the copy.
procedure Setup (Target : in out Slab_String;
Subpool: in not null Subpool_Handle);
-- Must be invoked prior to invoking any of the following operations.
function "=" (Left, Right: Slab_String) return Boolean;
procedure Append (Target: in out Slab_String;
Source: in JSON_String_Value);
procedure Clear (Target: in out Slab_String);
procedure Transfer (From: in out Slab_String;
To : out Slab_String);
-- After From is Transfered to To, From is Cleared. To does not need
-- to be Set-up first. To will be associated with the same Subpool as
-- From.
function Length (S: Slab_String) return Natural;
procedure To_JSON_String (Source: in Slab_String;
Target: out JSON_String_Value)
with Pre => Target'Length = Length (Source);
function To_JSON_String (Source: in Slab_String)
return JSON_String_Value;
procedure Write_Stream
(Stream: not null access Ada.Streams.Root_Stream_Type'Class;
Item : in Slab_String);
for Slab_String'Write use Write_Stream;
-- Stream Writing is intended for hashing
Chunk_Size: constant := 64;
-- The static Wide_Wide_Character'Length of each Subpool allocated
-- "chunk" (segment). The string will grow by this size on demand
private
subtype Slab_String_Chunk_Index is Natural range 0 .. Chunk_Size;
type Slab_String_Chunk;
type Slab_String_Chunk_Access is access Slab_String_Chunk with
Storage_Pool => Slab_Pool;
type Slab_String is
record
Subpool : Subpool_Handle := null;
Chain_First : Slab_String_Chunk_Access := null;
Chain_Last : Slab_String_Chunk_Access := null;
Current_Chunk: Slab_String_Chunk_Access := null;
Current_Last : Slab_String_Chunk_Index := 0;
-- Current_Last is the current index of the last character
-- of Current_Chunk, which is the last Chunk of the current
-- string. If Current_Chunk is not Chain_First, then it
-- is taken that all chunks before Current_Chunk are "full"
end record;
end Slab_Strings;
--------------------
-- JSON_Structure --
--------------------
type Node is access all JSON_Value with Storage_Pool => Slab_Pool;
-- We make Node a general access type so that we can assign values of
-- JSON_Value_Reference access discriminents to Node. This will always
-- be safe since the user is not able to create references to JSON_Values
-- that have no been generated via Node allocations, since JSON_Value has
-- unknown descriminents.
type JSON_Structure_Cursor is
record
Target: Node := null;
end record;
-- This is a general access type to allow us to assign reference values
-- (access descriminents pointing at a JSON_Value) to values of this type.
--
-- We know that all JSON_Values coming this way ultimately arrived via
-- allocators, since the user as no way of directly supplying
type Constant_Codec_Access is not null access constant Unbounded_JSON_Codec
with Storage_Size => 0;
type Mutable_Codec_Access is not null access all Unbounded_JSON_Codec
with Storage_Size => 0;
type JSON_Structure is tagged limited
record
Structure_Root: not null Node;
-- Always made to point to a JSON_Value with Kind of JSON_Object or
-- JSON_Array. All children of the structure are children of this
-- node.
Codec_Constant: Constant_Codec_Access;
end record;
type JSON_Mutable_Structure is new JSON_Structure with
record
Codec_Mutable: Mutable_Codec_Access;
end record;
--------------------
-- Node_Hash_Maps --
--------------------
package Node_Hash_Maps is
type Node_Hash_Map is private;
-- Node_Hash_Map is designed to be very compact on default initialization
-- so that it can be included in all structural nodes, only taking up
-- space as needed
--
-- Similar to Slab_Strings, Node_Hash_Map would be limited if it was not
-- such a private type. Copying Node_Hash_Maps will not really cause any
-- issue, except that the Performance values will not be accurate.
--
-- Node_Hash_Maps are made non-limited to preserve internal mutability of
-- the JSON_Value objects (which are publically limited)
procedure Setup (Map : in out Node_Hash_Map;
Subpool: in not null Subpool_Handle);
-- Configures a hash map with an appropriate Subpool for allocations
procedure Register (Path_Map : in out Node_Hash_Map;
Registrant: in not null Node);
-- Use Name or Index component of Registrant (depending on the Parent),
-- and adds that registration to the appropriate map of the Parent,
-- along with the computed full-path registration to the Path_Map
-- Both Register operations also register the full path with the Path_Map
-- Raises Constraint_Error if Path/Name/Index has already been registered
function Lookup_By_Path (Path_Map: Node_Hash_Map;
Path : JSON_String_Value)
return Node;
function Lookup_By_Name (Name_Map: Node_Hash_Map;
Name : JSON_String_Value)
return Node;
function Lookup_By_Index (Index_Map: Node_Hash_Map;
Index : Natural)
return Node;
-- If the lookup fails, a null value is returned
-- Monitoring services
type Match_Level is range 1 .. 4;
Performance_Monitoring: constant Boolean := True;
type Level_Registrations is array (Match_Level) of Natural;
-- Number of registrations per match level
type Performance_Counters is
record
Primary_Registrations : Level_Registrations := (others => 0);
Overflow_Registrations: Level_Registrations := (others => 0);
-- Primary_Registrations are registrations made to the "head table"
-- Secondary_Registrations are registrations made to additional
-- tables added on demand.
--
-- Each tables is indexed with two different alternating hash-based
-- strategies. These strategies are repeated over every even and
-- odd table in the table chain
--
-- Note that invalidation does not affect these numbers (no
-- decrementation)
Total_Tables : Natural := 1;
-- Gives the total number of tables allocated for this map
Saturation_High_Water : Natural := 0;
-- Gives the numer of contigious tables from the first table
-- to be fully saturated. This value gives indications into
-- how efficient registration is for very large or complicated
-- Codecs (particularily for Path_Maps)
Full_Collisions : Natural := 0;
-- Registrations where the full hash value is an exact match,
-- but the hashed name differs. Hopefully this never goes
-- above zero.
end record;
function Performance (Map: Node_Hash_Map) return Performance_Counters;
private
-- See the package body for more detailed discussion of the
-- Node_Hash_Maps architecture
type Node_Hash_Table;
type Node_Hash_Table_Access is access Node_Hash_Table with
Storage_Pool => Slab_Pool;
type Node_Hash_Map is
record
Subpool : Subpool_Handle := null;
Table_Chain : Node_Hash_Table_Access := null;
First_Unsaturated : Node_Hash_Table_Access := null;
Unsaturated_Sequence: Positive := 1;
-- Points to the first Table that is not yet saturated. This is
-- used for registration only, to save time from needing to scan
-- saturated tables, which will tend to be towards the start.
-- The sequence is the number of the table in the chain, which
-- is used to determine if a Primary (odd) or Secondary (even)
-- strategy should be used for that table.
Expected_ID : Slab_Strings.Slab_String_Access := null;
Candidate_ID : Slab_Strings.Slab_String_Access := null;
-- These values are used for name-based lookups, wither for
-- Path_Maps and Name_Maps. These are access values
-- to allow use even if Node_Hash_Map is being accessed with
-- a constant view. These are allocated during Setup.
Profile : Performance_Counters;
end record;
end Node_Hash_Maps;
------------------------
-- JSON_Value (Nodes) --
------------------------
type Value_Container (Kind: JSON_Value_Kind := JSON_Null) is
record
case Kind is
when JSON_Object =>
Name_Map: Node_Hash_Maps.Node_Hash_Map;
First_Member: Node := null;
Last_Member : Node := null;
Member_Count: Natural := 0;
when JSON_Array =>
Index_Map: Node_Hash_Maps.Node_Hash_Map;
First_Element: Node := null;
Last_Element : Node := null;
Element_Count: Natural := 0;
when JSON_String =>
String_Value: Slab_Strings.Slab_String;
when JSON_Integer =>
Integer_Value: JSON_Integer_Value;
when JSON_Float =>
Float_Value: JSON_Float_Value;
when JSON_Boolean =>
Boolean_Value: Boolean;
when JSON_Null =>
null;
end case;
end record;
type JSON_Value is tagged limited
record
Name: Slab_Strings.Slab_String;
-- Name only applies if the value is a direct child of a JSON_Object
Index: Natural;
Root, Parent, Next, Prev: Node := null;
-- Root always points at the Root node of the entire tree
-- (Codec-specific) to which this node belongs. This is used to
-- verify ownership.
--
-- For the actual root JSON_Value, Parent will be null, and Root
-- will be self-referencing (!)
--
-- In general, Root is not used for dereferencing, only for ownership
-- checking.
Codec_Subpool: Subpool_Handle := null;
-- Copied-in from the same-named property of the owning Codec on
-- creation. See that property of Unbounded_JSON_Codec below for
-- more details
Container: Value_Container;
-- The JSON_Value type itself is tagged for greater user convenience.
-- However this means that we cannot give a non-limited full view.
--
-- At the same time, we'd like the actual underlying value to be
-- mutable.
--
-- Keeping the public view limited is crucial for the ability to
-- directly use in-codec data without needing to copy the values,
-- which is a property we want to keep.
--
-- By including this mutable container type to contain the actual
-- value, we are able to get everything to work as we'd like
end record;
--------------------------
-- Unbounded_JSON_Codec --
--------------------------
package Parsers is new JSON.Parser_Machine
(JSON_String_Buffer => Slab_Strings.Slab_String,
JSON_String_Buffer_Config => Subpool_Handle,
Setup_Buffer => Slab_Strings.Setup,
Clear => Slab_Strings.Clear,
Append => Slab_Strings.Append,
Export => Slab_Strings.Transfer,
String_Chunk_Size => Slab_Strings.Chunk_Size);
type Unbounded_JSON_Codec is new Ada.Finalization.Limited_Controlled with
record
Write_Only : Boolean := False;
-- If true, all hashing on append is disabled, and all
-- hash-based lookup causes Constraint_Error
Codec_Subpool: Subpool_Handle := null;
-- For this design, we use a single subpool per Codec, which is
-- used to allocate all nodes, hash tables, and Slab_Strings.
Path_Buffer : Slab_Strings.Slab_String;
-- When appending items to any structure in this codec, a Full_Path
-- needs to be computed so that the path can be added to the Path_Map
--
-- Since Slab_Strings can never have their memory reclaimed until the
-- entire Codec is finalized, we put this one here in the Codec as
-- a kind of scratch buffer to quickly build-out the path when needed.
--
-- Since Slab_Strings are lazily allocated, if this never gets used,
-- that's fine too!
Path_Map : Node_Hash_Maps.Node_Hash_Map;
Root_Node : Node;
-- Root_Node is initialized as a JSON_Object
Parser : Parsers.Parser_FSM;
Current_Structure: Node;
-- Current_Structure is a bit of state that the FSM contracts out to
-- the operator (the Codec), who has a bigger picture, and is able
-- to easily know what kind of structure the parent structure is.
-- The FSM uses this to detect invalid JSON more immediately
-- (specifically object members missing names, or array elements
-- having names.
--
-- When the Codec is initialized, this component equals Root_Node
Error: Slab_Strings.Slab_String;
-- Contains a detailed error message when deserialization failed
-- to properly initialize the Codec
End_Error: Boolean := False;
-- Is set to True if an Ada.IO_Exceptions.End_Error is raised during
-- a stream deserialization
end record;
overriding
procedure Initialize (Codec: in out Unbounded_JSON_Codec);
overriding
procedure Finalize (Codec: in out Unbounded_JSON_Codec);
type Unbounded_FSM_JSON_Codec is limited new Unbounded_JSON_Codec with
null record;
end JSON.Unbounded_Codecs;
| 41.66975 | 79 | 0.624797 |
1ac331a0fe8d4eed262eb6413593f4014518871b | 4,825 | ads | Ada | src/drivers/zumo_l3gd20h.ads | yannickmoy/SPARKZumo | 29d4d5d4f00d43d2dafd8d8b8d21eea0769923f3 | [
"MIT"
] | 6 | 2018-04-05T21:05:17.000Z | 2021-06-04T15:24:09.000Z | src/drivers/zumo_l3gd20h.ads | yannickmoy/SPARKZumo | 29d4d5d4f00d43d2dafd8d8b8d21eea0769923f3 | [
"MIT"
] | null | null | null | src/drivers/zumo_l3gd20h.ads | yannickmoy/SPARKZumo | 29d4d5d4f00d43d2dafd8d8b8d21eea0769923f3 | [
"MIT"
] | 3 | 2021-01-18T16:07:40.000Z | 2021-05-03T15:52:13.000Z | -- pragma SPARK_Mode;
with Types; use Types;
with Interfaces.C; use Interfaces.C;
-- @summary
-- Interface to the robots 3-axis gyroscope
--
-- @description
-- This package exposes the interface to the robot's 3 axis gyroscope
--
package Zumo_L3gd20h is
-- The gain to apply to a sensor reading
Gain : constant := 0.07; -- degrees/s/digit
-- True if package is init'd
Initd : Boolean := False;
-- Inits the package. Pin muxing and whatnot.
procedure Init
with Global => (In_Out => Initd),
Pre => not Initd,
Post => Initd;
-- Read the temperature of the sensor
-- @return a byte value with the temperature
function Read_Temp return signed_char
with Pre => Initd;
-- Read the status of the sensor
-- @return a byte value with the status
function Read_Status return Byte
with Pre => Initd;
-- Read the gyro of the sensor
-- @param Data the read data from the sensor
procedure Read_Gyro (Data : out Axis_Data)
with Pre => Initd;
L3GD20H_Exception : exception;
private
-- Reads the WHOAMI register from the sensor and compares it against
-- the known value
procedure Check_WHOAMI;
-- The mapping of registers in the sensor
-- @value WHO_AM_I Device identification register
-- @value CTRL1 control 1 register
-- @value CTRL2 control 2 register
-- @value CTRL3 control 3 register
-- @value CTRL4 control 4 register
-- @value CTRL5 control 5 register
-- @value REFERENCE Digital high pass filter reference value
-- @value OUT_TEMP Temperature data (-1LSB/deg with 8 bit resolution).
-- The value is expressed as two's complement.
-- @value STATUS sensor status register
-- @value OUT_X_L X-axis angular rate data low register
-- @value OUT_X_H X-axis angular rate data high register
-- @value OUT_Y_L Y-axis angular rate data low register
-- @value OUT_Y_H Y-axis angular rate data high register
-- @value OUT_Z_L Z-axis angular rate data low register
-- @value OUT_Z_H Z-axis angular rate data high register
-- @value FIFO_CTRL fifo control register
-- @value FIFO_SRC stored data level in fifo
type Reg_Index is
(WHO_AM_I,
CTRL1,
CTRL2,
CTRL3,
CTRL4,
CTRL5,
REFERENCE,
OUT_TEMP,
STATUS,
OUT_X_L,
OUT_X_H,
OUT_Y_L,
OUT_Y_H,
OUT_Z_L,
OUT_Z_H,
FIFO_CTRL,
FIFO_SRC,
IG_CFG,
IG_SRC,
IG_THS_XH,
IG_THS_XL,
IG_THS_YH,
IG_THS_YL,
IG_THS_ZH,
IG_THS_ZL,
IG_DURATION,
LOW_ODR);
-- Mapping of register enums to actual register addresses
Regs : constant array (Reg_Index) of Byte := (WHO_AM_I => 16#0F#,
CTRL1 => 16#20#,
CTRL2 => 16#21#,
CTRL3 => 16#22#,
CTRL4 => 16#23#,
CTRL5 => 16#24#,
REFERENCE => 16#25#,
OUT_TEMP => 16#26#,
STATUS => 16#27#,
OUT_X_L => 16#28#,
OUT_X_H => 16#29#,
OUT_Y_L => 16#2A#,
OUT_Y_H => 16#2B#,
OUT_Z_L => 16#2C#,
OUT_Z_H => 16#2D#,
FIFO_CTRL => 16#2E#,
FIFO_SRC => 16#2F#,
IG_CFG => 16#30#,
IG_SRC => 16#31#,
IG_THS_XH => 16#32#,
IG_THS_XL => 16#33#,
IG_THS_YH => 16#34#,
IG_THS_YL => 16#35#,
IG_THS_ZH => 16#36#,
IG_THS_ZL => 16#37#,
IG_DURATION => 16#38#,
LOW_ODR => 16#39#);
type Register_Bytes is record
Register : Reg_Index;
Value : Byte;
end record;
type Register_Byte_Array is array (Natural range <>) of Register_Bytes;
end Zumo_L3gd20h;
| 35.740741 | 74 | 0.462591 |
590a3180c431ffc52bf333f424ea75bb21d4213a | 88 | ads | Ada | tests/nonsmoke/functional/CompileTests/experimental_ada_tests/tests/enum_colors.ads | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | 488 | 2015-01-09T08:54:48.000Z | 2022-03-30T07:15:46.000Z | tests/nonsmoke/functional/CompileTests/experimental_ada_tests/tests/enum_colors.ads | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | 174 | 2015-01-28T18:41:32.000Z | 2022-03-31T16:51:05.000Z | tests/nonsmoke/functional/CompileTests/experimental_ada_tests/tests/enum_colors.ads | passlab/rexompiler | 5494df3766ab606e230c5f1785b438a019c9e353 | [
"BSD-3-Clause"
] | 146 | 2015-04-27T02:48:34.000Z | 2022-03-04T07:32:53.000Z | package enum_colors is
type Traffic_Light is (Red, Yellow, Green);
end enum_colors;
| 14.666667 | 45 | 0.761364 |
3d1142aac50436c89b31e19401ce4b87f066d45f | 1,584 | ads | Ada | src/fltk-widgets-inputs-file.ads | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | 1 | 2020-12-18T15:20:13.000Z | 2020-12-18T15:20:13.000Z | src/fltk-widgets-inputs-file.ads | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | null | null | null | src/fltk-widgets-inputs-file.ads | micahwelf/FLTK-Ada | 83e0c58ea98e5ede2cbbb158b42eae44196c3ba7 | [
"Unlicense"
] | null | null | null |
package FLTK.Widgets.Inputs.File is
type File_Input is new Input with private;
type File_Input_Reference (Data : not null access File_Input'Class) is
limited null record with Implicit_Dereference => Data;
package Forge is
function Create
(X, Y, W, H : in Integer;
Text : in String)
return File_Input;
end Forge;
function Get_Down_Box
(This : in File_Input)
return Box_Kind;
procedure Set_Down_Box
(This : in out File_Input;
To : in Box_Kind);
function Get_Error_Color
(This : in File_Input)
return Color;
procedure Set_Error_Color
(This : in out File_Input;
To : in Color);
function Get_Value
(This : in Input)
return String;
procedure Set_Value
(This : in out Input;
To : in String);
procedure Draw
(This : in out File_Input);
function Handle
(This : in out File_Input;
Event : in Event_Kind)
return Event_Outcome;
private
type File_Input is new Input with null record;
overriding procedure Finalize
(This : in out File_Input);
pragma Inline (Get_Down_Box);
pragma Inline (Set_Down_Box);
pragma Inline (Get_Error_Color);
pragma Inline (Set_Error_Color);
pragma Inline (Get_Value);
pragma Inline (Set_Value);
pragma Inline (Draw);
pragma Inline (Handle);
end FLTK.Widgets.Inputs.File;
| 17.217391 | 74 | 0.583965 |
22ae7e27279810c4ab294dcca47c9ed4f13e2759 | 3,126 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnarl/a-astaco.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnarl/a-astaco.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnarl/a-astaco.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . A S Y N C H R O N O U S _ T A S K _ C O N T R O L --
-- --
-- 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. --
-- --
------------------------------------------------------------------------------
-- This is a dummy body, which will not normally be compiled when used with
-- standard versions of GNAT, which do not support this package. See comments
-- in spec for further details.
package body Ada.Asynchronous_Task_Control is
--------------
-- Continue --
--------------
procedure Continue (T : Ada.Task_Identification.Task_Id) is
begin
null;
end Continue;
----------
-- Hold --
----------
procedure Hold (T : Ada.Task_Identification.Task_Id) is
begin
raise Program_Error;
end Hold;
-------------
-- Is_Held --
-------------
function Is_Held (T : Ada.Task_Identification.Task_Id) return Boolean is
begin
return False;
end Is_Held;
end Ada.Asynchronous_Task_Control;
| 47.363636 | 78 | 0.429303 |
1a3e457fa89def6999562201cc7fa8778b6d6809 | 502 | ads | Ada | examples/src/zhelper.ads | sonneveld/adazmq | ee1a3ad1588f6a298fe1170c0e907052dcb7a1a6 | [
"MIT"
] | null | null | null | examples/src/zhelper.ads | sonneveld/adazmq | ee1a3ad1588f6a298fe1170c0e907052dcb7a1a6 | [
"MIT"
] | null | null | null | examples/src/zhelper.ads | sonneveld/adazmq | ee1a3ad1588f6a298fe1170c0e907052dcb7a1a6 | [
"MIT"
] | null | null | null | with ZMQ;
package ZHelper is
function Rand_Of (First : Integer; Last : Integer) return Integer;
function Rand_Of (First : Float; Last : Float) return Float;
-- Provide random number from First .. Last
procedure Dump (S : ZMQ.Socket_Type'Class);
-- Receives all message parts from socket, prints neatly
function Set_Id (S : ZMQ.Socket_Type'Class) return String;
procedure Set_Id (S : ZMQ.Socket_Type'Class);
-- Set simple random printable identity on socket
end ZHelper;
| 29.529412 | 69 | 0.717131 |
3dc9ede1dc2f05cba8481d9429f30e3e0efaae43 | 1,951 | ads | Ada | resources/scripts/api/binaryedge.ads | 0xflotus/Amass | 89a8960c5254031364f966190e841d6951206d47 | [
"Apache-2.0"
] | 2 | 2020-11-29T07:30:31.000Z | 2021-11-14T19:52:31.000Z | resources/scripts/api/binaryedge.ads | 0xflotus/Amass | 89a8960c5254031364f966190e841d6951206d47 | [
"Apache-2.0"
] | null | null | null | resources/scripts/api/binaryedge.ads | 0xflotus/Amass | 89a8960c5254031364f966190e841d6951206d47 | [
"Apache-2.0"
] | 1 | 2020-12-28T06:50:15.000Z | 2020-12-28T06:50:15.000Z | -- Copyright 2017 Jeff Foley. All rights reserved.
-- Use of this source code is governed by Apache 2 LICENSE that can be found in the LICENSE file.
local json = require("json")
name = "BinaryEdge"
type = "api"
function start()
setratelimit(2)
end
function check()
local c
local cfg = datasrc_config()
if cfg ~= nil then
c = cfg.credentials
end
if (c ~= nil and c.key ~= nil and c.key ~= "") then
return true
end
return false
end
function vertical(ctx, domain)
if check() then
apiquery(ctx, domain)
end
end
function apiquery(ctx, domain)
local c
local cfg = datasrc_config()
if cfg ~= nil then
c = cfg.credentials
end
local hdrs={
['X-KEY']=c["key"],
['Content-Type']="application/json",
}
for i=1,500 do
local resp
local vurl = apiurl(domain, i)
-- Check if the response data is in the graph database
if (cfg.ttl ~= nil and cfg.ttl > 0) then
resp = obtain_response(vurl, cfg.ttl)
end
if (resp == nil or resp == "") then
local err
resp, err = request({
url=vurl,
headers=hdrs,
})
if (err ~= nil and err ~= "") then
return
end
if (cfg.ttl ~= nil and cfg.ttl > 0) then
cache_response(vurl, resp)
end
end
local d = json.decode(resp)
if (d == nil or #(d.events) == 0) then
return
end
for i, v in pairs(d.events) do
newname(ctx, v)
end
if (d.page > 500 or d.page > (d.total / d.pagesize)) then
return
end
active(ctx)
checkratelimit()
end
end
function apiurl(domain, pagenum)
return "https://api.binaryedge.io/v2/query/domains/subdomain/" .. domain .. "?page=" .. pagenum
end
| 21.921348 | 99 | 0.526397 |
4122550c4beb736807972e5a7137f0a95986e403 | 314 | ads | Ada | src/main/resources/project-templates/ajis_hello/src_ada/hello.ads | georgemackayshore/Ada-IntelliJ | 581f87237a610b3142aed20358b955bdca807213 | [
"Apache-2.0"
] | 17 | 2018-10-03T21:31:03.000Z | 2021-01-22T04:16:05.000Z | src/main/resources/project-templates/ajis_hello/src_ada/hello.ads | georgemackayshore/Ada-IntelliJ | 581f87237a610b3142aed20358b955bdca807213 | [
"Apache-2.0"
] | 20 | 2018-11-01T21:17:09.000Z | 2021-10-01T18:57:20.000Z | src/main/resources/project-templates/ajis_hello/src_ada/hello.ads | georgemackayshore/Ada-IntelliJ | 581f87237a610b3142aed20358b955bdca807213 | [
"Apache-2.0"
] | 4 | 2020-04-14T15:02:37.000Z | 2022-03-10T20:35:54.000Z | package Hello is
type Printer is abstract tagged null record;
procedure Print_On_Console (P : Printer; V : String) is abstract;
type Ada_Printer is new Printer with null record;
procedure Print_On_Console (P : Ada_Printer; V : String);
procedure Print_Messages (P : Printer'Class);
end Hello;
| 22.428571 | 68 | 0.732484 |
22e70943502fe82fcd8a7c8d145b1d1d6c0e0494 | 4,953 | ads | Ada | source/league/arch/arm/matreshka-simd-arm-neon.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/league/arch/arm/matreshka-simd-arm-neon.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/league/arch/arm/matreshka-simd-arm-neon.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 © 2011-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 Matreshka.SIMD.ARM.NEON is
function vadd_s8 (A : int8x8_t; B : int8x8_t) return int8x8_t;
pragma Inline_Always (vadd_s8);
function vadd_s16 (A : int16x4_t; B : int16x4_t) return int16x4_t;
pragma Inline_Always (vadd_s16);
function vadd_s32 (A : int32x2_t; B : int32x2_t) return int32x2_t;
pragma Inline_Always (vadd_s32);
-- function vadd_s64 (A : int64x1_t; B : int64x1_t) return int64x1_t;
-- pragma Inline_Always (vadd_s64);
-- XXX GNAT 4.5.0 bug
function vadd_f32 (A : float32x2_t; B : float32x2_t) return float32x2_t;
pragma Inline_Always (vadd_f32);
function vadd_u8 (A : uint8x8_t; B : uint8x8_t) return uint8x8_t;
pragma Inline_Always (vadd_u8);
function vadd_u16 (A : uint16x4_t; B : uint16x4_t) return uint16x4_t;
pragma Inline_Always (vadd_u16);
function vadd_u32 (A : uint32x2_t; B : uint32x2_t) return uint32x2_t;
pragma Inline_Always (vadd_u32);
function vadd_u64 (A : uint64x1_t; B : uint64x1_t) return uint64x1_t;
pragma Inline_Always (vadd_u64);
function vaddq_s8 (A : int8x16_t; B : int8x16_t) return int8x16_t;
pragma Inline_Always (vaddq_s8);
function vaddq_s16 (A : int16x8_t; B : int16x8_t) return int16x8_t;
pragma Inline_Always (vaddq_s16);
function vaddq_s32 (A : int32x4_t; B : int32x4_t) return int32x4_t;
pragma Inline_Always (vaddq_s32);
function vaddq_s64 (A : int64x2_t; B : int64x2_t) return int64x2_t;
pragma Inline_Always (vaddq_s64);
function vaddq_f32 (A : float32x4_t; B : float32x4_t) return float32x4_t;
pragma Inline_Always (vaddq_f32);
end Matreshka.SIMD.ARM.NEON;
| 54.428571 | 78 | 0.506562 |
c73f0bce9528073157b47c3560e206cc402bcedb | 3,226 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c8/c83f01d0.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/c83f01d0.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c8/c83f01d0.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C83F01D0M.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.
--*
-- MAIN PROGRAM REQUIRING A SEPARATELY COMPILED PACKAGE BODY SUBUNIT
-- ( C83F01D1.ADA )
-- CHECK THAT INSIDE A PACKAGE BODY NESTED WITHIN A SEPARATELY COMPILED
-- 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).
-- CASE 2: PACKAGE BODY IS A COMPILATION SUBUNIT
-- RM 13 AUGUST 1980
-- RM 29 AUGUST 1980
-- JRK 13 NOV 1980
WITH REPORT;
PROCEDURE C83F01D0M IS
USE REPORT ;
X1 , X2 : INTEGER RANGE 1..23 := 17 ;
Y1 : INTEGER := 157 ;
TYPE T1 IS ( A , B , C) ;
Z : T1 := A ;
PACKAGE C83F01D1 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 := 23 ;
Z : INTEGER := 0 ;
END P ;
END C83F01D1 ;
Y2 : INTEGER := 200 ;
PACKAGE BODY C83F01D1 IS SEPARATE ;
BEGIN
TEST( "C83F01D" , "CHECK THAT INSIDE A PACKAGE BODY" &
" NESTED WITHIN A SEPARATELY" &
" COMPILED PACKAGE BODY SUBUNIT," &
" 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 OUTER PACKAGE" &
" (SPECIFICATION OR BODY)" ) ;
IF X1 /= 17 OR
Z /= A OR
Y2 /= 200 OR
NOT C83F01D1.P.X1 OR
C83F01D1.P.Z /= 23 OR
C83F01D1.P.Y2 /= 55 OR
C83F01D1.P.Y4 /= 55
THEN FAILED( "INCORRECT ACCESSING" );
END IF;
RESULT ;
END C83F01D0M;
| 31.019231 | 79 | 0.579355 |
c708ce54979c4eb86978ed9a65aafdcb232d0786 | 2,297 | ads | Ada | tests/lsc_test_aes.ads | Componolit/libsparkcrypto | 8531a07b6e9f5eb33eae0fa32759b4cbd3509d95 | [
"OpenSSL",
"Unlicense"
] | 30 | 2018-05-18T09:11:50.000Z | 2021-05-18T16:29:14.000Z | tests/lsc_test_aes.ads | Componolit/libsparkcrypto | 8531a07b6e9f5eb33eae0fa32759b4cbd3509d95 | [
"OpenSSL",
"Unlicense"
] | 15 | 2018-12-13T07:53:36.000Z | 2019-09-24T19:43:35.000Z | tests/lsc_test_aes.ads | Componolit/libsparkcrypto | 8531a07b6e9f5eb33eae0fa32759b4cbd3509d95 | [
"OpenSSL",
"Unlicense"
] | 3 | 2019-04-04T17:41:29.000Z | 2021-05-07T22:28:46.000Z | -------------------------------------------------------------------------------
-- This file is part of libsparkcrypto.
--
-- @author Alexander Senier
-- @date 2019-01-16
--
-- Copyright (C) 2018 Componolit GmbH
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
--
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
--
-- * Neither the name of the nor the names of its contributors may be used
-- to endorse or promote products derived from this software without
-- specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS
-- BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-- POSSIBILITY OF SUCH DAMAGE.
-------------------------------------------------------------------------------
with AUnit; use AUnit;
with AUnit.Test_Cases; use AUnit.Test_Cases;
-- @summary Tests AES
package LSC_Test_AES is
type Test_Case is new Test_Cases.Test_Case with null record;
procedure Register_Tests (T : in out Test_Case);
-- Register routines to be run
function Name (T : Test_Case) return Message_String;
-- Provide name identifying the test case
end LSC_Test_AES;
| 44.173077 | 80 | 0.675664 |
3928634250657439ba455fd2bb52d6dad43c31f8 | 786 | adb | Ada | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/fullname_bp/foo.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 31 | 2018-08-01T21:25:24.000Z | 2022-02-14T07:52:34.000Z | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/fullname_bp/foo.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 40 | 2018-12-03T19:48:52.000Z | 2021-03-10T06:34:26.000Z | src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/fullname_bp/foo.adb | alrooney/unum-sdk | bbccb10b0cd3500feccbbef22e27ea111c3d18eb | [
"Apache-2.0"
] | 20 | 2018-11-16T21:19:22.000Z | 2021-10-18T23:08:24.000Z | -- Copyright 2011-2019 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
with Pck; use Pck;
procedure Foo is
begin
Hello;
There;
end Foo;
| 35.727273 | 73 | 0.732824 |
a1b67c22d741b8a3744663c6a88334dcf886999c | 3,351 | ads | Ada | include/sf-network-types.ads | danva994/ASFML-1.6 | bd74ae700843338a15aef295f99297b866aa0c93 | [
"Zlib"
] | 1 | 2017-10-07T06:20:38.000Z | 2017-10-07T06:20:38.000Z | include/sf-network-types.ads | danva994/ASFML-1.6 | bd74ae700843338a15aef295f99297b866aa0c93 | [
"Zlib"
] | 3 | 2020-09-15T21:19:34.000Z | 2022-03-02T23:13:46.000Z | include/sf-network-types.ads | danva994/ASFML-1.6 | bd74ae700843338a15aef295f99297b866aa0c93 | [
"Zlib"
] | 2 | 2020-09-26T21:16:43.000Z | 2022-01-16T19:36:48.000Z | -- ////////////////////////////////////////////////////////////
-- //
-- // SFML - Simple and Fast Multimedia Library
-- // Copyright (C) 2007-2009 Laurent Gomila ([email protected])
-- //
-- // This software is provided 'as-is', without any express or implied warranty.
-- // In no event will the authors be held liable for any damages arising from the use of this software.
-- //
-- // Permission is granted to anyone to use this software for any purpose,
-- // including commercial applications, and to alter it and redistribute it freely,
-- // subject to the following restrictions:
-- //
-- // 1. The origin of this software must not be misrepresented;
-- // you must not claim that you wrote the original software.
-- // If you use this software in a product, an acknowledgment
-- // in the product documentation would be appreciated but is not required.
-- //
-- // 2. Altered source versions must be plainly marked as such,
-- // and must not be misrepresented as being the original software.
-- //
-- // 3. This notice may not be removed or altered from any source distribution.
-- //
-- ////////////////////////////////////////////////////////////
package Sf.Network.Types is
type sfFtpDirectoryResponse is null record;
type sfFtpDirectoryResponse_Ptr is access all sfFtpDirectoryResponse;
type sfFtpListingResponse is null record;
type sfFtpListingResponse_Ptr is access all sfFtpListingResponse;
type sfFtpResponse is null record;
type sfFtpResponse_Ptr is access all sfFtpResponse;
type sfFtp is null record;
type sfFtp_Ptr is access all sfFtp;
type sfHttpRequest is null record;
type sfHttpRequest_Ptr is access all sfHttpRequest;
type sfHttpResponse is null record;
type sfHttpResponse_Ptr is access all sfHttpResponse;
type sfHttp is null record;
type sfHttp_Ptr is access all sfHttp;
type sfPacket is null record;
type sfPacket_Ptr is access all sfPacket;
type sfSelectorTCP is null record;
type sfSelectorTCP_Ptr is access all sfSelectorTCP;
type sfSelectorUDP is null record;
type sfSelectorUDP_Ptr is access all sfSelectorUDP;
type sfSocketTCP is null record;
type sfSocketTCP_Ptr is access all sfSocketTCP;
type sfSocketUDP is null record;
type sfSocketUDP_Ptr is access all sfSocketUDP;
private
pragma Convention (C, sfFtpDirectoryResponse);
pragma Convention (C, sfFtpDirectoryResponse_Ptr);
pragma Convention (C, sfFtpListingResponse);
pragma Convention (C, sfFtpListingResponse_Ptr);
pragma Convention (C, sfFtpResponse);
pragma Convention (C, sfFtpResponse_Ptr);
pragma Convention (C, sfFtp);
pragma Convention (C, sfFtp_Ptr);
pragma Convention (C, sfHttpRequest);
pragma Convention (C, sfHttpRequest_Ptr);
pragma Convention (C, sfHttpResponse);
pragma Convention (C, sfHttpResponse_Ptr);
pragma Convention (C, sfHttp);
pragma Convention (C, sfHttp_Ptr);
pragma Convention (C, sfPacket);
pragma Convention (C, sfPacket_Ptr);
pragma Convention (C, sfSelectorTCP);
pragma Convention (C, sfSelectorTCP_Ptr);
pragma Convention (C, sfSelectorUDP);
pragma Convention (C, sfSelectorUDP_Ptr);
pragma Convention (C, sfSocketTCP);
pragma Convention (C, sfSocketTCP_Ptr);
pragma Convention (C, sfSocketUDP);
pragma Convention (C, sfSocketUDP_Ptr);
end Sf.Network.Types;
| 41.8875 | 104 | 0.717099 |
58bfa15b29f98876d99aa3e032a6341b27137880 | 4,621 | ads | Ada | arch/ARM/STM32/drivers/power_control_stm32f7/stm32-power_control.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 192 | 2016-06-01T18:32:04.000Z | 2022-03-26T22:52:31.000Z | arch/ARM/STM32/drivers/power_control_stm32f7/stm32-power_control.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 239 | 2016-05-26T20:02:01.000Z | 2022-03-31T09:46:56.000Z | arch/ARM/STM32/drivers/power_control_stm32f7/stm32-power_control.ads | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2016-2017, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
package STM32.Power_Control is
procedure Enable;
-- Enable power control module
procedure Disable_Backup_Domain_Protection;
procedure Enable_Backup_Domain_Protection;
function Standby_Flag return Boolean;
-- This flag is set by hardware and cleared only by a POR/PDR (power-on
-- reset/power-down reset) or by calling the Clear_Standby_Flag procedure.
procedure Clear_Standby_Flag;
procedure Set_Power_Down_Deepsleep (Enabled : Boolean := True);
-- When enabled, the MCU enters Standby mode when CPU enters deepsleep.
-- When disabled, the MCU enters Stop mode when CPU enters deepsleep.
procedure Set_Low_Power_Deepsleep (Enabled : Boolean := True);
-- When enabled, the voltage regulator is in low-power during MCU Stop mode.
-- When disabled, the voltage regulator is on during MCU Stop mode.
type Wakeup_Pin is range 1 .. 6;
-- Pin 1 -> PA0
-- Pin 2 -> PA2
-- Pin 3 -> PC1
-- Pin 4 -> PC13
-- Pin 5 -> PI8
-- Pin 6 -> PI11
type Wakeup_Pin_Polarity is (Rising_Edge, Falling_Edge);
function Wakeup_Flag (Pin : Wakeup_Pin) return Boolean;
-- This flag is set by hardware and cleared either by a system reset or by
-- calling the Clear_Wakeup_Flag procedure.
procedure Clear_Wakeup_Flag (Pin : Wakeup_Pin);
procedure Enable_Wakeup_Pin (Pin : Wakeup_Pin;
Enabled : Boolean := True);
-- When enabled, the wakeup pin (PA0) is used for wakeup from Standby mode
-- and forced in input pull down configuration (rising edge on WKUP pin
-- wakes-up the system from Standby mode).
-- When disabled, the wakeup pin is used for general purpose I/O. An event
-- on the wakeup pin does not wakeup the device from Standby mode.
procedure Set_Wakeup_Pin_Polarity (Pin : Wakeup_Pin;
Pol : Wakeup_Pin_Polarity);
-- Set the polarity used for event detection on external wake-up pin
procedure Enter_Standby_Mode
with No_Return;
-- Clear the wakeup and standby flag, set the power-down on CPU deep sleep
-- and trigger MCU deep sleep.
-- MCU gets out of standby with a reset, so this procedure does not return.
end STM32.Power_Control;
| 51.344444 | 80 | 0.595975 |
1a344d1ebe0a6dd38480b40f3db49f488097485f | 61 | ads | Ada | ada-main-big/src/ada-a/i_am_ada.ads | dksmiffs/gnatmake-examples | 237c0cd9fe8d4788f8898509319a3a665d2233b1 | [
"MIT"
] | null | null | null | ada-main-big/src/ada-a/i_am_ada.ads | dksmiffs/gnatmake-examples | 237c0cd9fe8d4788f8898509319a3a665d2233b1 | [
"MIT"
] | null | null | null | ada-main-big/src/ada-a/i_am_ada.ads | dksmiffs/gnatmake-examples | 237c0cd9fe8d4788f8898509319a3a665d2233b1 | [
"MIT"
] | null | null | null | package I_Am_Ada is
procedure Ada_Procedure;
end I_Am_Ada;
| 15.25 | 26 | 0.819672 |
ada7ff369b1288ea4d03e1f81d93116d6d7626c0 | 1,581 | ads | Ada | tier-1/xcb/source/thin/xcb-xcb_render_free_glyphs_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_render_free_glyphs_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_render_free_glyphs_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_render_free_glyphs_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;
glyphset : aliased xcb.xcb_render_glyphset_t;
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_render_free_glyphs_request_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_render_free_glyphs_request_t.Item,
Element_Array => xcb.xcb_render_free_glyphs_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_render_free_glyphs_request_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_render_free_glyphs_request_t.Pointer,
Element_Array => xcb.xcb_render_free_glyphs_request_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_render_free_glyphs_request_t;
| 28.232143 | 79 | 0.677419 |
ad15ecdee40211681aa7defd64b48cf96b8c5de3 | 1,832 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce3002f.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce3002f.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce3002f.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- CE3002F.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 UNBOUNDED HAS TYPE COUNT AND VALUE ZERO.
-- SPS 10/1/82
-- SPS 11/9/82
WITH REPORT;
USE REPORT;
WITH TEXT_IO;
USE TEXT_IO;
PROCEDURE CE3002F IS
BEGIN
TEST ("CE3002F", "CHECK THAT UNBOUNDED HAS TYPE COUNT AND " &
"VALUE ZERO");
DECLARE
Z : COUNT := 0;
BEGIN
IF UNBOUNDED /= COUNT(IDENT_INT(0)) THEN
FAILED ("UNBOUNDED NOT 0");
END IF;
IF UNBOUNDED /= Z THEN
FAILED ("UNBOUNDED NOT COUNT");
END IF;
END;
RESULT;
END CE3002F;
| 32.714286 | 79 | 0.634825 |
adc359d654d1247a7aad9f05762050a3d9b491d1 | 174 | adb | Ada | sanity-checking/tests/0004-ada-shared-lib/src/main.adb | kanigsson/GNAT-FSF-builds | ed582914a8beff20a788a44fa86c8350f83e89c1 | [
"MIT"
] | 5 | 2021-06-04T05:24:49.000Z | 2022-01-23T11:17:29.000Z | sanity-checking/tests/0004-ada-shared-lib/src/main.adb | kanigsson/GNAT-FSF-builds | ed582914a8beff20a788a44fa86c8350f83e89c1 | [
"MIT"
] | 7 | 2021-05-30T14:29:26.000Z | 2022-01-20T09:02:46.000Z | sanity-checking/tests/0004-ada-shared-lib/src/main.adb | kanigsson/GNAT-FSF-builds | ed582914a8beff20a788a44fa86c8350f83e89c1 | [
"MIT"
] | 4 | 2021-05-29T19:07:47.000Z | 2021-11-11T05:53:14.000Z | with Lib_Pack;
with Ada.Text_IO; use Ada.Text_IO;
procedure Main is
begin
Put_Line ("=== Main start ===");
Lib_Pack.Test;
Put_Line ("=== Main end ===");
end Main;
| 15.818182 | 35 | 0.632184 |
22b5a4c678c74b7c54d64c606735d7ec969e4c16 | 1,113 | ads | Ada | src/ada/src/comms/uxas-comms-transport-zeromq_fabric.ads | VVCAS-Sean/OpenUxAS | dcd7be29d182d278a5387908f568d6f8a06b79ee | [
"NASA-1.3"
] | 88 | 2017-08-24T07:02:01.000Z | 2022-03-18T04:34:17.000Z | src/ada/src/comms/uxas-comms-transport-zeromq_fabric.ads | VVCAS-Sean/OpenUxAS | dcd7be29d182d278a5387908f568d6f8a06b79ee | [
"NASA-1.3"
] | 46 | 2017-06-08T18:18:08.000Z | 2022-03-15T18:24:43.000Z | src/ada/src/comms/uxas-comms-transport-zeromq_fabric.ads | VVCAS-Sean/OpenUxAS | dcd7be29d182d278a5387908f568d6f8a06b79ee | [
"NASA-1.3"
] | 53 | 2017-06-22T14:48:05.000Z | 2022-02-15T16:59:38.000Z | -- see OpenUxAS\src\Communications\ZeroMqFabric.h
with UxAS.Comms.Transport.ZeroMQ_Socket_Configurations; use UxAS.Comms.Transport.ZeroMQ_Socket_Configurations;
with ZMQ.Sockets; use ZMQ.Sockets;
with ZMQ.Contexts; use ZMQ.Contexts;
package UxAS.Comms.Transport.ZeroMQ_Fabric is
type ZMQ_Fabric (<>) is tagged limited private;
type Any_Manager is access all ZMQ_Fabric'Class;
type ZMQ_Fabric_Reference is access all ZMQ_Fabric;
function Instance return not null ZMQ_Fabric_Reference;
procedure Destroy;
-- TODO: the C++ version uses pointers to the context and result
--
-- std::unique_ptr<zmq::socket_t>
-- createSocket(ZeroMqSocketConfiguration& socketConfiguration);
procedure Create_Socket
(This : ZMQ_Fabric_Reference;
Config : ZeroMq_Socket_Configuration;
Result : out Socket);
private
type ZMQ_Fabric is tagged limited record
-- std::unique_ptr<zmq::context_t> m_zmqContext;
zmQContext : Context;
end record;
The_Instance : ZMQ_Fabric_Reference;
-- we use lazy allocation...
end UxAS.Comms.Transport.ZeroMQ_Fabric;
| 28.538462 | 110 | 0.750225 |
2e972912548c0d6a9f0c6047c52523e52009244a | 7,397 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-cbprqu.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-cbprqu.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-cbprqu.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- ADA.CONTAINERS.BOUNDED_PRIORITY_QUEUES --
-- --
-- B o d y --
-- --
-- Copyright (C) 2011-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/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
package body Ada.Containers.Bounded_Priority_Queues with
SPARK_Mode => Off
is
package body Implementation is
-------------
-- Dequeue --
-------------
procedure Dequeue
(List : in out List_Type;
Element : out Queue_Interfaces.Element_Type)
is
begin
Element := List.Container.First_Element;
List.Container.Delete_First;
end Dequeue;
procedure Dequeue
(List : in out List_Type;
At_Least : Queue_Priority;
Element : in out Queue_Interfaces.Element_Type;
Success : out Boolean)
is
begin
-- This operation dequeues a high priority item if it exists in the
-- queue. By "high priority" we mean an item whose priority is equal
-- or greater than the value At_Least. The generic formal operation
-- Before has the meaning "has higher priority than". To dequeue an
-- item (meaning that we return True as our Success value), we need
-- as our predicate the equivalent of "has equal or higher priority
-- than", but we cannot say that directly, so we require some logical
-- gymnastics to make it so.
-- If E is the element at the head of the queue, and symbol ">"
-- refers to the "is higher priority than" function Before, then we
-- derive our predicate as follows:
-- original: P(E) >= At_Least
-- same as: not (P(E) < At_Least)
-- same as: not (At_Least > P(E))
-- same as: not Before (At_Least, P(E))
-- But that predicate needs to be true in order to successfully
-- dequeue an item. If it's false, it means no item is dequeued, and
-- we return False as the Success value.
if List.Length = 0
or else Before (At_Least,
Get_Priority (List.Container.First_Element))
then
Success := False;
return;
end if;
List.Dequeue (Element);
Success := True;
end Dequeue;
-------------
-- Enqueue --
-------------
procedure Enqueue
(List : in out List_Type;
New_Item : Queue_Interfaces.Element_Type)
is
P : constant Queue_Priority := Get_Priority (New_Item);
C : List_Types.Cursor;
use List_Types;
Count : Count_Type;
begin
C := List.Container.First;
while Has_Element (C) loop
-- ??? why is following commented out ???
-- if Before (P, Get_Priority (List.Constant_Reference (C))) then
if Before (P, Get_Priority (Element (C))) then
List.Container.Insert (C, New_Item);
exit;
end if;
Next (C);
end loop;
if not Has_Element (C) then
List.Container.Append (New_Item);
end if;
Count := List.Container.Length;
if Count > List.Max_Length then
List.Max_Length := Count;
end if;
end Enqueue;
-------------------
-- First_Element --
-------------------
function First_Element
(List : List_Type) return Queue_Interfaces.Element_Type
is
begin
-- Use Constant_Reference for this. ???
return List.Container.First_Element;
end First_Element;
------------
-- Length --
------------
function Length (List : List_Type) return Count_Type is
begin
return List.Container.Length;
end Length;
----------------
-- Max_Length --
----------------
function Max_Length (List : List_Type) return Count_Type is
begin
return List.Max_Length;
end Max_Length;
end Implementation;
protected body Queue is
------------------
-- Current_Use --
------------------
function Current_Use return Count_Type is
begin
return List.Length;
end Current_Use;
--------------
-- Dequeue --
--------------
entry Dequeue (Element : out Queue_Interfaces.Element_Type)
when List.Length > 0
is
begin
List.Dequeue (Element);
end Dequeue;
--------------------------------
-- Dequeue_Only_High_Priority --
--------------------------------
procedure Dequeue_Only_High_Priority
(At_Least : Queue_Priority;
Element : in out Queue_Interfaces.Element_Type;
Success : out Boolean)
is
begin
List.Dequeue (At_Least, Element, Success);
end Dequeue_Only_High_Priority;
--------------
-- Enqueue --
--------------
entry Enqueue (New_Item : Queue_Interfaces.Element_Type)
when List.Length < Capacity
is
begin
List.Enqueue (New_Item);
end Enqueue;
---------------
-- Peak_Use --
---------------
function Peak_Use return Count_Type is
begin
return List.Max_Length;
end Peak_Use;
end Queue;
end Ada.Containers.Bounded_Priority_Queues;
| 33.170404 | 79 | 0.481952 |
2e2a9eb6e6a5366cb37bd7e37891513aea16f761 | 4,584 | adb | Ada | source/slim-players-common_play_visiters.adb | reznikmm/slimp | acbbb895ba9c2a2dfb28e5065e630326ce958502 | [
"MIT"
] | null | null | null | source/slim-players-common_play_visiters.adb | reznikmm/slimp | acbbb895ba9c2a2dfb28e5065e630326ce958502 | [
"MIT"
] | null | null | null | source/slim-players-common_play_visiters.adb | reznikmm/slimp | acbbb895ba9c2a2dfb28e5065e630326ce958502 | [
"MIT"
] | null | null | null | -- Copyright (c) 2019 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Ada.Calendar;
with Slim.Messages.strm;
with Slim.Players.Displays;
package body Slim.Players.Common_Play_Visiters is
function Image (Seconds : Natural) return League.Strings.Universal_String;
----------
-- BUTN --
----------
overriding procedure BUTN
(Self : in out Visiter;
Message : not null access Slim.Messages.BUTN.BUTN_Message)
is
Player : Players.Player renames Self.Player.all;
Button : constant Slim.Messages.BUTN.Button_Kind := Message.Button;
begin
case Button is
when Slim.Messages.BUTN.Knob_Left | Slim.Messages.BUTN.Volume_Down =>
Player.Volume
(Natural'Max (0, Player.State.Play_State.Volume - 5));
Update_Display (Player);
when Slim.Messages.BUTN.Knob_Right | Slim.Messages.BUTN.Volume_Up =>
Player.Volume
(Natural'Min (100, Player.State.Play_State.Volume + 5));
Update_Display (Player);
when Slim.Messages.BUTN.Pause =>
declare
Map : constant array (Boolean)
of Slim.Messages.strm.Play_Command :=
(False => Slim.Messages.strm.Pause,
True => Slim.Messages.strm.Unpause);
Strm : Slim.Messages.strm.Strm_Message;
begin
Strm.Simple_Command (Map (Player.State.Play_State.Paused));
Write_Message (Player.Socket, Strm);
Player.State.Play_State.Paused :=
not Player.State.Play_State.Paused;
end;
when Slim.Messages.BUTN.Back =>
Player.Stop;
when others =>
null;
end case;
end BUTN;
-----------
-- Image --
-----------
function Image (Seconds : Natural) return League.Strings.Universal_String is
Min : constant Wide_Wide_String :=
Natural'Wide_Wide_Image (Seconds / 60);
Sec : constant Wide_Wide_String :=
Natural'Wide_Wide_Image (Seconds mod 60);
Result : League.Strings.Universal_String;
begin
Result.Append (Min (2 .. Min'Last));
Result.Append (":");
if Sec'Length <= 2 then
Result.Append ("0");
end if;
Result.Append (Sec (2 .. Sec'Last));
return Result;
end Image;
--------------------
-- Update_Display --
--------------------
procedure Update_Display (Self : in out Player) is
use type Ada.Calendar.Time;
Display : Slim.Players.Displays.Display := Self.Get_Display;
State : Player_State renames Self.State;
Time : constant Ada.Calendar.Time := Ada.Calendar.Clock;
Text : League.Strings.Universal_String;
Song : League.Strings.Universal_String;
Seconds : Natural;
function Volume return Wide_Wide_String is
(Natural'Wide_Wide_Image (State.Play_State.Volume));
begin
if State.Kind not in Play_Radio | Play_Files then
return;
end if;
Song := State.Play_State.Current_Song;
Slim.Players.Displays.Clear (Display);
if Time - State.Play_State.Volume_Set_Time < 3.0
or Song.Is_Empty
then
Text.Append ("Volume:");
Text.Append (Volume);
Text.Append ("%");
Slim.Players.Displays.Draw_Text
(Self => Display,
X => 1,
Y => 6,
Font => Self.Font,
Text => Text);
elsif State.Play_State.Paused then
Text.Append ("Pause");
Slim.Players.Displays.Draw_Text
(Self => Display,
X => 1,
Y => 2 - Slim.Fonts.Size (Self.Font, Song).Bottom,
Font => Self.Font,
Text => Text);
elsif State.Kind = Play_Files then
Seconds := State.Play_State.Seconds + State.Offset;
Text.Append (Image (Seconds));
Slim.Players.Displays.Draw_Text
(Self => Display,
X => 158 - Slim.Fonts.Size (Self.Font, Text).Right,
Y => 6,
Font => Self.Font,
Text => Text);
end if;
Slim.Players.Displays.Draw_Text
(Self => Display,
X => 1,
Y => 33 - Slim.Fonts.Size (Self.Font, Song).Top,
Font => Self.Font,
Text => Song);
Slim.Players.Displays.Send_Message (Display);
end Update_Display;
end Slim.Players.Common_Play_Visiters;
| 29.574194 | 79 | 0.5613 |
2e02dfe60bf31eb5f4bf1d517a01c7e8fcb0a932 | 5,950 | adb | Ada | 24-ada/day24.adb | Fabien-Chouteau/aoc-2020 | 94c39b4f33fb3737af14d8da849c0d4297e49710 | [
"MIT"
] | 107 | 2020-12-02T11:39:07.000Z | 2022-02-02T09:34:23.000Z | 24-ada/day24.adb | Fabien-Chouteau/aoc-2020 | 94c39b4f33fb3737af14d8da849c0d4297e49710 | [
"MIT"
] | 4 | 2020-12-18T12:30:49.000Z | 2021-02-18T12:03:24.000Z | 24-ada/day24.adb | Fabien-Chouteau/aoc-2020 | 94c39b4f33fb3737af14d8da849c0d4297e49710 | [
"MIT"
] | 15 | 2020-12-03T12:35:27.000Z | 2021-12-14T20:22:14.000Z | with Ada.Text_IO; use Ada.Text_IO;
with Ada.Command_Line; use Ada.Command_Line;
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with System.Assertions; use System.Assertions;
with Ada.Containers.Hashed_Maps; use Ada.Containers;
with Ada.Characters.Handling; use Ada.Characters.Handling;
procedure Day24 is
type Tile is record
X : Integer;
Y : Integer;
Z : Integer;
end record;
function "+"(T1: Tile; T2: Tile) return Tile is
begin
return (T1.X + T2.X, T1.Y + T2.Y, T1.Z + T2.Z);
end;
type Dir_Kind is (E, SE, SW, W, NW, NE);
Dir_To_Delta : constant array (Dir_Kind) of Tile := (
E => (X => 1, Y => -1, Z => 0),
SE => (X => 0, Y => -1, Z => 1),
SW => (X => -1, Y => 0, Z => 1),
W => (X => -1, Y => 1, Z => 0),
NW => (X => 0, Y => 1, Z => -1),
NE => (X => 1, Y => 0, Z => -1)
);
function Tile_Hash(T: Tile) return Hash_Type is
Result : Long_Integer := Long_Integer(T.X);
begin
Result := Result * 31 + Long_Integer(T.Y);
Result := Result * 97 + Long_Integer(T.Z);
return Hash_Type(Result mod 1_000_000_000);
end;
package Floor is new Ada.Containers.Hashed_Maps
(Key_Type => Tile,
Element_Type => Boolean,
Hash => Tile_Hash,
Equivalent_Keys => "=");
procedure Flip_Tile(F: in out Floor.Map; T: Tile) is
D: Floor.Cursor := Floor.Find(F, T);
begin
if not Floor.Has_Element(D) then
Floor.Insert(F, T, True);
else
Floor.Replace_Element(F, D, not Floor.Element(D));
end if;
end;
function Is_Black(F: in Floor.Map; T: Tile) return Boolean is
C: Floor.Cursor := Floor.Find(F, T);
begin
return Floor.Has_Element(C) and then Floor.Element(C);
end;
function Count_Neighbours(F: in Floor.Map; T: Tile) return Integer is
Result: Integer := 0;
begin
for Dir of Dir_To_Delta loop
if Is_Black(F, T + Dir) then
Result := Result + 1;
end if;
end loop;
return Result;
end;
procedure Set_Tile(F: in out Floor.Map; T: Tile; Value: Boolean) is
C: Floor.Cursor := Floor.Find(F, T);
begin
if Floor.Has_Element(C) then
Floor.Replace_Element(F, C, Value);
else
Floor.Insert(F, T, Value);
end if;
end;
procedure Next_Floor(F1: in Floor.Map; F2: out Floor.Map) is
T : Tile;
Neighbours : Integer;
begin
Floor.Clear(F2);
for C in Floor.Iterate(F1) loop
for Dir of Dir_To_Delta loop
T := Floor.Key(C) + Dir;
Neighbours := Count_Neighbours(F1, T);
if Is_Black(F1, T) then
Set_Tile(F2, T, not (Neighbours = 0 or Neighbours > 2));
else
Set_Tile(F2, T, Neighbours = 2);
end if;
end loop;
end loop;
end;
function Count_Black(F: in Floor.Map) return Integer is
C: Floor.Cursor := Floor.First(F);
Result: Integer := 0;
begin
while Floor.Has_Element(C) loop
if Floor.Element(C) then
Result := Result + 1;
end if;
C := Floor.Next(C);
end loop;
return Result;
end;
function Tile_Image(T: Tile) return String is
begin
return "(" & Integer'Image(T.X) & ", " & Integer'Image(T.Y) & ", " & Integer'Image(T.Z) & ")";
end;
function Next_Dir(Desc: String) return Dir_Kind is
begin
for Dir in Dir_Kind loop
declare
Dir_Str : constant String := To_Lower (Dir'Img);
begin
if Dir_Str'Length <= Desc'Length then
if Desc (Desc'First .. Desc'First + Dir_Str'Length - 1) = Dir_Str then
return Dir;
end if;
end if;
end;
end loop;
Raise_Assert_Failure("Unreachable. Could not get the next direction");
end Next_Dir;
function Parse_Tile(Desc: Unbounded_String) return Tile is
Result : Tile := (X => 0, Y => 0, Z => 0);
Dir: Dir_Kind;
Input: Unbounded_String := Desc;
begin
while Length(Input) > 0 loop
Dir := Next_Dir(To_String (Input));
Input := Unbounded_Slice(Input, Dir'Img'Length + 1, Length(Input));
Result := Result + Dir_To_Delta (Dir);
end loop;
return Result;
end Parse_Tile;
procedure Floor_From_File(File_Path: String; F: out Floor.Map) is
File : File_Type;
T : Tile;
begin
Open(File => File,
Mode => In_File,
Name => File_Path);
while not End_Of_File(File) loop
T := Parse_Tile(To_Unbounded_String(Get_Line(File)));
Flip_Tile(F, T);
end loop;
Close(File);
end;
function Part1(File_Path: String) return Integer is
F : Floor.Map;
begin
Floor_From_File(File_Path, F);
return Count_Black(F);
end;
function Part2(File_Path: String) return Integer is
F : array (0..1) of Floor.Map;
Current : Integer := 0;
begin
Floor_From_File(File_Path, F(Current));
for i in 1..100 loop
Next_Floor(F(Current), F(1 - Current));
Current := 1 - Current;
end loop;
return Count_Black(F(Current));
end;
procedure Solve_File(File_Path: String) is
begin
Put_Line("Input file: " & File_Path);
Put_Line(" Part 1:" & Integer'Image(Part1(File_Path)));
Put_Line(" Part 2:" & Integer'Image(Part2(File_Path)));
end Solve_File;
begin
Put_Line("Amount of args: " & Integer'Image(Argument_Count));
for Arg in 1..Argument_Count loop
Solve_File(Argument(Arg));
end loop;
end Day24;
| 30.357143 | 102 | 0.544874 |
c79278d882c2fa165e86c1f3a406c3b6c402c51a | 2,149 | ads | Ada | source/cvsweb-http.ads | reznikmm/cvsweb2git | ca55075bd5edce7cb10485f46fa397ee86f5e176 | [
"BSD-3-Clause"
] | null | null | null | source/cvsweb-http.ads | reznikmm/cvsweb2git | ca55075bd5edce7cb10485f46fa397ee86f5e176 | [
"BSD-3-Clause"
] | null | null | null | source/cvsweb-http.ads | reznikmm/cvsweb2git | ca55075bd5edce7cb10485f46fa397ee86f5e176 | [
"BSD-3-Clause"
] | null | null | null | -- BSD 3-Clause License
--
-- Copyright (c) 2017, Maxim Reznik
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
--
-- * Redistributions in binary form must reproduce the above copyright notice,
-- this list of conditions and the following disclaimer in the documentation
-- and/or other materials provided with the distribution.
--
-- * Neither the name of the copyright holder nor the names of its
-- contributors may be used to endorse or promote products derived from
-- this software without specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE
-- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF
-- THE POSSIBILITY OF SUCH DAMAGE.
with League.Stream_Element_Vectors;
with AWS.Client;
with League.Strings;
package CvsWeb.HTTP is
type Connection is tagged limited private;
not overriding procedure Get
(Self : in out Connection;
URL : League.Strings.Universal_String;
Result : out League.Stream_Element_Vectors.Stream_Element_Vector;
Success : out Boolean);
private
type Connection is tagged limited record
Ready : Boolean := False;
Server : AWS.Client.HTTP_Connection;
end record;
end CvsWeb.HTTP;
| 39.796296 | 79 | 0.746859 |
1af91817219fba9b5645b11532786f1e28596224 | 1,295 | ads | Ada | gnu/src/gdb/gdb/testsuite/gdb.ada/interface/types.ads | ghsecuritylab/ellcc-mirror | b03a4afac74d50cf0987554b8c0cd8209bcb92a2 | [
"BSD-2-Clause"
] | null | null | null | gnu/src/gdb/gdb/testsuite/gdb.ada/interface/types.ads | ghsecuritylab/ellcc-mirror | b03a4afac74d50cf0987554b8c0cd8209bcb92a2 | [
"BSD-2-Clause"
] | null | null | null | gnu/src/gdb/gdb/testsuite/gdb.ada/interface/types.ads | ghsecuritylab/ellcc-mirror | b03a4afac74d50cf0987554b8c0cd8209bcb92a2 | [
"BSD-2-Clause"
] | null | null | null | -- Copyright 2008-2015 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or modify
-- it under the terms of the GNU General Public License as published by
-- the Free Software Foundation; either version 3 of the License, or
-- (at your option) any later version.
--
-- This program is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of
-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
-- GNU General Public License for more details.
--
-- You should have received a copy of the GNU General Public License
-- along with this program. If not, see <http://www.gnu.org/licenses/>.
package Types is
type Object_Int is interface;
type Another_Int is interface;
type Object_Root is abstract tagged record
X : Natural;
Y : Natural;
end record;
type Object is abstract new Object_Root and Object_Int and Another_Int
with null record;
function Ident (O : Object'Class) return Object'Class;
procedure Do_Nothing (O : in out Object'Class);
type Rectangle is new Object with record
W : Natural;
H : Natural;
end record;
type Circle is new Object with record
R : Natural;
end record;
end Types;
| 30.116279 | 73 | 0.712741 |
ad0c1a15ed30e72b9c7d86e8bc67587908df1d61 | 2,388 | adb | Ada | src/natools-time_statistics-generic_timers.adb | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | src/natools-time_statistics-generic_timers.adb | faelys/natools | 947c004e6f69ca144942c6af40e102d089223cf8 | [
"0BSD"
] | null | null | null | src/natools-time_statistics-generic_timers.adb | 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. --
------------------------------------------------------------------------------
package body Natools.Time_Statistics.Generic_Timers is
------------------
-- Manual Timer --
------------------
not overriding procedure Start (Timer : in out Manual_Timer) is
begin
Timer.Start_Time := Now;
Timer.Running := True;
end Start;
not overriding procedure Stop (Timer : in out Manual_Timer) is
begin
Timer.Backend.Add (Now - Timer.Start_Time);
Timer.Running := False;
end Stop;
not overriding procedure Cancel (Timer : in out Manual_Timer) is
begin
Timer.Running := False;
end Cancel;
---------------------
-- Automatic Timer --
---------------------
not overriding procedure Cancel (Timer : in out Auto_Timer) is
begin
Timer.Reported := True;
end Cancel;
overriding procedure Initialize (Object : in out Auto_Timer) is
begin
Object.Start_Time := Now;
Object.Reported := False;
end Initialize;
overriding procedure Finalize (Object : in out Auto_Timer) is
begin
if not Object.Reported then
Object.Backend.Add (Now - Object.Start_Time);
Object.Reported := True;
end if;
end Finalize;
end Natools.Time_Statistics.Generic_Timers;
| 34.114286 | 78 | 0.558626 |
c778498df08c206d2b295ad6ad2bd550625f3d0d | 2,072 | adb | Ada | src/asf-events-modules.adb | jquorning/ada-asf | ddc697c5dfa4e22c57c6958f4cff27e14d02ce98 | [
"Apache-2.0"
] | 12 | 2015-01-18T23:02:20.000Z | 2022-03-25T15:30:30.000Z | src/asf-events-modules.adb | jquorning/ada-asf | ddc697c5dfa4e22c57c6958f4cff27e14d02ce98 | [
"Apache-2.0"
] | 3 | 2021-01-06T09:44:02.000Z | 2022-02-04T20:20:53.000Z | src/asf-events-modules.adb | jquorning/ada-asf | ddc697c5dfa4e22c57c6958f4cff27e14d02ce98 | [
"Apache-2.0"
] | 4 | 2016-04-12T05:29:00.000Z | 2022-01-24T23:53:59.000Z | -----------------------------------------------------------------------
-- asf-events -- ASF Events
-- Copyright (C) 2009, 2010, 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.
-----------------------------------------------------------------------
package body ASF.Events.Modules is
-- ------------------------------
-- Set a parameter on the message.
-- ------------------------------
procedure Set_Parameter (Message : in out Module_Event;
Name : in String;
Value : in String) is
begin
Message.Props.Set (Name, Value);
end Set_Parameter;
-- ------------------------------
-- Get the parameter with the given name.
-- ------------------------------
function Get_Parameter (Message : in Module_Event;
Name : String) return String is
begin
return Message.Props.Get (Name, "");
end Get_Parameter;
-- ------------------------------
-- Get the value that corresponds to the parameter with the given name.
-- ------------------------------
function Get_Value (Message : in Module_Event;
Name : in String) return Util.Beans.Objects.Object is
begin
if Message.Props.Exists (Name) then
return Util.Beans.Objects.To_Object (Message.Get_Parameter (Name));
else
return Util.Beans.Objects.Null_Object;
end if;
end Get_Value;
end ASF.Events.Modules;
| 38.37037 | 79 | 0.543919 |
adaee7a4b06160ae467c96305bba2f587f8686fc | 2,218 | ads | Ada | software/hal/boards/components/MS5611/ms5611-driver.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 12 | 2017-06-08T14:19:57.000Z | 2022-03-09T02:48:59.000Z | software/hal/boards/components/MS5611/ms5611-driver.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 6 | 2017-06-08T13:13:50.000Z | 2020-05-15T09:32:43.000Z | software/hal/boards/components/MS5611/ms5611-driver.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 3 | 2017-06-30T14:05:06.000Z | 2022-02-17T12:20:45.000Z | -- Institution: Technische Universitaet Muenchen
-- Department: Realtime Computer Systems (RCS)
-- Project: StratoX
--
-- Authors: Emanuel Regnath ([email protected])
-- Martin Becker ([email protected])
with Units;
-- @summary Driver for the Barometer MS5611-01BA03
package MS5611.Driver with SPARK_Mode,
Abstract_State => (State, Coefficients),
Initializes => (State, Coefficients) -- all have defaults in the body
is
type Device_Type is (Baro, NONE);
type Error_Type is (SUCCESS, FAILURE);
subtype Time_Type is Units.Time_Type;
-- FIXME: this is critical: those subtypes don't have 0.0 in their range, thus a constraint error
-- is raised whenever an object of those is declared without initialization.
subtype Temperature_Type is
Units.Temperature_Type range 233.15 .. 358.15; -- (-)40 .. 85degC, limits from datasheet
subtype Pressure_Type is
Units.Pressure_Type range 1000.0 .. 120000.0; -- 10 .. 1200 mbar, limits from datasheet
-- this influences the measurement noise/precision and conversion time
type OSR_Type is (OSR_256, -- 0.012degC/0.065mbar, <0.6ms
OSR_512,
OSR_1024,
OSR_2048,
OSR_4096 -- 0.002degC/0.012mbar, <9.04ms
) with Default_Value => OSR_256;
procedure Reset;
-- send a soft-reset to the device.
procedure Init;
-- initialize the device, get chip-specific compensation values
procedure Update_Val (have_update : out Boolean);
-- trigger measurement update. Should be called periodically.
function Get_Temperature return Temperature_Type;
-- get temperature from buffer
-- @return the last known temperature measurement
function Get_Pressure return Pressure_Type;
-- get barometric pressure from buffer
-- @return the last known pressure measurement
procedure Self_Check (Status : out Error_Type);
-- implements the self-check of the barometer.
-- It checks the measured altitude for validity by
-- comparing them to altitude_offset. Furthermore it can adapt
-- the takeoff altitude.
-- @param Status returns the result of self check
end MS5611.Driver;
| 36.360656 | 101 | 0.696573 |
2e676ec1d1146b1879ce6a1c298dd0cae7a92fd4 | 447 | ada | Ada | Task/Loops-Continue/Ada/loops-continue.ada | djgoku/RosettaCodeData | 91df62d46142e921b3eacdb52b0316c39ee236bc | [
"Info-ZIP"
] | null | null | null | Task/Loops-Continue/Ada/loops-continue.ada | djgoku/RosettaCodeData | 91df62d46142e921b3eacdb52b0316c39ee236bc | [
"Info-ZIP"
] | null | null | null | Task/Loops-Continue/Ada/loops-continue.ada | djgoku/RosettaCodeData | 91df62d46142e921b3eacdb52b0316c39ee236bc | [
"Info-ZIP"
] | null | null | null | with Ada.Text_IO;
use Ada.Text_IO;
procedure Loop_Continue is
begin
for I in 1..10 loop
Put (Integer'Image(I));
if I = 5 or I = 10 then
New_Line;
goto Continue;
end if;
Put (",");
-- label must be followed by a statement.
<<Continue>>
null;
end loop;
end Loop_Continue;
| 24.833333 | 57 | 0.42953 |
2ef4eb52059dd175305305aae6f8856b613329c6 | 4,138 | adb | Ada | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/g-comver.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/g-comver.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/g-comver.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T . C O M P I L E R _ V E R S I O N --
-- --
-- B o d y --
-- --
-- Copyright (C) 2002-2021, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package provides a routine for obtaining the version number of the
-- GNAT compiler used to compile the program. It relies on the generated
-- constant in the binder generated package that records this information.
with System;
package body GNAT.Compiler_Version is
Ver_Len_Max : constant := 64;
-- This is logically a reference to Gnatvsn.Ver_Len_Max but we cannot
-- import this directly since run-time units cannot WITH compiler units.
Ver_Prefix : constant String := "GNAT Version: ";
-- This is logically a reference to Gnatvsn.Ver_Prefix but we cannot
-- import this directly since run-time units cannot WITH compiler units.
GNAT_Version_Address : constant System.Address;
pragma Import (C, GNAT_Version_Address, "__gnat_version_address");
GNAT_Version : constant String (1 .. Ver_Len_Max + Ver_Prefix'Length);
pragma Import (Ada, GNAT_Version);
for GNAT_Version'Address use GNAT_Version_Address;
-- Use a level of indirection via __gnat_version_address to avoid LTO
-- type mismtch warnings between two string objects of potentially
-- different size.
-------------
-- Version --
-------------
function Version return String is
begin
-- Search for terminating right paren or NUL ending the string
for J in Ver_Prefix'Length + 1 .. GNAT_Version'Last loop
if GNAT_Version (J) = ')' then
return GNAT_Version (Ver_Prefix'Length + 1 .. J);
end if;
if GNAT_Version (J) = Character'Val (0) then
return GNAT_Version (Ver_Prefix'Length + 1 .. J - 1);
end if;
end loop;
-- This should not happen (no right paren or NUL found)
return GNAT_Version;
end Version;
end GNAT.Compiler_Version;
| 50.463415 | 78 | 0.460609 |
ad2095e593e82cfb7b6cffa0322669119d690a27 | 3,369 | adb | Ada | src/usb-device-hid-gamepad.adb | Fabien-Chouteau/usb_embedded | 1adf5e9d74d6408ae355dd7cf0311a3529f8a260 | [
"BSD-3-Clause"
] | 14 | 2021-04-22T14:56:07.000Z | 2022-03-07T15:32:09.000Z | src/usb-device-hid-gamepad.adb | Fabien-Chouteau/usb_embedded | 1adf5e9d74d6408ae355dd7cf0311a3529f8a260 | [
"BSD-3-Clause"
] | 2 | 2021-09-24T21:33:55.000Z | 2021-11-19T13:46:58.000Z | src/usb-device-hid-gamepad.adb | Fabien-Chouteau/usb_embedded | 1adf5e9d74d6408ae355dd7cf0311a3529f8a260 | [
"BSD-3-Clause"
] | 3 | 2021-09-24T20:53:31.000Z | 2022-03-04T17:37:01.000Z | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2018-2021, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with Ada.Unchecked_Conversion;
package body USB.Device.HID.Gamepad is
--------------
-- Set_Axis --
--------------
procedure Set_Axis (This : in out Instance;
A : Axis;
Value : Interfaces.Integer_8)
is
function To_UInt8 is new Ada.Unchecked_Conversion (Interfaces.Integer_8,
UInt8);
begin
This.Report (This.Report'First + (case A is
when X => 0,
when Y => 1,
when Z => 2,
when Rx => 3,
when Ry => 4,
when Rz => 5)) := To_UInt8 (Value);
end Set_Axis;
-----------------
-- Set_Buttons --
-----------------
procedure Set_Buttons (This : in out Instance;
Buttons : UInt8)
is
begin
This.Report (This.Report'Last) := Buttons;
end Set_Buttons;
end USB.Device.HID.Gamepad;
| 48.826087 | 78 | 0.483526 |
ade3a5fe1170ffe0730a266e4ce6dcd949026ff7 | 1,179 | ads | Ada | .emacs.d/elpa/ada-mode-6.1.1/run_gpr_parse.ads | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/ada-mode-6.1.1/run_gpr_parse.ads | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/ada-mode-6.1.1/run_gpr_parse.ads | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | -- Abstract :
--
-- Run the gpr parser standalone. Useful for debugging grammar issues.
--
-- Copyright (C) 2017, 2018 Free Software Foundation, Inc.
--
-- This program is free software; you can redistribute it and/or
-- modify it under terms of the GNU General Public License as
-- published by the Free Software Foundation; either version 3, or (at
-- your option) any later version. This 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
-- distributed with this program; see file COPYING. If not, write to
-- the Free Software Foundation, 51 Franklin Street, Suite 500, Boston,
-- MA 02110-1335, USA.
pragma License (GPL);
with Gen_Run_Wisi_LR_Parse;
with Gpr_Process_Actions;
with Gpr_Process_LR1_Main;
with Wisi.Gpr;
procedure Run_Gpr_Parse is new Gen_Run_Wisi_LR_Parse
(Wisi.Gpr.Parse_Data_Type,
Gpr_Process_Actions.Descriptor,
null,
null,
null,
Gpr_Process_LR1_Main.Create_Parser);
| 36.84375 | 72 | 0.757422 |
2e6ba329e9f5064be69233bf4322cc71efd40b20 | 162 | ada | Ada | Task/Variable-size-Get/Ada/variable-size-get.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:38.000Z | 2018-11-09T22:08:38.000Z | Task/Variable-size-Get/Ada/variable-size-get.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/Variable-size-Get/Ada/variable-size-get.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:40.000Z | 2018-11-09T22:08:40.000Z | Int_Bits : constant Integer := Integer'size;
Whole_Bytes : constant Integer := Int_Bits / Storage_Unit; -- Storage_Unit is the number of bits per storage element
| 54 | 116 | 0.777778 |
adecc838e145e640db1274484340e88f256111f7 | 3,309 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/bindo.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/bindo.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/bindo.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- B I N D O --
-- --
-- S p e c --
-- --
-- Copyright (C) 2019-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING3. If not, go to --
-- http://www.gnu.org/licenses for a complete copy of the license. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- The following unit contains the main entry point into the elaboration order
-- mechanism. See the body for details.
with ALI; use ALI;
with Namet; use Namet;
package Bindo is
-- The following type represents the various phases of the elaboration
-- order mechanism.
type Elaboration_Phase is
(Component_Discovery,
Cycle_Diagnostics,
Cycle_Discovery,
Cycle_Validation,
Elaboration_Order_Validation,
Invocation_Graph_Construction,
Invocation_Graph_Validation,
Library_Graph_Augmentation,
Library_Graph_Construction,
Library_Graph_Elaboration,
Library_Graph_Validation,
Unit_Collection,
Unit_Elaboration);
-- The following type represents the various kinds of precedence between
-- two items.
type Precedence_Kind is
(Lower_Precedence,
Equal_Precedence,
Higher_Precedence);
procedure Find_Elaboration_Order
(Order : out Unit_Id_Table;
Main_Lib_File : File_Name_Type);
-- Find an order of all units in the bind that need to be elaborated
-- such that elaboration code flow, pragmas Elaborate, Elaborate_All,
-- and Elaborate_Body, and with clause dependencies are all honoured.
-- Main_Lib_File is the argument of the bind. If a satisfactory order
-- exists, it is returned in Order, otherwise Unrecoverable_Error is
-- raised.
end Bindo;
| 46.605634 | 79 | 0.516772 |
22dffab69efc22d9753959868622d546fabec726 | 2,036 | ads | Ada | tests/kat/kmac_runner.ads | damaki/libkeccak | d06217e525f7927380690d6c37b485bdbe8aa96e | [
"BSD-3-Clause"
] | 26 | 2015-09-20T17:52:38.000Z | 2021-07-29T21:47:04.000Z | tests/kat/kmac_runner.ads | damaki/libkeccak | d06217e525f7927380690d6c37b485bdbe8aa96e | [
"BSD-3-Clause"
] | 3 | 2019-03-12T16:01:36.000Z | 2020-05-23T13:06:43.000Z | tests/kat/kmac_runner.ads | damaki/libkeccak | d06217e525f7927380690d6c37b485bdbe8aa96e | [
"BSD-3-Clause"
] | 2 | 2019-04-15T18:02:19.000Z | 2020-11-22T11:22:18.000Z | -------------------------------------------------------------------------------
-- Copyright (c) 2019, Daniel King
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
-- * Redistributions of source code must retain the above copyright
-- notice, this list of conditions and the following disclaimer.
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
-- * The name of the copyright holder may not be used to endorse or promote
-- Products derived from this software without specific prior written
-- permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER BE LIABLE FOR ANY
-- DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
-- (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
-- LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
-- ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
-- THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
-------------------------------------------------------------------------------
with Keccak.Generic_KMAC;
generic
with package KMAC is new Keccak.Generic_KMAC(<>);
package KMAC_Runner is
procedure Run_Tests (File_Name : in String;
XOF : in Boolean;
Num_Passed : out Natural;
Num_Failed : out Natural);
end KMAC_Runner;
| 52.205128 | 79 | 0.663065 |
c7f574252589fa3c71490cf8f39aa2bea630312c | 526 | adb | Ada | memsim-master/src/parser-parse_shift.adb | strenkml/EE368 | 00f15bce9e65badddc613355643b1061fd4a8195 | [
"MIT"
] | null | null | null | memsim-master/src/parser-parse_shift.adb | strenkml/EE368 | 00f15bce9e65badddc613355643b1061fd4a8195 | [
"MIT"
] | null | null | null | memsim-master/src/parser-parse_shift.adb | strenkml/EE368 | 00f15bce9e65badddc613355643b1061fd4a8195 | [
"MIT"
] | null | null | null |
with Memory.Transform.Shift; use Memory.Transform.Shift;
with Parser.Transform_Parser;
separate (Parser)
procedure Parse_Shift(parser : in out Parser_Type;
result : out Memory_Pointer) is
package Shift_Parser is new Transform_Parser(
T_Type => Memory.Transform.Shift.Shift_Type,
T_Pointer => Memory.Transform.Shift.Shift_Pointer,
Create_Transform => Memory.Transform.Shift.Create_Shift
);
begin
Shift_Parser.Parse(parser, result);
end Parse_Shift;
| 26.3 | 64 | 0.69962 |
2270c0b1f106f3a6c9fc92129461b0ec4b5e2bf4 | 12,645 | adb | Ada | source/web/tools/wsdl2ada/wsdl-name_resolvers.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/web/tools/wsdl2ada/wsdl-name_resolvers.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/web/tools/wsdl2ada/wsdl-name_resolvers.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Tools Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012-2013, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with League.Strings;
with WSDL.AST.Bindings;
pragma Unreferenced (WSDL.AST.Bindings);
-- GNAT Pro 7.2.0w (20130423): package is needed to access to type's
-- components.
with WSDL.AST.Descriptions;
pragma Unreferenced (WSDL.AST.Descriptions);
-- GNAT Pro 7.2.0w (20130423): package is needed to access to type's
-- components.
with WSDL.AST.Faults;
pragma Unreferenced (WSDL.AST.Faults);
-- GNAT Pro 7.2.0w (20130423): package is needed to access to type's
-- components.
with WSDL.AST.Interfaces;
pragma Unreferenced (WSDL.AST.Interfaces);
-- XXX GNAT 20130108 reports that unit is not referenced.
with WSDL.AST.Operations;
pragma Unreferenced (WSDL.AST.Operations);
-- XXX GNAT 20130108 reports that unit is not referenced.
package body WSDL.Name_Resolvers is
use type League.Strings.Universal_String;
use type WSDL.AST.Interface_Operation_Access;
function Resolve_Binding
(Root : not null WSDL.AST.Description_Access;
Namespace_URI : League.Strings.Universal_String;
Local_Name : League.Strings.Universal_String)
return WSDL.AST.Binding_Access;
-- Resolves binding component by qualified name.
function Resolve_Interface
(Root : not null WSDL.AST.Description_Access;
Namespace_URI : League.Strings.Universal_String;
Local_Name : League.Strings.Universal_String)
return WSDL.AST.Interface_Access;
-- Resolves name of interface component.
function Resolve_Interface_Fault
(Node : not null WSDL.AST.Interface_Access;
Name : WSDL.AST.Qualified_Name)
return WSDL.AST.Interface_Fault_Access;
-- Resolves name of interface operation component.
function Resolve_Interface_Operation
(Node : not null WSDL.AST.Interface_Access;
Local_Name : League.Strings.Universal_String)
return WSDL.AST.Interface_Operation_Access;
-- Resolves name of interface operation component.
procedure Resolve_Interface_Operation
(Node : not null WSDL.AST.Interface_Access;
Local_Name : League.Strings.Universal_String;
Result : out WSDL.AST.Interface_Operation_Access);
-------------------
-- Enter_Binding --
-------------------
overriding procedure Enter_Binding
(Self : in out Name_Resolver;
Node : not null WSDL.AST.Binding_Access;
Control : in out WSDL.Iterators.Traverse_Control)
is
pragma Unreferenced (Control);
begin
-- Resolve interface component when necessary.
if not Node.Interface_Name.Local_Name.Is_Empty then
Node.Interface_Node :=
Resolve_Interface
(Self.Root,
Node.Interface_Name.Namespace_URI,
Node.Interface_Name.Local_Name);
end if;
end Enter_Binding;
-------------------------
-- Enter_Binding_Fault --
-------------------------
overriding procedure Enter_Binding_Fault
(Self : in out Name_Resolver;
Node : not null WSDL.AST.Binding_Fault_Access;
Control : in out WSDL.Iterators.Traverse_Control) is
begin
-- Resolve interface fault component.
Node.Interface_Fault :=
Resolve_Interface_Fault (Node.Parent.Interface_Node, Node.Ref);
end Enter_Binding_Fault;
-----------------------------
-- Enter_Binding_Operation --
-----------------------------
overriding procedure Enter_Binding_Operation
(Self : in out Name_Resolver;
Node : not null WSDL.AST.Binding_Operation_Access;
Control : in out WSDL.Iterators.Traverse_Control)
is
pragma Unreferenced (Self);
pragma Unreferenced (Control);
begin
-- It is unclear from the specification how namespace URI should be
-- used. From the other side, operations are identified uniquely in the
-- interface.
Node.Interface_Operation :=
Resolve_Interface_Operation
(Node.Parent.Interface_Node, Node.Ref.Local_Name);
end Enter_Binding_Operation;
--------------------
-- Enter_Endpoint --
--------------------
overriding procedure Enter_Endpoint
(Self : in out Name_Resolver;
Node : not null WSDL.AST.Endpoints.Endpoint_Access;
Control : in out WSDL.Iterators.Traverse_Control)
is
pragma Unreferenced (Control);
begin
Node.Binding :=
Resolve_Binding
(Self.Root,
Node.Binding_Name.Namespace_URI,
Node.Binding_Name.Local_Name);
end Enter_Endpoint;
---------------------
-- Enter_Interface --
---------------------
overriding procedure Enter_Interface
(Self : in out Name_Resolver;
Node : not null WSDL.AST.Interface_Access;
Control : in out WSDL.Iterators.Traverse_Control)
is
pragma Unreferenced (Control);
begin
for J of Node.Extends loop
Node.Extended_Interfaces.Append
(Resolve_Interface (Self.Root, J.Namespace_URI, J.Local_Name));
end loop;
end Enter_Interface;
-------------------
-- Enter_Service --
-------------------
overriding procedure Enter_Service
(Self : in out Name_Resolver;
Node : not null WSDL.AST.Services.Service_Access;
Control : in out WSDL.Iterators.Traverse_Control)
is
pragma Unreferenced (Control);
begin
-- Resolve interface by qualified name.
Node.Interface_Node :=
Resolve_Interface
(Self.Root,
Node.Interface_Name.Namespace_URI,
Node.Interface_Name.Local_Name);
end Enter_Service;
---------------------
-- Resolve_Binding --
---------------------
function Resolve_Binding
(Root : not null WSDL.AST.Description_Access;
Namespace_URI : League.Strings.Universal_String;
Local_Name : League.Strings.Universal_String)
return WSDL.AST.Binding_Access is
begin
-- QName-resolution-1064: "A Description component MUST NOT have such
-- broken references."
if Root.Target_Namespace /= Namespace_URI then
raise Program_Error;
end if;
if not Root.Bindings.Contains (Local_Name) then
raise Program_Error;
end if;
return Root.Bindings.Element (Local_Name);
end Resolve_Binding;
-----------------------
-- Resolve_Interface --
-----------------------
function Resolve_Interface
(Root : not null WSDL.AST.Description_Access;
Namespace_URI : League.Strings.Universal_String;
Local_Name : League.Strings.Universal_String)
return WSDL.AST.Interface_Access is
begin
-- QName-resolution-1064: "A Description component MUST NOT have such
-- broken references."
if Root.Target_Namespace /= Namespace_URI then
raise Program_Error;
end if;
if not Root.Interfaces.Contains (Local_Name) then
raise Program_Error;
end if;
return Root.Interfaces.Element (Local_Name);
end Resolve_Interface;
-----------------------------
-- Resolve_Interface_Fault --
-----------------------------
function Resolve_Interface_Fault
(Node : not null WSDL.AST.Interface_Access;
Name : WSDL.AST.Qualified_Name)
return WSDL.AST.Interface_Fault_Access
is
use type WSDL.AST.Interface_Fault_Access;
Result : WSDL.AST.Interface_Fault_Access;
begin
if Node.Parent.Target_Namespace = Name.Namespace_URI
and then Node.Interface_Faults.Contains (Name.Local_Name)
then
return Node.Interface_Faults.Element (Name.Local_Name);
end if;
for J of Node.Extended_Interfaces loop
Result := Resolve_Interface_Fault (J, Name);
if Result /= null then
return Result;
end if;
end loop;
raise Program_Error;
end Resolve_Interface_Fault;
---------------------------------
-- Resolve_Interface_Operation --
---------------------------------
procedure Resolve_Interface_Operation
(Node : not null WSDL.AST.Interface_Access;
Local_Name : League.Strings.Universal_String;
Result : out WSDL.AST.Interface_Operation_Access) is
begin
Result := null;
if Node.Interface_Operations.Contains (Local_Name) then
Result := Node.Interface_Operations.Element (Local_Name);
return;
end if;
for J of Node.Extended_Interfaces loop
Resolve_Interface_Operation (J, Local_Name, Result);
if Result /= null then
return;
end if;
end loop;
end Resolve_Interface_Operation;
---------------------------------
-- Resolve_Interface_Operation --
---------------------------------
function Resolve_Interface_Operation
(Node : not null WSDL.AST.Interface_Access;
Local_Name : League.Strings.Universal_String)
return WSDL.AST.Interface_Operation_Access
is
Aux : WSDL.AST.Interface_Operation_Access;
begin
Resolve_Interface_Operation (Node, Local_Name, Aux);
if Aux /= null then
return Aux;
else
raise Program_Error;
end if;
end Resolve_Interface_Operation;
--------------
-- Set_Root --
--------------
procedure Set_Root
(Self : in out Name_Resolver'Class;
Root : WSDL.AST.Description_Access) is
begin
Self.Root := Root;
end Set_Root;
end WSDL.Name_Resolvers;
| 35.321229 | 78 | 0.572242 |
22e20236953f8471af92868fd80a4dff99d70d7f | 911 | adb | Ada | ejercicios1/prueba_divisores.adb | iyan22/AprendeAda | 18bd2a224e5bda30c43d9ceabe0c05278e069ebf | [
"MIT"
] | null | null | null | ejercicios1/prueba_divisores.adb | iyan22/AprendeAda | 18bd2a224e5bda30c43d9ceabe0c05278e069ebf | [
"MIT"
] | null | null | null | ejercicios1/prueba_divisores.adb | iyan22/AprendeAda | 18bd2a224e5bda30c43d9ceabe0c05278e069ebf | [
"MIT"
] | null | null | null |
with ada.text_io, ada.integer_text_io;
use ada.text_io, ada.integer_text_io;
with ada.text_io, ada.integer_text_io;
use ada.text_io, ada.integer_text_io;
with divisores;
procedure prueba_divisores is
n1, divisor:integer:=0;
begin
-- caso de prueba 1:
n1:=4;
put("El resultado deberia de ser 1 2 4:");
new_line;
put("Y tu programa dice que:");
divisores(n1);
new_line;
-- caso de prueba 2:
n1:=20;
put("El resultado deberia de ser 1 2 4 5 10 20:");
new_line;
put("Y tu programa dice que:");
divisores(n1);
new_line;
-- caso de prueba 3:
n1:=1;
put("El resultado deberia de ser 1:");
new_line;
put("Y tu programa dice que:");
divisores(n1);
new_line;
-- caso de prueba 4:
n1:=11;
put("El resultado deberia de ser 1 11:");
new_line;
put("Y tu programa dice que:");
divisores(n1);
new_line;
end prueba_divisores;
| 17.188679 | 53 | 0.641054 |
ad4a461899b70e2bf0592b0e58ea9fabbd850748 | 3,986 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c97201h.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 7 | 2020-05-02T17:34:05.000Z | 2021-10-17T10:15:18.000Z | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c97201h.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c9/c97201h.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C97201H.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- CHECK THAT A RENDEZVOUS REQUESTED BY A CONDITIONAL_ENTRY_CALL
-- IS PERFORMED ONLY IF IMMEDIATELY POSSIBLE.
-- CASE H: THE CORRESPONDING ACCEPT_STATEMENT IS CLOSED
-- AND THIS FACT IS NOT STATICALLY DETERMINABLE.
-- RM 4/22/82
WITH REPORT; USE REPORT;
PROCEDURE C97201H IS
ELSE_BRANCH_TAKEN : BOOLEAN := FALSE ;
RENDEZVOUS_OCCURRED : BOOLEAN := FALSE ;
QUEUE_NOT_EMPTY : BOOLEAN := FALSE ;
X : INTEGER := 17 ;
BEGIN
TEST ("C97201H", "CHECK THAT NO RENDEZVOUS REQUESTED BY" &
" A CONDITIONAL_ENTRY_CALL CAN EVER OCCUR" &
" IF THE CORRESPONDING ACCEPT_STATEMENT IS" &
" CLOSED" );
-------------------------------------------------------------------
DECLARE
TASK T IS
ENTRY DO_IT_NOW_ORELSE( DID_YOU_DO_IT : IN OUT BOOLEAN);
ENTRY KEEP_ALIVE ;
END T ;
TASK BODY T IS
BEGIN
IF DO_IT_NOW_ORELSE'COUNT /= 0 THEN
QUEUE_NOT_EMPTY := TRUE ;
END IF;
SELECT
WHEN 3 = IDENT_INT(5) =>
ACCEPT DO_IT_NOW_ORELSE
( DID_YOU_DO_IT : IN OUT BOOLEAN)
DO
DID_YOU_DO_IT := TRUE ;
END;
OR
ACCEPT KEEP_ALIVE ; -- TO PREVENT SELECT_ERROR
END SELECT;
IF DO_IT_NOW_ORELSE'COUNT /= 0 THEN
QUEUE_NOT_EMPTY := TRUE ;
END IF;
END T ;
BEGIN
COMMENT( "PERMANENTLY CLOSED" );
SELECT
T.DO_IT_NOW_ORELSE( RENDEZVOUS_OCCURRED );
ELSE -- (I.E. CALLER ADOPTS A NO-WAIT POLICY)
-- THEREFORE THIS BRANCH MUST BE CHOSEN
ELSE_BRANCH_TAKEN := TRUE ;
COMMENT( "ELSE_BRANCH TAKEN" );
END SELECT;
T.KEEP_ALIVE ; -- THIS ALSO UPDATES THE NONLOCALS
END; -- END OF BLOCK CONTAINING THE ENTRY CALL
-------------------------------------------------------------------
-- BY NOW, THE TASK IS TERMINATED
IF RENDEZVOUS_OCCURRED
THEN
FAILED( "RENDEZVOUS OCCURRED" );
END IF;
IF QUEUE_NOT_EMPTY
THEN
FAILED( "ENTRY QUEUE NOT EMPTY" );
END IF;
IF ELSE_BRANCH_TAKEN THEN
NULL ;
ELSE
FAILED( "RENDEZVOUS ATTEMPTED?" );
END IF;
RESULT;
END C97201H ;
| 29.746269 | 79 | 0.526091 |
596094c11b529b20a66a37938a8efc44369697ef | 15,093 | ads | Ada | stm32f3/stm32f303xe/svd/stm32_svd-dac.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 1 | 2021-04-06T07:57:56.000Z | 2021-04-06T07:57:56.000Z | stm32f3/stm32f303xe/svd/stm32_svd-dac.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | null | null | null | stm32f3/stm32f303xe/svd/stm32_svd-dac.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 2 | 2018-05-29T13:59:31.000Z | 2019-02-03T19:48:08.000Z | -- This spec has been automatically generated from STM32F303xE.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with System;
package STM32_SVD.DAC is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype CR_EN1_Field is STM32_SVD.Bit;
subtype CR_BOFF1_Field is STM32_SVD.Bit;
subtype CR_TEN1_Field is STM32_SVD.Bit;
subtype CR_TSEL1_Field is STM32_SVD.UInt3;
subtype CR_WAVE1_Field is STM32_SVD.UInt2;
subtype CR_MAMP1_Field is STM32_SVD.UInt4;
subtype CR_DMAEN1_Field is STM32_SVD.Bit;
subtype CR_DMAUDRIE1_Field is STM32_SVD.Bit;
subtype CR_EN2_Field is STM32_SVD.Bit;
subtype CR_BOFF2_Field is STM32_SVD.Bit;
subtype CR_TEN2_Field is STM32_SVD.Bit;
subtype CR_TSEL2_Field is STM32_SVD.UInt3;
subtype CR_WAVE2_Field is STM32_SVD.UInt2;
subtype CR_MAMP2_Field is STM32_SVD.UInt4;
subtype CR_DMAEN2_Field is STM32_SVD.Bit;
subtype CR_DMAUDRIE2_Field is STM32_SVD.Bit;
-- control register
type CR_Register is record
-- DAC channel1 enable
EN1 : CR_EN1_Field := 16#0#;
-- DAC channel1 output buffer disable
BOFF1 : CR_BOFF1_Field := 16#0#;
-- DAC channel1 trigger enable
TEN1 : CR_TEN1_Field := 16#0#;
-- DAC channel1 trigger selection
TSEL1 : CR_TSEL1_Field := 16#0#;
-- DAC channel1 noise/triangle wave generation enable
WAVE1 : CR_WAVE1_Field := 16#0#;
-- DAC channel1 mask/amplitude selector
MAMP1 : CR_MAMP1_Field := 16#0#;
-- DAC channel1 DMA enable
DMAEN1 : CR_DMAEN1_Field := 16#0#;
-- DAC channel1 DMA Underrun Interrupt enable
DMAUDRIE1 : CR_DMAUDRIE1_Field := 16#0#;
-- unspecified
Reserved_14_15 : STM32_SVD.UInt2 := 16#0#;
-- DAC channel2 enable
EN2 : CR_EN2_Field := 16#0#;
-- DAC channel2 output buffer disable
BOFF2 : CR_BOFF2_Field := 16#0#;
-- DAC channel2 trigger enable
TEN2 : CR_TEN2_Field := 16#0#;
-- DAC channel2 trigger selection
TSEL2 : CR_TSEL2_Field := 16#0#;
-- DAC channel2 noise/triangle wave generation enable
WAVE2 : CR_WAVE2_Field := 16#0#;
-- DAC channel2 mask/amplitude selector
MAMP2 : CR_MAMP2_Field := 16#0#;
-- DAC channel2 DMA enable
DMAEN2 : CR_DMAEN2_Field := 16#0#;
-- DAC channel2 DMA underrun interrupt enable
DMAUDRIE2 : CR_DMAUDRIE2_Field := 16#0#;
-- unspecified
Reserved_30_31 : STM32_SVD.UInt2 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR_Register use record
EN1 at 0 range 0 .. 0;
BOFF1 at 0 range 1 .. 1;
TEN1 at 0 range 2 .. 2;
TSEL1 at 0 range 3 .. 5;
WAVE1 at 0 range 6 .. 7;
MAMP1 at 0 range 8 .. 11;
DMAEN1 at 0 range 12 .. 12;
DMAUDRIE1 at 0 range 13 .. 13;
Reserved_14_15 at 0 range 14 .. 15;
EN2 at 0 range 16 .. 16;
BOFF2 at 0 range 17 .. 17;
TEN2 at 0 range 18 .. 18;
TSEL2 at 0 range 19 .. 21;
WAVE2 at 0 range 22 .. 23;
MAMP2 at 0 range 24 .. 27;
DMAEN2 at 0 range 28 .. 28;
DMAUDRIE2 at 0 range 29 .. 29;
Reserved_30_31 at 0 range 30 .. 31;
end record;
-- SWTRIGR_SWTRIG array element
subtype SWTRIGR_SWTRIG_Element is STM32_SVD.Bit;
-- SWTRIGR_SWTRIG array
type SWTRIGR_SWTRIG_Field_Array is array (1 .. 2)
of SWTRIGR_SWTRIG_Element
with Component_Size => 1, Size => 2;
-- Type definition for SWTRIGR_SWTRIG
type SWTRIGR_SWTRIG_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- SWTRIG as a value
Val : STM32_SVD.UInt2;
when True =>
-- SWTRIG as an array
Arr : SWTRIGR_SWTRIG_Field_Array;
end case;
end record
with Unchecked_Union, Size => 2;
for SWTRIGR_SWTRIG_Field use record
Val at 0 range 0 .. 1;
Arr at 0 range 0 .. 1;
end record;
-- software trigger register
type SWTRIGR_Register is record
-- Write-only. DAC channel1 software trigger
SWTRIG : SWTRIGR_SWTRIG_Field :=
(As_Array => False, Val => 16#0#);
-- unspecified
Reserved_2_31 : STM32_SVD.UInt30 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SWTRIGR_Register use record
SWTRIG at 0 range 0 .. 1;
Reserved_2_31 at 0 range 2 .. 31;
end record;
subtype DHR12R1_DACC1DHR_Field is STM32_SVD.UInt12;
-- channel1 12-bit right-aligned data holding register
type DHR12R1_Register is record
-- DAC channel1 12-bit right-aligned data
DACC1DHR : DHR12R1_DACC1DHR_Field := 16#0#;
-- unspecified
Reserved_12_31 : STM32_SVD.UInt20 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DHR12R1_Register use record
DACC1DHR at 0 range 0 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
subtype DHR12L1_DACC1DHR_Field is STM32_SVD.UInt12;
-- channel1 12-bit left aligned data holding register
type DHR12L1_Register is record
-- unspecified
Reserved_0_3 : STM32_SVD.UInt4 := 16#0#;
-- DAC channel1 12-bit left-aligned data
DACC1DHR : DHR12L1_DACC1DHR_Field := 16#0#;
-- unspecified
Reserved_16_31 : STM32_SVD.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DHR12L1_Register use record
Reserved_0_3 at 0 range 0 .. 3;
DACC1DHR at 0 range 4 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype DHR8R1_DACC1DHR_Field is STM32_SVD.Byte;
-- channel1 8-bit right aligned data holding register
type DHR8R1_Register is record
-- DAC channel1 8-bit right-aligned data
DACC1DHR : DHR8R1_DACC1DHR_Field := 16#0#;
-- unspecified
Reserved_8_31 : STM32_SVD.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DHR8R1_Register use record
DACC1DHR at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype DHR12R2_DACC2DHR_Field is STM32_SVD.UInt12;
-- channel2 12-bit right aligned data holding register
type DHR12R2_Register is record
-- DAC channel2 12-bit right-aligned data
DACC2DHR : DHR12R2_DACC2DHR_Field := 16#0#;
-- unspecified
Reserved_12_31 : STM32_SVD.UInt20 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DHR12R2_Register use record
DACC2DHR at 0 range 0 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
subtype DHR12L2_DACC2DHR_Field is STM32_SVD.UInt12;
-- channel2 12-bit left aligned data holding register
type DHR12L2_Register is record
-- unspecified
Reserved_0_3 : STM32_SVD.UInt4 := 16#0#;
-- DAC channel2 12-bit left-aligned data
DACC2DHR : DHR12L2_DACC2DHR_Field := 16#0#;
-- unspecified
Reserved_16_31 : STM32_SVD.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DHR12L2_Register use record
Reserved_0_3 at 0 range 0 .. 3;
DACC2DHR at 0 range 4 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype DHR8R2_DACC2DHR_Field is STM32_SVD.Byte;
-- channel2 8-bit right-aligned data holding register
type DHR8R2_Register is record
-- DAC channel2 8-bit right-aligned data
DACC2DHR : DHR8R2_DACC2DHR_Field := 16#0#;
-- unspecified
Reserved_8_31 : STM32_SVD.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DHR8R2_Register use record
DACC2DHR at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype DHR12RD_DACC1DHR_Field is STM32_SVD.UInt12;
subtype DHR12RD_DACC2DHR_Field is STM32_SVD.UInt12;
-- Dual DAC 12-bit right-aligned data holding register
type DHR12RD_Register is record
-- DAC channel1 12-bit right-aligned data
DACC1DHR : DHR12RD_DACC1DHR_Field := 16#0#;
-- unspecified
Reserved_12_15 : STM32_SVD.UInt4 := 16#0#;
-- DAC channel2 12-bit right-aligned data
DACC2DHR : DHR12RD_DACC2DHR_Field := 16#0#;
-- unspecified
Reserved_28_31 : STM32_SVD.UInt4 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DHR12RD_Register use record
DACC1DHR at 0 range 0 .. 11;
Reserved_12_15 at 0 range 12 .. 15;
DACC2DHR at 0 range 16 .. 27;
Reserved_28_31 at 0 range 28 .. 31;
end record;
subtype DHR12LD_DACC1DHR_Field is STM32_SVD.UInt12;
subtype DHR12LD_DACC2DHR_Field is STM32_SVD.UInt12;
-- DUAL DAC 12-bit left aligned data holding register
type DHR12LD_Register is record
-- unspecified
Reserved_0_3 : STM32_SVD.UInt4 := 16#0#;
-- DAC channel1 12-bit left-aligned data
DACC1DHR : DHR12LD_DACC1DHR_Field := 16#0#;
-- unspecified
Reserved_16_19 : STM32_SVD.UInt4 := 16#0#;
-- DAC channel2 12-bit left-aligned data
DACC2DHR : DHR12LD_DACC2DHR_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DHR12LD_Register use record
Reserved_0_3 at 0 range 0 .. 3;
DACC1DHR at 0 range 4 .. 15;
Reserved_16_19 at 0 range 16 .. 19;
DACC2DHR at 0 range 20 .. 31;
end record;
subtype DHR8RD_DACC1DHR_Field is STM32_SVD.Byte;
subtype DHR8RD_DACC2DHR_Field is STM32_SVD.Byte;
-- DUAL DAC 8-bit right aligned data holding register
type DHR8RD_Register is record
-- DAC channel1 8-bit right-aligned data
DACC1DHR : DHR8RD_DACC1DHR_Field := 16#0#;
-- DAC channel2 8-bit right-aligned data
DACC2DHR : DHR8RD_DACC2DHR_Field := 16#0#;
-- unspecified
Reserved_16_31 : STM32_SVD.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DHR8RD_Register use record
DACC1DHR at 0 range 0 .. 7;
DACC2DHR at 0 range 8 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype DOR1_DACC1DOR_Field is STM32_SVD.UInt12;
-- channel1 data output register
type DOR1_Register is record
-- Read-only. DAC channel1 data output
DACC1DOR : DOR1_DACC1DOR_Field;
-- unspecified
Reserved_12_31 : STM32_SVD.UInt20;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DOR1_Register use record
DACC1DOR at 0 range 0 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
subtype DOR2_DACC2DOR_Field is STM32_SVD.UInt12;
-- channel2 data output register
type DOR2_Register is record
-- Read-only. DAC channel2 data output
DACC2DOR : DOR2_DACC2DOR_Field;
-- unspecified
Reserved_12_31 : STM32_SVD.UInt20;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for DOR2_Register use record
DACC2DOR at 0 range 0 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
subtype SR_DMAUDR1_Field is STM32_SVD.Bit;
subtype SR_DMAUDR2_Field is STM32_SVD.Bit;
-- status register
type SR_Register is record
-- unspecified
Reserved_0_12 : STM32_SVD.UInt13 := 16#0#;
-- DAC channel1 DMA underrun flag
DMAUDR1 : SR_DMAUDR1_Field := 16#0#;
-- unspecified
Reserved_14_28 : STM32_SVD.UInt15 := 16#0#;
-- DAC channel2 DMA underrun flag
DMAUDR2 : SR_DMAUDR2_Field := 16#0#;
-- unspecified
Reserved_30_31 : STM32_SVD.UInt2 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register use record
Reserved_0_12 at 0 range 0 .. 12;
DMAUDR1 at 0 range 13 .. 13;
Reserved_14_28 at 0 range 14 .. 28;
DMAUDR2 at 0 range 29 .. 29;
Reserved_30_31 at 0 range 30 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Digital-to-analog converter
type DAC_Peripheral is record
-- control register
CR : aliased CR_Register;
-- software trigger register
SWTRIGR : aliased SWTRIGR_Register;
-- channel1 12-bit right-aligned data holding register
DHR12R1 : aliased DHR12R1_Register;
-- channel1 12-bit left aligned data holding register
DHR12L1 : aliased DHR12L1_Register;
-- channel1 8-bit right aligned data holding register
DHR8R1 : aliased DHR8R1_Register;
-- channel2 12-bit right aligned data holding register
DHR12R2 : aliased DHR12R2_Register;
-- channel2 12-bit left aligned data holding register
DHR12L2 : aliased DHR12L2_Register;
-- channel2 8-bit right-aligned data holding register
DHR8R2 : aliased DHR8R2_Register;
-- Dual DAC 12-bit right-aligned data holding register
DHR12RD : aliased DHR12RD_Register;
-- DUAL DAC 12-bit left aligned data holding register
DHR12LD : aliased DHR12LD_Register;
-- DUAL DAC 8-bit right aligned data holding register
DHR8RD : aliased DHR8RD_Register;
-- channel1 data output register
DOR1 : aliased DOR1_Register;
-- channel2 data output register
DOR2 : aliased DOR2_Register;
-- status register
SR : aliased SR_Register;
end record
with Volatile;
for DAC_Peripheral use record
CR at 16#0# range 0 .. 31;
SWTRIGR at 16#4# range 0 .. 31;
DHR12R1 at 16#8# range 0 .. 31;
DHR12L1 at 16#C# range 0 .. 31;
DHR8R1 at 16#10# range 0 .. 31;
DHR12R2 at 16#14# range 0 .. 31;
DHR12L2 at 16#18# range 0 .. 31;
DHR8R2 at 16#1C# range 0 .. 31;
DHR12RD at 16#20# range 0 .. 31;
DHR12LD at 16#24# range 0 .. 31;
DHR8RD at 16#28# range 0 .. 31;
DOR1 at 16#2C# range 0 .. 31;
DOR2 at 16#30# range 0 .. 31;
SR at 16#34# range 0 .. 31;
end record;
-- Digital-to-analog converter
DAC_Periph : aliased DAC_Peripheral
with Import, Address => System'To_Address (16#40007400#);
end STM32_SVD.DAC;
| 34.537757 | 67 | 0.630027 |
2ec814e6d4b94692a85af6cd7051940a9eceef1a | 5,205 | adb | Ada | source/amf/utp/amf-internals-utp_elements.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_elements.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_elements.adb | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with AMF.Elements;
with AMF.Internals.Extents;
with AMF.Internals.Helpers;
with AMF.Internals.Tables.Utp_Element_Table;
with AMF.Internals.Tables.Utp_Reflection;
package body AMF.Internals.Utp_Elements is
------------
-- Extent --
------------
overriding function Extent
(Self : not null access constant Utp_Element_Proxy)
return AMF.Extents.Extent_Access is
begin
return
AMF.Internals.Extents.Proxy
(AMF.Internals.Tables.Utp_Element_Table.Table (Self.Element).Extent);
end Extent;
---------
-- Get --
---------
overriding function Get
(Self : not null access constant Utp_Element_Proxy;
Property : not null AMF.CMOF.Properties.CMOF_Property_Access)
return League.Holders.Holder is
begin
return
AMF.Internals.Tables.Utp_Reflection.Get
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (Property)));
end Get;
--------------------
-- Get_Meta_Class --
--------------------
overriding function Get_Meta_Class
(Self : not null access constant Utp_Element_Proxy)
return AMF.CMOF.Classes.CMOF_Class_Access is
begin
return
AMF.CMOF.Classes.CMOF_Class_Access
(AMF.Internals.Helpers.To_Element
(AMF.Internals.Tables.Utp_Reflection.Get_Meta_Class (Self.Element)));
end Get_Meta_Class;
---------
-- Set --
---------
overriding procedure Set
(Self : not null access Utp_Element_Proxy;
Property : not null AMF.CMOF.Properties.CMOF_Property_Access;
Value : League.Holders.Holder) is
begin
AMF.Internals.Tables.Utp_Reflection.Set
(Self.Element,
AMF.Internals.Helpers.To_Element
(AMF.Elements.Element_Access (Property)),
Value);
end Set;
end AMF.Internals.Utp_Elements;
| 46.473214 | 80 | 0.480692 |
1a3c95558265ad4d4ede4107f14436dd36b9f195 | 1,812 | ads | Ada | tier-1/xcb/source/thin/xcb-xcb_glx_get_minmax_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_minmax_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_minmax_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_minmax_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;
format : aliased Interfaces.Unsigned_32;
the_type : aliased Interfaces.Unsigned_32;
swap_bytes : aliased Interfaces.Unsigned_8;
reset : aliased Interfaces.Unsigned_8;
end record;
-- Item_Array
--
type Item_Array is
array
(Interfaces.C
.size_t range <>) of aliased xcb.xcb_glx_get_minmax_request_t
.Item;
-- Pointer
--
package C_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_get_minmax_request_t.Item,
Element_Array => xcb.xcb_glx_get_minmax_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_minmax_request_t
.Pointer;
-- Pointer_Pointer
--
package C_Pointer_Pointers is new Interfaces.C.Pointers
(Index => Interfaces.C.size_t,
Element => xcb.xcb_glx_get_minmax_request_t.Pointer,
Element_Array => xcb.xcb_glx_get_minmax_request_t.Pointer_Array,
Default_Terminator => null);
subtype Pointer_Pointer is C_Pointer_Pointers.Pointer;
end xcb.xcb_glx_get_minmax_request_t;
| 29.704918 | 75 | 0.67053 |
2e66be3c10936b686880779a4b482b2b53c884e6 | 8,436 | ads | Ada | src/frontend/Experimental_Ada_ROSE_Connection/parser/asis_adapter/source/asis_adapter.ads | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | null | null | null | src/frontend/Experimental_Ada_ROSE_Connection/parser/asis_adapter/source/asis_adapter.ads | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | null | null | null | src/frontend/Experimental_Ada_ROSE_Connection/parser/asis_adapter/source/asis_adapter.ads | LaudateCorpus1/rose-1 | 5fe906d2a01253130c5de465aded6a917a8476a0 | [
"BSD-3-Clause"
] | null | null | null | with Ada.Strings.Unbounded;
with A_Nodes;
with Dot;
with Indented_Text;
private with Ada.Exceptions;
private with Ada.Text_IO;
private with Ada.Wide_Text_IO;
private with Asis;
private with Asis.Set_Get;
private with Interfaces.C.Extensions;
private with Interfaces.C.Strings;
private with Unchecked_Conversion;
-- GNAT-specific:
private with A4G.A_Types;
private with Types;
private with a_nodes_h.Support;
-- Contains supporting declarations for child packages
package Asis_Adapter is
-- Controls behavior of Trace_ routines. Renamed here so clients have to
-- with fewer packages:
Trace_On : Boolean renames Indented_Text.Trace_On;
Log_On : Boolean ;
type Outputs_Record is record -- Initialized
Output_Dir : Ada.Strings.Unbounded.Unbounded_String; -- Initialized
A_Nodes : Standard.A_Nodes.Access_Class; -- Initialized
Graph : Dot.Graphs.Access_Class; -- Initialized
Text : Indented_Text.Access_Class; -- Initialized
end record;
-- Raised when a subprogram is called incorrectly:
Usage_Error : Exception;
-- Raised when an external routine fails and the subprogram cannot continue:
External_Error : Exception;
-- Raised when an external routine raises a usage-error-like exception or
-- there is an internal logic error:
Internal_Error : Exception;
private
Module_Name : constant String := "Asis_Adapter";
package AEX renames Ada.Exceptions;
package ASU renames Ada.Strings.Unbounded;
package ATI renames Ada.Text_IO;
package AWTI renames Ada.Wide_Text_IO;
package IC renames Interfaces.C;
package ICE renames Interfaces.C.Extensions;
package ICS renames Interfaces.C.Strings;
package anhS renames a_nodes_h.Support;
function To_String (Item : in Wide_String) return String;
function To_Quoted_String (Item : in Wide_String) return String;
function "+"(Item : in Wide_String) return String renames To_String;
function To_Wide_String (Item : in String) return Wide_String;
function "+"(Item : in String) return Wide_String renames To_Wide_String;
function To_Chars_Ptr (Item : in Wide_String)
return Interfaces.C.Strings.chars_ptr;
function To_Chars_Ptr (Item : in String)
return Interfaces.C.Strings.chars_ptr
renames Interfaces.C.Strings.New_String;
procedure Put (Item : in String) renames ATI.Put;
procedure Put_Line (Item : in String) renames ATI.Put_Line;
procedure Put_Wide (Item : in Wide_String) renames AWTI.Put;
procedure Put_Line_Wide (Item : in Wide_String) renames AWTI.Put_Line;
procedure Trace_Put (Message : in Wide_String) renames
Indented_Text.Trace_Put;
procedure Trace_Put_Line (Message : in Wide_String) renames
Indented_Text.Trace_Put_Line;
-- Provides routines that peofix the output with the name of the current
-- module:
generic
Module_Name : in string;
package Generic_Logging is
procedure Log (Message : in String);
procedure Log_Wide (Message : in Wide_String);
procedure Log_Exception (X : in Aex.Exception_Occurrence);
end Generic_Logging;
-- Returns the image minus the leading space:
function Spaceless_Image (Item : in Natural) return String;
function NLB_Image (Item : in Natural) return String renames Spaceless_Image;
type ID_Kind is (Unit_ID_Kind, Element_ID_Kind);
function To_String
(Id : in IC.int;
Kind : in ID_Kind) return String;
function To_Dot_ID_Type
(Id : in IC.int;
Kind : in ID_Kind)
return Dot.ID_Type;
-- String:
-- Add <Name> => <Value> to the label, and print it if trace is on:
procedure Add_To_Dot_Label
(Dot_Label : in out Dot.HTML_Like_Labels.Class;
Outputs : in out Outputs_Record;
Name : in String;
Value : in String);
-- Boolean:
-- Add <Name> => <Value> to the label, and print it if trace is on:
-- ONLY acts if Value = True:
procedure Add_To_Dot_Label
(Dot_Label : in out Dot.HTML_Like_Labels.Class;
Outputs : in out Outputs_Record;
Name : in String;
Value : in Boolean);
-- String:
-- Add <Value> to the label, and print it if trace is on:
procedure Add_To_Dot_Label
(Dot_Label : in out Dot.HTML_Like_Labels.Class;
Outputs : in out Outputs_Record;
Value : in String);
-- Unit_ID or Element_ID:
-- Add an edge node to the the dot graph:
-- Use for both Unit_ID and Element_ID:
procedure Add_Dot_Edge
(Outputs : in out Outputs_Record;
From : in IC.int;
From_Kind : in ID_Kind;
To : in IC.int;
To_Kind : in ID_Kind;
Label : in String);
-- Order below is alphabetical:
function To_Access_Type_Kinds is new Unchecked_Conversion
(Source => Asis.Access_Type_Kinds,
Target => a_nodes_h.Access_Type_Kinds);
function To_Association_Kinds is new Unchecked_Conversion
(Source => Asis.Association_Kinds,
Target => a_nodes_h.Association_Kinds);
function To_Attribute_Kinds is new Unchecked_Conversion
(Source => Asis.Attribute_Kinds,
Target => a_nodes_h.Attribute_Kinds);
function To_Clause_Kinds is new Unchecked_Conversion
(Source => Asis.Clause_Kinds,
Target => a_nodes_h.Clause_Kinds);
function To_Representation_Clause_Kinds is new Unchecked_Conversion
(Source => Asis.Representation_Clause_Kinds,
Target => a_nodes_h.Representation_Clause_Kinds);
function To_Constraint_Kinds is new Unchecked_Conversion
(Source => Asis.Constraint_Kinds,
Target => a_nodes_h.Constraint_Kinds);
function To_Declaration_Kinds is new Unchecked_Conversion
(Source => Asis.Declaration_Kinds,
Target => a_nodes_h.Declaration_Kinds);
function To_Declaration_Origins is new Unchecked_Conversion
(Source => Asis.Declaration_Origins,
Target => a_nodes_h.Declaration_Origins);
function To_Defining_Name_Kinds is new Unchecked_Conversion
(Source => Asis.Defining_Name_Kinds,
Target => a_nodes_h.Defining_Name_Kinds);
function To_Definition_Kinds is new Unchecked_Conversion
(Source => Asis.Definition_Kinds,
Target => a_nodes_h.Definition_Kinds);
function To_Discrete_Range_Kinds is new Unchecked_Conversion
(Source => Asis.Discrete_Range_Kinds,
Target => a_nodes_h.Discrete_Range_Kinds);
function To_Element_Kinds is new Unchecked_Conversion
(Source => Asis.Element_Kinds,
Target => a_nodes_h.Element_Kinds);
function To_Expression_Kinds is new Unchecked_Conversion
(Source => Asis.Expression_Kinds,
Target => a_nodes_h.Expression_Kinds);
function To_Formal_Type_Kinds is new Unchecked_Conversion
(Source => Asis.Formal_Type_Kinds,
Target => a_nodes_h.Formal_Type_Kinds);
function To_Mode_Kinds is new Unchecked_Conversion
(Source => Asis.Mode_Kinds,
Target => a_nodes_h.Mode_Kinds);
function To_Operator_Kinds is new Unchecked_Conversion
(Source => Asis.Operator_Kinds,
Target => a_nodes_h.Operator_Kinds);
function To_Path_Kinds is new Unchecked_Conversion
(Source => Asis.Path_Kinds,
Target => a_nodes_h.Path_Kinds);
function To_Pragma_Kinds is new Unchecked_Conversion
(Source => Asis.Pragma_Kinds,
Target => a_nodes_h.Pragma_Kinds);
function To_Root_Type_Kinds is new Unchecked_Conversion
(Source => Asis.Root_Type_Kinds,
Target => a_nodes_h.Root_Type_Kinds);
function To_Statement_Kinds is new Unchecked_Conversion
(Source => Asis.Statement_Kinds,
Target => a_nodes_h.Statement_Kinds);
function To_Subprogram_Default_Kinds is new Unchecked_Conversion
(Source => Asis.Subprogram_Default_Kinds,
Target => a_nodes_h.Subprogram_Default_Kinds);
function To_Type_Kinds is new Unchecked_Conversion
(Source => Asis.Type_Kinds,
Target => a_nodes_h.Type_Kinds);
function To_Unit_Classes is new Unchecked_Conversion
(Source => Asis.Unit_Classes,
Target => a_nodes_h.Unit_Classes);
function To_Unit_Kinds is new Unchecked_Conversion
(Source => Asis.Unit_Kinds,
Target => a_nodes_h.Unit_Kinds);
function To_Unit_Origins is new Unchecked_Conversion
(Source => Asis.Unit_Origins,
Target => a_nodes_h.Unit_Origins);
-- End alphabetical order
end Asis_Adapter;
| 34.153846 | 80 | 0.71669 |
0bd2a065ba7a1aab894e384d489a48cae36975d1 | 3,100 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c7/c74409b.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/c7/c74409b.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c7/c74409b.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C74409B.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 IF A COMPOSITE TYPE IS DECLARED IN THE SAME PACKAGE
-- AS A LIMITED PRIVATE TYPE AND HAS A COMPONENT OF THAT TYPE,
-- THE COMPOSITE TYPE IS TREATED AS A LIMITED TYPE UNTIL THE
-- EARLIEST PLACE WITHIN THE IMMEDIATE SCOPE OF THE DECLARATION
-- OF THE COMPOSITE TYPE AND AFTER THE FULL DECLARATION OF THE
-- LIMITED PRIVATE TYPE
-- DSJ 5/5/83
-- JBG 9/23/83
WITH REPORT;
PROCEDURE C74409B IS
USE REPORT;
BEGIN
TEST("C74409B", "CHECK THAT A COMPOSITE TYPE WITH A LIMITED " &
"PRIVATE COMPONENT IS TREATED AS A LIMITED " &
"TYPE UNTIL ASSIGNMENT AND EQUALITY ARE BOTH " &
"AVAILABLE FOR THE COMPOSITE TYPE");
DECLARE
PACKAGE P IS
TYPE LP IS LIMITED PRIVATE;
PACKAGE Q IS
TYPE LP_ARRAY IS ARRAY (1 .. 2) OF LP;
END Q;
PRIVATE
TYPE LP IS NEW INTEGER;
END P;
PACKAGE BODY P IS
USE Q;
FUNCTION "=" (L,R : LP_ARRAY) RETURN BOOLEAN IS -- LEGAL
BEGIN
RETURN TRUE;
END;
GENERIC
TYPE T IS PRIVATE; -- NOTE: NOT LIMITED PRIVATE
C, D : T;
PACKAGE A IS
-- IRRELEVANT DETAILS
END A;
PACKAGE BODY A IS
BEGIN
IF C = D THEN
FAILED ("USED WRONG EQUALITY OPERATOR");
END IF;
END A;
PACKAGE BODY Q IS
PACKAGE ANOTHER_NEW_A IS
NEW A (LP_ARRAY, (2,3), (4,5)); -- LEGAL
END Q;
END P;
BEGIN
NULL;
END;
RESULT;
END C74409B;
| 32.978723 | 79 | 0.560323 |
31ee195325460c930281a8bf82309f5ec5b90bb4 | 140 | ads | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/opt56.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/opt56.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/opt56.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | package Opt56 is
type Vector is array (Positive range <>) of Float;
function F (Values : Vector) return Boolean;
end Opt56;
| 17.5 | 54 | 0.664286 |
ad25ccabba7401610d44a515d8a4078ea66875c1 | 613 | ads | Ada | boards/lpc55s69_evk_s/src/nxp-board.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2018-05-16T03:56:39.000Z | 2019-07-31T13:53:56.000Z | boards/lpc55s69_evk_s/src/nxp-board.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | boards/lpc55s69_evk_s/src/nxp-board.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | with NXP.Device; use NXP.Device;
with NXP.GPIO; use NXP.GPIO;
package NXP.Board is
pragma Elaborate_Body;
subtype User_LED is GPIO_Point;
Red_LED : User_LED renames P1_6;
Green_LED : User_LED renames P1_7;
Blue_LED : User_LED renames P1_4;
LEDs : GPIO_Points := Red_LED & Green_LED & Blue_LED;
User_Button : GPIO_Point renames P1_9;
Wake_Button : GPIO_Point renames P1_18;
procedure Turn_Off (This : in out User_LED) renames NXP.GPIO.Set;
procedure Turn_On (This : in out User_LED) renames NXP.GPIO.Clear;
procedure Initialize_Board;
end NXP.Board;
| 29.190476 | 69 | 0.707993 |
229fc8f6460993310b895e863b77f5f32bd3e96b | 4,478 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnarl/s-vxwext__rtp.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnarl/s-vxwext__rtp.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnarl/s-vxwext__rtp.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . V X W O R K S . E X T --
-- --
-- S p e c --
-- --
-- Copyright (C) 2008-2020, Free Software Foundation, Inc. --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 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 package provides vxworks specific support functions needed
-- by System.OS_Interface.
-- This is the VxWorks 6 RTP version of this package
with Interfaces.C;
package System.VxWorks.Ext is
pragma Preelaborate;
subtype SEM_ID is Long_Integer;
-- typedef struct semaphore *SEM_ID;
type sigset_t is mod 2 ** Long_Long_Integer'Size;
type t_id is new Long_Integer;
subtype int is Interfaces.C.int;
subtype unsigned is Interfaces.C.unsigned;
type Interrupt_Handler is access procedure (parameter : System.Address);
pragma Convention (C, Interrupt_Handler);
type Interrupt_Vector is new System.Address;
function Int_Lock return int;
pragma Inline (Int_Lock);
function Int_Unlock (Old : int) return int;
pragma Inline (Int_Unlock);
function Interrupt_Connect
(Vector : Interrupt_Vector;
Handler : Interrupt_Handler;
Parameter : System.Address := System.Null_Address) return int;
pragma Convention (C, Interrupt_Connect);
function Interrupt_Context return int;
pragma Convention (C, Interrupt_Context);
function Interrupt_Number_To_Vector
(intNum : int) return Interrupt_Vector;
pragma Convention (C, Interrupt_Number_To_Vector);
function semDelete (Sem : SEM_ID) return int;
pragma Convention (C, semDelete);
function Task_Cont (tid : t_id) return int;
pragma Import (C, Task_Cont, "taskResume");
function Task_Stop (tid : t_id) return int;
pragma Import (C, Task_Stop, "taskSuspend");
function kill (pid : t_id; sig : int) return int;
pragma Import (C, kill, "taskKill");
function getpid return t_id;
pragma Import (C, getpid, "getpid");
function Set_Time_Slice (ticks : int) return int;
pragma Inline (Set_Time_Slice);
--------------------------------
-- Processor Affinity for SMP --
--------------------------------
function taskCpuAffinitySet (tid : t_id; CPU : int) return int;
pragma Convention (C, taskCpuAffinitySet);
-- For SMP run-times set the CPU affinity.
-- For uniprocessor systems return ERROR status.
function taskMaskAffinitySet (tid : t_id; CPU_Set : unsigned) return int;
pragma Convention (C, taskMaskAffinitySet);
-- For SMP run-times set the CPU mask affinity.
-- For uniprocessor systems return ERROR status.
end System.VxWorks.Ext;
| 42.647619 | 78 | 0.537963 |
ad1d57e9d38fa65e17bdd4c61b2f008ab95f8b86 | 2,762 | ada | Ada | Task/Inverted-index/Ada/inverted-index-3.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:38.000Z | 2018-11-09T22:08:38.000Z | Task/Inverted-index/Ada/inverted-index-3.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/Inverted-index/Ada/inverted-index-3.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:40.000Z | 2018-11-09T22:08:40.000Z | package body Generic_Inverted_Index is
use Source_Vecs;
use type Maps.Cursor;
procedure Store(Storage: in out Storage_Type;
Source: Source_Type;
Item: Item_Type) is
begin
if (Storage.Find(Item) = Maps.No_Element) then
Storage.Insert(Key => Item,
New_Item => Empty_Vector & Source);
else
declare
The_Vector: Vector := Storage.Element(Item);
begin
if The_Vector.Last_Element /= Source then
Storage.Replace
(Key => Item,
New_Item => Storage.Element(Item) & Source);
end if;
end;
end if;
end Store;
function Find(Storage: Storage_Type; Item: Item_Type)
return Vector is
begin
return Storage.Element(Item);
exception
when Constraint_Error => return Empty_Vector; -- found nothing
end Find;
function Is_In(S: Source_Type; V: Vector) return Boolean is
VV: Vector := V;
begin
if Empty(V) then
return False;
elsif First_Source(V) = S then
return True;
else
Delete_First_Source(VV);
return Is_In(S, VV);
end if;
end Is_In;
function "and"(Left, Right: Vector) return Vector is
V: Vector := Empty_Vector;
begin
for I in First_Index(Left) .. Last_Index(Left) loop
if Is_In(Element(Left, I), Right) then
V := V & Element(Left, I);
end if;
end loop;
return V;
end "and";
function "or"(Left, Right: Vector) return Vector is
V: Vector := Left; -- all sources in Left
begin -- ... add all sources in Right, which are not already in Left
for I in First_Index(Right) .. Last_Index(Right) loop
if not Is_In(Element(Right, I), Left) then
V := V & Element(Right, I);
end if;
end loop;
return V;
end "or";
function Empty(Vec: Vector) return Boolean
renames Is_Empty;
function First_Source(The_Sources: Vector)
return Source_Type renames First_Element;
procedure Delete_First_Source(The_Sources: in out Vector;
Count: Ada.Containers.Count_Type := 1)
renames Delete_First;
procedure Iterate(The_Sources: Vector) is
V: Vector := The_Sources;
begin
while not Empty(V) loop
Do_Something(First_Source(V));
Delete_First_Source(V);
end loop;
end Iterate;
function Same_Vector(U,V: Vector) return Boolean is
begin
raise Program_Error with "there is no need to call this function";
return False; -- this avoices a compiler warning
end Same_Vector;
end Generic_Inverted_Index;
| 28.770833 | 72 | 0.591962 |
c7b485ab20cf3392a582c7acfaebb5076fae88a8 | 1,053 | ads | Ada | src/asf-applications-messages-vectors.ads | jquorning/ada-asf | ddc697c5dfa4e22c57c6958f4cff27e14d02ce98 | [
"Apache-2.0"
] | 12 | 2015-01-18T23:02:20.000Z | 2022-03-25T15:30:30.000Z | src/asf-applications-messages-vectors.ads | jquorning/ada-asf | ddc697c5dfa4e22c57c6958f4cff27e14d02ce98 | [
"Apache-2.0"
] | 3 | 2021-01-06T09:44:02.000Z | 2022-02-04T20:20:53.000Z | src/asf-applications-messages-vectors.ads | jquorning/ada-asf | ddc697c5dfa4e22c57c6958f4cff27e14d02ce98 | [
"Apache-2.0"
] | 4 | 2016-04-12T05:29:00.000Z | 2022-01-24T23:53:59.000Z | -----------------------------------------------------------------------
-- applications.messages.vectors -- List of messages
-- Copyright (C) 2010 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.Containers.Vectors;
package ASF.Applications.Messages.Vectors
is new Ada.Containers.Vectors (Index_Type => Positive,
Element_Type => Message);
| 45.782609 | 76 | 0.620133 |
506743394ff7b98c2f3c4ee074ee752e9b6ff154 | 2,705 | adb | Ada | lua-libs.adb | jhumphry/aLua | 62c6e67deda5ebb2ce66ffb8eaf8746c9a92327d | [
"MIT"
] | null | null | null | lua-libs.adb | jhumphry/aLua | 62c6e67deda5ebb2ce66ffb8eaf8746c9a92327d | [
"MIT"
] | null | null | null | lua-libs.adb | jhumphry/aLua | 62c6e67deda5ebb2ce66ffb8eaf8746c9a92327d | [
"MIT"
] | null | null | null | -- Lua.Lib
-- Supporting the Lua standard libraries
-- Copyright (c) 2015, James Humphry - see LICENSE for terms
with Interfaces; use Interfaces;
with Interfaces.C;
with Interfaces.C.Strings; use Interfaces.C.Strings;
with Ada.Strings, Ada.Strings.Fixed;
with Lua.Internal, Lua.AuxInternal, Lua.LibInternal;
use Lua.LibInternal;
package body Lua.Libs is
subtype Lib_Name is String(1..9);
LibNames : constant array (Lua_Standard_Library)
of Lib_Name :=
(
Base_Lib => " ",
Package_Lib => "package ",
Coroutine_Lib => "coroutine",
String_Lib => "string ",
UTF8_Lib => "utf8 ",
Table_Lib => "table ",
Math_Lib => "math ",
IO_Lib => "io ",
OS_Lib => "os ",
Debug_Lib => "debug ",
Bit32_Lib => "bit32 "
);
LibFunctions : constant array (Lua_Standard_Library)
of Lua.Internal.lua_CFunction :=
(
Base_Lib => luaopen_base'Access,
Package_Lib => luaopen_package'Access,
Coroutine_Lib => luaopen_coroutine'Access,
String_Lib => luaopen_string'Access,
UTF8_Lib => luaopen_utf8'Access,
Table_Lib => luaopen_table'Access,
Math_Lib => luaopen_math'Access,
IO_Lib => luaopen_io'Access,
OS_Lib => luaopen_os'Access,
Debug_Lib => luaopen_debug'Access,
Bit32_Lib => luaopen_bit32'Access
);
procedure OpenLibs (L : in Lua_State) is
begin
LibInternal.luaL_openlibs(L.L);
end OpenLibs;
procedure Require_Standard_Library (L : in Lua_State;
Library : in Lua_Standard_Library;
Set_Global : in Boolean := True) is
glb : constant C.int := C.int((if Set_Global then 1 else 0));
C_libname : C.Strings.chars_ptr
:= C.Strings.New_String(Ada.Strings.Fixed.Trim(LibNames(Library),
Ada.Strings.Right));
begin
Lua.AuxInternal.luaL_requiref(L.L,
C_libname,
LibFunctions(Library),
glb);
C.Strings.Free(C_libname);
end Require_Standard_Library;
procedure Add_Yield_Function (L : in Lua_State) is
Func_Name : C.Strings.chars_ptr := C.Strings.New_String("yield");
begin
Internal.lua_pushcclosure(L.L, Yield_CFunction'Access, 0);
Internal.lua_setglobal(L.L, Func_Name);
C.Strings.Free(Func_Name);
end Add_Yield_Function;
function Yield_CFunction (L : System.Address) return Interfaces.C.int is
begin
return Internal.lua_yieldk(L, Internal.lua_gettop(L), 0, null);
end Yield_CFunction;
end Lua.Libs;
| 31.823529 | 75 | 0.610351 |
ad0b422752145d4c422fd62d03e57372ccf5f8f7 | 2,992 | adb | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnarl/s-tasinf__linux.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnarl/s-tasinf__linux.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnarl/s-tasinf__linux.adb | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . T A S K _ I N F O --
-- --
-- B o d y --
-- --
-- Copyright (C) 2009-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This is the GNU/Linux version of this module
package body System.Task_Info is
N_CPU : Natural := 0;
pragma Atomic (N_CPU);
-- Cache CPU number. Use pragma Atomic to avoid a race condition when
-- setting N_CPU in Number_Of_Processors below.
--------------------------
-- Number_Of_Processors --
--------------------------
function Number_Of_Processors return Positive is
begin
if N_CPU = 0 then
N_CPU := Natural
(OS_Interface.sysconf (OS_Interface.SC_NPROCESSORS_ONLN));
end if;
return N_CPU;
end Number_Of_Processors;
end System.Task_Info;
| 53.428571 | 78 | 0.419118 |
c79f3fc27c870f39a4bbc065c7ca4075d4eec870 | 8,258 | adb | Ada | src/zmq-utilities-memory_streams.adb | persan/zeromq-Ada | 651ca44cce831c2d717338eab65a60fbfca7ec44 | [
"MIT"
] | 33 | 2015-01-16T13:42:55.000Z | 2021-11-30T21:28:50.000Z | src/zmq-utilities-memory_streams.adb | persan/zeromq-Ada | 651ca44cce831c2d717338eab65a60fbfca7ec44 | [
"MIT"
] | 6 | 2016-03-23T01:26:36.000Z | 2021-05-13T04:24:53.000Z | src/zmq-utilities-memory_streams.adb | persan/zeromq-Ada | 651ca44cce831c2d717338eab65a60fbfca7ec44 | [
"MIT"
] | 5 | 2016-03-09T20:20:09.000Z | 2020-06-17T06:59:39.000Z | -------------------------------------------------------------------------------
-- --
-- Copyright (C) 2020-2030, [email protected] --
-- --
-- Permission is hereby granted, free of charge, to any person obtaining a --
-- copy of this software and associated documentation files --
-- (the "Software"), to deal in the Software without restriction, including --
-- without limitation the rights to use, copy, modify, merge, publish, --
-- distribute, sublicense, and / or sell copies of the Software, and to --
-- permit persons to whom the Software is furnished to do so, subject to --
-- the following conditions : --
-- --
-- The above copyright notice and this permission notice shall be included --
-- in all copies or substantial portions of the Software. --
-- --
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS --
-- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF --
-- MERCHANTABILITY, --
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL --
-- THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR --
-- OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, --
-- ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR --
-- OTHER DEALINGS IN THE SOFTWARE. --
-------------------------------------------------------------------------------
-- --
------------------------------------------------------------------------------
with Ada.IO_Exceptions;
with GNAT.Memory_Dump;
with System.Memory;
package body ZMQ.Utilities.Memory_Streams is
use Ada.Streams;
overriding
procedure Dump
(This : in Memory_Stream;
Full_Buffer : in Boolean := False;
Outf : in Text_IO.File_Access := Text_IO.Standard_Output) is
pragma Unreferenced (Outf);
Buffer : Large_Buffer_Access renames This.Buffer.As_Pointer;
begin
if Full_Buffer then
GNAT.Memory_Dump.Dump
(Buffer.all (Buffer.all'First)'Address,
Integer (This.Buffer_Length));
else
GNAT.Memory_Dump.Dump
(Buffer.all (Buffer.all'First)'Address,
Integer (This.Cursor) - 1);
end if;
end Dump;
overriding function Eof (This : in Memory_Stream) return Boolean is
begin
return This.Cursor > This.Buffer_Length;
end Eof;
-----------------
-- Get_Address --
-----------------
overriding
function Get_Address (This : in Memory_Stream) return System.Address is
begin
return This.Buffer.As_Address;
end Get_Address;
----------------
-- Get_Length --
----------------
overriding function Get_Length (This : in Memory_Stream)
return Ada.Streams.Stream_Element_Count is
begin
return This.Buffer_Length;
end Get_Length;
overriding procedure Seek (This : in out Memory_Stream;
Pos : in Ada.Streams.Stream_Element_Offset) is
begin
This.Cursor := This.Cursor + Pos;
end Seek;
overriding function Pos (This : in Memory_Stream)
return Ada.Streams.Stream_Element_Offset is
begin
return This.Cursor;
end Pos;
-----------------
-- Set_Address --
-----------------
overriding
procedure Set_Address
(This : in out Memory_Stream; To : in System.Address) is
begin
This.Buffer.As_Address := To;
end Set_Address;
----------------
-- Set_Length --
----------------
overriding
procedure Set_Length (This : in out Memory_Stream;
To : in Ada.Streams.Stream_Element_Count) is
begin
This.Buffer_Length := To;
This.Reset;
end Set_Length;
----------
-- Read --
----------
overriding
procedure Read
(This : in out Memory_Stream;
Item : out Stream_Element_Array;
Last : out Stream_Element_Offset)
is
First : Stream_Element_Offset;
LLast : Stream_Element_Offset;
begin
First := This.Cursor;
LLast := This.Cursor + Item'Length - 1;
if LLast > This.Buffer_Length then
raise Ada.IO_Exceptions.End_Error;
end if;
Item := This.Buffer.As_Pointer.all (First .. LLast);
This.Cursor := LLast + 1;
Last := Item'Last;
end Read;
-----------
-- Write --
-----------
overriding
procedure Write
(This : in out Memory_Stream;
Item : in Stream_Element_Array)
is
First : Stream_Element_Offset;
Last : Stream_Element_Offset;
begin
First := This.Cursor;
Last := This.Cursor + Item'Length - 1;
if Last > This.Buffer_Length then
raise Ada.IO_Exceptions.Device_Error;
end if;
This.Cursor := Last + 1;
This.Buffer.As_Pointer.all (First .. Last) := Item;
end Write;
overriding
procedure Reset (This : in out Memory_Stream) is
begin
This.Cursor := This.Buffer.As_Pointer.all'First;
end Reset;
procedure Read
(This : not null access Ada.Streams.Root_Stream_Type'Class;
Item : out Memory_Stream) is
begin
raise Program_Error with
"Its not possible to read into a memory stream using 'read";
end Read;
procedure Write
(This : not null access Ada.Streams.Root_Stream_Type'Class;
Item : in Memory_Stream) is
begin
Ada.Streams.Stream_Element_Array'Write
(This,
Item.Buffer.As_Pointer.all
(Item.Buffer.As_Pointer.all'First .. Item.Cursor));
end Write;
procedure Read
(This : not null access Ada.Streams.Root_Stream_Type'Class;
Item : out Dynamic_Memory_Stream) is
begin
Read (This, Memory_Stream (Item));
end Read;
procedure Write
(This : not null access Ada.Streams.Root_Stream_Type'Class;
Item : in Dynamic_Memory_Stream) is
begin
Write (This, Memory_Stream (Item));
end Write;
procedure Write
(This : in out Dynamic_Memory_Stream;
Item : in Ada.Streams.Stream_Element_Array) is
begin
if This.Cursor + Item'Length > This.Buffer_Length then
This.Expand (This.Cursor + Item'Length);
end if;
Memory_Stream (This).Write (Item);
end Write;
procedure Expand
(This : in out Dynamic_Memory_Stream;
To_Size : Ada.Streams.Stream_Element_Offset) is
New_Size : System.Memory.size_t := 0;
use System.Memory;
begin
while New_Size < size_t (To_Size) loop
case This.Strategy is
when As_Needed =>
New_Size := size_t (To_Size);
when Multiply_By_Two =>
New_Size := size_t (2 * This.Buffer_Length);
when Add_Initial_Size =>
New_Size := size_t (This.Buffer_Length + This.Initial_Size);
end case;
end loop;
This.Buffer.As_Address := System.Memory.Realloc
(This.Buffer.As_Address, New_Size);
This.Buffer_Length := Streams.Stream_Element_Count (New_Size);
end Expand;
procedure Initialize (This : in out Dynamic_Memory_Stream) is
use System.Memory;
begin
This.Buffer.As_Address :=
System.Memory.Alloc (size_t (This.Initial_Size));
This.Buffer_Length := This.Initial_Size;
end Initialize;
procedure Finalize (This : in out Dynamic_Memory_Stream) is
begin
System.Memory.Free (This.Buffer.As_Address);
end Finalize;
procedure Initialize (This : in out Controler) is
begin
This.Controled.Initialize;
end Initialize;
procedure Finalize (This : in out Controler) is
begin
This.Controled.Finalize;
end Finalize;
end ZMQ.Utilities.Memory_Streams;
| 32.640316 | 79 | 0.566239 |
066b9960e02b9f4bd43a39adb1503617e43031ae | 2,798 | ads | Ada | runtime/ravenscar-sfp-stm32f427/gnarl-common/s-bbexti.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 12 | 2017-06-08T14:19:57.000Z | 2022-03-09T02:48:59.000Z | runtime/ravenscar-sfp-stm32f427/gnarl-common/s-bbexti.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 6 | 2017-06-08T13:13:50.000Z | 2020-05-15T09:32:43.000Z | runtime/ravenscar-sfp-stm32f427/gnarl-common/s-bbexti.ads | TUM-EI-RCS/StratoX | 5fdd04e01a25efef6052376f43ce85b5bc973392 | [
"BSD-3-Clause"
] | 3 | 2017-06-30T14:05:06.000Z | 2022-02-17T12:20:45.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- S Y S T E M . B B . E X E C U T I O N _ T I M E --
-- --
-- S p e c --
-- --
-- Copyright (C) 2011-2013, AdaCore --
-- --
-- GNARL is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNARL is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- 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/>. --
-- --
------------------------------------------------------------------------------
with Ada.Task_Identification;
with System.BB.Threads;
with System.BB.Time;
with System.BB.Interrupts;
package System.BB.Execution_Time
with SPARK_Mode => On is
function Global_Interrupt_Clock return System.BB.Time.Time;
-- Sum of the interrupt clocks
function Interrupt_Clock
(Interrupt : System.BB.Interrupts.Interrupt_ID)
return System.BB.Time.Time;
pragma Inline (Interrupt_Clock);
-- CPU Time spent to handle the given interrupt
function Thread_Clock
(Th : System.BB.Threads.Thread_Id) return System.BB.Time.Time;
pragma Inline (Thread_Clock);
-- CPU Time spent in the given thread
end System.BB.Execution_Time;
| 53.807692 | 78 | 0.387777 |
22e8450ba1fb7edf09dab1f4170ddb2985c0e82a | 47,394 | ads | Ada | arch/ARM/RP/svd/rp2040/rp_svd-pwm.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2018-05-16T03:56:39.000Z | 2019-07-31T13:53:56.000Z | arch/ARM/RP/svd/rp2040/rp_svd-pwm.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | arch/ARM/RP/svd/rp2040/rp_svd-pwm.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | -- Copyright (c) 2020 Raspberry Pi (Trading) Ltd.
--
-- SPDX-License-Identifier: BSD-3-Clause
-- This spec has been automatically generated from rp2040.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
-- Simple PWM
package RP_SVD.PWM is
pragma Preelaborate;
---------------
-- Registers --
---------------
type CH0_CSR_DIVMODE_Field is
(-- Free-running counting at rate dictated by fractional divider
DIV,
-- Fractional divider operation is gated by the PWM B pin.
LEVEL,
-- Counter advances with each rising edge of the PWM B pin.
RISE,
-- Counter advances with each falling edge of the PWM B pin.
FALL)
with Size => 2;
for CH0_CSR_DIVMODE_Field use
(DIV => 0,
LEVEL => 1,
RISE => 2,
FALL => 3);
-- Control and status register
type CH0_CSR_Register is record
-- Enable the PWM channel.
EN : Boolean := False;
-- 1: Enable phase-correct modulation. 0: Trailing-edge
PH_CORRECT : Boolean := False;
-- Invert output A
A_INV : Boolean := False;
-- Invert output B
B_INV : Boolean := False;
DIVMODE : CH0_CSR_DIVMODE_Field := RP_SVD.PWM.DIV;
-- After a write operation all bits in the field are cleared (set to
-- zero). Retard the phase of the counter by 1 count, while it is
-- running.\n Self-clearing. Write a 1, and poll until low. Counter must
-- be running.
PH_RET : Boolean := False;
-- After a write operation all bits in the field are cleared (set to
-- zero). Advance the phase of the counter by 1 count, while it is
-- running.\n Self-clearing. Write a 1, and poll until low. Counter must
-- be running\n at less than full speed (div_int + div_frac / 16 > 1)
PH_ADV : Boolean := False;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH0_CSR_Register use record
EN at 0 range 0 .. 0;
PH_CORRECT at 0 range 1 .. 1;
A_INV at 0 range 2 .. 2;
B_INV at 0 range 3 .. 3;
DIVMODE at 0 range 4 .. 5;
PH_RET at 0 range 6 .. 6;
PH_ADV at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype CH0_DIV_FRAC_Field is HAL.UInt4;
subtype CH0_DIV_INT_Field is HAL.UInt8;
-- INT and FRAC form a fixed-point fractional number.\n Counting rate is
-- system clock frequency divided by this number.\n Fractional division
-- uses simple 1st-order sigma-delta.
type CH0_DIV_Register is record
FRAC : CH0_DIV_FRAC_Field := 16#0#;
INT : CH0_DIV_INT_Field := 16#1#;
-- unspecified
Reserved_12_31 : HAL.UInt20 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH0_DIV_Register use record
FRAC at 0 range 0 .. 3;
INT at 0 range 4 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
subtype CH0_CTR_CH0_CTR_Field is HAL.UInt16;
-- Direct access to the PWM counter
type CH0_CTR_Register is record
CH0_CTR : CH0_CTR_CH0_CTR_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH0_CTR_Register use record
CH0_CTR at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CH0_CC_A_Field is HAL.UInt16;
subtype CH0_CC_B_Field is HAL.UInt16;
-- Counter compare values
type CH0_CC_Register is record
A : CH0_CC_A_Field := 16#0#;
B : CH0_CC_B_Field := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH0_CC_Register use record
A at 0 range 0 .. 15;
B at 0 range 16 .. 31;
end record;
subtype CH0_TOP_CH0_TOP_Field is HAL.UInt16;
-- Counter wrap value
type CH0_TOP_Register is record
CH0_TOP : CH0_TOP_CH0_TOP_Field := 16#FFFF#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH0_TOP_Register use record
CH0_TOP at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
type CH1_CSR_DIVMODE_Field is
(-- Free-running counting at rate dictated by fractional divider
DIV,
-- Fractional divider operation is gated by the PWM B pin.
LEVEL,
-- Counter advances with each rising edge of the PWM B pin.
RISE,
-- Counter advances with each falling edge of the PWM B pin.
FALL)
with Size => 2;
for CH1_CSR_DIVMODE_Field use
(DIV => 0,
LEVEL => 1,
RISE => 2,
FALL => 3);
-- Control and status register
type CH1_CSR_Register is record
-- Enable the PWM channel.
EN : Boolean := False;
-- 1: Enable phase-correct modulation. 0: Trailing-edge
PH_CORRECT : Boolean := False;
-- Invert output A
A_INV : Boolean := False;
-- Invert output B
B_INV : Boolean := False;
DIVMODE : CH1_CSR_DIVMODE_Field := RP_SVD.PWM.DIV;
-- After a write operation all bits in the field are cleared (set to
-- zero). Retard the phase of the counter by 1 count, while it is
-- running.\n Self-clearing. Write a 1, and poll until low. Counter must
-- be running.
PH_RET : Boolean := False;
-- After a write operation all bits in the field are cleared (set to
-- zero). Advance the phase of the counter by 1 count, while it is
-- running.\n Self-clearing. Write a 1, and poll until low. Counter must
-- be running\n at less than full speed (div_int + div_frac / 16 > 1)
PH_ADV : Boolean := False;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH1_CSR_Register use record
EN at 0 range 0 .. 0;
PH_CORRECT at 0 range 1 .. 1;
A_INV at 0 range 2 .. 2;
B_INV at 0 range 3 .. 3;
DIVMODE at 0 range 4 .. 5;
PH_RET at 0 range 6 .. 6;
PH_ADV at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype CH1_DIV_FRAC_Field is HAL.UInt4;
subtype CH1_DIV_INT_Field is HAL.UInt8;
-- INT and FRAC form a fixed-point fractional number.\n Counting rate is
-- system clock frequency divided by this number.\n Fractional division
-- uses simple 1st-order sigma-delta.
type CH1_DIV_Register is record
FRAC : CH1_DIV_FRAC_Field := 16#0#;
INT : CH1_DIV_INT_Field := 16#1#;
-- unspecified
Reserved_12_31 : HAL.UInt20 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH1_DIV_Register use record
FRAC at 0 range 0 .. 3;
INT at 0 range 4 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
subtype CH1_CTR_CH1_CTR_Field is HAL.UInt16;
-- Direct access to the PWM counter
type CH1_CTR_Register is record
CH1_CTR : CH1_CTR_CH1_CTR_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH1_CTR_Register use record
CH1_CTR at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CH1_CC_A_Field is HAL.UInt16;
subtype CH1_CC_B_Field is HAL.UInt16;
-- Counter compare values
type CH1_CC_Register is record
A : CH1_CC_A_Field := 16#0#;
B : CH1_CC_B_Field := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH1_CC_Register use record
A at 0 range 0 .. 15;
B at 0 range 16 .. 31;
end record;
subtype CH1_TOP_CH1_TOP_Field is HAL.UInt16;
-- Counter wrap value
type CH1_TOP_Register is record
CH1_TOP : CH1_TOP_CH1_TOP_Field := 16#FFFF#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH1_TOP_Register use record
CH1_TOP at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
type CH2_CSR_DIVMODE_Field is
(-- Free-running counting at rate dictated by fractional divider
DIV,
-- Fractional divider operation is gated by the PWM B pin.
LEVEL,
-- Counter advances with each rising edge of the PWM B pin.
RISE,
-- Counter advances with each falling edge of the PWM B pin.
FALL)
with Size => 2;
for CH2_CSR_DIVMODE_Field use
(DIV => 0,
LEVEL => 1,
RISE => 2,
FALL => 3);
-- Control and status register
type CH2_CSR_Register is record
-- Enable the PWM channel.
EN : Boolean := False;
-- 1: Enable phase-correct modulation. 0: Trailing-edge
PH_CORRECT : Boolean := False;
-- Invert output A
A_INV : Boolean := False;
-- Invert output B
B_INV : Boolean := False;
DIVMODE : CH2_CSR_DIVMODE_Field := RP_SVD.PWM.DIV;
-- After a write operation all bits in the field are cleared (set to
-- zero). Retard the phase of the counter by 1 count, while it is
-- running.\n Self-clearing. Write a 1, and poll until low. Counter must
-- be running.
PH_RET : Boolean := False;
-- After a write operation all bits in the field are cleared (set to
-- zero). Advance the phase of the counter by 1 count, while it is
-- running.\n Self-clearing. Write a 1, and poll until low. Counter must
-- be running\n at less than full speed (div_int + div_frac / 16 > 1)
PH_ADV : Boolean := False;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH2_CSR_Register use record
EN at 0 range 0 .. 0;
PH_CORRECT at 0 range 1 .. 1;
A_INV at 0 range 2 .. 2;
B_INV at 0 range 3 .. 3;
DIVMODE at 0 range 4 .. 5;
PH_RET at 0 range 6 .. 6;
PH_ADV at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype CH2_DIV_FRAC_Field is HAL.UInt4;
subtype CH2_DIV_INT_Field is HAL.UInt8;
-- INT and FRAC form a fixed-point fractional number.\n Counting rate is
-- system clock frequency divided by this number.\n Fractional division
-- uses simple 1st-order sigma-delta.
type CH2_DIV_Register is record
FRAC : CH2_DIV_FRAC_Field := 16#0#;
INT : CH2_DIV_INT_Field := 16#1#;
-- unspecified
Reserved_12_31 : HAL.UInt20 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH2_DIV_Register use record
FRAC at 0 range 0 .. 3;
INT at 0 range 4 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
subtype CH2_CTR_CH2_CTR_Field is HAL.UInt16;
-- Direct access to the PWM counter
type CH2_CTR_Register is record
CH2_CTR : CH2_CTR_CH2_CTR_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH2_CTR_Register use record
CH2_CTR at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CH2_CC_A_Field is HAL.UInt16;
subtype CH2_CC_B_Field is HAL.UInt16;
-- Counter compare values
type CH2_CC_Register is record
A : CH2_CC_A_Field := 16#0#;
B : CH2_CC_B_Field := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH2_CC_Register use record
A at 0 range 0 .. 15;
B at 0 range 16 .. 31;
end record;
subtype CH2_TOP_CH2_TOP_Field is HAL.UInt16;
-- Counter wrap value
type CH2_TOP_Register is record
CH2_TOP : CH2_TOP_CH2_TOP_Field := 16#FFFF#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH2_TOP_Register use record
CH2_TOP at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
type CH3_CSR_DIVMODE_Field is
(-- Free-running counting at rate dictated by fractional divider
DIV,
-- Fractional divider operation is gated by the PWM B pin.
LEVEL,
-- Counter advances with each rising edge of the PWM B pin.
RISE,
-- Counter advances with each falling edge of the PWM B pin.
FALL)
with Size => 2;
for CH3_CSR_DIVMODE_Field use
(DIV => 0,
LEVEL => 1,
RISE => 2,
FALL => 3);
-- Control and status register
type CH3_CSR_Register is record
-- Enable the PWM channel.
EN : Boolean := False;
-- 1: Enable phase-correct modulation. 0: Trailing-edge
PH_CORRECT : Boolean := False;
-- Invert output A
A_INV : Boolean := False;
-- Invert output B
B_INV : Boolean := False;
DIVMODE : CH3_CSR_DIVMODE_Field := RP_SVD.PWM.DIV;
-- After a write operation all bits in the field are cleared (set to
-- zero). Retard the phase of the counter by 1 count, while it is
-- running.\n Self-clearing. Write a 1, and poll until low. Counter must
-- be running.
PH_RET : Boolean := False;
-- After a write operation all bits in the field are cleared (set to
-- zero). Advance the phase of the counter by 1 count, while it is
-- running.\n Self-clearing. Write a 1, and poll until low. Counter must
-- be running\n at less than full speed (div_int + div_frac / 16 > 1)
PH_ADV : Boolean := False;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH3_CSR_Register use record
EN at 0 range 0 .. 0;
PH_CORRECT at 0 range 1 .. 1;
A_INV at 0 range 2 .. 2;
B_INV at 0 range 3 .. 3;
DIVMODE at 0 range 4 .. 5;
PH_RET at 0 range 6 .. 6;
PH_ADV at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype CH3_DIV_FRAC_Field is HAL.UInt4;
subtype CH3_DIV_INT_Field is HAL.UInt8;
-- INT and FRAC form a fixed-point fractional number.\n Counting rate is
-- system clock frequency divided by this number.\n Fractional division
-- uses simple 1st-order sigma-delta.
type CH3_DIV_Register is record
FRAC : CH3_DIV_FRAC_Field := 16#0#;
INT : CH3_DIV_INT_Field := 16#1#;
-- unspecified
Reserved_12_31 : HAL.UInt20 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH3_DIV_Register use record
FRAC at 0 range 0 .. 3;
INT at 0 range 4 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
subtype CH3_CTR_CH3_CTR_Field is HAL.UInt16;
-- Direct access to the PWM counter
type CH3_CTR_Register is record
CH3_CTR : CH3_CTR_CH3_CTR_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH3_CTR_Register use record
CH3_CTR at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CH3_CC_A_Field is HAL.UInt16;
subtype CH3_CC_B_Field is HAL.UInt16;
-- Counter compare values
type CH3_CC_Register is record
A : CH3_CC_A_Field := 16#0#;
B : CH3_CC_B_Field := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH3_CC_Register use record
A at 0 range 0 .. 15;
B at 0 range 16 .. 31;
end record;
subtype CH3_TOP_CH3_TOP_Field is HAL.UInt16;
-- Counter wrap value
type CH3_TOP_Register is record
CH3_TOP : CH3_TOP_CH3_TOP_Field := 16#FFFF#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH3_TOP_Register use record
CH3_TOP at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
type CH4_CSR_DIVMODE_Field is
(-- Free-running counting at rate dictated by fractional divider
DIV,
-- Fractional divider operation is gated by the PWM B pin.
LEVEL,
-- Counter advances with each rising edge of the PWM B pin.
RISE,
-- Counter advances with each falling edge of the PWM B pin.
FALL)
with Size => 2;
for CH4_CSR_DIVMODE_Field use
(DIV => 0,
LEVEL => 1,
RISE => 2,
FALL => 3);
-- Control and status register
type CH4_CSR_Register is record
-- Enable the PWM channel.
EN : Boolean := False;
-- 1: Enable phase-correct modulation. 0: Trailing-edge
PH_CORRECT : Boolean := False;
-- Invert output A
A_INV : Boolean := False;
-- Invert output B
B_INV : Boolean := False;
DIVMODE : CH4_CSR_DIVMODE_Field := RP_SVD.PWM.DIV;
-- After a write operation all bits in the field are cleared (set to
-- zero). Retard the phase of the counter by 1 count, while it is
-- running.\n Self-clearing. Write a 1, and poll until low. Counter must
-- be running.
PH_RET : Boolean := False;
-- After a write operation all bits in the field are cleared (set to
-- zero). Advance the phase of the counter by 1 count, while it is
-- running.\n Self-clearing. Write a 1, and poll until low. Counter must
-- be running\n at less than full speed (div_int + div_frac / 16 > 1)
PH_ADV : Boolean := False;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH4_CSR_Register use record
EN at 0 range 0 .. 0;
PH_CORRECT at 0 range 1 .. 1;
A_INV at 0 range 2 .. 2;
B_INV at 0 range 3 .. 3;
DIVMODE at 0 range 4 .. 5;
PH_RET at 0 range 6 .. 6;
PH_ADV at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype CH4_DIV_FRAC_Field is HAL.UInt4;
subtype CH4_DIV_INT_Field is HAL.UInt8;
-- INT and FRAC form a fixed-point fractional number.\n Counting rate is
-- system clock frequency divided by this number.\n Fractional division
-- uses simple 1st-order sigma-delta.
type CH4_DIV_Register is record
FRAC : CH4_DIV_FRAC_Field := 16#0#;
INT : CH4_DIV_INT_Field := 16#1#;
-- unspecified
Reserved_12_31 : HAL.UInt20 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH4_DIV_Register use record
FRAC at 0 range 0 .. 3;
INT at 0 range 4 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
subtype CH4_CTR_CH4_CTR_Field is HAL.UInt16;
-- Direct access to the PWM counter
type CH4_CTR_Register is record
CH4_CTR : CH4_CTR_CH4_CTR_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH4_CTR_Register use record
CH4_CTR at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CH4_CC_A_Field is HAL.UInt16;
subtype CH4_CC_B_Field is HAL.UInt16;
-- Counter compare values
type CH4_CC_Register is record
A : CH4_CC_A_Field := 16#0#;
B : CH4_CC_B_Field := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH4_CC_Register use record
A at 0 range 0 .. 15;
B at 0 range 16 .. 31;
end record;
subtype CH4_TOP_CH4_TOP_Field is HAL.UInt16;
-- Counter wrap value
type CH4_TOP_Register is record
CH4_TOP : CH4_TOP_CH4_TOP_Field := 16#FFFF#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH4_TOP_Register use record
CH4_TOP at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
type CH5_CSR_DIVMODE_Field is
(-- Free-running counting at rate dictated by fractional divider
DIV,
-- Fractional divider operation is gated by the PWM B pin.
LEVEL,
-- Counter advances with each rising edge of the PWM B pin.
RISE,
-- Counter advances with each falling edge of the PWM B pin.
FALL)
with Size => 2;
for CH5_CSR_DIVMODE_Field use
(DIV => 0,
LEVEL => 1,
RISE => 2,
FALL => 3);
-- Control and status register
type CH5_CSR_Register is record
-- Enable the PWM channel.
EN : Boolean := False;
-- 1: Enable phase-correct modulation. 0: Trailing-edge
PH_CORRECT : Boolean := False;
-- Invert output A
A_INV : Boolean := False;
-- Invert output B
B_INV : Boolean := False;
DIVMODE : CH5_CSR_DIVMODE_Field := RP_SVD.PWM.DIV;
-- After a write operation all bits in the field are cleared (set to
-- zero). Retard the phase of the counter by 1 count, while it is
-- running.\n Self-clearing. Write a 1, and poll until low. Counter must
-- be running.
PH_RET : Boolean := False;
-- After a write operation all bits in the field are cleared (set to
-- zero). Advance the phase of the counter by 1 count, while it is
-- running.\n Self-clearing. Write a 1, and poll until low. Counter must
-- be running\n at less than full speed (div_int + div_frac / 16 > 1)
PH_ADV : Boolean := False;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH5_CSR_Register use record
EN at 0 range 0 .. 0;
PH_CORRECT at 0 range 1 .. 1;
A_INV at 0 range 2 .. 2;
B_INV at 0 range 3 .. 3;
DIVMODE at 0 range 4 .. 5;
PH_RET at 0 range 6 .. 6;
PH_ADV at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype CH5_DIV_FRAC_Field is HAL.UInt4;
subtype CH5_DIV_INT_Field is HAL.UInt8;
-- INT and FRAC form a fixed-point fractional number.\n Counting rate is
-- system clock frequency divided by this number.\n Fractional division
-- uses simple 1st-order sigma-delta.
type CH5_DIV_Register is record
FRAC : CH5_DIV_FRAC_Field := 16#0#;
INT : CH5_DIV_INT_Field := 16#1#;
-- unspecified
Reserved_12_31 : HAL.UInt20 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH5_DIV_Register use record
FRAC at 0 range 0 .. 3;
INT at 0 range 4 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
subtype CH5_CTR_CH5_CTR_Field is HAL.UInt16;
-- Direct access to the PWM counter
type CH5_CTR_Register is record
CH5_CTR : CH5_CTR_CH5_CTR_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH5_CTR_Register use record
CH5_CTR at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CH5_CC_A_Field is HAL.UInt16;
subtype CH5_CC_B_Field is HAL.UInt16;
-- Counter compare values
type CH5_CC_Register is record
A : CH5_CC_A_Field := 16#0#;
B : CH5_CC_B_Field := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH5_CC_Register use record
A at 0 range 0 .. 15;
B at 0 range 16 .. 31;
end record;
subtype CH5_TOP_CH5_TOP_Field is HAL.UInt16;
-- Counter wrap value
type CH5_TOP_Register is record
CH5_TOP : CH5_TOP_CH5_TOP_Field := 16#FFFF#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH5_TOP_Register use record
CH5_TOP at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
type CH6_CSR_DIVMODE_Field is
(-- Free-running counting at rate dictated by fractional divider
DIV,
-- Fractional divider operation is gated by the PWM B pin.
LEVEL,
-- Counter advances with each rising edge of the PWM B pin.
RISE,
-- Counter advances with each falling edge of the PWM B pin.
FALL)
with Size => 2;
for CH6_CSR_DIVMODE_Field use
(DIV => 0,
LEVEL => 1,
RISE => 2,
FALL => 3);
-- Control and status register
type CH6_CSR_Register is record
-- Enable the PWM channel.
EN : Boolean := False;
-- 1: Enable phase-correct modulation. 0: Trailing-edge
PH_CORRECT : Boolean := False;
-- Invert output A
A_INV : Boolean := False;
-- Invert output B
B_INV : Boolean := False;
DIVMODE : CH6_CSR_DIVMODE_Field := RP_SVD.PWM.DIV;
-- After a write operation all bits in the field are cleared (set to
-- zero). Retard the phase of the counter by 1 count, while it is
-- running.\n Self-clearing. Write a 1, and poll until low. Counter must
-- be running.
PH_RET : Boolean := False;
-- After a write operation all bits in the field are cleared (set to
-- zero). Advance the phase of the counter by 1 count, while it is
-- running.\n Self-clearing. Write a 1, and poll until low. Counter must
-- be running\n at less than full speed (div_int + div_frac / 16 > 1)
PH_ADV : Boolean := False;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH6_CSR_Register use record
EN at 0 range 0 .. 0;
PH_CORRECT at 0 range 1 .. 1;
A_INV at 0 range 2 .. 2;
B_INV at 0 range 3 .. 3;
DIVMODE at 0 range 4 .. 5;
PH_RET at 0 range 6 .. 6;
PH_ADV at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype CH6_DIV_FRAC_Field is HAL.UInt4;
subtype CH6_DIV_INT_Field is HAL.UInt8;
-- INT and FRAC form a fixed-point fractional number.\n Counting rate is
-- system clock frequency divided by this number.\n Fractional division
-- uses simple 1st-order sigma-delta.
type CH6_DIV_Register is record
FRAC : CH6_DIV_FRAC_Field := 16#0#;
INT : CH6_DIV_INT_Field := 16#1#;
-- unspecified
Reserved_12_31 : HAL.UInt20 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH6_DIV_Register use record
FRAC at 0 range 0 .. 3;
INT at 0 range 4 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
subtype CH6_CTR_CH6_CTR_Field is HAL.UInt16;
-- Direct access to the PWM counter
type CH6_CTR_Register is record
CH6_CTR : CH6_CTR_CH6_CTR_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH6_CTR_Register use record
CH6_CTR at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CH6_CC_A_Field is HAL.UInt16;
subtype CH6_CC_B_Field is HAL.UInt16;
-- Counter compare values
type CH6_CC_Register is record
A : CH6_CC_A_Field := 16#0#;
B : CH6_CC_B_Field := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH6_CC_Register use record
A at 0 range 0 .. 15;
B at 0 range 16 .. 31;
end record;
subtype CH6_TOP_CH6_TOP_Field is HAL.UInt16;
-- Counter wrap value
type CH6_TOP_Register is record
CH6_TOP : CH6_TOP_CH6_TOP_Field := 16#FFFF#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH6_TOP_Register use record
CH6_TOP at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
type CH7_CSR_DIVMODE_Field is
(-- Free-running counting at rate dictated by fractional divider
DIV,
-- Fractional divider operation is gated by the PWM B pin.
LEVEL,
-- Counter advances with each rising edge of the PWM B pin.
RISE,
-- Counter advances with each falling edge of the PWM B pin.
FALL)
with Size => 2;
for CH7_CSR_DIVMODE_Field use
(DIV => 0,
LEVEL => 1,
RISE => 2,
FALL => 3);
-- Control and status register
type CH7_CSR_Register is record
-- Enable the PWM channel.
EN : Boolean := False;
-- 1: Enable phase-correct modulation. 0: Trailing-edge
PH_CORRECT : Boolean := False;
-- Invert output A
A_INV : Boolean := False;
-- Invert output B
B_INV : Boolean := False;
DIVMODE : CH7_CSR_DIVMODE_Field := RP_SVD.PWM.DIV;
-- After a write operation all bits in the field are cleared (set to
-- zero). Retard the phase of the counter by 1 count, while it is
-- running.\n Self-clearing. Write a 1, and poll until low. Counter must
-- be running.
PH_RET : Boolean := False;
-- After a write operation all bits in the field are cleared (set to
-- zero). Advance the phase of the counter by 1 count, while it is
-- running.\n Self-clearing. Write a 1, and poll until low. Counter must
-- be running\n at less than full speed (div_int + div_frac / 16 > 1)
PH_ADV : Boolean := False;
-- unspecified
Reserved_8_31 : HAL.UInt24 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH7_CSR_Register use record
EN at 0 range 0 .. 0;
PH_CORRECT at 0 range 1 .. 1;
A_INV at 0 range 2 .. 2;
B_INV at 0 range 3 .. 3;
DIVMODE at 0 range 4 .. 5;
PH_RET at 0 range 6 .. 6;
PH_ADV at 0 range 7 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
subtype CH7_DIV_FRAC_Field is HAL.UInt4;
subtype CH7_DIV_INT_Field is HAL.UInt8;
-- INT and FRAC form a fixed-point fractional number.\n Counting rate is
-- system clock frequency divided by this number.\n Fractional division
-- uses simple 1st-order sigma-delta.
type CH7_DIV_Register is record
FRAC : CH7_DIV_FRAC_Field := 16#0#;
INT : CH7_DIV_INT_Field := 16#1#;
-- unspecified
Reserved_12_31 : HAL.UInt20 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH7_DIV_Register use record
FRAC at 0 range 0 .. 3;
INT at 0 range 4 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
subtype CH7_CTR_CH7_CTR_Field is HAL.UInt16;
-- Direct access to the PWM counter
type CH7_CTR_Register is record
CH7_CTR : CH7_CTR_CH7_CTR_Field := 16#0#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH7_CTR_Register use record
CH7_CTR at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype CH7_CC_A_Field is HAL.UInt16;
subtype CH7_CC_B_Field is HAL.UInt16;
-- Counter compare values
type CH7_CC_Register is record
A : CH7_CC_A_Field := 16#0#;
B : CH7_CC_B_Field := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH7_CC_Register use record
A at 0 range 0 .. 15;
B at 0 range 16 .. 31;
end record;
subtype CH7_TOP_CH7_TOP_Field is HAL.UInt16;
-- Counter wrap value
type CH7_TOP_Register is record
CH7_TOP : CH7_TOP_CH7_TOP_Field := 16#FFFF#;
-- unspecified
Reserved_16_31 : HAL.UInt16 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CH7_TOP_Register use record
CH7_TOP at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- EN_CH array
type EN_CH_Field_Array is array (0 .. 7) of Boolean
with Component_Size => 1, Size => 8;
-- Type definition for EN_CH
type EN_CH_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- CH as a value
Val : HAL.UInt8;
when True =>
-- CH as an array
Arr : EN_CH_Field_Array;
end case;
end record
with Unchecked_Union, Size => 8;
for EN_CH_Field use record
Val at 0 range 0 .. 7;
Arr at 0 range 0 .. 7;
end record;
-- This register aliases the CSR_EN bits for all channels.\n Writing to
-- this register allows multiple channels to be enabled\n or disabled
-- simultaneously, so they can run in perfect sync.\n For each channel,
-- there is only one physical EN register bit,\n which can be accessed
-- through here or CHx_CSR.
type EN_Register is record
CH : EN_CH_Field := (As_Array => False, Val => 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 EN_Register use record
CH at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- INTR_CH array
type INTR_CH_Field_Array is array (0 .. 7) of Boolean
with Component_Size => 1, Size => 8;
-- Type definition for INTR_CH
type INTR_CH_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- CH as a value
Val : HAL.UInt8;
when True =>
-- CH as an array
Arr : INTR_CH_Field_Array;
end case;
end record
with Unchecked_Union, Size => 8;
for INTR_CH_Field use record
Val at 0 range 0 .. 7;
Arr at 0 range 0 .. 7;
end record;
-- Raw Interrupts
type INTR_Register is record
-- Write data bit of one shall clear (set to zero) the corresponding bit
-- in the field.
CH : INTR_CH_Field := (As_Array => False, Val => 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 INTR_Register use record
CH at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- INTE_CH array
type INTE_CH_Field_Array is array (0 .. 7) of Boolean
with Component_Size => 1, Size => 8;
-- Type definition for INTE_CH
type INTE_CH_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- CH as a value
Val : HAL.UInt8;
when True =>
-- CH as an array
Arr : INTE_CH_Field_Array;
end case;
end record
with Unchecked_Union, Size => 8;
for INTE_CH_Field use record
Val at 0 range 0 .. 7;
Arr at 0 range 0 .. 7;
end record;
-- Interrupt Enable
type INTE_Register is record
CH : INTE_CH_Field := (As_Array => False, Val => 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 INTE_Register use record
CH at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- INTF_CH array
type INTF_CH_Field_Array is array (0 .. 7) of Boolean
with Component_Size => 1, Size => 8;
-- Type definition for INTF_CH
type INTF_CH_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- CH as a value
Val : HAL.UInt8;
when True =>
-- CH as an array
Arr : INTF_CH_Field_Array;
end case;
end record
with Unchecked_Union, Size => 8;
for INTF_CH_Field use record
Val at 0 range 0 .. 7;
Arr at 0 range 0 .. 7;
end record;
-- Interrupt Force
type INTF_Register is record
CH : INTF_CH_Field := (As_Array => False, Val => 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 INTF_Register use record
CH at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-- INTS_CH array
type INTS_CH_Field_Array is array (0 .. 7) of Boolean
with Component_Size => 1, Size => 8;
-- Type definition for INTS_CH
type INTS_CH_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- CH as a value
Val : HAL.UInt8;
when True =>
-- CH as an array
Arr : INTS_CH_Field_Array;
end case;
end record
with Unchecked_Union, Size => 8;
for INTS_CH_Field use record
Val at 0 range 0 .. 7;
Arr at 0 range 0 .. 7;
end record;
-- Interrupt status after masking & forcing
type INTS_Register is record
-- Read-only.
CH : INTS_CH_Field;
-- unspecified
Reserved_8_31 : HAL.UInt24;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for INTS_Register use record
CH at 0 range 0 .. 7;
Reserved_8_31 at 0 range 8 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Simple PWM
type PWM_Peripheral is record
-- Control and status register
CH0_CSR : aliased CH0_CSR_Register;
-- INT and FRAC form a fixed-point fractional number.\n Counting rate is
-- system clock frequency divided by this number.\n Fractional division
-- uses simple 1st-order sigma-delta.
CH0_DIV : aliased CH0_DIV_Register;
-- Direct access to the PWM counter
CH0_CTR : aliased CH0_CTR_Register;
-- Counter compare values
CH0_CC : aliased CH0_CC_Register;
-- Counter wrap value
CH0_TOP : aliased CH0_TOP_Register;
-- Control and status register
CH1_CSR : aliased CH1_CSR_Register;
-- INT and FRAC form a fixed-point fractional number.\n Counting rate is
-- system clock frequency divided by this number.\n Fractional division
-- uses simple 1st-order sigma-delta.
CH1_DIV : aliased CH1_DIV_Register;
-- Direct access to the PWM counter
CH1_CTR : aliased CH1_CTR_Register;
-- Counter compare values
CH1_CC : aliased CH1_CC_Register;
-- Counter wrap value
CH1_TOP : aliased CH1_TOP_Register;
-- Control and status register
CH2_CSR : aliased CH2_CSR_Register;
-- INT and FRAC form a fixed-point fractional number.\n Counting rate is
-- system clock frequency divided by this number.\n Fractional division
-- uses simple 1st-order sigma-delta.
CH2_DIV : aliased CH2_DIV_Register;
-- Direct access to the PWM counter
CH2_CTR : aliased CH2_CTR_Register;
-- Counter compare values
CH2_CC : aliased CH2_CC_Register;
-- Counter wrap value
CH2_TOP : aliased CH2_TOP_Register;
-- Control and status register
CH3_CSR : aliased CH3_CSR_Register;
-- INT and FRAC form a fixed-point fractional number.\n Counting rate is
-- system clock frequency divided by this number.\n Fractional division
-- uses simple 1st-order sigma-delta.
CH3_DIV : aliased CH3_DIV_Register;
-- Direct access to the PWM counter
CH3_CTR : aliased CH3_CTR_Register;
-- Counter compare values
CH3_CC : aliased CH3_CC_Register;
-- Counter wrap value
CH3_TOP : aliased CH3_TOP_Register;
-- Control and status register
CH4_CSR : aliased CH4_CSR_Register;
-- INT and FRAC form a fixed-point fractional number.\n Counting rate is
-- system clock frequency divided by this number.\n Fractional division
-- uses simple 1st-order sigma-delta.
CH4_DIV : aliased CH4_DIV_Register;
-- Direct access to the PWM counter
CH4_CTR : aliased CH4_CTR_Register;
-- Counter compare values
CH4_CC : aliased CH4_CC_Register;
-- Counter wrap value
CH4_TOP : aliased CH4_TOP_Register;
-- Control and status register
CH5_CSR : aliased CH5_CSR_Register;
-- INT and FRAC form a fixed-point fractional number.\n Counting rate is
-- system clock frequency divided by this number.\n Fractional division
-- uses simple 1st-order sigma-delta.
CH5_DIV : aliased CH5_DIV_Register;
-- Direct access to the PWM counter
CH5_CTR : aliased CH5_CTR_Register;
-- Counter compare values
CH5_CC : aliased CH5_CC_Register;
-- Counter wrap value
CH5_TOP : aliased CH5_TOP_Register;
-- Control and status register
CH6_CSR : aliased CH6_CSR_Register;
-- INT and FRAC form a fixed-point fractional number.\n Counting rate is
-- system clock frequency divided by this number.\n Fractional division
-- uses simple 1st-order sigma-delta.
CH6_DIV : aliased CH6_DIV_Register;
-- Direct access to the PWM counter
CH6_CTR : aliased CH6_CTR_Register;
-- Counter compare values
CH6_CC : aliased CH6_CC_Register;
-- Counter wrap value
CH6_TOP : aliased CH6_TOP_Register;
-- Control and status register
CH7_CSR : aliased CH7_CSR_Register;
-- INT and FRAC form a fixed-point fractional number.\n Counting rate is
-- system clock frequency divided by this number.\n Fractional division
-- uses simple 1st-order sigma-delta.
CH7_DIV : aliased CH7_DIV_Register;
-- Direct access to the PWM counter
CH7_CTR : aliased CH7_CTR_Register;
-- Counter compare values
CH7_CC : aliased CH7_CC_Register;
-- Counter wrap value
CH7_TOP : aliased CH7_TOP_Register;
-- This register aliases the CSR_EN bits for all channels.\n Writing to
-- this register allows multiple channels to be enabled\n or disabled
-- simultaneously, so they can run in perfect sync.\n For each channel,
-- there is only one physical EN register bit,\n which can be accessed
-- through here or CHx_CSR.
EN : aliased EN_Register;
-- Raw Interrupts
INTR : aliased INTR_Register;
-- Interrupt Enable
INTE : aliased INTE_Register;
-- Interrupt Force
INTF : aliased INTF_Register;
-- Interrupt status after masking & forcing
INTS : aliased INTS_Register;
end record
with Volatile;
for PWM_Peripheral use record
CH0_CSR at 16#0# range 0 .. 31;
CH0_DIV at 16#4# range 0 .. 31;
CH0_CTR at 16#8# range 0 .. 31;
CH0_CC at 16#C# range 0 .. 31;
CH0_TOP at 16#10# range 0 .. 31;
CH1_CSR at 16#14# range 0 .. 31;
CH1_DIV at 16#18# range 0 .. 31;
CH1_CTR at 16#1C# range 0 .. 31;
CH1_CC at 16#20# range 0 .. 31;
CH1_TOP at 16#24# range 0 .. 31;
CH2_CSR at 16#28# range 0 .. 31;
CH2_DIV at 16#2C# range 0 .. 31;
CH2_CTR at 16#30# range 0 .. 31;
CH2_CC at 16#34# range 0 .. 31;
CH2_TOP at 16#38# range 0 .. 31;
CH3_CSR at 16#3C# range 0 .. 31;
CH3_DIV at 16#40# range 0 .. 31;
CH3_CTR at 16#44# range 0 .. 31;
CH3_CC at 16#48# range 0 .. 31;
CH3_TOP at 16#4C# range 0 .. 31;
CH4_CSR at 16#50# range 0 .. 31;
CH4_DIV at 16#54# range 0 .. 31;
CH4_CTR at 16#58# range 0 .. 31;
CH4_CC at 16#5C# range 0 .. 31;
CH4_TOP at 16#60# range 0 .. 31;
CH5_CSR at 16#64# range 0 .. 31;
CH5_DIV at 16#68# range 0 .. 31;
CH5_CTR at 16#6C# range 0 .. 31;
CH5_CC at 16#70# range 0 .. 31;
CH5_TOP at 16#74# range 0 .. 31;
CH6_CSR at 16#78# range 0 .. 31;
CH6_DIV at 16#7C# range 0 .. 31;
CH6_CTR at 16#80# range 0 .. 31;
CH6_CC at 16#84# range 0 .. 31;
CH6_TOP at 16#88# range 0 .. 31;
CH7_CSR at 16#8C# range 0 .. 31;
CH7_DIV at 16#90# range 0 .. 31;
CH7_CTR at 16#94# range 0 .. 31;
CH7_CC at 16#98# range 0 .. 31;
CH7_TOP at 16#9C# range 0 .. 31;
EN at 16#A0# range 0 .. 31;
INTR at 16#A4# range 0 .. 31;
INTE at 16#A8# range 0 .. 31;
INTF at 16#AC# range 0 .. 31;
INTS at 16#B0# range 0 .. 31;
end record;
-- Simple PWM
PWM_Periph : aliased PWM_Peripheral
with Import, Address => PWM_Base;
end RP_SVD.PWM;
| 34.468364 | 79 | 0.611618 |
2f7703a11f8630c16ee6ad15c759d5c3440543a8 | 1,299 | ads | Ada | orka_simd/src/x86/gnat/orka-simd-sse-singles-logical.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 52 | 2016-07-30T23:00:28.000Z | 2022-02-05T11:54:55.000Z | orka_simd/src/x86/gnat/orka-simd-sse-singles-logical.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 79 | 2016-08-01T18:36:48.000Z | 2022-02-27T12:14:20.000Z | orka_simd/src/x86/gnat/orka-simd-sse-singles-logical.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 4 | 2018-04-28T22:36:26.000Z | 2020-11-14T23:00:29.000Z | -- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2016 onox <[email protected]>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
package Orka.SIMD.SSE.Singles.Logical is
pragma Pure;
function And_Not (Left, Right : m128) return m128
with Import, Convention => Intrinsic, External_Name => "__builtin_ia32_andnps";
function "and" (Left, Right : m128) return m128
with Import, Convention => Intrinsic, External_Name => "__builtin_ia32_andps";
function "or" (Left, Right : m128) return m128
with Import, Convention => Intrinsic, External_Name => "__builtin_ia32_orps";
function "xor" (Left, Right : m128) return m128
with Import, Convention => Intrinsic, External_Name => "__builtin_ia32_xorps";
end Orka.SIMD.SSE.Singles.Logical;
| 39.363636 | 84 | 0.722864 |
c7bfe781a642ffb43f12c8adb56fff53c39300e5 | 8,101 | ads | Ada | tools-src/gnu/gcc/gcc/ada/validsw.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/validsw.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/validsw.ads | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- V A L I D S W --
-- --
-- S p e c --
-- --
-- $Revision$
-- --
-- Copyright (C) 2001 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This unit contains the routines used to handle setting of validity
-- checking options.
package Validsw is
-----------------------------
-- Validity Check Switches --
-----------------------------
-- The following flags determine the specific set of validity checks
-- to be made if validity checking is active (Validity_Checks_On = True)
-- See GNAT users guide for an exact description of each option. The letter
-- given in the comment is the letter used in the -gnatV compiler switch
-- or in the argument of a Validity_Checks pragma to activate the option.
-- The corresponding upper case letter deactivates the option.
Validity_Check_Copies : Boolean := False;
-- Controls the validity checking of copies. If this switch is set to
-- true using -gnatVc, or a 'c' in the argument of a Validity_Checks
-- pragma, then the right side of assignments and also initializing
-- expressions in object declarations are checked for validity.
Validity_Check_Default : Boolean := True;
-- Controls default (reference manual) validity checking. If this switch
-- is set to True using -gnatVd or a 'd' in the argument of a Validity_
-- Checks pragma then left side subscripts and case statement arguments
-- are checked for validity. This switch is also set by default if no
-- -gnatV switch is used and no Validity_Checks pragma is processed.
Validity_Check_Floating_Point : Boolean := False;
-- Normally validity checking applies only to discrete values (integer
-- and enumeration types). If this switch is set to True using -gnatVf
-- or an 'f' in the argument of a Validity_Checks pragma, then floating-
-- point values are also checked. The context in which such checks
-- occur depends on other flags, e.g. if Validity_Check_Copies is also
-- set then floating-point values on the right side of an assignment
-- will be validity checked.
Validity_Check_In_Out_Params : Boolean := False;
-- Controls the validity checking of IN OUT parameters. If this switch
-- is set to True using -gnatVm or a 'm' in the argument of a pragma
-- Validity_Checks, then the initial value of all IN OUT parameters
-- will be checked at the point of call of a procecure. Note that the
-- character 'm' here stands for modified (parameters).
Validity_Check_In_Params : Boolean := False;
-- Controls the validity checking of IN parameters. If this switch is
-- set to True using -gnatVm or an 'i' in the argument of a pragma
-- Validity_Checks, then the initial value of all IN parameters
-- will be checked at the point of call of a procecure or function.
Validity_Check_Operands : Boolean := False;
-- Controls validity checking of operands. If this switch is set to
-- True using -gnatVo or an 'o' in the argument of a Validity_Checks
-- pragma, then operands of all predefined operators and attributes
-- will be validity checked.
Validity_Check_Returns : Boolean := False;
-- Controls validity checking of returned values. If this switch is set
-- to True using -gnatVr, or an 'r' in the argument of a Validity_Checks
-- pragma, then the expression in a RETURN statement is validity checked.
Validity_Check_Subscripts : Boolean := False;
-- Controls validity checking of subscripts. If this switch is set to
-- True using -gnatVs, or an 's' in the argument of a Validity_Checks
-- pragma, then all subscripts are checked for validity. Note that left
-- side subscript checking is controlled also by Validity_Check_Default.
-- If Validity_Check_Subscripts is True, then all subscripts are checked,
-- otherwise if Validity_Check_Default is True, then left side subscripts
-- are checked, otherwise no subscripts are checked.
Validity_Check_Tests : Boolean := False;
-- Controls validity checking of tests that occur in conditions (i.e. the
-- tests in IF, WHILE, and EXIT statements, and in entry guards). If this
-- switch is set to True using -gnatVt, or a 't' in the argument of a
-- Validity_Checks pragma, then all such conditions are validity checked.
-----------------
-- Subprograms --
-----------------
procedure Set_Default_Validity_Check_Options;
-- This procedure is called to set the default validity checking options
-- that apply if no Validity_Check switches or pragma is given.
procedure Set_Validity_Check_Options
(Options : String;
OK : out Boolean;
Err_Col : out Natural);
-- This procedure is called to set the validity check options that
-- correspond to the characters in the given Options string. If
-- all options are valid, then Set_Default_Validity_Check_Options
-- is first called to set the defaults, and then the options in the
-- given string are set in an additive manner. If any invalid character
-- is found, then OK is False on exit, and Err_Col is the index in
-- in options of the bad character. If all options are valid, then
-- OK is True on return, and Err_Col is set to options'Last + 1.
procedure Set_Validity_Check_Options (Options : String);
-- Like the above procedure, except that the call is simply ignored if
-- there are any error conditions, this is for example appopriate for
-- calls where the string is known to be valid, e.g. because it was
-- obtained by Save_Validity_Check_Options.
procedure Reset_Validity_Check_Options;
-- Sets all validity check options to off
subtype Validity_Check_Options is String (1 .. 16);
-- Long enough string to hold all options from Save call below
procedure Save_Validity_Check_Options
(Options : out Validity_Check_Options);
-- Sets Options to represent current selection of options. This
-- set can be restored by first calling Reset_Validity_Check_Options,
-- and then calling Set_Validity_Check_Options with the Options string.
end Validsw;
| 55.108844 | 79 | 0.619183 |
2eae9d22d2f8826a14ef62b440f9b868dcfd8b76 | 26,922 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/a-cihase.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-cihase.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/a-cihase.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.INDEFINITE_HASHED_SETS --
-- --
-- S p e c --
-- --
-- Copyright (C) 2004-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/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
with Ada.Iterator_Interfaces;
private with Ada.Containers.Hash_Tables;
with Ada.Containers.Helpers;
private with Ada.Streams;
private with Ada.Finalization;
generic
type Element_Type (<>) is private;
with function Hash (Element : Element_Type) return Hash_Type;
with function Equivalent_Elements (Left, Right : Element_Type)
return Boolean;
with function "=" (Left, Right : Element_Type) return Boolean is <>;
package Ada.Containers.Indefinite_Hashed_Sets is
pragma Annotate (CodePeer, Skip_Analysis);
pragma Preelaborate;
pragma Remote_Types;
type Set is tagged private
with Constant_Indexing => Constant_Reference,
Default_Iterator => Iterate,
Iterator_Element => Element_Type;
pragma Preelaborable_Initialization (Set);
type Cursor is private;
pragma Preelaborable_Initialization (Cursor);
Empty_Set : constant Set;
-- Set objects declared without an initialization expression are
-- initialized to the value Empty_Set.
No_Element : constant Cursor;
-- Cursor objects declared without an initialization expression are
-- initialized to the value No_Element.
function Has_Element (Position : Cursor) return Boolean;
-- Equivalent to Position /= No_Element
package Set_Iterator_Interfaces is new
Ada.Iterator_Interfaces (Cursor, Has_Element);
function "=" (Left, Right : Set) return Boolean;
-- For each element in Left, set equality attempts to find the equal
-- element in Right; if a search fails, then set equality immediately
-- returns False. The search works by calling Hash to find the bucket in
-- the Right set that corresponds to the Left element. If the bucket is
-- non-empty, the search calls the generic formal element equality operator
-- to compare the element (in Left) to the element of each node in the
-- bucket (in Right); the search terminates when a matching node in the
-- bucket is found, or the nodes in the bucket are exhausted. (Note that
-- element equality is called here, not Equivalent_Elements. Set equality
-- is the only operation in which element equality is used. Compare set
-- equality to Equivalent_Sets, which does call Equivalent_Elements.)
function Equivalent_Sets (Left, Right : Set) return Boolean;
-- Similar to set equality, with the difference that the element in Left is
-- compared to the elements in Right using the generic formal
-- Equivalent_Elements operation instead of element equality.
function To_Set (New_Item : Element_Type) return Set;
-- Constructs a singleton set comprising New_Element. To_Set calls Hash to
-- determine the bucket for New_Item.
function Capacity (Container : Set) return Count_Type;
-- Returns the current capacity of the set. Capacity is the maximum length
-- before which rehashing in guaranteed not to occur.
procedure Reserve_Capacity (Container : in out Set; Capacity : Count_Type);
-- Adjusts the current capacity, by allocating a new buckets array. If the
-- requested capacity is less than the current capacity, then the capacity
-- is contracted (to a value not less than the current length). If the
-- requested capacity is greater than the current capacity, then the
-- capacity is expanded (to a value not less than what is requested). In
-- either case, the nodes are rehashed from the old buckets array onto the
-- new buckets array (Hash is called once for each existing element in
-- order to compute the new index), and then the old buckets array is
-- deallocated.
function Length (Container : Set) return Count_Type;
-- Returns the number of items in the set
function Is_Empty (Container : Set) return Boolean;
-- Equivalent to Length (Container) = 0
procedure Clear (Container : in out Set);
-- Removes all of the items from the set
function Element (Position : Cursor) return Element_Type;
-- Returns the element of the node designated by the cursor
procedure Replace_Element
(Container : in out Set;
Position : Cursor;
New_Item : Element_Type);
-- If New_Item is equivalent (as determined by calling Equivalent_Elements)
-- to the element of the node designated by Position, then New_Element is
-- assigned to that element. Otherwise, it calls Hash to determine the
-- bucket for New_Item. If the bucket is not empty, then it calls
-- Equivalent_Elements for each node in that bucket to determine whether
-- New_Item is equivalent to an element in that bucket. If
-- Equivalent_Elements returns True then Program_Error is raised (because
-- an element may appear only once in the set); otherwise, New_Item is
-- assigned to the node designated by Position, and the node is moved to
-- its new bucket.
procedure Query_Element
(Position : Cursor;
Process : not null access procedure (Element : Element_Type));
-- Calls Process with the element (having only a constant view) of the node
-- designated by the cursor.
type Constant_Reference_Type
(Element : not null access constant Element_Type) is private
with Implicit_Dereference => Element;
function Constant_Reference
(Container : aliased Set;
Position : Cursor) return Constant_Reference_Type;
pragma Inline (Constant_Reference);
procedure Assign (Target : in out Set; Source : Set);
function Copy (Source : Set; Capacity : Count_Type := 0) return Set;
procedure Move (Target : in out Set; Source : in out Set);
-- Clears Target (if it's not empty), and then moves (not copies) the
-- buckets array and nodes from Source to Target.
procedure Insert
(Container : in out Set;
New_Item : Element_Type;
Position : out Cursor;
Inserted : out Boolean);
-- Conditionally inserts New_Item into the set. If New_Item is already in
-- the set, then Inserted returns False and Position designates the node
-- containing the existing element (which is not modified). If New_Item is
-- not already in the set, then Inserted returns True and Position
-- designates the newly-inserted node containing New_Item. The search for
-- an existing element works as follows. Hash is called to determine
-- New_Item's bucket; if the bucket is non-empty, then Equivalent_Elements
-- is called to compare New_Item to the element of each node in that
-- bucket. If the bucket is empty, or there were no equivalent elements in
-- the bucket, the search "fails" and the New_Item is inserted in the set
-- (and Inserted returns True); otherwise, the search "succeeds" (and
-- Inserted returns False).
procedure Insert (Container : in out Set; New_Item : Element_Type);
-- Attempts to insert New_Item into the set, performing the usual insertion
-- search (which involves calling both Hash and Equivalent_Elements); if
-- the search succeeds (New_Item is equivalent to an element already in the
-- set, and so was not inserted), then this operation raises
-- Constraint_Error. (This version of Insert is similar to Replace, but
-- having the opposite exception behavior. It is intended for use when you
-- want to assert that the item is not already in the set.)
procedure Include (Container : in out Set; New_Item : Element_Type);
-- Attempts to insert New_Item into the set. If an element equivalent to
-- New_Item is already in the set (the insertion search succeeded, and
-- hence New_Item was not inserted), then the value of New_Item is assigned
-- to the existing element. (This insertion operation only raises an
-- exception if cursor tampering occurs. It is intended for use when you
-- want to insert the item in the set, and you don't care whether an
-- equivalent element is already present.)
procedure Replace (Container : in out Set; New_Item : Element_Type);
-- Searches for New_Item in the set; if the search fails (because an
-- equivalent element was not in the set), then it raises
-- Constraint_Error. Otherwise, the existing element is assigned the value
-- New_Item. (This is similar to Insert, but with the opposite exception
-- behavior. It is intended for use when you want to assert that the item
-- is already in the set.)
procedure Exclude (Container : in out Set; Item : Element_Type);
-- Searches for Item in the set, and if found, removes its node from the
-- set and then deallocates it. The search works as follows. The operation
-- calls Hash to determine the item's bucket; if the bucket is not empty,
-- it calls Equivalent_Elements to compare Item to the element of each node
-- in the bucket. (This is the deletion analog of Include. It is intended
-- for use when you want to remove the item from the set, but don't care
-- whether the item is already in the set.)
procedure Delete (Container : in out Set; Item : Element_Type);
-- Searches for Item in the set (which involves calling both Hash and
-- Equivalent_Elements). If the search fails, then the operation raises
-- Constraint_Error. Otherwise it removes the node from the set and then
-- deallocates it. (This is the deletion analog of non-conditional
-- Insert. It is intended for use when you want to assert that the item is
-- already in the set.)
procedure Delete (Container : in out Set; Position : in out Cursor);
-- Removes the node designated by Position from the set, and then
-- deallocates the node. The operation calls Hash to determine the bucket,
-- and then compares Position to each node in the bucket until there's a
-- match (it does not call Equivalent_Elements).
procedure Union (Target : in out Set; Source : Set);
-- The operation first calls Reserve_Capacity if the current capacity is
-- less than the sum of the lengths of Source and Target. It then iterates
-- over the Source set, and conditionally inserts each element into Target.
function Union (Left, Right : Set) return Set;
-- The operation first copies the Left set to the result, and then iterates
-- over the Right set to conditionally insert each element into the result.
function "or" (Left, Right : Set) return Set renames Union;
procedure Intersection (Target : in out Set; Source : Set);
-- Iterates over the Target set (calling First and Next), calling Find to
-- determine whether the element is in Source. If an equivalent element is
-- not found in Source, the element is deleted from Target.
function Intersection (Left, Right : Set) return Set;
-- Iterates over the Left set, calling Find to determine whether the
-- element is in Right. If an equivalent element is found, it is inserted
-- into the result set.
function "and" (Left, Right : Set) return Set renames Intersection;
procedure Difference (Target : in out Set; Source : Set);
-- Iterates over the Source (calling First and Next), calling Find to
-- determine whether the element is in Target. If an equivalent element is
-- found, it is deleted from Target.
function Difference (Left, Right : Set) return Set;
-- Iterates over the Left set, calling Find to determine whether the
-- element is in the Right set. If an equivalent element is not found, the
-- element is inserted into the result set.
function "-" (Left, Right : Set) return Set renames Difference;
procedure Symmetric_Difference (Target : in out Set; Source : Set);
-- The operation first calls Reserve_Capacity if the current capacity is
-- less than the sum of the lengths of Source and Target. It then iterates
-- over the Source set, searching for the element in Target (calling Hash
-- and Equivalent_Elements). If an equivalent element is found, it is
-- removed from Target; otherwise it is inserted into Target.
function Symmetric_Difference (Left, Right : Set) return Set;
-- The operation first iterates over the Left set. It calls Find to
-- determine whether the element is in the Right set. If no equivalent
-- element is found, the element from Left is inserted into the result. The
-- operation then iterates over the Right set, to determine whether the
-- element is in the Left set. If no equivalent element is found, the Right
-- element is inserted into the result.
function "xor" (Left, Right : Set) return Set
renames Symmetric_Difference;
function Overlap (Left, Right : Set) return Boolean;
-- Iterates over the Left set (calling First and Next), calling Find to
-- determine whether the element is in the Right set. If an equivalent
-- element is found, the operation immediately returns True. The operation
-- returns False if the iteration over Left terminates without finding any
-- equivalent element in Right.
function Is_Subset (Subset : Set; Of_Set : Set) return Boolean;
-- Iterates over Subset (calling First and Next), calling Find to determine
-- whether the element is in Of_Set. If no equivalent element is found in
-- Of_Set, the operation immediately returns False. The operation returns
-- True if the iteration over Subset terminates without finding an element
-- not in Of_Set (that is, every element in Subset is equivalent to an
-- element in Of_Set).
function First (Container : Set) return Cursor;
-- Returns a cursor that designates the first non-empty bucket, by
-- searching from the beginning of the buckets array.
function Next (Position : Cursor) return Cursor;
-- Returns a cursor that designates the node that follows the current one
-- designated by Position. If Position designates the last node in its
-- bucket, the operation calls Hash to compute the index of this bucket,
-- and searches the buckets array for the first non-empty bucket, starting
-- from that index; otherwise, it simply follows the link to the next node
-- in the same bucket.
procedure Next (Position : in out Cursor);
-- Equivalent to Position := Next (Position)
function Find (Container : Set; Item : Element_Type) return Cursor;
-- Searches for Item in the set. Find calls Hash to determine the item's
-- bucket; if the bucket is not empty, it calls Equivalent_Elements to
-- compare Item to each element in the bucket. If the search succeeds, Find
-- returns a cursor designating the node containing the equivalent element;
-- otherwise, it returns No_Element.
function Contains (Container : Set; Item : Element_Type) return Boolean;
-- Equivalent to Find (Container, Item) /= No_Element
function Equivalent_Elements (Left, Right : Cursor) return Boolean;
-- Returns the result of calling Equivalent_Elements with the elements of
-- the nodes designated by cursors Left and Right.
function Equivalent_Elements
(Left : Cursor;
Right : Element_Type) return Boolean;
-- Returns the result of calling Equivalent_Elements with element of the
-- node designated by Left and element Right.
function Equivalent_Elements
(Left : Element_Type;
Right : Cursor) return Boolean;
-- Returns the result of calling Equivalent_Elements with element Left and
-- the element of the node designated by Right.
procedure Iterate
(Container : Set;
Process : not null access procedure (Position : Cursor));
-- Calls Process for each node in the set
function Iterate (Container : Set)
return Set_Iterator_Interfaces.Forward_Iterator'Class;
generic
type Key_Type (<>) is private;
with function Key (Element : Element_Type) return Key_Type;
with function Hash (Key : Key_Type) return Hash_Type;
with function Equivalent_Keys (Left, Right : Key_Type) return Boolean;
package Generic_Keys is
function Key (Position : Cursor) return Key_Type;
-- Applies generic formal operation Key to the element of the node
-- designated by Position.
function Element (Container : Set; Key : Key_Type) return Element_Type;
-- Searches (as per the key-based Find) for the node containing Key, and
-- returns the associated element.
procedure Replace
(Container : in out Set;
Key : Key_Type;
New_Item : Element_Type);
-- Searches (as per the key-based Find) for the node containing Key, and
-- then replaces the element of that node (as per the element-based
-- Replace_Element).
procedure Exclude (Container : in out Set; Key : Key_Type);
-- Searches for Key in the set, and if found, removes its node from the
-- set and then deallocates it. The search works by first calling Hash
-- (on Key) to determine the bucket; if the bucket is not empty, it
-- calls Equivalent_Keys to compare parameter Key to the value of
-- generic formal operation Key applied to element of each node in the
-- bucket.
procedure Delete (Container : in out Set; Key : Key_Type);
-- Deletes the node containing Key as per Exclude, with the difference
-- that Constraint_Error is raised if Key is not found.
function Find (Container : Set; Key : Key_Type) return Cursor;
-- Searches for the node containing Key, and returns a cursor
-- designating the node. The search works by first calling Hash (on Key)
-- to determine the bucket. If the bucket is not empty, the search
-- compares Key to the element of each node in the bucket, and returns
-- the matching node. The comparison itself works by applying the
-- generic formal Key operation to the element of the node, and then
-- calling generic formal operation Equivalent_Keys.
function Contains (Container : Set; Key : Key_Type) return Boolean;
-- Equivalent to Find (Container, Key) /= No_Element
procedure Update_Element_Preserving_Key
(Container : in out Set;
Position : Cursor;
Process : not null access
procedure (Element : in out Element_Type));
-- Calls Process with the element of the node designated by Position,
-- but with the restriction that the key-value of the element is not
-- modified. The operation first makes a copy of the value returned by
-- applying generic formal operation Key on the element of the node, and
-- then calls Process with the element. The operation verifies that the
-- key-part has not been modified by calling generic formal operation
-- Equivalent_Keys to compare the saved key-value to the value returned
-- by applying generic formal operation Key to the post-Process value of
-- element. If the key values compare equal then the operation
-- completes. Otherwise, the node is removed from the map and
-- Program_Error is raised.
type Reference_Type (Element : not null access Element_Type) is private
with Implicit_Dereference => Element;
function Reference_Preserving_Key
(Container : aliased in out Set;
Position : Cursor) return Reference_Type;
function Constant_Reference
(Container : aliased Set;
Key : Key_Type) return Constant_Reference_Type;
function Reference_Preserving_Key
(Container : aliased in out Set;
Key : Key_Type) return Reference_Type;
private
type Set_Access is access all Set;
for Set_Access'Storage_Size use 0;
package Impl is new Helpers.Generic_Implementation;
type Reference_Control_Type is
new Impl.Reference_Control_Type with
record
Container : Set_Access;
Index : Hash_Type;
Old_Pos : Cursor;
Old_Hash : Hash_Type;
end record;
overriding procedure Finalize (Control : in out Reference_Control_Type);
pragma Inline (Finalize);
type Reference_Type (Element : not null access Element_Type) is record
Control : Reference_Control_Type :=
raise Program_Error with "uninitialized reference";
-- The RM says, "The default initialization of an object of
-- type Constant_Reference_Type or Reference_Type propagates
-- Program_Error."
end record;
use Ada.Streams;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Reference_Type);
for Reference_Type'Read use Read;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Reference_Type);
for Reference_Type'Write use Write;
end Generic_Keys;
private
pragma Inline (Next);
type Node_Type;
type Node_Access is access Node_Type;
type Element_Access is access all Element_Type;
type Node_Type is limited record
Element : Element_Access;
Next : Node_Access;
end record;
package HT_Types is
new Hash_Tables.Generic_Hash_Table_Types (Node_Type, Node_Access);
type Set is new Ada.Finalization.Controlled with record
HT : HT_Types.Hash_Table_Type;
end record;
overriding procedure Adjust (Container : in out Set);
overriding procedure Finalize (Container : in out Set);
use HT_Types, HT_Types.Implementation;
use Ada.Finalization;
use Ada.Streams;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Container : Set);
for Set'Write use Write;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Container : out Set);
for Set'Read use Read;
type Set_Access is access all Set;
for Set_Access'Storage_Size use 0;
type Cursor is record
Container : Set_Access;
Node : Node_Access;
end record;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Cursor);
for Cursor'Write use Write;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Cursor);
for Cursor'Read use Read;
subtype Reference_Control_Type is Implementation.Reference_Control_Type;
-- It is necessary to rename this here, so that the compiler can find it
type Constant_Reference_Type
(Element : not null access constant Element_Type) is
record
Control : Reference_Control_Type :=
raise Program_Error with "uninitialized reference";
-- The RM says, "The default initialization of an object of
-- type Constant_Reference_Type or Reference_Type propagates
-- Program_Error."
end record;
procedure Read
(Stream : not null access Root_Stream_Type'Class;
Item : out Constant_Reference_Type);
for Constant_Reference_Type'Read use Read;
procedure Write
(Stream : not null access Root_Stream_Type'Class;
Item : Constant_Reference_Type);
for Constant_Reference_Type'Write use Write;
-- Three operations are used to optimize in the expansion of "for ... of"
-- loops: the Next(Cursor) procedure in the visible part, and the following
-- Pseudo_Reference and Get_Element_Access functions. See Sem_Ch5 for
-- details.
function Pseudo_Reference
(Container : aliased Set'Class) return Reference_Control_Type;
pragma Inline (Pseudo_Reference);
-- Creates an object of type Reference_Control_Type pointing to the
-- container, and increments the Lock. Finalization of this object will
-- decrement the Lock.
function Get_Element_Access
(Position : Cursor) return not null Element_Access;
-- Returns a pointer to the element designated by Position.
Empty_Set : constant Set := (Controlled with others => <>);
No_Element : constant Cursor := (Container => null, Node => null);
type Iterator is new Limited_Controlled and
Set_Iterator_Interfaces.Forward_Iterator with
record
Container : Set_Access;
end record
with Disable_Controlled => not T_Check;
overriding procedure Finalize (Object : in out Iterator);
overriding function First (Object : Iterator) return Cursor;
overriding function Next
(Object : Iterator;
Position : Cursor) return Cursor;
end Ada.Containers.Indefinite_Hashed_Sets;
| 45.171141 | 79 | 0.678367 |
1afe628521c897557308f133b1ebec58627bf7df | 2,389 | ads | Ada | opengl-state.ads | io7m/coreland-opengl-ada | 31760853a42fcba1e37513e0521548592817c7f2 | [
"0BSD"
] | 1 | 2017-10-07T05:53:51.000Z | 2017-10-07T05:53:51.000Z | opengl-state.ads | io7m/coreland-opengl-ada | 31760853a42fcba1e37513e0521548592817c7f2 | [
"0BSD"
] | null | null | null | opengl-state.ads | io7m/coreland-opengl-ada | 31760853a42fcba1e37513e0521548592817c7f2 | [
"0BSD"
] | null | null | null | package OpenGL.State is
type Capability_t is
(Alpha_Test,
Auto_Normal,
Blend,
Color_Array,
Color_Logic_Op,
Color_Material,
Color_Sum,
Color_Table,
Convolution_1D,
Convolution_2D,
Cull_Face,
Depth_Test,
Dither,
Edge_Flag_Array,
Fog,
Fog_Coord_Array,
Histogram,
Index_Array,
Index_Logic_Op,
Lighting,
Line_Smooth,
Line_Stipple,
Map1_Color_4,
Map1_Index,
Map1_Normal,
Map1_Texture_Coord_1,
Map1_Texture_Coord_2,
Map1_Texture_Coord_3,
Map1_Texture_Coord_4,
Map2_Color_4,
Map2_Index,
Map2_Normal,
Map2_Texture_Coord_1,
Map2_Texture_Coord_2,
Map2_Texture_Coord_3,
Map2_Texture_Coord_4,
Map2_Vertex_3,
Map2_Vertex_4,
Minmax,
Multisample,
Normal_Array,
Normalize,
Point_Smooth,
Point_Sprite,
Polygon_Smooth,
Polygon_Offset_Fill,
Polygon_Offset_Line,
Polygon_Offset_Point,
Polygon_Stipple,
Post_Color_Matrix_Color_Table,
Post_Convolution_Color_Table,
Rescale_Normal,
Sample_Alpha_To_Coverage,
Sample_Alpha_To_One,
Sample_Coverage,
Scissor_Test,
Secondary_Color_Array,
Separable_2D,
Stencil_Test,
Texture_1D,
Texture_2D,
Texture_3D,
Texture_Coord_Array,
Texture_Cube_Map,
Texture_Gen_Q,
Texture_Gen_R,
Texture_Gen_S,
Texture_Gen_T,
Texture_Rectangle_ARB,
Vertex_Array,
Vertex_Program_Point_Size,
Vertex_Program_Two_Side);
-- proc_map : glEnable
procedure Enable (Capability : in Capability_t);
pragma Inline (Enable);
-- proc_map : glDisable
procedure Disable (Capability : in Capability_t);
pragma Inline (Disable);
-- proc_map : glIsEnabled
function Is_Enabled (Capability : in Capability_t) return Boolean;
pragma Inline (Is_Enabled);
--
-- Client state.
--
type Client_Capability_t is
(Color_Array,
Edge_Flag_Array,
Fog_Coord_Array,
Index_Array,
Normal_Array,
Secondary_Color_Array,
Texture_Coord_Array,
Vertex_Array);
-- proc_map : glEnableClientState
procedure Enable_Client_State (Capability : in Client_Capability_t);
pragma Inline (Enable_Client_State);
-- proc_map : glDisableClientState
procedure Disable_Client_State (Capability : in Client_Capability_t);
pragma Inline (Disable_Client_State);
end OpenGL.State;
| 21.330357 | 71 | 0.714525 |
2e80c1edd04be29281337c2aaed65cdf7d24a6e5 | 2,969 | ads | Ada | llvm-gcc-4.2-2.9/gcc/ada/bcheck.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/bcheck.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/bcheck.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- B C H E C K --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-1999 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 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 Bcheck is
-- This package contains the routines to perform binder consistency checks
procedure Check_Duplicated_Subunits;
-- Check that no subunit names duplicate names of other packages in
-- the partition (check required by RM 10.2(19)).
procedure Check_Versions;
-- Check correct library and standard versions used
procedure Check_Consistency;
-- This procedure performs checks that the ALI files are consistent
-- with the corresponding source files and with one another. At the
-- time this is called, the Source table has been completely built and
-- contains either the time stamp from the actual source file if the
-- Check_Source_Files mode is set, or the latest stamp found in any of
-- the ALI files in the program.
procedure Check_Configuration_Consistency;
-- This procedure performs a similar check that configuration pragma
-- set items that are required to be consistent are in fact consistent
end Bcheck;
| 58.215686 | 78 | 0.492422 |
2e629d0ff33efe6a4807c18cec5c0d19892dac8c | 2,848 | ads | Ada | src/dnscatcher/dns/processor/rdata/dnscatcher-dns-processor-rdata-a_parser.ads | DNSCatcher/DNSCatcher | e3865fde5ae4bd5f833210150a9d30668a051d40 | [
"MIT"
] | 4 | 2019-09-23T23:55:34.000Z | 2020-05-02T07:25:32.000Z | src/dnscatcher/dns/processor/rdata/dnscatcher-dns-processor-rdata-a_parser.ads | DNSCatcher/DNSCatcher | e3865fde5ae4bd5f833210150a9d30668a051d40 | [
"MIT"
] | null | null | null | src/dnscatcher/dns/processor/rdata/dnscatcher-dns-processor-rdata-a_parser.ads | DNSCatcher/DNSCatcher | e3865fde5ae4bd5f833210150a9d30668a051d40 | [
"MIT"
] | null | null | null | -- Copyright 2019 Michael Casadevall <[email protected]>
--
-- Permission is hereby granted, free of charge, to any person obtaining a copy
-- of this software and associated documentation files (the "Software"), to
-- deal in the Software without restriction, including without limitation the
-- rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
-- sell copies of the Software, and to permit persons to whom the Software is
-- furnished to do so, subject to the following conditions:
--
-- The above copyright notice and this permission notice shall be included in
-- all copies or substantial portions of the Software.
--
-- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
-- IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
-- FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
-- THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
-- LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
-- FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
-- DEALINGS IN THE SOFTWARE.
with DNSCatcher.DNS.Processor.Packet; use DNSCatcher.DNS.Processor.Packet;
-- @description
--
-- RData processor for A records
--
-- @summary
--
-- Processes an A record into a IPv4 string
--
package DNSCatcher.DNS.Processor.RData.A_Parser is
-- Parsed A RData Representation
type Parsed_A_RData is
new DNSCatcher.DNS.Processor.RData.Parsed_RData with private;
type Parsed_A_RData_Access is access all Parsed_A_RData;
-- Converts a RR record to logicial representation
--
-- @value This
-- Class object
--
-- @value DNS_Header
-- DNS Packet Header
--
-- @value Parsed_RR
-- A parsed Resource Record from Processor.Packet
--
procedure From_Parsed_RR
(This : in out Parsed_A_RData;
DNS_Header : DNS_Packet_Header;
Parsed_RR : Parsed_DNS_Resource_Record);
-- Represents RData as a String for debug logging
--
-- @value This
-- Class object
--
-- @returns
-- An IPv4 String
--
function RData_To_String
(This : in Parsed_A_RData)
return String;
-- Represents the resource record packet as a whole as a string
--
-- @value This
-- Class object
--
-- @returns
-- String in the format of "A *IPv4 String*
--
function Print_Packet
(This : in Parsed_A_RData)
return String;
-- Frees and deallocates the class object
--
-- @value This
-- Class object to deallocate
--
procedure Delete (This : in out Parsed_A_RData);
private
type Parsed_A_RData is new DNSCatcher.DNS.Processor.RData.Parsed_RData with
record
A_Record : Unbounded_String;
end record;
end DNSCatcher.DNS.Processor.RData.A_Parser;
| 31.644444 | 79 | 0.704354 |
59f92f77ffbb84712638b01cb3d596d43e05ee2d | 12,943 | adb | Ada | ADL/devices/stm32-rcc.adb | JCGobbi/Nucleo-STM32G474RE | 8dc1c4948ffeb11841eed10f1c3708f00fa1d832 | [
"BSD-3-Clause"
] | null | null | null | ADL/devices/stm32-rcc.adb | JCGobbi/Nucleo-STM32G474RE | 8dc1c4948ffeb11841eed10f1c3708f00fa1d832 | [
"BSD-3-Clause"
] | null | null | null | ADL/devices/stm32-rcc.adb | JCGobbi/Nucleo-STM32G474RE | 8dc1c4948ffeb11841eed10f1c3708f00fa1d832 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2015, AdaCore --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions are --
-- met: --
-- 1. Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- 2. Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in --
-- the documentation and/or other materials provided with the --
-- distribution. --
-- 3. Neither the name of the copyright holder nor the names of its --
-- contributors may be used to endorse or promote products derived --
-- from this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT --
-- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, --
-- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY --
-- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT --
-- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE --
-- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
with Ada.Unchecked_Conversion;
with STM32_SVD.RCC; use STM32_SVD.RCC;
with STM32_SVD.PWR; use STM32_SVD.PWR;
with STM32_SVD.SYSCFG; use STM32_SVD.SYSCFG;
with STM32_SVD.Flash; use STM32_SVD.Flash;
package body STM32.RCC is
function To_AHB1RSTR_T is new Ada.Unchecked_Conversion
(UInt32, AHB1RSTR_Register);
function To_AHB2RSTR_T is new Ada.Unchecked_Conversion
(UInt32, AHB2RSTR_Register);
function To_AHB3RSTR_T is new Ada.Unchecked_Conversion
(UInt32, AHB3RSTR_Register);
function To_APB1RSTR1_T is new Ada.Unchecked_Conversion
(UInt32, APB1RSTR1_Register);
function To_APB1RSTR2_T is new Ada.Unchecked_Conversion
(UInt32, APB1RSTR2_Register);
function To_APB2RSTR_T is new Ada.Unchecked_Conversion
(UInt32, APB2RSTR_Register);
---------------------------------------------------------------------------
------- Enable/Disable/Reset Routines -----------------------------------
---------------------------------------------------------------------------
procedure AHB_Force_Reset is
begin
RCC_Periph.AHB1RSTR := To_AHB1RSTR_T (16#FFFF_FFFF#);
RCC_Periph.AHB2RSTR := To_AHB2RSTR_T (16#FFFF_FFFF#);
RCC_Periph.AHB3RSTR := To_AHB3RSTR_T (16#FFFF_FFFF#);
end AHB_Force_Reset;
procedure AHB_Release_Reset is
begin
RCC_Periph.AHB1RSTR := To_AHB1RSTR_T (0);
RCC_Periph.AHB2RSTR := To_AHB2RSTR_T (0);
RCC_Periph.AHB3RSTR := To_AHB3RSTR_T (0);
end AHB_Release_Reset;
procedure APB1_Force_Reset is
begin
RCC_Periph.APB1RSTR1 := To_APB1RSTR1_T (16#FFFF_FFFF#);
RCC_Periph.APB1RSTR2 := To_APB1RSTR2_T (16#FFFF_FFFF#);
end APB1_Force_Reset;
procedure APB1_Release_Reset is
begin
RCC_Periph.APB1RSTR1 := To_APB1RSTR1_T (0);
RCC_Periph.APB1RSTR2 := To_APB1RSTR2_T (0);
end APB1_Release_Reset;
procedure APB2_Force_Reset is
begin
RCC_Periph.APB2RSTR := To_APB2RSTR_T (16#FFFF_FFFF#);
end APB2_Force_Reset;
procedure APB2_Release_Reset is
begin
RCC_Periph.APB2RSTR := To_APB2RSTR_T (0);
end APB2_Release_Reset;
procedure Backup_Domain_Reset is
begin
RCC_Periph.BDCR.BDRST := True;
RCC_Periph.BDCR.BDRST := False;
end Backup_Domain_Reset;
---------------------------------------------------------------------------
-- Clock Configuration --------------------------------------------------
---------------------------------------------------------------------------
-------------------
-- Set_HSE Clock --
-------------------
procedure Set_HSE_Clock
(Enable : Boolean;
Bypass : Boolean := False;
Enable_CSS : Boolean := False)
is
begin
if Enable and not RCC_Periph.CR.HSEON then
RCC_Periph.CR.HSEON := True;
loop
exit when RCC_Periph.CR.HSERDY;
end loop;
end if;
RCC_Periph.CR.HSEBYP := Bypass;
RCC_Periph.CR.CSSON := Enable_CSS;
end Set_HSE_Clock;
-----------------------
-- HSE Clock_Enabled --
-----------------------
function HSE_Clock_Enabled return Boolean is
begin
return RCC_Periph.CR.HSEON;
end HSE_Clock_Enabled;
-------------------
-- Set_LSE Clock --
-------------------
procedure Set_LSE_Clock
(Enable : Boolean;
Bypass : Boolean := False;
Enable_CSS : Boolean := False;
Capability : HSE_Capability)
is
begin
if Enable and not RCC_Periph.BDCR.LSEON then
RCC_Periph.BDCR.LSEON := True;
loop
exit when RCC_Periph.BDCR.LSERDY;
end loop;
end if;
RCC_Periph.BDCR.LSEBYP := Bypass;
RCC_Periph.BDCR.LSECSSON := Enable_CSS;
RCC_Periph.BDCR.LSEDRV := Capability'Enum_Rep;
end Set_LSE_Clock;
-----------------------
-- LSE Clock_Enabled --
-----------------------
function LSE_Clock_Enabled return Boolean is
begin
return RCC_Periph.BDCR.LSEON;
end LSE_Clock_Enabled;
-------------------
-- Set_HSI_Clock --
-------------------
procedure Set_HSI_Clock (Enable : Boolean) is
begin
if Enable then
if not RCC_Periph.CR.HSION then
RCC_Periph.CR.HSION := True;
loop
exit when RCC_Periph.CR.HSIRDY;
end loop;
end if;
else
RCC_Periph.CR.HSION := False;
end if;
end Set_HSI_Clock;
-----------------------
-- HSI_Clock_Enabled --
-----------------------
function HSI_Clock_Enabled return Boolean is
begin
return RCC_Periph.CR.HSION;
end HSI_Clock_Enabled;
---------------------
-- Set_HSI48 Clock --
---------------------
procedure Set_HSI48_Clock (Enable : Boolean) is
begin
if Enable and not RCC_Periph.CRRCR.HSI48ON then
RCC_Periph.CRRCR.HSI48ON := True;
loop
exit when RCC_Periph.CRRCR.HSI48RDY;
end loop;
end if;
end Set_HSI48_Clock;
-------------------------
-- HSI48 Clock_Enabled --
-------------------------
function HSI48_Clock_Enabled return Boolean is
begin
return RCC_Periph.CRRCR.HSI48ON;
end HSI48_Clock_Enabled;
-------------------
-- Set_LSI Clock --
-------------------
procedure Set_LSI_Clock (Enable : Boolean) is
begin
if Enable and not RCC_Periph.CSR.LSION then
RCC_Periph.CSR.LSION := True;
loop
exit when RCC_Periph.CSR.LSIRDY;
end loop;
end if;
end Set_LSI_Clock;
-----------------------
-- LSI Clock_Enabled --
-----------------------
function LSI_Clock_Enabled return Boolean is
begin
return RCC_Periph.CSR.LSION;
end LSI_Clock_Enabled;
--------------------------------
-- Configure_System_Clock_Mux --
--------------------------------
procedure Configure_System_Clock_Mux (Source : SYSCLK_Clock_Source)
is
begin
RCC_Periph.CFGR.SW := Source'Enum_Rep;
loop
exit when RCC_Periph.CFGR.SWS = Source'Enum_Rep;
end loop;
end Configure_System_Clock_Mux;
-----------------------------------
-- Configure_AHB_Clock_Prescaler --
-----------------------------------
procedure Configure_AHB_Clock_Prescaler
(Value : AHB_Prescaler)
is
function To_AHB is new Ada.Unchecked_Conversion
(AHB_Prescaler, UInt4);
begin
RCC_Periph.CFGR.HPRE := To_AHB (Value);
end Configure_AHB_Clock_Prescaler;
-----------------------------------
-- Configure_APB_Clock_Prescaler --
-----------------------------------
procedure Configure_APB_Clock_Prescaler
(Bus : APB_Clock_Range;
Value : APB_Prescaler)
is
function To_APB is new Ada.Unchecked_Conversion
(APB_Prescaler, UInt3);
begin
case Bus is
when APB_1 =>
RCC_Periph.CFGR.PPRE.Arr (1) := To_APB (Value);
when APB_2 =>
RCC_Periph.CFGR.PPRE.Arr (2) := To_APB (Value);
end case;
end Configure_APB_Clock_Prescaler;
------------------------------
-- Configure_PLL_Source_Mux --
------------------------------
procedure Configure_PLL_Source_Mux (Source : PLL_Clock_Source) is
begin
RCC_Periph.PLLCFGR.PLLSRC := Source'Enum_Rep;
end Configure_PLL_Source_Mux;
-------------------
-- Configure_PLL --
-------------------
procedure Configure_PLL
(Enable : Boolean;
PLLM : PLLM_Range;
PLLN : PLLN_Range;
PLLP : PLLP_Range;
Enable_Output_P : Boolean;
PLLQ : PLLQ_Range;
Enable_Output_Q : Boolean;
PLLR : PLLR_Range;
Enable_Output_R : Boolean)
is
begin
-- Disable the main PLL before configuring it
RCC_Periph.CR.PLLON := False;
loop
exit when not RCC_Periph.CR.PLLRDY;
end loop;
if Enable then
RCC_Periph.PLLCFGR :=
(PLLM => UInt4 (PLLM - 1),
PLLN => UInt7 (PLLN),
PLLPDIV => UInt5 (PLLP),
PLLPEN => Enable_Output_P,
PLLQ => UInt2 (PLLQ / 2 - 1),
PLLQEN => Enable_Output_Q,
PLLR => UInt2 (PLLR / 2 - 1),
PLLREN => Enable_Output_R,
others => <>);
-- Setup PLL and wait for stabilization.
RCC_Periph.CR.PLLON := Enable;
loop
exit when RCC_Periph.CR.PLLRDY;
end loop;
end if;
end Configure_PLL;
--------------------------------
-- Configure_MCO_Output_Clock --
--------------------------------
procedure Configure_MCO_Output_Clock
(Source : MCO_Clock_Source;
Value : MCO_Prescaler)
is
begin
RCC_Periph.CFGR.MCOSEL := Source'Enum_Rep;
RCC_Periph.CFGR.MCOPRE := Value'Enum_Rep;
end Configure_MCO_Output_Clock;
---------------------------------
-- Configure_LSCO_Output_Clock --
---------------------------------
procedure Configure_LSCO_Output_Clock
(Enable : Boolean;
Source : LSCO_Clock_Source := LSCO_Clock_Source'First)
is
begin
if Enable then
RCC_Periph.BDCR.LSCOSEL := Source = LSE;
RCC_Periph.BDCR.LSCOEN := True;
else
RCC_Periph.BDCR.LSCOEN := False;
end if;
end Configure_LSCO_Output_Clock;
-----------------------
-- Set_FLASH_Latency --
-----------------------
procedure Set_FLASH_Latency (Latency : FLASH_Wait_State)
is
begin
FLASH_Periph.ACR.LATENCY := Latency'Enum_Rep;
end Set_FLASH_Latency;
-----------------------
-- Set_VCORE_Scaling --
-----------------------
procedure Set_VCORE_Scaling (Scale : VCORE_Scaling_Selection)
is
begin
PWR_Periph.CR5.R1MODE := Scale = Range_1;
end Set_VCORE_Scaling;
--------------------------
-- PWR_Overdrive_Enable --
--------------------------
procedure PWR_Overdrive_Enable
is
begin
-- Range 1 boost mode (R1MODE = 0) when SYSCLK ≤ 170 MHz.
-- Range 1 normal mode (R1MODE = 1) when SYSCLK ≤ 150 MHz.
-- See RM0440 ver. 4 pg. 235 chapter 6.1.5 for other modes.
if PWR_Periph.CR1.VOS = Range_2'Enum_Rep then
PWR_Periph.CR1.VOS := Range_1'Enum_Rep;
-- Wait for stabilization
loop
exit when not PWR_Periph.SR2.VOSF;
end loop;
end if;
PWR_Periph.CR5.R1MODE := True;
-- Main regulator in range 1 boost mode.
-- Wait for stabilization
loop
exit when not PWR_Periph.SR2.VOSF;
end loop;
end PWR_Overdrive_Enable;
end STM32.RCC;
| 31.568293 | 78 | 0.542842 |
29b6cdadef872943ba7c0a4edec404a60f90d44f | 10,596 | ads | Ada | src/portscan.ads | jfouquart/synth | cf9f4e394723266805799807ca9dd422e333cb2e | [
"0BSD"
] | 263 | 2015-12-30T22:24:04.000Z | 2022-03-25T03:13:52.000Z | src/portscan.ads | jfouquart/synth | cf9f4e394723266805799807ca9dd422e333cb2e | [
"0BSD"
] | 196 | 2016-01-08T19:50:19.000Z | 2022-03-25T22:02:10.000Z | src/portscan.ads | jfouquart/synth | cf9f4e394723266805799807ca9dd422e333cb2e | [
"0BSD"
] | 34 | 2016-03-08T02:43:35.000Z | 2022-03-25T21:51:03.000Z | -- This file is covered by the Internet Software Consortium (ISC) License
-- Reference: ../License.txt
-- GCC 6.0 only (skip Container_Checks until identified need arises)
pragma Suppress (Tampering_Check);
with Ada.Text_IO;
with Ada.Calendar;
with Ada.Containers.Hashed_Maps;
with Ada.Containers.Ordered_Sets;
with Ada.Containers.Vectors;
with Ada.Characters.Latin_1;
with Ada.Directories;
with Ada.Exceptions;
with JohnnyText;
with Parameters;
with Definitions; use Definitions;
private with Replicant.Platform;
package PortScan is
package JT renames JohnnyText;
package AC renames Ada.Containers;
package CAL renames Ada.Calendar;
package AD renames Ada.Directories;
package EX renames Ada.Exceptions;
package TIO renames Ada.Text_IO;
package LAT renames Ada.Characters.Latin_1;
package PM renames Parameters;
type count_type is (total, success, failure, ignored, skipped);
type dim_handlers is array (count_type) of TIO.File_Type;
type port_id is private;
port_match_failed : constant port_id;
-- Scan the entire ports tree in order with a single, non-recursive pass
-- Return True on success
function scan_entire_ports_tree (portsdir : String) return Boolean;
-- Starting with a single port, recurse to determine a limited but complete
-- dependency tree. Repeated calls will augment already existing data.
-- Return True on success
function scan_single_port (catport : String; always_build : Boolean;
fatal : out Boolean)
return Boolean;
-- This procedure causes the reverse dependencies to be calculated, and
-- then the extended (recursive) reverse dependencies. The former is
-- used progressively to determine when a port is free to build and the
-- latter sets the build priority.
procedure set_build_priority;
-- Wipe out all scan data so new scan can be performed
procedure reset_ports_tree;
-- Returns the number of cores. The set_cores procedure must be run first.
-- set_cores was private previously, but we need the information to set
-- intelligent defaults for the configuration file.
procedure set_cores;
function cores_available return cpu_range;
-- Return " (port deleted)" if the catport doesn't exist
-- Return " (directory empty)" if the directory exists but has no contents
-- Return " (Makefile missing)" when makefile is missing
-- otherwise return blank string
function obvious_problem (portsdir, catport : String) return String;
-- Attempts to generate a ports index file after acquiring all port origins
-- Returns False (with an outputted message) if it fails to:
-- a. create directories
-- b. scan fails
-- c. index file creation fails
function generate_ports_index (index_file, portsdir : String) return Boolean;
-- Recursively scans a ports directory tree, returning True as soon as a file or directory
-- newer than the given time is found.
function tree_newer_than_reference
(portsdir : String;
reference : CAL.Time;
valid : out Boolean) return Boolean;
-- Store origin support
-- * store data from flavor index in hash and vector
-- * clear data when complete
-- * valid origin returns true when candidate available verbatim
procedure load_index_for_store_origins;
procedure clear_store_origin_data;
function input_origin_valid (candidate : String) return Boolean;
procedure suggest_flavor_for_bad_origin (candidate : String);
private
package REP renames Replicant;
package PLAT renames Replicant.Platform;
max_ports : constant := 40000;
scan_slave : constant builders := 9;
ss_base : constant String := "/SL09";
dir_ports : constant String := "/xports";
chroot : constant String := "/usr/sbin/chroot ";
index_path : constant String := "/var/cache/synth";
type port_id is range -1 .. max_ports - 1;
subtype port_index is port_id range 0 .. port_id'Last;
port_match_failed : constant port_id := port_id'First;
-- skip "package" because every port has same dependency on ports-mgmt/pkg
-- except for pkg itself. Skip "test" because these dependencies are
-- not required to build packages.
type dependency_type is (fetch, extract, patch, build, library, runtime);
subtype LR_set is dependency_type range library .. runtime;
bmake_execution : exception;
pkgng_execution : exception;
make_garbage : exception;
nonexistent_port : exception;
circular_logic : exception;
seek_failure : exception;
unknown_format : exception;
package subqueue is new AC.Vectors
(Element_Type => port_index,
Index_Type => port_index);
package string_crate is new AC.Vectors
(Element_Type => JT.Text,
Index_Type => port_index,
"=" => JT.SU."=");
type queue_record is
record
ap_index : port_index;
reverse_score : port_index;
end record;
-- Functions for ranking_crate definitions
function "<" (L, R : queue_record) return Boolean;
package ranking_crate is new AC.Ordered_Sets (Element_Type => queue_record);
-- Functions for portkey_crate and package_crate definitions
function port_hash (key : JT.Text) return AC.Hash_Type;
package portkey_crate is new AC.Hashed_Maps
(Key_Type => JT.Text,
Element_Type => port_index,
Hash => port_hash,
Equivalent_Keys => JT.equivalent);
package package_crate is new AC.Hashed_Maps
(Key_Type => JT.Text,
Element_Type => Boolean,
Hash => port_hash,
Equivalent_Keys => JT.equivalent);
-- Functions for block_crate definitions
function block_hash (key : port_index) return AC.Hash_Type;
function block_ekey (left, right : port_index) return Boolean;
package block_crate is new AC.Hashed_Maps
(Key_Type => port_index,
Element_Type => port_index,
Hash => block_hash,
Equivalent_Keys => block_ekey);
type port_record is
record
sequence_id : port_index := 0;
key_cursor : portkey_crate.Cursor := portkey_crate.No_Element;
jobs : builders := 1;
ignore_reason : JT.Text := JT.blank;
port_version : JT.Text := JT.blank;
package_name : JT.Text := JT.blank;
pkg_dep_query : JT.Text := JT.blank;
ignored : Boolean := False;
scanned : Boolean := False;
rev_scanned : Boolean := False;
unlist_failed : Boolean := False;
work_locked : Boolean := False;
scan_locked : Boolean := False;
pkg_present : Boolean := False;
remote_pkg : Boolean := False;
never_remote : Boolean := False;
deletion_due : Boolean := False;
use_procfs : Boolean := False;
use_linprocfs : Boolean := False;
reverse_score : port_index := 0;
min_librun : Natural := 0;
librun : block_crate.Map;
blocked_by : block_crate.Map;
blocks : block_crate.Map;
all_reverse : block_crate.Map;
options : package_crate.Map;
flavors : string_crate.Vector;
end record;
type port_record_access is access all port_record;
type dim_make_queue is array (scanners) of subqueue.Vector;
type dim_progress is array (scanners) of port_index;
type dim_all_ports is array (port_index) of aliased port_record;
all_ports : dim_all_ports;
ports_keys : portkey_crate.Map;
portlist : portkey_crate.Map;
make_queue : dim_make_queue;
mq_progress : dim_progress := (others => 0);
rank_queue : ranking_crate.Set;
number_cores : cpu_range := cpu_range'First;
lot_number : scanners := 1;
lot_counter : port_index := 0;
last_port : port_index := 0;
prescanned : Boolean := False;
fullpop : Boolean := True;
so_porthash : portkey_crate.Map;
so_serial : string_crate.Vector;
procedure iterate_reverse_deps;
procedure iterate_drill_down;
procedure populate_set_depends (target : port_index;
catport : String;
line : JT.Text;
dtype : dependency_type);
procedure populate_set_options (target : port_index;
line : JT.Text;
on : Boolean);
procedure populate_flavors (target : port_index;
line : JT.Text);
procedure populate_port_data (target : port_index);
procedure populate_port_data_fpc (target : port_index);
procedure populate_port_data_nps (target : port_index);
procedure drill_down (next_target : port_index;
original_target : port_index);
-- subroutines for populate_port_data
procedure prescan_ports_tree (portsdir : String);
procedure grep_Makefile (portsdir, category : String);
procedure walk_all_subdirectories (portsdir, category : String);
procedure wipe_make_queue;
procedure read_flavor_index;
procedure parallel_deep_scan (success : out Boolean;
show_progress : Boolean);
-- some helper routines
function find_colon (Source : String) return Natural;
function scrub_phase (Source : String) return JT.Text;
function get_catport (PR : port_record) return String;
function scan_progress return String;
function get_max_lots return scanners;
function get_pkg_name (origin : String) return String;
function timestamp (hack : CAL.Time; www_format : Boolean := False) return String;
function clean_up_pkgsrc_ignore_reason (dirty_string : String) return JT.Text;
function subdirectory_is_older (portsdir, category : String;
reference : CAL.Time) return Boolean;
type dim_counters is array (count_type) of Natural;
-- bulk run variables
Flog : dim_handlers;
start_time : CAL.Time;
stop_time : CAL.Time;
scan_start : CAL.Time;
scan_stop : CAL.Time;
bld_counter : dim_counters := (0, 0, 0, 0, 0);
end PortScan;
| 39.099631 | 94 | 0.649396 |
22ec26b5466987a59a112cb9c4dddc1b82e93ddd | 1,761 | adb | Ada | source/declarations/adam-declaration-of_subtype.adb | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | 3 | 2017-04-29T14:25:22.000Z | 2017-09-29T10:15:28.000Z | source/declarations/adam-declaration-of_subtype.adb | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | null | null | null | source/declarations/adam-declaration-of_subtype.adb | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | null | null | null | with
AdaM.Factory;
package body AdaM.Declaration.of_subtype
is
-- Storage Pool
--
record_Version : constant := 1;
pool_Size : constant := 5_000;
package Pool is new AdaM.Factory.Pools (".adam-store",
"Declaration.of_subtypes",
pool_Size,
record_Version,
Declaration.of_subtype.item,
Declaration.of_subtype.view);
-- Forge
--
procedure define (Self : in out Item)
is
begin
null;
end define;
overriding
procedure destruct (Self : in out Item)
is
begin
null;
end destruct;
function new_Declaration return View
is
new_View : constant Declaration.of_subtype.view := Pool.new_Item;
begin
define (Declaration.of_subtype.item (new_View.all));
return new_View;
end new_Declaration;
procedure free (Self : in out Declaration.of_subtype.view)
is
begin
destruct (Declaration.of_subtype.item (Self.all));
Pool.free (Self);
end free;
-- Attributes
--
overriding
function Id (Self : access Item) return AdaM.Id
is
begin
return Pool.to_Id (Self);
end Id;
-- Streams
--
procedure View_write (Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Self : in View)
renames Pool.View_write;
procedure View_read (Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Self : out View)
renames Pool.View_read;
end AdaM.Declaration.of_subtype;
| 22.0125 | 85 | 0.545713 |
13183924e86a30a22cd122c5821551c4f7da297a | 1,160 | ads | Ada | tests/game-test_data-tests-attributesdata_container-test_data.ads | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 80 | 2017-04-08T23:14:07.000Z | 2022-02-10T22:30:51.000Z | tests/game-test_data-tests-attributesdata_container-test_data.ads | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 89 | 2017-06-24T08:18:26.000Z | 2021-11-12T04:37:36.000Z | tests/game-test_data-tests-attributesdata_container-test_data.ads | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 9 | 2018-04-14T16:37:25.000Z | 2020-03-21T14:33:49.000Z | -- This package is intended to set up and tear down the test environment.
-- Once created by GNATtest, this package will never be overwritten
-- automatically. Contents of this package can be modified in any way
-- except for sections surrounded by a 'read only' marker.
with Ada.Containers.Formal_Indefinite_Vectors.Test_Data;
with Ada.Containers.Formal_Indefinite_Vectors.Test_Data.Tests;
package Game.Test_Data.Tests.AttributesData_Container.Test_Data is
-- begin read only
type Test is new AUnit.Test_Fixtures.Test_Fixture
-- end read only
with null record;
procedure Set_Up(Gnattest_T: in out Test);
procedure Tear_Down(Gnattest_T: in out Test);
-- begin read only
package Gnattest_Data_Inst is new GNATtest_Generated.GNATtest_Standard.Game
.AttributesData_Container
.Test_Data
(Test);
package Gnattest_Tests_Inst is new Gnattest_Data_Inst.Tests;
type New_Test is new Gnattest_Tests_Inst.Test with null record;
-- end read only
procedure User_Set_Up(Gnattest_T: in out New_Test);
procedure User_Tear_Down(Gnattest_T: in out New_Test);
end Game.Test_Data.Tests.AttributesData_Container.Test_Data;
| 35.151515 | 78 | 0.784483 |
adab774e2bce41f7a2564d2aab09041666ba3f73 | 7,638 | adb | Ada | llvm-gcc-4.2-2.9/gcc/ada/symbols-processing-vms-alpha.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/symbols-processing-vms-alpha.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/symbols-processing-vms-alpha.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y M B O L S . P R O C E S S I N G --
-- --
-- B o d y --
-- --
-- Copyright (C) 2003-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 is the VMS Alpha version of this package
separate (Symbols)
package body Processing is
type Number is mod 2**16;
-- 16 bits unsigned number for number of characters
GSD : constant Number := 10;
-- Code for the Global Symbol Definition section
C_SYM : constant Number := 1;
-- Code for a Symbol subsection
V_DEF_Mask : constant Number := 2**1;
V_NORM_Mask : constant Number := 2**6;
B : Byte;
Number_Of_Characters : Natural := 0;
-- The number of characters of each section
-- The following variables are used by procedure Process when reading an
-- object file.
Code : Number := 0;
Length : Natural := 0;
Dummy : Number;
Nchars : Natural := 0;
Flags : Number := 0;
Symbol : String (1 .. 255);
LSymb : Natural;
procedure Get (N : out Number);
-- Read two bytes from the object file LSB first as unsigned 16 bit number
procedure Get (N : out Natural);
-- Read two bytes from the object file, LSByte first, as a Natural
---------
-- Get --
---------
procedure Get (N : out Number) is
C : Byte;
LSByte : Number;
begin
Read (File, C);
LSByte := Byte'Pos (C);
Read (File, C);
N := LSByte + (256 * Byte'Pos (C));
end Get;
procedure Get (N : out Natural) is
Result : Number;
begin
Get (Result);
N := Natural (Result);
end Get;
-------------
-- Process --
-------------
procedure Process
(Object_File : String;
Success : out Boolean)
is
begin
-- Open the object file with Byte_IO. Return with Success = False if
-- this fails.
begin
Open (File, In_File, Object_File);
exception
when others =>
Put_Line
("*** Unable to open object file """ & Object_File & """");
Success := False;
return;
end;
-- Assume that the object file has a correct format
Success := True;
-- Get the different sections one by one from the object file
while not End_Of_File (File) loop
Get (Code);
Get (Number_Of_Characters);
Number_Of_Characters := Number_Of_Characters - 4;
-- If this is not a Global Symbol Definition section, skip to the
-- next section.
if Code /= GSD then
for J in 1 .. Number_Of_Characters loop
Read (File, B);
end loop;
else
-- Skip over the next 4 bytes
Get (Dummy);
Get (Dummy);
Number_Of_Characters := Number_Of_Characters - 4;
-- Get each subsection in turn
loop
Get (Code);
Get (Nchars);
Get (Dummy);
Get (Flags);
Number_Of_Characters := Number_Of_Characters - 8;
Nchars := Nchars - 8;
-- If this is a symbol and the V_DEF flag is set, get the
-- symbol.
if Code = C_SYM and then ((Flags and V_DEF_Mask) /= 0) then
-- First, reach the symbol length
for J in 1 .. 25 loop
Read (File, B);
Nchars := Nchars - 1;
Number_Of_Characters := Number_Of_Characters - 1;
end loop;
Length := Byte'Pos (B);
LSymb := 0;
-- Get the symbol characters
for J in 1 .. Nchars loop
Read (File, B);
Number_Of_Characters := Number_Of_Characters - 1;
if Length > 0 then
LSymb := LSymb + 1;
Symbol (LSymb) := B;
Length := Length - 1;
end if;
end loop;
-- Create the new Symbol
declare
S_Data : Symbol_Data;
begin
S_Data.Name := new String'(Symbol (1 .. LSymb));
-- The symbol kind (Data or Procedure) depends on the
-- V_NORM flag.
if (Flags and V_NORM_Mask) = 0 then
S_Data.Kind := Data;
else
S_Data.Kind := Proc;
end if;
-- Put the new symbol in the table
Symbol_Table.Increment_Last (Complete_Symbols);
Complete_Symbols.Table
(Symbol_Table.Last (Complete_Symbols)) := S_Data;
end;
else
-- As it is not a symbol subsection, skip to the next
-- subsection.
for J in 1 .. Nchars loop
Read (File, B);
Number_Of_Characters := Number_Of_Characters - 1;
end loop;
end if;
-- Exit the GSD section when number of characters reaches 0
exit when Number_Of_Characters = 0;
end loop;
end if;
end loop;
-- The object file has been processed, close it
Close (File);
exception
-- For any exception, output an error message, close the object file
-- and return with Success = False.
when X : others =>
Put_Line ("unexpected exception raised while processing """
& Object_File & """");
Put_Line (Exception_Information (X));
Close (File);
Success := False;
end Process;
end Processing;
| 32.364407 | 78 | 0.459413 |
3defc2c5f203478f9ebcf92335eb4922231d50b9 | 333 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/debug7.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/debug7.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/debug7.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- { dg-do compile }
-- { dg-skip-if "No dwarf-2 support" { hppa*-*-hpux* } "*" "" }
-- { dg-options "-cargs -gdwarf-2 -gstrict-dwarf -dA -margs" }
-- { dg-final { scan-assembler "DW_TAG_imported_decl" } }
package body Debug7 is
function Next (I : Integer) return Integer is
begin
return I + 1;
end Next;
end Debug7;
| 27.75 | 63 | 0.615616 |
ad12ae0739bf3c8c4d00540e948a962a47c9b5d0 | 397 | ads | Ada | specs/ada/common/tkmrpc-request-cfg-tkm_limits-convert.ads | DrenfongWong/tkm-rpc | 075d22871cf81d497aac656c7f03a513278b641c | [
"BSD-3-Clause"
] | null | null | null | specs/ada/common/tkmrpc-request-cfg-tkm_limits-convert.ads | DrenfongWong/tkm-rpc | 075d22871cf81d497aac656c7f03a513278b641c | [
"BSD-3-Clause"
] | null | null | null | specs/ada/common/tkmrpc-request-cfg-tkm_limits-convert.ads | DrenfongWong/tkm-rpc | 075d22871cf81d497aac656c7f03a513278b641c | [
"BSD-3-Clause"
] | null | null | null | with Ada.Unchecked_Conversion;
package Tkmrpc.Request.Cfg.Tkm_Limits.Convert is
function To_Request is new Ada.Unchecked_Conversion (
Source => Tkm_Limits.Request_Type,
Target => Request.Data_Type);
function From_Request is new Ada.Unchecked_Conversion (
Source => Request.Data_Type,
Target => Tkm_Limits.Request_Type);
end Tkmrpc.Request.Cfg.Tkm_Limits.Convert;
| 28.357143 | 58 | 0.753149 |
58cd46113ae0bb8d10fdecb2e3fc17f2c00122e1 | 13,327 | ads | Ada | stm32l0/stm32l0x1/svd/stm32_svd-gpio.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 1 | 2021-04-06T07:57:56.000Z | 2021-04-06T07:57:56.000Z | stm32l0/stm32l0x1/svd/stm32_svd-gpio.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | null | null | null | stm32l0/stm32l0x1/svd/stm32_svd-gpio.ads | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 2 | 2018-05-29T13:59:31.000Z | 2019-02-03T19:48:08.000Z | -- This spec has been automatically generated from STM32L0x1.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with System;
package STM32_SVD.GPIO is
pragma Preelaborate;
---------------
-- Registers --
---------------
-- MODER_MODE array
type MODER_MODE_Field_Array is array (0 .. 15) of STM32_SVD.UInt2
with Component_Size => 2, Size => 32;
-- GPIO port mode register
type MODER_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- MODE as a value
Val : STM32_SVD.UInt32;
when True =>
-- MODE as an array
Arr : MODER_MODE_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for MODER_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- OTYPER_OT array
type OTYPER_OT_Field_Array is array (0 .. 15) of STM32_SVD.Bit
with Component_Size => 1, Size => 16;
-- Type definition for OTYPER_OT
type OTYPER_OT_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- OT as a value
Val : STM32_SVD.UInt16;
when True =>
-- OT as an array
Arr : OTYPER_OT_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for OTYPER_OT_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- GPIO port output type register
type OTYPER_Register is record
-- Port x configuration bits (y = 0..15)
OT : OTYPER_OT_Field;
-- unspecified
Reserved_16_31 : STM32_SVD.UInt16;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for OTYPER_Register use record
OT at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- OSPEEDR_OSPEED array
type OSPEEDR_OSPEED_Field_Array is array (0 .. 15) of STM32_SVD.UInt2
with Component_Size => 2, Size => 32;
-- GPIO port output speed register
type OSPEEDR_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- OSPEED as a value
Val : STM32_SVD.UInt32;
when True =>
-- OSPEED as an array
Arr : OSPEEDR_OSPEED_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for OSPEEDR_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- PUPDR_PUPD array
type PUPDR_PUPD_Field_Array is array (0 .. 15) of STM32_SVD.UInt2
with Component_Size => 2, Size => 32;
-- GPIO port pull-up/pull-down register
type PUPDR_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- PUPD as a value
Val : STM32_SVD.UInt32;
when True =>
-- PUPD as an array
Arr : PUPDR_PUPD_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for PUPDR_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- IDR_ID array
type IDR_ID_Field_Array is array (0 .. 15) of STM32_SVD.Bit
with Component_Size => 1, Size => 16;
-- Type definition for IDR_ID
type IDR_ID_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- ID as a value
Val : STM32_SVD.UInt16;
when True =>
-- ID as an array
Arr : IDR_ID_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for IDR_ID_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- GPIO port input data register
type IDR_Register is record
-- Read-only. Port input data bit (y = 0..15)
ID : IDR_ID_Field;
-- unspecified
Reserved_16_31 : STM32_SVD.UInt16;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for IDR_Register use record
ID at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- ODR_OD array
type ODR_OD_Field_Array is array (0 .. 15) of STM32_SVD.Bit
with Component_Size => 1, Size => 16;
-- Type definition for ODR_OD
type ODR_OD_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- OD as a value
Val : STM32_SVD.UInt16;
when True =>
-- OD as an array
Arr : ODR_OD_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for ODR_OD_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- GPIO port output data register
type ODR_Register is record
-- Port output data bit (y = 0..15)
OD : ODR_OD_Field;
-- unspecified
Reserved_16_31 : STM32_SVD.UInt16;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for ODR_Register use record
OD at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-- BSRR_BS array
type BSRR_BS_Field_Array is array (0 .. 15) of STM32_SVD.Bit
with Component_Size => 1, Size => 16;
-- Type definition for BSRR_BS
type BSRR_BS_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- BS as a value
Val : STM32_SVD.UInt16;
when True =>
-- BS as an array
Arr : BSRR_BS_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for BSRR_BS_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- BSRR_BR array
type BSRR_BR_Field_Array is array (0 .. 15) of STM32_SVD.Bit
with Component_Size => 1, Size => 16;
-- Type definition for BSRR_BR
type BSRR_BR_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- BR as a value
Val : STM32_SVD.UInt16;
when True =>
-- BR as an array
Arr : BSRR_BR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for BSRR_BR_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- GPIO port bit set/reset register
type BSRR_Register is record
-- Write-only. Port x set bit y (y= 0..15)
BS : BSRR_BS_Field;
-- Write-only. Port x reset bit y (y = 0..15)
BR : BSRR_BR_Field;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for BSRR_Register use record
BS at 0 range 0 .. 15;
BR at 0 range 16 .. 31;
end record;
-- LCKR_LCK array
type LCKR_LCK_Field_Array is array (0 .. 15) of STM32_SVD.Bit
with Component_Size => 1, Size => 16;
-- Type definition for LCKR_LCK
type LCKR_LCK_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- LCK as a value
Val : STM32_SVD.UInt16;
when True =>
-- LCK as an array
Arr : LCKR_LCK_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for LCKR_LCK_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- GPIO port configuration lock register
type LCKR_Register is record
-- Port x lock bit y (y= 0..15)
LCK : LCKR_LCK_Field;
-- Port x lock bit y (y= 0..15)
LCKK : STM32_SVD.Bit;
-- unspecified
Reserved_17_31 : STM32_SVD.UInt15;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for LCKR_Register use record
LCK at 0 range 0 .. 15;
LCKK at 0 range 16 .. 16;
Reserved_17_31 at 0 range 17 .. 31;
end record;
-- AFRL_AFSEL array
type AFRL_AFSEL_Field_Array is array (0 .. 7) of STM32_SVD.UInt4
with Component_Size => 4, Size => 32;
-- GPIO alternate function low register
type AFRL_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- AFSEL as a value
Val : STM32_SVD.UInt32;
when True =>
-- AFSEL as an array
Arr : AFRL_AFSEL_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for AFRL_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- AFRH_AFSEL array
type AFRH_AFSEL_Field_Array is array (8 .. 15) of STM32_SVD.UInt4
with Component_Size => 4, Size => 32;
-- GPIO alternate function high register
type AFRH_Register
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- AFSEL as a value
Val : STM32_SVD.UInt32;
when True =>
-- AFSEL as an array
Arr : AFRH_AFSEL_Field_Array;
end case;
end record
with Unchecked_Union, Size => 32, Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for AFRH_Register use record
Val at 0 range 0 .. 31;
Arr at 0 range 0 .. 31;
end record;
-- BRR_BR array
type BRR_BR_Field_Array is array (0 .. 15) of STM32_SVD.Bit
with Component_Size => 1, Size => 16;
-- Type definition for BRR_BR
type BRR_BR_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- BR as a value
Val : STM32_SVD.UInt16;
when True =>
-- BR as an array
Arr : BRR_BR_Field_Array;
end case;
end record
with Unchecked_Union, Size => 16;
for BRR_BR_Field use record
Val at 0 range 0 .. 15;
Arr at 0 range 0 .. 15;
end record;
-- GPIO port bit reset register
type BRR_Register is record
-- Write-only. Port x Reset bit y (y= 0 .. 15)
BR : BRR_BR_Field;
-- unspecified
Reserved_16_31 : STM32_SVD.UInt16;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for BRR_Register use record
BR at 0 range 0 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- General-purpose I/Os
type GPIO_Peripheral is record
-- GPIO port mode register
MODER : aliased MODER_Register;
-- GPIO port output type register
OTYPER : aliased OTYPER_Register;
-- GPIO port output speed register
OSPEEDR : aliased OSPEEDR_Register;
-- GPIO port pull-up/pull-down register
PUPDR : aliased PUPDR_Register;
-- GPIO port input data register
IDR : aliased IDR_Register;
-- GPIO port output data register
ODR : aliased ODR_Register;
-- GPIO port bit set/reset register
BSRR : aliased BSRR_Register;
-- GPIO port configuration lock register
LCKR : aliased LCKR_Register;
-- GPIO alternate function low register
AFRL : aliased AFRL_Register;
-- GPIO alternate function high register
AFRH : aliased AFRH_Register;
-- GPIO port bit reset register
BRR : aliased BRR_Register;
end record
with Volatile;
for GPIO_Peripheral use record
MODER at 16#0# range 0 .. 31;
OTYPER at 16#4# range 0 .. 31;
OSPEEDR at 16#8# range 0 .. 31;
PUPDR at 16#C# range 0 .. 31;
IDR at 16#10# range 0 .. 31;
ODR at 16#14# range 0 .. 31;
BSRR at 16#18# range 0 .. 31;
LCKR at 16#1C# range 0 .. 31;
AFRL at 16#20# range 0 .. 31;
AFRH at 16#24# range 0 .. 31;
BRR at 16#28# range 0 .. 31;
end record;
-- General-purpose I/Os
GPIOA_Periph : aliased GPIO_Peripheral
with Import, Address => GPIOA_Base;
GPIOB_Periph : aliased GPIO_Peripheral
with Import, Address => GPIOB_Base;
-- General-purpose I/Os
GPIOC_Periph : aliased GPIO_Peripheral
with Import, Address => GPIOC_Base;
-- General-purpose I/Os
GPIOD_Periph : aliased GPIO_Peripheral
with Import, Address => GPIOD_Base;
-- General-purpose I/Os
GPIOE_Periph : aliased GPIO_Peripheral
with Import, Address => GPIOE_Base;
-- General-purpose I/Os
GPIOH_Periph : aliased GPIO_Peripheral
with Import, Address => GPIOH_Base;
end STM32_SVD.GPIO;
| 28.295117 | 79 | 0.590756 |
2228e581dbedcb02bde9b77ae945df53176105f5 | 2,603 | adb | Ada | day10/src/day.adb | jwarwick/aoc_2020 | b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377 | [
"MIT"
] | 3 | 2020-12-26T23:44:33.000Z | 2021-12-06T16:00:54.000Z | day10/src/day.adb | jwarwick/aoc_2020 | b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377 | [
"MIT"
] | null | null | null | day10/src/day.adb | jwarwick/aoc_2020 | b88e5a69f7ce035c4bc0a2474e0e0cdbb7b43377 | [
"MIT"
] | null | null | null | -- AoC 2020, Day 10
with Ada.Text_IO;
with Ada.Containers.Ordered_Maps;
package body Day is
package TIO renames Ada.Text_IO;
function load_file(filename : in String) return Adaptors.Vector is
package Natural_Text_IO is new Ada.Text_IO.Integer_IO(Natural);
package Adaptor_Sorter is new Adaptors.Generic_Sorting;
file : TIO.File_Type;
v : Adaptors.Vector := Empty_Vector;
n : Natural := 0;
begin
TIO.open(File => file, Mode => TIO.In_File, Name => filename);
while not TIO.end_of_file(file) loop
Natural_Text_IO.get(file, n);
v.append(n);
end loop;
TIO.close(file);
Adaptor_Sorter.sort(Container => v);
return v;
end load_file;
function mult_diffs(v : in Adaptors.Vector) return Natural is
diff_1 : Natural := 0;
diff_3 : Natural := 0;
curr : Natural;
last : Natural := v.first_element;
begin
for idx in v.first_index+1 .. v.last_index loop
curr := v(idx);
case curr - last is
when 3 => diff_3 := diff_3 + 1;
when 1 => diff_1 := diff_1 + 1;
when others => null;
end case;
last := curr;
end loop;
return diff_1 * diff_3;
end mult_diffs;
function mult_1_3_differences(v : in Adaptors.Vector) return Natural is
remaining : Adaptors.Vector := v;
begin
remaining.prepend(0);
remaining.append(remaining.last_element + 3);
return mult_diffs(remaining);
end mult_1_3_differences;
package Reachable_Map is new Ada.Containers.Ordered_Maps
(Element_Type => Long_Integer,
Key_Type => Natural);
use Reachable_Map;
reach_map : Reachable_Map.Map := Empty_Map;
function count(curr_idx : in Natural; v : in Adaptors.Vector) return Long_Integer is
curr_value : constant Natural := v(curr_idx);
total : Long_Integer := 0;
last_idx : constant Natural := Natural'Min(curr_idx+3, v.last_index);
begin
if contains(reach_map, curr_value) then
return reach_map(curr_value);
end if;
for next_idx in curr_idx+1..last_idx loop
if v(next_idx) + 3 >= curr_value then
total := total + count(next_idx, v);
end if;
end loop;
reach_map.insert(curr_value, total);
return total;
end count;
function total_arrangments(v : in Adaptors.Vector) return Long_Integer is
v_first_last : Adaptors.Vector := v;
begin
v_first_last.prepend(0);
v_first_last.append(v_first_last.last_element + 3);
reverse_elements(v_first_last);
clear(reach_map);
reach_map.insert(0, 1);
return count(v_first_last.first_index, v_first_last);
end total_arrangments;
end Day;
| 28.922222 | 86 | 0.67768 |
c711704ed52287c869387a057144a31b8d727cfa | 15,211 | ads | Ada | src/asf-applications-main.ads | Letractively/ada-asf | da9f85f85666eba7e23fefea661160863b74154d | [
"Apache-2.0"
] | null | null | null | src/asf-applications-main.ads | Letractively/ada-asf | da9f85f85666eba7e23fefea661160863b74154d | [
"Apache-2.0"
] | null | null | null | src/asf-applications-main.ads | Letractively/ada-asf | da9f85f85666eba7e23fefea661160863b74154d | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- applications -- Ada Web Application
-- Copyright (C) 2009, 2010, 2011, 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 Util.Beans.Basic;
with Util.Locales;
with EL.Objects;
with EL.Contexts;
with EL.Functions;
with EL.Functions.Default;
with EL.Expressions;
with EL.Variables.Default;
with Ada.Strings.Unbounded;
with ASF.Locales;
with ASF.Factory;
with ASF.Converters;
with ASF.Validators;
with ASF.Contexts.Faces;
with ASF.Contexts.Exceptions;
with ASF.Lifecycles;
with ASF.Applications.Views;
with ASF.Navigations;
with ASF.Beans;
with ASF.Requests;
with ASF.Responses;
with ASF.Servlets;
with ASF.Events.Faces.Actions;
with Security.Policies; use Security;
package ASF.Applications.Main is
use ASF.Beans;
-- ------------------------------
-- Factory for creation of lifecycle, view handler
-- ------------------------------
type Application_Factory is tagged limited private;
-- Create the lifecycle handler. The lifecycle handler is created during
-- the initialization phase of the application. The default implementation
-- creates an <b>ASF.Lifecycles.Default.Default_Lifecycle</b> object.
-- It can be overriden to change the behavior of the ASF request lifecycle.
function Create_Lifecycle_Handler (App : in Application_Factory)
return ASF.Lifecycles.Lifecycle_Access;
-- Create the view handler. The view handler is created during
-- the initialization phase of the application. The default implementation
-- creates an <b>ASF.Applications.Views.View_Handler</b> object.
-- It can be overriden to change the views associated with the application.
function Create_View_Handler (App : in Application_Factory)
return ASF.Applications.Views.View_Handler_Access;
-- Create the navigation handler. The navigation handler is created during
-- the initialization phase of the application. The default implementation
-- creates an <b>ASF.Navigations.Navigation_Handler</b> object.
-- It can be overriden to change the navigations associated with the application.
function Create_Navigation_Handler (App : in Application_Factory)
return ASF.Navigations.Navigation_Handler_Access;
-- Create the security policy manager. The security policy manager is created during
-- the initialization phase of the application. The default implementation
-- creates a <b>Security.Policies.Policy_Manager</b> object.
function Create_Security_Manager (App : in Application_Factory)
return Security.Policies.Policy_Manager_Access;
-- Create the exception handler. The exception handler is created during
-- the initialization phase of the application. The default implementation
-- creates a <b>ASF.Contexts.Exceptions.Exception_Handler</b> object.
function Create_Exception_Handler (App : in Application_Factory)
return ASF.Contexts.Exceptions.Exception_Handler_Access;
-- ------------------------------
-- Application
-- ------------------------------
type Application is new ASF.Servlets.Servlet_Registry
and ASF.Events.Faces.Actions.Action_Listener with private;
type Application_Access is access all Application'Class;
-- Get the application view handler.
function Get_View_Handler (App : access Application)
return access Views.View_Handler'Class;
-- Get the lifecycle handler.
function Get_Lifecycle_Handler (App : in Application)
return ASF.Lifecycles.Lifecycle_Access;
-- Get the navigation handler.
function Get_Navigation_Handler (App : in Application)
return ASF.Navigations.Navigation_Handler_Access;
-- Get the permission manager associated with this application.
function Get_Security_Manager (App : in Application)
return Security.Policies.Policy_Manager_Access;
-- Get the action event listener responsible for processing action
-- events and triggering the navigation to the next view using the
-- navigation handler.
function Get_Action_Listener (App : in Application)
return ASF.Events.Faces.Actions.Action_Listener_Access;
-- Process the action associated with the action event. The action returns
-- and outcome which is then passed to the navigation handler to navigate to
-- the next view.
overriding
procedure Process_Action (Listener : in Application;
Event : in ASF.Events.Faces.Actions.Action_Event'Class;
Context : in out Contexts.Faces.Faces_Context'Class);
-- Execute the action method. The action returns and outcome which is then passed
-- to the navigation handler to navigate to the next view.
procedure Process_Action (Listener : in Application;
Method : in EL.Expressions.Method_Info;
Context : in out Contexts.Faces.Faces_Context'Class);
-- Initialize the application
procedure Initialize (App : in out Application;
Conf : in Config;
Factory : in out Application_Factory'Class);
-- Initialize the ASF components provided by the application.
-- This procedure is called by <b>Initialize</b>.
-- It should register the component factories used by the application.
procedure Initialize_Components (App : in out Application);
-- Initialize the application configuration properties. Properties defined in <b>Conf</b>
-- are expanded by using the EL expression resolver.
procedure Initialize_Config (App : in out Application;
Conf : in out Config);
-- Initialize the servlets provided by the application.
-- This procedure is called by <b>Initialize</b>.
-- It should register the application servlets.
procedure Initialize_Servlets (App : in out Application);
-- Initialize the filters provided by the application.
-- This procedure is called by <b>Initialize</b>.
-- It should register the application filters.
procedure Initialize_Filters (App : in out Application);
-- Finalizes the application, freeing the memory.
overriding
procedure Finalize (App : in out Application);
-- Get the configuration parameter;
function Get_Config (App : Application;
Param : Config_Param) return String;
-- Set a global variable in the global EL contexts.
procedure Set_Global (App : in out Application;
Name : in String;
Value : in String);
procedure Set_Global (App : in out Application;
Name : in String;
Value : in EL.Objects.Object);
-- Resolve a global variable and return its value.
-- Raises the <b>EL.Functions.No_Variable</b> exception if the variable does not exist.
function Get_Global (App : in Application;
Name : in Ada.Strings.Unbounded.Unbounded_String;
Context : in EL.Contexts.ELContext'Class)
return EL.Objects.Object;
-- Get the list of supported locales for this application.
function Get_Supported_Locales (App : in Application)
return Util.Locales.Locale_Array;
-- Add the locale to the list of supported locales.
procedure Add_Supported_Locale (App : in out Application;
Locale : in Util.Locales.Locale);
-- Get the default locale defined by the application.
function Get_Default_Locale (App : in Application) return Util.Locales.Locale;
-- Set the default locale defined by the application.
procedure Set_Default_Locale (App : in out Application;
Locale : in Util.Locales.Locale);
-- Compute the locale that must be used according to the <b>Accept-Language</b> request
-- header and the application supported locales.
function Calculate_Locale (Handler : in Application;
Context : in ASF.Contexts.Faces.Faces_Context'Class)
return Util.Locales.Locale;
-- Register a bundle and bind it to a facelet variable.
procedure Register (App : in out Application;
Name : in String;
Bundle : in String);
-- Register the bean identified by <b>Name</b> and associated with the class <b>Class</b>.
-- The class must have been registered by using the <b>Register</b> class operation.
-- The scope defines the scope of the bean.
procedure Register (App : in out Application;
Name : in String;
Class : in String;
Params : in Parameter_Bean_Ref.Ref;
Scope : in Scope_Type := REQUEST_SCOPE);
-- Register under the name identified by <b>Name</b> the class instance <b>Class</b>.
procedure Register_Class (App : in out Application;
Name : in String;
Class : in ASF.Beans.Class_Binding_Access);
-- Register under the name identified by <b>Name</b> a function to create a bean.
-- This is a simplified class registration.
procedure Register_Class (App : in out Application;
Name : in String;
Handler : in ASF.Beans.Create_Bean_Access);
-- Create a bean by using the create operation registered for the name
procedure Create (App : in Application;
Name : in Ada.Strings.Unbounded.Unbounded_String;
Context : in EL.Contexts.ELContext'Class;
Result : out Util.Beans.Basic.Readonly_Bean_Access;
Scope : out Scope_Type);
-- Add a converter in the application. The converter is referenced by
-- the specified name in the XHTML files.
procedure Add_Converter (App : in out Application;
Name : in String;
Converter : in ASF.Converters.Converter_Access);
-- Register a binding library in the factory.
procedure Add_Components (App : in out Application;
Bindings : in ASF.Factory.Factory_Bindings_Access);
-- Closes the application
procedure Close (App : in out Application);
-- Set the current faces context before processing a view.
procedure Set_Context (App : in out Application;
Context : in ASF.Contexts.Faces.Faces_Context_Access);
-- Execute the lifecycle phases on the faces context.
procedure Execute_Lifecycle (App : in Application;
Context : in out ASF.Contexts.Faces.Faces_Context'Class);
-- Dispatch the request received on a page.
procedure Dispatch (App : in out Application;
Page : in String;
Request : in out ASF.Requests.Request'Class;
Response : in out ASF.Responses.Response'Class);
-- Dispatch a bean action request.
-- 1. Find the bean object identified by <b>Name</b>, create it if necessary.
-- 2. Resolve the bean method identified by <b>Operation</b>.
-- 3. If the method is an action method (see ASF.Events.Actions), call that method.
-- 4. Using the outcome action result, decide using the navigation handler what
-- is the result view.
-- 5. Render the result view resolved by the navigation handler.
procedure Dispatch (App : in out Application;
Name : in String;
Operation : in String;
Request : in out ASF.Requests.Request'Class;
Response : in out ASF.Responses.Response'Class;
Prepare : access procedure (Bean : access Util.Beans.Basic.Bean'Class));
-- Find the converter instance that was registered under the given name.
-- Returns null if no such converter exist.
function Find (App : in Application;
Name : in EL.Objects.Object) return ASF.Converters.Converter_Access;
-- Find the validator instance that was registered under the given name.
-- Returns null if no such validator exist.
function Find_Validator (App : in Application;
Name : in EL.Objects.Object)
return ASF.Validators.Validator_Access;
-- Register some functions
generic
with procedure Set_Functions (Mapper : in out EL.Functions.Function_Mapper'Class);
procedure Register_Functions (App : in out Application'Class);
-- Register some bean definitions.
generic
with procedure Set_Beans (Factory : in out ASF.Beans.Bean_Factory);
procedure Register_Beans (App : in out Application'Class);
-- Load the resource bundle identified by the <b>Name</b> and for the given
-- <b>Locale</b>.
procedure Load_Bundle (App : in out Application;
Name : in String;
Locale : in String;
Bundle : out ASF.Locales.Bundle);
private
type Application_Factory is tagged limited null record;
type Application is new ASF.Servlets.Servlet_Registry
and ASF.Events.Faces.Actions.Action_Listener with record
View : aliased ASF.Applications.Views.View_Handler;
Lifecycle : ASF.Lifecycles.Lifecycle_Access;
Factory : aliased ASF.Beans.Bean_Factory;
Locales : ASF.Locales.Factory;
Globals : aliased EL.Variables.Default.Default_Variable_Mapper;
Functions : aliased EL.Functions.Default.Default_Function_Mapper;
-- The component factory
Components : aliased ASF.Factory.Component_Factory;
-- The action listener.
Action_Listener : ASF.Events.Faces.Actions.Action_Listener_Access;
-- The navigation handler.
Navigation : ASF.Navigations.Navigation_Handler_Access := null;
-- The permission manager.
Permissions : Security.Policies.Policy_Manager_Access := null;
end record;
end ASF.Applications.Main;
| 45.954683 | 97 | 0.640721 |
29c592fc8b2692252f98d53f4471a9b127f4f3c4 | 1,858 | adb | Ada | src/arch/socs/stm32f429/Ada/soc-gpio-interfaces.adb | wookey-project/ewok-legacy | c973752dac3a0ebe3f7cfca062f50744578f051b | [
"Apache-2.0"
] | null | null | null | src/arch/socs/stm32f429/Ada/soc-gpio-interfaces.adb | wookey-project/ewok-legacy | c973752dac3a0ebe3f7cfca062f50744578f051b | [
"Apache-2.0"
] | null | null | null | src/arch/socs/stm32f429/Ada/soc-gpio-interfaces.adb | wookey-project/ewok-legacy | c973752dac3a0ebe3f7cfca062f50744578f051b | [
"Apache-2.0"
] | null | null | null | --
-- Copyright 2018 The wookey project team <[email protected]>
-- - Ryad Benadjila
-- - Arnauld Michelizza
-- - Mathieu Renard
-- - Philippe Thierry
-- - Philippe Trebuchet
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
--
--
package body soc.gpio.interfaces
with spark_mode => off
is
function configure
(port : in unsigned_8;
pin : in unsigned_8;
mode : in t_pin_mode;
otype : in t_pin_output_type;
ospeed : in t_pin_output_speed;
pupd : in t_pin_pupd;
af : in t_pin_alt_func)
return types.c.t_retval
is
gpio_port : constant t_gpio_port_index := t_gpio_port_index'val (port);
gpio_pin : constant t_gpio_pin_index := t_gpio_pin_index'val (pin);
begin
if not gpio_port'valid then
return types.c.FAILURE;
end if;
if not gpio_pin'valid then
return types.c.FAILURE;
end if;
soc.gpio.enable_clock (gpio_port);
soc.gpio.set_mode (gpio_port, gpio_pin, mode);
soc.gpio.set_type (gpio_port, gpio_pin, otype);
soc.gpio.set_speed (gpio_port, gpio_pin, ospeed);
soc.gpio.set_pupd (gpio_port, gpio_pin, pupd);
soc.gpio.set_af (gpio_port, gpio_pin, af);
return types.c.SUCCESS;
end configure;
end soc.gpio.interfaces;
| 29.967742 | 79 | 0.659311 |
2e4768437ae97c1ff562ce62fe1a152e565e2513 | 173 | ads | Ada | src/linux/jni_md.ads | Lucretia/jni | c7d6dbc0f457160830ab627d958ad2664179b8e7 | [
"BSD-3-Clause"
] | 3 | 2019-06-14T15:15:37.000Z | 2019-12-09T22:15:44.000Z | src/linux/jni_md.ads | Lucretia/jni | c7d6dbc0f457160830ab627d958ad2664179b8e7 | [
"BSD-3-Clause"
] | null | null | null | src/linux/jni_md.ads | Lucretia/jni | c7d6dbc0f457160830ab627d958ad2664179b8e7 | [
"BSD-3-Clause"
] | 1 | 2019-09-14T16:44:27.000Z | 2019-09-14T16:44:27.000Z | with Interfaces.C; use Interfaces.C;
package JNI_MD is
-- pragma Pure;
subtype jint is int;
subtype jlong is long;
subtype jbyte is signed_char;
end JNI_MD;
| 17.3 | 36 | 0.705202 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.