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
|
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
5eca8757e6ee6e5867d93430bddc4a43686cb8c9 | 21,578 | adb | Ada | src/events.adb | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 80 | 2017-04-08T23:14:07.000Z | 2022-02-10T22:30:51.000Z | src/events.adb | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 89 | 2017-06-24T08:18:26.000Z | 2021-11-12T04:37:36.000Z | src/events.adb | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 9 | 2018-04-14T16:37:25.000Z | 2020-03-21T14:33:49.000Z | -- Copyright 2016-2021 Bartek thindil Jasicki
--
-- This file is part of Steam Sky.
--
-- Steam Sky 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.
--
-- Steam Sky 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 Steam Sky. If not, see <http://www.gnu.org/licenses/>.
with Bases; use Bases;
with BasesTypes; use BasesTypes;
with Combat; use Combat;
with Crew; use Crew;
with Factions; use Factions;
with Items; use Items;
with Maps; use Maps;
with Messages; use Messages;
with Ships; use Ships;
with Ships.Cargo; use Ships.Cargo;
with Ships.Crew; use Ships.Crew;
with Ships.Movement; use Ships.Movement;
with Utils; use Utils;
package body Events is
function CheckForEvent return Boolean is
TimePassed: Integer;
CrewIndex: Crew_Container.Extended_Index := 0;
Roll: Positive range 1 .. 100;
Roll2: Integer range -20 .. 120;
Engines: Positive_Container.Vector;
BaseIndex: constant Extended_Base_Range :=
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).BaseIndex;
Enemies: UnboundedString_Container.Vector;
procedure GainPerception is
begin
Gain_Perception_Loop :
for I in Player_Ship.Crew.Iterate loop
if Player_Ship.Crew(I).Order in Pilot | Gunner then
GainExp(1, Perception_Skill, Crew_Container.To_Index(I));
end if;
end loop Gain_Perception_Loop;
end GainPerception;
begin
if SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).EventIndex > 0 then
case Events_List
(SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).EventIndex)
.EType is
when EnemyShip =>
return
StartCombat
(Events_List
(SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).EventIndex)
.ShipIndex);
when others =>
return False;
end case;
end if;
-- No event
if Get_Random(1, 100) > 6 then
return False;
end if;
Roll := Get_Random(1, 100);
if BaseIndex = 0 then -- Outside bases
case Roll is
when 1 .. 5 => -- Engine damaged
CrewIndex := FindMember(Engineer);
if CrewIndex > 0 and Player_Ship.Speed /= FULL_STOP then
Roll2 := Get_Random(1, 100);
case Player_Ship.Speed is
when QUARTER_SPEED =>
Roll2 := (if Roll2 < 21 then 1 else Roll2 - 20);
when FULL_SPEED =>
Roll2 := Roll2 + 20;
when others =>
null;
end case;
if Roll2 >
GetSkillLevel
(Player_Ship.Crew(CrewIndex), Engineering_Skill) then
AddMessage
("One of your engines is taking damage.", OtherMessage,
RED);
Count_Engines_Loop :
for I in Player_Ship.Modules.Iterate loop
if Player_Ship.Modules(I).M_Type = ENGINE
and then not Player_Ship.Modules(I).Disabled then
Engines.Append
(New_Item => Modules_Container.To_Index(I));
end if;
end loop Count_Engines_Loop;
declare
EngineIndex: constant Positive :=
Engines
(Get_Random
(Engines.First_Index, Engines.Last_Index));
begin
Player_Ship.Modules(EngineIndex).Durability :=
Player_Ship.Modules(EngineIndex).Durability - 1;
end;
UpdateOrders(Player_Ship);
else
AddMessage
(To_String(Player_Ship.Crew(CrewIndex).Name) &
" has prevented engine damage.",
OtherMessage, GREEN);
end if;
GainExp(1, Engineering_Skill, CrewIndex);
end if;
when 6 .. 20 => -- Bad weather
CrewIndex := FindMember(Pilot);
if CrewIndex > 0 then
AddMessage
("Sudden bad weather causes your travel to take longer.",
OtherMessage, RED);
TimePassed :=
60 -
GetSkillLevel(Player_Ship.Crew(CrewIndex), Piloting_Skill);
if TimePassed < 1 then
TimePassed := 1;
end if;
GainExp(1, Piloting_Skill, CrewIndex);
UpdateCargo
(Player_Ship, FindProtoItem(ItemType => Fuel_Type),
CountFuelNeeded);
Update_Game(TimePassed);
end if;
when 21 .. 23 => -- Friendly trader
Events_List.Append
(New_Item =>
(Trader, Player_Ship.Sky_X, Player_Ship.Sky_Y,
Get_Random(30, 45),
Traders
(Get_Random(Traders.First_Index, Traders.Last_Index))));
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).EventIndex :=
Events_List.Last_Index;
AddMessage("You've meet a friendly trader.", OtherMessage);
GainPerception;
UpdateOrders(Player_Ship);
when 24 .. 30 => -- Friendly ship
Events_List.Append
(New_Item =>
(FriendlyShip, Player_Ship.Sky_X, Player_Ship.Sky_Y,
Get_Random(30, 45),
FriendlyShips
(Get_Random
(FriendlyShips.First_Index,
FriendlyShips.Last_Index))));
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).EventIndex :=
Events_List.Last_Index;
AddMessage("You've spotted a friendly ship.", OtherMessage);
GainPerception;
UpdateOrders(Player_Ship);
when others => -- Combat
GenerateEnemies(Enemies);
Events_List.Append
(New_Item =>
(EnemyShip, Player_Ship.Sky_X, Player_Ship.Sky_Y,
Get_Random(30, 45),
Enemies
(Get_Random(Enemies.First_Index, Enemies.Last_Index))));
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).EventIndex :=
Events_List.Last_Index;
return
StartCombat(Events_List(Events_List.Last_Index).ShipIndex);
end case;
else
if Sky_Bases(BaseIndex).Population = 0 then
if Roll < 6 and
Player_Ship.Speed /=
DOCKED then -- Change owner of abandoned base
RecoverBase(BaseIndex);
end if;
return False;
end if;
if Player_Ship.Speed /= DOCKED then
if Roll in 21 .. 30 and
Sky_Bases(BaseIndex).Reputation(1) = -100 then
Roll := 31;
end if;
if Factions_List(Sky_Bases(BaseIndex).Owner).Flags.Contains
(To_Unbounded_String("diseaseimmune")) and
Roll = 21 then
Roll := 20;
end if;
case Roll is
when 1 .. 20 => -- Base is attacked
GenerateEnemies(Enemies, To_Unbounded_String("Any"), False);
Events_List.Append
(New_Item =>
(AttackOnBase, Player_Ship.Sky_X, Player_Ship.Sky_Y,
Get_Random(60, 90),
Enemies
(Get_Random
(Enemies.First_Index, Enemies.Last_Index))));
AddMessage
("You can't dock to base now, because base is under attack. You can help defend it.",
OtherMessage);
return
StartCombat(Events_List(Events_List.Last_Index).ShipIndex);
when 21 => -- Disease in base
Events_List.Append
(New_Item =>
(Disease, Player_Ship.Sky_X, Player_Ship.Sky_Y,
Get_Random(10_080, 12_000), 1));
AddMessage
("You can't dock to base now, it is closed due to disease.",
OtherMessage);
when 22 .. 30 => -- Double price for item in base
declare
ItemIndex: Natural;
NewItemIndex: Unbounded_String;
begin
Get_Price_Loop :
loop
ItemIndex :=
Get_Random(1, Positive(Items_List.Length));
Find_Item_Index_Loop :
for J in Items_List.Iterate loop
ItemIndex := ItemIndex - 1;
if ItemIndex = 0 then
if Get_Price
(Sky_Bases
(SkyMap
(Player_Ship.Sky_X, Player_Ship.Sky_Y)
.BaseIndex)
.Base_Type,
Objects_Container.Key(J)) >
0 then
NewItemIndex := Objects_Container.Key(J);
end if;
exit Find_Item_Index_Loop;
end if;
end loop Find_Item_Index_Loop;
exit Get_Price_Loop when Get_Price
(Sky_Bases
(SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y)
.BaseIndex)
.Base_Type,
NewItemIndex) >
0;
end loop Get_Price_Loop;
Events_List.Append
(New_Item =>
(DoublePrice, Player_Ship.Sky_X, Player_Ship.Sky_Y,
Get_Random(1_440, 2_880), NewItemIndex));
end;
when others => -- Full docks or enemy patrol
if Roll in 20 .. 40 and
not IsFriendly
(Player_Ship.Crew(1).Faction,
Sky_Bases(BaseIndex).Owner) then
GenerateEnemies
(Enemies, Sky_Bases(BaseIndex).Owner, False);
Events_List.Append
(New_Item =>
(EnemyPatrol, Player_Ship.Sky_X, Player_Ship.Sky_Y,
Get_Random(30, 45),
Enemies
(Get_Random
(Enemies.First_Index, Enemies.Last_Index))));
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).EventIndex :=
Events_List.Last_Index;
return
StartCombat
(Events_List(Events_List.Last_Index).ShipIndex);
end if;
Events_List.Append
(New_Item =>
(FullDocks, Player_Ship.Sky_X, Player_Ship.Sky_Y,
Get_Random(15, 30), 1));
AddMessage
("You can't dock to base now, because it's docks are full.",
OtherMessage, RED);
end case;
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).EventIndex :=
Events_List.Last_Index;
else
if Roll < 5 and
Player_Ship.Crew.Last_Index > 1 then -- Brawl in base
declare
RestingCrew: Positive_Container.Vector;
Injuries: Positive;
begin
Find_Resting_Crew_Loop :
for I in Player_Ship.Crew.Iterate loop
if Player_Ship.Crew(I).Order = Rest then
RestingCrew.Append
(New_Item => Crew_Container.To_Index(I));
end if;
end loop Find_Resting_Crew_Loop;
if RestingCrew.Length > 0 then
Roll2 :=
Get_Random
(RestingCrew.First_Index, RestingCrew.Last_Index);
Injuries := Get_Random(1, 10);
if Injuries >
Player_Ship.Crew(RestingCrew(Roll2)).Health then
Injuries :=
Player_Ship.Crew(RestingCrew(Roll2)).Health;
end if;
Player_Ship.Crew(RestingCrew(Roll2)).Health :=
Player_Ship.Crew(RestingCrew(Roll2)).Health - Injuries;
AddMessage
(To_String(Player_Ship.Crew(RestingCrew(Roll2)).Name) &
" was injured in a brawl inside the base.",
OtherMessage, RED);
if Player_Ship.Crew(RestingCrew(Roll2)).Health = 0 then
Death
(RestingCrew(Roll2),
To_Unbounded_String("injuries in brawl in base"),
Player_Ship);
end if;
end if;
end;
elsif Roll > 4 and Roll < 10 then -- Lost cargo in base
Roll2 := Get_Random(1, Player_Ship.Cargo.Last_Index);
declare
LostCargo: Positive range 1 .. 10 := Get_Random(1, 10);
begin
if LostCargo > Player_Ship.Cargo(Roll2).Amount then
LostCargo := Player_Ship.Cargo(Roll2).Amount;
end if;
AddMessage
("During checking ship's cargo, you noticed that you lost" &
Positive'Image(LostCargo) & " " &
GetItemName(Player_Ship.Cargo(Roll2)) & ".",
OtherMessage, RED);
UpdateCargo
(Ship => Player_Ship, Amount => (0 - LostCargo),
CargoIndex => Roll2);
end;
end if;
end if;
end if;
return False;
end CheckForEvent;
procedure UpdateEvents(Minutes: Positive) is
CurrentIndex: Events_Container.Extended_Index := Events_List.First_Index;
NewTime: Integer;
EventsAmount: constant Natural := Natural(Events_List.Length);
PopulationLost: Positive range 1 .. 10;
BaseIndex: Bases_Range;
begin
if EventsAmount = 0 then
return;
end if;
Update_Events_Loop :
while CurrentIndex <= Events_List.Last_Index loop
NewTime := Events_List(CurrentIndex).Time - Minutes;
if NewTime < 1 then
if Events_List(CurrentIndex).EType in Disease | AttackOnBase and
Get_Random(1, 100) < 10 then
BaseIndex :=
SkyMap
(Events_List(CurrentIndex).SkyX,
Events_List(CurrentIndex).SkyY)
.BaseIndex;
PopulationLost := Get_Random(1, 10);
if PopulationLost > Sky_Bases(BaseIndex).Population then
PopulationLost := Sky_Bases(BaseIndex).Population;
Sky_Bases(BaseIndex).Reputation := (0, 0);
end if;
Sky_Bases(BaseIndex).Population :=
Sky_Bases(BaseIndex).Population - PopulationLost;
end if;
SkyMap
(Events_List(CurrentIndex).SkyX, Events_List(CurrentIndex).SkyY)
.EventIndex :=
0;
Events_List.Delete(Index => CurrentIndex);
else
Events_List(CurrentIndex).Time := NewTime;
CurrentIndex := CurrentIndex + 1;
end if;
end loop Update_Events_Loop;
if EventsAmount > Natural(Events_List.Length) then
Update_Map_Loop :
for I in Events_List.First_Index .. Events_List.Last_Index loop
SkyMap(Events_List(I).SkyX, Events_List(I).SkyY).EventIndex := I;
end loop Update_Map_Loop;
end if;
end UpdateEvents;
procedure DeleteEvent(EventIndex: Positive) is
begin
SkyMap(Events_List(EventIndex).SkyX, Events_List(EventIndex).SkyY)
.EventIndex :=
0;
Events_List.Delete(Index => EventIndex);
Delete_Events_Loop :
for I in Events_List.First_Index .. Events_List.Last_Index loop
SkyMap(Events_List(I).SkyX, Events_List(I).SkyY).EventIndex := I;
end loop Delete_Events_Loop;
end DeleteEvent;
-- ****if* Events/Events.GetPlayer_Ships
-- FUNCTION
-- Get the list of all prototypes ships which are only for the player
-- PARAMETERS
-- Player_Ships - The list with all available indexes of prototype player's
-- ships
-- RESULT
-- Parameter Player_Ships
-- SOURCE
procedure GetPlayer_Ships
(Player_Ships: in out UnboundedString_Container.Vector) is
-- ****
begin
Get_Faction_Loop :
for Faction of Factions_List loop
Get_Career_Loop :
for Career of Faction.Careers loop
Player_Ships.Append(New_Item => Career.ShipIndex);
end loop Get_Career_Loop;
end loop Get_Faction_Loop;
end GetPlayer_Ships;
procedure GenerateTraders is
Player_Ships: UnboundedString_Container.Vector;
begin
Count_Traders_Loop :
for I in Proto_Ships_List.Iterate loop
if Index(Proto_Ships_List(I).Name, To_String(Traders_Name)) > 0 then
Traders.Append(New_Item => Proto_Ships_Container.Key(I));
end if;
end loop Count_Traders_Loop;
GetPlayer_Ships(Player_Ships);
Count_Friendly_Loop :
for I in Proto_Ships_List.Iterate loop
if IsFriendly
(Player_Ship.Crew(1).Faction, Proto_Ships_List(I).Owner) and
not Player_Ships.Contains(Proto_Ships_Container.Key(I)) then
FriendlyShips.Append(New_Item => Proto_Ships_Container.Key(I));
end if;
end loop Count_Friendly_Loop;
end GenerateTraders;
procedure RecoverBase(BaseIndex: Bases_Range) is
MaxSpawnChance: Natural := 0;
FactionRoll: Positive;
begin
Count_Spawn_Chance_Loop :
for Faction of Factions_List loop
MaxSpawnChance := MaxSpawnChance + Faction.SpawnChance;
end loop Count_Spawn_Chance_Loop;
FactionRoll := Get_Random(1, MaxSpawnChance);
Choose_Faction_Loop :
for I in Factions_List.Iterate loop
if FactionRoll > Factions_List(I).SpawnChance then
FactionRoll := FactionRoll - Factions_List(I).SpawnChance;
else
Sky_Bases(BaseIndex).Owner := Factions_Container.Key(I);
Sky_Bases(BaseIndex).Reputation(1) :=
GetReputation
(Player_Ship.Crew(1).Faction, Sky_Bases(BaseIndex).Owner);
exit Choose_Faction_Loop;
end if;
end loop Choose_Faction_Loop;
Sky_Bases(BaseIndex).Population := Get_Random(2, 50);
Sky_Bases(BaseIndex).Visited := (others => 0);
Sky_Bases(BaseIndex).Recruit_Date := (others => 0);
Sky_Bases(BaseIndex).Missions_Date := (others => 0);
AddMessage
("Base " & To_String(Sky_Bases(BaseIndex).Name) & " has a new owner.",
OtherMessage, CYAN);
end RecoverBase;
procedure GenerateEnemies
(Enemies: in out UnboundedString_Container.Vector;
Owner: Unbounded_String := To_Unbounded_String("Any");
WithTraders: Boolean := True) is
PlayerValue: Natural := 0;
Player_Ships: UnboundedString_Container.Vector;
begin
PlayerValue := Count_Combat_Value;
if Get_Random(1, 100) > 98 then
PlayerValue := PlayerValue * 2;
end if;
GetPlayer_Ships(Player_Ships);
Generate_Enemies_Loop :
for I in Proto_Ships_List.Iterate loop
if Proto_Ships_List(I).Combat_Value <= PlayerValue and
(Owner = To_Unbounded_String("Any") or
Proto_Ships_List(I).Owner = Owner) and
not IsFriendly
(Player_Ship.Crew(1).Faction, Proto_Ships_List(I).Owner) and
not Player_Ships.Contains(Proto_Ships_Container.Key(I)) and
(WithTraders or
Index(Proto_Ships_List(I).Name, To_String(Traders_Name)) = 0) then
Enemies.Append(New_Item => Proto_Ships_Container.Key(I));
end if;
end loop Generate_Enemies_Loop;
end GenerateEnemies;
end Events;
| 42.644269 | 105 | 0.523821 |
04744b167a0106f5c37c618eab682b29ae6d3301 | 3,555 | ads | Ada | source/web-ui-slots-widgets-widgets.ads | godunko/adawebui | ee524325fe701ef0a655cd0624e0ba701f0e8955 | [
"BSD-3-Clause"
] | 2 | 2020-01-31T07:00:09.000Z | 2021-06-25T15:50:00.000Z | source/web-ui-slots-widgets-widgets.ads | godunko/adawebui | ee524325fe701ef0a655cd0624e0ba701f0e8955 | [
"BSD-3-Clause"
] | null | null | null | source/web-ui-slots-widgets-widgets.ads | godunko/adawebui | ee524325fe701ef0a655cd0624e0ba701f0e8955 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2018-2020, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision: 5870 $ $Date: 2018-09-22 11:46:16 +0200 (Sat, 22 Sep 2018) $
------------------------------------------------------------------------------
with Web.Core.Connectables.Slots_0.Slots_1.Slots_2;
package Web.UI.Slots.Widgets.Widgets is
new Web.UI.Slots.Widgets.Slots_2 (Web.UI.Widgets.Widget_Access);
| 72.55102 | 78 | 0.409001 |
1a057c42b945ba10fa4152330d7f99bac560a848 | 10,514 | adb | Ada | src/keystore-passwords-files.adb | thierr26/ada-keystore | 25099a9df3ce9b48a401148eb1b84442011759a0 | [
"Apache-2.0"
] | null | null | null | src/keystore-passwords-files.adb | thierr26/ada-keystore | 25099a9df3ce9b48a401148eb1b84442011759a0 | [
"Apache-2.0"
] | null | null | null | src/keystore-passwords-files.adb | thierr26/ada-keystore | 25099a9df3ce9b48a401148eb1b84442011759a0 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- keystore-passwords-files -- File 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.
-----------------------------------------------------------------------
with Interfaces.C.Strings;
with Ada.Directories;
with Ada.Streams.Stream_IO;
with Util.Systems.Types;
with Util.Systems.Os;
with Util.Log.Loggers;
with Keystore.Random;
package body Keystore.Passwords.Files is
subtype Key_Length is Util.Encoders.Key_Length;
use type Ada.Streams.Stream_Element_Offset;
-- GNAT 2019 complains about unused use type but gcc 7.4 fails if it not defined (st_mode).
pragma Warnings (Off);
use type Interfaces.C.int;
use type Interfaces.C.unsigned;
use type Interfaces.C.unsigned_short;
pragma Warnings (On);
function Verify_And_Get_Size (Path : in String) return Ada.Streams.Stream_Element_Count;
type Provider (Len : Key_Length) is limited new Keystore.Passwords.Provider with record
Password : Ada.Streams.Stream_Element_Array (1 .. Len);
end record;
type File_Provider_Access is access all Provider;
-- Get the password through the Getter operation.
overriding
procedure Get_Password (From : in Provider;
Getter : not null access procedure (Password : in Secret_Key));
type Key_Provider (Len : Key_Length) is new Provider (Len)
and Keys.Key_Provider and Internal_Key_Provider with null record;
type Key_Provider_Access is access all Key_Provider'Class;
-- Get the Key, IV and signature.
overriding
procedure Get_Keys (From : in Key_Provider;
Key : out Secret_Key;
IV : out Secret_Key;
Sign : out Secret_Key);
Log : constant Util.Log.Loggers.Logger := Util.Log.Loggers.Create ("Keystore.Passwords.Files");
overriding
procedure Save_Key (Provider : in Key_Provider;
Data : out Ada.Streams.Stream_Element_Array);
function Verify_And_Get_Size (Path : in String) return Ada.Streams.Stream_Element_Count is
P : Interfaces.C.Strings.chars_ptr;
Stat : aliased Util.Systems.Types.Stat_Type;
Res : Integer;
Result : Ada.Streams.Stream_Element_Count;
Dir : constant String := Ada.Directories.Containing_Directory (Path);
begin
-- Verify that the file is readable only by the current user.
P := Interfaces.C.Strings.New_String (Path);
Res := Util.Systems.Os.Sys_Stat (Path => P,
Stat => Stat'Access);
Interfaces.C.Strings.Free (P);
if Res /= 0 then
Log.Info ("Password file {0} does not exist", Path);
raise Keystore.Bad_Password with "Password file does not exist";
end if;
if (Stat.st_mode and 8#0077#) /= 0 and Util.Systems.Os.Directory_Separator = '/' then
Log.Info ("Password file {0} is not safe", Path);
raise Keystore.Bad_Password with "Password file is not safe";
end if;
if Stat.st_size = 0 then
Log.Info ("Password file {0} is empty", Path);
raise Keystore.Bad_Password with "Password file is empty";
end if;
if Stat.st_size > MAX_FILE_SIZE then
Log.Info ("Password file {0} is too big", Path);
raise Keystore.Bad_Password with "Password file is too big";
end if;
Result := Ada.Streams.Stream_Element_Offset (Stat.st_size);
-- Verify that the parent directory is readable only by the current user.
P := Interfaces.C.Strings.New_String (Dir);
Res := Util.Systems.Os.Sys_Stat (Path => P,
Stat => Stat'Access);
Interfaces.C.Strings.Free (P);
if Res /= 0 then
Log.Info ("Directory {0} is not safe for password file", Dir);
raise Keystore.Bad_Password
with "Directory that contains password file cannot be checked";
end if;
if (Stat.st_mode and 8#0077#) /= 0 and Util.Systems.Os.Directory_Separator = '/' then
Log.Info ("Directory {0} is not safe for password file", Dir);
raise Keystore.Bad_Password
with "Directory that contains password file is not safe";
end if;
Log.Info ("Password file {0} passes the security checks", Path);
return Result;
end Verify_And_Get_Size;
-- ------------------------------
-- Create a password provider that reads the file to build the password.
-- The file must have the mode rw------- (600) and its owning directory
-- the mode rwx------ (700). The Bad_Password exception is raised if
-- these rules are not verified.
-- ------------------------------
function Create (Path : in String) return Provider_Access is
Size : Ada.Streams.Stream_Element_Offset;
File : Ada.Streams.Stream_IO.File_Type;
Result : File_Provider_Access;
Last : Ada.Streams.Stream_Element_Offset;
begin
Size := Verify_And_Get_Size (Path);
Ada.Streams.Stream_IO.Open (File => File,
Mode => Ada.Streams.Stream_IO.In_File,
Name => Path);
Result := new Provider '(Len => Size,
others => <>);
Ada.Streams.Stream_IO.Read (File, Result.Password, Last);
Ada.Streams.Stream_IO.Close (File);
return Result.all'Access;
end Create;
-- ------------------------------
-- Get the password through the Getter operation.
-- ------------------------------
overriding
procedure Get_Password (From : in Provider;
Getter : not null access procedure (Password : in Secret_Key)) is
Password : Keystore.Secret_Key (Length => From.Len);
begin
Util.Encoders.Create (From.Password, Password);
Getter (Password);
end Get_Password;
-- ------------------------------
-- Create a key provider that reads the file. The file is split in three parts
-- the key, the IV, the signature which are extracted by using `Get_Keys`.
-- ------------------------------
function Create (Path : in String) return Keys.Key_Provider_Access is
Size : Ada.Streams.Stream_Element_Offset;
File : Ada.Streams.Stream_IO.File_Type;
Result : Key_Provider_Access;
Last : Ada.Streams.Stream_Element_Offset;
begin
Size := Verify_And_Get_Size (Path);
Ada.Streams.Stream_IO.Open (File => File,
Mode => Ada.Streams.Stream_IO.In_File,
Name => Path);
Result := new Key_Provider '(Len => Size,
others => <>);
Ada.Streams.Stream_IO.Read (File, Result.Password, Last);
Ada.Streams.Stream_IO.Close (File);
return Result.all'Access;
end Create;
-- ------------------------------
-- Get the Key, IV and signature.
-- ------------------------------
overriding
procedure Get_Keys (From : in Key_Provider;
Key : out Secret_Key;
IV : out Secret_Key;
Sign : out Secret_Key) is
First : Ada.Streams.Stream_Element_Offset := 1;
Last : Ada.Streams.Stream_Element_Offset := First + Key.Length - 1;
begin
if From.Len /= Key.Length + IV.Length + Sign.Length then
raise Keystore.Bad_Password with "Invalid length for the key file";
end if;
Util.Encoders.Create (From.Password (First .. Last), Key);
First := Last + 1;
Last := First + IV.Length - 1;
Util.Encoders.Create (From.Password (First .. Last), IV);
First := Last + 1;
Last := First + Sign.Length - 1;
Util.Encoders.Create (From.Password (First .. Last), Sign);
end Get_Keys;
overriding
procedure Save_Key (Provider : in Key_Provider;
Data : out Ada.Streams.Stream_Element_Array) is
begin
Data := Provider.Password;
end Save_Key;
-- ------------------------------
-- Generate a file that contains the keys. Keys are generated using a random generator.
-- The file is created with the mode rw------- (600) and the owning directory is forced
-- to the mode rwx------ (700).
-- ------------------------------
function Generate (Path : in String;
Length : in Key_Length := DEFAULT_KEY_FILE_LENGTH)
return Keys.Key_Provider_Access is
Result : Key_Provider_Access;
Random : Keystore.Random.Generator;
Dir : constant String := Ada.Directories.Containing_Directory (Path);
File : Ada.Streams.Stream_IO.File_Type;
P : Interfaces.C.Strings.chars_ptr;
Res : Integer with Unreferenced;
begin
if not Ada.Directories.Exists (Dir) then
Log.Info ("Creating directory {0}", Dir);
Ada.Directories.Create_Path (Dir);
end if;
Log.Info ("Creating password file {0}", Path);
Ada.Streams.Stream_IO.Create (File => File,
Mode => Ada.Streams.Stream_IO.Out_File,
Name => Path);
Result := new Key_Provider '(Len => Length,
others => <>);
Random.Generate (Result.Password);
Ada.Streams.Stream_IO.Write (File, Result.Password);
Ada.Streams.Stream_IO.Close (File);
P := Interfaces.C.Strings.New_String (Path);
Res := Util.Systems.Os.Sys_Chmod (Path => P,
Mode => 8#0600#);
Interfaces.C.Strings.Free (P);
P := Interfaces.C.Strings.New_String (Dir);
Res := Util.Systems.Os.Sys_Chmod (Path => P,
Mode => 8#0700#);
Interfaces.C.Strings.Free (P);
return Result.all'Access;
end Generate;
end Keystore.Passwords.Files;
| 41.722222 | 98 | 0.594826 |
8b928479b47686bc4fbee471c755882d1abb0dcb | 3,527 | ads | Ada | llvm-gcc-4.2-2.9/gcc/ada/s-asthan.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-asthan.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/s-asthan.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . A S T _ H A N D L I N G --
-- --
-- S p e c --
-- --
-- Copyright (C) 1996-2006, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Runtime support for Handling of AST's (Used on VMS implementations only)
with Ada.Task_Identification;
with System;
with System.Aux_DEC;
package System.AST_Handling is
function Create_AST_Handler
(Taskid : Ada.Task_Identification.Task_Id;
Entryno : Natural) return System.Aux_DEC.AST_Handler;
-- This function implements the appropriate semantics for a use of the
-- AST_Entry pragma. See body for details of implementation approach.
-- The parameters are the Task_Id for the task containing the entry
-- and the entry Index for the specified entry.
procedure Expand_AST_Packet_Pool
(Requested_Packets : Natural;
Actual_Number : out Natural;
Total_Number : out Natural);
-- This function takes a request for zero or more extra AST packets and
-- returns the number actually added to the pool and the total number
-- now available or in use.
-- This function is not yet fully implemented.
end System.AST_Handling;
| 58.783333 | 78 | 0.501843 |
19cf2c905ac7258a56165a98791894a0663da9ac | 1,339 | adb | Ada | regtests/openapi-testsuite.adb | mgrojo/swagger-ada | ba592a8c9cd76304bef8f1d48738069b8c73b4a6 | [
"Apache-2.0"
] | null | null | null | regtests/openapi-testsuite.adb | mgrojo/swagger-ada | ba592a8c9cd76304bef8f1d48738069b8c73b4a6 | [
"Apache-2.0"
] | null | null | null | regtests/openapi-testsuite.adb | mgrojo/swagger-ada | ba592a8c9cd76304bef8f1d48738069b8c73b4a6 | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- openapi-testsuite - Swagger Test suite
-- Copyright (C) 2017, 2018, 2022 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 OpenAPI.Clients.Tests;
with OpenAPI.Tests;
package body OpenAPI.Testsuite is
Tests : aliased Util.Tests.Test_Suite;
function Suite return Util.Tests.Access_Test_Suite is
Ret : constant Util.Tests.Access_Test_Suite := Tests'Access;
begin
OpenAPI.Clients.Tests.Add_Tests (Ret);
if Util.Tests.Get_Parameter ("testapi.url") /= "" then
OpenAPI.Tests.Add_Tests (Ret);
end if;
return Ret;
end Suite;
end OpenAPI.Testsuite;
| 38.257143 | 76 | 0.643764 |
133e5b3ce4c1633cf5326724de092b2922b83a87 | 3,732 | ads | Ada | tools/scitools/conf/understand/ada/ada12/s-pooloc.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | 1 | 2020-01-20T21:26:46.000Z | 2020-01-20T21:26:46.000Z | tools/scitools/conf/understand/ada/ada12/s-pooloc.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada12/s-pooloc.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | 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-2011, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Storage pool for use with local objects with automatic reclaim
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;
| 49.76 | 78 | 0.435959 |
0465455a373e13d82680dc259ed9100266767cf0 | 4,084 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-wtdeau.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-wtdeau.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-wtdeau.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . W I D E _ T E X T _ I O . D E C I M A L _ A U X --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains the routines for Ada.Wide_Text_IO.Decimal_IO
-- that are shared among separate instantiations of this package. The
-- routines in the package are identical semantically to those declared
-- in Wide_Text_IO, except that default values have been supplied by the
-- generic, and the Num parameter has been replaced by Integer or
-- Long_Long_Integer, with an additional Scale parameter giving the
-- value of Num'Scale. In addition the Get routines return the value
-- rather than store it in an Out parameter.
private package Ada.Wide_Text_IO.Decimal_Aux is
function Get_Dec
(File : File_Type;
Width : Field;
Scale : Integer) return Integer;
function Get_LLD
(File : File_Type;
Width : Field;
Scale : Integer) return Long_Long_Integer;
function Gets_Dec
(From : String;
Last : not null access Positive;
Scale : Integer) return Integer;
function Gets_LLD
(From : String;
Last : not null access Positive;
Scale : Integer) return Long_Long_Integer;
procedure Put_Dec
(File : File_Type;
Item : Integer;
Fore : Field;
Aft : Field;
Exp : Field;
Scale : Integer);
procedure Put_LLD
(File : File_Type;
Item : Long_Long_Integer;
Fore : Field;
Aft : Field;
Exp : Field;
Scale : Integer);
procedure Puts_Dec
(To : out String;
Item : Integer;
Aft : Field;
Exp : Field;
Scale : Integer);
procedure Puts_LLD
(To : out String;
Item : Long_Long_Integer;
Aft : Field;
Exp : Field;
Scale : Integer);
end Ada.Wide_Text_IO.Decimal_Aux;
| 43.446809 | 78 | 0.484329 |
2e9a2833501f0fdfb7801a36cfb2978561b6d081 | 22,805 | adb | Ada | Klient/graphics_tests_old_do_not_use/klient_assets_package.adb | albinjal/Ada_Project | 0ec2d8f8f6cda8b31652a4256bafdb1e833c48b3 | [
"MIT"
] | 4 | 2019-04-08T12:31:35.000Z | 2021-01-21T11:12:35.000Z | Klient/graphics_tests_old_do_not_use/klient_assets_package.adb | albinjal/Ada_Project | 0ec2d8f8f6cda8b31652a4256bafdb1e833c48b3 | [
"MIT"
] | null | null | null | Klient/graphics_tests_old_do_not_use/klient_assets_package.adb | albinjal/Ada_Project | 0ec2d8f8f6cda8b31652a4256bafdb1e833c48b3 | [
"MIT"
] | null | null | null | with TJa.Sockets; use TJa.Sockets;
with Ada.Exceptions; use Ada.Exceptions;
with Ada.Text_IO; use Ada.Text_IO;
with Ada.Integer_Text_IO; use Ada.Integer_Text_IO;
with Yatzy_graphics_package; use Yatzy_graphics_package;
with TJa.Window.Text; use TJa.Window.Text;
with TJa.Window.Elementary; use TJa.Window.Elementary;
with TJa.Window.Graphic; use TJa.Window.Graphic;
with TJa.Keyboard; use TJa.Keyboard;
package body Klient_Assets_Package is
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
procedure Fill_Protocoll_Empty(Proto: in out Protocoll_Type) is
begin
Proto(1) := 12;
Proto(2) := -1;
Proto(3) := -1;
Proto(4) := -1;
Proto(5) := -1;
Proto(6) := -1;
Proto(7) := -1;
Proto(8) := -1;
Proto(9) := -1;
Proto(10) := -1;
Proto(11) := -1;
Proto(12) := -1;
Proto(13) := -1;
Proto(14) := -1;
Proto(15) := -1;
end Fill_Protocoll_Empty;
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
procedure Bootup(Socket: out Socket_Type; Adress: in String; Port: in Positive) is
begin
Initiate(Socket);
Connect(Socket, Adress, Port);
Put("Ansluten till servern");
New_Line;
end Bootup;
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
procedure graphics is
begin
Clear_Window;
Set_Graphical_Mode(On);
background;
protocoll_background(125, 4);
logo_background(24, 4);
logo(24, 4);
end graphics;
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
procedure Start_Game(Socket: in Socket_Type; Player: out Positive; Prot1, Prot2: out Protocoll_Type) is
TX : String(1..100);
TL : Natural;
begin -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
for I in 1..15 loop
Prot1(I) := -1;
end loop;
Prot2 := Prot1;
Get_Line(Socket, TX, TL);
if TX(1) = '1' then
message(33, 18, "Du är spelare 1, väntar på spelare 2");
Player := 1;
Get_Line(Socket, TX, TL);
New_Line;
if TX(1) = '3' then
message(33, 18, "Båda spelare anslutna");
end if;
elsif TX(1) = '2' then
message(33, 18, "Du är spelare 2");
Player := 2;
else
raise DATATYPE_ERROR;
end if;
New_Line;
message(33, 18, "Nu startar spelet");
New_Line;
end Start_Game;
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
function Read(C: in Character)
return Natural is
S: String(1..1);
begin
S(1) := C;
return Integer'Value(S);
end Read;
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
procedure Get_Rolls(Socket: in Socket_Type; Roll: out Rolls_Type) is
TX: String(1..100);
TL: Natural;
begin
Get_Line(Socket, TX, TL);
New_Line;
if TX(1) = '4' then -- 4 betyder inkomande tärningar
Roll.I := Read(TX(2));
for X in 1..Roll.I loop -- A betyder här antalet tärningar
Roll.Rolls(X) := Read(TX(X+2));
end loop;
elsif TX(1) = '5' then -- 5 betyder info om gamestate
if TX(2) = '0' then -- Annan spelare slår
Roll.I := 6;
elsif TX(2) = '1' then -- Annan spelare har slagit
Roll.I := 7;
for X in 1..5 loop
Roll.Rolls(X) := Read(TX(X+2));
end loop;
elsif TX(2) = '2' then -- Annan spelare vill placera
Roll.I := 8;
for X in 1..5 loop
Roll.Rolls(X) := Read(TX(X+2));
end loop;
end if;
else
raise DATATYPE_ERROR;
end if;
end Get_Rolls;
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
function GetI(Roll: in Rolls_Type)
return Integer is
begin
return Roll.I;
end GetI;
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
function GetR(Roll: in Rolls_Type)
return Arr is
begin
return Roll.Rolls;
end GetR;
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
procedure Playerroll(Socket: in Socket_Type) is
begin
Put_Line(Socket, "51");
end Playerroll;
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
procedure Sort(Arrayen_Med_Talen: in out Arr) is
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
procedure Swap(Tal_1,Tal_2: in out Integer) is
Tal_B : Integer; -- Temporary buffer
begin
Tal_B := Tal_1;
Tal_1 := Tal_2;
Tal_2 := Tal_B;
end Swap;
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
Minsta_Talet, Minsta_Talet_Index : Integer;
begin
Minsta_Talet := 0;
for IOuter in Arrayen_Med_Talen'Range loop
for I in IOuter..Arrayen_Med_Talen'Last loop
if I = IOuter or Arrayen_Med_Talen(I) > Minsta_Talet then
Minsta_Talet := Arrayen_Med_Talen(I);
Minsta_Talet_Index := I;
end if;
end loop;
Swap(Arrayen_Med_Talen(IOuter), Arrayen_Med_Talen(Minsta_Talet_Index));
end loop;
end Sort;
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- --
function Calcpoints(Prot: Protocoll_Type; Rolls: Arr) -- -- --
return Protocoll_Type is -- -- --
-- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
function Ental(I: Integer; Rolls: Arr) -- -- --
return Integer is -- -- --
-- -- --
C : Integer := 0; -- -- --
begin -- -- --
for X in 1..5 loop -- -- --
if Rolls(X) = I then -- -- --
C := C + I; -- -- --
end if; -- -- --
end loop; -- -- --
return C; -- -- --
end Ental; -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
function FourPair(Rolls: Arr) -- -- --
return Integer is -- -- --
-- -- --
begin -- -- --
for I in 1..2 loop -- -- --
if Rolls(I) = Rolls(I+1) and Rolls(I) = Rolls(I+2) and Rolls(I) = Rolls(I+3) then -- -- --
return 4 * Rolls(I); -- -- --
end if; -- -- --
end loop; -- -- --
-- -- --
return 0; -- -- --
end FourPair; -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
function Pair(Rolls: Arr) -- -- --
return Integer is -- -- --
begin -- -- --
for I in 1..4 loop
if Rolls(I) = Rolls(I+1) then
return 2 * Rolls(I);
end if;
end loop;
return 0;
end;
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
function TwoPair(Rolls: Arr)
return Integer is
begin
if FourPair(Rolls) /= 0 then
return 0;
end if;
for I in 1..2 loop
if Rolls(I) = Rolls(I+1) then
for X in (I+2)..4 loop
if Rolls(X) = Rolls(X+1) then
return 2 * ( Rolls(I) + Rolls(X) );
end if;
end loop;
return 0;
end if;
end loop;
return 0;
end;
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
function Triss(Rolls: Arr)
return Integer is
begin
for I in 1..3 loop
if Rolls(I) = Rolls(I+1) and Rolls(I) = Rolls(I+2) then
return 3 * Rolls(I);
end if;
end loop;
return 0;
end;
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
function Stege(I: Integer; Rolls: Arr)
return Integer is
begin
case I is
when 11 =>
--Liten
for X in 1..5 loop
if Rolls(6-X) /= X then
return 0;
end if;
end loop;
return 15;
when 12 =>
--Stor
for X in 2..6 loop
if Rolls(7-X) /= X then
return 0;
end if;
end loop;
return 20;
when others =>
null;
return 0;
end case;
end;
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
function Chans(Rolls: Arr)
return Integer is
X : Integer := 0;
begin
for I in 1..5 loop
X := X + Rolls(I);
end loop;
return X;
end;
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
function Kaok(Rolls: Arr)
return Integer is
begin
for X in 1..2 loop
exit when Rolls(X) /= Rolls(X+1);
if X = 2 then
if Rolls(4) = Rolls(5) and Rolls(5) /= Rolls(1) then
return Chans(Rolls);
else
return 0;
end if;
end if;
end loop;
if Rolls(1) = Rolls(2) then
if Rolls(3) = Rolls(4) and Rolls(3) = Rolls(5) then
return Chans(Rolls);
end if;
end if;
return 0;
end;
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
function Yatzy(Rolls: Arr)
return Integer is
begin
for X in 1..4 loop
if Rolls(X) /= Rolls(X+1) then
return 0;
end if;
end loop;
return 50;
end;
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
TRolls: Arr := Rolls;
Result: Protocoll_Type;
begin
Sort(TRolls);
for I in 1..15 loop
if Prot(I) /= -1 then
Result(I) := -1;
else
case I is
when 1..6 =>
Result(I) := Ental(I, TRolls);
when 7 =>
Result(I) := Pair(TRolls);
when 8 =>
Result(I) := TwoPair(TRolls);
when 9 =>
Result(I) := Triss(Trolls);
when 10 =>
Result(I) := FourPair(Trolls);
when 11..12 =>
Result(I) := Stege(I, Trolls);
when 13 =>
Result(I) := Kaok(Trolls);
when 14 =>
Result(I) := Chans(Trolls);
when 15 =>
Result(I) := Yatzy(Trolls);
when others =>
Result(I) := 0;
end case;
end if;
end loop;
return Result;
end;
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
function Roll_loop(Socket: Socket_Type; Player: Positive)
return Rolls_Type is
type Rerolls is array(1..5) of Integer;
B: Integer;
Continue, Switches: Integer;
Reroll: Rerolls;
Result : Arr;
Roll: Rolls_Type;
Key : Key_Type;
temp_resp_int: Integer;
--C0 : Character := 0;
--C1 : Character := 1;
begin -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
Get_Rolls(Socket, Roll);
-- Slår Jag?
if GetI(Roll) > 5 then -- Jag slår inte - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
loop
if GetI(Roll) = 6 then
message(33, 18, "Spelare " & Integer'Image(3-Player) & " slår");
elsif GetI(Roll) = 7 then
message(33, 18, "Spelare " & Integer'Image(3-Player) & " har slagit:");
Result := GetR(Roll);
dice_placement(Roll.Rolls(1), Roll.Rolls(2), Roll.Rolls(3), Roll.Rolls(4), Roll.Rolls(5));
end if;
Get_Rolls(Socket, Roll);
exit when Roll.I = 8;
end loop;
else -- Jag slår - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
for I in 1..5 loop
Reroll(I) := 0;
end loop;
message(33, 18, "Din tur");
for I in 1..3 loop -- Man kan slå max 3 gånger totalt per omgång
Result := GetR(Roll);
message(33, 18, "Tryck enter för att slå...");
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
Set_Buffer_Mode(Off);
Set_Echo_Mode(Off);
loop -- Infinite loop waiting for return key
Get_Immediate(Key);
if Is_Return(Key) then
exit;
end if;
end loop;
Set_Echo_Mode(On);
Set_Buffer_Mode(On);
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
message(33, 18, "Wow, du fick:");
dice_placement(Roll.Rolls(1), Roll.Rolls(2), Roll.Rolls(3), Roll.Rolls(4), Roll.Rolls(5));
-- If third time, exit loop and do not allow user to roll again
exit when I = 3;
message(33, 18, "Tryck 1 för att slå igen och 0 för att placera: ");
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
Set_Buffer_Mode(Off);
Set_Echo_Mode(Off);
loop -- Infinite loop waiting for either 1 or 0
Get_Immediate(Key);
if To_String(Key) = "0" then
temp_resp_int := 0;
exit;
elsif To_String(Key) = "1" then
temp_resp_int := 1;
exit;
end if;
end loop;
Set_Echo_Mode(On);
Set_Buffer_Mode(On);
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
if temp_resp_int = 0 then
exit; -- exit loop, move to placement
elsif temp_resp_int = 1 then
message(33, 18, "Välj hur många tätningar du vill slå om: ");
Get(Switches);
for A in 1..Switches loop
message(33, 18, "Välj en tärning att slå om: ");
Get(B);
Reroll(B) := 1;
end loop;
Put(Socket,'6'); Put(Socket,Switches,0);
for A in 1..5 loop
Put(Socket,Reroll(A),0);
end loop;
New_Line(Socket);
Get_Rolls(Socket, Roll);
end if;
end loop;
Put_Line(Socket, "7");
end if;
return Roll;
end Roll_loop;
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
procedure Watch_Placement(Socket: Socket_Type; Dices: Rolls_Type; Protocoll: Protocoll_Type) is
begin
message(33, 18, "Annan spelare ska placera");
Skip_Line;
end Watch_Placement;
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
-- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -- --
procedure Place(Socket: Socket_Type; Dices: Rolls_Type; Protocoll: Protocoll_Type) is
selected_index: Integer;
begin
message(33, 18, "Du ska placera");
New_Line; New_Line; Put("-FFS " & Integer'Image(GetR(Dices)(1)) & "+" & Integer'Image(GetR(Dices)(2)) & "+" & Integer'Image(GetR(Dices)(3)) & "+" & Integer'Image(GetR(Dices)(4)) & "+" & Integer'Image(GetR(Dices)(5)) & " FFS-");
place_graphics( Calcpoints(Protocoll, GetR(Dices)), selected_index );
end Place;
-----------------------------------------------------------------------------------------------------------------------------------------------------------------
-----------------------------------------------------------------------------------------------------------------------------------------------------------------
-----------------------------------------------------------------------------------------------------------------------------------------------------------------
end Klient_Assets_Package; | 40.291519 | 228 | 0.276211 |
5e0631f4139ad4f0c1ed1ef083644ed4598d8ad5 | 4,071 | adb | Ada | ordered_maps_g.adb | cborao/Ada-P4-chat | 233f350bb99671d62e940911643d3904540a9dd3 | [
"MIT"
] | null | null | null | ordered_maps_g.adb | cborao/Ada-P4-chat | 233f350bb99671d62e940911643d3904540a9dd3 | [
"MIT"
] | null | null | null | ordered_maps_g.adb | cborao/Ada-P4-chat | 233f350bb99671d62e940911643d3904540a9dd3 | [
"MIT"
] | null | null | null |
--PRÁCTICA 4: CÉSAR BORAO MORATINOS (Ordered_Maps_G.adb)
package body Ordered_Maps_G is
function Binary_Search (M: Map; Key: Key_Type;
Left: Integer; Right: Integer) return Integer is
Middle: Integer;
begin
if Right < Left then
return Left;
else
Middle := (Left + Right)/2;
if Left = Right then
return Left;
elsif M.P_Array(Middle).Key < Key then
return Binary_Search (M,Key,Middle + 1,Right);
elsif Key < M.P_Array(Middle).Key then
return Binary_Search (M,Key,Left,Middle);
else
return Middle;
end if;
end if;
end Binary_Search;
procedure Put (M: in out Map;
Key: Key_Type;
Value: Value_Type) is
Position: Integer := 0;
Left: Integer := 0;
begin
if M.P_Array = null or M.Length = 0 then
M.P_Array := new Cell_Array;
M.P_Array(0) := (Key, Value, True);
M.Length := 1;
else
Position := Binary_Search (M,Key,Left,M.Length);
if Position > Max - 1 then
raise Full_Map;
end if;
if M.P_Array(Position).Full and M.P_Array(Position).Key = Key then
M.P_Array(Position).Value := Value;
elsif M.P_Array(Position).Full then
for I in reverse Position..M.Length-1 loop
if M.Length = Max then
raise Full_Map;
end if;
M.P_Array(I + 1) := M.P_Array(I);
end loop;
M.Length := M.Length + 1;
M.P_Array(Position) := (Key, Value, True);
else
M.P_Array(Position) := (Key, Value, True);
M.Length := M.Length + 1;
end if;
end if;
end Put;
procedure Get (M: Map;
Key: in Key_Type;
Value: out Value_Type;
Success: out Boolean) is
Left: Integer := 0;
Right: Integer := Max-1;
Position: Integer := 0;
begin
Success := False;
if M.P_Array /= null then
Position := Binary_Search (M,Key,Left,Right);
if Position <= Max - 1 then
if M.P_Array(0).Key = Key then
Success := True;
Value := M.P_Array(Binary_Search (M,Key,Left,Right)).Value;
end if;
end if;
end if;
end Get;
procedure Delete (M: in out Map;
Key: in Key_Type;
Success: out Boolean) is
Left: Integer := 0;
Right: Integer := M.Length;
Position: Integer;
begin
Success := False;
Position := Binary_Search (M,Key,Left,Right);
if Position <= Max - 1 then
if M.P_Array(Position).Key = Key then
Success := True;
M.Length := M.Length - 1;
for I in Position..M.Length - 1 loop
M.P_Array(I) := M.P_Array(I + 1);
end loop;
end if;
end if;
end Delete;
function Map_Length (M: Map) return Natural is
begin
return M.Length;
end Map_Length;
function First (M: Map) return Cursor is
C: Cursor;
begin
C.M := M;
C.Position := 0;
return C;
end First;
procedure Next (C: in out Cursor) is
End_Of_Map: Boolean;
begin
End_Of_Map := False;
if C.Position <= Max then
C.Position := C.Position + 1;
end if;
end Next;
function Has_Element (C: Cursor) return Boolean is
begin
if C.Position >= C.M.Length then
return False;
end if;
return C.M.P_Array(C.Position).Full;
end Has_Element;
function Element (C: Cursor) return Element_Type is
Element: Element_Type;
begin
if Has_Element (C) then
Element.Key := C.M.P_Array(C.Position).Key;
Element.Value := C.M.P_Array(C.Position).Value;
else
raise No_Element;
end if;
return Element;
end Element;
end Ordered_Maps_G;
| 24.97546 | 78 | 0.52223 |
1e737e2114f33576889078c22b2e5a233e043873 | 29,263 | ads | Ada | obj/b__blancaneus.ads | lumalisan/EspeblancaYLos7PPs | 110a5c7e5a94e19a993636025557c7ebc8d73478 | [
"Apache-2.0"
] | null | null | null | obj/b__blancaneus.ads | lumalisan/EspeblancaYLos7PPs | 110a5c7e5a94e19a993636025557c7ebc8d73478 | [
"Apache-2.0"
] | null | null | null | obj/b__blancaneus.ads | lumalisan/EspeblancaYLos7PPs | 110a5c7e5a94e19a993636025557c7ebc8d73478 | [
"Apache-2.0"
] | null | null | null | pragma Warnings (Off);
pragma Ada_95;
with System;
with System.Parameters;
with System.Secondary_Stack;
package ada_main is
gnat_argc : Integer;
gnat_argv : System.Address;
gnat_envp : System.Address;
pragma Import (C, gnat_argc);
pragma Import (C, gnat_argv);
pragma Import (C, gnat_envp);
gnat_exit_status : Integer;
pragma Import (C, gnat_exit_status);
GNAT_Version : constant String :=
"GNAT Version: Community 2018 (20180523-73)" & ASCII.NUL;
pragma Export (C, GNAT_Version, "__gnat_version");
Ada_Main_Program_Name : constant String := "_ada_blancaneus" & ASCII.NUL;
pragma Export (C, Ada_Main_Program_Name, "__gnat_ada_main_program_name");
procedure adainit;
pragma Export (C, adainit, "adainit");
procedure adafinal;
pragma Export (C, adafinal, "adafinal");
function main
(argc : Integer;
argv : System.Address;
envp : System.Address)
return Integer;
pragma Export (C, main, "main");
type Version_32 is mod 2 ** 32;
u00001 : constant Version_32 := 16#cadb312f#;
pragma Export (C, u00001, "blancaneusB");
u00002 : constant Version_32 := 16#050ff2f0#;
pragma Export (C, u00002, "system__standard_libraryB");
u00003 : constant Version_32 := 16#35869f17#;
pragma Export (C, u00003, "system__standard_libraryS");
u00004 : constant Version_32 := 16#76789da1#;
pragma Export (C, u00004, "adaS");
u00005 : constant Version_32 := 16#357666d8#;
pragma Export (C, u00005, "ada__calendar__delaysB");
u00006 : constant Version_32 := 16#a808adf5#;
pragma Export (C, u00006, "ada__calendar__delaysS");
u00007 : constant Version_32 := 16#b8719323#;
pragma Export (C, u00007, "ada__calendarB");
u00008 : constant Version_32 := 16#41508869#;
pragma Export (C, u00008, "ada__calendarS");
u00009 : constant Version_32 := 16#b11c5006#;
pragma Export (C, u00009, "ada__exceptionsB");
u00010 : constant Version_32 := 16#2ccb9557#;
pragma Export (C, u00010, "ada__exceptionsS");
u00011 : constant Version_32 := 16#5726abed#;
pragma Export (C, u00011, "ada__exceptions__last_chance_handlerB");
u00012 : constant Version_32 := 16#41e5552e#;
pragma Export (C, u00012, "ada__exceptions__last_chance_handlerS");
u00013 : constant Version_32 := 16#32a08138#;
pragma Export (C, u00013, "systemS");
u00014 : constant Version_32 := 16#ae860117#;
pragma Export (C, u00014, "system__soft_linksB");
u00015 : constant Version_32 := 16#77a38a8e#;
pragma Export (C, u00015, "system__soft_linksS");
u00016 : constant Version_32 := 16#87be2c0f#;
pragma Export (C, u00016, "system__secondary_stackB");
u00017 : constant Version_32 := 16#77347921#;
pragma Export (C, u00017, "system__secondary_stackS");
u00018 : constant Version_32 := 16#86dbf443#;
pragma Export (C, u00018, "system__parametersB");
u00019 : constant Version_32 := 16#7a4cd513#;
pragma Export (C, u00019, "system__parametersS");
u00020 : constant Version_32 := 16#ced09590#;
pragma Export (C, u00020, "system__storage_elementsB");
u00021 : constant Version_32 := 16#1f63cb3c#;
pragma Export (C, u00021, "system__storage_elementsS");
u00022 : constant Version_32 := 16#75bf515c#;
pragma Export (C, u00022, "system__soft_links__initializeB");
u00023 : constant Version_32 := 16#5697fc2b#;
pragma Export (C, u00023, "system__soft_links__initializeS");
u00024 : constant Version_32 := 16#41837d1e#;
pragma Export (C, u00024, "system__stack_checkingB");
u00025 : constant Version_32 := 16#bc1fead0#;
pragma Export (C, u00025, "system__stack_checkingS");
u00026 : constant Version_32 := 16#34742901#;
pragma Export (C, u00026, "system__exception_tableB");
u00027 : constant Version_32 := 16#6f0ee87a#;
pragma Export (C, u00027, "system__exception_tableS");
u00028 : constant Version_32 := 16#ce4af020#;
pragma Export (C, u00028, "system__exceptionsB");
u00029 : constant Version_32 := 16#5ac3ecce#;
pragma Export (C, u00029, "system__exceptionsS");
u00030 : constant Version_32 := 16#80916427#;
pragma Export (C, u00030, "system__exceptions__machineB");
u00031 : constant Version_32 := 16#3bad9081#;
pragma Export (C, u00031, "system__exceptions__machineS");
u00032 : constant Version_32 := 16#aa0563fc#;
pragma Export (C, u00032, "system__exceptions_debugB");
u00033 : constant Version_32 := 16#4c2a78fc#;
pragma Export (C, u00033, "system__exceptions_debugS");
u00034 : constant Version_32 := 16#6c2f8802#;
pragma Export (C, u00034, "system__img_intB");
u00035 : constant Version_32 := 16#307b61fa#;
pragma Export (C, u00035, "system__img_intS");
u00036 : constant Version_32 := 16#39df8c17#;
pragma Export (C, u00036, "system__tracebackB");
u00037 : constant Version_32 := 16#6c825ffc#;
pragma Export (C, u00037, "system__tracebackS");
u00038 : constant Version_32 := 16#9ed49525#;
pragma Export (C, u00038, "system__traceback_entriesB");
u00039 : constant Version_32 := 16#32fb7748#;
pragma Export (C, u00039, "system__traceback_entriesS");
u00040 : constant Version_32 := 16#9ad5ad12#;
pragma Export (C, u00040, "system__traceback__symbolicB");
u00041 : constant Version_32 := 16#c84061d1#;
pragma Export (C, u00041, "system__traceback__symbolicS");
u00042 : constant Version_32 := 16#179d7d28#;
pragma Export (C, u00042, "ada__containersS");
u00043 : constant Version_32 := 16#701f9d88#;
pragma Export (C, u00043, "ada__exceptions__tracebackB");
u00044 : constant Version_32 := 16#20245e75#;
pragma Export (C, u00044, "ada__exceptions__tracebackS");
u00045 : constant Version_32 := 16#e865e681#;
pragma Export (C, u00045, "system__bounded_stringsB");
u00046 : constant Version_32 := 16#455da021#;
pragma Export (C, u00046, "system__bounded_stringsS");
u00047 : constant Version_32 := 16#74f70e62#;
pragma Export (C, u00047, "system__crtlS");
u00048 : constant Version_32 := 16#d5de7583#;
pragma Export (C, u00048, "system__dwarf_linesB");
u00049 : constant Version_32 := 16#f4013fc9#;
pragma Export (C, u00049, "system__dwarf_linesS");
u00050 : constant Version_32 := 16#5b4659fa#;
pragma Export (C, u00050, "ada__charactersS");
u00051 : constant Version_32 := 16#8f637df8#;
pragma Export (C, u00051, "ada__characters__handlingB");
u00052 : constant Version_32 := 16#3b3f6154#;
pragma Export (C, u00052, "ada__characters__handlingS");
u00053 : constant Version_32 := 16#4b7bb96a#;
pragma Export (C, u00053, "ada__characters__latin_1S");
u00054 : constant Version_32 := 16#e6d4fa36#;
pragma Export (C, u00054, "ada__stringsS");
u00055 : constant Version_32 := 16#96df1a3f#;
pragma Export (C, u00055, "ada__strings__mapsB");
u00056 : constant Version_32 := 16#1e526bec#;
pragma Export (C, u00056, "ada__strings__mapsS");
u00057 : constant Version_32 := 16#a21ad5cd#;
pragma Export (C, u00057, "system__bit_opsB");
u00058 : constant Version_32 := 16#0765e3a3#;
pragma Export (C, u00058, "system__bit_opsS");
u00059 : constant Version_32 := 16#0626fdbb#;
pragma Export (C, u00059, "system__unsigned_typesS");
u00060 : constant Version_32 := 16#92f05f13#;
pragma Export (C, u00060, "ada__strings__maps__constantsS");
u00061 : constant Version_32 := 16#5ab55268#;
pragma Export (C, u00061, "interfacesS");
u00062 : constant Version_32 := 16#a0d3d22b#;
pragma Export (C, u00062, "system__address_imageB");
u00063 : constant Version_32 := 16#934c1c02#;
pragma Export (C, u00063, "system__address_imageS");
u00064 : constant Version_32 := 16#ec78c2bf#;
pragma Export (C, u00064, "system__img_unsB");
u00065 : constant Version_32 := 16#99d2c14c#;
pragma Export (C, u00065, "system__img_unsS");
u00066 : constant Version_32 := 16#d7aac20c#;
pragma Export (C, u00066, "system__ioB");
u00067 : constant Version_32 := 16#ace27677#;
pragma Export (C, u00067, "system__ioS");
u00068 : constant Version_32 := 16#3080f2ca#;
pragma Export (C, u00068, "system__mmapB");
u00069 : constant Version_32 := 16#08d13e5f#;
pragma Export (C, u00069, "system__mmapS");
u00070 : constant Version_32 := 16#92d882c5#;
pragma Export (C, u00070, "ada__io_exceptionsS");
u00071 : constant Version_32 := 16#a82e20f9#;
pragma Export (C, u00071, "system__mmap__os_interfaceB");
u00072 : constant Version_32 := 16#8f4541b8#;
pragma Export (C, u00072, "system__mmap__os_interfaceS");
u00073 : constant Version_32 := 16#35737c3a#;
pragma Export (C, u00073, "system__os_libB");
u00074 : constant Version_32 := 16#d8e681fb#;
pragma Export (C, u00074, "system__os_libS");
u00075 : constant Version_32 := 16#ec4d5631#;
pragma Export (C, u00075, "system__case_utilB");
u00076 : constant Version_32 := 16#0d75376c#;
pragma Export (C, u00076, "system__case_utilS");
u00077 : constant Version_32 := 16#2a8e89ad#;
pragma Export (C, u00077, "system__stringsB");
u00078 : constant Version_32 := 16#52b6adad#;
pragma Export (C, u00078, "system__stringsS");
u00079 : constant Version_32 := 16#769e25e6#;
pragma Export (C, u00079, "interfaces__cB");
u00080 : constant Version_32 := 16#467817d8#;
pragma Export (C, u00080, "interfaces__cS");
u00081 : constant Version_32 := 16#40d3d043#;
pragma Export (C, u00081, "system__object_readerB");
u00082 : constant Version_32 := 16#ec38df4d#;
pragma Export (C, u00082, "system__object_readerS");
u00083 : constant Version_32 := 16#1a74a354#;
pragma Export (C, u00083, "system__val_lliB");
u00084 : constant Version_32 := 16#a8846798#;
pragma Export (C, u00084, "system__val_lliS");
u00085 : constant Version_32 := 16#afdbf393#;
pragma Export (C, u00085, "system__val_lluB");
u00086 : constant Version_32 := 16#7cd4aac9#;
pragma Export (C, u00086, "system__val_lluS");
u00087 : constant Version_32 := 16#269742a9#;
pragma Export (C, u00087, "system__val_utilB");
u00088 : constant Version_32 := 16#9e0037c6#;
pragma Export (C, u00088, "system__val_utilS");
u00089 : constant Version_32 := 16#d7bf3f29#;
pragma Export (C, u00089, "system__exception_tracesB");
u00090 : constant Version_32 := 16#167fa1a2#;
pragma Export (C, u00090, "system__exception_tracesS");
u00091 : constant Version_32 := 16#d178f226#;
pragma Export (C, u00091, "system__win32S");
u00092 : constant Version_32 := 16#8c33a517#;
pragma Export (C, u00092, "system__wch_conB");
u00093 : constant Version_32 := 16#29dda3ea#;
pragma Export (C, u00093, "system__wch_conS");
u00094 : constant Version_32 := 16#9721e840#;
pragma Export (C, u00094, "system__wch_stwB");
u00095 : constant Version_32 := 16#04cc8feb#;
pragma Export (C, u00095, "system__wch_stwS");
u00096 : constant Version_32 := 16#a831679c#;
pragma Export (C, u00096, "system__wch_cnvB");
u00097 : constant Version_32 := 16#266a1919#;
pragma Export (C, u00097, "system__wch_cnvS");
u00098 : constant Version_32 := 16#ece6fdb6#;
pragma Export (C, u00098, "system__wch_jisB");
u00099 : constant Version_32 := 16#a61a0038#;
pragma Export (C, u00099, "system__wch_jisS");
u00100 : constant Version_32 := 16#24ec69e6#;
pragma Export (C, u00100, "system__os_primitivesB");
u00101 : constant Version_32 := 16#355de4ce#;
pragma Export (C, u00101, "system__os_primitivesS");
u00102 : constant Version_32 := 16#05c60a38#;
pragma Export (C, u00102, "system__task_lockB");
u00103 : constant Version_32 := 16#532ab656#;
pragma Export (C, u00103, "system__task_lockS");
u00104 : constant Version_32 := 16#1a9147da#;
pragma Export (C, u00104, "system__win32__extS");
u00105 : constant Version_32 := 16#c04d61ca#;
pragma Export (C, u00105, "ada__real_timeB");
u00106 : constant Version_32 := 16#69ea8064#;
pragma Export (C, u00106, "ada__real_timeS");
u00107 : constant Version_32 := 16#a568828d#;
pragma Export (C, u00107, "system__taskingB");
u00108 : constant Version_32 := 16#d2a71b20#;
pragma Export (C, u00108, "system__taskingS");
u00109 : constant Version_32 := 16#c71f56c0#;
pragma Export (C, u00109, "system__task_primitivesS");
u00110 : constant Version_32 := 16#c5a5fe3f#;
pragma Export (C, u00110, "system__os_interfaceS");
u00111 : constant Version_32 := 16#1d638357#;
pragma Export (C, u00111, "interfaces__c__stringsB");
u00112 : constant Version_32 := 16#603c1c44#;
pragma Export (C, u00112, "interfaces__c__stringsS");
u00113 : constant Version_32 := 16#c1984f17#;
pragma Export (C, u00113, "system__task_primitives__operationsB");
u00114 : constant Version_32 := 16#0af41c2b#;
pragma Export (C, u00114, "system__task_primitives__operationsS");
u00115 : constant Version_32 := 16#1b28662b#;
pragma Export (C, u00115, "system__float_controlB");
u00116 : constant Version_32 := 16#d25cc204#;
pragma Export (C, u00116, "system__float_controlS");
u00117 : constant Version_32 := 16#da8ccc08#;
pragma Export (C, u00117, "system__interrupt_managementB");
u00118 : constant Version_32 := 16#0f60a80c#;
pragma Export (C, u00118, "system__interrupt_managementS");
u00119 : constant Version_32 := 16#f65595cf#;
pragma Export (C, u00119, "system__multiprocessorsB");
u00120 : constant Version_32 := 16#0a0c1e4b#;
pragma Export (C, u00120, "system__multiprocessorsS");
u00121 : constant Version_32 := 16#77769007#;
pragma Export (C, u00121, "system__task_infoB");
u00122 : constant Version_32 := 16#e54688cf#;
pragma Export (C, u00122, "system__task_infoS");
u00123 : constant Version_32 := 16#e5a48551#;
pragma Export (C, u00123, "system__tasking__debugB");
u00124 : constant Version_32 := 16#f1f2435f#;
pragma Export (C, u00124, "system__tasking__debugS");
u00125 : constant Version_32 := 16#fd83e873#;
pragma Export (C, u00125, "system__concat_2B");
u00126 : constant Version_32 := 16#300056e8#;
pragma Export (C, u00126, "system__concat_2S");
u00127 : constant Version_32 := 16#2b70b149#;
pragma Export (C, u00127, "system__concat_3B");
u00128 : constant Version_32 := 16#39d0dd9d#;
pragma Export (C, u00128, "system__concat_3S");
u00129 : constant Version_32 := 16#273384e4#;
pragma Export (C, u00129, "system__img_enum_newB");
u00130 : constant Version_32 := 16#53ec87f8#;
pragma Export (C, u00130, "system__img_enum_newS");
u00131 : constant Version_32 := 16#6ec3c867#;
pragma Export (C, u00131, "system__stack_usageB");
u00132 : constant Version_32 := 16#3a3ac346#;
pragma Export (C, u00132, "system__stack_usageS");
u00133 : constant Version_32 := 16#457fb2da#;
pragma Export (C, u00133, "ada__strings__unboundedB");
u00134 : constant Version_32 := 16#f39c7224#;
pragma Export (C, u00134, "ada__strings__unboundedS");
u00135 : constant Version_32 := 16#144f64ae#;
pragma Export (C, u00135, "ada__strings__searchB");
u00136 : constant Version_32 := 16#c1ab8667#;
pragma Export (C, u00136, "ada__strings__searchS");
u00137 : constant Version_32 := 16#d398a95f#;
pragma Export (C, u00137, "ada__tagsB");
u00138 : constant Version_32 := 16#12a0afb8#;
pragma Export (C, u00138, "ada__tagsS");
u00139 : constant Version_32 := 16#796f31f1#;
pragma Export (C, u00139, "system__htableB");
u00140 : constant Version_32 := 16#b66232d2#;
pragma Export (C, u00140, "system__htableS");
u00141 : constant Version_32 := 16#089f5cd0#;
pragma Export (C, u00141, "system__string_hashB");
u00142 : constant Version_32 := 16#143c59ac#;
pragma Export (C, u00142, "system__string_hashS");
u00143 : constant Version_32 := 16#acee74ad#;
pragma Export (C, u00143, "system__compare_array_unsigned_8B");
u00144 : constant Version_32 := 16#9ba3f0b5#;
pragma Export (C, u00144, "system__compare_array_unsigned_8S");
u00145 : constant Version_32 := 16#a8025f3c#;
pragma Export (C, u00145, "system__address_operationsB");
u00146 : constant Version_32 := 16#21ac3f0b#;
pragma Export (C, u00146, "system__address_operationsS");
u00147 : constant Version_32 := 16#2e260032#;
pragma Export (C, u00147, "system__storage_pools__subpoolsB");
u00148 : constant Version_32 := 16#cc5a1856#;
pragma Export (C, u00148, "system__storage_pools__subpoolsS");
u00149 : constant Version_32 := 16#d96e3c40#;
pragma Export (C, u00149, "system__finalization_mastersB");
u00150 : constant Version_32 := 16#695cb8f2#;
pragma Export (C, u00150, "system__finalization_mastersS");
u00151 : constant Version_32 := 16#7268f812#;
pragma Export (C, u00151, "system__img_boolB");
u00152 : constant Version_32 := 16#c779f0d3#;
pragma Export (C, u00152, "system__img_boolS");
u00153 : constant Version_32 := 16#86c56e5a#;
pragma Export (C, u00153, "ada__finalizationS");
u00154 : constant Version_32 := 16#10558b11#;
pragma Export (C, u00154, "ada__streamsB");
u00155 : constant Version_32 := 16#67e31212#;
pragma Export (C, u00155, "ada__streamsS");
u00156 : constant Version_32 := 16#95817ed8#;
pragma Export (C, u00156, "system__finalization_rootB");
u00157 : constant Version_32 := 16#7d52f2a8#;
pragma Export (C, u00157, "system__finalization_rootS");
u00158 : constant Version_32 := 16#6d4d969a#;
pragma Export (C, u00158, "system__storage_poolsB");
u00159 : constant Version_32 := 16#114d1f95#;
pragma Export (C, u00159, "system__storage_poolsS");
u00160 : constant Version_32 := 16#84042202#;
pragma Export (C, u00160, "system__storage_pools__subpools__finalizationB");
u00161 : constant Version_32 := 16#fe2f4b3a#;
pragma Export (C, u00161, "system__storage_pools__subpools__finalizationS");
u00162 : constant Version_32 := 16#020a3f4d#;
pragma Export (C, u00162, "system__atomic_countersB");
u00163 : constant Version_32 := 16#86fcacb5#;
pragma Export (C, u00163, "system__atomic_countersS");
u00164 : constant Version_32 := 16#039168f8#;
pragma Export (C, u00164, "system__stream_attributesB");
u00165 : constant Version_32 := 16#8bc30a4e#;
pragma Export (C, u00165, "system__stream_attributesS");
u00166 : constant Version_32 := 16#927a893f#;
pragma Export (C, u00166, "ada__text_ioB");
u00167 : constant Version_32 := 16#25015822#;
pragma Export (C, u00167, "ada__text_ioS");
u00168 : constant Version_32 := 16#73d2d764#;
pragma Export (C, u00168, "interfaces__c_streamsB");
u00169 : constant Version_32 := 16#b1330297#;
pragma Export (C, u00169, "interfaces__c_streamsS");
u00170 : constant Version_32 := 16#ec083f01#;
pragma Export (C, u00170, "system__file_ioB");
u00171 : constant Version_32 := 16#95d1605d#;
pragma Export (C, u00171, "system__file_ioS");
u00172 : constant Version_32 := 16#cf3f1b90#;
pragma Export (C, u00172, "system__file_control_blockS");
u00173 : constant Version_32 := 16#33918b64#;
pragma Export (C, u00173, "def_monitorB");
u00174 : constant Version_32 := 16#dac9a4d9#;
pragma Export (C, u00174, "def_monitorS");
u00175 : constant Version_32 := 16#f24a7f45#;
pragma Export (C, u00175, "system__tasking__protected_objectsB");
u00176 : constant Version_32 := 16#b15a1586#;
pragma Export (C, u00176, "system__tasking__protected_objectsS");
u00177 : constant Version_32 := 16#f29e7e8b#;
pragma Export (C, u00177, "system__soft_links__taskingB");
u00178 : constant Version_32 := 16#e939497e#;
pragma Export (C, u00178, "system__soft_links__taskingS");
u00179 : constant Version_32 := 16#17d21067#;
pragma Export (C, u00179, "ada__exceptions__is_null_occurrenceB");
u00180 : constant Version_32 := 16#e1d7566f#;
pragma Export (C, u00180, "ada__exceptions__is_null_occurrenceS");
u00181 : constant Version_32 := 16#50b90464#;
pragma Export (C, u00181, "system__tasking__protected_objects__entriesB");
u00182 : constant Version_32 := 16#7daf93e7#;
pragma Export (C, u00182, "system__tasking__protected_objects__entriesS");
u00183 : constant Version_32 := 16#100eaf58#;
pragma Export (C, u00183, "system__restrictionsB");
u00184 : constant Version_32 := 16#79d25869#;
pragma Export (C, u00184, "system__restrictionsS");
u00185 : constant Version_32 := 16#ff0ade79#;
pragma Export (C, u00185, "system__tasking__initializationB");
u00186 : constant Version_32 := 16#f7885a93#;
pragma Export (C, u00186, "system__tasking__initializationS");
u00187 : constant Version_32 := 16#a067942c#;
pragma Export (C, u00187, "system__tasking__task_attributesB");
u00188 : constant Version_32 := 16#4c40320c#;
pragma Export (C, u00188, "system__tasking__task_attributesS");
u00189 : constant Version_32 := 16#a11c264c#;
pragma Export (C, u00189, "system__tasking__protected_objects__operationsB");
u00190 : constant Version_32 := 16#ba36ad85#;
pragma Export (C, u00190, "system__tasking__protected_objects__operationsS");
u00191 : constant Version_32 := 16#40317118#;
pragma Export (C, u00191, "system__tasking__entry_callsB");
u00192 : constant Version_32 := 16#c7180c67#;
pragma Export (C, u00192, "system__tasking__entry_callsS");
u00193 : constant Version_32 := 16#ec3cf692#;
pragma Export (C, u00193, "system__tasking__queuingB");
u00194 : constant Version_32 := 16#c9e0262c#;
pragma Export (C, u00194, "system__tasking__queuingS");
u00195 : constant Version_32 := 16#70d5a0df#;
pragma Export (C, u00195, "system__tasking__utilitiesB");
u00196 : constant Version_32 := 16#332a5557#;
pragma Export (C, u00196, "system__tasking__utilitiesS");
u00197 : constant Version_32 := 16#0fc99b06#;
pragma Export (C, u00197, "system__tasking__rendezvousB");
u00198 : constant Version_32 := 16#f242aaf9#;
pragma Export (C, u00198, "system__tasking__rendezvousS");
u00199 : constant Version_32 := 16#932a4690#;
pragma Export (C, u00199, "system__concat_4B");
u00200 : constant Version_32 := 16#4cc4aa18#;
pragma Export (C, u00200, "system__concat_4S");
u00201 : constant Version_32 := 16#7724692c#;
pragma Export (C, u00201, "system__tasking__stagesB");
u00202 : constant Version_32 := 16#fb9a8375#;
pragma Export (C, u00202, "system__tasking__stagesS");
u00203 : constant Version_32 := 16#5dc07a5a#;
pragma Export (C, u00203, "system__memoryB");
u00204 : constant Version_32 := 16#6bdde70c#;
pragma Export (C, u00204, "system__memoryS");
-- BEGIN ELABORATION ORDER
-- ada%s
-- ada.characters%s
-- ada.characters.latin_1%s
-- interfaces%s
-- system%s
-- system.address_operations%s
-- system.address_operations%b
-- system.atomic_counters%s
-- system.atomic_counters%b
-- system.float_control%s
-- system.float_control%b
-- system.img_bool%s
-- system.img_bool%b
-- system.img_enum_new%s
-- system.img_enum_new%b
-- system.img_int%s
-- system.img_int%b
-- system.io%s
-- system.io%b
-- system.parameters%s
-- system.parameters%b
-- system.crtl%s
-- interfaces.c_streams%s
-- interfaces.c_streams%b
-- system.restrictions%s
-- system.restrictions%b
-- system.storage_elements%s
-- system.storage_elements%b
-- system.stack_checking%s
-- system.stack_checking%b
-- system.stack_usage%s
-- system.stack_usage%b
-- system.string_hash%s
-- system.string_hash%b
-- system.htable%s
-- system.htable%b
-- system.strings%s
-- system.strings%b
-- system.traceback_entries%s
-- system.traceback_entries%b
-- system.unsigned_types%s
-- system.img_uns%s
-- system.img_uns%b
-- system.wch_con%s
-- system.wch_con%b
-- system.wch_jis%s
-- system.wch_jis%b
-- system.wch_cnv%s
-- system.wch_cnv%b
-- system.compare_array_unsigned_8%s
-- system.compare_array_unsigned_8%b
-- system.concat_2%s
-- system.concat_2%b
-- system.concat_3%s
-- system.concat_3%b
-- system.concat_4%s
-- system.concat_4%b
-- system.traceback%s
-- system.traceback%b
-- system.case_util%s
-- system.standard_library%s
-- system.exception_traces%s
-- ada.exceptions%s
-- system.wch_stw%s
-- system.val_util%s
-- system.val_llu%s
-- system.val_lli%s
-- system.os_lib%s
-- system.bit_ops%s
-- ada.characters.handling%s
-- ada.exceptions.traceback%s
-- system.secondary_stack%s
-- system.case_util%b
-- system.address_image%s
-- system.bounded_strings%s
-- system.soft_links%s
-- system.exception_table%s
-- system.exception_table%b
-- ada.io_exceptions%s
-- ada.strings%s
-- ada.containers%s
-- system.exceptions%s
-- system.exceptions%b
-- ada.exceptions.last_chance_handler%s
-- system.exceptions_debug%s
-- system.exceptions_debug%b
-- system.exception_traces%b
-- system.memory%s
-- system.memory%b
-- system.wch_stw%b
-- system.val_util%b
-- system.val_llu%b
-- system.val_lli%b
-- interfaces.c%s
-- system.win32%s
-- system.mmap%s
-- system.mmap.os_interface%s
-- system.mmap.os_interface%b
-- system.mmap%b
-- system.os_lib%b
-- system.bit_ops%b
-- ada.strings.maps%s
-- ada.strings.maps.constants%s
-- ada.characters.handling%b
-- ada.exceptions.traceback%b
-- system.exceptions.machine%s
-- system.exceptions.machine%b
-- system.secondary_stack%b
-- system.address_image%b
-- system.bounded_strings%b
-- system.soft_links.initialize%s
-- system.soft_links.initialize%b
-- system.soft_links%b
-- ada.exceptions.last_chance_handler%b
-- system.standard_library%b
-- system.object_reader%s
-- system.dwarf_lines%s
-- system.dwarf_lines%b
-- interfaces.c%b
-- ada.strings.maps%b
-- system.traceback.symbolic%s
-- system.traceback.symbolic%b
-- ada.exceptions%b
-- system.object_reader%b
-- ada.exceptions.is_null_occurrence%s
-- ada.exceptions.is_null_occurrence%b
-- ada.strings.search%s
-- ada.strings.search%b
-- ada.tags%s
-- ada.tags%b
-- ada.streams%s
-- ada.streams%b
-- interfaces.c.strings%s
-- interfaces.c.strings%b
-- system.file_control_block%s
-- system.finalization_root%s
-- system.finalization_root%b
-- ada.finalization%s
-- system.file_io%s
-- system.file_io%b
-- system.multiprocessors%s
-- system.multiprocessors%b
-- system.os_interface%s
-- system.interrupt_management%s
-- system.interrupt_management%b
-- system.storage_pools%s
-- system.storage_pools%b
-- system.finalization_masters%s
-- system.finalization_masters%b
-- system.storage_pools.subpools%s
-- system.storage_pools.subpools.finalization%s
-- system.storage_pools.subpools%b
-- system.storage_pools.subpools.finalization%b
-- system.stream_attributes%s
-- system.stream_attributes%b
-- ada.strings.unbounded%s
-- ada.strings.unbounded%b
-- system.task_info%s
-- system.task_info%b
-- system.task_lock%s
-- system.task_lock%b
-- system.task_primitives%s
-- system.win32.ext%s
-- system.os_primitives%s
-- system.os_primitives%b
-- system.tasking%s
-- system.task_primitives.operations%s
-- system.tasking.debug%s
-- system.tasking%b
-- system.task_primitives.operations%b
-- system.tasking.debug%b
-- ada.calendar%s
-- ada.calendar%b
-- ada.calendar.delays%s
-- ada.calendar.delays%b
-- ada.real_time%s
-- ada.real_time%b
-- ada.text_io%s
-- ada.text_io%b
-- system.soft_links.tasking%s
-- system.soft_links.tasking%b
-- system.tasking.initialization%s
-- system.tasking.task_attributes%s
-- system.tasking.initialization%b
-- system.tasking.task_attributes%b
-- system.tasking.protected_objects%s
-- system.tasking.protected_objects%b
-- system.tasking.protected_objects.entries%s
-- system.tasking.protected_objects.entries%b
-- system.tasking.queuing%s
-- system.tasking.queuing%b
-- system.tasking.utilities%s
-- system.tasking.utilities%b
-- system.tasking.entry_calls%s
-- system.tasking.rendezvous%s
-- system.tasking.protected_objects.operations%s
-- system.tasking.protected_objects.operations%b
-- system.tasking.entry_calls%b
-- system.tasking.rendezvous%b
-- system.tasking.stages%s
-- system.tasking.stages%b
-- def_monitor%s
-- def_monitor%b
-- blancaneus%b
-- END ELABORATION ORDER
end ada_main;
| 44.540335 | 81 | 0.684721 |
addc178403059169cfc2e33bfd9972cd7f0749ad | 4,982 | ads | Ada | source/web/spikedog/aws/web_socket-handlers-aws_handlers.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/web/spikedog/aws/web_socket-handlers-aws_handlers.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/web/spikedog/aws/web_socket-handlers-aws_handlers.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 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$
------------------------------------------------------------------------------
private with Ada.Strings.Unbounded;
with AWS.Net.WebSocket;
with AWS.Status;
private with League.Stream_Element_Vectors;
private with League.Strings;
package Web_Socket.Handlers.AWS_Handlers is
type AWS_Web_Socket_Handler is new Web_Socket_Handler with private;
type AWS_Web_Socket_Handler_Access is
access all AWS_Web_Socket_Handler'Class;
type AWS_Web_Socket is new AWS.Net.WebSocket.Object with private;
function Create
(Socket : AWS.Net.Socket_Access;
Request : AWS.Status.Data;
Handler : not null AWS_Web_Socket_Handler_Access)
return AWS_Web_Socket'Class;
private
type AWS_Web_Socket_Handler is new Web_Socket_Handler with record
Socket : access AWS_Web_Socket'Class;
end record;
overriding procedure Send_Text
(Self : in out AWS_Web_Socket_Handler;
Text : League.Strings.Universal_String);
overriding procedure Send_Binary
(Self : in out AWS_Web_Socket_Handler;
Data : League.Stream_Element_Vectors.Stream_Element_Vector);
type AWS_Web_Socket is new AWS.Net.WebSocket.Object with record
Handler : AWS_Web_Socket_Handler_Access;
end record;
overriding procedure Adjust (Self : in out AWS_Web_Socket);
overriding procedure On_Message
(Self : in out AWS_Web_Socket;
Message : Ada.Strings.Unbounded.Unbounded_String);
overriding procedure On_Open
(Self : in out AWS_Web_Socket; Message : String);
overriding procedure On_Close
(Self : in out AWS_Web_Socket; Message : String);
overriding procedure On_Error
(Self : in out AWS_Web_Socket; Message : String);
end Web_Socket.Handlers.AWS_Handlers;
| 49.326733 | 78 | 0.509434 |
a0cf80d9a454fdb31e393c1ce139b199ea77ead9 | 1,819 | ads | Ada | system-rpc.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 15 | 2018-07-08T07:09:19.000Z | 2021-11-21T09:58:55.000Z | system-rpc.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 4 | 2019-11-17T20:04:33.000Z | 2021-08-29T21:24:55.000Z | system-rpc.ads | mgrojo/adalib | dc1355a5b65c2843e702ac76252addb2caf3c56b | [
"BSD-3-Clause"
] | 3 | 2020-04-23T11:17:11.000Z | 2021-08-29T19:31:09.000Z | -- Standard Ada library specification
-- Copyright (c) 2003-2018 Maxim Reznik <[email protected]>
-- Copyright (c) 2004-2016 AXE Consultants
-- Copyright (c) 2004, 2005, 2006 Ada-Europe
-- Copyright (c) 2000 The MITRE Corporation, Inc.
-- Copyright (c) 1992, 1993, 1994, 1995 Intermetrics, Inc.
-- SPDX-License-Identifier: BSD-3-Clause and LicenseRef-AdaReferenceManual
---------------------------------------------------------------------------
with Ada.Streams; -- see 13.13.1
package System.RPC is
type Partition_Id is range 0 .. implementation_defined;
Communication_Error : exception;
type Params_Stream_Type (Initial_Size : Ada.Streams.Stream_Element_Count) is
new Ada.Streams.Root_Stream_Type with private;
procedure Read (Stream : in out Params_Stream_Type;
Item : out Ada.Streams.Stream_Element_Array;
Last : out Ada.Streams.Stream_Element_Offset);
procedure Write (Stream : in out Params_Stream_Type;
Item : in Ada.Streams.Stream_Element_Array);
-- Synchronous call
procedure Do_RPC (Partition : in Partition_Id;
Params : access Params_Stream_Type;
Result : access Params_Stream_Type);
-- Asynchronous call
procedure Do_APC (Partition : in Partition_Id;
Params : access Params_Stream_Type);
-- The handler for incoming RPCs
type RPC_Receiver is access procedure (Params : access Params_Stream_Type;
Result : access Params_Stream_Type);
procedure Establish_RPC_Receiver (Partition : in Partition_Id;
Receiver : in RPC_Receiver);
private
pragma Import (Ada, Params_Stream_Type);
end System.RPC;
| 34.980769 | 79 | 0.625069 |
5e0ba50879a29b5e189c8a232d868f6d0fd7468d | 6,392 | ads | Ada | .emacs.d/elpa/ada-mode-7.1.4/wisi-ada.ads | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/ada-mode-7.1.4/wisi-ada.ads | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/ada-mode-7.1.4/wisi-ada.ads | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | -- Abstract :
--
-- Ada language specific indent options and functions
--
-- [1] ada.wy
-- [2] ada-indent-user-options.el
--
-- Copyright (C) 2017 - 2020 Free Software Foundation, Inc.
--
-- This library is free software; you can redistribute it and/or modify it
-- under terms of the GNU General Public License as published by the Free
-- Software Foundation; either version 3, or (at your option) any later
-- version. This library is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHAN-
-- TABILITY or FITNESS FOR A PARTICULAR PURPOSE.
-- As a special exception under Section 7 of GPL version 3, you are granted
-- additional permissions described in the GCC Runtime Library Exception,
-- version 3.1, as published by the Free Software Foundation.
pragma License (Modified_GPL);
package Wisi.Ada is
Language_Protocol_Version : constant String := "3";
-- Defines the data passed to Initialize in Params.
--
-- This value must match ada-mode.el
-- ada-wisi-language-protocol-version.
--
-- Only changes once per ada-mode release. Increment as soon as
-- required, record new version in NEWS-ada-mode.text.
-- Indent parameters from [2]
Ada_Indent : Integer := 3;
Ada_Indent_Broken : Integer := 2;
Ada_Indent_Comment_Col_0 : Boolean := False;
Ada_Indent_Comment_GNAT : Boolean := False;
Ada_Indent_Label : Integer := -3;
Ada_Indent_Record_Rel_Type : Integer := 3;
Ada_Indent_Renames : Integer := 2;
Ada_Indent_Return : Integer := 0;
Ada_Indent_Use : Integer := 2;
Ada_Indent_When : Integer := 3;
Ada_Indent_With : Integer := 2;
Ada_Indent_Hanging_Rel_Exp : Boolean := False;
-- Other parameters
End_Names_Optional : Boolean := False;
type Parse_Data_Type is new Wisi.Parse_Data_Type with null record;
overriding
procedure Initialize
(Data : in out Parse_Data_Type;
Lexer : in WisiToken.Lexer.Handle;
Descriptor : access constant WisiToken.Descriptor;
Base_Terminals : in WisiToken.Base_Token_Array_Access;
Post_Parse_Action : in Post_Parse_Action_Type;
Begin_Line : in WisiToken.Line_Number_Type;
End_Line : in WisiToken.Line_Number_Type;
Begin_Indent : in Integer;
Params : in String);
-- Call Wisi_Runtime.Initialize, then:
--
-- If Params /= "", set all language-specific parameters from Params,
-- in declaration order; otherwise keep default values. Boolean is
-- represented by 0 | 1. Parameter values are space delimited.
--
-- Also do any other initialization that Data needs.
overriding
function Insert_After
(User_Data : in out Parse_Data_Type;
Tree : in WisiToken.Syntax_Trees.Tree'Class;
Token : in WisiToken.Valid_Node_Index;
Insert_On_Blank_Line : in Boolean)
return Boolean;
overriding
function Indent_Hanging_1
(Data : in out Parse_Data_Type;
Tree : in WisiToken.Syntax_Trees.Tree;
Tokens : in WisiToken.Valid_Node_Index_Array;
Tree_Indenting : in WisiToken.Valid_Node_Index;
Indenting_Comment : in Boolean;
Delta_1 : in Simple_Indent_Param;
Delta_2 : in Simple_Indent_Param;
Option : in Boolean;
Accumulate : in Boolean)
return Delta_Type;
overriding
procedure Refactor
(Data : in out Parse_Data_Type;
Tree : in out WisiToken.Syntax_Trees.Tree;
Action : in Positive;
Edit_Begin : in WisiToken.Buffer_Pos);
----------
-- The following are declared in ada.wy %elisp_indent, and must match
-- Language_Indent_Function.
function Ada_Indent_Aggregate
(Data : in out Wisi.Parse_Data_Type'Class;
Tree : in WisiToken.Syntax_Trees.Tree;
Tokens : in WisiToken.Valid_Node_Index_Array;
Tree_Indenting : in WisiToken.Valid_Node_Index;
Indenting_Comment : in Boolean;
Args : in Wisi.Indent_Arg_Arrays.Vector)
return Wisi.Delta_Type;
-- [1] ada-indent-aggregate
function Ada_Indent_Renames_0
(Data : in out Wisi.Parse_Data_Type'Class;
Tree : in WisiToken.Syntax_Trees.Tree;
Tokens : in WisiToken.Valid_Node_Index_Array;
Tree_Indenting : in WisiToken.Valid_Node_Index;
Indenting_Comment : in Boolean;
Args : in Wisi.Indent_Arg_Arrays.Vector)
return Wisi.Delta_Type;
-- [1] ada-indent-renames
function Ada_Indent_Return_0
(Data : in out Wisi.Parse_Data_Type'Class;
Tree : in WisiToken.Syntax_Trees.Tree;
Tokens : in WisiToken.Valid_Node_Index_Array;
Tree_Indenting : in WisiToken.Valid_Node_Index;
Indenting_Comment : in Boolean;
Args : in Wisi.Indent_Arg_Arrays.Vector)
return Wisi.Delta_Type;
-- [1] ada-indent-return
function Ada_Indent_Record_0
(Data : in out Wisi.Parse_Data_Type'Class;
Tree : in WisiToken.Syntax_Trees.Tree;
Tokens : in WisiToken.Valid_Node_Index_Array;
Tree_Indenting : in WisiToken.Valid_Node_Index;
Indenting_Comment : in Boolean;
Args : in Wisi.Indent_Arg_Arrays.Vector)
return Wisi.Delta_Type;
-- [1] ada-indent-record
-- Args: anchor_token_index, record_token_index, offset
function Ada_Indent_Record_1
(Data : in out Wisi.Parse_Data_Type'Class;
Tree : in WisiToken.Syntax_Trees.Tree;
Tokens : in WisiToken.Valid_Node_Index_Array;
Tree_Indenting : in WisiToken.Valid_Node_Index;
Indenting_Comment : in Boolean;
Args : in Wisi.Indent_Arg_Arrays.Vector)
return Wisi.Delta_Type;
-- [1] ada-indent-record*
-- Args: anchor_token_ID, record_token_index, offset
end Wisi.Ada;
| 40.713376 | 76 | 0.624218 |
19b82e7ce7595d79ec56458e5de34aa53d46ff5f | 4,256 | adb | Ada | attic/asis/find_all/adam-assist-query-find_all-context_processing.adb | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | 3 | 2017-04-29T14:25:22.000Z | 2017-09-29T10:15:28.000Z | attic/asis/find_all/adam-assist-query-find_all-context_processing.adb | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | null | null | null | attic/asis/find_all/adam-assist-query-find_all-context_processing.adb | charlie5/aIDE | fab406dbcd9b72a4cb215ffebb05166c788d6365 | [
"MIT"
] | null | null | null | with
Ada.Wide_Text_IO,
Ada.Characters.Handling,
Ada.Exceptions,
Asis.Compilation_Units,
Asis.Exceptions,
Asis.Errors,
Asis.Implementation,
AdaM.Assist.Query.find_All.unit_Processing;
package body AdaM.Assist.Query.find_All.context_Processing
is
function Get_Unit_From_File_Name (Ada_File_Name : String;
The_Context : Asis.Context) return Asis.Compilation_Unit
is
begin
return Asis.Nil_Compilation_Unit;
end Get_Unit_From_File_Name;
procedure Process_Context (The_Context : Asis.Context;
Trace : Boolean := False)
is
Units : constant Asis.Compilation_Unit_List :=
Asis.Compilation_Units.Compilation_Units (The_Context);
Next_Unit : Asis.Compilation_Unit := Asis.Nil_Compilation_Unit;
Next_Unit_Origin : Asis.Unit_Origins := Asis.Not_An_Origin;
Next_Unit_Class : Asis.Unit_Classes := Asis.Not_A_Class;
begin
for J in Units'Range
loop
Next_Unit := Units (J);
Next_Unit_Class := Asis.Compilation_Units.Unit_Class (Next_Unit);
Next_Unit_Origin := Asis.Compilation_Units.Unit_Origin (Next_Unit);
case Next_Unit_Origin is
when Asis.An_Application_Unit
| Asis.A_Predefined_Unit =>
AdaM.Assist.Query.find_All.unit_Processing.Process_Unit (Next_Unit);
-- This is the call to the procedure which performs the
-- analysis of a particular unit
when Asis.An_Implementation_Unit =>
if Trace then
Ada.Wide_Text_IO.Put
("Skipped as an implementation-defined unit");
end if;
when Asis.Not_An_Origin =>
if Trace then
Ada.Wide_Text_IO.Put
("Skipped as nonexistent unit");
end if;
end case;
end loop;
exception
-- The exception handling in this procedure is somewhat redundant and
-- may need some reconsidering when using this procedure as a template
-- for a real ASIS tool
when Ex : Asis.Exceptions.ASIS_Inappropriate_Context |
Asis.Exceptions.ASIS_Inappropriate_Container |
Asis.Exceptions.ASIS_Inappropriate_Compilation_Unit |
Asis.Exceptions.ASIS_Inappropriate_Element |
Asis.Exceptions.ASIS_Inappropriate_Line |
Asis.Exceptions.ASIS_Inappropriate_Line_Number |
Asis.Exceptions.ASIS_Failed =>
Ada.Wide_Text_IO.Put ("Process_Context : ASIS exception (");
Ada.Wide_Text_IO.Put (Ada.Characters.Handling.To_Wide_String (
Ada.Exceptions.Exception_Name (Ex)));
Ada.Wide_Text_IO.Put (") is raised when processing unit ");
Ada.Wide_Text_IO.Put
(Asis.Compilation_Units.Unit_Full_Name (Next_Unit));
Ada.Wide_Text_IO.New_Line;
Ada.Wide_Text_IO.Put ("ASIS Error Status is ");
Ada.Wide_Text_IO.Put
(Asis.Errors.Error_Kinds'Wide_Image (Asis.Implementation.Status));
Ada.Wide_Text_IO.New_Line;
Ada.Wide_Text_IO.Put ("ASIS Diagnosis is ");
Ada.Wide_Text_IO.New_Line;
Ada.Wide_Text_IO.Put (Asis.Implementation.Diagnosis);
Ada.Wide_Text_IO.New_Line;
Asis.Implementation.Set_Status;
when Ex : others =>
Ada.Wide_Text_IO.Put ("Process_Context : ");
Ada.Wide_Text_IO.Put (Ada.Characters.Handling.To_Wide_String (
Ada.Exceptions.Exception_Name (Ex)));
Ada.Wide_Text_IO.Put (" is raised (");
Ada.Wide_Text_IO.Put (Ada.Characters.Handling.To_Wide_String (
Ada.Exceptions.Exception_Information (Ex)));
Ada.Wide_Text_IO.Put (")");
Ada.Wide_Text_IO.New_Line;
Ada.Wide_Text_IO.Put ("when processing unit");
Ada.Wide_Text_IO.Put
(Asis.Compilation_Units.Unit_Full_Name (Next_Unit));
Ada.Wide_Text_IO.New_Line;
end Process_Context;
end AdaM.Assist.Query.find_All.context_Processing;
| 33.777778 | 95 | 0.620066 |
03ca89e770e03a00ae16d495dd6e97daca69b5df | 3,465 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c36202c.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/c3/c36202c.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c36202c.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C36202C.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 'LENGTH DOES NOT RAISE AN EXCEPTION
-- WHEN APPLIED TO A NULL ARRAY A, EVEN IF A'LAST - A'FIRST
-- WOULD RAISE CONSTRAINT_ERROR.
-- *** NOTE: This test has been modified since ACVC version 1.11 to -- 9X
-- *** remove incompatibilities associated with the transition -- 9X
-- *** to Ada 9X. -- 9X
-- L.BROWN 07/29/86
-- JRL 03/30/93 REMOVED NUMERIC_ERROR FROM TEST.
WITH REPORT; USE REPORT;
WITH SYSTEM; USE SYSTEM;
PROCEDURE C36202C IS
TYPE LRG_INT IS RANGE MIN_INT .. MAX_INT;
BEGIN
TEST("C36202C", "NO EXCEPTION IS RAISED FOR 'LENGTH "&
"WHEN APPLIED TO A NULL ARRAY");
DECLARE
TYPE LRG_ARR IS ARRAY
(LRG_INT RANGE MAX_INT .. MIN_INT)
OF INTEGER;
LRG_OBJ : LRG_ARR;
BEGIN
IF LRG_OBJ'LENGTH /= 0 THEN
FAILED("INCORRECT VALUE RETURNED BY 'LENGTH " &
"FOR ONE-DIM NULL ARRAY");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
FAILED("CONSTRAINT_ERROR WAS RAISED " &
"FOR ONE-DIM NULL ARRAY");
WHEN OTHERS =>
FAILED("EXCEPTION RAISED FOR ONE-DIM " &
"NULL ARRAY");
END;
DECLARE
TYPE LRG2_ARR IS ARRAY (LRG_INT RANGE 1 .. 3 ,
LRG_INT RANGE MAX_INT .. MIN_INT)
OF INTEGER;
BEGIN
IF LRG2_ARR'LENGTH(2) /= 0 THEN
FAILED("INCORRECT VALUE RETURNED BY 'LENGTH " &
"FOR TWO-DIM NULL ARRAY");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
FAILED("CONSTRAINT_ERROR WAS RAISED " &
"FOR TWO-DIM NULL ARRAY");
WHEN OTHERS =>
FAILED("EXCEPTION RAISED FOR TWO-DIM " &
"NULL ARRAY");
END;
RESULT;
END C36202C;
| 39.375 | 79 | 0.539105 |
033f26007463f08cf1415d4f4178412d07dadaa3 | 54,685 | adb | Ada | src/game.adb | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 80 | 2017-04-08T23:14:07.000Z | 2022-02-10T22:30:51.000Z | src/game.adb | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 89 | 2017-06-24T08:18:26.000Z | 2021-11-12T04:37:36.000Z | src/game.adb | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 9 | 2018-04-14T16:37:25.000Z | 2020-03-21T14:33:49.000Z | -- Copyright 2016-2021 Bartek thindil Jasicki
--
-- This file is part of Steam Sky.
--
-- Steam Sky 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.
--
-- Steam Sky 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 Steam Sky. If not, see <http://www.gnu.org/licenses/>.
with Ada.Directories; use Ada.Directories;
with Ada.Exceptions;
with Ada.Containers.Hashed_Maps;
with Ada.Strings.Unbounded.Hash;
with DOM.Core;
with DOM.Core.Elements;
with DOM.Core.Documents;
with DOM.Core.Nodes;
with DOM.Readers;
with Input_Sources.File;
with Bases; use Bases;
with Bases.Ship;
with Bases.Cargo; use Bases.Cargo;
with BasesTypes;
with Careers;
with Config; use Config;
with Crafts; use Crafts;
with Crew; use Crew;
with Events; use Events;
with Factions; use Factions;
with Game.SaveLoad; use Game.SaveLoad;
with Goals; use Goals;
with Help;
with Items; use Items;
with Log;
with Maps; use Maps;
with Messages; use Messages;
with Missions; use Missions;
with Mobs; use Mobs;
with ShipModules; use ShipModules;
with Ships; use Ships;
with Ships.Crew;
with Ships.Repairs;
with Ships.Upgrade;
with Statistics; use Statistics;
with Stories;
with Utils;
package body Game is
procedure New_Game is
use Utils;
Random_Base: Positive := Positive'First;
begin
-- Save game configuration
Save_Config;
-- Set game statistics
ClearGameStats;
Set_Faction_Career_Block :
declare
Roll,
Index: Positive range Positive'First ..
Positive(Factions_List.Length) :=
Positive'First;
begin
-- Set player faction if random option was selected
if New_Game_Settings.Player_Faction =
To_Unbounded_String(Source => "random") then
New_Game_Settings.Player_Career :=
To_Unbounded_String(Source => "random");
Roll :=
Get_Random(Min => 1, Max => Positive(Factions_List.Length));
Index := 1;
Get_Player_Faction_Loop :
for I in Factions_List.Iterate loop
if Index = Roll then
New_Game_Settings.Player_Faction :=
Factions_Container.Key(Position => I);
exit Get_Player_Faction_Loop;
end if;
Index := Index + 1;
end loop Get_Player_Faction_Loop;
end if;
-- Set player career if random option was selected
if New_Game_Settings.Player_Career =
To_Unbounded_String(Source => "random") then
Roll :=
Get_Random
(Min => 1,
Max =>
Positive
(Factions_List(New_Game_Settings.Player_Faction).Careers
.Length));
Index := 1;
Get_Player_Career_Loop :
for I in Factions_List(New_Game_Settings.Player_Faction).Careers
.Iterate loop
if Index = Roll then
New_Game_Settings.Player_Career :=
Factions.Careers_Container.Key(Position => I);
exit Get_Player_Career_Loop;
end if;
Index := Index + 1;
end loop Get_Player_Career_Loop;
end if;
end Set_Faction_Career_Block;
-- Set Game time
Game_Date := Start_Date;
-- Generate world
SkyMap :=
(others =>
(others =>
(BaseIndex => 0, Visited => False, EventIndex => 0,
MissionIndex => 0)));
Generate_Bases_Block :
declare
Max_Spawn_Roll, Max_Base_Spawn_Roll: Natural := 0;
Faction_Roll: Positive := 1;
Valid_Location: Boolean := False;
Temp_X, Temp_Y, Base_Reputation, Pos_X, Pos_Y: Integer := 0;
Tmp_Recruits: constant Recruit_Container.Vector :=
Recruit_Container.Empty_Vector;
Tmp_Missions: constant Mission_Container.Vector :=
Mission_Container.Empty_Vector;
Base_Population, Base_Type_Roll: Natural := 0;
Tmp_Cargo: constant BaseCargo_Container.Vector :=
BaseCargo_Container.Empty_Vector;
Base_Size: Bases_Size := SMALL;
Base_Owner, Base_Type: Unbounded_String := Null_Unbounded_String;
package Bases_Container is new Hashed_Maps
(Key_Type => Unbounded_String,
Element_Type => Positive_Container.Vector,
Hash => Ada.Strings.Unbounded.Hash, Equivalent_Keys => "=",
"=" => Positive_Container."=");
Bases_Array: Bases_Container.Map := Bases_Container.Empty_Map;
Attempts: Positive range 1 .. 251 := 1;
begin
Count_Spawn_Chance_Loop :
for I in Factions_List.Iterate loop
Max_Spawn_Roll := Max_Spawn_Roll + Factions_List(I).SpawnChance;
Bases_Array.Include
(Key => Factions_Container.Key(Position => I),
New_Item => Positive_Container.Empty_Vector);
end loop Count_Spawn_Chance_Loop;
Set_Bases_Loop :
for I in Sky_Bases'Range loop
Faction_Roll := Get_Random(Min => 1, Max => Max_Spawn_Roll);
Set_Base_Faction_Loop :
for J in Factions_List.Iterate loop
if Faction_Roll <= Factions_List(J).SpawnChance then
Base_Owner := Factions_Container.Key(Position => J);
Base_Population :=
(if Factions_List(J).Population(2) = 0 then
Factions_List(J).Population(1)
else Get_Random
(Min => Factions_List(J).Population(1),
Max => Factions_List(J).Population(2)));
Base_Reputation :=
GetReputation
(SourceFaction => New_Game_Settings.Player_Faction,
TargetFaction => Factions_Container.Key(Position => J));
Max_Base_Spawn_Roll := 0;
Count_Max_Spawn_Chance_Loop :
for SpawnChance of Factions_List(J).BasesTypes loop
Max_Base_Spawn_Roll := Max_Base_Spawn_Roll + SpawnChance;
end loop Count_Max_Spawn_Chance_Loop;
Base_Type_Roll :=
Get_Random(Min => 1, Max => Max_Base_Spawn_Roll);
Get_Base_Type_Loop :
for K in Factions_List(J).BasesTypes.Iterate loop
if Base_Type_Roll <= Factions_List(J).BasesTypes(K) then
Base_Type := BaseType_Container.Key(Position => K);
exit Get_Base_Type_Loop;
end if;
Base_Type_Roll :=
Base_Type_Roll - Factions_List(J).BasesTypes(K);
end loop Get_Base_Type_Loop;
exit Set_Base_Faction_Loop;
end if;
Faction_Roll := Faction_Roll - Factions_List(J).SpawnChance;
end loop Set_Base_Faction_Loop;
Base_Size :=
(if Base_Population = 0 then
Bases_Size'Val(Get_Random(Min => 0, Max => 2))
elsif Base_Population < 150 then SMALL
elsif Base_Population < 300 then MEDIUM else BIG);
Sky_Bases(I) :=
(Name => Generate_Base_Name(Faction_Index => Base_Owner),
Visited => (others => 0), Sky_X => 1, Sky_Y => 1,
Base_Type => Base_Type, Population => Base_Population,
Recruit_Date => (others => 0), Recruits => Tmp_Recruits,
Known => False, Asked_For_Bases => False,
Asked_For_Events => (others => 0),
Reputation => (1 => Base_Reputation, 2 => 0),
Missions_Date => (others => 0), Missions => Tmp_Missions,
Owner => Base_Owner, Cargo => Tmp_Cargo, Size => Base_Size);
if Factions_List(Base_Owner).Flags.Contains
(Item => To_Unbounded_String(Source => "loner")) then
Faction_Roll := Get_Random(Min => 1, Max => Max_Spawn_Roll);
Get_Faction_Loop :
for J in Factions_List.Iterate loop
if Faction_Roll > Factions_List(J).SpawnChance then
Faction_Roll :=
Faction_Roll - Factions_List(J).SpawnChance;
else
Base_Owner := Factions_Container.Key(Position => J);
end if;
end loop Get_Faction_Loop;
end if;
Bases_Array(Base_Owner).Append(New_Item => I);
end loop Set_Bases_Loop;
Place_Bases_Loop :
for FactionBases of Bases_Array loop
Place_Faction_Bases_Loop :
for I in FactionBases.Iterate loop
Attempts := 1;
Count_Base_Position_Loop :
loop
Valid_Location := True;
if Positive_Container.To_Index(Position => I) =
FactionBases.First_Index or
(Factions_List
(Sky_Bases(FactionBases(FactionBases.First_Index))
.Owner)
.Flags
.Contains
(Item => To_Unbounded_String(Source => "loner")) and
Factions_List(Sky_Bases(FactionBases(I)).Owner).Flags
.Contains
(Item => To_Unbounded_String(Source => "loner"))) then
Pos_X :=
Get_Random
(Min => Bases_Range'First + 5,
Max => Bases_Range'Last - 5);
Pos_Y :=
Get_Random
(Min => Bases_Range'First + 5,
Max => Bases_Range'Last - 5);
else
Pos_X :=
Get_Random
(Min =>
Sky_Bases
(FactionBases
(Positive_Container.To_Index(Position => I) -
1))
.Sky_X -
20,
Max =>
Sky_Bases
(FactionBases
(Positive_Container.To_Index(Position => I) -
1))
.Sky_X +
20);
NormalizeCoord(Coord => Pos_X);
Pos_Y :=
Get_Random
(Min =>
Sky_Bases
(FactionBases
(Positive_Container.To_Index(Position => I) -
1))
.Sky_Y -
20,
Max =>
Sky_Bases
(FactionBases
(Positive_Container.To_Index(Position => I) -
1))
.Sky_Y +
20);
NormalizeCoord(Coord => Pos_Y, IsXAxis => False);
Attempts := Attempts + 1;
if Attempts = 251 then
Pos_X :=
Get_Random
(Min => Bases_Range'First + 10,
Max => Bases_Range'Last - 10);
Pos_Y :=
Get_Random
(Min => Bases_Range'First + 10,
Max => Bases_Range'Last - 10);
Attempts := 1;
end if;
end if;
Check_X_Coordinate_Loop :
for J in -5 .. 5 loop
Temp_X := Pos_X + J;
NormalizeCoord(Coord => Temp_X);
Check_Y_Coordinate_Loop :
for K in -5 .. 5 loop
Temp_Y := Pos_Y + K;
NormalizeCoord(Coord => Temp_Y, IsXAxis => False);
if SkyMap(Temp_X, Temp_Y).BaseIndex > 0 then
Valid_Location := False;
exit Check_Y_Coordinate_Loop;
end if;
end loop Check_Y_Coordinate_Loop;
exit Check_X_Coordinate_Loop when not Valid_Location;
end loop Check_X_Coordinate_Loop;
if SkyMap(Pos_X, Pos_Y).BaseIndex > 0 then
Valid_Location := False;
end if;
exit Count_Base_Position_Loop when Valid_Location;
end loop Count_Base_Position_Loop;
SkyMap(Pos_X, Pos_Y) :=
(BaseIndex => FactionBases(I), Visited => False,
EventIndex => 0, MissionIndex => 0);
Sky_Bases(FactionBases(I)).Sky_X := Pos_X;
Sky_Bases(FactionBases(I)).Sky_Y := Pos_Y;
end loop Place_Faction_Bases_Loop;
end loop Place_Bases_Loop;
end Generate_Bases_Block;
-- Place player ship in random large base
Place_Player_Loop :
loop
Random_Base := Get_Random(Min => 1, Max => 1_024);
if New_Game_Settings.Starting_Base =
To_Unbounded_String(Source => "Any") then
exit Place_Player_Loop when Sky_Bases(Random_Base).Population >
299 and
Sky_Bases(Random_Base).Owner = New_Game_Settings.Player_Faction;
else
exit Place_Player_Loop when Sky_Bases(Random_Base).Population >
299 and
Sky_Bases(Random_Base).Owner =
New_Game_Settings.Player_Faction and
Sky_Bases(Random_Base).Base_Type =
New_Game_Settings.Starting_Base;
end if;
end loop Place_Player_Loop;
-- Create player ship
Player_Ship :=
Create_Ship
(Proto_Index =>
Factions_List(New_Game_Settings.Player_Faction).Careers
(New_Game_Settings.Player_Career)
.ShipIndex,
Name => New_Game_Settings.Ship_Name,
X => Sky_Bases(Random_Base).Sky_X,
Y => Sky_Bases(Random_Base).Sky_Y, Speed => DOCKED,
Random_Upgrades => False);
-- Add player to ship
Add_Player_Block :
declare
Player_Index_2: constant Unbounded_String :=
Factions_List(New_Game_Settings.Player_Faction).Careers
(New_Game_Settings.Player_Career)
.PlayerIndex;
Amount: Positive := 1;
Tmp_Inventory: Inventory_Container.Vector :=
Inventory_Container.Empty_Vector;
Player_Morale: constant Positive :=
(if
Factions_List(New_Game_Settings.Player_Faction).Flags.Contains
(Item => To_Unbounded_String(Source => "nomorale"))
then 50
else 100);
begin
Player_Inventory_Loop :
for I in ProtoMobs_List(Player_Index_2).Inventory.Iterate loop
Amount :=
(if ProtoMobs_List(Player_Index_2).Inventory(I).MaxAmount > 0
then
Get_Random
(Min =>
ProtoMobs_List(Player_Index_2).Inventory(I).MinAmount,
Max =>
ProtoMobs_List(Player_Index_2).Inventory(I).MaxAmount)
else ProtoMobs_List(Player_Index_2).Inventory(I).MinAmount);
Tmp_Inventory.Append
(New_Item =>
(ProtoIndex =>
ProtoMobs_List(Player_Index_2).Inventory(I).ProtoIndex,
Amount => Amount, Name => Null_Unbounded_String,
Durability => 100, Price => 0));
end loop Player_Inventory_Loop;
Player_Ship.Crew.Prepend
(New_Item =>
(Amount_Of_Attributes => Attributes_Amount,
Amount_Of_Skills => Skills_Amount,
Name => New_Game_Settings.Player_Name,
Gender => New_Game_Settings.Player_Gender, Health => 100,
Tired => 0, Skills => ProtoMobs_List(Player_Index_2).Skills,
Hunger => 0, Thirst => 0,
Order => ProtoMobs_List(Player_Index_2).Order,
PreviousOrder => Rest, OrderTime => 15,
Orders => ProtoMobs_List(Player_Index_2).Priorities,
Attributes => ProtoMobs_List(Player_Index_2).Attributes,
Inventory => Tmp_Inventory,
Equipment => ProtoMobs_List(Player_Index_2).Equipment,
Payment => (others => 0), ContractLength => -1,
Morale => (1 => Player_Morale, 2 => 0), Loyalty => 100,
HomeBase => Random_Base,
Faction => New_Game_Settings.Player_Faction));
end Add_Player_Block;
Assign_Cabin_Block :
declare
Cabin_Assigned: Boolean := False;
begin
Player_Ship_Modules_Loop :
for Module of Player_Ship.Modules loop
Module_Owner_Loop :
for Owner of Module.Owner loop
if Owner > 0 then
Owner := Owner + 1;
end if;
end loop Module_Owner_Loop;
if Modules_List(Module.Proto_Index).MType = CABIN and
not Cabin_Assigned then
Assign_Cabin_Loop :
for I in Module.Owner.Iterate loop
if Module.Owner(I) = 0 then
Module.Owner(I) := 1;
if Natural_Container.To_Index(Position => I) = 1 then
Module.Name :=
New_Game_Settings.Player_Name &
To_Unbounded_String(Source => "'s Cabin");
end if;
Cabin_Assigned := True;
exit Assign_Cabin_Loop;
end if;
end loop Assign_Cabin_Loop;
end if;
end loop Player_Ship_Modules_Loop;
end Assign_Cabin_Block;
-- Set current map field/sky base info
Sky_Bases(Random_Base).Visited := Game_Date;
Sky_Bases(Random_Base).Known := True;
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).Visited := True;
Generate_Recruits;
GenerateMissions;
Generate_Cargo;
-- Set player goal if not set yet
if CurrentGoal.GType = RANDOM then
CurrentGoal :=
Goals_List
(Get_Random
(Min => Goals_List.First_Index, Max => Goals_List.Last_Index));
end if;
-- Set name of savegame
Generate_Save_Name;
-- Set player career
Player_Career := New_Game_Settings.Player_Career;
-- Add welcoming message
AddMessage
(Message =>
"Welcome to Steam Sky. If it is your first game, please consider read help (entry 'Help' in Menu), especially topic 'First Steps'.",
MType => OtherMessage);
end New_Game;
procedure Update_Game(Minutes: Positive; In_Combat: Boolean := False) is
use Bases.Ship;
use Ships.Crew;
use Ships.Upgrade;
Added_Hours, Added_Minutes: Natural := 0;
Base_Index: constant Extended_Base_Range :=
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).BaseIndex;
Tired_Points: Natural := 0;
Need_Cleaning: Boolean := False;
begin
Tired_Points_Loop :
for I in 1 .. Minutes loop
if (Game_Date.Minutes + I) rem 15 = 0 then
Tired_Points := Tired_Points + 1;
end if;
end loop Tired_Points_Loop;
-- Update game time
Added_Minutes := Minutes rem 60;
Added_Hours := Minutes / 60;
Game_Date.Minutes := Game_Date.Minutes + Added_Minutes;
if Game_Date.Minutes > 59 then
Game_Date.Minutes := Game_Date.Minutes - 60;
Game_Date.Hour := Game_Date.Hour + 1;
end if;
Game_Date.Hour := Game_Date.Hour + Added_Hours;
if Game_Date.Hour > 23 then
Game_Date.Hour := Game_Date.Hour - 24;
Game_Date.Day := Game_Date.Day + 1;
Get_Dirty_Loop :
for Module of Player_Ship.Modules loop
if Module.M_Type = CABIN and then Module.Cleanliness > 0 then
Module.Cleanliness := Module.Cleanliness - 1;
Need_Cleaning := True;
end if;
end loop Get_Dirty_Loop;
if Need_Cleaning then
UpdateOrders(Ship => Player_Ship);
end if;
if Player_Ship.Speed = DOCKED then
Pay_For_Dock;
end if;
DailyPayment;
if Game_Settings.Auto_Save = DAILY then
Save_Game;
end if;
end if;
if Game_Date.Day > 30 then
Game_Date.Day := 1;
Game_Date.Month := Game_Date.Month + 1;
if Game_Settings.Auto_Save = MONTHLY then
Save_Game;
end if;
end if;
if Game_Date.Month > 12 then
Game_Date.Month := 1;
Game_Date.Year := Game_Date.Year + 1;
if Game_Settings.Auto_Save = YEARLY then
Save_Game;
end if;
end if;
-- Update crew
UpdateCrew
(Minutes => Minutes, TiredPoints => Tired_Points,
InCombat => In_Combat);
-- Repair ship (if needed)
Ships.Repairs.RepairShip(Minutes => Minutes);
-- Craft items
Manufacturing(Minutes => Minutes);
-- Upgrade ship module
UpgradeShip(Minutes => Minutes);
-- Update base
if Base_Index > 0 then
if Sky_Bases(Base_Index).Visited.Year = 0 then
GameStats.BasesVisited := GameStats.BasesVisited + 1;
GameStats.Points := GameStats.Points + 1;
UpdateGoal
(GType => VISIT, TargetIndex => Sky_Bases(Base_Index).Owner);
end if;
Sky_Bases(Base_Index).Visited := Game_Date;
if not Sky_Bases(Base_Index).Known then
Sky_Bases(Base_Index).Known := True;
AddMessage
(Message =>
"You discovered base " &
To_String(Source => Sky_Bases(Base_Index).Name) & ".",
MType => OtherMessage);
end if;
Update_Population;
Generate_Recruits;
GenerateMissions;
Generate_Cargo;
Update_Prices;
UpdateOrders(Ship => Player_Ship);
end if;
-- Update map cell
if not SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).Visited then
GameStats.MapVisited := GameStats.MapVisited + 1;
GameStats.Points := GameStats.Points + 1;
UpdateGoal(GType => DISCOVER, TargetIndex => Null_Unbounded_String);
SkyMap(Player_Ship.Sky_X, Player_Ship.Sky_Y).Visited := True;
end if;
-- Update events
UpdateEvents(Minutes => Minutes);
-- Update accepted missions
UpdateMissions(Minutes => Minutes);
end Update_Game;
procedure End_Game(Save: Boolean) is
begin
if Save then
Save_Game;
else
Delete_Save_Block :
begin
Delete_File(Name => To_String(Source => Save_Name));
exception
when Name_Error =>
null;
end Delete_Save_Block;
end if;
ClearMessages;
Events_List.Clear;
ClearGameStats;
Known_Recipes.Clear;
ClearCurrentGoal;
AcceptedMissions.Clear;
Save_Config;
end End_Game;
function Find_Skill_Index(Skill_Name: String) return Natural is
use Tiny_String;
begin
Find_Skill_Loop :
for I in 1 .. Skills_Amount loop
if To_String
(Source =>
SkillsData_Container.Element
(Container => Skills_List, Index => I)
.Name) =
Skill_Name then
return I;
end if;
end loop Find_Skill_Loop;
return 0;
end Find_Skill_Index;
function Load_Game_Data return String is
use Ada.Exceptions;
use Log;
--## rule off TYPE_INITIAL_VALUES
type Data_Type_Record is record
Name: Unbounded_String;
File_Name: Unbounded_String;
end record;
--## rule on TYPE_INITIAL_VALUES
Data_Types: constant array(1 .. 12) of Data_Type_Record :=
(1 =>
(Name => To_Unbounded_String(Source => "data"),
File_Name => To_Unbounded_String(Source => "game.dat")),
2 =>
(Name => To_Unbounded_String(Source => "items"),
File_Name => To_Unbounded_String(Source => "items.dat")),
3 =>
(Name => To_Unbounded_String(Source => "help"),
File_Name => To_Unbounded_String(Source => "help.dat")),
4 =>
(Name => To_Unbounded_String(Source => "modules"),
File_Name => To_Unbounded_String(Source => "shipmodules.dat")),
5 =>
(Name => To_Unbounded_String(Source => "recipes"),
File_Name => To_Unbounded_String(Source => "recipes.dat")),
6 =>
(Name => To_Unbounded_String(Source => "bases"),
File_Name => To_Unbounded_String(Source => "bases.dat")),
7 =>
(Name => To_Unbounded_String(Source => "mobiles"),
File_Name => To_Unbounded_String(Source => "mobs.dat")),
8 =>
(Name => To_Unbounded_String(Source => "careers"),
File_Name => To_Unbounded_String(Source => "careers.dat")),
9 =>
(Name => To_Unbounded_String(Source => "factions"),
File_Name => To_Unbounded_String(Source => "factions.dat")),
10 =>
(Name => To_Unbounded_String(Source => "ships"),
File_Name => To_Unbounded_String(Source => "ships.dat")),
11 =>
(Name => To_Unbounded_String(Source => "goals"),
File_Name => To_Unbounded_String(Source => "goals.dat")),
12 =>
(Name => To_Unbounded_String(Source => "stories"),
File_Name => To_Unbounded_String(Source => "stories.dat")));
Mods_Directories: Search_Type;
Found_Directory: Directory_Entry_Type;
procedure Load_Selected_Data(Data_Name, File_Name: String) is
use Input_Sources.File;
Files: Search_Type;
Found_File: Directory_Entry_Type;
Data_File: File_Input;
Local_File_Name: Unbounded_String := Null_Unbounded_String;
procedure Load_Data_File(Local_Data_Name: String) is
use DOM.Core.Documents;
use DOM.Core.Nodes;
use DOM.Readers;
use BasesTypes;
use Careers;
use Help;
use Stories;
Data_Type: Unbounded_String;
Reader: Tree_Reader; --## rule line off IMPROPER_INITIALIZATION
procedure Load_Data(Current_Reader: Tree_Reader) is
use DOM.Core;
use DOM.Core.Elements;
use Short_String;
use Tiny_String;
Game_Data: Document;
Nodes_List, Child_Nodes: Node_List;
Delete_Index: Natural := 0;
Node_Name: Unbounded_String := Null_Unbounded_String;
Data_Node: Node;
function Find_Attribute_Index
(Attribute_Name: Tiny_String.Bounded_String) return Natural is
begin
Find_Attribute_Loop :
for J in
AttributesData_Container.First_Index
(Container => Attributes_List) ..
AttributesData_Container.Last_Index
(Container => Attributes_List) loop
if AttributesData_Container.Element
(Container => Attributes_List, Index => J)
.Name =
Attribute_Name then
return Natural(J);
end if;
end loop Find_Attribute_Loop;
return 0;
end Find_Attribute_Index;
begin
Game_Data := Get_Tree(Read => Current_Reader);
Nodes_List :=
DOM.Core.Nodes.Child_Nodes(N => First_Child(N => Game_Data));
Child_Nodes := Nodes_List;
Load_Game_Data_Loop :
for I in 0 .. Length(List => Nodes_List) - 1 loop
Data_Node := Item(List => Nodes_List, Index => I);
Node_Name :=
To_Unbounded_String
(Source => DOM.Core.Nodes.Node_Name(N => Data_Node));
if To_String(Source => Node_Name) = "basessyllablepre" then
Base_Syllables_Pre.Append
(New_Item =>
To_Unbounded_String
(Source =>
Get_Attribute
(Elem => Data_Node, Name => "value")));
elsif To_String(Source => Node_Name) =
"basessyllablestart" then
Base_Syllables_Start.Append
(New_Item =>
To_Unbounded_String
(Source =>
Get_Attribute
(Elem => Data_Node, Name => "value")));
elsif To_String(Source => Node_Name) =
"basessyllableend" then
Base_Syllables_End.Append
(New_Item =>
To_Unbounded_String
(Source =>
Get_Attribute
(Elem => Data_Node, Name => "value")));
elsif To_String(Source => Node_Name) =
"basessyllablepost" then
Base_Syllables_Post.Append
(New_Item =>
To_Unbounded_String
(Source =>
Get_Attribute
(Elem => Data_Node, Name => "value")));
elsif To_String(Source => Node_Name) =
"malessyllablestart" then
MaleSyllablesStart.Append
(New_Item =>
To_Unbounded_String
(Source =>
Get_Attribute
(Elem => Data_Node, Name => "value")));
elsif To_String(Source => Node_Name) =
"malessyllablemiddle" then
MaleSyllablesMiddle.Append
(New_Item =>
To_Unbounded_String
(Source =>
Get_Attribute
(Elem => Data_Node, Name => "value")));
elsif To_String(Source => Node_Name) =
"malessyllableend" then
MaleSyllablesEnd.Append
(New_Item =>
To_Unbounded_String
(Source =>
Get_Attribute
(Elem => Data_Node, Name => "value")));
elsif To_String(Source => Node_Name) = "malesvocal" then
MaleVocals.Append
(New_Item =>
To_Unbounded_String
(Source =>
Get_Attribute
(Elem => Data_Node, Name => "value")));
elsif To_String(Source => Node_Name) = "malesconsonant" then
MaleConsonants.Append
(New_Item =>
To_Unbounded_String
(Source =>
Get_Attribute
(Elem => Data_Node, Name => "value")));
elsif To_String(Source => Node_Name) =
"femalessyllablestart" then
FemaleSyllablesStart.Append
(New_Item =>
To_Unbounded_String
(Source =>
Get_Attribute
(Elem => Data_Node, Name => "value")));
elsif To_String(Source => Node_Name) =
"femalessyllablemiddle" then
FemaleSyllablesMiddle.Append
(New_Item =>
To_Unbounded_String
(Source =>
Get_Attribute
(Elem => Data_Node, Name => "value")));
elsif To_String(Source => Node_Name) =
"femalessyllableend" then
FemaleSyllablesEnd.Append
(New_Item =>
To_Unbounded_String
(Source =>
Get_Attribute
(Elem => Data_Node, Name => "value")));
elsif To_String(Source => Node_Name) = "femalesvocal" then
FemaleVocals.Append
(New_Item =>
To_Unbounded_String
(Source =>
Get_Attribute
(Elem => Data_Node, Name => "value")));
elsif To_String(Source => Node_Name) =
"shipssyllablestart" then
Ship_Syllables_Start.Append
(New_Item =>
To_Unbounded_String
(Source =>
Get_Attribute
(Elem => Data_Node, Name => "value")));
elsif To_String(Source => Node_Name) =
"shipssyllablemiddle" then
Ship_Syllables_Middle.Append
(New_Item =>
To_Unbounded_String
(Source =>
Get_Attribute
(Elem => Data_Node, Name => "value")));
elsif To_String(Source => Node_Name) =
"shipssyllableend" then
Ship_Syllables_End.Append
(New_Item =>
To_Unbounded_String
(Source =>
Get_Attribute
(Elem => Data_Node, Name => "value")));
elsif To_String(Source => Node_Name) = "itemtype" then
Items_Types.Append
(New_Item =>
To_Unbounded_String
(Source =>
Get_Attribute
(Elem => Data_Node, Name => "value")));
elsif To_String(Source => Node_Name) = "repairtools" then
Repair_Tools :=
To_Unbounded_String
(Source =>
Get_Attribute(Elem => Data_Node, Name => "value"));
elsif To_String(Source => Node_Name) = "cleaningtools" then
Cleaning_Tools :=
To_Unbounded_String
(Source =>
Get_Attribute(Elem => Data_Node, Name => "value"));
elsif To_String(Source => Node_Name) = "alchemytools" then
Alchemy_Tools :=
To_Unbounded_String
(Source =>
Get_Attribute(Elem => Data_Node, Name => "value"));
elsif To_String(Source => Node_Name) = "corpseindex" then
Corpse_Index :=
To_Unbounded_String
(Source =>
Get_Attribute(Elem => Data_Node, Name => "value"));
elsif To_String(Source => Node_Name) =
"missionitemstype" then
Mission_Items_Type :=
To_Unbounded_String
(Source =>
Get_Attribute(Elem => Data_Node, Name => "value"));
elsif To_String(Source => Node_Name) = "fueltype" then
Fuel_Type :=
To_Unbounded_String
(Source =>
Get_Attribute(Elem => Data_Node, Name => "value"));
elsif To_String(Source => Node_Name) = "moneyindex" then
Money_Index :=
To_Unbounded_String
(Source =>
Get_Attribute(Elem => Data_Node, Name => "value"));
elsif To_String(Source => Node_Name) = "tradersname" then
Traders_Name :=
To_Unbounded_String
(Source =>
Get_Attribute(Elem => Data_Node, Name => "value"));
elsif To_String(Source => Node_Name) = "attribute" then
AttributesData_Container.Append
(Container => Attributes_List,
New_Item =>
(Name =>
To_Bounded_String
(Source =>
Get_Attribute
(Elem => Data_Node, Name => "name")),
Description =>
To_Bounded_String
(Source =>
Node_Value
(N => First_Child(N => Data_Node)))));
Attributes_Amount := Attributes_Amount + 1;
elsif To_String(Source => Node_Name) = "skill" then
Child_Nodes :=
DOM.Core.Elements.Get_Elements_By_Tag_Name
(Elem => Data_Node, Name => "toolquality");
Load_Skill_Block :
declare
Tools_Quality: Tool_Quality_Array
(1 ..
(if Length(List => Child_Nodes) > 0 then
Length(List => Child_Nodes)
else 1)) :=
(others => <>);
Tmp_Skill: Skill_Record
(Quality_Amount => Tools_Quality'Length) :=
(Quality_Amount => Tools_Quality'Length,
others => <>);
begin
Load_Skills_Loop :
for J in 0 .. Length(List => Child_Nodes) - 1 loop
Tools_Quality(J + 1) :=
(Level =>
Skill_Range'Value
(Get_Attribute
(Elem =>
Item(List => Child_Nodes, Index => J),
Name => "level")),
Quality =>
Skill_Range'Value
(Get_Attribute
(Elem =>
Item(List => Child_Nodes, Index => J),
Name => "quality")));
end loop Load_Skills_Loop;
if Length(List => Child_Nodes) = 0 then
Tools_Quality := Empty_Tool_Quality_Array;
end if;
Tmp_Skill :=
(Quality_Amount => Tools_Quality'Length,
Name =>
To_Bounded_String
(Source =>
Get_Attribute
(Elem => Data_Node, Name => "name")),
Attribute =>
Find_Attribute_Index
(Attribute_Name =>
To_Bounded_String
(Source =>
Get_Attribute
(Elem => Data_Node,
Name => "attribute"))),
Description => Short_String.Null_Bounded_String,
Tool => Tiny_String.Null_Bounded_String,
Tools_Quality => Tools_Quality);
Child_Nodes :=
DOM.Core.Elements.Get_Elements_By_Tag_Name
(Elem => Data_Node, Name => "description");
if Length(List => Child_Nodes) > 0 then
Tmp_Skill.Description :=
To_Bounded_String
(Source =>
Node_Value
(N =>
First_Child
(N =>
Item
(List => Child_Nodes,
Index => 0))));
end if;
if Get_Attribute(Elem => Data_Node, Name => "tool") /=
"" then
Tmp_Skill.Tool :=
To_Bounded_String
(Source =>
Get_Attribute
(Elem => Data_Node, Name => "tool"));
end if;
SkillsData_Container.Append
(Container => Skills_List, New_Item => Tmp_Skill);
Skills_Amount := Skills_Amount + 1;
end Load_Skill_Block;
elsif To_String(Source => Node_Name) = "conditionname" then
Condition_Index :=
Find_Attribute_Index
(Attribute_Name =>
To_Bounded_String
(Source =>
Get_Attribute
(Elem => Data_Node, Name => "value")));
elsif To_String(Source => Node_Name) = "strengthname" then
Strength_Index :=
Find_Attribute_Index
(Attribute_Name =>
To_Bounded_String
(Source =>
Get_Attribute
(Elem => Data_Node, Name => "value")));
elsif To_String(Source => Node_Name) = "pilotingskill" then
Piloting_Skill :=
Find_Skill_Index
(Skill_Name =>
Get_Attribute(Elem => Data_Node, Name => "value"));
elsif To_String(Source => Node_Name) =
"engineeringskill" then
Engineering_Skill :=
Find_Skill_Index
(Skill_Name =>
Get_Attribute(Elem => Data_Node, Name => "value"));
elsif To_String(Source => Node_Name) = "gunneryskill" then
Gunnery_Skill :=
Find_Skill_Index
(Skill_Name =>
Get_Attribute(Elem => Data_Node, Name => "value"));
elsif To_String(Source => Node_Name) = "talkingskill" then
Talking_Skill :=
Find_Skill_Index
(Skill_Name =>
Get_Attribute(Elem => Data_Node, Name => "value"));
elsif To_String(Source => Node_Name) = "perceptionskill" then
Perception_Skill :=
Find_Skill_Index
(Skill_Name =>
Get_Attribute(Elem => Data_Node, Name => "value"));
elsif To_String(Source => Node_Name) = "headarmor" then
Head_Armor :=
To_Unbounded_String
(Source =>
Get_Attribute(Elem => Data_Node, Name => "value"));
elsif To_String(Source => Node_Name) = "chestarmor" then
Chest_Armor :=
To_Unbounded_String
(Source =>
Get_Attribute(Elem => Data_Node, Name => "value"));
elsif To_String(Source => Node_Name) = "armsarmor" then
Arms_Armor :=
To_Unbounded_String
(Source =>
Get_Attribute(Elem => Data_Node, Name => "value"));
elsif To_String(Source => Node_Name) = "legsarmor" then
Legs_Armor :=
To_Unbounded_String
(Source =>
Get_Attribute(Elem => Data_Node, Name => "value"));
elsif To_String(Source => Node_Name) = "shieldtype" then
Shield_Type :=
To_Unbounded_String
(Source =>
Get_Attribute(Elem => Data_Node, Name => "value"));
elsif To_String(Source => Node_Name) = "weapontype" then
Weapon_Type :=
To_Unbounded_String
(Source =>
Get_Attribute(Elem => Data_Node, Name => "value"));
elsif To_String(Source => Node_Name) = "dodgeskill" then
Dodge_Skill :=
Find_Skill_Index
(Skill_Name =>
Get_Attribute(Elem => Data_Node, Name => "value"));
elsif To_String(Source => Node_Name) = "unarmedskill" then
Unarmed_Skill :=
Find_Skill_Index
(Skill_Name =>
Get_Attribute(Elem => Data_Node, Name => "value"));
elsif To_String(Source => Node_Name) = "remove" then
if Get_Attribute(Elem => Data_Node, Name => "name") =
"skill" then
Delete_Index :=
Find_Skill_Index
(Skill_Name =>
Get_Attribute
(Elem => Data_Node, Name => "value"));
if Delete_Index > 0 then
SkillsData_Container.Delete
(Container => Skills_List, Index => Delete_Index);
end if;
elsif Get_Attribute(Elem => Data_Node, Name => "name") =
"attribute" then
Delete_Index :=
Find_Attribute_Index
(Attribute_Name =>
To_Bounded_String
(Source =>
Get_Attribute
(Elem => Data_Node, Name => "value")));
if Delete_Index > 0 then
AttributesData_Container.Delete
(Container => Attributes_List,
Index => Delete_Index);
end if;
elsif Get_Attribute(Elem => Data_Node, Name => "name") =
"itemtype" then
Delete_Index := 0;
Load_Item_Types_Loop :
for J in
Items_Types.First_Index ..
Items_Types.Last_Index loop
if Items_Types(J) =
To_Unbounded_String
(Source =>
Get_Attribute
(Elem => Data_Node, Name => "value")) then
Delete_Index := J;
exit Load_Item_Types_Loop;
end if;
end loop Load_Item_Types_Loop;
if Delete_Index > 0 then
Items_Types.Delete(Index => Delete_Index);
end if;
end if;
end if;
end loop Load_Game_Data_Loop;
end Load_Data;
begin
--## rule off IMPROPER_INITIALIZATION
Parse(Parser => Reader, Input => Data_File);
Data_Type :=
To_Unbounded_String
(Source =>
Node_Name
(N => Get_Element(Doc => Get_Tree(Read => Reader))));
--## rule on IMPROPER_INITIALIZATION
if Data_Type = To_Unbounded_String(Source => Local_Data_Name) or
Local_Data_Name = "" then
Log_Message
(Message =>
"Loading " & To_String(Source => Data_Type) & " file: " &
To_String(Source => Local_File_Name),
Message_Type => EVERYTHING);
if To_String(Source => Data_Type) = "factions" then
LoadFactions(Reader => Reader);
elsif To_String(Source => Data_Type) = "goals" then
LoadGoals(Reader => Reader);
elsif To_String(Source => Data_Type) = "help" then
LoadHelp(Reader => Reader);
elsif To_String(Source => Data_Type) = "items" then
LoadItems(Reader => Reader);
elsif To_String(Source => Data_Type) = "mobiles" then
LoadMobs(Reader => Reader);
elsif To_String(Source => Data_Type) = "recipes" then
LoadRecipes(Reader => Reader);
elsif To_String(Source => Data_Type) = "bases" then
Load_Bases_Types(Reader => Reader);
elsif To_String(Source => Data_Type) = "modules" then
LoadShipModules(Reader => Reader);
elsif To_String(Source => Data_Type) = "ships" then
Load_Ships(Reader => Reader);
elsif To_String(Source => Data_Type) = "stories" then
LoadStories(Reader => Reader);
elsif To_String(Source => Data_Type) = "data" then
Load_Data(Current_Reader => Reader);
elsif To_String(Source => Data_Type) = "careers" then
Load_Careers(Reader => Reader);
end if;
end if;
Free(Read => Reader); --## rule line off IMPROPER_INITIALIZATION
end Load_Data_File;
begin
if File_Name = "" then
Start_Search
(Search => Files, Directory => Data_Name, Pattern => "*.dat");
Load_Data_Files_Loop :
while More_Entries(Search => Files) loop
Get_Next_Entry(Search => Files, Directory_Entry => Found_File);
Open
(Filename => Full_Name(Directory_Entry => Found_File),
Input => Data_File);
Local_File_Name :=
To_Unbounded_String
(Source => Full_Name(Directory_Entry => Found_File));
Load_Data_File(Local_Data_Name => "");
Close(Input => Data_File);
end loop Load_Data_Files_Loop;
End_Search(Search => Files);
else
Open
(Filename => To_String(Source => Data_Directory) & File_Name,
Input => Data_File);
Local_File_Name := To_Unbounded_String(Source => File_Name);
Load_Data_File(Local_Data_Name => Data_Name);
Close(Input => Data_File);
end if;
end Load_Selected_Data;
begin
if Factions_List.Length > 0 then
return "";
end if;
-- Load standard game data
Load_Standard_Data_Loop :
for Data_Type of Data_Types loop
Load_Selected_Data
(Data_Name => To_String(Source => Data_Type.Name),
File_Name => To_String(Source => Data_Type.File_Name));
end loop Load_Standard_Data_Loop;
-- Load modifications
Start_Search
(Search => Mods_Directories,
Directory => To_String(Source => Mods_Directory), Pattern => "",
Filter => (Directory => True, others => False));
Load_Modifications_Loop :
while More_Entries(Search => Mods_Directories) loop
Get_Next_Entry
(Search => Mods_Directories, Directory_Entry => Found_Directory);
if Simple_Name(Directory_Entry => Found_Directory) not in "." |
".." then
Load_Selected_Data
(Data_Name => Full_Name(Directory_Entry => Found_Directory),
File_Name => "");
end if;
end loop Load_Modifications_Loop;
End_Search(Search => Mods_Directories);
SetToolsList;
return "";
exception
when An_Exception : others =>
Log_Message
(Message => Exception_Message(X => An_Exception),
Message_Type => EVERYTHING);
return Exception_Message(X => An_Exception);
end Load_Game_Data;
end Game;
| 44.713818 | 143 | 0.478321 |
8b1edccf18c4e9c3a34bc600484673a9b882e8a5 | 3,614 | ads | Ada | source/amf/uml/amf-uml-message_events-hash.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-uml-message_events-hash.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-uml-message_events-hash.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Elements.Generic_Hash;
function AMF.UML.Message_Events.Hash is
new AMF.Elements.Generic_Hash (UML_Message_Event, UML_Message_Event_Access);
| 72.28 | 78 | 0.402878 |
03b637e0da25b374af2c53e2b453bdba264ca40c | 7,483 | ads | Ada | llvm-gcc-4.2-2.9/gcc/ada/g-alvety.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 1 | 2016-04-09T02:58:13.000Z | 2016-04-09T02:58:13.000Z | llvm-gcc-4.2-2.9/gcc/ada/g-alvety.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/g-alvety.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T . A L T I V E C . V E C T O R _ T Y P E S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2004-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, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This unit exposes the various vector types part of the Ada binding to
-- Altivec facilities.
with GNAT.Altivec.Low_Level_Vectors;
package GNAT.Altivec.Vector_Types is
use GNAT.Altivec.Low_Level_Vectors;
---------------------------------------------------
-- Vector type declarations [PIM-2.1 Data Types] --
---------------------------------------------------
-- Except for assignments and pointer creation/dereference, operations
-- on vectors are only performed via subprograms. The vector types are
-- then private, and non-limited since assignments are allowed.
-- The Hard/Soft binding type-structure differentiation is achieved in
-- Low_Level_Vectors. Each version only exposes private vector types, that
-- we just sub-type here. This is fine from the design standpoint and
-- reduces the amount of explicit conversion required in various places
-- internally.
subtype vector_unsigned_char is Low_Level_Vectors.LL_VUC;
subtype vector_signed_char is Low_Level_Vectors.LL_VSC;
subtype vector_bool_char is Low_Level_Vectors.LL_VBC;
subtype vector_unsigned_short is Low_Level_Vectors.LL_VUS;
subtype vector_signed_short is Low_Level_Vectors.LL_VSS;
subtype vector_bool_short is Low_Level_Vectors.LL_VBS;
subtype vector_unsigned_int is Low_Level_Vectors.LL_VUI;
subtype vector_signed_int is Low_Level_Vectors.LL_VSI;
subtype vector_bool_int is Low_Level_Vectors.LL_VBI;
subtype vector_float is Low_Level_Vectors.LL_VF;
subtype vector_pixel is Low_Level_Vectors.LL_VP;
-- [PIM-2.1] shows groups of declarations with exact same component types,
-- e.g. vector unsigned short together with vector unsigned short int. It
-- so appears tempting to define subtypes for those matches here.
--
-- [PIM-2.1] does not qualify items in those groups as "the same types",
-- though, and [PIM-2.4.2 Assignments] reads: "if either the left hand
-- side or the right hand side of an expression has a vector type, then
-- both sides of the expression must be of the same vector type".
--
-- Not so clear what is exactly right, then. We go with subtypes for now
-- and can adjust later if need be.
subtype vector_unsigned_short_int is vector_unsigned_short;
subtype vector_signed_short_int is vector_signed_short;
subtype vector_char is vector_signed_char;
subtype vector_short is vector_signed_short;
subtype vector_int is vector_signed_int;
--------------------------------
-- Corresponding access types --
--------------------------------
type vector_unsigned_char_ptr is access all vector_unsigned_char;
type vector_signed_char_ptr is access all vector_signed_char;
type vector_bool_char_ptr is access all vector_bool_char;
type vector_unsigned_short_ptr is access all vector_unsigned_short;
type vector_signed_short_ptr is access all vector_signed_short;
type vector_bool_short_ptr is access all vector_bool_short;
type vector_unsigned_int_ptr is access all vector_unsigned_int;
type vector_signed_int_ptr is access all vector_signed_int;
type vector_bool_int_ptr is access all vector_bool_int;
type vector_float_ptr is access all vector_float;
type vector_pixel_ptr is access all vector_pixel;
--------------------------------------------------------------------
-- Additional access types, for the sake of some argument passing --
--------------------------------------------------------------------
-- ... because some of the operations expect pointers to possibly
-- constant objects.
type const_vector_bool_char_ptr is access constant vector_bool_char;
type const_vector_signed_char_ptr is access constant vector_signed_char;
type const_vector_unsigned_char_ptr is access constant vector_unsigned_char;
type const_vector_bool_short_ptr is access constant vector_bool_short;
type const_vector_signed_short_ptr is access constant vector_signed_short;
type const_vector_unsigned_short_ptr is access
constant vector_unsigned_short;
type const_vector_bool_int_ptr is access constant vector_bool_int;
type const_vector_signed_int_ptr is access constant vector_signed_int;
type const_vector_unsigned_int_ptr is access constant vector_unsigned_int;
type const_vector_float_ptr is access constant vector_float;
type const_vector_pixel_ptr is access constant vector_pixel;
----------------------
-- Useful shortcuts --
----------------------
subtype VUC is vector_unsigned_char;
subtype VSC is vector_signed_char;
subtype VBC is vector_bool_char;
subtype VUS is vector_unsigned_short;
subtype VSS is vector_signed_short;
subtype VBS is vector_bool_short;
subtype VUI is vector_unsigned_int;
subtype VSI is vector_signed_int;
subtype VBI is vector_bool_int;
subtype VP is vector_pixel;
subtype VF is vector_float;
end GNAT.Altivec.Vector_Types;
| 48.908497 | 79 | 0.61927 |
3893c7c01b75dd0ca4ec94102f19fb0996ae90c3 | 10,624 | adb | Ada | support/support-strings.adb | leo-brewin/adm-bssn-numerical | 9e32c201272e9a41e7535475fe381e450b99b058 | [
"MIT"
] | 1 | 2022-01-25T11:36:06.000Z | 2022-01-25T11:36:06.000Z | support/support-strings.adb | leo-brewin/adm-bssn-numerical | 9e32c201272e9a41e7535475fe381e450b99b058 | [
"MIT"
] | null | null | null | support/support-strings.adb | leo-brewin/adm-bssn-numerical | 9e32c201272e9a41e7535475fe381e450b99b058 | [
"MIT"
] | null | null | null | with Ada.Text_IO; use Ada.Text_IO;
with Ada.Strings; use Ada.Strings;
with Ada.Strings.Fixed; use Ada.Strings.Fixed;
with Ada.Characters.Handling;
-- with Ada.Characters.Latin_1;
package body Support.Strings is
package Real_IO is new Ada.Text_IO.Float_IO (Real); use Real_IO;
package Integer_IO is new Ada.Text_IO.Integer_IO (Integer); use Integer_IO;
function str (source : Real;
width : Integer := 10) return string
is
result : string (1..width) := (others => Ada.Characters.Latin_1.NUL);
begin
-- 4932 = largest exponent for 18 dec. digits
-- so may need up to 4 digits in the exponent + 1 for the sign = 5
if source = 0.0 then
Put (result,source,width-7,3);
elsif abs (source) < 1.0 then
if abs (source) >= 1.0e-99 then
Put (result,source,width-7,3);
elsif abs (source) >= 1.0e-999 then
Put (result,source,width-8,4);
else
Put (result,source,width-9,5);
end if;
else
if abs (source) < 1.0e100 then
Put (result,source,width-7,3);
elsif abs (source) < 1.0e1000 then
Put (result,source,width-8,4);
else
Put (result,source,width-9,5);
end if;
end if;
return result;
end str;
function str (source : Integer;
width : Integer := 0) return string
is
result : string (1..width) := (others => Ada.Characters.Latin_1.NUL);
wide_result : string (1..Integer'width) := (others => Ada.Characters.Latin_1.NUL);
begin
if width = 0 then
Put (wide_result,source);
return trim(wide_result,left); -- flush left, returns a string just large enough to contain the integer
else
Put (result,source);
return result;
end if;
end str;
function str (source : string;
width : integer;
pad : Character := Ada.Characters.Latin_1.NUL) return string
is
len_src : integer;
tmp_out : string (1..width) := (others => pad);
tmp_src : string := cut (source);
begin
len_src := get_strlen (tmp_src);
if len_src <= width then -- source fits in the window
tmp_out (1..len_src) := tmp_src (tmp_src'first..tmp_src'first+len_src-1);
return tmp_out;
else -- source too wide for the window
return tmp_src (tmp_src'first..tmp_src'first+width-1);
end if;
end str;
function str (source : character;
width : integer := 1) return string
is
tmp_str : String (1..width) := (others => Ada.Characters.Latin_1.NUL);
begin
tmp_str (1) := source;
return tmp_str;
end str;
function str (source : in string) return string is
begin
return cut(source); -- return the leading part of the string, trailing null's are tiresome
end str;
function fill_str (the_num : Integer; -- the number to print
width : Integer; -- width of the printed number
fill_chr : Character := ' ') -- the fill character
return String
is
the_str : String (1 .. width);
begin
writestr (the_str, str (the_num, width));
for i in 1 .. width loop
if the_str (i) = ' '
then the_str (i) := fill_chr;
else exit;
end if;
end loop;
return the_str;
end fill_str;
function spc (width : integer) return string is
spaces : constant string (1..width) := (others => ' ');
begin
return spaces;
end spc;
function cut (the_line : string) return string is
result : constant string := the_line;
begin
return result(result'first..result'first+get_strlen(result)-1);
end cut;
procedure null_string (source : in out string) is
begin
source := (others => Ada.Characters.Latin_1.NUL);
end null_string;
function get_strlen (source : in string) return integer is
length : Integer := 0;
begin
for i in source'range loop
exit when source(i) = Ada.Characters.Latin_1.NUL;
length := i-source'first+1;
end loop;
return length;
end get_strlen;
procedure set_strlen (source : in out string;
length : integer) is
begin
for i in source'first+length..source'last loop
source(i) := Ada.Characters.Latin_1.NUL;
end loop;
end set_strlen;
function make_str (n : Integer; m : Integer) return String is
the_str : String (1 .. m);
begin
writestr (the_str, str (n, m));
for i in 1 .. m loop
if the_str (i) = ' ' then
the_str (i) := '0';
end if;
end loop;
return the_str;
end make_str;
procedure readstr (source : string;
target : out integer) is
last : integer;
begin
get (source,target,last);
end readstr;
procedure readstr (source : string;
target : out real) is
last : integer;
begin
get (source,target,last);
end readstr;
procedure writestr (target : out string;
source : integer) is
begin
put (target,source);
end writestr;
procedure writestr (target : out string;
source : real) is
begin
put (target,source);
end writestr;
procedure writestr (target : out string;
source : string) is
len_substr : Integer;
len_source : Integer;
len_target : Integer;
beg_source : Integer;
end_source : Integer;
beg_target : Integer;
end_target : Integer;
begin
null_string (target);
len_source := get_strlen (source); -- source length minus trailing null chars
len_target := target'length; -- target lenght, maximum lenght of final string
len_substr := min (len_source,len_target);
beg_source := source'first;
end_source := source'first+len_substr-1;
beg_target := target'first;
end_target := target'first+len_substr-1;
target (beg_target..end_target) := source (beg_source..end_source);
end writestr;
function centre (the_string : String;
the_length : Integer;
the_offset : Integer := 0) return String is
the_string_length : Integer;
the_result : String := spc(the_length);
start, finish : Integer;
left_space, right_space : Integer;
begin
the_string_length := get_strlen (the_string);
left_space := max (0,(the_length-the_string_length)/2);
right_space := max (0,the_length - left_space - the_string_length);
left_space := max (0,min(left_space+the_offset,the_length-the_string_length));
right_space := max (0,min(right_space-the_offset,the_length-the_string_length));
start := max (1,min(the_length,left_space+1));
finish := max (1,min(the_length,the_length-right_space));
for i in start..finish loop
the_result (i) := the_string (i-start+1);
end loop;
return the_result;
end centre;
------------------------------------------------------------------------------
-- LCB: my code is faster than the Ada.Strings.Fixed.Trim code
-- see the examples in tests/strings/lcb02.adb
------------------------------------------------------------------------------
procedure trim_head (the_string : in out String) is
j : Integer;
found : Boolean;
the_string_len : Integer;
the_beg, the_end : Integer;
tmp_string : String := the_string;
begin
-- delete leading whitespace
found := False;
the_string_len := get_strlen(the_string);
the_beg := the_string'first;
the_end := the_beg + the_string_len-1;
for i in the_beg .. the_end loop
if the_string (i) /= ' ' then
j := i;
found := True;
exit;
end if;
end loop;
if found
then writestr (tmp_string,the_string(j..the_end)); -- the_string has non-empty content
else null_string (tmp_string); -- the_string consists entirely of white space
end if;
the_string := tmp_string;
-- writestr(the_string,Ada.Strings.Fixed.trim (cut(the_string),left));
end trim_head;
procedure trim_tail (the_string : in out String) is
j : Integer;
found : Boolean;
the_string_len : Integer;
the_beg, the_end : Integer;
tmp_string : String := the_string;
begin
-- delete trailing whitespace
found := False;
null_string (tmp_string);
the_string_len := get_strlen(the_string);
the_beg := the_string'first;
the_end := the_beg + the_string_len-1;
for i in reverse the_beg .. the_end loop
if the_string (i) /= ' ' then
j := i;
found := True;
exit;
end if;
end loop;
if found
then set_strlen (the_string,j); -- the_string has non-empty content
else null_string (the_string); -- the_string consists entirely of white space
end if;
-- writestr(the_string,Ada.Strings.Fixed.trim (cut(the_string),right));
end trim_tail;
function trim_head (the_string : String) return String is
tmp_string : String := the_string;
begin
trim_head (tmp_string);
return cut (tmp_string);
end trim_head;
function trim_tail (the_string : String) return String is
tmp_string : String := the_string;
begin
trim_tail (tmp_string);
return cut (tmp_string);
end trim_tail;
procedure trim (the_string : in out String) is
begin
trim_head (the_string);
trim_tail (the_string);
-- writestr(the_string,Ada.Strings.Fixed.trim (cut(the_string),both));
end trim;
function trim (the_string : String) return String is
tmp_string : String := the_string;
begin
trim (tmp_string);
return cut (tmp_string);
end trim;
function lower_case (source : String) return String is
begin
return Ada.Characters.Handling.To_Lower (source);
end lower_case;
function upper_case (source : String) return String is
begin
return Ada.Characters.Handling.To_Upper (source);
end upper_case;
end Support.Strings;
| 31.525223 | 113 | 0.577748 |
5ea72bdd71b0d9eaf5ac8f01ecc97c2e74d24542 | 70,728 | adb | Ada | src/usb.adb | persan/a-libusb1 | 51a3cad19df1ed2ce90ad078d55c36d4c7bcfd11 | [
"BSD-3-Clause"
] | null | null | null | src/usb.adb | persan/a-libusb1 | 51a3cad19df1ed2ce90ad078d55c36d4c7bcfd11 | [
"BSD-3-Clause"
] | null | null | null | src/usb.adb | persan/a-libusb1 | 51a3cad19df1ed2ce90ad078d55c36d4c7bcfd11 | [
"BSD-3-Clause"
] | null | null | null | pragma Ada_2012;
with GNAT.Calendar;
package body USB is
package Libusb_1_0_Libusb_H is
function Libusb_Init (Ctx : System.Address) return Int; -- /usr/include/libusb-1.0/libusb.h:1306
pragma Import (C, Libusb_Init, "libusb_init");
procedure Libusb_Exit (Ctx : System.Address); -- /usr/include/libusb-1.0/libusb.h:1307
pragma Import (C, Libusb_Exit, "libusb_exit");
procedure Libusb_Set_Debug (Ctx : System.Address; Level : Int); -- /usr/include/libusb-1.0/libusb.h:1308
pragma Import (C, Libusb_Set_Debug, "libusb_set_debug");
function Libusb_Get_Version return access constant Version; -- /usr/include/libusb-1.0/libusb.h:1309
pragma Import (C, Libusb_Get_Version, "libusb_get_version");
function Libusb_Has_Capability (Capability : Interfaces.Unsigned_32) return Int; -- /usr/include/libusb-1.0/libusb.h:1310
pragma Import (C, Libusb_Has_Capability, "libusb_has_capability");
function Libusb_Error_Name (Errcode : Int) return Interfaces.C.Strings.Chars_Ptr; -- /usr/include/libusb-1.0/libusb.h:1311
pragma Import (C, Libusb_Error_Name, "libusb_error_name");
function Libusb_Setlocale (Locale : Interfaces.C.Strings.Chars_Ptr) return Int; -- /usr/include/libusb-1.0/libusb.h:1312
pragma Import (C, Libusb_Setlocale, "libusb_setlocale");
function Libusb_Strerror (Errcode : Error) return Interfaces.C.Strings.Chars_Ptr; -- /usr/include/libusb-1.0/libusb.h:1313
pragma Import (C, Libusb_Strerror, "libusb_strerror");
function Libusb_Get_Device_List (Ctx : System.Address; List : System.Address) return Size_T; -- /usr/include/libusb-1.0/libusb.h:1315
pragma Import (C, Libusb_Get_Device_List, "libusb_get_device_list");
procedure Libusb_Free_Device_List (List : System.Address; Unref_Devices : Int); -- /usr/include/libusb-1.0/libusb.h:1317
pragma Import (C, Libusb_Free_Device_List, "libusb_free_device_list");
function Libusb_Ref_Device (Dev : System.Address) return System.Address; -- /usr/include/libusb-1.0/libusb.h:1319
pragma Import (C, Libusb_Ref_Device, "libusb_ref_device");
procedure Libusb_Unref_Device (Dev : System.Address); -- /usr/include/libusb-1.0/libusb.h:1320
pragma Import (C, Libusb_Unref_Device, "libusb_unref_device");
function Libusb_Get_Configuration (Dev : System.Address; Config : access Int) return Int; -- /usr/include/libusb-1.0/libusb.h:1322
pragma Import (C, Libusb_Get_Configuration, "libusb_get_configuration");
function Libusb_Get_Device_Descriptor (Dev : System.Address; Desc : access Device_Descriptor) return Int; -- /usr/include/libusb-1.0/libusb.h:1324
pragma Import (C, Libusb_Get_Device_Descriptor, "libusb_get_device_descriptor");
function Libusb_Get_Active_Config_Descriptor (Dev : System.Address; Config : System.Address) return Int; -- /usr/include/libusb-1.0/libusb.h:1326
pragma Import (C, Libusb_Get_Active_Config_Descriptor, "libusb_get_active_config_descriptor");
function Libusb_Get_Config_Descriptor
(Dev : System.Address;
Config_Index : Interfaces.Unsigned_8;
Config : System.Address) return Int; -- /usr/include/libusb-1.0/libusb.h:1328
pragma Import (C, Libusb_Get_Config_Descriptor, "libusb_get_config_descriptor");
function Libusb_Get_Config_Descriptor_By_Value
(Dev : System.Address;
BConfigurationValue : Interfaces.Unsigned_8;
Config : System.Address) return Int; -- /usr/include/libusb-1.0/libusb.h:1330
pragma Import (C, Libusb_Get_Config_Descriptor_By_Value, "libusb_get_config_descriptor_by_value");
procedure Libusb_Free_Config_Descriptor (Config : access Config_Descriptor); -- /usr/include/libusb-1.0/libusb.h:1332
pragma Import (C, Libusb_Free_Config_Descriptor, "libusb_free_config_descriptor");
function Libusb_Get_Ss_Endpoint_Companion_Descriptor
(Ctx : System.Address;
Endpoint : access constant Endpoint_Descriptor;
Ep_Comp : System.Address) return Int; -- /usr/include/libusb-1.0/libusb.h:1334
pragma Import (C, Libusb_Get_Ss_Endpoint_Companion_Descriptor, "libusb_get_ss_endpoint_companion_descriptor");
procedure Libusb_Free_Ss_Endpoint_Companion_Descriptor (Ep_Comp : access Ss_Endpoint_Companion_Descriptor); -- /usr/include/libusb-1.0/libusb.h:1338
pragma Import (C, Libusb_Free_Ss_Endpoint_Companion_Descriptor, "libusb_free_ss_endpoint_companion_descriptor");
function Libusb_Get_Bos_Descriptor (Dev_Handle : System.Address; Bos : System.Address) return Int; -- /usr/include/libusb-1.0/libusb.h:1340
pragma Import (C, Libusb_Get_Bos_Descriptor, "libusb_get_bos_descriptor");
procedure Libusb_Free_Bos_Descriptor (Bos : access Bos_Descriptor); -- /usr/include/libusb-1.0/libusb.h:1342
pragma Import (C, Libusb_Free_Bos_Descriptor, "libusb_free_bos_descriptor");
function Libusb_Get_Usb_2_0_Extension_Descriptor
(Ctx : System.Address;
Dev_Cap : access Bos_Dev_Capability_Descriptor;
Usb_2_0_Extension : System.Address) return Int; -- /usr/include/libusb-1.0/libusb.h:1343
pragma Import (C, Libusb_Get_Usb_2_0_Extension_Descriptor, "libusb_get_usb_2_0_extension_descriptor");
procedure Libusb_Free_Usb_2_0_Extension_Descriptor (Usb_2_0_Extension : access Usb_2_0_Extension_Descriptor); -- /usr/include/libusb-1.0/libusb.h:1347
pragma Import (C, Libusb_Free_Usb_2_0_Extension_Descriptor, "libusb_free_usb_2_0_extension_descriptor");
function Libusb_Get_Ss_Usb_Device_Capability_Descriptor
(Ctx : System.Address;
Dev_Cap : access Bos_Dev_Capability_Descriptor;
Ss_Usb_Device_Cap : System.Address) return Int; -- /usr/include/libusb-1.0/libusb.h:1349
pragma Import (C, Libusb_Get_Ss_Usb_Device_Capability_Descriptor, "libusb_get_ss_usb_device_capability_descriptor");
procedure Libusb_Free_Ss_Usb_Device_Capability_Descriptor (Ss_Usb_Device_Cap : access Ss_Usb_Device_Capability_Descriptor); -- /usr/include/libusb-1.0/libusb.h:1353
pragma Import (C, Libusb_Free_Ss_Usb_Device_Capability_Descriptor, "libusb_free_ss_usb_device_capability_descriptor");
function Libusb_Get_Container_Id_Descriptor
(Ctx : System.Address;
Dev_Cap : access Bos_Dev_Capability_Descriptor;
Container_Id : System.Address) return Int; -- /usr/include/libusb-1.0/libusb.h:1355
pragma Import (C, Libusb_Get_Container_Id_Descriptor, "libusb_get_container_id_descriptor");
procedure Libusb_Free_Container_Id_Descriptor (Container_Id : access Container_Id_Descriptor); -- /usr/include/libusb-1.0/libusb.h:1358
pragma Import (C, Libusb_Free_Container_Id_Descriptor, "libusb_free_container_id_descriptor");
function Libusb_Get_Bus_Number (Dev : System.Address) return Interfaces.Unsigned_8; -- /usr/include/libusb-1.0/libusb.h:1360
pragma Import (C, Libusb_Get_Bus_Number, "libusb_get_bus_number");
function Libusb_Get_Port_Number (Dev : System.Address) return Interfaces.Unsigned_8; -- /usr/include/libusb-1.0/libusb.h:1361
pragma Import (C, Libusb_Get_Port_Number, "libusb_get_port_number");
function Libusb_Get_Port_Numbers
(Dev : System.Address;
Port_Numbers : access Interfaces.Unsigned_8;
Port_Numbers_Len : Int) return Int; -- /usr/include/libusb-1.0/libusb.h:1362
pragma Import (C, Libusb_Get_Port_Numbers, "libusb_get_port_numbers");
function Libusb_Get_Port_Path
(Ctx : System.Address;
Dev : System.Address;
Path : access Interfaces.Unsigned_8;
Path_Length : Interfaces.Unsigned_8) return Int; -- /usr/include/libusb-1.0/libusb.h:1364
pragma Import (C, Libusb_Get_Port_Path, "libusb_get_port_path");
function Libusb_Get_Parent (Dev : System.Address) return System.Address; -- /usr/include/libusb-1.0/libusb.h:1365
pragma Import (C, Libusb_Get_Parent, "libusb_get_parent");
function Libusb_Get_Device_Address (Dev : System.Address) return Interfaces.Unsigned_8; -- /usr/include/libusb-1.0/libusb.h:1366
pragma Import (C, Libusb_Get_Device_Address, "libusb_get_device_address");
function Libusb_Get_Device_Speed (Dev : System.Address) return Int; -- /usr/include/libusb-1.0/libusb.h:1367
pragma Import (C, Libusb_Get_Device_Speed, "libusb_get_device_speed");
function Libusb_Get_Max_Packet_Size (Dev : System.Address; Endpoint : Unsigned_Char) return Int; -- /usr/include/libusb-1.0/libusb.h:1368
pragma Import (C, Libusb_Get_Max_Packet_Size, "libusb_get_max_packet_size");
function Libusb_Get_Max_Iso_Packet_Size (Dev : System.Address; Endpoint : Unsigned_Char) return Int; -- /usr/include/libusb-1.0/libusb.h:1370
pragma Import (C, Libusb_Get_Max_Iso_Packet_Size, "libusb_get_max_iso_packet_size");
function Libusb_Open (Dev : System.Address; Dev_Handle : System.Address) return Int; -- /usr/include/libusb-1.0/libusb.h:1373
pragma Import (C, Libusb_Open, "libusb_open");
procedure Libusb_Close (Dev_Handle : System.Address); -- /usr/include/libusb-1.0/libusb.h:1374
pragma Import (C, Libusb_Close, "libusb_close");
function Libusb_Get_Device (Dev_Handle : System.Address) return System.Address; -- /usr/include/libusb-1.0/libusb.h:1375
pragma Import (C, Libusb_Get_Device, "libusb_get_device");
function Libusb_Set_Configuration (Dev_Handle : System.Address; Configuration : Int) return Int; -- /usr/include/libusb-1.0/libusb.h:1377
pragma Import (C, Libusb_Set_Configuration, "libusb_set_configuration");
function Libusb_Claim_Interface (Dev_Handle : System.Address; Interface_Number : Int) return Int; -- /usr/include/libusb-1.0/libusb.h:1379
pragma Import (C, Libusb_Claim_Interface, "libusb_claim_interface");
function Libusb_Release_Interface (Dev_Handle : System.Address; Interface_Number : Int) return Int; -- /usr/include/libusb-1.0/libusb.h:1381
pragma Import (C, Libusb_Release_Interface, "libusb_release_interface");
function Libusb_Open_Device_With_Vid_Pid
(Ctx : System.Address;
Vendor_Id : Interfaces.Unsigned_16;
Product_Id : Interfaces.Unsigned_16) return System.Address; -- /usr/include/libusb-1.0/libusb.h:1384
pragma Import (C, Libusb_Open_Device_With_Vid_Pid, "libusb_open_device_with_vid_pid");
function Libusb_Set_Interface_Alt_Setting
(Dev_Handle : System.Address;
Interface_Number : Int;
Alternate_Setting : Int) return Int; -- /usr/include/libusb-1.0/libusb.h:1387
pragma Import (C, Libusb_Set_Interface_Alt_Setting, "libusb_set_interface_alt_setting");
function Libusb_Clear_Halt (Dev_Handle : System.Address; Endpoint : Unsigned_Char) return Int; -- /usr/include/libusb-1.0/libusb.h:1389
pragma Import (C, Libusb_Clear_Halt, "libusb_clear_halt");
function Libusb_Reset_Device (Dev_Handle : System.Address) return Int; -- /usr/include/libusb-1.0/libusb.h:1391
pragma Import (C, Libusb_Reset_Device, "libusb_reset_device");
function Libusb_Alloc_Streams
(Dev_Handle : System.Address;
Num_Streams : Interfaces.Unsigned_32;
Endpoints : access Unsigned_Char;
Num_Endpoints : Int) return Int; -- /usr/include/libusb-1.0/libusb.h:1393
pragma Import (C, Libusb_Alloc_Streams, "libusb_alloc_streams");
function Libusb_Free_Streams
(Dev_Handle : System.Address;
Endpoints : access Unsigned_Char;
Num_Endpoints : Int) return Int; -- /usr/include/libusb-1.0/libusb.h:1395
pragma Import (C, Libusb_Free_Streams, "libusb_free_streams");
function Libusb_Dev_Mem_Alloc (Dev_Handle : System.Address; Length : Size_T) return access Unsigned_Char; -- /usr/include/libusb-1.0/libusb.h:1398
pragma Import (C, Libusb_Dev_Mem_Alloc, "libusb_dev_mem_alloc");
function Libusb_Dev_Mem_Free
(Dev_Handle : System.Address;
Buffer : access Unsigned_Char;
Length : Size_T) return Int; -- /usr/include/libusb-1.0/libusb.h:1400
pragma Import (C, Libusb_Dev_Mem_Free, "libusb_dev_mem_free");
function Libusb_Kernel_Driver_Active (Dev_Handle : System.Address; Interface_Number : Int) return Int; -- /usr/include/libusb-1.0/libusb.h:1403
pragma Import (C, Libusb_Kernel_Driver_Active, "libusb_kernel_driver_active");
function Libusb_Detach_Kernel_Driver (Dev_Handle : System.Address; Interface_Number : Int) return Int; -- /usr/include/libusb-1.0/libusb.h:1405
pragma Import (C, Libusb_Detach_Kernel_Driver, "libusb_detach_kernel_driver");
function Libusb_Attach_Kernel_Driver (Dev_Handle : System.Address; Interface_Number : Int) return Int; -- /usr/include/libusb-1.0/libusb.h:1407
pragma Import (C, Libusb_Attach_Kernel_Driver, "libusb_attach_kernel_driver");
function Libusb_Set_Auto_Detach_Kernel_Driver (Dev_Handle : System.Address; Enable : Int) return Int; -- /usr/include/libusb-1.0/libusb.h:1409
pragma Import (C, Libusb_Set_Auto_Detach_Kernel_Driver, "libusb_set_auto_detach_kernel_driver");
function Libusb_Control_Transfer_Get_Data (T : access Transfer) return access Unsigned_Char; -- /usr/include/libusb-1.0/libusb.h:1426
pragma Import (C, Libusb_Control_Transfer_Get_Data, "libusb_control_transfer_get_data");
function Libusb_Control_Transfer_Get_Setup (T : access Transfer) return access Control_Setup; -- /usr/include/libusb-1.0/libusb.h:1444
pragma Import (C, Libusb_Control_Transfer_Get_Setup, "libusb_control_transfer_get_setup");
procedure Libusb_Fill_Control_Setup
(Buffer : access Unsigned_Char;
BmRequestType : Interfaces.Unsigned_8;
BRequest : Interfaces.Unsigned_8;
WValue : Interfaces.Unsigned_16;
WIndex : Interfaces.Unsigned_16;
WLength : Interfaces.Unsigned_16); -- /usr/include/libusb-1.0/libusb.h:1473
pragma Import (C, Libusb_Fill_Control_Setup, "libusb_fill_control_setup");
function Libusb_Alloc_Transfer (Iso_Packets : Int) return access Transfer; -- /usr/include/libusb-1.0/libusb.h:1485
pragma Import (C, Libusb_Alloc_Transfer, "libusb_alloc_transfer");
function Libusb_Submit_Transfer (T : access Transfer) return Int; -- /usr/include/libusb-1.0/libusb.h:1486
pragma Import (C, Libusb_Submit_Transfer, "libusb_submit_transfer");
function Libusb_Cancel_Transfer (T : access Transfer) return Int; -- /usr/include/libusb-1.0/libusb.h:1487
pragma Import (C, Libusb_Cancel_Transfer, "libusb_cancel_transfer");
procedure Libusb_Free_Transfer (T : access Transfer); -- /usr/include/libusb-1.0/libusb.h:1488
pragma Import (C, Libusb_Free_Transfer, "libusb_free_transfer");
procedure Libusb_Transfer_Set_Stream_Id (T : access Transfer; Stream_Id : Interfaces.Unsigned_32); -- /usr/include/libusb-1.0/libusb.h:1489
pragma Import (C, Libusb_Transfer_Set_Stream_Id, "libusb_transfer_set_stream_id");
function Libusb_Transfer_Get_Stream_Id (T : access Transfer) return Interfaces.Unsigned_32; -- /usr/include/libusb-1.0/libusb.h:1491
pragma Import (C, Libusb_Transfer_Get_Stream_Id, "libusb_transfer_get_stream_id");
procedure Libusb_Fill_Control_Transfer
(T : access Transfer;
Dev_Handle : System.Address;
Buffer : access Unsigned_Char;
Callback : Transfer_Cb_Fn;
User_Data : System.Address;
Timeout : Unsigned); -- /usr/include/libusb-1.0/libusb.h:1522
pragma Import (C, Libusb_Fill_Control_Transfer, "libusb_fill_control_transfer");
procedure Libusb_Fill_Bulk_Transfer
(T : access Transfer;
Dev_Handle : System.Address;
Endpoint : Unsigned_Char;
Buffer : access Unsigned_Char;
Length : Int;
Callback : Transfer_Cb_Fn;
User_Data : System.Address;
Timeout : Unsigned); -- /usr/include/libusb-1.0/libusb.h:1553
pragma Import (C, Libusb_Fill_Bulk_Transfer, "libusb_fill_bulk_transfer");
procedure Libusb_Fill_Bulk_Stream_Transfer
(T : access Transfer;
Dev_Handle : System.Address;
Endpoint : Unsigned_Char;
Stream_Id : Interfaces.Unsigned_32;
Buffer : access Unsigned_Char;
Length : Int;
Callback : Transfer_Cb_Fn;
User_Data : System.Address;
Timeout : Unsigned); -- /usr/include/libusb-1.0/libusb.h:1584
pragma Import (C, Libusb_Fill_Bulk_Stream_Transfer, "libusb_fill_bulk_stream_transfer");
procedure Libusb_Fill_Interrupt_Transfer
(T : access Transfer;
Dev_Handle : System.Address;
Endpoint : Unsigned_Char;
Buffer : access Unsigned_Char;
Length : Int;
Callback : Transfer_Cb_Fn;
User_Data : System.Address;
Timeout : Unsigned); -- /usr/include/libusb-1.0/libusb.h:1609
pragma Import (C, Libusb_Fill_Interrupt_Transfer, "libusb_fill_interrupt_transfer");
procedure Libusb_Fill_Iso_Transfer
(T : access Transfer;
Dev_Handle : System.Address;
Endpoint : Unsigned_Char;
Buffer : access Unsigned_Char;
Length : Int;
Num_Iso_Packets : Int;
Callback : Transfer_Cb_Fn;
User_Data : System.Address;
Timeout : Unsigned); -- /usr/include/libusb-1.0/libusb.h:1638
pragma Import (C, Libusb_Fill_Iso_Transfer, "libusb_fill_iso_transfer");
procedure Libusb_Set_Iso_Packet_Lengths (T : access Transfer; Length : Unsigned); -- /usr/include/libusb-1.0/libusb.h:1662
pragma Import (C, Libusb_Set_Iso_Packet_Lengths, "libusb_set_iso_packet_lengths");
function Libusb_Get_Iso_Packet_Buffer (T : access Transfer; Packet : Unsigned) return access Unsigned_Char; -- /usr/include/libusb-1.0/libusb.h:1686
pragma Import (C, Libusb_Get_Iso_Packet_Buffer, "libusb_get_iso_packet_buffer");
function Libusb_Get_Iso_Packet_Buffer_Simple (T : access Transfer; Packet : Unsigned) return access Unsigned_Char; -- /usr/include/libusb-1.0/libusb.h:1728
pragma Import (C, Libusb_Get_Iso_Packet_Buffer_Simple, "libusb_get_iso_packet_buffer_simple");
function Libusb_Control_Transfer
(Dev_Handle : System.Address;
Request_Type : Interfaces.Unsigned_8;
BRequest : Interfaces.Unsigned_8;
WValue : Interfaces.Unsigned_16;
WIndex : Interfaces.Unsigned_16;
Data : access Unsigned_Char;
WLength : Interfaces.Unsigned_16;
Timeout : Unsigned) return Int; -- /usr/include/libusb-1.0/libusb.h:1748
pragma Import (C, Libusb_Control_Transfer, "libusb_control_transfer");
function Libusb_Bulk_Transfer
(Dev_Handle : System.Address;
Endpoint : Unsigned_Char;
Data : access Unsigned_Char;
Length : Int;
Actual_Length : access Int;
Timeout : Unsigned) return Int; -- /usr/include/libusb-1.0/libusb.h:1752
pragma Import (C, Libusb_Bulk_Transfer, "libusb_bulk_transfer");
function Libusb_Interrupt_Transfer
(Dev_Handle : System.Address;
Endpoint : Unsigned_Char;
Data : access Unsigned_Char;
Length : Int;
Actual_Length : access Int;
Timeout : Unsigned) return Int; -- /usr/include/libusb-1.0/libusb.h:1756
pragma Import (C, Libusb_Interrupt_Transfer, "libusb_interrupt_transfer");
function Libusb_Get_Descriptor
(Dev_Handle : System.Address;
Desc_Type : Interfaces.Unsigned_8;
Desc_Index : Interfaces.Unsigned_8;
Data : access Unsigned_Char;
Length : Int) return Int; -- /usr/include/libusb-1.0/libusb.h:1772
pragma Import (C, Libusb_Get_Descriptor, "libusb_get_descriptor");
function Libusb_Get_String_Descriptor
(Dev_Handle : System.Address;
Desc_Index : Interfaces.Unsigned_8;
Langid : Interfaces.Unsigned_16;
Data : access Unsigned_Char;
Length : Int) return Int; -- /usr/include/libusb-1.0/libusb.h:1794
pragma Import (C, Libusb_Get_String_Descriptor, "libusb_get_string_descriptor");
function Libusb_Get_String_Descriptor_Ascii
(Dev_Handle : System.Address;
Desc_Index : Interfaces.Unsigned_8;
Data : access Unsigned_Char;
Length : Int) return Int; -- /usr/include/libusb-1.0/libusb.h:1802
pragma Import (C, Libusb_Get_String_Descriptor_Ascii, "libusb_get_string_descriptor_ascii");
function Libusb_Try_Lock_Events (Ctx : System.Address) return Int; -- /usr/include/libusb-1.0/libusb.h:1807
pragma Import (C, Libusb_Try_Lock_Events, "libusb_try_lock_events");
procedure Libusb_Lock_Events (Ctx : System.Address); -- /usr/include/libusb-1.0/libusb.h:1808
pragma Import (C, Libusb_Lock_Events, "libusb_lock_events");
procedure Libusb_Unlock_Events (Ctx : System.Address); -- /usr/include/libusb-1.0/libusb.h:1809
pragma Import (C, Libusb_Unlock_Events, "libusb_unlock_events");
function Libusb_Event_Handling_Ok (Ctx : System.Address) return Int; -- /usr/include/libusb-1.0/libusb.h:1810
pragma Import (C, Libusb_Event_Handling_Ok, "libusb_event_handling_ok");
function Libusb_Event_Handler_Active (Ctx : System.Address) return Int; -- /usr/include/libusb-1.0/libusb.h:1811
pragma Import (C, Libusb_Event_Handler_Active, "libusb_event_handler_active");
procedure Libusb_Interrupt_Event_Handler (Ctx : System.Address); -- /usr/include/libusb-1.0/libusb.h:1812
pragma Import (C, Libusb_Interrupt_Event_Handler, "libusb_interrupt_event_handler");
procedure Libusb_Lock_Event_Waiters (Ctx : System.Address); -- /usr/include/libusb-1.0/libusb.h:1813
pragma Import (C, Libusb_Lock_Event_Waiters, "libusb_lock_event_waiters");
procedure Libusb_Unlock_Event_Waiters (Ctx : System.Address); -- /usr/include/libusb-1.0/libusb.h:1814
pragma Import (C, Libusb_Unlock_Event_Waiters, "libusb_unlock_event_waiters");
function Libusb_Wait_For_Event (Ctx : System.Address; Tv : access GNAT.Calendar.Timeval) return Int; -- /usr/include/libusb-1.0/libusb.h:1815
pragma Import (C, Libusb_Wait_For_Event, "libusb_wait_for_event");
function Libusb_Handle_Events_Timeout (Ctx : System.Address; Tv : access GNAT.Calendar.Timeval) return Int; -- /usr/include/libusb-1.0/libusb.h:1817
pragma Import (C, Libusb_Handle_Events_Timeout, "libusb_handle_events_timeout");
function Libusb_Handle_Events_Timeout_Completed
(Ctx : System.Address;
Tv : access GNAT.Calendar.Timeval;
Completed : access Int) return Int; -- /usr/include/libusb-1.0/libusb.h:1819
pragma Import (C, Libusb_Handle_Events_Timeout_Completed, "libusb_handle_events_timeout_completed");
function Libusb_Handle_Events (Ctx : System.Address) return Int; -- /usr/include/libusb-1.0/libusb.h:1821
pragma Import (C, Libusb_Handle_Events, "libusb_handle_events");
function Libusb_Handle_Events_Completed (Ctx : System.Address; Completed : access Int) return Int; -- /usr/include/libusb-1.0/libusb.h:1822
pragma Import (C, Libusb_Handle_Events_Completed, "libusb_handle_events_completed");
function Libusb_Handle_Events_Locked (Ctx : System.Address; Tv : access GNAT.Calendar.Timeval) return Int; -- /usr/include/libusb-1.0/libusb.h:1823
pragma Import (C, Libusb_Handle_Events_Locked, "libusb_handle_events_locked");
function Libusb_Pollfds_Handle_Timeouts (Ctx : System.Address) return Int; -- /usr/include/libusb-1.0/libusb.h:1825
pragma Import (C, Libusb_Pollfds_Handle_Timeouts, "libusb_pollfds_handle_timeouts");
function Libusb_Get_Next_Timeout (Ctx : System.Address; Tv : access GNAT.Calendar.Timeval) return Int; -- /usr/include/libusb-1.0/libusb.h:1826
pragma Import (C, Libusb_Get_Next_Timeout, "libusb_get_next_timeout");
type Libusb_Pollfd is record
Fd : aliased Int; -- /usr/include/libusb-1.0/libusb.h:1834
Events : aliased Short; -- /usr/include/libusb-1.0/libusb.h:1840
end record;
pragma Convention (C_Pass_By_Copy, Libusb_Pollfd); -- /usr/include/libusb-1.0/libusb.h:1832
type Libusb_Pollfd_Added_Cb is access procedure
(Arg1 : Int;
Arg2 : Short;
Arg3 : System.Address);
pragma Convention (C, Libusb_Pollfd_Added_Cb); -- /usr/include/libusb-1.0/libusb.h:1853
type Libusb_Pollfd_Removed_Cb is access procedure (Arg1 : Int; Arg2 : System.Address);
pragma Convention (C, Libusb_Pollfd_Removed_Cb); -- /usr/include/libusb-1.0/libusb.h:1865
function Libusb_Get_Pollfds (Ctx : System.Address) return System.Address; -- /usr/include/libusb-1.0/libusb.h:1867
pragma Import (C, Libusb_Get_Pollfds, "libusb_get_pollfds");
procedure Libusb_Free_Pollfds (Pollfds : System.Address); -- /usr/include/libusb-1.0/libusb.h:1869
pragma Import (C, Libusb_Free_Pollfds, "libusb_free_pollfds");
procedure Libusb_Set_Pollfd_Notifiers
(Ctx : System.Address;
Added_Cb : Libusb_Pollfd_Added_Cb;
Removed_Cb : Libusb_Pollfd_Removed_Cb;
User_Data : System.Address); -- /usr/include/libusb-1.0/libusb.h:1870
pragma Import (C, Libusb_Set_Pollfd_Notifiers, "libusb_set_pollfd_notifiers");
subtype Libusb_Hotplug_Callback_Handle is Int; -- /usr/include/libusb-1.0/libusb.h:1886
type Libusb_Hotplug_Flag is
(LIBUSB_HOTPLUG_NO_FLAGS,
LIBUSB_HOTPLUG_ENUMERATE);
pragma Convention (C, Libusb_Hotplug_Flag); -- /usr/include/libusb-1.0/libusb.h:1899
subtype Libusb_Hotplug_Event is Unsigned;
LIBUSB_HOTPLUG_EVENT_DEVICE_ARRIVED : constant Libusb_Hotplug_Event := 1;
LIBUSB_HOTPLUG_EVENT_DEVICE_LEFT : constant Libusb_Hotplug_Event := 2; -- /usr/include/libusb-1.0/libusb.h:1914
type Libusb_Hotplug_Callback_Fn is access function
(Arg1 : System.Address;
Arg2 : System.Address;
Arg3 : Libusb_Hotplug_Event;
Arg4 : System.Address) return Int;
pragma Convention (C, Libusb_Hotplug_Callback_Fn); -- /usr/include/libusb-1.0/libusb.h:1942
function Libusb_Hotplug_Register_Callback
(Ctx : System.Address;
Events : Libusb_Hotplug_Event;
Flags : Libusb_Hotplug_Flag;
Vendor_Id : Int;
Product_Id : Int;
Dev_Class : Int;
Cb_Fn : Libusb_Hotplug_Callback_Fn;
User_Data : System.Address;
Callback_Handle : access Hotplug_Callback_Handle) return Int; -- /usr/include/libusb-1.0/libusb.h:1981
pragma Import (C, Libusb_Hotplug_Register_Callback, "libusb_hotplug_register_callback");
procedure Libusb_Hotplug_Deregister_Callback (Ctx : System.Address; Callback_Handle : Libusb_Hotplug_Callback_Handle); -- /usr/include/libusb-1.0/libusb.h:2001
pragma Import (C, Libusb_Hotplug_Deregister_Callback, "libusb_hotplug_deregister_callback");
end Libusb_1_0_Libusb_H;
-----------------
-- cpu_to_le16 --
-----------------
use Libusb_1_0_Libusb_H;
function Cpu_To_Le16
(X : Interfaces.Unsigned_16)
return Interfaces.Unsigned_16
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "Libusb_1_0_Libusb_H unimplemented");
return raise Program_Error with "Unimplemented procedure Libusb_1_0_Libusb_H";
end Cpu_To_Le16;
procedure Initialize (Ctx : in out Context) is
begin
Ret2exception (Libusb_Init (Ctx.Ctx'Address));
end;
procedure Finalize (Ctx : in out Context) is
begin
Libusb_Exit (Ctx.Ctx);
end;
---------------
-- set_debug --
---------------
procedure Set_Debug (Ctx : Context; Level : Int) is
begin
Libusb_Set_Debug (Ctx.Ctx, Level);
end Set_Debug;
-----------------
-- get_version --
-----------------
function Get_Version return access constant Version is
begin
return Libusb_Get_Version;
end Get_Version;
--------------------
-- has_capability --
--------------------
function Has_Capability (Capability : Interfaces.Unsigned_32) return Int is
begin
return Libusb_Has_Capability(Capability);
end Has_Capability;
----------------
-- error_name --
----------------
function Error_Name
(Errcode : Int)
return Interfaces.C.Strings.Chars_Ptr
is
begin
return Libusb_Error_Name (Errcode);
end Error_Name;
---------------
-- setlocale --
---------------
procedure Setlocale (Locale : Interfaces.C.Strings.Chars_Ptr) is
begin
Ret2exception (Libusb_Setlocale (Locale));
end Setlocale;
--------------
-- strerror --
--------------
function Strerror
(Errcode : Error)
return Interfaces.C.Strings.Chars_Ptr
is
begin
return Libusb_Strerror (Errcode);
end Strerror;
---------------------
-- get_device_list --
---------------------
function Get_Device_List
(Ctx : Context'Class) return Device_List
is
begin
return ret : Device_List do
Ret.Len := Libusb_Get_Device_List (Ctx.Ctx, Ret.List'Address);
end return;
end Get_Device_List;
----------------------
-- free_device_list --
----------------------
procedure Free_Device_List (list : Device_Access; unref_devices : int) is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "free_device_list unimplemented");
raise Program_Error with "Unimplemented procedure free_device_list";
end Free_Device_List;
----------------
-- ref_device --
----------------
function Ref_Device (dev : Device_Access) return Device_Access is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "ref_device unimplemented");
return raise Program_Error with "Unimplemented function ref_device";
end Ref_Device;
------------------
-- unref_device --
------------------
procedure Unref_Device (Dev : System.Address) is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "unref_device unimplemented");
raise Program_Error with "Unimplemented procedure unref_device";
end Unref_Device;
-----------------------
-- get_configuration --
-----------------------
function Get_Configuration
(Dev : System.Address;
Config : access Int)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "get_configuration unimplemented");
return raise Program_Error with "Unimplemented function get_configuration";
end Get_Configuration;
---------------------------
-- get_device_descriptor --
---------------------------
function Get_Device_Descriptor
(Dev : System.Address;
Desc : access Device_Descriptor)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "get_device_descriptor unimplemented");
return raise Program_Error with "Unimplemented function get_device_descriptor";
end Get_Device_Descriptor;
----------------------------------
-- get_active_config_descriptor --
----------------------------------
function Get_Active_Config_Descriptor
(Dev : System.Address;
Config : System.Address)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "get_active_config_descriptor unimplemented");
return raise Program_Error with "Unimplemented function get_active_config_descriptor";
end Get_Active_Config_Descriptor;
---------------------------
-- get_config_descriptor --
---------------------------
function Get_Config_Descriptor
(Dev : System.Address;
Config_Index : Interfaces.Unsigned_8;
Config : System.Address)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "get_config_descriptor unimplemented");
return raise Program_Error with "Unimplemented function get_config_descriptor";
end Get_Config_Descriptor;
------------------------------------
-- get_config_descriptor_by_value --
------------------------------------
function Get_Config_Descriptor_By_Value
(Dev : System.Address;
BConfigurationValue : Interfaces.Unsigned_8;
Config : System.Address)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "get_config_descriptor_by_value unimplemented");
return raise Program_Error with "Unimplemented function get_config_descriptor_by_value";
end Get_Config_Descriptor_By_Value;
----------------------------
-- free_config_descriptor --
----------------------------
procedure Free_Config_Descriptor (Config : access Config_Descriptor) is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "free_config_descriptor unimplemented");
raise Program_Error with "Unimplemented procedure free_config_descriptor";
end Free_Config_Descriptor;
------------------------------------------
-- get_ss_endpoint_companion_descriptor --
------------------------------------------
function Get_Ss_Endpoint_Companion_Descriptor
(ctx : context;
endpoint : access constant endpoint_descriptor;
ep_comp : System.Address) return int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "get_ss_endpoint_companion_descriptor unimplemented");
return raise Program_Error with "Unimplemented function get_ss_endpoint_companion_descriptor";
end Get_Ss_Endpoint_Companion_Descriptor;
-------------------------------------------
-- free_ss_endpoint_companion_descriptor --
-------------------------------------------
procedure Free_Ss_Endpoint_Companion_Descriptor
(Ep_Comp : access Ss_Endpoint_Companion_Descriptor)
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "free_ss_endpoint_companion_descriptor unimplemented");
raise Program_Error with "Unimplemented procedure free_ss_endpoint_companion_descriptor";
end Free_Ss_Endpoint_Companion_Descriptor;
------------------------
-- get_bos_descriptor --
------------------------
function Get_Bos_Descriptor
(Dev_Handle : System.Address;
Bos : System.Address)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "get_bos_descriptor unimplemented");
return raise Program_Error with "Unimplemented function get_bos_descriptor";
end Get_Bos_Descriptor;
-------------------------
-- free_bos_descriptor --
-------------------------
procedure Free_Bos_Descriptor (Bos : access Bos_Descriptor) is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "free_bos_descriptor unimplemented");
raise Program_Error with "Unimplemented procedure free_bos_descriptor";
end Free_Bos_Descriptor;
--------------------------------------
-- get_usb_2_0_extension_descriptor --
--------------------------------------
function Get_Usb_2_0_Extension_Descriptor
(ctx : context;
dev_cap : access bos_dev_capability_descriptor;
usb_2_0_extension : System.Address) return int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "get_usb_2_0_extension_descriptor unimplemented");
return raise Program_Error with "Unimplemented function get_usb_2_0_extension_descriptor";
end Get_Usb_2_0_Extension_Descriptor;
---------------------------------------
-- free_usb_2_0_extension_descriptor --
---------------------------------------
procedure Free_Usb_2_0_Extension_Descriptor
(Usb_2_0_Extension : access Usb_2_0_Extension_Descriptor)
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "free_usb_2_0_extension_descriptor unimplemented");
raise Program_Error with "Unimplemented procedure free_usb_2_0_extension_descriptor";
end Free_Usb_2_0_Extension_Descriptor;
---------------------------------------------
-- get_ss_usb_device_capability_descriptor --
---------------------------------------------
function Get_Ss_Usb_Device_Capability_Descriptor
(ctx : context;
dev_cap : access bos_dev_capability_descriptor;
ss_usb_device_cap : System.Address) return int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "get_ss_usb_device_capability_descriptor unimplemented");
return raise Program_Error with "Unimplemented function get_ss_usb_device_capability_descriptor";
end Get_Ss_Usb_Device_Capability_Descriptor;
----------------------------------------------
-- free_ss_usb_device_capability_descriptor --
----------------------------------------------
procedure Free_Ss_Usb_Device_Capability_Descriptor
(Ss_Usb_Device_Cap : access Ss_Usb_Device_Capability_Descriptor)
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "free_ss_usb_device_capability_descriptor unimplemented");
raise Program_Error with "Unimplemented procedure free_ss_usb_device_capability_descriptor";
end Free_Ss_Usb_Device_Capability_Descriptor;
---------------------------------
-- get_container_id_descriptor --
---------------------------------
function Get_Container_Id_Descriptor
(ctx : context;
dev_cap : access bos_dev_capability_descriptor;
container_id : System.Address) return int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "get_container_id_descriptor unimplemented");
return raise Program_Error with "Unimplemented function get_container_id_descriptor";
end Get_Container_Id_Descriptor;
----------------------------------
-- free_container_id_descriptor --
----------------------------------
procedure Free_Container_Id_Descriptor
(Container_Id : access Container_Id_Descriptor)
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "free_container_id_descriptor unimplemented");
raise Program_Error with "Unimplemented procedure free_container_id_descriptor";
end Free_Container_Id_Descriptor;
--------------------
-- get_bus_number --
--------------------
function Get_Bus_Number
(Dev : System.Address)
return Interfaces.Unsigned_8
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "get_bus_number unimplemented");
return raise Program_Error with "Unimplemented function get_bus_number";
end Get_Bus_Number;
---------------------
-- get_port_number --
---------------------
function Get_Port_Number
(Dev : System.Address)
return Interfaces.Unsigned_8
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "get_port_number unimplemented");
return raise Program_Error with "Unimplemented function get_port_number";
end Get_Port_Number;
----------------------
-- get_port_numbers --
----------------------
function Get_Port_Numbers
(Dev : System.Address;
Port_Numbers : access Interfaces.Unsigned_8;
Port_Numbers_Len : Int)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "get_port_numbers unimplemented");
return raise Program_Error with "Unimplemented function get_port_numbers";
end Get_Port_Numbers;
-------------------
-- get_port_path --
-------------------
function Get_Port_Path
(ctx : context;
dev : System.Address;
path : access Interfaces.Unsigned_8;
path_length : Interfaces.Unsigned_8) return int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "get_port_path unimplemented");
return raise Program_Error with "Unimplemented function get_port_path";
end Get_Port_Path;
----------------
-- get_parent --
----------------
function Get_Parent (Dev : System.Address) return System.Address is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "get_parent unimplemented");
return raise Program_Error with "Unimplemented function get_parent";
end Get_Parent;
------------------------
-- get_device_address --
------------------------
function Get_Device_Address
(Dev : System.Address)
return Interfaces.Unsigned_8
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "get_device_address unimplemented");
return raise Program_Error with "Unimplemented function get_device_address";
end Get_Device_Address;
----------------------
-- get_device_speed --
----------------------
function Get_Device_Speed (Dev : System.Address) return Int is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "get_device_speed unimplemented");
return raise Program_Error with "Unimplemented function get_device_speed";
end Get_Device_Speed;
-------------------------
-- get_max_packet_size --
-------------------------
function Get_Max_Packet_Size
(Dev : System.Address;
Endpoint : Unsigned_Char)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "get_max_packet_size unimplemented");
return raise Program_Error with "Unimplemented function get_max_packet_size";
end Get_Max_Packet_Size;
-----------------------------
-- get_max_iso_packet_size --
-----------------------------
function Get_Max_Iso_Packet_Size
(Dev : System.Address;
Endpoint : Unsigned_Char)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "get_max_iso_packet_size unimplemented");
return raise Program_Error with "Unimplemented function get_max_iso_packet_size";
end Get_Max_Iso_Packet_Size;
----------
-- open --
----------
function Open
(Dev : System.Address;
Dev_Handle : System.Address)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "open unimplemented");
return raise Program_Error with "Unimplemented function open";
end Open;
-----------
-- close --
-----------
procedure Close (Dev_Handle : System.Address) is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "close unimplemented");
raise Program_Error with "Unimplemented procedure close";
end Close;
----------------
-- get_device --
----------------
function Get_Device (Dev_Handle : System.Address) return System.Address is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "get_device unimplemented");
return raise Program_Error with "Unimplemented function get_device";
end Get_Device;
-----------------------
-- set_configuration --
-----------------------
function Set_Configuration
(Dev_Handle : System.Address;
Configuration : Int)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "set_configuration unimplemented");
return raise Program_Error with "Unimplemented function set_configuration";
end Set_Configuration;
---------------------
-- claim_interface --
---------------------
function Claim_Interface
(Dev_Handle : System.Address;
Interface_Number : Int)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "claim_interface unimplemented");
return raise Program_Error with "Unimplemented function claim_interface";
end Claim_Interface;
-----------------------
-- release_interface --
-----------------------
function Release_Interface
(Dev_Handle : System.Address;
Interface_Number : Int)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "release_interface unimplemented");
return raise Program_Error with "Unimplemented function release_interface";
end Release_Interface;
------------------------------
-- open_device_with_vid_pid --
------------------------------
function Open_Device_With_Vid_Pid
(ctx : context;
vendor_id : Interfaces.Unsigned_16;
product_id : Interfaces.Unsigned_16) return System.Address
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "open_device_with_vid_pid unimplemented");
return raise Program_Error with "Unimplemented function open_device_with_vid_pid";
end Open_Device_With_Vid_Pid;
-------------------------------
-- set_interface_alt_setting --
-------------------------------
function Set_Interface_Alt_Setting
(Dev_Handle : System.Address;
Interface_Number : Int;
Alternate_Setting : Int)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "set_interface_alt_setting unimplemented");
return raise Program_Error with "Unimplemented function set_interface_alt_setting";
end Set_Interface_Alt_Setting;
----------------
-- clear_halt --
----------------
function Clear_Halt
(Dev_Handle : System.Address;
Endpoint : Unsigned_Char)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "clear_halt unimplemented");
return raise Program_Error with "Unimplemented function clear_halt";
end Clear_Halt;
------------------
-- reset_device --
------------------
function Reset_Device (Dev_Handle : System.Address) return Int is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "reset_device unimplemented");
return raise Program_Error with "Unimplemented function reset_device";
end Reset_Device;
-------------------
-- alloc_streams --
-------------------
function Alloc_Streams
(Dev_Handle : System.Address;
Num_Streams : Interfaces.Unsigned_32;
Endpoints : access Unsigned_Char;
Num_Endpoints : Int)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "alloc_streams unimplemented");
return raise Program_Error with "Unimplemented function alloc_streams";
end Alloc_Streams;
------------------
-- free_streams --
------------------
function Free_Streams
(Dev_Handle : System.Address;
Endpoints : access Unsigned_Char;
Num_Endpoints : Int)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "free_streams unimplemented");
return raise Program_Error with "Unimplemented function free_streams";
end Free_Streams;
-------------------
-- dev_mem_alloc --
-------------------
function Dev_Mem_Alloc
(Dev_Handle : System.Address;
Length : Size_T)
return access Unsigned_Char
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "dev_mem_alloc unimplemented");
return raise Program_Error with "Unimplemented function dev_mem_alloc";
end Dev_Mem_Alloc;
------------------
-- dev_mem_free --
------------------
function Dev_Mem_Free
(Dev_Handle : System.Address;
Buffer : access Unsigned_Char;
Length : Size_T)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "dev_mem_free unimplemented");
return raise Program_Error with "Unimplemented function dev_mem_free";
end Dev_Mem_Free;
--------------------------
-- kernel_driver_active --
--------------------------
function Kernel_Driver_Active
(Dev_Handle : System.Address;
Interface_Number : Int)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "kernel_driver_active unimplemented");
return raise Program_Error with "Unimplemented function kernel_driver_active";
end Kernel_Driver_Active;
--------------------------
-- detach_kernel_driver --
--------------------------
function Detach_Kernel_Driver
(Dev_Handle : System.Address;
Interface_Number : Int)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "detach_kernel_driver unimplemented");
return raise Program_Error with "Unimplemented function detach_kernel_driver";
end Detach_Kernel_Driver;
--------------------------
-- attach_kernel_driver --
--------------------------
function Attach_Kernel_Driver
(Dev_Handle : System.Address;
Interface_Number : Int)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "attach_kernel_driver unimplemented");
return raise Program_Error with "Unimplemented function attach_kernel_driver";
end Attach_Kernel_Driver;
-----------------------------------
-- set_auto_detach_kernel_driver --
-----------------------------------
function Set_Auto_Detach_Kernel_Driver
(Dev_Handle : System.Address;
Enable : Int)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "set_auto_detach_kernel_driver unimplemented");
return raise Program_Error with "Unimplemented function set_auto_detach_kernel_driver";
end Set_Auto_Detach_Kernel_Driver;
-------------------------------
-- control_transfer_get_data --
-------------------------------
function Control_Transfer_Get_Data
(Transfe : access Transfer)
return access Unsigned_Char
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "control_transfer_get_data unimplemented");
return raise Program_Error with "Unimplemented function control_transfer_get_data";
end Control_Transfer_Get_Data;
--------------------------------
-- control_transfer_get_setup --
--------------------------------
function Control_Transfer_Get_Setup
(Transfe : access Transfer)
return access Control_Setup
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "control_transfer_get_setup unimplemented");
return raise Program_Error with "Unimplemented function control_transfer_get_setup";
end Control_Transfer_Get_Setup;
------------------------
-- fill_control_setup --
------------------------
procedure Fill_Control_Setup
(Buffer : access Unsigned_Char;
BmRequestType : Interfaces.Unsigned_8;
BRequest : Interfaces.Unsigned_8;
WValue : Interfaces.Unsigned_16;
WIndex : Interfaces.Unsigned_16;
WLength : Interfaces.Unsigned_16)
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "fill_control_setup unimplemented");
raise Program_Error with "Unimplemented procedure fill_control_setup";
end Fill_Control_Setup;
--------------------
-- alloc_transfer --
--------------------
function Alloc_Transfer (Iso_Packets : Int) return access Transfer is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "alloc_transfer unimplemented");
return raise Program_Error with "Unimplemented function alloc_transfer";
end Alloc_Transfer;
---------------------
-- submit_transfer --
---------------------
function Submit_Transfer (Transfe : access Transfer) return Int is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "submit_transfer unimplemented");
return raise Program_Error with "Unimplemented function submit_transfer";
end Submit_Transfer;
---------------------
-- cancel_transfer --
---------------------
function Cancel_Transfer (Transfe : access Transfer) return Int is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "cancel_transfer unimplemented");
return raise Program_Error with "Unimplemented function cancel_transfer";
end Cancel_Transfer;
-------------------
-- free_transfer --
-------------------
procedure Free_Transfer (Transfe : access Transfer) is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "free_transfer unimplemented");
raise Program_Error with "Unimplemented procedure free_transfer";
end Free_Transfer;
----------------------------
-- transfer_set_stream_id --
----------------------------
procedure Transfer_Set_Stream_Id
(Transfe : access Transfer;
Stream_Id : Interfaces.Unsigned_32)
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "transfer_set_stream_id unimplemented");
raise Program_Error with "Unimplemented procedure transfer_set_stream_id";
end Transfer_Set_Stream_Id;
----------------------------
-- transfer_get_stream_id --
----------------------------
function Transfer_Get_Stream_Id
(Transfe : access Transfer)
return Interfaces.Unsigned_32
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "transfer_get_stream_id unimplemented");
return raise Program_Error with "Unimplemented function transfer_get_stream_id";
end Transfer_Get_Stream_Id;
---------------------------
-- fill_control_transfer --
---------------------------
procedure Fill_Control_Transfer
(Transfe : access Transfer;
Dev_Handle : System.Address;
Buffer : access Unsigned_Char;
Callback : Transfer_Cb_Fn;
User_Data : System.Address;
Timeout : Unsigned)
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "fill_control_transfer unimplemented");
raise Program_Error with "Unimplemented procedure fill_control_transfer";
end Fill_Control_Transfer;
------------------------
-- fill_bulk_transfer --
------------------------
procedure Fill_Bulk_Transfer
(Transfe : access Transfer;
Dev_Handle : System.Address;
Endpoint : Unsigned_Char;
Buffer : access Unsigned_Char;
Length : Int;
Callback : Transfer_Cb_Fn;
User_Data : System.Address;
Timeout : Unsigned)
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "fill_bulk_transfer unimplemented");
raise Program_Error with "Unimplemented procedure fill_bulk_transfer";
end Fill_Bulk_Transfer;
-------------------------------
-- fill_bulk_stream_transfer --
-------------------------------
procedure Fill_Bulk_Stream_Transfer
(Transfe : access Transfer;
Dev_Handle : System.Address;
Endpoint : Unsigned_Char;
Stream_Id : Interfaces.Unsigned_32;
Buffer : access Unsigned_Char;
Length : Int;
Callback : Transfer_Cb_Fn;
User_Data : System.Address;
Timeout : Unsigned)
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "fill_bulk_stream_transfer unimplemented");
raise Program_Error with "Unimplemented procedure fill_bulk_stream_transfer";
end Fill_Bulk_Stream_Transfer;
-----------------------------
-- fill_interrupt_transfer --
-----------------------------
procedure Fill_Interrupt_Transfer
(Transfe : access Transfer;
Dev_Handle : System.Address;
Endpoint : Unsigned_Char;
Buffer : access Unsigned_Char;
Length : Int;
Callback : Transfer_Cb_Fn;
User_Data : System.Address;
Timeout : Unsigned)
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "fill_interrupt_transfer unimplemented");
raise Program_Error with "Unimplemented procedure fill_interrupt_transfer";
end Fill_Interrupt_Transfer;
-----------------------
-- fill_iso_transfer --
-----------------------
procedure Fill_Iso_Transfer
(Transfe : access Transfer;
Dev_Handle : System.Address;
Endpoint : Unsigned_Char;
Buffer : access Unsigned_Char;
Length : Int;
Num_Iso_Packets : Int;
Callback : Transfer_Cb_Fn;
User_Data : System.Address;
Timeout : Unsigned)
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "fill_iso_transfer unimplemented");
raise Program_Error with "Unimplemented procedure fill_iso_transfer";
end Fill_Iso_Transfer;
----------------------------
-- set_iso_packet_lengths --
----------------------------
procedure Set_Iso_Packet_Lengths
(Transfe : access Transfer;
Length : Unsigned)
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "set_iso_packet_lengths unimplemented");
raise Program_Error with "Unimplemented procedure set_iso_packet_lengths";
end Set_Iso_Packet_Lengths;
---------------------------
-- get_iso_packet_buffer --
---------------------------
function Get_Iso_Packet_Buffer
(Transfe : access Transfer;
Packet : Unsigned)
return access Unsigned_Char
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "get_iso_packet_buffer unimplemented");
return raise Program_Error with "Unimplemented function get_iso_packet_buffer";
end Get_Iso_Packet_Buffer;
----------------------------------
-- get_iso_packet_buffer_simple --
----------------------------------
function Get_Iso_Packet_Buffer_Simple
(Transfe : access Transfer;
Packet : Unsigned)
return access Unsigned_Char
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "get_iso_packet_buffer_simple unimplemented");
return raise Program_Error with "Unimplemented function get_iso_packet_buffer_simple";
end Get_Iso_Packet_Buffer_Simple;
----------------------
-- control_transfer --
----------------------
function Control_Transfer
(Dev_Handle : System.Address;
Request_Type : Interfaces.Unsigned_8;
BRequest : Interfaces.Unsigned_8;
WValue : Interfaces.Unsigned_16;
WIndex : Interfaces.Unsigned_16;
Data : access Unsigned_Char;
WLength : Interfaces.Unsigned_16;
Timeout : Unsigned)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "control_transfer unimplemented");
return raise Program_Error with "Unimplemented function control_transfer";
end Control_Transfer;
-------------------
-- bulk_transfer --
-------------------
function Bulk_Transfer
(Dev_Handle : System.Address;
Endpoint : Unsigned_Char;
Data : access Unsigned_Char;
Length : Int;
Actual_Length : access Int;
Timeout : Unsigned)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "bulk_transfer unimplemented");
return raise Program_Error with "Unimplemented function bulk_transfer";
end Bulk_Transfer;
------------------------
-- interrupt_transfer --
------------------------
function Interrupt_Transfer
(Dev_Handle : System.Address;
Endpoint : Unsigned_Char;
Data : access Unsigned_Char;
Length : Int;
Actual_Length : access Int;
Timeout : Unsigned)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "interrupt_transfer unimplemented");
return raise Program_Error with "Unimplemented function interrupt_transfer";
end Interrupt_Transfer;
--------------------
-- get_descriptor --
--------------------
function Get_Descriptor
(Dev_Handle : System.Address;
Desc_Type : Interfaces.Unsigned_8;
Desc_Index : Interfaces.Unsigned_8;
Data : access Unsigned_Char;
Length : Int)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "get_descriptor unimplemented");
return raise Program_Error with "Unimplemented function get_descriptor";
end Get_Descriptor;
---------------------------
-- get_string_descriptor --
---------------------------
function Get_String_Descriptor
(Dev_Handle : System.Address;
Desc_Index : Interfaces.Unsigned_8;
Langid : Interfaces.Unsigned_16;
Data : access Unsigned_Char;
Length : Int)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "get_string_descriptor unimplemented");
return raise Program_Error with "Unimplemented function get_string_descriptor";
end Get_String_Descriptor;
---------------------------------
-- get_string_descriptor_ascii --
---------------------------------
function Get_String_Descriptor_Ascii
(Dev_Handle : System.Address;
Desc_Index : Interfaces.Unsigned_8;
Data : access Unsigned_Char;
Length : Int)
return Int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "get_string_descriptor_ascii unimplemented");
return raise Program_Error with "Unimplemented function get_string_descriptor_ascii";
end Get_String_Descriptor_Ascii;
---------------------
-- try_lock_events --
---------------------
function Try_Lock_Events (ctx : context) return int is
begin
return Libusb_Try_Lock_Events(Ctx.Ctx);
end Try_Lock_Events;
-----------------
-- lock_events --
-----------------
procedure Lock_Events (ctx : context) is
begin
Libusb_Lock_Events(Ctx.Ctx);
end Lock_Events;
-------------------
-- unlock_events --
-------------------
procedure Unlock_Events (ctx : context) is
begin
Libusb_unLock_Events(Ctx.Ctx);
end Unlock_Events;
-----------------------
-- event_handling_ok --
-----------------------
function Event_Handling_Ok (ctx : context) return int is
begin
return Libusb_Event_Handling_Ok(Ctx.Ctx);
end Event_Handling_Ok;
--------------------------
-- event_handler_active --
--------------------------
function Event_Handler_Active (ctx : context) return int is
begin
return Libusb_Event_Handler_Active(Ctx.Ctx);
end Event_Handler_Active;
-----------------------------
-- interrupt_event_handler --
-----------------------------
procedure Interrupt_Event_Handler (ctx : context) is
begin
Libusb_Interrupt_Event_Handler(Ctx.Ctx);
end Interrupt_Event_Handler;
------------------------
-- lock_event_waiters --
------------------------
procedure Lock_Event_Waiters (ctx : context) is
begin
Libusb_Lock_Event_Waiters(Ctx.Ctx);
end Lock_Event_Waiters;
--------------------------
-- unlock_event_waiters --
--------------------------
procedure Unlock_Event_Waiters (ctx : context) is
begin
Libusb_Unlock_Event_Waiters(Ctx.Ctx);
end Unlock_Event_Waiters;
--------------------
-- wait_for_event --
--------------------
function Wait_For_Event (Ctx : Context; Tv : Duration) return Int is
L_tv : aliased GNAT.Calendar.Timeval := GNAT.Calendar.To_Timeval (Tv);
begin
return Libusb_Wait_For_Event (Ctx.Ctx, L_Tv'Access);
end Wait_For_Event;
---------------------------
-- handle_events_timeout --
---------------------------
function Handle_Events_Timeout
(ctx : context; tv : Duration) return int
is
L_tv : aliased GNAT.Calendar.Timeval := GNAT.Calendar.To_Timeval (Tv);
begin
return Libusb_Handle_Events_Timeout (Ctx.Ctx, L_Tv'Access);
end Handle_Events_Timeout;
-------------------------------------
-- handle_events_timeout_completed --
-------------------------------------
function Handle_Events_Timeout_Completed
(ctx : context;
completed : access int) return int
is
begin
return Libusb_Handle_Events_Completed (Ctx.Ctx, Completed);
end Handle_Events_Timeout_Completed;
-------------------
-- handle_events --
-------------------
function Handle_Events (ctx : context) return int is
begin
return Libusb_Handle_Events (Ctx.Ctx);
end Handle_Events;
-----------------------------
-- handle_events_completed --
-----------------------------
function Handle_Events_Completed
(ctx : context; completed : access int) return int
is
begin
return Libusb_Handle_Events_Completed (Ctx.Ctx,Completed);
end Handle_Events_Completed;
--------------------------
-- handle_events_locked --
--------------------------
function Handle_Events_Locked
(ctx : context; tv : Duration) return int
is
L_tv : aliased GNAT.Calendar.Timeval := GNAT.Calendar.To_Timeval (Tv);
begin
return Libusb_Handle_Events_Locked (Ctx.Ctx, L_Tv'Access);
end Handle_Events_Locked;
-----------------------------
-- pollfds_handle_timeouts --
-----------------------------
function Pollfds_Handle_Timeouts (ctx : context) return int is
begin
return Libusb_Pollfds_Handle_Timeouts (Ctx.Ctx);
end Pollfds_Handle_Timeouts;
----------------------
-- get_next_timeout --
----------------------
function Get_Next_Timeout
(Ctx : Context;
Tv : Duration)
return Int
is
L_tv : aliased GNAT.Calendar.Timeval := GNAT.Calendar.To_Timeval (Tv);
begin
return Libusb_Get_Next_Timeout (Ctx.Ctx, L_Tv'Access);
end Get_Next_Timeout;
-----------------
-- get_pollfds --
-----------------
function Get_Pollfds (ctx : context) return System.Address is
begin
return Libusb_Get_Pollfds (Ctx.Ctx);
end Get_Pollfds;
------------------
-- free_pollfds --
------------------
procedure Free_Pollfds (Pollfds : System.Address) is
begin
Libusb_Free_Pollfds (Pollfds);
end Free_Pollfds;
--------------------------
-- set_pollfd_notifiers --
--------------------------
procedure Set_Pollfd_Notifiers
(ctx : context;
added_cb : pollfd_added_cb;
removed_cb : pollfd_removed_cb;
user_data : System.Address)
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "set_pollfd_notifiers unimplemented");
raise Program_Error with "Unimplemented procedure set_pollfd_notifiers";
end Set_Pollfd_Notifiers;
-------------------------------
-- hotplug_register_callback --
-------------------------------
function Hotplug_Register_Callback
(ctx : context;
events : hotplug_event;
flags : hotplug_flag;
vendor_id : int;
product_id : int;
dev_class : int;
cb_fn : hotplug_callback_fn;
user_data : System.Address;
callback_handle : access hotplug_callback_handle) return int
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "hotplug_register_callback unimplemented");
return raise Program_Error with "Unimplemented function hotplug_register_callback";
end Hotplug_Register_Callback;
---------------------------------
-- hotplug_deregister_callback --
---------------------------------
procedure Hotplug_Deregister_Callback
(ctx : context; callback_handle : hotplug_callback_handle)
is
begin
-- Generated stub: replace with real body!
pragma Compile_Time_Warning (Standard.True, "hotplug_deregister_callback unimplemented");
raise Program_Error with "Unimplemented procedure hotplug_deregister_callback";
end Hotplug_Deregister_Callback;
end USB;
| 38.755068 | 171 | 0.657024 |
5e24d995b416f2f44af5d0697cf650c067a3ee89 | 6,762 | ads | Ada | source/league/ucd/matreshka-internals-unicode-ucd-core_00b1.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_00b1.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_00b1.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_00B1 is
pragma Preelaborate;
Group_00B1 : aliased constant Core_Second_Stage
:= (16#08# => -- B108
(Other_Letter, Wide,
LV, A_Letter, O_Letter, H2,
(Alphabetic
| Grapheme_Base
| ID_Continue
| ID_Start
| XID_Continue
| XID_Start => True,
others => False)),
16#24# => -- B124
(Other_Letter, Wide,
LV, A_Letter, O_Letter, H2,
(Alphabetic
| Grapheme_Base
| ID_Continue
| ID_Start
| XID_Continue
| XID_Start => True,
others => False)),
16#40# => -- B140
(Other_Letter, Wide,
LV, A_Letter, O_Letter, H2,
(Alphabetic
| Grapheme_Base
| ID_Continue
| ID_Start
| XID_Continue
| XID_Start => True,
others => False)),
16#5C# => -- B15C
(Other_Letter, Wide,
LV, A_Letter, O_Letter, H2,
(Alphabetic
| Grapheme_Base
| ID_Continue
| ID_Start
| XID_Continue
| XID_Start => True,
others => False)),
16#78# => -- B178
(Other_Letter, Wide,
LV, A_Letter, O_Letter, H2,
(Alphabetic
| Grapheme_Base
| ID_Continue
| ID_Start
| XID_Continue
| XID_Start => True,
others => False)),
16#94# => -- B194
(Other_Letter, Wide,
LV, A_Letter, O_Letter, H2,
(Alphabetic
| Grapheme_Base
| ID_Continue
| ID_Start
| XID_Continue
| XID_Start => True,
others => False)),
16#B0# => -- B1B0
(Other_Letter, Wide,
LV, A_Letter, O_Letter, H2,
(Alphabetic
| Grapheme_Base
| ID_Continue
| ID_Start
| XID_Continue
| XID_Start => True,
others => False)),
16#CC# => -- B1CC
(Other_Letter, Wide,
LV, A_Letter, O_Letter, H2,
(Alphabetic
| Grapheme_Base
| ID_Continue
| ID_Start
| XID_Continue
| XID_Start => True,
others => False)),
16#E8# => -- B1E8
(Other_Letter, Wide,
LV, A_Letter, O_Letter, H2,
(Alphabetic
| Grapheme_Base
| ID_Continue
| ID_Start
| XID_Continue
| XID_Start => True,
others => False)),
others =>
(Other_Letter, Wide,
LVT, A_Letter, O_Letter, H3,
(Alphabetic
| Grapheme_Base
| ID_Continue
| ID_Start
| XID_Continue
| XID_Start => True,
others => False)));
end Matreshka.Internals.Unicode.Ucd.Core_00B1;
| 43.346154 | 78 | 0.416445 |
9a7c4f81e65cf7e43360439c92e4620e9a4a718f | 3,847 | ads | Ada | awa/src/awa-events-configs.ads | fuzzysloth/ada-awa | f9b921eeea29841667a028f2fc4528e4385d247a | [
"Apache-2.0"
] | null | null | null | awa/src/awa-events-configs.ads | fuzzysloth/ada-awa | f9b921eeea29841667a028f2fc4528e4385d247a | [
"Apache-2.0"
] | null | null | null | awa/src/awa-events-configs.ads | fuzzysloth/ada-awa | f9b921eeea29841667a028f2fc4528e4385d247a | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- awa-events-configs -- Event configuration
-- Copyright (C) 2012, 2013 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Ada.Strings.Unbounded;
with Util.Beans.Objects;
with Util.Serialize.IO.XML;
with EL.Expressions;
with EL.Beans;
with EL.Contexts;
with ADO.Sessions;
with AWA.Events.Queues;
with AWA.Events.Services;
package AWA.Events.Configs is
-- ------------------------------
-- Event Config Controller
-- ------------------------------
type Controller_Config is record
Name : Util.Beans.Objects.Object;
Queue : AWA.Events.Queues.Queue_Ref;
Queue_Type : Util.Beans.Objects.Object;
Prop_Name : Util.Beans.Objects.Object;
Params : EL.Beans.Param_Vectors.Vector;
Priority : Integer;
Count : Integer;
Manager : AWA.Events.Services.Event_Manager_Access;
Action : EL.Expressions.Method_Expression;
Properties : EL.Beans.Param_Vectors.Vector;
Context : EL.Contexts.ELContext_Access;
Session : ADO.Sessions.Session;
Match : Ada.Strings.Unbounded.Unbounded_String;
end record;
type Controller_Config_Access is access all Controller_Config;
type Config_Fields is (FIELD_ON_EVENT, FIELD_NAME, FIELD_QUEUE_NAME, FIELD_ACTION,
FIELD_PROPERTY_NAME, FIELD_QUEUE, FIELD_TYPE,
FIELD_PROPERTY_VALUE,
FIELD_DISPATCHER, FIELD_DISPATCHER_QUEUE, FIELD_DISPATCHER_PRIORITY,
FIELD_DISPATCHER_COUNT);
-- Set the configuration value identified by <b>Value</b> after having parsed
-- the element identified by <b>Field</b>.
procedure Set_Member (Into : in out Controller_Config;
Field : in Config_Fields;
Value : in Util.Beans.Objects.Object);
-- Setup the XML parser to read the <b>queue</b> and <b>on-event</b> description.
-- For example:
--
-- <dispatcher name="async">
-- <queue name="async"/>
-- <queue name="persist"/>
-- <count>4</count>
-- <priority>10</priority>
-- </dispatcher>
--
-- <queue name="async" type="fifo">
-- <property name="size">254</property>
-- </queue>
--
-- <queue name="defer" type="persist">
-- </queue>
--
-- <on-event name="create-user" queue="async">
-- <action>#{mail.send}</action>
-- <property name="user">#{event.name}</property>
-- <property name="template">mail/welcome.xhtml</property>
-- </on-event>
--
-- This defines an event action called when the <b>create-user</b> event is posted.
-- The Ada bean <b>mail</b> is created and is populated with the <b>user</b> and
-- <b>template</b> properties. The Ada bean action method <b>send</b> is called.
generic
Reader : in out Util.Serialize.IO.XML.Parser;
Manager : in AWA.Events.Services.Event_Manager_Access;
Context : in EL.Contexts.ELContext_Access;
package Reader_Config is
Config : aliased Controller_Config;
end Reader_Config;
end AWA.Events.Configs;
| 39.255102 | 94 | 0.617364 |
19aab582fb0fc84a5be4764608792e4ace5a8577 | 3,132 | ads | Ada | tools/scitools/conf/understand/ada/ada12/a-coprnu.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | 1 | 2020-01-20T21:26:46.000Z | 2020-01-20T21:26:46.000Z | tools/scitools/conf/understand/ada/ada12/a-coprnu.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada12/a-coprnu.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT LIBRARY COMPONENTS --
-- --
-- A D A . C O N T A I N E R S . P R I M E _ N U M B E R S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2004-2009, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- This unit was originally developed by Matthew J Heaney. --
------------------------------------------------------------------------------
-- This package declares the prime numbers array used to implement hashed
-- containers. Bucket arrays are always allocated with a prime-number
-- length (computed using To_Prime below), as this produces better scatter
-- when hash values are folded.
package Ada.Containers.Prime_Numbers is
pragma Pure;
type Primes_Type is array (Positive range <>) of Hash_Type;
Primes : constant Primes_Type :=
(53, 97, 193, 389, 769,
1543, 3079, 6151, 12289, 24593,
49157, 98317, 196613, 393241, 786433,
1572869, 3145739, 6291469, 12582917, 25165843,
50331653, 100663319, 201326611, 402653189, 805306457,
1610612741, 3221225473, 4294967291);
function To_Prime (Length : Count_Type) return Hash_Type;
-- Returns the smallest value in Primes not less than Length
end Ada.Containers.Prime_Numbers;
| 60.230769 | 78 | 0.400064 |
19c32e614d178b2b41e2a55ba4f782fea02ed535 | 11,560 | ads | Ada | arch/ARM/RP/svd/rp2040/rp_svd-adc.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 2 | 2018-05-16T03:56:39.000Z | 2019-07-31T13:53:56.000Z | arch/ARM/RP/svd/rp2040/rp_svd-adc.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | arch/ARM/RP/svd/rp2040/rp_svd-adc.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;
-- Control and data interface to SAR ADC
package RP_SVD.ADC is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype CS_AINSEL_Field is HAL.UInt3;
subtype CS_RROBIN_Field is HAL.UInt5;
-- ADC Control and Status
type CS_Register is record
-- Power on ADC and enable its clock.\n 1 - enabled. 0 - disabled.
EN : Boolean := False;
-- Power on temperature sensor. 1 - enabled. 0 - disabled.
TS_EN : Boolean := False;
-- After a write operation all bits in the field are cleared (set to
-- zero). Start a single conversion. Self-clearing. Ignored if
-- start_many is asserted.
START_ONCE : Boolean := False;
-- Continuously perform conversions whilst this bit is 1. A new
-- conversion will start immediately after the previous finishes.
START_MANY : Boolean := False;
-- unspecified
Reserved_4_7 : HAL.UInt4 := 16#0#;
-- Read-only. 1 if the ADC is ready to start a new conversion. Implies
-- any previous conversion has completed.\n 0 whilst conversion in
-- progress.
READY : Boolean := False;
-- Read-only. The most recent ADC conversion encountered an error;
-- result is undefined or noisy.
ERR : Boolean := False;
-- Write data bit of one shall clear (set to zero) the corresponding bit
-- in the field. Some past ADC conversion encountered an error. Write 1
-- to clear.
ERR_STICKY : Boolean := False;
-- unspecified
Reserved_11_11 : HAL.Bit := 16#0#;
-- Select analog mux input. Updated automatically in round-robin mode.
AINSEL : CS_AINSEL_Field := 16#0#;
-- unspecified
Reserved_15_15 : HAL.Bit := 16#0#;
-- Round-robin sampling. 1 bit per channel. Set all bits to 0 to
-- disable.\n Otherwise, the ADC will cycle through each enabled channel
-- in a round-robin fashion.\n The first channel to be sampled will be
-- the one currently indicated by AINSEL.\n AINSEL will be updated after
-- each conversion with the newly-selected channel.
RROBIN : CS_RROBIN_Field := 16#0#;
-- unspecified
Reserved_21_31 : HAL.UInt11 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for CS_Register use record
EN at 0 range 0 .. 0;
TS_EN at 0 range 1 .. 1;
START_ONCE at 0 range 2 .. 2;
START_MANY at 0 range 3 .. 3;
Reserved_4_7 at 0 range 4 .. 7;
READY at 0 range 8 .. 8;
ERR at 0 range 9 .. 9;
ERR_STICKY at 0 range 10 .. 10;
Reserved_11_11 at 0 range 11 .. 11;
AINSEL at 0 range 12 .. 14;
Reserved_15_15 at 0 range 15 .. 15;
RROBIN at 0 range 16 .. 20;
Reserved_21_31 at 0 range 21 .. 31;
end record;
subtype RESULT_RESULT_Field is HAL.UInt12;
-- Result of most recent ADC conversion
type RESULT_Register is record
-- Read-only.
RESULT : RESULT_RESULT_Field;
-- unspecified
Reserved_12_31 : HAL.UInt20;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for RESULT_Register use record
RESULT at 0 range 0 .. 11;
Reserved_12_31 at 0 range 12 .. 31;
end record;
subtype FCS_LEVEL_Field is HAL.UInt4;
subtype FCS_THRESH_Field is HAL.UInt4;
-- FIFO control and status
type FCS_Register is record
-- If 1: write result to the FIFO after each conversion.
EN : Boolean := False;
-- If 1: FIFO results are right-shifted to be one byte in size. Enables
-- DMA to byte buffers.
SHIFT : Boolean := False;
-- If 1: conversion error bit appears in the FIFO alongside the result
ERR : Boolean := False;
-- If 1: assert DMA requests when FIFO contains data
DREQ_EN : Boolean := False;
-- unspecified
Reserved_4_7 : HAL.UInt4 := 16#0#;
-- Read-only.
EMPTY : Boolean := False;
-- Read-only.
FULL : Boolean := False;
-- Write data bit of one shall clear (set to zero) the corresponding bit
-- in the field. 1 if the FIFO has been underflowed. Write 1 to clear.
UNDER : Boolean := False;
-- Write data bit of one shall clear (set to zero) the corresponding bit
-- in the field. 1 if the FIFO has been overflowed. Write 1 to clear.
OVER : Boolean := False;
-- unspecified
Reserved_12_15 : HAL.UInt4 := 16#0#;
-- Read-only. The number of conversion results currently waiting in the
-- FIFO
LEVEL : FCS_LEVEL_Field := 16#0#;
-- unspecified
Reserved_20_23 : HAL.UInt4 := 16#0#;
-- DREQ/IRQ asserted when level >= threshold
THRESH : FCS_THRESH_Field := 16#0#;
-- unspecified
Reserved_28_31 : HAL.UInt4 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for FCS_Register use record
EN at 0 range 0 .. 0;
SHIFT at 0 range 1 .. 1;
ERR at 0 range 2 .. 2;
DREQ_EN at 0 range 3 .. 3;
Reserved_4_7 at 0 range 4 .. 7;
EMPTY at 0 range 8 .. 8;
FULL at 0 range 9 .. 9;
UNDER at 0 range 10 .. 10;
OVER at 0 range 11 .. 11;
Reserved_12_15 at 0 range 12 .. 15;
LEVEL at 0 range 16 .. 19;
Reserved_20_23 at 0 range 20 .. 23;
THRESH at 0 range 24 .. 27;
Reserved_28_31 at 0 range 28 .. 31;
end record;
subtype FIFO_VAL_Field is HAL.UInt12;
-- Conversion result FIFO
type FIFO_Register is record
-- Read-only.
VAL : FIFO_VAL_Field;
-- unspecified
Reserved_12_14 : HAL.UInt3;
-- Read-only. 1 if this particular sample experienced a conversion
-- error. Remains in the same location if the sample is shifted.
ERR : Boolean;
-- unspecified
Reserved_16_31 : HAL.UInt16;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for FIFO_Register use record
VAL at 0 range 0 .. 11;
Reserved_12_14 at 0 range 12 .. 14;
ERR at 0 range 15 .. 15;
Reserved_16_31 at 0 range 16 .. 31;
end record;
subtype DIV_FRAC_Field is HAL.UInt8;
subtype DIV_INT_Field is HAL.UInt16;
-- Clock divider. If non-zero, CS_START_MANY will start conversions\n at
-- regular intervals rather than back-to-back.\n The divider is reset when
-- either of these fields are written.\n Total period is 1 + INT + FRAC /
-- 256
type DIV_Register is record
-- Fractional part of clock divisor. First-order delta-sigma.
FRAC : DIV_FRAC_Field := 16#0#;
-- Integer part of clock divisor.
INT : DIV_INT_Field := 16#0#;
-- unspecified
Reserved_24_31 : HAL.UInt8 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for DIV_Register use record
FRAC at 0 range 0 .. 7;
INT at 0 range 8 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
-- Raw Interrupts
type INTR_Register is record
-- Read-only. Triggered when the sample FIFO reaches a certain level.\n
-- This level can be programmed via the FCS_THRESH field.
FIFO : Boolean;
-- unspecified
Reserved_1_31 : HAL.UInt31;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for INTR_Register use record
FIFO at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
-- Interrupt Enable
type INTE_Register is record
-- Triggered when the sample FIFO reaches a certain level.\n This level
-- can be programmed via the FCS_THRESH field.
FIFO : Boolean := False;
-- unspecified
Reserved_1_31 : HAL.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for INTE_Register use record
FIFO at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
-- Interrupt Force
type INTF_Register is record
-- Triggered when the sample FIFO reaches a certain level.\n This level
-- can be programmed via the FCS_THRESH field.
FIFO : Boolean := False;
-- unspecified
Reserved_1_31 : HAL.UInt31 := 16#0#;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for INTF_Register use record
FIFO at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
-- Interrupt status after masking & forcing
type INTS_Register is record
-- Read-only. Triggered when the sample FIFO reaches a certain level.\n
-- This level can be programmed via the FCS_THRESH field.
FIFO : Boolean;
-- unspecified
Reserved_1_31 : HAL.UInt31;
end record
with Volatile_Full_Access, Object_Size => 32,
Bit_Order => System.Low_Order_First;
for INTS_Register use record
FIFO at 0 range 0 .. 0;
Reserved_1_31 at 0 range 1 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Control and data interface to SAR ADC
type ADC_Peripheral is record
-- ADC Control and Status
CS : aliased CS_Register;
-- Result of most recent ADC conversion
RESULT : aliased RESULT_Register;
-- FIFO control and status
FCS : aliased FCS_Register;
-- Conversion result FIFO
FIFO : aliased FIFO_Register;
-- Clock divider. If non-zero, CS_START_MANY will start conversions\n at
-- regular intervals rather than back-to-back.\n The divider is reset
-- when either of these fields are written.\n Total period is 1 + INT +
-- FRAC / 256
DIV : aliased DIV_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 ADC_Peripheral use record
CS at 16#0# range 0 .. 31;
RESULT at 16#4# range 0 .. 31;
FCS at 16#8# range 0 .. 31;
FIFO at 16#C# range 0 .. 31;
DIV at 16#10# range 0 .. 31;
INTR at 16#14# range 0 .. 31;
INTE at 16#18# range 0 .. 31;
INTF at 16#1C# range 0 .. 31;
INTS at 16#20# range 0 .. 31;
end record;
-- Control and data interface to SAR ADC
ADC_Periph : aliased ADC_Peripheral
with Import, Address => ADC_Base;
end RP_SVD.ADC;
| 36.238245 | 79 | 0.6 |
5e49e5676967319383233af9e5ec0666a2121fd7 | 3,124 | ads | Ada | tools/ayacc/src/symbol_table.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | lib/ayacc/symbol_table.ads | alvaromb/Compilemon | de5f88f084705868d38e301d95bb4a19a46a1156 | [
"MIT"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | lib/ayacc/symbol_table.ads | alvaromb/Compilemon | de5f88f084705868d38e301d95bb4a19a46a1156 | [
"MIT"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | -- Copyright (c) 1990 Regents of the University of California.
-- All rights reserved.
--
-- The primary authors of ayacc were David Taback and Deepak Tolani.
-- Enhancements were made by Ronald J. Schmalz.
--
-- Send requests for ayacc information to [email protected]
-- Send bug reports for ayacc to [email protected]
--
-- Redistribution and use in source and binary forms are permitted
-- provided that the above copyright notice and this paragraph are
-- duplicated in all such forms and that any documentation,
-- advertising materials, and other materials related to such
-- distribution and use acknowledge that the software was developed
-- by the University of California, Irvine. The name of the
-- University may not be used to endorse or promote products derived
-- from this software without specific prior written permission.
-- THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
-- IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
-- WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
-- Module : symbol_table.ada
-- Component of : ayacc
-- Version : 1.2
-- Date : 11/21/86 12:37:38
-- SCCS File : disk21~/rschm/hasee/sccs/ayacc/sccs/sxsymbol_table.ada
-- $Header: symbol_table.a,v 0.1 86/04/01 15:13:41 ada Exp $
-- $Log: symbol_table.a,v $
-- Revision 0.1 86/04/01 15:13:41 ada
-- This version fixes some minor bugs with empty grammars
-- and $$ expansion. It also uses vads5.1b enhancements
-- such as pragma inline.
--
--
-- Revision 0.0 86/02/19 18:47:05 ada
--
-- These files comprise the initial version of Ayacc
-- designed and implemented by David Taback and Deepak Tolani.
-- Ayacc has been compiled and tested under the Verdix Ada compiler
-- version 4.06 on a vax 11/750 running Unix 4.2BSD.
--
package Symbol_Table is
type Symbol_Type is (Start, Nonterminal, Terminal);
type Grammar_Symbol is range -5_000..5_000;
type Precedence is range 0..5_000;
type Associativity is (Left_Associative, Right_Associative,
Nonassociative, Undefined);
function Insert_Identifier(Name: in String) return Grammar_Symbol;
function Insert_Terminal (Name: String;
Prec: Precedence := 0;
Assoc: Associativity := Undefined)
return Grammar_Symbol;
function Get_Associativity(ID: Grammar_Symbol) return Associativity;
function Get_Precedence (ID: Grammar_Symbol) return Precedence;
function Get_Symbol_Name (ID: Grammar_Symbol) return String;
function First_Symbol (Kind: Symbol_Type) return Grammar_Symbol;
function Last_Symbol (Kind: Symbol_Type) return Grammar_Symbol;
function Start_Symbol return Grammar_Symbol;
function End_Symbol return Grammar_Symbol;
function Is_Terminal (ID: Grammar_Symbol) return Boolean;
function Is_Nonterminal (ID: Grammar_Symbol) return Boolean;
Illegal_Entry, Redefined_Precedence_Error : exception;
--RJS pragma inline(is_terminal, is_nonterminal);
end Symbol_Table;
| 39.05 | 72 | 0.716069 |
04b9bc379ab98af153538eca791e40368ea95896 | 168,003 | adb | Ada | apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d/conv2d/hls_target/.autopilot/db/Loop_1_proc.bind.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | 1 | 2020-06-18T16:51:39.000Z | 2020-06-18T16:51:39.000Z | apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d/conv2d/hls_target/.autopilot/db/Loop_1_proc.bind.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | null | null | null | apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d/conv2d/hls_target/.autopilot/db/Loop_1_proc.bind.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | 1 | 2020-03-18T00:43:22.000Z | 2020-03-18T00:43:22.000Z | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="14">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>Loop_1_proc</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>p_hw_input_stencil_stream_V_value_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>_hw_input_stencil_stream_to_hw_output.V.value.V</originalName>
<rtlName></rtlName>
<coreName>FIFO_SRL</coreName>
</Obj>
<bitwidth>72</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs class_id="7" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_2">
<Value>
<Obj>
<type>1</type>
<id>2</id>
<name>hw_output_V_value_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>stream&lt;AxiPackedStencil&lt;unsigned char, 1, 1, 1, 1&gt; &gt;.V.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<direction>1</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>hw_output_V_last_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>stream&lt;AxiPackedStencil&lt;unsigned char, 1, 1, 1, 1&gt; &gt;.V.last.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>1</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>59</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_4">
<Value>
<Obj>
<type>0</type>
<id>6</id>
<name></name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>67</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="10" tracking_level="0" version="0">
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second class_id="11" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="12" tracking_level="0" version="0">
<first class_id="13" tracking_level="0" version="0">
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>67</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>73</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_5">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>indvar_flatten</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>219</item>
<item>220</item>
<item>221</item>
<item>222</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>p_hw_output_y_scan_1</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>223</item>
<item>224</item>
<item>225</item>
<item>226</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>p_hw_output_x_scan_2</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>_hw_output_x___scan_dim_0</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>227</item>
<item>228</item>
<item>229</item>
<item>230</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>exitcond_flatten</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>231</item>
<item>233</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>indvar_flatten_next</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>3</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>234</item>
<item>236</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>237</item>
<item>238</item>
<item>239</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name>exitcond8</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>69</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>74</item>
<item>76</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>17</id>
<name>p_hw_output_x_scan_s</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>77</item>
<item>79</item>
<item>80</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>18</id>
<name>tmp_mid1</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>150</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>150</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>81</item>
<item>82</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>tmp5</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>150</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>150</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>83</item>
<item>85</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>tmp_mid2</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>150</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>150</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>86</item>
<item>87</item>
<item>88</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>p_hw_output_y_scan_2</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>67</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>67</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>89</item>
<item>90</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>p_hw_output_y_scan_s</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>91</item>
<item>92</item>
<item>93</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>tmp_value_V</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>72</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>95</item>
<item>96</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>26</id>
<name>p_309</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_309</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>97</item>
</oprand_edges>
<opcode>trunc</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>27</id>
<name>p_312_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>86</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>86</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>98</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>p_321</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_321</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>100</item>
<item>101</item>
<item>103</item>
<item>105</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>p_324_cast_cast</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>75</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>106</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>p_345</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_345</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>107</item>
<item>108</item>
<item>110</item>
<item>112</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>p_348_cast_cast</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>75</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>113</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>p_357</name>
<fileName>../../../lib_files/Stencil.h</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>122</lineNumber>
<contextFuncName>operator Stencil</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>2</count>
<item_version>0</item_version>
<item>
<first>
<first>../../../lib_files/Stencil.h</first>
<second>operator Stencil</second>
</first>
<second>122</second>
</item>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_357</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>114</item>
<item>115</item>
<item>117</item>
<item>119</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>p_360_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>142</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>142</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>120</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>tmp_2</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>122</item>
<item>123</item>
<item>125</item>
<item>127</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>p_317</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>92</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>92</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_317</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>129</item>
<item>130</item>
<item>132</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>p_318_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>93</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>93</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>133</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>p_319</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_319</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>9</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>134</item>
<item>135</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>p_319_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>94</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>94</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>136</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>tmp_3</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>137</item>
<item>138</item>
<item>140</item>
<item>142</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>p_329</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>106</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>106</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_329</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>143</item>
<item>144</item>
<item>145</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>p_330_cast_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>108</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>108</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>146</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>tmp1</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>108</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>108</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>147</item>
<item>148</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>tmp1_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>108</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>108</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>149</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_37">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>p_331</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>108</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>108</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_331</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>150</item>
<item>151</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>p_331_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>108</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>108</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>152</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>46</id>
<name>tmp_4</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>6</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>154</item>
<item>155</item>
<item>157</item>
<item>159</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name>p_335</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>113</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>113</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_335</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>161</item>
<item>162</item>
<item>163</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>48</id>
<name>p_336_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>114</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>114</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>164</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_42">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name>tmp_5</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>165</item>
<item>166</item>
<item>168</item>
<item>170</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_43">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name>p_341</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>120</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_341</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>171</item>
<item>172</item>
<item>173</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_44">
<Value>
<Obj>
<type>0</type>
<id>51</id>
<name>p_342_cast_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>120</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>120</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>174</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_45">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name>tmp_6</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>75</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>75</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>7</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>175</item>
<item>176</item>
<item>178</item>
<item>180</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_46">
<Value>
<Obj>
<type>0</type>
<id>53</id>
<name>p_353</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>134</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>134</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_353</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>181</item>
<item>182</item>
<item>183</item>
</oprand_edges>
<opcode>bitconcatenate</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_47">
<Value>
<Obj>
<type>0</type>
<id>54</id>
<name>p_354_cast_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>136</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>184</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_48">
<Value>
<Obj>
<type>0</type>
<id>55</id>
<name>tmp2</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>136</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>185</item>
<item>186</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_49">
<Value>
<Obj>
<type>0</type>
<id>56</id>
<name>tmp4</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>136</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>187</item>
<item>188</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_50">
<Value>
<Obj>
<type>0</type>
<id>57</id>
<name>tmp4_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>136</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>189</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_51">
<Value>
<Obj>
<type>0</type>
<id>58</id>
<name>tmp3</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>136</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>10</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>190</item>
<item>191</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_52">
<Value>
<Obj>
<type>0</type>
<id>59</id>
<name>tmp3_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>136</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>192</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_53">
<Value>
<Obj>
<type>0</type>
<id>60</id>
<name>p_355</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>136</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_355</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>193</item>
<item>194</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_54">
<Value>
<Obj>
<type>0</type>
<id>61</id>
<name>p_355_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>136</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>136</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>195</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_55">
<Value>
<Obj>
<type>0</type>
<id>62</id>
<name>p_361</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>143</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>143</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_361</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>12</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>196</item>
<item>197</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_56">
<Value>
<Obj>
<type>0</type>
<id>63</id>
<name>p_364</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>147</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>147</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_364</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>8</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>199</item>
<item>200</item>
<item>202</item>
<item>204</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_57">
<Value>
<Obj>
<type>0</type>
<id>64</id>
<name>tmp_s</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>150</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>150</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>205</item>
<item>206</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_58">
<Value>
<Obj>
<type>0</type>
<id>65</id>
<name>tmp_last_V</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>150</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>150</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.last.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>207</item>
<item>208</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_59">
<Value>
<Obj>
<type>0</type>
<id>66</id>
<name></name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>155</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>155</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>210</item>
<item>211</item>
<item>212</item>
<item>213</item>
<item>214</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_60">
<Value>
<Obj>
<type>0</type>
<id>68</id>
<name>p_hw_output_x_scan_1</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>69</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_hw_output_x___scan_dim_0</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>215</item>
<item>216</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_61">
<Value>
<Obj>
<type>0</type>
<id>69</id>
<name></name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</fileDirectory>
<lineNumber>69</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/paper_apps_8_shifts/conv2d</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>69</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>217</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_62">
<Value>
<Obj>
<type>0</type>
<id>71</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>25</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_63">
<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>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>2</content>
</item>
<item class_id_reference="16" object_id="_64">
<Value>
<Obj>
<type>2</type>
<id>78</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>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_65">
<Value>
<Obj>
<type>2</type>
<id>84</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>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_66">
<Value>
<Obj>
<type>2</type>
<id>102</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>16</content>
</item>
<item class_id_reference="16" object_id="_67">
<Value>
<Obj>
<type>2</type>
<id>104</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>23</content>
</item>
<item class_id_reference="16" object_id="_68">
<Value>
<Obj>
<type>2</type>
<id>109</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>48</content>
</item>
<item class_id_reference="16" object_id="_69">
<Value>
<Obj>
<type>2</type>
<id>111</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>55</content>
</item>
<item class_id_reference="16" object_id="_70">
<Value>
<Obj>
<type>2</type>
<id>116</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>64</content>
</item>
<item class_id_reference="16" object_id="_71">
<Value>
<Obj>
<type>2</type>
<id>118</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>71</content>
</item>
<item class_id_reference="16" object_id="_72">
<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>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>8</content>
</item>
<item class_id_reference="16" object_id="_73">
<Value>
<Obj>
<type>2</type>
<id>126</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>14</content>
</item>
<item class_id_reference="16" object_id="_74">
<Value>
<Obj>
<type>2</type>
<id>131</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="_75">
<Value>
<Obj>
<type>2</type>
<id>139</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>24</content>
</item>
<item class_id_reference="16" object_id="_76">
<Value>
<Obj>
<type>2</type>
<id>141</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>30</content>
</item>
<item class_id_reference="16" object_id="_77">
<Value>
<Obj>
<type>2</type>
<id>156</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>32</content>
</item>
<item class_id_reference="16" object_id="_78">
<Value>
<Obj>
<type>2</type>
<id>158</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>37</content>
</item>
<item class_id_reference="16" object_id="_79">
<Value>
<Obj>
<type>2</type>
<id>167</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>40</content>
</item>
<item class_id_reference="16" object_id="_80">
<Value>
<Obj>
<type>2</type>
<id>169</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>46</content>
</item>
<item class_id_reference="16" object_id="_81">
<Value>
<Obj>
<type>2</type>
<id>177</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>56</content>
</item>
<item class_id_reference="16" object_id="_82">
<Value>
<Obj>
<type>2</type>
<id>179</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>62</content>
</item>
<item class_id_reference="16" object_id="_83">
<Value>
<Obj>
<type>2</type>
<id>201</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>4</content>
</item>
<item class_id_reference="16" object_id="_84">
<Value>
<Obj>
<type>2</type>
<id>203</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>11</content>
</item>
<item class_id_reference="16" object_id="_85">
<Value>
<Obj>
<type>2</type>
<id>218</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="_86">
<Value>
<Obj>
<type>2</type>
<id>232</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>4</content>
</item>
<item class_id_reference="16" object_id="_87">
<Value>
<Obj>
<type>2</type>
<id>235</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>1</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_88">
<Obj>
<type>3</type>
<id>7</id>
<name>newFuncRoot</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>6</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_89">
<Obj>
<type>3</type>
<id>14</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>8</item>
<item>9</item>
<item>10</item>
<item>11</item>
<item>12</item>
<item>13</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_90">
<Obj>
<type>3</type>
<id>70</id>
<name>.preheader.preheader</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>51</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>25</item>
<item>26</item>
<item>27</item>
<item>28</item>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>36</item>
<item>37</item>
<item>38</item>
<item>39</item>
<item>40</item>
<item>41</item>
<item>42</item>
<item>43</item>
<item>44</item>
<item>45</item>
<item>46</item>
<item>47</item>
<item>48</item>
<item>49</item>
<item>50</item>
<item>51</item>
<item>52</item>
<item>53</item>
<item>54</item>
<item>55</item>
<item>56</item>
<item>57</item>
<item>58</item>
<item>59</item>
<item>60</item>
<item>61</item>
<item>62</item>
<item>63</item>
<item>64</item>
<item>65</item>
<item>66</item>
<item>68</item>
<item>69</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_91">
<Obj>
<type>3</type>
<id>72</id>
<name>.exitStub</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>71</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>122</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_92">
<id>73</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>6</sink_obj>
</item>
<item class_id_reference="20" object_id="_93">
<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="_94">
<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="_95">
<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="_96">
<id>79</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_97">
<id>80</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_98">
<id>81</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_99">
<id>82</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>18</sink_obj>
</item>
<item class_id_reference="20" object_id="_100">
<id>83</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_101">
<id>85</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_102">
<id>86</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_103">
<id>87</id>
<edge_type>1</edge_type>
<source_obj>18</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_104">
<id>88</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_105">
<id>89</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_106">
<id>90</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_107">
<id>91</id>
<edge_type>1</edge_type>
<source_obj>16</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_108">
<id>92</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_109">
<id>93</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_110">
<id>96</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_111">
<id>97</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>26</sink_obj>
</item>
<item class_id_reference="20" object_id="_112">
<id>98</id>
<edge_type>1</edge_type>
<source_obj>26</source_obj>
<sink_obj>27</sink_obj>
</item>
<item class_id_reference="20" object_id="_113">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_114">
<id>103</id>
<edge_type>1</edge_type>
<source_obj>102</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_115">
<id>105</id>
<edge_type>1</edge_type>
<source_obj>104</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_116">
<id>106</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_117">
<id>108</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_118">
<id>110</id>
<edge_type>1</edge_type>
<source_obj>109</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_119">
<id>112</id>
<edge_type>1</edge_type>
<source_obj>111</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_120">
<id>113</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_121">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_122">
<id>117</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_123">
<id>119</id>
<edge_type>1</edge_type>
<source_obj>118</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_124">
<id>120</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_125">
<id>123</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_126">
<id>125</id>
<edge_type>1</edge_type>
<source_obj>124</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_127">
<id>127</id>
<edge_type>1</edge_type>
<source_obj>126</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_128">
<id>130</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_129">
<id>132</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_130">
<id>133</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_131">
<id>134</id>
<edge_type>1</edge_type>
<source_obj>27</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_132">
<id>135</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_133">
<id>136</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_134">
<id>138</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_135">
<id>140</id>
<edge_type>1</edge_type>
<source_obj>139</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_136">
<id>142</id>
<edge_type>1</edge_type>
<source_obj>141</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_137">
<id>144</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_138">
<id>145</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_139">
<id>146</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_140">
<id>147</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_141">
<id>148</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_142">
<id>149</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_143">
<id>150</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_144">
<id>151</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_145">
<id>152</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_146">
<id>155</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_147">
<id>157</id>
<edge_type>1</edge_type>
<source_obj>156</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_148">
<id>159</id>
<edge_type>1</edge_type>
<source_obj>158</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_149">
<id>162</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_150">
<id>163</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_151">
<id>164</id>
<edge_type>1</edge_type>
<source_obj>47</source_obj>
<sink_obj>48</sink_obj>
</item>
<item class_id_reference="20" object_id="_152">
<id>166</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_153">
<id>168</id>
<edge_type>1</edge_type>
<source_obj>167</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_154">
<id>170</id>
<edge_type>1</edge_type>
<source_obj>169</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_155">
<id>172</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_156">
<id>173</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_157">
<id>174</id>
<edge_type>1</edge_type>
<source_obj>50</source_obj>
<sink_obj>51</sink_obj>
</item>
<item class_id_reference="20" object_id="_158">
<id>176</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_159">
<id>178</id>
<edge_type>1</edge_type>
<source_obj>177</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_160">
<id>180</id>
<edge_type>1</edge_type>
<source_obj>179</source_obj>
<sink_obj>52</sink_obj>
</item>
<item class_id_reference="20" object_id="_161">
<id>182</id>
<edge_type>1</edge_type>
<source_obj>52</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_162">
<id>183</id>
<edge_type>1</edge_type>
<source_obj>131</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_163">
<id>184</id>
<edge_type>1</edge_type>
<source_obj>53</source_obj>
<sink_obj>54</sink_obj>
</item>
<item class_id_reference="20" object_id="_164">
<id>185</id>
<edge_type>1</edge_type>
<source_obj>48</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_165">
<id>186</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>55</sink_obj>
</item>
<item class_id_reference="20" object_id="_166">
<id>187</id>
<edge_type>1</edge_type>
<source_obj>54</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_167">
<id>188</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>56</sink_obj>
</item>
<item class_id_reference="20" object_id="_168">
<id>189</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>57</sink_obj>
</item>
<item class_id_reference="20" object_id="_169">
<id>190</id>
<edge_type>1</edge_type>
<source_obj>51</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_170">
<id>191</id>
<edge_type>1</edge_type>
<source_obj>57</source_obj>
<sink_obj>58</sink_obj>
</item>
<item class_id_reference="20" object_id="_171">
<id>192</id>
<edge_type>1</edge_type>
<source_obj>58</source_obj>
<sink_obj>59</sink_obj>
</item>
<item class_id_reference="20" object_id="_172">
<id>193</id>
<edge_type>1</edge_type>
<source_obj>55</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_173">
<id>194</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>60</sink_obj>
</item>
<item class_id_reference="20" object_id="_174">
<id>195</id>
<edge_type>1</edge_type>
<source_obj>60</source_obj>
<sink_obj>61</sink_obj>
</item>
<item class_id_reference="20" object_id="_175">
<id>196</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>62</sink_obj>
</item>
<item class_id_reference="20" object_id="_176">
<id>197</id>
<edge_type>1</edge_type>
<source_obj>61</source_obj>
<sink_obj>62</sink_obj>
</item>
<item class_id_reference="20" object_id="_177">
<id>200</id>
<edge_type>1</edge_type>
<source_obj>62</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_178">
<id>202</id>
<edge_type>1</edge_type>
<source_obj>201</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_179">
<id>204</id>
<edge_type>1</edge_type>
<source_obj>203</source_obj>
<sink_obj>63</sink_obj>
</item>
<item class_id_reference="20" object_id="_180">
<id>205</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_181">
<id>206</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>64</sink_obj>
</item>
<item class_id_reference="20" object_id="_182">
<id>207</id>
<edge_type>1</edge_type>
<source_obj>64</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_183">
<id>208</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>65</sink_obj>
</item>
<item class_id_reference="20" object_id="_184">
<id>211</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>66</sink_obj>
</item>
<item class_id_reference="20" object_id="_185">
<id>212</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>66</sink_obj>
</item>
<item class_id_reference="20" object_id="_186">
<id>213</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>66</sink_obj>
</item>
<item class_id_reference="20" object_id="_187">
<id>214</id>
<edge_type>1</edge_type>
<source_obj>65</source_obj>
<sink_obj>66</sink_obj>
</item>
<item class_id_reference="20" object_id="_188">
<id>215</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_189">
<id>216</id>
<edge_type>1</edge_type>
<source_obj>17</source_obj>
<sink_obj>68</sink_obj>
</item>
<item class_id_reference="20" object_id="_190">
<id>217</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>69</sink_obj>
</item>
<item class_id_reference="20" object_id="_191">
<id>219</id>
<edge_type>1</edge_type>
<source_obj>218</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_192">
<id>220</id>
<edge_type>2</edge_type>
<source_obj>7</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_193">
<id>221</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_194">
<id>222</id>
<edge_type>2</edge_type>
<source_obj>70</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="20" object_id="_195">
<id>223</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_196">
<id>224</id>
<edge_type>2</edge_type>
<source_obj>7</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_197">
<id>225</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_198">
<id>226</id>
<edge_type>2</edge_type>
<source_obj>70</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_199">
<id>227</id>
<edge_type>1</edge_type>
<source_obj>78</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_200">
<id>228</id>
<edge_type>2</edge_type>
<source_obj>7</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_201">
<id>229</id>
<edge_type>1</edge_type>
<source_obj>68</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_202">
<id>230</id>
<edge_type>2</edge_type>
<source_obj>70</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="20" object_id="_203">
<id>231</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_204">
<id>233</id>
<edge_type>1</edge_type>
<source_obj>232</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_205">
<id>234</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_206">
<id>236</id>
<edge_type>1</edge_type>
<source_obj>235</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_207">
<id>237</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_208">
<id>238</id>
<edge_type>2</edge_type>
<source_obj>70</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_209">
<id>239</id>
<edge_type>2</edge_type>
<source_obj>72</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_210">
<id>298</id>
<edge_type>2</edge_type>
<source_obj>7</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_211">
<id>299</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>72</sink_obj>
</item>
<item class_id_reference="20" object_id="_212">
<id>300</id>
<edge_type>2</edge_type>
<source_obj>14</source_obj>
<sink_obj>70</sink_obj>
</item>
<item class_id_reference="20" object_id="_213">
<id>301</id>
<edge_type>2</edge_type>
<source_obj>70</source_obj>
<sink_obj>14</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="_214">
<mId>1</mId>
<mTag>Loop_1_proc</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>9</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_215">
<mId>2</mId>
<mTag>Entry</mTag>
<mType>0</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>1</count>
<item_version>0</item_version>
<item>7</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_216">
<mId>3</mId>
<mTag>Loop 1</mTag>
<mType>1</mType>
<sub_regions>
<count>0</count>
<item_version>0</item_version>
</sub_regions>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>14</item>
<item>70</item>
</basic_blocks>
<mII>1</mII>
<mDepth>5</mDepth>
<mMinTripCount>4</mMinTripCount>
<mMaxTripCount>4</mMaxTripCount>
<mMinLatency>7</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
<item class_id_reference="22" object_id="_217">
<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>72</item>
</basic_blocks>
<mII>-1</mII>
<mDepth>-1</mDepth>
<mMinTripCount>-1</mMinTripCount>
<mMaxTripCount>-1</mMaxTripCount>
<mMinLatency>0</mMinLatency>
<mMaxLatency>-1</mMaxLatency>
<mIsDfPipe>0</mIsDfPipe>
<mDfPipe class_id="-1"></mDfPipe>
</item>
</cdfg_regions>
<fsm class_id="24" tracking_level="1" version="0" object_id="_218">
<states class_id="25" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="26" tracking_level="1" version="0" object_id="_219">
<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="_220">
<id>4</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_221">
<id>5</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_222">
<id>6</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_223">
<id>2</id>
<operations>
<count>13</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_224">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_225">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_226">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_227">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_228">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_229">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_230">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_231">
<id>17</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_232">
<id>18</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_233">
<id>19</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_234">
<id>21</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_235">
<id>22</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_236">
<id>68</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_237">
<id>3</id>
<operations>
<count>25</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_238">
<id>20</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_239">
<id>25</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_240">
<id>26</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_241">
<id>27</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_242">
<id>28</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_243">
<id>29</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_244">
<id>30</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_245">
<id>31</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_246">
<id>32</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_247">
<id>34</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_248">
<id>35</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_249">
<id>36</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_250">
<id>37</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_251">
<id>39</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_252">
<id>40</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_253">
<id>41</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_254">
<id>42</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_255">
<id>46</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_256">
<id>49</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_257">
<id>52</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_258">
<id>53</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_259">
<id>54</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_260">
<id>56</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_261">
<id>64</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_262">
<id>65</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_263">
<id>4</id>
<operations>
<count>7</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_264">
<id>38</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_265">
<id>43</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_266">
<id>44</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_267">
<id>50</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_268">
<id>51</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_269">
<id>57</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_270">
<id>58</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_271">
<id>5</id>
<operations>
<count>6</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_272">
<id>45</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_273">
<id>47</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_274">
<id>48</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_275">
<id>55</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_276">
<id>59</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_277">
<id>60</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_278">
<id>6</id>
<operations>
<count>10</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_279">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_280">
<id>23</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_281">
<id>24</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_282">
<id>33</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_283">
<id>61</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_284">
<id>62</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_285">
<id>63</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_286">
<id>66</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_287">
<id>67</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="28" object_id="_288">
<id>69</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
<item class_id_reference="26" object_id="_289">
<id>7</id>
<operations>
<count>1</count>
<item_version>0</item_version>
<item class_id_reference="28" object_id="_290">
<id>71</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="29" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="1" version="0" object_id="_291">
<inState>1</inState>
<outState>2</outState>
<condition class_id="31" tracking_level="0" version="0">
<id>22</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="_292">
<inState>3</inState>
<outState>4</outState>
<condition>
<id>33</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="_293">
<inState>4</inState>
<outState>5</outState>
<condition>
<id>34</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="_294">
<inState>5</inState>
<outState>6</outState>
<condition>
<id>35</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="_295">
<inState>6</inState>
<outState>2</outState>
<condition>
<id>36</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="_296">
<inState>2</inState>
<outState>7</outState>
<condition>
<id>32</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item class_id="34" tracking_level="0" version="0">
<first class_id="35" tracking_level="0" version="0">
<first>11</first>
<second>0</second>
</first>
<second>0</second>
</item>
</item>
</sop>
</condition>
</item>
<item class_id_reference="30" object_id="_297">
<inState>2</inState>
<outState>3</outState>
<condition>
<id>37</id>
<sop>
<count>1</count>
<item_version>0</item_version>
<item>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>11</first>
<second>0</second>
</first>
<second>1</second>
</item>
</item>
</sop>
</condition>
</item>
</transitions>
</fsm>
<res class_id="-1"></res>
<node_label_latency class_id="37" tracking_level="0" version="0">
<count>59</count>
<item_version>0</item_version>
<item class_id="38" tracking_level="0" version="0">
<first>6</first>
<second class_id="39" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>8</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>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>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>2</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>25</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>26</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>27</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>41</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>42</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>43</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>44</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>45</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>48</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>54</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>55</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>56</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>57</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>58</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>59</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>60</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>61</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>62</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>63</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>64</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>65</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>66</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>68</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>69</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>71</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="40" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="41" tracking_level="0" version="0">
<first>7</first>
<second class_id="42" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>14</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>70</first>
<second>
<first>1</first>
<second>5</second>
</second>
</item>
<item>
<first>72</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="43" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="44" tracking_level="1" version="0" object_id="_298">
<region_name>Loop 1</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>14</item>
<item>70</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>5</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="45" tracking_level="0" version="0">
<count>55</count>
<item_version>0</item_version>
<item class_id="46" tracking_level="0" version="0">
<first>102</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
<item>
<first>108</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>122</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>133</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>144</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>151</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>157</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>163</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>169</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>177</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>183</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>189</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>195</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>203</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>209</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>214</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>218</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>222</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>232</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>236</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>246</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>250</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>260</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>270</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>278</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>282</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>298</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>306</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>310</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>316</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>326</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>336</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>346</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>354</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>358</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>364</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
<item>
<first>369</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>375</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>378</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>381</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>387</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>394</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>398</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>401</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>407</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>410</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>417</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>421</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>427</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>430</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>436</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>439</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>442</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>448</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="48" tracking_level="0" version="0">
<count>53</count>
<item_version>0</item_version>
<item class_id="49" tracking_level="0" version="0">
<first>exitcond8_fu_163</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>exitcond_flatten_fu_151</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>indvar_flatten_next_fu_157</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>indvar_flatten_phi_fu_122</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>p_309_fu_214</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>26</item>
</second>
</item>
<item>
<first>p_312_cast_fu_218</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>27</item>
</second>
</item>
<item>
<first>p_317_fu_270</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>35</item>
</second>
</item>
<item>
<first>p_318_cast_fu_278</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>36</item>
</second>
</item>
<item>
<first>p_319_cast_fu_375</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>38</item>
</second>
</item>
<item>
<first>p_319_fu_282</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>p_321_fu_222</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>28</item>
</second>
</item>
<item>
<first>p_324_cast_cast_fu_232</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>29</item>
</second>
</item>
<item>
<first>p_329_fu_298</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>40</item>
</second>
</item>
<item>
<first>p_330_cast_cast_fu_306</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>41</item>
</second>
</item>
<item>
<first>p_331_cast_fu_407</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>45</item>
</second>
</item>
<item>
<first>p_331_fu_381</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>p_335_fu_410</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>47</item>
</second>
</item>
<item>
<first>p_336_cast_fu_417</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>48</item>
</second>
</item>
<item>
<first>p_341_fu_387</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>50</item>
</second>
</item>
<item>
<first>p_342_cast_cast_fu_394</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>51</item>
</second>
</item>
<item>
<first>p_345_fu_236</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>30</item>
</second>
</item>
<item>
<first>p_348_cast_cast_fu_246</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>31</item>
</second>
</item>
<item>
<first>p_353_fu_346</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>53</item>
</second>
</item>
<item>
<first>p_354_cast_cast_fu_354</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</second>
</item>
<item>
<first>p_355_cast_fu_439</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>61</item>
</second>
</item>
<item>
<first>p_355_fu_430</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>p_357_fu_250</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>p_360_cast_fu_436</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>33</item>
</second>
</item>
<item>
<first>p_361_fu_442</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>62</item>
</second>
</item>
<item>
<first>p_364_fu_448</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>63</item>
</second>
</item>
<item>
<first>p_hw_output_x_scan_1_fu_203</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>p_hw_output_x_scan_2_phi_fu_144</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>p_hw_output_x_scan_s_fu_169</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>p_hw_output_y_scan_1_phi_fu_133</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>p_hw_output_y_scan_2_fu_189</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>21</item>
</second>
</item>
<item>
<first>p_hw_output_y_scan_s_fu_195</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>tmp1_cast_fu_378</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>43</item>
</second>
</item>
<item>
<first>tmp1_fu_310</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>tmp2_fu_421</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>55</item>
</second>
</item>
<item>
<first>tmp3_cast_fu_427</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>59</item>
</second>
</item>
<item>
<first>tmp3_fu_401</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>tmp4_cast_fu_398</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>57</item>
</second>
</item>
<item>
<first>tmp4_fu_358</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>tmp5_fu_183</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>tmp_2_fu_260</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>34</item>
</second>
</item>
<item>
<first>tmp_3_fu_288</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>39</item>
</second>
</item>
<item>
<first>tmp_4_fu_316</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>tmp_5_fu_326</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>tmp_6_fu_336</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</second>
</item>
<item>
<first>tmp_last_V_fu_369</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>tmp_mid1_fu_177</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>tmp_mid2_fu_209</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>20</item>
</second>
</item>
<item>
<first>tmp_s_fu_364</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>64</item>
</second>
</item>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>2</count>
<item_version>0</item_version>
<item>
<first>StgValue_69_write_fu_108</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
<item>
<first>tmp_value_V_read_fu_102</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="50" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>21</count>
<item_version>0</item_version>
<item>
<first>118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>129</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>140</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>459</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>463</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>468</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>473</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>478</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
<item>
<first>483</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>488</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>493</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>498</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>503</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>508</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>513</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>518</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>523</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>528</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>533</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>538</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>543</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
</dp_reg_nodes>
<dp_regname_nodes>
<count>21</count>
<item_version>0</item_version>
<item>
<first>exitcond8_reg_468</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>16</item>
</second>
</item>
<item>
<first>exitcond_flatten_reg_459</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>indvar_flatten_next_reg_463</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>12</item>
</second>
</item>
<item>
<first>indvar_flatten_reg_118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>p_319_reg_503</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>37</item>
</second>
</item>
<item>
<first>p_331_reg_533</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>44</item>
</second>
</item>
<item>
<first>p_355_reg_543</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>60</item>
</second>
</item>
<item>
<first>p_357_reg_498</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>32</item>
</second>
</item>
<item>
<first>p_hw_output_x_scan_1_reg_493</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>68</item>
</second>
</item>
<item>
<first>p_hw_output_x_scan_2_reg_140</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>p_hw_output_x_scan_s_reg_473</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>17</item>
</second>
</item>
<item>
<first>p_hw_output_y_scan_1_reg_129</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>p_hw_output_y_scan_s_reg_488</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>22</item>
</second>
</item>
<item>
<first>tmp1_reg_508</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>42</item>
</second>
</item>
<item>
<first>tmp3_reg_538</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>58</item>
</second>
</item>
<item>
<first>tmp4_reg_523</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>56</item>
</second>
</item>
<item>
<first>tmp5_reg_483</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>19</item>
</second>
</item>
<item>
<first>tmp_4_reg_513</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>46</item>
</second>
</item>
<item>
<first>tmp_5_reg_518</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>49</item>
</second>
</item>
<item>
<first>tmp_last_V_reg_528</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>65</item>
</second>
</item>
<item>
<first>tmp_mid1_reg_478</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>18</item>
</second>
</item>
</dp_regname_nodes>
<dp_reg_phi>
<count>3</count>
<item_version>0</item_version>
<item>
<first>118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>129</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>140</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
</dp_reg_phi>
<dp_regname_phi>
<count>3</count>
<item_version>0</item_version>
<item>
<first>indvar_flatten_reg_118</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>p_hw_output_x_scan_2_reg_140</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>p_hw_output_y_scan_1_reg_129</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
</dp_regname_phi>
<dp_port_io_nodes class_id="51" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="52" tracking_level="0" version="0">
<first>hw_output_V_last_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
</second>
</item>
<item>
<first>hw_output_V_value_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>66</item>
</second>
</item>
</second>
</item>
<item>
<first>p_hw_input_stencil_stream_V_value_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>25</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="53" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="54" tracking_level="0" version="0">
<first>1</first>
<second>FIFO_SRL</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 25.779193 | 137 | 0.593966 |
4bb19d9186bf7d7176e64434125af452901f88b9 | 352 | ads | Ada | 3-mid/opengl/source/opengl-conversions.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/opengl/source/opengl-conversions.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/opengl/source/opengl-conversions.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | package openGL.Conversions
is
function to_Vector_4 (From : in lucid_Color) return Vector_4;
function to_Vector_4 (From : in light_Color) return Vector_4;
function to_light_Color (From : in lucid_Color) return light_Color;
function "+" (From : in lucid_Color) return light_Color renames to_light_Color;
end openGL.Conversions;
| 32 | 93 | 0.752841 |
a017c6f1a640ae56cd9dd104dc0df1fbabc581cd | 518 | ads | Ada | surface.ads | mimo/Tracker | a913446c6d2f6679a2e557bd92194e255190e6a7 | [
"MIT"
] | 1 | 2020-09-30T01:30:48.000Z | 2020-09-30T01:30:48.000Z | surface.ads | mimo/Tracker | a913446c6d2f6679a2e557bd92194e255190e6a7 | [
"MIT"
] | null | null | null | surface.ads | mimo/Tracker | a913446c6d2f6679a2e557bd92194e255190e6a7 | [
"MIT"
] | null | null | null | with raylib;
package Surface is
type Actor is interface;
procedure Setup (ctxt : in out Actor) is abstract;
procedure Update (ctxt : in out Actor ; dt : Float) is abstract;
type Reference is access Actor'class;
type Actor_Stack is array (Positive range <>) of Reference;
type Instance is new Actor with record
Tab : Actor_Stack (1 .. 50);
end record;
procedure Setup (ctxt : in out Instance) is null;
procedure Update (ctxt : in out Instance ; dt : Float) is null;
end Surface;
| 28.777778 | 67 | 0.689189 |
a02c6204efec144e1428fb9d2427233807721162 | 85,039 | adb | Ada | apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen/sharpen/hls_target/.autopilot/db/Loop_4_proc.sched.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | 1 | 2020-06-18T16:51:39.000Z | 2020-06-18T16:51:39.000Z | apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen/sharpen/hls_target/.autopilot/db/Loop_4_proc.sched.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | null | null | null | apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen/sharpen/hls_target/.autopilot/db/Loop_4_proc.sched.adb | dillonhuff/Halide-HLS | e9f4c3ac7915e5a52f211ce65004ae17890515a0 | [
"MIT"
] | 1 | 2020-03-18T00:43:22.000Z | 2020-03-18T00:43:22.000Z | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="14">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>Loop_4_proc</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>hw_output_V_value_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>stream&lt;AxiPackedStencil&lt;unsigned int, 1, 1, 1, 1&gt; &gt;.V.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</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>hw_output_V_last_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>stream&lt;AxiPackedStencil&lt;unsigned int, 1, 1, 1, 1&gt; &gt;.V.last.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<direction>1</direction>
<if_type>0</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_3">
<Value>
<Obj>
<type>1</type>
<id>3</id>
<name>p_mul_stencil_stream_V_value_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_4">
<Value>
<Obj>
<type>1</type>
<id>4</id>
<name>p_delayed_input_stencil_stream_V_value_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>0</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</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>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>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>54</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_6">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name>indvar_flatten</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>144</item>
<item>145</item>
<item>146</item>
<item>147</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>12</id>
<name>p_hw_output_y_scan_1</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>265</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item class_id="11" tracking_level="0" version="0">
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</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>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>265</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>148</item>
<item>149</item>
<item>150</item>
<item>151</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name>p_hw_output_x_scan_2</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName>_hw_output_x___scan_dim_0</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>152</item>
<item>153</item>
<item>154</item>
<item>155</item>
</oprand_edges>
<opcode>phi</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>14</id>
<name>exitcond_flatten</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>156</item>
<item>158</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>15</id>
<name>indvar_flatten_next</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>159</item>
<item>161</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>162</item>
<item>163</item>
<item>164</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>19</id>
<name>exitcond7</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>265</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>265</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>55</item>
<item>57</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>20</id>
<name>p_hw_output_x_scan_s</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>265</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>265</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>58</item>
<item>60</item>
<item>61</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_14">
<Value>
<Obj>
<type>0</type>
<id>21</id>
<name>p_hw_output_y_scan_2</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>263</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>263</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>62</item>
<item>64</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_15">
<Value>
<Obj>
<type>0</type>
<id>22</id>
<name>tmp_3_mid1</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>298</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>298</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>65</item>
<item>67</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_16">
<Value>
<Obj>
<type>0</type>
<id>23</id>
<name>tmp_1</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>298</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>298</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>68</item>
<item>69</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_17">
<Value>
<Obj>
<type>0</type>
<id>24</id>
<name>tmp_3_mid2</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>298</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>298</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>70</item>
<item>71</item>
<item>72</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_18">
<Value>
<Obj>
<type>0</type>
<id>25</id>
<name>p_hw_output_y_scan_s</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>265</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>265</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>73</item>
<item>74</item>
<item>75</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_19">
<Value>
<Obj>
<type>0</type>
<id>28</id>
<name>tmp_value_V_4</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>271</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>271</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>77</item>
<item>78</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_20">
<Value>
<Obj>
<type>0</type>
<id>29</id>
<name>tmp_value_V_5</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>276</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>276</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.value.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>79</item>
<item>80</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_21">
<Value>
<Obj>
<type>0</type>
<id>30</id>
<name>p_s</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>285</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>285</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>28</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>82</item>
<item>83</item>
<item>85</item>
<item>87</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_22">
<Value>
<Obj>
<type>0</type>
<id>31</id>
<name>p_438</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>285</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>285</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_438</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>1</count>
<item_version>0</item_version>
<item>88</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_23">
<Value>
<Obj>
<type>0</type>
<id>32</id>
<name>p_443</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>290</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>290</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_443</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>89</item>
<item>90</item>
</oprand_edges>
<opcode>sub</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_24">
<Value>
<Obj>
<type>0</type>
<id>33</id>
<name>p_439</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>286</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>286</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_439</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>91</item>
<item>92</item>
</oprand_edges>
<opcode>sub</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_25">
<Value>
<Obj>
<type>0</type>
<id>34</id>
<name>tmp_11</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>289</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>289</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>28</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>93</item>
<item>94</item>
<item>95</item>
<item>96</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_26">
<Value>
<Obj>
<type>0</type>
<id>35</id>
<name>p_442</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>289</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>289</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_442</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>97</item>
<item>99</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_27">
<Value>
<Obj>
<type>0</type>
<id>36</id>
<name>tmp_12</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>291</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>291</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>28</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>100</item>
<item>101</item>
<item>102</item>
<item>103</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_28">
<Value>
<Obj>
<type>0</type>
<id>37</id>
<name>p_444</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>291</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>291</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_444</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>104</item>
<item>105</item>
</oprand_edges>
<opcode>icmp</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_29">
<Value>
<Obj>
<type>0</type>
<id>38</id>
<name>tmp</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>294</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>294</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>30</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>107</item>
<item>108</item>
<item>110</item>
<item>111</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_30">
<Value>
<Obj>
<type>0</type>
<id>39</id>
<name>tmp_13</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>293</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>293</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>4</count>
<item_version>0</item_version>
<item>113</item>
<item>114</item>
<item>115</item>
<item>117</item>
</oprand_edges>
<opcode>partselect</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_31">
<Value>
<Obj>
<type>0</type>
<id>40</id>
<name>tmp_14</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>292</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>292</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>2</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>118</item>
<item>119</item>
<item>121</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_32">
<Value>
<Obj>
<type>0</type>
<id>41</id>
<name>tmp_5_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>293</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>293</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>30</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>
</item>
<item class_id_reference="9" object_id="_33">
<Value>
<Obj>
<type>0</type>
<id>42</id>
<name>p_447</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>293</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>293</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_447</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>30</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>123</item>
<item>124</item>
<item>125</item>
</oprand_edges>
<opcode>select</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_34">
<Value>
<Obj>
<type>0</type>
<id>43</id>
<name>p_447_cast</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>293</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>293</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>126</item>
</oprand_edges>
<opcode>zext</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_35">
<Value>
<Obj>
<type>0</type>
<id>44</id>
<name>p_448</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>295</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>295</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_448</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>127</item>
<item>128</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_36">
<Value>
<Obj>
<type>0</type>
<id>45</id>
<name>tmp_s</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>298</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>298</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>129</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>46</id>
<name>tmp_last_V</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>298</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>298</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>tmp.last.V</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>1</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>132</item>
<item>133</item>
</oprand_edges>
<opcode>and</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_38">
<Value>
<Obj>
<type>0</type>
<id>47</id>
<name></name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>303</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>303</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>135</item>
<item>136</item>
<item>137</item>
<item>138</item>
<item>139</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_39">
<Value>
<Obj>
<type>0</type>
<id>49</id>
<name>p_hw_output_x_scan_1</name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>265</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>265</second>
</item>
</second>
</item>
</inlineStackInfo>
<originalName>_hw_output_x___scan_dim_0</originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>11</bitwidth>
</Value>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>140</item>
<item>141</item>
</oprand_edges>
<opcode>add</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_40">
<Value>
<Obj>
<type>0</type>
<id>50</id>
<name></name>
<fileName>hls_target.cpp</fileName>
<fileDirectory>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</fileDirectory>
<lineNumber>265</lineNumber>
<contextFuncName>hls_target</contextFuncName>
<inlineStackInfo>
<count>1</count>
<item_version>0</item_version>
<item>
<first>/home/dhuff/Halide-HLS/apps/hls_examples/camera_ready_synthesis/app_files/big_apps_32_shifts/sharpen</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>
<first>hls_target.cpp</first>
<second>hls_target</second>
</first>
<second>265</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>142</item>
</oprand_edges>
<opcode>br</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_41">
<Value>
<Obj>
<type>0</type>
<id>52</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
</item>
</nodes>
<consts class_id="15" tracking_level="0" version="0">
<count>14</count>
<item_version>0</item_version>
<item class_id="16" tracking_level="1" version="0" object_id="_42">
<Value>
<Obj>
<type>2</type>
<id>56</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>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>1918</content>
</item>
<item class_id_reference="16" object_id="_43">
<Value>
<Obj>
<type>2</type>
<id>59</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>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_44">
<Value>
<Obj>
<type>2</type>
<id>63</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>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
<item class_id_reference="16" object_id="_45">
<Value>
<Obj>
<type>2</type>
<id>66</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>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>1077</content>
</item>
<item class_id_reference="16" object_id="_46">
<Value>
<Obj>
<type>2</type>
<id>84</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>4</content>
</item>
<item class_id_reference="16" object_id="_47">
<Value>
<Obj>
<type>2</type>
<id>86</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>31</content>
</item>
<item class_id_reference="16" object_id="_48">
<Value>
<Obj>
<type>2</type>
<id>98</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>28</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>109</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>2</content>
</item>
<item class_id_reference="16" object_id="_50">
<Value>
<Obj>
<type>2</type>
<id>116</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<const_type>0</const_type>
<content>3</content>
</item>
<item class_id_reference="16" object_id="_51">
<Value>
<Obj>
<type>2</type>
<id>120</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>2</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_52">
<Value>
<Obj>
<type>2</type>
<id>130</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>11</bitwidth>
</Value>
<const_type>0</const_type>
<content>1917</content>
</item>
<item class_id_reference="16" object_id="_53">
<Value>
<Obj>
<type>2</type>
<id>143</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<const_type>0</const_type>
<content>0</content>
</item>
<item class_id_reference="16" object_id="_54">
<Value>
<Obj>
<type>2</type>
<id>157</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<const_type>0</const_type>
<content>2067604</content>
</item>
<item class_id_reference="16" object_id="_55">
<Value>
<Obj>
<type>2</type>
<id>160</id>
<name>empty</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>21</bitwidth>
</Value>
<const_type>0</const_type>
<content>1</content>
</item>
</consts>
<blocks class_id="17" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="18" tracking_level="1" version="0" object_id="_56">
<Obj>
<type>3</type>
<id>10</id>
<name>newFuncRoot</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_57">
<Obj>
<type>3</type>
<id>17</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>11</item>
<item>12</item>
<item>13</item>
<item>14</item>
<item>15</item>
<item>16</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_58">
<Obj>
<type>3</type>
<id>51</id>
<name>.preheader56</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>29</count>
<item_version>0</item_version>
<item>19</item>
<item>20</item>
<item>21</item>
<item>22</item>
<item>23</item>
<item>24</item>
<item>25</item>
<item>28</item>
<item>29</item>
<item>30</item>
<item>31</item>
<item>32</item>
<item>33</item>
<item>34</item>
<item>35</item>
<item>36</item>
<item>37</item>
<item>38</item>
<item>39</item>
<item>40</item>
<item>41</item>
<item>42</item>
<item>43</item>
<item>44</item>
<item>45</item>
<item>46</item>
<item>47</item>
<item>49</item>
<item>50</item>
</node_objs>
</item>
<item class_id_reference="18" object_id="_59">
<Obj>
<type>3</type>
<id>53</id>
<name>.exitStub</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<node_objs>
<count>1</count>
<item_version>0</item_version>
<item>52</item>
</node_objs>
</item>
</blocks>
<edges class_id="19" tracking_level="0" version="0">
<count>88</count>
<item_version>0</item_version>
<item class_id="20" tracking_level="1" version="0" object_id="_60">
<id>54</id>
<edge_type>2</edge_type>
<source_obj>17</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="20" object_id="_61">
<id>55</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_62">
<id>57</id>
<edge_type>1</edge_type>
<source_obj>56</source_obj>
<sink_obj>19</sink_obj>
</item>
<item class_id_reference="20" object_id="_63">
<id>58</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_64">
<id>60</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_65">
<id>61</id>
<edge_type>1</edge_type>
<source_obj>13</source_obj>
<sink_obj>20</sink_obj>
</item>
<item class_id_reference="20" object_id="_66">
<id>62</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_67">
<id>64</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>21</sink_obj>
</item>
<item class_id_reference="20" object_id="_68">
<id>65</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_69">
<id>67</id>
<edge_type>1</edge_type>
<source_obj>66</source_obj>
<sink_obj>22</sink_obj>
</item>
<item class_id_reference="20" object_id="_70">
<id>68</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_71">
<id>69</id>
<edge_type>1</edge_type>
<source_obj>66</source_obj>
<sink_obj>23</sink_obj>
</item>
<item class_id_reference="20" object_id="_72">
<id>70</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_73">
<id>71</id>
<edge_type>1</edge_type>
<source_obj>22</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_74">
<id>72</id>
<edge_type>1</edge_type>
<source_obj>23</source_obj>
<sink_obj>24</sink_obj>
</item>
<item class_id_reference="20" object_id="_75">
<id>73</id>
<edge_type>1</edge_type>
<source_obj>19</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_76">
<id>74</id>
<edge_type>1</edge_type>
<source_obj>21</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_77">
<id>75</id>
<edge_type>1</edge_type>
<source_obj>12</source_obj>
<sink_obj>25</sink_obj>
</item>
<item class_id_reference="20" object_id="_78">
<id>78</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>28</sink_obj>
</item>
<item class_id_reference="20" object_id="_79">
<id>80</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>29</sink_obj>
</item>
<item class_id_reference="20" object_id="_80">
<id>83</id>
<edge_type>1</edge_type>
<source_obj>28</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_81">
<id>85</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_82">
<id>87</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>30</sink_obj>
</item>
<item class_id_reference="20" object_id="_83">
<id>88</id>
<edge_type>1</edge_type>
<source_obj>30</source_obj>
<sink_obj>31</sink_obj>
</item>
<item class_id_reference="20" object_id="_84">
<id>89</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_85">
<id>90</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>32</sink_obj>
</item>
<item class_id_reference="20" object_id="_86">
<id>91</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_87">
<id>92</id>
<edge_type>1</edge_type>
<source_obj>31</source_obj>
<sink_obj>33</sink_obj>
</item>
<item class_id_reference="20" object_id="_88">
<id>94</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_89">
<id>95</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_90">
<id>96</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>34</sink_obj>
</item>
<item class_id_reference="20" object_id="_91">
<id>97</id>
<edge_type>1</edge_type>
<source_obj>34</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_92">
<id>99</id>
<edge_type>1</edge_type>
<source_obj>98</source_obj>
<sink_obj>35</sink_obj>
</item>
<item class_id_reference="20" object_id="_93">
<id>101</id>
<edge_type>1</edge_type>
<source_obj>32</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_94">
<id>102</id>
<edge_type>1</edge_type>
<source_obj>84</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_95">
<id>103</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>36</sink_obj>
</item>
<item class_id_reference="20" object_id="_96">
<id>104</id>
<edge_type>1</edge_type>
<source_obj>36</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_97">
<id>105</id>
<edge_type>1</edge_type>
<source_obj>98</source_obj>
<sink_obj>37</sink_obj>
</item>
<item class_id_reference="20" object_id="_98">
<id>108</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_99">
<id>110</id>
<edge_type>1</edge_type>
<source_obj>109</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_100">
<id>111</id>
<edge_type>1</edge_type>
<source_obj>86</source_obj>
<sink_obj>38</sink_obj>
</item>
<item class_id_reference="20" object_id="_101">
<id>114</id>
<edge_type>1</edge_type>
<source_obj>33</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_102">
<id>115</id>
<edge_type>1</edge_type>
<source_obj>109</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_103">
<id>117</id>
<edge_type>1</edge_type>
<source_obj>116</source_obj>
<sink_obj>39</sink_obj>
</item>
<item class_id_reference="20" object_id="_104">
<id>118</id>
<edge_type>1</edge_type>
<source_obj>37</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_105">
<id>119</id>
<edge_type>1</edge_type>
<source_obj>39</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_106">
<id>121</id>
<edge_type>1</edge_type>
<source_obj>120</source_obj>
<sink_obj>40</sink_obj>
</item>
<item class_id_reference="20" object_id="_107">
<id>122</id>
<edge_type>1</edge_type>
<source_obj>40</source_obj>
<sink_obj>41</sink_obj>
</item>
<item class_id_reference="20" object_id="_108">
<id>123</id>
<edge_type>1</edge_type>
<source_obj>35</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_109">
<id>124</id>
<edge_type>1</edge_type>
<source_obj>38</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_110">
<id>125</id>
<edge_type>1</edge_type>
<source_obj>41</source_obj>
<sink_obj>42</sink_obj>
</item>
<item class_id_reference="20" object_id="_111">
<id>126</id>
<edge_type>1</edge_type>
<source_obj>42</source_obj>
<sink_obj>43</sink_obj>
</item>
<item class_id_reference="20" object_id="_112">
<id>127</id>
<edge_type>1</edge_type>
<source_obj>43</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_113">
<id>128</id>
<edge_type>1</edge_type>
<source_obj>29</source_obj>
<sink_obj>44</sink_obj>
</item>
<item class_id_reference="20" object_id="_114">
<id>129</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_115">
<id>131</id>
<edge_type>1</edge_type>
<source_obj>130</source_obj>
<sink_obj>45</sink_obj>
</item>
<item class_id_reference="20" object_id="_116">
<id>132</id>
<edge_type>1</edge_type>
<source_obj>45</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_117">
<id>133</id>
<edge_type>1</edge_type>
<source_obj>24</source_obj>
<sink_obj>46</sink_obj>
</item>
<item class_id_reference="20" object_id="_118">
<id>136</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_119">
<id>137</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_120">
<id>138</id>
<edge_type>1</edge_type>
<source_obj>44</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_121">
<id>139</id>
<edge_type>1</edge_type>
<source_obj>46</source_obj>
<sink_obj>47</sink_obj>
</item>
<item class_id_reference="20" object_id="_122">
<id>140</id>
<edge_type>1</edge_type>
<source_obj>20</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_123">
<id>141</id>
<edge_type>1</edge_type>
<source_obj>63</source_obj>
<sink_obj>49</sink_obj>
</item>
<item class_id_reference="20" object_id="_124">
<id>142</id>
<edge_type>2</edge_type>
<source_obj>17</source_obj>
<sink_obj>50</sink_obj>
</item>
<item class_id_reference="20" object_id="_125">
<id>144</id>
<edge_type>1</edge_type>
<source_obj>143</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_126">
<id>145</id>
<edge_type>2</edge_type>
<source_obj>10</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_127">
<id>146</id>
<edge_type>1</edge_type>
<source_obj>15</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_128">
<id>147</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="20" object_id="_129">
<id>148</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_130">
<id>149</id>
<edge_type>2</edge_type>
<source_obj>10</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_131">
<id>150</id>
<edge_type>1</edge_type>
<source_obj>25</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_132">
<id>151</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>12</sink_obj>
</item>
<item class_id_reference="20" object_id="_133">
<id>152</id>
<edge_type>1</edge_type>
<source_obj>59</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_134">
<id>153</id>
<edge_type>2</edge_type>
<source_obj>10</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_135">
<id>154</id>
<edge_type>1</edge_type>
<source_obj>49</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_136">
<id>155</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="20" object_id="_137">
<id>156</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_138">
<id>158</id>
<edge_type>1</edge_type>
<source_obj>157</source_obj>
<sink_obj>14</sink_obj>
</item>
<item class_id_reference="20" object_id="_139">
<id>159</id>
<edge_type>1</edge_type>
<source_obj>11</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_140">
<id>161</id>
<edge_type>1</edge_type>
<source_obj>160</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="20" object_id="_141">
<id>162</id>
<edge_type>1</edge_type>
<source_obj>14</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_142">
<id>163</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_143">
<id>164</id>
<edge_type>2</edge_type>
<source_obj>53</source_obj>
<sink_obj>16</sink_obj>
</item>
<item class_id_reference="20" object_id="_144">
<id>251</id>
<edge_type>2</edge_type>
<source_obj>10</source_obj>
<sink_obj>17</sink_obj>
</item>
<item class_id_reference="20" object_id="_145">
<id>252</id>
<edge_type>2</edge_type>
<source_obj>17</source_obj>
<sink_obj>53</sink_obj>
</item>
<item class_id_reference="20" object_id="_146">
<id>253</id>
<edge_type>2</edge_type>
<source_obj>17</source_obj>
<sink_obj>51</sink_obj>
</item>
<item class_id_reference="20" object_id="_147">
<id>254</id>
<edge_type>2</edge_type>
<source_obj>51</source_obj>
<sink_obj>17</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>Loop_4_proc</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>2067609</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>10</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>2</count>
<item_version>0</item_version>
<item>17</item>
<item>51</item>
</basic_blocks>
<mII>1</mII>
<mDepth>5</mDepth>
<mMinTripCount>2067604</mMinTripCount>
<mMaxTripCount>2067604</mMaxTripCount>
<mMinLatency>2067607</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>53</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>9</first>
<second class_id="28" tracking_level="0" version="0">
<first>0</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>15</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>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>2</first>
<second>0</second>
</second>
</item>
<item>
<first>22</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>23</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>24</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>25</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>28</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>29</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>30</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>31</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>32</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>33</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>34</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>35</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>36</first>
<second>
<first>3</first>
<second>0</second>
</second>
</item>
<item>
<first>37</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>38</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>39</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>40</first>
<second>
<first>5</first>
<second>0</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>43</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>45</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
<item>
<first>46</first>
<second>
<first>4</first>
<second>0</second>
</second>
</item>
<item>
<first>47</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>49</first>
<second>
<first>1</first>
<second>0</second>
</second>
</item>
<item>
<first>50</first>
<second>
<first>5</first>
<second>0</second>
</second>
</item>
<item>
<first>52</first>
<second>
<first>2</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="29" tracking_level="0" version="0">
<count>4</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="0" version="0">
<first>10</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>17</first>
<second>
<first>1</first>
<second>1</second>
</second>
</item>
<item>
<first>51</first>
<second>
<first>1</first>
<second>5</second>
</second>
</item>
<item>
<first>53</first>
<second>
<first>2</first>
<second>2</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="32" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="33" tracking_level="1" version="0" object_id="_152">
<region_name>Loop 1</region_name>
<basic_blocks>
<count>2</count>
<item_version>0</item_version>
<item>17</item>
<item>51</item>
</basic_blocks>
<nodes>
<count>0</count>
<item_version>0</item_version>
</nodes>
<anchor_node>-1</anchor_node>
<region_type>8</region_type>
<interval>1</interval>
<pipe_depth>5</pipe_depth>
</item>
</regions>
<dp_fu_nodes class_id="34" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="35" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_expression>
<dp_fu_nodes_module>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_module>
<dp_fu_nodes_io>
<count>0</count>
<item_version>0</item_version>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="36" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_mem_port_nodes>
<dp_reg_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_reg_nodes>
<dp_regname_nodes>
<count>0</count>
<item_version>0</item_version>
</dp_regname_nodes>
<dp_reg_phi>
<count>0</count>
<item_version>0</item_version>
</dp_reg_phi>
<dp_regname_phi>
<count>0</count>
<item_version>0</item_version>
</dp_regname_phi>
<dp_port_io_nodes class_id="37" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</dp_port_io_nodes>
<port2core class_id="38" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 27.458508 | 137 | 0.604864 |
4b2511c96b4ec89f8926f48e0adb18d4835d82b3 | 4,790 | ads | Ada | runtime/ravenscar-sfp-stm32f427/gnarl-common/a-interr.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/a-interr.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/a-interr.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 COMPONENTS --
-- --
-- A D A . I N T E R R U P T S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2015, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.Interrupts;
with System.Multiprocessors;
with Ada.Task_Identification;
package Ada.Interrupts
with SPARK_Mode => On is
-- because of access types there is a violation of SPARK;
-- but there are SPARK annotations below, so we need it on
type Interrupt_ID is new System.Interrupts.Ada_Interrupt_ID;
type Parameterless_Handler is private;
-- type Parameterless_Handler is access protected procedure;
function Is_Reserved (Interrupt : Interrupt_ID) return Boolean with
SPARK_Mode,
Volatile_Function,
Global => Ada.Task_Identification.Tasking_State;
function Is_Attached (Interrupt : Interrupt_ID) return Boolean with
SPARK_Mode,
Volatile_Function,
Global => Ada.Task_Identification.Tasking_State;
function Current_Handler
(Interrupt : Interrupt_ID) return Parameterless_Handler
with
SPARK_Mode => Off,
Global => null;
procedure Attach_Handler
(New_Handler : Parameterless_Handler;
Interrupt : Interrupt_ID)
with
SPARK_Mode => Off,
Global => null;
procedure Exchange_Handler
(Old_Handler : out Parameterless_Handler;
New_Handler : Parameterless_Handler;
Interrupt : Interrupt_ID)
with
SPARK_Mode => Off,
Global => null;
procedure Detach_Handler (Interrupt : Interrupt_ID) with
SPARK_Mode,
Global => (In_Out => Ada.Task_Identification.Tasking_State);
function Reference (Interrupt : Interrupt_ID) return System.Address with
SPARK_Mode => Off,
Global => null;
function Get_CPU
(Interrupt : Interrupt_ID) return System.Multiprocessors.CPU_Range
with
SPARK_Mode,
Volatile_Function,
Global => Ada.Task_Identification.Tasking_State;
private
pragma SPARK_Mode (Off);
pragma Inline (Is_Reserved);
pragma Inline (Is_Attached);
pragma Inline (Current_Handler);
pragma Inline (Attach_Handler);
pragma Inline (Detach_Handler);
pragma Inline (Exchange_Handler);
pragma Inline (Get_CPU);
type Parameterless_Handler is access protected procedure;
end Ada.Interrupts;
| 44.351852 | 78 | 0.501461 |
03cb7ba38e279cbd1db6da2d5cb418ae8348c5dd | 1,484 | ads | Ada | src/gen-commands.ads | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 15 | 2015-01-18T23:04:19.000Z | 2022-03-01T20:27:08.000Z | src/gen-commands.ads | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 16 | 2018-06-10T07:09:30.000Z | 2022-03-26T18:28:40.000Z | src/gen-commands.ads | jquorning/dynamo | 10d68571476c270b8e45a9c5ef585fa9139b0d05 | [
"Apache-2.0"
] | 3 | 2015-11-11T18:00:14.000Z | 2022-01-30T23:08:45.000Z | -----------------------------------------------------------------------
-- gen-commands -- Commands for dynamo
-- Copyright (C) 2011, 2012, 2017, 2018 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with Util.Commands.Drivers;
with Util.Commands.Parsers;
with Gen.Generator;
package Gen.Commands is
package Drivers is
new Util.Commands.Drivers (Context_Type => Gen.Generator.Handler,
Config_Parser => Util.Commands.Parsers.No_Parser,
Driver_Name => "gen-commands");
subtype Command is Drivers.Command_Type;
subtype Command_Access is Drivers.Command_Access;
subtype Argument_List is Util.Commands.Argument_List;
Driver : Drivers.Driver_Type;
-- Print dynamo short usage.
procedure Short_Help_Usage;
end Gen.Commands;
| 38.051282 | 81 | 0.642183 |
5ea6f236d538b3def6fbcf5054130d810c852ce5 | 3,213 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce3605e.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/ce3605e.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ce/ce3605e.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- CE3605E.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE:
-- CHECK THAT PUT CAN BE CALLED WITH CHARACTER AND STRING
-- PARAMETERS. CHECK THAT FILES OF MODE OUT_FILE ARE USED AND
-- THAT WHEN NO FILE IS SPECIFIED THE CURRENT DEFAULT OUTPUT FILE
-- IS USED.
-- APPLICABILITY CRITERIA:
-- THIS TEST IS APPLICABLE ONLY TO IMPLEMENTATIONS WHICH SUPPORT
-- CREATION OF TEMPORARY TEXT FILES WITH OUT_FILE MODE.
-- HISTORY:
-- SPS 10/06/82
-- JBG 12/28/82
-- VKG 02/15/83
-- JBG 02/22/84 CHANGED TO .ADA TEST
-- RJW 11/04/86 REVISED TEST TO OUTPUT A NOT_APPLICABLE
-- RESULT WHEN FILES ARE NOT SUPPORTED.
-- JLH 09/08/87 REMOVED UNNECESSARY CODE AND CHECKED FOR
-- USE_ERROR ON DELETE.
WITH REPORT; USE REPORT;
WITH TEXT_IO; USE TEXT_IO;
WITH CHECK_FILE;
PROCEDURE CE3605E IS
INCOMPLETE : EXCEPTION;
BEGIN
TEST ("CE3605E", "CHECK THAT PUT FOR STRINGS AND CHARACTERS " &
"OPERATES ON OUT_FILE FILES");
DECLARE
FT , FILE : FILE_TYPE;
X : CHARACTER;
BEGIN
BEGIN
CREATE (FT);
EXCEPTION
WHEN USE_ERROR =>
NOT_APPLICABLE ("USE_ERROR RAISED ON TEXT CREATE " &
"FOR TEMPORARY FILE WITH " &
"OUT_FILE MODE");
RAISE INCOMPLETE;
END;
CREATE (FILE);
SET_OUTPUT (FILE);
PUT (FT, 'O');
PUT (FT, "UTPUT STRING");
PUT ('X');
PUT ("UTPUT STRING");
-- CHECK OUTPUT
SET_OUTPUT (STANDARD_OUTPUT);
COMMENT ("CHECKING FT");
CHECK_FILE (FT, "OUTPUT STRING#@%");
COMMENT ("CHECKING FILE");
CHECK_FILE (FILE, "XUTPUT STRING#@%");
CLOSE (FT);
CLOSE (FILE);
EXCEPTION
WHEN INCOMPLETE =>
NULL;
END;
RESULT;
END CE3605E;
| 30.894231 | 79 | 0.591348 |
1efcafb020c1020768747f2265cc7a084b63998c | 3,789 | ads | Ada | source/amf/uml/amf-umldi-holders-uml_association_or_connector_or_link_shape_kinds.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-umldi-holders-uml_association_or_connector_or_link_shape_kinds.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-umldi-holders-uml_association_or_connector_or_link_shape_kinds.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 League.Holders.Generic_Enumerations;
package AMF.UMLDI.Holders.UML_Association_Or_Connector_Or_Link_Shape_Kinds is
new League.Holders.Generic_Enumerations
(AMF.UMLDI.UMLDI_UML_Association_Or_Connector_Or_Link_Shape_Kind);
pragma Preelaborate (AMF.UMLDI.Holders.UML_Association_Or_Connector_Or_Link_Shape_Kinds);
| 72.865385 | 89 | 0.426234 |
1e6f9f7785ab884dcb5af1d609c79d39be595cde | 28,564 | ada | Ada | id3/id8.ada | hulpke/smallgrp | b9664dbac0b9e8f8ad044b7c143cde17cff16a38 | [
"Artistic-2.0"
] | 5 | 2017-09-01T16:51:37.000Z | 2021-10-05T06:09:37.000Z | id3/id8.ada | hulpke/smallgrp | b9664dbac0b9e8f8ad044b7c143cde17cff16a38 | [
"Artistic-2.0"
] | 50 | 2016-08-01T12:41:24.000Z | 2022-01-27T00:10:22.000Z | id3/id8.ada | gap-packages/smallgrp | 12d8f1f6075ebb1cfc2d148cc512e73852cee20b | [
"Artistic-2.0"
] | 8 | 2017-09-04T08:13:00.000Z | 2019-12-26T14:10:43.000Z | #############################################################################
##
#W id8.ada GAP library of id's Hans Ulrich Besche
##
ID_GROUP_TREE.next[8].next[1].next[105]:=
rec(
fp:= [ 4304, 6104, 6704, 7004, 7304, 7604, 7904, 8204, 8504, 8804, 9104,
9404, 9704, 10004, 12704, 13904, 14504, 16304, 17504, 19304, 19604, 19904,
20204, 22304, 23804, 24104, 24404, 24704, 25004, 25304, 27104, 27404, 27704,
28904, 29204, 30104, 30404, 30704, 31004, 31304, 31604, 32204, 32504, 32804,
33104, 33404, 33704, 34304, 34604, 34904, 35204, 35804, 36104, 36404, 36704,
37004, 37304, 37904, 38204, 39104, 39404, 39704, 40004, 40304, 40604, 40904,
41504, 41804, 42104, 42404, 42704, 43304, 43604, 44204, 44504, 44804, 45104,
45404, 46604, 46904, 47204, 47504, 47804, 48404, 48704, 49004, 49304, 49604,
49904, 50204, 50504, 50804, 51104, 51704, 52004, 52304, 52604, 52904, 53204,
55304, 55904 ],
next:= [ rec(
fp:= [ 167, 466 ],
next:= [ rec(
desc:= [ 302004, 302006, 302008, 302010, 40309013 ],
fp:= [ 2, 30821 ],
next:= [ 78132, 78130 ] ), rec(
desc:= [ 302004, 302006, 302008, 302010, 40209010 ],
fp:= [ 15764, 15863, 15962 ],
next:= [ 78134, rec(
desc:= [ 309014, 309016, 40912012 ],
fp:= [ 5522, 5621 ],
next:= [ 78131, 78129 ] ), 78128 ] ) ] ), rec(
fp:= [ 118 ],
next:= [ rec(
desc:= [ 108003 ],
fp:= [ 2, 12 ],
next:= [ 87266, 87270 ] ) ] ), rec(
fp:= [ 148 ],
next:= [ rec(
desc:= [ 119015 ],
fp:= [ 8, 18 ],
next:= [ 90520, 90519 ] ) ] ), rec(
fp:= [ 165, 1019 ],
next:= [ rec(
fp:= [ 3450, 33365, 66724 ],
level:= 5,
next:= [ 92939, 92943, 92938 ] ), rec(
desc:= [ 108003 ],
fp:= [ 4, 14 ],
next:= [ 92946, 92944 ] ) ] ), rec(
fp:= [ 166, 168, 173 ],
next:= [ rec(
desc:= [ 106003, 108003, 302008, 208002 ],
fp:= [ 14, 212 ],
next:= [ 96519, 96521 ] ), rec(
desc:= [ 106003, 302004, 302006, 208002 ],
fp:= [ 14, 212 ],
next:= [ 96523, 96525 ] ), rec(
desc:= [ 107003 ],
fp:= [ 12, 418, 814 ],
next:= [ 96522, 96516, rec(
desc:= [ 302006, 302011, 108003, 208003 ],
fp:= [ 8, 414 ],
next:= [ 96526, 96524 ] ) ] ) ] ), rec(
fp:= [ 166, 168, 169, 171 ],
next:= [ rec(
desc:= [ 302007 ],
fp:= [ 1584, 69500 ],
next:= [ 100158, 100157 ] ), rec(
desc:= [ 302005 ],
fp:= [ 1165, 26960 ],
next:= [ rec(
desc:= [ 107003 ],
fp:= [ 14, 212 ],
next:= [ 100153, 100152 ] ), rec(
desc:= [ 108003 ],
fp:= [ 14, 212 ],
next:= [ 100154, 100151 ] ) ] ), rec(
desc:= [ 108003 ],
fp:= [ 216, 414 ],
next:= [ rec(
desc:= [ 302005, 209002 ],
fp:= [ 2, 12 ],
next:= [ 100155, 100161 ] ), 100160 ] ), rec(
desc:= [ 302005 ],
fp:= [ 1363, 46760 ],
next:= [ 100162, 100156 ] ) ] ), rec(
fp:= [ 171 ],
next:= [ rec(
desc:= [ 107003 ],
fp:= [ 18, 216, 414 ],
next:= [ 103453, 103444, 103448 ] ) ] ), rec(
fp:= [ 167 ],
next:= [ rec(
desc:= [ 107003 ],
fp:= [ 8, 414 ],
next:= [ 106903, 106901 ] ) ] ), rec(
fp:= [ 165, 168, 171, 174 ],
next:= [ rec(
desc:= [ 106003 ],
fp:= [ 214, 412 ],
next:= [ 110943, 110935 ] ), rec(
desc:= [ 106003 ],
fp:= [ 16, 412 ],
next:= [ 110940, 110942 ] ), rec(
desc:= [ 106003 ],
fp:= [ 218, 416, 614 ],
next:= [ 110945, 110937, 110941 ] ), rec(
desc:= [ 106003 ],
fp:= [ 416, 614 ],
next:= [ 110946, rec(
desc:= [ 302006 ],
fp:= [ 1363, 46760 ],
next:= [ 110936, 110938 ] ) ] ) ] ), rec(
fp:= [ 168, 173, 174, 175 ],
next:= [ rec(
desc:= [ 110011 ],
fp:= [ 16, 818, 1214 ],
next:= [ rec(
desc:= [ 302007, 106003, 108003, 206002, 302007, 210002, 302011,
302013, 215002, 40309015 ],
fp:= [ 1, 7681 ],
next:= [ 115224, 115216 ] ), 115221, 115214 ] ), rec(
desc:= [ 302006 ],
fp:= [ 1584, 69500 ],
next:= [ 115218, rec(
desc:= [ 302007, 108003, 110003, 303009, 211003, 303012, 214003,
40710014 ],
fp:= [ 2, 2661 ],
next:= [ 115217, 115225 ] ) ] ), rec(
desc:= [ 302005 ],
fp:= [ 1165, 26960 ],
next:= [ rec(
desc:= [ 106003 ],
fp:= [ 218, 614 ],
next:= [ 115226, 115222 ] ), 115219 ] ), rec(
desc:= [ 105003 ],
fp:= [ 218, 614 ],
next:= [ 115227, 115215 ] ) ] ), rec(
fp:= [ 168, 174, 177 ],
next:= [ rec(
desc:= [ 302004 ],
fp:= [ 1264, 36860 ],
next:= [ 119380, 119386 ] ), rec(
desc:= [ 105003 ],
fp:= [ 20, 416, 614 ],
next:= [ 119379, 119383, 119381 ] ), rec(
desc:= [ 105003 ],
fp:= [ 416, 614 ],
next:= [ 119382, 119385 ] ) ] ), rec(
fp:= [ 165, 171, 172, 173, 174 ],
next:= [ rec(
desc:= [ 106003 ],
fp:= [ 8, 612 ],
next:= [ 123495, 123503 ] ), rec(
desc:= [ 105003 ],
fp:= [ 616, 814 ],
next:= [ 123507, 123497 ] ), rec(
desc:= [ 105003 ],
fp:= [ 814, 1012 ],
next:= [ 123499, 123505 ] ), rec(
desc:= [ 106003 ],
fp:= [ 616, 814 ],
next:= [ 123506, 123496 ] ), rec(
desc:= [ 106003 ],
fp:= [ 616, 814, 1012 ],
next:= [ 123502, 123500, 123504 ] ) ] ), rec(
fp:= [ 174, 175, 176 ],
next:= [ rec(
desc:= [ 105003 ],
fp:= [ 220, 616, 814 ],
next:= [ 127541, 127532, 127540 ] ), rec(
desc:= [ 302007, 206002 ],
fp:= [ 4, 14 ],
next:= [ 127534, 127530 ] ), rec(
desc:= [ 105003 ],
fp:= [ 418, 616, 814 ],
next:= [ 127538, 127543, 127535 ] ) ] ), rec(
fp:= [ 171, 172, 173, 174, 175 ],
next:= [ rec(
desc:= [ 106003 ],
fp:= [ 614, 812 ],
next:= [ rec(
desc:= [ 302012, 208003 ],
fp:= [ 16, 214 ],
next:= [ 131594, 131605 ] ), rec(
desc:= [ 302006, 210002 ],
fp:= [ 18, 414 ],
next:= [ 131606, 131598 ] ) ] ), rec(
desc:= [ 106003 ],
fp:= [ 10, 614 ],
next:= [ 131602, 131597 ] ), rec(
desc:= [ 302006, 302010, 112003, 211003, 303012, 214003 ],
fp:= [ 414, 612 ],
next:= [ 131600, 131608 ] ), rec(
desc:= [ 106003 ],
fp:= [ 616, 1012 ],
next:= [ 131596, 131607 ] ), rec(
desc:= [ 108003, 302005, 209002 ],
fp:= [ 16, 214 ],
next:= [ 131604, 131599 ] ) ] ), rec(
fp:= [ 452, 1960 ],
next:= [ rec(
desc:= [ 302009 ],
fp:= [ 49161, 59541 ],
next:= [ rec(
desc:= [ 113003 ],
fp:= [ 4, 14 ],
next:= [ 158437, 158427 ] ), 158425 ] ), rec(
desc:= [ 113003 ],
fp:= [ 4, 14 ],
next:= [ 158432, 158434 ] ) ] ), rec(
fp:= [ 1631 ],
next:= [ rec(
fp:= [ 66360, 99217 ],
level:= 5,
next:= [ 170849, 170850 ] ) ] ), rec(
fp:= [ 610 ],
next:= [ rec(
desc:= [ 111007 ],
fp:= [ 4, 14 ],
next:= [ 175994, 176002 ] ) ] ), rec(
fp:= [ 655 ],
next:= [ rec(
fp:= [ 44094, 76042 ],
level:= 5,
next:= [ 195675, 195671 ] ) ] ), rec(
fp:= [ 787 ],
next:= [ rec(
desc:= [ 115003 ],
fp:= [ 4, 14 ],
next:= [ 208416, 208406 ] ) ] ), rec(
fp:= [ 657 ],
next:= [ rec(
desc:= [ 114007 ],
fp:= [ 4, 14 ],
next:= [ 231770, 231768 ] ) ] ), rec(
fp:= [ 731 ],
next:= [ rec(
fp:= [ 27545, 90445 ],
level:= 5,
next:= [ 236040, 236032 ] ) ] ), rec(
fp:= [ 611 ],
next:= [ rec(
fp:= [ 25988, 89451 ],
level:= 5,
next:= [ 240544, 240543 ] ) ] ), rec(
fp:= [ 610 ],
next:= [ rec(
fp:= [ 11859, 92283 ],
level:= 5,
next:= [ rec(
desc:= [ 106003 ],
fp:= [ 15, 213 ],
next:= [ 245012, 245014 ] ), 245019 ] ) ] ), rec(
fp:= [ 681 ],
next:= [ rec(
desc:= [ 302016, 106003, 302006, 302008, 211002, 302012, 216002 ],
fp:= [ 2, 111 ],
next:= [ 271283, 271281 ] ) ] ), rec(
fp:= [ 660 ],
next:= [ rec(
desc:= [ 106003 ],
fp:= [ 17, 215 ],
next:= [ 289561, 289560 ] ) ] ), rec(
fp:= [ 765 ],
next:= [ rec(
fp:= [ 17414, 63794 ],
level:= 5,
next:= [ 293773, 293777 ] ) ] ), rec(
fp:= [ 637, 814 ],
next:= [ rec(
fp:= [ 10189, 33237 ],
level:= 5,
next:= [ 297969, 297968 ] ), rec(
desc:= [ 107003 ],
fp:= [ 4, 212 ],
next:= [ 297976, 297964 ] ) ] ), rec(
fp:= [ 807 ],
next:= [ rec(
desc:= [ 113003 ],
fp:= [ 4, 14 ],
next:= [ 302381, 302377 ] ) ] ), rec(
fp:= [ 597, 768 ],
next:= [ rec(
desc:= [ 113007 ],
fp:= [ 4, 14 ],
next:= [ 306830, 306828 ] ), rec(
fp:= [ 14043, 89770 ],
level:= 5,
next:= [ 306820, 306829 ] ) ] ), rec(
fp:= [ 653, 815, 832 ],
next:= [ rec(
desc:= [ 302006 ],
fp:= [ 42693, 56441 ],
next:= [ 311184, rec(
desc:= [ 108003 ],
fp:= [ 413, 611 ],
next:= [ 311187, 311186 ] ) ] ), rec(
fp:= [ 10849, 60010 ],
level:= 5,
next:= [ 311176, 311188 ] ), rec(
fp:= [ 10849, 60010 ],
level:= 5,
next:= [ 311182, rec(
desc:= [ 302006 ],
fp:= [ 841, 58261 ],
next:= [ 311190, 311185 ] ) ] ) ] ), rec(
fp:= [ 1000 ],
next:= [ rec(
fp:= [ 52823, 80917 ],
level:= 5,
next:= [ 328910, 328901 ] ) ] ), rec(
fp:= [ 1031, 1053, 1066, 1093 ],
next:= [ rec(
desc:= [ 108003, 302008, 112003, 115005, 212003, 306016, 40106013 ],
fp:= [ 1, 3841 ],
next:= [ 333118, 333102 ] ), rec(
desc:= [ 107003, 302007, 117007, 313017, 214003, 304011, 215004 ],
fp:= [ 1, 11 ],
next:= [ 333122, 333106 ] ), rec(
desc:= [ 302014, 113003, 213003 ],
fp:= [ 14, 1014 ],
next:= [ 333117, 333097 ] ), rec(
fp:= [ 33329, 71175 ],
level:= 5,
next:= [ 333095, 333112 ] ) ] ), rec(
fp:= [ 1023, 2165 ],
next:= [ rec(
desc:= [ 105003 ],
fp:= [ 8, 18 ],
next:= [ 337980, 337981 ] ), rec(
fp:= [ 36113, 59883 ],
level:= 5,
next:= [ 337984, 337977 ] ) ] ), rec(
fp:= [ 1093 ],
next:= [ rec(
fp:= [ 6388, 10920 ],
level:= 5,
next:= [ 361299, 361284 ] ) ] ), rec(
fp:= [ 1070, 1150, 1180 ],
next:= [ rec(
desc:= [ 109003 ],
fp:= [ 8, 612 ],
next:= [ 367194, 367192 ] ), rec(
desc:= [ 110003 ],
fp:= [ 614, 812 ],
next:= [ 367186, 367190 ] ), rec(
desc:= [ 108003 ],
fp:= [ 816, 1014 ],
next:= [ 367199, 367203 ] ) ] ), rec(
fp:= [ 1201 ],
next:= [ rec(
desc:= [ 107003 ],
fp:= [ 414, 612 ],
next:= [ 387481, 387485 ] ) ] ), rec(
fp:= [ 1221 ],
next:= [ rec(
fp:= [ 6584, 66171 ],
level:= 5,
next:= [ 394008, 394001 ] ) ] ), rec(
fp:= [ 1142, 1156 ],
next:= [ rec(
desc:= [ 109003 ],
fp:= [ 216, 414 ],
next:= [ 399749, 399745 ] ), rec(
fp:= [ 16264, 83760 ],
level:= 5,
next:= [ 399733, 399743 ] ) ] ), rec(
fp:= [ 1418 ],
next:= [ rec(
desc:= [ 302007 ],
fp:= [ 38461, 48262 ],
next:= [ 407466, 407470 ] ) ] ), rec(
fp:= [ 1187, 1384 ],
next:= [ rec(
fp:= [ 47698, 49562 ],
level:= 5,
next:= [ 415495, 415484 ] ), rec(
fp:= [ 1659, 77827 ],
level:= 5,
next:= [ 415512, 415504 ] ) ] ), rec(
fp:= [ 1265 ],
next:= [ rec(
fp:= [ 21291, 89248 ],
level:= 5,
next:= [ 424429, 424411 ] ) ] ), rec(
fp:= [ 1221 ],
next:= [ rec(
fp:= [ 26451, 55675 ],
level:= 5,
next:= [ 440045, 440025 ] ) ] ), rec(
fp:= [ 1192, 1362 ],
next:= [ rec(
desc:= [ 302009, 210003 ],
fp:= [ 4, 14 ],
next:= [ 446789, 446780 ] ), rec(
fp:= [ 21553, 45381 ],
level:= 5,
next:= [ 446808, 446800 ] ) ] ), rec(
fp:= [ 1055, 1352 ],
next:= [ rec(
desc:= [ 107003 ],
fp:= [ 816, 1212 ],
next:= [ 453284, 453292 ] ), rec(
desc:= [ 107003 ],
fp:= [ 16, 412 ],
next:= [ 453298, 453302 ] ) ] ), rec(
fp:= [ 1032, 1146, 1177, 1488 ],
next:= [ rec(
desc:= [ 115011 ],
fp:= [ 8, 18 ],
next:= [ 461023, 461019 ] ), rec(
fp:= [ 54312, 60275 ],
level:= 5,
next:= [ 461032, rec(
desc:= [ 108003 ],
fp:= [ 616, 1012 ],
next:= [ 461034, 461029 ] ) ] ), rec(
fp:= [ 54312, 60275 ],
level:= 5,
next:= [ 461012, 461017 ] ), rec(
fp:= [ 37508, 45993 ],
level:= 5,
next:= [ 461030, 461026 ] ) ] ), rec(
fp:= [ 1327 ],
next:= [ rec(
desc:= [ 302009 ],
fp:= [ 285, 38461 ],
next:= [ 469697, 469693 ] ) ] ), rec(
fp:= [ 1202, 1384 ],
next:= [ rec(
fp:= [ 26541, 86068 ],
level:= 5,
next:= [ 478397, 478385 ] ), rec(
fp:= [ 47433, 63524 ],
level:= 5,
next:= [ 478403, 478388 ] ) ] ), rec(
fp:= [ 1383, 1417 ],
next:= [ rec(
desc:= [ 107003 ],
fp:= [ 416, 812 ],
next:= [ 496820, 496836 ] ), rec(
desc:= [ 302007 ],
fp:= [ 384, 48361 ],
next:= [ 496822, 496838 ] ) ] ), rec(
fp:= [ 1255 ],
next:= [ rec(
fp:= [ 21578, 84003 ],
level:= 5,
next:= [ 505590, 505591 ] ) ] ), rec(
fp:= [ 1384, 1561 ],
next:= [ rec(
desc:= [ 113011 ],
fp:= [ 4, 14 ],
next:= [ 514728, 514736 ] ), rec(
desc:= [ 302009 ],
fp:= [ 45121, 54583 ],
next:= [ 514732, 514740 ] ) ] ), rec(
fp:= [ 1310, 1528 ],
next:= [ rec(
desc:= [ 302008 ],
fp:= [ 483, 58261 ],
next:= [ 523205, 523193 ] ), rec(
fp:= [ 10986, 61635 ],
level:= 5,
next:= [ 523194, 523202 ] ) ] ), rec(
fp:= [ 1072, 1185, 1538 ],
next:= [ rec(
desc:= [ 302006, 302011, 112003, 212003 ],
fp:= [ 2, 12 ],
next:= [ 537647, 537635 ] ), rec(
desc:= [ 106003 ],
fp:= [ 18, 216, 414 ],
next:= [ 537642, 537645, 537649 ] ), rec(
desc:= [ 105003 ],
fp:= [ 20, 218 ],
next:= [ 537634, 537638 ] ) ] ), rec(
fp:= [ 1197 ],
next:= [ rec(
fp:= [ 36014, 46227 ],
level:= 5,
next:= [ 544828, 544813 ] ) ] ), rec(
fp:= [ 1259 ],
next:= [ rec(
fp:= [ 50993, 71362 ],
level:= 5,
next:= [ 553874, 553869 ] ) ] ), rec(
fp:= [ 1104, 1289 ],
next:= [ rec(
fp:= [ 1690, 16563 ],
level:= 5,
next:= [ 562707, 562729 ] ), rec(
desc:= [ 115011 ],
fp:= [ 8, 414 ],
next:= [ 562725, 562705 ] ) ] ), rec(
fp:= [ 1209, 1428 ],
next:= [ rec(
fp:= [ 16620, 42240 ],
level:= 5,
next:= [ 571683, 571656 ] ), rec(
fp:= [ 50333, 94724 ],
level:= 5,
next:= [ 571662, 571676 ] ) ] ), rec(
fp:= [ 1253, 1276 ],
next:= [ rec(
fp:= [ 8871, 52551 ],
level:= 5,
next:= [ 580888, 580865 ] ), rec(
fp:= [ 21314, 64994 ],
level:= 5,
next:= [ 580864, 580861 ] ) ] ), rec(
fp:= [ 1043, 1218 ],
next:= [ rec(
desc:= [ 302011, 211003 ],
fp:= [ 22, 418 ],
next:= [ 598539, 598547 ] ), rec(
fp:= [ 13679, 83668 ],
level:= 5,
next:= [ 598550, 598541 ] ) ] ), rec(
fp:= [ 1158 ],
next:= [ rec(
fp:= [ 14247, 87466 ],
level:= 5,
next:= [ 605142, 605135 ] ) ] ), rec(
fp:= [ 1174 ],
next:= [ rec(
desc:= [ 302007, 212002 ],
fp:= [ 418, 616 ],
next:= [ 627480, 627481 ] ) ] ), rec(
fp:= [ 1142, 1156, 1401, 1405 ],
next:= [ rec(
desc:= [ 302010 ],
fp:= [ 54781, 64921 ],
next:= [ 634770, 634774 ] ), rec(
fp:= [ 32588, 68207 ],
level:= 5,
next:= [ 634796, 634787 ] ), rec(
fp:= [ 11364, 26526 ],
level:= 5,
next:= [ 634788, 634799 ] ), rec(
fp:= [ 7626, 98195 ],
level:= 5,
next:= [ 634775, 634794 ] ) ] ), rec(
fp:= [ 1175, 1289, 1478 ],
next:= [ rec(
fp:= [ 11886, 77898 ],
level:= 5,
next:= [ 643771, 643758 ] ), rec(
fp:= [ 3193, 11826 ],
level:= 5,
next:= [ 643756, 643777 ] ), rec(
fp:= [ 41109, 52410 ],
level:= 5,
next:= [ 643784, 643775 ] ) ] ), rec(
fp:= [ 1139, 1196, 1488 ],
next:= [ rec(
fp:= [ 5625, 45981 ],
level:= 5,
next:= [ 652474, 652480 ] ), rec(
fp:= [ 39855, 89015 ],
level:= 5,
next:= [ 652498, 652473 ] ), rec(
fp:= [ 38377, 72206 ],
level:= 5,
next:= [ 652501, 652502 ] ) ] ), rec(
fp:= [ 1246, 1250, 1259, 1491 ],
next:= [ rec(
desc:= [ 302011, 211002 ],
fp:= [ 513, 711 ],
next:= [ 661193, 661198 ] ), rec(
desc:= [ 112011 ],
fp:= [ 8, 414 ],
next:= [ 661195, 661190 ] ), rec(
desc:= [ 112011 ],
fp:= [ 8, 18, 414 ],
next:= [ 661211, 661208, 661188 ] ), rec(
desc:= [ 302007, 211002 ],
fp:= [ 1016, 1214 ],
next:= [ 661206, 661196 ] ) ] ), rec(
fp:= [ 1055, 1155 ],
next:= [ rec(
desc:= [ 106003 ],
fp:= [ 818, 1016 ],
next:= [ 670251, 670235 ] ), rec(
fp:= [ 57636, 59126 ],
level:= 5,
next:= [ 670239, 670249 ] ) ] ), rec(
fp:= [ 1208 ],
next:= [ rec(
desc:= [ 302008 ],
fp:= [ 563, 38541 ],
next:= [ 678578, 678581 ] ) ] ), rec(
fp:= [ 1203, 1248, 1410 ],
next:= [ rec(
fp:= [ 42509, 51142 ],
level:= 5,
next:= [ 697034, 697035 ] ), rec(
fp:= [ 13269, 18843 ],
level:= 5,
next:= [ 697042, 697044 ] ), rec(
desc:= [ 107003 ],
fp:= [ 214, 412 ],
next:= [ 697056, 697050 ] ) ] ), rec(
fp:= [ 1285, 1451 ],
next:= [ rec(
fp:= [ 30879, 92165 ],
level:= 5,
next:= [ 706117, 706101 ] ), rec(
desc:= [ 302006 ],
fp:= [ 38461, 48262 ],
next:= [ 706130, 706104 ] ) ] ), rec(
fp:= [ 1242, 1246, 1308, 1494 ],
next:= [ rec(
desc:= [ 302007 ],
fp:= [ 28561, 38362 ],
next:= [ 715288, 715282 ] ), rec(
desc:= [ 302006 ],
fp:= [ 18661, 28462 ],
next:= [ 715296, 715287 ] ), rec(
fp:= [ 15947, 82834 ],
level:= 5,
next:= [ 715281, 715286 ] ), rec(
desc:= [ 302006 ],
fp:= [ 285, 38461 ],
next:= [ 715310, 715285 ] ) ] ), rec(
fp:= [ 1264 ],
next:= [ rec(
desc:= [ 302006 ],
fp:= [ 18661, 38263 ],
next:= [ 724589, 724582 ] ) ] ), rec(
fp:= [ 1462 ],
next:= [ rec(
fp:= [ 19110, 59406 ],
level:= 5,
next:= [ 733625, 733634 ] ) ] ), rec(
fp:= [ 1224, 1432, 1463 ],
next:= [ rec(
desc:= [ 106003 ],
fp:= [ 618, 816 ],
next:= [ 751875, 751870 ] ), rec(
desc:= [ 106003 ],
fp:= [ 416, 614 ],
next:= [ 751896, 751889 ] ), rec(
desc:= [ 106003 ],
fp:= [ 416, 614 ],
next:= [ 751892, 751872 ] ) ] ), rec(
fp:= [ 1502, 1511 ],
next:= [ rec(
desc:= [ 106003 ],
fp:= [ 414, 612 ],
next:= [ 761178, 761161 ] ), rec(
desc:= [ 302006 ],
fp:= [ 662, 48361 ],
next:= [ 761185, 761174 ] ) ] ), rec(
fp:= [ 1239, 1452, 1458, 1500 ],
next:= [ rec(
desc:= [ 105003 ],
fp:= [ 222, 420 ],
next:= [ 778653, 778662 ] ), rec(
desc:= [ 105003 ],
fp:= [ 18, 216 ],
next:= [ 778674, 778665 ] ), rec(
desc:= [ 105003 ],
fp:= [ 20, 218 ],
next:= [ 778682, 778656 ] ), rec(
desc:= [ 302008 ],
fp:= [ 80997, 87367, 89161 ],
next:= [ 778670, 778681, 778676 ] ) ] ), rec(
fp:= [ 1206, 1211, 1485 ],
next:= [ rec(
desc:= [ 302006 ],
fp:= [ 28462, 28641 ],
next:= [ 787713, 787720 ] ), rec(
desc:= [ 113011 ],
fp:= [ 8, 414 ],
next:= [ 787714, 787726 ] ), rec(
desc:= [ 302008 ],
fp:= [ 54922, 77227 ],
next:= [ 787733, 787740 ] ) ] ), rec(
fp:= [ 1209, 1487 ],
next:= [ rec(
fp:= [ 30879, 92165 ],
level:= 5,
next:= [ 796577, rec(
desc:= [ 106003 ],
fp:= [ 20, 614 ],
next:= [ 796593, 796592 ] ) ] ), rec(
desc:= [ 106003 ],
fp:= [ 416, 614 ],
next:= [ 796604, 796580 ] ) ] ), rec(
fp:= [ 1019, 1117 ],
next:= [ rec(
fp:= [ 8760, 20428 ],
level:= 5,
next:= [ 804528, rec(
desc:= [ 302008 ],
fp:= [ 69500, 79880 ],
next:= [ 804531, 804530 ] ) ] ), rec(
fp:= [ 26185, 62961 ],
level:= 5,
next:= [ 804532, 804534 ] ) ] ), rec(
fp:= [ 1410 ],
next:= [ rec(
fp:= [ 35670, 60283 ],
level:= 5,
next:= [ 810932, rec(
desc:= [ 107003 ],
fp:= [ 2, 12 ],
next:= [ 810950, 810928 ] ) ] ) ] ), rec(
fp:= [ 1275, 1400, 1410, 1420 ],
next:= [ rec(
desc:= [ 108003 ],
fp:= [ 6, 412 ],
next:= [ 843785, 843767 ] ), rec(
fp:= [ 8767, 68714 ],
level:= 5,
next:= [ rec(
desc:= [ 302011 ],
fp:= [ 7536, 80547, 90348 ],
next:= [ 843772, 843773, 843783 ] ), 843768 ] ), rec(
desc:= [ 302010 ],
fp:= [ 69022, 80448 ],
next:= [ 843787, 843790 ] ), rec(
desc:= [ 108003 ],
fp:= [ 2, 12 ],
next:= [ 843766, 843789 ] ) ] ), rec(
fp:= [ 1212, 1259, 1421, 1430, 1470, 1515, 1563 ],
next:= [ rec(
desc:= [ 302007 ],
fp:= [ 18463, 28264 ],
next:= [ 852803, 852795 ] ), rec(
desc:= [ 302008 ],
fp:= [ 36033, 69053 ],
next:= [ 852799, 852786 ] ), rec(
desc:= [ 302008 ],
fp:= [ 5825, 62249 ],
next:= [ 852805, 852815 ] ), rec(
desc:= [ 302008 ],
fp:= [ 42723, 70603 ],
next:= [ 852807, 852789 ] ), rec(
desc:= [ 302008 ],
fp:= [ 49253, 59054 ],
next:= [ 852810, 852813 ] ), rec(
desc:= [ 302009 ],
fp:= [ 73739, 80448 ],
next:= [ 852808, 852792 ] ), rec(
desc:= [ 302009 ],
fp:= [ 926, 83738 ],
next:= [ 852806, 852816 ] ) ] ), rec(
fp:= [ 1377, 1491 ],
next:= [ rec(
desc:= [ 302008 ],
fp:= [ 643, 74581 ],
next:= [ 861996, 861980 ] ), rec(
desc:= [ 106003 ],
fp:= [ 214, 412 ],
next:= [ 861982, 861994 ] ) ] ), rec(
fp:= [ 1446 ],
next:= [ rec(
desc:= [ 302008 ],
fp:= [ 64681, 74821 ],
next:= [ 871258, 871260 ] ) ] ), rec(
fp:= [ 1135, 1345, 1402, 1417, 1429, 1560 ],
next:= [ rec(
fp:= [ 85775, 89204 ],
level:= 5,
next:= [ 880521, 880507 ] ), rec(
fp:= [ 38614, 66661 ],
level:= 5,
next:= [ 880500, 880513 ] ), rec(
fp:= [ 9381, 24543 ],
level:= 5,
next:= [ 880525, 880502 ] ), rec(
desc:= [ 302011 ],
fp:= [ 34783, 44584, 93977 ],
next:= [ 880523, 880524, 880514 ] ), rec(
fp:= [ 31051, 46671 ],
level:= 5,
next:= [ 880517, 880499 ] ), rec(
desc:= [ 107003 ],
fp:= [ 2, 12 ],
next:= [ 880518, 880528 ] ) ] ), rec(
fp:= [ 1150, 1367, 1418, 1510 ],
next:= [ rec(
desc:= [ 107003 ],
fp:= [ 6, 214 ],
next:= [ 898957, 898942 ] ), rec(
desc:= [ 108003 ],
fp:= [ 4, 212 ],
next:= [ 898949, 898952 ] ), rec(
desc:= [ 108003 ],
fp:= [ 4, 212 ],
next:= [ 898958, 898962 ] ), rec(
desc:= [ 108003 ],
fp:= [ 4, 212 ],
next:= [ 898963, 898944 ] ) ] ), rec(
fp:= [ 1199, 1308, 1532, 1561 ],
next:= [ rec(
desc:= [ 302006 ],
fp:= [ 48262, 48441 ],
next:= [ 908122, 908114 ] ), rec(
desc:= [ 106003 ],
fp:= [ 10, 614 ],
next:= [ 908128, 908137 ] ), rec(
desc:= [ 106003 ],
fp:= [ 6, 214 ],
next:= [ 908120, 908139 ] ), rec(
desc:= [ 302007 ],
fp:= [ 35934, 42643 ],
next:= [ 908134, 908144 ] ) ] ), rec(
fp:= [ 1163, 1405, 1420, 1481 ],
next:= [ rec(
desc:= [ 302009 ],
fp:= [ 742, 1081 ],
next:= [ 917366, 917363 ] ), rec(
fp:= [ 59148, 86302 ],
level:= 5,
next:= [ rec(
desc:= [ 107003 ],
fp:= [ 14, 212 ],
next:= [ 917386, 917377 ] ), 917382 ] ), rec(
fp:= [ 38582, 72307 ],
level:= 5,
next:= [ rec(
desc:= [ 302007 ],
fp:= [ 582, 761 ],
next:= [ 917385, 917364 ] ), 917369 ] ), rec(
desc:= [ 107003 ],
fp:= [ 6, 412 ],
next:= [ 917359, 917361 ] ) ] ), rec(
fp:= [ 1416, 1435 ],
next:= [ rec(
desc:= [ 108003 ],
fp:= [ 4, 212 ],
next:= [ 926629, 926621 ] ), rec(
desc:= [ 108003 ],
fp:= [ 4, 212 ],
next:= [ 926638, 926626 ] ) ] ), rec(
fp:= [ 1424, 1437 ],
next:= [ rec(
desc:= [ 108003 ],
fp:= [ 14, 212 ],
next:= [ 935562, 935564 ] ), rec(
desc:= [ 108003 ],
fp:= [ 14, 212 ],
next:= [ 935567, 935546 ] ) ] ), rec(
fp:= [ 1263, 1381 ],
next:= [ rec(
fp:= [ 66609, 69242 ],
level:= 5,
next:= [ 944755, 944741 ] ), rec(
desc:= [ 107003 ],
fp:= [ 6, 412 ],
next:= [ 944734, 944750 ] ) ] ), rec(
fp:= [ 1204, 1446 ],
next:= [ rec(
desc:= [ 107003 ],
fp:= [ 414, 612 ],
next:= [ 953906, 953900 ] ), rec(
desc:= [ 107003 ],
fp:= [ 214, 412 ],
next:= [ 953920, 953921 ] ) ] ), rec(
fp:= [ 1212, 1384, 1430 ],
next:= [ rec(
desc:= [ 302007 ],
fp:= [ 18364, 36033 ],
next:= [ 963124, 963131 ] ), rec(
desc:= [ 302009 ],
fp:= [ 742, 1081 ],
next:= [ 963126, 963139 ] ), rec(
desc:= [ 302008 ],
fp:= [ 52703, 70603 ],
next:= [ 963148, 963127 ] ) ] ), rec(
fp:= [ 1445 ],
next:= [ rec(
desc:= [ 302006 ],
fp:= [ 36193, 70603 ],
next:= [ 972309, 972300 ] ) ] ), rec(
fp:= [ 1210, 1519, 1568 ],
next:= [ rec(
desc:= [ 106003 ],
fp:= [ 614, 812 ],
next:= [ 981448, 981447 ] ), rec(
desc:= [ 302006 ],
fp:= [ 841, 58261 ],
next:= [ 981459, 981469 ] ), rec(
desc:= [ 106003 ],
fp:= [ 2, 12 ],
next:= [ 981460, 981452 ] ) ] ), rec(
fp:= [ 1421, 1457 ],
next:= [ rec(
desc:= [ 302010 ],
fp:= [ 7536, 69121, 90348 ],
next:= [ 999501, 999503, 999493 ] ), rec(
desc:= [ 302008 ],
fp:= [ 28443, 98876 ],
next:= [ 999496, 999502 ] ) ] ), rec(
fp:= [ 1149 ],
next:= [ rec(
fp:= [ 3117, 42657, 52576 ],
level:= 5,
next:= [ 1007769, 1007782, 1007780 ] ) ] ), rec(
fp:= [ 1155, 1217 ],
next:= [ rec(
fp:= [ 55160, 60046 ],
level:= 5,
next:= [ 1014685, 1014691 ] ), rec(
fp:= [ 27743, 52428 ],
level:= 5,
next:= [ 1014692, 1014687 ] ) ] ), rec(
fp:= [ 1037, 1252, 1256, 1307 ],
next:= [ rec(
desc:= [ 302006, 210002 ],
fp:= [ 1014, 1212 ],
next:= [ 1022311, 1022303 ] ), rec(
desc:= [ 106003 ],
fp:= [ 218, 416 ],
next:= [ 1022309, 1022296 ] ), rec(
fp:= [ 43640, 43795 ],
level:= 5,
next:= [ 1022317, 1022323 ] ), rec(
fp:= [ 51380, 66880 ],
level:= 5,
next:= [ 1022313, 1022310 ] ) ] ), rec(
fp:= [ 1091, 1170, 1182, 1205, 1254 ],
next:= [ rec(
desc:= [ 107003 ],
fp:= [ 224, 620 ],
next:= [ 1029593, 1029585 ] ), rec(
desc:= [ 107003 ],
fp:= [ 218, 614 ],
next:= [ 1029601, 1029609 ] ), rec(
fp:= [ 20339, 67982 ],
level:= 5,
next:= [ 1029595, 1029597 ] ), rec(
fp:= [ 5622, 21384 ],
level:= 5,
next:= [ 1029598, 1029605 ] ), rec(
desc:= [ 302010 ],
fp:= [ 44683, 93737 ],
next:= [ 1029586, 1029590 ] ) ] ), rec(
fp:= [ 1656, 1665, 1699, 1700 ],
next:= [ rec(
fp:= [ 3733, 31205 ],
level:= 5,
next:= [ 1034238, 1034220 ] ), rec(
fp:= [ 66297, 89133 ],
level:= 5,
next:= [ 1034222, 1034240 ] ), rec(
desc:= [ 110003, 302007, 211002, 40104012 ],
fp:= [ 1, 1921 ],
next:= [ 1034236, 1034224 ] ), rec(
fp:= [ 72475, 82523 ],
level:= 5,
next:= [ 1034227, 1034221 ] ) ] ), rec(
fp:= [ 2045 ],
next:= [ rec(
fp:= [ 51294, 51302 ],
level:= 5,
next:= [ 1070117, 1070123 ] ) ] ), rec(
fp:= [ 2230 ],
next:= [ rec(
fp:= [ 33419, 65748 ],
level:= 5,
next:= [ 1079962, 1079964 ] ) ] ) ] );
| 29.630705 | 77 | 0.420844 |
a0b77757494f17a570c398c32abee0d12cf22960 | 3,026 | adb | Ada | arch/ARM/Nordic/drivers/nrf_common/nrf-temperature.adb | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 192 | 2016-06-01T18:32:04.000Z | 2022-03-26T22:52:31.000Z | arch/ARM/Nordic/drivers/nrf_common/nrf-temperature.adb | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 239 | 2016-05-26T20:02:01.000Z | 2022-03-31T09:46:56.000Z | arch/ARM/Nordic/drivers/nrf_common/nrf-temperature.adb | shakram02/Ada_Drivers_Library | a407ca7ddbc2d9756647016c2f8fd8ef24a239ff | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | ------------------------------------------------------------------------------
-- --
-- Copyright (C) 2016-2020, 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 NRF_SVD.TEMP; use NRF_SVD.TEMP;
with HAL;
package body nRF.Temperature is
type RAW_Temp is delta 0.25 range
Temp_Celsius'First * 4.0 .. Temp_Celsius'Last * 4.0;
----------
-- Read --
----------
function Read return Temp_Celsius is
use type HAL.UInt32;
Raw : RAW_Temp;
begin
-- Clear event
TEMP_Periph.EVENTS_DATARDY := 0;
-- Start temperature measurement
TEMP_Periph.TASKS_START := 1;
while TEMP_Periph.EVENTS_DATARDY = 0 loop
null;
end loop;
Raw := RAW_Temp (TEMP_Periph.TEMP);
return Temp_Celsius (Raw / 4);
end Read;
end nRF.Temperature;
| 45.164179 | 78 | 0.526768 |
38bc5ee13a9c8c51ce9639d86af4e735909619a3 | 725 | ads | Ada | orka/src/orka/interface/orka-containers.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 52 | 2016-07-30T23:00:28.000Z | 2022-02-05T11:54:55.000Z | orka/src/orka/interface/orka-containers.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 79 | 2016-08-01T18:36:48.000Z | 2022-02-27T12:14:20.000Z | orka/src/orka/interface/orka-containers.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 4 | 2018-04-28T22:36:26.000Z | 2020-11-14T23:00:29.000Z | -- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2017 onox <[email protected]>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
package Orka.Containers is
pragma Pure;
end Orka.Containers;
| 36.25 | 76 | 0.731034 |
41e63e04babb1963e87b4015c887a0623feb5012 | 335 | adb | Ada | day-01/solve.adb | stevancorre/advent-of-code-2021 | 8b40f412429b79bb5c6d498c206b35b9fab44117 | [
"MIT"
] | null | null | null | day-01/solve.adb | stevancorre/advent-of-code-2021 | 8b40f412429b79bb5c6d498c206b35b9fab44117 | [
"MIT"
] | null | null | null | day-01/solve.adb | stevancorre/advent-of-code-2021 | 8b40f412429b79bb5c6d498c206b35b9fab44117 | [
"MIT"
] | null | null | null | package body Solve is
function Get_Line_Integer (File : File_Type) return Integer is
Line_Buffer : Unbounded_String;
Result : Integer;
begin
Line_Buffer := Get_Line (File);
Result := Integer'Value (To_String (Line_Buffer));
return Result;
end Get_Line_Integer;
end Solve;
| 27.916667 | 66 | 0.641791 |
1ee83a17cd9076cafe54b1ad97384a34a4e1eab8 | 5,373 | adb | Ada | samples/bean.adb | jquorning/ada-el | b0b07da093ac6109286404cb54a62a9a93816610 | [
"Apache-2.0"
] | 6 | 2015-01-18T23:04:00.000Z | 2022-01-26T12:34:07.000Z | samples/bean.adb | jquorning/ada-el | b0b07da093ac6109286404cb54a62a9a93816610 | [
"Apache-2.0"
] | 1 | 2022-01-30T20:46:16.000Z | 2022-01-30T20:46:16.000Z | samples/bean.adb | jquorning/ada-el | b0b07da093ac6109286404cb54a62a9a93816610 | [
"Apache-2.0"
] | 2 | 2021-01-06T08:27:49.000Z | 2022-01-30T19:33:41.000Z | -----------------------------------------------------------------------
-- bean - A simple bean example
-- Copyright (C) 2009, 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 Util.Beans.Factory;
with EL.Methods.Func_String;
with EL.Methods.Func_Unbounded;
with Ada.Unchecked_Deallocation;
package body Bean is
use EL.Objects;
use Util.Beans.Methods;
use EL.Methods;
FIRST_NAME : constant String := "firstName";
LAST_NAME : constant String := "lastName";
AGE : constant String := "age";
Null_Object : Object;
function Create_Person (First_Name, Last_Name : String;
Age : Natural) return Person_Access is
begin
return new Person '(First_Name => To_Unbounded_String (First_Name),
Last_Name => To_Unbounded_String (Last_Name),
Age => Age);
end Create_Person;
-- Get the value identified by the name.
function Get_Value (From : Person; Name : String) return EL.Objects.Object is
begin
if Name = FIRST_NAME then
return To_Object (From.First_Name);
elsif Name = LAST_NAME then
return To_Object (From.Last_Name);
elsif Name = AGE then
return To_Object (From.Age);
else
return Null_Object;
end if;
end Get_Value;
-- Set the value identified by the name.
procedure Set_Value (From : in out Person;
Name : in String;
Value : in EL.Objects.Object) is
begin
if Name = FIRST_NAME then
From.First_Name := To_Unbounded_String (Value);
elsif Name = LAST_NAME then
From.Last_Name := To_Unbounded_String (Value);
elsif Name = AGE then
From.Age := Natural (To_Integer (Value));
end if;
end Set_Value;
--
function Save (P : in Person; Name : in Unbounded_String) return Unbounded_String is
Result : Unbounded_String;
begin
Result := P.Last_Name & Name;
return Result;
end Save;
function Compute (B : Util.Beans.Basic.Bean'Class;
P1 : EL.Objects.Object) return EL.Objects.Object is
P : Person := Person (B);
begin
return P1;
end Compute;
-- Function to format a string
function Format (Arg : EL.Objects.Object) return EL.Objects.Object is
S : constant String := To_String (Arg);
begin
return To_Object ("[" & S & "]");
end Format;
function Print (P : in Person; Title : in String) return String is
begin
return Title & " ["
& "Name=" & To_String (P.First_Name) & ", "
& "Last_name=" & To_String (P.Last_Name) & "]";
end Print;
package Save_Binding is
new Func_Unbounded.Bind (Bean => Person,
Method => Save,
Name => "save");
package Print_Binding is
new Func_String.Bind (Bean => Person,
Method => Print,
Name => "print");
type Bean_Definition is new Util.Beans.Factory.Bean_Definition with null record;
-- Create a bean.
overriding
function Create (Def : in Bean_Definition)
return Util.Beans.Basic.Readonly_Bean_Access;
-- Free the bean instance.
overriding
procedure Destroy (Def : in Bean_Definition;
Bean : in out Util.Beans.Basic.Readonly_Bean_Access);
-- Create a bean.
overriding
function Create (Def : in Bean_Definition)
return Util.Beans.Basic.Readonly_Bean_Access is
Result : Person_Access := new Person;
begin
return Result.all'Access;
end Create;
-- Free the bean instance.
overriding
procedure Destroy (Def : in Bean_Definition;
Bean : in out Util.Beans.Basic.Readonly_Bean_Access) is
begin
null;
end Destroy;
B : aliased Bean_Definition
:= Bean_Definition '(Method_Count => 2,
Methods => (Save_Binding.Proxy'Access, null)
);
Binding_Array : aliased constant Util.Beans.Methods.Method_Binding_Array
:= (Save_Binding.Proxy'Access, Print_Binding.Proxy'Access);
function Get_Method_Bindings (From : in Person)
return Util.Beans.Methods.Method_Binding_Array_Access is
begin
return Binding_Array'Access;
end Get_Method_Bindings;
procedure Free (Object : in out Person_Access) is
procedure Free is new Ada.Unchecked_Deallocation (Object => Person'Class,
Name => Person_Access);
begin
Free (Object);
end Free;
end Bean;
| 33.166667 | 89 | 0.598734 |
03ae90a3fc24d0acdfd90482af7785bd7f71208a | 5,641 | ads | Ada | bb-runtimes/runtimes/zfp-stm32f3x4/gnat/g-souinf.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/zfp-stm32f3x4/gnat/g-souinf.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/zfp-stm32f3x4/gnat/g-souinf.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- G N A T . S O U R C E _ I N F O --
-- --
-- S p e c --
-- --
-- Copyright (C) 2000-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package provides some useful utility subprograms that provide access
-- to source code information known at compile time. These subprograms are
-- intrinsic operations that provide information known to the compiler in
-- a form that can be embedded into the source program for identification
-- and logging purposes. For example, an exception handler can print out
-- the name of the source file in which the exception is handled.
package GNAT.Source_Info is
pragma Preelaborate;
-- Note that this unit is Preelaborate, but not Pure, that's because the
-- functions here such as Line are clearly not pure functions, and normally
-- we mark intrinsic functions in a Pure unit as Pure, even though they are
-- imported.
--
-- Historical note: this used to be Pure, but that was when we marked all
-- intrinsics as not Pure, even in Pure units, so no problems arose.
function File return String with
Import, Convention => Intrinsic;
-- Return the name of the current file, not including the path information.
-- The result is considered to be a static string constant.
function Line return Positive with
Import, Convention => Intrinsic;
-- Return the current input line number. The result is considered to be a
-- static expression.
function Source_Location return String with
Import, Convention => Intrinsic;
-- Return a string literal of the form "name:line", where name is the
-- current source file name without path information, and line is the
-- current line number. In the event that instantiations are involved,
-- additional suffixes of the same form are appended after the separating
-- string " instantiated at ". The result is considered to be a static
-- string constant.
function Enclosing_Entity return String with
Import, Convention => Intrinsic;
-- Return the name of the current subprogram, package, task, entry or
-- protected subprogram. The string is in exactly the form used for the
-- declaration of the entity (casing and encoding conventions), and is
-- considered to be a static string constant. The name is fully qualified
-- using periods where possible (this is not always possible, notably in
-- the case of entities appearing in unnamed block statements.)
--
-- Note: if this function is used at the outer level of a generic package,
-- the string returned will be the name of the instance, not the generic
-- package itself. This is useful in identifying and logging information
-- from within generic templates.
function Compilation_ISO_Date return String with
Import, Convention => Intrinsic;
-- Returns date of compilation as a static string "yyyy-mm-dd".
function Compilation_Date return String with
Import, Convention => Intrinsic;
-- Returns date of compilation as a static string "mmm dd yyyy". This is
-- in local time form, and is exactly compatible with C macro __DATE__.
function Compilation_Time return String with
Import, Convention => Intrinsic;
-- Returns GMT time of compilation as a static string "hh:mm:ss". This is
-- in local time form, and is exactly compatible with C macro __TIME__.
end GNAT.Source_Info;
| 58.154639 | 79 | 0.547952 |
19b1de9213c3a0bdfe46cdbf533cc050307eb4f9 | 4,476 | adb | Ada | PIM/TP10/evaluer_alea_th.adb | Hathoute/ENSEEIHT | d42f0b0dedb269e6df3b1c006d4d45e52fc518b8 | [
"MIT"
] | 1 | 2021-06-26T21:51:11.000Z | 2021-06-26T21:51:11.000Z | PIM/TP10/evaluer_alea_th.adb | Hathoute/ENSEEIHT | d42f0b0dedb269e6df3b1c006d4d45e52fc518b8 | [
"MIT"
] | null | null | null | PIM/TP10/evaluer_alea_th.adb | Hathoute/ENSEEIHT | d42f0b0dedb269e6df3b1c006d4d45e52fc518b8 | [
"MIT"
] | null | null | null | with Ada.Text_IO; use Ada.Text_IO;
with Ada.Integer_Text_IO; use Ada.Integer_Text_IO;
with Ada.Command_Line; use Ada.Command_Line;
with SDA_Exceptions; use SDA_Exceptions;
with Alea;
with TH;
-- Évaluer la qualité du générateur aléatoire et les SDA.
procedure Evaluer_Alea_TH is
-- Fonction Identité
function Identity(Nombre: in Integer) return Integer is
begin
return Nombre;
end Identity;
package TH_int_int is
new TH (Capacite => 1000, T_Cle => Integer, T_Donnee => Integer, Hachage => Identity);
use TH_int_int;
-- Afficher l'usage.
procedure Afficher_Usage is
begin
New_Line;
Put_Line ("Usage : " & Command_Name & " Borne Taille");
New_Line;
Put_Line (" Borne : les nombres sont tirés dans l'intervalle 1..Borne");
Put_Line (" Taille : la taille de l'échantillon");
New_Line;
end Afficher_Usage;
-- Afficher le Nom et la Valeur d'une variable.
-- La Valeur est affichée sur la Largeur_Valeur précisée.
procedure Afficher_Variable (Nom: String; Valeur: in Integer; Largeur_Valeur: in Integer := 1) is
begin
Put (Nom);
Put (" : ");
Put (Valeur, Largeur_Valeur);
New_Line;
end Afficher_Variable;
-- Évaluer la qualité du générateur de nombre aléatoire Alea sur un
-- intervalle donné en calculant les fréquences absolues minimales et
-- maximales des entiers obtenus lors de plusieurs tirages aléatoires.
--
-- Paramètres :
-- Borne: in Entier -- le nombre aléatoire est dans 1..Borne
-- Taille: in Entier -- nombre de tirages (taille de l'échantillon)
-- Min, Max: out Entier -- fréquence minimale et maximale
--
-- Nécessite :
-- Borne > 1
-- Taille > 1
--
-- Assure : -- poscondition peu intéressante !
-- 0 <= Min Et Min <= Taille
-- 0 <= Max Et Max <= Taille
-- Min + Max <= Taille
-- Min <= Moyenne Et Moyenne <= Max
--
-- Remarque : On ne peut ni formaliser les 'vraies' postconditions,
-- ni écrire de programme de test car on ne maîtrise par le générateur
-- aléatoire. Pour écrire un programme de test, on pourrait remplacer
-- le générateur par un générateur qui fournit une séquence connue
-- d'entiers et pour laquelle on pourrait déterminer les données
-- statistiques demandées.
-- Ici, pour tester on peut afficher les nombres aléatoires et refaire
-- les calculs par ailleurs pour vérifier que le résultat produit est
-- le bon.
procedure Calculer_Statistiques (
Borne : in Integer; -- Borne supérieur de l'intervalle de recherche
Taille : in Integer; -- Taille de l'échantillon
Min, Max : out Integer -- min et max des fréquences de l'échantillon
) with
Pre => Borne > 1 and Taille > 1,
Post => 0 <= Min and Min <= Taille
and 0 <= Max and Max <= Taille
and Min + Max <= Taille
is
-- Sous procedure mettant à jour le Max et Min.
procedure MAJ_Max_Min(Cle: Integer; Donnee: Integer) is
begin
if Max < Donnee then
Max := Donnee;
end if;
if Min > Donnee then
Min := Donnee;
end if;
end MAJ_Max_Min;
procedure Determiner_Max_Min is
new Pour_Chaque(MAJ_Max_Min);
package Mon_Alea is
new Alea (1, Borne);
use Mon_Alea;
SDA : T_TH;
Rand : Integer;
begin
-- Initialiser la TH.
Initialiser(SDA);
Min := Taille;
Max := 0;
for i in 1..Taille loop
Get_Random_Number(Rand);
begin
Enregistrer(SDA, Rand, La_Donnee(SDA, Rand)+1);
exception
when Cle_Absente_Exception =>
Enregistrer(SDA, Rand, 1);
end;
end loop;
Determiner_Max_Min(SDA);
end Calculer_Statistiques;
Min, Max: Integer; -- fréquence minimale et maximale d'un échantillon
Borne: Integer; -- les nombres aléatoire sont tirés dans 1..Borne
Taille: integer; -- nombre de tirages aléatoires
begin
if Argument_Count /= 2 then
Afficher_Usage;
else
-- Récupérer les arguments de la ligne de commande
begin
Borne := Integer'Value (Argument (1));
Taille := Integer'Value (Argument (2));
if Borne < 2 or Taille < 2 then
raise CONSTRAINT_ERROR;
end if;
exception
when CONSTRAINT_ERROR =>
Put_Line("Erreur d'entrée, vous devez entrer des nombres positifs >= 2.");
Afficher_Usage;
return;
end;
-- Afficher les valeur de Borne et Taille
Afficher_Variable ("Borne ", Borne);
Afficher_Variable ("Taille", Taille);
Calculer_Statistiques (Borne, Taille, Min, Max);
-- Afficher les fréquence Min et Max
Afficher_Variable ("Min", Min);
Afficher_Variable ("Max", Max);
end if;
end Evaluer_Alea_TH;
| 28.877419 | 98 | 0.690125 |
5ed6f8dfc24b3be80ccfc954f94ec7499dddf741 | 797 | ads | Ada | build_gnu/binutils/gdb/testsuite/gdb.ada/variant_record_packed_array/pck.ads | jed-frey/e200-gcc | df1421b421a8ec8729d70791129f5283dee5f9ea | [
"BSD-3-Clause"
] | 1 | 2017-05-31T21:42:12.000Z | 2017-05-31T21:42:12.000Z | build_gnu/binutils/gdb/testsuite/gdb.ada/variant_record_packed_array/pck.ads | jed-frey/e200-gcc | df1421b421a8ec8729d70791129f5283dee5f9ea | [
"BSD-3-Clause"
] | null | null | null | build_gnu/binutils/gdb/testsuite/gdb.ada/variant_record_packed_array/pck.ads | jed-frey/e200-gcc | df1421b421a8ec8729d70791129f5283dee5f9ea | [
"BSD-3-Clause"
] | 1 | 2019-12-17T22:04:07.000Z | 2019-12-17T22:04:07.000Z | -- Copyright 2009-2014 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;
| 41.947368 | 73 | 0.739021 |
2f33cd23fd1c0d564f5e5a0e33572ce22ddc48d5 | 13,318 | ads | Ada | .emacs.d/elpa/wisi-3.1.3/wisitoken-parse-lr-mckenzie_recover.ads | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/wisi-3.1.3/wisitoken-parse-lr-mckenzie_recover.ads | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/wisi-3.1.3/wisitoken-parse-lr-mckenzie_recover.ads | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | -- Abstract :
--
-- Implement [McKenzie] error recovery, extended to parallel parsers.
--
-- References:
--
-- [McKenzie] McKenzie, Bruce J., Yeatman, Corey, and De Vere,
-- Lorraine. Error repair in shift reduce parsers. ACM Trans. Prog.
-- Lang. Syst., 17(4):672-689, July 1995. Described in [Grune 2008] ref 321.
--
-- [Grune 2008] Parsing Techniques, A Practical Guide, Second
-- Edition. Dick Grune, Ceriel J.H. Jacobs.
--
-- Copyright (C) 2017 - 2020 Free Software Foundation, Inc.
--
-- This library is free software; you can redistribute it and/or modify it
-- under terms of the GNU General Public License as published by the Free
-- Software Foundation; either version 3, or (at your option) any later
-- version. This library is distributed in the hope that it will be useful,
-- but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHAN-
-- TABILITY or FITNESS FOR A PARTICULAR PURPOSE.
--
-- As a special exception under Section 7 of GPL version 3, you are granted
-- additional permissions described in the GCC Runtime Library Exception,
-- version 3.1, as published by the Free Software Foundation.
pragma License (Modified_GPL);
with Ada.Task_Attributes;
with WisiToken.Parse.LR.Parser;
with WisiToken.Lexer;
package WisiToken.Parse.LR.McKenzie_Recover is
use all type Ada.Containers.Count_Type;
Bad_Config : exception;
-- Raised when a config is determined to violate some programming
-- convention; abandon it.
type Recover_Status is (Fail_Check_Delta, Fail_Enqueue_Limit, Fail_No_Configs_Left, Fail_Programmer_Error, Success);
function Recover (Shared_Parser : in out WisiToken.Parse.LR.Parser.Parser) return Recover_Status;
-- Attempt to modify Parser.Parsers state and Parser.Lookahead to
-- allow recovering from an error state.
Force_Full_Explore : Boolean := False;
-- Sometimes recover throws an exception in a race condition case
-- that is hard to reproduce. Setting this True ignores all Success,
-- so all configs are checked.
Force_High_Cost_Solutions : Boolean := False;
-- Similarly, setting this true keeps all solutions that are found,
-- and forces at least three.
private
----------
-- Visible for language-specific child packages. Alphabetical.
procedure Check (ID : Token_ID; Expected_ID : in Token_ID)
with Inline => True;
-- Check that ID = Expected_ID; raise Assertion_Error if not.
-- Implemented using 'pragma Assert'.
function Current_Token
(Terminals : in Base_Token_Arrays.Vector;
Terminals_Current : in out Base_Token_Index;
Restore_Terminals_Current : out WisiToken.Base_Token_Index;
Insert_Delete : aliased in out Config_Op_Arrays.Vector;
Current_Insert_Delete : in out SAL.Base_Peek_Type)
return Base_Token;
-- Return the current token, from either Terminals or Insert_Delete;
-- set up for Next_Token.
--
-- See Next_Token for more info.
function Current_Token_ID_Peek
(Terminals : in Base_Token_Arrays.Vector;
Terminals_Current : in Base_Token_Index;
Insert_Delete : aliased in Config_Op_Arrays.Vector;
Current_Insert_Delete : in SAL.Base_Peek_Type)
return Token_ID;
-- Return the current token from either Terminals or
-- Insert_Delete, without setting up for Next_Token.
procedure Current_Token_ID_Peek_3
(Terminals : in Base_Token_Arrays.Vector;
Terminals_Current : in Base_Token_Index;
Insert_Delete : aliased in Config_Op_Arrays.Vector;
Current_Insert_Delete : in SAL.Base_Peek_Type;
Tokens : out Token_ID_Array_1_3);
-- Return the current token (in Tokens (1)) from either Terminals or
-- Insert_Delete, without setting up for Next_Token. Return the two
-- following tokens in Tokens (2 .. 3).
procedure Delete_Check
(Terminals : in Base_Token_Arrays.Vector;
Config : in out Configuration;
ID : in Token_ID);
-- Check that Terminals (Config.Current_Shared_Token) = ID. Append a
-- Delete op to Config.Ops, and insert it in Config.Insert_Delete in
-- token_index order.
--
-- This or the next routine must be used instead of Config.Ops.Append
-- (Delete...) unless the code also takes care of changing
-- Config.Current_Shared_Token. Note that this routine does _not_
-- increment Config.Current_Shared_Token, so it can only be used to
-- delete one token.
procedure Delete_Check
(Terminals : in Base_Token_Arrays.Vector;
Config : in out Configuration;
Index : in out WisiToken.Token_Index;
ID : in Token_ID);
-- Check that Terminals (Index) = ID. Append a Delete op to
-- Config.Ops, and insert it in Config.Insert_Delete in token_index
-- order. Increments Index, for convenience when deleting several
-- tokens.
procedure Delete
(Terminals : in Base_Token_Arrays.Vector;
Config : in out Configuration;
Index : in out WisiToken.Token_Index);
-- Same as Delete_Check, without the check.
function Find_ID
(Config : in Configuration;
ID : in Token_ID)
return Boolean;
-- Search Config.Stack for a token with ID, starting at
-- stack top. Return True if found, False if not.
procedure Find_ID
(Config : in Configuration;
ID : in Token_ID;
Matching_Index : in out SAL.Peek_Type);
-- Search Config.Stack for a token with ID, starting at
-- Matching_Index. If found, Matching_Index points to it.
-- If not found, Matching_Index = Config.Stack.Depth.
procedure Find_ID
(Config : in Configuration;
IDs : in Token_ID_Set;
Matching_Index : in out SAL.Peek_Type);
-- Search Config.Stack for a token with ID in IDs, starting at
-- Matching_Index. If found, Matching_Index points to it.
-- If not found, Matching_Index = Config.Stack.Depth.
procedure Find_Descendant_ID
(Tree : in Syntax_Trees.Tree;
Config : in Configuration;
ID : in Token_ID;
ID_Set : in Token_ID_Set;
Matching_Index : in out SAL.Peek_Type);
-- Search Config.Stack for a token with id in ID_Set, with a
-- descendant with id = ID, starting at Matching_Index. If found,
-- Matching_Index points to it. If not found, Matching_Index =
-- Config.Stack.Depth.
procedure Find_Matching_Name
(Config : in Configuration;
Lexer : access constant WisiToken.Lexer.Instance'Class;
Name : in String;
Matching_Name_Index : in out SAL.Peek_Type;
Case_Insensitive : in Boolean);
-- Search Config.Stack for a token matching Name, starting at
-- Matching_Name_Index. If found, Matching_Name_Index points to it.
-- If not found, Matching_Name_Index = Config.Stack.Depth.
procedure Find_Matching_Name
(Config : in Configuration;
Lexer : access constant WisiToken.Lexer.Instance'Class;
Name : in String;
Matching_Name_Index : in out SAL.Peek_Type;
Other_ID : in Token_ID;
Other_Count : out Integer;
Case_Insensitive : in Boolean);
-- Search Config.Stack for a token matching Name, starting at
-- Matching_Name_Index. If found, Matching_Name_Index points to it.
-- If not found, Matching_Name_Index = Config.Stack.Depth.
--
-- Also count tokens with ID = Other_ID.
procedure Insert (Config : in out Configuration; ID : in Token_ID);
-- Append an Insert op at Config.Current_Shared_Token, to Config.Ops,
-- and insert it in Config.Insert_Deleted in token_index order.
procedure Insert (Config : in out Configuration; IDs : in Token_ID_Array);
-- Call Insert for each item in IDs.
procedure Insert (Config : in out Configuration; Index : in WisiToken.Token_Index; ID : in Token_ID);
-- Same as Insert, but at Index, not Config.Current_Shared_Token.
function Next_Token
(Terminals : in Base_Token_Arrays.Vector;
Terminals_Current : in out Base_Token_Index;
Restore_Terminals_Current : in out Base_Token_Index;
Insert_Delete : aliased in out Config_Op_Arrays.Vector;
Current_Insert_Delete : in out SAL.Base_Peek_Type)
return Base_Token;
-- Return the next token, from either Terminals or Insert_Delete;
-- update Terminals_Current or Current_Insert_Delete.
--
-- If result is Insert_Delete.Last_Index, Current_Insert_Delete =
-- Last_Index; Insert_Delete is cleared and Current_Insert_Delete
-- reset on next call.
--
-- When done parsing, caller must reset actual Terminals_Current to
-- Restore_Terminals_Current.
--
-- Insert_Delete contains only Insert and Delete ops, in token_index
-- order. Those ops are applied when Terminals_Current =
-- op.token_index.
function Push_Back_Valid
(Target_Token_Index : in WisiToken.Base_Token_Index;
Ops : in Config_Op_Arrays.Vector;
Prev_Op : in Positive_Index_Type)
return Boolean;
function Push_Back_Valid (Config : in Configuration) return Boolean
is (Config.Stack.Depth > 1 and then
(not Config.Stack.Peek.Token.Virtual and
-- If Virtual, this is from earlier in this recover session; no point
-- in trying to redo it.
(Config_Op_Arrays.Length (Config.Ops) = 0 or else
Push_Back_Valid
(Config.Stack.Peek.Token.Min_Terminal_Index,
Config.Ops,
Config_Op_Arrays.Last_Index (Config.Ops)))));
procedure Push_Back (Config : in out Configuration)
with Pre => Push_Back_Valid (Config);
-- Pop the top Config.Stack item, set Config.Current_Shared_Token to
-- the first terminal in that item. If the item is empty,
-- Config.Current_Shared_Token is unchanged.
procedure Push_Back_Check (Config : in out Configuration; Expected_ID : in Token_ID)
with Pre => Push_Back_Valid (Config);
-- In effect, call Check and Push_Back.
procedure Push_Back_Check (Config : in out Configuration; Expected : in Token_ID_Array);
-- Call Push_Back_Check for each item in Expected.
--
-- Raises Bad_Config if any of the push_backs is invalid.
procedure Put
(Message : in String;
Trace : in out WisiToken.Trace'Class;
Parser_Label : in Natural;
Terminals : in Base_Token_Arrays.Vector;
Config : in Configuration;
Task_ID : in Boolean := True;
Strategy : in Boolean := False);
-- Put Message and an image of Config to Trace.
procedure Put_Line
(Trace : in out WisiToken.Trace'Class;
Parser_Label : in Natural;
Message : in String;
Task_ID : in Boolean := True);
-- Put message to Trace, with parser and task info.
function Undo_Reduce_Valid
(Stack : in Recover_Stacks.Stack;
Tree : in Syntax_Trees.Tree)
return Boolean
-- Check if Undo_Reduce is valid when there is no previous Config_Op.
--
-- Undo_Reduce needs to know what tokens the nonterm contains, to
-- push them on the stack. Thus we need a valid Tree index. It is
-- tempting to also allow an empty nonterm when Tree_Index is
-- invalid, but that fails when the real Undo_Reduce results in
-- another empty nonterm on the stack; see test_mckenzie_recover.adb
-- Error_During_Resume_3.
is (Stack.Depth > 1 and then
Stack.Peek.Tree_Index /= Invalid_Node_Index and then
Tree.Is_Nonterm (Stack.Peek.Tree_Index));
function Undo_Reduce_Valid
(Stack : in Recover_Stacks.Stack;
Tree : in Syntax_Trees.Tree;
Ops : in Config_Op_Arrays.Vector;
Prev_Op : in Positive_Index_Type)
return Boolean
is (Undo_Reduce_Valid (Stack, Tree) and then Push_Back_Valid (Stack.Peek.Token.Min_Terminal_Index, Ops, Prev_Op));
function Undo_Reduce
(Stack : in out Recover_Stacks.Stack;
Tree : in Syntax_Trees.Tree)
return Ada.Containers.Count_Type
with Pre => Undo_Reduce_Valid (Stack, Tree);
-- Undo the reduction that produced the top stack item, return the
-- token count for that reduction.
procedure Undo_Reduce_Check
(Config : in out Configuration;
Tree : in Syntax_Trees.Tree;
Expected : in Token_ID)
with Inline => True;
-- Call Check, Undo_Reduce.
procedure Undo_Reduce_Check
(Config : in out Configuration;
Tree : in Syntax_Trees.Tree;
Expected : in Token_ID_Array);
-- Call Undo_Reduce_Check for each item in Expected.
package Task_Attributes is new Ada.Task_Attributes (Integer, 0);
end WisiToken.Parse.LR.McKenzie_Recover;
| 42.823151 | 119 | 0.66106 |
13869e9cd56eaef250aecd324f50d89d66fad8aa | 5,162 | ads | Ada | source/amf/uml/amf-umldi-uml_name_labels-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/amf/uml/amf-umldi-uml_name_labels-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/amf/uml/amf-umldi-uml_name_labels-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2011-2012, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
-- This file is generated, don't edit it.
------------------------------------------------------------------------------
with AMF.Generic_Collections;
package AMF.UMLDI.UML_Name_Labels.Collections is
pragma Preelaborate;
package UMLDI_UML_Name_Label_Collections is
new AMF.Generic_Collections
(UMLDI_UML_Name_Label,
UMLDI_UML_Name_Label_Access);
type Set_Of_UMLDI_UML_Name_Label is
new UMLDI_UML_Name_Label_Collections.Set with null record;
Empty_Set_Of_UMLDI_UML_Name_Label : constant Set_Of_UMLDI_UML_Name_Label;
type Ordered_Set_Of_UMLDI_UML_Name_Label is
new UMLDI_UML_Name_Label_Collections.Ordered_Set with null record;
Empty_Ordered_Set_Of_UMLDI_UML_Name_Label : constant Ordered_Set_Of_UMLDI_UML_Name_Label;
type Bag_Of_UMLDI_UML_Name_Label is
new UMLDI_UML_Name_Label_Collections.Bag with null record;
Empty_Bag_Of_UMLDI_UML_Name_Label : constant Bag_Of_UMLDI_UML_Name_Label;
type Sequence_Of_UMLDI_UML_Name_Label is
new UMLDI_UML_Name_Label_Collections.Sequence with null record;
Empty_Sequence_Of_UMLDI_UML_Name_Label : constant Sequence_Of_UMLDI_UML_Name_Label;
private
Empty_Set_Of_UMLDI_UML_Name_Label : constant Set_Of_UMLDI_UML_Name_Label
:= (UMLDI_UML_Name_Label_Collections.Set with null record);
Empty_Ordered_Set_Of_UMLDI_UML_Name_Label : constant Ordered_Set_Of_UMLDI_UML_Name_Label
:= (UMLDI_UML_Name_Label_Collections.Ordered_Set with null record);
Empty_Bag_Of_UMLDI_UML_Name_Label : constant Bag_Of_UMLDI_UML_Name_Label
:= (UMLDI_UML_Name_Label_Collections.Bag with null record);
Empty_Sequence_Of_UMLDI_UML_Name_Label : constant Sequence_Of_UMLDI_UML_Name_Label
:= (UMLDI_UML_Name_Label_Collections.Sequence with null record);
end AMF.UMLDI.UML_Name_Labels.Collections;
| 56.108696 | 92 | 0.531383 |
03c93a7c56659068edf16dacb7a18b5af920a233 | 4,008 | ads | Ada | source/web/tools/a2js/properties-declarations-private_type.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/web/tools/a2js/properties-declarations-private_type.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/web/tools/a2js/properties-declarations-private_type.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Web Framework --
-- --
-- Tools Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2015-2018, Vadim Godunko <[email protected]> --
-- All rights reserved. --
-- --
-- Redistribution and use in source and binary forms, with or without --
-- modification, are permitted provided that the following conditions --
-- are met: --
-- --
-- * Redistributions of source code must retain the above copyright --
-- notice, this list of conditions and the following disclaimer. --
-- --
-- * Redistributions in binary form must reproduce the above copyright --
-- notice, this list of conditions and the following disclaimer in the --
-- documentation and/or other materials provided with the distribution. --
-- --
-- * Neither the name of the Vadim Godunko, IE nor the names of its --
-- contributors may be used to endorse or promote products derived from --
-- this software without specific prior written permission. --
-- --
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS --
-- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT --
-- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR --
-- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT --
-- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, --
-- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED --
-- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR --
-- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF --
-- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING --
-- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS --
-- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. --
-- --
------------------------------------------------------------------------------
-- $Revision$ $Date$
------------------------------------------------------------------------------
with Asis;
with Engines.Contexts;
with League.Strings;
package Properties.Declarations.Private_Type is
function Initialize
(Engine : access Engines.Contexts.Context;
Element : Asis.Declaration;
Name : Engines.Text_Property) return League.Strings.Universal_String;
function Is_Simple_Type
(Engine : access Engines.Contexts.Context;
Element : Asis.Declaration;
Name : Engines.Boolean_Property) return Boolean;
function Alignment
(Engine : access Engines.Contexts.Context;
Element : Asis.Declaration;
Name : Engines.Integer_Property) return Integer;
end Properties.Declarations.Private_Type;
| 58.941176 | 78 | 0.441617 |
04b6f6b446be62d5e5d14ff935f126add61ff7b5 | 54,839 | adb | Ada | .emacs.d/elpa/wisi-3.1.3/wisitoken-parse-lr-parser.adb | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/wisi-3.1.3/wisitoken-parse-lr-parser.adb | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/wisi-3.1.3/wisitoken-parse-lr-parser.adb | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | -- Abstract :
--
-- See spec.
--
-- Copyright (C) 2002 - 2005, 2008 - 2015, 2017 - 2020 Free Software Foundation, Inc.
--
-- This file is part of the WisiToken package.
--
-- The WisiToken package is free software; you can redistribute it
-- and/or modify it under the terms of the GNU General Public License
-- as published by the Free Software Foundation; either version 3, or
-- (at your option) any later version. The WisiToken package is
-- distributed in the hope that it will be useful, but WITHOUT ANY
-- WARRANTY; without even the implied warranty of MERCHANTABILITY or
-- FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
-- License for more details. You should have received a copy of the
-- GNU General Public License distributed with the WisiToken package;
-- see file GPL.txt. If not, write to the Free Software Foundation,
-- 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
--
-- As a special exception, if other files instantiate generics from
-- this unit, or you link this unit with other files to produce an
-- executable, this unit does not by itself cause the resulting
-- executable to be covered by the GNU General Public License. This
-- exception does not however invalidate any other reasons why the
-- executable file might be covered by the GNU Public License.
pragma License (Modified_GPL);
with Ada.Calendar.Formatting;
with Ada.Exceptions;
with GNAT.Traceback.Symbolic;
with WisiToken.Parse.LR.McKenzie_Recover;
package body WisiToken.Parse.LR.Parser is
function Reduce_Stack_1
(Current_Parser : in Parser_Lists.Cursor;
Action : in Reduce_Action_Rec;
Nonterm : out WisiToken.Valid_Node_Index;
Lexer : in WisiToken.Lexer.Handle;
Trace : in out WisiToken.Trace'Class)
return WisiToken.Semantic_Checks.Check_Status_Label
is
-- We treat semantic check errors as parse errors here, to allow
-- error recovery to take better advantage of them. One recovery
-- strategy is to fix things so the semantic check passes.
use all type Semantic_Checks.Check_Status_Label;
use all type Semantic_Checks.Semantic_Check;
Parser_State : Parser_Lists.Parser_State renames Current_Parser.State_Ref.Element.all;
Children_Tree : Valid_Node_Index_Array (1 .. SAL.Base_Peek_Type (Action.Token_Count));
begin
for I in reverse Children_Tree'Range loop
Children_Tree (I) := Parser_State.Stack.Pop.Token;
end loop;
Nonterm := Parser_State.Tree.Add_Nonterm
(Action.Production, Children_Tree, Action.Action,
Default_Virtual => Parser_State.Tree.Is_Virtual (Parser_State.Current_Token));
-- Computes Nonterm.Byte_Region, Virtual
if Trace_Parse > Detail then
Trace.Put_Line (Parser_State.Tree.Image (Nonterm, Trace.Descriptor.all, Include_Children => True));
end if;
if Action.Check = null then
return Ok;
else
declare
Nonterm_Token : Recover_Token := Parser_State.Tree.Recover_Token (Nonterm);
Children_Token : constant Recover_Token_Array := Parser_State.Tree.Recover_Token_Array (Children_Tree);
Status : Semantic_Checks.Check_Status;
begin
Status := Action.Check (Lexer, Nonterm_Token, Children_Token, Recover_Active => False);
if Nonterm_Token.Name /= Null_Buffer_Region then
Parser_State.Tree.Set_Name_Region (Nonterm, Nonterm_Token.Name);
end if;
if Trace_Parse > Detail then
Trace.Put_Line ("semantic check " & Semantic_Checks.Image (Status, Trace.Descriptor.all));
end if;
case Status.Label is
when Ok =>
return Ok;
when Semantic_Checks.Error =>
if Parser_State.Resume_Active then
-- Ignore this error; that's how McKenzie_Recover decided to fix it
return Ok;
else
Parser_State.Errors.Append
((Label => Check,
First_Terminal => Trace.Descriptor.First_Terminal,
Last_Terminal => Trace.Descriptor.Last_Terminal,
Check_Status => Status,
Recover => (others => <>)));
return Status.Label;
end if;
end case;
exception
when Partial_Parse =>
-- From Action.Check
Parser_State.Tree.Set_Root (Nonterm);
raise;
end;
end if;
end Reduce_Stack_1;
procedure Do_Action
(Action : in Parse_Action_Rec;
Current_Parser : in Parser_Lists.Cursor;
Shared_Parser : in LR.Parser.Parser)
is
use all type Semantic_Checks.Check_Status_Label;
Parser_State : Parser_Lists.Parser_State renames Current_Parser.State_Ref;
Trace : WisiToken.Trace'Class renames Shared_Parser.Trace.all;
Nonterm : WisiToken.Valid_Node_Index;
Status : Semantic_Checks.Check_Status_Label;
begin
if Trace_Parse > Detail then
Trace.Put
(Integer'Image (Current_Parser.Label) & ": " &
Trimmed_Image (Parser_State.Stack.Peek.State) & ": " &
Parser_State.Tree.Image (Parser_State.Current_Token, Trace.Descriptor.all) & " : ");
Put (Trace, Action);
Trace.New_Line;
end if;
case Action.Verb is
when Shift =>
Current_Parser.Set_Verb (Shift);
Parser_State.Stack.Push ((Action.State, Parser_State.Current_Token));
Parser_State.Tree.Set_State (Parser_State.Current_Token, Action.State);
when Reduce =>
declare
New_State : constant Unknown_State_Index := Goto_For
(Table => Shared_Parser.Table.all,
State => Parser_State.Stack (SAL.Base_Peek_Type (Action.Token_Count) + 1).State,
ID => Action.Production.LHS);
begin
if New_State = Unknown_State then
-- This is due to a bug in the LALR parser generator (see
-- lalr_generator_bug_01.wy); we treat it as a syntax error.
Current_Parser.Set_Verb (Error);
if Trace_Parse > Detail then
Trace.Put_Line (" ... error");
end if;
else
Status := Reduce_Stack_1 (Current_Parser, Action, Nonterm, Shared_Parser.Lexer, Trace);
-- Even when Reduce_Stack_1 returns Error, it did reduce the stack, so
-- push Nonterm.
Parser_State.Stack.Push ((New_State, Nonterm));
Parser_State.Tree.Set_State (Nonterm, New_State);
case Status is
when Ok =>
Current_Parser.Set_Verb (Reduce);
if Trace_Parse > Detail then
Trace.Put_Line (" ... goto state " & Trimmed_Image (New_State));
end if;
when Semantic_Checks.Error =>
Current_Parser.Set_Verb (Error);
Parser_State.Zombie_Token_Count := 1;
end case;
end if;
end;
when Accept_It =>
case Reduce_Stack_1
(Current_Parser,
(Reduce, Action.Production, Action.Action, Action.Check, Action.Token_Count),
Nonterm, Shared_Parser.Lexer, Trace)
is
when Ok =>
Current_Parser.Set_Verb (Action.Verb);
Parser_State.Tree.Set_Root (Nonterm);
when Semantic_Checks.Error =>
Current_Parser.Set_Verb (Error);
Parser_State.Zombie_Token_Count := 1;
end case;
when Error =>
Current_Parser.Set_Verb (Action.Verb);
Parser_State.Zombie_Token_Count := 1;
declare
Expecting : constant Token_ID_Set := LR.Expecting
(Shared_Parser.Table.all, Parser_State.Stack.Peek.State);
begin
Parser_State.Errors.Append
((Label => LR.Action,
First_Terminal => Trace.Descriptor.First_Terminal,
Last_Terminal => Trace.Descriptor.Last_Terminal,
Error_Token => Parser_State.Current_Token,
Expecting => Expecting,
Recover => (others => <>)));
if Trace_Parse > Outline then
Put
(Trace,
Integer'Image (Current_Parser.Label) & ":" &
Unknown_State_Index'Image (Parser_State.Stack.Peek.State) & ": expecting: " &
Image (Expecting, Trace.Descriptor.all));
Trace.New_Line;
end if;
end;
end case;
end Do_Action;
procedure Do_Deletes
(Shared_Parser : in out LR.Parser.Parser;
Parser_State : in out Parser_Lists.Parser_State)
is
use Recover_Op_Arrays, Recover_Op_Array_Refs;
Ins_Del : Vector renames Parser_State.Recover_Insert_Delete;
Ins_Del_Cur : Extended_Index renames Parser_State.Recover_Insert_Delete_Current;
begin
if Trace_Parse > Extra then
Shared_Parser.Trace.Put_Line
(Integer'Image (Parser_State.Label) & ": shared_token:" &
WisiToken.Token_Index'Image (Parser_State.Shared_Token) &
" inc_shared_token: " & Boolean'Image (Parser_State.Inc_Shared_Token) &
" recover_insert_delete:" &
(if Parser_State.Recover_Insert_Delete_Current = No_Index
then ""
else Parser_State.Recover_Insert_Delete_Current'Image & " " &
Image
(Constant_Ref (Parser_State.Recover_Insert_Delete, Parser_State.Recover_Insert_Delete_Current),
Shared_Parser.Trace.Descriptor.all)));
end if;
loop
exit when Ins_Del_Cur = Recover_Op_Arrays.No_Index;
declare
Op : Recover_Op renames Constant_Ref (Ins_Del, Ins_Del_Cur);
begin
if Op.Op = Delete and then
Op.Del_Token_Index =
(if Parser_State.Inc_Shared_Token
then Parser_State.Shared_Token + 1
else Parser_State.Shared_Token)
then
Parser_State.Shared_Token := Parser_State.Shared_Token + 1;
-- We don't reset Inc_Shared_Token here; only after the next token is
-- actually used.
Ins_Del_Cur := Ins_Del_Cur + 1;
if Ins_Del_Cur > Last_Index (Ins_Del) then
Ins_Del_Cur := No_Index;
end if;
else
exit;
end if;
end;
end loop;
end Do_Deletes;
-- Verb: the type of parser cycle to execute;
--
-- Accept : all Parsers.Verb return Accept - done parsing.
--
-- Shift : some Parsers.Verb return Shift, all with the same current
-- token in Shared_Parser.Terminals.
--
-- Pause : Resume is active, and this parser has reached Resume_Goal,
-- so it is waiting for the others to catch up.
--
-- Reduce : some Parsers.Verb return Reduce.
--
-- Error : all Parsers.Verb return Error.
--
-- Zombie_Count: count of parsers in Error state
procedure Parse_Verb
(Shared_Parser : in out LR.Parser.Parser;
Verb : out All_Parse_Action_Verbs;
Zombie_Count : out SAL.Base_Peek_Type)
is
Shift_Count : SAL.Base_Peek_Type := 0;
Accept_Count : SAL.Base_Peek_Type := 0;
Error_Count : SAL.Base_Peek_Type := 0;
Resume_Active : Boolean := False;
begin
Zombie_Count := 0;
for Parser_State of Shared_Parser.Parsers loop
case Parser_State.Verb is
when Pause | Shift =>
Do_Deletes (Shared_Parser, Parser_State);
Shift_Count := Shift_Count + 1;
Parser_State.Set_Verb (Shift);
if Parser_State.Resume_Active then
-- There may still be ops left in Recover_Insert_Delete after we get
-- to Resume_Token_Goal, probably from a Language_Fix or string quote
-- fix that deletes a lot of tokens.
if Parser_State.Resume_Token_Goal <= Parser_State.Shared_Token and
Parser_State.Recover_Insert_Delete_Current = Recover_Op_Arrays.No_Index
then
Parser_State.Resume_Active := False;
if Trace_Parse > Detail then
Shared_Parser.Trace.Put_Line (Integer'Image (Parser_State.Label) & ": resume_active: False");
end if;
else
Resume_Active := True;
end if;
end if;
when Reduce =>
Verb := Reduce;
return;
when Accept_It =>
Accept_Count := Accept_Count + 1;
when Error =>
if Shared_Parser.Enable_McKenzie_Recover then
-- This parser is waiting for others to error; they can continue
-- parsing.
Zombie_Count := Zombie_Count + 1;
else
Error_Count := Error_Count + 1;
end if;
end case;
end loop;
if Accept_Count > 0 and Shared_Parser.Parsers.Count = Accept_Count + Zombie_Count then
Verb := Accept_It;
elsif Shared_Parser.Parsers.Count = Error_Count + Zombie_Count then
Verb := Error;
elsif Shift_Count > 0 then
Verb := Shift;
else
raise SAL.Programmer_Error;
end if;
if Resume_Active then
for Parser_State of Shared_Parser.Parsers loop
if Parser_State.Verb = Shift and not Parser_State.Resume_Active then
Parser_State.Set_Verb (Pause);
end if;
end loop;
end if;
end Parse_Verb;
----------
-- Public subprograms, declaration order
overriding procedure Finalize (Object : in out LR.Parser.Parser)
is begin
Free_Table (Object.Table);
end Finalize;
procedure New_Parser
(Parser : out LR.Parser.Parser;
Trace : not null access WisiToken.Trace'Class;
Lexer : in WisiToken.Lexer.Handle;
Table : in Parse_Table_Ptr;
Language_Fixes : in Language_Fixes_Access;
Language_Matching_Begin_Tokens : in Language_Matching_Begin_Tokens_Access;
Language_String_ID_Set : in Language_String_ID_Set_Access;
User_Data : in WisiToken.Syntax_Trees.User_Data_Access;
Max_Parallel : in SAL.Base_Peek_Type := Default_Max_Parallel;
Terminate_Same_State : in Boolean := True)
is
use all type Syntax_Trees.User_Data_Access;
begin
Parser.Lexer := Lexer;
Parser.Trace := Trace;
Parser.User_Data := User_Data;
-- Terminals, Line_Begin_Token are initialized to empty arrays.
Parser.Table := Table;
Parser.Language_Fixes := Language_Fixes;
Parser.Language_Matching_Begin_Tokens := Language_Matching_Begin_Tokens;
Parser.Language_String_ID_Set := Language_String_ID_Set;
Parser.Enable_McKenzie_Recover := not McKenzie_Defaulted (Table.all);
Parser.Max_Parallel := Max_Parallel;
Parser.Terminate_Same_State := Terminate_Same_State;
if User_Data /= null then
User_Data.Set_Lexer_Terminals (Lexer, Parser.Terminals'Unchecked_Access);
end if;
end New_Parser;
overriding procedure Parse (Shared_Parser : aliased in out LR.Parser.Parser)
is
use all type Ada.Strings.Unbounded.Unbounded_String;
use all type Syntax_Trees.User_Data_Access;
use all type Ada.Containers.Count_Type;
Trace : WisiToken.Trace'Class renames Shared_Parser.Trace.all;
Current_Verb : All_Parse_Action_Verbs;
Action : Parse_Action_Node_Ptr;
Zombie_Count : SAL.Base_Peek_Type;
procedure Check_Error (Check_Parser : in out Parser_Lists.Cursor)
is
procedure Report_Error
is begin
Shared_Parser.Parsers.First_State_Ref.Errors.Append
((Label => LR.Message,
First_Terminal => Trace.Descriptor.First_Terminal,
Last_Terminal => Trace.Descriptor.Last_Terminal,
Recover => <>,
Msg => +"error during resume"));
if Debug_Mode then
raise SAL.Programmer_Error with Check_Parser.Label'Image & ": error during resume";
else
raise Syntax_Error;
end if;
end Report_Error;
begin
if Check_Parser.Verb = Error then
-- This parser errored on last input. This is how grammar conflicts
-- are resolved when the input text is valid, in which case we should
-- just terminate this parser. However, this may be due to invalid
-- input text, so we keep the parser alive but suspended for a few
-- tokens, to see if the other parsers also error, in which case they
-- all participate in error recovery.
-- We do not create zombie parsers during resume.
if not Check_Parser.State_Ref.Resume_Active then
-- Parser is now a zombie
if Trace_Parse > Detail then
Trace.Put_Line (Integer'Image (Check_Parser.Label) & ": zombie");
end if;
Check_Parser.Next;
else
if Shared_Parser.Parsers.Count = 1 then
Report_Error;
else
-- This is ok if a conflict occured during resume - we assume this is
-- a branch that failed during recover as well. Otherwise it's a
-- programmer error.
if Check_Parser.State_Ref.Conflict_During_Resume then
Shared_Parser.Parsers.Terminate_Parser
(Check_Parser, "error in conflict during resume", Shared_Parser.Trace.all,
Shared_Parser.Terminals);
else
Report_Error;
end if;
end if;
end if;
else
Check_Parser.Next;
end if;
end Check_Error;
begin
if Debug_Mode then
Trace.Put_Clock ("start");
end if;
if Shared_Parser.User_Data /= null then
Shared_Parser.User_Data.Reset;
end if;
Shared_Parser.String_Quote_Checked := Invalid_Line_Number;
Shared_Parser.Shared_Tree.Clear;
Shared_Parser.Parsers := Parser_Lists.New_List
(Shared_Tree => Shared_Parser.Shared_Tree'Unchecked_Access);
Shared_Parser.Lex_All;
Shared_Parser.Parsers.First.State_Ref.Stack.Push ((Shared_Parser.Table.State_First, others => <>));
Main_Loop :
loop
-- exit on Accept_It action or syntax error.
Parse_Verb (Shared_Parser, Current_Verb, Zombie_Count);
if Trace_Parse > Extra then
Trace.Put_Line ("cycle start; current_verb: " & Parse_Action_Verbs'Image (Current_Verb));
end if;
case Current_Verb is
when Pause =>
null;
when Shift =>
-- We just shifted a token; get the next token from
-- Shared_Parser.Terminals.
for Parser_State of Shared_Parser.Parsers loop
if Parser_State.Verb = Error then
if Shared_Parser.Enable_McKenzie_Recover then
Parser_State.Zombie_Token_Count := Parser_State.Zombie_Token_Count + 1;
if Trace_Parse > Extra then
Trace.Put_Line
(Integer'Image (Parser_State.Label) & ": zombie (" &
WisiToken.Token_Index'Image
(Shared_Parser.Table.McKenzie_Param.Check_Limit - Parser_State.Zombie_Token_Count) &
" tokens remaining)");
end if;
end if;
elsif Parser_State.Verb = Shift then
declare
function Insert_Virtual return Boolean
is
use Recover_Op_Arrays, Recover_Op_Array_Refs;
Ins_Del : Vector renames Parser_State.Recover_Insert_Delete;
Ins_Del_Cur : Extended_Index renames Parser_State.Recover_Insert_Delete_Current;
Result : Boolean := False;
begin
if Ins_Del_Cur /= No_Index then
declare
Op : Recover_Op renames Variable_Ref (Ins_Del, Ins_Del_Cur);
begin
if Op.Op = Insert and then
Op.Ins_Token_Index =
(if Parser_State.Inc_Shared_Token
then Parser_State.Shared_Token + 1
else Parser_State.Shared_Token)
then
Result := True;
Parser_State.Current_Token := Parser_State.Tree.Add_Terminal
(Op.Ins_ID, Before => Op.Ins_Token_Index);
Op.Ins_Tree_Node := Parser_State.Current_Token;
Ins_Del_Cur := Ins_Del_Cur + 1;
if Ins_Del_Cur > Last_Index (Ins_Del) then
Ins_Del_Cur := No_Index;
end if;
end if;
end;
end if;
return Result;
end Insert_Virtual;
begin
if Insert_Virtual then
null;
elsif (if Parser_State.Inc_Shared_Token
then Parser_State.Shared_Token + 1
else Parser_State.Shared_Token) <= Shared_Parser.Terminals.Last_Index
then
if Parser_State.Inc_Shared_Token then
-- Inc_Shared_Token is only set False by McKenzie_Recover; see there
-- for when/why. Don't increment past wisi_eoi (happens when input
-- buffer is empty; test_mckenzie_recover.adb Empty_Comments).
Parser_State.Shared_Token := Parser_State.Shared_Token + 1;
else
Parser_State.Inc_Shared_Token := True;
end if;
Parser_State.Current_Token := Shared_Parser.Terminals
(Parser_State.Shared_Token).Tree_Index;
end if;
end;
if Trace_Parse > Extra then
Trace.Put_Line
(Integer'Image (Parser_State.Label) & ": current_token" & Parser_State.Tree.Image
(Parser_State.Current_Token, Trace.Descriptor.all));
end if;
end if;
end loop;
when Accept_It =>
-- All parsers accepted or are zombies.
declare
Count : constant SAL.Base_Peek_Type := Shared_Parser.Parsers.Count;
Current_Parser : Parser_Lists.Cursor := Shared_Parser.Parsers.First;
begin
if Count = 1 then
-- Nothing more to do
exit Main_Loop;
elsif Zombie_Count + 1 = Count then
-- All but one are zombies
loop
if Current_Parser.Verb = Accept_It then
Current_Parser.Next;
else
declare
Temp : Parser_Lists.Cursor := Current_Parser;
begin
Current_Parser.Next;
Shared_Parser.Parsers.Terminate_Parser
(Temp, "zombie", Shared_Parser.Trace.all, Shared_Parser.Terminals);
end;
end if;
exit when Current_Parser.Is_Done;
end loop;
exit Main_Loop;
else
-- More than one parser is active.
declare
use all type Parser_Lists.Cursor;
Error_Parser_Count : Integer := (if Shared_Parser.Lexer.Errors.Length > 0 then 1 else 0);
Recover_Cost : Integer;
Min_Recover_Cost : Integer := Integer'Last;
Recover_Ops_Length : Ada.Containers.Count_Type;
Min_Recover_Ops_Length : Ada.Containers.Count_Type := Ada.Containers.Count_Type'Last;
Recover_Cur : Parser_Lists.Cursor := Current_Parser;
begin
Current_Parser := Shared_Parser.Parsers.First;
loop
if Current_Parser.Verb = Accept_It then
if Current_Parser.State_Ref.Errors.Length > 0 then
Error_Parser_Count := Error_Parser_Count + 1;
end if;
Current_Parser.Next;
else
declare
Temp : Parser_Lists.Cursor := Current_Parser;
begin
Current_Parser.Next;
Shared_Parser.Parsers.Terminate_Parser
(Temp, "zombie", Shared_Parser.Trace.all, Shared_Parser.Terminals);
end;
end if;
exit when Current_Parser.Is_Done;
end loop;
if Error_Parser_Count > 0 then
-- There was at least one error. We assume that caused the ambiguous
-- parse, and we pick the parser with the minimum cost and minimum
-- recover ops length (consistent with Duplicate_State) to allow the
-- parse to succeed. We terminate the other parsers so the remaining
-- parser can do Execute_Actions.
--
-- If there are multiple errors, this metric is not very meaningful.
--
-- Note all surviving parsers must have the same error count.
Current_Parser := Shared_Parser.Parsers.First;
loop
Recover_Cost := Current_Parser.Min_Recover_Cost;
if Recover_Cost < Min_Recover_Cost then
Min_Recover_Cost := Recover_Cost;
Min_Recover_Ops_Length := Current_Parser.Max_Recover_Ops_Length;
Recover_Cur := Current_Parser;
elsif Recover_Cost = Min_Recover_Cost then
Recover_Ops_Length := Current_Parser.Max_Recover_Ops_Length;
if Recover_Ops_Length < Min_Recover_Ops_Length then
Min_Recover_Ops_Length := Recover_Ops_Length;
Recover_Cur := Current_Parser;
end if;
end if;
Current_Parser.Next;
exit when Current_Parser.Is_Done;
end loop;
Current_Parser := Shared_Parser.Parsers.First;
loop
if Current_Parser = Recover_Cur then
Current_Parser.Next;
else
declare
Temp : Parser_Lists.Cursor := Current_Parser;
begin
Current_Parser.Next;
Shared_Parser.Parsers.Terminate_Parser
(Temp,
(if Recover_Cost = Min_Recover_Cost and then
Recover_Ops_Length = Min_Recover_Ops_Length
then "random"
else "recover cost/length"),
Shared_Parser.Trace.all, Shared_Parser.Terminals);
end;
end if;
exit when Current_Parser.Is_Done;
end loop;
exit Main_Loop;
else
-- There were no previous errors. We allow the parse to fail, on the
-- assumption that an otherwise correct input should not yield an
-- ambiguous parse.
declare
Token : Base_Token renames Shared_Parser.Terminals (Shared_Parser.Terminals.Last_Index);
begin
raise WisiToken.Parse_Error with Error_Message
(Shared_Parser.Lexer.File_Name, Token.Line, Token.Column,
"Ambiguous parse:" & SAL.Base_Peek_Type'Image (Count) & " parsers active.");
end;
end if;
end;
end if;
end;
when Reduce =>
null;
when Error =>
-- All parsers errored; attempt recovery
declare
use all type McKenzie_Recover.Recover_Status;
Recover_Result : McKenzie_Recover.Recover_Status := McKenzie_Recover.Recover_Status'First;
Pre_Recover_Parser_Count : constant SAL.Base_Peek_Type := Shared_Parser.Parsers.Count;
Start : Ada.Calendar.Time;
begin
-- Recover algorithms expect current token at
-- Parsers(*).Current_Token, will set
-- Parsers(*).Recover_Insert_Delete with new input tokens and
-- deletions, adjust Parsers(*).Stack, and set
-- Parsers(*).Current_Token and Parsers(*).Verb.
if Shared_Parser.Enable_McKenzie_Recover then
if Debug_Mode then
Trace.Put_Clock ("pre-recover" & Shared_Parser.Parsers.Count'Img & " active");
Start := Ada.Calendar.Clock;
end if;
Recover_Result := McKenzie_Recover.Recover (Shared_Parser);
if Debug_Mode then
declare
use Ada.Calendar;
Recover_Duration : constant Duration := Clock - Start;
begin
Trace.Put_Clock
("post-recover" & Shared_Parser.Parsers.Count'Img & " active," & Recover_Duration'Image);
end;
end if;
if Trace_Parse > Outline then
if Recover_Result = Success then
Trace.Put_Line
("recover: succeed, parser count" & SAL.Base_Peek_Type'Image (Shared_Parser.Parsers.Count));
else
Trace.Put_Line
("recover: fail " & McKenzie_Recover.Recover_Status'Image (Recover_Result) &
", parser count" & SAL.Base_Peek_Type'Image (Shared_Parser.Parsers.Count));
end if;
end if;
if Ada.Text_IO.Is_Open (Shared_Parser.Recover_Log_File) then
declare
use Ada.Text_IO;
begin
Put
(Shared_Parser.Recover_Log_File,
Ada.Calendar.Formatting.Image (Ada.Calendar.Clock) & " " &
Shared_Parser.Partial_Parse_Active'Image & " " &
Recover_Result'Image & " " &
Pre_Recover_Parser_Count'Image & " '" &
Shared_Parser.Lexer.File_Name & "'");
Put (Shared_Parser.Recover_Log_File, '(');
for Parser of Shared_Parser.Parsers loop
Put (Shared_Parser.Recover_Log_File, Image (Parser.Recover.Results.Peek.Strategy_Counts));
Put
(Shared_Parser.Recover_Log_File,
Integer'Image (Parser.Recover.Enqueue_Count) &
Integer'Image (Parser.Recover.Check_Count) & " " &
Boolean'Image (Parser.Recover.Success));
end loop;
Put (Shared_Parser.Recover_Log_File, ')');
New_Line (Shared_Parser.Recover_Log_File);
Flush (Shared_Parser.Recover_Log_File);
end;
end if;
else
if Trace_Parse > Outline or Trace_McKenzie > Outline then
Trace.Put_Line ("recover disabled");
end if;
end if;
if Recover_Result = Success then
for Parser_State of Shared_Parser.Parsers loop
Parser_State.Resume_Active := True;
Parser_State.Conflict_During_Resume := False;
if Trace_Parse > Outline then
Trace.Put_Line
(Integer'Image (Parser_State.Label) & ": Current_Token " &
Parser_State.Tree.Image (Parser_State.Current_Token, Trace.Descriptor.all) &
" Shared_Token " & Image
(Parser_State.Shared_Token, Shared_Parser.Terminals, Trace.Descriptor.all));
if Trace_Parse > Detail then
Shared_Parser.Trace.Put_Line
(Integer'Image (Parser_State.Label) & ": resume_active: True, token goal" &
WisiToken.Token_Index'Image (Parser_State.Resume_Token_Goal));
end if;
end if;
Parser_State.Zombie_Token_Count := 0;
case Parser_State.Verb is
when Reduce =>
null;
when Error =>
-- Force this parser to be terminated.
if Shared_Parser.Enable_McKenzie_Recover then
Parser_State.Zombie_Token_Count := Shared_Parser.Table.McKenzie_Param.Check_Limit + 1;
end if;
when Shift =>
null;
when Pause | Accept_It =>
raise SAL.Programmer_Error;
end case;
end loop;
else
-- Terminate with error. Parser_State has all the required info on
-- the original error (recorded by Error in Do_Action); report reason
-- recover failed.
for Parser_State of Shared_Parser.Parsers loop
Parser_State.Errors.Append
((Label => LR.Message,
First_Terminal => Trace.Descriptor.First_Terminal,
Last_Terminal => Trace.Descriptor.Last_Terminal,
Recover => <>,
Msg =>
(if Shared_Parser.Enable_McKenzie_Recover
then +"recover: fail " & McKenzie_Recover.Recover_Status'Image (Recover_Result)
else +"recover disabled")));
end loop;
raise WisiToken.Syntax_Error;
end if;
-- Recover sets Parser.Verb to Shift for all active parsers, to
-- indicate it no longer has an error. Set Current_Verb to reflect
-- that.
Current_Verb := Shift;
end;
end case;
-- We don't use 'for Parser_State of Parsers loop' here,
-- because terminate on error and spawn on conflict require
-- changing the parser list.
declare
Current_Parser : Parser_Lists.Cursor := Shared_Parser.Parsers.First;
begin
Action_Loop :
loop
exit Action_Loop when Current_Parser.Is_Done;
-- We don't check duplicate state during resume, because the tokens
-- inserted/deleted by error recover may cause initially duplicate
-- states to diverge.
if not Current_Parser.State_Ref.Resume_Active and
Shared_Parser.Terminate_Same_State and
Current_Verb = Shift
then
Shared_Parser.Parsers.Duplicate_State
(Current_Parser, Shared_Parser.Trace.all, Shared_Parser.Terminals);
-- If Duplicate_State terminated Current_Parser, Current_Parser now
-- points to the next parser. Otherwise it is unchanged.
end if;
exit Action_Loop when Current_Parser.Is_Done;
if Trace_Parse > Extra then
Trace.Put_Line
("current_verb: " & Parse_Action_Verbs'Image (Current_Verb) &
"," & Integer'Image (Current_Parser.Label) &
".verb: " & Parse_Action_Verbs'Image (Current_Parser.Verb));
end if;
-- Each branch of the following 'if' calls either Current_Parser.Free
-- (which advances to the next parser) or Current_Parser.Next.
if Current_Parser.Verb = Error then
-- This parser is a zombie; see Check_Error above.
--
-- Check to see if it is time to terminate it
if Shared_Parser.Enable_McKenzie_Recover and then
Current_Parser.State_Ref.Zombie_Token_Count <= Shared_Parser.Table.McKenzie_Param.Check_Limit
then
if Trace_Parse > Detail then
Trace.Put_Line (Integer'Image (Current_Parser.Label) & ": zombie");
end if;
Current_Parser.Next;
else
Shared_Parser.Parsers.Terminate_Parser
(Current_Parser, "zombie", Shared_Parser.Trace.all, Shared_Parser.Terminals);
end if;
elsif Current_Parser.Verb = Current_Verb then
if Trace_Parse > Extra then
Parser_Lists.Put_Top_10 (Trace, Current_Parser);
end if;
declare
State : Parser_Lists.Parser_State renames Current_Parser.State_Ref.Element.all;
begin
Action := Action_For
(Table => Shared_Parser.Table.all,
State => State.Stack.Peek.State,
ID => State.Tree.ID (State.Current_Token));
end;
declare
Conflict : Parse_Action_Node_Ptr := Action.Next;
begin
loop
exit when Conflict = null;
-- Spawn a new parser (before modifying Current_Parser stack).
Current_Parser.State_Ref.Conflict_During_Resume := Current_Parser.State_Ref.Resume_Active;
if Shared_Parser.Parsers.Count = Shared_Parser.Max_Parallel then
-- If errors were recovered, terminate a parser that used the
-- highest cost solution.
declare
use all type WisiToken.Parse.LR.Parser_Lists.Cursor;
Max_Recover_Cost : Integer := 0;
Cur : Parser_Lists.Cursor := Shared_Parser.Parsers.First;
Max_Parser : Parser_Lists.Cursor := Cur;
begin
loop
exit when Cur.Is_Done;
if Cur.Total_Recover_Cost > Max_Recover_Cost then
Max_Parser := Cur;
Max_Recover_Cost := Cur.Total_Recover_Cost;
end if;
Cur.Next;
end loop;
if Max_Recover_Cost > 0 then
if Max_Parser = Current_Parser then
Current_Parser.Next;
Shared_Parser.Parsers.Terminate_Parser
(Max_Parser, "too many parsers; max error repair cost", Trace,
Shared_Parser.Terminals);
-- We changed Current_Parser, so start over
goto Continue_Action_Loop;
else
Shared_Parser.Parsers.Terminate_Parser
(Max_Parser, "too many parsers; max error repair cost", Trace,
Shared_Parser.Terminals);
end if;
end if;
end;
end if;
if Shared_Parser.Parsers.Count = Shared_Parser.Max_Parallel then
declare
Parser_State : Parser_Lists.Parser_State renames Current_Parser.State_Ref;
Token : Base_Token renames Shared_Parser.Terminals (Parser_State.Shared_Token);
begin
raise WisiToken.Parse_Error with Error_Message
(Shared_Parser.Lexer.File_Name, Token.Line, Token.Column,
"too many parallel parsers required in grammar state" &
State_Index'Image (Parser_State.Stack.Peek.State) &
"; simplify grammar, or increase max-parallel (" &
SAL.Base_Peek_Type'Image (Shared_Parser.Max_Parallel) & ")");
end;
else
if Trace_Parse > Outline then
declare
Parser_State : Parser_Lists.Parser_State renames Current_Parser.State_Ref;
begin
Trace.Put_Line
(Integer'Image (Current_Parser.Label) & ": " &
Trimmed_Image (Parser_State.Stack.Peek.State) & ": " &
Parser_State.Tree.Image
(Parser_State.Current_Token, Trace.Descriptor.all) & " : " &
"spawn" & Integer'Image (Shared_Parser.Parsers.Last_Label + 1) & ", (" &
Trimmed_Image (1 + Integer (Shared_Parser.Parsers.Count)) & " active)");
end;
end if;
Shared_Parser.Parsers.Prepend_Copy (Current_Parser);
Do_Action (Conflict.Item, Shared_Parser.Parsers.First, Shared_Parser);
-- We must terminate error parsers immediately in order to avoid
-- zombie parsers during recovery.
declare
Temp : Parser_Lists.Cursor := Shared_Parser.Parsers.First;
begin
Check_Error (Temp);
end;
end if;
Conflict := Conflict.Next;
end loop;
end;
Do_Action (Action.Item, Current_Parser, Shared_Parser);
Check_Error (Current_Parser);
else
-- Current parser is waiting for others to catch up
Current_Parser.Next;
end if;
<<Continue_Action_Loop>>
end loop Action_Loop;
end;
end loop Main_Loop;
if Trace_Parse > Outline then
Trace.Put_Line (Shared_Parser.Parsers.First.Label'Image & ": succeed");
end if;
if Debug_Mode then
Trace.Put_Clock ("finish parse");
end if;
-- We don't raise Syntax_Error for lexer errors, since they are all
-- recovered, either by inserting a quote, or by ignoring the
-- character.
exception
when Syntax_Error | WisiToken.Parse_Error | Partial_Parse =>
if Debug_Mode then
Trace.Put_Clock ("finish - error");
end if;
raise;
when E : others =>
declare
Msg : constant String := Ada.Exceptions.Exception_Name (E) & ": " & Ada.Exceptions.Exception_Message (E);
begin
if Shared_Parser.Parsers.Count > 0 then
-- Emacs displays errors in the *syntax-errors* buffer
Shared_Parser.Parsers.First_State_Ref.Errors.Append
((Label => LR.Message,
First_Terminal => Trace.Descriptor.First_Terminal,
Last_Terminal => Trace.Descriptor.Last_Terminal,
Recover => <>,
Msg => +Msg));
end if;
if Debug_Mode then
Trace.Put_Line (GNAT.Traceback.Symbolic.Symbolic_Traceback (E)); -- includes Prefix
Trace.New_Line;
end if;
-- Emacs displays the exception message in the echo area; easy to miss
raise WisiToken.Parse_Error with Msg;
end;
end Parse;
overriding function Tree (Shared_Parser : in Parser) return Syntax_Trees.Tree
is begin
if Shared_Parser.Parsers.Count > 1 then
raise WisiToken.Parse_Error with "ambigous parse";
else
return Shared_Parser.Parsers.First_State_Ref.Tree;
end if;
end Tree;
overriding function Tree_Var_Ref (Shared_Parser : aliased in out Parser) return Syntax_Trees.Tree_Variable_Reference
is begin
if Shared_Parser.Parsers.Count > 1 then
raise WisiToken.Parse_Error with "ambigous parse";
else
return (Element => Shared_Parser.Parsers.First_State_Ref.Tree'Access);
end if;
end Tree_Var_Ref;
overriding
procedure Execute_Actions
(Parser : in out LR.Parser.Parser;
Image_Augmented : in Syntax_Trees.Image_Augmented := null)
is
use all type Syntax_Trees.User_Data_Access;
use all type WisiToken.Syntax_Trees.Semantic_Action;
Descriptor : WisiToken.Descriptor renames Parser.Trace.Descriptor.all;
procedure Process_Node
(Tree : in out Syntax_Trees.Tree;
Node : in Valid_Node_Index)
is
use all type Syntax_Trees.Node_Label;
begin
if Tree.Label (Node) /= Nonterm then
return;
end if;
declare
Tree_Children : constant Valid_Node_Index_Array := Tree.Children (Node);
begin
Parser.User_Data.Reduce (Tree, Node, Tree_Children);
if Tree.Action (Node) /= null then
begin
Tree.Action (Node) (Parser.User_Data.all, Tree, Node, Tree_Children);
exception
when E : others =>
declare
Line : Line_Number_Type := Line_Number_Type'First;
Column : Ada.Text_IO.Count := Ada.Text_IO.Count'First;
begin
if Tree.First_Shared_Terminal (Node) = Invalid_Token_Index then
declare
Byte_Region : Buffer_Region renames Tree.Byte_Region (Node);
begin
if Byte_Region /= Null_Buffer_Region then
Column := Ada.Text_IO.Count (Byte_Region.First);
end if;
end;
else
declare
Token : Base_Token renames Parser.Terminals (Tree.First_Shared_Terminal (Node));
begin
Line := Token.Line;
Column := Token.Column;
end;
end if;
raise WisiToken.Parse_Error with Error_Message
(Parser.Lexer.File_Name, Line, Column,
"action raised exception " & Ada.Exceptions.Exception_Name (E) & ": " &
Ada.Exceptions.Exception_Message (E));
end;
end;
end if;
end;
end Process_Node;
begin
if Parser.User_Data /= null then
if Parser.Parsers.Count > 1 then
raise Syntax_Error with "ambiguous parse; can't execute actions";
end if;
declare
use Recover_Op_Arrays, Recover_Op_Array_Refs;
Parser_State : Parser_Lists.Parser_State renames Parser.Parsers.First_State_Ref;
begin
pragma Assert (Parser_State.Tree.Flushed);
Parser_State.Tree.Set_Parents;
if Trace_Action > Outline then
if Trace_Action > Extra then
Parser_State.Tree.Print_Tree (Descriptor, Parser_State.Tree.Root, Image_Augmented);
Parser.Trace.New_Line;
end if;
Parser.Trace.Put_Line
(Integer'Image (Parser_State.Label) & ": root node: " & Parser_State.Tree.Image
(Parser_State.Tree.Root, Descriptor));
end if;
for I in First_Index (Parser_State.Recover_Insert_Delete) ..
Last_Index (Parser_State.Recover_Insert_Delete)
loop
declare
Op : Recover_Op renames Constant_Ref (Parser_State.Recover_Insert_Delete, I);
begin
case Op.Op is
when Insert =>
Parser.User_Data.Insert_Token (Parser_State.Tree, Op.Ins_Tree_Node);
when Delete =>
Parser.User_Data.Delete_Token (Parser_State.Tree, Op.Del_Token_Index);
end case;
end;
end loop;
Parser.User_Data.Initialize_Actions (Parser_State.Tree);
Parser_State.Tree.Process_Tree (Process_Node'Access);
end;
end if;
end Execute_Actions;
overriding function Any_Errors (Parser : in LR.Parser.Parser) return Boolean
is
use all type Ada.Containers.Count_Type;
Parser_State : Parser_Lists.Parser_State renames Parser.Parsers.First_Constant_State_Ref;
begin
pragma Assert (Parser_State.Tree.Flushed);
return Parser.Parsers.Count > 1 or Parser_State.Errors.Length > 0 or Parser.Lexer.Errors.Length > 0;
end Any_Errors;
overriding procedure Put_Errors (Parser : in LR.Parser.Parser)
is
use Ada.Text_IO;
Parser_State : Parser_Lists.Parser_State renames Parser.Parsers.First_Constant_State_Ref;
Descriptor : WisiToken.Descriptor renames Parser.Trace.Descriptor.all;
begin
for Item of Parser.Lexer.Errors loop
Put_Line
(Current_Error,
Parser.Lexer.File_Name & ":0:0: lexer unrecognized character at" & Buffer_Pos'Image (Item.Char_Pos));
end loop;
for Item of Parser_State.Errors loop
case Item.Label is
when Action =>
declare
Index : constant Base_Token_Index := Parser_State.Tree.First_Shared_Terminal (Item.Error_Token);
begin
if Index = Invalid_Token_Index then
-- Error_Token is virtual
Put_Line
(Current_Error,
Error_Message
(Parser.Lexer.File_Name, 1, 0,
"syntax error: expecting " & Image (Item.Expecting, Descriptor) &
", found " & Image (Parser_State.Tree.ID (Item.Error_Token), Descriptor)));
else
declare
Token : Base_Token renames Parser.Terminals (Index);
begin
Put_Line
(Current_Error,
Error_Message
(Parser.Lexer.File_Name, Token.Line, Token.Column,
"syntax error: expecting " & Image (Item.Expecting, Descriptor) &
", found '" & Parser.Lexer.Buffer_Text (Token.Byte_Region) & "'"));
end;
end if;
end;
when Check =>
Put_Line
(Current_Error,
Parser.Lexer.File_Name & ":0:0: semantic check error: " &
Semantic_Checks.Image (Item.Check_Status, Descriptor));
when Message =>
Put_Line (Current_Error, -Item.Msg);
end case;
if Item.Recover.Stack.Depth /= 0 then
Put_Line (Current_Error, " recovered: " & Image (Item.Recover.Ops, Descriptor));
end if;
end loop;
end Put_Errors;
end WisiToken.Parse.LR.Parser;
| 43.626889 | 119 | 0.525994 |
5e874fb45ff22ec253af72d1affb15fb192ca215 | 8,601 | ads | Ada | bb-runtimes/src/system/system-xi-arm-gic-sfp.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/src/system/system-xi-arm-gic-sfp.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/src/system/system-xi-arm-gic-sfp.ads | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M --
-- --
-- S p e c --
-- (ARM Version) --
-- --
-- Copyright (C) 1992-2020, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. The copyright notice above, and the license provisions that follow --
-- apply solely to the contents of the part following the private keyword. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
pragma Restrictions (No_Exception_Propagation);
-- Only local exception handling is supported in this profile
pragma Restrictions (No_Exception_Registration);
-- Disable exception name registration. This capability is not used because
-- it is only required by exception stream attributes which are not supported
-- in this run time.
pragma Restrictions (No_Implicit_Dynamic_Code);
-- Pointers to nested subprograms are not allowed in this run time, in order
-- to prevent the compiler from building "trampolines".
pragma Restrictions (No_Finalization);
-- Controlled types are not supported in this run time
pragma Profile (Ravenscar);
-- This is a Ravenscar run time
package System is
pragma Pure;
-- Note that we take advantage of the implementation permission to make
-- this unit Pure instead of Preelaborable; see RM 13.7.1(15). In Ada
-- 2005, this is Pure in any case (AI-362).
pragma No_Elaboration_Code_All;
-- Allow the use of that restriction in units that WITH this unit
type Name is (SYSTEM_NAME_GNAT);
System_Name : constant Name := SYSTEM_NAME_GNAT;
-- System-Dependent Named Numbers
Min_Int : constant := -2 ** (Standard'Max_Integer_Size - 1);
Max_Int : constant := 2 ** (Standard'Max_Integer_Size - 1) - 1;
Max_Binary_Modulus : constant := 2 ** Standard'Max_Integer_Size;
Max_Nonbinary_Modulus : constant := 2 ** Integer'Size - 1;
Max_Base_Digits : constant := Long_Long_Float'Digits;
Max_Digits : constant := Long_Long_Float'Digits;
Max_Mantissa : constant := Standard'Max_Integer_Size - 1;
Fine_Delta : constant := 2.0 ** (-Max_Mantissa);
Tick : constant := 0.000_001;
-- Storage-related Declarations
type Address is private;
pragma Preelaborable_Initialization (Address);
Null_Address : constant Address;
Storage_Unit : constant := 8;
Word_Size : constant := Standard'Word_Size;
Memory_Size : constant := 2 ** Word_Size;
-- Address comparison
function "<" (Left, Right : Address) return Boolean;
function "<=" (Left, Right : Address) return Boolean;
function ">" (Left, Right : Address) return Boolean;
function ">=" (Left, Right : Address) return Boolean;
function "=" (Left, Right : Address) return Boolean;
pragma Import (Intrinsic, "<");
pragma Import (Intrinsic, "<=");
pragma Import (Intrinsic, ">");
pragma Import (Intrinsic, ">=");
pragma Import (Intrinsic, "=");
-- Other System-Dependent Declarations
type Bit_Order is (High_Order_First, Low_Order_First);
Default_Bit_Order : constant Bit_Order :=
Bit_Order'Val (Standard'Default_Bit_Order);
pragma Warnings (Off, Default_Bit_Order); -- kill constant condition warning
-- Priority-related Declarations (RM D.1)
-- 241 - 255 correspond to interrupt levels
-- 255 is the priority value that block all interrupts
-- 240 is the maximum value of priority that is not high enough to
-- require the blocking of one or more interrupts.
--
-- The range of priorities is chosen to be similar other targets.
-- The number of interrupt priorities is chosen to match those that can
-- be masked/unmasked directly in the processor.
Max_Priority : constant Positive := 240;
Max_Interrupt_Priority : constant Positive := 255;
subtype Any_Priority is Integer range 0 .. 255;
subtype Priority is Any_Priority range 0 .. 240;
subtype Interrupt_Priority is Any_Priority range 241 .. 255;
Default_Priority : constant Priority := 120;
-- By default, the priority assigned is the one in the middle of the
-- Priority range.
private
type Address is mod Memory_Size;
Null_Address : constant Address := 0;
--------------------------------------
-- System Implementation Parameters --
--------------------------------------
-- These parameters provide information about the target that is used
-- by the compiler. They are in the private part of System, where they
-- can be accessed using the special circuitry in the Targparm unit
-- whose source should be consulted for more detailed descriptions
-- of the individual switch values.
Atomic_Sync_Default : constant Boolean := False;
Backend_Divide_Checks : constant Boolean := False;
Backend_Overflow_Checks : constant Boolean := True;
Command_Line_Args : constant Boolean := False;
Configurable_Run_Time : constant Boolean := True;
Denorm : constant Boolean := True;
Duration_32_Bits : constant Boolean := False;
Exit_Status_Supported : constant Boolean := False;
Fractional_Fixed_Ops : constant Boolean := False;
Frontend_Layout : constant Boolean := False;
Machine_Overflows : constant Boolean := False;
Machine_Rounds : constant Boolean := True;
Preallocated_Stacks : constant Boolean := True;
Signed_Zeros : constant Boolean := True;
Stack_Check_Default : constant Boolean := False;
Stack_Check_Probes : constant Boolean := False;
Stack_Check_Limits : constant Boolean := False;
Support_Aggregates : constant Boolean := True;
Support_Composite_Assign : constant Boolean := True;
Support_Composite_Compare : constant Boolean := True;
Support_Long_Shifts : constant Boolean := True;
Always_Compatible_Rep : constant Boolean := True;
Suppress_Standard_Library : constant Boolean := True;
Use_Ada_Main_Program_Name : constant Boolean := False;
Frontend_Exceptions : constant Boolean := False;
ZCX_By_Default : constant Boolean := True;
end System;
| 48.050279 | 79 | 0.577956 |
3ddcdb49995930b5d22e36378ed9c0ea9097dd65 | 2,559 | ads | Ada | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-socthi__dummy.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-socthi__dummy.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/g-socthi__dummy.ads | djamal2727/Main-Bearing-Analytical-Model | 2f00c2219c71be0175c6f4f8f1d4cca231d97096 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T . S O C K E T S . T H I N --
-- --
-- S p e c --
-- --
-- Copyright (C) 2001-2020, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- As a special exception under Section 7 of GPL version 3, you are granted --
-- additional permissions described in the GCC Runtime Library Exception, --
-- version 3.1, as published by the Free Software Foundation. --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package is a placeholder for the sockets binding for platforms where
-- it is not implemented.
package GNAT.Sockets.Thin is
pragma Unimplemented_Unit;
end GNAT.Sockets.Thin;
| 67.342105 | 78 | 0.388824 |
03bbeb417f6ef08c9e11c155f9cd9fb151df1f91 | 13,837 | adb | Ada | llvm-gcc-4.2-2.9/gcc/ada/g-cgi.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/g-cgi.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/g-cgi.adb | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- G N A T . C G I --
-- --
-- B o d y --
-- --
-- Copyright (C) 2001-2005, AdaCore --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with Ada.Text_IO;
with Ada.Strings.Fixed;
with Ada.Characters.Handling;
with Ada.Strings.Maps;
with GNAT.OS_Lib;
with GNAT.Table;
package body GNAT.CGI is
use Ada;
Valid_Environment : Boolean := True;
-- This boolean will be set to False if the initialization was not
-- completed correctly. It must be set to true there because the
-- Initialize routine (called during elaboration) will use some of the
-- services exported by this unit.
Current_Method : Method_Type;
-- This is the current method used to pass CGI parameters
Header_Sent : Boolean := False;
-- Will be set to True when the header will be sent
-- Key/Value table declaration
type String_Access is access String;
type Key_Value is record
Key : String_Access;
Value : String_Access;
end record;
package Key_Value_Table is new Table (Key_Value, Positive, 1, 1, 50);
-----------------------
-- Local subprograms --
-----------------------
procedure Check_Environment;
pragma Inline (Check_Environment);
-- This procedure will raise Data_Error if Valid_Environment is False
procedure Initialize;
-- Initialize CGI package by reading the runtime environment. This
-- procedure is called during elaboration. All exceptions raised during
-- this procedure are deferred.
--------------------
-- Argument_Count --
--------------------
function Argument_Count return Natural is
begin
Check_Environment;
return Key_Value_Table.Last;
end Argument_Count;
-----------------------
-- Check_Environment --
-----------------------
procedure Check_Environment is
begin
if not Valid_Environment then
raise Data_Error;
end if;
end Check_Environment;
------------
-- Decode --
------------
function Decode (S : String) return String is
Result : String (S'Range);
K : Positive := S'First;
J : Positive := Result'First;
begin
while K <= S'Last loop
if K + 2 <= S'Last
and then S (K) = '%'
and then Characters.Handling.Is_Hexadecimal_Digit (S (K + 1))
and then Characters.Handling.Is_Hexadecimal_Digit (S (K + 2))
then
-- Here we have '%HH' which is an encoded character where 'HH' is
-- the character number in hexadecimal.
Result (J) := Character'Val
(Natural'Value ("16#" & S (K + 1 .. K + 2) & '#'));
K := K + 3;
else
Result (J) := S (K);
K := K + 1;
end if;
J := J + 1;
end loop;
return Result (Result'First .. J - 1);
end Decode;
-------------------------
-- For_Every_Parameter --
-------------------------
procedure For_Every_Parameter is
Quit : Boolean;
begin
Check_Environment;
for K in 1 .. Key_Value_Table.Last loop
Quit := False;
Action (Key_Value_Table.Table (K).Key.all,
Key_Value_Table.Table (K).Value.all,
K,
Quit);
exit when Quit;
end loop;
end For_Every_Parameter;
----------------
-- Initialize --
----------------
procedure Initialize is
Request_Method : constant String :=
Characters.Handling.To_Upper
(Metavariable (CGI.Request_Method));
procedure Initialize_GET;
-- Read CGI parameters for a GET method. In this case the parameters
-- are passed into QUERY_STRING environment variable.
procedure Initialize_POST;
-- Read CGI parameters for a POST method. In this case the parameters
-- are passed with the standard input. The total number of characters
-- for the data is passed in CONTENT_LENGTH environment variable.
procedure Set_Parameter_Table (Data : String);
-- Parse the parameter data and set the parameter table
--------------------
-- Initialize_GET --
--------------------
procedure Initialize_GET is
Data : constant String := Metavariable (Query_String);
begin
Current_Method := Get;
if Data /= "" then
Set_Parameter_Table (Data);
end if;
end Initialize_GET;
---------------------
-- Initialize_POST --
---------------------
procedure Initialize_POST is
Content_Length : constant Natural :=
Natural'Value (Metavariable (CGI.Content_Length));
Data : String (1 .. Content_Length);
begin
Current_Method := Post;
if Content_Length /= 0 then
Text_IO.Get (Data);
Set_Parameter_Table (Data);
end if;
end Initialize_POST;
-------------------------
-- Set_Parameter_Table --
-------------------------
procedure Set_Parameter_Table (Data : String) is
procedure Add_Parameter (K : Positive; P : String);
-- Add a single parameter into the table at index K. The parameter
-- format is "key=value".
Count : constant Positive :=
1 + Strings.Fixed.Count (Data, Strings.Maps.To_Set ("&"));
-- Count is the number of parameters in the string. Parameters are
-- separated by ampersand character.
Index : Positive := Data'First;
Amp : Natural;
-------------------
-- Add_Parameter --
-------------------
procedure Add_Parameter (K : Positive; P : String) is
Equal : constant Natural := Strings.Fixed.Index (P, "=");
begin
if Equal = 0 then
raise Data_Error;
else
Key_Value_Table.Table (K) :=
Key_Value'(new String'(Decode (P (P'First .. Equal - 1))),
new String'(Decode (P (Equal + 1 .. P'Last))));
end if;
end Add_Parameter;
-- Start of processing for Set_Parameter_Table
begin
Key_Value_Table.Set_Last (Count);
for K in 1 .. Count - 1 loop
Amp := Strings.Fixed.Index (Data (Index .. Data'Last), "&");
Add_Parameter (K, Data (Index .. Amp - 1));
Index := Amp + 1;
end loop;
-- add last parameter
Add_Parameter (Count, Data (Index .. Data'Last));
end Set_Parameter_Table;
-- Start of processing for Initialize
begin
if Request_Method = "GET" then
Initialize_GET;
elsif Request_Method = "POST" then
Initialize_POST;
else
Valid_Environment := False;
end if;
exception
when others =>
-- If we have an exception during initialization of this unit we
-- just declare it invalid.
Valid_Environment := False;
end Initialize;
---------
-- Key --
---------
function Key (Position : Positive) return String is
begin
Check_Environment;
if Position <= Key_Value_Table.Last then
return Key_Value_Table.Table (Position).Key.all;
else
raise Parameter_Not_Found;
end if;
end Key;
----------------
-- Key_Exists --
----------------
function Key_Exists (Key : String) return Boolean is
begin
Check_Environment;
for K in 1 .. Key_Value_Table.Last loop
if Key_Value_Table.Table (K).Key.all = Key then
return True;
end if;
end loop;
return False;
end Key_Exists;
------------------
-- Metavariable --
------------------
function Metavariable
(Name : Metavariable_Name;
Required : Boolean := False) return String
is
function Get_Environment (Variable_Name : String) return String;
-- Returns the environment variable content
---------------------
-- Get_Environment --
---------------------
function Get_Environment (Variable_Name : String) return String is
Value : OS_Lib.String_Access := OS_Lib.Getenv (Variable_Name);
Result : constant String := Value.all;
begin
OS_Lib.Free (Value);
return Result;
end Get_Environment;
Result : constant String :=
Get_Environment (Metavariable_Name'Image (Name));
-- Start of processing for Metavariable
begin
Check_Environment;
if Result = "" and then Required then
raise Parameter_Not_Found;
else
return Result;
end if;
end Metavariable;
-------------------------
-- Metavariable_Exists --
-------------------------
function Metavariable_Exists (Name : Metavariable_Name) return Boolean is
begin
Check_Environment;
if Metavariable (Name) = "" then
return False;
else
return True;
end if;
end Metavariable_Exists;
------------
-- Method --
------------
function Method return Method_Type is
begin
Check_Environment;
return Current_Method;
end Method;
--------
-- Ok --
--------
function Ok return Boolean is
begin
return Valid_Environment;
end Ok;
----------------
-- Put_Header --
----------------
procedure Put_Header
(Header : String := Default_Header;
Force : Boolean := False)
is
begin
if Header_Sent = False or else Force then
Check_Environment;
Text_IO.Put_Line (Header);
Text_IO.New_Line;
Header_Sent := True;
end if;
end Put_Header;
---------
-- URL --
---------
function URL return String is
function Exists_And_Not_80 (Server_Port : String) return String;
-- Returns ':' & Server_Port if Server_Port is not "80" and the empty
-- string otherwise (80 is the default sever port).
-----------------------
-- Exists_And_Not_80 --
-----------------------
function Exists_And_Not_80 (Server_Port : String) return String is
begin
if Server_Port = "80" then
return "";
else
return ':' & Server_Port;
end if;
end Exists_And_Not_80;
-- Start of processing for URL
begin
Check_Environment;
return "http://"
& Metavariable (Server_Name)
& Exists_And_Not_80 (Metavariable (Server_Port))
& Metavariable (Script_Name);
end URL;
-----------
-- Value --
-----------
function Value
(Key : String;
Required : Boolean := False)
return String
is
begin
Check_Environment;
for K in 1 .. Key_Value_Table.Last loop
if Key_Value_Table.Table (K).Key.all = Key then
return Key_Value_Table.Table (K).Value.all;
end if;
end loop;
if Required then
raise Parameter_Not_Found;
else
return "";
end if;
end Value;
-----------
-- Value --
-----------
function Value (Position : Positive) return String is
begin
Check_Environment;
if Position <= Key_Value_Table.Last then
return Key_Value_Table.Table (Position).Value.all;
else
raise Parameter_Not_Found;
end if;
end Value;
begin
Initialize;
end GNAT.CGI;
| 28.181263 | 78 | 0.51991 |
8b51cf1db5bd2d7c384cba9ef695573aab2453af | 499 | ads | Ada | core/lib/soci/languages/ada/soci-mysql.ads | kiroboio/lib-ledger-core | b2def5f4aed64dcb43b1f4ecaa66103a40f02adc | [
"MIT"
] | 92 | 2016-11-13T01:28:34.000Z | 2022-03-25T01:11:37.000Z | core/lib/soci/languages/ada/soci-mysql.ads | kiroboio/lib-ledger-core | b2def5f4aed64dcb43b1f4ecaa66103a40f02adc | [
"MIT"
] | 242 | 2016-11-28T11:13:09.000Z | 2022-03-04T13:02:53.000Z | core/lib/soci/languages/ada/soci-mysql.ads | kiroboio/lib-ledger-core | b2def5f4aed64dcb43b1f4ecaa66103a40f02adc | [
"MIT"
] | 91 | 2017-06-20T10:35:28.000Z | 2022-03-09T14:15:40.000Z | -- Copyright (C) 2008-2011 Maciej Sobczak
-- Distributed under the Boost Software License, Version 1.0.
-- (See accompanying file LICENSE_1_0.txt or copy at
-- http://www.boost.org/LICENSE_1_0.txt)
package SOCI.MySQL is
--
-- Registers the MySQL backend so that it is ready for use
-- by the dynamic backend loader.
--
procedure Register_Factory_MySQL;
pragma Import (C, Register_Factory_MySQL,
"register_factory_mysql");
end SOCI.MySQL;
| 29.352941 | 63 | 0.675351 |
a0ce9d57b2c6ec688ef2e866e49e3cae76516086 | 3,681 | adb | Ada | src/base/commands/util-commands-parsers-gnat_parser.adb | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | null | null | null | src/base/commands/util-commands-parsers-gnat_parser.adb | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | null | null | null | src/base/commands/util-commands-parsers-gnat_parser.adb | yrashk/ada-util | 2aaa1d87e92a7137e1c63dce90f0722c549dfafd | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- util-commands-parsers.gnat_parser -- GNAT command line parser for command drivers
-- Copyright (C) 2018, 2019 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with GNAT.OS_Lib;
package body Util.Commands.Parsers.GNAT_Parser is
function To_OS_Lib_Argument_List (Args : in Argument_List'Class)
return GNAT.OS_Lib.Argument_List_Access;
function To_OS_Lib_Argument_List (Args : in Argument_List'Class)
return GNAT.OS_Lib.Argument_List_Access is
Count : constant Natural := Args.Get_Count;
New_Arg : GNAT.OS_Lib.Argument_List (1 .. Count);
begin
for I in 1 .. Count loop
New_Arg (I) := new String '(Args.Get_Argument (I));
end loop;
return new GNAT.OS_Lib.Argument_List '(New_Arg);
end To_OS_Lib_Argument_List;
-- ------------------------------
-- Get all the remaining arguments from the GNAT command line parse.
-- ------------------------------
procedure Get_Arguments (List : in out Dynamic_Argument_List;
Command : in String;
Parser : in GC.Opt_Parser := GC.Command_Line_Parser) is
begin
List.Name := Ada.Strings.Unbounded.To_Unbounded_String (Command);
loop
declare
S : constant String := GC.Get_Argument (Parser => Parser);
begin
exit when S'Length = 0;
List.List.Append (S);
end;
end loop;
end Get_Arguments;
procedure Execute (Config : in out Config_Type;
Args : in Util.Commands.Argument_List'Class;
Process : access procedure (Cmd_Args : in Commands.Argument_List'Class)) is
use type GC.Command_Line_Configuration;
Empty : Config_Type;
begin
if Config /= Empty then
declare
Parser : GC.Opt_Parser;
Cmd_Args : Dynamic_Argument_List;
Params : GNAT.OS_Lib.Argument_List_Access
:= To_OS_Lib_Argument_List (Args);
begin
GC.Initialize_Option_Scan (Parser, Params);
GC.Getopt (Config => Config, Parser => Parser);
Get_Arguments (Cmd_Args, Args.Get_Command_Name, Parser);
Process (Cmd_Args);
GC.Free (Config);
GNAT.OS_Lib.Free (Params);
exception
when others =>
GNAT.OS_Lib.Free (Params);
GC.Free (Config);
raise;
end;
else
Process (Args);
end if;
end Execute;
procedure Usage (Name : in String;
Config : in out Config_Type) is
Opts : constant String := GC.Get_Switches (Config);
begin
if Opts'Length > 0 then
GC.Set_Usage (Config, Usage => Name & " [switches] [arguments]");
GC.Display_Help (Config);
end if;
end Usage;
end Util.Commands.Parsers.GNAT_Parser;
| 37.948454 | 97 | 0.579462 |
0438a217820314b675c52b041a2ab70d710afb50 | 3,523 | ads | Ada | tools/scitools/conf/understand/ada/ada12/s-pack54.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | 1 | 2020-01-20T21:26:46.000Z | 2020-01-20T21:26:46.000Z | tools/scitools/conf/understand/ada/ada12/s-pack54.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada12/s-pack54.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 5 4 --
-- --
-- S p e c --
-- --
-- Copyright (C) 1992-2009, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- Handling of packed arrays with Component_Size = 54
package System.Pack_54 is
pragma Preelaborate;
Bits : constant := 54;
type Bits_54 is mod 2 ** Bits;
for Bits_54'Size use Bits;
function Get_54 (Arr : System.Address; N : Natural) return Bits_54;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned.
procedure Set_54 (Arr : System.Address; N : Natural; E : Bits_54);
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is set to the given value.
function GetU_54 (Arr : System.Address; N : Natural) return Bits_54;
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is extracted and returned. This version
-- is used when Arr may represent an unaligned address.
procedure SetU_54 (Arr : System.Address; N : Natural; E : Bits_54);
-- Arr is the address of the packed array, N is the zero-based
-- subscript. This element is set to the given value. This version
-- is used when Arr may represent an unaligned address
end System.Pack_54;
| 57.754098 | 78 | 0.427477 |
9a4bfbae01eb3fd967a00135d15bf0ec2fcc635f | 22,410 | adb | Ada | Milestone-2/IP/my_ip_hls/solution1/.autopilot/db/my_ip_hls_entry3.bind.adb | CSpyridakis/Reconfigurable-Computing | 345316489786c6470e47c66b0bf4a73d2ac4b0c0 | [
"MIT"
] | null | null | null | Milestone-2/IP/my_ip_hls/solution1/.autopilot/db/my_ip_hls_entry3.bind.adb | CSpyridakis/Reconfigurable-Computing | 345316489786c6470e47c66b0bf4a73d2ac4b0c0 | [
"MIT"
] | null | null | null | Milestone-2/IP/my_ip_hls/solution1/.autopilot/db/my_ip_hls_entry3.bind.adb | CSpyridakis/Reconfigurable-Computing | 345316489786c6470e47c66b0bf4a73d2ac4b0c0 | [
"MIT"
] | 3 | 2020-05-24T19:51:12.000Z | 2020-10-29T15:08:48.000Z | <?xml version="1.0" encoding="UTF-8" standalone="yes" ?>
<!DOCTYPE boost_serialization>
<boost_serialization signature="serialization::archive" version="15">
<syndb class_id="0" tracking_level="0" version="0">
<userIPLatency>-1</userIPLatency>
<userIPName></userIPName>
<cdfg class_id="1" tracking_level="1" version="0" object_id="_0">
<name>my_ip_hls_entry3</name>
<ret_bitwidth>0</ret_bitwidth>
<ports class_id="2" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="3" tracking_level="1" version="0" object_id="_1">
<Value class_id="4" tracking_level="0" version="0">
<Obj class_id="5" tracking_level="0" version="0">
<type>1</type>
<id>1</id>
<name>rule0_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo class_id="6" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></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>rule1_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></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>rule2_V</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></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>rule0_V_out</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>FIFO</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_5">
<Value>
<Obj>
<type>1</type>
<id>5</id>
<name>rule1_V_out</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>FIFO</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
<item class_id_reference="3" object_id="_6">
<Value>
<Obj>
<type>1</type>
<id>6</id>
<name>rule2_V_out</name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName>FIFO</coreName>
</Obj>
<bitwidth>32</bitwidth>
</Value>
<direction>1</direction>
<if_type>3</if_type>
<array_size>0</array_size>
<bit_vecs>
<count>0</count>
<item_version>0</item_version>
</bit_vecs>
</item>
</ports>
<nodes class_id="8" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="9" tracking_level="1" version="0" object_id="_7">
<Value>
<Obj>
<type>0</type>
<id>8</id>
<name>rule2_V_read</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>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>19</item>
<item>20</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_8">
<Value>
<Obj>
<type>0</type>
<id>9</id>
<name>rule1_V_read</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>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>21</item>
<item>22</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_9">
<Value>
<Obj>
<type>0</type>
<id>10</id>
<name>rule0_V_read</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>
<oprand_edges>
<count>2</count>
<item_version>0</item_version>
<item>23</item>
<item>24</item>
</oprand_edges>
<opcode>read</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_10">
<Value>
<Obj>
<type>0</type>
<id>11</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>26</item>
<item>27</item>
<item>28</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_11">
<Value>
<Obj>
<type>0</type>
<id>13</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>29</item>
<item>30</item>
<item>31</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_12">
<Value>
<Obj>
<type>0</type>
<id>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>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>3</count>
<item_version>0</item_version>
<item>32</item>
<item>33</item>
<item>34</item>
</oprand_edges>
<opcode>write</opcode>
<m_Display>0</m_Display>
</item>
<item class_id_reference="9" object_id="_13">
<Value>
<Obj>
<type>0</type>
<id>16</id>
<name></name>
<fileName></fileName>
<fileDirectory></fileDirectory>
<lineNumber>0</lineNumber>
<contextFuncName></contextFuncName>
<inlineStackInfo>
<count>0</count>
<item_version>0</item_version>
</inlineStackInfo>
<originalName></originalName>
<rtlName></rtlName>
<coreName></coreName>
</Obj>
<bitwidth>0</bitwidth>
</Value>
<oprand_edges>
<count>0</count>
<item_version>0</item_version>
</oprand_edges>
<opcode>ret</opcode>
<m_Display>0</m_Display>
</item>
</nodes>
<consts class_id="11" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</consts>
<blocks class_id="12" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="13" tracking_level="1" version="0" object_id="_14">
<Obj>
<type>3</type>
<id>17</id>
<name>my_ip_hls.entry3</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>7</count>
<item_version>0</item_version>
<item>8</item>
<item>9</item>
<item>10</item>
<item>11</item>
<item>13</item>
<item>15</item>
<item>16</item>
</node_objs>
</item>
</blocks>
<edges class_id="14" tracking_level="0" version="0">
<count>9</count>
<item_version>0</item_version>
<item class_id="15" tracking_level="1" version="0" object_id="_15">
<id>20</id>
<edge_type>1</edge_type>
<source_obj>3</source_obj>
<sink_obj>8</sink_obj>
</item>
<item class_id_reference="15" object_id="_16">
<id>22</id>
<edge_type>1</edge_type>
<source_obj>2</source_obj>
<sink_obj>9</sink_obj>
</item>
<item class_id_reference="15" object_id="_17">
<id>24</id>
<edge_type>1</edge_type>
<source_obj>1</source_obj>
<sink_obj>10</sink_obj>
</item>
<item class_id_reference="15" object_id="_18">
<id>27</id>
<edge_type>1</edge_type>
<source_obj>4</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="15" object_id="_19">
<id>28</id>
<edge_type>1</edge_type>
<source_obj>10</source_obj>
<sink_obj>11</sink_obj>
</item>
<item class_id_reference="15" object_id="_20">
<id>30</id>
<edge_type>1</edge_type>
<source_obj>5</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="15" object_id="_21">
<id>31</id>
<edge_type>1</edge_type>
<source_obj>9</source_obj>
<sink_obj>13</sink_obj>
</item>
<item class_id_reference="15" object_id="_22">
<id>33</id>
<edge_type>1</edge_type>
<source_obj>6</source_obj>
<sink_obj>15</sink_obj>
</item>
<item class_id_reference="15" object_id="_23">
<id>34</id>
<edge_type>1</edge_type>
<source_obj>8</source_obj>
<sink_obj>15</sink_obj>
</item>
</edges>
</cdfg>
<cdfg_regions class_id="16" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="17" tracking_level="1" version="0" object_id="_24">
<mId>1</mId>
<mTag>my_ip_hls.entry3</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>17</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="19" tracking_level="1" version="0" object_id="_25">
<states class_id="20" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="21" tracking_level="1" version="0" object_id="_26">
<id>1</id>
<operations class_id="22" tracking_level="0" version="0">
<count>10</count>
<item_version>0</item_version>
<item class_id="23" tracking_level="1" version="0" object_id="_27">
<id>7</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_28">
<id>8</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_29">
<id>9</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_30">
<id>10</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_31">
<id>11</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_32">
<id>12</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_33">
<id>13</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_34">
<id>14</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_35">
<id>15</id>
<stage>1</stage>
<latency>1</latency>
</item>
<item class_id_reference="23" object_id="_36">
<id>16</id>
<stage>1</stage>
<latency>1</latency>
</item>
</operations>
</item>
</states>
<transitions class_id="24" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</transitions>
</fsm>
<res class_id="-1"></res>
<node_label_latency class_id="26" tracking_level="0" version="0">
<count>7</count>
<item_version>0</item_version>
<item class_id="27" tracking_level="0" version="0">
<first>8</first>
<second class_id="28" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>9</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>10</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>11</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>13</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>15</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
<item>
<first>16</first>
<second>
<first>0</first>
<second>0</second>
</second>
</item>
</node_label_latency>
<bblk_ent_exit class_id="29" tracking_level="0" version="0">
<count>1</count>
<item_version>0</item_version>
<item class_id="30" tracking_level="0" version="0">
<first>17</first>
<second class_id="31" tracking_level="0" version="0">
<first>0</first>
<second>0</second>
</second>
</item>
</bblk_ent_exit>
<regions class_id="32" tracking_level="0" version="0">
<count>0</count>
<item_version>0</item_version>
</regions>
<dp_fu_nodes class_id="33" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="34" tracking_level="0" version="0">
<first>28</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
<item>
<first>34</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>40</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>46</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>54</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>62</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
</dp_fu_nodes>
<dp_fu_nodes_expression class_id="36" 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>6</count>
<item_version>0</item_version>
<item class_id="37" tracking_level="0" version="0">
<first>StgValue_10_write_fu_62</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
<item>
<first>StgValue_6_write_fu_46</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
<item>
<first>StgValue_8_write_fu_54</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
<item>
<first>rule0_V_read_read_fu_40</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
<item>
<first>rule1_V_read_read_fu_34</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
<item>
<first>rule2_V_read_read_fu_28</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
</dp_fu_nodes_io>
<return_ports>
<count>0</count>
<item_version>0</item_version>
</return_ports>
<dp_mem_port_nodes class_id="38" 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="39" tracking_level="0" version="0">
<count>6</count>
<item_version>0</item_version>
<item class_id="40" tracking_level="0" version="0">
<first>rule0_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>10</item>
</second>
</item>
</second>
</item>
<item>
<first>rule0_V_out</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>11</item>
</second>
</item>
</second>
</item>
<item>
<first>rule1_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>9</item>
</second>
</item>
</second>
</item>
<item>
<first>rule1_V_out</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>13</item>
</second>
</item>
</second>
</item>
<item>
<first>rule2_V</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>read</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>8</item>
</second>
</item>
</second>
</item>
<item>
<first>rule2_V_out</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>
<first>write</first>
<second>
<count>1</count>
<item_version>0</item_version>
<item>15</item>
</second>
</item>
</second>
</item>
</dp_port_io_nodes>
<port2core class_id="41" tracking_level="0" version="0">
<count>3</count>
<item_version>0</item_version>
<item class_id="42" tracking_level="0" version="0">
<first>4</first>
<second>FIFO</second>
</item>
<item>
<first>5</first>
<second>FIFO</second>
</item>
<item>
<first>6</first>
<second>FIFO</second>
</item>
</port2core>
<node2core>
<count>0</count>
<item_version>0</item_version>
</node2core>
</syndb>
</boost_serialization>
| 24.872364 | 72 | 0.60183 |
1a20cdf5d4b48bb42100736d4f3f181e797456d8 | 212 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/nested_generic1.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/nested_generic1.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/nested_generic1.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- PR ada/52735
-- Reported by Per Sandberg <[email protected]>
-- { dg-do compile }
with Nested_Generic1_Pkg;
procedure Nested_Generic1 is
package P is new Nested_Generic1_Pkg;
begin
null;
end;
| 16.307692 | 55 | 0.740566 |
03c0664b5d696f82418a282a25e67dcadd1d7fce | 10,467 | ads | Ada | tools/scitools/conf/understand/ada/ada05/i-cstrea.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/i-cstrea.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | tools/scitools/conf/understand/ada/ada05/i-cstrea.ads | brucegua/moocos | 575c161cfa35e220f10d042e2e5ca18773691695 | [
"Apache-2.0"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- I N T E R F A C E S . C _ S T R E A M S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1995-2005, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
--
--
--
--
--
--
--
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package is a thin binding to selected functions in the C
-- library that provide a complete interface for handling C streams.
with System.CRTL;
package Interfaces.C_Streams is
pragma Preelaborate;
subtype chars is System.CRTL.chars;
subtype FILEs is System.CRTL.FILEs;
subtype int is System.CRTL.int;
subtype long is System.CRTL.long;
subtype size_t is System.CRTL.size_t;
subtype voids is System.Address;
NULL_Stream : constant FILEs;
-- Value returned (NULL in C) to indicate an fdopen/fopen/tmpfile error
----------------------------------
-- Constants Defined in stdio.h --
----------------------------------
EOF : constant int;
-- Used by a number of routines to indicate error or end of file
IOFBF : constant int;
IOLBF : constant int;
IONBF : constant int;
-- Used to indicate buffering mode for setvbuf call
L_tmpnam : constant int;
-- Maximum length of file name that can be returned by tmpnam
SEEK_CUR : constant int;
SEEK_END : constant int;
SEEK_SET : constant int;
-- Used to indicate origin for fseek call
function stdin return FILEs;
function stdout return FILEs;
function stderr return FILEs;
-- Streams associated with standard files
--------------------------
-- Standard C functions --
--------------------------
-- The functions selected below are ones that are available in DOS,
-- OS/2, UNIX and Xenix (but not necessarily in ANSI C). These are
-- very thin interfaces which copy exactly the C headers. For more
-- documentation on these functions, see the Microsoft C "Run-Time
-- Library Reference" (Microsoft Press, 1990, ISBN 1-55615-225-6),
-- which includes useful information on system compatibility.
procedure clearerr (stream : FILEs) renames System.CRTL.clearerr;
function fclose (stream : FILEs) return int renames System.CRTL.fclose;
function fdopen (handle : int; mode : chars) return FILEs
renames System.CRTL.fdopen;
function feof (stream : FILEs) return int;
function ferror (stream : FILEs) return int;
function fflush (stream : FILEs) return int renames System.CRTL.fflush;
function fgetc (stream : FILEs) return int renames System.CRTL.fgetc;
function fgets (strng : chars; n : int; stream : FILEs) return chars
renames System.CRTL.fgets;
function fileno (stream : FILEs) return int;
function fopen (filename : chars; Mode : chars) return FILEs
renames System.CRTL.fopen;
-- Note: to maintain target independence, use text_translation_required,
-- a boolean variable defined in a-sysdep.c to deal with the target
-- dependent text translation requirement. If this variable is set,
-- then b/t should be appended to the standard mode argument to set
-- the text translation mode off or on as required.
function fputc (C : int; stream : FILEs) return int
renames System.CRTL.fputc;
function fputs (Strng : chars; Stream : FILEs) return int
renames System.CRTL.fputs;
function fread
(buffer : voids;
size : size_t;
count : size_t;
stream : FILEs) return size_t;
function fread
(buffer : voids;
index : size_t;
size : size_t;
count : size_t;
stream : FILEs) return size_t;
-- Same as normal fread, but has a parameter 'index' that indicates
-- the starting index for the read within 'buffer' (which must be the
-- address of the beginning of a whole array object with an assumed
-- zero base). This is needed for systems that do not support taking
-- the address of an element within an array.
function freopen
(filename : chars;
mode : chars;
stream : FILEs)
return FILEs renames System.CRTL.freopen;
function fseek
(stream : FILEs;
offset : long;
origin : int)
return int renames System.CRTL.fseek;
function ftell (stream : FILEs) return long
renames System.CRTL.ftell;
function fwrite
(buffer : voids;
size : size_t;
count : size_t;
stream : FILEs)
return size_t;
function isatty (handle : int) return int renames System.CRTL.isatty;
procedure mktemp (template : chars) renames System.CRTL.mktemp;
-- The return value (which is just a pointer to template) is discarded
procedure rewind (stream : FILEs) renames System.CRTL.rewind;
function setvbuf
(stream : FILEs;
buffer : chars;
mode : int;
size : size_t)
return int;
procedure tmpnam (string : chars) renames System.CRTL.tmpnam;
-- The parameter must be a pointer to a string buffer of at least L_tmpnam
-- bytes (the call with a null parameter is not supported). The returned
-- value, which is just a copy of the input argument, is discarded.
function tmpfile return FILEs renames System.CRTL.tmpfile;
function ungetc (c : int; stream : FILEs) return int
renames System.CRTL.ungetc;
function unlink (filename : chars) return int
renames System.CRTL.unlink;
---------------------
-- Extra functions --
---------------------
-- These functions supply slightly thicker bindings than those above.
-- They are derived from functions in the C Run-Time Library, but may
-- do a bit more work than just directly calling one of the Library
-- functions.
function file_exists (name : chars) return int;
-- Tests if given name corresponds to an existing file
function is_regular_file (handle : int) return int;
-- Tests if given handle is for a regular file (result 1) or for a
-- non-regular file (pipe or device, result 0).
---------------------------------
-- Control of Text/Binary Mode --
---------------------------------
-- If text_translation_required is true, then the following functions may
-- be used to dynamically switch a file from binary to text mode or vice
-- versa. These functions have no effect if text_translation_required is
-- false (i.e. in normal unix mode). Use fileno to get a stream handle.
procedure set_binary_mode (handle : int);
procedure set_text_mode (handle : int);
----------------------------
-- Full Path Name support --
----------------------------
procedure full_name (nam : chars; buffer : chars);
-- Given a NUL terminated string representing a file name, returns in
-- buffer a NUL terminated string representing the full path name for
-- the file name. On systems where it is relevant the drive is also part
-- of the full path name. It is the responsibility of the caller to
-- pass an actual parameter for buffer that is big enough for any full
-- path name. Use max_path_len given below as the size of buffer.
max_path_len : Integer;
-- Maximum length of an allowable full path name on the system,
-- including a terminating NUL character.
private
-- The following functions are specialized in the body depending on the
-- operating system.
pragma Inline (fread);
pragma Inline (fwrite);
pragma Inline (setvbuf);
pragma Import (C, file_exists, "__gnat_file_exists");
pragma Import (C, is_regular_file, "__gnat_is_regular_file_fd");
pragma Import (C, set_binary_mode, "__gnat_set_binary_mode");
pragma Import (C, set_text_mode, "__gnat_set_text_mode");
pragma Import (C, max_path_len, "__gnat_max_path_len");
pragma Import (C, full_name, "__gnat_full_name");
-- The following may be implemented as macros, and so are supported
-- via an interface function in the a-cstrea.c file.
pragma Import (C, feof, "__gnat_feof");
pragma Import (C, ferror, "__gnat_ferror");
pragma Import (C, fileno, "__gnat_fileno");
pragma Import (C, EOF, "__gnat_constant_eof");
pragma Import (C, IOFBF, "__gnat_constant_iofbf");
pragma Import (C, IOLBF, "__gnat_constant_iolbf");
pragma Import (C, IONBF, "__gnat_constant_ionbf");
pragma Import (C, SEEK_CUR, "__gnat_constant_seek_cur");
pragma Import (C, SEEK_END, "__gnat_constant_seek_end");
pragma Import (C, SEEK_SET, "__gnat_constant_seek_set");
pragma Import (C, L_tmpnam, "__gnat_constant_l_tmpnam");
pragma Import (C, stderr, "__gnat_constant_stderr");
pragma Import (C, stdin, "__gnat_constant_stdin");
pragma Import (C, stdout, "__gnat_constant_stdout");
NULL_Stream : constant FILEs := System.Null_Address;
end Interfaces.C_Streams;
| 38.340659 | 78 | 0.613547 |
03628e0ab51716879fb55aab776706a5333f8648 | 2,746 | ada | Ada | Task/Colour-pinstripe-Display/Ada/colour-pinstripe-display.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2021-05-05T13:42:20.000Z | 2021-05-05T13:42:20.000Z | Task/Colour-pinstripe-Display/Ada/colour-pinstripe-display.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/Colour-pinstripe-Display/Ada/colour-pinstripe-display.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | with SDL.Video.Windows.Makers;
with SDL.Video.Renderers.Makers;
with SDL.Video.Palettes;
with SDL.Events.Events;
procedure Colour_Pinstripe_Display is
Width : constant := 1_200;
Height : constant := 800;
Window : SDL.Video.Windows.Window;
Renderer : SDL.Video.Renderers.Renderer;
Event : SDL.Events.Events.Events;
procedure Draw_Pinstripe (Line_Width : in Integer;
Line_Height : in Integer;
Screen_Width : in Integer;
Y : in Integer)
is
type Colour_Range is (Black, Red, Green, Blue, Magenta, Cyan, Yellow, White);
Colours : constant array (Colour_Range) of SDL.Video.Palettes.Colour
:= (Black => (0, 0, 0, 255), Red => (255, 0, 0, 255),
Green => (0, 255, 0, 255), Blue => (0, 0, 255, 255),
Magenta => (255, 0, 255, 255), Cyan => (0, 255, 255, 255),
Yellow => (255, 255, 0, 255), White => (255, 255, 255, 255));
Col : Colour_Range := Colour_Range'First;
Count : constant Integer := Screen_Width / Line_Width;
begin
for A in 0 .. Count loop
Renderer.Set_Draw_Colour (Colour => Colours (Col));
Renderer.Fill (Rectangle => (X => SDL.C.int (A * Line_Width), Y => SDL.C.int (Y),
Width => SDL.C.int (Line_Width),
Height => SDL.C.int (Line_Height)));
Col := (if Col = Colour_Range'Last
then Colour_Range'First
else Colour_Range'Succ (Col));
end loop;
end Draw_Pinstripe;
procedure Wait is
use type SDL.Events.Event_Types;
begin
loop
while SDL.Events.Events.Poll (Event) loop
if Event.Common.Event_Type = SDL.Events.Quit then
return;
end if;
end loop;
delay 0.100;
end loop;
end Wait;
begin
if not SDL.Initialise (Flags => SDL.Enable_Screen) then
return;
end if;
SDL.Video.Windows.Makers.Create (Win => Window,
Title => "Pinstripe",
Position => SDL.Natural_Coordinates'(X => 10, Y => 10),
Size => SDL.Positive_Sizes'(Width, Height),
Flags => 0);
SDL.Video.Renderers.Makers.Create (Renderer, Window.Get_Surface);
Draw_Pinstripe (1, Height / 4, Width, 0);
Draw_Pinstripe (2, Height / 4, Width, 200);
Draw_Pinstripe (3, Height / 4, Width, 400);
Draw_Pinstripe (4, Height / 4, Width, 600);
Window.Update_Surface;
Wait;
Window.Finalize;
SDL.Finalise;
end Colour_Pinstripe_Display;
| 36.613333 | 91 | 0.540058 |
38f05b2bb43c548871e0f835249f3a43cd94f0f0 | 715 | ads | Ada | src/ascon_definitions.ads | jhumphry/Ascon_SPARK | 3ec888b0f62f7c3afa9c76643551d46703d4a112 | [
"0BSD"
] | 1 | 2020-10-14T08:43:14.000Z | 2020-10-14T08:43:14.000Z | src/ascon_definitions.ads | jhumphry/Ascon_SPARK | 3ec888b0f62f7c3afa9c76643551d46703d4a112 | [
"0BSD"
] | null | null | null | src/ascon_definitions.ads | jhumphry/Ascon_SPARK | 3ec888b0f62f7c3afa9c76643551d46703d4a112 | [
"0BSD"
] | null | null | null | -- Ascon_Definitions
-- Some type / subtype definitions in common use in the Ascon code.
-- As some uses of these types are in generic parameters, it is not possible
-- to hide them.
-- Copyright (c) 2016-2018, James Humphry - see LICENSE file for details
pragma Restrictions(No_Implementation_Attributes,
No_Implementation_Identifiers,
No_Implementation_Units,
No_Obsolescent_Features);
package Ascon_Definitions
with Pure, SPARK_Mode => On is
subtype Rate_Bits is Integer
with Static_Predicate => Rate_Bits in 64 | 128;
subtype Round_Count is Integer range 1..12;
subtype Round_Offset is Integer range 0..11;
end Ascon_Definitions;
| 29.791667 | 76 | 0.713287 |
a0494196294375b10167eca92afaa4d48d8b966e | 6,451 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c5/c55b15a.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/c5/c55b15a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c5/c55b15a.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C55B15A.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 DISCRETE_RANGE OF THE FORM 'ST RANGE L..R'
-- RAISES AN EXCEPTION BECAUSE L OR R IS A NON-STATIC
-- EXPRESSION WHOSE VALUE IS OUTSIDE THE RANGE OF VALUES
-- ASSOCIATED WITH ST (OR BECAUSE ST'FIRST IS NON-STATIC
-- AND L IS STATIC AND LESS THAN ST'FIRST ; SIMILARLY FOR
-- ST'LAST AND R ), CONTROL DOES NOT ENTER THE LOOP.
-- *** NOTE: This test has been modified since ACVC version 1.11 to -- 9X
-- *** remove incompatibilities associated with the transition -- 9X
-- *** to Ada 9X. -- 9X
-- *** -- 9X
-- RM 04/13/81
-- SPS 11/01/82
-- BHS 07/13/84
-- EG 10/28/85 FIX NUMERIC_ERROR/CONSTRAINT_ERROR ACCORDING TO
-- AI-00387.
-- MRM 03/30/93 REMOVED NUMERIC_ERROR FOR 9X COMPATIBILITY
-- GJD 11/15/95 REMOVED CASE OF POTENTIALLY STATICALLY INCOMPATIBLE RANGE.
WITH SYSTEM;
WITH REPORT;
PROCEDURE C55B15A IS
USE REPORT ;
BEGIN
TEST( "C55B15A" , "WHEN 'FOR I IN ST RANGE L..R LOOP' " &
"RAISES AN EXCEPTION, CONTROL DOES NOT ENTER " &
"THE BODY OF THE LOOP" );
-------------------------------------------------------------------
----------------- STATIC (SUB)TYPE, DYNAMIC RANGE -----------------
DECLARE
SUBTYPE ST IS INTEGER RANGE 1..4 ;
FIRST : CONSTANT INTEGER := IDENT_INT( 1) ;
SECOND : CONSTANT INTEGER := IDENT_INT( 2) ;
THIRD : CONSTANT INTEGER := IDENT_INT( 3) ;
FOURTH : CONSTANT INTEGER := IDENT_INT( 4) ;
FIFTH : CONSTANT INTEGER := IDENT_INT( 5) ;
TENTH : CONSTANT INTEGER := IDENT_INT(10) ;
ZEROTH : CONSTANT INTEGER := IDENT_INT( 0) ;
BEGIN
BEGIN
FOR I IN ST RANGE 3..TENTH LOOP
FAILED( "EXCEPTION NOT RAISED (I1)" );
END LOOP;
EXCEPTION
WHEN CONSTRAINT_ERROR => NULL ;
WHEN OTHERS =>
FAILED( "WRONG EXCEPTION RAISED (I1)" );
END ;
BEGIN
FOR I IN ST RANGE 0..THIRD LOOP
FAILED( "EXCEPTION NOT RAISED (I2)" );
END LOOP;
EXCEPTION
WHEN CONSTRAINT_ERROR => NULL ;
WHEN OTHERS =>
FAILED( "WRONG EXCEPTION RAISED (I2)" );
END ;
END ;
-------------------------------------------------------------------
----------------- DYNAMIC (SUB)TYPE, STATIC RANGE -----------------
DECLARE
TYPE ENUM IS ( AMINUS , A,B,C,D,E, F,G,H,I,J );
SUBTYPE ST IS ENUM RANGE ENUM'VAL( IDENT_INT( 1) ) ..
ENUM'VAL( IDENT_INT( 4) ) ;
FIRST : CONSTANT ENUM := A ;
SECOND : CONSTANT ENUM := B ;
THIRD : CONSTANT ENUM := C ;
FOURTH : CONSTANT ENUM := D ;
FIFTH : CONSTANT ENUM := E ;
TENTH : CONSTANT ENUM := J ;
ZEROTH : CONSTANT ENUM := AMINUS ;
BEGIN
BEGIN
FOR I IN ST RANGE C..TENTH LOOP
FAILED( "EXCEPTION NOT RAISED (E1)" );
END LOOP;
EXCEPTION
WHEN CONSTRAINT_ERROR => NULL ;
WHEN OTHERS =>
FAILED( "WRONG EXCEPTION RAISED (E1)" );
END ;
BEGIN
FOR I IN ST RANGE AMINUS..THIRD LOOP
FAILED( "EXCEPTION NOT RAISED (E2)" );
END LOOP;
EXCEPTION
WHEN CONSTRAINT_ERROR => NULL ;
WHEN OTHERS =>
FAILED( "WRONG EXCEPTION RAISED (E2)" );
END ;
END ;
DECLARE
SUBTYPE ST IS CHARACTER RANGE IDENT_CHAR( 'A' ) ..
IDENT_CHAR( 'D' ) ;
FIRST : CONSTANT CHARACTER := 'A' ;
SECOND : CONSTANT CHARACTER := 'B' ;
THIRD : CONSTANT CHARACTER := 'C' ;
FOURTH : CONSTANT CHARACTER := 'D' ;
FIFTH : CONSTANT CHARACTER := 'E' ;
TENTH : CONSTANT CHARACTER := 'J' ;
ZEROTH : CONSTANT CHARACTER := '0' ;--ZERO; PRECEDES LETTERS
BEGIN
BEGIN
FOR I IN ST RANGE 'C'..TENTH LOOP
FAILED( "EXCEPTION NOT RAISED (C1)" );
END LOOP;
EXCEPTION
WHEN CONSTRAINT_ERROR => NULL ;
WHEN OTHERS =>
FAILED( "WRONG EXCEPTION RAISED (C1)" );
END ;
BEGIN
FOR I IN ST RANGE '0'..THIRD LOOP -- ZERO..'C'
FAILED( "EXCEPTION NOT RAISED (C2)" );
END LOOP;
EXCEPTION
WHEN CONSTRAINT_ERROR => NULL ;
WHEN OTHERS =>
FAILED( "WRONG EXCEPTION RAISED (C2)" );
END ;
END ;
RESULT ;
END C55B15A ;
| 31.014423 | 79 | 0.489692 |
5e8d3c62b760104b260c49e1b102d346df0bb54c | 4,326 | ads | Ada | extern/gnat_sdl/gnat_sdl2/src/sdl_timer_h.ads | AdaCore/training_material | 6651eb2c53f8c39649b8e0b3c757bc8ff963025a | [
"CC-BY-4.0"
] | 15 | 2020-10-07T08:56:45.000Z | 2022-02-08T23:13:22.000Z | extern/gnat_sdl/gnat_sdl2/src/sdl_timer_h.ads | AdaCore/training_material | 6651eb2c53f8c39649b8e0b3c757bc8ff963025a | [
"CC-BY-4.0"
] | 20 | 2020-11-05T14:35:20.000Z | 2022-01-13T15:59:33.000Z | extern/gnat_sdl/gnat_sdl2/src/sdl_timer_h.ads | AdaCore/training_material | 6651eb2c53f8c39649b8e0b3c757bc8ff963025a | [
"CC-BY-4.0"
] | 6 | 2020-10-08T15:57:06.000Z | 2021-08-31T12:03:08.000Z | pragma Ada_2005;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
with SDL_stdinc_h;
with System;
package SDL_timer_h is
-- arg-macro: function SDL_TICKS_PASSED (A, B)
-- return (Sint32)((B) - (A)) <= 0;
-- Simple DirectMedia Layer
-- Copyright (C) 1997-2018 Sam Lantinga <[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.
--
--*
-- * \file SDL_timer.h
-- *
-- * Header for the SDL time management routines.
--
-- Set up for C function definitions, even when using C++
--*
-- * \brief Get the number of milliseconds since the SDL library initialization.
-- *
-- * \note This value wraps if the program runs for more than ~49 days.
--
function SDL_GetTicks return SDL_stdinc_h.Uint32; -- ..\SDL2_tmp\SDL_timer.h:45
pragma Import (C, SDL_GetTicks, "SDL_GetTicks");
--*
-- * \brief Compare SDL ticks values, and return true if A has passed B
-- *
-- * e.g. if you want to wait 100 ms, you could do this:
-- * Uint32 timeout = SDL_GetTicks() + 100;
-- * while (!SDL_TICKS_PASSED(SDL_GetTicks(), timeout)) {
-- * ... do work until timeout has elapsed
-- * }
--
--*
-- * \brief Get the current value of the high resolution counter
--
function SDL_GetPerformanceCounter return SDL_stdinc_h.Uint64; -- ..\SDL2_tmp\SDL_timer.h:61
pragma Import (C, SDL_GetPerformanceCounter, "SDL_GetPerformanceCounter");
--*
-- * \brief Get the count per second of the high resolution counter
--
function SDL_GetPerformanceFrequency return SDL_stdinc_h.Uint64; -- ..\SDL2_tmp\SDL_timer.h:66
pragma Import (C, SDL_GetPerformanceFrequency, "SDL_GetPerformanceFrequency");
--*
-- * \brief Wait a specified number of milliseconds before returning.
--
procedure SDL_Delay (ms : SDL_stdinc_h.Uint32); -- ..\SDL2_tmp\SDL_timer.h:71
pragma Import (C, SDL_Delay, "SDL_Delay");
--*
-- * Function prototype for the timer callback function.
-- *
-- * The callback function is passed the current timer interval and returns
-- * the next timer interval. If the returned value is the same as the one
-- * passed in, the periodic alarm continues, otherwise a new alarm is
-- * scheduled. If the callback returns 0, the periodic alarm is cancelled.
--
type SDL_TimerCallback is access function (arg1 : SDL_stdinc_h.Uint32; arg2 : System.Address) return SDL_stdinc_h.Uint32;
pragma Convention (C, SDL_TimerCallback); -- ..\SDL2_tmp\SDL_timer.h:81
--*
-- * Definition of the timer ID type.
--
subtype SDL_TimerID is int; -- ..\SDL2_tmp\SDL_timer.h:86
--*
-- * \brief Add a new timer to the pool of timers already running.
-- *
-- * \return A timer ID, or 0 when an error occurs.
--
function SDL_AddTimer
(interval : SDL_stdinc_h.Uint32;
callback : SDL_TimerCallback;
param : System.Address) return SDL_TimerID; -- ..\SDL2_tmp\SDL_timer.h:93
pragma Import (C, SDL_AddTimer, "SDL_AddTimer");
--*
-- * \brief Remove a timer knowing its ID.
-- *
-- * \return A boolean value indicating success or failure.
-- *
-- * \warning It is not safe to remove a timer multiple times.
--
function SDL_RemoveTimer (id : SDL_TimerID) return SDL_stdinc_h.SDL_bool; -- ..\SDL2_tmp\SDL_timer.h:104
pragma Import (C, SDL_RemoveTimer, "SDL_RemoveTimer");
-- Ends C function definitions when using C++
-- vi: set ts=4 sw=4 expandtab:
end SDL_timer_h;
| 36.05 | 124 | 0.681692 |
19d32cb0d8db954ed747633c3b652fc03498f584 | 2,511 | ads | Ada | tools/xml2ayacc/xml_io/xml_io-readers.ads | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | 4 | 2016-02-05T15:51:56.000Z | 2022-03-25T20:38:32.000Z | tools/xml2ayacc/xml_io/xml_io-readers.ads | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | null | null | null | tools/xml2ayacc/xml_io/xml_io-readers.ads | faelys/gela-asis | 48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253 | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- G E L A A S I S --
-- ASIS implementation for Gela project, a portable Ada compiler --
-- http://gela.ada-ru.org --
-- - - - - - - - - - - - - - - - --
-- Read copyright and license at the end of this file --
------------------------------------------------------------------------------
-- $Revision: 209 $ $Date: 2013-11-30 21:03:24 +0200 (Сб., 30 нояб. 2013) $
with XML_IO.Base_Readers;
package XML_IO.Readers is
new XML_IO.Base_Readers (Character, String, "");
------------------------------------------------------------------------------
-- Copyright (c) 2006-2013, Maxim Reznik
-- All rights reserved.
--
-- Redistribution and use in source and binary forms, with or without
-- modification, are permitted provided that the following conditions are met:
--
-- * Redistributions of source code must retain the above copyright notice,
-- this list of conditions and the following disclaimer.
-- * Redistributions in binary form must reproduce the above copyright
-- notice, this list of conditions and the following disclaimer in the
-- documentation and/or other materials provided with the distribution.
-- * Neither the name of the Maxim Reznik, IE nor the names of its
-- contributors may be used to endorse or promote products derived from
-- this software without specific prior written permission.
--
-- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
-- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
-- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
-- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
-- LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
-- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
-- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
-- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
-- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
-- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
-- POSSIBILITY OF SUCH DAMAGE.
------------------------------------------------------------------------------
| 55.8 | 79 | 0.578256 |
5ec83f070c43c9c6fd99b926460cf2233d62df0b | 6,115 | ads | Ada | source/league/league-stream_element_vectors.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 24 | 2016-11-29T06:59:41.000Z | 2021-08-30T11:55:16.000Z | source/league/league-stream_element_vectors.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 2 | 2019-01-16T05:15:20.000Z | 2019-02-03T10:03:32.000Z | source/league/league-stream_element_vectors.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-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$
------------------------------------------------------------------------------
private with Ada.Finalization;
with Ada.Streams;
private with Matreshka.Internals.Stream_Element_Vectors;
package League.Stream_Element_Vectors is
pragma Preelaborate;
pragma Remote_Types;
type Stream_Element_Vector is tagged private;
pragma Preelaborable_Initialization (Stream_Element_Vector);
Empty_Stream_Element_Vector : constant Stream_Element_Vector;
function To_Stream_Element_Vector
(Item : Ada.Streams.Stream_Element_Array) return Stream_Element_Vector;
function To_Stream_Element_Array
(Item : Stream_Element_Vector) return Ada.Streams.Stream_Element_Array;
function Is_Empty (Self : Stream_Element_Vector) return Boolean;
function Length
(Self : Stream_Element_Vector) return Ada.Streams.Stream_Element_Offset;
procedure Clear (Self : in out Stream_Element_Vector);
function Hash (Self : Stream_Element_Vector) return League.Hash_Type;
-- Returns hash for the data.
function Element
(Self : Stream_Element_Vector'Class;
Index : Ada.Streams.Stream_Element_Offset) return Ada.Streams.Stream_Element;
-- Returns element at the specified position.
procedure Append
(Self : in out Stream_Element_Vector'Class;
Item : Ada.Streams.Stream_Element);
procedure Append
(Self : in out Stream_Element_Vector'Class;
Item : Ada.Streams.Stream_Element_Array);
procedure Append
(Self : in out Stream_Element_Vector'Class;
Item : Stream_Element_Vector'Class);
overriding function "="
(Left : Stream_Element_Vector;
Right : Stream_Element_Vector) return Boolean;
not overriding function "="
(Left : Stream_Element_Vector;
Right : Ada.Streams.Stream_Element_Array) return Boolean;
not overriding function "="
(Left : Ada.Streams.Stream_Element_Array;
Right : Stream_Element_Vector) return Boolean;
private
package MISEV renames Matreshka.Internals.Stream_Element_Vectors;
procedure Read
(Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Item : out Stream_Element_Vector);
procedure Write
(Stream : not null access Ada.Streams.Root_Stream_Type'Class;
Item : Stream_Element_Vector);
type Stream_Element_Vector is new Ada.Finalization.Controlled with record
Data : MISEV.Shared_Stream_Element_Vector_Access
:= MISEV.Empty_Shared_Stream_Element_Vector'Access;
end record;
for Stream_Element_Vector'Read use Read;
for Stream_Element_Vector'Write use Write;
overriding procedure Adjust (Self : in out Stream_Element_Vector);
overriding procedure Finalize (Self : in out Stream_Element_Vector);
Empty_Stream_Element_Vector : constant Stream_Element_Vector
:= (Ada.Finalization.Controlled with Data => <>);
end League.Stream_Element_Vectors;
| 47.403101 | 82 | 0.565004 |
19e40666e3a68c904d3894b5801c9c4b3a181e53 | 8,723 | ads | Ada | arch/ARM/STM32/svd/stm32l0x3/stm32_svd-nvic.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/stm32l0x3/stm32_svd-nvic.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | arch/ARM/STM32/svd/stm32l0x3/stm32_svd-nvic.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | -- This spec has been automatically generated from STM32L0x3.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.NVIC is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype IPR0_PRI_0_Field is HAL.UInt8;
subtype IPR0_PRI_1_Field is HAL.UInt8;
subtype IPR0_PRI_2_Field is HAL.UInt8;
subtype IPR0_PRI_3_Field is HAL.UInt8;
-- Interrupt Priority Register 0
type IPR0_Register is record
-- priority for interrupt 0
PRI_0 : IPR0_PRI_0_Field := 16#0#;
-- priority for interrupt 1
PRI_1 : IPR0_PRI_1_Field := 16#0#;
-- priority for interrupt 2
PRI_2 : IPR0_PRI_2_Field := 16#0#;
-- priority for interrupt 3
PRI_3 : IPR0_PRI_3_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IPR0_Register use record
PRI_0 at 0 range 0 .. 7;
PRI_1 at 0 range 8 .. 15;
PRI_2 at 0 range 16 .. 23;
PRI_3 at 0 range 24 .. 31;
end record;
subtype IPR1_PRI_4_Field is HAL.UInt8;
subtype IPR1_PRI_5_Field is HAL.UInt8;
subtype IPR1_PRI_6_Field is HAL.UInt8;
subtype IPR1_PRI_7_Field is HAL.UInt8;
-- Interrupt Priority Register 1
type IPR1_Register is record
-- priority for interrupt n
PRI_4 : IPR1_PRI_4_Field := 16#0#;
-- priority for interrupt n
PRI_5 : IPR1_PRI_5_Field := 16#0#;
-- priority for interrupt n
PRI_6 : IPR1_PRI_6_Field := 16#0#;
-- priority for interrupt n
PRI_7 : IPR1_PRI_7_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IPR1_Register use record
PRI_4 at 0 range 0 .. 7;
PRI_5 at 0 range 8 .. 15;
PRI_6 at 0 range 16 .. 23;
PRI_7 at 0 range 24 .. 31;
end record;
subtype IPR2_PRI_8_Field is HAL.UInt8;
subtype IPR2_PRI_9_Field is HAL.UInt8;
subtype IPR2_PRI_10_Field is HAL.UInt8;
subtype IPR2_PRI_11_Field is HAL.UInt8;
-- Interrupt Priority Register 2
type IPR2_Register is record
-- priority for interrupt n
PRI_8 : IPR2_PRI_8_Field := 16#0#;
-- priority for interrupt n
PRI_9 : IPR2_PRI_9_Field := 16#0#;
-- priority for interrupt n
PRI_10 : IPR2_PRI_10_Field := 16#0#;
-- priority for interrupt n
PRI_11 : IPR2_PRI_11_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IPR2_Register use record
PRI_8 at 0 range 0 .. 7;
PRI_9 at 0 range 8 .. 15;
PRI_10 at 0 range 16 .. 23;
PRI_11 at 0 range 24 .. 31;
end record;
subtype IPR3_PRI_12_Field is HAL.UInt8;
subtype IPR3_PRI_13_Field is HAL.UInt8;
subtype IPR3_PRI_14_Field is HAL.UInt8;
subtype IPR3_PRI_15_Field is HAL.UInt8;
-- Interrupt Priority Register 3
type IPR3_Register is record
-- priority for interrupt n
PRI_12 : IPR3_PRI_12_Field := 16#0#;
-- priority for interrupt n
PRI_13 : IPR3_PRI_13_Field := 16#0#;
-- priority for interrupt n
PRI_14 : IPR3_PRI_14_Field := 16#0#;
-- priority for interrupt n
PRI_15 : IPR3_PRI_15_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IPR3_Register use record
PRI_12 at 0 range 0 .. 7;
PRI_13 at 0 range 8 .. 15;
PRI_14 at 0 range 16 .. 23;
PRI_15 at 0 range 24 .. 31;
end record;
subtype IPR4_PRI_16_Field is HAL.UInt8;
subtype IPR4_PRI_17_Field is HAL.UInt8;
subtype IPR4_PRI_18_Field is HAL.UInt8;
subtype IPR4_PRI_19_Field is HAL.UInt8;
-- Interrupt Priority Register 4
type IPR4_Register is record
-- priority for interrupt n
PRI_16 : IPR4_PRI_16_Field := 16#0#;
-- priority for interrupt n
PRI_17 : IPR4_PRI_17_Field := 16#0#;
-- priority for interrupt n
PRI_18 : IPR4_PRI_18_Field := 16#0#;
-- priority for interrupt n
PRI_19 : IPR4_PRI_19_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IPR4_Register use record
PRI_16 at 0 range 0 .. 7;
PRI_17 at 0 range 8 .. 15;
PRI_18 at 0 range 16 .. 23;
PRI_19 at 0 range 24 .. 31;
end record;
subtype IPR5_PRI_20_Field is HAL.UInt8;
subtype IPR5_PRI_21_Field is HAL.UInt8;
subtype IPR5_PRI_22_Field is HAL.UInt8;
subtype IPR5_PRI_23_Field is HAL.UInt8;
-- Interrupt Priority Register 5
type IPR5_Register is record
-- priority for interrupt n
PRI_20 : IPR5_PRI_20_Field := 16#0#;
-- priority for interrupt n
PRI_21 : IPR5_PRI_21_Field := 16#0#;
-- priority for interrupt n
PRI_22 : IPR5_PRI_22_Field := 16#0#;
-- priority for interrupt n
PRI_23 : IPR5_PRI_23_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IPR5_Register use record
PRI_20 at 0 range 0 .. 7;
PRI_21 at 0 range 8 .. 15;
PRI_22 at 0 range 16 .. 23;
PRI_23 at 0 range 24 .. 31;
end record;
subtype IPR6_PRI_24_Field is HAL.UInt8;
subtype IPR6_PRI_25_Field is HAL.UInt8;
subtype IPR6_PRI_26_Field is HAL.UInt8;
subtype IPR6_PRI_27_Field is HAL.UInt8;
-- Interrupt Priority Register 6
type IPR6_Register is record
-- priority for interrupt n
PRI_24 : IPR6_PRI_24_Field := 16#0#;
-- priority for interrupt n
PRI_25 : IPR6_PRI_25_Field := 16#0#;
-- priority for interrupt n
PRI_26 : IPR6_PRI_26_Field := 16#0#;
-- priority for interrupt n
PRI_27 : IPR6_PRI_27_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IPR6_Register use record
PRI_24 at 0 range 0 .. 7;
PRI_25 at 0 range 8 .. 15;
PRI_26 at 0 range 16 .. 23;
PRI_27 at 0 range 24 .. 31;
end record;
subtype IPR7_PRI_28_Field is HAL.UInt8;
subtype IPR7_PRI_29_Field is HAL.UInt8;
subtype IPR7_PRI_30_Field is HAL.UInt8;
subtype IPR7_PRI_31_Field is HAL.UInt8;
-- Interrupt Priority Register 7
type IPR7_Register is record
-- priority for interrupt n
PRI_28 : IPR7_PRI_28_Field := 16#0#;
-- priority for interrupt n
PRI_29 : IPR7_PRI_29_Field := 16#0#;
-- priority for interrupt n
PRI_30 : IPR7_PRI_30_Field := 16#0#;
-- priority for interrupt n
PRI_31 : IPR7_PRI_31_Field := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for IPR7_Register use record
PRI_28 at 0 range 0 .. 7;
PRI_29 at 0 range 8 .. 15;
PRI_30 at 0 range 16 .. 23;
PRI_31 at 0 range 24 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Nested Vectored Interrupt Controller
type NVIC_Peripheral is record
-- Interrupt Set Enable Register
ISER : aliased HAL.UInt32;
-- Interrupt Clear Enable Register
ICER : aliased HAL.UInt32;
-- Interrupt Set-Pending Register
ISPR : aliased HAL.UInt32;
-- Interrupt Clear-Pending Register
ICPR : aliased HAL.UInt32;
-- Interrupt Priority Register 0
IPR0 : aliased IPR0_Register;
-- Interrupt Priority Register 1
IPR1 : aliased IPR1_Register;
-- Interrupt Priority Register 2
IPR2 : aliased IPR2_Register;
-- Interrupt Priority Register 3
IPR3 : aliased IPR3_Register;
-- Interrupt Priority Register 4
IPR4 : aliased IPR4_Register;
-- Interrupt Priority Register 5
IPR5 : aliased IPR5_Register;
-- Interrupt Priority Register 6
IPR6 : aliased IPR6_Register;
-- Interrupt Priority Register 7
IPR7 : aliased IPR7_Register;
end record
with Volatile;
for NVIC_Peripheral use record
ISER at 16#0# range 0 .. 31;
ICER at 16#80# range 0 .. 31;
ISPR at 16#100# range 0 .. 31;
ICPR at 16#180# range 0 .. 31;
IPR0 at 16#300# range 0 .. 31;
IPR1 at 16#304# range 0 .. 31;
IPR2 at 16#308# range 0 .. 31;
IPR3 at 16#30C# range 0 .. 31;
IPR4 at 16#310# range 0 .. 31;
IPR5 at 16#314# range 0 .. 31;
IPR6 at 16#318# range 0 .. 31;
IPR7 at 16#31C# range 0 .. 31;
end record;
-- Nested Vectored Interrupt Controller
NVIC_Periph : aliased NVIC_Peripheral
with Import, Address => System'To_Address (16#E000E100#);
end STM32_SVD.NVIC;
| 31.377698 | 65 | 0.641408 |
033c219b98cf9fc2724208cacd13d025656741d1 | 499 | adb | Ada | tests/examplefiles/ada/test_ada2022.adb | kuenzign/pygments | 76a002e3cd52b022834ef1f88746fb828afb88c8 | [
"BSD-2-Clause"
] | null | null | null | tests/examplefiles/ada/test_ada2022.adb | kuenzign/pygments | 76a002e3cd52b022834ef1f88746fb828afb88c8 | [
"BSD-2-Clause"
] | 1,242 | 2019-08-31T16:03:19.000Z | 2019-08-31T18:00:46.000Z | tests/examplefiles/ada/test_ada2022.adb | kuenzign/pygments | 76a002e3cd52b022834ef1f88746fb828afb88c8 | [
"BSD-2-Clause"
] | 1 | 2019-10-04T01:56:03.000Z | 2019-10-04T01:56:03.000Z | with Ada.Text_IO; use Ada.Text_IO;
with Ada.Containers.Vectors;
procedure Test_Ada2022 is
package Integer_Vectors is new
Ada.Containers.Vectors
(Index_Type => Natural,
Element_Type => Integer);
use Integer_Vectors;
procedure Increment_All (V : in out Vector) is
begin
for E of V loop
E := @ + 1;
end loop;
end Increment_All;
V : Vector := [0, 0, 0];
begin
Increment_All (V);
Put_Line (V'Image);
end Test_Ada2022;
| 17.821429 | 49 | 0.621242 |
5e44ccbd3d451302c26451f99786e6f17bd71bfd | 6,569 | adb | Ada | src/dw1000-ranging-double_sided.adb | SALLYPEMDAS/DW1000 | ce2906596e479c83ce64673e8e7cf03856c45523 | [
"MIT"
] | 9 | 2016-07-06T21:26:41.000Z | 2020-11-22T11:21:58.000Z | src/dw1000-ranging-double_sided.adb | hao122065175/DW1000 | ce2906596e479c83ce64673e8e7cf03856c45523 | [
"MIT"
] | 1 | 2018-06-19T15:20:41.000Z | 2018-06-19T21:14:31.000Z | src/dw1000-ranging-double_sided.adb | hao122065175/DW1000 | ce2906596e479c83ce64673e8e7cf03856c45523 | [
"MIT"
] | 4 | 2018-07-18T03:35:25.000Z | 2020-11-22T11:21:59.000Z | -------------------------------------------------------------------------------
-- Copyright (c) 2016 Daniel King
--
-- 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 DW1000.Types; use DW1000.Types;
package body DW1000.Ranging.Double_Sided
with SPARK_Mode => On
is
------------------------
-- Compute_Distance --
------------------------
function Compute_Distance
(Tag_Tx_Poll_Timestamp : in Fine_System_Time;
Anchor_Rx_Poll_Timestamp : in Fine_System_Time;
Anchor_Tx_Resp_Timestamp : in Fine_System_Time;
Tag_Rx_Resp_Timestamp : in Fine_System_Time;
Tag_Tx_Final_Timestamp : in Fine_System_Time;
Anchor_Rx_Final_Timestamp : in Fine_System_Time) return Biased_Distance is
Max_Time_Of_Flight : constant := 0.000_1;
-- Limit the Time of Flight to a maximum of 0.000_1 seconds (100 us).
--
-- This prevents overflow during the conversion from time of flight
-- to distance.
--
-- This limits the maximum computable distance to 2990 meters, but this
-- should be plenty as the operational range of the DW1000 is about
-- 10 times below this limit (300 m).
type System_Time_Span_Div2 is
delta System_Time_Span'Delta / 2.0
range 0.0 .. System_Time_Span'Last -- need the same range as System_Time_Span
with Small => System_Time_Span'Small / 2.0;
type System_Time_Span_Div4 is
delta System_Time_Span'Delta / 4.0
range 0.0 .. System_Time_Span'Last / 2.0
with Small => System_Time_Span'Small / 4.0;
type Large_Meters is
delta Meters'Delta
range 0.0 .. (Max_Time_Of_Flight / System_Time_Span_Div4'Delta) * Speed_Of_Light_In_Vacuum;
-- A fixed-point type with a large enough integer part to store the
-- integer representation of a System_Time_Span_Div4 value.
T_Roundtrip1 : constant System_Time_Span := Calculate_Span
(Start_Time => Tag_Tx_Poll_Timestamp,
End_Time => Tag_Rx_Resp_Timestamp);
T_Reply1 : constant System_Time_Span := Calculate_Span
(Start_Time => Anchor_Rx_Poll_Timestamp,
End_Time => Anchor_Tx_Resp_Timestamp);
T_Roundtrip2 : constant System_Time_Span := Calculate_Span
(Start_Time => Anchor_Tx_Resp_Timestamp,
End_Time => Anchor_Rx_Final_Timestamp);
T_Reply2 : constant System_Time_Span := Calculate_Span
(Start_Time => Tag_Rx_Resp_Timestamp,
End_Time => Tag_Tx_Final_Timestamp);
Time_Of_Flight_1 : System_Time_Span_Div2;
Time_Of_Flight_2 : System_Time_Span_Div2;
Time_Of_Flight : System_Time_Span_Div4;
Diff : System_Time_Span;
Sum : System_Time_Span_Div2;
Result : Large_Meters;
begin
if (T_Reply1 > T_Roundtrip1) or (T_Reply2 > T_Roundtrip2) then
Time_Of_Flight := 0.0;
else
Diff := T_Roundtrip1 - T_Reply1;
Time_Of_Flight_1 := System_Time_Span_Div2 (Diff / System_Time_Span (2.0));
Diff := T_Roundtrip2 - T_Reply2;
Time_Of_Flight_2 := System_Time_Span_Div2 (Diff / System_Time_Span (2.0));
Sum := Time_Of_Flight_1 + Time_Of_Flight_2;
Time_Of_Flight := System_Time_Span_Div4 (Sum / System_Time_Span_Div4 (2.0));
end if;
-- Cap ToF to 0.01 seconds to avoid overflow in the following calculations.
if Time_Of_Flight >= Max_Time_Of_Flight then
Time_Of_Flight := Max_Time_Of_Flight;
end if;
pragma Assert_And_Cut (Time_Of_Flight <= Max_Time_Of_Flight);
-- Convert the fixed-point representation to its integer represention
-- (in multiples of the 'Delta).
Result := Large_Meters (Time_Of_Flight / System_Time_Span_Div4 (System_Time_Span_Div4'Delta));
-- Multiply the ToF (s) with the speed of light (m/s) to yield
-- the distance (m) in meters.
Result := Result * Large_Meters (Speed_Of_Light_In_Vacuum);
-- Convert back from integer representation to fixed-point representation.
Result := Result / Large_Meters (1.0 / System_Time_Span_Div4'Delta);
return Biased_Distance (Result);
end Compute_Distance;
------------------------
-- Compute_Distance --
------------------------
function Compute_Distance
(Tag_Tx_Poll_Timestamp : in Fine_System_Time;
Anchor_Rx_Poll_Timestamp : in Fine_System_Time;
Anchor_Tx_Resp_Timestamp : in Fine_System_Time;
Tag_Rx_Resp_Timestamp : in Fine_System_Time;
Tag_Tx_Final_Timestamp : in Fine_System_Time;
Anchor_Rx_Final_Timestamp : in Fine_System_Time;
Channel : in DW1000.Driver.Channel_Number;
PRF : in DW1000.Driver.PRF_Type) return Meters is
Distance_With_Bias : Biased_Distance;
begin
Distance_With_Bias := Compute_Distance
(Tag_Tx_Poll_Timestamp => Tag_Tx_Poll_Timestamp,
Anchor_Rx_Poll_Timestamp => Anchor_Rx_Poll_Timestamp,
Anchor_Tx_Resp_Timestamp => Anchor_Tx_Resp_Timestamp,
Tag_Rx_Resp_Timestamp => Tag_Rx_Resp_Timestamp,
Tag_Tx_Final_Timestamp => Tag_Tx_Final_Timestamp,
Anchor_Rx_Final_Timestamp => Anchor_Rx_Final_Timestamp);
return Remove_Ranging_Bias
(Measured_Distance => Distance_With_Bias,
Channel => Channel,
PRF => PRF);
end Compute_Distance;
end DW1000.Ranging.Double_Sided;
| 41.314465 | 100 | 0.670117 |
033ccde02594cfad26ce4f5be21004b0f73d0f65 | 3,019 | adb | Ada | data/github.com/morbos/STM32/2f87e26aacdf90ba9d8d1ca64ae12d2c8528a964/WB/WB55/client_wb55/src/comm/comm-shci.adb | ajnavarro/language-dataset | 34e2980af98ff2ded500619edce3e0907a6e9050 | [
"MIT"
] | 9 | 2018-08-07T11:54:33.000Z | 2022-03-11T09:48:45.000Z | data/github.com/morbos/STM32/2f87e26aacdf90ba9d8d1ca64ae12d2c8528a964/WB/WB55/client_wb55/src/comm/comm-shci.adb | ajnavarro/language-dataset | 34e2980af98ff2ded500619edce3e0907a6e9050 | [
"MIT"
] | 91 | 2019-11-11T15:41:26.000Z | 2022-03-21T04:17:18.000Z | data/github.com/morbos/STM32/2f87e26aacdf90ba9d8d1ca64ae12d2c8528a964/WB/WB55/client_wb55/src/comm/comm-shci.adb | ajnavarro/language-dataset | 34e2980af98ff2ded500619edce3e0907a6e9050 | [
"MIT"
] | 3 | 2019-11-13T12:44:41.000Z | 2022-01-06T19:34:26.000Z | with System;
with Comm.TL; use Comm.TL;
with Comm.Mbox; use Comm.Mbox;
with STM32.IPCC; use STM32.IPCC;
with Memory; use Memory;
with Log; use Log;
package body Comm.Shci is
Ble_Init_Cmd_Packet : SHCI_C2_Ble_Init_Cmd_Packet_T :=
(Header => (others => 0),
Param => (PBleBufferAddress => 0,
BleBufferSize => 0,
NumAttrRecord => CFG_BLE_NUM_GATT_ATTRIBUTES,
NumAttrServ => CFG_BLE_NUM_GATT_SERVICES,
AttrValueArrSize => CFG_BLE_ATT_VALUE_ARRAY_SIZE,
NumOfLinks => CFG_BLE_NUM_LINK,
ExtendedPacketLengthEnable => CFG_BLE_DATA_LENGTH_EXTENSION,
PrWriteListSize => CFG_BLE_PREPARE_WRITE_LIST_SIZE,
MblockCount => CFG_BLE_MBLOCK_COUNT,
AttMtu => CFG_BLE_MAX_ATT_MTU,
SlaveSca => CFG_BLE_SLAVE_SCA,
MasterSca => CFG_BLE_MASTER_SCA,
LsSource => CFG_BLE_LSE_SOURCE,
MaxConnEventLength => CFG_BLE_MAX_CONN_EVENT_LENGTH,
HsStartupTime => CFG_BLE_HSE_STARTUP_TIME,
ViterbiEnable => CFG_BLE_VITERBI_MODE,
LlOnly => CFG_BLE_LL_ONLY,
HwVersion => 0));
function SHCI_C2_BLE_Init return UInt8
is
Code : Opcode_Field;
Param : aliased SHCI_C2_Ble_Init_Cmd_Param_T := Ble_Init_Cmd_Packet.Param;
Sz : Integer := Param'Size / 8;
Buff : UInt8_Array (1 .. Sz);
for Buff'Address use Param'Address;
Syscmd : TL_CmdPacket_T
with Volatile, Address => System'To_Address (16#2003_06e8#);
EvtPacket : TL_EvtPacket_T;
SyscmdRsp : DataBuffT
with Volatile, Address => System'To_Address (16#2003_06e8#);
for EvtPacket'Address use SyscmdRsp'Address;
for EvtPacket'Alignment use 1;
CcEvt : TL_CcEvt_T;
for CcEvt'Address use SyscmdRsp (1 + (EvtPacket'Size / 8))'Address;
for CcEvt'Alignment use 1;
begin
Code.Result := SHCI_OPCODE_C2_BLE_INIT;
Syscmd.Cmdserial.Cmd.Cmdcode := Code.Val;
Syscmd.Cmdserial.Cmd.Plen := UInt8 (Sz);
for I in 1 .. Sz loop
Syscmd.Cmdserial.Cmd.Payload (I) := Buff (I);
end loop;
Syscmd.Cmdserial.Type_Code := TL_SYSCMD_PKT_TYPE;
IPCC_Cpu1_EnableReceiveChannel (HW_IPCC_SYSTEM_CMD_RSP_CHANNEL);
IPCC_Cpu1_SetFlag (HW_IPCC_SYSTEM_CMD_RSP_CHANNEL);
Suspend_Until_True (IPCC_SYSTEM_EVENT_SO);
return SyscmdRsp (1 + (EvtPacket'Size / 8) + (CcEvt'Size / 8));
end SHCI_C2_BLE_Init;
procedure Initialize_Shci
is
begin
if SHCI_C2_BLE_Init /= 0 then
raise Program_Error with "SHCI_C2_BLE_Init";
end if;
Enable_Log;
end Initialize_Shci;
end Comm.Shci;
| 39.207792 | 80 | 0.587281 |
5e40216bdd9d983a6acac6867b14bdf0e90775fa | 4,773 | adb | Ada | src/postgresql/pq-perfect_hash.adb | My-Colaborations/ada-ado | cebf1f9b38c0c259c44935e8bca05a5bff12aace | [
"Apache-2.0"
] | null | null | null | src/postgresql/pq-perfect_hash.adb | My-Colaborations/ada-ado | cebf1f9b38c0c259c44935e8bca05a5bff12aace | [
"Apache-2.0"
] | null | null | null | src/postgresql/pq-perfect_hash.adb | My-Colaborations/ada-ado | cebf1f9b38c0c259c44935e8bca05a5bff12aace | [
"Apache-2.0"
] | null | null | null | -- Generated by gperfhash
with Util.Strings.Transforms;
with Interfaces; use Interfaces;
package body PQ.Perfect_Hash is
P : constant array (0 .. 11) of Natural :=
(1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13);
T1 : constant array (0 .. 11) of Unsigned_16 :=
(458, 26, 756, 54, 156, 452, 817, 805, 671, 438, 702, 309);
T2 : constant array (0 .. 11) of Unsigned_16 :=
(535, 198, 250, 162, 35, 640, 58, 730, 487, 363, 193, 648);
G : constant array (0 .. 832) of Unsigned_16 :=
(366, 0, 96, 0, 0, 0, 0, 0, 0, 108, 0, 248, 367, 192, 0, 119, 0, 3,
259, 0, 31, 230, 0, 0, 0, 0, 0, 202, 0, 0, 243, 0, 0, 0, 0, 7, 104, 0,
0, 0, 0, 0, 322, 0, 0, 279, 0, 0, 301, 0, 290, 169, 0, 211, 44, 0, 0,
134, 0, 0, 358, 200, 309, 0, 69, 410, 0, 0, 0, 0, 0, 8, 305, 0, 0, 0,
228, 0, 0, 0, 46, 302, 0, 0, 0, 0, 288, 0, 0, 0, 0, 0, 74, 339, 0, 90,
0, 0, 0, 0, 0, 0, 0, 0, 0, 163, 0, 0, 0, 0, 0, 103, 0, 0, 267, 68, 0,
0, 83, 0, 0, 0, 0, 0, 381, 71, 0, 261, 249, 204, 96, 278, 0, 0, 0, 0,
0, 117, 41, 0, 156, 339, 0, 0, 0, 0, 13, 0, 0, 0, 98, 0, 0, 0, 0, 2,
73, 0, 30, 69, 272, 0, 26, 0, 0, 220, 0, 20, 0, 127, 0, 0, 0, 0, 0,
199, 0, 148, 37, 340, 0, 0, 0, 0, 0, 56, 0, 0, 0, 0, 136, 0, 65, 146,
301, 16, 0, 200, 0, 0, 0, 0, 0, 223, 111, 0, 0, 0, 0, 0, 0, 275, 319,
6, 0, 200, 0, 0, 0, 28, 225, 0, 0, 152, 13, 325, 256, 92, 0, 33, 235,
0, 307, 276, 187, 0, 37, 0, 0, 163, 324, 94, 0, 406, 0, 0, 132, 0, 0,
0, 0, 0, 0, 0, 0, 53, 0, 0, 313, 239, 105, 365, 0, 0, 0, 0, 120, 0, 0,
373, 403, 100, 227, 0, 0, 100, 376, 0, 0, 0, 0, 90, 0, 0, 150, 0, 41,
0, 0, 0, 88, 242, 0, 94, 0, 0, 0, 0, 0, 299, 101, 256, 0, 217, 0, 0,
0, 54, 261, 0, 0, 135, 24, 145, 236, 371, 67, 0, 0, 69, 0, 166, 0, 0,
0, 61, 91, 0, 80, 413, 269, 0, 0, 0, 0, 268, 228, 30, 111, 229, 243,
267, 236, 0, 0, 40, 414, 42, 0, 401, 305, 0, 33, 0, 171, 342, 287,
130, 0, 348, 0, 338, 320, 290, 139, 0, 0, 205, 248, 0, 0, 243, 56, 0,
214, 0, 0, 0, 0, 0, 249, 0, 0, 48, 117, 381, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 17, 358, 0, 270, 0, 401, 109, 94, 0, 0, 0, 0, 0, 7, 0, 5, 173,
0, 0, 343, 116, 0, 284, 0, 0, 51, 381, 79, 312, 146, 154, 217, 0, 0,
0, 0, 32, 23, 120, 0, 156, 0, 21, 0, 217, 237, 0, 151, 365, 0, 0, 0,
258, 378, 0, 387, 0, 34, 116, 0, 13, 212, 115, 0, 0, 406, 0, 0, 333,
0, 1, 0, 256, 0, 0, 0, 0, 23, 283, 218, 407, 27, 0, 4, 0, 0, 260, 0,
82, 115, 18, 363, 0, 226, 112, 237, 132, 62, 0, 0, 0, 0, 143, 296, 43,
285, 131, 16, 386, 0, 129, 0, 96, 0, 0, 79, 388, 30, 390, 0, 404, 0,
0, 100, 130, 0, 0, 381, 1, 341, 0, 52, 0, 173, 0, 0, 103, 352, 0, 0,
145, 363, 0, 0, 0, 49, 251, 201, 0, 182, 375, 382, 0, 97, 284, 121, 0,
3, 0, 0, 267, 0, 1, 336, 0, 0, 405, 243, 127, 68, 0, 0, 299, 0, 0, 0,
0, 25, 0, 169, 0, 103, 0, 277, 24, 0, 102, 0, 337, 253, 0, 0, 0, 0,
281, 36, 0, 308, 337, 88, 0, 0, 0, 0, 107, 359, 310, 0, 0, 0, 104, 0,
0, 35, 114, 0, 0, 37, 175, 232, 0, 336, 158, 288, 0, 0, 269, 0, 0, 90,
134, 0, 0, 367, 0, 281, 0, 346, 252, 62, 0, 358, 0, 317, 389, 0, 254,
0, 67, 165, 398, 0, 0, 0, 167, 0, 0, 94, 0, 45, 389, 0, 0, 307, 0,
344, 0, 0, 144, 174, 0, 75, 0, 0, 381, 0, 4, 74, 303, 188, 0, 21, 379,
0, 0, 0, 0, 0, 258, 270, 310, 353, 0, 185, 91, 353, 108, 0, 295, 56,
365, 341, 108, 19, 0, 0, 0, 0, 96, 266, 0, 0, 285, 211, 0, 104, 0, 0,
298, 0, 74, 71, 0, 108, 0, 0, 48, 47, 294, 349, 0, 160, 130, 0, 320,
277, 0, 0, 0, 386, 233, 268, 413, 153, 12, 26, 0, 222, 293, 45, 0,
267, 249, 47, 0, 0, 265, 257, 0, 0, 0, 377, 0, 0, 150, 0, 279, 192, 0,
287, 0, 169, 273, 276, 38, 79, 90, 218, 0, 378, 0, 0, 0, 386, 367, 0,
149, 0, 278, 0, 295, 106, 321, 334, 107, 165, 31, 0, 366, 316, 0, 0,
0, 296, 0, 191, 71, 36, 0, 0, 0, 0, 0, 376, 0, 243, 84, 349, 349, 0,
0, 0, 0, 0, 413, 0, 69, 374, 215, 0, 265, 274, 47, 245, 63, 110, 379);
function Hash (S : String) return Natural is
F : constant Natural := S'First - 1;
L : constant Natural := S'Length;
F1, F2 : Natural := 0;
J : Natural;
begin
for K in P'Range loop
exit when L < P (K);
J := Character'Pos (S (P (K) + F));
F1 := (F1 + Natural (T1 (K)) * J) mod 833;
F2 := (F2 + Natural (T2 (K)) * J) mod 833;
end loop;
return (Natural (G (F1)) + Natural (G (F2))) mod 416;
end Hash;
-- Returns true if the string <b>S</b> is a keyword.
function Is_Keyword (S : in String) return Boolean is
K : constant String := Util.Strings.Transforms.To_Upper_Case (S);
H : constant Natural := Hash (K);
begin
return Keywords (H).all = K;
end Is_Keyword;
end PQ.Perfect_Hash;
| 54.862069 | 76 | 0.475801 |
9adaf010818a22f405d4748dbbfc6eb28a7f8ccf | 665 | adb | Ada | src/apsepp-output_class-standard.adb | thierr26/ada-apsepp | 6eb87079ea57707db4ee1e2215fa170af66b1913 | [
"MIT"
] | null | null | null | src/apsepp-output_class-standard.adb | thierr26/ada-apsepp | 6eb87079ea57707db4ee1e2215fa170af66b1913 | [
"MIT"
] | null | null | null | src/apsepp-output_class-standard.adb | thierr26/ada-apsepp | 6eb87079ea57707db4ee1e2215fa170af66b1913 | [
"MIT"
] | null | null | null | -- Copyright (C) 2019 Thierry Rascle <[email protected]>
-- MIT license. Please refer to the LICENSE file.
with Ada.Text_IO;
package body Apsepp.Output_Class.Standard is
----------------------------------------------------------------------------
protected body Output_Standard is
-----------------------------------------------------
procedure Put_Line (S : String) is
begin
Ada.Text_IO.Put_Line (S);
end Put_Line;
-----------------------------------------------------
end Output_Standard;
----------------------------------------------------------------------------
end Apsepp.Output_Class.Standard;
| 22.931034 | 79 | 0.404511 |
5e644ba6ee3511b11c5e022c7fe97d3b8685e4dc | 879 | ads | Ada | orka_plugin_gltf/src/orka-resources-models-gltf.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 52 | 2016-07-30T23:00:28.000Z | 2022-02-05T11:54:55.000Z | orka_plugin_gltf/src/orka-resources-models-gltf.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 79 | 2016-08-01T18:36:48.000Z | 2022-02-27T12:14:20.000Z | orka_plugin_gltf/src/orka-resources-models-gltf.ads | onox/orka | 9edf99559a16ffa96dfdb208322f4d18efbcbac6 | [
"Apache-2.0"
] | 4 | 2018-04-28T22:36:26.000Z | 2020-11-14T23:00:29.000Z | -- SPDX-License-Identifier: Apache-2.0
--
-- Copyright (c) 2016 onox <[email protected]>
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
with Orka.Resources.Loaders;
with Orka.Resources.Managers;
package Orka.Resources.Models.glTF is
function Create_Loader (Manager : Managers.Manager_Ptr) return Loaders.Loader_Ptr;
end Orka.Resources.Models.glTF;
| 35.16 | 85 | 0.74744 |
030c5e61c4c7d405f7d584e5f5959e606e37f9c5 | 2,564 | ads | Ada | source/s-refcou.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 33 | 2015-04-04T09:19:36.000Z | 2021-11-10T05:33:34.000Z | source/s-refcou.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 8 | 2017-11-14T13:05:07.000Z | 2018-08-09T15:28:49.000Z | source/s-refcou.ads | ytomino/drake | 4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2 | [
"MIT"
] | 9 | 2015-02-03T17:09:53.000Z | 2021-11-12T01:16:05.000Z | pragma License (Unrestricted);
-- implementation unit
with System.Storage_Elements;
package System.Reference_Counting is
pragma Pure;
type Counter is mod 2 ** 32;
for Counter'Size use 32;
pragma Atomic (Counter);
Static : constant := 2 ** 32 - 1;
-- This should be untyped.
-- A typed atomic constant disables static elaboration.
type Data_Access is access all Counter;
for Data_Access'Storage_Size use 0;
function Shared (Data : not null Data_Access) return Boolean
with Convention => Intrinsic;
pragma Inline_Always (Shared);
subtype Container is
not null Data_Access; -- should be initialized with a sentinel
procedure Adjust (
Target : not null access Container);
procedure Assign (
Target : not null access Container;
Source : not null access constant Container;
Free : not null access procedure (Object : in out Data_Access));
procedure Clear (
Target : not null access Container;
Free : not null access procedure (Object : in out Data_Access));
procedure Move (
Target : not null access Container;
Source : not null access Container;
Sentinel : not null Data_Access;
Free : not null access procedure (Object : in out Data_Access));
subtype Length_Type is Storage_Elements.Storage_Count;
procedure Unique (
Target : not null access Container;
Target_Length : Length_Type;
Target_Capacity : Length_Type;
New_Length : Length_Type;
New_Capacity : Length_Type;
Sentinel : not null Data_Access;
Reallocate : not null access procedure (
Target : aliased in out not null Data_Access;
Length : Length_Type; -- copying length
Max_Length : Length_Type; -- new length
Capacity : Length_Type);
Copy : not null access procedure (
Target : out not null Data_Access;
Source : not null Data_Access;
Length : Length_Type; -- copying length
Max_Length : Length_Type; -- new length
Capacity : Length_Type);
Free : not null access procedure (Object : in out Data_Access));
procedure In_Place_Set_Length (
Target_Data : not null Data_Access;
Target_Length : Length_Type;
Target_Max_Length : aliased in out Length_Type; -- may be updated
Target_Capacity : Length_Type;
New_Length : Length_Type;
Failure : out Boolean) -- reallocation is needed
with Convention => Intrinsic;
pragma Inline_Always (In_Place_Set_Length);
end System.Reference_Counting;
| 33.736842 | 71 | 0.682527 |
19ae29e1f0bcfb27c791ec64b20d2e32dabfde6d | 1,206 | ads | Ada | source/oasis/program-elements-null_components.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/oasis/program-elements-null_components.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/oasis/program-elements-null_components.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | 2 | 2019-09-14T23:18:50.000Z | 2019-10-02T10:11:40.000Z | -- Copyright (c) 2019 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Program.Elements.Definitions;
with Program.Lexical_Elements;
package Program.Elements.Null_Components is
pragma Pure (Program.Elements.Null_Components);
type Null_Component is
limited interface and Program.Elements.Definitions.Definition;
type Null_Component_Access is access all Null_Component'Class
with Storage_Size => 0;
type Null_Component_Text is limited interface;
type Null_Component_Text_Access is access all Null_Component_Text'Class
with Storage_Size => 0;
not overriding function To_Null_Component_Text
(Self : aliased in out Null_Component)
return Null_Component_Text_Access is abstract;
not overriding function Null_Token
(Self : Null_Component_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Semicolon_Token
(Self : Null_Component_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
end Program.Elements.Null_Components;
| 30.15 | 74 | 0.737977 |
03914ee5926c915e3f0b67973d973a8ccf6f7978 | 8,038 | ads | Ada | src/factions.ads | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 80 | 2017-04-08T23:14:07.000Z | 2022-02-10T22:30:51.000Z | src/factions.ads | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 89 | 2017-06-24T08:18:26.000Z | 2021-11-12T04:37:36.000Z | src/factions.ads | thindil/steamsky | d5d7fea622f7994c91017c4cd7ba5e188153556c | [
"TCL",
"MIT"
] | 9 | 2018-04-14T16:37:25.000Z | 2020-03-21T14:33:49.000Z | -- Copyright 2018-2021 Bartek thindil Jasicki
--
-- This file is part of Steam Sky.
--
-- Steam Sky 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.
--
-- Steam Sky 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 Steam Sky. If not, see <http://www.gnu.org/licenses/>.
with Ada.Containers.Hashed_Maps; use Ada.Containers;
with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with Ada.Strings.Unbounded.Hash;
with DOM.Readers; use DOM.Readers;
with Game; use Game;
-- ****h* Factions/Factions
-- FUNCTION
-- Provide code for factions
-- SOURCE
package Factions is
-- ****
-- ****t* Factions/Factions.NamesTypes
-- FUNCTION
-- Types of names of members and bases factions
-- SOURCE
type NamesTypes is (STANDARD, ROBOTIC) with
Default_Value => STANDARD;
-- ****
-- ****s* Factions/Factions.RelationsRecord
-- FUNCTION
-- Data structure for relations between factions
-- PARAMETERS
-- Reputation - Min and max value for starting reputation in bases owned
-- by target faction
-- Friendly - Did target faction is friendly or enemy to this faction
-- SOURCE
type RelationsRecord is record
Reputation: Reputation_Array;
Friendly: Boolean;
end record;
-- ****
-- ****t* Factions/Factions.Relations_Container
-- FUNCTION
-- Used to store relations data in faction
-- SOURCE
package Relations_Container is new Hashed_Maps
(Unbounded_String, RelationsRecord, Ada.Strings.Unbounded.Hash, "=");
-- ****
-- ****s* Factions/Factions.CareerRecord
-- FUNCTION
-- Data structure for player career in faction
-- PARAMETERS
-- ShipIndex - Index of proto ship which will be used as starting ship
-- for player
-- PlayerIndex - Index of mobile which will be used as starting character
-- for player
-- Description - Description of career, displayed to player
-- Name - Name of career, may be different for each faction
-- SOURCE
type CareerRecord is record
ShipIndex: Unbounded_String;
PlayerIndex: Unbounded_String;
Description: Unbounded_String;
Name: Unbounded_String;
end record;
-- ****
-- ****t* Factions/Factions.Careers_Container
-- FUNCTION
-- Used to store careers data in faction
-- SOURCE
package Careers_Container is new Hashed_Maps
(Unbounded_String, CareerRecord, Ada.Strings.Unbounded.Hash, "=");
-- ****
-- ****t* Factions/Factions.BaseType_Container
-- FUNCTION
-- Used to store bases types data in faction
-- SOURCE
package BaseType_Container is new Hashed_Maps
(Unbounded_String, Positive, Ada.Strings.Unbounded.Hash, "=");
-- ****
-- ****s* Factions/Factions.FactionRecord
-- FUNCTION
-- Data structure for faction
-- PARAMETERS
-- Name - Name of faction, displayed to player
-- MemberName - Name of single member of faction
-- PluralMemberName - Plural name of members of faction
-- SpawnChance - Chance that created at new game base will be owned by
-- this faction
-- Population - Min and max population for new bases with this
-- faction as owner
-- NamesTypes - Type of names of members of faction (used in
-- generating names of ships)
-- Relations - Relations of this faction with others factions
-- Description - Description on faction, displayed to player
-- FoodTypes - Types of items used as food for members of this
-- faction
-- DrinksTypes - Types of items used as drinks for members of this
-- faction
-- HealingTools - Name of item type used as tool in healing members of
-- this faction
-- HealingSkill - Vector index of skill used in healing members of this
-- faction
-- Flags - Various flags for faction (no gender, etc)
-- Careers - List of possible careers for that faction
-- BaseIcon - Character used as base icon on map for this faction
-- BasesTypes - List of available base types (with chances to spawn)
-- for this faction. If it is empty then all bases types
-- are available for this faction
-- WeaponSkill - Vector index of skill used by prefered weapon of
-- members of this faction
-- SOURCE
type FactionRecord is record
Name: Unbounded_String;
MemberName: Unbounded_String;
PluralMemberName: Unbounded_String;
SpawnChance: Natural := 0;
Population: Attributes_Array;
NamesType: NamesTypes;
Relations: Relations_Container.Map;
Description: Unbounded_String;
FoodTypes: UnboundedString_Container.Vector;
DrinksTypes: UnboundedString_Container.Vector;
HealingTools: Unbounded_String;
HealingSkill: SkillsData_Container.Extended_Index;
Flags: UnboundedString_Container.Vector;
Careers: Careers_Container.Map;
BaseIcon: Wide_Character;
BasesTypes: BaseType_Container.Map;
WeaponSkill: SkillsData_Container.Extended_Index;
end record;
-- ****
-- ****t* Factions/Factions.Factions_Container
-- FUNCTION
-- Used to store factions data
-- SOURCE
package Factions_Container is new Hashed_Maps
(Unbounded_String, FactionRecord, Ada.Strings.Unbounded.Hash, "=");
-- ****
-- ****v* Factions/Factions.Factions_List
-- SOURCE
Factions_List: Factions_Container.Map;
-- ****
-- ****f* Factions/Factions.LoadFactions
-- FUNCTION
-- Load NPC factions from file
-- PARAMETERS
-- Reader - XML Reader from which factions will be read
-- SOURCE
procedure LoadFactions(Reader: Tree_Reader);
-- ****
-- ****f* Factions/Factions.GetReputation
-- FUNCTION
-- Get reputation between SourceFaction and TargetFaction
-- PARAMETERS
-- SourceFaction - Index of first faction which reputation will be check
-- TargetFaction - Index of second faction which reputation will be check
-- RESULT
-- Numeric reputation level between both factions
-- SOURCE
function GetReputation
(SourceFaction, TargetFaction: Unbounded_String) return Integer with
Pre =>
(Factions_List.Contains(SourceFaction) and
Factions_List.Contains(TargetFaction)),
Test_Case => (Name => "Test_GetReputation", Mode => Nominal);
-- ****
-- ****f* Factions/Factions.IsFriendly
-- FUNCTION
-- Check if TargetFaction is friendly for SourceFaction. Returns true if yes, otherwise false.
-- PARAMETERS
-- SourceFaction - Index of base faction to which TargetFaction will be checked
-- TargetFaction - Index of faction to check
-- RESULT
-- True if factions are friendly between self, otherwise false
-- SOURCE
function IsFriendly
(SourceFaction, TargetFaction: Unbounded_String) return Boolean with
Pre =>
(Factions_List.Contains(SourceFaction) and
Factions_List.Contains(TargetFaction)),
Test_Case => (Name => "Test_IsFriendly", Mode => Nominal);
-- ****
-- ****f* Factions/Factions.GetRandomFaction
-- FUNCTION
-- Select random faction from list
-- RESULT
-- Random index of faction
-- SOURCE
function GetRandomFaction return Unbounded_String with
Test_Case => (Name => "Test_GetRandomFaction", Mode => Robustness);
-- ****
end Factions;
| 37.212963 | 100 | 0.658248 |
5e4d54413f83462bd31936ff9649e0f93b9f8e75 | 1,936 | ads | Ada | source/oasis/program-elements-attribute_references.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/oasis/program-elements-attribute_references.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/oasis/program-elements-attribute_references.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | 2 | 2019-09-14T23:18:50.000Z | 2019-10-02T10:11:40.000Z | -- Copyright (c) 2019 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Program.Elements.Expressions;
with Program.Lexical_Elements;
with Program.Elements.Identifiers;
package Program.Elements.Attribute_References is
pragma Pure (Program.Elements.Attribute_References);
type Attribute_Reference is
limited interface and Program.Elements.Expressions.Expression;
type Attribute_Reference_Access is access all Attribute_Reference'Class
with Storage_Size => 0;
not overriding function Prefix
(Self : Attribute_Reference)
return not null Program.Elements.Expressions.Expression_Access
is abstract;
not overriding function Attribute_Designator
(Self : Attribute_Reference)
return not null Program.Elements.Identifiers.Identifier_Access
is abstract;
not overriding function Expressions
(Self : Attribute_Reference)
return Program.Elements.Expressions.Expression_Access is abstract;
type Attribute_Reference_Text is limited interface;
type Attribute_Reference_Text_Access is
access all Attribute_Reference_Text'Class with Storage_Size => 0;
not overriding function To_Attribute_Reference_Text
(Self : aliased in out Attribute_Reference)
return Attribute_Reference_Text_Access is abstract;
not overriding function Apostrophe_Token
(Self : Attribute_Reference_Text)
return not null Program.Lexical_Elements.Lexical_Element_Access
is abstract;
not overriding function Left_Bracket_Token
(Self : Attribute_Reference_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
not overriding function Right_Bracket_Token
(Self : Attribute_Reference_Text)
return Program.Lexical_Elements.Lexical_Element_Access is abstract;
end Program.Elements.Attribute_References;
| 33.37931 | 74 | 0.764979 |
8b36d59a36d18e8e9d3f6c9ed9e1a730e866dd20 | 10,920 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c34005r.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/c3/c34005r.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c34005r.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C34005R.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- OBJECTIVE:
-- FOR DERIVED ONE-DIMENSIONAL ARRAY TYPES WHOSE COMPONENT TYPE IS A
-- LIMITED TYPE:
-- CHECK THAT ALL VALUES OF THE PARENT (BASE) TYPE ARE PRESENT
-- FOR THE DERIVED (BASE) TYPE WHEN THE DERIVED TYPE DEFINITION
-- IS CONSTRAINED.
-- CHECK THAT ANY CONSTRAINT IMPOSED ON THE PARENT SUBTYPE IS
-- ALSO IMPOSED ON THE DERIVED SUBTYPE.
-- HISTORY:
-- JRK 08/19/87 CREATED ORIGINAL TEST.
-- VCL 07/01/88 ADDED EXCEPTION HANDLERS TO CATCH INCORRECT TYPE
-- CONVERSIONS TO DERIVED SUBTYPES.
WITH REPORT; USE REPORT;
PROCEDURE C34005R IS
PACKAGE PKG_L IS
TYPE LP IS LIMITED PRIVATE;
FUNCTION CREATE (X : INTEGER) RETURN LP;
FUNCTION VALUE (X : LP) RETURN INTEGER;
FUNCTION EQUAL (X, Y : LP) RETURN BOOLEAN;
PROCEDURE ASSIGN (X : OUT LP; Y : LP);
C1 : CONSTANT LP;
C2 : CONSTANT LP;
C3 : CONSTANT LP;
C4 : CONSTANT LP;
C5 : CONSTANT LP;
PRIVATE
TYPE LP IS NEW INTEGER;
C1 : CONSTANT LP := 1;
C2 : CONSTANT LP := 2;
C3 : CONSTANT LP := 3;
C4 : CONSTANT LP := 4;
C5 : CONSTANT LP := 5;
END PKG_L;
USE PKG_L;
SUBTYPE COMPONENT IS LP;
PACKAGE PKG_P IS
FIRST : CONSTANT := 0;
LAST : CONSTANT := 100;
SUBTYPE INDEX IS INTEGER RANGE FIRST .. LAST;
TYPE PARENT IS ARRAY (INDEX RANGE <>) OF COMPONENT;
FUNCTION CREATE ( F, L : INDEX;
C : COMPONENT;
DUMMY : PARENT -- TO RESOLVE OVERLOADING.
) RETURN PARENT;
FUNCTION EQUAL (X, Y : PARENT) RETURN BOOLEAN;
FUNCTION AGGR (X, Y : COMPONENT) RETURN PARENT;
FUNCTION AGGR (W, X, Y, Z : COMPONENT) RETURN PARENT;
END PKG_P;
USE PKG_P;
TYPE T IS NEW PARENT (IDENT_INT (5) .. IDENT_INT (7));
SUBTYPE SUBPARENT IS PARENT (5 .. 7);
TYPE S IS NEW SUBPARENT;
X : T;
Y : S;
PACKAGE BODY PKG_L IS
FUNCTION CREATE (X : INTEGER) RETURN LP IS
BEGIN
RETURN LP (IDENT_INT (X));
END CREATE;
FUNCTION VALUE (X : LP) RETURN INTEGER IS
BEGIN
RETURN INTEGER (X);
END VALUE;
FUNCTION EQUAL (X, Y : LP) RETURN BOOLEAN IS
BEGIN
RETURN X = Y;
END EQUAL;
PROCEDURE ASSIGN (X : OUT LP; Y : LP) IS
BEGIN
X := Y;
END ASSIGN;
END PKG_L;
PACKAGE BODY PKG_P IS
FUNCTION CREATE
( F, L : INDEX;
C : COMPONENT;
DUMMY : PARENT
) RETURN PARENT
IS
A : PARENT (F .. L);
B : COMPONENT;
BEGIN
ASSIGN (B, C);
FOR I IN F .. L LOOP
ASSIGN (A (I), B);
ASSIGN (B, CREATE (VALUE (B) + 1));
END LOOP;
RETURN A;
END CREATE;
FUNCTION EQUAL (X, Y : PARENT) RETURN BOOLEAN IS
BEGIN
IF X'LENGTH /= Y'LENGTH THEN
RETURN FALSE;
ELSE FOR I IN X'RANGE LOOP
IF NOT EQUAL (X (I),
Y (I - X'FIRST + Y'FIRST)) THEN
RETURN FALSE;
END IF;
END LOOP;
END IF;
RETURN TRUE;
END EQUAL;
FUNCTION AGGR (X, Y : COMPONENT) RETURN PARENT IS
RESULT : PARENT (INDEX'FIRST .. INDEX'FIRST + 1);
BEGIN
ASSIGN (RESULT (INDEX'FIRST ), X);
ASSIGN (RESULT (INDEX'FIRST + 1), Y);
RETURN RESULT;
END AGGR;
FUNCTION AGGR (W, X, Y, Z : COMPONENT) RETURN PARENT IS
RESULT : PARENT (INDEX'FIRST .. INDEX'FIRST + 3);
BEGIN
ASSIGN (RESULT (INDEX'FIRST ), W);
ASSIGN (RESULT (INDEX'FIRST + 1), X);
ASSIGN (RESULT (INDEX'FIRST + 2), Y);
ASSIGN (RESULT (INDEX'FIRST + 3), Z);
RETURN RESULT;
END AGGR;
END PKG_P;
PROCEDURE ASSIGN (X : IN OUT T; Y : T) IS
BEGIN
FOR I IN X'RANGE LOOP
ASSIGN (X (I), Y (I));
END LOOP;
END ASSIGN;
PROCEDURE ASSIGN (X : IN OUT S; Y : S) IS
BEGIN
FOR I IN X'RANGE LOOP
ASSIGN (X (I), Y (I));
END LOOP;
END ASSIGN;
BEGIN
TEST ("C34005R", "CHECK THAT ALL VALUES OF THE PARENT (BASE) " &
"TYPE ARE PRESENT FOR THE DERIVED (BASE) TYPE " &
"WHEN THE DERIVED TYPE DEFINITION IS " &
"CONSTRAINED. ALSO CHECK THAT ANY CONSTRAINT " &
"IMPOSED ON THE PARENT SUBTYPE IS ALSO IMPOSED " &
"ON THE DERIVED SUBTYPE. CHECK FOR DERIVED " &
"ONE-DIMENSIONAL ARRAY TYPES WHOSE COMPONENT " &
"TYPE IS A LIMITED TYPE");
ASSIGN (X (IDENT_INT (5)), CREATE (2));
ASSIGN (X (IDENT_INT (6)), CREATE (3));
ASSIGN (X (IDENT_INT (7)), CREATE (4));
ASSIGN (Y (5), C2);
ASSIGN (Y (6), C3);
ASSIGN (Y (7), C4);
-- CHECK THAT BASE TYPE VALUES NOT IN THE SUBTYPE ARE PRESENT.
BEGIN
IF NOT EQUAL (CREATE (2, 3, C4, X), AGGR (C4, C5)) THEN
FAILED ("CANNOT CREATE BASE TYPE VALUES OUTSIDE " &
"OF THE SUBTYPE T");
END IF;
EXCEPTION
WHEN OTHERS =>
FAILED ("EXCEPTION RAISED WHILE CHECKING BASE TYPE " &
"VALUES OUTSIDE OF THE SUBTYPE T");
END;
BEGIN
IF NOT EQUAL (CREATE (2, 3, C4, Y), AGGR (C4, C5)) THEN
FAILED ("CANNOT CREATE BASE TYPE VALUES OUTSIDE " &
"OF THE SUBTYPE S");
END IF;
EXCEPTION
WHEN OTHERS =>
FAILED ("EXCEPTION RAISED WHILE CHECKING BASE TYPE " &
"VALUES OUTSIDE OF THE SUBTYPE S");
END;
BEGIN
IF NOT EQUAL (X(IDENT_INT (6)..IDENT_INT (7)),
AGGR (C3, C4)) THEN
FAILED ("INCORRECT SLICE OF X (VALUE)");
END IF;
EXCEPTION
WHEN OTHERS =>
FAILED ("EXCEPTION RAISED WHILE CHECKING SLICE OF X");
END;
BEGIN
IF NOT EQUAL (AGGR (C3, C4),
Y(IDENT_INT (6)..IDENT_INT (7))) THEN
FAILED ("INCORRECT SLICE OF Y (VALUE)");
END IF;
EXCEPTION
WHEN OTHERS =>
FAILED ("EXCEPTION RAISED WHILE CHECKING SLICE OF Y");
END;
-- CHECK THE DERIVED SUBTYPE CONSTRAINT.
IF T'FIRST /= 5 OR T'LAST /= 7 OR
S'FIRST /= 5 OR S'LAST /= 7 THEN
FAILED ("INCORRECT 'FIRST OR 'LAST");
END IF;
BEGIN
ASSIGN (X, CREATE (5, 7, C1, X));
ASSIGN (Y, CREATE (5, 7, C1, Y));
IF NOT EQUAL (PARENT (X), PARENT (Y)) THEN -- USE X AND Y.
FAILED ("INCORRECT CONVERSION TO PARENT");
END IF;
EXCEPTION
WHEN OTHERS =>
FAILED ("EXCEPTION RAISED BY OK ASSIGN CALL");
END;
BEGIN
ASSIGN (X, AGGR (C1, C2));
FAILED ("CONSTRAINT_ERROR NOT RAISED -- " &
"ASSIGN (X, AGGR (C1, C2))");
IF EQUAL (X, AGGR (C1, C2)) THEN -- USE X.
COMMENT ("X ALTERED -- ASSIGN (X, AGGR (C1, C2))");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -- " &
"ASSIGN (X, AGGR (C1, C2))");
END;
BEGIN
ASSIGN (X, AGGR (C1, C2, C3, C4));
FAILED ("CONSTRAINT_ERROR NOT RAISED -- " &
"ASSIGN (X, AGGR (C1, C2, C3, C4))");
IF EQUAL (X, AGGR (C1, C2, C3, C4)) THEN -- USE X.
COMMENT ("X ALTERED -- " &
"ASSIGN (X, AGGR (C1, C2, C3, C4))");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -- " &
"ASSIGN (X, AGGR (C1, C2, C3, C4))");
END;
BEGIN
ASSIGN (Y, AGGR (C1, C2));
FAILED ("CONSTRAINT_ERROR NOT RAISED -- " &
"ASSIGN (Y, AGGR (C1, C2))");
IF EQUAL (Y, AGGR (C1, C2)) THEN -- USE Y.
COMMENT ("Y ALTERED -- ASSIGN (Y, AGGR (C1, C2))");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -- " &
"ASSIGN (Y, AGGR (C1, C2))");
END;
BEGIN
ASSIGN (Y, AGGR (C1, C2, C3, C4));
FAILED ("CONSTRAINT_ERROR NOT RAISED -- " &
"ASSIGN (Y, AGGR (C1, C2, C3, C4))");
IF EQUAL (Y, AGGR (C1, C2, C3, C4)) THEN -- USE Y.
COMMENT ("Y ALTERED -- " &
"ASSIGN (Y, AGGR (C1, C2, C3, C4))");
END IF;
EXCEPTION
WHEN CONSTRAINT_ERROR =>
NULL;
WHEN OTHERS =>
FAILED ("WRONG EXCEPTION RAISED -- " &
"ASSIGN (Y, AGGR (C1, C2, C3, C4))");
END;
RESULT;
END C34005R;
| 31.469741 | 79 | 0.488278 |
03b5a6c5b6a9d7976f084289bc8e9059e0e05fdb | 11,725 | ads | Ada | tier-2/festival/source/thin/festival-binding.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 2 | 2015-11-12T11:16:20.000Z | 2021-08-24T22:32:04.000Z | tier-2/festival/source/thin/festival-binding.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | 1 | 2018-06-05T05:19:35.000Z | 2021-11-20T01:13:23.000Z | tier-2/festival/source/thin/festival-binding.ads | charlie5/cBound | 741be08197a61ad9c72553e3302f3b669902216d | [
"0BSD"
] | null | null | null | -- This file is generated by SWIG. Please do *not* modify by hand.
--
with festival.FT_ff_pref_func;
with festival.Pointers;
with interfaces.c;
with interfaces.c.strings;
with speech_tools_c;
with speech_tools_c.Pointers;
with interfaces.C;
package festival.Binding is
function festival_socket_client (host : in interfaces.c.strings.chars_ptr;
port : in interfaces.c.int) return interfaces.c.int;
function festival_start_server (port : in interfaces.c.int) return interfaces.c.int;
procedure festival_initialize (load_init_files : in interfaces.c.int;
heap_size : in interfaces.c.int);
procedure festival_init_lang (language : in speech_tools_c.Pointers.EST_String_Pointer);
function festival_eval_command (expr : in speech_tools_c.Pointers.EST_String_Pointer) return interfaces.c.int;
function festival_load_file (fname : in speech_tools_c.Pointers.EST_String_Pointer) return interfaces.c.int;
function festival_say_file (fname : in speech_tools_c.Pointers.EST_String_Pointer) return interfaces.c.int;
function festival_say_text (text : in speech_tools_c.Pointers.EST_String_Pointer) return interfaces.c.int;
function festival_text_to_wave (text : in speech_tools_c.Pointers.EST_String_Pointer;
wave : in speech_tools_c.Pointers.EST_Wave_Pointer) return interfaces.c.int;
procedure festival_repl (interactive : in interfaces.c.int);
procedure festival_server_mode ;
procedure festival_wait_for_spooler ;
procedure festival_tidy_up ;
procedure festival_def_nff (name : in speech_tools_c.Pointers.EST_String_Pointer;
sname : in speech_tools_c.Pointers.EST_String_Pointer;
func : in speech_tools_c.EST_Item_featfunc;
doc : in interfaces.c.strings.chars_ptr);
procedure festival_def_ff_pref (pref : in speech_tools_c.Pointers.EST_String_Pointer;
sname : in speech_tools_c.Pointers.EST_String_Pointer;
func : in festival.FT_ff_pref_func.Item;
doc : in interfaces.c.strings.chars_ptr);
function ffeature (s : in speech_tools_c.Pointers.EST_Item_Pointer;
name : in speech_tools_c.Pointers.EST_String_Pointer) return speech_tools_c.EST_Val;
procedure proclaim_module (name : in speech_tools_c.Pointers.EST_String_Pointer;
banner_copyright : in speech_tools_c.Pointers.EST_String_Pointer;
description : in festival.Pointers.ModuleDescription_Pointer);
procedure proclaim_module (name : in speech_tools_c.Pointers.EST_String_Pointer;
banner_copyright : in speech_tools_c.Pointers.EST_String_Pointer);
procedure proclaim_module (name : in speech_tools_c.Pointers.EST_String_Pointer;
description : in festival.Pointers.ModuleDescription_Pointer);
procedure proclaim_module (name : in speech_tools_c.Pointers.EST_String_Pointer);
function wagon_predict (s : in speech_tools_c.Pointers.EST_Item_Pointer;
tree : in speech_tools_c.LISP) return speech_tools_c.EST_Val;
function wagon_pd (s : in speech_tools_c.Pointers.EST_Item_Pointer;
tree : in speech_tools_c.LISP) return speech_tools_c.LISP;
function lr_predict (s : in speech_tools_c.Pointers.EST_Item_Pointer;
lr_model : in speech_tools_c.LISP) return speech_tools_c.EST_Val;
function get_ngram (name : in speech_tools_c.Pointers.EST_String_Pointer;
filename : in speech_tools_c.Pointers.EST_String_Pointer) return speech_tools_c.Pointers.EST_Ngrammar_Pointer;
function get_ngram (name : in speech_tools_c.Pointers.EST_String_Pointer) return speech_tools_c.Pointers.EST_Ngrammar_Pointer;
function get_wfst (name : in speech_tools_c.Pointers.EST_String_Pointer;
filename : in speech_tools_c.Pointers.EST_String_Pointer) return speech_tools_c.Pointers.EST_WFST_Pointer;
function get_wfst (name : in speech_tools_c.Pointers.EST_String_Pointer) return speech_tools_c.Pointers.EST_WFST_Pointer;
function lisp_wfst_transduce (wfstname : in speech_tools_c.LISP;
input : in speech_tools_c.LISP) return speech_tools_c.LISP;
function map_pos (posmap : in speech_tools_c.LISP;
pos : in speech_tools_c.Pointers.EST_String_Pointer) return speech_tools_c.EST_String;
function map_pos (posmap : in speech_tools_c.LISP;
pos : in speech_tools_c.LISP) return speech_tools_c.LISP;
procedure utt_cleanup (u : in speech_tools_c.Pointers.EST_Utterance_Pointer);
function utt_iform (utt : in speech_tools_c.Pointers.EST_Utterance_Pointer) return speech_tools_c.LISP;
procedure add_item_features (s : in speech_tools_c.Pointers.EST_Item_Pointer;
features : in speech_tools_c.LISP);
procedure festival_init_modules ;
function ft_get_param (pname : in speech_tools_c.Pointers.EST_String_Pointer) return speech_tools_c.LISP;
procedure set_festival_libdir (To : in interfaces.c.strings.chars_ptr);
private
pragma Import (C, festival_socket_client, "Ada_festival_socket_client");
pragma Import (C, festival_start_server, "Ada_festival_start_server");
pragma Import (C, festival_initialize, "Ada_festival_initialize");
pragma Import (C, festival_init_lang, "Ada_festival_init_lang");
pragma Import (C, festival_eval_command, "Ada_festival_eval_command");
pragma Import (C, festival_load_file, "Ada_festival_load_file");
pragma Import (C, festival_say_file, "Ada_festival_say_file");
pragma Import (C, festival_say_text, "Ada_festival_say_text");
pragma Import (C, festival_text_to_wave, "Ada_festival_text_to_wave");
pragma Import (C, festival_repl, "Ada_festival_repl");
pragma Import (C, festival_server_mode, "Ada_festival_server_mode");
pragma Import (C, festival_wait_for_spooler, "Ada_festival_wait_for_spooler");
pragma Import (C, festival_tidy_up, "Ada_festival_tidy_up");
pragma Import (C, festival_def_nff, "Ada_festival_def_nff");
pragma Import (C, festival_def_ff_pref, "Ada_festival_def_ff_pref");
pragma Import (C, ffeature, "Ada_ffeature");
procedure proclaim_module_v1 (name : in speech_tools_c.Pointers.EST_String_Pointer;
banner_copyright : in speech_tools_c.Pointers.EST_String_Pointer;
description : in festival.Pointers.ModuleDescription_Pointer);
procedure proclaim_module (name : in speech_tools_c.Pointers.EST_String_Pointer;
banner_copyright : in speech_tools_c.Pointers.EST_String_Pointer;
description : in festival.Pointers.ModuleDescription_Pointer)
renames proclaim_module_v1;
pragma Import (C, proclaim_module_v1, "Ada_proclaim_module__SWIG_0");
procedure proclaim_module_v2 (name : in speech_tools_c.Pointers.EST_String_Pointer;
banner_copyright : in speech_tools_c.Pointers.EST_String_Pointer);
procedure proclaim_module (name : in speech_tools_c.Pointers.EST_String_Pointer;
banner_copyright : in speech_tools_c.Pointers.EST_String_Pointer)
renames proclaim_module_v2;
pragma Import (C, proclaim_module_v2, "Ada_proclaim_module__SWIG_1");
procedure proclaim_module_v3 (name : in speech_tools_c.Pointers.EST_String_Pointer;
description : in festival.Pointers.ModuleDescription_Pointer);
procedure proclaim_module (name : in speech_tools_c.Pointers.EST_String_Pointer;
description : in festival.Pointers.ModuleDescription_Pointer)
renames proclaim_module_v3;
pragma Import (C, proclaim_module_v3, "Ada_proclaim_module__SWIG_2");
procedure proclaim_module_v4 (name : in speech_tools_c.Pointers.EST_String_Pointer);
procedure proclaim_module (name : in speech_tools_c.Pointers.EST_String_Pointer)
renames proclaim_module_v4;
pragma Import (C, proclaim_module_v4, "Ada_proclaim_module__SWIG_3");
pragma Import (C, wagon_predict, "Ada_wagon_predict");
pragma Import (C, wagon_pd, "Ada_wagon_pd");
pragma Import (C, lr_predict, "Ada_lr_predict");
function get_ngram_v1 (name : in speech_tools_c.Pointers.EST_String_Pointer;
filename : in speech_tools_c.Pointers.EST_String_Pointer) return speech_tools_c.Pointers.EST_Ngrammar_Pointer;
function get_ngram (name : in speech_tools_c.Pointers.EST_String_Pointer;
filename : in speech_tools_c.Pointers.EST_String_Pointer) return speech_tools_c.Pointers.EST_Ngrammar_Pointer
renames get_ngram_v1;
pragma Import (C, get_ngram_v1, "Ada_get_ngram__SWIG_0");
function get_ngram_v2 (name : in speech_tools_c.Pointers.EST_String_Pointer) return speech_tools_c.Pointers.EST_Ngrammar_Pointer;
function get_ngram (name : in speech_tools_c.Pointers.EST_String_Pointer) return speech_tools_c.Pointers.EST_Ngrammar_Pointer
renames get_ngram_v2;
pragma Import (C, get_ngram_v2, "Ada_get_ngram__SWIG_1");
function get_wfst_v1 (name : in speech_tools_c.Pointers.EST_String_Pointer;
filename : in speech_tools_c.Pointers.EST_String_Pointer) return speech_tools_c.Pointers.EST_WFST_Pointer;
function get_wfst (name : in speech_tools_c.Pointers.EST_String_Pointer;
filename : in speech_tools_c.Pointers.EST_String_Pointer) return speech_tools_c.Pointers.EST_WFST_Pointer
renames get_wfst_v1;
pragma Import (C, get_wfst_v1, "Ada_get_wfst__SWIG_0");
function get_wfst_v2 (name : in speech_tools_c.Pointers.EST_String_Pointer) return speech_tools_c.Pointers.EST_WFST_Pointer;
function get_wfst (name : in speech_tools_c.Pointers.EST_String_Pointer) return speech_tools_c.Pointers.EST_WFST_Pointer
renames get_wfst_v2;
pragma Import (C, get_wfst_v2, "Ada_get_wfst__SWIG_1");
pragma Import (C, lisp_wfst_transduce, "Ada_lisp_wfst_transduce");
function map_pos_v1 (posmap : in speech_tools_c.LISP;
pos : in speech_tools_c.Pointers.EST_String_Pointer) return speech_tools_c.EST_String;
function map_pos (posmap : in speech_tools_c.LISP;
pos : in speech_tools_c.Pointers.EST_String_Pointer) return speech_tools_c.EST_String
renames map_pos_v1;
pragma Import (C, map_pos_v1, "Ada_map_pos__SWIG_0");
function map_pos_v2 (posmap : in speech_tools_c.LISP;
pos : in speech_tools_c.LISP) return speech_tools_c.LISP;
function map_pos (posmap : in speech_tools_c.LISP;
pos : in speech_tools_c.LISP) return speech_tools_c.LISP
renames map_pos_v2;
pragma Import (C, map_pos_v2, "Ada_map_pos__SWIG_1");
pragma Import (C, utt_cleanup, "Ada_utt_cleanup");
pragma Import (C, utt_iform, "Ada_utt_iform");
pragma Import (C, add_item_features, "Ada_add_item_features");
pragma Import (C, festival_init_modules, "Ada_festival_init_modules");
pragma Import (C, ft_get_param, "Ada_ft_get_param");
pragma Import (C, set_festival_libdir, "Ada_set_festival_libdir");
end festival.Binding;
| 44.078947 | 137 | 0.712495 |
1e9a962dc54cc29d33d82232855f596f60795bc1 | 1,976 | adb | Ada | out/prologin_template_2charline2.adb | Melyodas/metalang | 399a9f1a71402c979d7f8024d4f98f081c80e771 | [
"BSD-2-Clause"
] | 22 | 2017-04-24T10:00:45.000Z | 2021-04-01T10:11:05.000Z | out/prologin_template_2charline2.adb | Melyodas/metalang | 399a9f1a71402c979d7f8024d4f98f081c80e771 | [
"BSD-2-Clause"
] | 12 | 2017-03-26T18:34:21.000Z | 2019-03-21T19:13:03.000Z | out/prologin_template_2charline2.adb | Melyodas/metalang | 399a9f1a71402c979d7f8024d4f98f081c80e771 | [
"BSD-2-Clause"
] | 7 | 2017-10-14T13:33:33.000Z | 2021-03-18T15:18:50.000Z |
with ada.text_io, ada.Integer_text_IO, Ada.Text_IO.Text_Streams, Ada.Strings.Fixed, Interfaces.C;
use ada.text_io, ada.Integer_text_IO, Ada.Strings, Ada.Strings.Fixed, Interfaces.C;
procedure prologin_template_2charline2 is
type stringptr is access all char_array;
procedure PString(s : stringptr) is
begin
String'Write (Text_Streams.Stream (Current_Output), To_Ada(s.all));
end;
procedure PChar(c : in Character) is
begin
Character'Write (Text_Streams.Stream (Current_Output), c);
end;
procedure PInt(i : in Integer) is
begin
String'Write (Text_Streams.Stream (Current_Output), Trim(Integer'Image(i), Left));
end;
procedure SkipSpaces is
C : Character;
Eol : Boolean;
begin
loop
Look_Ahead(C, Eol);
exit when Eol or C /= ' ';
Get(C);
end loop;
end;
type c is Array (Integer range <>) of Character;
type c_PTR is access c;
function programme_candidat(tableau1 : in c_PTR; taille1 : in Integer; tableau2 : in c_PTR; taille2 : in Integer) return Integer is
out0 : Integer;
begin
out0 := 0;
for i in integer range 0..taille1 - 1 loop
out0 := out0 + Character'Pos(tableau1(i)) * i;
PChar(tableau1(i));
end loop;
PString(new char_array'( To_C("--" & Character'Val(10))));
for j in integer range 0..taille2 - 1 loop
out0 := out0 + Character'Pos(tableau2(j)) * j * 100;
PChar(tableau2(j));
end loop;
PString(new char_array'( To_C("--" & Character'Val(10))));
return out0;
end;
taille2 : Integer;
taille1 : Integer;
tableau2 : c_PTR;
tableau1 : c_PTR;
begin
Get(taille1);
SkipSpaces;
Get(taille2);
SkipSpaces;
tableau1 := new c (0..taille1 - 1);
for a in integer range 0..taille1 - 1 loop
Get(tableau1(a));
end loop;
SkipSpaces;
tableau2 := new c (0..taille2 - 1);
for b in integer range 0..taille2 - 1 loop
Get(tableau2(b));
end loop;
SkipSpaces;
PInt(programme_candidat(tableau1, taille1, tableau2, taille2));
PString(new char_array'( To_C("" & Character'Val(10))));
end;
| 27.068493 | 131 | 0.692308 |
3808905903a541b61dee3a3e28e844fb10dc7cb7 | 25,799 | ads | Ada | arch/ARM/STM32/svd/stm32f103/stm32_svd-rcc.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/stm32f103/stm32_svd-rcc.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | arch/ARM/STM32/svd/stm32f103/stm32_svd-rcc.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | null | null | null | -- This spec has been automatically generated from STM32F103.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.RCC is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype CR_HSITRIM_Field is HAL.UInt5;
subtype CR_HSICAL_Field is HAL.UInt8;
-- Clock control register
type CR_Register is record
-- Internal High Speed clock enable
HSION : Boolean := True;
-- Read-only. Internal High Speed clock ready flag
HSIRDY : Boolean := True;
-- unspecified
Reserved_2_2 : HAL.Bit := 16#0#;
-- Internal High Speed clock trimming
HSITRIM : CR_HSITRIM_Field := 16#10#;
-- Read-only. Internal High Speed clock Calibration
HSICAL : CR_HSICAL_Field := 16#0#;
-- External High Speed clock enable
HSEON : Boolean := False;
-- Read-only. External High Speed clock ready flag
HSERDY : Boolean := False;
-- External High Speed clock Bypass
HSEBYP : Boolean := False;
-- Clock Security System enable
CSSON : Boolean := False;
-- unspecified
Reserved_20_23 : HAL.UInt4 := 16#0#;
-- PLL enable
PLLON : Boolean := False;
-- Read-only. PLL clock ready flag
PLLRDY : Boolean := False;
-- unspecified
Reserved_26_31 : HAL.UInt6 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CR_Register use record
HSION at 0 range 0 .. 0;
HSIRDY at 0 range 1 .. 1;
Reserved_2_2 at 0 range 2 .. 2;
HSITRIM at 0 range 3 .. 7;
HSICAL at 0 range 8 .. 15;
HSEON at 0 range 16 .. 16;
HSERDY at 0 range 17 .. 17;
HSEBYP at 0 range 18 .. 18;
CSSON at 0 range 19 .. 19;
Reserved_20_23 at 0 range 20 .. 23;
PLLON at 0 range 24 .. 24;
PLLRDY at 0 range 25 .. 25;
Reserved_26_31 at 0 range 26 .. 31;
end record;
subtype CFGR_SW_Field is HAL.UInt2;
subtype CFGR_SWS_Field is HAL.UInt2;
subtype CFGR_HPRE_Field is HAL.UInt4;
-- CFGR_PPRE array element
subtype CFGR_PPRE_Element is HAL.UInt3;
-- CFGR_PPRE array
type CFGR_PPRE_Field_Array is array (1 .. 2) of CFGR_PPRE_Element
with Component_Size => 3, Size => 6;
-- Type definition for CFGR_PPRE
type CFGR_PPRE_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- PPRE as a value
Val : HAL.UInt6;
when True =>
-- PPRE as an array
Arr : CFGR_PPRE_Field_Array;
end case;
end record
with Unchecked_Union, Size => 6;
for CFGR_PPRE_Field use record
Val at 0 range 0 .. 5;
Arr at 0 range 0 .. 5;
end record;
subtype CFGR_ADCPRE_Field is HAL.UInt2;
subtype CFGR_PLLMUL_Field is HAL.UInt4;
subtype CFGR_MCO_Field is HAL.UInt3;
-- Clock configuration register (RCC_CFGR)
type CFGR_Register is record
-- System clock Switch
SW : CFGR_SW_Field := 16#0#;
-- Read-only. System Clock Switch Status
SWS : CFGR_SWS_Field := 16#0#;
-- AHB prescaler
HPRE : CFGR_HPRE_Field := 16#0#;
-- APB Low speed prescaler (APB1)
PPRE : CFGR_PPRE_Field := (As_Array => False, Val => 16#0#);
-- ADC prescaler
ADCPRE : CFGR_ADCPRE_Field := 16#0#;
-- PLL entry clock source
PLLSRC : Boolean := False;
-- HSE divider for PLL entry
PLLXTPRE : Boolean := False;
-- PLL Multiplication Factor
PLLMUL : CFGR_PLLMUL_Field := 16#0#;
-- USB OTG FS prescaler
OTGFSPRE : Boolean := False;
-- unspecified
Reserved_23_23 : HAL.Bit := 16#0#;
-- Microcontroller clock output
MCO : CFGR_MCO_Field := 16#0#;
-- unspecified
Reserved_27_31 : HAL.UInt5 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CFGR_Register use record
SW at 0 range 0 .. 1;
SWS at 0 range 2 .. 3;
HPRE at 0 range 4 .. 7;
PPRE at 0 range 8 .. 13;
ADCPRE at 0 range 14 .. 15;
PLLSRC at 0 range 16 .. 16;
PLLXTPRE at 0 range 17 .. 17;
PLLMUL at 0 range 18 .. 21;
OTGFSPRE at 0 range 22 .. 22;
Reserved_23_23 at 0 range 23 .. 23;
MCO at 0 range 24 .. 26;
Reserved_27_31 at 0 range 27 .. 31;
end record;
-- Clock interrupt register (RCC_CIR)
type CIR_Register is record
-- Read-only. LSI Ready Interrupt flag
LSIRDYF : Boolean := False;
-- Read-only. LSE Ready Interrupt flag
LSERDYF : Boolean := False;
-- Read-only. HSI Ready Interrupt flag
HSIRDYF : Boolean := False;
-- Read-only. HSE Ready Interrupt flag
HSERDYF : Boolean := False;
-- Read-only. PLL Ready Interrupt flag
PLLRDYF : Boolean := False;
-- unspecified
Reserved_5_6 : HAL.UInt2 := 16#0#;
-- Read-only. Clock Security System Interrupt flag
CSSF : Boolean := False;
-- LSI Ready Interrupt Enable
LSIRDYIE : Boolean := False;
-- LSE Ready Interrupt Enable
LSERDYIE : Boolean := False;
-- HSI Ready Interrupt Enable
HSIRDYIE : Boolean := False;
-- HSE Ready Interrupt Enable
HSERDYIE : Boolean := False;
-- PLL Ready Interrupt Enable
PLLRDYIE : Boolean := False;
-- unspecified
Reserved_13_15 : HAL.UInt3 := 16#0#;
-- Write-only. LSI Ready Interrupt Clear
LSIRDYC : Boolean := False;
-- Write-only. LSE Ready Interrupt Clear
LSERDYC : Boolean := False;
-- Write-only. HSI Ready Interrupt Clear
HSIRDYC : Boolean := False;
-- Write-only. HSE Ready Interrupt Clear
HSERDYC : Boolean := False;
-- Write-only. PLL Ready Interrupt Clear
PLLRDYC : Boolean := False;
-- unspecified
Reserved_21_22 : HAL.UInt2 := 16#0#;
-- Write-only. Clock security system interrupt clear
CSSC : Boolean := False;
-- unspecified
Reserved_24_31 : HAL.UInt8 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CIR_Register use record
LSIRDYF at 0 range 0 .. 0;
LSERDYF at 0 range 1 .. 1;
HSIRDYF at 0 range 2 .. 2;
HSERDYF at 0 range 3 .. 3;
PLLRDYF at 0 range 4 .. 4;
Reserved_5_6 at 0 range 5 .. 6;
CSSF at 0 range 7 .. 7;
LSIRDYIE at 0 range 8 .. 8;
LSERDYIE at 0 range 9 .. 9;
HSIRDYIE at 0 range 10 .. 10;
HSERDYIE at 0 range 11 .. 11;
PLLRDYIE at 0 range 12 .. 12;
Reserved_13_15 at 0 range 13 .. 15;
LSIRDYC at 0 range 16 .. 16;
LSERDYC at 0 range 17 .. 17;
HSIRDYC at 0 range 18 .. 18;
HSERDYC at 0 range 19 .. 19;
PLLRDYC at 0 range 20 .. 20;
Reserved_21_22 at 0 range 21 .. 22;
CSSC at 0 range 23 .. 23;
Reserved_24_31 at 0 range 24 .. 31;
end record;
-- APB2 peripheral reset register (RCC_APB2RSTR)
type APB2RSTR_Register is record
-- Alternate function I/O reset
AFIORST : Boolean := False;
-- unspecified
Reserved_1_1 : HAL.Bit := 16#0#;
-- IO port A reset
IOPARST : Boolean := False;
-- IO port B reset
IOPBRST : Boolean := False;
-- IO port C reset
IOPCRST : Boolean := False;
-- IO port D reset
IOPDRST : Boolean := False;
-- IO port E reset
IOPERST : Boolean := False;
-- IO port F reset
IOPFRST : Boolean := False;
-- IO port G reset
IOPGRST : Boolean := False;
-- ADC 1 interface reset
ADC1RST : Boolean := False;
-- ADC 2 interface reset
ADC2RST : Boolean := False;
-- TIM1 timer reset
TIM1RST : Boolean := False;
-- SPI 1 reset
SPI1RST : Boolean := False;
-- TIM8 timer reset
TIM8RST : Boolean := False;
-- USART1 reset
USART1RST : Boolean := False;
-- ADC 3 interface reset
ADC3RST : Boolean := False;
-- unspecified
Reserved_16_18 : HAL.UInt3 := 16#0#;
-- TIM9 timer reset
TIM9RST : Boolean := False;
-- TIM10 timer reset
TIM10RST : Boolean := False;
-- TIM11 timer reset
TIM11RST : Boolean := False;
-- unspecified
Reserved_22_31 : HAL.UInt10 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for APB2RSTR_Register use record
AFIORST at 0 range 0 .. 0;
Reserved_1_1 at 0 range 1 .. 1;
IOPARST at 0 range 2 .. 2;
IOPBRST at 0 range 3 .. 3;
IOPCRST at 0 range 4 .. 4;
IOPDRST at 0 range 5 .. 5;
IOPERST at 0 range 6 .. 6;
IOPFRST at 0 range 7 .. 7;
IOPGRST at 0 range 8 .. 8;
ADC1RST at 0 range 9 .. 9;
ADC2RST at 0 range 10 .. 10;
TIM1RST at 0 range 11 .. 11;
SPI1RST at 0 range 12 .. 12;
TIM8RST at 0 range 13 .. 13;
USART1RST at 0 range 14 .. 14;
ADC3RST at 0 range 15 .. 15;
Reserved_16_18 at 0 range 16 .. 18;
TIM9RST at 0 range 19 .. 19;
TIM10RST at 0 range 20 .. 20;
TIM11RST at 0 range 21 .. 21;
Reserved_22_31 at 0 range 22 .. 31;
end record;
-- APB1 peripheral reset register (RCC_APB1RSTR)
type APB1RSTR_Register is record
-- Timer 2 reset
TIM2RST : Boolean := False;
-- Timer 3 reset
TIM3RST : Boolean := False;
-- Timer 4 reset
TIM4RST : Boolean := False;
-- Timer 5 reset
TIM5RST : Boolean := False;
-- Timer 6 reset
TIM6RST : Boolean := False;
-- Timer 7 reset
TIM7RST : Boolean := False;
-- Timer 12 reset
TIM12RST : Boolean := False;
-- Timer 13 reset
TIM13RST : Boolean := False;
-- Timer 14 reset
TIM14RST : Boolean := False;
-- unspecified
Reserved_9_10 : HAL.UInt2 := 16#0#;
-- Window watchdog reset
WWDGRST : Boolean := False;
-- unspecified
Reserved_12_13 : HAL.UInt2 := 16#0#;
-- SPI2 reset
SPI2RST : Boolean := False;
-- SPI3 reset
SPI3RST : Boolean := False;
-- unspecified
Reserved_16_16 : HAL.Bit := 16#0#;
-- USART 2 reset
USART2RST : Boolean := False;
-- USART 3 reset
USART3RST : Boolean := False;
-- UART 4 reset
UART4RST : Boolean := False;
-- UART 5 reset
UART5RST : Boolean := False;
-- I2C1 reset
I2C1RST : Boolean := False;
-- I2C2 reset
I2C2RST : Boolean := False;
-- USB reset
USBRST : Boolean := False;
-- unspecified
Reserved_24_24 : HAL.Bit := 16#0#;
-- CAN reset
CANRST : Boolean := False;
-- unspecified
Reserved_26_26 : HAL.Bit := 16#0#;
-- Backup interface reset
BKPRST : Boolean := False;
-- Power interface reset
PWRRST : Boolean := False;
-- DAC interface reset
DACRST : Boolean := False;
-- unspecified
Reserved_30_31 : HAL.UInt2 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for APB1RSTR_Register use record
TIM2RST at 0 range 0 .. 0;
TIM3RST at 0 range 1 .. 1;
TIM4RST at 0 range 2 .. 2;
TIM5RST at 0 range 3 .. 3;
TIM6RST at 0 range 4 .. 4;
TIM7RST at 0 range 5 .. 5;
TIM12RST at 0 range 6 .. 6;
TIM13RST at 0 range 7 .. 7;
TIM14RST at 0 range 8 .. 8;
Reserved_9_10 at 0 range 9 .. 10;
WWDGRST at 0 range 11 .. 11;
Reserved_12_13 at 0 range 12 .. 13;
SPI2RST at 0 range 14 .. 14;
SPI3RST at 0 range 15 .. 15;
Reserved_16_16 at 0 range 16 .. 16;
USART2RST at 0 range 17 .. 17;
USART3RST at 0 range 18 .. 18;
UART4RST at 0 range 19 .. 19;
UART5RST at 0 range 20 .. 20;
I2C1RST at 0 range 21 .. 21;
I2C2RST at 0 range 22 .. 22;
USBRST at 0 range 23 .. 23;
Reserved_24_24 at 0 range 24 .. 24;
CANRST at 0 range 25 .. 25;
Reserved_26_26 at 0 range 26 .. 26;
BKPRST at 0 range 27 .. 27;
PWRRST at 0 range 28 .. 28;
DACRST at 0 range 29 .. 29;
Reserved_30_31 at 0 range 30 .. 31;
end record;
-- AHB Peripheral Clock enable register (RCC_AHBENR)
type AHBENR_Register is record
-- DMA1 clock enable
DMA1EN : Boolean := False;
-- DMA2 clock enable
DMA2EN : Boolean := False;
-- SRAM interface clock enable
SRAMEN : Boolean := True;
-- unspecified
Reserved_3_3 : HAL.Bit := 16#0#;
-- FLITF clock enable
FLITFEN : Boolean := True;
-- unspecified
Reserved_5_5 : HAL.Bit := 16#0#;
-- CRC clock enable
CRCEN : Boolean := False;
-- unspecified
Reserved_7_7 : HAL.Bit := 16#0#;
-- FSMC clock enable
FSMCEN : Boolean := False;
-- unspecified
Reserved_9_9 : HAL.Bit := 16#0#;
-- SDIO clock enable
SDIOEN : Boolean := False;
-- unspecified
Reserved_11_31 : HAL.UInt21 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for AHBENR_Register use record
DMA1EN at 0 range 0 .. 0;
DMA2EN at 0 range 1 .. 1;
SRAMEN at 0 range 2 .. 2;
Reserved_3_3 at 0 range 3 .. 3;
FLITFEN at 0 range 4 .. 4;
Reserved_5_5 at 0 range 5 .. 5;
CRCEN at 0 range 6 .. 6;
Reserved_7_7 at 0 range 7 .. 7;
FSMCEN at 0 range 8 .. 8;
Reserved_9_9 at 0 range 9 .. 9;
SDIOEN at 0 range 10 .. 10;
Reserved_11_31 at 0 range 11 .. 31;
end record;
-- APB2 peripheral clock enable register (RCC_APB2ENR)
type APB2ENR_Register is record
-- Alternate function I/O clock enable
AFIOEN : Boolean := False;
-- unspecified
Reserved_1_1 : HAL.Bit := 16#0#;
-- I/O port A clock enable
IOPAEN : Boolean := False;
-- I/O port B clock enable
IOPBEN : Boolean := False;
-- I/O port C clock enable
IOPCEN : Boolean := False;
-- I/O port D clock enable
IOPDEN : Boolean := False;
-- I/O port E clock enable
IOPEEN : Boolean := False;
-- I/O port F clock enable
IOPFEN : Boolean := False;
-- I/O port G clock enable
IOPGEN : Boolean := False;
-- ADC 1 interface clock enable
ADC1EN : Boolean := False;
-- ADC 2 interface clock enable
ADC2EN : Boolean := False;
-- TIM1 Timer clock enable
TIM1EN : Boolean := False;
-- SPI 1 clock enable
SPI1EN : Boolean := False;
-- TIM8 Timer clock enable
TIM8EN : Boolean := False;
-- USART1 clock enable
USART1EN : Boolean := False;
-- ADC3 interface clock enable
ADC3EN : Boolean := False;
-- unspecified
Reserved_16_18 : HAL.UInt3 := 16#0#;
-- TIM9 Timer clock enable
TIM9EN : Boolean := False;
-- TIM10 Timer clock enable
TIM10EN : Boolean := False;
-- TIM11 Timer clock enable
TIM11EN : Boolean := False;
-- unspecified
Reserved_22_31 : HAL.UInt10 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for APB2ENR_Register use record
AFIOEN at 0 range 0 .. 0;
Reserved_1_1 at 0 range 1 .. 1;
IOPAEN at 0 range 2 .. 2;
IOPBEN at 0 range 3 .. 3;
IOPCEN at 0 range 4 .. 4;
IOPDEN at 0 range 5 .. 5;
IOPEEN at 0 range 6 .. 6;
IOPFEN at 0 range 7 .. 7;
IOPGEN at 0 range 8 .. 8;
ADC1EN at 0 range 9 .. 9;
ADC2EN at 0 range 10 .. 10;
TIM1EN at 0 range 11 .. 11;
SPI1EN at 0 range 12 .. 12;
TIM8EN at 0 range 13 .. 13;
USART1EN at 0 range 14 .. 14;
ADC3EN at 0 range 15 .. 15;
Reserved_16_18 at 0 range 16 .. 18;
TIM9EN at 0 range 19 .. 19;
TIM10EN at 0 range 20 .. 20;
TIM11EN at 0 range 21 .. 21;
Reserved_22_31 at 0 range 22 .. 31;
end record;
-- APB1 peripheral clock enable register (RCC_APB1ENR)
type APB1ENR_Register is record
-- Timer 2 clock enable
TIM2EN : Boolean := False;
-- Timer 3 clock enable
TIM3EN : Boolean := False;
-- Timer 4 clock enable
TIM4EN : Boolean := False;
-- Timer 5 clock enable
TIM5EN : Boolean := False;
-- Timer 6 clock enable
TIM6EN : Boolean := False;
-- Timer 7 clock enable
TIM7EN : Boolean := False;
-- Timer 12 clock enable
TIM12EN : Boolean := False;
-- Timer 13 clock enable
TIM13EN : Boolean := False;
-- Timer 14 clock enable
TIM14EN : Boolean := False;
-- unspecified
Reserved_9_10 : HAL.UInt2 := 16#0#;
-- Window watchdog clock enable
WWDGEN : Boolean := False;
-- unspecified
Reserved_12_13 : HAL.UInt2 := 16#0#;
-- SPI 2 clock enable
SPI2EN : Boolean := False;
-- SPI 3 clock enable
SPI3EN : Boolean := False;
-- unspecified
Reserved_16_16 : HAL.Bit := 16#0#;
-- USART 2 clock enable
USART2EN : Boolean := False;
-- USART 3 clock enable
USART3EN : Boolean := False;
-- UART 4 clock enable
UART4EN : Boolean := False;
-- UART 5 clock enable
UART5EN : Boolean := False;
-- I2C 1 clock enable
I2C1EN : Boolean := False;
-- I2C 2 clock enable
I2C2EN : Boolean := False;
-- USB clock enable
USBEN : Boolean := False;
-- unspecified
Reserved_24_24 : HAL.Bit := 16#0#;
-- CAN clock enable
CANEN : Boolean := False;
-- unspecified
Reserved_26_26 : HAL.Bit := 16#0#;
-- Backup interface clock enable
BKPEN : Boolean := False;
-- Power interface clock enable
PWREN : Boolean := False;
-- DAC interface clock enable
DACEN : Boolean := False;
-- unspecified
Reserved_30_31 : HAL.UInt2 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for APB1ENR_Register use record
TIM2EN at 0 range 0 .. 0;
TIM3EN at 0 range 1 .. 1;
TIM4EN at 0 range 2 .. 2;
TIM5EN at 0 range 3 .. 3;
TIM6EN at 0 range 4 .. 4;
TIM7EN at 0 range 5 .. 5;
TIM12EN at 0 range 6 .. 6;
TIM13EN at 0 range 7 .. 7;
TIM14EN at 0 range 8 .. 8;
Reserved_9_10 at 0 range 9 .. 10;
WWDGEN at 0 range 11 .. 11;
Reserved_12_13 at 0 range 12 .. 13;
SPI2EN at 0 range 14 .. 14;
SPI3EN at 0 range 15 .. 15;
Reserved_16_16 at 0 range 16 .. 16;
USART2EN at 0 range 17 .. 17;
USART3EN at 0 range 18 .. 18;
UART4EN at 0 range 19 .. 19;
UART5EN at 0 range 20 .. 20;
I2C1EN at 0 range 21 .. 21;
I2C2EN at 0 range 22 .. 22;
USBEN at 0 range 23 .. 23;
Reserved_24_24 at 0 range 24 .. 24;
CANEN at 0 range 25 .. 25;
Reserved_26_26 at 0 range 26 .. 26;
BKPEN at 0 range 27 .. 27;
PWREN at 0 range 28 .. 28;
DACEN at 0 range 29 .. 29;
Reserved_30_31 at 0 range 30 .. 31;
end record;
subtype BDCR_RTCSEL_Field is HAL.UInt2;
-- Backup domain control register (RCC_BDCR)
type BDCR_Register is record
-- External Low Speed oscillator enable
LSEON : Boolean := False;
-- Read-only. External Low Speed oscillator ready
LSERDY : Boolean := False;
-- External Low Speed oscillator bypass
LSEBYP : Boolean := False;
-- unspecified
Reserved_3_7 : HAL.UInt5 := 16#0#;
-- RTC clock source selection
RTCSEL : BDCR_RTCSEL_Field := 16#0#;
-- unspecified
Reserved_10_14 : HAL.UInt5 := 16#0#;
-- RTC clock enable
RTCEN : Boolean := False;
-- Backup domain software reset
BDRST : Boolean := False;
-- unspecified
Reserved_17_31 : HAL.UInt15 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BDCR_Register use record
LSEON at 0 range 0 .. 0;
LSERDY at 0 range 1 .. 1;
LSEBYP at 0 range 2 .. 2;
Reserved_3_7 at 0 range 3 .. 7;
RTCSEL at 0 range 8 .. 9;
Reserved_10_14 at 0 range 10 .. 14;
RTCEN at 0 range 15 .. 15;
BDRST at 0 range 16 .. 16;
Reserved_17_31 at 0 range 17 .. 31;
end record;
-- Control/status register (RCC_CSR)
type CSR_Register is record
-- Internal low speed oscillator enable
LSION : Boolean := False;
-- Read-only. Internal low speed oscillator ready
LSIRDY : Boolean := False;
-- unspecified
Reserved_2_23 : HAL.UInt22 := 16#0#;
-- Remove reset flag
RMVF : Boolean := False;
-- unspecified
Reserved_25_25 : HAL.Bit := 16#0#;
-- PIN reset flag
PINRSTF : Boolean := True;
-- POR/PDR reset flag
PORRSTF : Boolean := True;
-- Software reset flag
SFTRSTF : Boolean := False;
-- Independent watchdog reset flag
IWDGRSTF : Boolean := False;
-- Window watchdog reset flag
WWDGRSTF : Boolean := False;
-- Low-power reset flag
LPWRRSTF : Boolean := False;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for CSR_Register use record
LSION at 0 range 0 .. 0;
LSIRDY at 0 range 1 .. 1;
Reserved_2_23 at 0 range 2 .. 23;
RMVF at 0 range 24 .. 24;
Reserved_25_25 at 0 range 25 .. 25;
PINRSTF at 0 range 26 .. 26;
PORRSTF at 0 range 27 .. 27;
SFTRSTF at 0 range 28 .. 28;
IWDGRSTF at 0 range 29 .. 29;
WWDGRSTF at 0 range 30 .. 30;
LPWRRSTF at 0 range 31 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Reset and clock control
type RCC_Peripheral is record
-- Clock control register
CR : aliased CR_Register;
-- Clock configuration register (RCC_CFGR)
CFGR : aliased CFGR_Register;
-- Clock interrupt register (RCC_CIR)
CIR : aliased CIR_Register;
-- APB2 peripheral reset register (RCC_APB2RSTR)
APB2RSTR : aliased APB2RSTR_Register;
-- APB1 peripheral reset register (RCC_APB1RSTR)
APB1RSTR : aliased APB1RSTR_Register;
-- AHB Peripheral Clock enable register (RCC_AHBENR)
AHBENR : aliased AHBENR_Register;
-- APB2 peripheral clock enable register (RCC_APB2ENR)
APB2ENR : aliased APB2ENR_Register;
-- APB1 peripheral clock enable register (RCC_APB1ENR)
APB1ENR : aliased APB1ENR_Register;
-- Backup domain control register (RCC_BDCR)
BDCR : aliased BDCR_Register;
-- Control/status register (RCC_CSR)
CSR : aliased CSR_Register;
end record
with Volatile;
for RCC_Peripheral use record
CR at 16#0# range 0 .. 31;
CFGR at 16#4# range 0 .. 31;
CIR at 16#8# range 0 .. 31;
APB2RSTR at 16#C# range 0 .. 31;
APB1RSTR at 16#10# range 0 .. 31;
AHBENR at 16#14# range 0 .. 31;
APB2ENR at 16#18# range 0 .. 31;
APB1ENR at 16#1C# range 0 .. 31;
BDCR at 16#20# range 0 .. 31;
CSR at 16#24# range 0 .. 31;
end record;
-- Reset and clock control
RCC_Periph : aliased RCC_Peripheral
with Import, Address => System'To_Address (16#40021000#);
end STM32_SVD.RCC;
| 35.486933 | 76 | 0.53099 |
5eb416d37f9acce2f559f121daa9955f4d4893f0 | 189 | ads | Ada | src/ini-section_vector.ads | SSOCsoft/Log_Reporter | 9351ce0b5bda6909d7b9fac3436a702393188fc9 | [
"MIT"
] | null | null | null | src/ini-section_vector.ads | SSOCsoft/Log_Reporter | 9351ce0b5bda6909d7b9fac3436a702393188fc9 | [
"MIT"
] | null | null | null | src/ini-section_vector.ads | SSOCsoft/Log_Reporter | 9351ce0b5bda6909d7b9fac3436a702393188fc9 | [
"MIT"
] | null | null | null | With
NSO.Types;
-- Section_Vector returns the names of the sections; empty-name excluded.
Function INI.Section_Vector( Object : in Instance )
return NSO.Types.String_Vector.Vector;
| 27 | 73 | 0.767196 |
19988e8962368b19778f55627dab8dc3ef750e34 | 118 | ads | Ada | include/xcb_util.ads | docandrew/troodon | 9240611708f92ffb5491fa677bffb6ecac58a51e | [
"MIT"
] | 5 | 2021-11-03T04:34:16.000Z | 2021-11-10T23:06:30.000Z | include/xcb_util.ads | docandrew/troodon | 9240611708f92ffb5491fa677bffb6ecac58a51e | [
"MIT"
] | null | null | null | include/xcb_util.ads | docandrew/troodon | 9240611708f92ffb5491fa677bffb6ecac58a51e | [
"MIT"
] | null | null | null | pragma Ada_2012;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
package xcb_util is
end xcb_util;
| 13.111111 | 36 | 0.779661 |
8bbc8b0196b24ef0e8e08d900cccb15f5ef95b74 | 1,064 | ads | Ada | extern/game_support/src/backends/opengl_sdl_gnat_sdl2/display-basic-fonts.ads | AdaCore/training_material | 6651eb2c53f8c39649b8e0b3c757bc8ff963025a | [
"CC-BY-4.0"
] | 15 | 2020-10-07T08:56:45.000Z | 2022-02-08T23:13:22.000Z | extern/game_support/src/backends/opengl_sdl_gnat_sdl2/display-basic-fonts.ads | AdaCore/training_material | 6651eb2c53f8c39649b8e0b3c757bc8ff963025a | [
"CC-BY-4.0"
] | 20 | 2020-11-05T14:35:20.000Z | 2022-01-13T15:59:33.000Z | extern/game_support/src/backends/pure_sdl_gnat_sdl2/display-basic-fonts.ads | AdaCore/training_material | 6651eb2c53f8c39649b8e0b3c757bc8ff963025a | [
"CC-BY-4.0"
] | 6 | 2020-10-08T15:57:06.000Z | 2021-08-31T12:03:08.000Z | with Display.Basic.Utils; use Display.Basic.Utils;
with SDL_stdinc_h; use SDL_stdinc_h;
with SDL_surface_h; use SDL_surface_h;
package Display.Basic.Fonts is
type BMP_Font is (Font8x8, Font12x12, Font16x24);
procedure Draw_Char
(S : access SDL_Surface;
P : Screen_Point;
Char : Character;
Font : BMP_Font;
FG, BG : Uint32);
procedure Draw_Char
(Canvas : T_Internal_Canvas;
P : Screen_Point;
Char : Character;
Font : BMP_Font;
FG, BG : Uint32);
procedure Draw_String
(S : access SDL_Surface;
P : Screen_Point;
Str : String;
Font : BMP_Font;
FG, BG : RGBA_T;
Wrap : Boolean := False);
procedure Draw_String
(Canvas : T_Internal_Canvas;
P : Screen_Point;
Str : String;
Font : BMP_Font;
FG, BG : RGBA_T;
Wrap : Boolean := False);
function Char_Size (Font : BMP_Font) return Screen_Point;
function String_Size (Font : BMP_Font; Text : String) return Screen_Point;
end Display.Basic.Fonts;
| 24.181818 | 77 | 0.629699 |
5e5d3bdd15bdf5e4521fa4c9b0facc0ea63365ff | 4,898 | ads | Ada | source/amf/ocl/amf-ocl-set_types-collections.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-set_types-collections.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-set_types-collections.ads | svn2github/matreshka | 9d222b3ad9da508855fb1f5adbe5e8a4fad4c530 | [
"BSD-3-Clause"
] | 4 | 2017-07-18T07:11:05.000Z | 2020-06-21T03:02:25.000Z | ------------------------------------------------------------------------------
-- --
-- Matreshka Project --
-- --
-- Ada Modeling Framework --
-- --
-- Runtime Library Component --
-- --
------------------------------------------------------------------------------
-- --
-- Copyright © 2012-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.Generic_Collections;
package AMF.OCL.Set_Types.Collections is
pragma Preelaborate;
package OCL_Set_Type_Collections is
new AMF.Generic_Collections
(OCL_Set_Type,
OCL_Set_Type_Access);
type Set_Of_OCL_Set_Type is
new OCL_Set_Type_Collections.Set with null record;
Empty_Set_Of_OCL_Set_Type : constant Set_Of_OCL_Set_Type;
type Ordered_Set_Of_OCL_Set_Type is
new OCL_Set_Type_Collections.Ordered_Set with null record;
Empty_Ordered_Set_Of_OCL_Set_Type : constant Ordered_Set_Of_OCL_Set_Type;
type Bag_Of_OCL_Set_Type is
new OCL_Set_Type_Collections.Bag with null record;
Empty_Bag_Of_OCL_Set_Type : constant Bag_Of_OCL_Set_Type;
type Sequence_Of_OCL_Set_Type is
new OCL_Set_Type_Collections.Sequence with null record;
Empty_Sequence_Of_OCL_Set_Type : constant Sequence_Of_OCL_Set_Type;
private
Empty_Set_Of_OCL_Set_Type : constant Set_Of_OCL_Set_Type
:= (OCL_Set_Type_Collections.Set with null record);
Empty_Ordered_Set_Of_OCL_Set_Type : constant Ordered_Set_Of_OCL_Set_Type
:= (OCL_Set_Type_Collections.Ordered_Set with null record);
Empty_Bag_Of_OCL_Set_Type : constant Bag_Of_OCL_Set_Type
:= (OCL_Set_Type_Collections.Bag with null record);
Empty_Sequence_Of_OCL_Set_Type : constant Sequence_Of_OCL_Set_Type
:= (OCL_Set_Type_Collections.Sequence with null record);
end AMF.OCL.Set_Types.Collections;
| 53.23913 | 78 | 0.506125 |
384f9cda7413c51306423363a845d9abab00d9cf | 4,402 | ads | Ada | tools-src/gnu/gcc/gcc/ada/a-tideau.ads | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 80 | 2015-01-02T10:14:04.000Z | 2021-06-07T06:29:49.000Z | tools-src/gnu/gcc/gcc/ada/a-tideau.ads | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 9 | 2015-05-14T11:03:12.000Z | 2018-01-04T07:12:58.000Z | tools-src/gnu/gcc/gcc/ada/a-tideau.ads | modern-tomato/tomato | 96f09fab4929c6ddde5c9113f1b2476ad37133c4 | [
"FSFAP"
] | 69 | 2015-01-02T10:45:56.000Z | 2021-09-06T07:52:13.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . T E X T _ I O . D E C I M A L _ A U X --
-- --
-- S p e c --
-- --
-- $Revision$
-- --
-- Copyright (C) 1992-1997 Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 2, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNAT; see file COPYING. If not, write --
-- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, --
-- MA 02111-1307, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
-- This package contains the routines for Ada.Text_IO.Decimal_IO that are
-- shared among separate instantiations of this package. The routines in
-- the package are identical semantically to those declared in Text_IO,
-- except that default values have been supplied by the generic, and the
-- Num parameter has been replaced by Integer or Long_Long_Integer, with
-- an additional Scale parameter giving the value of Num'Scale. In addition
-- the Get routines return the value rather than store it in an Out parameter.
private package Ada.Text_IO.Decimal_Aux is
function Get_Dec
(File : in File_Type;
Width : in Field;
Scale : Integer)
return Integer;
function Get_LLD
(File : in File_Type;
Width : in Field;
Scale : Integer)
return Long_Long_Integer;
procedure Put_Dec
(File : File_Type;
Item : Integer;
Fore : in Field;
Aft : in Field;
Exp : in Field;
Scale : Integer);
procedure Put_LLD
(File : in File_Type;
Item : in Long_Long_Integer;
Fore : in Field;
Aft : in Field;
Exp : in Field;
Scale : Integer);
function Gets_Dec
(From : in String;
Last : access Positive;
Scale : Integer)
return Integer;
function Gets_LLD
(From : in String;
Last : access Positive;
Scale : Integer)
return Long_Long_Integer;
procedure Puts_Dec
(To : out String;
Item : in Integer;
Aft : in Field;
Exp : in Field;
Scale : Integer);
procedure Puts_LLD
(To : out String;
Item : in Long_Long_Integer;
Aft : in Field;
Exp : in Field;
Scale : Integer);
end Ada.Text_IO.Decimal_Aux;
| 43.584158 | 79 | 0.488187 |
5ee8259046e91b3b4eda44fdd1b082afa1480c51 | 2,704 | ada | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c35801d.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/c3/c35801d.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c3/c35801d.ada | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- C35801D.ADA
-- Grant of Unlimited Rights
--
-- Under contracts F33600-87-D-0337, F33600-84-D-0280, MDA903-79-C-0687,
-- F08630-91-C-0015, and DCA100-97-D-0025, the U.S. Government obtained
-- unlimited rights in the software and documentation contained herein.
-- Unlimited rights are defined in DFAR 252.227-7013(a)(19). By making
-- this public release, the Government intends to confer upon all
-- recipients unlimited rights equal to those held by the Government.
-- These rights include rights to use, duplicate, release or disclose the
-- released technical data and computer software in whole or in part, in
-- any manner and for any purpose whatsoever, and to have or permit others
-- to do so.
--
-- DISCLAIMER
--
-- ALL MATERIALS OR INFORMATION HEREIN RELEASED, MADE AVAILABLE OR
-- DISCLOSED ARE AS IS. THE GOVERNMENT MAKES NO EXPRESS OR IMPLIED
-- WARRANTY AS TO ANY MATTER WHATSOEVER, INCLUDING THE CONDITIONS OF THE
-- SOFTWARE, DOCUMENTATION OR OTHER INFORMATION RELEASED, MADE AVAILABLE
-- OR DISCLOSED, OR THE OWNERSHIP, MERCHANTABILITY, OR FITNESS FOR A
-- PARTICULAR PURPOSE OF SAID MATERIAL.
--*
-- CHECK THAT THE ATTRIBUTES FIRST AND LAST RETURN VALUES HAVING THE
-- SAME BASE TYPE AS THE PREFIX WHEN THE PREFIX IS A GENERIC FORMAL
-- SUBTYPE WHOSE ACTUAL ARGUMENT IS A FLOATING POINT TYPE.
-- R.WILLIAMS 8/21/86
WITH REPORT; USE REPORT;
PROCEDURE C35801D IS
TYPE REAL IS DIGITS 3 RANGE -100.0 .. 100.0;
TYPE NFLT IS NEW FLOAT;
GENERIC
TYPE F IS DIGITS <>;
PROCEDURE P (STR : STRING);
PROCEDURE P (STR : STRING) IS
SUBTYPE SF IS F RANGE -1.0 .. 1.0;
F1 : SF := 0.0;
F2 : SF := 0.0;
BEGIN
IF EQUAL (3, 3) THEN
F1 := SF'FIRST;
F2 := SF'LAST;
END IF;
IF F1 /= -1.0 OR F2 /= 1.0 THEN
FAILED ( "WRONG RESULTS FROM " & STR & "'FIRST OR " &
STR & "'LAST" );
END IF;
END P;
PROCEDURE NP1 IS NEW P (FLOAT);
PROCEDURE NP2 IS NEW P (NFLT);
PROCEDURE NP3 IS NEW P (REAL);
BEGIN
TEST ( "C35801D", "CHECK THAT THE ATTRIBUTES FIRST AND " &
"LAST RETURN VALUES HAVING THE SAME " &
"BASE TYPE AS THE PREFIX WHEN THE " &
"PREFIX IS A GENERIC FORMAL SUBTYPE " &
"WHOSE ACTUAL ARGUMENT IS A FLOATING " &
"POINT TYPE" );
NP1 ("FLOAT");
NP2 ("NFLT");
NP3 ("REAL");
RESULT;
END C35801D;
| 33.8 | 79 | 0.58284 |
8bb81b1d554a7a8efd748aefff1d44ca789b81b3 | 252 | ada | Ada | Task/Host-introspection/Ada/host-introspection.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | 1 | 2018-11-09T22:08:38.000Z | 2018-11-09T22:08:38.000Z | Task/Host-introspection/Ada/host-introspection.ada | mullikine/RosettaCodeData | 4f0027c6ce83daa36118ee8b67915a13cd23ab67 | [
"Info-ZIP"
] | null | null | null | Task/Host-introspection/Ada/host-introspection.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 System; use System;
procedure Host_Introspection is
begin
Put_Line ("Word size" & Integer'Image (Word_Size));
Put_Line ("Endianness " & Bit_Order'Image (Default_Bit_Order));
end Host_Introspection;
| 28 | 66 | 0.742063 |
2ead18fab4723d299b41c99b7b3d0433d2122495 | 6,483 | adb | Ada | .emacs.d/elpa/wisi-3.0.1/sal-gen_unbounded_definite_stacks.adb | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/wisi-3.0.1/sal-gen_unbounded_definite_stacks.adb | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | .emacs.d/elpa/wisi-3.0.1/sal-gen_unbounded_definite_stacks.adb | caqg/linux-home | eed631aae6f5e59e4f46e14f1dff443abca5fa28 | [
"Linux-OpenIB"
] | null | null | null | -- Abstract:
--
-- see spec
--
-- Copyright (C) 1998, 2003, 2009, 2015, 2017 - 2019 Free Software Foundation, Inc.
--
-- SAL 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. SAL 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 SAL; see file COPYING. If not, write to the Free Software
-- Foundation, 59 Temple Place - Suite 330, Boston, MA 02111-1307,
-- USA.
--
-- As a special exception, if other files instantiate generics from
-- SAL, or you link SAL object files with other files to produce an
-- executable, that does not by itself cause the resulting executable
-- to be covered by the GNU General Public License. This exception
-- does not however invalidate any other reasons why the executable
-- file might be covered by the GNU Public License.
pragma License (Modified_GPL);
package body SAL.Gen_Unbounded_Definite_Stacks is
----------
-- local subprogram bodies
procedure Grow (Stack : in out Sguds.Stack; Desired_Size : in Base_Peek_Type)
is
New_Data : constant Element_Array_Access := new Element_Array (1 .. Desired_Size);
begin
New_Data (1 .. Stack.Top) := Stack.Data (1 .. Stack.Top);
Free (Stack.Data);
Stack.Data := New_Data;
end Grow;
----------
-- Spec visible subprograms
overriding procedure Finalize (Stack : in out Sguds.Stack)
is begin
if Stack.Data /= null then
Free (Stack.Data);
Stack.Top := Invalid_Peek_Index;
end if;
end Finalize;
overriding procedure Adjust (Stack : in out Sguds.Stack)
is begin
if Stack.Data /= null then
Stack.Data := new Element_Array'(Stack.Data.all);
end if;
end Adjust;
overriding
function "=" (Left, Right : in Sguds.Stack) return Boolean
is begin
if Left.Data = null then
return Right.Data = null;
elsif Left.Top /= Right.Top then
return False;
else
-- Assume stacks differ near top.
for I in reverse 1 .. Left.Top loop
if Left.Data (I) /= Right.Data (I) then
return False;
end if;
end loop;
return True;
end if;
end "=";
procedure Clear (Stack : in out Sguds.Stack)
is begin
-- We don't change the reserved capacity, on the assumption the
-- stack will be used again.
Stack.Top := 0;
end Clear;
function Depth (Stack : in Sguds.Stack) return Base_Peek_Type
is begin
return Stack.Top;
end Depth;
function Is_Empty (Stack : in Sguds.Stack) return Boolean
is begin
return Stack.Top = 0;
end Is_Empty;
function Peek
(Stack : in Sguds.Stack;
Index : in Peek_Type := 1)
return Element_Type
is begin
return Stack.Data (Stack.Top - Index + 1);
end Peek;
procedure Pop (Stack : in out Sguds.Stack; Count : in Base_Peek_Type := 1)
is begin
if Stack.Top < Count then
raise Container_Empty;
else
Stack.Top := Stack.Top - Count;
end if;
end Pop;
function Pop (Stack : in out Sguds.Stack) return Element_Type
is begin
if Stack.Top = 0 then
raise Container_Empty;
else
return Result : constant Element_Type := Stack.Peek (1)
do
Stack.Top := Stack.Top - 1;
end return;
end if;
end Pop;
procedure Push (Stack : in out Sguds.Stack; Item : in Element_Type)
is begin
if Stack.Data = null then
-- Adding a generic parameter for a reasonably large default initial
-- size here makes Wisitoken McKenzie recover slightly slower,
-- presumably due to increased cache thrashing.
Stack.Data := new Element_Array (1 .. 2);
elsif Stack.Top = Stack.Data'Last then
Grow (Stack, Desired_Size => 2 * Stack.Data'Last);
end if;
Stack.Top := Stack.Top + 1;
Stack.Data (Stack.Top) := Item;
end Push;
function Top (Stack : in Sguds.Stack) return Element_Type
is begin
if Stack.Top < 1 then
raise SAL.Container_Empty;
else
return Peek (Stack, 1);
end if;
end Top;
procedure Set_Depth
(Stack : in out Sguds.Stack;
Depth : in Peek_Type)
is begin
if Stack.Data = null then
Stack.Data := new Element_Array (1 .. 2 * Depth);
elsif Depth > Stack.Data'Last then
Grow (Stack, Desired_Size => 2 * Depth);
end if;
end Set_Depth;
procedure Set
(Stack : in out Sguds.Stack;
Index : in Peek_Type;
Depth : in Peek_Type;
Element : in Element_Type)
is begin
-- Same Position algorithm as in Peek
Stack.Top := Depth;
Stack.Data (Depth - Index + 1) := Element;
end Set;
function Constant_Reference
(Container : aliased in Stack'Class;
Position : in Peek_Type)
return Constant_Reference_Type
is begin
return
(Element => Container.Data (Container.Top - Position + 1)'Access,
Dummy => 1);
end Constant_Reference;
function Constant_Reference
(Container : aliased in Stack'Class;
Position : in Cursor)
return Constant_Reference_Type
is begin
return
(Element => Container.Data (Container.Top - Position.Ptr + 1)'Access,
Dummy => 1);
end Constant_Reference;
function Has_Element (Position : in Cursor) return Boolean
is begin
return Position.Container.Depth >= Position.Ptr;
end Has_Element;
function Iterate (Container : aliased in Stack) return Iterator_Interfaces.Forward_Iterator'Class
is begin
return Iterator'(Container => Container'Unrestricted_Access);
end Iterate;
overriding function First (Object : Iterator) return Cursor
is begin
return (Object.Container, 1);
end First;
overriding function Next (Object : in Iterator; Position : in Cursor) return Cursor
is
pragma Unreferenced (Object);
begin
return (Position.Container, Position.Ptr + 1);
end Next;
end SAL.Gen_Unbounded_Definite_Stacks;
| 30.725118 | 100 | 0.640753 |
38defa5412c9358b46e5d58221da8fbad96a3050 | 405 | adb | Ada | stm32f1/stm32gd-spi-peripheral.adb | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 1 | 2021-04-06T07:57:56.000Z | 2021-04-06T07:57:56.000Z | stm32f1/stm32gd-spi-peripheral.adb | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | null | null | null | stm32f1/stm32gd-spi-peripheral.adb | ekoeppen/STM32_Generic_Ada_Drivers | 4ff29c3026c4b24280baf22a5b81ea9969375466 | [
"MIT"
] | 2 | 2018-05-29T13:59:31.000Z | 2019-02-03T19:48:08.000Z | package body STM32GD.SPI.Peripheral is
procedure Init is
begin
null;
end Init;
procedure Transfer (Data : in out SPI_Data_8b) is
begin
while SPI.SR.TXE = 0 loop
null;
end loop;
SPI.DR.DR := UInt16 (Data (0));
while SPI.SR.RXNE = 0 loop
null;
end loop;
Data (0) := Byte (SPI.DR.DR);
end Transfer;
end STM32GD.SPI.Peripheral;
| 19.285714 | 52 | 0.580247 |
8bcd7582383662f553adbc1906b0b782edf6b676 | 7,982 | ads | Ada | 3-mid/impact/source/2d/collision/impact-d2-collision.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/impact/source/2d/collision/impact-d2-collision.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/impact/source/2d/collision/impact-d2-collision.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | with impact.d2.Math;
limited
with impact.d2.Shape;
package impact.d2.Collision
--
-- Types and subprograms used for computing contact points, distance queries, and Time of Impact (TOI) queries.
--
is
use impact.d2.Math;
-- class b2Shape;
-- class b2CircleShape;
-- class b2PolygonShape;
b2_nullFeature : constant uint8 := uint8'Last;
--- Contact ids to facilitate warm starting.
--
type b2ContactID_Features is
record
referenceEdge : uint8; -- The edge that defines the outward contact normal.
incidentEdge : uint8; -- The edge most anti-parallel to the reference edge.
incidentVertex : uint8; -- The vertex (0 or 1) on the incident edge that was clipped.
flip : uint8; -- A value of 1 indicates that the reference edge is on shape2.
end record;
type b2ContactID_Kind is (with_features, with_key);
type b2ContactID (Kind : b2ContactID_Kind := with_features) is
record
case Kind is
when with_features => Features : b2ContactID_Features;
when with_key => Key : uint32; -- Used to quickly compare contact ids.
end case;
end record;
pragma Unchecked_Union (b2ContactID);
-- A manifold point is a contact point belonging to a contact
-- manifold. It holds details related to the geometry and dynamics
-- of the contact points.
-- The local point usage depends on the manifold type:
-- -e_circles: the local center of circleB
-- -e_faceA: the local center of cirlceB or the clip point of polygonB
-- -e_faceB: the clip point of polygonA
-- This structure is stored across time steps, so we keep it small.
-- Note: the impulses are used for internal caching and may not
-- provide reliable contact forces, especially for high speed collisions.
--
type b2ManifoldPoint is
record
localPoint : b2Vec2; -- usage depends on manifold type
normalImpulse : float32; -- the non-penetration impulse
tangentImpulse : float32; -- the friction impulse
id : b2ContactID; -- uniquely identifies a contact point between two shapes
end record;
type manifold_Points is array (int32 range <>) of aliased b2ManifoldPoint;
-- A manifold for two touching convex shapes.
--
-- Box2D supports multiple types of contact:
-- - clip point versus plane with radius
-- - point versus point with radius (circles)
--
-- The local point usage depends on the manifold type:
-- -e_circles: the local center of circleA
-- -e_faceA: the center of faceA
-- -e_faceB: the center of faceB
--
-- Similarly the local normal usage:
-- -e_circles: not used
-- -e_faceA: the normal on polygonA
-- -e_faceB: the normal on polygonB
--
-- We store contacts in this way so that position correction can
-- account for movement, which is critical for continuous physics.
-- All contact scenarios must be expressed in one of these types.
--
-- This structure is stored across time steps, so we keep it small.
--
type b2Manifold_Kind is (e_circles, e_faceA, e_faceB);
type b2Manifold is
record
points : manifold_Points (1 .. b2_maxManifoldPoints); -- the points of contact
localNormal : b2Vec2; -- not use for Type::e_points
localPoint : b2Vec2; -- usage depends on manifold type
Kind : b2Manifold_Kind;
pointCount : int32; -- the number of manifold points
end record;
-- This is used to compute the current state of a contact manifold.
--
type b2WorldManifold is
record
normal : b2Vec2; -- world vector pointing from A to B
points : b2Vec2_array (1 .. b2_maxManifoldPoints); -- world contact point (point of intersection)
end record;
-- Evaluate the manifold with supplied transforms. This assumes
-- modest motion from the original state. This does not change the
-- point count, impulses, etc. The radii must come from the shapes
-- that generated the manifold.
--
procedure Initialize (Self : in out b2WorldManifold; manifold : in b2Manifold;
xfA : in b2Transform; radiusA : in float32;
xfB : in b2Transform; radiusB : in float32);
-- This is used for determining the state of contact points.
--
type b2PointState is (b2_nullState, -- point does not exist
b2_addState, -- point was added in the update
b2_persistState, -- point persisted across the update
b2_removeState); -- point was removed in the update
type b2PointStates is array (int32 range 1 .. b2_maxManifoldPoints) of b2PointState;
-- Compute the point states given two manifolds. The states pertain to the transition from manifold1
-- to manifold2. So state1 is either persist or remove while state2 is either add or persist.
--
procedure b2GetPointStates (state1, state2 : access b2PointStates;
manifold1, manifold2 : access constant b2Manifold);
--- Used for computing contact manifolds.
--
type b2ClipVertex is
record
v : b2Vec2;
id : b2ContactID;
end record;
type b2ClipVertices is array (int32 range 1 .. 2) of b2ClipVertex;
--- Ray-cast input data. The ray extends from p1 to p1 + maxFraction * (p2 - p1).
--
type b2RayCastInput is
record
p1, p2 : b2Vec2;
maxFraction : float32;
end record;
--- Ray-cast output data. The ray hits at p1 + fraction * (p2 - p1), where p1 and p2 come from b2RayCastInput.
--
type b2RayCastOutput is
record
normal : b2Vec2;
fraction : float32;
end record;
--- An axis aligned bounding box.
--
type b2AABB is tagged
record
lowerBound : b2Vec2; -- the lower vertex
upperBound : b2Vec2; -- the upper vertex
end record;
function IsValid (Self : in b2AABB) return Boolean; -- Verify that the bounds are sorted.
function getCenter (Self : in b2AABB) return b2Vec2;
function getExtents (Self : in b2AABB) return b2Vec2; -- Get the extents of the AABB (half-widths).
function getPerimeter (Self : in b2AABB) return float32; -- Get the perimeter length
procedure combine (Self : in out b2AABB; aabb1, aabb2 : in b2AABB); -- Combine two AABBs into this one.
function Contains (Self : in b2AABB; aabb : in b2AABB) return Boolean; -- Does this aabb contain the provided AABB.
function rayCast (Self : in b2AABB; output : access b2RayCastOutput;
input : in b2RayCastInput) return Boolean;
function b2TestOverlap (a, b : in b2AABB) return Boolean;
function b2TestOverlap (shapeA, shapeB : access Shape.b2Shape'Class;
xfA, xfB : in b2Transform ) return Boolean;
-- Clipping for contact manifolds.
--
function b2ClipSegmentToLine (vOut : access b2ClipVertices;
vIn : in b2ClipVertices;
normal : in b2Vec2 ;
offset : in float32 ) return int32;
end impact.d2.Collision;
| 35.954955 | 135 | 0.589451 |
a06299246ca7dd2ef0bf5eb546c1fa88212886b9 | 7,636 | ads | Ada | src/pulse/pulse_simple_h.ads | fintatarta/pulsada | 043ab895a8cf3b4b491dcf30ca2693de54daf2da | [
"MIT"
] | null | null | null | src/pulse/pulse_simple_h.ads | fintatarta/pulsada | 043ab895a8cf3b4b491dcf30ca2693de54daf2da | [
"MIT"
] | null | null | null | src/pulse/pulse_simple_h.ads | fintatarta/pulsada | 043ab895a8cf3b4b491dcf30ca2693de54daf2da | [
"MIT"
] | null | null | null | pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
with Interfaces.C.Strings;
with pulse_def_h;
with pulse_sample_h;
limited with pulse_channelmap_h;
with System;
package pulse_simple_h is
--**
-- This file is part of PulseAudio.
-- Copyright 2004-2006 Lennart Poettering
-- Copyright 2006 Pierre Ossman <[email protected]> for Cendio AB
-- PulseAudio is free software; you can redistribute it and/or modify
-- it under the terms of the GNU Lesser General Public License as published
-- by the Free Software Foundation; either version 2.1 of the License,
-- or (at your option) any later version.
-- PulseAudio 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 Lesser General Public License
-- along with PulseAudio; if not, write to the Free Software
-- Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307
-- USA.
--**
--* \page simple Simple API
-- *
-- * \section overv_sec Overview
-- *
-- * The simple API is designed for applications with very basic sound
-- * playback or capture needs. It can only support a single stream per
-- * connection and has no support for handling of complex features like
-- * events, channel mappings and volume control. It is, however, very simple
-- * to use and quite sufficient for many programs.
-- *
-- * \section conn_sec Connecting
-- *
-- * The first step before using the sound system is to connect to the
-- * server. This is normally done this way:
-- *
-- * \code
-- * pa_simple *s;
-- * pa_sample_spec ss;
-- *
-- * ss.format = PA_SAMPLE_S16NE;
-- * ss.channels = 2;
-- * ss.rate = 44100;
-- *
-- * s = pa_simple_new(NULL, // Use the default server.
-- * "Fooapp", // Our application's name.
-- * PA_STREAM_PLAYBACK,
-- * NULL, // Use the default device.
-- * "Music", // Description of our stream.
-- * &ss, // Our sample format.
-- * NULL, // Use default channel map
-- * NULL, // Use default buffering attributes.
-- * NULL, // Ignore error code.
-- * );
-- * \endcode
-- *
-- * At this point a connected object is returned, or NULL if there was a
-- * problem connecting.
-- *
-- * \section transfer_sec Transferring data
-- *
-- * Once the connection is established to the server, data can start flowing.
-- * Using the connection is very similar to the normal read() and write()
-- * system calls. The main difference is that they're called pa_simple_read()
-- * and pa_simple_write(). Note that these operations always block.
-- *
-- * \section ctrl_sec Buffer control
-- *
-- * \li pa_simple_get_latency() - Will return the total latency of
-- * the playback or record pipeline, respectively.
-- * \li pa_simple_flush() - Will throw away all data currently in buffers.
-- *
-- * If a playback stream is used then the following operation is available:
-- *
-- * \li pa_simple_drain() - Will wait for all sent data to finish playing.
-- *
-- * \section cleanup_sec Cleanup
-- *
-- * Once playback or capture is complete, the connection should be closed
-- * and resources freed. This is done through:
-- *
-- * \code
-- * pa_simple_free(s);
-- * \endcode
--
--* \file
-- * A simple but limited synchronous playback and recording
-- * API. This is a synchronous, simplified wrapper around the standard
-- * asynchronous API.
-- *
-- * See also \subpage simple
--
--* \example pacat-simple.c
-- * A simple playback tool using the simple API
--* \example parec-simple.c
-- * A simple recording tool using the simple API
--* \struct pa_simple
-- * An opaque simple connection object
function Pa_Strerror (Error : Int) return Strings.chars_ptr;
pragma Import (C, Pa_Strerror, "pa_strerror");
type pa_simple is null record; -- incomplete struct
type Pa_Simple_Access is access Pa_Simple;
--* Create a new connection to the server.
function pa_simple_new
(server : Interfaces.C.Strings.chars_ptr;
name : Interfaces.C.Strings.chars_ptr;
dir : pulse_def_h.pa_stream_direction_t;
dev : Interfaces.C.Strings.chars_ptr;
stream_name : Interfaces.C.Strings.chars_ptr;
ss : access constant pulse_sample_h.pa_sample_spec;
map : access constant pulse_channelmap_h.pa_channel_map;
attr : access constant pulse_def_h.pa_buffer_attr;
error : access int) return Pa_Simple_Access; -- /usr/include/pulse/simple.h:120
pragma Import (C, pa_simple_new, "pa_simple_new");
--*< Server name, or NULL for default
--*< A descriptive name for this client (application name, ...)
--*< Open this stream for recording or playback?
--*< Sink (resp. source) name, or NULL for default
--*< A descriptive name for this stream (application name, song title, ...)
--*< The sample type to use
--*< The channel map to use, or NULL for default
--*< Buffering attributes, or NULL for default
--*< A pointer where the error code is stored when the routine returns NULL. It is OK to pass NULL here.
--* Close and free the connection to the server. The connection object becomes invalid when this is called.
procedure pa_simple_free (s : access pa_simple); -- /usr/include/pulse/simple.h:133
pragma Import (C, pa_simple_free, "pa_simple_free");
--* Write some data to the server.
function pa_simple_write
(s : access pa_simple;
data : System.Address;
bytes : Interfaces.C.size_t;
error : access int) return int; -- /usr/include/pulse/simple.h:136
pragma Import (C, pa_simple_write, "pa_simple_write");
--* Wait until all data already written is played by the daemon.
function pa_simple_drain (s : access pa_simple; error : access int) return int; -- /usr/include/pulse/simple.h:139
pragma Import (C, pa_simple_drain, "pa_simple_drain");
--* Read some data from the server. This function blocks until \a bytes amount
-- * of data has been received from the server, or until an error occurs.
-- * Returns a negative value on failure.
function pa_simple_read
(s : access pa_simple;
data : System.Address;
bytes : Interfaces.C.size_t;
error : access int) return int; -- /usr/include/pulse/simple.h:144
pragma Import (C, pa_simple_read, "pa_simple_read");
--*< The connection object.
--*< A pointer to a buffer.
--*< The number of bytes to read.
--*< A pointer where the error code is stored when the function returns
-- * a negative value. It is OK to pass NULL here.
--* Return the playback or record latency.
function pa_simple_get_latency (s : access pa_simple; error : access int) return pulse_sample_h.pa_usec_t; -- /usr/include/pulse/simple.h:154
pragma Import (C, pa_simple_get_latency, "pa_simple_get_latency");
--* Flush the playback or record buffer. This discards any audio in the buffer.
function pa_simple_flush (s : access pa_simple; error : access int) return int; -- /usr/include/pulse/simple.h:157
pragma Import (C, pa_simple_flush, "pa_simple_flush");
end pulse_simple_h;
| 41.956044 | 145 | 0.655317 |
38dbe2df9f9a3cb1917bcf5b0e2026ae86e4f71f | 864 | adb | Ada | build_gnu/binutils/gdb/testsuite/gdb.ada/ptype_tagged_param/foo.adb | jed-frey/e200-gcc | df1421b421a8ec8729d70791129f5283dee5f9ea | [
"BSD-3-Clause"
] | 1 | 2017-05-31T21:42:12.000Z | 2017-05-31T21:42:12.000Z | build_gnu/binutils/gdb/testsuite/gdb.ada/ptype_tagged_param/foo.adb | jed-frey/e200-gcc | df1421b421a8ec8729d70791129f5283dee5f9ea | [
"BSD-3-Clause"
] | null | null | null | build_gnu/binutils/gdb/testsuite/gdb.ada/ptype_tagged_param/foo.adb | jed-frey/e200-gcc | df1421b421a8ec8729d70791129f5283dee5f9ea | [
"BSD-3-Clause"
] | 1 | 2019-12-17T22:04:07.000Z | 2019-12-17T22:04:07.000Z | -- Copyright 2010-2014 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
My_Shape : Circle := (X => 1, Y => 2, R => 3);
X : Integer;
begin
X := Position_X (My_Shape);
end Foo;
| 36 | 73 | 0.709491 |
8be2578d744f4dfa4cb01de292dee8c6d959d631 | 7,221 | ads | Ada | source/nodes/program-nodes-protected_body_declarations.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/nodes/program-nodes-protected_body_declarations.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | null | null | null | source/nodes/program-nodes-protected_body_declarations.ads | optikos/oasis | 9f64d46d26d964790d69f9db681c874cfb3bf96d | [
"MIT"
] | 2 | 2019-09-14T23:18:50.000Z | 2019-10-02T10:11:40.000Z | -- Copyright (c) 2019 Maxim Reznik <[email protected]>
--
-- SPDX-License-Identifier: MIT
-- License-Filename: LICENSE
-------------------------------------------------------------
with Program.Lexical_Elements;
with Program.Elements.Defining_Identifiers;
with Program.Elements.Aspect_Specifications;
with Program.Element_Vectors;
with Program.Elements.Identifiers;
with Program.Elements.Protected_Body_Declarations;
with Program.Element_Visitors;
package Program.Nodes.Protected_Body_Declarations is
pragma Preelaborate;
type Protected_Body_Declaration is
new Program.Nodes.Node
and Program.Elements.Protected_Body_Declarations
.Protected_Body_Declaration
and Program.Elements.Protected_Body_Declarations
.Protected_Body_Declaration_Text
with private;
function Create
(Protected_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Body_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
With_Token : Program.Lexical_Elements.Lexical_Element_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Is_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Protected_Operations : not null Program.Element_Vectors
.Element_Vector_Access;
End_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
End_Name : Program.Elements.Identifiers.Identifier_Access;
Semicolon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access)
return Protected_Body_Declaration;
type Implicit_Protected_Body_Declaration is
new Program.Nodes.Node
and Program.Elements.Protected_Body_Declarations
.Protected_Body_Declaration
with private;
function Create
(Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Protected_Operations : not null Program.Element_Vectors
.Element_Vector_Access;
End_Name : Program.Elements.Identifiers.Identifier_Access;
Is_Part_Of_Implicit : Boolean := False;
Is_Part_Of_Inherited : Boolean := False;
Is_Part_Of_Instance : Boolean := False)
return Implicit_Protected_Body_Declaration
with Pre =>
Is_Part_Of_Implicit or Is_Part_Of_Inherited or Is_Part_Of_Instance;
private
type Base_Protected_Body_Declaration is
abstract new Program.Nodes.Node
and Program.Elements.Protected_Body_Declarations
.Protected_Body_Declaration
with record
Name : not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
Aspects : Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
Protected_Operations : not null Program.Element_Vectors
.Element_Vector_Access;
End_Name : Program.Elements.Identifiers.Identifier_Access;
end record;
procedure Initialize
(Self : aliased in out Base_Protected_Body_Declaration'Class);
overriding procedure Visit
(Self : not null access Base_Protected_Body_Declaration;
Visitor : in out Program.Element_Visitors.Element_Visitor'Class);
overriding function Name
(Self : Base_Protected_Body_Declaration)
return not null Program.Elements.Defining_Identifiers
.Defining_Identifier_Access;
overriding function Aspects
(Self : Base_Protected_Body_Declaration)
return Program.Elements.Aspect_Specifications
.Aspect_Specification_Vector_Access;
overriding function Protected_Operations
(Self : Base_Protected_Body_Declaration)
return not null Program.Element_Vectors.Element_Vector_Access;
overriding function End_Name
(Self : Base_Protected_Body_Declaration)
return Program.Elements.Identifiers.Identifier_Access;
overriding function Is_Protected_Body_Declaration_Element
(Self : Base_Protected_Body_Declaration)
return Boolean;
overriding function Is_Declaration_Element
(Self : Base_Protected_Body_Declaration)
return Boolean;
type Protected_Body_Declaration is
new Base_Protected_Body_Declaration
and Program.Elements.Protected_Body_Declarations
.Protected_Body_Declaration_Text
with record
Protected_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Body_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
With_Token : Program.Lexical_Elements.Lexical_Element_Access;
Is_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
End_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
Semicolon_Token : not null Program.Lexical_Elements
.Lexical_Element_Access;
end record;
overriding function To_Protected_Body_Declaration_Text
(Self : aliased in out Protected_Body_Declaration)
return Program.Elements.Protected_Body_Declarations
.Protected_Body_Declaration_Text_Access;
overriding function Protected_Token
(Self : Protected_Body_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Body_Token
(Self : Protected_Body_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function With_Token
(Self : Protected_Body_Declaration)
return Program.Lexical_Elements.Lexical_Element_Access;
overriding function Is_Token
(Self : Protected_Body_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function End_Token
(Self : Protected_Body_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
overriding function Semicolon_Token
(Self : Protected_Body_Declaration)
return not null Program.Lexical_Elements.Lexical_Element_Access;
type Implicit_Protected_Body_Declaration is
new Base_Protected_Body_Declaration
with record
Is_Part_Of_Implicit : Boolean;
Is_Part_Of_Inherited : Boolean;
Is_Part_Of_Instance : Boolean;
end record;
overriding function To_Protected_Body_Declaration_Text
(Self : aliased in out Implicit_Protected_Body_Declaration)
return Program.Elements.Protected_Body_Declarations
.Protected_Body_Declaration_Text_Access;
overriding function Is_Part_Of_Implicit
(Self : Implicit_Protected_Body_Declaration)
return Boolean;
overriding function Is_Part_Of_Inherited
(Self : Implicit_Protected_Body_Declaration)
return Boolean;
overriding function Is_Part_Of_Instance
(Self : Implicit_Protected_Body_Declaration)
return Boolean;
end Program.Nodes.Protected_Body_Declarations;
| 38.005263 | 78 | 0.737017 |
5ed33f95bb3b44603c5f58101eb5bd7ad79ef971 | 2,029 | ads | Ada | src/asf-components-utils-scrollers.ads | Letractively/ada-asf | da9f85f85666eba7e23fefea661160863b74154d | [
"Apache-2.0"
] | null | null | null | src/asf-components-utils-scrollers.ads | Letractively/ada-asf | da9f85f85666eba7e23fefea661160863b74154d | [
"Apache-2.0"
] | null | null | null | src/asf-components-utils-scrollers.ads | Letractively/ada-asf | da9f85f85666eba7e23fefea661160863b74154d | [
"Apache-2.0"
] | null | null | null | -----------------------------------------------------------------------
-- components-utils-scrollers -- Data scrollers
-- Copyright (C) 2013 Stephane Carrez
-- Written by Stephane Carrez ([email protected])
--
-- Licensed under the Apache License, Version 2.0 (the "License");
-- you may not use this file except in compliance with the License.
-- You may obtain a copy of the License at
--
-- http://www.apache.org/licenses/LICENSE-2.0
--
-- Unless required by applicable law or agreed to in writing, software
-- distributed under the License is distributed on an "AS IS" BASIS,
-- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-- See the License for the specific language governing permissions and
-- limitations under the License.
-----------------------------------------------------------------------
with ASF.Contexts.Faces;
with ASF.Contexts.Writer;
with ASF.Components.Html;
with ASF.Components.Holders;
package ASF.Components.Utils.Scrollers is
-- ------------------------------
-- UIScroller
-- ------------------------------
--
type UIScroller is new ASF.Components.Html.UIHtmlComponent with private;
-- Get the list value holder that the scroller is controlling.
function Get_List (UI : in UIScroller;
Context : in ASF.Contexts.Faces.Faces_Context'Class)
return Holders.List_Holder_Access;
procedure Render_Page (UI : in UIScroller;
Name : in String;
Page : in Positive;
Context : in out ASF.Contexts.Faces.Faces_Context'Class);
-- Encode the data scroller.
overriding
procedure Encode_Children (UI : in UIScroller;
Context : in out ASF.Contexts.Faces.Faces_Context'Class);
private
type UIScroller is new ASF.Components.Html.UIHtmlComponent with null record;
end ASF.Components.Utils.Scrollers;
| 40.58 | 88 | 0.589453 |
9a6f3c806be9cd32e6c0db95e304dd101443482c | 9,051 | adb | Ada | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-pack40.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-pack40.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-pack40.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- S Y S T E M . P A C K _ 4 0 --
-- --
-- B o d y --
-- --
-- Copyright (C) 1992-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
with System.Storage_Elements;
with System.Unsigned_Types;
package body System.Pack_40 is
subtype Bit_Order is System.Bit_Order;
Reverse_Bit_Order : constant Bit_Order :=
Bit_Order'Val (1 - Bit_Order'Pos (System.Default_Bit_Order));
subtype Ofs is System.Storage_Elements.Storage_Offset;
subtype Uns is System.Unsigned_Types.Unsigned;
subtype N07 is System.Unsigned_Types.Unsigned range 0 .. 7;
use type System.Storage_Elements.Storage_Offset;
use type System.Unsigned_Types.Unsigned;
type Cluster is record
E0, E1, E2, E3, E4, E5, E6, E7 : Bits_40;
end record;
for Cluster use record
E0 at 0 range 0 * Bits .. 0 * Bits + Bits - 1;
E1 at 0 range 1 * Bits .. 1 * Bits + Bits - 1;
E2 at 0 range 2 * Bits .. 2 * Bits + Bits - 1;
E3 at 0 range 3 * Bits .. 3 * Bits + Bits - 1;
E4 at 0 range 4 * Bits .. 4 * Bits + Bits - 1;
E5 at 0 range 5 * Bits .. 5 * Bits + Bits - 1;
E6 at 0 range 6 * Bits .. 6 * Bits + Bits - 1;
E7 at 0 range 7 * Bits .. 7 * Bits + Bits - 1;
end record;
for Cluster'Size use Bits * 8;
for Cluster'Alignment use Integer'Min (Standard'Maximum_Alignment,
1 +
1 * Boolean'Pos (Bits mod 2 = 0) +
2 * Boolean'Pos (Bits mod 4 = 0));
-- Use maximum possible alignment, given the bit field size, since this
-- will result in the most efficient code possible for the field.
type Cluster_Ref is access Cluster;
type Rev_Cluster is new Cluster
with Bit_Order => Reverse_Bit_Order,
Scalar_Storage_Order => Reverse_Bit_Order;
type Rev_Cluster_Ref is access Rev_Cluster;
-- The following declarations are for the case where the address
-- passed to GetU_40 or SetU_40 is not guaranteed to be aligned.
-- These routines are used when the packed array is itself a
-- component of a packed record, and therefore may not be aligned.
type ClusterU is new Cluster;
for ClusterU'Alignment use 1;
type ClusterU_Ref is access ClusterU;
type Rev_ClusterU is new ClusterU
with Bit_Order => Reverse_Bit_Order,
Scalar_Storage_Order => Reverse_Bit_Order;
type Rev_ClusterU_Ref is access Rev_ClusterU;
------------
-- Get_40 --
------------
function Get_40
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_40
is
A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8);
C : Cluster_Ref with Address => A'Address, Import;
RC : Rev_Cluster_Ref with Address => A'Address, Import;
begin
if Rev_SSO then
case N07 (Uns (N) mod 8) is
when 0 => return RC.E0;
when 1 => return RC.E1;
when 2 => return RC.E2;
when 3 => return RC.E3;
when 4 => return RC.E4;
when 5 => return RC.E5;
when 6 => return RC.E6;
when 7 => return RC.E7;
end case;
else
case N07 (Uns (N) mod 8) is
when 0 => return C.E0;
when 1 => return C.E1;
when 2 => return C.E2;
when 3 => return C.E3;
when 4 => return C.E4;
when 5 => return C.E5;
when 6 => return C.E6;
when 7 => return C.E7;
end case;
end if;
end Get_40;
-------------
-- GetU_40 --
-------------
function GetU_40
(Arr : System.Address;
N : Natural;
Rev_SSO : Boolean) return Bits_40
is
A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8);
C : ClusterU_Ref with Address => A'Address, Import;
RC : Rev_ClusterU_Ref with Address => A'Address, Import;
begin
if Rev_SSO then
case N07 (Uns (N) mod 8) is
when 0 => return RC.E0;
when 1 => return RC.E1;
when 2 => return RC.E2;
when 3 => return RC.E3;
when 4 => return RC.E4;
when 5 => return RC.E5;
when 6 => return RC.E6;
when 7 => return RC.E7;
end case;
else
case N07 (Uns (N) mod 8) is
when 0 => return C.E0;
when 1 => return C.E1;
when 2 => return C.E2;
when 3 => return C.E3;
when 4 => return C.E4;
when 5 => return C.E5;
when 6 => return C.E6;
when 7 => return C.E7;
end case;
end if;
end GetU_40;
------------
-- Set_40 --
------------
procedure Set_40
(Arr : System.Address;
N : Natural;
E : Bits_40;
Rev_SSO : Boolean)
is
A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8);
C : Cluster_Ref with Address => A'Address, Import;
RC : Rev_Cluster_Ref with Address => A'Address, Import;
begin
if Rev_SSO then
case N07 (Uns (N) mod 8) is
when 0 => RC.E0 := E;
when 1 => RC.E1 := E;
when 2 => RC.E2 := E;
when 3 => RC.E3 := E;
when 4 => RC.E4 := E;
when 5 => RC.E5 := E;
when 6 => RC.E6 := E;
when 7 => RC.E7 := E;
end case;
else
case N07 (Uns (N) mod 8) is
when 0 => C.E0 := E;
when 1 => C.E1 := E;
when 2 => C.E2 := E;
when 3 => C.E3 := E;
when 4 => C.E4 := E;
when 5 => C.E5 := E;
when 6 => C.E6 := E;
when 7 => C.E7 := E;
end case;
end if;
end Set_40;
-------------
-- SetU_40 --
-------------
procedure SetU_40
(Arr : System.Address;
N : Natural;
E : Bits_40;
Rev_SSO : Boolean)
is
A : constant System.Address := Arr + Bits * Ofs (Uns (N) / 8);
C : ClusterU_Ref with Address => A'Address, Import;
RC : Rev_ClusterU_Ref with Address => A'Address, Import;
begin
if Rev_SSO then
case N07 (Uns (N) mod 8) is
when 0 => RC.E0 := E;
when 1 => RC.E1 := E;
when 2 => RC.E2 := E;
when 3 => RC.E3 := E;
when 4 => RC.E4 := E;
when 5 => RC.E5 := E;
when 6 => RC.E6 := E;
when 7 => RC.E7 := E;
end case;
else
case N07 (Uns (N) mod 8) is
when 0 => C.E0 := E;
when 1 => C.E1 := E;
when 2 => C.E2 := E;
when 3 => C.E3 := E;
when 4 => C.E4 := E;
when 5 => C.E5 := E;
when 6 => C.E6 := E;
when 7 => C.E7 := E;
end case;
end if;
end SetU_40;
end System.Pack_40;
| 36.059761 | 78 | 0.449011 |
197fae0c0389c3ce2685d0c85f1832a6c30a6cfc | 20,858 | ads | Ada | arch/ARM/STM32/svd/stm32f7x/stm32_svd-fsmc.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/svd/stm32f7x/stm32_svd-fsmc.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 239 | 2016-05-26T20:02:01.000Z | 2022-03-31T09:46:56.000Z | arch/ARM/STM32/svd/stm32f7x/stm32_svd-fsmc.ads | morbos/Ada_Drivers_Library | a4ab26799be60997c38735f4056160c4af597ef7 | [
"BSD-3-Clause"
] | 142 | 2016-06-05T08:12:20.000Z | 2022-03-24T17:37:17.000Z | -- This spec has been automatically generated from STM32F7x.svd
pragma Restrictions (No_Elaboration_Code);
pragma Ada_2012;
pragma Style_Checks (Off);
with HAL;
with System;
package STM32_SVD.FSMC is
pragma Preelaborate;
---------------
-- Registers --
---------------
subtype BCR1_MTYP_Field is HAL.UInt2;
subtype BCR1_MWID_Field is HAL.UInt2;
-- SRAM/NOR-Flash chip-select control register 1
type BCR1_Register is record
-- MBKEN
MBKEN : Boolean := False;
-- MUXEN
MUXEN : Boolean := False;
-- MTYP
MTYP : BCR1_MTYP_Field := 16#0#;
-- MWID
MWID : BCR1_MWID_Field := 16#1#;
-- FACCEN
FACCEN : Boolean := True;
-- unspecified
Reserved_7_7 : HAL.Bit := 16#1#;
-- BURSTEN
BURSTEN : Boolean := False;
-- WAITPOL
WAITPOL : Boolean := False;
-- unspecified
Reserved_10_10 : HAL.Bit := 16#0#;
-- WAITCFG
WAITCFG : Boolean := False;
-- WREN
WREN : Boolean := True;
-- WAITEN
WAITEN : Boolean := True;
-- EXTMOD
EXTMOD : Boolean := False;
-- ASYNCWAIT
ASYNCWAIT : Boolean := False;
-- unspecified
Reserved_16_18 : HAL.UInt3 := 16#0#;
-- CBURSTRW
CBURSTRW : Boolean := False;
-- CCLKEN
CCLKEN : Boolean := False;
-- unspecified
Reserved_21_31 : HAL.UInt11 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BCR1_Register use record
MBKEN at 0 range 0 .. 0;
MUXEN at 0 range 1 .. 1;
MTYP at 0 range 2 .. 3;
MWID at 0 range 4 .. 5;
FACCEN at 0 range 6 .. 6;
Reserved_7_7 at 0 range 7 .. 7;
BURSTEN at 0 range 8 .. 8;
WAITPOL at 0 range 9 .. 9;
Reserved_10_10 at 0 range 10 .. 10;
WAITCFG at 0 range 11 .. 11;
WREN at 0 range 12 .. 12;
WAITEN at 0 range 13 .. 13;
EXTMOD at 0 range 14 .. 14;
ASYNCWAIT at 0 range 15 .. 15;
Reserved_16_18 at 0 range 16 .. 18;
CBURSTRW at 0 range 19 .. 19;
CCLKEN at 0 range 20 .. 20;
Reserved_21_31 at 0 range 21 .. 31;
end record;
subtype BTR_ADDSET_Field is HAL.UInt4;
subtype BTR_ADDHLD_Field is HAL.UInt4;
subtype BTR_DATAST_Field is HAL.UInt8;
subtype BTR_BUSTURN_Field is HAL.UInt4;
subtype BTR_CLKDIV_Field is HAL.UInt4;
subtype BTR_DATLAT_Field is HAL.UInt4;
subtype BTR_ACCMOD_Field is HAL.UInt2;
-- SRAM/NOR-Flash chip-select timing register 1
type BTR_Register is record
-- ADDSET
ADDSET : BTR_ADDSET_Field := 16#F#;
-- ADDHLD
ADDHLD : BTR_ADDHLD_Field := 16#F#;
-- DATAST
DATAST : BTR_DATAST_Field := 16#FF#;
-- BUSTURN
BUSTURN : BTR_BUSTURN_Field := 16#F#;
-- CLKDIV
CLKDIV : BTR_CLKDIV_Field := 16#F#;
-- DATLAT
DATLAT : BTR_DATLAT_Field := 16#F#;
-- ACCMOD
ACCMOD : BTR_ACCMOD_Field := 16#3#;
-- unspecified
Reserved_30_31 : HAL.UInt2 := 16#3#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BTR_Register use record
ADDSET at 0 range 0 .. 3;
ADDHLD at 0 range 4 .. 7;
DATAST at 0 range 8 .. 15;
BUSTURN at 0 range 16 .. 19;
CLKDIV at 0 range 20 .. 23;
DATLAT at 0 range 24 .. 27;
ACCMOD at 0 range 28 .. 29;
Reserved_30_31 at 0 range 30 .. 31;
end record;
subtype BCR_MTYP_Field is HAL.UInt2;
subtype BCR_MWID_Field is HAL.UInt2;
-- SRAM/NOR-Flash chip-select control register 2
type BCR_Register is record
-- MBKEN
MBKEN : Boolean := False;
-- MUXEN
MUXEN : Boolean := False;
-- MTYP
MTYP : BCR_MTYP_Field := 16#0#;
-- MWID
MWID : BCR_MWID_Field := 16#1#;
-- FACCEN
FACCEN : Boolean := True;
-- unspecified
Reserved_7_7 : HAL.Bit := 16#1#;
-- BURSTEN
BURSTEN : Boolean := False;
-- WAITPOL
WAITPOL : Boolean := False;
-- WRAPMOD
WRAPMOD : Boolean := False;
-- WAITCFG
WAITCFG : Boolean := False;
-- WREN
WREN : Boolean := True;
-- WAITEN
WAITEN : Boolean := True;
-- EXTMOD
EXTMOD : Boolean := False;
-- ASYNCWAIT
ASYNCWAIT : Boolean := False;
-- unspecified
Reserved_16_18 : HAL.UInt3 := 16#0#;
-- CBURSTRW
CBURSTRW : Boolean := False;
-- unspecified
Reserved_20_31 : HAL.UInt12 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BCR_Register use record
MBKEN at 0 range 0 .. 0;
MUXEN at 0 range 1 .. 1;
MTYP at 0 range 2 .. 3;
MWID at 0 range 4 .. 5;
FACCEN at 0 range 6 .. 6;
Reserved_7_7 at 0 range 7 .. 7;
BURSTEN at 0 range 8 .. 8;
WAITPOL at 0 range 9 .. 9;
WRAPMOD at 0 range 10 .. 10;
WAITCFG at 0 range 11 .. 11;
WREN at 0 range 12 .. 12;
WAITEN at 0 range 13 .. 13;
EXTMOD at 0 range 14 .. 14;
ASYNCWAIT at 0 range 15 .. 15;
Reserved_16_18 at 0 range 16 .. 18;
CBURSTRW at 0 range 19 .. 19;
Reserved_20_31 at 0 range 20 .. 31;
end record;
subtype PCR_PWID_Field is HAL.UInt2;
subtype PCR_TCLR_Field is HAL.UInt4;
subtype PCR_TAR_Field is HAL.UInt4;
subtype PCR_ECCPS_Field is HAL.UInt3;
-- PC Card/NAND Flash control register
type PCR_Register is record
-- unspecified
Reserved_0_0 : HAL.Bit := 16#0#;
-- PWAITEN
PWAITEN : Boolean := False;
-- PBKEN
PBKEN : Boolean := False;
-- PTYP
PTYP : Boolean := True;
-- PWID
PWID : PCR_PWID_Field := 16#1#;
-- ECCEN
ECCEN : Boolean := False;
-- unspecified
Reserved_7_8 : HAL.UInt2 := 16#0#;
-- TCLR
TCLR : PCR_TCLR_Field := 16#0#;
-- TAR
TAR : PCR_TAR_Field := 16#0#;
-- ECCPS
ECCPS : PCR_ECCPS_Field := 16#0#;
-- unspecified
Reserved_20_31 : HAL.UInt12 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PCR_Register use record
Reserved_0_0 at 0 range 0 .. 0;
PWAITEN at 0 range 1 .. 1;
PBKEN at 0 range 2 .. 2;
PTYP at 0 range 3 .. 3;
PWID at 0 range 4 .. 5;
ECCEN at 0 range 6 .. 6;
Reserved_7_8 at 0 range 7 .. 8;
TCLR at 0 range 9 .. 12;
TAR at 0 range 13 .. 16;
ECCPS at 0 range 17 .. 19;
Reserved_20_31 at 0 range 20 .. 31;
end record;
-- FIFO status and interrupt register
type SR_Register is record
-- IRS
IRS : Boolean := False;
-- ILS
ILS : Boolean := False;
-- IFS
IFS : Boolean := False;
-- IREN
IREN : Boolean := False;
-- ILEN
ILEN : Boolean := False;
-- IFEN
IFEN : Boolean := False;
-- Read-only. FEMPT
FEMPT : Boolean := True;
-- unspecified
Reserved_7_31 : HAL.UInt25 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SR_Register use record
IRS at 0 range 0 .. 0;
ILS at 0 range 1 .. 1;
IFS at 0 range 2 .. 2;
IREN at 0 range 3 .. 3;
ILEN at 0 range 4 .. 4;
IFEN at 0 range 5 .. 5;
FEMPT at 0 range 6 .. 6;
Reserved_7_31 at 0 range 7 .. 31;
end record;
subtype PMEM_MEMSETx_Field is HAL.UInt8;
subtype PMEM_MEMWAITx_Field is HAL.UInt8;
subtype PMEM_MEMHOLDx_Field is HAL.UInt8;
subtype PMEM_MEMHIZx_Field is HAL.UInt8;
-- Common memory space timing register
type PMEM_Register is record
-- MEMSETx
MEMSETx : PMEM_MEMSETx_Field := 16#FC#;
-- MEMWAITx
MEMWAITx : PMEM_MEMWAITx_Field := 16#FC#;
-- MEMHOLDx
MEMHOLDx : PMEM_MEMHOLDx_Field := 16#FC#;
-- MEMHIZx
MEMHIZx : PMEM_MEMHIZx_Field := 16#FC#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PMEM_Register use record
MEMSETx at 0 range 0 .. 7;
MEMWAITx at 0 range 8 .. 15;
MEMHOLDx at 0 range 16 .. 23;
MEMHIZx at 0 range 24 .. 31;
end record;
subtype PATT_ATTSETx_Field is HAL.UInt8;
subtype PATT_ATTWAITx_Field is HAL.UInt8;
subtype PATT_ATTHOLDx_Field is HAL.UInt8;
subtype PATT_ATTHIZx_Field is HAL.UInt8;
-- Attribute memory space timing register
type PATT_Register is record
-- ATTSETx
ATTSETx : PATT_ATTSETx_Field := 16#FC#;
-- ATTWAITx
ATTWAITx : PATT_ATTWAITx_Field := 16#FC#;
-- ATTHOLDx
ATTHOLDx : PATT_ATTHOLDx_Field := 16#FC#;
-- ATTHIZx
ATTHIZx : PATT_ATTHIZx_Field := 16#FC#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for PATT_Register use record
ATTSETx at 0 range 0 .. 7;
ATTWAITx at 0 range 8 .. 15;
ATTHOLDx at 0 range 16 .. 23;
ATTHIZx at 0 range 24 .. 31;
end record;
subtype BWTR_ADDSET_Field is HAL.UInt4;
subtype BWTR_ADDHLD_Field is HAL.UInt4;
subtype BWTR_DATAST_Field is HAL.UInt8;
subtype BWTR_CLKDIV_Field is HAL.UInt4;
subtype BWTR_DATLAT_Field is HAL.UInt4;
subtype BWTR_ACCMOD_Field is HAL.UInt2;
-- SRAM/NOR-Flash write timing registers 1
type BWTR_Register is record
-- ADDSET
ADDSET : BWTR_ADDSET_Field := 16#F#;
-- ADDHLD
ADDHLD : BWTR_ADDHLD_Field := 16#F#;
-- DATAST
DATAST : BWTR_DATAST_Field := 16#FF#;
-- unspecified
Reserved_16_19 : HAL.UInt4 := 16#F#;
-- CLKDIV
CLKDIV : BWTR_CLKDIV_Field := 16#F#;
-- DATLAT
DATLAT : BWTR_DATLAT_Field := 16#F#;
-- ACCMOD
ACCMOD : BWTR_ACCMOD_Field := 16#0#;
-- unspecified
Reserved_30_31 : HAL.UInt2 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for BWTR_Register use record
ADDSET at 0 range 0 .. 3;
ADDHLD at 0 range 4 .. 7;
DATAST at 0 range 8 .. 15;
Reserved_16_19 at 0 range 16 .. 19;
CLKDIV at 0 range 20 .. 23;
DATLAT at 0 range 24 .. 27;
ACCMOD at 0 range 28 .. 29;
Reserved_30_31 at 0 range 30 .. 31;
end record;
subtype SDCR_NC_Field is HAL.UInt2;
subtype SDCR_NR_Field is HAL.UInt2;
subtype SDCR_MWID_Field is HAL.UInt2;
subtype SDCR_CAS_Field is HAL.UInt2;
subtype SDCR_SDCLK_Field is HAL.UInt2;
subtype SDCR_RPIPE_Field is HAL.UInt2;
-- SDRAM Control Register 1
type SDCR_Register is record
-- Number of column address bits
NC : SDCR_NC_Field := 16#0#;
-- Number of row address bits
NR : SDCR_NR_Field := 16#0#;
-- Memory data bus width
MWID : SDCR_MWID_Field := 16#1#;
-- Number of internal banks
NB : Boolean := True;
-- CAS latency
CAS : SDCR_CAS_Field := 16#1#;
-- Write protection
WP : Boolean := True;
-- SDRAM clock configuration
SDCLK : SDCR_SDCLK_Field := 16#0#;
-- Burst read
RBURST : Boolean := False;
-- Read pipe
RPIPE : SDCR_RPIPE_Field := 16#0#;
-- unspecified
Reserved_15_31 : HAL.UInt17 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SDCR_Register use record
NC at 0 range 0 .. 1;
NR at 0 range 2 .. 3;
MWID at 0 range 4 .. 5;
NB at 0 range 6 .. 6;
CAS at 0 range 7 .. 8;
WP at 0 range 9 .. 9;
SDCLK at 0 range 10 .. 11;
RBURST at 0 range 12 .. 12;
RPIPE at 0 range 13 .. 14;
Reserved_15_31 at 0 range 15 .. 31;
end record;
subtype SDTR_TMRD_Field is HAL.UInt4;
subtype SDTR_TXSR_Field is HAL.UInt4;
subtype SDTR_TRAS_Field is HAL.UInt4;
subtype SDTR_TRC_Field is HAL.UInt4;
subtype SDTR_TWR_Field is HAL.UInt4;
subtype SDTR_TRP_Field is HAL.UInt4;
subtype SDTR_TRCD_Field is HAL.UInt4;
-- SDRAM Timing register 1
type SDTR_Register is record
-- Load Mode Register to Active
TMRD : SDTR_TMRD_Field := 16#F#;
-- Exit self-refresh delay
TXSR : SDTR_TXSR_Field := 16#F#;
-- Self refresh time
TRAS : SDTR_TRAS_Field := 16#F#;
-- Row cycle delay
TRC : SDTR_TRC_Field := 16#F#;
-- Recovery delay
TWR : SDTR_TWR_Field := 16#F#;
-- Row precharge delay
TRP : SDTR_TRP_Field := 16#F#;
-- Row to column delay
TRCD : SDTR_TRCD_Field := 16#F#;
-- unspecified
Reserved_28_31 : HAL.UInt4 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SDTR_Register use record
TMRD at 0 range 0 .. 3;
TXSR at 0 range 4 .. 7;
TRAS at 0 range 8 .. 11;
TRC at 0 range 12 .. 15;
TWR at 0 range 16 .. 19;
TRP at 0 range 20 .. 23;
TRCD at 0 range 24 .. 27;
Reserved_28_31 at 0 range 28 .. 31;
end record;
subtype SDCMR_MODE_Field is HAL.UInt3;
subtype SDCMR_NRFS_Field is HAL.UInt4;
subtype SDCMR_MRD_Field is HAL.UInt13;
-- SDRAM Command Mode register
type SDCMR_Register is record
-- Write-only. Command mode
MODE : SDCMR_MODE_Field := 16#0#;
-- Write-only. Command target bank 2
CTB2 : Boolean := False;
-- Write-only. Command target bank 1
CTB1 : Boolean := False;
-- Number of Auto-refresh
NRFS : SDCMR_NRFS_Field := 16#0#;
-- Mode Register definition
MRD : SDCMR_MRD_Field := 16#0#;
-- unspecified
Reserved_22_31 : HAL.UInt10 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SDCMR_Register use record
MODE at 0 range 0 .. 2;
CTB2 at 0 range 3 .. 3;
CTB1 at 0 range 4 .. 4;
NRFS at 0 range 5 .. 8;
MRD at 0 range 9 .. 21;
Reserved_22_31 at 0 range 22 .. 31;
end record;
subtype SDRTR_COUNT_Field is HAL.UInt13;
-- SDRAM Refresh Timer register
type SDRTR_Register is record
-- Write-only. Clear Refresh error flag
CRE : Boolean := False;
-- Refresh Timer Count
COUNT : SDRTR_COUNT_Field := 16#0#;
-- RES Interrupt Enable
REIE : Boolean := False;
-- unspecified
Reserved_15_31 : HAL.UInt17 := 16#0#;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SDRTR_Register use record
CRE at 0 range 0 .. 0;
COUNT at 0 range 1 .. 13;
REIE at 0 range 14 .. 14;
Reserved_15_31 at 0 range 15 .. 31;
end record;
-- SDSR_MODES array element
subtype SDSR_MODES_Element is HAL.UInt2;
-- SDSR_MODES array
type SDSR_MODES_Field_Array is array (1 .. 2) of SDSR_MODES_Element
with Component_Size => 2, Size => 4;
-- Type definition for SDSR_MODES
type SDSR_MODES_Field
(As_Array : Boolean := False)
is record
case As_Array is
when False =>
-- MODES as a value
Val : HAL.UInt4;
when True =>
-- MODES as an array
Arr : SDSR_MODES_Field_Array;
end case;
end record
with Unchecked_Union, Size => 4;
for SDSR_MODES_Field use record
Val at 0 range 0 .. 3;
Arr at 0 range 0 .. 3;
end record;
-- SDRAM Status register
type SDSR_Register is record
-- Read-only. Refresh error flag
RE : Boolean;
-- Read-only. Status Mode for Bank 1
MODES : SDSR_MODES_Field;
-- Read-only. Busy status
BUSY : Boolean;
-- unspecified
Reserved_6_31 : HAL.UInt26;
end record
with Volatile_Full_Access, Size => 32,
Bit_Order => System.Low_Order_First;
for SDSR_Register use record
RE at 0 range 0 .. 0;
MODES at 0 range 1 .. 4;
BUSY at 0 range 5 .. 5;
Reserved_6_31 at 0 range 6 .. 31;
end record;
-----------------
-- Peripherals --
-----------------
-- Flexible memory controller
type FMC_Peripheral is record
-- SRAM/NOR-Flash chip-select control register 1
BCR1 : aliased BCR1_Register;
-- SRAM/NOR-Flash chip-select timing register 1
BTR1 : aliased BTR_Register;
-- SRAM/NOR-Flash chip-select control register 2
BCR2 : aliased BCR_Register;
-- SRAM/NOR-Flash chip-select timing register 2
BTR2 : aliased BTR_Register;
-- SRAM/NOR-Flash chip-select control register 3
BCR3 : aliased BCR_Register;
-- SRAM/NOR-Flash chip-select timing register 3
BTR3 : aliased BTR_Register;
-- SRAM/NOR-Flash chip-select control register 4
BCR4 : aliased BCR_Register;
-- SRAM/NOR-Flash chip-select timing register 4
BTR4 : aliased BTR_Register;
-- PC Card/NAND Flash control register
PCR : aliased PCR_Register;
-- FIFO status and interrupt register
SR : aliased SR_Register;
-- Common memory space timing register
PMEM : aliased PMEM_Register;
-- Attribute memory space timing register
PATT : aliased PATT_Register;
-- ECC result register
ECCR : aliased HAL.UInt32;
-- SRAM/NOR-Flash write timing registers 1
BWTR1 : aliased BWTR_Register;
-- SRAM/NOR-Flash write timing registers 2
BWTR2 : aliased BWTR_Register;
-- SRAM/NOR-Flash write timing registers 3
BWTR3 : aliased BWTR_Register;
-- SRAM/NOR-Flash write timing registers 4
BWTR4 : aliased BWTR_Register;
-- SDRAM Control Register 1
SDCR1 : aliased SDCR_Register;
-- SDRAM Control Register 2
SDCR2 : aliased SDCR_Register;
-- SDRAM Timing register 1
SDTR1 : aliased SDTR_Register;
-- SDRAM Timing register 2
SDTR2 : aliased SDTR_Register;
-- SDRAM Command Mode register
SDCMR : aliased SDCMR_Register;
-- SDRAM Refresh Timer register
SDRTR : aliased SDRTR_Register;
-- SDRAM Status register
SDSR : aliased SDSR_Register;
end record
with Volatile;
for FMC_Peripheral use record
BCR1 at 16#0# range 0 .. 31;
BTR1 at 16#4# range 0 .. 31;
BCR2 at 16#8# range 0 .. 31;
BTR2 at 16#C# range 0 .. 31;
BCR3 at 16#10# range 0 .. 31;
BTR3 at 16#14# range 0 .. 31;
BCR4 at 16#18# range 0 .. 31;
BTR4 at 16#1C# range 0 .. 31;
PCR at 16#80# range 0 .. 31;
SR at 16#84# range 0 .. 31;
PMEM at 16#88# range 0 .. 31;
PATT at 16#8C# range 0 .. 31;
ECCR at 16#94# range 0 .. 31;
BWTR1 at 16#104# range 0 .. 31;
BWTR2 at 16#10C# range 0 .. 31;
BWTR3 at 16#114# range 0 .. 31;
BWTR4 at 16#11C# range 0 .. 31;
SDCR1 at 16#140# range 0 .. 31;
SDCR2 at 16#144# range 0 .. 31;
SDTR1 at 16#148# range 0 .. 31;
SDTR2 at 16#14C# range 0 .. 31;
SDCMR at 16#150# range 0 .. 31;
SDRTR at 16#154# range 0 .. 31;
SDSR at 16#158# range 0 .. 31;
end record;
-- Flexible memory controller
FMC_Periph : aliased FMC_Peripheral
with Import, Address => System'To_Address (16#A0000000#);
end STM32_SVD.FSMC;
| 32.744113 | 70 | 0.551635 |
0320282c7e2f01440c7e562eb209c7093d1efccd | 962 | ads | Ada | src/gen/pixtend-wiringpispi_h.ads | persan/a-piextend | 2b8ffe9ce1735789088e51f6321685759f269cf4 | [
"MIT"
] | null | null | null | src/gen/pixtend-wiringpispi_h.ads | persan/a-piextend | 2b8ffe9ce1735789088e51f6321685759f269cf4 | [
"MIT"
] | null | null | null | src/gen/pixtend-wiringpispi_h.ads | persan/a-piextend | 2b8ffe9ce1735789088e51f6321685759f269cf4 | [
"MIT"
] | null | null | null | pragma Ada_2012;
pragma Style_Checks (Off);
with Interfaces.C; use Interfaces.C;
package Pixtend.wiringPiSPI_h is
function wiringPiSPIGetFd (channel : int) return int -- wiringPiSPI.h:29
with Import => True,
Convention => C,
External_Name => "wiringPiSPIGetFd";
function wiringPiSPIDataRW
(channel : int;
data : access unsigned_char;
len : int) return int -- wiringPiSPI.h:30
with Import => True,
Convention => C,
External_Name => "wiringPiSPIDataRW";
function wiringPiSPISetupMode
(channel : int;
speed : int;
mode : int) return int -- wiringPiSPI.h:31
with Import => True,
Convention => C,
External_Name => "wiringPiSPISetupMode";
function wiringPiSPISetup (channel : int; speed : int) return int -- wiringPiSPI.h:32
with Import => True,
Convention => C,
External_Name => "wiringPiSPISetup";
end Pixtend.wiringPiSPI_h;
| 27.485714 | 89 | 0.64657 |
1a104efd7ce5ee7d7b8d111262a174f0bd3f1770 | 522 | ads | Ada | tests/tk-widget-widget_options_test_data-widget_options_tests.ads | thindil/tashy2 | 43fcbadb33c0062b2c8d6138a8238441dec5fd80 | [
"Apache-2.0"
] | 2 | 2020-12-09T07:27:07.000Z | 2021-10-19T13:31:54.000Z | tests/tk-widget-widget_options_test_data-widget_options_tests.ads | thindil/tashy2 | 43fcbadb33c0062b2c8d6138a8238441dec5fd80 | [
"Apache-2.0"
] | null | null | null | tests/tk-widget-widget_options_test_data-widget_options_tests.ads | thindil/tashy2 | 43fcbadb33c0062b2c8d6138a8238441dec5fd80 | [
"Apache-2.0"
] | null | null | null | -- This package has been generated automatically by GNATtest.
-- Do not edit any part of it, see GNATtest documentation for more details.
-- begin read only
with GNATtest_Generated;
package Tk.Widget.Widget_Options_Test_Data.Widget_Options_Tests is
type Test_Widget_Options is abstract new GNATtest_Generated
.GNATtest_Standard
.Tk
.Widget
.Widget_Options_Test_Data
.Test_Widget_Options with
null record;
end Tk.Widget.Widget_Options_Test_Data.Widget_Options_Tests;
-- end read only
| 27.473684 | 76 | 0.777778 |
a08db64d86256d6798369aa83b6a766267fb13b1 | 136 | adb | Ada | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/varsize3_3.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/varsize3_3.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/testsuite/gnat.dg/varsize3_3.adb | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | -- { dg-do compile }
with Varsize3_Pkg1; use Varsize3_Pkg1;
procedure Varsize3_3 is
Filter : Object;
begin
Filter := True;
end;
| 11.333333 | 38 | 0.698529 |
1e7e99771beec926092852fc258f295d9bc7ef58 | 432 | ads | Ada | 3-mid/opengl/source/lean/buffer/opengl-buffer-texture_coords.ads | charlie5/lace | e9b7dc751d500ff3f559617a6fc3089ace9dc134 | [
"0BSD"
] | 20 | 2015-11-04T09:23:59.000Z | 2022-01-14T10:21:42.000Z | 3-mid/opengl/source/lean/buffer/opengl-buffer-texture_coords.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 2 | 2015-11-04T17:05:56.000Z | 2015-12-08T03:16:13.000Z | 3-mid/opengl/source/lean/buffer/opengl-buffer-texture_coords.ads | charlie5/lace-alire | 9ace9682cf4daac7adb9f980c2868d6225b8111c | [
"0BSD"
] | 1 | 2015-12-07T12:53:52.000Z | 2015-12-07T12:53:52.000Z | with
openGL.Buffer.general;
package openGL.Buffer.texture_coords is new openGL.Buffer.general (base_Object => Buffer.array_Object,
Index => Index_t,
Element => Coordinate_2D,
Element_Array => Coordinates_2D);
| 54 | 104 | 0.388889 |
c7f285190dd1db5129914d74bf23609644d3296f | 3,429 | adb | Ada | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-excdeb.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-excdeb.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/s-excdeb.adb | JCGobbi/Nucleo-STM32F334R8 | 2a0b1b4b2664c92773703ac5e95dcb71979d051c | [
"BSD-3-Clause"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT COMPILER COMPONENTS --
-- --
-- S Y S T E M . E X C E P T I O N S _ D E B U G --
-- --
-- B o d y --
-- --
-- Copyright (C) 2006-2021, Free Software Foundation, Inc. --
-- --
-- GNAT is free software; you can redistribute it and/or modify it under --
-- terms of the GNU General Public License as published by the Free Soft- --
-- ware Foundation; either version 3, or (at your option) any later ver- --
-- sion. GNAT is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. --
-- --
-- --
-- --
-- --
-- --
-- You should have received a copy of the GNU General Public License and --
-- a copy of the GCC Runtime Library Exception along with this program; --
-- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see --
-- <http://www.gnu.org/licenses/>. --
-- --
-- GNAT was originally developed by the GNAT team at New York University. --
-- Extensive contributions were provided by Ada Core Technologies Inc. --
-- --
------------------------------------------------------------------------------
pragma Compiler_Unit_Warning;
package body System.Exceptions_Debug is
---------------------------
-- Debug_Raise_Exception --
---------------------------
procedure Debug_Raise_Exception
(E : SSL.Exception_Data_Ptr; Message : String)
is
pragma Inspection_Point (E, Message);
begin
null;
end Debug_Raise_Exception;
-------------------------------
-- Debug_Unhandled_Exception --
-------------------------------
procedure Debug_Unhandled_Exception (E : SSL.Exception_Data_Ptr) is
pragma Inspection_Point (E);
begin
null;
end Debug_Unhandled_Exception;
--------------------------------
-- Debug_Raise_Assert_Failure --
--------------------------------
procedure Debug_Raise_Assert_Failure is
begin
null;
end Debug_Raise_Assert_Failure;
-----------------
-- Local_Raise --
-----------------
procedure Local_Raise (Excep : System.Address) is
pragma Warnings (Off, Excep);
begin
return;
end Local_Raise;
end System.Exceptions_Debug;
| 43.961538 | 78 | 0.37562 |
8bd75eee1eb1a2209c03cd98672bd93aa6b54d43 | 6,086 | adb | Ada | src/fsmaker-toml.adb | Fabien-Chouteau/fsmaker | 3d96522852077c3865bb21ad3705f570733f1d7a | [
"MIT"
] | null | null | null | src/fsmaker-toml.adb | Fabien-Chouteau/fsmaker | 3d96522852077c3865bb21ad3705f570733f1d7a | [
"MIT"
] | null | null | null | src/fsmaker-toml.adb | Fabien-Chouteau/fsmaker | 3d96522852077c3865bb21ad3705f570733f1d7a | [
"MIT"
] | null | null | null | with Ada.Strings.Unbounded; use Ada.Strings.Unbounded;
with TOML; use TOML;
with TOML.File_IO;
with GNAT.OS_Lib; use GNAT.OS_Lib;
with CLIC.User_Input; use CLIC.User_Input;
with Simple_Logging; use Simple_Logging;
with FSmaker.Target;
with FSmaker.Target.LittleFS;
with FSmaker.Source;
package body FSmaker.TOML is
type FS_Format is (LFS);
type Image_Info is record
Format : FS_Format;
Size : Natural;
end record;
function Open_Image (Path_To_Output : String) return File_Descriptor;
function Get_Image_Info (V : TOML_Value) return Image_Info;
----------------
-- Open_Image --
----------------
function Open_Image (Path_To_Output : String) return File_Descriptor is
FD : File_Descriptor;
begin
if not Is_Regular_File (Path_To_Output) then
-- The file doesn't exists, we try to create it
FD := Create_File (Path_To_Output, Binary);
elsif not GNAT.OS_Lib.Is_Owner_Writable_File (Path_To_Output) then
raise Program_Error
with "Image file '" & Path_To_Output & "' is not writable";
else
Always ("Existing image file '" & Path_To_Output &
"' will be overwritten.");
if Query ("Do you want to continue?",
Valid => (Yes | No => True, Always => False),
Default => Yes) = Yes
then
FD := Open_Read_Write (Path_To_Output, Binary);
else
raise Program_Error with "Cannot overwrite existing file";
end if;
end if;
if FD = Invalid_FD then
raise Program_Error with "Cannot open image file '" & Path_To_Output & "'";
end if;
return FD;
end Open_Image;
--------------------
-- Get_Image_Info --
--------------------
function Get_Image_Info (V : TOML_Value) return Image_Info is
Res : Image_Info;
begin
declare
Format : constant TOML_Value := V.Get_Or_Null ("format");
begin
if Format.Is_Null then
raise Program_Error with "missing 'format'";
elsif Format.Kind /= TOML_String then
raise Program_Error with "'format' should be a string";
end if;
if Format.As_String /= "littlefs" then
raise Program_Error with "Unknown image format '" &
Format.As_String & "' (use littlefs)";
end if;
end;
declare
Size : constant TOML_Value := V.Get_Or_Null ("size");
begin
if Size.Is_Null then
raise Program_Error with "missing 'size'";
elsif Size.Kind /= TOML_Integer then
raise Program_Error with "'size' should be an integer";
end if;
Res.Size := Natural (Size.As_Integer);
end;
return Res;
end Get_Image_Info;
-----------
-- Mkdir --
-----------
procedure Mkdir (T : not null Target.Any_Filesystem_Ref;
Mk : TOML_Value)
is
begin
if Mk.Is_Null then
Simple_Logging.Always ("No dirs to make");
return; -- No dir to make
elsif Mk.Kind /= TOML_Array or else Mk.Item_Kind /= TOML_String then
raise Program_Error with
"'mkdir' should be an array of strings (" &
Mk.Kind'Img & ")";
end if;
for Index in 1 .. Mk.Length loop
declare
Dir : constant String := MK.Item (Index).As_String;
begin
if not Valid_Target_Path (Dir) then
raise Program_Error with "Invalid target path: '" & Dir & "'";
else
T.Make_Dir (To_Target_Path (Dir));
end if;
end;
end loop;
end Mkdir;
------------
-- Import --
------------
procedure Import (T : not null Target.Any_Filesystem_Ref;
Imp : TOML_Value)
is
begin
if Imp.Is_Null then
Simple_Logging.Always ("No imports");
return;
elsif imp.Kind /= TOML_Table then
raise Program_Error with
"'[import]' section should be an table (" &
Imp.Kind'Img & ")";
end if;
for Elt of Imp.Iterate_On_Table loop
declare
Key : constant String := To_String (Elt.Key);
Val : constant TOML_Value := Elt.Value;
begin
if not Valid_Target_Path (Key) then
raise Program_Error with "Invalid target path: '" & Key & "'";
end if;
if Val.Kind /= TOML_String then
raise Program_Error with "Import source must be strings";
end if;
declare
Src : Source.Instance := Source.Create (Val.As_String);
begin
T.Import (To_Target_Path (Key), Src);
end;
end;
end loop;
end Import;
------------------
-- Process_TOML --
------------------
procedure Process_TOML (Root : TOML_Value; FD : File_Descriptor) is
Img_Info : Image_Info;
T : Target.Any_Filesystem_Ref;
begin
if Root.Kind /= TOML_Table then
raise Program_Error with "Invalid TOML file. Table expected";
end if;
Img_Info := Get_Image_Info (Root);
T := new Target.LittleFS.Instance;
T.Format (FD, Size => Img_Info.Size);
T.Mount (FD);
declare
Mk : constant TOML_Value := Root.Get_Or_Null ("mkdir");
begin
Mkdir (T, Mk);
end;
declare
Imp : constant TOML_Value := Root.Get_Or_Null ("import");
begin
Import (T, Imp);
end;
end Process_TOML;
---------------------
-- Build_From_TOML --
---------------------
procedure Build_From_TOML (Path_To_TOML, Path_To_Output : String) is
Result : Read_Result := File_IO.Load_File (Path_To_TOML);
FD : File_Descriptor;
begin
if Result.Success then
FD := Open_Image (Path_To_Output);
Process_TOML (Result.Value, FD);
else
raise Program_Error with Path_To_Toml & ":" & Format_Error (Result);
end if;
end Build_From_TOML;
end FSmaker.TOML;
| 27.663636 | 84 | 0.563589 |
13571e1fbb2bef945a91ef8c47db9526c3a8e0cc | 21,882 | adb | Ada | tools/parser/css-analysis-parser-lexer.adb | stcarrez/ada-css | f7c337306094993186c507540701d04a4753b724 | [
"Apache-2.0"
] | 3 | 2017-01-03T22:18:22.000Z | 2017-01-10T07:58:17.000Z | tools/parser/css-analysis-parser-lexer.adb | stcarrez/ada-css | f7c337306094993186c507540701d04a4753b724 | [
"Apache-2.0"
] | null | null | null | tools/parser/css-analysis-parser-lexer.adb | stcarrez/ada-css | f7c337306094993186c507540701d04a4753b724 | [
"Apache-2.0"
] | null | null | null |
with Ada.Text_IO;
with CSS.Analysis.Parser.Lexer_dfa;
with CSS.Analysis.Parser.Lexer_IO;
package body CSS.Analysis.Parser.Lexer is
use Ada.Text_IO;
use Ada.Strings.Unbounded;
use Ada;
use CSS.Analysis.Parser.Lexer_dfa;
use CSS.Analysis.Parser.Lexer_IO;
pragma Style_Checks (Off);
pragma Warnings (Off);
function YYLex return Token is
subtype Short is Integer range -32768 .. 32767;
yy_act : Integer;
yy_c : Short;
-- returned upon end-of-file
YY_END_TOK : constant Integer := 0;
YY_END_OF_BUFFER : constant := 29;
subtype yy_state_type is Integer;
yy_current_state : yy_state_type;
INITIAL : constant := 0;
yy_accept : constant array (0 .. 137) of Short :=
(0,
0, 0, 29, 27, 17, 17, 14, 11, 27, 6,
7, 12, 13, 15, 27, 16, 25, 27, 27, 8,
10, 4, 27, 5, 27, 23, 2, 9, 3, 11,
27, 27, 27, 21, 17, 20, 0, 23, 25, 18,
0, 0, 0, 23, 23, 0, 0, 23, 0, 19,
0, 1, 0, 21, 0, 0, 0, 21, 21, 0,
21, 0, 0, 0, 0, 0, 24, 0, 23, 23,
0, 26, 23, 23, 23, 0, 0, 0, 0, 22,
0, 21, 21, 21, 21, 21, 0, 0, 0, 0,
0, 23, 23, 23, 0, 0, 0, 0, 0, 21,
21, 21, 0, 0, 0, 23, 23, 0, 0, 0,
21, 21, 0, 0, 23, 23, 0, 0, 21, 21,
0, 0, 23, 23, 0, 0, 21, 21, 0, 0,
23, 0, 0, 21, 0, 0, 0
);
yy_ec : constant array (ASCII.NUL .. Character'Last) of Short := (0,
1, 1, 1, 1, 1, 1, 1, 1, 2, 3,
1, 4, 5, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 2, 6, 1, 7, 8, 1, 9, 1, 10,
11, 12, 13, 14, 15, 1, 16, 17, 17, 17,
17, 17, 17, 17, 17, 17, 17, 18, 1, 19,
20, 21, 22, 1, 28, 28, 28, 28, 28, 28,
27, 27, 27, 27, 27, 27, 27, 27, 27, 27,
27, 27, 27, 27, 27, 27, 27, 27, 27, 27,
23, 24, 25, 26, 27, 1, 28, 28, 28, 28,
28, 28, 27, 27, 27, 27, 27, 27, 27, 27,
27, 27, 27, 27, 27, 27, 27, 27, 27, 27,
27, 27, 29, 30, 31, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 32,
32, 32, 32, 32, 32, 32, 32, 32, 32, 32,
32, 32, 32, 32, 32, 32, 32, 32, 32, 32,
32, 32, 32, 32, 32, 32, 32, 32, 32, 32,
32, 32, 32, 32, 32, 32, 32, 32, 32, 32,
32, 32, 32, 32, 32, 32, 32, 32, 32, 32,
32, 32, 32, 32, 32, 32, 32, 32, 32, 32,
32, 32, 32, 32, 32, 32, 32, 32, 32, 32,
32, 32, 32, 32, 32, 32, 32, 32, 32, 32,
32, 32, 32, 32, 32, 32, 32, 32, 32, 32,
32, 32, 32, 32, 32, others => 1
);
yy_meta : constant array (0 .. 32) of Short :=
(0,
1, 1, 2, 3, 3, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1
);
yy_base : constant array (0 .. 147) of Short :=
(0,
0, 26, 265, 427, 32, 44, 427, 427, 255, 427,
427, 427, 427, 427, 28, 427, 246, 242, 46, 427,
427, 427, 23, 427, 254, 69, 427, 230, 427, 236,
35, 87, 40, 110, 78, 427, 47, 0, 217, 427,
63, 48, 133, 0, 164, 223, 206, 0, 49, 427,
209, 427, 71, 0, 76, 77, 187, 0, 218, 192,
0, 81, 0, 249, 189, 0, 427, 89, 190, 90,
177, 172, 427, 0, 276, 0, 307, 166, 0, 427,
93, 155, 95, 427, 0, 334, 146, 96, 111, 0,
365, 105, 128, 111, 123, 112, 95, 0, 392, 113,
89, 118, 119, 86, 127, 128, 134, 135, 82, 136,
142, 154, 155, 156, 158, 159, 161, 173, 177, 178,
181, 182, 190, 196, 199, 208, 209, 212, 213, 215,
221, 227, 230, 231, 239, 240, 427, 71, 420, 70,
68, 423, 43, 42, 41, 38, 37
);
yy_def : constant array (0 .. 147) of Short :=
(0,
137, 1, 137, 137, 137, 137, 137, 137, 137, 137,
137, 137, 137, 137, 137, 137, 137, 137, 137, 137,
137, 137, 138, 137, 137, 137, 137, 137, 137, 139,
137, 137, 140, 137, 137, 137, 138, 26, 137, 137,
137, 141, 137, 26, 137, 142, 137, 26, 143, 137,
139, 137, 140, 34, 137, 144, 137, 34, 137, 137,
34, 145, 43, 43, 137, 43, 137, 146, 26, 45,
142, 142, 137, 26, 137, 57, 57, 137, 57, 137,
147, 34, 59, 137, 34, 137, 43, 64, 137, 43,
43, 45, 26, 75, 57, 77, 137, 57, 57, 59,
34, 86, 64, 43, 91, 45, 75, 77, 57, 99,
59, 86, 64, 91, 45, 75, 77, 99, 59, 86,
64, 91, 45, 75, 77, 99, 59, 86, 64, 91,
75, 77, 99, 86, 91, 99, 0, 137, 137, 137,
137, 137, 137, 137, 137, 137, 137
);
yy_nxt : constant array (0 .. 459) of Short :=
(0,
4, 5, 6, 5, 5, 7, 8, 4, 9, 10,
11, 12, 13, 14, 15, 16, 17, 18, 19, 20,
4, 21, 22, 23, 24, 25, 26, 26, 27, 28,
29, 26, 30, 35, 35, 35, 35, 98, 90, 45,
31, 85, 76, 74, 32, 35, 35, 35, 35, 33,
45, 37, 34, 34, 38, 38, 59, 34, 53, 38,
41, 54, 54, 45, 64, 75, 54, 59, 63, 42,
58, 44, 43, 43, 45, 64, 75, 43, 47, 35,
35, 35, 35, 48, 98, 48, 42, 59, 90, 43,
43, 85, 49, 77, 43, 48, 48, 86, 59, 56,
48, 55, 57, 57, 77, 91, 92, 57, 86, 99,
56, 100, 103, 57, 57, 80, 91, 92, 57, 60,
99, 106, 100, 103, 61, 76, 61, 107, 108, 111,
74, 67, 106, 62, 112, 113, 61, 61, 107, 108,
111, 61, 65, 114, 115, 112, 113, 66, 63, 66,
116, 117, 118, 67, 114, 115, 68, 58, 119, 66,
66, 116, 117, 118, 66, 44, 44, 44, 69, 119,
120, 121, 122, 47, 123, 124, 97, 125, 48, 72,
70, 120, 121, 122, 72, 123, 124, 49, 125, 126,
48, 70, 44, 127, 128, 48, 78, 129, 130, 89,
126, 79, 84, 79, 127, 128, 48, 80, 129, 130,
81, 52, 131, 79, 79, 132, 73, 48, 79, 58,
58, 58, 82, 131, 133, 61, 132, 60, 134, 66,
72, 135, 61, 39, 83, 133, 61, 48, 52, 134,
66, 62, 135, 79, 61, 83, 136, 61, 48, 61,
63, 63, 63, 87, 79, 66, 79, 136, 61, 50,
46, 40, 39, 36, 137, 88, 66, 79, 137, 137,
137, 137, 137, 137, 137, 137, 88, 74, 74, 74,
93, 137, 137, 137, 137, 47, 137, 137, 137, 137,
48, 137, 94, 137, 137, 137, 137, 137, 137, 49,
137, 137, 48, 94, 137, 137, 137, 48, 76, 76,
76, 95, 137, 137, 137, 137, 137, 137, 137, 137,
137, 137, 137, 96, 137, 137, 137, 137, 137, 137,
137, 137, 137, 137, 96, 85, 85, 85, 101, 137,
137, 137, 137, 60, 137, 137, 137, 137, 61, 137,
102, 137, 137, 137, 137, 137, 137, 62, 137, 137,
61, 102, 137, 137, 137, 61, 90, 90, 90, 104,
137, 137, 137, 137, 137, 137, 137, 137, 137, 137,
137, 105, 137, 137, 137, 137, 137, 137, 137, 137,
137, 137, 105, 98, 98, 98, 109, 137, 137, 137,
137, 137, 137, 137, 137, 137, 137, 137, 110, 137,
137, 137, 137, 137, 137, 137, 137, 137, 137, 110,
51, 51, 51, 71, 137, 71, 3, 137, 137, 137,
137, 137, 137, 137, 137, 137, 137, 137, 137, 137,
137, 137, 137, 137, 137, 137, 137, 137, 137, 137,
137, 137, 137, 137, 137, 137, 137, 137, 137
);
yy_chk : constant array (0 .. 459) of Short :=
(0,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
1, 1, 2, 5, 5, 5, 5, 147, 146, 23,
2, 145, 144, 143, 2, 6, 6, 6, 6, 2,
23, 15, 2, 2, 15, 15, 33, 2, 31, 15,
19, 31, 31, 37, 42, 49, 31, 33, 141, 19,
140, 138, 19, 19, 37, 42, 49, 19, 26, 35,
35, 35, 35, 26, 109, 26, 41, 53, 104, 41,
41, 101, 26, 56, 41, 26, 26, 62, 53, 55,
26, 32, 55, 55, 56, 68, 70, 55, 62, 81,
32, 83, 88, 32, 32, 97, 68, 70, 32, 34,
81, 92, 83, 88, 34, 95, 34, 94, 96, 100,
93, 89, 92, 34, 102, 103, 34, 34, 94, 96,
100, 34, 43, 105, 106, 102, 103, 43, 87, 43,
107, 108, 110, 43, 105, 106, 43, 82, 111, 43,
43, 107, 108, 110, 43, 45, 45, 45, 45, 111,
112, 113, 114, 45, 115, 116, 78, 117, 45, 72,
45, 112, 113, 114, 71, 115, 116, 45, 117, 118,
45, 45, 69, 119, 120, 45, 57, 121, 122, 65,
118, 57, 60, 57, 119, 120, 123, 57, 121, 122,
57, 51, 124, 57, 57, 125, 47, 123, 57, 59,
59, 59, 59, 124, 126, 127, 125, 59, 128, 129,
46, 130, 59, 39, 59, 126, 127, 131, 30, 128,
129, 59, 130, 132, 59, 59, 133, 134, 131, 59,
64, 64, 64, 64, 132, 135, 136, 133, 134, 28,
25, 18, 17, 9, 3, 64, 135, 136, 0, 0,
0, 0, 0, 0, 0, 0, 64, 75, 75, 75,
75, 0, 0, 0, 0, 75, 0, 0, 0, 0,
75, 0, 75, 0, 0, 0, 0, 0, 0, 75,
0, 0, 75, 75, 0, 0, 0, 75, 77, 77,
77, 77, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 77, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 77, 86, 86, 86, 86, 0,
0, 0, 0, 86, 0, 0, 0, 0, 86, 0,
86, 0, 0, 0, 0, 0, 0, 86, 0, 0,
86, 86, 0, 0, 0, 86, 91, 91, 91, 91,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 91, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 91, 99, 99, 99, 99, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 99, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 99,
139, 139, 139, 142, 0, 142, 137, 137, 137, 137,
137, 137, 137, 137, 137, 137, 137, 137, 137, 137,
137, 137, 137, 137, 137, 137, 137, 137, 137, 137,
137, 137, 137, 137, 137, 137, 137, 137, 137
);
-- copy whatever the last rule matched to the standard output
-- enter a start condition.
-- Using procedure requires a () after the ENTER, but makes everything
-- much neater.
procedure ENTER (state : Integer) is
begin
yy_start := 1 + 2 * state;
end ENTER;
-- action number for EOF rule of a given start state
function YY_STATE_EOF (state : Integer) return Integer is
begin
return YY_END_OF_BUFFER + state + 1;
end YY_STATE_EOF;
-- return all but the first 'n' matched characters back to the input stream
procedure yyless (n : Integer) is
begin
yy_ch_buf (yy_cp) := yy_hold_char; -- undo effects of setting up yytext
yy_cp := yy_bp + n;
yy_c_buf_p := yy_cp;
YY_DO_BEFORE_ACTION; -- set up yytext again
end yyless;
-- redefine this if you have something you want each time.
procedure YY_USER_ACTION is
begin
null;
end YY_USER_ACTION;
-- yy_get_previous_state - get the state just before the EOB char was reached
function yy_get_previous_state return yy_state_type is
yy_current_state : yy_state_type;
yy_c : Short;
yy_bp : constant Integer := yytext_ptr;
begin
yy_current_state := yy_start;
if yy_ch_buf (yy_bp - 1) = ASCII.LF then
yy_current_state := yy_current_state + 1;
end if;
for yy_cp in yytext_ptr .. yy_c_buf_p - 1 loop
yy_c := yy_ec (yy_ch_buf (yy_cp));
if yy_accept (yy_current_state) /= 0 then
yy_last_accepting_state := yy_current_state;
yy_last_accepting_cpos := yy_cp;
yy_last_yylineno := yylineno;
yy_last_yylinecol := yylinecol;
end if;
while yy_chk (yy_base (yy_current_state) + yy_c) /= yy_current_state loop
yy_current_state := yy_def (yy_current_state);
if yy_current_state >= 138 then
yy_c := yy_meta (yy_c);
end if;
end loop;
yy_current_state := yy_nxt (yy_base (yy_current_state) + yy_c);
end loop;
return yy_current_state;
end yy_get_previous_state;
procedure yyrestart (input_file : File_Type) is
begin
Open_Input (Text_IO.Name (input_file));
end yyrestart;
begin -- of YYLex
<<new_file>>
-- this is where we enter upon encountering an end-of-file and
-- yyWrap () indicating that we should continue processing
if yy_init then
if yy_start = 0 then
yy_start := 1; -- first start state
end if;
-- we put in the '\n' and start reading from [1] so that an
-- initial match-at-newline will be true.
yy_ch_buf (0) := ASCII.LF;
yy_n_chars := 1;
-- we always need two end-of-buffer characters. The first causes
-- a transition to the end-of-buffer state. The second causes
-- a jam in that state.
yy_ch_buf (yy_n_chars) := YY_END_OF_BUFFER_CHAR;
yy_ch_buf (yy_n_chars + 1) := YY_END_OF_BUFFER_CHAR;
yy_eof_has_been_seen := False;
yytext_ptr := 1;
yy_c_buf_p := yytext_ptr;
yy_hold_char := yy_ch_buf (yy_c_buf_p);
yy_init := False;
end if; -- yy_init
loop -- loops until end-of-file is reached
yy_cp := yy_c_buf_p;
-- support of yytext
yy_ch_buf (yy_cp) := yy_hold_char;
-- yy_bp points to the position in yy_ch_buf of the start of the
-- current run.
yy_bp := yy_cp;
yy_current_state := yy_start;
if yy_ch_buf (yy_bp - 1) = ASCII.LF then
yy_current_state := yy_current_state + 1;
end if;
loop
yy_c := yy_ec (yy_ch_buf (yy_cp));
if yy_accept (yy_current_state) /= 0 then
yy_last_accepting_state := yy_current_state;
yy_last_accepting_cpos := yy_cp;
yy_last_yylineno := yylineno;
yy_last_yylinecol := yylinecol;
end if;
while yy_chk (yy_base (yy_current_state) + yy_c) /= yy_current_state loop
yy_current_state := yy_def (yy_current_state);
if yy_current_state >= 138 then
yy_c := yy_meta (yy_c);
end if;
end loop;
yy_current_state := yy_nxt (yy_base (yy_current_state) + yy_c);
if yy_ch_buf (yy_cp) = ASCII.LF then
yylineno := yylineno + 1;
yylinecol := 1;
else
yylinecol := yylinecol + 1;
end if;
yy_cp := yy_cp + 1;
if yy_current_state = 137 then
exit;
end if;
end loop;
yy_cp := yy_last_accepting_cpos;
yy_current_state := yy_last_accepting_state;
yylineno := yy_last_yylineno;
yylinecol := yy_last_yylinecol;
<<next_action>>
yy_act := yy_accept (yy_current_state);
YY_DO_BEFORE_ACTION;
YY_USER_ACTION;
if aflex_debug then -- output acceptance info. for (-d) debug mode
Text_IO.Put (Standard_Error, " -- Aflex.YYLex accept rule #");
Text_IO.Put (Standard_Error, Integer'Image (yy_act));
Text_IO.Put_Line (Standard_Error, "(""" & YYText & """)");
end if;
<<do_action>> -- this label is used only to access EOF actions
case yy_act is
when 0 => -- must backtrack
-- undo the effects of YY_DO_BEFORE_ACTION
yy_ch_buf (yy_cp) := yy_hold_char;
yy_cp := yy_last_accepting_cpos;
yylineno := yy_last_yylineno;
yylinecol := yy_last_yylinecol;
yy_current_state := yy_last_accepting_state;
goto next_action;
when 1 =>
yy_ch_buf (yy_cp) := yy_hold_char; -- undo effects of setting up yytext
yy_cp := yy_cp - 1;
yy_c_buf_p := yy_cp;
YY_DO_BEFORE_ACTION; -- set up yytext again
null;
when 2 =>
return '{';
when 3 =>
return '}';
when 4 =>
return '[';
when 5 =>
return ']';
when 6 =>
return '(';
when 7 =>
return ')';
when 8 =>
return '=';
when 9 =>
return '|';
when 10 =>
return '?';
when 11 =>
return '#';
when 12 =>
return '*';
when 13 =>
return '+';
when 14 =>
return '!';
when 15 =>
return ',';
when 16 =>
return '/';
when 17 =>
return S;
when 18 =>
return R_DEFINE;
when 19 =>
return R_FOLLOW;
when 20 =>
return R_ANY;
when 21 =>
Set_Ident (yylval, YYText, yylineno, yylinecol); return R_PROPERTY;
when 22 =>
Set_Ident (yylval, YYText, yylineno, yylinecol); return R_DEF_NAME;
when 23 =>
Set_Ident (yylval, YYText, yylineno, yylinecol); return R_IDENT;
when 24 =>
Set_Ident (yylval, YYText, yylineno, yylinecol); return R_NAME;
when 25 =>
Set_Ident (yylval, YYText, yylineno, yylinecol); return R_NUM;
when 26 =>
null;
when 27 =>
Error (yylineno, yylinecol, "Illegal character '" & YYText & "'");
when 28 =>
raise AFLEX_SCANNER_JAMMED;
when YY_END_OF_BUFFER + INITIAL + 1 =>
return End_Of_Input;
when YY_END_OF_BUFFER =>
-- undo the effects of YY_DO_BEFORE_ACTION
yy_ch_buf (yy_cp) := yy_hold_char;
yytext_ptr := yy_bp;
case yy_get_next_buffer is
when EOB_ACT_END_OF_FILE =>
if yyWrap then
-- note: because we've taken care in
-- yy_get_next_buffer() to have set up yytext,
-- we can now set up yy_c_buf_p so that if some
-- total hoser (like aflex itself) wants
-- to call the scanner after we return the
-- End_Of_Input, it'll still work - another
-- End_Of_Input will get returned.
yy_c_buf_p := yytext_ptr;
yy_act := YY_STATE_EOF ((yy_start - 1) / 2);
goto do_action;
else
-- start processing a new file
yy_init := True;
goto new_file;
end if;
when EOB_ACT_RESTART_SCAN =>
yy_c_buf_p := yytext_ptr;
yy_hold_char := yy_ch_buf (yy_c_buf_p);
when EOB_ACT_LAST_MATCH =>
yy_c_buf_p := yy_n_chars;
yy_current_state := yy_get_previous_state;
yy_cp := yy_c_buf_p;
yy_bp := yytext_ptr;
goto next_action;
when others =>
null;
end case; -- case yy_get_next_buffer()
when others =>
Text_IO.Put ("action # ");
Text_IO.Put (Integer'Image (yy_act));
Text_IO.New_Line;
raise AFLEX_INTERNAL_ERROR;
end case; -- case (yy_act)
end loop; -- end of loop waiting for end of file
end YYLex;
pragma Style_Checks (On);
end CSS.Analysis.Parser.Lexer;
| 39.641304 | 88 | 0.42391 |
4b4adcf109c0ba08d39977038f1d0143d73a0704 | 7,649 | ads | Ada | llvm-gcc-4.2-2.9/gcc/ada/a-intnam-solaris.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | 1 | 2016-04-09T02:58:13.000Z | 2016-04-09T02:58:13.000Z | llvm-gcc-4.2-2.9/gcc/ada/a-intnam-solaris.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | llvm-gcc-4.2-2.9/gcc/ada/a-intnam-solaris.ads | vidkidz/crossbridge | ba0bf94aee0ce6cf7eb5be882382e52bc57ba396 | [
"MIT"
] | null | null | null | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS --
-- --
-- A D A . I N T E R R U P T S . N A M E S --
-- --
-- S p e c --
-- --
-- Copyright (C) 1991-2005, 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 2, or (at your option) any later ver- --
-- sion. GNARL is distributed in the hope that it will be useful, but WITH- --
-- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY --
-- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License --
-- for more details. You should have received a copy of the GNU General --
-- Public License distributed with GNARL; see file COPYING. If not, write --
-- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, --
-- Boston, MA 02110-1301, USA. --
-- --
-- As a special exception, if other files instantiate generics from this --
-- unit, or you link this unit with other files to produce an executable, --
-- this unit does not by itself cause the resulting executable to be --
-- covered by the GNU General Public License. This exception does not --
-- however invalidate any other reasons why the executable file might be --
-- covered by the GNU Public License. --
-- --
-- GNARL was developed by the GNARL team at Florida State University. --
-- Extensive contributions were provided by Ada Core Technologies, Inc. --
-- --
------------------------------------------------------------------------------
-- This is a Solaris version of this package
-- The following signals are reserved by the run time (native threads):
-- SIGFPE, SIGILL, SIGSEGV, SIGBUS, SIGTRAP, SIGABRT, SIGINT,
-- SIGLWP, SIGWAITING, SIGCANCEL, SIGSTOP, SIGKILL
-- The following signals are reserved by the run time (FSU threads):
-- SIGFPE, SIGILL, SIGSEGV, SIGBUS, SIGTRAP, SIGTERM, SIGABRT, SIGINT,
-- SIGLWP, SIGALRM, SIGVTALRM, SIGAITING, SIGSTOP, SIGKILL
-- The pragma Unreserve_All_Interrupts affects the following signal(s):
-- SIGINT: made available for Ada handlers
with System.OS_Interface;
-- used for names of interrupts
package Ada.Interrupts.Names is
-- Beware that the mapping of names to signals may be many-to-one. There
-- may be aliases. Also, for all signal names that are not supported on the
-- current system the value of the corresponding constant will be zero.
SIGHUP : constant Interrupt_ID :=
System.OS_Interface.SIGHUP; -- hangup
SIGINT : constant Interrupt_ID :=
System.OS_Interface.SIGINT; -- interrupt (rubout)
SIGQUIT : constant Interrupt_ID :=
System.OS_Interface.SIGQUIT; -- quit (ASCD FS)
SIGILL : constant Interrupt_ID :=
System.OS_Interface.SIGILL; -- illegal instruction (not reset)
SIGTRAP : constant Interrupt_ID :=
System.OS_Interface.SIGTRAP; -- trace trap (not reset)
SIGIOT : constant Interrupt_ID :=
System.OS_Interface.SIGIOT; -- IOT instruction
SIGABRT : constant Interrupt_ID := -- used by abort,
System.OS_Interface.SIGABRT; -- replace SIGIOT in the future
SIGEMT : constant Interrupt_ID :=
System.OS_Interface.SIGEMT; -- EMT instruction
SIGFPE : constant Interrupt_ID :=
System.OS_Interface.SIGFPE; -- floating point exception
SIGKILL : constant Interrupt_ID :=
System.OS_Interface.SIGKILL; -- kill (cannot be caught or ignored)
SIGBUS : constant Interrupt_ID :=
System.OS_Interface.SIGBUS; -- bus error
SIGSEGV : constant Interrupt_ID :=
System.OS_Interface.SIGSEGV; -- segmentation violation
SIGSYS : constant Interrupt_ID :=
System.OS_Interface.SIGSYS; -- bad argument to system call
SIGPIPE : constant Interrupt_ID := -- write on a pipe with
System.OS_Interface.SIGPIPE; -- no one to read it
SIGALRM : constant Interrupt_ID :=
System.OS_Interface.SIGALRM; -- alarm clock
SIGTERM : constant Interrupt_ID :=
System.OS_Interface.SIGTERM; -- software termination signal from kill
SIGUSR1 : constant Interrupt_ID :=
System.OS_Interface.SIGUSR1; -- user defined signal 1
SIGUSR2 : constant Interrupt_ID :=
System.OS_Interface.SIGUSR2; -- user defined signal 2
SIGCLD : constant Interrupt_ID :=
System.OS_Interface.SIGCLD; -- child status change
SIGCHLD : constant Interrupt_ID :=
System.OS_Interface.SIGCHLD; -- 4.3BSD's/POSIX name for SIGCLD
SIGWINCH : constant Interrupt_ID :=
System.OS_Interface.SIGWINCH; -- window size change
SIGURG : constant Interrupt_ID :=
System.OS_Interface.SIGURG; -- urgent condition on IO channel
SIGPOLL : constant Interrupt_ID :=
System.OS_Interface.SIGPOLL; -- pollable event occurred
SIGIO : constant Interrupt_ID := -- input/output possible,
System.OS_Interface.SIGIO; -- SIGPOLL alias (Solaris)
SIGSTOP : constant Interrupt_ID :=
System.OS_Interface.SIGSTOP; -- stop (cannot be caught or ignored)
SIGTSTP : constant Interrupt_ID :=
System.OS_Interface.SIGTSTP; -- user stop requested from tty
SIGCONT : constant Interrupt_ID :=
System.OS_Interface.SIGCONT; -- stopped process has been continued
SIGTTIN : constant Interrupt_ID :=
System.OS_Interface.SIGTTIN; -- background tty read attempted
SIGTTOU : constant Interrupt_ID :=
System.OS_Interface.SIGTTOU; -- background tty write attempted
SIGVTALRM : constant Interrupt_ID :=
System.OS_Interface.SIGVTALRM; -- virtual timer expired
SIGPROF : constant Interrupt_ID :=
System.OS_Interface.SIGPROF; -- profiling timer expired
SIGXCPU : constant Interrupt_ID :=
System.OS_Interface.SIGXCPU; -- CPU time limit exceeded
SIGXFSZ : constant Interrupt_ID :=
System.OS_Interface.SIGXFSZ; -- filesize limit exceeded
SIGPWR : constant Interrupt_ID :=
System.OS_Interface.SIGPWR; -- power-fail restart
SIGWAITING : constant Interrupt_ID :=
System.OS_Interface.SIGWAITING; -- process's lwps blocked (Solaris)
SIGLWP : constant Interrupt_ID :=
System.OS_Interface.SIGLWP; -- used by thread library (Solaris)
SIGFREEZE : constant Interrupt_ID :=
System.OS_Interface.SIGFREEZE; -- used by CPR (Solaris)
-- what is CPR????
SIGTHAW : constant Interrupt_ID :=
System.OS_Interface.SIGTHAW; -- used by CPR (Solaris)
SIGCANCEL : constant Interrupt_ID :=
System.OS_Interface.SIGCANCEL; -- used for thread cancel (Solaris)
end Ada.Interrupts.Names;
| 42.731844 | 79 | 0.599163 |
132c8832b7bfd7c0efcbec5c519b43980613c108 | 1,838 | ads | Ada | gcc-gcc-7_3_0-release/gcc/ada/a-locale.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-locale.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | null | null | null | gcc-gcc-7_3_0-release/gcc/ada/a-locale.ads | best08618/asylo | 5a520a9f5c461ede0f32acc284017b737a43898c | [
"Apache-2.0"
] | 2 | 2020-07-27T00:22:36.000Z | 2021-04-01T09:41:02.000Z | ------------------------------------------------------------------------------
-- --
-- GNAT RUN-TIME COMPONENTS --
-- --
-- A D A . L O C A L E S --
-- --
-- S p e c --
-- --
-- Copyright (C) 2010-2016, Free Software Foundation, Inc. --
-- --
-- This specification is derived from the Ada Reference Manual for use with --
-- GNAT. In accordance with the copyright of that document, you can freely --
-- copy and modify this specification, provided that if you redistribute a --
-- modified version, any changes that you have made are clearly indicated. --
-- --
------------------------------------------------------------------------------
package Ada.Locales is
pragma Preelaborate (Locales);
pragma Remote_Types (Locales);
type Language_Code is new String (1 .. 3)
with Dynamic_Predicate =>
(for all E of Language_Code => E in 'a' .. 'z');
type Country_Code is new String (1 .. 2)
with Dynamic_Predicate =>
(for all E of Country_Code => E in 'A' .. 'Z');
Language_Unknown : constant Language_Code := "und";
Country_Unknown : constant Country_Code := "ZZ";
function Language return Language_Code;
function Country return Country_Code;
end Ada.Locales;
| 49.675676 | 78 | 0.379217 |
Subsets and Splits