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
4beb61ed1270c1b8eed8599bb4c18faede07d9c6
2,495
ada
Ada
gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ca/ca5003b5.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/ca/ca5003b5.ada
best08618/asylo
5a520a9f5c461ede0f32acc284017b737a43898c
[ "Apache-2.0" ]
null
null
null
gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/ca/ca5003b5.ada
best08618/asylo
5a520a9f5c461ede0f32acc284017b737a43898c
[ "Apache-2.0" ]
2
2020-07-27T00:22:36.000Z
2021-04-01T09:41:02.000Z
-- CA5003B5M.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 ELABORATION OF LIBRARY UNITS REQUIRED BY -- A MAIN PROGRAM IS PERFORMED CONSISTENTLY WITH THE PARTIAL -- ORDERING DEFINED BY THE COMPILATION ORDER RULES. -- IN PARTICULAR, CHECK THAT A LIBRARY UNIT MENTIONED IN THE -- WITH_CLAUSE OF A SUBUNIT IS ELABORATED PRIOR TO THE BODY OF -- THE ANCESTOR UNIT. -- SEPARATE FILES ARE: -- CA5003B0 A LIBRARY PACKAGE. -- CA5003B1 A LIBRARY PACKAGE. -- CA5003B2 A SUBUNIT PACKAGE BODY (_B1._B2). -- CA5003B3 A LIBRARY PACKAGE DECLARATION. -- CA5003B4 A SUBUNIT PACKAGE BODY (_B1._B2._B4). -- CA5003B5M THE MAIN PROCEDURE. -- LIBRARY PACKAGES MUST BE ELABORATED IN ORDER: _B0, _B3, _B1. -- PARENT UNITS MUST BE ELABORATED BEFORE THEIR SUBUNITS. -- WKB 7/22/81 -- JBG 10/6/83 -- BHS 8/02/84 -- JRK 9/20/84 WITH REPORT, CA5003B0; USE REPORT, CA5003B0; WITH CA5003B1; PROCEDURE CA5003B5M IS BEGIN TEST ("CA5003B", "CHECK THAT UNITS IN WITH_CLAUSES OF " & "SUBUNITS ARE ELABORATED PRIOR TO THE " & "BODY OF THE ANCESTOR UNIT"); COMMENT ("ACTUAL ELABORATION ORDER WAS " & ORDER); IF ORDER /= "3124" THEN FAILED ("ILLEGAL ELABORATION ORDER"); END IF; RESULT; END CA5003B5M;
37.80303
79
0.676152
0485ae74860c8b0160fe4ec25778cb85b01ea631
10,605
ads
Ada
src/open_weather_map-api.ads
Jellix/open_weather_map_api
fa3484b361411b9362500a25e36d63d4bb6dbca3
[ "WTFPL" ]
1
2020-09-04T18:31:05.000Z
2020-09-04T18:31:05.000Z
src/open_weather_map-api.ads
Jellix/open_weather_map_api
fa3484b361411b9362500a25e36d63d4bb6dbca3
[ "WTFPL" ]
2
2020-03-22T16:28:32.000Z
2020-03-22T16:31:51.000Z
src/open_weather_map-api.ads
HeisenbugLtd/open_weather_map_api
fa3484b361411b9362500a25e36d63d4bb6dbca3
[ "WTFPL" ]
null
null
null
-------------------------------------------------------------------------------- -- Copyright (C) 2020 by Heisenbug Ltd. ([email protected]) -- -- This work is free. You can redistribute it and/or modify it under the -- terms of the Do What The Fuck You Want To Public License, Version 2, -- as published by Sam Hocevar. See the LICENSE file for more details. -------------------------------------------------------------------------------- pragma License (Unrestricted); limited with GNATCOLL.JSON; with Open_Weather_Map.Client; -------------------------------------------------------------------------------- --% @summary --% Open_Weather_Map.API --% Publicly visible interface to the openweathermap.org API. -- --% @description --% Provides the abstract tagged type (i.e. interface) of what any derived API --% query implementation will provide, and "constructor" subprograms to create --% such query objects. -- -- Query objects are immutable in the sense that, once constructed, they are -- responsible for exactly one specific API call. -- -- For instance, Create_Current_By_Id will create a query object that can -- retrieve weather information for a single location/city with the Id given -- at construction time. If you need weather information for a location with -- a different id, you either need to construct another query object with the -- different id or derive a new tagged type where the id can be changed -- during the life time of the object of that type. -------------------------------------------------------------------------------- package Open_Weather_Map.API is ----------------------------------------------------------------------------- -- The abstract base class for the API. This is the official interface, all -- derived types shall be considered private. ----------------------------------------------------------------------------- type T is abstract tagged limited private; subtype API_Class is T'Class; type API_Class_Access is not null access API_Class; ----------------------------------------------------------------------------- -- Perform_Query ----------------------------------------------------------------------------- procedure Perform_Query (Self : in out T; Current : in out Data_Set) is abstract; --% Operation to fire and evaluate a query as defined by the actual type of --% client context Self. -- --% @param Self --% The client instance to perform the query. -- --% @param Current --% The data set being updated during the query. ----------------------------------------------------------------------------- -- Last_Query ----------------------------------------------------------------------------- function Last_Query (Self : in T) return Ada.Real_Time.Time is abstract; --% @param Self --% The client instance. -- --% @return --% The time of the last query done with the client context This. ----------------------------------------------------------------------------- -- Query object constructing subprograms -- -- All these subprograms follow the same approach. First, the API specific -- parameters (ids, locations, ...), the remaining parameters should be the -- same for all constructors. -- -- Configuration : The JSON object holding the configuration data (usually -- read from some external file). -- Connection : If Connection is not null, then the given object will be -- re-used to establish communication with the API server. -- It is the responsibility of the caller to ensure that the -- life time of the connection object is at least the life -- time of the returned query object. -- If Connection is null, then a new connection object will -- be dynamically created. -- FIXME: As of now, there is no automatic storage -- reclamation for these, so if you keep creating -- new query objects with no shared connection, you -- will leak memory. -- Cache_Interval: The time interval at which new data is requested from the -- server. You can call Perform_Query as often as you want -- on the returned object, but as long as the duration -- between such calls is shorter than Cache_Interval, no new -- data will be requested and we simply return the previous -- data set. -- Rate_Limit : Limits the amount of calls to the API server using the -- connection. Calls to the server must be at least the -- given duration apart, otherwise the call will be delayed -- until at least the given interval has passed. This is -- only really useful in conjunction with shared -- connections, if you have a connection per query object, -- Cache_Interval should take care of any rate limits -- (unless, of course, it's smaller than Rate_Limit). -- Please note that, unlike with Cache_Interval, the caller -- will actually be suspended for a time if the Rate_Limit -- is exceeded. -- Also, keep in mind that the rate limit only applies when -- a new connection object is being created. If you share -- connections, the Rate_Limit in use will be the one from -- the connection given, and this parameter will be ignored. ----------------------------------------------------------------------------- ----------------------------------------------------------------------------- -- Create_Current_By_Coordinates ----------------------------------------------------------------------------- function Create_Current_By_Coordinates (Coordinates : in Geo_Coordinates; Configuration : in GNATCOLL.JSON.JSON_Value; Connection : in Client.T_Access := null; Cache_Interval : in Ada.Real_Time.Time_Span := Default_Cache_Interval; Rate_Limit : in Ada.Real_Time.Time_Span := Default_Rate_Limit) return API.API_Class; --% Creates a current weather query context by coordinates. -- Translates to: -- api.openweathermap.org/data/2.5/weather?lat={Latitude}&lon={Longitude} -- --% @param Coordinates --% The geographical coordinates the API query shall be created for. -- --% @param Configuration --% Configuration object with connection configuration data. -- --% @param Connection --% The server connection to be re-used with this query if not null. If this --% parameter is null, a new server connection will be created. -- --% @param Cache_Interval --% Amount of time previous queries are cached before a new query is sent to --% the server. -- --% @param Rate_Limit --% Minimum time interval between queries. As this is specific to the --% connection object, this only applies if the Connection parameter is null. -- --% @return --% An API query object for current weather data at given coordinates. ----------------------------------------------------------------------------- -- Create_Current_By_Group ----------------------------------------------------------------------------- function Create_Current_By_Group (Ids : in Group_List; Configuration : in GNATCOLL.JSON.JSON_Value; Connection : in Client.T_Access := null; Cache_Interval : in Ada.Real_Time.Time_Span := Default_Cache_Interval; Rate_Limit : in Ada.Real_Time.Time_Span := Default_Rate_Limit) return API.API_Class; ---% Creates a current weather query context by city id. -- -- Translates to: -- api.openweathermap.org/data/2.5/group?id={Ids} -- -- Please be aware that while this only fires a single query, each member of -- the group still counts as one API call as far as rate limits are -- concerned. -- --% @param Ids --% The list of city ids to be queried. -- --% @param Configuration --% Configuration object with connection configuration data. -- --% @param Connection --% The server connection to be re-used with this query if not null. If this --% parameter is null, a new server connection will be created. -- --% @param Cache_Interval --% Amount of time previous queries are cached before a new query is sent to --% the server. -- --% @param Rate_Limit --% Minimum time interval between queries. As this is specific to the --% connection object, this only applies if the Connection parameter is null. -- --% @return --% An API query object for current weather data for the given list of city --% ids. ----------------------------------------------------------------------------- -- Create_Current_By_Id ----------------------------------------------------------------------------- function Create_Current_By_Id (Id : in City_Id; Configuration : in GNATCOLL.JSON.JSON_Value; Connection : in Client.T_Access := null; Cache_Interval : in Ada.Real_Time.Time_Span := Default_Cache_Interval; Rate_Limit : in Ada.Real_Time.Time_Span := Default_Rate_Limit) return API.API_Class; --% Creates a current weather query context by city id. -- -- Translates to: -- api.openweathermap.org/data/2.5/weather?id={City_Id} -- --% @param Id --% The city id to be queried. -- --% @param Configuration --% Configuration object with connection configuration data. -- --% @param Connection --% The server connection to be re-used with this query if not null. If this --% parameter is null, a new server connection will be created. -- --% @param Cache_Interval --% Amount of time previous queries are cached before a new query is sent to --% the server. -- --% @param Rate_Limit --% Minimum time interval between queries. As this is specific to the --% connection object, this only applies if the Connection parameter is null. -- --% @return --% An API query object for current weather data for the given city id. private type T is abstract tagged limited null record; end Open_Weather_Map.API;
46.310044
80
0.55983
41a50e5720a4b330cfd4beeaa7eda24bc2aa06f8
1,464
ads
Ada
tier-1/xcb/source/thin/xcb-xcb_glx_get_separable_filter_cookie_t.ads
charlie5/cBound
741be08197a61ad9c72553e3302f3b669902216d
[ "0BSD" ]
2
2015-11-12T11:16:20.000Z
2021-08-24T22:32:04.000Z
tier-1/xcb/source/thin/xcb-xcb_glx_get_separable_filter_cookie_t.ads
charlie5/cBound
741be08197a61ad9c72553e3302f3b669902216d
[ "0BSD" ]
1
2018-06-05T05:19:35.000Z
2021-11-20T01:13:23.000Z
tier-1/xcb/source/thin/xcb-xcb_glx_get_separable_filter_cookie_t.ads
charlie5/cBound
741be08197a61ad9c72553e3302f3b669902216d
[ "0BSD" ]
null
null
null
-- This file is generated by SWIG. Please do not modify by hand. -- with Interfaces.C; with Interfaces.C; with Interfaces.C.Pointers; package xcb.xcb_glx_get_separable_filter_cookie_t is -- Item -- type Item is record sequence : aliased Interfaces.C.unsigned; end record; -- Item_Array -- type Item_Array is array (Interfaces.C .size_t range <>) of aliased xcb .xcb_glx_get_separable_filter_cookie_t .Item; -- Pointer -- package C_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_glx_get_separable_filter_cookie_t.Item, Element_Array => xcb.xcb_glx_get_separable_filter_cookie_t.Item_Array, Default_Terminator => (others => <>)); subtype Pointer is C_Pointers.Pointer; -- Pointer_Array -- type Pointer_Array is array (Interfaces.C .size_t range <>) of aliased xcb .xcb_glx_get_separable_filter_cookie_t .Pointer; -- Pointer_Pointer -- package C_Pointer_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_glx_get_separable_filter_cookie_t.Pointer, Element_Array => xcb.xcb_glx_get_separable_filter_cookie_t.Pointer_Array, Default_Terminator => null); subtype Pointer_Pointer is C_Pointer_Pointers.Pointer; end xcb.xcb_glx_get_separable_filter_cookie_t;
26.618182
79
0.679645
1327a25468d49419ccbf7fa404cda4726bbc5d03
3,497
ada
Ada
gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c8/c83031c.ada
best08618/asylo
5a520a9f5c461ede0f32acc284017b737a43898c
[ "Apache-2.0" ]
7
2020-05-02T17:34:05.000Z
2021-10-17T10:15:18.000Z
gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c8/c83031c.ada
best08618/asylo
5a520a9f5c461ede0f32acc284017b737a43898c
[ "Apache-2.0" ]
null
null
null
gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c8/c83031c.ada
best08618/asylo
5a520a9f5c461ede0f32acc284017b737a43898c
[ "Apache-2.0" ]
2
2020-07-27T00:22:36.000Z
2021-04-01T09:41:02.000Z
-- C83031C.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 AN IMPLICIT DECLARATION OF A PREDEFINED OPERATOR OR -- ENUMERATION LITERAL IS HIDDEN BY A GENERIC INSTANTIATION WHICH -- DECLARES A HOMOGRAPH OF THE OPERATOR OR LITERAL. -- HISTORY: -- BCB 09/15/88 CREATED ORIGINAL TEST. WITH REPORT; USE REPORT; PROCEDURE C83031C IS BEGIN TEST ("C83031C", "CHECK THAT AN IMPLICIT DECLARATION OF A " & "PREDEFINED OPERATOR OR ENUMERATION LITERAL IS " & "HIDDEN BY A GENERIC INSTANTIATION WHICH " & "DECLARES A HOMOGRAPH OF THE OPERATOR OR " & "LITERAL"); DECLARE -- CHECK SUBPROGRAM DECLARATIONS OF OPERATORS PACKAGE P IS TYPE INT IS RANGE -20 .. 20; GENERIC TYPE X IS RANGE <>; FUNCTION GEN_FUN (LEFT, RIGHT : X) RETURN X; END P; USE P; PACKAGE BODY P IS FUNCTION GEN_FUN (LEFT, RIGHT : X) RETURN X IS BEGIN RETURN LEFT / RIGHT; END GEN_FUN; FUNCTION "*" IS NEW GEN_FUN (INT); BEGIN IF 2 * INT(IDENT_INT(2)) /= 1 THEN FAILED ("INCORRECT VALUE RETURNED IN CALL TO " & "EXPLICIT '*' OPERATOR - 1"); END IF; END P; BEGIN NULL; END; DECLARE -- CHECK SUBPROGRAM DECLARATIONS OF ENUMERATION LITERALS. PACKAGE P1 IS TYPE ENUM1 IS (E11, E12, E13); TYPE PRIV1 IS PRIVATE; GENERIC TYPE X IS (<>); FUNCTION GEN_FUN RETURN X; PRIVATE TYPE PRIV1 IS NEW ENUM1; END P1; USE P1; PACKAGE BODY P1 IS FUNCTION GEN_FUN RETURN X IS BEGIN RETURN X'LAST; END GEN_FUN; FUNCTION E11 IS NEW GEN_FUN (PRIV1); BEGIN IF PRIV1'(E11) /= E13 THEN FAILED ("INCORRECT VALUE FOR E11"); END IF; END P1; BEGIN NULL; END; RESULT; END C83031C;
34.284314
79
0.552474
22eecd4eeb4e98e7c978d2328aedfe82d7e7a268
1,816
adb
Ada
Ada/src/fakelib/utilities-hybrid_files.adb
fintatarta/fakedsp
ba1d722b177b02af94c046f3229823a76ceb7fef
[ "MIT" ]
null
null
null
Ada/src/fakelib/utilities-hybrid_files.adb
fintatarta/fakedsp
ba1d722b177b02af94c046f3229823a76ceb7fef
[ "MIT" ]
null
null
null
Ada/src/fakelib/utilities-hybrid_files.adb
fintatarta/fakedsp
ba1d722b177b02af94c046f3229823a76ceb7fef
[ "MIT" ]
null
null
null
pragma Ada_2012; package body Utilities.Hybrid_Files is -------------- -- Put_Line -- -------------- procedure Put_Line (To : Hybrid_File; Item : String) is begin if To.Standard_IO then Text_IO.Put_Line (Item); else Text_IO.Put_Line (To.File, Item); end if; end Put_Line; -------------- -- New_Line -- -------------- procedure New_Line (To : Hybrid_File) is begin if to.Standard_IO then Text_IO.New_Line; else Text_IO.New_Line (To.File); end if; end New_Line; ---------- -- Open -- ---------- procedure Open (File : in out Hybrid_File; Name : String; M : Text_IO.File_Mode) is begin Text_IO.Open (File => File.File, Mode => M, Name => Name); File.Opened := True; File.Standard_IO := False; File.Mode := M; end Open; ------------ -- Create -- ------------ procedure Create (File : in out Hybrid_File; Name : String; M : Text_IO.File_Mode) is begin Text_IO.Create (File => File.File, Mode => M, Name => Name); File.Opened := True; File.Standard_IO := False; File.Mode := M; end Create; ---------- -- Open -- ---------- procedure Open (File : in out Hybrid_File; M : Text_IO.File_Mode) is begin File.Opened := True; File.Standard_IO := True; File.Mode := M; end Open; ----------- -- Close -- ----------- procedure Close (File : in out Hybrid_File) is begin if not File.Standard_IO then Text_IO.Close (File.File); end if; File.Opened := False; end Close; end Utilities.Hybrid_Files;
18.721649
58
0.484581
ad6d358c27d870df9c0d3036c9301676dc4878f5
7,109
adb
Ada
Test/show_all.adb
jrcarter/Ada_GUI
65a829c55dec91fd48a0b72f88d76137768bf4fb
[ "BSD-3-Clause" ]
19
2018-03-18T18:07:14.000Z
2022-03-30T03:10:12.000Z
Test/show_all.adb
jrcarter/Ada_GUI
65a829c55dec91fd48a0b72f88d76137768bf4fb
[ "BSD-3-Clause" ]
4
2021-08-23T12:52:06.000Z
2022-03-31T10:48:43.000Z
Test/show_all.adb
jrcarter/Ada_GUI
65a829c55dec91fd48a0b72f88d76137768bf4fb
[ "BSD-3-Clause" ]
null
null
null
-- A program to show all of the Ada_GUI widgets -- An Ada_GUI demo program -- -- Copyright (C) 2021 by PragmAda Software Ebgineering -- Released under the terms of the BSD 3-Clause license; see https://opensource.org/licenses -- with Ada.Characters.Latin_1; with Ada.Strings.Unbounded; with Ada_GUI; procedure Show_All is Audio : Ada_GUI.Widget_ID; Background : Ada_GUI.Widget_ID; Visible : Ada_GUI.Widget_ID; Quit : Ada_GUI.Widget_ID; Check : Ada_GUI.Widget_ID; Graphic : Ada_GUI.Widget_ID; Password : Ada_GUI.Widget_ID; Radio : Ada_GUI.Widget_ID; Selection : Ada_GUI.Widget_ID; Area : Ada_GUI.Widget_ID; Box : Ada_GUI.Widget_ID; Pressed : Ada_GUI.Widget_ID; Sel_File : Ada_GUI.Widget_ID; File : Ada_GUI.Widget_ID; Event : Ada_GUI.Next_Result_Info; File_Info : Ada_GUI.File_Result_Info; use Ada.Strings.Unbounded; use type Ada_GUI.Event_Kind_ID; use type Ada_GUI.Widget_ID; begin -- Show_All Ada_GUI.Set_Up (Title => "Show All Ada_GUI Widgets"); Ada_GUI.Set_Background_Color (Color => Ada_GUI.To_Color (Ada_GUI.Light_Blue) ); Audio := Ada_GUI.New_Audio_Player (Source => "glass.ogg"); Audio.Set_Background_Color (Color => Ada_GUI.To_Color (Ada_GUI.Yellow) ); Audio.Set_Foreground_Color (Color => Ada_GUI.To_Color (Ada_GUI.Red) ); Background := Ada_GUI.New_Background_Text (Text => "Background_Text can <br><font color=" & '"' & "Green" & '"' & ">have</font> <b>at</b><i>tri</i><u>butes</u>&euro;", Break_Before => True); Background.Set_Background_Color (Color => Ada_GUI.To_Color (Ada_GUI.Yellow) ); Background.Set_Foreground_Color (Color => Ada_GUI.To_Color (Ada_GUI.Red) ); Visible := Ada_GUI.New_Check_Box (Label => "Visible", Active => True); Quit := Ada_GUI.New_Button (Text => "Quit", Break_Before => True); Quit.Set_Background_Color (Color => Ada_GUI.To_Color (Ada_GUI.Yellow) ); Quit.Set_Foreground_Color (Color => Ada_GUI.To_Color (Ada_GUI.Red) ); Check := Ada_GUI.New_Check_Box (Label => "Check_Box:", Break_Before => True); Check.Set_Background_Color (Color => Ada_GUI.To_Color (Ada_GUI.Yellow) ); Check.Set_Foreground_Color (Color => Ada_GUI.To_Color (Ada_GUI.Red) ); Graphic := Ada_GUI.New_Graphic_Area (Width => 100, Height => 100, Break_Before => True); Graphic.Set_Background_Color (Color => Ada_GUI.To_Color (Ada_GUI.Yellow) ); Graphic.Set_Foreground_Color (Color => Ada_GUI.To_Color (Ada_GUI.Red) ); Graphic.Draw_Rectangle (From_X => 10, From_Y => 10, To_X => 90, To_Y => 90, Fill_Color => (None => False, Color => Ada_GUI.To_Color (Ada_GUI.White) ) ); Graphic.Draw_Line (From_X => 0, From_Y => 0, To_X => 100, To_Y => 100, Width => 2); Graphic.Draw_Line (From_X => 0, From_Y => 100, To_X => 100, To_Y => 0, Width => 2, Color => Ada_GUI.To_Color (Ada_GUI.Green) ); Graphic.Set_Pixel (X => 75, Y => 25, Color => Ada_GUI.To_Color (Ada_GUI.Red) ); Graphic.Set_Pixel (X => 76, Y => 25, Color => Ada_GUI.To_Color (Ada_GUI.Red) ); Graphic.Set_Pixel (X => 75, Y => 26, Color => Ada_GUI.To_Color (Ada_GUI.Red) ); Graphic.Set_Pixel (X => 76, Y => 26, Color => Ada_GUI.To_Color (Ada_GUI.Red) ); Graphic.Draw_Text (X => 10, Y => 75, Text => "Texty", Line_Color => (None => False, Color => Ada_GUI.To_Color (Ada_GUI.Yellow) ), Fill_Color => (None => False, Color => Ada_GUI.To_Color (Ada_GUI.Blue) ) ); Graphic.Draw_Line (From_X => 0, From_Y => 75, To_X => 100, To_Y => 75); Password := Ada_GUI.New_Password_Box (Break_Before => True, Label => "Password_Box:"); Password.Set_Background_Color (Color => Ada_GUI.To_Color (Ada_GUI.Yellow) ); Password.Set_Foreground_Color (Color => Ada_GUI.To_Color (Ada_GUI.Red) ); Radio := Ada_GUI.New_Radio_Buttons (Label => (To_Unbounded_String ("Yes"), To_Unbounded_String ("No"), To_Unbounded_String ("Maybe") ), Break_Before => True); Radio.Set_Background_Color (Color => Ada_GUI.To_Color (Ada_GUI.Yellow) ); Radio.Set_Foreground_Color (Color => Ada_GUI.To_Color (Ada_GUI.Red) ); Selection := Ada_GUI.New_Selection_List (Text => (To_Unbounded_String ("Yes"), To_Unbounded_String ("No"), To_Unbounded_String ("Maybe") ), Break_Before => True); Selection.Set_Background_Color (Color => Ada_GUI.To_Color (Ada_GUI.Yellow) ); Selection.Set_Foreground_Color (Color => Ada_GUI.To_Color (Ada_GUI.Red) ); Selection.Set_Text_Aligbnment (Alignment => Ada_GUI.Right); Area := Ada_GUI.New_Text_Area (Text => "Some text" & Ada.Characters.Latin_1.LF & "Another line", Break_Before => True); Area.Set_Background_Color (Color => Ada_GUI.To_Color (Ada_GUI.Yellow) ); Area.Set_Foreground_Color (Color => Ada_GUI.To_Color (Ada_GUI.Red) ); Box := Ada_GUI.New_Text_Box (Break_Before => True, Label => "Text_Box:", Placeholder => "Placeholder"); Box.Set_Background_Color (Color => Ada_GUI.To_Color (Ada_GUI.Yellow) ); Box.Set_Foreground_Color (Color => Ada_GUI.To_Color (Ada_GUI.Red) ); Pressed := Ada_GUI.New_Text_Area (Break_Before => True); Pressed.Set_Background_Color (Color => Ada_GUI.To_Color (Ada_GUI.Light_Green) ); Pressed.Set_Foreground_Color (Color => Ada_GUI.To_Color (Ada_GUI.Dark_Blue) ); Sel_File := Ada_GUI.New_Button (Text => "Select File", Break_Before => True); File := Ada_GUI.New_Text_Box (Break_Before => True, Label => "Selected file:"); Wait_To_Quit : loop Event := Ada_GUI.Next_Event (Timeout => 1.0); if not Event.Timed_Out then exit Wait_To_Quit when Event.Event.Kind = Ada_GUI.Window_Closed; if Event.Event.Kind = Ada_GUI.Key_Press then Handle_Invalid : begin Pressed.Set_Text (Text => Pressed.Text & ' ' & Character'Val (Wide_Character'Pos (Event.Event.Key.Key_Char) ) ); exception -- Handle_Invalid when others => -- Key_Char not in Character Pressed.Set_Text (Text => Pressed.Text & " ?"); end Handle_Invalid; else exit Wait_To_Quit when Event.Event.ID = Quit; if Event.Event.ID = Visible then Background.Set_Visibility (Visible => Visible.Active); elsif Event.Event.ID = Sel_File then File_Info := Ada_GUI.Selected_File; File.Set_Text (Text => (if File_Info.Picked then To_String (File_Info.Value) else "") ); else null; end if; end if; end if; end loop Wait_To_Quit; Ada_GUI.End_GUI; end Show_All;
55.539063
130
0.61823
04a05325daf3b2404a5d52bb95a2c8c3ea55a002
5,906
adb
Ada
Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-pooloc.adb
djamal2727/Main-Bearing-Analytical-Model
2f00c2219c71be0175c6f4f8f1d4cca231d97096
[ "Apache-2.0" ]
null
null
null
Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-pooloc.adb
djamal2727/Main-Bearing-Analytical-Model
2f00c2219c71be0175c6f4f8f1d4cca231d97096
[ "Apache-2.0" ]
null
null
null
Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/s-pooloc.adb
djamal2727/Main-Bearing-Analytical-Model
2f00c2219c71be0175c6f4f8f1d4cca231d97096
[ "Apache-2.0" ]
null
null
null
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S Y S T E M . P O O L _ L O C A L -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2020, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with System.Memory; with Ada.Unchecked_Conversion; package body System.Pool_Local is package SSE renames System.Storage_Elements; use type SSE.Storage_Offset; Pointer_Size : constant SSE.Storage_Offset := Address'Size / Storage_Unit; Pointers_Size : constant SSE.Storage_Offset := 2 * Pointer_Size; type Acc_Address is access all Address; function To_Acc_Address is new Ada.Unchecked_Conversion (Address, Acc_Address); ----------------------- -- Local Subprograms -- ----------------------- function Next (A : Address) return Acc_Address; pragma Inline (Next); -- Given an address of a block, return an access to the next block function Prev (A : Address) return Acc_Address; pragma Inline (Prev); -- Given an address of a block, return an access to the previous block -------------- -- Allocate -- -------------- procedure Allocate (Pool : in out Unbounded_Reclaim_Pool; Address : out System.Address; Storage_Size : SSE.Storage_Count; Alignment : SSE.Storage_Count) is pragma Warnings (Off, Alignment); Allocated : constant System.Address := Memory.Alloc (Memory.size_t (Storage_Size + Pointers_Size)); begin -- The call to Alloc returns an address whose alignment is compatible -- with the worst case alignment requirement for the machine; thus the -- Alignment argument can be safely ignored. if Allocated = Null_Address then raise Storage_Error; else Address := Allocated + Pointers_Size; Next (Allocated).all := Pool.First; Prev (Allocated).all := Null_Address; if Pool.First /= Null_Address then Prev (Pool.First).all := Allocated; end if; Pool.First := Allocated; end if; end Allocate; ---------------- -- Deallocate -- ---------------- procedure Deallocate (Pool : in out Unbounded_Reclaim_Pool; Address : System.Address; Storage_Size : SSE.Storage_Count; Alignment : SSE.Storage_Count) is pragma Warnings (Off, Storage_Size); pragma Warnings (Off, Alignment); Allocated : constant System.Address := Address - Pointers_Size; begin if Prev (Allocated).all = Null_Address then Pool.First := Next (Allocated).all; -- Comment needed if Pool.First /= Null_Address then Prev (Pool.First).all := Null_Address; end if; else Next (Prev (Allocated).all).all := Next (Allocated).all; end if; if Next (Allocated).all /= Null_Address then Prev (Next (Allocated).all).all := Prev (Allocated).all; end if; Memory.Free (Allocated); end Deallocate; -------------- -- Finalize -- -------------- procedure Finalize (Pool : in out Unbounded_Reclaim_Pool) is N : System.Address := Pool.First; Allocated : System.Address; begin while N /= Null_Address loop Allocated := N; N := Next (N).all; Memory.Free (Allocated); end loop; end Finalize; ---------- -- Next -- ---------- function Next (A : Address) return Acc_Address is begin return To_Acc_Address (A); end Next; ---------- -- Prev -- ---------- function Prev (A : Address) return Acc_Address is begin return To_Acc_Address (A + Pointer_Size); end Prev; end System.Pool_Local;
35.578313
78
0.500677
ada02f1e6578bb9fc14f5d51ef4dcfbf1b5c2245
25,241
ads
Ada
src/vulkan-math/vulkan-math-integers.ads
zrmyers/VulkanAda
ed8c46d923bc8936db3a5d55d36afebb928a9ede
[ "MIT" ]
1
2021-01-29T21:10:45.000Z
2021-01-29T21:10:45.000Z
src/vulkan-math/vulkan-math-integers.ads
zrmyers/VulkanAda
ed8c46d923bc8936db3a5d55d36afebb928a9ede
[ "MIT" ]
8
2020-04-22T14:55:20.000Z
2021-11-22T03:58:08.000Z
src/vulkan-math/vulkan-math-integers.ads
zrmyers/VulkanAda
ed8c46d923bc8936db3a5d55d36afebb928a9ede
[ "MIT" ]
1
2021-04-05T13:19:21.000Z
2021-04-05T13:19:21.000Z
-------------------------------------------------------------------------------- -- MIT License -- -- Copyright (c) 2020 Zane Myers -- -- 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 Vulkan.Math.GenIType; with Vulkan.Math.GenUType; -- Uses use Vulkan.Math.GenUType; use Vulkan.Math.GenIType; -------------------------------------------------------------------------------- --< @group Vulkan Math Functions -------------------------------------------------------------------------------- --< @summary --< This package provides GLSL Integer Built-in functions. --< --< @description --< All common functions operate component-wise. -------------------------------------------------------------------------------- package Vulkan.Math.Integers is pragma Preelaborate; pragma Pure; ---------------------------------------------------------------------------- --< @summary --< Adds two unsigned integers modulo 32, returning the result and a carry. --< --< @description --< Adds two unsigned integers modulo 32. If the result is greater than or --< equal 2^32 the carry is 1. Otherwise the carry is 0. --< --< @param x --< One of the addition operands. --< --< @param y --< One of the addition operands. --< --< @param carry --< The carry value from the addition operation. --< --< @return --< The result of x + y modulo 32. ---------------------------------------------------------------------------- function Unsigned_Add_Carry(x, y : in Vkm_Uint; carry : out Vkm_Uint) return Vkm_Uint; ---------------------------------------------------------------------------- --< @summary --< Adds two unsigned integers modulo 32, returning the result and a carry. --< --< @description --< Applies Unsigned_Add_Carry() component-wise on three Vkm_GenUType vectors, --< returning the result of addition as a Vkm_GenUType vector. ---------------------------------------------------------------------------- function Unsigned_Add_Carry is new GUT.Apply_Func_IV_IV_OV_RV(Unsigned_Add_Carry); ---------------------------------------------------------------------------- --< @summary --< Subtracts two unsigned integers modulo 32, returning the result and a borrow. --< --< @description --< Subtracts two unsigned integers modulo 32. If x is less than y, the result --< is 2^32 plus the difference and a borrow of 1; Otherwise, the result is --< the difference and a borrow of 0. --< --< @param x --< The left subtraction operand. --< --< @param y --< The right subtraction operand. --< --< @param borrow --< The borrow value from the subtraction operation. --< --< @return --< The result of x - y modulo 32. ---------------------------------------------------------------------------- function Unsigned_Sub_Borrow(x, y : in Vkm_Uint; borrow : out Vkm_Uint) return Vkm_Uint; ---------------------------------------------------------------------------- --< @summary --< Subtracts two unsigned integers modulo 32, returning the result and a borrow. --< --< @description --< Applies Unsigned_Sub_Borrow() component-wise on three Vkm_GenUType vectors, --< returning the result of addition as a Vkm_GenUType vector. ---------------------------------------------------------------------------- function Unsigned_Sub_Borrow is new GUT.Apply_Func_IV_IV_OV_RV(Unsigned_Sub_Borrow); ---------------------------------------------------------------------------- --< @summary --< This operation performs extended multiplication of two 32-bit unsigned --< integers. --< --< @description --< Multiplies two 32-bit unsigned integers returning two 32-bit unsigned --< integers representing the most significant and least significant 32 bits --< of the result of multiplication. --< --< @param x --< The left subtraction operand. --< --< @param y --< The right subtraction operand. --< --< @param msb --< The 32 most significant bits of the resulting 64-bit unsigned integer. --< --< @param lsb --< The 32 least significant bits of the resulting 64-bit unsigned integer. ---------------------------------------------------------------------------- procedure Unsigned_Mul_Extended(x, y : in Vkm_Uint; msb, lsb : out Vkm_Uint); ---------------------------------------------------------------------------- --< @summary --< This operation performs extended multiplication of two Vkm_GenUType vectors. --< --< @description --< Applies Unsigned_Mul_Extended() component-wise on two input Vkm_GenUType --< vectors and two output Vkm_GenUType vectors. ---------------------------------------------------------------------------- procedure Unsigned_Mul_Extended is new GUT.Apply_Func_IV_IV_OV_OV(Unsigned_Mul_Extended); ---------------------------------------------------------------------------- --< @summary --< This operation performs extended multiplication of two 32-bit signed --< integers. --< --< @description --< Multiplies two 32-bit signed integers returning two 32-bit signed --< integers representing the most significant and least significant 32 bits --< of the result of multiplication. --< --< @param x --< The left subtraction operand. --< --< @param y --< The right subtraction operand. --< --< @param msb --< The 32 most significant bits of the resulting 64-bit signed integer. --< --< @param lsb --< The 32 least significant bits of the resulting 64-bit signed integer. ---------------------------------------------------------------------------- procedure Signed_Mul_Extended(x, y : in Vkm_Int; msb, lsb : out Vkm_Int); ---------------------------------------------------------------------------- --< @summary --< This operation performs extended multiplication of two 32-bit signed --< integers. --< --< @description --< Applies Unsigned_Mul_Extended() component-wise on two input Vkm_GenIType --< vectors and two output Vkm_GenIType vectors. ---------------------------------------------------------------------------- procedure Signed_Mul_Extended is new GIT.Apply_Func_IV_IV_OV_OV(Signed_Mul_Extended); ---------------------------------------------------------------------------- --< @summary --< This operation extracts a bitfield from a 32-bit signed integer. --< --< @description --< Extract bits starting from offset to the number of bits in the bitfield. --< --< Let bN = bits + offset -1. --< Let b0 = offset. --< --< In general, the bitfield is extracted from the value the value as follows: --< --< \ | MSB | Bitfield | LSB | --< bits | 31 ... bN+1 | bN bN-1 ... b1 b0 | b0-1 ... 0 | --< --< The result is formatted as follows, where N = bits -1: --< --< \ | MSB | Bitfield | --< bit | 31 ... N+1 | N N-1 ... 1 0 | --< value | bN'Val ... bN'Val | bN'Val (bN-1)'Val ... b1'Val b0'Val | --< --< @param value --< The value from which the bitfield is extracted. --< --< @param offset --< The offset into the value from which the bitfield is extracted. --< --< @param bits --< The number of bits in the bitfield. --< --< @return --< The extracted value from the bitfield. The most significant bits are set --< to the signed bit of the bitfield. ---------------------------------------------------------------------------- function Bitfield_Extract(value, offset, bits : in Vkm_Int) return Vkm_Int; ---------------------------------------------------------------------------- --< @summary --< This operation extracts a bitfield vector from a Vkm_GenIType vector. --< --< @description --< Applies Bitfield_Extract() component-wise on an input Vkm_GenIType --< vector and two Vkm_Int scalars, returning a Vkm_GenIType vector of the --< extracted bitfields. ---------------------------------------------------------------------------- function Bitfield_Extract is new GIT.Apply_Func_IV_IS_IS_RV(Bitfield_Extract); ---------------------------------------------------------------------------- --< @summary --< This operation extracts a bitfield from a 32-bit unsigned integer. --< --< @description --< Extract bits starting from offset to the number of bits in the bitfield. --< --< Let bN = bits + offset -1. --< Let b0 = offset. --< --< In general, the bitfield is extracted from the value the value as follows: --< --< \ | MSB | Bitfield | LSB | --< bits | 31 ... bN+1 | bN bN-1 ... b1 b0 | b0-1 ... 0 | --< --< The result is formatted as follows, where N = bits -1: --< --< \ | MSB | Bitfield | --< bit | 31 ... N+1 | N N-1 ... 1 0 | --< value | 0 ... 0 | bN'Val (bN-1)'Val ... b1'Val b0'Val | --< --< @param value --< The value from which the bitfield is extracted. --< --< @param offset --< The offset into the value from which the bitfield is extracted. --< --< @param bits --< The number of bits in the bitfield. --< --< @return --< The extracted value from the bitfield. The most significant bits are set --< to 0. ---------------------------------------------------------------------------- function Bitfield_Extract(value : in Vkm_Uint; offset, bits : in Vkm_Int) return Vkm_Uint; ---------------------------------------------------------------------------- --< @summary --< This operation extracts a bitfield vector from a Vkm_GenUType vector. --< --< @description --< Applies Bitfield_Extract() component-wise on an input Vkm_GenUType --< vector and two Vkm_Int scalars, returning a Vkm_GenUType vector of the --< extracted bitfields. ---------------------------------------------------------------------------- function Bitfield_Extract is new Apply_Func_IVU_ISI_ISI_RVU(Bitfield_Extract); ---------------------------------------------------------------------------- --< @summary --< This operation inserts a bitfield into a 32-bit signed integer. --< --< @description --< Insert bits starting from offset to the number of bits in the bitfield. --< --< Let bN = bits + offset -1. --< Let b0 = offset. --< --< In general, the 'bits' least significant bits of 'insert' are copied into --< base as follows: --< --< \ | MSB | Bitfield | LSB | --< bits | 31 ... bN+1 | bN bN-1 ... b1 b0 | b0-1 ... 0 | --< value | base | insert | base | --< --< @param base --< The value into which the bitfield is inserted. --< --< @param insert --< The value that is inserted into base. --< --< @param offset --< The offset into the base at which the bitfield is inserted. --< --< @param bits --< The number of bits in the bitfield. --< --< @return --< The value of base with the bitfield inserted. ---------------------------------------------------------------------------- function Bitfield_Insert(base, insert, offset, bits : in Vkm_Int) return Vkm_Int; ---------------------------------------------------------------------------- --< @summary --< This operation inserts a bitfield vector into a Vkm_GenIType vector. --< --< @description --< Applies Bitfield_Insert() component-wise on two input Vkm_GenIType --< vectors and two Vkm_Int scalars, returning a Vkm_GenIType vector of the --< base vector with inserted bitfields. ---------------------------------------------------------------------------- function Bitfield_Insert is new GIT.Apply_Func_IV_IV_IS_IS_RV(Bitfield_Insert); ---------------------------------------------------------------------------- --< @summary --< This operation inserts a bitfield into a 32-bit unsigned integer. --< --< @description --< Insert bits starting from offset to the number of bits in the bitfield. --< --< Let bN = bits + offset -1. --< Let b0 = offset. --< --< In general, the 'bits' least significant bits of 'insert' are copied into --< base as follows: --< --< \ | MSB | Bitfield | LSB | --< bits | 31 ... bN+1 | bN bN-1 ... b1 b0 | b0-1 ... 0 | --< value | base | insert | base | --< --< @param base --< The value into which the bitfield is inserted. --< --< @param insert --< The value that is inserted into base. --< --< @param offset --< The offset into the base at which the bitfield is inserted. --< --< @param bits --< The number of bits in the bitfield. --< --< @return --< The value of base with the bitfield inserted. ---------------------------------------------------------------------------- function Bitfield_Insert(base, insert : in Vkm_Uint; offset, bits : in Vkm_Int) return Vkm_Uint; ---------------------------------------------------------------------------- --< @summary --< This operation inserts a bitfield vector into a Vkm_GenUType vector. --< --< @description --< Applies Bitfield_Insert() component-wise on two input Vkm_GenUType --< vectors and two Vkm_Int scalars, returning a Vkm_GenUType vector of the --< base vector with inserted bitfields. ---------------------------------------------------------------------------- function Bitfield_Insert is new Apply_Func_IVU_IVU_ISI_ISI_RVU(Bitfield_Insert); ---------------------------------------------------------------------------- --< @summary --< This operation reverses the bits of a 32-bit signed integer. --< --< @description --< Reverse the bits of a 32-bit signed integer. --< --< Let vI be the value of bit at bit position I in the input value. --< --< bit | 31 30 ... 1 0 | --< input | v31 v30 ... v1 v0 | --< output | v0 v1 ... v30 v31 | --< --< @param value --< The value which is to be reversed. --< --< @return --< The reversed value. ---------------------------------------------------------------------------- function Bitfield_Reverse(value : in Vkm_Int) return Vkm_Int; ---------------------------------------------------------------------------- --< @summary --< This operation reverses the binary representation of the components of a --< Vkm_GenIType vector. --< --< @description --< Applies Bitfield_Reverse() component-wise on input Vkm_GenIType, --< returning a Vkm_GenIType vector of the reversed components. ---------------------------------------------------------------------------- function Bitfield_Reverse is new GIT.Apply_Func_IV_RV(Bitfield_Reverse); ---------------------------------------------------------------------------- --< @summary --< This operation reverses the bits of a 32-bit unsigned integer. --< --< @description --< Reverse the bits of a 32-bit unsigned integer. --< --< Let vI be the value of bit at bit position I in the input value. --< --< bit | 31 30 ... 1 0 | --< input | v31 v30 ... v1 v0 | --< output | v0 v1 ... v30 v31 | --< --< @param value --< The value which is to be reversed. --< --< @return --< The reversed value. ---------------------------------------------------------------------------- function Bitfield_Reverse(value : in Vkm_Uint) return Vkm_Uint; ---------------------------------------------------------------------------- --< @summary --< This operation reverses the binary representation of the components of a --< Vkm_GenUType vector. --< --< @description --< Applies Bitfield_Reverse() component-wise on input Vkm_GenUType, --< returning a Vkm_GenUType vector of the reversed components. ---------------------------------------------------------------------------- function Bitfield_Reverse is new GUT.Apply_Func_IV_RV(Bitfield_Reverse); ---------------------------------------------------------------------------- --< @summary --< This operation counts the number of 1-bits in a 32-bit signed value. --< --< @description --< Count the 1's bits of a 32-bit signed integer. --< --< @param value --< The value for which 1's bits are counted. --< --< @return --< The number of 1's in value. ---------------------------------------------------------------------------- function Bit_Count(value : in Vkm_Int) return Vkm_Int; ---------------------------------------------------------------------------- --< @summary --< This operation counts the number of 1-bits for each component of a --< Vkm_GenIType vector. --< --< @description --< Applies Bit_Count() component-wise on input Vkm_GenIType, --< returning a Vkm_GenIType vector of counts for each component. ---------------------------------------------------------------------------- function Bit_Count is new GIT.Apply_Func_IV_RV(Bit_Count); ---------------------------------------------------------------------------- --< @summary --< This operation counts the number of 1-bits in a 32-bit unsigned value. --< --< @description --< Count the 1's bits of a 32-bit unsigned integer. --< --< @param value --< The value for which 1's bits are counted. --< --< @return --< The number of 1's in value. ---------------------------------------------------------------------------- function Bit_Count(value : in Vkm_Uint) return Vkm_Int; ---------------------------------------------------------------------------- --< @summary --< This operation counts the number of 1-bits for each component of a --< Vkm_GenUType vector. --< --< @description --< Applies Bit_Count() component-wise on input Vkm_GenUType, --< returning a Vkm_GenIType vector of counts for each component. ---------------------------------------------------------------------------- function Bit_Count is new Apply_Func_IVU_RVI(Bit_Count); ---------------------------------------------------------------------------- --< @summary --< This operation finds the least significant 1-bit in the 32-bit signed --< integer. --< --< @description --< Find the least significant bit in a 32-bit signed integer with a value of 1. --< --< @param value --< The value to find the least significant 1-bit for. --< --< @return --< The bit position of the least significant 1-bit. -1 is returned if there --< are no 1-bits. ---------------------------------------------------------------------------- function Find_Lsb(value : in Vkm_Int) return Vkm_Int; ---------------------------------------------------------------------------- --< @summary --< This operation finds the least significant 1-bit for each component of a --< Vkm_GenIType vector. --< --< @description --< Applies Find_Lsb() component-wise on input Vkm_GenIType, returning a --< Vkm_GenIType vector of the bit positions for the least significant 1-bit --< in each component. ---------------------------------------------------------------------------- function Find_Lsb is new GIT.Apply_Func_IV_RV(Find_Lsb); ---------------------------------------------------------------------------- --< @summary --< This operation finds the least significant 1-bit in the 32-bit unsigned --< integer. --< --< @description --< Find the least significant bit in a 32-bit unsigned integer with a value of 1. --< --< @param value --< The value to find the least significant 1-bit for. --< --< @return --< The bit position of the least significant 1-bit. -1 is returned if there --< are no 1-bits. ---------------------------------------------------------------------------- function Find_Lsb(value : in Vkm_Uint) return Vkm_Int; ---------------------------------------------------------------------------- --< @summary --< This operation finds the least significant 1-bit for each component of a --< Vkm_GenUType vector. --< --< @description --< Applies Find_Lsb() component-wise on input Vkm_GenUType, returning a --< Vkm_GenIType vector of the bit positions for the least significant 1-bit --< in each component. ---------------------------------------------------------------------------- function Find_Lsb is new Apply_Func_IVU_RVI(Find_Lsb); ---------------------------------------------------------------------------- --< @summary --< This operation finds the most significant 0-bit in the 32-bit signed --< integer. --< --< @description --< Find the most significant bit in a 32-bit signed integer with a value of 0. --< --< @param value --< The value to find the most significant 0-bit for. --< --< @return --< The bit position of the most significant 0-bit. -1 is returned if there --< are no 0-bits. ---------------------------------------------------------------------------- function Find_Msb(value : in Vkm_Int) return Vkm_Int; ---------------------------------------------------------------------------- --< @summary --< This operation finds the most significant 0-bit for each component of a --< Vkm_GenIType vector. --< --< @description --< Applies Find_Msb() component-wise on input Vkm_GenIType, returning a --< Vkm_GenIType vector of the bit positions for the most significant 0-bit --< in each component. ---------------------------------------------------------------------------- function Find_Msb is new GIT.Apply_Func_IV_RV(Find_Msb); ---------------------------------------------------------------------------- --< @summary --< This operation finds the most significant 1-bit in the 32-bit unsigned --< integer. --< --< @description --< Find the most significant bit in a 32-bit unsigned integer with a value of 1. --< --< @param value --< The value to find the most significant 1-bit for. --< --< @return --< The bit position of the most significant 1-bit. -1 is returned if there --< are no 1-bits. ---------------------------------------------------------------------------- function Find_Msb(value : in Vkm_Uint) return Vkm_Int; ---------------------------------------------------------------------------- --< @summary --< This operation finds the most significant 1-bit for each component of a --< Vkm_GenUType vector. --< --< @description --< Applies Find_Msb() component-wise on input Vkm_GenUType, returning a --< Vkm_GenIType vector of the bit positions for the most significant 0-bit --< in each component. ---------------------------------------------------------------------------- function Find_Msb is new Apply_Func_IVU_RVI(Find_Msb); end Vulkan.Math.Integers;
39.812303
93
0.475298
c7c76c45e5b5bcbb86f6a6a5844f0f008747bdae
2,315
ads
Ada
tests/lsc_internal_test_aes.ads
Componolit/libsparkcrypto
8531a07b6e9f5eb33eae0fa32759b4cbd3509d95
[ "OpenSSL", "Unlicense" ]
30
2018-05-18T09:11:50.000Z
2021-05-18T16:29:14.000Z
tests/lsc_internal_test_aes.ads
Componolit/libsparkcrypto
8531a07b6e9f5eb33eae0fa32759b4cbd3509d95
[ "OpenSSL", "Unlicense" ]
15
2018-12-13T07:53:36.000Z
2019-09-24T19:43:35.000Z
tests/lsc_internal_test_aes.ads
Componolit/libsparkcrypto
8531a07b6e9f5eb33eae0fa32759b4cbd3509d95
[ "OpenSSL", "Unlicense" ]
3
2019-04-04T17:41:29.000Z
2021-05-07T22:28:46.000Z
------------------------------------------------------------------------------- -- This file is part of libsparkcrypto. -- -- @author Alexander Senier -- @date 2019-01-09 -- -- Copyright (C) 2018 Componolit GmbH -- All rights reserved. -- -- Redistribution and use in source and binary forms, with or without -- modification, are permitted provided that the following conditions are met: -- -- * Redistributions of source code must retain the above copyright notice, -- this list of conditions and the following disclaimer. -- -- * Redistributions in binary form must reproduce the above copyright -- notice, this list of conditions and the following disclaimer in the -- documentation and/or other materials provided with the distribution. -- -- * Neither the name of the nor the names of its contributors may be used -- to endorse or promote products derived from this software without -- specific prior written permission. -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" -- AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE -- IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE -- ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS -- BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR -- CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF -- SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS -- INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN -- CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) -- ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE -- POSSIBILITY OF SUCH DAMAGE. ------------------------------------------------------------------------------- with AUnit; use AUnit; with AUnit.Test_Cases; use AUnit.Test_Cases; -- @summary Tests AES package LSC_Internal_Test_AES is type Test_Case is new Test_Cases.Test_Case with null record; procedure Register_Tests (T : in out Test_Case); -- Register routines to be run function Name (T : Test_Case) return Message_String; -- Provide name identifying the test case end LSC_Internal_Test_AES;
44.519231
80
0.678186
ad1d7fa18f537ae4d95599181e25648499b5566b
1,502
ads
Ada
Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/sequenio.ads
djamal2727/Main-Bearing-Analytical-Model
2f00c2219c71be0175c6f4f8f1d4cca231d97096
[ "Apache-2.0" ]
null
null
null
Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/sequenio.ads
djamal2727/Main-Bearing-Analytical-Model
2f00c2219c71be0175c6f4f8f1d4cca231d97096
[ "Apache-2.0" ]
null
null
null
Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/sequenio.ads
djamal2727/Main-Bearing-Analytical-Model
2f00c2219c71be0175c6f4f8f1d4cca231d97096
[ "Apache-2.0" ]
null
null
null
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S E Q U E N T I A L _ I O -- -- -- -- S p e c -- -- -- -- This specification is derived from the Ada Reference Manual for use with -- -- GNAT. In accordance with the copyright of that document, you can freely -- -- copy and modify this specification, provided that if you redistribute a -- -- modified version, any changes that you have made are clearly indicated. -- -- -- ------------------------------------------------------------------------------ pragma Ada_2012; -- Explicit setting of Ada 2012 mode is required here, since we want to with a -- child unit (not possible in Ada 83 mode), and Sequential_IO is not -- considered to be an internal unit that is automatically compiled in Ada -- 2012 mode (since a user is allowed to redeclare Sequential_IO). with Ada.Sequential_IO; generic package Sequential_IO renames Ada.Sequential_IO;
60.08
79
0.388149
04b44b3083f785601dae436a543523d8d50e2762
11,580
adb
Ada
bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-suewst.adb
JCGobbi/Nucleo-STM32F334R8
2a0b1b4b2664c92773703ac5e95dcb71979d051c
[ "BSD-3-Clause" ]
null
null
null
bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-suewst.adb
JCGobbi/Nucleo-STM32F334R8
2a0b1b4b2664c92773703ac5e95dcb71979d051c
[ "BSD-3-Clause" ]
null
null
null
bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-suewst.adb
JCGobbi/Nucleo-STM32F334R8
2a0b1b4b2664c92773703ac5e95dcb71979d051c
[ "BSD-3-Clause" ]
null
null
null
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- ADA.STRINGS.UTF_ENCODING.WIDE_STRINGS -- -- -- -- B o d y -- -- -- -- Copyright (C) 2010-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. -- -- -- ------------------------------------------------------------------------------ package body Ada.Strings.UTF_Encoding.Wide_Strings is use Interfaces; ------------ -- Decode -- ------------ -- Decode UTF-8/UTF-16BE/UTF-16LE input to Wide_String function Decode (Item : UTF_String; Input_Scheme : Encoding_Scheme) return Wide_String is begin if Input_Scheme = UTF_8 then return Decode (Item); else return Decode (To_UTF_16 (Item, Input_Scheme)); end if; end Decode; -- Decode UTF-8 input to Wide_String function Decode (Item : UTF_8_String) return Wide_String is Result : Wide_String (1 .. Item'Length); -- Result string (worst case is same length as input) Len : Natural := 0; -- Length of result stored so far Iptr : Natural; -- Input Item pointer C : Unsigned_8; R : Unsigned_16; procedure Get_Continuation; -- Reads a continuation byte of the form 10xxxxxx, shifts R left by 6 -- bits, and or's in the xxxxxx to the low order 6 bits. On return Ptr -- is incremented. Raises exception if continuation byte does not exist -- or is invalid. ---------------------- -- Get_Continuation -- ---------------------- procedure Get_Continuation is begin if Iptr > Item'Last then Raise_Encoding_Error (Iptr - 1); else C := To_Unsigned_8 (Item (Iptr)); Iptr := Iptr + 1; if C not in 2#10_000000# .. 2#10_111111# then Raise_Encoding_Error (Iptr - 1); else R := Shift_Left (R, 6) or Unsigned_16 (C and 2#00_111111#); end if; end if; end Get_Continuation; -- Start of processing for Decode begin Iptr := Item'First; -- Skip BOM at start if Item'Length >= 3 and then Item (Iptr .. Iptr + 2) = BOM_8 then Iptr := Iptr + 3; -- Error if bad BOM elsif Item'Length >= 2 and then (Item (Iptr .. Iptr + 1) = BOM_16BE or else Item (Iptr .. Iptr + 1) = BOM_16LE) then Raise_Encoding_Error (Iptr); end if; while Iptr <= Item'Last loop C := To_Unsigned_8 (Item (Iptr)); Iptr := Iptr + 1; -- Codes in the range 16#00# - 16#7F# are represented as -- 0xxxxxxx if C <= 16#7F# then R := Unsigned_16 (C); -- No initial code can be of the form 10xxxxxx. Such codes are used -- only for continuations. elsif C <= 2#10_111111# then Raise_Encoding_Error (Iptr - 1); -- Codes in the range 16#80# - 16#7FF# are represented as -- 110yyyxx 10xxxxxx elsif C <= 2#110_11111# then R := Unsigned_16 (C and 2#000_11111#); Get_Continuation; -- Codes in the range 16#800# - 16#FFFF# are represented as -- 1110yyyy 10yyyyxx 10xxxxxx elsif C <= 2#1110_1111# then R := Unsigned_16 (C and 2#0000_1111#); Get_Continuation; Get_Continuation; -- Codes in the range 16#10000# - 16#10FFFF# are represented as -- 11110zzz 10zzyyyy 10yyyyxx 10xxxxxx -- Such codes are out of range for Wide_String output else Raise_Encoding_Error (Iptr - 1); end if; Len := Len + 1; Result (Len) := Wide_Character'Val (R); end loop; return Result (1 .. Len); end Decode; -- Decode UTF-16 input to Wide_String function Decode (Item : UTF_16_Wide_String) return Wide_String is Result : Wide_String (1 .. Item'Length); -- Result is same length as input (possibly minus 1 if BOM present) Len : Natural := 0; -- Length of result Iptr : Natural; -- Index of next Item element C : Unsigned_16; begin -- Skip UTF-16 BOM at start Iptr := Item'First; if Item'Length > 0 and then Item (Iptr) = BOM_16 (1) then Iptr := Iptr + 1; end if; -- Loop through input characters while Iptr <= Item'Last loop C := To_Unsigned_16 (Item (Iptr)); Iptr := Iptr + 1; -- Codes in the range 16#0000#..16#D7FF# or 16#E000#..16#FFFD# -- represent their own value. if C <= 16#D7FF# or else C in 16#E000# .. 16#FFFD# then Len := Len + 1; Result (Len) := Wide_Character'Val (C); -- Codes in the range 16#D800#..16#DBFF# represent the first of the -- two surrogates used to encode the range 16#01_000#..16#10_FFFF". -- Such codes are out of range for 16-bit output. -- The case of input in the range 16#DC00#..16#DFFF# must never -- occur, since it means we have a second surrogate character with -- no corresponding first surrogate. -- Codes in the range 16#FFFE# .. 16#FFFF# are also invalid since -- they conflict with codes used for BOM values. -- Thus all remaining codes are invalid else Raise_Encoding_Error (Iptr - 1); end if; end loop; return Result (1 .. Len); end Decode; ------------ -- Encode -- ------------ -- Encode Wide_String in UTF-8, UTF-16BE or UTF-16LE function Encode (Item : Wide_String; Output_Scheme : Encoding_Scheme; Output_BOM : Boolean := False) return UTF_String is begin -- Case of UTF_8 if Output_Scheme = UTF_8 then return Encode (Item, Output_BOM); -- Case of UTF_16LE or UTF_16BE, use UTF-16 intermediary else return From_UTF_16 (UTF_16_Wide_String'(Encode (Item)), Output_Scheme, Output_BOM); end if; end Encode; -- Encode Wide_String in UTF-8 function Encode (Item : Wide_String; Output_BOM : Boolean := False) return UTF_8_String is Result : UTF_8_String (1 .. 3 * Item'Length + 3); -- Worst case is three bytes per input byte + space for BOM Len : Natural; -- Number of output codes stored in Result C : Unsigned_16; -- Single input character procedure Store (C : Unsigned_16); pragma Inline (Store); -- Store one output code, C is in the range 0 .. 255 ----------- -- Store -- ----------- procedure Store (C : Unsigned_16) is begin Len := Len + 1; Result (Len) := Character'Val (C); end Store; -- Start of processing for UTF8_Encode begin -- Output BOM if required if Output_BOM then Result (1 .. 3) := BOM_8; Len := 3; else Len := 0; end if; -- Loop through characters of input for J in Item'Range loop C := To_Unsigned_16 (Item (J)); -- Codes in the range 16#00# - 16#7F# are represented as -- 0xxxxxxx if C <= 16#7F# then Store (C); -- Codes in the range 16#80# - 16#7FF# are represented as -- 110yyyxx 10xxxxxx elsif C <= 16#7FF# then Store (2#110_00000# or Shift_Right (C, 6)); Store (2#10_000000# or (C and 2#00_111111#)); -- Codes in the range 16#800# - 16#FFFF# are represented as -- 1110yyyy 10yyyyxx 10xxxxxx else Store (2#1110_0000# or Shift_Right (C, 12)); Store (2#10_000000# or Shift_Right (C and 2#111111_000000#, 6)); Store (2#10_000000# or (C and 2#00_111111#)); end if; end loop; return Result (1 .. Len); end Encode; -- Encode Wide_String in UTF-16 function Encode (Item : Wide_String; Output_BOM : Boolean := False) return UTF_16_Wide_String is Result : UTF_16_Wide_String (1 .. Item'Length + Boolean'Pos (Output_BOM)); -- Output is same length as input + possible BOM Len : Integer; -- Length of output string C : Unsigned_16; begin -- Output BOM if required if Output_BOM then Result (1) := BOM_16 (1); Len := 1; else Len := 0; end if; -- Loop through input characters encoding them for Iptr in Item'Range loop C := To_Unsigned_16 (Item (Iptr)); -- Codes in the range 16#0000#..16#D7FF# or 16#E000#..16#FFFD# are -- output unchanged. if C <= 16#D7FF# or else C in 16#E000# .. 16#FFFD# then Len := Len + 1; Result (Len) := Wide_Character'Val (C); -- Codes in the range 16#D800#..16#DFFF# should never appear in the -- input, since no valid Unicode characters are in this range (which -- would conflict with the UTF-16 surrogate encodings). Similarly -- codes in the range 16#FFFE#..16#FFFF conflict with BOM codes. -- Thus all remaining codes are illegal. else Raise_Encoding_Error (Iptr); end if; end loop; return Result; end Encode; end Ada.Strings.UTF_Encoding.Wide_Strings;
31.212938
78
0.497841
042a789588541b8eadcd94d5b80f7e936b8ffe3b
2,134
ads
Ada
source/resolver/program-resolvers-basic.ads
reznikmm/gela
20134f1d154fb763812e73860c6f4b04f353df79
[ "MIT" ]
null
null
null
source/resolver/program-resolvers-basic.ads
reznikmm/gela
20134f1d154fb763812e73860c6f4b04f353df79
[ "MIT" ]
null
null
null
source/resolver/program-resolvers-basic.ads
reznikmm/gela
20134f1d154fb763812e73860c6f4b04f353df79
[ "MIT" ]
1
2019-10-16T09:05:27.000Z
2019-10-16T09:05:27.000Z
-- SPDX-FileCopyrightText: 2019-2021 Max Reznik <[email protected]> -- -- SPDX-License-Identifier: MIT ------------------------------------------------------------- -- -- Common type for Standard and full resolver with Program.Element_Visitors; with Program.Elements.Defining_Names; with Program.Elements.Definitions; with Program.Elements.Enumeration_Types; with Program.Elements.Exception_Declarations; with Program.Elements.Floating_Point_Types; with Program.Elements.Subtype_Declarations; with Program.Elements.Type_Declarations; with Program.Visibility; with Program.Cross_Reference_Updaters; package Program.Resolvers.Basic is pragma Preelaborate; type Visitor (Env : not null Program.Visibility.Context_Access; Setter : not null Program.Cross_Reference_Updaters.Cross_Reference_Updater_Access) is new Program.Element_Visitors.Element_Visitor with record Discriminants : Program.Elements.Definitions.Definition_Access; Type_Name : Program.Elements.Defining_Names.Defining_Name_Access; Type_View : Program.Visibility.View; end record; procedure Visit_Each_Child (Self : in out Visitor; Element : access Program.Elements.Element'Class); overriding procedure Enumeration_Type (Self : in out Visitor; Element : not null Program.Elements.Enumeration_Types .Enumeration_Type_Access); overriding procedure Exception_Declaration (Self : in out Visitor; Element : not null Program.Elements.Exception_Declarations .Exception_Declaration_Access); overriding procedure Floating_Point_Type (Self : in out Visitor; Element : not null Program.Elements.Floating_Point_Types .Floating_Point_Type_Access); overriding procedure Subtype_Declaration (Self : in out Visitor; Element : not null Program.Elements.Subtype_Declarations .Subtype_Declaration_Access); overriding procedure Type_Declaration (Self : in out Visitor; Element : not null Program.Elements.Type_Declarations .Type_Declaration_Access); end Program.Resolvers.Basic;
34.419355
75
0.735239
2eaa4271d1eca2fff4ca11f550b407e73af9f47c
2,704
ads
Ada
support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-widcha.ads
orb-zhuchen/Orb
6da2404b949ac28bde786e08bf4debe4a27cd3a0
[ "CNRI-Python-GPL-Compatible", "MIT" ]
null
null
null
support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-widcha.ads
orb-zhuchen/Orb
6da2404b949ac28bde786e08bf4debe4a27cd3a0
[ "CNRI-Python-GPL-Compatible", "MIT" ]
null
null
null
support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-widcha.ads
orb-zhuchen/Orb
6da2404b949ac28bde786e08bf4debe4a27cd3a0
[ "CNRI-Python-GPL-Compatible", "MIT" ]
null
null
null
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- S Y S T E M . W I D _ C H A R -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2019, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package contains the routine used for Character'Width package System.Wid_Char is pragma Pure; function Width_Character (Lo, Hi : Character) return Natural; -- Compute Width attribute for non-static type derived from Character. -- The arguments are the low and high bounds for the type. end System.Wid_Char;
64.380952
78
0.412352
131d59db4584be18e07c1ac0cce49d36f0986138
12,606
adb
Ada
src/lang/stemmer-danish.adb
stcarrez/ada-stemmer
08f540a33d471a9823d8f1a88ce2a2c4d40faaec
[ "Apache-2.0" ]
3
2020-05-11T21:21:17.000Z
2020-05-17T02:16:08.000Z
src/lang/stemmer-danish.adb
stcarrez/ada-stemmer
08f540a33d471a9823d8f1a88ce2a2c4d40faaec
[ "Apache-2.0" ]
null
null
null
src/lang/stemmer-danish.adb
stcarrez/ada-stemmer
08f540a33d471a9823d8f1a88ce2a2c4d40faaec
[ "Apache-2.0" ]
null
null
null
-- Generated by Snowball 2.2.0 - https://snowballstem.org/ package body Stemmer.Danish is pragma Style_Checks ("-mr"); pragma Warnings (Off, "*variable*is never read and never assigned*"); pragma Warnings (Off, "*mode could be*instead of*"); pragma Warnings (Off, "*formal parameter.*is not modified*"); pragma Warnings (Off, "*this line is too long*"); pragma Warnings (Off, "*is not referenced*"); procedure R_Undouble (Z : in out Context_Type; Result : out Boolean); procedure R_Other_suffix (Z : in out Context_Type; Result : out Boolean); procedure R_Consonant_pair (Z : in out Context_Type; Result : out Boolean); procedure R_Main_suffix (Z : in out Context_Type; Result : out Boolean); procedure R_Mark_regions (Z : in out Context_Type; Result : out Boolean); G_C : constant Grouping_Array (0 .. 31) := ( True, True, True, False, True, True, True, False, True, True, True, True, True, False, True, True, True, True, True, False, True, True, True, False, True, False, False, False, False, False, False, False ); G_V : constant Grouping_Array (0 .. 151) := ( True, False, False, False, True, False, False, False, True, False, False, False, False, False, True, False, False, False, False, False, True, False, False, False, True, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, True, True, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, True ); G_S_ending : constant Grouping_Array (0 .. 135) := ( True, True, True, True, False, True, True, True, False, True, True, True, True, True, True, True, False, True, False, True, False, True, False, False, True, True, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, False, True, False, False, False ); Among_String : constant String := "hed" & "ethed" & "ered" & "e" & "erede" & "ende" & "erende" & "ene" & "erne" & "ere" & "en" & "heden" & "eren" & "er" & "heder" & "erer" & "s" & "heds" & "es" & "endes" & "erendes" & "enes" & "ernes" & "eres" & "ens" & "hedens" & "erens" & "ers" & "ets" & "erets" & "et" & "eret" & "gd" & "dt" & "gt" & "kt" & "ig" & "lig" & "elig" & "els" & "løst"; A_0 : constant Among_Array_Type (0 .. 31) := ( (1, 3, -1, 1, 0), (4, 8, 0, 1, 0), (9, 12, -1, 1, 0), (13, 13, -1, 1, 0), (14, 18, 3, 1, 0), (19, 22, 3, 1, 0), (23, 28, 5, 1, 0), (29, 31, 3, 1, 0), (32, 35, 3, 1, 0), (36, 38, 3, 1, 0), (39, 40, -1, 1, 0), (41, 45, 10, 1, 0), (46, 49, 10, 1, 0), (50, 51, -1, 1, 0), (52, 56, 13, 1, 0), (57, 60, 13, 1, 0), (61, 61, -1, 2, 0), (62, 65, 16, 1, 0), (66, 67, 16, 1, 0), (68, 72, 18, 1, 0), (73, 79, 19, 1, 0), (80, 83, 18, 1, 0), (84, 88, 18, 1, 0), (89, 92, 18, 1, 0), (93, 95, 16, 1, 0), (96, 101, 24, 1, 0), (102, 106, 24, 1, 0), (107, 109, 16, 1, 0), (110, 112, 16, 1, 0), (113, 117, 28, 1, 0), (118, 119, -1, 1, 0), (120, 123, 30, 1, 0)); A_1 : constant Among_Array_Type (0 .. 3) := ( (124, 125, -1, -1, 0), (126, 127, -1, -1, 0), (128, 129, -1, -1, 0), (130, 131, -1, -1, 0)); A_2 : constant Among_Array_Type (0 .. 4) := ( (132, 133, -1, 1, 0), (134, 136, 0, 1, 0), (137, 140, 1, 1, 0), (141, 143, -1, 1, 0), (144, 148, -1, 2, 0)); procedure R_Mark_regions (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; v_1 : Char_Index; begin -- (, line 31 Z.I_P1 := Z.L; -- test, line 35 v_1 := Z.C; -- (, line 35 C := Skip_Utf8 (Z, 3); -- hop, line 35 if C < 0 then Result := False; return; end if; Z.C := C; -- setmark x, line 35 Z.I_X := Z.C; Z.C := v_1; -- goto, line 36 Out_Grouping (Z, G_V, 97, 248, True, C); if C < 0 then Result := False; return; end if; -- gopast, line 36 -- non v, line 36 In_Grouping (Z, G_V, 97, 248, True, C); if C < 0 then Result := False; return; end if; Z.C := Z.C + C; -- setmark p1, line 36 Z.I_P1 := Z.C; -- try, line 37 -- (, line 37 if not (Z.I_P1 < Z.I_X) then goto lab2; end if; Z.I_P1 := Z.I_X; <<lab2>> Result := True; end R_Mark_regions; procedure R_Main_suffix (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; v_2 : Integer; begin -- (, line 42 if Z.C < Z.I_P1 then Result := False; return; end if; v_2 := Z.Lb; Z.Lb := Z.I_P1; -- (, line 43 Z.Ket := Z.C; -- [, line 43 -- substring, line 43 if Z.C <= Z.Lb or else Check_Among (Z, Z.C - 1, 3, 16#1c4030#) then Z.Lb := v_2; Result := False; return; -- substring, line 43 end if; Find_Among_Backward (Z, A_0, Among_String, null, A); if A = 0 then Z.Lb := v_2; Result := False; return; end if; Z.Bra := Z.C; -- ], line 43 Z.Lb := v_2; -- among, line 44 case A is when 1 => -- (, line 50 -- delete, line 50 Slice_Del (Z); when 2 => -- (, line 52 In_Grouping_Backward (Z, G_S_ending, 97, 229, False, C); if C /= 0 then Result := False; return; end if; -- delete, line 52 Slice_Del (Z); when others => null; end case; Result := True; end R_Main_suffix; procedure R_Consonant_pair (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; v_1 : Char_Index; v_3 : Integer; begin -- (, line 56 -- test, line 57 v_1 := Z.L - Z.C; -- (, line 57 if Z.C < Z.I_P1 then Result := False; return; end if; v_3 := Z.Lb; Z.Lb := Z.I_P1; -- (, line 58 Z.Ket := Z.C; -- [, line 58 -- substring, line 58 if Z.C - 1 <= Z.Lb or else (Character'Pos (Z.P (Z.C)) /= 100 and then Character'Pos (Z.P (Z.C)) /= 116) then Z.Lb := v_3; Result := False; return; -- substring, line 58 end if; Find_Among_Backward (Z, A_1, Among_String, null, A); if A = 0 then Z.Lb := v_3; Result := False; return; end if; Z.Bra := Z.C; -- ], line 58 Z.Lb := v_3; Z.C := Z.L - v_1; -- next, line 64 C := Skip_Utf8_Backward (Z); if C < 0 then Result := False; return; end if; Z.C := C; Z.Bra := Z.C; -- ], line 64 -- delete, line 64 Slice_Del (Z); Result := True; end R_Consonant_pair; procedure R_Other_suffix (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; v_1 : Char_Index; v_3 : Integer; v_4 : Char_Index; begin -- (, line 67 -- do, line 68 v_1 := Z.L - Z.C; -- (, line 68 Z.Ket := Z.C; -- [, line 68 -- literal, line 68 C := Eq_S_Backward (Z, "st"); if C = 0 then goto lab0; end if; Z.C := Z.C - C; Z.Bra := Z.C; -- ], line 68 -- literal, line 68 C := Eq_S_Backward (Z, "ig"); if C = 0 then goto lab0; end if; Z.C := Z.C - C; -- delete, line 68 Slice_Del (Z); <<lab0>> Z.C := Z.L - v_1; if Z.C < Z.I_P1 then Result := False; return; end if; v_3 := Z.Lb; Z.Lb := Z.I_P1; -- (, line 69 Z.Ket := Z.C; -- [, line 69 -- substring, line 69 if Z.C - 1 <= Z.Lb or else Check_Among (Z, Z.C - 1, 3, 16#180080#) then Z.Lb := v_3; Result := False; return; -- substring, line 69 end if; Find_Among_Backward (Z, A_2, Among_String, null, A); if A = 0 then Z.Lb := v_3; Result := False; return; end if; Z.Bra := Z.C; -- ], line 69 Z.Lb := v_3; -- among, line 70 case A is when 1 => -- (, line 72 -- delete, line 72 Slice_Del (Z); -- do, line 72 v_4 := Z.L - Z.C; -- call consonant_pair, line 72 R_Consonant_pair (Z, Result); Z.C := Z.L - v_4; when 2 => -- (, line 74 -- <-, line 74 Slice_From (Z, "løs"); when others => null; end case; Result := True; end R_Other_suffix; procedure R_Undouble (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; v_2 : Integer; begin -- (, line 77 if Z.C < Z.I_P1 then Result := False; return; end if; v_2 := Z.Lb; Z.Lb := Z.I_P1; -- (, line 78 Z.Ket := Z.C; -- [, line 78 In_Grouping_Backward (Z, G_C, 98, 122, False, C); if C /= 0 then Z.Lb := v_2; Result := False; return; end if; Z.Bra := Z.C; -- ], line 78 -- -> ch, line 78 Z.S_Ch := Ada.Strings.Unbounded.To_Unbounded_String (Slice_To (Z)); Z.Lb := v_2; -- name ch, line 79 C := Eq_S_Backward (Z, Ada.Strings.Unbounded.To_String (Z.S_Ch)); if C = 0 then Result := False; return; end if; -- delete, line 80 Slice_Del (Z); Result := True; end R_Undouble; procedure Stem (Z : in out Context_Type; Result : out Boolean) is C : Result_Index; A : Integer; v_1 : Char_Index; v_2 : Char_Index; v_3 : Char_Index; v_4 : Char_Index; v_5 : Char_Index; begin -- (, line 84 -- do, line 86 v_1 := Z.C; -- call mark_regions, line 86 R_Mark_regions (Z, Result); Z.C := v_1; Z.Lb := Z.C; Z.C := Z.L; -- backwards, line 87 -- (, line 87 -- do, line 88 v_2 := Z.L - Z.C; -- call main_suffix, line 88 R_Main_suffix (Z, Result); Z.C := Z.L - v_2; -- do, line 89 v_3 := Z.L - Z.C; -- call consonant_pair, line 89 R_Consonant_pair (Z, Result); Z.C := Z.L - v_3; -- do, line 90 v_4 := Z.L - Z.C; -- call other_suffix, line 90 R_Other_suffix (Z, Result); Z.C := Z.L - v_4; -- do, line 91 v_5 := Z.L - Z.C; -- call undouble, line 91 R_Undouble (Z, Result); Z.C := Z.L - v_5; Z.C := Z.Lb; Result := True; end Stem; end Stemmer.Danish;
29.591549
114
0.487387
13fdf21fe848efd0ce0d2fba14a30f7bf583411c
4,224
ads
Ada
source/core/lace-generic_engines.ads
reznikmm/lace
da4cbebf5dccdb59ee7c2fbaf677aaec02857743
[ "MIT" ]
null
null
null
source/core/lace-generic_engines.ads
reznikmm/lace
da4cbebf5dccdb59ee7c2fbaf677aaec02857743
[ "MIT" ]
null
null
null
source/core/lace-generic_engines.ads
reznikmm/lace
da4cbebf5dccdb59ee7c2fbaf677aaec02857743
[ "MIT" ]
null
null
null
-- SPDX-FileCopyrightText: 2021 Max Reznik <[email protected]> -- -- SPDX-License-Identifier: MIT ------------------------------------------------------------- with Ada.Containers.Hashed_Maps; with Program.Elements; with Program.Element_Vectors; with Lace.Element_Flat_Kinds; generic type Property_Name is (<>); type Property_Value is private; type Abstract_Context; type Variant_Kind is private; with function Hash (Value : Variant_Kind) return Ada.Containers.Hash_Type is <>; package Lace.Generic_Engines is pragma Preelaborate; type Engine (Context : access Abstract_Context) is tagged limited private; function Get_Property (Self : access Engine; Element : Program.Elements.Element_Access; Name : Property_Name) return Property_Value; -- Evaluate a property (with Name) for given Element function Get_Property (Self : access Engine; List : Program.Element_Vectors.Element_Vector_Access; Name : Property_Name; Empty : Property_Value; Sum : access function (Left, Right : Property_Value) return Property_Value) return Property_Value; -- Evaluate a property (with Name) for each Element and aggregate results -- with Sum function taking Empty as a start value. type Formula_Access is access function (Engine : access Abstract_Context; Element : Program.Elements.Element_Access; Name : Property_Name) return Property_Value; procedure Register_Formula (Self : in out Engine; Kind : Lace.Element_Flat_Kinds.Element_Flat_Kind; Name : Property_Name; Formula : not null Formula_Access); -- Register given function (Formula) as a calculator given property (with -- Name) for elements of given Kind. No selector could be set if there is -- a formula. type Selector_Access is access function (Engine : access Abstract_Context; Element : Program.Elements.Element_Access; Name : Property_Name) return Variant_Kind; procedure Register_Selector (Self : in out Engine; Kind : Lace.Element_Flat_Kinds.Element_Flat_Kind; Name : Property_Name; Selector : not null Selector_Access); -- Turn property with Name to multivariant form. Use Selector to choose -- a variant for particular Element. No formula could be set if there is -- a selector. procedure Register_Variant (Self : in out Engine; Kind : Lace.Element_Flat_Kinds.Element_Flat_Kind; Name : Property_Name; Variant : Variant_Kind; Formula : access function (Engine : access Abstract_Context; Element : Program.Elements.Element_Access; Name : Property_Name) return Property_Value); -- Register given function (Formula) as a calculator of the property -- Variant. The property should have a selector. private type Property_Key is record Kind : Lace.Element_Flat_Kinds.Element_Flat_Kind; Name : Property_Name; end record; function Hash (Value : Property_Key) return Ada.Containers.Hash_Type; type Property_Descriptor is record Formula : Formula_Access; -- Formula, only if no variant selector Selector : Selector_Access; -- Selector, only if no formula end record; package Property_Descriptor_Maps is new Ada.Containers.Hashed_Maps (Key_Type => Property_Key, Element_Type => Property_Descriptor, Hash => Hash, Equivalent_Keys => "=", "=" => "="); type Varian_Key is record Property : Property_Key; Variant : Variant_Kind; end record; function Hash (Value : Varian_Key) return Ada.Containers.Hash_Type; package Varian_Descriptor_Maps is new Ada.Containers.Hashed_Maps (Key_Type => Varian_Key, Element_Type => Formula_Access, Hash => Hash, Equivalent_Keys => "=", "=" => "="); type Engine (Context : access Abstract_Context) is tagged limited record Descriptor : Property_Descriptor_Maps.Map; Varian : Varian_Descriptor_Maps.Map; end record; end Lace.Generic_Engines;
33.259843
77
0.669034
4bc8866470c7015076389142151a95c2eb20d9ac
7,413
adb
Ada
tools-src/gnu/gcc/gcc/ada/s-taskin.adb
modern-tomato/tomato
96f09fab4929c6ddde5c9113f1b2476ad37133c4
[ "FSFAP" ]
80
2015-01-02T10:14:04.000Z
2021-06-07T06:29:49.000Z
tools-src/gnu/gcc/gcc/ada/s-taskin.adb
modern-tomato/tomato
96f09fab4929c6ddde5c9113f1b2476ad37133c4
[ "FSFAP" ]
9
2015-05-14T11:03:12.000Z
2018-01-04T07:12:58.000Z
tools-src/gnu/gcc/gcc/ada/s-taskin.adb
modern-tomato/tomato
96f09fab4929c6ddde5c9113f1b2476ad37133c4
[ "FSFAP" ]
69
2015-01-02T10:45:56.000Z
2021-09-06T07:52:13.000Z
------------------------------------------------------------------------------ -- -- -- GNU ADA RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- S Y S T E M . T A S K I N G -- -- -- -- B o d y -- -- -- -- $Revision$ -- -- -- Copyright (C) 1991-2001 Florida State University -- -- -- -- GNARL is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNARL is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNARL; see file COPYING. If not, write -- -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- -- MA 02111-1307, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNARL was developed by the GNARL team at Florida State University. It is -- -- now maintained by Ada Core Technologies Inc. in cooperation with Florida -- -- State University (http://www.gnat.com). -- -- -- ------------------------------------------------------------------------------ pragma Polling (Off); -- Turn off polling, we do not want ATC polling to take place during -- tasking operations. It causes infinite loops and other problems. with System.Task_Primitives.Operations; -- used for Self with Unchecked_Deallocation; -- To recover from failure of ATCB initialization. with System.Storage_Elements; -- Needed for initializing Stack_Info.Size with System.Parameters; -- Used for Adjust_Storage_Size package body System.Tasking is package STPO renames System.Task_Primitives.Operations; procedure Free is new Unchecked_Deallocation (Ada_Task_Control_Block, Task_ID); ---------- -- Self -- ---------- function Self return Task_ID renames STPO.Self; --------------------- -- Initialize_ATCB -- --------------------- -- Call this only with abort deferred and holding All_Tasks_L. procedure Initialize_ATCB (Self_ID : Task_ID; Task_Entry_Point : Task_Procedure_Access; Task_Arg : System.Address; Parent : Task_ID; Elaborated : Access_Boolean; Base_Priority : System.Any_Priority; Task_Info : System.Task_Info.Task_Info_Type; Stack_Size : System.Parameters.Size_Type; T : in out Task_ID; Success : out Boolean) is begin T.Common.State := Unactivated; -- Initialize T.Common.LL STPO.Initialize_TCB (T, Success); if not Success then Free (T); return; end if; T.Common.Parent := Parent; T.Common.Base_Priority := Base_Priority; T.Common.Current_Priority := 0; T.Common.Call := null; T.Common.Task_Arg := Task_Arg; T.Common.Task_Entry_Point := Task_Entry_Point; T.Common.Activator := Self_ID; T.Common.Wait_Count := 0; T.Common.Elaborated := Elaborated; T.Common.Activation_Failed := False; T.Common.Task_Info := Task_Info; if T.Common.Parent = null then -- For the environment task, the adjusted stack size is -- meaningless. For example, an unspecified Stack_Size means -- that the stack size is determined by the environment, or -- can grow dynamically. The Stack_Checking algorithm -- therefore needs to use the requested size, or 0 in -- case of an unknown size. T.Common.Compiler_Data.Pri_Stack_Info.Size := Storage_Elements.Storage_Offset (Stack_Size); else T.Common.Compiler_Data.Pri_Stack_Info.Size := Storage_Elements.Storage_Offset (Parameters.Adjust_Storage_Size (Stack_Size)); end if; -- Link the task into the list of all tasks. T.Common.All_Tasks_Link := All_Tasks_List; All_Tasks_List := T; end Initialize_ATCB; Main_Task_Image : aliased String := "main_task"; -- Declare a global variable to avoid allocating dynamic memory. Main_Priority : Priority; pragma Import (C, Main_Priority, "__gl_main_priority"); ---------------------------- -- Tasking Initialization -- ---------------------------- -- This block constitutes the first part of the initialization of the -- GNARL. This includes creating data structures to make the initial thread -- into the environment task. The last part of the initialization is done -- in System.Tasking.Initialization or System.Tasking.Restricted.Stages. -- All the initializations used to be in Tasking.Initialization, but this -- is no longer possible with the run time simplification (including -- optimized PO and the restricted run time) since one cannot rely on -- System.Tasking.Initialization being present, as was done before. begin declare T : Task_ID; Success : Boolean; Base_Priority : Any_Priority; begin -- Initialize Environment Task if Main_Priority = Unspecified_Priority then Base_Priority := Default_Priority; else Base_Priority := Main_Priority; end if; Success := True; T := STPO.New_ATCB (0); Initialize_ATCB (null, null, Null_Address, Null_Task, null, Base_Priority, Task_Info.Unspecified_Task_Info, 0, T, Success); pragma Assert (Success); STPO.Initialize (T); STPO.Set_Priority (T, T.Common.Base_Priority); T.Common.State := Runnable; T.Common.Task_Image := Main_Task_Image'Unrestricted_Access; -- Only initialize the first element since others are not relevant -- in ravenscar mode. Rest of the initialization is done in Init_RTS. T.Entry_Calls (1).Self := T; end; end System.Tasking;
40.730769
79
0.555511
4b1c90a129107965229a906420f3b17f7ad24e12
1,117
adb
Ada
gdb/testsuite/gdb.ada/dyn_arrayidx/foo.adb
greyblue9/binutils-gdb
05377632b124fe7600eea7f4ee0e9a35d1b0cbdc
[ "BSD-3-Clause" ]
1
2020-10-14T03:24:35.000Z
2020-10-14T03:24:35.000Z
gdb/testsuite/gdb.ada/dyn_arrayidx/foo.adb
greyblue9/binutils-gdb
05377632b124fe7600eea7f4ee0e9a35d1b0cbdc
[ "BSD-3-Clause" ]
null
null
null
gdb/testsuite/gdb.ada/dyn_arrayidx/foo.adb
greyblue9/binutils-gdb
05377632b124fe7600eea7f4ee0e9a35d1b0cbdc
[ "BSD-3-Clause" ]
null
null
null
-- Copyright 2014-2021 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 3 of the License, or -- (at your option) any later version. -- -- This program is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program. If not, see <http://www.gnu.org/licenses/>. procedure Foo is function Range_Count (L, U : Integer) return Natural is type Array_Type is array (L .. U) of Natural; A : Array_Type := (others => 1); Result : Natural := 0; begin for I of A loop -- START Result := Result + I; end loop; return Result; end Range_Count; R2 : constant Natural := Range_Count (5, 10); begin null; end Foo;
33.848485
73
0.682184
0401a5ab8802baaf2c1bead8a68c39d57e1afee5
3,725
ads
Ada
source/league/league-json-streams-generic_float_stream_operations.ads
svn2github/matreshka
9d222b3ad9da508855fb1f5adbe5e8a4fad4c530
[ "BSD-3-Clause" ]
24
2016-11-29T06:59:41.000Z
2021-08-30T11:55:16.000Z
source/league/league-json-streams-generic_float_stream_operations.ads
svn2github/matreshka
9d222b3ad9da508855fb1f5adbe5e8a4fad4c530
[ "BSD-3-Clause" ]
2
2019-01-16T05:15:20.000Z
2019-02-03T10:03:32.000Z
source/league/league-json-streams-generic_float_stream_operations.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 © 2014, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ generic type Num is digits <>; package League.JSON.Streams.Generic_Float_Stream_Operations is pragma Preelaborate; procedure Read (Stream : in out League.JSON.Streams.JSON_Stream'Class; Item : out Num); procedure Write (Stream : in out League.JSON.Streams.JSON_Stream'Class; Item : Num); end League.JSON.Streams.Generic_Float_Stream_Operations;
61.065574
78
0.431141
4b711cb28caf45c48a2267cd7440caf30e2d556a
7,795
adb
Ada
tools/ayacc/src/tokens_file.adb
svn2github/matreshka
9d222b3ad9da508855fb1f5adbe5e8a4fad4c530
[ "BSD-3-Clause" ]
24
2016-11-29T06:59:41.000Z
2021-08-30T11:55:16.000Z
contrib/ayacc/src/tokens_file.adb
faelys/gela-asis
48a3bee90eda9f0c9d958b4e3c80a5a9b1c65253
[ "BSD-3-Clause" ]
2
2019-01-16T05:15:20.000Z
2019-02-03T10:03:32.000Z
tools/ayacc/src/tokens_file.adb
svn2github/matreshka
9d222b3ad9da508855fb1f5adbe5e8a4fad4c530
[ "BSD-3-Clause" ]
4
2017-07-18T07:11:05.000Z
2020-06-21T03:02:25.000Z
-- $Header: /dc/uc/self/arcadia/ayacc/src/RCS/tokens_file_body.a,v 1.2 1993/05/31 22:36:35 self Exp self $ -- 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 : tokens_file_body.ada -- Component of : ayacc -- Version : 1.2 -- Date : 11/21/86 12:38:23 -- SCCS File : disk21~/rschm/hasee/sccs/ayacc/sccs/sxtokens_file_body.ada -- $Header: /dc/uc/self/arcadia/ayacc/src/RCS/tokens_file_body.a,v 1.2 1993/05/31 22:36:35 self Exp self $ -- $Log: tokens_file_body.a,v $ -- Revision 1.2 1993/05/31 22:36:35 self -- added exception handler when opening files -- -- Revision 1.1 1993/05/31 22:14:38 self -- Initial revision -- --Revision 1.1 88/08/08 14:43:01 arcadia --Initial revision -- -- Revision 0.1 86/04/01 15:14:29 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:54:19 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. -- with Ayacc_File_Names, Source_File, Symbol_Table, Text_IO; with String_Pkg; package body Tokens_File is SCCS_ID : constant String := "@(#) tokens_file_body.ada, Version 1.2"; Rcs_ID : constant String := "$Header: /dc/uc/self/arcadia/ayacc/src/RCS/tokens_file_body.a,v 1.2 1993/05/31 22:36:35 self Exp self $"; Package_Header_Generated : Boolean := False; T_File: Text_IO.File_Type; procedure Open is use Text_IO; begin Create(T_File, Out_File, Ayacc_File_Names.Get_Tokens_File_Name); exception when Name_Error | Use_Error => Put_Line("Ayacc: Error Opening """ & Ayacc_File_Names.Get_Tokens_File_Name & """."); raise; end Open; function Tokens_Package_Header_Has_Been_Generated return Boolean is begin return Package_Header_Generated; end Tokens_Package_Header_Has_Been_Generated; procedure Start_Tokens_Package is begin if not Package_Header_Generated then Writeln("package " & Ayacc_File_Names.Tokens_Unit_Name & " is"); Writeln(""); Package_Header_Generated := True; end if; end Start_Tokens_Package; procedure Close is use Text_IO; begin Close(T_File); end Close; procedure Write(S: in String) is use Text_IO; begin Put(T_File,S); end Write; procedure Writeln(S: in String) is use Text_IO; begin Put_Line(T_File,S); end Writeln; procedure Complete_Tokens_Package is Tokens_On_Line: Natural := 1; use String_Pkg; use Symbol_Table; begin if not Package_Header_Generated then Start_Tokens_Package; end if; Writeln(" YYLVal, YYVal : YYSType; "); Writeln(" type Token is"); Write(" ("); for I in First_Symbol(Terminal)..Last_Symbol(Terminal)-1 loop if Tokens_On_Line = 4 then Write(Value (Mixed (Get_Symbol_Name(I)))); Writeln(","); Write(" "); Tokens_On_Line := 1; else Write(Value (Mixed (Get_Symbol_Name(I)))); Write(", "); end if; Tokens_On_Line := Tokens_On_Line + 1; end loop; Write(Value (Mixed (Get_Symbol_Name(Last_Symbol(Terminal))))); Writeln(" );"); Writeln(""); Writeln(" Syntax_Error : exception;"); Writeln(""); Writeln("end " & Ayacc_File_Names.Tokens_Unit_Name & ";"); end Complete_Tokens_Package; procedure Make_C_Lex_Package is use Symbol_Table, Text_IO; The_Define_File : File_Type; The_Ada_File : File_Type; type Symbol_Rec is record Name : String(1..Source_File.Maximum_Line_Length); Length : Natural; end record; Sym_Name : Symbol_Rec; function Convert(S : String) return Symbol_Rec is Result : Symbol_Rec; begin Result.Name(1..S'Length) := S; Result.Length := S'Length; return Result; end; begin Create(The_Ada_File, Out_File, Ayacc_File_Names.Get_C_Lex_File_Name & "ds"); Put_Line(The_Ada_File, "with " & Ayacc_File_Names.Tokens_Unit_Name & "; use " & Ayacc_File_Names.Tokens_Unit_Name & ";"); Put_Line(The_Ada_File, "package " & Ayacc_File_Names.C_Lex_Unit_Name & " is"); Put_Line(The_Ada_File, " function YYLex return Token;"); Put_Line(The_Ada_File, "end " & Ayacc_File_Names.C_Lex_Unit_Name & ";"); Close(The_Ada_File); Create(The_Ada_File, Out_File, Ayacc_File_Names.Get_C_Lex_File_Name & "db"); Put_Line(The_Ada_File, "package body " & Ayacc_File_Names.C_Lex_Unit_Name & " is"); New_Line(The_Ada_File); Put_Line(The_Ada_File, " function Get_Token return Integer;"); New_Line(The_Ada_File); Put_Line(The_Ada_File, " pragma Interface(C, Get_Token);"); New_Line(The_Ada_File); Put_Line(The_Ada_File, " type Table is array(0..255) of Token;"); Put_Line(The_Ada_File, " Literals : constant Table := Table'("); Put_Line(The_Ada_File, " 0 => End_of_Input,"); Create(The_Define_File, Out_File, Ayacc_File_Names.Get_Include_File_Name); Put_Line(The_Define_File, "/* C_Lex Token Definition for type " & Ayacc_File_Names.Tokens_Unit_Name & ".Token; */"); New_Line (The_Define_File); for I in First_Symbol(Terminal)..Last_Symbol(Terminal) loop Sym_Name := Convert(Get_Symbol_Name(I)); if Sym_Name.Name(1) /= ''' then Put(The_Define_File,"#define "); Put(The_Define_File, Sym_Name.Name(1..Sym_Name.Length)); Put_Line(The_Define_File, " " & Grammar_Symbol'Image(I + 256)); else Put(The_Ada_File, " " & Integer'Image(Character'Pos(Sym_Name.Name(2))) & " => "); Put(The_Ada_File, Sym_Name.Name(1..Sym_Name.Length) & ','); New_Line(The_Ada_File); end if; end loop; Put_Line(The_Ada_File, " others => Error); "); New_Line(The_Ada_File); Put_Line(The_Ada_File, " function YYLex return Token is"); Put_Line(The_Ada_File, " Token_Value : Integer;"); Put_Line(The_Ada_File, " begin"); Put_Line(The_Ada_File, " Token_Value := Get_Token;"); Put_Line(The_Ada_File, " if Token_Value > 255 then"); Put_Line(The_Ada_File, " return Token'Val(Token_Value-256);"); Put_Line(The_Ada_File, " else "); Put_Line(The_Ada_File, " return Literals(Token_Value); "); Put_Line(The_Ada_File, " end if; "); Put_Line(The_Ada_File, " end YYLex; "); Put_Line(The_Ada_File, "end " & Ayacc_File_Names.C_Lex_Unit_Name & ";"); Close(The_Ada_File); Close(The_Define_File); end; end Tokens_File;
31.816327
136
0.673894
4b07260692cc3faaa1628dd4340dececaaf0fa35
1,586
adb
Ada
source/crypto-sha256.adb
ytomino/openssl-ada
efacd262cec28c773e80246319f25ab316d93d81
[ "OpenSSL", "Unlicense" ]
1
2020-09-04T18:05:22.000Z
2020-09-04T18:05:22.000Z
source/crypto-sha256.adb
ytomino/openssl-ada
efacd262cec28c773e80246319f25ab316d93d81
[ "OpenSSL", "Unlicense" ]
null
null
null
source/crypto-sha256.adb
ytomino/openssl-ada
efacd262cec28c773e80246319f25ab316d93d81
[ "OpenSSL", "Unlicense" ]
null
null
null
with Ada.Unchecked_Conversion; with System; package body Crypto.SHA256 is use type C.signed_int; function Initial return Context is begin return Result : Context do if C.openssl.sha.SHA256_Init (Result.SHA'Access) = 0 then raise Use_Error; end if; end return; end Initial; procedure Update ( Context : in out SHA256.Context; Data : in Ada.Streams.Stream_Element_Array) is pragma Suppress (Index_Check); begin if C.openssl.sha.SHA256_Update ( Context.SHA'Access, C.void_const_ptr (Data (Data'First)'Address), Data'Length) = 0 then raise Use_Error; end if; end Update; procedure Update (Context : in out SHA256.Context; Data : in String) is pragma Suppress (Index_Check); begin if C.openssl.sha.SHA256_Update ( Context.SHA'Access, C.void_const_ptr (Data (Data'First)'Address), Data'Length) = 0 then raise Use_Error; end if; end Update; procedure Final (Context : in out SHA256.Context; Digest : out Fingerprint) is function To_Pointer is new Ada.Unchecked_Conversion (System.Address, C.unsigned_char_ptr); begin if C.openssl.sha.SHA256_Final ( To_Pointer (Digest (Digest'First)'Address), Context.SHA'Access) = 0 then raise Use_Error; end if; end Final; function Value (S : Message_Digest) return Fingerprint is begin return Result : Fingerprint do Value (S, Result); end return; end Value; function Image (Digest : in Fingerprint) return Message_Digest is begin return Result : Message_Digest do Image (Digest, Result); end return; end Image; end Crypto.SHA256;
22.985507
79
0.72005
4bf99e6bc3330047989d6c82e14dc5e2638c0480
859
adb
Ada
src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/pckd_neg/pck.adb
alrooney/unum-sdk
bbccb10b0cd3500feccbbef22e27ea111c3d18eb
[ "Apache-2.0" ]
31
2018-08-01T21:25:24.000Z
2022-02-14T07:52:34.000Z
src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/pckd_neg/pck.adb
alrooney/unum-sdk
bbccb10b0cd3500feccbbef22e27ea111c3d18eb
[ "Apache-2.0" ]
40
2018-12-03T19:48:52.000Z
2021-03-10T06:34:26.000Z
src/gdb/gdb-8.3/gdb/testsuite/gdb.ada/pckd_neg/pck.adb
alrooney/unum-sdk
bbccb10b0cd3500feccbbef22e27ea111c3d18eb
[ "Apache-2.0" ]
20
2018-11-16T21:19:22.000Z
2021-10-18T23:08:24.000Z
-- Copyright (C) 2015-2019 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 3 of the License, or -- (at your option) any later version. -- -- This program is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program. If not, see <http://www.gnu.org/licenses/>. package body Pck is procedure Update_Signed_Small (S : in out Signed_Small) is begin null; end Update_Signed_Small; end Pck;
39.045455
73
0.733411
ad0b373e40353b60a631796f2a97d7f756bebfce
1,766
ads
Ada
resources/scripts/api/threatbook.ads
shelld3v/Amass
a80e0619b3a96142b8980bb443fddb8c41a7e606
[ "Apache-2.0" ]
1
2021-02-04T22:55:20.000Z
2021-02-04T22:55:20.000Z
resources/scripts/api/threatbook.ads
shelld3v/Amass
a80e0619b3a96142b8980bb443fddb8c41a7e606
[ "Apache-2.0" ]
null
null
null
resources/scripts/api/threatbook.ads
shelld3v/Amass
a80e0619b3a96142b8980bb443fddb8c41a7e606
[ "Apache-2.0" ]
null
null
null
-- Copyright 2021 Jeff Foley. All rights reserved. -- Use of this source code is governed by Apache 2 LICENSE that can be found in the LICENSE file. local json = require("json") name = "ThreatBook" type = "api" function start() setratelimit(5) end function check() local c local cfg = datasrc_config() if cfg ~= nil then c = cfg.credentials end if (c ~= nil and c.key ~= nil and c.key ~= "") then return true end return false end function vertical(ctx, domain) local c local cfg = datasrc_config() if cfg ~= nil then c = cfg.credentials end if (c == nil or c.key == nil or c.key == "") then return end local resp local vurl = verturl(domain, key) -- Check if the response data is in the graph database if (cfg.ttl ~= nil and cfg.ttl > 0) then resp = obtain_response(cacheurl(domain), cfg.ttl) end if (resp == nil or resp == "") then local err resp, err = request({ url=vurl, headers={['Content-Type']="application/json"}, }) if (err ~= nil and err ~= "") then return end if (cfg.ttl ~= nil and cfg.ttl > 0) then cache_response(cacheurl(domain), resp) end end local d = json.decode(resp) if (d == nil or d.response_code ~= 0 or #(d.sub_domains.data) == 0) then return end for i, sub in pairs(d.sub_domains.data) do newname(ctx, sub) end end function verturl(domain, key) return "https://api.threatbook.cn/v3/domain/sub_domains?apikey=" .. key .. "&resource=" .. domain end function cacheurl(domain) return "https://api.threatbook.cn/v3/domain/sub_domains?resource=" .. domain end
22.935065
101
0.591733
139c5fc34d414e5d2a8aab1ae22c8800a30be11d
17,251
ads
Ada
support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/a-calend.ads
orb-zhuchen/Orb
6da2404b949ac28bde786e08bf4debe4a27cd3a0
[ "CNRI-Python-GPL-Compatible", "MIT" ]
null
null
null
support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/a-calend.ads
orb-zhuchen/Orb
6da2404b949ac28bde786e08bf4debe4a27cd3a0
[ "CNRI-Python-GPL-Compatible", "MIT" ]
null
null
null
support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/a-calend.ads
orb-zhuchen/Orb
6da2404b949ac28bde786e08bf4debe4a27cd3a0
[ "CNRI-Python-GPL-Compatible", "MIT" ]
null
null
null
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- A D A . C A L E N D A R -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2019, 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. -- -- -- ------------------------------------------------------------------------------ package Ada.Calendar with SPARK_Mode, Abstract_State => (Clock_Time with Synchronous), Initializes => Clock_Time is type Time is private; -- Declarations representing limits of allowed local time values. Note that -- these do NOT constrain the possible stored values of time which may well -- permit a larger range of times (this is explicitly allowed in Ada 95). subtype Year_Number is Integer range 1901 .. 2399; subtype Month_Number is Integer range 1 .. 12; subtype Day_Number is Integer range 1 .. 31; -- A Day_Duration value of 86_400.0 designates a new day subtype Day_Duration is Duration range 0.0 .. 86_400.0; function Clock return Time with Volatile_Function, Global => Clock_Time; -- The returned time value is the number of nanoseconds since the start -- of Ada time (1901-01-01 00:00:00.0 UTC). If leap seconds are enabled, -- the result will contain all elapsed leap seconds since the start of -- Ada time until now. function Year (Date : Time) return Year_Number with Global => null; function Month (Date : Time) return Month_Number with Global => null; function Day (Date : Time) return Day_Number with Global => null; function Seconds (Date : Time) return Day_Duration with Global => null; procedure Split (Date : Time; Year : out Year_Number; Month : out Month_Number; Day : out Day_Number; Seconds : out Day_Duration) with Global => null; -- Break down a time value into its date components set in the current -- time zone. If Split is called on a time value created using Ada 2005 -- Time_Of in some arbitrary time zone, the input value will always be -- interpreted as relative to the local time zone. function Time_Of (Year : Year_Number; Month : Month_Number; Day : Day_Number; Seconds : Day_Duration := 0.0) return Time with Global => null; -- GNAT Note: Normally when procedure Split is called on a Time value -- result of a call to function Time_Of, the out parameters of procedure -- Split are identical to the in parameters of function Time_Of. However, -- when a non-existent time of day is specified, the values for Seconds -- may or may not be different. This may happen when Daylight Saving Time -- (DST) is in effect, on the day when switching to DST, if Seconds -- specifies a time of day in the hour that does not exist. For example, -- in New York: -- -- Time_Of (Year => 1998, Month => 4, Day => 5, Seconds => 10740.0) -- -- will return a Time value T. If Split is called on T, the resulting -- Seconds may be 14340.0 (3:59:00) instead of 10740.0 (2:59:00 being -- a time that not exist). function "+" (Left : Time; Right : Duration) return Time with Global => null; function "+" (Left : Duration; Right : Time) return Time with Global => null; function "-" (Left : Time; Right : Duration) return Time with Global => null; function "-" (Left : Time; Right : Time) return Duration with Global => null; -- The first three functions will raise Time_Error if the resulting time -- value is less than the start of Ada time in UTC or greater than the -- end of Ada time in UTC. The last function will raise Time_Error if the -- resulting difference cannot fit into a duration value. function "<" (Left, Right : Time) return Boolean with Global => null; function "<=" (Left, Right : Time) return Boolean with Global => null; function ">" (Left, Right : Time) return Boolean with Global => null; function ">=" (Left, Right : Time) return Boolean with Global => null; Time_Error : exception; private -- Mark the private part as SPARK_Mode Off to avoid accounting for variable -- Invalid_Time_Zone_Offset in abstract state. pragma SPARK_Mode (Off); pragma Inline (Clock); pragma Inline (Year); pragma Inline (Month); pragma Inline (Day); pragma Inline ("+"); pragma Inline ("-"); pragma Inline ("<"); pragma Inline ("<="); pragma Inline (">"); pragma Inline (">="); -- The units used in this version of Ada.Calendar are nanoseconds. The -- following constants provide values used in conversions of seconds or -- days to the underlying units. Nano : constant := 1_000_000_000; Nano_F : constant := 1_000_000_000.0; Nanos_In_Day : constant := 86_400_000_000_000; Secs_In_Day : constant := 86_400; ---------------------------- -- Implementation of Time -- ---------------------------- -- Time is represented as a signed 64 bit integer count of nanoseconds -- since the start of Ada time (1901-01-01 00:00:00.0 UTC). Time values -- produced by Time_Of are internally normalized to UTC regardless of their -- local time zone. This representation ensures correct handling of leap -- seconds as well as performing arithmetic. In Ada 95, Split and Time_Of -- will treat a time value as being in the local time zone, in Ada 2005, -- Split and Time_Of will treat a time value as being in the designated -- time zone by the formal parameter or in UTC by default. The size of the -- type is large enough to cover the Ada 2005 range of time (1901-01-01 -- 00:00:00.0 UTC - 2399-12-31-23:59:59.999999999 UTC). ------------------ -- Leap Seconds -- ------------------ -- Due to Earth's slowdown, the astronomical time is not as precise as the -- International Atomic Time. To compensate for this inaccuracy, a single -- leap second is added after the last day of June or December. The count -- of seconds during those occurrences becomes: -- ... 58, 59, leap second 60, 0, 1, 2 ... -- Unlike leap days, leap seconds occur simultaneously around the world. -- In other words, if a leap second occurs at 23:59:60 UTC, it also occurs -- on 18:59:60 -5 the same day or 2:59:60 +2 on the next day. -- Leap seconds do not follow a formula. The International Earth Rotation -- and Reference System Service decides when to add one. Leap seconds are -- included in the representation of time in Ada 95 mode. As a result, -- the following two time values will differ by two seconds: -- 1972-06-30 23:59:59.0 -- 1972-07-01 00:00:00.0 -- When a new leap second is introduced, the following steps must be -- carried out: -- 1) Increment Leap_Seconds_Count in a-calend.adb by one -- 2) Increment LS_Count in xleaps.adb by one -- 3) Add the new date to the aggregate of array LS_Dates in -- xleaps.adb -- 4) Compile and execute xleaps -- 5) Replace the values of Leap_Second_Times in a-calend.adb with the -- aggregate generated by xleaps -- The algorithms that build the actual leap second values and discover -- how many leap seconds have occurred between two dates do not need any -- modification. ------------------------------ -- Non-leap Centennial Years -- ------------------------------ -- Over the range of Ada time, centennial years 2100, 2200 and 2300 are -- non-leap. As a consequence, seven non-leap years occur over the period -- of year - 4 to year + 4. Internally, routines Split and Time_Of add or -- subtract a "fake" February 29 to facilitate the arithmetic involved. ------------------------ -- Local Declarations -- ------------------------ type Time_Rep is new Long_Long_Integer; type Time is new Time_Rep; -- The underlying type of Time has been chosen to be a 64 bit signed -- integer number since it allows for easier processing of sub-seconds -- and arithmetic. We use Long_Long_Integer to allow this unit to compile -- when using custom target configuration files where the max integer is -- 32 bits. This is useful for static analysis tools such as SPARK or -- CodePeer. -- -- Note: the reason we have two separate types here is to avoid problems -- with overloading ambiguities in the body if we tried to use Time as an -- internal computational type. function Epoch_Offset return Time_Rep; pragma Inline (Epoch_Offset); -- Return the difference between 2150-1-1 UTC and 1970-1-1 UTC expressed in -- nanoseconds. Note that year 2100 is non-leap. Days_In_Month : constant array (Month_Number) of Day_Number := (31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31); -- Days in month for non-leap year, leap year case is adjusted in code Invalid_Time_Zone_Offset : Long_Integer; pragma Import (C, Invalid_Time_Zone_Offset, "__gnat_invalid_tzoff"); function Is_Leap (Year : Year_Number) return Boolean; -- Determine whether a given year is leap ---------------------------------------------------------- -- Target-Independent Interface to Children of Calendar -- ---------------------------------------------------------- -- The following packages provide a target-independent interface to the -- children of Calendar - Arithmetic, Conversions, Delays, Formatting and -- Time_Zones. --------------------------- -- Arithmetic_Operations -- --------------------------- package Arithmetic_Operations is function Add (Date : Time; Days : Long_Integer) return Time; -- Add a certain number of days to a time value procedure Difference (Left : Time; Right : Time; Days : out Long_Integer; Seconds : out Duration; Leap_Seconds : out Integer); -- Calculate the difference between two time values in terms of days, -- seconds and leap seconds elapsed. The leap seconds are not included -- in the seconds returned. If Left is greater than Right, the returned -- values are positive, negative otherwise. function Subtract (Date : Time; Days : Long_Integer) return Time; -- Subtract a certain number of days from a time value end Arithmetic_Operations; --------------------------- -- Conversion_Operations -- --------------------------- package Conversion_Operations is function To_Ada_Time (Unix_Time : Long_Integer) return Time; -- Unix to Ada Epoch conversion function To_Ada_Time (tm_year : Integer; tm_mon : Integer; tm_day : Integer; tm_hour : Integer; tm_min : Integer; tm_sec : Integer; tm_isdst : Integer) return Time; -- Struct tm to Ada Epoch conversion function To_Duration (tv_sec : Long_Integer; tv_nsec : Long_Integer) return Duration; -- Struct timespec to Duration conversion procedure To_Struct_Timespec (D : Duration; tv_sec : out Long_Integer; tv_nsec : out Long_Integer); -- Duration to struct timespec conversion procedure To_Struct_Tm (T : Time; tm_year : out Integer; tm_mon : out Integer; tm_day : out Integer; tm_hour : out Integer; tm_min : out Integer; tm_sec : out Integer); -- Time to struct tm conversion function To_Unix_Time (Ada_Time : Time) return Long_Integer; -- Ada to Unix Epoch conversion end Conversion_Operations; ---------------------- -- Delay_Operations -- ---------------------- package Delay_Operations is function To_Duration (Date : Time) return Duration; -- Given a time value in nanoseconds since 1901, convert it into a -- duration value giving the number of nanoseconds since the Unix Epoch. end Delay_Operations; --------------------------- -- Formatting_Operations -- --------------------------- package Formatting_Operations is function Day_Of_Week (Date : Time) return Integer; -- Determine which day of week Date falls on. The returned values are -- within the range of 0 .. 6 (Monday .. Sunday). procedure Split (Date : Time; Year : out Year_Number; Month : out Month_Number; Day : out Day_Number; Day_Secs : out Day_Duration; Hour : out Integer; Minute : out Integer; Second : out Integer; Sub_Sec : out Duration; Leap_Sec : out Boolean; Use_TZ : Boolean; Is_Historic : Boolean; Time_Zone : Long_Integer); pragma Export (Ada, Split, "__gnat_split"); -- Split a time value into its components. If flag Is_Historic is set, -- this routine would try to use to the best of the OS's abilities the -- time zone offset that was or will be in effect on Date. Set Use_TZ -- to use the local time zone (the value in Time_Zone is ignored) when -- splitting a time value. function Time_Of (Year : Year_Number; Month : Month_Number; Day : Day_Number; Day_Secs : Day_Duration; Hour : Integer; Minute : Integer; Second : Integer; Sub_Sec : Duration; Leap_Sec : Boolean; Use_Day_Secs : Boolean; Use_TZ : Boolean; Is_Historic : Boolean; Time_Zone : Long_Integer) return Time; pragma Export (Ada, Time_Of, "__gnat_time_of"); -- Given all the components of a date, return the corresponding time -- value. Set Use_Day_Secs to use the value in Day_Secs, otherwise the -- day duration will be calculated from Hour, Minute, Second and Sub_ -- Sec. If flag Is_Historic is set, this routine would try to use to the -- best of the OS's abilities the time zone offset that was or will be -- in effect on the input date. Set Use_TZ to use the local time zone -- (the value in formal Time_Zone is ignored) when building a time value -- and to verify the validity of a requested leap second. end Formatting_Operations; --------------------------- -- Time_Zones_Operations -- --------------------------- package Time_Zones_Operations is function UTC_Time_Offset (Date : Time) return Long_Integer; -- Return (in seconds) the difference between the local time zone and -- UTC time at a specific historic date. end Time_Zones_Operations; end Ada.Calendar;
41.973236
79
0.589531
04e3aa61301b617590ea3cc6558044893e204b34
57
ads
Ada
specs/ada/common/tkmrpc-response-cfg.ads
DrenfongWong/tkm-rpc
075d22871cf81d497aac656c7f03a513278b641c
[ "BSD-3-Clause" ]
null
null
null
specs/ada/common/tkmrpc-response-cfg.ads
DrenfongWong/tkm-rpc
075d22871cf81d497aac656c7f03a513278b641c
[ "BSD-3-Clause" ]
null
null
null
specs/ada/common/tkmrpc-response-cfg.ads
DrenfongWong/tkm-rpc
075d22871cf81d497aac656c7f03a513278b641c
[ "BSD-3-Clause" ]
null
null
null
package Tkmrpc.Response.Cfg is end Tkmrpc.Response.Cfg;
14.25
30
0.807018
2953fa6bf44344790e8d1af6cde746cd420053f5
125,030
adb
Ada
honeybee_proj/HBF/.autopilot/db/p_hls_fptosi_float_i.adb
AnthonyKenny98/HoneyBee
5b1859fe8c50cb5bd709f53780c4e5ce7160b987
[ "MIT" ]
null
null
null
honeybee_proj/HBF/.autopilot/db/p_hls_fptosi_float_i.adb
AnthonyKenny98/HoneyBee
5b1859fe8c50cb5bd709f53780c4e5ce7160b987
[ "MIT" ]
null
null
null
honeybee_proj/HBF/.autopilot/db/p_hls_fptosi_float_i.adb
AnthonyKenny98/HoneyBee
5b1859fe8c50cb5bd709f53780c4e5ce7160b987
[ "MIT" ]
null
null
null
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="15"> <syndb class_id="0" tracking_level="0" version="0"> <userIPLatency>-1</userIPLatency> <userIPName/> <cdfg class_id="1" tracking_level="1" version="0" object_id="_0"> <name>p_hls_fptosi_float_i</name> <ret_bitwidth>32</ret_bitwidth> <ports class_id="2" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="3" tracking_level="1" version="0" object_id="_1"> <Value class_id="4" tracking_level="0" version="0"> <Obj class_id="5" tracking_level="0" version="0"> <type>1</type> <id>1</id> <name>x</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo class_id="6" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>x</originalName> <rtlName/> <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> </ports> <nodes class_id="8" tracking_level="0" version="0"> <count>25</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_2"> <Value> <Obj> <type>0</type> <id>2</id> <name>x_read</name> <fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</fileName> <fileDirectory>../../../../../wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory> <lineNumber>51</lineNumber> <contextFuncName>__hls_fptosi_float_i32</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="10" tracking_level="0" version="0"> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</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>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first> <second>__hls_fptosi_float_i32</second> </first> <second>51</second> </item> </second> </item> </inlineStackInfo> <originalName>x</originalName> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>29</item> <item>30</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>1</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_3"> <Value> <Obj> <type>0</type> <id>3</id> <name>p_Val2_s</name> <fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/src/hls/utils/x_hls_utils.h</fileName> <fileDirectory>../../../../../wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory> <lineNumber>310</lineNumber> <contextFuncName>fp_struct</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</second> </first> <second>13</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, float&amp;gt;</second> </first> <second>117</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first> <second>__hls_fptosi_float_i32</second> </first> <second>51</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/src/hls/utils/x_hls_utils.h</first> <second>fp_struct</second> </first> <second>310</second> </item> </second> </item> </inlineStackInfo> <originalName>val</originalName> <rtlName>p_Val2_s_fu_44_p1</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>31</item> </oprand_edges> <opcode>bitcast</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>2</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_4"> <Value> <Obj> <type>0</type> <id>4</id> <name>p_Result_s</name> <fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/src/hls/utils/x_hls_utils.h</fileName> <fileDirectory>../../../../../wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory> <lineNumber>316</lineNumber> <contextFuncName>fp_struct</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</second> </first> <second>13</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, float&amp;gt;</second> </first> <second>117</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first> <second>__hls_fptosi_float_i32</second> </first> <second>51</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/src/hls/utils/x_hls_utils.h</first> <second>fp_struct</second> </first> <second>316</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName>p_Result_s_fu_48_p3</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>33</item> <item>34</item> <item>36</item> </oprand_edges> <opcode>bitselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>3</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_5"> <Value> <Obj> <type>0</type> <id>5</id> <name>tmp_V</name> <fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/src/hls/utils/x_hls_utils.h</fileName> <fileDirectory>../../../../../wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory> <lineNumber>317</lineNumber> <contextFuncName>fp_struct</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</second> </first> <second>13</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, float&amp;gt;</second> </first> <second>117</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first> <second>__hls_fptosi_float_i32</second> </first> <second>51</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/src/hls/utils/x_hls_utils.h</first> <second>fp_struct</second> </first> <second>317</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.V</originalName> <rtlName>tmp_V_fu_56_p4</rtlName> <coreName/> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>38</item> <item>39</item> <item>41</item> <item>43</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>4</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_6"> <Value> <Obj> <type>0</type> <id>6</id> <name>tmp_V_1</name> <fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/src/hls/utils/x_hls_utils.h</fileName> <fileDirectory>../../../../../wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory> <lineNumber>318</lineNumber> <contextFuncName>fp_struct</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</second> </first> <second>13</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, float&amp;gt;</second> </first> <second>117</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first> <second>__hls_fptosi_float_i32</second> </first> <second>51</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/src/hls/utils/x_hls_utils.h</first> <second>fp_struct</second> </first> <second>318</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.V</originalName> <rtlName>tmp_V_1_fu_66_p1</rtlName> <coreName/> </Obj> <bitwidth>23</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>44</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>5</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_7"> <Value> <Obj> <type>0</type> <id>7</id> <name>mantissa_V</name> <fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName> <fileDirectory>../../../../../wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory> <lineNumber>15</lineNumber> <contextFuncName>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</second> </first> <second>15</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, float&amp;gt;</second> </first> <second>117</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first> <second>__hls_fptosi_float_i32</second> </first> <second>51</second> </item> </second> </item> </inlineStackInfo> <originalName>mantissa.V</originalName> <rtlName>mantissa_V_fu_70_p4</rtlName> <coreName/> </Obj> <bitwidth>25</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>46</item> <item>48</item> <item>49</item> <item>51</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>6</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_8"> <Value> <Obj> <type>0</type> <id>8</id> <name>zext_ln682</name> <fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName> <fileDirectory>../../../../../wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory> <lineNumber>15</lineNumber> <contextFuncName>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</second> </first> <second>15</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, float&amp;gt;</second> </first> <second>117</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first> <second>__hls_fptosi_float_i32</second> </first> <second>51</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>zext_ln682_fu_80_p1</rtlName> <coreName/> </Obj> <bitwidth>79</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>52</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>7</m_topoIndex> <m_clusterGroupNumber>1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_9"> <Value> <Obj> <type>0</type> <id>9</id> <name>zext_ln339</name> <fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/src/hls/utils/x_hls_utils.h</fileName> <fileDirectory>../../../../../wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory> <lineNumber>339</lineNumber> <contextFuncName>expv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</second> </first> <second>18</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, float&amp;gt;</second> </first> <second>117</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first> <second>__hls_fptosi_float_i32</second> </first> <second>51</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/src/hls/utils/x_hls_utils.h</first> <second>expv</second> </first> <second>339</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>zext_ln339_fu_84_p1</rtlName> <coreName/> </Obj> <bitwidth>9</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>53</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>8</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_10"> <Value> <Obj> <type>0</type> <id>10</id> <name>add_ln339</name> <fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/src/hls/utils/x_hls_utils.h</fileName> <fileDirectory>../../../../../wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory> <lineNumber>339</lineNumber> <contextFuncName>expv</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first> <second> <count>4</count> <item_version>0</item_version> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</second> </first> <second>18</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, float&amp;gt;</second> </first> <second>117</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first> <second>__hls_fptosi_float_i32</second> </first> <second>51</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/src/hls/utils/x_hls_utils.h</first> <second>expv</second> </first> <second>339</second> </item> </second> </item> </inlineStackInfo> <originalName>sh</originalName> <rtlName>add_ln339_fu_88_p2</rtlName> <coreName/> </Obj> <bitwidth>9</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>55</item> <item>56</item> </oprand_edges> <opcode>add</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.30</m_delay> <m_topoIndex>9</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_11"> <Value> <Obj> <type>0</type> <id>11</id> <name>isNeg</name> <fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName> <fileDirectory>../../../../../wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory> <lineNumber>18</lineNumber> <contextFuncName>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</second> </first> <second>18</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, float&amp;gt;</second> </first> <second>117</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first> <second>__hls_fptosi_float_i32</second> </first> <second>51</second> </item> </second> </item> </inlineStackInfo> <originalName>isNeg</originalName> <rtlName>isNeg_fu_94_p3</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>58</item> <item>59</item> <item>61</item> </oprand_edges> <opcode>bitselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>10</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_12"> <Value> <Obj> <type>0</type> <id>12</id> <name>sub_ln1311</name> <fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName> <fileDirectory>../../../../../wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory> <lineNumber>18</lineNumber> <contextFuncName>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</second> </first> <second>18</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, float&amp;gt;</second> </first> <second>117</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first> <second>__hls_fptosi_float_i32</second> </first> <second>51</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>sub_ln1311_fu_102_p2</rtlName> <coreName/> </Obj> <bitwidth>8</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>63</item> <item>64</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.30</m_delay> <m_topoIndex>11</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_13"> <Value> <Obj> <type>0</type> <id>13</id> <name>sext_ln1311</name> <fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName> <fileDirectory>../../../../../wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory> <lineNumber>18</lineNumber> <contextFuncName>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</second> </first> <second>18</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, float&amp;gt;</second> </first> <second>117</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first> <second>__hls_fptosi_float_i32</second> </first> <second>51</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>sext_ln1311_fu_108_p1</rtlName> <coreName/> </Obj> <bitwidth>9</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>65</item> </oprand_edges> <opcode>sext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>12</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_14"> <Value> <Obj> <type>0</type> <id>14</id> <name>ush</name> <fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName> <fileDirectory>../../../../../wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory> <lineNumber>18</lineNumber> <contextFuncName>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</second> </first> <second>18</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, float&amp;gt;</second> </first> <second>117</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first> <second>__hls_fptosi_float_i32</second> </first> <second>51</second> </item> </second> </item> </inlineStackInfo> <originalName>sh</originalName> <rtlName>ush_fu_112_p3</rtlName> <coreName/> </Obj> <bitwidth>9</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>66</item> <item>67</item> <item>68</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.72</m_delay> <m_topoIndex>13</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_15"> <Value> <Obj> <type>0</type> <id>15</id> <name>sext_ln1311_1</name> <fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName> <fileDirectory>../../../../../wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory> <lineNumber>18</lineNumber> <contextFuncName>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</second> </first> <second>18</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, float&amp;gt;</second> </first> <second>117</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first> <second>__hls_fptosi_float_i32</second> </first> <second>51</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>sext_ln1311_1_fu_120_p1</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>69</item> </oprand_edges> <opcode>sext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>14</m_topoIndex> <m_clusterGroupNumber>1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_16"> <Value> <Obj> <type>0</type> <id>16</id> <name>sext_ln1311_2</name> <fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName> <fileDirectory>../../../../../wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory> <lineNumber>18</lineNumber> <contextFuncName>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</second> </first> <second>18</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, float&amp;gt;</second> </first> <second>117</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first> <second>__hls_fptosi_float_i32</second> </first> <second>51</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>sext_ln1311_2_fu_124_p1</rtlName> <coreName/> </Obj> <bitwidth>25</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>70</item> </oprand_edges> <opcode>sext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>15</m_topoIndex> <m_clusterGroupNumber>1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_17"> <Value> <Obj> <type>0</type> <id>17</id> <name>zext_ln1287</name> <fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName> <fileDirectory>../../../../../wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory> <lineNumber>18</lineNumber> <contextFuncName>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</second> </first> <second>18</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, float&amp;gt;</second> </first> <second>117</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first> <second>__hls_fptosi_float_i32</second> </first> <second>51</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>zext_ln1287_fu_128_p1</rtlName> <coreName/> </Obj> <bitwidth>79</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>71</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>16</m_topoIndex> <m_clusterGroupNumber>1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_18"> <Value> <Obj> <type>0</type> <id>18</id> <name>r_V</name> <fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName> <fileDirectory>../../../../../wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory> <lineNumber>18</lineNumber> <contextFuncName>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</second> </first> <second>18</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, float&amp;gt;</second> </first> <second>117</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first> <second>__hls_fptosi_float_i32</second> </first> <second>51</second> </item> </second> </item> </inlineStackInfo> <originalName>r.V</originalName> <rtlName>r_V_fu_132_p2</rtlName> <coreName/> </Obj> <bitwidth>25</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>72</item> <item>73</item> </oprand_edges> <opcode>lshr</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>17</m_topoIndex> <m_clusterGroupNumber>1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_19"> <Value> <Obj> <type>0</type> <id>19</id> <name>r_V_1</name> <fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName> <fileDirectory>../../../../../wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory> <lineNumber>18</lineNumber> <contextFuncName>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</second> </first> <second>18</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, float&amp;gt;</second> </first> <second>117</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first> <second>__hls_fptosi_float_i32</second> </first> <second>51</second> </item> </second> </item> </inlineStackInfo> <originalName>r.V</originalName> <rtlName>r_V_1_fu_138_p2</rtlName> <coreName/> </Obj> <bitwidth>79</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>74</item> <item>75</item> </oprand_edges> <opcode>shl</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>18</m_topoIndex> <m_clusterGroupNumber>1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_20"> <Value> <Obj> <type>0</type> <id>20</id> <name>tmp</name> <fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName> <fileDirectory>../../../../../wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory> <lineNumber>21</lineNumber> <contextFuncName>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</second> </first> <second>21</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, float&amp;gt;</second> </first> <second>117</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first> <second>__hls_fptosi_float_i32</second> </first> <second>51</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_fu_144_p3</rtlName> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>77</item> <item>78</item> <item>80</item> </oprand_edges> <opcode>bitselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>19</m_topoIndex> <m_clusterGroupNumber>1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_21"> <Value> <Obj> <type>0</type> <id>21</id> <name>zext_ln662</name> <fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName> <fileDirectory>../../../../../wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory> <lineNumber>21</lineNumber> <contextFuncName>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</second> </first> <second>21</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, float&amp;gt;</second> </first> <second>117</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first> <second>__hls_fptosi_float_i32</second> </first> <second>51</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>zext_ln662_fu_152_p1</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>81</item> </oprand_edges> <opcode>zext</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>20</m_topoIndex> <m_clusterGroupNumber>1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_22"> <Value> <Obj> <type>0</type> <id>22</id> <name>tmp_17</name> <fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName> <fileDirectory>../../../../../wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory> <lineNumber>21</lineNumber> <contextFuncName>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</second> </first> <second>21</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, float&amp;gt;</second> </first> <second>117</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first> <second>__hls_fptosi_float_i32</second> </first> <second>51</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName>tmp_17_fu_156_p4</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>83</item> <item>84</item> <item>85</item> <item>87</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>21</m_topoIndex> <m_clusterGroupNumber>1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_23"> <Value> <Obj> <type>0</type> <id>23</id> <name>p_Val2_5</name> <fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName> <fileDirectory>../../../../../wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory> <lineNumber>18</lineNumber> <contextFuncName>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</second> </first> <second>18</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, float&amp;gt;</second> </first> <second>117</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first> <second>__hls_fptosi_float_i32</second> </first> <second>51</second> </item> </second> </item> </inlineStackInfo> <originalName>__Val2__</originalName> <rtlName>p_Val2_5_fu_166_p3</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>88</item> <item>89</item> <item>90</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>2.96</m_delay> <m_topoIndex>22</m_topoIndex> <m_clusterGroupNumber>1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_24"> <Value> <Obj> <type>0</type> <id>24</id> <name>result_V_1</name> <fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName> <fileDirectory>../../../../../wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</second> </first> <second>59</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, float&amp;gt;</second> </first> <second>117</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first> <second>__hls_fptosi_float_i32</second> </first> <second>51</second> </item> </second> </item> </inlineStackInfo> <originalName>result.V</originalName> <rtlName>result_V_1_fu_174_p2</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>92</item> <item>93</item> </oprand_edges> <opcode>sub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.89</m_delay> <m_topoIndex>23</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_25"> <Value> <Obj> <type>0</type> <id>25</id> <name>p_Val2_6</name> <fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</fileName> <fileDirectory>../../../../../wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory> <lineNumber>59</lineNumber> <contextFuncName>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, 6, float&amp;gt;</second> </first> <second>59</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_case_IEEE754.h</first> <second>generic_cast_IEEE754&amp;lt;int, float&amp;gt;</second> </first> <second>117</second> </item> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first> <second>__hls_fptosi_float_i32</second> </first> <second>51</second> </item> </second> </item> </inlineStackInfo> <originalName>__Val2__</originalName> <rtlName>ap_return</rtlName> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>94</item> <item>95</item> <item>96</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.70</m_delay> <m_topoIndex>24</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_26"> <Value> <Obj> <type>0</type> <id>26</id> <name>_ln51</name> <fileName>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</fileName> <fileDirectory>../../../../../wrk/2019.2/continuous/2019_11_06_2708876/src/products</fileDirectory> <lineNumber>51</lineNumber> <contextFuncName>__hls_fptosi_float_i32</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/wrk/2019.2/continuous/2019_11_06_2708876/src/products/hls/hls_lib/hlsmath/src/lib_floatconversion.cpp</first> <second>__hls_fptosi_float_i32</second> </first> <second>51</second> </item> </second> </item> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>97</item> </oprand_edges> <opcode>ret</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>25</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> </nodes> <consts class_id="15" tracking_level="0" version="0"> <count>11</count> <item_version>0</item_version> <item class_id="16" tracking_level="1" version="0" object_id="_27"> <Value> <Obj> <type>2</type> <id>35</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>31</content> </item> <item class_id_reference="16" object_id="_28"> <Value> <Obj> <type>2</type> <id>40</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>23</content> </item> <item class_id_reference="16" object_id="_29"> <Value> <Obj> <type>2</type> <id>42</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>30</content> </item> <item class_id_reference="16" object_id="_30"> <Value> <Obj> <type>2</type> <id>47</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <const_type>0</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_31"> <Value> <Obj> <type>2</type> <id>50</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>1</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_32"> <Value> <Obj> <type>2</type> <id>54</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>9</bitwidth> </Value> <const_type>0</const_type> <content>385</content> </item> <item class_id_reference="16" object_id="_33"> <Value> <Obj> <type>2</type> <id>60</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>8</content> </item> <item class_id_reference="16" object_id="_34"> <Value> <Obj> <type>2</type> <id>62</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>8</bitwidth> </Value> <const_type>0</const_type> <content>127</content> </item> <item class_id_reference="16" object_id="_35"> <Value> <Obj> <type>2</type> <id>79</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>24</content> </item> <item class_id_reference="16" object_id="_36"> <Value> <Obj> <type>2</type> <id>86</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>55</content> </item> <item class_id_reference="16" object_id="_37"> <Value> <Obj> <type>2</type> <id>91</id> <name>empty</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> </consts> <blocks class_id="17" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="18" tracking_level="1" version="0" object_id="_38"> <Obj> <type>3</type> <id>27</id> <name>__hls_fptosi_float_i</name> <fileName/> <fileDirectory/> <lineNumber>0</lineNumber> <contextFuncName/> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName/> <rtlName/> <coreName/> </Obj> <node_objs> <count>25</count> <item_version>0</item_version> <item>2</item> <item>3</item> <item>4</item> <item>5</item> <item>6</item> <item>7</item> <item>8</item> <item>9</item> <item>10</item> <item>11</item> <item>12</item> <item>13</item> <item>14</item> <item>15</item> <item>16</item> <item>17</item> <item>18</item> <item>19</item> <item>20</item> <item>21</item> <item>22</item> <item>23</item> <item>24</item> <item>25</item> <item>26</item> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>45</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_39"> <id>30</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>2</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_40"> <id>31</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>3</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_41"> <id>34</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>4</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_42"> <id>36</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>4</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_43"> <id>39</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>5</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_44"> <id>41</id> <edge_type>1</edge_type> <source_obj>40</source_obj> <sink_obj>5</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_45"> <id>43</id> <edge_type>1</edge_type> <source_obj>42</source_obj> <sink_obj>5</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_46"> <id>44</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>6</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_47"> <id>48</id> <edge_type>1</edge_type> <source_obj>47</source_obj> <sink_obj>7</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_48"> <id>49</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>7</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_49"> <id>51</id> <edge_type>1</edge_type> <source_obj>50</source_obj> <sink_obj>7</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_50"> <id>52</id> <edge_type>1</edge_type> <source_obj>7</source_obj> <sink_obj>8</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_51"> <id>53</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>9</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_52"> <id>55</id> <edge_type>1</edge_type> <source_obj>54</source_obj> <sink_obj>10</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_53"> <id>56</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>10</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_54"> <id>59</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>11</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_55"> <id>61</id> <edge_type>1</edge_type> <source_obj>60</source_obj> <sink_obj>11</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_56"> <id>63</id> <edge_type>1</edge_type> <source_obj>62</source_obj> <sink_obj>12</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_57"> <id>64</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>12</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_58"> <id>65</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>13</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_59"> <id>66</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>14</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_60"> <id>67</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>14</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_61"> <id>68</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>14</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_62"> <id>69</id> <edge_type>1</edge_type> <source_obj>14</source_obj> <sink_obj>15</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_63"> <id>70</id> <edge_type>1</edge_type> <source_obj>14</source_obj> <sink_obj>16</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_64"> <id>71</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>17</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_65"> <id>72</id> <edge_type>1</edge_type> <source_obj>7</source_obj> <sink_obj>18</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_66"> <id>73</id> <edge_type>1</edge_type> <source_obj>16</source_obj> <sink_obj>18</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_67"> <id>74</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>19</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_68"> <id>75</id> <edge_type>1</edge_type> <source_obj>17</source_obj> <sink_obj>19</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_69"> <id>78</id> <edge_type>1</edge_type> <source_obj>18</source_obj> <sink_obj>20</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_70"> <id>80</id> <edge_type>1</edge_type> <source_obj>79</source_obj> <sink_obj>20</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_71"> <id>81</id> <edge_type>1</edge_type> <source_obj>20</source_obj> <sink_obj>21</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_72"> <id>84</id> <edge_type>1</edge_type> <source_obj>19</source_obj> <sink_obj>22</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_73"> <id>85</id> <edge_type>1</edge_type> <source_obj>79</source_obj> <sink_obj>22</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_74"> <id>87</id> <edge_type>1</edge_type> <source_obj>86</source_obj> <sink_obj>22</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_75"> <id>88</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>23</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_76"> <id>89</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>23</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_77"> <id>90</id> <edge_type>1</edge_type> <source_obj>22</source_obj> <sink_obj>23</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_78"> <id>92</id> <edge_type>1</edge_type> <source_obj>91</source_obj> <sink_obj>24</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_79"> <id>93</id> <edge_type>1</edge_type> <source_obj>23</source_obj> <sink_obj>24</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_80"> <id>94</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>25</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_81"> <id>95</id> <edge_type>1</edge_type> <source_obj>24</source_obj> <sink_obj>25</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_82"> <id>96</id> <edge_type>1</edge_type> <source_obj>23</source_obj> <sink_obj>25</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_83"> <id>97</id> <edge_type>1</edge_type> <source_obj>25</source_obj> <sink_obj>26</sink_obj> <is_back_edge>0</is_back_edge> </item> </edges> </cdfg> <cdfg_regions class_id="21" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="22" tracking_level="1" version="0" object_id="_84"> <mId>1</mId> <mTag>__hls_fptosi_float_i</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>27</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>0</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"/> </item> </cdfg_regions> <fsm class_id="24" tracking_level="1" version="0" object_id="_85"> <states class_id="25" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="26" tracking_level="1" version="0" object_id="_86"> <id>1</id> <operations class_id="27" tracking_level="0" version="0"> <count>25</count> <item_version>0</item_version> <item class_id="28" tracking_level="1" version="0" object_id="_87"> <id>2</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_88"> <id>3</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_89"> <id>4</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_90"> <id>5</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_91"> <id>6</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_92"> <id>7</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_93"> <id>8</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_94"> <id>9</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_95"> <id>10</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_96"> <id>11</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_97"> <id>12</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_98"> <id>13</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_99"> <id>14</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_100"> <id>15</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_101"> <id>16</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_102"> <id>17</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_103"> <id>18</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_104"> <id>19</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_105"> <id>20</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_106"> <id>21</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_107"> <id>22</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_108"> <id>23</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_109"> <id>24</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_110"> <id>25</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_111"> <id>26</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> </states> <transitions class_id="29" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </transitions> </fsm> <res class_id="30" tracking_level="1" version="0" object_id="_112"> <dp_component_resource class_id="31" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_component_resource> <dp_expression_resource> <count>8</count> <item_version>0</item_version> <item class_id="32" tracking_level="0" version="0"> <first>add_ln339_fu_88_p2 ( + ) </first> <second class_id="33" tracking_level="0" version="0"> <count>4</count> <item_version>0</item_version> <item class_id="34" tracking_level="0" version="0"> <first>(0P0)</first> <second>8</second> </item> <item> <first>(1P1)</first> <second>9</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>9</second> </item> </second> </item> <item> <first>ap_return ( select ) </first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>1</second> </item> <item> <first>(1P1)</first> <second>32</second> </item> <item> <first>(2P2)</first> <second>32</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>32</second> </item> </second> </item> <item> <first>p_Val2_5_fu_166_p3 ( select ) </first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>1</second> </item> <item> <first>(1P1)</first> <second>32</second> </item> <item> <first>(2P2)</first> <second>32</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>32</second> </item> </second> </item> <item> <first>r_V_1_fu_138_p2 ( shl ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>79</second> </item> <item> <first>(1P1)</first> <second>79</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>243</second> </item> </second> </item> <item> <first>r_V_fu_132_p2 ( lshr ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>25</second> </item> <item> <first>(1P1)</first> <second>25</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>66</second> </item> </second> </item> <item> <first>result_V_1_fu_174_p2 ( - ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>1</second> </item> <item> <first>(1P1)</first> <second>32</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>32</second> </item> </second> </item> <item> <first>sub_ln1311_fu_102_p2 ( - ) </first> <second> <count>4</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>7</second> </item> <item> <first>(1P1)</first> <second>8</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>8</second> </item> </second> </item> <item> <first>ush_fu_112_p3 ( select ) </first> <second> <count>5</count> <item_version>0</item_version> <item> <first>(0P0)</first> <second>1</second> </item> <item> <first>(1P1)</first> <second>9</second> </item> <item> <first>(2P2)</first> <second>9</second> </item> <item> <first>FF</first> <second>0</second> </item> <item> <first>LUT</first> <second>9</second> </item> </second> </item> </dp_expression_resource> <dp_fifo_resource> <count>0</count> <item_version>0</item_version> </dp_fifo_resource> <dp_memory_resource> <count>0</count> <item_version>0</item_version> </dp_memory_resource> <dp_multiplexer_resource> <count>0</count> <item_version>0</item_version> </dp_multiplexer_resource> <dp_register_resource> <count>0</count> <item_version>0</item_version> </dp_register_resource> <dp_dsp_resource> <count>0</count> <item_version>0</item_version> </dp_dsp_resource> <dp_component_map class_id="35" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_component_map> <dp_expression_map> <count>8</count> <item_version>0</item_version> <item class_id="36" tracking_level="0" version="0"> <first>add_ln339_fu_88_p2 ( + ) </first> <second> <count>1</count> <item_version>0</item_version> <item>10</item> </second> </item> <item> <first>ap_return ( select ) </first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>p_Val2_5_fu_166_p3 ( select ) </first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>r_V_1_fu_138_p2 ( shl ) </first> <second> <count>1</count> <item_version>0</item_version> <item>19</item> </second> </item> <item> <first>r_V_fu_132_p2 ( lshr ) </first> <second> <count>1</count> <item_version>0</item_version> <item>18</item> </second> </item> <item> <first>result_V_1_fu_174_p2 ( - ) </first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>sub_ln1311_fu_102_p2 ( - ) </first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>ush_fu_112_p3 ( select ) </first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> </dp_expression_map> <dp_fifo_map> <count>0</count> <item_version>0</item_version> </dp_fifo_map> <dp_memory_map> <count>0</count> <item_version>0</item_version> </dp_memory_map> </res> <node_label_latency class_id="37" tracking_level="0" version="0"> <count>25</count> <item_version>0</item_version> <item class_id="38" tracking_level="0" version="0"> <first>2</first> <second class_id="39" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>3</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>4</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>5</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>6</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>7</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>8</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>9</first> <second> <first>0</first> <second>0</second> </second> </item> <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>12</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>13</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>14</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> <item> <first>17</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>18</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>19</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>20</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>21</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>22</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>23</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>24</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>25</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>26</first> <second> <first>0</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="40" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="41" tracking_level="0" version="0"> <first>27</first> <second class_id="42" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> </bblk_ent_exit> <regions class_id="43" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </regions> <dp_fu_nodes class_id="44" tracking_level="0" version="0"> <count>24</count> <item_version>0</item_version> <item class_id="45" tracking_level="0" version="0"> <first>38</first> <second> <count>1</count> <item_version>0</item_version> <item>2</item> </second> </item> <item> <first>44</first> <second> <count>1</count> <item_version>0</item_version> <item>3</item> </second> </item> <item> <first>48</first> <second> <count>1</count> <item_version>0</item_version> <item>4</item> </second> </item> <item> <first>56</first> <second> <count>1</count> <item_version>0</item_version> <item>5</item> </second> </item> <item> <first>66</first> <second> <count>1</count> <item_version>0</item_version> <item>6</item> </second> </item> <item> <first>70</first> <second> <count>1</count> <item_version>0</item_version> <item>7</item> </second> </item> <item> <first>80</first> <second> <count>1</count> <item_version>0</item_version> <item>8</item> </second> </item> <item> <first>84</first> <second> <count>1</count> <item_version>0</item_version> <item>9</item> </second> </item> <item> <first>88</first> <second> <count>1</count> <item_version>0</item_version> <item>10</item> </second> </item> <item> <first>94</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> <item> <first>102</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>108</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>112</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> <item> <first>120</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>124</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>128</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> <item> <first>132</first> <second> <count>1</count> <item_version>0</item_version> <item>18</item> </second> </item> <item> <first>138</first> <second> <count>1</count> <item_version>0</item_version> <item>19</item> </second> </item> <item> <first>144</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>152</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>156</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> <item> <first>166</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>174</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>180</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> </dp_fu_nodes> <dp_fu_nodes_expression class_id="47" tracking_level="0" version="0"> <count>23</count> <item_version>0</item_version> <item class_id="48" tracking_level="0" version="0"> <first>add_ln339_fu_88</first> <second> <count>1</count> <item_version>0</item_version> <item>10</item> </second> </item> <item> <first>isNeg_fu_94</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> <item> <first>mantissa_V_fu_70</first> <second> <count>1</count> <item_version>0</item_version> <item>7</item> </second> </item> <item> <first>p_Result_s_fu_48</first> <second> <count>1</count> <item_version>0</item_version> <item>4</item> </second> </item> <item> <first>p_Val2_5_fu_166</first> <second> <count>1</count> <item_version>0</item_version> <item>23</item> </second> </item> <item> <first>p_Val2_6_fu_180</first> <second> <count>1</count> <item_version>0</item_version> <item>25</item> </second> </item> <item> <first>p_Val2_s_fu_44</first> <second> <count>1</count> <item_version>0</item_version> <item>3</item> </second> </item> <item> <first>r_V_1_fu_138</first> <second> <count>1</count> <item_version>0</item_version> <item>19</item> </second> </item> <item> <first>r_V_fu_132</first> <second> <count>1</count> <item_version>0</item_version> <item>18</item> </second> </item> <item> <first>result_V_1_fu_174</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>sext_ln1311_1_fu_120</first> <second> <count>1</count> <item_version>0</item_version> <item>15</item> </second> </item> <item> <first>sext_ln1311_2_fu_124</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>sext_ln1311_fu_108</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>sub_ln1311_fu_102</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>tmp_17_fu_156</first> <second> <count>1</count> <item_version>0</item_version> <item>22</item> </second> </item> <item> <first>tmp_V_1_fu_66</first> <second> <count>1</count> <item_version>0</item_version> <item>6</item> </second> </item> <item> <first>tmp_V_fu_56</first> <second> <count>1</count> <item_version>0</item_version> <item>5</item> </second> </item> <item> <first>tmp_fu_144</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>ush_fu_112</first> <second> <count>1</count> <item_version>0</item_version> <item>14</item> </second> </item> <item> <first>zext_ln1287_fu_128</first> <second> <count>1</count> <item_version>0</item_version> <item>17</item> </second> </item> <item> <first>zext_ln339_fu_84</first> <second> <count>1</count> <item_version>0</item_version> <item>9</item> </second> </item> <item> <first>zext_ln662_fu_152</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>zext_ln682_fu_80</first> <second> <count>1</count> <item_version>0</item_version> <item>8</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>1</count> <item_version>0</item_version> <item> <first>x_read_read_fu_38</first> <second> <count>1</count> <item_version>0</item_version> <item>2</item> </second> </item> </dp_fu_nodes_io> <return_ports> <count>1</count> <item_version>0</item_version> <item> <first>ap_return</first> <second> <count>1</count> <item_version>0</item_version> <item>26</item> </second> </item> </return_ports> <dp_mem_port_nodes class_id="49" 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="50" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="51" tracking_level="0" version="0"> <first>x</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>2</item> </second> </item> </second> </item> </dp_port_io_nodes> <port2core class_id="52" 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>
36.838539
154
0.486651
57c1ff93151b68a1a8f6242704e6b5ba032c1fbc
13,595
ads
Ada
libs/zlib/contrib/ada/zlib.ads
dpt/PrivateEye
c84406e33d231189b5b2a550026a74ee76715b71
[ "BSD-2-Clause" ]
12
2016-08-24T20:40:07.000Z
2022-02-01T01:46:31.000Z
libs/zlib/contrib/ada/zlib.ads
dpt/PrivateEye
c84406e33d231189b5b2a550026a74ee76715b71
[ "BSD-2-Clause" ]
7
2021-02-22T00:14:55.000Z
2022-02-04T22:02:06.000Z
libs/zlib/contrib/ada/zlib.ads
dpt/PrivateEye
c84406e33d231189b5b2a550026a74ee76715b71
[ "BSD-2-Clause" ]
1
2019-11-08T16:46:38.000Z
2019-11-08T16:46:38.000Z
------------------------------------------------------------------------------ -- ZLib for Ada thick binding. -- -- -- -- Copyright (C) 2002-2004 Dmitriy Anisimkov -- -- -- -- This library is free software; you can redistribute it and/or modify -- -- it under the terms of the GNU General Public License as published by -- -- the Free Software Foundation; either version 2 of the License, or (at -- -- your option) any later version. -- -- -- -- This library is distributed in the hope that it will be useful, but -- -- WITHOUT ANY WARRANTY; without even the implied warranty of -- -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU -- -- General Public License for more details. -- -- -- -- You should have received a copy of the GNU General Public License -- -- along with this library; if not, write to the Free Software Foundation, -- -- Inc., 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. -- ------------------------------------------------------------------------------ -- $Id: zlib.ads,v 1.1.1.1 2005-10-29 18:01:49 dpt Exp $ with Ada.Streams; with Interfaces; package ZLib is ZLib_Error : exception; Status_Error : exception; type Compression_Level is new Integer range -1 .. 9; type Flush_Mode is private; type Compression_Method is private; type Window_Bits_Type is new Integer range 8 .. 15; type Memory_Level_Type is new Integer range 1 .. 9; type Unsigned_32 is new Interfaces.Unsigned_32; type Strategy_Type is private; type Header_Type is (None, Auto, Default, GZip); -- Header type usage have a some limitation for inflate. -- See comment for Inflate_Init. subtype Count is Ada.Streams.Stream_Element_Count; Default_Memory_Level : constant Memory_Level_Type := 8; Default_Window_Bits : constant Window_Bits_Type := 15; ---------------------------------- -- Compression method constants -- ---------------------------------- Deflated : constant Compression_Method; -- Only one method allowed in this ZLib version --------------------------------- -- Compression level constants -- --------------------------------- No_Compression : constant Compression_Level := 0; Best_Speed : constant Compression_Level := 1; Best_Compression : constant Compression_Level := 9; Default_Compression : constant Compression_Level := -1; -------------------------- -- Flush mode constants -- -------------------------- No_Flush : constant Flush_Mode; -- Regular way for compression, no flush Partial_Flush : constant Flush_Mode; -- Will be removed, use Z_SYNC_FLUSH instead Sync_Flush : constant Flush_Mode; -- All pending output is flushed to the output buffer and the output -- is aligned on a byte boundary, so that the decompressor can get all -- input data available so far. (In particular avail_in is zero after the -- call if enough output space has been provided before the call.) -- Flushing may degrade compression for some compression algorithms and so -- it should be used only when necessary. Block_Flush : constant Flush_Mode; -- Z_BLOCK requests that inflate() stop -- if and when it get to the next deflate block boundary. When decoding the -- zlib or gzip format, this will cause inflate() to return immediately -- after the header and before the first block. When doing a raw inflate, -- inflate() will go ahead and process the first block, and will return -- when it gets to the end of that block, or when it runs out of data. Full_Flush : constant Flush_Mode; -- All output is flushed as with SYNC_FLUSH, and the compression state -- is reset so that decompression can restart from this point if previous -- compressed data has been damaged or if random access is desired. Using -- Full_Flush too often can seriously degrade the compression. Finish : constant Flush_Mode; -- Just for tell the compressor that input data is complete. ------------------------------------ -- Compression strategy constants -- ------------------------------------ -- RLE stategy could be used only in version 1.2.0 and later. Filtered : constant Strategy_Type; Huffman_Only : constant Strategy_Type; RLE : constant Strategy_Type; Default_Strategy : constant Strategy_Type; Default_Buffer_Size : constant := 4096; type Filter_Type is tagged limited private; -- The filter is for compression and for decompression. -- The usage of the type is depend of its initialization. function Version return String; pragma Inline (Version); -- Return string representation of the ZLib version. procedure Deflate_Init (Filter : in out Filter_Type; Level : in Compression_Level := Default_Compression; Strategy : in Strategy_Type := Default_Strategy; Method : in Compression_Method := Deflated; Window_Bits : in Window_Bits_Type := Default_Window_Bits; Memory_Level : in Memory_Level_Type := Default_Memory_Level; Header : in Header_Type := Default); -- Compressor initialization. -- When Header parameter is Auto or Default, then default zlib header -- would be provided for compressed data. -- When Header is GZip, then gzip header would be set instead of -- default header. -- When Header is None, no header would be set for compressed data. procedure Inflate_Init (Filter : in out Filter_Type; Window_Bits : in Window_Bits_Type := Default_Window_Bits; Header : in Header_Type := Default); -- Decompressor initialization. -- Default header type mean that ZLib default header is expecting in the -- input compressed stream. -- Header type None mean that no header is expecting in the input stream. -- GZip header type mean that GZip header is expecting in the -- input compressed stream. -- Auto header type mean that header type (GZip or Native) would be -- detected automatically in the input stream. -- Note that header types parameter values None, GZip and Auto are -- supported for inflate routine only in ZLib versions 1.2.0.2 and later. -- Deflate_Init is supporting all header types. function Is_Open (Filter : in Filter_Type) return Boolean; pragma Inline (Is_Open); -- Is the filter opened for compression or decompression. procedure Close (Filter : in out Filter_Type; Ignore_Error : in Boolean := False); -- Closing the compression or decompressor. -- If stream is closing before the complete and Ignore_Error is False, -- The exception would be raised. generic with procedure Data_In (Item : out Ada.Streams.Stream_Element_Array; Last : out Ada.Streams.Stream_Element_Offset); with procedure Data_Out (Item : in Ada.Streams.Stream_Element_Array); procedure Generic_Translate (Filter : in out Filter_Type; In_Buffer_Size : in Integer := Default_Buffer_Size; Out_Buffer_Size : in Integer := Default_Buffer_Size); -- Compress/decompress data fetch from Data_In routine and pass the result -- to the Data_Out routine. User should provide Data_In and Data_Out -- for compression/decompression data flow. -- Compression or decompression depend on Filter initialization. function Total_In (Filter : in Filter_Type) return Count; pragma Inline (Total_In); -- Returns total number of input bytes read so far function Total_Out (Filter : in Filter_Type) return Count; pragma Inline (Total_Out); -- Returns total number of bytes output so far function CRC32 (CRC : in Unsigned_32; Data : in Ada.Streams.Stream_Element_Array) return Unsigned_32; pragma Inline (CRC32); -- Compute CRC32, it could be necessary for make gzip format procedure CRC32 (CRC : in out Unsigned_32; Data : in Ada.Streams.Stream_Element_Array); pragma Inline (CRC32); -- Compute CRC32, it could be necessary for make gzip format ------------------------------------------------- -- Below is more complex low level routines. -- ------------------------------------------------- procedure Translate (Filter : in out Filter_Type; In_Data : in Ada.Streams.Stream_Element_Array; In_Last : out Ada.Streams.Stream_Element_Offset; Out_Data : out Ada.Streams.Stream_Element_Array; Out_Last : out Ada.Streams.Stream_Element_Offset; Flush : in Flush_Mode); -- Compress/decompress the In_Data buffer and place the result into -- Out_Data. In_Last is the index of last element from In_Data accepted by -- the Filter. Out_Last is the last element of the received data from -- Filter. To tell the filter that incoming data are complete put the -- Flush parameter to Finish. function Stream_End (Filter : in Filter_Type) return Boolean; pragma Inline (Stream_End); -- Return the true when the stream is complete. procedure Flush (Filter : in out Filter_Type; Out_Data : out Ada.Streams.Stream_Element_Array; Out_Last : out Ada.Streams.Stream_Element_Offset; Flush : in Flush_Mode); pragma Inline (Flush); -- Flushing the data from the compressor. generic with procedure Write (Item : in Ada.Streams.Stream_Element_Array); -- User should provide this routine for accept -- compressed/decompressed data. Buffer_Size : in Ada.Streams.Stream_Element_Offset := Default_Buffer_Size; -- Buffer size for Write user routine. procedure Write (Filter : in out Filter_Type; Item : in Ada.Streams.Stream_Element_Array; Flush : in Flush_Mode := No_Flush); -- Compress/Decompress data from Item to the generic parameter procedure -- Write. Output buffer size could be set in Buffer_Size generic parameter. generic with procedure Read (Item : out Ada.Streams.Stream_Element_Array; Last : out Ada.Streams.Stream_Element_Offset); -- User should provide data for compression/decompression -- thru this routine. Buffer : in out Ada.Streams.Stream_Element_Array; -- Buffer for keep remaining data from the previous -- back read. Rest_First, Rest_Last : in out Ada.Streams.Stream_Element_Offset; -- Rest_First have to be initialized to Buffer'Last + 1 -- Rest_Last have to be initialized to Buffer'Last -- before usage. Allow_Read_Some : in Boolean := False; -- Is it allowed to return Last < Item'Last before end of data. procedure Read (Filter : in out Filter_Type; Item : out Ada.Streams.Stream_Element_Array; Last : out Ada.Streams.Stream_Element_Offset; Flush : in Flush_Mode := No_Flush); -- Compress/Decompress data from generic parameter procedure Read to the -- Item. User should provide Buffer and initialized Rest_First, Rest_Last -- indicators. If Allow_Read_Some is True, Read routines could return -- Last < Item'Last only at end of stream. private use Ada.Streams; pragma Assert (Ada.Streams.Stream_Element'Size = 8); pragma Assert (Ada.Streams.Stream_Element'Modulus = 2**8); type Flush_Mode is new Integer range 0 .. 5; type Compression_Method is new Integer range 8 .. 8; type Strategy_Type is new Integer range 0 .. 3; No_Flush : constant Flush_Mode := 0; Partial_Flush : constant Flush_Mode := 1; Sync_Flush : constant Flush_Mode := 2; Full_Flush : constant Flush_Mode := 3; Finish : constant Flush_Mode := 4; Block_Flush : constant Flush_Mode := 5; Filtered : constant Strategy_Type := 1; Huffman_Only : constant Strategy_Type := 2; RLE : constant Strategy_Type := 3; Default_Strategy : constant Strategy_Type := 0; Deflated : constant Compression_Method := 8; type Z_Stream; type Z_Stream_Access is access all Z_Stream; type Filter_Type is tagged limited record Strm : Z_Stream_Access; Compression : Boolean; Stream_End : Boolean; Header : Header_Type; CRC : Unsigned_32; Offset : Stream_Element_Offset; -- Offset for gzip header/footer output. end record; end ZLib;
41.322188
79
0.629423
9a27b884a101d9dfa9d1884d5e6de880d94949fa
2,632
ads
Ada
awa/samples/src/atlas-microblog-beans.ads
Letractively/ada-awa
3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe
[ "Apache-2.0" ]
null
null
null
awa/samples/src/atlas-microblog-beans.ads
Letractively/ada-awa
3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe
[ "Apache-2.0" ]
null
null
null
awa/samples/src/atlas-microblog-beans.ads
Letractively/ada-awa
3c82a4d29ed6c1209a2ac7d5fe123c142f3cffbe
[ "Apache-2.0" ]
null
null
null
----------------------------------------------------------------------- -- atlas-microblog-beans -- Beans for module microblog -- Copyright (C) 2012 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- with Ada.Strings.Unbounded; with Util.Beans.Basic; with Util.Beans.Objects; with Util.Beans.Methods; with Atlas.Microblog.Modules; with Atlas.Microblog.Models; package Atlas.Microblog.Beans is type Microblog_Bean is new Util.Beans.Basic.Bean and Util.Beans.Methods.Method_Bean with record Module : Atlas.Microblog.Modules.Microblog_Module_Access := null; Post : Atlas.Microblog.Models.Mblog_Ref; end record; type Microblog_Bean_Access is access all Microblog_Bean'Class; -- Get the value identified by the name. overriding function Get_Value (From : in Microblog_Bean; Name : in String) return Util.Beans.Objects.Object; -- Set the value identified by the name. overriding procedure Set_Value (From : in out Microblog_Bean; Name : in String; Value : in Util.Beans.Objects.Object); -- This bean provides some methods that can be used in a Method_Expression overriding function Get_Method_Bindings (From : in Microblog_Bean) return Util.Beans.Methods.Method_Binding_Array_Access; -- Post the microblog procedure Post (Bean : in out Microblog_Bean; Outcome : in out Ada.Strings.Unbounded.Unbounded_String); -- Create the Microblog_Bean bean instance. function Create_Microblog_Bean (Module : in Atlas.Microblog.Modules.Microblog_Module_Access) return Util.Beans.Basic.Readonly_Bean_Access; -- Create the a bean to display the list of microblog posts. function Create_List_Bean (Module : in Atlas.Microblog.Modules.Microblog_Module_Access) return Util.Beans.Basic.Readonly_Bean_Access; end Atlas.Microblog.Beans;
41.125
95
0.670593
adf69c4c02ca5984dbe9283cd3a0e31cd9332721
2,979
adb
Ada
examples/tcp_servers.adb
reznikmm/coroutines
52dd5d483f09d69cdc133910e49d13664cf05d80
[ "MIT" ]
3
2019-11-11T06:35:21.000Z
2019-11-13T13:34:56.000Z
examples/tcp_servers.adb
reznikmm/coroutines
52dd5d483f09d69cdc133910e49d13664cf05d80
[ "MIT" ]
null
null
null
examples/tcp_servers.adb
reznikmm/coroutines
52dd5d483f09d69cdc133910e49d13664cf05d80
[ "MIT" ]
null
null
null
-- Copyright (c) 2019 Maxim Reznik <[email protected]> -- -- SPDX-License-Identifier: MIT -- License-Filename: LICENSE ------------------------------------------------------------- with Ada.Exceptions; with Ada.Text_IO; with Coroutines.Polling; package body TCP_Servers is type Listener_Arguments is record Port : GNAT.Sockets.Port_Type; Run : not null TCP_Coroutine; Stack : System.Storage_Elements.Storage_Count; end record; procedure Listen (Args : Listener_Arguments); ------------ -- Listen -- ------------ procedure Listen (Args : Listener_Arguments) is procedure Start is new Coroutines.Generic_Start (GNAT.Sockets.Socket_Type); Address : GNAT.Sockets.Sock_Addr_Type := (Family => GNAT.Sockets.Family_Inet, Addr => GNAT.Sockets.Any_Inet_Addr, Port => Args.Port); Server : GNAT.Sockets.Socket_Type; Dont_Block : GNAT.Sockets.Request_Type := (Name => GNAT.Sockets.Non_Blocking_IO, Enabled => True); begin GNAT.Sockets.Create_Socket (Server); GNAT.Sockets.Set_Socket_Option (Server, GNAT.Sockets.Socket_Level, (GNAT.Sockets.Reuse_Address, True)); GNAT.Sockets.Control_Socket (Server, Dont_Block); GNAT.Sockets.Bind_Socket (Server, Address); declare Socket : GNAT.Sockets.Socket_Type; begin GNAT.Sockets.Listen_Socket (Server); loop -- Wait a Server socket event Coroutines.Yield (Coroutines.Polling.Watch (Coroutines.Polling.FD (GNAT.Sockets.To_C (Server)), (Coroutines.Polling.Input | Coroutines.Polling.Error | Coroutines.Polling.Close => True, others => False))); begin GNAT.Sockets.Accept_Socket (Server, Socket, Address); Start (Args.Run, Args.Stack, Socket); exception when E : GNAT.Sockets.Socket_Error => if GNAT.Sockets.Resolve_Exception (E) not in GNAT.Sockets.Resource_Temporarily_Unavailable then Ada.Text_IO.Put_Line ("Listen_Socket Error:" & Ada.Exceptions.Exception_Message (E)); Ada.Text_IO.Put_Line (Ada.Exceptions.Exception_Information (E)); exit; end if; end; end loop; end; end Listen; ----------------- -- Listen_Port -- ----------------- procedure Listen_Port (Port : GNAT.Sockets.Port_Type; Run : not null TCP_Coroutine; Stack : System.Storage_Elements.Storage_Count) is procedure Start is new Coroutines.Generic_Start (Listener_Arguments); begin Start (Listen'Access, Stack, (Port, Run, Stack)); end Listen_Port; end TCP_Servers;
30.090909
74
0.563948
4beb05155e8d0ccf91d7bc99f4bfc3cd7a294e4c
50,264
adb
Ada
Validation/pyFrame3DD-master/gcc-master/gcc/ada/par-endh.adb
djamal2727/Main-Bearing-Analytical-Model
2f00c2219c71be0175c6f4f8f1d4cca231d97096
[ "Apache-2.0" ]
null
null
null
Validation/pyFrame3DD-master/gcc-master/gcc/ada/par-endh.adb
djamal2727/Main-Bearing-Analytical-Model
2f00c2219c71be0175c6f4f8f1d4cca231d97096
[ "Apache-2.0" ]
null
null
null
Validation/pyFrame3DD-master/gcc-master/gcc/ada/par-endh.adb
djamal2727/Main-Bearing-Analytical-Model
2f00c2219c71be0175c6f4f8f1d4cca231d97096
[ "Apache-2.0" ]
null
null
null
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- P A R . E N D H -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2020, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING3. If not, go to -- -- http://www.gnu.org/licenses for a complete copy of the license. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Namet.Sp; use Namet.Sp; with Stringt; use Stringt; with Uintp; use Uintp; with GNAT.Spelling_Checker; use GNAT.Spelling_Checker; separate (Par) package body Endh is ---------------- -- Local Data -- ---------------- type End_Action_Type is ( -- Type used to describe the result of the Pop_End_Context call Accept_As_Scanned, -- Current end sequence is entirely c correct. In this case Token and -- the scan pointer are left pointing past the end sequence (i.e. they -- are unchanged from the values set on entry to Pop_End_Context). Insert_And_Accept, -- Current end sequence is to be left in place to satisfy some outer -- scope. Token and the scan pointer are set to point to the end -- token, and should be left there. A message has been generated -- indicating a missing end sequence. This status is also used for -- the case when no end token is present. Skip_And_Accept, -- The end sequence is incorrect (and an error message has been -- posted), but it will still be accepted. In this case Token and -- the scan pointer point back to the end token, and the caller -- should skip past the end sequence before proceeding. Skip_And_Reject); -- The end sequence is judged to belong to an unrecognized inner -- scope. An appropriate message has been issued and the caller -- should skip past the end sequence and then proceed as though -- no end sequence had been encountered. End_Action : End_Action_Type; -- The variable set by Pop_End_Context call showing which of the four -- decisions described above is judged the best. End_Sloc : Source_Ptr; -- Source location of END token End_OK : Boolean; -- Set False if error is found in END line End_Column : Column_Number; -- Column of END line End_Type : SS_End_Type; -- Type of END expected. The special value E_Dummy is set to indicate that -- no END token was present (so a missing END inserted message is needed) End_Labl : Node_Id; -- Node_Id value for explicit name on END line, or for compiler supplied -- name in the case where an optional name is not given. Empty if no name -- appears. If non-empty, then it is either an N_Designator node for a -- child unit or a node with a Chars field identifying the actual label. End_Labl_Present : Boolean; -- Indicates that the value in End_Labl was for an explicit label Syntax_OK : Boolean; -- Set True if the entry is syntactically correct Token_OK : Boolean; -- Set True if the keyword in the END sequence matches, or if neither -- the END sequence nor the END stack entry has a keyword. Label_OK : Boolean; -- Set True if both the END sequence and the END stack entry contained -- labels (other than No_Name or Error_Name) and the labels matched. -- This is a stronger condition than SYNTAX_OK, since it means that a -- label was present, even in a case where it was optional. Note that -- the case of no label required, and no label present does NOT set -- Label_OK to True, it is True only if a positive label match is found. Column_OK : Boolean; -- Column_OK is set True if the END sequence appears in the expected column Scan_State : Saved_Scan_State; -- Save state at start of END sequence, in case we decide not to eat it up ----------------------- -- Local Subprograms -- ----------------------- procedure Evaluate_End_Entry (SS_Index : Nat); -- Compare scanned END entry (as recorded by a prior call to P_End_Scan) -- with a specified entry in the scope stack (the single parameter is the -- entry index in the scope stack). Note that Scan is not called. The above -- variables xxx_OK are set to indicate the result of the evaluation. function Explicit_Start_Label (SS_Index : Nat) return Boolean; -- Determines whether the specified entry in the scope stack has an -- explicit start label (i.e. one other than one that was created by -- the parser when no explicit label was present). procedure Output_End_Deleted; -- Output a message complaining that the current END structure does not -- match anything and is being deleted. procedure Output_End_Expected (Ins : Boolean); -- Output a message at the start of the current token which is always an -- END, complaining that the END is not of the right form. The message -- indicates the expected form. The information for the message is taken -- from the top entry in the scope stack. The Ins parameter is True if -- an end is being inserted, and false if an existing end is being -- replaced. Note that in the case of a suspicious IS for the Ins case, -- we do not output the message, but instead simply mark the scope stack -- entry as being a case of a bad IS. procedure Output_End_Missing; -- Output a message just before the current token, complaining that the -- END is not of the right form. The message indicates the expected form. -- The information for the message is taken from the top entry in the -- scope stack. Note that in the case of a suspicious IS, we do not output -- the message, but instead simply mark the scope stack entry as a bad IS. procedure Pop_End_Context; -- Pop_End_Context is called after processing a construct, to pop the -- top entry off the end stack. It decides on the appropriate action to -- to take, signalling the result by setting End_Action as described in -- the global variable section. function Same_Label (Label1, Label2 : Node_Id) return Boolean; -- This function compares the two names associated with the given nodes. -- If they are both simple (i.e. have Chars fields), then they have to -- be the same name. Otherwise they must both be N_Selected_Component -- nodes, referring to the same set of names, or Label1 is an N_Designator -- referring to the same set of names as the N_Defining_Program_Unit_Name -- in Label2. Any other combination returns False. This routine is used -- to compare the End_Labl scanned from the End line with the saved label -- value in the scope stack. --------------- -- Check_End -- --------------- function Check_End (Decl : Node_Id := Empty; Is_Loc : Source_Ptr := No_Location) return Boolean is Name_On_Separate_Line : Boolean; -- Set True if the name on an END line is on a separate source line -- from the END. This is highly suspicious, but is allowed. The point -- is that we want to make sure that we don't just have a missing -- semicolon misleading us into swallowing an identifier from the -- following line. Name_Scan_State : Saved_Scan_State; -- Save state at start of name if Name_On_Separate_Line is TRUE Span_Node : constant Node_Id := Scopes (Scope.Last).Node; begin End_Labl_Present := False; End_Labl := Empty; -- Our first task is to scan out the END sequence if one is present. -- If none is present, signal by setting End_Type to E_Dummy. if Token /= Tok_End then End_Type := E_Dummy; else Save_Scan_State (Scan_State); -- at END End_Sloc := Token_Ptr; End_Column := Start_Column; End_OK := True; Scan; -- past END -- Set End_Span if expected. Note that this will be useless -- if we do not have the right ending keyword, but in this -- case we have a malformed program anyway, and the setting -- of End_Span will simply be unreliable in this case anyway. if Present (Span_Node) then Set_End_Location (Span_Node, Token_Ptr); end if; -- Cases of keywords where no label is allowed if Token = Tok_Case then End_Type := E_Case; Scan; -- past CASE elsif Token = Tok_If then End_Type := E_If; Scan; -- past IF elsif Token = Tok_Record then End_Type := E_Record; Scan; -- past RECORD elsif Token = Tok_Return then End_Type := E_Return; Scan; -- past RETURN elsif Token = Tok_Select then End_Type := E_Select; Scan; -- past SELECT -- Cases which do allow labels else -- LOOP if Token = Tok_Loop then Scan; -- past LOOP End_Type := E_Loop; -- FOR or WHILE allowed (signalling error) to substitute for LOOP -- if on the same line as the END. elsif (Token = Tok_For or else Token = Tok_While) and then not Token_Is_At_Start_Of_Line then Scan; -- past FOR or WHILE End_Type := E_Loop; End_OK := False; -- Cases with no keyword else End_Type := E_Name; end if; -- Now see if a name is present if Token = Tok_Identifier or else Token = Tok_String_Literal or else Token = Tok_Operator_Symbol then if Token_Is_At_Start_Of_Line then Name_On_Separate_Line := True; Save_Scan_State (Name_Scan_State); else Name_On_Separate_Line := False; end if; End_Labl := P_Designator; End_Labl_Present := True; -- We have now scanned out a name. Here is where we do a check -- to catch the cases like: -- -- end loop -- X := 3; -- -- where the missing semicolon might make us swallow up the X -- as a bogus end label. In a situation like this, where the -- apparent name is on a separate line, we accept it only if -- it matches the label and is followed by a semicolon. if Name_On_Separate_Line then if Token /= Tok_Semicolon or else not Same_Label (End_Labl, Scopes (Scope.Last).Labl) then Restore_Scan_State (Name_Scan_State); End_Labl := Empty; End_Labl_Present := False; end if; end if; -- Here for case of name allowed, but no name present. We will -- supply an implicit matching name, with source location set -- to the scan location past the END token. else End_Labl := Scopes (Scope.Last).Labl; if End_Labl > Empty_Or_Error then -- The task here is to construct a designator from the -- opening label, with the components all marked as not -- from source, and Is_End_Label set in the identifier -- or operator symbol. The location for all components -- is the current token location. -- Case of child unit name if Nkind (End_Labl) = N_Defining_Program_Unit_Name then Child_End : declare Eref : constant Node_Id := Make_Identifier (Token_Ptr, Chars => Chars (Defining_Identifier (End_Labl))); function Copy_Name (N : Node_Id) return Node_Id; -- Copies a selected component or identifier --------------- -- Copy_Name -- --------------- function Copy_Name (N : Node_Id) return Node_Id is R : Node_Id; begin if Nkind (N) = N_Selected_Component then return Make_Selected_Component (Token_Ptr, Prefix => Copy_Name (Prefix (N)), Selector_Name => Copy_Name (Selector_Name (N))); else R := Make_Identifier (Token_Ptr, Chars (N)); Set_Comes_From_Source (N, False); return R; end if; end Copy_Name; -- Start of processing for Child_End begin Set_Comes_From_Source (Eref, False); End_Labl := Make_Designator (Token_Ptr, Name => Copy_Name (Name (End_Labl)), Identifier => Eref); end Child_End; -- Simple identifier case elsif Nkind (End_Labl) = N_Defining_Identifier or else Nkind (End_Labl) = N_Identifier then End_Labl := Make_Identifier (Token_Ptr, Chars (End_Labl)); elsif Nkind (End_Labl) = N_Defining_Operator_Symbol or else Nkind (End_Labl) = N_Operator_Symbol then Get_Decoded_Name_String (Chars (End_Labl)); End_Labl := Make_Operator_Symbol (Token_Ptr, Chars => Chars (End_Labl), Strval => String_From_Name_Buffer); end if; Set_Comes_From_Source (End_Labl, False); End_Labl_Present := False; -- Do style check for label permitted but not present. Note: -- for the case of a block statement, the label is required -- to be repeated, and this legality rule is enforced -- independently. if Style_Check and then End_Type = E_Name and then Explicit_Start_Label (Scope.Last) and then Nkind (Parent (Scopes (Scope.Last).Labl)) /= N_Block_Statement then Style.No_End_Name (Scopes (Scope.Last).Labl); end if; end if; end if; end if; -- Deal with terminating aspect specifications and following semi- -- colon. We skip this in the case of END RECORD, since in this -- case the aspect specifications and semicolon are handled at -- a higher level. if End_Type /= E_Record then -- Scan aspect specifications if Aspect_Specifications_Present then -- Aspect specifications not allowed if No (Decl) then -- Package declaration case if Is_Loc /= No_Location then Error_Msg_SC ("misplaced aspects for package declaration"); Error_Msg ("info: aspect specifications belong here??", Is_Loc); P_Aspect_Specifications (Empty); -- Other cases where aspect specifications are not allowed else P_Aspect_Specifications (Error); end if; -- Aspect specifications allowed else P_Aspect_Specifications (Decl); end if; -- If no aspect specifications, must have a semicolon elsif End_Type /= E_Record then if Token = Tok_Semicolon then T_Semicolon; -- Semicolon is missing. If the missing semicolon is at the end -- of the line, i.e. we are at the start of the line now, then -- a missing semicolon gets flagged, but is not serious enough -- to consider the END statement to be bad in the sense that we -- are dealing with (i.e. to be suspicious that this END is not -- the END statement we are looking for). -- Similarly, if we are at a colon, we flag it but a colon for -- a semicolon is not serious enough to consider the END to be -- incorrect. Same thing for a period in place of a semicolon. elsif Token_Is_At_Start_Of_Line or else Token = Tok_Colon or else Token = Tok_Dot then T_Semicolon; -- If the missing semicolon is not at the start of the line, -- then we consider the END line to be dubious in this sense. else End_OK := False; end if; end if; end if; end if; -- Now we call the Pop_End_Context routine to get a recommendation -- as to what should be done with the END sequence we have scanned. Pop_End_Context; -- Remaining action depends on End_Action set by Pop_End_Context case End_Action is -- Accept_As_Scanned. In this case, Pop_End_Context left Token -- pointing past the last token of a syntactically correct END when Accept_As_Scanned => -- Syntactically correct included the possibility of a missing -- semicolon. If we do have a missing semicolon, then we have -- already given a message, but now we scan out possible rubbish -- on the same line as the END while not Token_Is_At_Start_Of_Line and then Prev_Token /= Tok_Record and then Prev_Token /= Tok_Semicolon and then Token /= Tok_End and then Token /= Tok_EOF loop Scan; -- past junk end loop; return True; -- Insert_And_Accept. In this case, Pop_End_Context has reset Token -- to point to the start of the END sequence, and recommends that it -- be left in place to satisfy an outer scope level END. This means -- that we proceed as though an END were present, and leave the scan -- pointer unchanged. when Insert_And_Accept => return True; -- Skip_And_Accept. In this case, Pop_End_Context has reset Token -- to point to the start of the END sequence. This END sequence is -- syntactically incorrect, and an appropriate error message has -- already been posted. Pop_End_Context recommends accepting the -- END sequence as the one we want, so we skip past it and then -- proceed as though an END were present. when Skip_And_Accept => End_Skip; return True; -- Skip_And_Reject. In this case, Pop_End_Context has reset Token -- to point to the start of the END sequence. This END sequence is -- syntactically incorrect, and an appropriate error message has -- already been posted. Pop_End_Context recommends entirely ignoring -- this END sequence, so we skip past it and then return False, since -- as far as the caller is concerned, no END sequence is present. when Skip_And_Reject => End_Skip; return False; end case; end Check_End; -------------- -- End Skip -- -------------- -- This procedure skips past an END sequence. On entry Token contains -- Tok_End, and we know that the END sequence is syntactically incorrect, -- and that an appropriate error message has already been posted. The -- mission is simply to position the scan pointer to be the best guess of -- the position after the END sequence. We do not issue any additional -- error messages while carrying this out. -- Error recovery: does not raise Error_Resync procedure End_Skip is begin Scan; -- past END -- If the scan past the END leaves us on the next line, that's probably -- where we should quit the scan, since it is likely that what we have -- is a missing semicolon. Consider the following: -- END -- Process_Input; -- This will have looked like a syntactically valid END sequence to the -- initial scan of the END, but subsequent checking will have determined -- that the label Process_Input is not an appropriate label. The real -- error is a missing semicolon after the END, and by leaving the scan -- pointer just past the END, we will improve the error recovery. if Token_Is_At_Start_Of_Line then return; end if; -- If there is a semicolon after the END, scan it out and we are done if Token = Tok_Semicolon then T_Semicolon; return; end if; -- Otherwise skip past a token after the END on the same line. Note -- that we do not eat a token on the following line since it seems -- very unlikely in any case that the END gets separated from its -- token, and we do not want to swallow up a keyword that starts a -- legitimate construct following the bad END. if not Token_Is_At_Start_Of_Line and then -- Cases of normal tokens following an END (Token = Tok_Case or else Token = Tok_If or else Token = Tok_Loop or else Token = Tok_Record or else Token = Tok_Select or else -- Cases of bogus keywords ending loops Token = Tok_For or else Token = Tok_While or else -- Cases of operator symbol names without quotes Token = Tok_Abs or else Token = Tok_And or else Token = Tok_Mod or else Token = Tok_Not or else Token = Tok_Or or else Token = Tok_Xor) then Scan; -- past token after END -- If that leaves us on the next line, then we are done. This is the -- same principle described above for the case of END at line end if Token_Is_At_Start_Of_Line then return; -- If we just scanned out record, then we are done, since the -- semicolon after END RECORD is not part of the END sequence elsif Prev_Token = Tok_Record then return; -- If we have a semicolon, scan it out and we are done elsif Token = Tok_Semicolon then T_Semicolon; return; end if; end if; -- Check for a label present on the same line loop if Token_Is_At_Start_Of_Line then return; end if; if Token /= Tok_Identifier and then Token /= Tok_Operator_Symbol and then Token /= Tok_String_Literal then exit; end if; Scan; -- past identifier, operator symbol or string literal if Token_Is_At_Start_Of_Line then return; elsif Token = Tok_Dot then Scan; -- past dot end if; end loop; -- Skip final semicolon if Token = Tok_Semicolon then T_Semicolon; -- If we don't have a final semicolon, skip until we either encounter -- an END token, or a semicolon or the start of the next line. This -- allows general junk to follow the end line (normally it is hard to -- think that anyone will put anything deliberate here, and remember -- that we know there is a missing semicolon in any case). We also -- quite on an EOF (or else we would get stuck in an infinite loop -- if there is no line end at the end of the last line of the file) else while Token /= Tok_End and then Token /= Tok_EOF and then Token /= Tok_Semicolon and then not Token_Is_At_Start_Of_Line loop Scan; -- past junk token on same line end loop; end if; return; end End_Skip; -------------------- -- End Statements -- -------------------- -- This procedure is called when END is required or expected to terminate -- a sequence of statements. The caller has already made an appropriate -- entry on the scope stack to describe the expected form of the END. -- End_Statements should only be used in cases where the only appropriate -- terminator is END. -- Error recovery: cannot raise Error_Resync; procedure End_Statements (Parent : Node_Id := Empty; Decl : Node_Id := Empty; Is_Sloc : Source_Ptr := No_Location) is begin -- This loop runs more than once in the case where Check_End rejects -- the END sequence, as indicated by Check_End returning False. loop if Check_End (Decl, Is_Sloc) then if Present (Parent) then Set_End_Label (Parent, End_Labl); end if; return; end if; -- Extra statements past the bogus END are discarded. This is not -- ideal for maximum error recovery, but it's too much trouble to -- find an appropriate place to put them. Discard_Junk_List (P_Sequence_Of_Statements (SS_None)); end loop; end End_Statements; ------------------------ -- Evaluate End Entry -- ------------------------ procedure Evaluate_End_Entry (SS_Index : Nat) is STE : Scope_Table_Entry renames Scopes (SS_Index).all; begin Column_OK := (End_Column = STE.Ecol); Token_OK := (End_Type = STE.Etyp or else (End_Type = E_Name and then STE.Etyp >= E_Name)); Label_OK := End_Labl_Present and then (Same_Label (End_Labl, STE.Labl) or else STE.Labl = Error); -- Special case to consider. Suppose we have the suspicious label case, -- e.g. a situation like: -- My_Label; -- declare -- ... -- begin -- ... -- end My_Label; -- This is the case where we want to use the entry in the suspicous -- label table to flag the semicolon saying it should be a colon. -- Label_OK will be false because the label does not match (we have -- My_Label on the end line, and the generated name for the scope). Also -- End_Labl_Present will be True. if not Label_OK and then End_Labl_Present and then not Comes_From_Source (Scopes (SS_Index).Labl) then -- Here is where we will search the suspicious labels table for J in 1 .. Suspicious_Labels.Last loop declare SLE : Suspicious_Label_Entry renames Suspicious_Labels.Table (J); begin -- See if character name of label matches if Chars (Name (SLE.Proc_Call)) = Chars (End_Labl) -- And first token of loop/block identifies this entry and then SLE.Start_Token = STE.Sloc then -- We have the special case, issue the error message Error_Msg -- CODEFIX (""";"" should be "":""", SLE.Semicolon_Loc); -- And indicate we consider the Label OK after all Label_OK := True; exit; end if; end; end loop; end if; -- Compute setting of Syntax_OK. We definitely have a syntax error -- if the Token does not match properly or if P_End_Scan detected -- a syntax error such as a missing semicolon. if not Token_OK or not End_OK then Syntax_OK := False; -- Final check is that label is OK. Certainly it is OK if there -- was an exact match on the label (the END label = the stack label) elsif Label_OK then Syntax_OK := True; -- Case of label present elsif End_Labl_Present then -- If probably misspelling, then complain, and pretend it is OK declare Nam : constant Node_Or_Entity_Id := Scopes (SS_Index).Labl; begin if Nkind (End_Labl) in N_Has_Chars and then Comes_From_Source (Nam) and then Nkind (Nam) in N_Has_Chars and then Chars (End_Labl) > Error_Name and then Chars (Nam) > Error_Name then Error_Msg_Name_1 := Chars (Nam); if Error_Msg_Name_1 > Error_Name then if Is_Bad_Spelling_Of (Chars (Nam), Chars (End_Labl)) then Error_Msg_Name_1 := Chars (Nam); Error_Msg_N -- CODEFIX ("misspelling of %", End_Labl); Syntax_OK := True; return; end if; end if; end if; end; Syntax_OK := False; -- Otherwise we have cases of no label on the END line. For the loop -- case, this is acceptable only if the loop is unlabeled. elsif End_Type = E_Loop then Syntax_OK := not Explicit_Start_Label (SS_Index); -- Cases where a label is definitely allowed on the END line elsif End_Type = E_Name then Syntax_OK := (not Explicit_Start_Label (SS_Index)) or else (not Scopes (SS_Index).Lreq); -- Otherwise we have cases which don't allow labels anyway, so we -- certainly accept an END which does not have a label. else Syntax_OK := True; end if; end Evaluate_End_Entry; -------------------------- -- Explicit_Start_Label -- -------------------------- function Explicit_Start_Label (SS_Index : Nat) return Boolean is L : constant Node_Id := Scopes (SS_Index).Labl; Etyp : constant SS_End_Type := Scopes (SS_Index).Etyp; begin if No (L) then return False; -- In the following test we protect the call to Comes_From_Source -- against lines containing previously reported syntax errors. elsif (Etyp = E_Loop or else Etyp = E_Name or else Etyp = E_Suspicious_Is or else Etyp = E_Bad_Is) and then Comes_From_Source (L) then return True; else return False; end if; end Explicit_Start_Label; ------------------------ -- Output_End_Deleted -- ------------------------ procedure Output_End_Deleted is begin if End_Type = E_Loop then Error_Msg_SC ("no LOOP for this `END LOOP`!"); elsif End_Type = E_Case then Error_Msg_SC ("no CASE for this `END CASE`"); elsif End_Type = E_If then Error_Msg_SC ("no IF for this `END IF`!"); elsif End_Type = E_Record then Error_Msg_SC ("no RECORD for this `END RECORD`!"); elsif End_Type = E_Return then Error_Msg_SC ("no RETURN for this `END RETURN`!"); elsif End_Type = E_Select then Error_Msg_SC ("no SELECT for this `END SELECT`!"); else Error_Msg_SC ("no BEGIN for this END!"); end if; end Output_End_Deleted; ------------------------- -- Output_End_Expected -- ------------------------- procedure Output_End_Expected (Ins : Boolean) is End_Type : SS_End_Type; begin -- Suppress message if this was a potentially junk entry (e.g. a record -- entry where no record keyword was present). if Scopes (Scope.Last).Junk then return; end if; End_Type := Scopes (Scope.Last).Etyp; Error_Msg_Col := Scopes (Scope.Last).Ecol; Error_Msg_Sloc := Scopes (Scope.Last).Sloc; if Explicit_Start_Label (Scope.Last) then Error_Msg_Node_1 := Scopes (Scope.Last).Labl; else Error_Msg_Node_1 := Empty; end if; -- Suppress message if error was posted on opening label if Error_Msg_Node_1 > Empty_Or_Error and then Error_Posted (Error_Msg_Node_1) then return; end if; if End_Type = E_Case then Error_Msg_SC -- CODEFIX ("`END CASE;` expected@ for CASE#!"); elsif End_Type = E_If then Error_Msg_SC -- CODEFIX ("`END IF;` expected@ for IF#!"); elsif End_Type = E_Loop then if Error_Msg_Node_1 = Empty then Error_Msg_SC -- CODEFIX ("`END LOOP;` expected@ for LOOP#!"); else Error_Msg_SC -- CODEFIX ("`END LOOP &;` expected@!"); end if; elsif End_Type = E_Record then Error_Msg_SC -- CODEFIX ("`END RECORD;` expected@ for RECORD#!"); elsif End_Type = E_Return then Error_Msg_SC -- CODEFIX ("`END RETURN;` expected@ for RETURN#!"); elsif End_Type = E_Select then Error_Msg_SC -- CODEFIX ("`END SELECT;` expected@ for SELECT#!"); -- All remaining cases are cases with a name (we do not treat the -- suspicious is cases specially for a replaced end, only for an -- inserted end). elsif End_Type = E_Name or else not Ins then if Error_Msg_Node_1 = Empty then Error_Msg_SC -- CODEFIX ("`END;` expected@ for BEGIN#!"); else Error_Msg_SC -- CODEFIX ("`END &;` expected@!"); end if; -- The other possibility is a missing END for a subprogram with a -- suspicious IS (that probably should have been a semicolon). The -- missing IS confirms the suspicion. else -- End_Type = E_Suspicious_Is or E_Bad_Is Scopes (Scope.Last).Etyp := E_Bad_Is; end if; end Output_End_Expected; ------------------------ -- Output_End_Missing -- ------------------------ procedure Output_End_Missing is End_Type : SS_End_Type; begin -- Suppress message if this was a potentially junk entry (e.g. a record -- entry where no record keyword was present). if Scopes (Scope.Last).Junk then return; end if; End_Type := Scopes (Scope.Last).Etyp; Error_Msg_Sloc := Scopes (Scope.Last).Sloc; if Explicit_Start_Label (Scope.Last) then Error_Msg_Node_1 := Scopes (Scope.Last).Labl; else Error_Msg_Node_1 := Empty; end if; if End_Type = E_Case then Error_Msg_BC ("missing `END CASE;` for CASE#!"); elsif End_Type = E_If then Error_Msg_BC ("missing `END IF;` for IF#!"); elsif End_Type = E_Loop then if Error_Msg_Node_1 = Empty then Error_Msg_BC ("missing `END LOOP;` for LOOP#!"); else Error_Msg_BC ("missing `END LOOP &;`!"); end if; elsif End_Type = E_Record then Error_Msg_SC ("missing `END RECORD;` for RECORD#!"); elsif End_Type = E_Return then Error_Msg_SC ("missing `END RETURN;` for RETURN#!"); elsif End_Type = E_Select then Error_Msg_BC ("missing `END SELECT;` for SELECT#!"); elsif End_Type = E_Name then if Error_Msg_Node_1 = Empty then Error_Msg_BC ("missing `END;` for BEGIN#!"); else Error_Msg_BC ("missing `END &;`!"); end if; else -- End_Type = E_Suspicious_Is or E_Bad_Is Scopes (Scope.Last).Etyp := E_Bad_Is; end if; end Output_End_Missing; --------------------- -- Pop_End_Context -- --------------------- procedure Pop_End_Context is Pretty_Good : Boolean; -- This flag is set True if the END sequence is syntactically incorrect, -- but is (from a heuristic point of view), pretty likely to be simply -- a misspelling of the intended END. Outer_Match : Boolean; -- This flag is set True if we decide that the current END sequence -- belongs to some outer level entry in the scope stack, and thus -- we will NOT eat it up in matching the current expected END. begin -- If not at END, then output END expected message if End_Type = E_Dummy then Output_End_Missing; Pop_Scope_Stack; End_Action := Insert_And_Accept; return; -- Otherwise we do have an END present else -- A special check. If we have END; followed by an end of file, -- WITH or SEPARATE, then if we are not at the outer level, then -- we have a syntax error. Consider the example: -- ... -- declare -- X : Integer; -- begin -- X := Father (A); -- Process (X, X); -- end; -- with Package1; -- ... -- Now the END; here is a syntactically correct closer for the -- declare block, but if we eat it up, then we obviously have -- a missing END for the outer context (since WITH can only appear -- at the outer level. -- In this situation, we always reserve the END; for the outer level, -- even if it is in the wrong column. This is because it's much more -- useful to have the error message point to the DECLARE than to the -- package header in this case. -- We also reserve an end with a name before the end of file if the -- name is the one we expect at the outer level. if (Token = Tok_EOF or else Token = Tok_With or else Token = Tok_Separate) and then End_Type >= E_Name and then (not End_Labl_Present or else Same_Label (End_Labl, Scopes (1).Labl)) and then Scope.Last > 1 then Restore_Scan_State (Scan_State); -- to END Output_End_Expected (Ins => True); Pop_Scope_Stack; End_Action := Insert_And_Accept; return; end if; -- Otherwise we go through the normal END evaluation procedure Evaluate_End_Entry (Scope.Last); -- If top entry in stack is syntactically correct, then we have -- scanned it out and everything is fine. This is the required -- action to properly process correct Ada programs. if Syntax_OK then -- Complain if checking columns and END is not in right column. -- Right in this context means exactly right, or on the same -- line as the opener. if RM_Column_Check then if End_Column /= Scopes (Scope.Last).Ecol and then Current_Line_Start > Scopes (Scope.Last).Sloc -- A special case, for END RECORD, we are also allowed to -- line up with the TYPE keyword opening the declaration. and then (Scopes (Scope.Last).Etyp /= E_Record or else Get_Column_Number (End_Sloc) /= Get_Column_Number (Type_Token_Location)) then Error_Msg_Col := Scopes (Scope.Last).Ecol; Error_Msg ("(style) END in wrong column, should be@", End_Sloc); end if; end if; -- One final check. If the end had a label, check for an exact -- duplicate of this end sequence, and if so, skip it with an -- appropriate message. if End_Labl_Present and then Token = Tok_End then declare Scan_State : Saved_Scan_State; End_Loc : constant Source_Ptr := Token_Ptr; Nxt_Labl : Node_Id; Dup_Found : Boolean := False; begin Save_Scan_State (Scan_State); Scan; -- past END if Token = Tok_Identifier or else Token = Tok_Operator_Symbol then Nxt_Labl := P_Designator; -- We only consider it an error if the label is a match -- and would be wrong for the level one above us, and -- the indentation is the same. if Token = Tok_Semicolon and then Same_Label (End_Labl, Nxt_Labl) and then End_Column = Start_Column and then (Scope.Last = 1 or else (not Explicit_Start_Label (Scope.Last - 1)) or else (not Same_Label (End_Labl, Scopes (Scope.Last - 1).Labl))) then T_Semicolon; Error_Msg ("duplicate end line ignored", End_Loc); Dup_Found := True; end if; end if; if not Dup_Found then Restore_Scan_State (Scan_State); end if; end; end if; -- All OK, so return to caller indicating END is OK Pop_Scope_Stack; End_Action := Accept_As_Scanned; return; end if; -- If that check failed, then we definitely have an error. The issue -- is how to choose among three possible courses of action: -- 1. Ignore the current END text completely, scanning past it, -- deciding that it belongs neither to the current context, -- nor to any outer context. -- 2. Accept the current END text, scanning past it, and issuing -- an error message that it does not have the right form. -- 3. Leave the current END text in place, NOT scanning past it, -- issuing an error message indicating the END expected for the -- current context. In this case, the END is available to match -- some outer END context. -- From a correct functioning point of view, it does not make any -- difference which of these three approaches we take, the program -- will work correctly in any case. However, making an accurate -- choice among these alternatives, i.e. choosing the one that -- corresponds to what the programmer had in mind, does make a -- significant difference in the quality of error recovery. Restore_Scan_State (Scan_State); -- to END -- First we see how good the current END entry is with respect to -- what we expect. It is considered pretty good if the token is OK, -- and either the label or the column matches. An END for RECORD is -- always considered to be pretty good in the record case. This is -- because not only does a record disallow a nested structure, but -- also it is unlikely that such nesting could occur by accident. Pretty_Good := (Token_OK and (Column_OK or Label_OK)) or else Scopes (Scope.Last).Etyp = E_Record; -- Next check, if there is a deeper entry in the stack which -- has a very high probability of being acceptable, then insert -- the END entry we want, leaving the higher level entry for later for J in reverse 1 .. Scope.Last - 1 loop Evaluate_End_Entry (J); -- To even consider the deeper entry to be immediately acceptable, -- it must be syntactically correct. Furthermore it must either -- have a correct label, or the correct column. If the current -- entry was a close match (Pretty_Good set), then we are even -- more strict in accepting the outer level one: even if it has -- the right label, it must have the right column as well. if Syntax_OK then if Pretty_Good then Outer_Match := Label_OK and Column_OK; else Outer_Match := Label_OK or Column_OK; end if; else Outer_Match := False; end if; -- If the outer entry does convincingly match the END text, then -- back up the scan to the start of the END sequence, issue an -- error message indicating the END we expected, and return with -- Token pointing to the END (case 3 from above discussion). if Outer_Match then Output_End_Missing; Pop_Scope_Stack; End_Action := Insert_And_Accept; return; end if; end loop; -- Here we have a situation in which the current END entry is -- syntactically incorrect, but there is no deeper entry in the -- END stack which convincingly matches it. -- If the END text was judged to be a Pretty_Good match for the -- expected token or if it appears left of the expected column, -- then we will accept it as the one we want, scanning past it, even -- though it is not completely right (we issue a message showing what -- we expected it to be). This is action 2 from the discussion above. -- There is one other special case to consider: the LOOP case. -- Consider the example: -- Lbl: loop -- null; -- end loop; -- Here the column lines up with Lbl, so END LOOP is to the right, -- but it is still acceptable. LOOP is the one case where alignment -- practices vary substantially in practice. if Pretty_Good or else End_Column <= Scopes (Scope.Last).Ecol or else (End_Type = Scopes (Scope.Last).Etyp and then End_Type = E_Loop) then Output_End_Expected (Ins => False); Pop_Scope_Stack; End_Action := Skip_And_Accept; return; -- Here we have the case where the END is to the right of the -- expected column and does not have a correct label to convince -- us that it nevertheless belongs to the current scope. For this -- we consider that it probably belongs not to the current context, -- but to some inner context that was not properly recognized (due to -- other syntax errors), and for which no proper scope stack entry -- was made. The proper action in this case is to delete the END text -- and return False to the caller as a signal to keep on looking for -- an acceptable END. This is action 1 from the discussion above. else Output_End_Deleted; End_Action := Skip_And_Reject; return; end if; end if; end Pop_End_Context; ---------------- -- Same_Label -- ---------------- function Same_Label (Label1, Label2 : Node_Id) return Boolean is begin if Nkind (Label1) in N_Has_Chars and then Nkind (Label2) in N_Has_Chars then return Chars (Label1) = Chars (Label2); elsif Nkind (Label1) = N_Selected_Component and then Nkind (Label2) = N_Selected_Component then return Same_Label (Prefix (Label1), Prefix (Label2)) and then Same_Label (Selector_Name (Label1), Selector_Name (Label2)); elsif Nkind (Label1) = N_Designator and then Nkind (Label2) = N_Defining_Program_Unit_Name then return Same_Label (Name (Label1), Name (Label2)) and then Same_Label (Identifier (Label1), Defining_Identifier (Label2)); else return False; end if; end Same_Label; end Endh;
37.287834
79
0.56249
57bc308db71203c3a7f16f6f126c0df985ee1a16
2,090
adb
Ada
Sources/Graphics/graphics_framerates.adb
ForYouEyesOnly/Space-Convoy
be4904f6a02695f7c4c5c3c965f4871cd3250003
[ "MIT" ]
1
2019-09-21T09:40:34.000Z
2019-09-21T09:40:34.000Z
Sources/Graphics/graphics_framerates.adb
ForYouEyesOnly/Space-Convoy
be4904f6a02695f7c4c5c3c965f4871cd3250003
[ "MIT" ]
null
null
null
Sources/Graphics/graphics_framerates.adb
ForYouEyesOnly/Space-Convoy
be4904f6a02695f7c4c5c3c965f4871cd3250003
[ "MIT" ]
1
2019-09-25T12:29:27.000Z
2019-09-25T12:29:27.000Z
-- -- Jan & Uwe R. Zimmer, Australia, July 2011 -- package body Graphics_FrameRates is type Ring_Ix is mod Smoothing_Buffer_Size; Smoothing_Buffer : array (Ring_Ix) of Time_Span := (others => Seconds (1)); Smoothing_Buffer_Ix : Ring_Ix := Ring_Ix'First; Last_Call_To_Limiter : Time := Clock; Last_Padding_Delay : Time_Span := Time_Span_Zero; Last_Call_To_Measure_Interval : Time := Clock; -- -- -- function Measure_Interval return Time_Span is Interval : constant Time_Span := Clock - Last_Call_To_Measure_Interval; begin Last_Call_To_Measure_Interval := Clock; return Interval; end Measure_Interval; ----------------------- -- Average_Framerate -- ----------------------- function Average_Framerate (Interval : Time_Span) return Hz is Interval_Sum : Time_Span := Time_Span_Zero; begin Smoothing_Buffer (Smoothing_Buffer_Ix) := Interval; Smoothing_Buffer_Ix := Smoothing_Buffer_Ix + 1; for i in Ring_Ix'Range loop Interval_Sum := Interval_Sum + Smoothing_Buffer (i); end loop; if Interval_Sum = Time_Span_Zero then return 0.0; else return 1.0 / Real (To_Duration (Interval_Sum / Smoothing_Buffer_Size)); end if; end Average_Framerate; -- -- -- procedure Framerate_Limiter (Max_Framerate : Hz) is Intended_Time_Span : constant Time_Span := To_Time_Span (Duration (1.0 / Max_Framerate)); Actual_Execution_Time : constant Time_Span := (Clock - Last_Call_To_Limiter) - Last_Padding_Delay; Padding_Delay : Time_Span := Intended_Time_Span - Actual_Execution_Time; begin if Padding_Delay > Intended_Time_Span then Padding_Delay := Intended_Time_Span; elsif Padding_Delay < -Intended_Time_Span then Padding_Delay := -Intended_Time_Span; end if; Last_Call_To_Limiter := Clock; Last_Padding_Delay := Padding_Delay; delay To_Duration (Padding_Delay); end Framerate_Limiter; end Graphics_FrameRates;
27.866667
104
0.663636
04d24ac40868eb4d7a9c6b1aea5438531dbef26f
931
adb
Ada
openal-load.adb
io7m/coreland-openal-ada
dd320bf0cc42759d4b041ba660a4b3e0c7507da5
[ "0BSD" ]
1
2017-10-07T05:53:55.000Z
2017-10-07T05:53:55.000Z
openal-load.adb
io7m/coreland-openal-ada
dd320bf0cc42759d4b041ba660a4b3e0c7507da5
[ "0BSD" ]
null
null
null
openal-load.adb
io7m/coreland-openal-ada
dd320bf0cc42759d4b041ba660a4b3e0c7507da5
[ "0BSD" ]
null
null
null
with Ada.Unchecked_Conversion; with Interfaces.C; with System; package body OpenAL.Load is package C renames Interfaces.C; function Load_Subprogram (Name : in String) return Subprogram_Access_Type is pragma Assert (Subprogram_Access_Type'Size = System.Address'Size); function Get_Proc_Address (Name : System.Address) return System.Address; pragma Import (C, Get_Proc_Address, "alGetProcAddress"); function Convert is new Ada.Unchecked_Conversion (Source => System.Address, Target => Subprogram_Access_Type); use type System.Address; C_Name : aliased C.char_array := C.To_C (Name); Address : constant System.Address := Get_Proc_Address (C_Name (C_Name'First)'Address); begin if Address = System.Null_Address then raise Load_Error with "subprogram " & Name & " not found"; end if; return Convert (Address); end Load_Subprogram; end OpenAL.Load;
28.212121
78
0.719656
58603f7fac7db92357c6e665399d99e233aae3d8
657
ada
Ada
Task/Nth/Ada/nth.ada
mullikine/RosettaCodeData
4f0027c6ce83daa36118ee8b67915a13cd23ab67
[ "Info-ZIP" ]
1
2018-11-09T22:08:38.000Z
2018-11-09T22:08:38.000Z
Task/Nth/Ada/nth.ada
mullikine/RosettaCodeData
4f0027c6ce83daa36118ee8b67915a13cd23ab67
[ "Info-ZIP" ]
null
null
null
Task/Nth/Ada/nth.ada
mullikine/RosettaCodeData
4f0027c6ce83daa36118ee8b67915a13cd23ab67
[ "Info-ZIP" ]
1
2018-11-09T22:08:40.000Z
2018-11-09T22:08:40.000Z
with Ada.Text_IO; procedure Nth is function Suffix(N: Natural) return String is begin if N mod 10 = 1 and then N mod 100 /= 11 then return "st"; elsif N mod 10 = 2 and then N mod 100 /= 12 then return "nd"; elsif N mod 10 = 3 and then N mod 100 /= 13 then return "rd"; else return "th"; end if; end Suffix; procedure Print_Images(From, To: Natural) is begin for I in From .. To loop Ada.Text_IO.Put(Natural'Image(I) & Suffix(I)); end loop; Ada.Text_IO.New_Line; end Print_Images; begin Print_Images( 0, 25); Print_Images( 250, 265); Print_Images(1000, 1025); end Nth;
24.333333
67
0.61796
4b2fe8ea816ed3c10d9ac562e8f52eedae1e2843
1,214
adb
Ada
example/src/trendy_terminal-example-input.adb
pyjarrett/archaic_terminal
ce1e5331a66ed9aa7ae0dc6c41ffa4851919a1f8
[ "Apache-2.0" ]
3
2021-11-03T18:27:41.000Z
2022-03-01T18:15:34.000Z
example/src/trendy_terminal-example-input.adb
pyjarrett/archaic_terminal
ce1e5331a66ed9aa7ae0dc6c41ffa4851919a1f8
[ "Apache-2.0" ]
2
2021-09-05T13:35:39.000Z
2021-09-11T21:27:38.000Z
example/src/trendy_terminal-example-input.adb
pyjarrett/trendy_terminal
ce1e5331a66ed9aa7ae0dc6c41ffa4851919a1f8
[ "Apache-2.0" ]
null
null
null
with Ada.Strings.Unbounded; with Ada.Text_IO; with Trendy_Terminal.Maps; with Trendy_Terminal.Platform; with Trendy_Terminal.VT100; package body Trendy_Terminal.Example.Input is package AIO renames Ada.Text_IO; package ASU renames Ada.Strings.Unbounded; package TT renames Trendy_Terminal; -- Name that input! procedure Run_Print_Input is begin loop declare Input : constant ASU.Unbounded_String := ASU.To_Unbounded_String (TT.Platform.Get_Input); Key_Enter : constant := 13; begin AIO.New_Line; if Trendy_Terminal.Maps.Is_Key (ASU.To_String (Input)) then AIO.Put_Line (TT.Maps.Key'Image (Trendy_Terminal.Maps.Key_For (ASU.To_String (Input)))); end if; for X in 1 .. ASU.Length (Input) loop if Character'Pos (ASU.Element (Input, X)) = Key_Enter then return; end if; AIO.Put_Line (Character'Pos (ASU.Element (Input, X))'Image); end loop; end; end loop; end Run_Print_Input; end Trendy_Terminal.Example.Input;
31.947368
109
0.59061
9a331badc4a42181a9ddba71f0267c1450ff9850
448
ads
Ada
source/hash/a-szhcin.ads
ytomino/drake
4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2
[ "MIT" ]
33
2015-04-04T09:19:36.000Z
2021-11-10T05:33:34.000Z
source/hash/a-szhcin.ads
ytomino/drake
4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2
[ "MIT" ]
8
2017-11-14T13:05:07.000Z
2018-08-09T15:28:49.000Z
source/hash/a-szhcin.ads
ytomino/drake
4e4bdcd8b8e23a11a29b31d3a8861fdf60090ea2
[ "MIT" ]
9
2015-02-03T17:09:53.000Z
2021-11-12T01:16:05.000Z
pragma License (Unrestricted); -- Ada 2012 with Ada.Characters.Conversions; with Ada.Strings.Generic_Hash_Case_Insensitive; function Ada.Strings.Wide_Wide_Hash_Case_Insensitive is new Generic_Hash_Case_Insensitive ( Wide_Wide_Character, Wide_Wide_String, Characters.Conversions.Get); -- pragma Pure (Ada.Strings.Wide_Wide_Hash_Case_Insensitive); pragma Preelaborate (Ada.Strings.Wide_Wide_Hash_Case_Insensitive); -- use maps
37.333333
78
0.808036
137e5ff3c163e43f0792492b41bc8a4313f21430
5,724
ads
Ada
tools/scitools/conf/understand/ada/ada05/s-tataat.ads
brucegua/moocos
575c161cfa35e220f10d042e2e5ca18773691695
[ "Apache-2.0" ]
1
2020-01-20T21:26:46.000Z
2020-01-20T21:26:46.000Z
tools/scitools/conf/understand/ada/ada05/s-tataat.ads
brucegua/moocos
575c161cfa35e220f10d042e2e5ca18773691695
[ "Apache-2.0" ]
null
null
null
tools/scitools/conf/understand/ada/ada05/s-tataat.ads
brucegua/moocos
575c161cfa35e220f10d042e2e5ca18773691695
[ "Apache-2.0" ]
null
null
null
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME LIBRARY (GNARL) COMPONENTS -- -- -- -- S Y S T E M . T A S K I N G . T A S K _ A T T R I B U T E S -- -- -- -- S p e c -- -- -- -- Copyright (C) 1991-1994, Florida State University -- -- Copyright (C) 1995-2005, AdaCore -- -- -- -- GNARL is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 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. -- -- -- -- -- -- -- -- -- -- -- GNARL was developed by the GNARL team at Florida State University. -- -- Extensive contributions were provided by Ada Core Technologies, Inc. -- -- -- ------------------------------------------------------------------------------ -- This package provides support for the body of Ada.Task_Attributes with Ada.Finalization; -- Used for Limited_Controlled with System.Storage_Elements; -- Used for Integer_Address package System.Tasking.Task_Attributes is type Attribute is new Integer; -- A stand-in for the generic formal type of Ada.Task_Attributes -- in the following declarations. type Node; type Access_Node is access all Node; -- This needs comments ??? function To_Access_Node is new Unchecked_Conversion (Access_Address, Access_Node); -- Used to fetch pointer to indirect attribute list. Declaration is in -- spec to avoid any problems with aliasing assumptions. type Dummy_Wrapper; type Access_Dummy_Wrapper is access all Dummy_Wrapper; pragma No_Strict_Aliasing (Access_Dummy_Wrapper); -- Needed to avoid possible incorrect aliasing situations from -- instantiation of Unchecked_Conversion in body of Ada.Task_Attributes. for Access_Dummy_Wrapper'Storage_Size use 0; -- Access_Dummy_Wrapper is a stand-in for the generic type Wrapper defined -- in Ada.Task_Attributes. The real objects allocated are always -- of type Wrapper, no Dummy_Wrapper objects are ever created. type Deallocator is access procedure (P : in out Access_Node); -- Called to deallocate an Wrapper. P is a pointer to a Node within type Instance; type Access_Instance is access all Instance; type Instance is new Ada.Finalization.Limited_Controlled with record Deallocate : Deallocator; Initial_Value : aliased System.Storage_Elements.Integer_Address; Index : Direct_Index; -- The index of the TCB location used by this instantiation, if it is -- stored in the TCB, otherwise zero. Next : Access_Instance; -- Next instance in All_Attributes list end record; procedure Finalize (X : in out Instance); type Node is record Wrapper : Access_Dummy_Wrapper; Instance : Access_Instance; Next : Access_Node; end record; -- The following type is a stand-in for the actual wrapper type, which is -- different for each instantiation of Ada.Task_Attributes. type Dummy_Wrapper is record Dummy_Node : aliased Node; Value : aliased Attribute; -- The generic formal type, may be controlled end record; for Dummy_Wrapper'Alignment use Standard'Maximum_Alignment; -- A number of unchecked conversions involving Dummy_Wrapper_Access -- sources are performed in other units (e.g. Ada.Task_Attributes). -- Ensure that the designated object is always strictly enough aligned. In_Use : Direct_Index_Vector := 0; -- Set True for direct indices that are already used (True??? type???) All_Attributes : Access_Instance; -- A linked list of all indirectly access attributes, which includes all -- those that require finalization. procedure Initialize_Attributes (T : Task_Id); -- Initialize all attributes created via Ada.Task_Attributes for T. This -- must be called by the creator of the task, inside Create_Task, via -- soft-link Initialize_Attributes_Link. On entry, abort must be deferred -- and the caller must hold no locks procedure Finalize_Attributes (T : Task_Id); -- Finalize all attributes created via Ada.Task_Attributes for T. -- This is to be called by the task after it is marked as terminated -- (and before it actually dies), inside Vulnerable_Free_Task, via the -- soft-link Finalize_Attributes_Link. On entry, abort must be deferred -- and T.L must be write-locked. end System.Tasking.Task_Attributes;
43.363636
78
0.601677
04fb6ae689f9e2a0f3218975bcd3f93ee57a28d7
2,547
ads
Ada
src/libraries/Rejuvenation_Lib/src/rejuvenation-utils.ads
selroc/Renaissance-Ada
39230b34aced4a9d83831be346ca103136c53715
[ "BSD-3-Clause" ]
1
2022-03-08T13:00:47.000Z
2022-03-08T13:00:47.000Z
src/libraries/Rejuvenation_Lib/src/rejuvenation-utils.ads
selroc/Renaissance-Ada
39230b34aced4a9d83831be346ca103136c53715
[ "BSD-3-Clause" ]
null
null
null
src/libraries/Rejuvenation_Lib/src/rejuvenation-utils.ads
selroc/Renaissance-Ada
39230b34aced4a9d83831be346ca103136c53715
[ "BSD-3-Clause" ]
null
null
null
with Rejuvenation.Node_Locations; use Rejuvenation.Node_Locations; package Rejuvenation.Utils is -- Raw signature -------- function Raw_Signature (Node : Ada_Node'Class; Before : Node_Location := No_Trivia; After : Node_Location := No_Trivia) return String; -- Return the original text for the node, using the charset of the -- corresponding analysis unit. function Raw_Signature (Token : Token_Reference; Charset : String) return String; -- Return the original text for the token, using the given charset. function Raw_Signature (First_Node, Last_Node : Ada_Node'Class; Before, After : Node_Location := No_Trivia) return String; -- Return the original text for the first node until the last node, -- using the charset of the corresponding analysis unit. function Are_Equal_As_Raw_Signature (Node1, Node2 : Ada_Node'Class) return Boolean; -- Return whether two AST nodes have the same original text. function Are_Equal_Case_Insensitive_As_Raw_Signature (Node1, Node2 : Ada_Node'Class) return Boolean; -- Return whether two AST nodes have the same original text -- when ignoring casing. -- Package (Distributed over files) functionality function In_Same_Package (Unit1, Unit2 : Analysis_Unit) return Boolean; -- Two analysis units are in the same package X -- when their files names (excluding the extension) are the same. -- For example, the analysis units with file names 'X.adb' and 'X.ads' -- are in the same package 'X'. -- Image -------- function Image (Node_List_Vector : Node_List.Vector) return String; -- Return the Image of each node. -- Get tokens -------- function Get_Trivia_Before (Node : Ada_Node'Class) return Token_List.Vector; -- Return the trivia (whitespace, comments) tokens -- in front of the AST node. function Get_Trivia_Before (Token : Token_Reference) return Token_List.Vector; -- Return the trivia (whitespace, comments) tokens -- in front of the token. function Get_Trivia_After (Node : Ada_Node'Class) return Token_List.Vector; -- Return the trivia (whitespace, comments) tokens -- after the AST node. function Get_Trivia_After (Token : Token_Reference) return Token_List.Vector; -- Return the trivia (whitespace, comments) tokens -- after the token. function Get_Tokens (Node : Ada_Node'Class) return Token_List.Vector; -- Return the tokens that form the AST node. end Rejuvenation.Utils;
37.455882
74
0.706321
10e9ff2bfb849914bf0cc5471a7b6d04a091cfb1
21,273
adb
Ada
firmware/coreboot/3rdparty/libgfxinit/common/ironlake/hw-gfx-gma-plls.adb
fabiojna02/OpenCellular
45b6a202d6b2e2485c89955b9a6da920c4d56ddb
[ "CC-BY-4.0", "BSD-3-Clause" ]
1
2019-11-04T07:11:25.000Z
2019-11-04T07:11:25.000Z
firmware/coreboot/3rdparty/libgfxinit/common/ironlake/hw-gfx-gma-plls.adb
aimin-wang/OpenCellular
5308146bf7edf43cc81c0e4d15305b711117070a
[ "CC-BY-4.0", "BSD-3-Clause" ]
13
2018-10-12T21:29:09.000Z
2018-10-25T20:06:51.000Z
firmware/coreboot/3rdparty/libgfxinit/common/ironlake/hw-gfx-gma-plls.adb
aimin-wang/OpenCellular
5308146bf7edf43cc81c0e4d15305b711117070a
[ "CC-BY-4.0", "BSD-3-Clause" ]
null
null
null
-- -- Copyright (C) 2015-2016 secunet Security Networks AG -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 2 of the License, or -- (at your option) any later version. -- -- This program is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -- GNU General Public License for more details. -- with HW.Time; with HW.GFX.GMA.Config; with HW.GFX.GMA.Registers; with HW.Debug; with GNAT.Source_Info; package body HW.GFX.GMA.PLLs with Refined_State => (State => PLLs) is Debug_Clocks : constant Boolean := False; type Count_Range is new Natural range 0 .. 2; type PLL_State is record Use_Count : Count_Range; Used_For_DP : Boolean; Link_Rate : DP_Bandwidth; Mode : Mode_Type; end record; type PLL_State_Array is array (DPLLs) of PLL_State; PLLs : PLL_State_Array; ---------------------------------------------------------------------------- subtype N_Range is Int64 range 3 .. 8; subtype M_Range is Int64 range 79 .. 128; subtype M1_Range is Int64 range 14 .. 25; subtype M2_Range is Int64 range 7 .. 12; subtype P_Range is Int64 range 5 .. 112; subtype P1_Range is Int64 range 1 .. 8; subtype P2_Range is Int64 range 5 .. 14; subtype VCO_Range is Int64 range 1760000000 .. 3510000000; subtype Clock_Range is HW.GFX.Frequency_Type; type Clock_Type is record N : N_Range; M1 : M1_Range; M2 : M2_Range; P1 : P1_Range; P2 : P2_Range; M : M_Range; P : P_Range; VCO : VCO_Range; Reference_Clock : Clock_Range; Dotclock : Clock_Range; end record; Invalid_Clock : constant Clock_Type := Clock_Type' (N => N_Range'Last, M1 => M1_Range'Last, M2 => M2_Range'Last, P1 => P1_Range'Last, P2 => P2_Range'Last, Reference_Clock => Clock_Range'Last, M => M_Range'Last, P => P_Range'Last, VCO => VCO_Range'Last, Dotclock => Clock_Range'Last); type Limits_Type is record N_Lower : N_Range; N_Upper : N_Range; M_Lower : M_Range; M_Upper : M_Range; M1_Lower : M1_Range; M1_Upper : M1_Range; M2_Lower : M2_Range; M2_Upper : M2_Range; P_Lower : P_Range; P_Upper : P_Range; P1_Lower : P1_Range; P1_Upper : P1_Range; P2_Fast : P2_Range; P2_Slow : P2_Range; P2_Threshold : Clock_Range; VCO_Lower : VCO_Range; VCO_Upper : VCO_Range; end record; LVDS_Single_Limits : constant Limits_Type := Limits_Type' (N_Lower => 3, N_Upper => 5, M_Lower => 79, M_Upper => 118, M1_Lower => 14, M1_Upper => 22, -- this is capped by M_Upper >= 5 * M1 + M2_Lower M2_Lower => 7, M2_Upper => 11, P_Lower => 28, P_Upper => 112, P1_Lower => 2, P1_Upper => 8, P2_Fast => 14, P2_Slow => 14, P2_Threshold => Clock_Range'First, VCO_Lower => 1_760_000_000, VCO_Upper => 3_510_000_000); LVDS_Dual_Limits : constant Limits_Type := Limits_Type' (N_Lower => 3, N_Upper => 5, M_Lower => 79, M_Upper => 127, M1_Lower => 14, M1_Upper => 24, M2_Lower => 7, M2_Upper => 11, P_Lower => 14, P_Upper => 56, P1_Lower => 2, P1_Upper => 8, P2_Fast => 7, P2_Slow => 7, P2_Threshold => Clock_Range'First, VCO_Lower => 1_760_000_000, VCO_Upper => 3_510_000_000); All_Other_Limits : constant Limits_Type := Limits_Type' (N_Lower => 3, N_Upper => 7, M_Lower => 79, M_Upper => 127, M1_Lower => 14, M1_Upper => 24, M2_Lower => 7, M2_Upper => 11, P_Lower => 5, P_Upper => 80, P1_Lower => 1, P1_Upper => 8, -- use P2_Slow if Dotclock <= P2_Threshold, P2_Fast otherwise P2_Fast => 5, P2_Slow => 10, P2_Threshold => 225_000_000, VCO_Lower => 1_760_000_000, VCO_Upper => 3_510_000_000); ---------------------------------------------------------------------------- type Regs is array (DPLLs) of Registers.Registers_Index; DPLL : constant Regs := Regs'(Registers.PCH_DPLL_A, Registers.PCH_DPLL_B); DPLL_VCO_ENABLE : constant := 1 * 2 ** 31; DPLL_P2_10_OR_14 : constant := 0 * 2 ** 24; DPLL_P2_5_OR_7 : constant := 1 * 2 ** 24; DPLL_P1_DIVIDER_SHIFT : constant := 16; DPLL_SDVOCLK : constant := 2 * 2 ** 13; DPLL_HIGH_SPEED : constant := 1 * 2 ** 30; DPLL_MODE_LVDS : constant := 2 * 2 ** 26; DPLL_MODE_DAC : constant := 1 * 2 ** 26; DPLL_DREFCLK : constant := 0 * 2 ** 13; DPLL_SSC : constant := 3 * 2 ** 13; MODE_DPLL_DAC_HDMI : constant Word32 := Word32' (DPLL_MODE_DAC or DPLL_DREFCLK or DPLL_HIGH_SPEED); MODE_DPLL_LVDS : constant Word32 := Word32' (DPLL_MODE_LVDS or DPLL_SSC); MODE_DPLL_DP : constant Word32 := Word32' (DPLL_MODE_DAC or DPLL_SSC or DPLL_HIGH_SPEED); type DPLL_Mode_Array is array (Display_Type) of Word32; DPLL_Mode : constant DPLL_Mode_Array := DPLL_Mode_Array' (LVDS => MODE_DPLL_LVDS, DP => MODE_DPLL_DP, others => MODE_DPLL_DAC_HDMI); FP0 : constant Regs := Regs'(Registers.PCH_FPA0, Registers.PCH_FPB0); FP1 : constant Regs := Regs'(Registers.PCH_FPA1, Registers.PCH_FPB1); FP_DOUBLE_CLOCK : constant := 1 * 2 ** 27; FP_N_SHIFT : constant := 16; FP_M1_SHIFT : constant := 8; FP_M2_SHIFT : constant := 0; ---------------------------------------------------------------------------- procedure Verify_Parameters (N : in N_Range; M1 : in M1_Range; M2 : in M2_Range; P1 : in P1_Range; P2 : in P2_Range; Reference_Clock : in Clock_Range; Current_Limits : in Limits_Type; Result : out Clock_Type; Valid : out Boolean) with Global => null, Pre => True, Post => True is M : Int64; P : Int64; VCO : Int64; Dotclock : Int64; begin pragma Debug (Debug_Clocks, Debug.Put_Line (GNAT.Source_Info.Enclosing_Entity)); M := 5 * M1 + M2; P := P1 * P2; VCO := (Int64 (Reference_Clock) * M) / N; Dotclock := VCO / P; pragma Debug (Debug_Clocks and not (Current_Limits.P1_Lower <= P1 and P1 <= Current_Limits.P1_Upper ), Debug.Put_Line ("P1 out of range.")); pragma Debug (Debug_Clocks and (Current_Limits.P2_Fast /= P2 and P2 /= Current_Limits.P2_Slow ), Debug.Put_Line ("P2 out of range.")); pragma Debug (Debug_Clocks and not (Current_Limits.P_Lower <= P and P <= Current_Limits.P_Upper ), Debug.Put_Line ("P out of range.")); pragma Debug (Debug_Clocks and not (Current_Limits.M1_Lower <= M1 and M1 <= Current_Limits.M1_Upper ), Debug.Put_Line ("M1 out of range.")); pragma Debug (Debug_Clocks and not (Current_Limits.M2_Lower <= M2 and M2 <= Current_Limits.M2_Upper ), Debug.Put_Line ("M2 out of range.")); -- pragma Debug (Debug_Clocks and not (M2 <= M1 ), Debug.Put_Line ("M1 greater thant M2.")); pragma Debug (Debug_Clocks and not (Current_Limits.N_Lower <= N and N <= Current_Limits.N_Upper ), Debug.Put_Line ("N out of range.")); pragma Debug (Debug_Clocks and not (Current_Limits.M_Lower <= M and M <= Current_Limits.M_Upper ), Debug.Put_Line ("M out of range.")); pragma Debug (Debug_Clocks and not (Current_Limits.VCO_Lower <= VCO and VCO <= Current_Limits.VCO_Upper), Debug.Put_Line ("VCO out of range.")); pragma Debug (Debug_Clocks and not (Int64 (Clock_Range'First) <= Dotclock), Debug.Put_Line ("Dotclock too low.")); pragma Debug (Debug_Clocks and not (Int64 (Clock_Range'First) <= Dotclock), Debug.Put_Int64 (Dotclock)); pragma Debug (Debug_Clocks and not (Int64 (Clock_Range'First) <= Dotclock), Debug.New_Line); pragma Debug (Debug_Clocks and not (Dotclock <= Int64 (Clock_Range'Last)), Debug.Put_Line ("Dotclock too high.")); pragma Debug (Debug_Clocks and not (Dotclock <= Int64 (Clock_Range'Last)), Debug.Put_Int64 (Dotclock)); pragma Debug (Debug_Clocks and not (Dotclock <= Int64 (Clock_Range'Last)), Debug.New_Line); Valid := Current_Limits.P1_Lower <= P1 and P1 <= Current_Limits.P1_Upper and (Current_Limits.P2_Fast = P2 or P2 = Current_Limits.P2_Slow) and Current_Limits.P_Lower <= P and P <= Current_Limits.P_Upper and Current_Limits.M1_Lower <= M1 and M1 <= Current_Limits.M1_Upper and Current_Limits.M2_Lower <= M2 and M2 <= Current_Limits.M2_Upper and -- M2 <= M1 and Current_Limits.N_Lower <= N and N <= Current_Limits.N_Upper and Current_Limits.M_Lower <= M and M <= Current_Limits.M_Upper and Current_Limits.VCO_Lower <= VCO and VCO <= Current_Limits.VCO_Upper and Int64 (Clock_Range'First) <= Dotclock and Dotclock <= Int64 (Clock_Range'Last); if Valid then Result := Clock_Type' (N => N, M1 => M1, M2 => M2, P1 => P1, P2 => P2, Reference_Clock => Reference_Clock, M => M, P => P, VCO => VCO, Dotclock => Clock_Range (Dotclock)); else Result := Invalid_Clock; end if; end Verify_Parameters; procedure Calculate_Clock_Parameters (Display : in Display_Type; Target_Dotclock : in Clock_Range; Reference_Clock : in Clock_Range; Best_Clock : out Clock_Type; Valid : out Boolean) with Global => null, Pre => True, Post => True is Limits : constant Limits_Type := (if Display = LVDS then (if Target_Dotclock >= Config.LVDS_Dual_Threshold then LVDS_Dual_Limits else LVDS_Single_Limits) else All_Other_Limits); P2 : P2_Range; Best_Delta : Int64 := Int64'Last; Current_Delta : Int64; Current_Clock : Clock_Type; Registers_Valid : Boolean; begin pragma Debug (Debug_Clocks, Debug.Put_Line (GNAT.Source_Info.Enclosing_Entity)); Valid := False; Best_Clock := Invalid_Clock; if Target_Dotclock <= Limits.P2_Threshold then P2 := Limits.P2_Slow; else P2 := Limits.P2_Fast; end if; for N in N_Range range Limits.N_Lower .. Limits.N_Upper loop -- reverse loops as hardware prefers higher values for M1 in reverse M1_Range range Limits.M1_Lower .. Limits.M1_Upper loop for M2 in reverse M2_Range range Limits.M2_Lower .. Limits.M2_Upper loop for P1 in reverse P1_Range range Limits.P1_Lower .. Limits.P1_Upper loop Verify_Parameters (N => N, M1 => M1, M2 => M2, P1 => P1, P2 => P2, Reference_Clock => Reference_Clock, Current_Limits => Limits, Result => Current_Clock, Valid => Registers_Valid); if Registers_Valid then if Current_Clock.Dotclock > Target_Dotclock then Current_Delta := Current_Clock.Dotclock - Target_Dotclock; else Current_Delta := Target_Dotclock - Current_Clock.Dotclock; end if; if Current_Delta < Best_Delta then Best_Delta := Current_Delta; Best_Clock := Current_Clock; Valid := True; end if; pragma Debug (Debug_Clocks, Debug.Put ("Current/Target/Best_Delta: ")); pragma Debug (Debug_Clocks, Debug.Put_Int64 (Current_Clock.Dotclock)); pragma Debug (Debug_Clocks, Debug.Put ("/")); pragma Debug (Debug_Clocks, Debug.Put_Int64 (Target_Dotclock)); pragma Debug (Debug_Clocks, Debug.Put ("/")); pragma Debug (Debug_Clocks, Debug.Put_Int64 (Best_Delta)); pragma Debug (Debug_Clocks, Debug.Put_Line (".")); end if; end loop; end loop; end loop; end loop; pragma Debug (Valid, Debug.Put_Line ("Valid clock found.")); pragma Debug (Valid, Debug.Put ("Best/Target/Delta: ")); pragma Debug (Valid, Debug.Put_Int64 (Best_Clock.Dotclock)); pragma Debug (Valid, Debug.Put ("/")); pragma Debug (Valid, Debug.Put_Int64 (Target_Dotclock)); pragma Debug (Valid, Debug.Put ("/")); pragma Debug (Valid, Debug.Put_Int64 (Best_Delta)); pragma Debug (Valid, Debug.Put_Line (".")); pragma Debug (not Valid, Debug.Put_Line ("No valid clock found.")); end Calculate_Clock_Parameters; procedure Program_DPLL (PLL : DPLLs; Display : Display_Type; Clk : Clock_Type) with Global => (In_Out => Registers.Register_State), Pre => True, Post => True is FP, Encoded_P1, Encoded_P2 : Word32; begin pragma Debug (Debug.Put_Line (GNAT.Source_Info.Enclosing_Entity)); FP := Shift_Left (Word32 (Clk.N - 2), FP_N_SHIFT) or Shift_Left (Word32 (Clk.M1 - 2), FP_M1_SHIFT) or Shift_Left (Word32 (Clk.M2 - 2), FP_M2_SHIFT); Registers.Write (FP0 (PLL), FP); Registers.Write (FP1 (PLL), FP); Encoded_P1 := Shift_Left (1, Natural (Clk.P1) - 1); if Clk.P2 = 5 or Clk.P2 = 7 then Encoded_P2 := DPLL_P2_5_OR_7; else Encoded_P2 := DPLL_P2_10_OR_14; end if; Registers.Write (Register => DPLL (PLL), Value => DPLL_Mode (Display) or Encoded_P2 or Shift_Left (Encoded_P1, DPLL_P1_DIVIDER_SHIFT) or Encoded_P1); end Program_DPLL; procedure On (PLL : in T; Port_Cfg : in Port_Config; Success : out Boolean) is Target_Clock : constant Frequency_Type := (if Port_Cfg.Display = DP then DP_Symbol_Rate (Port_Cfg.DP.Bandwidth) else Port_Cfg.Mode.Dotclock); Clk : Clock_Type; begin pragma Debug (Debug.Put_Line (GNAT.Source_Info.Enclosing_Entity)); Success := PLL in DPLLs; Clk := Invalid_Clock; if Success then if Port_Cfg.Display = DP then Success := True; -- we use static values for DP case Port_Cfg.DP.Bandwidth is when DP_Bandwidth_1_62 => Clk.N := 3; Clk.M1 := 14; Clk.M2 := 11; Clk.P1 := 2; Clk.P2 := 10; when DP_Bandwidth_2_7 => Clk.N := 4; Clk.M1 := 16; Clk.M2 := 10; Clk.P1 := 1; Clk.P2 := 10; when others => Success := False; end case; elsif Target_Clock <= 340_000_000 then Calculate_Clock_Parameters (Display => Port_Cfg.Display, Target_Dotclock => Target_Clock, -- should be, but doesn't has to be always the same: Reference_Clock => 120_000_000, Best_Clock => Clk, Valid => Success); else Success := False; pragma Debug (Debug.Put ("WARNING: Targeted clock too high: ")); pragma Debug (Debug.Put_Int64 (Target_Clock)); pragma Debug (Debug.Put (" > ")); pragma Debug (Debug.Put_Int32 (340_000_000)); pragma Debug (Debug.New_Line); pragma Debug (Debug.New_Line); end if; end if; if Success then Program_DPLL (PLL, Port_Cfg.Display, Clk); Registers.Set_Mask (DPLL (PLL), DPLL_VCO_ENABLE); Registers.Posting_Read (DPLL (PLL)); Time.U_Delay (150); end if; end On; procedure Off (PLL : T) is begin pragma Debug (Debug.Put_Line (GNAT.Source_Info.Enclosing_Entity)); if PLL in DPLLs then Registers.Unset_Mask (DPLL (PLL), DPLL_VCO_ENABLE); end if; end Off; ---------------------------------------------------------------------------- procedure Initialize is begin PLLs := (DPLLs => (Use_Count => 0, Used_For_DP => False, Link_Rate => DP_Bandwidth'First, Mode => Invalid_Mode)); end Initialize; procedure Alloc_Configurable (Port_Cfg : in Port_Config; PLL : out T; Success : out Boolean) with Pre => True is function Config_Matches (PE : PLL_State) return Boolean is begin return PE.Used_For_DP = (Port_Cfg.Display = DP) and ((PE.Used_For_DP and PE.Link_Rate = Port_Cfg.DP.Bandwidth) or (not PE.Used_For_DP and PE.Mode = Port_Cfg.Mode)); end Config_Matches; begin -- try to find shareable PLL for P in DPLLs loop Success := PLLs (P).Use_Count /= 0 and PLLs (P).Use_Count /= Count_Range'Last and Config_Matches (PLLs (P)); if Success then PLL := P; PLLs (PLL).Use_Count := PLLs (PLL).Use_Count + 1; return; end if; end loop; -- try to find free PLL for P in DPLLs loop if PLLs (P).Use_Count = 0 then PLL := P; On (PLL, Port_Cfg, Success); if Success then PLLs (PLL) := (Use_Count => 1, Used_For_DP => Port_Cfg.Display = DP, Link_Rate => Port_Cfg.DP.Bandwidth, Mode => Port_Cfg.Mode); end if; return; end if; end loop; PLL := Invalid; end Alloc_Configurable; procedure Alloc (Port_Cfg : in Port_Config; PLL : out T; Success : out Boolean) is begin pragma Debug (Debug.Put_Line (GNAT.Source_Info.Enclosing_Entity)); if Port_Cfg.Port = DIGI_A then PLL := Invalid; Success := True; else Alloc_Configurable (Port_Cfg, PLL, Success); end if; end Alloc; procedure Free (PLL : T) is begin pragma Debug (Debug.Put_Line (GNAT.Source_Info.Enclosing_Entity)); if PLL in DPLLs then if PLLs (PLL).Use_Count /= 0 then PLLs (PLL).Use_Count := PLLs (PLL).Use_Count - 1; if PLLs (PLL).Use_Count = 0 then Off (PLL); end if; end if; end if; end Free; procedure All_Off is begin pragma Debug (Debug.Put_Line (GNAT.Source_Info.Enclosing_Entity)); for PLL in DPLLs loop Off (PLL); end loop; end All_Off; function Register_Value (PLL : T) return Word32 is begin return (if PLL = DPLL_B then 1 else 0); end Register_Value; end HW.GFX.GMA.PLLs;
37.190559
150
0.519297
2ed5c2c0c6c9b2ec6bed63c15001b593fc9c8e61
10,525
adb
Ada
gcc-gcc-7_3_0-release/gcc/ada/a-suenst.adb
best08618/asylo
5a520a9f5c461ede0f32acc284017b737a43898c
[ "Apache-2.0" ]
7
2020-05-02T17:34:05.000Z
2021-10-17T10:15:18.000Z
gcc-gcc-7_3_0-release/gcc/ada/a-suenst.adb
best08618/asylo
5a520a9f5c461ede0f32acc284017b737a43898c
[ "Apache-2.0" ]
null
null
null
gcc-gcc-7_3_0-release/gcc/ada/a-suenst.adb
best08618/asylo
5a520a9f5c461ede0f32acc284017b737a43898c
[ "Apache-2.0" ]
2
2020-07-27T00:22:36.000Z
2021-04-01T09:41:02.000Z
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- ADA.STRINGS.UTF_ENCODING.STRINGS -- -- -- -- B o d y -- -- -- -- Copyright (C) 2010-2013, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ package body Ada.Strings.UTF_Encoding.Strings is use Interfaces; ------------ -- Decode -- ------------ -- Decode UTF-8/UTF-16BE/UTF-16LE input to String function Decode (Item : UTF_String; Input_Scheme : Encoding_Scheme) return String is begin if Input_Scheme = UTF_8 then return Decode (Item); else return Decode (To_UTF_16 (Item, Input_Scheme)); end if; end Decode; -- Decode UTF-8 input to String function Decode (Item : UTF_8_String) return String is Result : String (1 .. Item'Length); -- Result string (worst case is same length as input) Len : Natural := 0; -- Length of result stored so far Iptr : Natural; -- Input Item pointer C : Unsigned_8; R : Unsigned_16; procedure Get_Continuation; -- Reads a continuation byte of the form 10xxxxxx, shifts R left -- by 6 bits, and or's in the xxxxxx to the low order 6 bits. On -- return Ptr is incremented. Raises exception if continuation -- byte does not exist or is invalid. ---------------------- -- Get_Continuation -- ---------------------- procedure Get_Continuation is begin if Iptr > Item'Last then Raise_Encoding_Error (Iptr - 1); else C := To_Unsigned_8 (Item (Iptr)); Iptr := Iptr + 1; if C not in 2#10_000000# .. 2#10_111111# then Raise_Encoding_Error (Iptr - 1); else R := Shift_Left (R, 6) or Unsigned_16 (C and 2#00_111111#); end if; end if; end Get_Continuation; -- Start of processing for Decode begin Iptr := Item'First; -- Skip BOM at start if Item'Length >= 3 and then Item (Iptr .. Iptr + 2) = BOM_8 then Iptr := Iptr + 3; -- Error if bad BOM elsif Item'Length >= 2 and then (Item (Iptr .. Iptr + 1) = BOM_16BE or else Item (Iptr .. Iptr + 1) = BOM_16LE) then Raise_Encoding_Error (Iptr); end if; while Iptr <= Item'Last loop C := To_Unsigned_8 (Item (Iptr)); Iptr := Iptr + 1; -- Codes in the range 16#00# - 16#7F# are represented as -- 0xxxxxxx if C <= 16#7F# then R := Unsigned_16 (C); -- No initial code can be of the form 10xxxxxx. Such codes are used -- only for continuations. elsif C <= 2#10_111111# then Raise_Encoding_Error (Iptr - 1); -- Codes in the range 16#80# - 16#7FF# are represented as -- 110yyyxx 10xxxxxx elsif C <= 2#110_11111# then R := Unsigned_16 (C and 2#000_11111#); Get_Continuation; -- Codes in the range 16#800# - 16#FFFF# are represented as -- 1110yyyy 10yyyyxx 10xxxxxx -- Such codes are out of range for type Character -- Codes in the range 16#10000# - 16#10FFFF# are represented as -- 11110zzz 10zzyyyy 10yyyyxx 10xxxxxx -- Such codes are out of range for Wide_String output -- Thus all remaining cases raise Encoding_Error else Raise_Encoding_Error (Iptr - 1); end if; Len := Len + 1; -- The value may still be out of range of Standard.Character. We make -- the check explicit because the library is typically compiled with -- range checks disabled. if R > Character'Pos (Character'Last) then Raise_Encoding_Error (Iptr - 1); end if; Result (Len) := Character'Val (R); end loop; return Result (1 .. Len); end Decode; -- Decode UTF-16 input to String function Decode (Item : UTF_16_Wide_String) return String is Result : String (1 .. Item'Length); -- Result is same length as input (possibly minus 1 if BOM present) Len : Natural := 0; -- Length of result Iptr : Natural; -- Index of next Item element C : Unsigned_16; begin -- Skip UTF-16 BOM at start Iptr := Item'First; if Item'Length > 0 and then Item (Iptr) = BOM_16 (1) then Iptr := Iptr + 1; end if; -- Loop through input characters while Iptr <= Item'Last loop C := To_Unsigned_16 (Item (Iptr)); Iptr := Iptr + 1; -- Codes in the range 16#0000#..16#00FF# represent their own value if C <= 16#00FF# then Len := Len + 1; Result (Len) := Character'Val (C); -- All other codes are invalid, either they are invalid UTF-16 -- encoding sequences, or they represent values that are out of -- range for type Character. else Raise_Encoding_Error (Iptr - 1); end if; end loop; return Result (1 .. Len); end Decode; ------------ -- Encode -- ------------ -- Encode String in UTF-8, UTF-16BE or UTF-16LE function Encode (Item : String; Output_Scheme : Encoding_Scheme; Output_BOM : Boolean := False) return UTF_String is begin -- Case of UTF_8 if Output_Scheme = UTF_8 then return Encode (Item, Output_BOM); -- Case of UTF_16LE or UTF_16BE, use UTF-16 intermediary else return From_UTF_16 (UTF_16_Wide_String'(Encode (Item)), Output_Scheme, Output_BOM); end if; end Encode; -- Encode String in UTF-8 function Encode (Item : String; Output_BOM : Boolean := False) return UTF_8_String is Result : UTF_8_String (1 .. 3 * Item'Length + 3); -- Worst case is three bytes per input byte + space for BOM Len : Natural; -- Number of output codes stored in Result C : Unsigned_8; -- Single input character procedure Store (C : Unsigned_8); pragma Inline (Store); -- Store one output code, C is in the range 0 .. 255 ----------- -- Store -- ----------- procedure Store (C : Unsigned_8) is begin Len := Len + 1; Result (Len) := Character'Val (C); end Store; -- Start of processing for UTF8_Encode begin -- Output BOM if required if Output_BOM then Result (1 .. 3) := BOM_8; Len := 3; else Len := 0; end if; -- Loop through characters of input for J in Item'Range loop C := To_Unsigned_8 (Item (J)); -- Codes in the range 16#00# - 16#7F# are represented as -- 0xxxxxxx if C <= 16#7F# then Store (C); -- Codes in the range 16#80# - 16#7FF# are represented as -- 110yyyxx 10xxxxxx -- For type character of course, the limit is 16#FF# in any case else Store (2#110_00000# or Shift_Right (C, 6)); Store (2#10_000000# or (C and 2#00_111111#)); end if; end loop; return Result (1 .. Len); end Encode; -- Encode String in UTF-16 function Encode (Item : String; Output_BOM : Boolean := False) return UTF_16_Wide_String is Result : UTF_16_Wide_String (1 .. Item'Length + Boolean'Pos (Output_BOM)); -- Output is same length as input + possible BOM Len : Integer; -- Length of output string C : Unsigned_8; begin -- Output BOM if required if Output_BOM then Result (1) := BOM_16 (1); Len := 1; else Len := 0; end if; -- Loop through input characters encoding them for Iptr in Item'Range loop C := To_Unsigned_8 (Item (Iptr)); -- Codes in the range 16#0000#..16#00FF# are output unchanged. This -- includes all possible cases of Character values. Len := Len + 1; Result (Len) := Wide_Character'Val (C); end loop; return Result; end Encode; end Ada.Strings.UTF_Encoding.Strings;
29.985755
79
0.505273
9a35d06cfa688119ebfaa9dbceb78d0dd3e08c54
238,481
ads
Ada
src/fonts/geste_fonts-freeserif24pt7b.ads
Fabien-Chouteau/GESTE
5ac814906fdb49d880db60cbb17279cbbb777336
[ "BSD-3-Clause" ]
13
2018-07-31T12:11:46.000Z
2021-11-19T14:16:46.000Z
src/fonts/geste_fonts-freeserif24pt7b.ads
gregkrsak/GESTE
5ac814906fdb49d880db60cbb17279cbbb777336
[ "BSD-3-Clause" ]
1
2018-10-22T21:41:59.000Z
2018-10-22T21:41:59.000Z
src/fonts/geste_fonts-freeserif24pt7b.ads
gregkrsak/GESTE
5ac814906fdb49d880db60cbb17279cbbb777336
[ "BSD-3-Clause" ]
4
2020-07-03T10:03:13.000Z
2022-02-10T03:35:07.000Z
package GESTE_Fonts.FreeSerif24pt7b is Font : constant Bitmap_Font_Ref; private FreeSerif24pt7bBitmaps : aliased constant Font_Bitmap := ( 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#60#, 16#60#, 16#00#, 16#00#, 16#00#, 16#06#, 16#06#, 16#00#, 16#00#, 16#00#, 16#00#, 16#40#, 16#40#, 16#00#, 16#00#, 16#00#, 16#04#, 16#04#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#70#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#70#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#70#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#06#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#60#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#80#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#38#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#03#, 16#81#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#38#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#03#, 16#81#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#38#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#03#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#70#, 16#38#, 16#00#, 16#00#, 16#00#, 16#07#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#70#, 16#38#, 16#00#, 16#00#, 16#00#, 16#06#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#60#, 16#30#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#70#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#70#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#10#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#39#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#10#, 16#70#, 16#00#, 16#00#, 16#01#, 16#C1#, 16#03#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#10#, 16#30#, 16#00#, 16#00#, 16#01#, 16#C1#, 16#01#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#10#, 16#10#, 16#00#, 16#00#, 16#03#, 16#C1#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#10#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F1#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#90#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#7F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#11#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#01#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#10#, 16#78#, 16#00#, 16#00#, 16#00#, 16#01#, 16#07#, 16#80#, 16#00#, 16#00#, 16#20#, 16#10#, 16#38#, 16#00#, 16#00#, 16#02#, 16#01#, 16#03#, 16#80#, 16#00#, 16#00#, 16#30#, 16#10#, 16#38#, 16#00#, 16#00#, 16#03#, 16#01#, 16#07#, 16#80#, 16#00#, 16#00#, 16#38#, 16#10#, 16#78#, 16#00#, 16#00#, 16#03#, 16#C1#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#13#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#10#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#18#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#03#, 16#80#, 16#00#, 16#01#, 16#F3#, 16#C0#, 16#F0#, 16#00#, 16#00#, 16#3C#, 16#0F#, 16#F3#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#40#, 16#60#, 16#00#, 16#00#, 16#F8#, 16#04#, 16#0E#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#40#, 16#C0#, 16#00#, 16#01#, 16#F0#, 16#04#, 16#18#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#C1#, 16#80#, 16#00#, 16#01#, 16#E0#, 16#08#, 16#30#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#83#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#18#, 16#60#, 16#00#, 16#00#, 16#1C#, 16#01#, 16#0E#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#30#, 16#C0#, 16#7C#, 16#00#, 16#0E#, 16#06#, 16#1C#, 16#1F#, 16#E0#, 16#00#, 16#F1#, 16#C1#, 16#87#, 16#C7#, 16#00#, 16#07#, 16#F8#, 16#30#, 16#F8#, 16#30#, 16#00#, 16#3E#, 16#03#, 16#0F#, 16#01#, 16#00#, 16#00#, 16#00#, 16#61#, 16#E0#, 16#10#, 16#00#, 16#00#, 16#0E#, 16#3E#, 16#01#, 16#00#, 16#00#, 16#00#, 16#C3#, 16#C0#, 16#10#, 16#00#, 16#00#, 16#1C#, 16#3C#, 16#01#, 16#00#, 16#00#, 16#01#, 16#87#, 16#80#, 16#30#, 16#00#, 16#00#, 16#30#, 16#78#, 16#03#, 16#00#, 16#00#, 16#03#, 16#07#, 16#80#, 16#20#, 16#00#, 16#00#, 16#60#, 16#78#, 16#06#, 16#00#, 16#00#, 16#06#, 16#07#, 16#80#, 16#C0#, 16#00#, 16#00#, 16#C0#, 16#38#, 16#18#, 16#00#, 16#00#, 16#1C#, 16#03#, 16#C3#, 16#00#, 16#00#, 16#01#, 16#80#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#38#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E1#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#38#, 16#06#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#60#, 16#00#, 16#00#, 16#00#, 16#78#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C3#, 16#80#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#70#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#1F#, 16#F8#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#7E#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#38#, 16#00#, 16#00#, 16#0E#, 16#F8#, 16#03#, 16#80#, 16#00#, 16#03#, 16#C7#, 16#C0#, 16#30#, 16#00#, 16#00#, 16#78#, 16#7C#, 16#07#, 16#00#, 16#00#, 16#0F#, 16#03#, 16#E0#, 16#60#, 16#00#, 16#00#, 16#E0#, 16#3E#, 16#0C#, 16#00#, 16#00#, 16#1E#, 16#01#, 16#F0#, 16#C0#, 16#00#, 16#01#, 16#C0#, 16#1F#, 16#98#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#FB#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#1F#, 16#80#, 16#20#, 16#03#, 16#F0#, 16#03#, 16#FC#, 16#02#, 16#00#, 16#1F#, 16#80#, 16#77#, 16#F0#, 16#C0#, 16#01#, 16#FC#, 16#1C#, 16#3F#, 16#FC#, 16#00#, 16#07#, 16#FF#, 16#81#, 16#FF#, 16#80#, 16#00#, 16#1F#, 16#C0#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#40#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#20#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#20#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#00#, 16#04#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#, 16#02#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C1#, 16#87#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#18#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#F1#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#91#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#3D#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#74#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#74#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1D#, 16#38#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#11#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#F1#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#18#, 16#70#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#10#, 16#00#, 16#00#, 16#00#, 16#00#, 16#02#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C3#, 16#80#, 16#00#, 16#00#, 16#00#, 16#38#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#07#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#78#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#78#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#07#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#30#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C3#, 16#80#, 16#00#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#40#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#63#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#18#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#30#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#02#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#20#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#40#, 16#00#, 16#00#, 16#06#, 16#00#, 16#04#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#01#, 16#80#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#06#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#80#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#10#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#20#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#01#, 16#80#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#70#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#B8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1B#, 16#80#, 16#00#, 16#00#, 16#00#, 16#03#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#63#, 16#80#, 16#00#, 16#00#, 16#00#, 16#04#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C3#, 16#80#, 16#00#, 16#00#, 16#00#, 16#18#, 16#38#, 16#00#, 16#00#, 16#00#, 16#01#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#30#, 16#38#, 16#00#, 16#00#, 16#00#, 16#06#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#38#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#03#, 16#80#, 16#00#, 16#00#, 16#01#, 16#80#, 16#38#, 16#00#, 16#00#, 16#00#, 16#30#, 16#03#, 16#80#, 16#00#, 16#00#, 16#03#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#60#, 16#03#, 16#80#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#20#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#03#, 16#80#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#70#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E3#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#78#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#07#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#80#, 16#07#, 16#00#, 16#00#, 16#00#, 16#20#, 16#00#, 16#70#, 16#00#, 16#00#, 16#06#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#40#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#78#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#07#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#70#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#07#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#81#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#38#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F7#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#38#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#07#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#78#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#78#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#70#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#07#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#78#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#78#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#78#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#07#, 16#FE#, 16#78#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#8F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#02#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#10#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#10#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#78#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#3C#, 16#00#, 16#F8#, 16#07#, 16#00#, 16#03#, 16#C0#, 16#3F#, 16#DC#, 16#30#, 16#00#, 16#78#, 16#07#, 16#C7#, 16#C3#, 16#00#, 16#07#, 16#80#, 16#70#, 16#78#, 16#30#, 16#00#, 16#F0#, 16#0E#, 16#07#, 16#81#, 16#80#, 16#0F#, 16#01#, 16#E0#, 16#78#, 16#18#, 16#00#, 16#F0#, 16#1C#, 16#07#, 16#01#, 16#80#, 16#0F#, 16#03#, 16#C0#, 16#70#, 16#18#, 16#00#, 16#F0#, 16#38#, 16#07#, 16#03#, 16#00#, 16#0F#, 16#03#, 16#80#, 16#70#, 16#30#, 16#00#, 16#F0#, 16#38#, 16#0E#, 16#03#, 16#00#, 16#0F#, 16#03#, 16#80#, 16#E0#, 16#60#, 16#00#, 16#F0#, 16#38#, 16#1E#, 16#06#, 16#00#, 16#07#, 16#83#, 16#C1#, 16#E0#, 16#C0#, 16#00#, 16#78#, 16#3C#, 16#6E#, 16#18#, 16#00#, 16#03#, 16#81#, 16#FC#, 16#FF#, 16#00#, 16#00#, 16#3C#, 16#0F#, 16#03#, 16#E0#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#6F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C7#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#01#, 16#83#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#18#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#03#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#30#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#60#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#06#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#18#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#03#, 16#80#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#30#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#03#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#70#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#7F#, 16#C0#, 16#07#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#7F#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#78#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#7C#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#7F#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#80#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#98#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#7F#, 16#80#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#07#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#38#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#03#, 16#80#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#18#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#01#, 16#80#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#08#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#80#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#40#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#03#, 16#80#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#70#, 16#00#, 16#00#, 16#0F#, 16#E0#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#7F#, 16#80#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#02#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#20#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#06#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#60#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#02#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#20#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#30#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#07#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#60#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#07#, 16#E0#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#06#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#60#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#06#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#60#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#06#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#60#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#80#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#98#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#3F#, 16#80#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#0C#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#07#, 16#FF#, 16#80#, 16#03#, 16#E0#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FC#, 16#0F#, 16#FF#, 16#80#, 16#01#, 16#FE#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#0F#, 16#C0#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#0F#, 16#C0#, 16#01#, 16#F8#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#7F#, 16#FC#, 16#0F#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#07#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#CE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FC#, 16#1F#, 16#FE#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#78#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#07#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#03#, 16#80#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#70#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C3#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#78#, 16#00#, 16#00#, 16#00#, 16#07#, 16#CF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7D#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C7#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#07#, 16#C1#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#03#, 16#F8#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#7F#, 16#FC#, 16#1F#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#30#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#03#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#60#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#07#, 16#E0#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#FE#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#07#, 16#E0#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#07#, 16#F0#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#6F#, 16#80#, 16#06#, 16#F8#, 16#00#, 16#0E#, 16#F8#, 16#00#, 16#6F#, 16#C0#, 16#00#, 16#CF#, 16#80#, 16#06#, 16#7C#, 16#00#, 16#0C#, 16#F8#, 16#00#, 16#67#, 16#C0#, 16#01#, 16#8F#, 16#80#, 16#06#, 16#3E#, 16#00#, 16#18#, 16#F8#, 16#00#, 16#63#, 16#E0#, 16#03#, 16#8F#, 16#80#, 16#06#, 16#1F#, 16#00#, 16#30#, 16#F8#, 16#00#, 16#61#, 16#F0#, 16#07#, 16#0F#, 16#80#, 16#06#, 16#0F#, 16#80#, 16#60#, 16#F8#, 16#00#, 16#60#, 16#F8#, 16#06#, 16#0F#, 16#80#, 16#06#, 16#0F#, 16#C0#, 16#C0#, 16#F8#, 16#00#, 16#60#, 16#7C#, 16#0C#, 16#0F#, 16#80#, 16#06#, 16#07#, 16#E1#, 16#80#, 16#F8#, 16#00#, 16#60#, 16#3E#, 16#18#, 16#0F#, 16#80#, 16#06#, 16#03#, 16#F3#, 16#80#, 16#F8#, 16#00#, 16#60#, 16#1F#, 16#30#, 16#0F#, 16#80#, 16#06#, 16#01#, 16#F7#, 16#00#, 16#F8#, 16#00#, 16#60#, 16#0F#, 16#E0#, 16#0F#, 16#80#, 16#06#, 16#00#, 16#FE#, 16#00#, 16#F8#, 16#00#, 16#60#, 16#07#, 16#C0#, 16#0F#, 16#80#, 16#06#, 16#00#, 16#7C#, 16#00#, 16#F8#, 16#00#, 16#70#, 16#03#, 16#80#, 16#0F#, 16#80#, 16#07#, 16#00#, 16#38#, 16#01#, 16#F8#, 16#01#, 16#F8#, 16#03#, 16#00#, 16#3F#, 16#C0#, 16#7F#, 16#F0#, 16#10#, 16#0F#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#03#, 16#FF#, 16#80#, 16#01#, 16#FC#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#0F#, 16#E0#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#03#, 16#80#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#18#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#01#, 16#80#, 16#00#, 16#06#, 16#FC#, 16#00#, 16#18#, 16#00#, 16#00#, 16#67#, 16#E0#, 16#01#, 16#80#, 16#00#, 16#06#, 16#7F#, 16#00#, 16#18#, 16#00#, 16#00#, 16#63#, 16#F0#, 16#01#, 16#80#, 16#00#, 16#06#, 16#1F#, 16#80#, 16#18#, 16#00#, 16#00#, 16#60#, 16#FC#, 16#01#, 16#80#, 16#00#, 16#06#, 16#07#, 16#E0#, 16#18#, 16#00#, 16#00#, 16#60#, 16#7F#, 16#01#, 16#80#, 16#00#, 16#06#, 16#03#, 16#F0#, 16#18#, 16#00#, 16#00#, 16#60#, 16#1F#, 16#81#, 16#80#, 16#00#, 16#06#, 16#00#, 16#FC#, 16#18#, 16#00#, 16#00#, 16#60#, 16#07#, 16#E1#, 16#80#, 16#00#, 16#06#, 16#00#, 16#7F#, 16#18#, 16#00#, 16#00#, 16#60#, 16#03#, 16#F1#, 16#80#, 16#00#, 16#06#, 16#00#, 16#1F#, 16#98#, 16#00#, 16#00#, 16#60#, 16#00#, 16#FD#, 16#80#, 16#00#, 16#06#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#60#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#06#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#60#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#70#, 16#00#, 16#07#, 16#80#, 16#00#, 16#07#, 16#00#, 16#00#, 16#78#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#03#, 16#80#, 16#00#, 16#7F#, 16#F0#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#FC#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#C1#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#78#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#80#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#78#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#80#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#78#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#80#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#78#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#80#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#78#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#78#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#FC#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#78#, 16#00#, 16#07#, 16#80#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#F3#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#C1#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C7#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C1#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#07#, 16#E0#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#7F#, 16#FC#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C1#, 16#80#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#B8#, 16#00#, 16#00#, 16#00#, 16#78#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#38#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#01#, 16#80#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#18#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#80#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#08#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#20#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#02#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#30#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#03#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#38#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#11#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#78#, 16#0F#, 16#80#, 16#F0#, 16#00#, 16#06#, 16#00#, 16#F8#, 16#07#, 16#00#, 16#00#, 16#60#, 16#0F#, 16#80#, 16#30#, 16#00#, 16#04#, 16#00#, 16#F8#, 16#03#, 16#00#, 16#00#, 16#40#, 16#0F#, 16#80#, 16#10#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FC#, 16#03#, 16#FF#, 16#80#, 16#01#, 16#FE#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#38#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#03#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#18#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#18#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#18#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#18#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#18#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#18#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#18#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#18#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#18#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#18#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#03#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#30#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#03#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#60#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#06#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#78#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#F8#, 16#01#, 16#FF#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#03#, 16#80#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#38#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#03#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#70#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#06#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#60#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#01#, 16#80#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#18#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#03#, 16#80#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#30#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#07#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#60#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#06#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#8C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F9#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#D8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7D#, 16#80#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#04#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#F1#, 16#FF#, 16#F0#, 16#1F#, 16#F3#, 16#F8#, 16#07#, 16#F8#, 16#00#, 16#7C#, 16#1F#, 16#80#, 16#3F#, 16#00#, 16#03#, 16#80#, 16#F8#, 16#01#, 16#F0#, 16#00#, 16#30#, 16#0F#, 16#80#, 16#1F#, 16#00#, 16#03#, 16#00#, 16#7C#, 16#00#, 16#F8#, 16#00#, 16#30#, 16#07#, 16#C0#, 16#0F#, 16#80#, 16#06#, 16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#60#, 16#03#, 16#E0#, 16#07#, 16#C0#, 16#06#, 16#00#, 16#3E#, 16#00#, 16#7C#, 16#00#, 16#C0#, 16#01#, 16#F0#, 16#07#, 16#E0#, 16#0C#, 16#00#, 16#1F#, 16#00#, 16#FE#, 16#01#, 16#C0#, 16#01#, 16#F0#, 16#0D#, 16#E0#, 16#18#, 16#00#, 16#0F#, 16#80#, 16#DF#, 16#01#, 16#80#, 16#00#, 16#F8#, 16#19#, 16#F0#, 16#30#, 16#00#, 16#07#, 16#C1#, 16#8F#, 16#83#, 16#00#, 16#00#, 16#7C#, 16#38#, 16#F8#, 16#30#, 16#00#, 16#07#, 16#C3#, 16#0F#, 16#86#, 16#00#, 16#00#, 16#3E#, 16#30#, 16#7C#, 16#60#, 16#00#, 16#03#, 16#E7#, 16#07#, 16#CE#, 16#00#, 16#00#, 16#3E#, 16#60#, 16#3E#, 16#C0#, 16#00#, 16#01#, 16#F6#, 16#03#, 16#EC#, 16#00#, 16#00#, 16#1F#, 16#E0#, 16#3F#, 16#C0#, 16#00#, 16#01#, 16#FC#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#F8#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#60#, 16#00#, 16#00#, 16#03#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#20#, 16#00#, 16#20#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FE#, 16#03#, 16#FF#, 16#80#, 16#01#, 16#FF#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#70#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#03#, 16#80#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#70#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#06#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FB#, 16#80#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C7#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#18#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#03#, 16#81#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#70#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#18#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#03#, 16#80#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#70#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#0F#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#3F#, 16#E0#, 16#00#, 16#FF#, 16#E0#, 16#1F#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FC#, 16#03#, 16#FF#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#78#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#07#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#60#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#18#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#03#, 16#80#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#70#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#06#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#9C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F9#, 16#80#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#03#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#03#, 16#80#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#30#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#02#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#20#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#02#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#01#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#30#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#03#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#70#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#07#, 16#FF#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#EE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#CF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#70#, 16#00#, 16#00#, 16#00#, 16#07#, 16#87#, 16#80#, 16#00#, 16#00#, 16#00#, 16#70#, 16#38#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#07#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E1#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#70#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#07#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#78#, 16#00#, 16#00#, 16#00#, 16#18#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#78#, 16#00#, 16#00#, 16#00#, 16#03#, 16#87#, 16#80#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#78#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#07#, 16#80#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#78#, 16#00#, 16#00#, 16#00#, 16#38#, 16#07#, 16#80#, 16#00#, 16#00#, 16#07#, 16#80#, 16#78#, 16#00#, 16#00#, 16#00#, 16#78#, 16#07#, 16#80#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#03#, 16#FE#, 16#7F#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#83#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#F7#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C3#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#81#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#07#, 16#87#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#20#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#06#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#18#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#EF#, 16#00#, 16#00#, 16#00#, 16#07#, 16#87#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#83#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#EF#, 16#80#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#18#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#80#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#01#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#20#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#06#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#01#, 16#87#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#38#, 16#38#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#1E#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#38#, 16#00#, 16#00#, 16#00#, 16#07#, 16#87#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#02#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#40#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#03#, 16#80#, 16#00#, 16#00#, 16#18#, 16#00#, 16#18#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#80#, 16#00#, 16#00#, 16#70#, 16#00#, 16#08#, 16#00#, 16#00#, 16#07#, 16#00#, 16#01#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#10#, 16#00#, 16#00#, 16#07#, 16#80#, 16#06#, 16#00#, 16#00#, 16#00#, 16#7E#, 16#01#, 16#80#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#20#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#01#, 16#E7#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#C3#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#FF#, 16#E7#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#10#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#06#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F9#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#07#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#30#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#06#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F3#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F3#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F1#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#78#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#1F#, 16#C0#, 16#00#, 16#00#, 16#FF#, 16#E3#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#0F#, 16#80#, 16#FC#, 16#00#, 16#07#, 16#F3#, 16#FE#, 16#3F#, 16#E0#, 16#00#, 16#1F#, 16#E1#, 16#FE#, 16#1F#, 16#00#, 16#00#, 16#F8#, 16#0F#, 16#80#, 16#F0#, 16#00#, 16#0F#, 16#00#, 16#F0#, 16#07#, 16#80#, 16#00#, 16#F0#, 16#0F#, 16#00#, 16#78#, 16#00#, 16#0F#, 16#00#, 16#F0#, 16#07#, 16#80#, 16#00#, 16#F0#, 16#0F#, 16#00#, 16#78#, 16#00#, 16#0F#, 16#00#, 16#F0#, 16#07#, 16#80#, 16#00#, 16#F0#, 16#0F#, 16#00#, 16#78#, 16#00#, 16#0F#, 16#00#, 16#F0#, 16#07#, 16#80#, 16#00#, 16#F0#, 16#0F#, 16#00#, 16#78#, 16#00#, 16#0F#, 16#00#, 16#F0#, 16#07#, 16#80#, 16#00#, 16#F0#, 16#0F#, 16#00#, 16#78#, 16#00#, 16#0F#, 16#00#, 16#F0#, 16#07#, 16#80#, 16#00#, 16#F0#, 16#0F#, 16#00#, 16#78#, 16#00#, 16#0F#, 16#00#, 16#F0#, 16#07#, 16#80#, 16#00#, 16#F0#, 16#0F#, 16#00#, 16#78#, 16#00#, 16#0F#, 16#00#, 16#F8#, 16#07#, 16#80#, 16#01#, 16#F8#, 16#1F#, 16#80#, 16#FC#, 16#00#, 16#FF#, 16#E7#, 16#FF#, 16#3F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#E7#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#C3#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#7F#, 16#E7#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#07#, 16#87#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#78#, 16#00#, 16#00#, 16#03#, 16#80#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#78#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#07#, 16#80#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#03#, 16#80#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#78#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C3#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#07#, 16#F7#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#C1#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C1#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#F7#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#10#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#F3#, 16#00#, 16#00#, 16#00#, 16#07#, 16#83#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#80#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#83#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#EF#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F3#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#5F#, 16#4F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#70#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#E4#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C3#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#18#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#38#, 16#04#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#40#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#04#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#20#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#02#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#20#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#38#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C1#, 16#80#, 16#00#, 16#00#, 16#00#, 16#27#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#20#, 16#00#, 16#00#, 16#00#, 16#00#, 16#02#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#0F#, 16#F0#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#01#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#86#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#CF#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#81#, 16#FC#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#07#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#70#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#06#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#04#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#78#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#07#, 16#81#, 16#80#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#18#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C1#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#30#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E3#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#60#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F6#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#40#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#8F#, 16#F8#, 16#3F#, 16#00#, 16#07#, 16#E0#, 16#7E#, 16#00#, 16#E0#, 16#00#, 16#3E#, 16#03#, 16#C0#, 16#0C#, 16#00#, 16#01#, 16#E0#, 16#3E#, 16#00#, 16#C0#, 16#00#, 16#1E#, 16#01#, 16#E0#, 16#0C#, 16#00#, 16#01#, 16#E0#, 16#1E#, 16#01#, 16#80#, 16#00#, 16#0F#, 16#00#, 16#F0#, 16#18#, 16#00#, 16#00#, 16#F0#, 16#1F#, 16#01#, 16#00#, 16#00#, 16#07#, 16#81#, 16#F0#, 16#30#, 16#00#, 16#00#, 16#78#, 16#17#, 16#83#, 16#00#, 16#00#, 16#07#, 16#83#, 16#78#, 16#60#, 16#00#, 16#00#, 16#3C#, 16#33#, 16#86#, 16#00#, 16#00#, 16#03#, 16#C6#, 16#3C#, 16#40#, 16#00#, 16#00#, 16#1C#, 16#63#, 16#CC#, 16#00#, 16#00#, 16#01#, 16#EC#, 16#1E#, 16#C0#, 16#00#, 16#00#, 16#1E#, 16#C1#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#70#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#60#, 16#06#, 16#00#, 16#00#, 16#00#, 16#02#, 16#00#, 16#20#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#E7#, 16#F0#, 16#00#, 16#00#, 16#01#, 16#F8#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#83#, 16#80#, 16#00#, 16#00#, 16#00#, 16#78#, 16#30#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C6#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#01#, 16#EC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#DE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#19#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#78#, 16#00#, 16#00#, 16#00#, 16#06#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#3F#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#07#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#FC#, 16#00#, 16#00#, 16#03#, 16#F0#, 16#07#, 16#80#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#30#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#06#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#06#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#78#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#18#, 16#00#, 16#00#, 16#00#, 16#03#, 16#E1#, 16#80#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#10#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F3#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#30#, 16#07#, 16#80#, 16#00#, 16#00#, 16#02#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#20#, 16#1F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#80#, 16#20#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#02#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#60#, 16#00#, 16#00#, 16#03#, 16#E0#, 16#06#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#F0#, 16#18#, 16#00#, 16#00#, 16#03#, 16#87#, 16#C3#, 16#C0#, 16#00#, 16#00#, 16#70#, 16#1F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#); Font_D : aliased constant Bitmap_Font := ( Bytes_Per_Glyph => 308, Glyph_Width => 44, Glyph_Height => 56, Data => FreeSerif24pt7bBitmaps'Access); Font : constant Bitmap_Font_Ref := Font_D'Access; end GESTE_Fonts.FreeSerif24pt7b;
73.764615
73
0.48684
1aa7ccc50ccbc01fcb47ee6e621eb7c069f27a34
58,719
adb
Ada
bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-stwisu.adb
JCGobbi/Nucleo-STM32F334R8
2a0b1b4b2664c92773703ac5e95dcb71979d051c
[ "BSD-3-Clause" ]
null
null
null
bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-stwisu.adb
JCGobbi/Nucleo-STM32F334R8
2a0b1b4b2664c92773703ac5e95dcb71979d051c
[ "BSD-3-Clause" ]
null
null
null
bb-runtimes/runtimes/ravenscar-full-stm32f3x4/gnat/a-stwisu.adb
JCGobbi/Nucleo-STM32F334R8
2a0b1b4b2664c92773703ac5e95dcb71979d051c
[ "BSD-3-Clause" ]
null
null
null
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- A D A . S T R I N G S . W I D E _ S U P E R B O U N D E D -- -- -- -- B o d y -- -- -- -- Copyright (C) 2003-2021, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- -- -- -- -- -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Ada.Strings.Wide_Maps; use Ada.Strings.Wide_Maps; with Ada.Strings.Wide_Search; package body Ada.Strings.Wide_Superbounded is ------------ -- Concat -- ------------ function Concat (Left : Super_String; Right : Super_String) return Super_String is begin return Result : Super_String (Left.Max_Length) do declare Llen : constant Natural := Left.Current_Length; Rlen : constant Natural := Right.Current_Length; Nlen : constant Natural := Llen + Rlen; begin if Nlen > Left.Max_Length then raise Ada.Strings.Length_Error; else Result.Current_Length := Nlen; Result.Data (1 .. Llen) := Left.Data (1 .. Llen); Result.Data (Llen + 1 .. Nlen) := Right.Data (1 .. Rlen); end if; end; end return; end Concat; function Concat (Left : Super_String; Right : Wide_String) return Super_String is begin return Result : Super_String (Left.Max_Length) do declare Llen : constant Natural := Left.Current_Length; Nlen : constant Natural := Llen + Right'Length; begin if Nlen > Left.Max_Length then raise Ada.Strings.Length_Error; else Result.Current_Length := Nlen; Result.Data (1 .. Llen) := Left.Data (1 .. Llen); Result.Data (Llen + 1 .. Nlen) := Right; end if; end; end return; end Concat; function Concat (Left : Wide_String; Right : Super_String) return Super_String is begin return Result : Super_String (Right.Max_Length) do declare Llen : constant Natural := Left'Length; Rlen : constant Natural := Right.Current_Length; Nlen : constant Natural := Llen + Rlen; begin if Nlen > Right.Max_Length then raise Ada.Strings.Length_Error; else Result.Current_Length := Nlen; Result.Data (1 .. Llen) := Left; Result.Data (Llen + 1 .. Nlen) := Right.Data (1 .. Rlen); end if; end; end return; end Concat; function Concat (Left : Super_String; Right : Wide_Character) return Super_String is begin return Result : Super_String (Left.Max_Length) do declare Llen : constant Natural := Left.Current_Length; begin if Llen = Left.Max_Length then raise Ada.Strings.Length_Error; else Result.Current_Length := Llen + 1; Result.Data (1 .. Llen) := Left.Data (1 .. Llen); Result.Data (Result.Current_Length) := Right; end if; end; end return; end Concat; function Concat (Left : Wide_Character; Right : Super_String) return Super_String is begin return Result : Super_String (Right.Max_Length) do declare Rlen : constant Natural := Right.Current_Length; begin if Rlen = Right.Max_Length then raise Ada.Strings.Length_Error; else Result.Current_Length := Rlen + 1; Result.Data (1) := Left; Result.Data (2 .. Result.Current_Length) := Right.Data (1 .. Rlen); end if; end; end return; end Concat; ----------- -- Equal -- ----------- function "=" (Left : Super_String; Right : Super_String) return Boolean is begin return Left.Current_Length = Right.Current_Length and then Left.Data (1 .. Left.Current_Length) = Right.Data (1 .. Right.Current_Length); end "="; function Equal (Left : Super_String; Right : Wide_String) return Boolean is begin return Left.Current_Length = Right'Length and then Left.Data (1 .. Left.Current_Length) = Right; end Equal; function Equal (Left : Wide_String; Right : Super_String) return Boolean is begin return Left'Length = Right.Current_Length and then Left = Right.Data (1 .. Right.Current_Length); end Equal; ------------- -- Greater -- ------------- function Greater (Left : Super_String; Right : Super_String) return Boolean is begin return Left.Data (1 .. Left.Current_Length) > Right.Data (1 .. Right.Current_Length); end Greater; function Greater (Left : Super_String; Right : Wide_String) return Boolean is begin return Left.Data (1 .. Left.Current_Length) > Right; end Greater; function Greater (Left : Wide_String; Right : Super_String) return Boolean is begin return Left > Right.Data (1 .. Right.Current_Length); end Greater; ---------------------- -- Greater_Or_Equal -- ---------------------- function Greater_Or_Equal (Left : Super_String; Right : Super_String) return Boolean is begin return Left.Data (1 .. Left.Current_Length) >= Right.Data (1 .. Right.Current_Length); end Greater_Or_Equal; function Greater_Or_Equal (Left : Super_String; Right : Wide_String) return Boolean is begin return Left.Data (1 .. Left.Current_Length) >= Right; end Greater_Or_Equal; function Greater_Or_Equal (Left : Wide_String; Right : Super_String) return Boolean is begin return Left >= Right.Data (1 .. Right.Current_Length); end Greater_Or_Equal; ---------- -- Less -- ---------- function Less (Left : Super_String; Right : Super_String) return Boolean is begin return Left.Data (1 .. Left.Current_Length) < Right.Data (1 .. Right.Current_Length); end Less; function Less (Left : Super_String; Right : Wide_String) return Boolean is begin return Left.Data (1 .. Left.Current_Length) < Right; end Less; function Less (Left : Wide_String; Right : Super_String) return Boolean is begin return Left < Right.Data (1 .. Right.Current_Length); end Less; ------------------- -- Less_Or_Equal -- ------------------- function Less_Or_Equal (Left : Super_String; Right : Super_String) return Boolean is begin return Left.Data (1 .. Left.Current_Length) <= Right.Data (1 .. Right.Current_Length); end Less_Or_Equal; function Less_Or_Equal (Left : Super_String; Right : Wide_String) return Boolean is begin return Left.Data (1 .. Left.Current_Length) <= Right; end Less_Or_Equal; function Less_Or_Equal (Left : Wide_String; Right : Super_String) return Boolean is begin return Left <= Right.Data (1 .. Right.Current_Length); end Less_Or_Equal; ---------------------- -- Set_Super_String -- ---------------------- procedure Set_Super_String (Target : out Super_String; Source : Wide_String; Drop : Truncation := Error) is Slen : constant Natural := Source'Length; Max_Length : constant Positive := Target.Max_Length; begin if Slen <= Max_Length then Target.Current_Length := Slen; Target.Data (1 .. Slen) := Source; else case Drop is when Strings.Right => Target.Current_Length := Max_Length; Target.Data (1 .. Max_Length) := Source (Source'First .. Source'First - 1 + Max_Length); when Strings.Left => Target.Current_Length := Max_Length; Target.Data (1 .. Max_Length) := Source (Source'Last - (Max_Length - 1) .. Source'Last); when Strings.Error => raise Ada.Strings.Length_Error; end case; end if; end Set_Super_String; ------------------ -- Super_Append -- ------------------ -- Case of Super_String and Super_String function Super_Append (Left : Super_String; Right : Super_String; Drop : Strings.Truncation := Strings.Error) return Super_String is Max_Length : constant Positive := Left.Max_Length; Result : Super_String (Max_Length); Llen : constant Natural := Left.Current_Length; Rlen : constant Natural := Right.Current_Length; Nlen : constant Natural := Llen + Rlen; begin if Nlen <= Max_Length then Result.Current_Length := Nlen; Result.Data (1 .. Llen) := Left.Data (1 .. Llen); Result.Data (Llen + 1 .. Nlen) := Right.Data (1 .. Rlen); else Result.Current_Length := Max_Length; case Drop is when Strings.Right => if Llen >= Max_Length then -- only case is Llen = Max_Length Result.Data := Left.Data; else Result.Data (1 .. Llen) := Left.Data (1 .. Llen); Result.Data (Llen + 1 .. Max_Length) := Right.Data (1 .. Max_Length - Llen); end if; when Strings.Left => if Rlen >= Max_Length then -- only case is Rlen = Max_Length Result.Data := Right.Data; else Result.Data (1 .. Max_Length - Rlen) := Left.Data (Llen - (Max_Length - Rlen - 1) .. Llen); Result.Data (Max_Length - Rlen + 1 .. Max_Length) := Right.Data (1 .. Rlen); end if; when Strings.Error => raise Ada.Strings.Length_Error; end case; end if; return Result; end Super_Append; procedure Super_Append (Source : in out Super_String; New_Item : Super_String; Drop : Truncation := Error) is Max_Length : constant Positive := Source.Max_Length; Llen : constant Natural := Source.Current_Length; Rlen : constant Natural := New_Item.Current_Length; Nlen : constant Natural := Llen + Rlen; begin if Nlen <= Max_Length then Source.Current_Length := Nlen; Source.Data (Llen + 1 .. Nlen) := New_Item.Data (1 .. Rlen); else Source.Current_Length := Max_Length; case Drop is when Strings.Right => if Llen < Max_Length then Source.Data (Llen + 1 .. Max_Length) := New_Item.Data (1 .. Max_Length - Llen); end if; when Strings.Left => if Rlen >= Max_Length then -- only case is Rlen = Max_Length Source.Data := New_Item.Data; else Source.Data (1 .. Max_Length - Rlen) := Source.Data (Llen - (Max_Length - Rlen - 1) .. Llen); Source.Data (Max_Length - Rlen + 1 .. Max_Length) := New_Item.Data (1 .. Rlen); end if; when Strings.Error => raise Ada.Strings.Length_Error; end case; end if; end Super_Append; -- Case of Super_String and Wide_String function Super_Append (Left : Super_String; Right : Wide_String; Drop : Strings.Truncation := Strings.Error) return Super_String is Max_Length : constant Positive := Left.Max_Length; Result : Super_String (Max_Length); Llen : constant Natural := Left.Current_Length; Rlen : constant Natural := Right'Length; Nlen : constant Natural := Llen + Rlen; begin if Nlen <= Max_Length then Result.Current_Length := Nlen; Result.Data (1 .. Llen) := Left.Data (1 .. Llen); Result.Data (Llen + 1 .. Nlen) := Right; else Result.Current_Length := Max_Length; case Drop is when Strings.Right => if Llen >= Max_Length then -- only case is Llen = Max_Length Result.Data := Left.Data; else Result.Data (1 .. Llen) := Left.Data (1 .. Llen); Result.Data (Llen + 1 .. Max_Length) := Right (Right'First .. Right'First - 1 + Max_Length - Llen); end if; when Strings.Left => if Rlen >= Max_Length then Result.Data (1 .. Max_Length) := Right (Right'Last - (Max_Length - 1) .. Right'Last); else Result.Data (1 .. Max_Length - Rlen) := Left.Data (Llen - (Max_Length - Rlen - 1) .. Llen); Result.Data (Max_Length - Rlen + 1 .. Max_Length) := Right; end if; when Strings.Error => raise Ada.Strings.Length_Error; end case; end if; return Result; end Super_Append; procedure Super_Append (Source : in out Super_String; New_Item : Wide_String; Drop : Truncation := Error) is Max_Length : constant Positive := Source.Max_Length; Llen : constant Natural := Source.Current_Length; Rlen : constant Natural := New_Item'Length; Nlen : constant Natural := Llen + Rlen; begin if Nlen <= Max_Length then Source.Current_Length := Nlen; Source.Data (Llen + 1 .. Nlen) := New_Item; else Source.Current_Length := Max_Length; case Drop is when Strings.Right => if Llen < Max_Length then Source.Data (Llen + 1 .. Max_Length) := New_Item (New_Item'First .. New_Item'First - 1 + Max_Length - Llen); end if; when Strings.Left => if Rlen >= Max_Length then Source.Data (1 .. Max_Length) := New_Item (New_Item'Last - (Max_Length - 1) .. New_Item'Last); else Source.Data (1 .. Max_Length - Rlen) := Source.Data (Llen - (Max_Length - Rlen - 1) .. Llen); Source.Data (Max_Length - Rlen + 1 .. Max_Length) := New_Item; end if; when Strings.Error => raise Ada.Strings.Length_Error; end case; end if; end Super_Append; -- Case of Wide_String and Super_String function Super_Append (Left : Wide_String; Right : Super_String; Drop : Strings.Truncation := Strings.Error) return Super_String is Max_Length : constant Positive := Right.Max_Length; Result : Super_String (Max_Length); Llen : constant Natural := Left'Length; Rlen : constant Natural := Right.Current_Length; Nlen : constant Natural := Llen + Rlen; begin if Nlen <= Max_Length then Result.Current_Length := Nlen; Result.Data (1 .. Llen) := Left; Result.Data (Llen + 1 .. Llen + Rlen) := Right.Data (1 .. Rlen); else Result.Current_Length := Max_Length; case Drop is when Strings.Right => if Llen >= Max_Length then Result.Data (1 .. Max_Length) := Left (Left'First .. Left'First + (Max_Length - 1)); else Result.Data (1 .. Llen) := Left; Result.Data (Llen + 1 .. Max_Length) := Right.Data (1 .. Max_Length - Llen); end if; when Strings.Left => if Rlen >= Max_Length then Result.Data (1 .. Max_Length) := Right.Data (Rlen - (Max_Length - 1) .. Rlen); else Result.Data (1 .. Max_Length - Rlen) := Left (Left'Last - (Max_Length - Rlen - 1) .. Left'Last); Result.Data (Max_Length - Rlen + 1 .. Max_Length) := Right.Data (1 .. Rlen); end if; when Strings.Error => raise Ada.Strings.Length_Error; end case; end if; return Result; end Super_Append; -- Case of Super_String and Wide_Character function Super_Append (Left : Super_String; Right : Wide_Character; Drop : Strings.Truncation := Strings.Error) return Super_String is Max_Length : constant Positive := Left.Max_Length; Result : Super_String (Max_Length); Llen : constant Natural := Left.Current_Length; begin if Llen < Max_Length then Result.Current_Length := Llen + 1; Result.Data (1 .. Llen) := Left.Data (1 .. Llen); Result.Data (Llen + 1) := Right; return Result; else case Drop is when Strings.Right => return Left; when Strings.Left => Result.Current_Length := Max_Length; Result.Data (1 .. Max_Length - 1) := Left.Data (2 .. Max_Length); Result.Data (Max_Length) := Right; return Result; when Strings.Error => raise Ada.Strings.Length_Error; end case; end if; end Super_Append; procedure Super_Append (Source : in out Super_String; New_Item : Wide_Character; Drop : Truncation := Error) is Max_Length : constant Positive := Source.Max_Length; Llen : constant Natural := Source.Current_Length; begin if Llen < Max_Length then Source.Current_Length := Llen + 1; Source.Data (Llen + 1) := New_Item; else Source.Current_Length := Max_Length; case Drop is when Strings.Right => null; when Strings.Left => Source.Data (1 .. Max_Length - 1) := Source.Data (2 .. Max_Length); Source.Data (Max_Length) := New_Item; when Strings.Error => raise Ada.Strings.Length_Error; end case; end if; end Super_Append; -- Case of Wide_Character and Super_String function Super_Append (Left : Wide_Character; Right : Super_String; Drop : Strings.Truncation := Strings.Error) return Super_String is Max_Length : constant Positive := Right.Max_Length; Result : Super_String (Max_Length); Rlen : constant Natural := Right.Current_Length; begin if Rlen < Max_Length then Result.Current_Length := Rlen + 1; Result.Data (1) := Left; Result.Data (2 .. Rlen + 1) := Right.Data (1 .. Rlen); return Result; else case Drop is when Strings.Right => Result.Current_Length := Max_Length; Result.Data (1) := Left; Result.Data (2 .. Max_Length) := Right.Data (1 .. Max_Length - 1); return Result; when Strings.Left => return Right; when Strings.Error => raise Ada.Strings.Length_Error; end case; end if; end Super_Append; ----------------- -- Super_Count -- ----------------- function Super_Count (Source : Super_String; Pattern : Wide_String; Mapping : Wide_Maps.Wide_Character_Mapping := Wide_Maps.Identity) return Natural is begin return Wide_Search.Count (Source.Data (1 .. Source.Current_Length), Pattern, Mapping); end Super_Count; function Super_Count (Source : Super_String; Pattern : Wide_String; Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Natural is begin return Wide_Search.Count (Source.Data (1 .. Source.Current_Length), Pattern, Mapping); end Super_Count; function Super_Count (Source : Super_String; Set : Wide_Maps.Wide_Character_Set) return Natural is begin return Wide_Search.Count (Source.Data (1 .. Source.Current_Length), Set); end Super_Count; ------------------ -- Super_Delete -- ------------------ function Super_Delete (Source : Super_String; From : Positive; Through : Natural) return Super_String is Result : Super_String (Source.Max_Length); Slen : constant Natural := Source.Current_Length; Num_Delete : constant Integer := Through - From + 1; begin if Num_Delete <= 0 then return Source; elsif From > Slen + 1 then raise Ada.Strings.Index_Error; elsif Through >= Slen then Result.Current_Length := From - 1; Result.Data (1 .. From - 1) := Source.Data (1 .. From - 1); return Result; else Result.Current_Length := Slen - Num_Delete; Result.Data (1 .. From - 1) := Source.Data (1 .. From - 1); Result.Data (From .. Result.Current_Length) := Source.Data (Through + 1 .. Slen); return Result; end if; end Super_Delete; procedure Super_Delete (Source : in out Super_String; From : Positive; Through : Natural) is Slen : constant Natural := Source.Current_Length; Num_Delete : constant Integer := Through - From + 1; begin if Num_Delete <= 0 then return; elsif From > Slen + 1 then raise Ada.Strings.Index_Error; elsif Through >= Slen then Source.Current_Length := From - 1; else Source.Current_Length := Slen - Num_Delete; Source.Data (From .. Source.Current_Length) := Source.Data (Through + 1 .. Slen); end if; end Super_Delete; ------------------- -- Super_Element -- ------------------- function Super_Element (Source : Super_String; Index : Positive) return Wide_Character is begin if Index <= Source.Current_Length then return Source.Data (Index); else raise Strings.Index_Error; end if; end Super_Element; ---------------------- -- Super_Find_Token -- ---------------------- procedure Super_Find_Token (Source : Super_String; Set : Wide_Maps.Wide_Character_Set; From : Positive; Test : Strings.Membership; First : out Positive; Last : out Natural) is begin Wide_Search.Find_Token (Source.Data (From .. Source.Current_Length), Set, Test, First, Last); end Super_Find_Token; procedure Super_Find_Token (Source : Super_String; Set : Wide_Maps.Wide_Character_Set; Test : Strings.Membership; First : out Positive; Last : out Natural) is begin Wide_Search.Find_Token (Source.Data (1 .. Source.Current_Length), Set, Test, First, Last); end Super_Find_Token; ---------------- -- Super_Head -- ---------------- function Super_Head (Source : Super_String; Count : Natural; Pad : Wide_Character := Wide_Space; Drop : Strings.Truncation := Strings.Error) return Super_String is Max_Length : constant Positive := Source.Max_Length; Result : Super_String (Max_Length); Slen : constant Natural := Source.Current_Length; Npad : constant Integer := Count - Slen; begin if Npad <= 0 then Result.Current_Length := Count; Result.Data (1 .. Count) := Source.Data (1 .. Count); elsif Count <= Max_Length then Result.Current_Length := Count; Result.Data (1 .. Slen) := Source.Data (1 .. Slen); Result.Data (Slen + 1 .. Count) := (others => Pad); else Result.Current_Length := Max_Length; case Drop is when Strings.Right => Result.Data (1 .. Slen) := Source.Data (1 .. Slen); Result.Data (Slen + 1 .. Max_Length) := (others => Pad); when Strings.Left => if Npad >= Max_Length then Result.Data := (others => Pad); else Result.Data (1 .. Max_Length - Npad) := Source.Data (Count - Max_Length + 1 .. Slen); Result.Data (Max_Length - Npad + 1 .. Max_Length) := (others => Pad); end if; when Strings.Error => raise Ada.Strings.Length_Error; end case; end if; return Result; end Super_Head; procedure Super_Head (Source : in out Super_String; Count : Natural; Pad : Wide_Character := Wide_Space; Drop : Truncation := Error) is Max_Length : constant Positive := Source.Max_Length; Slen : constant Natural := Source.Current_Length; Npad : constant Integer := Count - Slen; Temp : Wide_String (1 .. Max_Length); begin if Npad <= 0 then Source.Current_Length := Count; elsif Count <= Max_Length then Source.Current_Length := Count; Source.Data (Slen + 1 .. Count) := (others => Pad); else Source.Current_Length := Max_Length; case Drop is when Strings.Right => Source.Data (Slen + 1 .. Max_Length) := (others => Pad); when Strings.Left => if Npad > Max_Length then Source.Data := (others => Pad); else Temp := Source.Data; Source.Data (1 .. Max_Length - Npad) := Temp (Count - Max_Length + 1 .. Slen); for J in Max_Length - Npad + 1 .. Max_Length loop Source.Data (J) := Pad; end loop; end if; when Strings.Error => raise Ada.Strings.Length_Error; end case; end if; end Super_Head; ----------------- -- Super_Index -- ----------------- function Super_Index (Source : Super_String; Pattern : Wide_String; Going : Strings.Direction := Strings.Forward; Mapping : Wide_Maps.Wide_Character_Mapping := Wide_Maps.Identity) return Natural is begin return Wide_Search.Index (Source.Data (1 .. Source.Current_Length), Pattern, Going, Mapping); end Super_Index; function Super_Index (Source : Super_String; Pattern : Wide_String; Going : Direction := Forward; Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Natural is begin return Wide_Search.Index (Source.Data (1 .. Source.Current_Length), Pattern, Going, Mapping); end Super_Index; function Super_Index (Source : Super_String; Set : Wide_Maps.Wide_Character_Set; Test : Strings.Membership := Strings.Inside; Going : Strings.Direction := Strings.Forward) return Natural is begin return Wide_Search.Index (Source.Data (1 .. Source.Current_Length), Set, Test, Going); end Super_Index; function Super_Index (Source : Super_String; Pattern : Wide_String; From : Positive; Going : Direction := Forward; Mapping : Wide_Maps.Wide_Character_Mapping := Wide_Maps.Identity) return Natural is begin return Wide_Search.Index (Source.Data (1 .. Source.Current_Length), Pattern, From, Going, Mapping); end Super_Index; function Super_Index (Source : Super_String; Pattern : Wide_String; From : Positive; Going : Direction := Forward; Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Natural is begin return Wide_Search.Index (Source.Data (1 .. Source.Current_Length), Pattern, From, Going, Mapping); end Super_Index; function Super_Index (Source : Super_String; Set : Wide_Maps.Wide_Character_Set; From : Positive; Test : Membership := Inside; Going : Direction := Forward) return Natural is begin return Wide_Search.Index (Source.Data (1 .. Source.Current_Length), Set, From, Test, Going); end Super_Index; --------------------------- -- Super_Index_Non_Blank -- --------------------------- function Super_Index_Non_Blank (Source : Super_String; Going : Strings.Direction := Strings.Forward) return Natural is begin return Wide_Search.Index_Non_Blank (Source.Data (1 .. Source.Current_Length), Going); end Super_Index_Non_Blank; function Super_Index_Non_Blank (Source : Super_String; From : Positive; Going : Direction := Forward) return Natural is begin return Wide_Search.Index_Non_Blank (Source.Data (1 .. Source.Current_Length), From, Going); end Super_Index_Non_Blank; ------------------ -- Super_Insert -- ------------------ function Super_Insert (Source : Super_String; Before : Positive; New_Item : Wide_String; Drop : Strings.Truncation := Strings.Error) return Super_String is Max_Length : constant Positive := Source.Max_Length; Result : Super_String (Max_Length); Slen : constant Natural := Source.Current_Length; Nlen : constant Natural := New_Item'Length; Tlen : constant Natural := Slen + Nlen; Blen : constant Natural := Before - 1; Alen : constant Integer := Slen - Blen; Droplen : constant Integer := Tlen - Max_Length; -- Tlen is the length of the total string before possible truncation. -- Blen, Alen are the lengths of the before and after pieces of the -- source string. begin if Alen < 0 then raise Ada.Strings.Index_Error; elsif Droplen <= 0 then Result.Current_Length := Tlen; Result.Data (1 .. Blen) := Source.Data (1 .. Blen); Result.Data (Before .. Before + Nlen - 1) := New_Item; Result.Data (Before + Nlen .. Tlen) := Source.Data (Before .. Slen); else Result.Current_Length := Max_Length; case Drop is when Strings.Right => Result.Data (1 .. Blen) := Source.Data (1 .. Blen); if Droplen > Alen then Result.Data (Before .. Max_Length) := New_Item (New_Item'First .. New_Item'First + Max_Length - Before); else Result.Data (Before .. Before + Nlen - 1) := New_Item; Result.Data (Before + Nlen .. Max_Length) := Source.Data (Before .. Slen - Droplen); end if; when Strings.Left => Result.Data (Max_Length - (Alen - 1) .. Max_Length) := Source.Data (Before .. Slen); if Droplen >= Blen then Result.Data (1 .. Max_Length - Alen) := New_Item (New_Item'Last - (Max_Length - Alen) + 1 .. New_Item'Last); else Result.Data (Blen - Droplen + 1 .. Max_Length - Alen) := New_Item; Result.Data (1 .. Blen - Droplen) := Source.Data (Droplen + 1 .. Blen); end if; when Strings.Error => raise Ada.Strings.Length_Error; end case; end if; return Result; end Super_Insert; procedure Super_Insert (Source : in out Super_String; Before : Positive; New_Item : Wide_String; Drop : Strings.Truncation := Strings.Error) is begin -- We do a double copy here because this is one of the situations -- in which we move data to the right, and at least at the moment, -- GNAT is not handling such cases correctly ??? Source := Super_Insert (Source, Before, New_Item, Drop); end Super_Insert; ------------------ -- Super_Length -- ------------------ function Super_Length (Source : Super_String) return Natural is begin return Source.Current_Length; end Super_Length; --------------------- -- Super_Overwrite -- --------------------- function Super_Overwrite (Source : Super_String; Position : Positive; New_Item : Wide_String; Drop : Strings.Truncation := Strings.Error) return Super_String is Max_Length : constant Positive := Source.Max_Length; Result : Super_String (Max_Length); Endpos : constant Natural := Position + New_Item'Length - 1; Slen : constant Natural := Source.Current_Length; Droplen : Natural; begin if Position > Slen + 1 then raise Ada.Strings.Index_Error; elsif New_Item'Length = 0 then return Source; elsif Endpos <= Slen then Result.Current_Length := Source.Current_Length; Result.Data (1 .. Slen) := Source.Data (1 .. Slen); Result.Data (Position .. Endpos) := New_Item; return Result; elsif Endpos <= Max_Length then Result.Current_Length := Endpos; Result.Data (1 .. Position - 1) := Source.Data (1 .. Position - 1); Result.Data (Position .. Endpos) := New_Item; return Result; else Result.Current_Length := Max_Length; Droplen := Endpos - Max_Length; case Drop is when Strings.Right => Result.Data (1 .. Position - 1) := Source.Data (1 .. Position - 1); Result.Data (Position .. Max_Length) := New_Item (New_Item'First .. New_Item'Last - Droplen); return Result; when Strings.Left => if New_Item'Length >= Max_Length then Result.Data (1 .. Max_Length) := New_Item (New_Item'Last - Max_Length + 1 .. New_Item'Last); return Result; else Result.Data (1 .. Max_Length - New_Item'Length) := Source.Data (Droplen + 1 .. Position - 1); Result.Data (Max_Length - New_Item'Length + 1 .. Max_Length) := New_Item; return Result; end if; when Strings.Error => raise Ada.Strings.Length_Error; end case; end if; end Super_Overwrite; procedure Super_Overwrite (Source : in out Super_String; Position : Positive; New_Item : Wide_String; Drop : Strings.Truncation := Strings.Error) is Max_Length : constant Positive := Source.Max_Length; Endpos : constant Positive := Position + New_Item'Length - 1; Slen : constant Natural := Source.Current_Length; Droplen : Natural; begin if Position > Slen + 1 then raise Ada.Strings.Index_Error; elsif Endpos <= Slen then Source.Data (Position .. Endpos) := New_Item; elsif Endpos <= Max_Length then Source.Data (Position .. Endpos) := New_Item; Source.Current_Length := Endpos; else Source.Current_Length := Max_Length; Droplen := Endpos - Max_Length; case Drop is when Strings.Right => Source.Data (Position .. Max_Length) := New_Item (New_Item'First .. New_Item'Last - Droplen); when Strings.Left => if New_Item'Length > Max_Length then Source.Data (1 .. Max_Length) := New_Item (New_Item'Last - Max_Length + 1 .. New_Item'Last); else Source.Data (1 .. Max_Length - New_Item'Length) := Source.Data (Droplen + 1 .. Position - 1); Source.Data (Max_Length - New_Item'Length + 1 .. Max_Length) := New_Item; end if; when Strings.Error => raise Ada.Strings.Length_Error; end case; end if; end Super_Overwrite; --------------------------- -- Super_Replace_Element -- --------------------------- procedure Super_Replace_Element (Source : in out Super_String; Index : Positive; By : Wide_Character) is begin if Index <= Source.Current_Length then Source.Data (Index) := By; else raise Ada.Strings.Index_Error; end if; end Super_Replace_Element; ------------------------- -- Super_Replace_Slice -- ------------------------- function Super_Replace_Slice (Source : Super_String; Low : Positive; High : Natural; By : Wide_String; Drop : Strings.Truncation := Strings.Error) return Super_String is Max_Length : constant Positive := Source.Max_Length; Slen : constant Natural := Source.Current_Length; begin if Low > Slen + 1 then raise Strings.Index_Error; elsif High < Low then return Super_Insert (Source, Low, By, Drop); else declare Blen : constant Natural := Natural'Max (0, Low - 1); Alen : constant Natural := Natural'Max (0, Slen - High); Tlen : constant Natural := Blen + By'Length + Alen; Droplen : constant Integer := Tlen - Max_Length; Result : Super_String (Max_Length); -- Tlen is the total length of the result string before any -- truncation. Blen and Alen are the lengths of the pieces -- of the original string that end up in the result string -- before and after the replaced slice. begin if Droplen <= 0 then Result.Current_Length := Tlen; Result.Data (1 .. Blen) := Source.Data (1 .. Blen); Result.Data (Low .. Low + By'Length - 1) := By; Result.Data (Low + By'Length .. Tlen) := Source.Data (High + 1 .. Slen); else Result.Current_Length := Max_Length; case Drop is when Strings.Right => Result.Data (1 .. Blen) := Source.Data (1 .. Blen); if Droplen > Alen then Result.Data (Low .. Max_Length) := By (By'First .. By'First + Max_Length - Low); else Result.Data (Low .. Low + By'Length - 1) := By; Result.Data (Low + By'Length .. Max_Length) := Source.Data (High + 1 .. Slen - Droplen); end if; when Strings.Left => Result.Data (Max_Length - (Alen - 1) .. Max_Length) := Source.Data (High + 1 .. Slen); if Droplen >= Blen then Result.Data (1 .. Max_Length - Alen) := By (By'Last - (Max_Length - Alen) + 1 .. By'Last); else Result.Data (Blen - Droplen + 1 .. Max_Length - Alen) := By; Result.Data (1 .. Blen - Droplen) := Source.Data (Droplen + 1 .. Blen); end if; when Strings.Error => raise Ada.Strings.Length_Error; end case; end if; return Result; end; end if; end Super_Replace_Slice; procedure Super_Replace_Slice (Source : in out Super_String; Low : Positive; High : Natural; By : Wide_String; Drop : Strings.Truncation := Strings.Error) is begin -- We do a double copy here because this is one of the situations -- in which we move data to the right, and at least at the moment, -- GNAT is not handling such cases correctly ??? Source := Super_Replace_Slice (Source, Low, High, By, Drop); end Super_Replace_Slice; --------------------- -- Super_Replicate -- --------------------- function Super_Replicate (Count : Natural; Item : Wide_Character; Drop : Truncation := Error; Max_Length : Positive) return Super_String is Result : Super_String (Max_Length); begin if Count <= Max_Length then Result.Current_Length := Count; elsif Drop = Strings.Error then raise Ada.Strings.Length_Error; else Result.Current_Length := Max_Length; end if; Result.Data (1 .. Result.Current_Length) := (others => Item); return Result; end Super_Replicate; function Super_Replicate (Count : Natural; Item : Wide_String; Drop : Truncation := Error; Max_Length : Positive) return Super_String is Length : constant Integer := Count * Item'Length; Result : Super_String (Max_Length); Indx : Positive; begin if Length <= Max_Length then Result.Current_Length := Length; if Length > 0 then Indx := 1; for J in 1 .. Count loop Result.Data (Indx .. Indx + Item'Length - 1) := Item; Indx := Indx + Item'Length; end loop; end if; else Result.Current_Length := Max_Length; case Drop is when Strings.Right => Indx := 1; while Indx + Item'Length <= Max_Length + 1 loop Result.Data (Indx .. Indx + Item'Length - 1) := Item; Indx := Indx + Item'Length; end loop; Result.Data (Indx .. Max_Length) := Item (Item'First .. Item'First + Max_Length - Indx); when Strings.Left => Indx := Max_Length; while Indx - Item'Length >= 1 loop Result.Data (Indx - (Item'Length - 1) .. Indx) := Item; Indx := Indx - Item'Length; end loop; Result.Data (1 .. Indx) := Item (Item'Last - Indx + 1 .. Item'Last); when Strings.Error => raise Ada.Strings.Length_Error; end case; end if; return Result; end Super_Replicate; function Super_Replicate (Count : Natural; Item : Super_String; Drop : Strings.Truncation := Strings.Error) return Super_String is begin return Super_Replicate (Count, Item.Data (1 .. Item.Current_Length), Drop, Item.Max_Length); end Super_Replicate; ----------------- -- Super_Slice -- ----------------- function Super_Slice (Source : Super_String; Low : Positive; High : Natural) return Wide_String is begin -- Note: test of High > Length is in accordance with AI95-00128 return R : Wide_String (Low .. High) do if Low > Source.Current_Length + 1 or else High > Source.Current_Length then raise Index_Error; end if; R := Source.Data (Low .. High); end return; end Super_Slice; function Super_Slice (Source : Super_String; Low : Positive; High : Natural) return Super_String is begin return Result : Super_String (Source.Max_Length) do if Low > Source.Current_Length + 1 or else High > Source.Current_Length then raise Index_Error; end if; Result.Current_Length := High - Low + 1; Result.Data (1 .. Result.Current_Length) := Source.Data (Low .. High); end return; end Super_Slice; procedure Super_Slice (Source : Super_String; Target : out Super_String; Low : Positive; High : Natural) is begin if Low > Source.Current_Length + 1 or else High > Source.Current_Length then raise Index_Error; else Target.Current_Length := High - Low + 1; Target.Data (1 .. Target.Current_Length) := Source.Data (Low .. High); end if; end Super_Slice; ---------------- -- Super_Tail -- ---------------- function Super_Tail (Source : Super_String; Count : Natural; Pad : Wide_Character := Wide_Space; Drop : Strings.Truncation := Strings.Error) return Super_String is Max_Length : constant Positive := Source.Max_Length; Result : Super_String (Max_Length); Slen : constant Natural := Source.Current_Length; Npad : constant Integer := Count - Slen; begin if Npad <= 0 then Result.Current_Length := Count; Result.Data (1 .. Count) := Source.Data (Slen - (Count - 1) .. Slen); elsif Count <= Max_Length then Result.Current_Length := Count; Result.Data (1 .. Npad) := (others => Pad); Result.Data (Npad + 1 .. Count) := Source.Data (1 .. Slen); else Result.Current_Length := Max_Length; case Drop is when Strings.Right => if Npad >= Max_Length then Result.Data := (others => Pad); else Result.Data (1 .. Npad) := (others => Pad); Result.Data (Npad + 1 .. Max_Length) := Source.Data (1 .. Max_Length - Npad); end if; when Strings.Left => Result.Data (1 .. Max_Length - Slen) := (others => Pad); Result.Data (Max_Length - Slen + 1 .. Max_Length) := Source.Data (1 .. Slen); when Strings.Error => raise Ada.Strings.Length_Error; end case; end if; return Result; end Super_Tail; procedure Super_Tail (Source : in out Super_String; Count : Natural; Pad : Wide_Character := Wide_Space; Drop : Truncation := Error) is Max_Length : constant Positive := Source.Max_Length; Slen : constant Natural := Source.Current_Length; Npad : constant Integer := Count - Slen; Temp : constant Wide_String (1 .. Max_Length) := Source.Data; begin if Npad <= 0 then Source.Current_Length := Count; Source.Data (1 .. Count) := Temp (Slen - (Count - 1) .. Slen); elsif Count <= Max_Length then Source.Current_Length := Count; Source.Data (1 .. Npad) := (others => Pad); Source.Data (Npad + 1 .. Count) := Temp (1 .. Slen); else Source.Current_Length := Max_Length; case Drop is when Strings.Right => if Npad >= Max_Length then Source.Data := (others => Pad); else Source.Data (1 .. Npad) := (others => Pad); Source.Data (Npad + 1 .. Max_Length) := Temp (1 .. Max_Length - Npad); end if; when Strings.Left => for J in 1 .. Max_Length - Slen loop Source.Data (J) := Pad; end loop; Source.Data (Max_Length - Slen + 1 .. Max_Length) := Temp (1 .. Slen); when Strings.Error => raise Ada.Strings.Length_Error; end case; end if; end Super_Tail; --------------------- -- Super_To_String -- --------------------- function Super_To_String (Source : Super_String) return Wide_String is begin return R : Wide_String (1 .. Source.Current_Length) do R := Source.Data (1 .. Source.Current_Length); end return; end Super_To_String; --------------------- -- Super_Translate -- --------------------- function Super_Translate (Source : Super_String; Mapping : Wide_Maps.Wide_Character_Mapping) return Super_String is Result : Super_String (Source.Max_Length); begin Result.Current_Length := Source.Current_Length; for J in 1 .. Source.Current_Length loop Result.Data (J) := Value (Mapping, Source.Data (J)); end loop; return Result; end Super_Translate; procedure Super_Translate (Source : in out Super_String; Mapping : Wide_Maps.Wide_Character_Mapping) is begin for J in 1 .. Source.Current_Length loop Source.Data (J) := Value (Mapping, Source.Data (J)); end loop; end Super_Translate; function Super_Translate (Source : Super_String; Mapping : Wide_Maps.Wide_Character_Mapping_Function) return Super_String is Result : Super_String (Source.Max_Length); begin Result.Current_Length := Source.Current_Length; for J in 1 .. Source.Current_Length loop Result.Data (J) := Mapping.all (Source.Data (J)); end loop; return Result; end Super_Translate; procedure Super_Translate (Source : in out Super_String; Mapping : Wide_Maps.Wide_Character_Mapping_Function) is begin for J in 1 .. Source.Current_Length loop Source.Data (J) := Mapping.all (Source.Data (J)); end loop; end Super_Translate; ---------------- -- Super_Trim -- ---------------- function Super_Trim (Source : Super_String; Side : Trim_End) return Super_String is Result : Super_String (Source.Max_Length); Last : Natural := Source.Current_Length; First : Positive := 1; begin if Side = Left or else Side = Both then while First <= Last and then Source.Data (First) = ' ' loop First := First + 1; end loop; end if; if Side = Right or else Side = Both then while Last >= First and then Source.Data (Last) = ' ' loop Last := Last - 1; end loop; end if; Result.Current_Length := Last - First + 1; Result.Data (1 .. Result.Current_Length) := Source.Data (First .. Last); return Result; end Super_Trim; procedure Super_Trim (Source : in out Super_String; Side : Trim_End) is Max_Length : constant Positive := Source.Max_Length; Last : Natural := Source.Current_Length; First : Positive := 1; Temp : Wide_String (1 .. Max_Length); begin Temp (1 .. Last) := Source.Data (1 .. Last); if Side = Left or else Side = Both then while First <= Last and then Temp (First) = ' ' loop First := First + 1; end loop; end if; if Side = Right or else Side = Both then while Last >= First and then Temp (Last) = ' ' loop Last := Last - 1; end loop; end if; Source.Data := (others => Wide_NUL); Source.Current_Length := Last - First + 1; Source.Data (1 .. Source.Current_Length) := Temp (First .. Last); end Super_Trim; function Super_Trim (Source : Super_String; Left : Wide_Maps.Wide_Character_Set; Right : Wide_Maps.Wide_Character_Set) return Super_String is Result : Super_String (Source.Max_Length); begin for First in 1 .. Source.Current_Length loop if not Is_In (Source.Data (First), Left) then for Last in reverse First .. Source.Current_Length loop if not Is_In (Source.Data (Last), Right) then Result.Current_Length := Last - First + 1; Result.Data (1 .. Result.Current_Length) := Source.Data (First .. Last); return Result; end if; end loop; end if; end loop; Result.Current_Length := 0; return Result; end Super_Trim; procedure Super_Trim (Source : in out Super_String; Left : Wide_Maps.Wide_Character_Set; Right : Wide_Maps.Wide_Character_Set) is begin for First in 1 .. Source.Current_Length loop if not Is_In (Source.Data (First), Left) then for Last in reverse First .. Source.Current_Length loop if not Is_In (Source.Data (Last), Right) then if First = 1 then Source.Current_Length := Last; return; else Source.Current_Length := Last - First + 1; Source.Data (1 .. Source.Current_Length) := Source.Data (First .. Last); for J in Source.Current_Length + 1 .. Source.Max_Length loop Source.Data (J) := Wide_NUL; end loop; return; end if; end if; end loop; Source.Current_Length := 0; return; end if; end loop; Source.Current_Length := 0; end Super_Trim; ----------- -- Times -- ----------- function Times (Left : Natural; Right : Wide_Character; Max_Length : Positive) return Super_String is Result : Super_String (Max_Length); begin if Left > Max_Length then raise Ada.Strings.Length_Error; else Result.Current_Length := Left; for J in 1 .. Left loop Result.Data (J) := Right; end loop; end if; return Result; end Times; function Times (Left : Natural; Right : Wide_String; Max_Length : Positive) return Super_String is Result : Super_String (Max_Length); Pos : Positive := 1; Rlen : constant Natural := Right'Length; Nlen : constant Natural := Left * Rlen; begin if Nlen > Max_Length then raise Ada.Strings.Index_Error; else Result.Current_Length := Nlen; if Nlen > 0 then for J in 1 .. Left loop Result.Data (Pos .. Pos + Rlen - 1) := Right; Pos := Pos + Rlen; end loop; end if; end if; return Result; end Times; function Times (Left : Natural; Right : Super_String) return Super_String is Result : Super_String (Right.Max_Length); Pos : Positive := 1; Rlen : constant Natural := Right.Current_Length; Nlen : constant Natural := Left * Rlen; begin if Nlen > Right.Max_Length then raise Ada.Strings.Length_Error; else Result.Current_Length := Nlen; if Nlen > 0 then for J in 1 .. Left loop Result.Data (Pos .. Pos + Rlen - 1) := Right.Data (1 .. Rlen); Pos := Pos + Rlen; end loop; end if; end if; return Result; end Times; --------------------- -- To_Super_String -- --------------------- function To_Super_String (Source : Wide_String; Max_Length : Natural; Drop : Truncation := Error) return Super_String is Result : Super_String (Max_Length); Slen : constant Natural := Source'Length; begin if Slen <= Max_Length then Result.Current_Length := Slen; Result.Data (1 .. Slen) := Source; else case Drop is when Strings.Right => Result.Current_Length := Max_Length; Result.Data (1 .. Max_Length) := Source (Source'First .. Source'First - 1 + Max_Length); when Strings.Left => Result.Current_Length := Max_Length; Result.Data (1 .. Max_Length) := Source (Source'Last - (Max_Length - 1) .. Source'Last); when Strings.Error => raise Ada.Strings.Length_Error; end case; end if; return Result; end To_Super_String; end Ada.Strings.Wide_Superbounded;
30.361427
79
0.524226
13412544de0116f6caba1708d7c6bbed3696d444
362
ads
Ada
source/casillero.ads
pdibez/mundo-aspiradora
f1e80ae2e126df934ac27d5665a409b445f3633d
[ "MIT" ]
null
null
null
source/casillero.ads
pdibez/mundo-aspiradora
f1e80ae2e126df934ac27d5665a409b445f3633d
[ "MIT" ]
null
null
null
source/casillero.ads
pdibez/mundo-aspiradora
f1e80ae2e126df934ac27d5665a409b445f3633d
[ "MIT" ]
null
null
null
with estado_casillero,direccion; use estado_casillero,direccion; package casillero is type t_casillero is tagged record estado : t_estado_casillero; end record; procedure set_estado(c : in out t_casillero; e : in t_estado_casillero); function get_estado(c: in t_casillero) return t_estado_casillero; end casillero;
22.625
68
0.723757
1306bb8506edfcec78e48727b3c2f92b9c00924f
7,955
adb
Ada
source/xml/sax/xml-sax-input_sources-streams-files-naming_utilities__windows.adb
svn2github/matreshka
9d222b3ad9da508855fb1f5adbe5e8a4fad4c530
[ "BSD-3-Clause" ]
24
2016-11-29T06:59:41.000Z
2021-08-30T11:55:16.000Z
source/xml/sax/xml-sax-input_sources-streams-files-naming_utilities__windows.adb
svn2github/matreshka
9d222b3ad9da508855fb1f5adbe5e8a4fad4c530
[ "BSD-3-Clause" ]
2
2019-01-16T05:15:20.000Z
2019-02-03T10:03:32.000Z
source/xml/sax/xml-sax-input_sources-streams-files-naming_utilities__windows.adb
svn2github/matreshka
9d222b3ad9da508855fb1f5adbe5e8a4fad4c530
[ "BSD-3-Clause" ]
4
2017-07-18T07:11:05.000Z
2020-06-21T03:02:25.000Z
------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- XML Processor -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2017, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ -- This is implementation of package for Microsoft Windows. ------------------------------------------------------------------------------ with League.Strings.Internals; with League.Text_Codecs; with Matreshka.Internals.Strings.C; with Matreshka.Internals.Utf16; with Matreshka.Internals.Windows; separate (XML.SAX.Input_Sources.Streams.Files) package body Naming_Utilities is use Matreshka.Internals.Windows; use type League.Strings.Universal_String; subtype HRESULT is LONG; subtype PCWSTR is LPCWSTR; subtype PWSTR is LPWSTR; MAX_PATH : constant := 260; INTERNET_MAX_URL_LENGTH : constant := 32 + 3 + 2048; function GetFullPathName (lpFileName : LPCWSTR; nBufferLength : DWORD; lpBuffer : LPWSTR; lpFilePart : out LPWSTR) return DWORD; pragma Import (Stdcall, GetFullPathName, "GetFullPathNameW"); function PathCreateFromUrl (pszUrl : PCWSTR; pszPath : PWSTR; pcchPath : in out DWORD; dwFlags : DWORD) return HRESULT; pragma Import (Stdcall, PathCreateFromUrl, "PathCreateFromUrlW"); function UrlCreateFromPath (pszPath : PCWSTR; pszUrl : PWSTR; pcchUrl : in out DWORD; dwFlags : DWORD) return HRESULT; pragma Import (Stdcall, UrlCreateFromPath, "UrlCreateFromPathW"); ------------------- -- Absolute_Name -- ------------------- function Absolute_Name (Name : League.Strings.Universal_String) return League.Strings.Universal_String is Result : Matreshka.Internals.Strings.Shared_String_Access; Size : DWORD; Valid : Boolean; Dummy : LPWSTR; pragma Warnings (Off, Dummy); begin Size := GetFullPathName (League.Strings.Internals.Internal (Name).Value (0)'Access, 0, null, Dummy); Result := Matreshka.Internals.Strings.Allocate (Matreshka.Internals.Utf16.Utf16_String_Index (Size)); Size := GetFullPathName (League.Strings.Internals.Internal (Name).Value (0)'Access, DWORD (Result.Capacity), Result.Value (0)'Access, Dummy); Matreshka.Internals.Strings.C.Validate_And_Fixup (Result, Matreshka.Internals.Utf16.Utf16_String_Index (Size), Valid); return League.Strings.Internals.Wrap (Result); end Absolute_Name; ---------------------- -- File_Name_To_URI -- ---------------------- function File_Name_To_URI (File_Name : League.Strings.Universal_String) return League.Strings.Universal_String is Result : Matreshka.Internals.Strings.Shared_String_Access := Matreshka.Internals.Strings.Allocate (INTERNET_MAX_URL_LENGTH); Size : DWORD := INTERNET_MAX_URL_LENGTH; Valid : Boolean; Dummy : HRESULT; pragma Warnings (Off, Dummy); begin Dummy := UrlCreateFromPath (League.Strings.Internals.Internal (File_Name).Value (0)'Access, Result.Value (0)'Access, Size, 0); Matreshka.Internals.Strings.C.Validate_And_Fixup (Result, Matreshka.Internals.Utf16.Utf16_String_Index (Size), Valid); return League.Strings.Internals.Wrap (Result); end File_Name_To_URI; -------------------------- -- To_Ada_RTL_File_Name -- -------------------------- function To_Ada_RTL_File_Name (Name : League.Strings.Universal_String) return String is Aux : constant Ada.Streams.Stream_Element_Array := League.Text_Codecs.Codec_For_Application_Locale.Encode (Name).To_Stream_Element_Array; Result : String (1 .. Aux'Length); for Result'Address use Aux'Address; begin return Result; end To_Ada_RTL_File_Name; ---------------------- -- URI_To_File_Name -- ---------------------- function URI_To_File_Name (URI : League.Strings.Universal_String) return League.Strings.Universal_String is Result : Matreshka.Internals.Strings.Shared_String_Access := Matreshka.Internals.Strings.Allocate (MAX_PATH); Size : DWORD := MAX_PATH; Valid : Boolean; Dummy : HRESULT; pragma Warnings (Off, Dummy); begin Dummy := PathCreateFromUrl (League.Strings.Internals.Internal (URI).Value (0)'Access, Result.Value (0)'Access, Size, 0); Matreshka.Internals.Strings.C.Validate_And_Fixup (Result, Matreshka.Internals.Utf16.Utf16_String_Index (Size), Valid); return League.Strings.Internals.Wrap (Result); end URI_To_File_Name; end Naming_Utilities;
39.577114
78
0.527718
048630fa7d8b9e66d945d2a004dad1868b9ca1cd
4,643
ads
Ada
llvm-gcc-4.2-2.9/gcc/ada/s-valenu.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-valenu.ads
vidkidz/crossbridge
ba0bf94aee0ce6cf7eb5be882382e52bc57ba396
[ "MIT" ]
null
null
null
llvm-gcc-4.2-2.9/gcc/ada/s-valenu.ads
vidkidz/crossbridge
ba0bf94aee0ce6cf7eb5be882382e52bc57ba396
[ "MIT" ]
null
null
null
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S Y S T E M . V A L _ E N U M -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2005, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 51 Franklin Street, Fifth Floor, -- -- Boston, MA 02110-1301, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package is used to compute the Value attribute for enumeration types -- other than those in packages Standard and System. See unit Exp_Imgv for -- details of the format of constructed image tables. package System.Val_Enum is pragma Pure; function Value_Enumeration_8 (Names : String; Indexes : System.Address; Num : Natural; Str : String) return Natural; -- Used to compute Enum'Value (Str) where Enum is some enumeration type -- other than those defined in package Standard. Names is a string with -- a lower bound of 1 containing the characters of all the enumeration -- literals concatenated together in sequence. Indexes is the address -- of an array of type array (0 .. N) of Natural_8, where N is the -- number of enumeration literals in the type. The Indexes values are -- the starting subscript of each enumeration literal, indexed by Pos -- values, with an extra entry at the end containing Names'Length + 1. -- The parameter Num is the value N - 1 (i.e. Enum'Pos (Enum'Last)). -- The reason that Indexes is passed by address is that the actual type -- is created on the fly by the expander. -- -- Str is the argument of the attribute function, and may have leading -- and trailing spaces, and letters can be upper or lower case or mixed. -- If the image is found in Names, then the corresponding Pos value is -- returned. If not, Constraint_Error is raised. function Value_Enumeration_16 (Names : String; Indexes : System.Address; Num : Natural; Str : String) return Natural; -- Identical to Value_Enumeration_8 except that it handles types -- using array (0 .. Num) of Natural_16 for the Indexes table. function Value_Enumeration_32 (Names : String; Indexes : System.Address; Num : Natural; Str : String) return Natural; -- Identical to Value_Enumeration_8 except that it handles types -- using array (0 .. Num) of Natural_32 for the Indexes table. end System.Val_Enum;
55.939759
78
0.533276
1372a185b0edeca5a17428ab564e6cc689564619
4,475
ads
Ada
source/nodes/program-nodes-pragmas.ads
reznikmm/gela
20134f1d154fb763812e73860c6f4b04f353df79
[ "MIT" ]
null
null
null
source/nodes/program-nodes-pragmas.ads
reznikmm/gela
20134f1d154fb763812e73860c6f4b04f353df79
[ "MIT" ]
null
null
null
source/nodes/program-nodes-pragmas.ads
reznikmm/gela
20134f1d154fb763812e73860c6f4b04f353df79
[ "MIT" ]
1
2019-10-16T09:05:27.000Z
2019-10-16T09:05:27.000Z
-- SPDX-FileCopyrightText: 2019 Max Reznik <[email protected]> -- -- SPDX-License-Identifier: MIT ------------------------------------------------------------- with Program.Lexical_Elements; with Program.Elements.Identifiers; with Program.Elements.Parameter_Associations; with Program.Elements.Pragmas; with Program.Element_Visitors; package Program.Nodes.Pragmas is pragma Preelaborate; type Pragma_Element is new Program.Nodes.Node and Program.Elements.Pragmas.Pragma_Element and Program.Elements.Pragmas.Pragma_Text with private; function Create (Pragma_Token : not null Program.Lexical_Elements .Lexical_Element_Access; Name : not null Program.Elements.Identifiers .Identifier_Access; Left_Bracket_Token : Program.Lexical_Elements.Lexical_Element_Access; Arguments : Program.Elements.Parameter_Associations .Parameter_Association_Vector_Access; Right_Bracket_Token : Program.Lexical_Elements.Lexical_Element_Access; Semicolon_Token : not null Program.Lexical_Elements .Lexical_Element_Access) return Pragma_Element; type Implicit_Pragma is new Program.Nodes.Node and Program.Elements.Pragmas.Pragma_Element with private; function Create (Name : not null Program.Elements.Identifiers .Identifier_Access; Arguments : Program.Elements.Parameter_Associations .Parameter_Association_Vector_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return Implicit_Pragma with Pre => Is_Part_Of_Implicit or Is_Part_Of_Inherited or Is_Part_Of_Instance; private type Base_Pragma is abstract new Program.Nodes.Node and Program.Elements.Pragmas.Pragma_Element with record Name : not null Program.Elements.Identifiers.Identifier_Access; Arguments : Program.Elements.Parameter_Associations .Parameter_Association_Vector_Access; end record; procedure Initialize (Self : in out Base_Pragma'Class); overriding procedure Visit (Self : not null access Base_Pragma; Visitor : in out Program.Element_Visitors.Element_Visitor'Class); overriding function Name (Self : Base_Pragma) return not null Program.Elements.Identifiers.Identifier_Access; overriding function Arguments (Self : Base_Pragma) return Program.Elements.Parameter_Associations .Parameter_Association_Vector_Access; overriding function Is_Pragma (Self : Base_Pragma) return Boolean; type Pragma_Element is new Base_Pragma and Program.Elements.Pragmas.Pragma_Text with record Pragma_Token : not null Program.Lexical_Elements .Lexical_Element_Access; Left_Bracket_Token : Program.Lexical_Elements.Lexical_Element_Access; Right_Bracket_Token : Program.Lexical_Elements.Lexical_Element_Access; Semicolon_Token : not null Program.Lexical_Elements .Lexical_Element_Access; end record; overriding function To_Pragma_Text (Self : in out Pragma_Element) return Program.Elements.Pragmas.Pragma_Text_Access; overriding function Pragma_Token (Self : Pragma_Element) return not null Program.Lexical_Elements.Lexical_Element_Access; overriding function Left_Bracket_Token (Self : Pragma_Element) return Program.Lexical_Elements.Lexical_Element_Access; overriding function Right_Bracket_Token (Self : Pragma_Element) return Program.Lexical_Elements.Lexical_Element_Access; overriding function Semicolon_Token (Self : Pragma_Element) return not null Program.Lexical_Elements.Lexical_Element_Access; type Implicit_Pragma is new Base_Pragma with record Is_Part_Of_Implicit : Boolean; Is_Part_Of_Inherited : Boolean; Is_Part_Of_Instance : Boolean; end record; overriding function To_Pragma_Text (Self : in out Implicit_Pragma) return Program.Elements.Pragmas.Pragma_Text_Access; overriding function Is_Part_Of_Implicit (Self : Implicit_Pragma) return Boolean; overriding function Is_Part_Of_Inherited (Self : Implicit_Pragma) return Boolean; overriding function Is_Part_Of_Instance (Self : Implicit_Pragma) return Boolean; end Program.Nodes.Pragmas;
33.646617
78
0.72581
4b8d19bee11e5e205548ae6ce84640dc31d9b2c4
5,690
ads
Ada
source/amf/uml/amf-uml-message_occurrence_specifications-collections.ads
svn2github/matreshka
9d222b3ad9da508855fb1f5adbe5e8a4fad4c530
[ "BSD-3-Clause" ]
24
2016-11-29T06:59:41.000Z
2021-08-30T11:55:16.000Z
source/amf/uml/amf-uml-message_occurrence_specifications-collections.ads
svn2github/matreshka
9d222b3ad9da508855fb1f5adbe5e8a4fad4c530
[ "BSD-3-Clause" ]
2
2019-01-16T05:15:20.000Z
2019-02-03T10:03:32.000Z
source/amf/uml/amf-uml-message_occurrence_specifications-collections.ads
svn2github/matreshka
9d222b3ad9da508855fb1f5adbe5e8a4fad4c530
[ "BSD-3-Clause" ]
4
2017-07-18T07:11:05.000Z
2020-06-21T03:02:25.000Z
------------------------------------------------------------------------------ -- -- -- Matreshka Project -- -- -- -- Ada Modeling Framework -- -- -- -- Runtime Library Component -- -- -- ------------------------------------------------------------------------------ -- -- -- Copyright © 2011-2012, Vadim Godunko <[email protected]> -- -- All rights reserved. -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions -- -- are met: -- -- -- -- * Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- -- -- * Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in the -- -- documentation and/or other materials provided with the distribution. -- -- -- -- * Neither the name of the Vadim Godunko, IE nor the names of its -- -- contributors may be used to endorse or promote products derived from -- -- this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED -- -- TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR -- -- PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF -- -- LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING -- -- NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS -- -- SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ -- $Revision$ $Date$ ------------------------------------------------------------------------------ -- This file is generated, don't edit it. ------------------------------------------------------------------------------ with AMF.Generic_Collections; package AMF.UML.Message_Occurrence_Specifications.Collections is pragma Preelaborate; package UML_Message_Occurrence_Specification_Collections is new AMF.Generic_Collections (UML_Message_Occurrence_Specification, UML_Message_Occurrence_Specification_Access); type Set_Of_UML_Message_Occurrence_Specification is new UML_Message_Occurrence_Specification_Collections.Set with null record; Empty_Set_Of_UML_Message_Occurrence_Specification : constant Set_Of_UML_Message_Occurrence_Specification; type Ordered_Set_Of_UML_Message_Occurrence_Specification is new UML_Message_Occurrence_Specification_Collections.Ordered_Set with null record; Empty_Ordered_Set_Of_UML_Message_Occurrence_Specification : constant Ordered_Set_Of_UML_Message_Occurrence_Specification; type Bag_Of_UML_Message_Occurrence_Specification is new UML_Message_Occurrence_Specification_Collections.Bag with null record; Empty_Bag_Of_UML_Message_Occurrence_Specification : constant Bag_Of_UML_Message_Occurrence_Specification; type Sequence_Of_UML_Message_Occurrence_Specification is new UML_Message_Occurrence_Specification_Collections.Sequence with null record; Empty_Sequence_Of_UML_Message_Occurrence_Specification : constant Sequence_Of_UML_Message_Occurrence_Specification; private Empty_Set_Of_UML_Message_Occurrence_Specification : constant Set_Of_UML_Message_Occurrence_Specification := (UML_Message_Occurrence_Specification_Collections.Set with null record); Empty_Ordered_Set_Of_UML_Message_Occurrence_Specification : constant Ordered_Set_Of_UML_Message_Occurrence_Specification := (UML_Message_Occurrence_Specification_Collections.Ordered_Set with null record); Empty_Bag_Of_UML_Message_Occurrence_Specification : constant Bag_Of_UML_Message_Occurrence_Specification := (UML_Message_Occurrence_Specification_Collections.Bag with null record); Empty_Sequence_Of_UML_Message_Occurrence_Specification : constant Sequence_Of_UML_Message_Occurrence_Specification := (UML_Message_Occurrence_Specification_Collections.Sequence with null record); end AMF.UML.Message_Occurrence_Specifications.Collections;
61.847826
124
0.574868
4bb8edae11ecaa13170b32809ffa10c562478887
33,439
adb
Ada
opengl/src/generator/specs.adb
Cre8or/OpenGLAda
91f12a2d4ca2aa7379dd8c83c80e4eca45fd0c06
[ "MIT" ]
79
2015-04-20T23:10:02.000Z
2022-03-04T13:50:56.000Z
opengl/src/generator/specs.adb
Cre8or/OpenGLAda
91f12a2d4ca2aa7379dd8c83c80e4eca45fd0c06
[ "MIT" ]
126
2015-09-10T10:41:34.000Z
2022-03-20T11:25:40.000Z
opengl/src/generator/specs.adb
Cre8or/OpenGLAda
91f12a2d4ca2aa7379dd8c83c80e4eca45fd0c06
[ "MIT" ]
20
2015-03-17T07:15:57.000Z
2022-02-02T17:12:11.000Z
-- part of OpenGLAda, (c) 2017 Felix Krause -- released under the terms of the MIT license, see the file "COPYING" with Ada.Containers.Hashed_Maps; with Ada.Directories; with Ada.Exceptions; with Ada.Characters.Handling; with Ada.Strings.Fixed; with Ada.Text_IO; with Tokenization; package body Specs is use Ada.Text_IO; use Ada.Containers; procedure Wrong_Token (Cur : Tokenization.Token; Message : String) is begin raise Parsing_Error with Message & ": " & Tokenization.To_String (Cur); end Wrong_Token; function Indexed_Name (Prefix : Character; Index : Positive) return String is Img : constant String := Index'Img; begin return Prefix & Img (Img'First + 1 .. Img'Last); end Indexed_Name; procedure Put_Signature (File : in out File_Type; Sig: Signature; Real_Names : Boolean) is Index : Positive := 1; First : Boolean; begin if Param_Lists.Length (Sig.Params) > 0 then Put (File, " ("); for Param of Sig.Params loop if Index > 1 then Put (File, "; "); end if; First := True; for Name of Param.Names loop if First then First := False; else Put (File, ", "); end if; if Real_Names then Put (File, Name); else Put (File, Indexed_Name ('P', Index)); end if; Index := Index + 1; end loop; Put (File, " : "); case Param.Mode is when Mode_In => null; when Mode_Out => Put (File, "out "); when Mode_In_Out => Put (File, "in out "); when Mode_Access => Put (File, "access "); when Mode_Access_Constant => Put (File, "access constant "); end case; Put (File, To_String (Param.Type_Name)); end loop; Put (File, ')'); end if; if Length (Sig.Return_Type) > 0 then Put (File, " return " & To_String (Sig.Return_Type)); end if; end Put_Signature; procedure Parse_File (Proc : in out Processor; Path : String) is use Tokenization; use Ada.Exceptions; function Symbol_Hash (S : Symbol_Id) return Ada.Containers.Hash_Type is (Ada.Containers.Hash_Type (S)); package Symbol_To_Index is new Ada.Containers.Hashed_Maps (Tokenization.Symbol_Id, Positive, Symbol_Hash, Tokenization."="); Subroutine_Defs : Symbol_To_Index.Map; T : Tokenizer := Tokenize (Path); Data : Spec_Data := Spec_Data'(File_Base_Name => To_Unbounded_String (Ada.Directories.Base_Name (Path)), others => <>); function Get_Name (Start : Token; Name : out Unbounded_String) return Token is -- returns the first token after the name Recent_Was_Identifier : Boolean := True; begin if Start.Kind /= Identifier then Wrong_Token (Start, "Unexpected token (expected identifier)"); end if; Name := To_Unbounded_String (Start.Content); loop declare Cur : constant Token := Next (T); begin if Recent_Was_Identifier then if Cur.Kind /= Delimiter or Cur.Content /= "." then return Copy (Cur); end if; elsif Cur.Kind /= Identifier or else Is_Keyword (Cur.Id) then Wrong_Token (Cur, "Unexpected token (expected identifier))"); end if; Recent_Was_Identifier := not Recent_Was_Identifier; Name := Name & Cur.Content; end; end loop; end Get_Name; procedure Process_With is Previous_Was_Id : Boolean := True; Content : Unbounded_String := To_Unbounded_String ("with"); begin loop declare Cur : constant Token := Next (T); begin exit when Cur.Kind = Delimiter and Cur.Content = ";"; if Previous_Was_Id and Cur.Kind = Identifier then Content := Content & ' '; end if; Content := Content & Cur.Content; Previous_Was_Id := Cur.Kind = Identifier; end; end loop; Data.Withs.Append (To_String (Content) & ";"); end Process_With; procedure Gen_Copy_Item (Start : Token) is Previous_Was_Id : Boolean := True; Content : Unbounded_String; begin loop declare Cur : constant Token := Next (T); begin if Paren_Depth (T) = 0 and Cur.Kind = Delimiter and Cur.Content = ";" then Content := To_Unbounded_String (Input_Substring (T, Start, Cur)); exit; end if; Previous_Was_Id := Cur.Kind = Identifier; end; end loop; Data.Items.Append (Body_Item'(Kind => Copy, To_Copy => Content)); Data.Wrappers.Append (String_Lists.Empty_Vector); end Gen_Copy_Item; procedure Gen_Subprogram_Item (Start : Token) is Sig : Signature; Read_Property : access function return String; function Read_Parenthesed_Name return String is Open_Paren : constant Token := Next (T); Name_String : constant Token := Next (T); Close_Paren : constant Token := Next (T); begin if Open_Paren.Kind /= Delimiter or else Open_Paren.Content /= "(" then Wrong_Token (Open_Paren, "Unexpected token, expected `(`"); elsif Name_String.Kind /= String_Literal then Wrong_Token (Name_String, "Unexpected token, expected string"); elsif Close_Paren.Kind /= Delimiter or else Close_Paren.Content /= ")" then Wrong_Token (Close_Paren, "Unexpected token, expected `)`"); end if; return Name_String.Content; end Read_Parenthesed_Name; function Read_Aspect_Value return String is Arrow : constant Token := Next (T); Value : constant Token := Next (T); begin if Arrow.Kind /= Delimiter or else Arrow.Content /= "=>" then Wrong_Token (Arrow, "Unexpected token, expected `=>`"); elsif Value.Kind /= String_Literal then Wrong_Token (Value, "Unexpected token, expected string"); end if; return Value.Content; end Read_Aspect_Value; procedure Finish_Sig (From : Token) is procedure Start_Properties (Starting : Token) is begin if Starting.Kind = Identifier then case Starting.Id is when Keyword_With => Read_Property := Read_Aspect_Value'Access; return; when Keyword_Is => Read_Property := Read_Parenthesed_Name'Access; return; when others => null; end case; end if; Wrong_Token (Starting, "Unexpected token (expected ""with"" or ""is"")"); end Start_Properties; begin case Start.Id is when Keyword_Procedure => Start_Properties (From); when Keyword_Function => if From.Kind /= Identifier or else From.Id /= Keyword_Return then Wrong_Token (From, "Unexpected token (expected ""return"")"); end if; declare After : constant Token := Get_Name (Next (T), Sig.Return_Type); begin Start_Properties (After); end; when others => null; end case; end Finish_Sig; function Param_Names return String_Lists.Vector is begin return Ret : String_Lists.Vector do loop declare Cur : constant Token := Next (T); begin if Cur.Kind /= Identifier then Wrong_Token (Cur, "Unexpected token (expected identifier)"); end if; Ret.Append (Cur.Content); end; declare Cur : constant Token := Next (T); begin if Cur.Kind /= Delimiter then Wrong_Token (Cur, "Unexpected token (expected delimiter)"); end if; exit when Cur.Content = ":"; if Cur.Content /= "," then Wrong_Token (Cur, "Unexpected token (expected `,`)"); end if; end; end loop; end return; end Param_Names; function Param_Type (Mode : out Param_Mode; Name : out Unbounded_String) return Token is -- returns the next token In_Seen, Out_Seen, Access_Seen, Constant_Seen : Boolean := False; begin loop declare Cur : constant Token := Next (T); begin if Cur.Kind /= Identifier then Wrong_Token (Cur, "Unexpected token (expected param type)"); end if; case Cur.Id is when Keyword_In => if In_Seen then raise Parsing_Error with "Duplicate `in`!"; end if; In_Seen := True; when Keyword_Out => if Out_Seen then raise Parsing_Error with "Duplicate `in`!"; end if; Out_Seen := True; when Keyword_Access => if Access_Seen then raise Parsing_Error with "Duplicate `in`!"; end if; Access_Seen := True; when Keyword_Constant => if Constant_Seen then raise Parsing_Error with "Duplicate `constant`!"; elsif not Access_Seen then raise Parsing_Error with "`constant` is illegal here!"; end if; Constant_Seen := True; when others => if Access_Seen then if In_Seen or Out_Seen then raise Parsing_Error with "No `in` or `out` allowed together with `access`!"; end if; if Constant_Seen then Mode := Mode_Access_Constant; else Mode := Mode_Access; end if; elsif Out_Seen then if In_Seen then Mode := Mode_In_Out; else Mode := Mode_Out; end if; else Mode := Mode_In; end if; return Get_Name (Cur, Name); end case; end; end loop; end Param_Type; procedure Read_Param_List is begin loop declare Param : Parameter := Parameter'(Names => Param_Names, others => <>); After : constant Token := Param_Type (Param.Mode, Param.Type_Name); begin Sig.Params.Append (Param); if After.Kind /= Delimiter or (After.Content /= ";" and After.Content /= ")") then Wrong_Token (After, "Unexpected token (expected `;` or `)`)"); end if; exit when After.Content = ")"; end; end loop; end Read_Param_List; function Singleton (Sig : Signature) return Sig_Lists.Vector is begin return Ret : Sig_Lists.Vector do Ret.Append (Sig); end return; end Singleton; function Expand (List : Sig_Lists.Vector; Sig : Signature) return Sig_Lists.Vector is begin return Ret : Sig_Lists.Vector := List do Ret.Append (Sig); end return; end Expand; Name_Token : constant Token := Next (T); Name : constant String := Name_Token.Content; Kind_Seen : Boolean := False; Wrappers : String_Lists.Vector; Wrapper_Pos : Natural := 0; begin if Name_Token.Kind /= Identifier then Wrong_Token (Name_Token, "Unexpected token (expected identifier)"); end if; declare Cur : constant Token := Next (T); begin if Cur.Kind /= Delimiter or else Cur.Content /= "(" then Finish_Sig (Cur); else Read_Param_List; Finish_Sig (Next (T)); end if; end; <<istoken>> declare Cur : constant Token := Next (T); begin if Cur.Kind /= Identifier then Wrong_Token (Cur, "Unexpected token (expected `Static` or `Dynamic`)"); end if; case Cur.Id is when Keyword_Static => if Kind_Seen then Wrong_Token (Cur, "Duplicate kind; only one of (`Static`, `Dynamic`) allowed."); else Kind_Seen := True; end if; declare use type Symbol_To_Index.Cursor; Pos : constant Symbol_To_Index.Cursor := Subroutine_Defs.Find (Name_Token.Id); begin if Pos = Symbol_To_Index.No_Element then Data.Items.Append (Body_Item'( Kind => Static, S_Name => To_Unbounded_String (Name), S_GL_Name => To_Unbounded_String (Read_Property.all), Sigs => Singleton (Sig) )); Subroutine_Defs.Insert (Name_Token.Id, Positive (Data.Items.Length)); else declare Item_Pos : constant Positive := Symbol_To_Index.Element (Pos); Old : constant Body_Item := Data.Items.Element (Item_Pos); GL_Name : constant Unbounded_String := To_Unbounded_String (Read_Property.all); begin if Old.Kind /= Static then raise Parsing_Error with "Name """ & Name & """ has previous definition which is not Static!"; elsif Old.S_GL_Name /= GL_Name then raise Parsing_Error with """" & Name & """ has previous definition with OpenGL name """ & To_String (Old.S_GL_Name) & """ which differs from """ & To_String (GL_Name) & """!"; end if; Data.Items.Replace_Element (Item_Pos, Body_Item'( Kind => Static, S_Name => To_Unbounded_String (Name), S_GL_Name => GL_Name, Sigs => Expand (Old.Sigs, Sig) )); Wrapper_Pos := Item_Pos; end; end if; end; when Keyword_Dynamic => if Kind_Seen then Wrong_Token (Cur, "Duplicate kind; only one of (`Static`, `Dynamic`) allowed."); else Kind_Seen := True; end if; declare Sig_Id : Positive := 1; begin while Natural (Sig_Id) <= Natural (Proc.Dynamic_Subprogram_Types.Length) loop exit when Proc.Dynamic_Subprogram_Types.Element (Sig_Id) = Sig; Sig_Id := Sig_Id + 1; end loop; if Natural (Sig_Id) > Natural (Proc.Dynamic_Subprogram_Types.Length) then Proc.Dynamic_Subprogram_Types.Append (Sig); end if; Data.Items.Append (Body_Item'( Kind => Dynamic, D_Name => To_Unbounded_String (Name), D_GL_Name => To_Unbounded_String (Read_Property.all), Sig_Id => Sig_Id )); end; when Keyword_Wrapper => Wrappers.Append (Read_Property.all); when others => Wrong_Token (Cur, "Unexpected identifier (expected `Static` or `Dynamic`)"); end case; declare Cur : constant Token := Next (T); begin if Cur.Kind /= Delimiter then Wrong_Token (Cur, "Unexpected token (expected `;` or `,`)"); elsif Cur.Content = "," then goto istoken; elsif Cur.Content /= ";" then Wrong_Token (Cur, "Unexpected token (expected `;` or `,`)"); end if; end; if Wrapper_Pos = 0 then Data.Wrappers.Append (Wrappers); else if Natural (Data.Wrappers.Length) < Wrapper_Pos then Wrong_Token (Cur, "Wrapper_Pos invalid:" & Wrapper_Pos'Img & ", length = " & Natural (Data.Wrappers.Length)'Img); end if; Data.Wrappers.Replace_Element (Wrapper_Pos, String_Lists."&" (Data.Wrappers.Element (Wrapper_Pos), Wrappers)); end if; end; end Gen_Subprogram_Item; procedure Gen_Use is Tmp : Unbounded_String := To_Unbounded_String (""); begin loop declare Ident : constant Token := Next (T); begin if Ident.Kind /= Identifier or else Is_Keyword (Ident.Id) then Wrong_Token (Ident, "Unexpected token, expected identifier"); end if; Append (Tmp, Ident.Content); end; declare Delim : constant Token := Next (T); begin if Delim.Kind /= Delimiter then Wrong_Token (Delim, "Unexpected token, expected `;` or `.`"); elsif Delim.Content = ";" then exit; elsif Delim.Content = "." then Append (Tmp, '.'); else Wrong_Token (Delim, "Unexpected token, expected `;` or `.`"); end if; end; end loop; Data.Uses.Append (To_String (Tmp)); end Gen_Use; begin loop <<continue1>> declare Cur : constant Token := Next (T); begin if Cur.Kind = Identifier then case Cur.Id is when Keyword_With => Process_With; when Keyword_Spec => exit; when others => Wrong_Token (Cur, "Unexpected identifier (expected `with` or `spec`)"); end case; elsif Cur.Kind = Comment then goto continue1; else Wrong_Token (Cur, "Unexpected token (expected identifier)"); end if; end; end loop; declare Cur : constant Token := Get_Name (Next (T), Data.Name); begin if Cur.Kind /= Identifier or else Cur.Id /= Keyword_Is then Wrong_Token(Cur, "Unexpected token (expected `is`)"); end if; end; Put_Line ("Processing spec """ & To_String (Data.Name) & """"); loop <<continue2>> declare Cur : constant Token := Next (T); begin if Cur.Kind = Comment then goto continue2; elsif Cur.Kind /= Identifier then Wrong_Token (Cur, "Unexpected token (expected identifier)"); end if; case Cur.Id is when Keyword_Pragma | Keyword_Type | Keyword_Subtype => Gen_Copy_Item (Cur); when Keyword_Function | Keyword_Procedure => Gen_Subprogram_Item (Cur); when Keyword_Use => Gen_Use; when Keyword_End => exit; when others => Wrong_Token (Cur, "Unexpected identifier (expected keyword)"); end case; end; end loop; declare End_Name : Unbounded_String; Cur : constant Token := Get_Name (Next (T), End_Name); begin if End_Name /= Data.Name then raise Parsing_Error with "Wrong spec name after `end` (expected """ & To_String (Data.Name) & """, got """ & To_String (End_Name) & """)."; end if; if Cur.Kind /= Delimiter or else Cur.Content /= ";" then Wrong_Token (Cur, "Unexpected token (expected `;`)"); end if; end; Proc.List.Append (Data); exception when Error : Parsing_Error | Tokenization.Tokenization_Error => raise Parsing_Error with "Parsing error at line" & Line (T)'Img & ", column" & Column (T)'Img & ":" & Character'Val (10) & Exception_Message (Error); end Parse_File; function First (Proc : Processor) return Spec is begin if Proc.List.Length > 0 then return 1; else return No_Spec; end if; end First; function Next (Proc : Processor; Cur : Spec) return Spec is begin if Cur = No_Spec then raise Constraint_Error; end if; return Ret : Spec := Cur + 1 do if Count_Type (Ret) > Proc.List.Length then Ret := No_Spec; end if; end return; end Next; procedure Write_API (Proc : Processor; Cur : Spec; Dir_Path : String) is use Ada.Directories; Target : File_Type; Data : constant Spec_Data := Proc.List.Element (Cur); Name : constant String := To_String (Data.Name); File_Name : constant String := Compose (Dir_Path, To_String (Data.File_Base_Name), "ads"); Is_Root : constant Boolean := Name = "GL.API"; begin Put_Line ("Writing API file for spec """ & To_String (Data.Name) & """: " & File_Name); Create (Target, Out_File, File_Name); Put_Line (Target, "-- part of OpenGLAda, (c) 2017 Felix Krause"); Put_Line (Target, "-- released under the terms of the MIT license, see the file ""COPYING"""); Put_Line (Target, "-- Autogenerated by Generate, do not edit"); for With_Stmt of Data.Withs loop Put_Line (Target, With_Stmt); end loop; Put_Line (Target, (if Is_Root then "private " else "") & "package " & Name & " is"); Put_Line (Target, " pragma Preelaborate;"); for Use_Item of Data.Uses loop Put_Line (Target, " use " & Use_Item & ";"); end loop; for Item of Data.Items loop if Item.Kind = Copy then Put_Line (Target, " " & To_String (Item.To_Copy)); end if; end loop; if Is_Root then declare Sig_Id : Positive := 1; begin for Sig of Proc.Dynamic_Subprogram_Types loop declare Type_Name : constant String := Indexed_Name ('T', Sig_Id); Is_Function : constant Boolean := Length (Sig.Return_Type) > 0; begin Put (Target, " type " & Type_Name & " is access "); Put (Target, (if Is_Function then "function" else "procedure")); Put_Signature (Target, Proc.Dynamic_Subprogram_Types.Element (Sig_Id), False); Put_Line (Target, ";"); Put_Line (Target, " pragma Convention (StdCall, " & Type_Name & ");"); end; Sig_Id := Sig_Id + 1; end loop; end; end if; for Item of Data.Items loop case Item.Kind is when Copy => null; when Static => declare Sub_Name : constant String := To_String (Item.S_Name); begin for Sig of Item.Sigs loop if Length (Sig.Return_Type) = 0 then Put (Target, " procedure " & Sub_Name); else Put (Target, " function " & Sub_Name); end if; Put_Signature (Target, Sig, True); Put_Line (Target, ";"); end loop; Put_Line (Target, " pragma Import (StdCall, " & Sub_Name & ", """ & To_String (Item.S_GL_Name) & """);"); end; when Dynamic => declare Sub_Name : constant String := To_String (Item.D_Name); Type_Name : constant String := Indexed_Name ('T', Item.Sig_Id); begin Put_Line (Target, " " & Sub_Name & " : " & Type_Name & ";"); end; end case; end loop; Put_Line (Target, "end " & Name & ";"); Close (Target); end Write_API; procedure Write_Init (Proc : Processor; Dir_Path : String) is Target : File_Type; procedure Write_Header is begin Put_Line (Target, "-- Autogenerated by Generate, do not edit"); Put_Line (Target, "with System;"); Put_Line (Target, "with Ada.Unchecked_Conversion;"); Put_Line (Target, "private with GL.API.Subprogram_Reference;"); for Spec_Data of Proc.List loop Put_Line (Target, "private with " & To_String (Spec_Data.Name) & ";"); end loop; Put_Line (Target, "procedure GL.Load_Function_Pointers is"); Put_Line (Target, " use GL.API;"); Put_Line (Target, " generic"); Put_Line (Target, " type Function_Reference is private;"); Put_Line (Target, " function Load (Function_Name : String) return Function_Reference;"); Put_Line (Target, " pragma Inline (Load);"); Put_Line (Target, " function Load (Function_Name : String) return Function_Reference is"); Put_Line (Target, " function As_Function_Reference is new Ada.Unchecked_Conversion ("); Put_Line (Target, " Source => System.Address, Target => Function_Reference);"); Put_Line (Target, " use type System.Address;"); Put_Line (Target, " Raw : System.Address := Subprogram_Reference (Function_Name);"); Put_Line (Target, " begin"); Put_Line (Target, " if Raw = System.Null_Address then"); Put_Line (Target, " Raw := Subprogram_Reference (Function_Name & ""ARB"");"); Put_Line (Target, " if Raw = System.Null_Address then"); Put_Line (Target, " Raw := Subprogram_Reference (Function_Name & ""EXT"");"); Put_Line (Target, " end if;"); Put_Line (Target, " end if;"); Put_Line (Target, " return As_Function_Reference (Raw);"); Put_Line (Target, " end Load;"); end Write_Header; Index : Positive := 1; begin Put_Line ("Writing procedure ""GL.Init"""); Create (Target, Out_File, Ada.Directories.Compose (Dir_Path, "gl-load_function_pointers.adb")); Write_Header; for Sub_Type of Proc.Dynamic_Subprogram_Types loop Put_Line (Target, " function Load_" & Indexed_Name ('T', Index) & " is new Load (" & Indexed_Name ('T', Index) & ");"); Index := Index + 1; end loop; Put_Line (Target, "begin"); for Data of Proc.List loop declare Spec_Name : constant String := To_String (Data.Name); begin for Item of Data.Items loop if Item.Kind = Dynamic then Put_Line (Target, " " & Spec_Name & '.' & To_String (Item.D_Name) & " := Load_" & Indexed_Name ('T', Item.Sig_Id) & " (""" & To_String (Item.D_GL_Name) & """);"); end if; end loop; end; end loop; Put_Line (Target, "end GL.Load_Function_Pointers;"); Close (Target); end Write_Init; procedure Write_Wrapper_Table (Proc : Processor; Dir_Path, Interface_Folder : String) is Target : File_Type; procedure Write_Header is begin Put_Line (Target, "---"); Put_Line (Target, "layout: default"); Put_Line (Target, "title: OpenGL Mapping"); Put_Line (Target, "permalink: mapping.html"); Put_Line (Target, "---"); Put_Line (Target, "<!-- Autogenerated by generate tool, do not edit -->"); New_Line (Target); Put_Line (Target, "| OpenGL Function Name | OpenGLAda Wrapper"); Put_Line (Target, "|----------------------+------------------"); end Write_Header; function Get_Wrapper_Link (Qualified_Name : String) return String is use Ada.Characters.Handling; Prefix : constant String := "https://github.com/flyx/OpenGLAda/blob/master/src/gl/interface/"; File_Name : Unbounded_String := To_Unbounded_String (0); Subroutine_Name : Unbounded_String := To_Unbounded_String (0); begin for Index in Qualified_Name'Range loop case Qualified_Name (Index) is when '.' => if Length (File_Name) > 0 then Append (File_Name, "-"); end if; Append (File_Name, Subroutine_Name); Subroutine_Name := To_Unbounded_String (0); when others => Append (Subroutine_Name, To_Lower (Qualified_Name (Index))); end case; end loop; Append (File_Name, ".ads"); declare use Tokenization; use Ada.Strings; T : Tokenizer := Tokenize (Ada.Directories.Compose (Interface_Folder, To_String (File_Name))); Requested_Id : Symbol_Id; begin Register_Symbol (T, To_String (Subroutine_Name), Requested_Id); loop declare Cur : constant Token := Next (T); begin if Cur.Kind = Identifier and then Cur.Id = Requested_Id then return Prefix & To_String (File_Name) & "#L" & Fixed.Trim (Line (T)'Img, Left); elsif Cur.Kind = Stream_End then exit; end if; end; end loop; raise Parsing_Error with "Cannot find symbol " & To_String (Subroutine_Name) & " in file " & To_String (File_Name); end; end Get_Wrapper_Link; begin Put_Line ("Writing wrapper list"); Create (Target, Out_File, Ada.Directories.Compose (Dir_Path, "WrapperList.md")); Write_Header; for Data of Proc.List loop for Index in Integer (Positive'First) .. Integer (Data.Items.Length) loop declare Item : constant Body_Item := Data.Items.Element (Index); GL_Name : constant String := To_String ( case Item.Kind is when Static => Item.S_GL_Name, when Dynamic => Item.D_GL_Name, when Copy => Item.To_Copy); Wrappers : constant String_Lists.Vector := Data.Wrappers.Element (Index); begin if Wrappers.Length > 0 then Put (Target, "| `" & GL_Name & "` | "); declare First : Boolean := True; begin for Wrapper of Wrappers loop if First then First := False; else Put (Target, " <br/> "); end if; Put (Target, "[" & Wrapper & "](" & Get_Wrapper_Link (Wrapper) & ")"); end loop; end; New_Line (Target); end if; end; end loop; end loop; Close (Target); end Write_Wrapper_Table; end Specs;
39.713777
131
0.493854
04f99b7213b325e50ea70abef1259d67cc942371
301
adb
Ada
fibonacci.adb
kylelk/ada-examples
990af2923efcf16a035054fd83ab9ac603fe9613
[ "MIT" ]
1
2021-06-28T11:11:09.000Z
2021-06-28T11:11:09.000Z
fibonacci.adb
kylelk/ada-examples
990af2923efcf16a035054fd83ab9ac603fe9613
[ "MIT" ]
null
null
null
fibonacci.adb
kylelk/ada-examples
990af2923efcf16a035054fd83ab9ac603fe9613
[ "MIT" ]
null
null
null
with Ada.Text_IO, Ada.Integer_Text_IO; use Ada; procedure fibonacci is a,b,tmp : integer; begin a := 0; b := 1; while b < 100 loop Integer_Text_IO.put(b, width=>0); Text_IO.New_Line; tmp := a + b; a := b; b := tmp; end loop; end fibonacci;
17.705882
41
0.538206
13f2e7edf195fa079f096d5bd8efa11e18faff70
270,616
adb
Ada
LSTMcell/hls/LSTMcell/solution1/.autopilot/db/generic_tanh_double_s.bind.adb
JerrytTom/FPGA-Based-LSTM-Accelerator
512253b82b5966e7914477d0317c4671c87853de
[ "MIT" ]
3
2021-07-02T03:26:35.000Z
2021-12-07T02:52:51.000Z
LSTMcell/hls/LSTMcell/solution1/.autopilot/db/generic_tanh_double_s.bind.adb
JerrytTom/FPGA-Based-LSTM-Accelerator
512253b82b5966e7914477d0317c4671c87853de
[ "MIT" ]
null
null
null
LSTMcell/hls/LSTMcell/solution1/.autopilot/db/generic_tanh_double_s.bind.adb
JerrytTom/FPGA-Based-LSTM-Accelerator
512253b82b5966e7914477d0317c4671c87853de
[ "MIT" ]
3
2021-08-29T14:24:54.000Z
2022-01-28T11:22:34.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>generic_tanh_double_s</name> <ret_bitwidth>64</ret_bitwidth> <ports class_id="2" tracking_level="0" version="0"> <count>1</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>t_in</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>t_in</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</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> </ports> <nodes class_id="8" tracking_level="0" version="0"> <count>63</count> <item_version>0</item_version> <item class_id="9" tracking_level="1" version="0" object_id="_2"> <Value> <Obj> <type>0</type> <id>5</id> <name>t_in_read</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>56</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="10" tracking_level="0" version="0"> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</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>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>56</second> </item> </second> </item> </inlineStackInfo> <originalName>t_in</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>83</item> <item>84</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>1</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_3"> <Value> <Obj> <type>0</type> <id>6</id> <name>p_Val2_s</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>475</lineNumber> <contextFuncName>fp_struct</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>60</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first> <second>fp_struct</second> </first> <second>475</second> </item> </second> </item> </inlineStackInfo> <originalName>val</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>85</item> </oprand_edges> <opcode>bitcast</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>2</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_4"> <Value> <Obj> <type>0</type> <id>7</id> <name>p_Result_s</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>475</lineNumber> <contextFuncName>fp_struct</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>60</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first> <second>fp_struct</second> </first> <second>475</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>87</item> <item>88</item> <item>90</item> </oprand_edges> <opcode>bitselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>3</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_5"> <Value> <Obj> <type>0</type> <id>8</id> <name>tmp_V</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>477</lineNumber> <contextFuncName>fp_struct</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>60</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first> <second>fp_struct</second> </first> <second>477</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>92</item> <item>93</item> <item>95</item> <item>97</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>4</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_6"> <Value> <Obj> <type>0</type> <id>9</id> <name>tmp_V_1</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>478</lineNumber> <contextFuncName>fp_struct</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>60</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first> <second>fp_struct</second> </first> <second>478</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>52</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>98</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>5</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_7"> <Value> <Obj> <type>0</type> <id>10</id> <name>tmp_38</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>495</lineNumber> <contextFuncName>data</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>6</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_copysign.h</first> <second>generic_copysign&amp;lt;double&amp;gt;</second> </first> <second>13</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_fabs.h</first> <second>generic_fabs&amp;lt;double&amp;gt;</second> </first> <second>12</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>61</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first> <second>data</second> </first> <second>495</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first> <second>to_double</second> </first> <second>512</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first> <second>to_ieee</second> </first> <second>526</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>63</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>99</item> </oprand_edges> <opcode>trunc</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>6</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_8"> <Value> <Obj> <type>0</type> <id>11</id> <name>p_Result_12</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>495</lineNumber> <contextFuncName>data</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>6</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_copysign.h</first> <second>generic_copysign&amp;lt;double&amp;gt;</second> </first> <second>13</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_fabs.h</first> <second>generic_fabs&amp;lt;double&amp;gt;</second> </first> <second>12</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>61</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first> <second>data</second> </first> <second>495</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first> <second>to_double</second> </first> <second>512</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first> <second>to_ieee</second> </first> <second>526</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>101</item> <item>103</item> <item>104</item> </oprand_edges> <opcode>bitconcatenate</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>7</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_9"> <Value> <Obj> <type>0</type> <id>12</id> <name>abst_in</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>512</lineNumber> <contextFuncName>to_double</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>5</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_copysign.h</first> <second>generic_copysign&amp;lt;double&amp;gt;</second> </first> <second>13</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint/hls_fabs.h</first> <second>generic_fabs&amp;lt;double&amp;gt;</second> </first> <second>12</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>61</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first> <second>to_double</second> </first> <second>512</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first> <second>to_ieee</second> </first> <second>526</second> </item> </second> </item> </inlineStackInfo> <originalName>abst_in</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>105</item> </oprand_edges> <opcode>bitcast</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>8</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_10"> <Value> <Obj> <type>0</type> <id>13</id> <name>tmp</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>64</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>64</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>106</item> <item>108</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.88</m_delay> <m_topoIndex>9</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_11"> <Value> <Obj> <type>0</type> <id>14</id> <name></name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>64</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>64</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>109</item> <item>110</item> <item>111</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>10</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_12"> <Value> <Obj> <type>0</type> <id>16</id> <name>tmp_3</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>73</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>73</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>121</item> <item>123</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.88</m_delay> <m_topoIndex>11</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_13"> <Value> <Obj> <type>0</type> <id>17</id> <name></name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>73</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>73</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>124</item> <item>125</item> <item>126</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>12</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_14"> <Value> <Obj> <type>0</type> <id>19</id> <name>tmp_4</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>74</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>74</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>127</item> <item>128</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.88</m_delay> <m_topoIndex>13</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_15"> <Value> <Obj> <type>0</type> <id>20</id> <name>tmp_5</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>74</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>74</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>129</item> <item>130</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>2.89</m_delay> <m_topoIndex>14</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_16"> <Value> <Obj> <type>0</type> <id>21</id> <name>or_cond</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>74</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>74</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>131</item> <item>132</item> </oprand_edges> <opcode>and</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.97</m_delay> <m_topoIndex>15</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_17"> <Value> <Obj> <type>0</type> <id>22</id> <name></name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>74</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>74</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>133</item> <item>134</item> <item>135</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>16</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_18"> <Value> <Obj> <type>0</type> <id>24</id> <name>tmp_7</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>79</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>79</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>141</item> <item>143</item> </oprand_edges> <opcode>dcmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>6.82</m_delay> <m_topoIndex>17</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_19"> <Value> <Obj> <type>0</type> <id>25</id> <name></name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>79</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>79</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>144</item> <item>145</item> <item>146</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.90</m_delay> <m_topoIndex>18</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_20"> <Value> <Obj> <type>0</type> <id>27</id> <name>tmp_8</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>82</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>82</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>147</item> <item>149</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.88</m_delay> <m_topoIndex>19</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_21"> <Value> <Obj> <type>0</type> <id>28</id> <name>tmp_99_neg</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>83</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>83</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>150</item> <item>152</item> </oprand_edges> <opcode>xor</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.99</m_delay> <m_topoIndex>20</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_22"> <Value> <Obj> <type>0</type> <id>29</id> <name>tmp_9</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>83</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>83</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>153</item> </oprand_edges> <opcode>bitcast</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>24</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_23"> <Value> <Obj> <type>0</type> <id>30</id> <name>x</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>83</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>83</second> </item> </second> </item> </inlineStackInfo> <originalName>x</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>154</item> <item>155</item> </oprand_edges> <opcode>dsub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>8.23</m_delay> <m_topoIndex>25</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_24"> <Value> <Obj> <type>0</type> <id>31</id> <name>x_1</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>86</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>86</second> </item> </second> </item> </inlineStackInfo> <originalName>x</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>156</item> <item>157</item> </oprand_edges> <opcode>dadd</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>8.23</m_delay> <m_topoIndex>21</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_25"> <Value> <Obj> <type>0</type> <id>32</id> <name>x_2</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>86</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>86</second> </item> </second> </item> </inlineStackInfo> <originalName>x</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>158</item> <item>159</item> <item>160</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.48</m_delay> <m_topoIndex>27</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_26"> <Value> <Obj> <type>0</type> <id>33</id> <name>p_Val2_3</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>475</lineNumber> <contextFuncName>fp_struct</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>89</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</first> <second>expm1</second> </first> <second>7</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first> <second>fp_struct</second> </first> <second>475</second> </item> </second> </item> </inlineStackInfo> <originalName>val</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>161</item> </oprand_edges> <opcode>bitcast</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>28</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_27"> <Value> <Obj> <type>0</type> <id>34</id> <name>p_Result_11</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>475</lineNumber> <contextFuncName>fp_struct</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>89</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</first> <second>expm1</second> </first> <second>7</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first> <second>fp_struct</second> </first> <second>475</second> </item> </second> </item> </inlineStackInfo> <originalName>__Result__</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>162</item> <item>163</item> <item>164</item> </oprand_edges> <opcode>bitselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>29</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_28"> <Value> <Obj> <type>0</type> <id>35</id> <name>tmp_V_2</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>477</lineNumber> <contextFuncName>fp_struct</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>3</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>89</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</first> <second>expm1</second> </first> <second>7</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first> <second>fp_struct</second> </first> <second>477</second> </item> </second> </item> </inlineStackInfo> <originalName>tmp.V</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>11</bitwidth> </Value> <oprand_edges> <count>4</count> <item_version>0</item_version> <item>165</item> <item>166</item> <item>167</item> <item>168</item> </oprand_edges> <opcode>partselect</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>30</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_29"> <Value> <Obj> <type>0</type> <id>36</id> <name></name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>8</lineNumber> <contextFuncName>expm1</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>89</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</first> <second>expm1</second> </first> <second>8</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>169</item> <item>170</item> <item>171</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>31</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_30"> <Value> <Obj> <type>0</type> <id>38</id> <name>tmp_i_59</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>9</lineNumber> <contextFuncName>expm1</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>89</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</first> <second>expm1</second> </first> <second>9</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>183</item> <item>185</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.88</m_delay> <m_topoIndex>32</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_31"> <Value> <Obj> <type>0</type> <id>39</id> <name>tmp_16_i</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>9</lineNumber> <contextFuncName>expm1</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>89</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</first> <second>expm1</second> </first> <second>9</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>186</item> <item>187</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.88</m_delay> <m_topoIndex>33</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_32"> <Value> <Obj> <type>0</type> <id>40</id> <name>or_cond1_i</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>9</lineNumber> <contextFuncName>expm1</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>89</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</first> <second>expm1</second> </first> <second>9</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>188</item> <item>189</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.97</m_delay> <m_topoIndex>34</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_33"> <Value> <Obj> <type>0</type> <id>41</id> <name></name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>9</lineNumber> <contextFuncName>expm1</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>89</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</first> <second>expm1</second> </first> <second>9</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>190</item> <item>191</item> <item>192</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.76</m_delay> <m_topoIndex>35</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_34"> <Value> <Obj> <type>0</type> <id>43</id> <name>tmp_i</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>8</lineNumber> <contextFuncName>expm1</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>89</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</first> <second>expm1</second> </first> <second>8</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>172</item> <item>174</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.88</m_delay> <m_topoIndex>36</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_35"> <Value> <Obj> <type>0</type> <id>44</id> <name>tmp_15_i</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>8</lineNumber> <contextFuncName>expm1</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>89</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</first> <second>expm1</second> </first> <second>8</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>175</item> <item>177</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.88</m_delay> <m_topoIndex>37</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_36"> <Value> <Obj> <type>0</type> <id>45</id> <name>or_cond_i</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>8</lineNumber> <contextFuncName>expm1</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>89</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</first> <second>expm1</second> </first> <second>8</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>178</item> <item>179</item> </oprand_edges> <opcode>or</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.97</m_delay> <m_topoIndex>38</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_37"> <Value> <Obj> <type>0</type> <id>46</id> <name></name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>8</lineNumber> <contextFuncName>expm1</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>89</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</first> <second>expm1</second> </first> <second>8</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>180</item> <item>181</item> <item>182</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.76</m_delay> <m_topoIndex>39</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_38"> <Value> <Obj> <type>0</type> <id>48</id> <name>tmp_17_i</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>10</lineNumber> <contextFuncName>expm1</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>89</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</first> <second>expm1</second> </first> <second>10</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>5</count> <item_version>0</item_version> <item>194</item> <item>195</item> <item>244</item> <item>245</item> <item>246</item> </oprand_edges> <opcode>call</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>4.21</m_delay> <m_topoIndex>41</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_39"> <Value> <Obj> <type>0</type> <id>49</id> <name>tmp_18_i</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>10</lineNumber> <contextFuncName>expm1</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>89</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</first> <second>expm1</second> </first> <second>10</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>196</item> <item>198</item> </oprand_edges> <opcode>dadd</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>8.23</m_delay> <m_topoIndex>42</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_40"> <Value> <Obj> <type>0</type> <id>50</id> <name></name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>10</lineNumber> <contextFuncName>expm1</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>89</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/src/common/hls_exp_double.cpp</first> <second>expm1</second> </first> <second>10</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>199</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.76</m_delay> <m_topoIndex>43</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_41"> <Value> <Obj> <type>0</type> <id>52</id> <name>expx</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>x</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>6</count> <item_version>0</item_version> <item>200</item> <item>201</item> <item>202</item> <item>203</item> <item>204</item> <item>205</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>44</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_42"> <Value> <Obj> <type>0</type> <id>53</id> <name></name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>91</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>91</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>206</item> <item>207</item> <item>208</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>40</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_43"> <Value> <Obj> <type>0</type> <id>55</id> <name>tmp_12</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>99</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>99</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>219</item> <item>220</item> </oprand_edges> <opcode>dadd</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>8.23</m_delay> <m_topoIndex>45</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_44"> <Value> <Obj> <type>0</type> <id>56</id> <name>tmp_13</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>99</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>99</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>221</item> <item>222</item> </oprand_edges> <opcode>ddiv</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>8.62</m_delay> <m_topoIndex>49</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_45"> <Value> <Obj> <type>0</type> <id>57</id> <name>resultf_2</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>99</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>99</second> </item> </second> </item> </inlineStackInfo> <originalName>resultf</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>223</item> <item>224</item> </oprand_edges> <opcode>dsub</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>8.23</m_delay> <m_topoIndex>52</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_46"> <Value> <Obj> <type>0</type> <id>58</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>225</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.90</m_delay> <m_topoIndex>57</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_47"> <Value> <Obj> <type>0</type> <id>60</id> <name>tmp_100_to_int</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>94</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>94</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>209</item> </oprand_edges> <opcode>bitcast</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>47</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_48"> <Value> <Obj> <type>0</type> <id>61</id> <name>tmp_100_neg</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>94</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>94</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>210</item> <item>211</item> </oprand_edges> <opcode>xor</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.99</m_delay> <m_topoIndex>48</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_49"> <Value> <Obj> <type>0</type> <id>62</id> <name>tmp_10</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>94</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>94</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>212</item> </oprand_edges> <opcode>bitcast</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>50</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_50"> <Value> <Obj> <type>0</type> <id>63</id> <name>tmp_11</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>94</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>94</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>213</item> <item>215</item> </oprand_edges> <opcode>dadd</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>8.23</m_delay> <m_topoIndex>46</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_51"> <Value> <Obj> <type>0</type> <id>64</id> <name>resultf_1</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>94</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>94</second> </item> </second> </item> </inlineStackInfo> <originalName>resultf</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>216</item> <item>217</item> </oprand_edges> <opcode>ddiv</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>8.62</m_delay> <m_topoIndex>51</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_52"> <Value> <Obj> <type>0</type> <id>65</id> <name></name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>95</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>95</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>218</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.90</m_delay> <m_topoIndex>53</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_53"> <Value> <Obj> <type>0</type> <id>67</id> <name>tmp_6</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>77</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>77</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>136</item> <item>137</item> </oprand_edges> <opcode>dadd</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>8.23</m_delay> <m_topoIndex>22</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_54"> <Value> <Obj> <type>0</type> <id>68</id> <name>resultf</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>77</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>77</second> </item> </second> </item> </inlineStackInfo> <originalName>resultf</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>138</item> <item>139</item> </oprand_edges> <opcode>dmul</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>7.78</m_delay> <m_topoIndex>26</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_55"> <Value> <Obj> <type>0</type> <id>69</id> <name></name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>78</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>78</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>140</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.90</m_delay> <m_topoIndex>54</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_56"> <Value> <Obj> <type>0</type> <id>71</id> <name>tmp_s</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>66</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>1</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>112</item> <item>114</item> </oprand_edges> <opcode>icmp</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>2.89</m_delay> <m_topoIndex>23</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_57"> <Value> <Obj> <type>0</type> <id>72</id> <name>p_1</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>66</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>115</item> <item>117</item> <item>119</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.48</m_delay> <m_topoIndex>55</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_58"> <Value> <Obj> <type>0</type> <id>73</id> <name></name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>66</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>66</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>120</item> </oprand_edges> <opcode>br</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.90</m_delay> <m_topoIndex>56</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_59"> <Value> <Obj> <type>0</type> <id>75</id> <name>resultf_4</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName>resultf</originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>10</count> <item_version>0</item_version> <item>226</item> <item>227</item> <item>228</item> <item>229</item> <item>230</item> <item>231</item> <item>232</item> <item>233</item> <item>234</item> <item>235</item> </oprand_edges> <opcode>phi</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>58</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_60"> <Value> <Obj> <type>0</type> <id>76</id> <name>tmp_104_to_int</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>111</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>111</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>236</item> </oprand_edges> <opcode>bitcast</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>59</m_topoIndex> <m_clusterGroupNumber>1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_61"> <Value> <Obj> <type>0</type> <id>77</id> <name>tmp_104_neg</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>111</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>111</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>237</item> <item>238</item> </oprand_edges> <opcode>xor</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>60</m_topoIndex> <m_clusterGroupNumber>1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_62"> <Value> <Obj> <type>0</type> <id>78</id> <name>tmp_14</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>111</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>111</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>1</count> <item_version>0</item_version> <item>239</item> </oprand_edges> <opcode>bitcast</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>61</m_topoIndex> <m_clusterGroupNumber>1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_63"> <Value> <Obj> <type>0</type> <id>79</id> <name>p_s</name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>475</lineNumber> <contextFuncName>fp_struct</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>2</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>60</second> </item> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/src/hls\utils/x_hls_utils.h</first> <second>fp_struct</second> </first> <second>475</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>240</item> <item>241</item> <item>242</item> </oprand_edges> <opcode>select</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>1.48</m_delay> <m_topoIndex>62</m_topoIndex> <m_clusterGroupNumber>1</m_clusterGroupNumber> </item> <item class_id_reference="9" object_id="_64"> <Value> <Obj> <type>0</type> <id>80</id> <name></name> <fileName>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</fileName> <fileDirectory>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</fileDirectory> <lineNumber>113</lineNumber> <contextFuncName>generic_tanh&amp;lt;double&amp;gt;</contextFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>r:\builds\2018.3\continuous\2018_12_06_2405991\src\products</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>r:/builds/2018.3/continuous/2018_12_06_2405991/src/products/hls/hls_lib/hlsmath/include/FloatingPoint\hls_tanh.h</first> <second>generic_tanh&amp;lt;double&amp;gt;</second> </first> <second>113</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>243</item> </oprand_edges> <opcode>ret</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>63</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> </nodes> <consts class_id="15" tracking_level="0" version="0"> <count>18</count> <item_version>0</item_version> <item class_id="16" tracking_level="1" version="0" object_id="_65"> <Value> <Obj> <type>2</type> <id>89</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>63</content> </item> <item class_id_reference="16" object_id="_66"> <Value> <Obj> <type>2</type> <id>94</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>32</bitwidth> </Value> <const_type>0</const_type> <content>52</content> </item> <item class_id_reference="16" object_id="_67"> <Value> <Obj> <type>2</type> <id>96</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="_68"> <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>1</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_69"> <Value> <Obj> <type>2</type> <id>107</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>2047</content> </item> <item class_id_reference="16" object_id="_70"> <Value> <Obj> <type>2</type> <id>113</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>52</bitwidth> </Value> <const_type>0</const_type> <content>0</content> </item> <item class_id_reference="16" object_id="_71"> <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>64</bitwidth> </Value> <const_type>1</const_type> <content>1</content> </item> <item class_id_reference="16" object_id="_72"> <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>64</bitwidth> </Value> <const_type>1</const_type> <content>nan</content> </item> <item class_id_reference="16" object_id="_73"> <Value> <Obj> <type>2</type> <id>122</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>968</content> </item> <item class_id_reference="16" object_id="_74"> <Value> <Obj> <type>2</type> <id>142</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <const_type>1</const_type> <content>22</content> </item> <item class_id_reference="16" object_id="_75"> <Value> <Obj> <type>2</type> <id>148</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>1023</content> </item> <item class_id_reference="16" object_id="_76"> <Value> <Obj> <type>2</type> <id>151</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <const_type>0</const_type> <content>9223372036854775808</content> </item> <item class_id_reference="16" object_id="_77"> <Value> <Obj> <type>2</type> <id>173</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>995</content> </item> <item class_id_reference="16" object_id="_78"> <Value> <Obj> <type>2</type> <id>176</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="_79"> <Value> <Obj> <type>2</type> <id>184</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>996</content> </item> <item class_id_reference="16" object_id="_80"> <Value> <Obj> <type>2</type> <id>193</id> <name>exp_generic_double_s</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <const_type>6</const_type> <content>&lt;constant:exp_generic&lt;double&gt;&gt;</content> </item> <item class_id_reference="16" object_id="_81"> <Value> <Obj> <type>2</type> <id>197</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <const_type>1</const_type> <content>-1</content> </item> <item class_id_reference="16" object_id="_82"> <Value> <Obj> <type>2</type> <id>214</id> <name>empty</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <bitwidth>64</bitwidth> </Value> <const_type>1</const_type> <content>2</content> </item> </consts> <blocks class_id="17" tracking_level="0" version="0"> <count>14</count> <item_version>0</item_version> <item class_id="18" tracking_level="1" version="0" object_id="_83"> <Obj> <type>3</type> <id>15</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>10</count> <item_version>0</item_version> <item>5</item> <item>6</item> <item>7</item> <item>8</item> <item>9</item> <item>10</item> <item>11</item> <item>12</item> <item>13</item> <item>14</item> </node_objs> </item> <item class_id_reference="18" object_id="_84"> <Obj> <type>3</type> <id>18</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>16</item> <item>17</item> </node_objs> </item> <item class_id_reference="18" object_id="_85"> <Obj> <type>3</type> <id>23</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>4</count> <item_version>0</item_version> <item>19</item> <item>20</item> <item>21</item> <item>22</item> </node_objs> </item> <item class_id_reference="18" object_id="_86"> <Obj> <type>3</type> <id>26</id> <name>._crit_edge57</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>24</item> <item>25</item> </node_objs> </item> <item class_id_reference="18" object_id="_87"> <Obj> <type>3</type> <id>37</id> <name>_ifconv</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>10</count> <item_version>0</item_version> <item>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> </node_objs> </item> <item class_id_reference="18" object_id="_88"> <Obj> <type>3</type> <id>42</id> <name>.critedge.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>4</count> <item_version>0</item_version> <item>38</item> <item>39</item> <item>40</item> <item>41</item> </node_objs> </item> <item class_id_reference="18" object_id="_89"> <Obj> <type>3</type> <id>47</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>4</count> <item_version>0</item_version> <item>43</item> <item>44</item> <item>45</item> <item>46</item> </node_objs> </item> <item class_id_reference="18" object_id="_90"> <Obj> <type>3</type> <id>51</id> <name>._crit_edge44.i</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>3</count> <item_version>0</item_version> <item>48</item> <item>49</item> <item>50</item> </node_objs> </item> <item class_id_reference="18" object_id="_91"> <Obj> <type>3</type> <id>54</id> <name>expm1.exit</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>2</count> <item_version>0</item_version> <item>52</item> <item>53</item> </node_objs> </item> <item class_id_reference="18" object_id="_92"> <Obj> <type>3</type> <id>59</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>4</count> <item_version>0</item_version> <item>55</item> <item>56</item> <item>57</item> <item>58</item> </node_objs> </item> <item class_id_reference="18" object_id="_93"> <Obj> <type>3</type> <id>66</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>6</count> <item_version>0</item_version> <item>60</item> <item>61</item> <item>62</item> <item>63</item> <item>64</item> <item>65</item> </node_objs> </item> <item class_id_reference="18" object_id="_94"> <Obj> <type>3</type> <id>70</id> <name>._crit_edge56</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>3</count> <item_version>0</item_version> <item>67</item> <item>68</item> <item>69</item> </node_objs> </item> <item class_id_reference="18" object_id="_95"> <Obj> <type>3</type> <id>74</id> <name></name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <coreName></coreName> </Obj> <node_objs> <count>3</count> <item_version>0</item_version> <item>71</item> <item>72</item> <item>73</item> </node_objs> </item> <item class_id_reference="18" object_id="_96"> <Obj> <type>3</type> <id>81</id> <name>._crit_edge_ifconv</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>75</item> <item>76</item> <item>77</item> <item>78</item> <item>79</item> <item>80</item> </node_objs> </item> </blocks> <edges class_id="19" tracking_level="0" version="0"> <count>158</count> <item_version>0</item_version> <item class_id="20" tracking_level="1" version="0" object_id="_97"> <id>84</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>5</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_98"> <id>85</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>6</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_99"> <id>88</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>7</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_100"> <id>90</id> <edge_type>1</edge_type> <source_obj>89</source_obj> <sink_obj>7</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_101"> <id>93</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>8</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_102"> <id>95</id> <edge_type>1</edge_type> <source_obj>94</source_obj> <sink_obj>8</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_103"> <id>97</id> <edge_type>1</edge_type> <source_obj>96</source_obj> <sink_obj>8</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_104"> <id>98</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>9</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_105"> <id>99</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>10</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_106"> <id>103</id> <edge_type>1</edge_type> <source_obj>102</source_obj> <sink_obj>11</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_107"> <id>104</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>11</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_108"> <id>105</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>12</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_109"> <id>106</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>13</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_110"> <id>108</id> <edge_type>1</edge_type> <source_obj>107</source_obj> <sink_obj>13</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_111"> <id>109</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>14</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_112"> <id>110</id> <edge_type>2</edge_type> <source_obj>18</source_obj> <sink_obj>14</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_113"> <id>111</id> <edge_type>2</edge_type> <source_obj>74</source_obj> <sink_obj>14</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_114"> <id>112</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>71</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_115"> <id>114</id> <edge_type>1</edge_type> <source_obj>113</source_obj> <sink_obj>71</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_116"> <id>115</id> <edge_type>1</edge_type> <source_obj>71</source_obj> <sink_obj>72</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_117"> <id>117</id> <edge_type>1</edge_type> <source_obj>116</source_obj> <sink_obj>72</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_118"> <id>119</id> <edge_type>1</edge_type> <source_obj>118</source_obj> <sink_obj>72</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_119"> <id>120</id> <edge_type>2</edge_type> <source_obj>81</source_obj> <sink_obj>73</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_120"> <id>121</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>16</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_121"> <id>123</id> <edge_type>1</edge_type> <source_obj>122</source_obj> <sink_obj>16</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_122"> <id>124</id> <edge_type>1</edge_type> <source_obj>16</source_obj> <sink_obj>17</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_123"> <id>125</id> <edge_type>2</edge_type> <source_obj>23</source_obj> <sink_obj>17</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_124"> <id>126</id> <edge_type>2</edge_type> <source_obj>70</source_obj> <sink_obj>17</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_125"> <id>127</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>19</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_126"> <id>128</id> <edge_type>1</edge_type> <source_obj>122</source_obj> <sink_obj>19</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_127"> <id>129</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>20</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_128"> <id>130</id> <edge_type>1</edge_type> <source_obj>113</source_obj> <sink_obj>20</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_129"> <id>131</id> <edge_type>1</edge_type> <source_obj>19</source_obj> <sink_obj>21</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_130"> <id>132</id> <edge_type>1</edge_type> <source_obj>20</source_obj> <sink_obj>21</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_131"> <id>133</id> <edge_type>1</edge_type> <source_obj>21</source_obj> <sink_obj>22</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_132"> <id>134</id> <edge_type>2</edge_type> <source_obj>26</source_obj> <sink_obj>22</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_133"> <id>135</id> <edge_type>2</edge_type> <source_obj>70</source_obj> <sink_obj>22</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_134"> <id>136</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>67</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_135"> <id>137</id> <edge_type>1</edge_type> <source_obj>116</source_obj> <sink_obj>67</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_136"> <id>138</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>68</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_137"> <id>139</id> <edge_type>1</edge_type> <source_obj>67</source_obj> <sink_obj>68</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_138"> <id>140</id> <edge_type>2</edge_type> <source_obj>81</source_obj> <sink_obj>69</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_139"> <id>141</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>24</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_140"> <id>143</id> <edge_type>1</edge_type> <source_obj>142</source_obj> <sink_obj>24</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_141"> <id>144</id> <edge_type>1</edge_type> <source_obj>24</source_obj> <sink_obj>25</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_142"> <id>145</id> <edge_type>2</edge_type> <source_obj>81</source_obj> <sink_obj>25</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_143"> <id>146</id> <edge_type>2</edge_type> <source_obj>37</source_obj> <sink_obj>25</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_144"> <id>147</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>27</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_145"> <id>149</id> <edge_type>1</edge_type> <source_obj>148</source_obj> <sink_obj>27</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_146"> <id>150</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>28</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_147"> <id>152</id> <edge_type>1</edge_type> <source_obj>151</source_obj> <sink_obj>28</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_148"> <id>153</id> <edge_type>1</edge_type> <source_obj>28</source_obj> <sink_obj>29</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_149"> <id>154</id> <edge_type>1</edge_type> <source_obj>29</source_obj> <sink_obj>30</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_150"> <id>155</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>30</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_151"> <id>156</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>31</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_152"> <id>157</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>31</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_153"> <id>158</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>32</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_154"> <id>159</id> <edge_type>1</edge_type> <source_obj>30</source_obj> <sink_obj>32</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_155"> <id>160</id> <edge_type>1</edge_type> <source_obj>31</source_obj> <sink_obj>32</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_156"> <id>161</id> <edge_type>1</edge_type> <source_obj>32</source_obj> <sink_obj>33</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_157"> <id>163</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>34</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_158"> <id>164</id> <edge_type>1</edge_type> <source_obj>89</source_obj> <sink_obj>34</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_159"> <id>166</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>35</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_160"> <id>167</id> <edge_type>1</edge_type> <source_obj>94</source_obj> <sink_obj>35</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_161"> <id>168</id> <edge_type>1</edge_type> <source_obj>96</source_obj> <sink_obj>35</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_162"> <id>169</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_163"> <id>170</id> <edge_type>2</edge_type> <source_obj>42</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_164"> <id>171</id> <edge_type>2</edge_type> <source_obj>47</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_165"> <id>172</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>43</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_166"> <id>174</id> <edge_type>1</edge_type> <source_obj>173</source_obj> <sink_obj>43</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_167"> <id>175</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>44</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_168"> <id>177</id> <edge_type>1</edge_type> <source_obj>176</source_obj> <sink_obj>44</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_169"> <id>178</id> <edge_type>1</edge_type> <source_obj>43</source_obj> <sink_obj>45</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_170"> <id>179</id> <edge_type>1</edge_type> <source_obj>44</source_obj> <sink_obj>45</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_171"> <id>180</id> <edge_type>1</edge_type> <source_obj>45</source_obj> <sink_obj>46</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_172"> <id>181</id> <edge_type>2</edge_type> <source_obj>54</source_obj> <sink_obj>46</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_173"> <id>182</id> <edge_type>2</edge_type> <source_obj>51</source_obj> <sink_obj>46</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_174"> <id>183</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>38</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_175"> <id>185</id> <edge_type>1</edge_type> <source_obj>184</source_obj> <sink_obj>38</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_176"> <id>186</id> <edge_type>1</edge_type> <source_obj>35</source_obj> <sink_obj>39</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_177"> <id>187</id> <edge_type>1</edge_type> <source_obj>176</source_obj> <sink_obj>39</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_178"> <id>188</id> <edge_type>1</edge_type> <source_obj>38</source_obj> <sink_obj>40</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_179"> <id>189</id> <edge_type>1</edge_type> <source_obj>39</source_obj> <sink_obj>40</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_180"> <id>190</id> <edge_type>1</edge_type> <source_obj>40</source_obj> <sink_obj>41</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_181"> <id>191</id> <edge_type>2</edge_type> <source_obj>54</source_obj> <sink_obj>41</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_182"> <id>192</id> <edge_type>2</edge_type> <source_obj>51</source_obj> <sink_obj>41</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_183"> <id>194</id> <edge_type>1</edge_type> <source_obj>193</source_obj> <sink_obj>48</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_184"> <id>195</id> <edge_type>1</edge_type> <source_obj>32</source_obj> <sink_obj>48</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_185"> <id>196</id> <edge_type>1</edge_type> <source_obj>48</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_186"> <id>198</id> <edge_type>1</edge_type> <source_obj>197</source_obj> <sink_obj>49</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_187"> <id>199</id> <edge_type>2</edge_type> <source_obj>54</source_obj> <sink_obj>50</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_188"> <id>200</id> <edge_type>1</edge_type> <source_obj>49</source_obj> <sink_obj>52</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_189"> <id>201</id> <edge_type>2</edge_type> <source_obj>51</source_obj> <sink_obj>52</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_190"> <id>202</id> <edge_type>1</edge_type> <source_obj>32</source_obj> <sink_obj>52</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_191"> <id>203</id> <edge_type>2</edge_type> <source_obj>47</source_obj> <sink_obj>52</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_192"> <id>204</id> <edge_type>1</edge_type> <source_obj>32</source_obj> <sink_obj>52</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_193"> <id>205</id> <edge_type>2</edge_type> <source_obj>42</source_obj> <sink_obj>52</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_194"> <id>206</id> <edge_type>1</edge_type> <source_obj>27</source_obj> <sink_obj>53</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_195"> <id>207</id> <edge_type>2</edge_type> <source_obj>59</source_obj> <sink_obj>53</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_196"> <id>208</id> <edge_type>2</edge_type> <source_obj>66</source_obj> <sink_obj>53</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_197"> <id>209</id> <edge_type>1</edge_type> <source_obj>52</source_obj> <sink_obj>60</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_198"> <id>210</id> <edge_type>1</edge_type> <source_obj>60</source_obj> <sink_obj>61</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_199"> <id>211</id> <edge_type>1</edge_type> <source_obj>151</source_obj> <sink_obj>61</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_200"> <id>212</id> <edge_type>1</edge_type> <source_obj>61</source_obj> <sink_obj>62</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_201"> <id>213</id> <edge_type>1</edge_type> <source_obj>52</source_obj> <sink_obj>63</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_202"> <id>215</id> <edge_type>1</edge_type> <source_obj>214</source_obj> <sink_obj>63</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_203"> <id>216</id> <edge_type>1</edge_type> <source_obj>62</source_obj> <sink_obj>64</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_204"> <id>217</id> <edge_type>1</edge_type> <source_obj>63</source_obj> <sink_obj>64</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_205"> <id>218</id> <edge_type>2</edge_type> <source_obj>81</source_obj> <sink_obj>65</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_206"> <id>219</id> <edge_type>1</edge_type> <source_obj>52</source_obj> <sink_obj>55</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_207"> <id>220</id> <edge_type>1</edge_type> <source_obj>214</source_obj> <sink_obj>55</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_208"> <id>221</id> <edge_type>1</edge_type> <source_obj>214</source_obj> <sink_obj>56</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_209"> <id>222</id> <edge_type>1</edge_type> <source_obj>55</source_obj> <sink_obj>56</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_210"> <id>223</id> <edge_type>1</edge_type> <source_obj>116</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_211"> <id>224</id> <edge_type>1</edge_type> <source_obj>56</source_obj> <sink_obj>57</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_212"> <id>225</id> <edge_type>2</edge_type> <source_obj>81</source_obj> <sink_obj>58</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_213"> <id>226</id> <edge_type>1</edge_type> <source_obj>68</source_obj> <sink_obj>75</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_214"> <id>227</id> <edge_type>2</edge_type> <source_obj>70</source_obj> <sink_obj>75</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_215"> <id>228</id> <edge_type>1</edge_type> <source_obj>64</source_obj> <sink_obj>75</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_216"> <id>229</id> <edge_type>2</edge_type> <source_obj>66</source_obj> <sink_obj>75</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_217"> <id>230</id> <edge_type>1</edge_type> <source_obj>57</source_obj> <sink_obj>75</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_218"> <id>231</id> <edge_type>2</edge_type> <source_obj>59</source_obj> <sink_obj>75</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_219"> <id>232</id> <edge_type>1</edge_type> <source_obj>116</source_obj> <sink_obj>75</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_220"> <id>233</id> <edge_type>2</edge_type> <source_obj>26</source_obj> <sink_obj>75</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_221"> <id>234</id> <edge_type>1</edge_type> <source_obj>72</source_obj> <sink_obj>75</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_222"> <id>235</id> <edge_type>2</edge_type> <source_obj>74</source_obj> <sink_obj>75</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_223"> <id>236</id> <edge_type>1</edge_type> <source_obj>75</source_obj> <sink_obj>76</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_224"> <id>237</id> <edge_type>1</edge_type> <source_obj>76</source_obj> <sink_obj>77</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_225"> <id>238</id> <edge_type>1</edge_type> <source_obj>151</source_obj> <sink_obj>77</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_226"> <id>239</id> <edge_type>1</edge_type> <source_obj>77</source_obj> <sink_obj>78</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_227"> <id>240</id> <edge_type>1</edge_type> <source_obj>7</source_obj> <sink_obj>79</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_228"> <id>241</id> <edge_type>1</edge_type> <source_obj>78</source_obj> <sink_obj>79</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_229"> <id>242</id> <edge_type>1</edge_type> <source_obj>75</source_obj> <sink_obj>79</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_230"> <id>243</id> <edge_type>1</edge_type> <source_obj>79</source_obj> <sink_obj>80</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_231"> <id>244</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>48</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_232"> <id>245</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>48</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_233"> <id>246</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>48</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_234"> <id>247</id> <edge_type>2</edge_type> <source_obj>15</source_obj> <sink_obj>74</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_235"> <id>248</id> <edge_type>2</edge_type> <source_obj>15</source_obj> <sink_obj>18</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_236"> <id>249</id> <edge_type>2</edge_type> <source_obj>18</source_obj> <sink_obj>70</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_237"> <id>250</id> <edge_type>2</edge_type> <source_obj>18</source_obj> <sink_obj>23</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_238"> <id>251</id> <edge_type>2</edge_type> <source_obj>23</source_obj> <sink_obj>70</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_239"> <id>252</id> <edge_type>2</edge_type> <source_obj>23</source_obj> <sink_obj>26</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_240"> <id>253</id> <edge_type>2</edge_type> <source_obj>26</source_obj> <sink_obj>37</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_241"> <id>254</id> <edge_type>2</edge_type> <source_obj>26</source_obj> <sink_obj>81</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_242"> <id>255</id> <edge_type>2</edge_type> <source_obj>37</source_obj> <sink_obj>47</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_243"> <id>256</id> <edge_type>2</edge_type> <source_obj>37</source_obj> <sink_obj>42</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_244"> <id>257</id> <edge_type>2</edge_type> <source_obj>42</source_obj> <sink_obj>51</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_245"> <id>258</id> <edge_type>2</edge_type> <source_obj>42</source_obj> <sink_obj>54</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_246"> <id>259</id> <edge_type>2</edge_type> <source_obj>47</source_obj> <sink_obj>51</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_247"> <id>260</id> <edge_type>2</edge_type> <source_obj>47</source_obj> <sink_obj>54</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_248"> <id>261</id> <edge_type>2</edge_type> <source_obj>51</source_obj> <sink_obj>54</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_249"> <id>262</id> <edge_type>2</edge_type> <source_obj>54</source_obj> <sink_obj>66</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_250"> <id>263</id> <edge_type>2</edge_type> <source_obj>54</source_obj> <sink_obj>59</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_251"> <id>264</id> <edge_type>2</edge_type> <source_obj>59</source_obj> <sink_obj>81</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_252"> <id>265</id> <edge_type>2</edge_type> <source_obj>66</source_obj> <sink_obj>81</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_253"> <id>266</id> <edge_type>2</edge_type> <source_obj>70</source_obj> <sink_obj>81</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="20" object_id="_254"> <id>267</id> <edge_type>2</edge_type> <source_obj>74</source_obj> <sink_obj>81</sink_obj> <is_back_edge>0</is_back_edge> </item> </edges> </cdfg> <cdfg_regions class_id="21" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="22" tracking_level="1" version="0" object_id="_255"> <mId>1</mId> <mTag>generic_tanh&lt;double&gt;</mTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>14</count> <item_version>0</item_version> <item>15</item> <item>18</item> <item>23</item> <item>26</item> <item>37</item> <item>42</item> <item>47</item> <item>51</item> <item>54</item> <item>59</item> <item>66</item> <item>70</item> <item>74</item> <item>81</item> </basic_blocks> <mII>1</mII> <mDepth>75</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>74</mMinLatency> <mMaxLatency>74</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> </cdfg_regions> <fsm class_id="24" tracking_level="1" version="0" object_id="_256"> <states class_id="25" tracking_level="0" version="0"> <count>75</count> <item_version>0</item_version> <item class_id="26" tracking_level="1" version="0" object_id="_257"> <id>1</id> <operations class_id="27" tracking_level="0" version="0"> <count>23</count> <item_version>0</item_version> <item class_id="28" tracking_level="1" version="0" object_id="_258"> <id>5</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_259"> <id>6</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_260"> <id>7</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_261"> <id>8</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_262"> <id>9</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_263"> <id>10</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_264"> <id>11</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_265"> <id>12</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_266"> <id>13</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_267"> <id>14</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_268"> <id>16</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_269"> <id>17</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_270"> <id>19</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_271"> <id>20</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_272"> <id>21</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_273"> <id>22</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_274"> <id>24</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_275"> <id>25</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_276"> <id>27</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_277"> <id>28</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_278"> <id>31</id> <stage>5</stage> <latency>5</latency> </item> <item class_id_reference="28" object_id="_279"> <id>67</id> <stage>5</stage> <latency>5</latency> </item> <item class_id_reference="28" object_id="_280"> <id>71</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_281"> <id>2</id> <operations> <count>4</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_282"> <id>29</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_283"> <id>30</id> <stage>5</stage> <latency>5</latency> </item> <item class_id_reference="28" object_id="_284"> <id>31</id> <stage>4</stage> <latency>5</latency> </item> <item class_id_reference="28" object_id="_285"> <id>67</id> <stage>4</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_286"> <id>3</id> <operations> <count>3</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_287"> <id>30</id> <stage>4</stage> <latency>5</latency> </item> <item class_id_reference="28" object_id="_288"> <id>31</id> <stage>3</stage> <latency>5</latency> </item> <item class_id_reference="28" object_id="_289"> <id>67</id> <stage>3</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_290"> <id>4</id> <operations> <count>3</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_291"> <id>30</id> <stage>3</stage> <latency>5</latency> </item> <item class_id_reference="28" object_id="_292"> <id>31</id> <stage>2</stage> <latency>5</latency> </item> <item class_id_reference="28" object_id="_293"> <id>67</id> <stage>2</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_294"> <id>5</id> <operations> <count>3</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_295"> <id>30</id> <stage>2</stage> <latency>5</latency> </item> <item class_id_reference="28" object_id="_296"> <id>31</id> <stage>1</stage> <latency>5</latency> </item> <item class_id_reference="28" object_id="_297"> <id>67</id> <stage>1</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_298"> <id>6</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_299"> <id>30</id> <stage>1</stage> <latency>5</latency> </item> <item class_id_reference="28" object_id="_300"> <id>68</id> <stage>6</stage> <latency>6</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_301"> <id>7</id> <operations> <count>15</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_302"> <id>32</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_303"> <id>33</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_304"> <id>34</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_305"> <id>35</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_306"> <id>36</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_307"> <id>38</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_308"> <id>39</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_309"> <id>40</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_310"> <id>41</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_311"> <id>43</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_312"> <id>44</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_313"> <id>45</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_314"> <id>46</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_315"> <id>53</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_316"> <id>68</id> <stage>5</stage> <latency>6</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_317"> <id>8</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_318"> <id>48</id> <stage>20</stage> <latency>20</latency> </item> <item class_id_reference="28" object_id="_319"> <id>68</id> <stage>4</stage> <latency>6</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_320"> <id>9</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_321"> <id>48</id> <stage>19</stage> <latency>20</latency> </item> <item class_id_reference="28" object_id="_322"> <id>68</id> <stage>3</stage> <latency>6</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_323"> <id>10</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_324"> <id>48</id> <stage>18</stage> <latency>20</latency> </item> <item class_id_reference="28" object_id="_325"> <id>68</id> <stage>2</stage> <latency>6</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_326"> <id>11</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_327"> <id>48</id> <stage>17</stage> <latency>20</latency> </item> <item class_id_reference="28" object_id="_328"> <id>68</id> <stage>1</stage> <latency>6</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_329"> <id>12</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_330"> <id>48</id> <stage>16</stage> <latency>20</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_331"> <id>13</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_332"> <id>48</id> <stage>15</stage> <latency>20</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_333"> <id>14</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_334"> <id>48</id> <stage>14</stage> <latency>20</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_335"> <id>15</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_336"> <id>48</id> <stage>13</stage> <latency>20</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_337"> <id>16</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_338"> <id>48</id> <stage>12</stage> <latency>20</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_339"> <id>17</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_340"> <id>48</id> <stage>11</stage> <latency>20</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_341"> <id>18</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_342"> <id>48</id> <stage>10</stage> <latency>20</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_343"> <id>19</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_344"> <id>48</id> <stage>9</stage> <latency>20</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_345"> <id>20</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_346"> <id>48</id> <stage>8</stage> <latency>20</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_347"> <id>21</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_348"> <id>48</id> <stage>7</stage> <latency>20</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_349"> <id>22</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_350"> <id>48</id> <stage>6</stage> <latency>20</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_351"> <id>23</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_352"> <id>48</id> <stage>5</stage> <latency>20</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_353"> <id>24</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_354"> <id>48</id> <stage>4</stage> <latency>20</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_355"> <id>25</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_356"> <id>48</id> <stage>3</stage> <latency>20</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_357"> <id>26</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_358"> <id>48</id> <stage>2</stage> <latency>20</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_359"> <id>27</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_360"> <id>48</id> <stage>1</stage> <latency>20</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_361"> <id>28</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_362"> <id>49</id> <stage>5</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_363"> <id>29</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_364"> <id>49</id> <stage>4</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_365"> <id>30</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_366"> <id>49</id> <stage>3</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_367"> <id>31</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_368"> <id>49</id> <stage>2</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_369"> <id>32</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_370"> <id>49</id> <stage>1</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_371"> <id>33</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_372"> <id>50</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_373"> <id>34</id> <operations> <count>3</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_374"> <id>52</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_375"> <id>55</id> <stage>5</stage> <latency>5</latency> </item> <item class_id_reference="28" object_id="_376"> <id>63</id> <stage>5</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_377"> <id>35</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_378"> <id>55</id> <stage>4</stage> <latency>5</latency> </item> <item class_id_reference="28" object_id="_379"> <id>63</id> <stage>4</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_380"> <id>36</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_381"> <id>55</id> <stage>3</stage> <latency>5</latency> </item> <item class_id_reference="28" object_id="_382"> <id>63</id> <stage>3</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_383"> <id>37</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_384"> <id>55</id> <stage>2</stage> <latency>5</latency> </item> <item class_id_reference="28" object_id="_385"> <id>63</id> <stage>2</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_386"> <id>38</id> <operations> <count>4</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_387"> <id>55</id> <stage>1</stage> <latency>5</latency> </item> <item class_id_reference="28" object_id="_388"> <id>60</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_389"> <id>61</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_390"> <id>63</id> <stage>1</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_391"> <id>39</id> <operations> <count>3</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_392"> <id>56</id> <stage>31</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_393"> <id>62</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_394"> <id>64</id> <stage>31</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_395"> <id>40</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_396"> <id>56</id> <stage>30</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_397"> <id>64</id> <stage>30</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_398"> <id>41</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_399"> <id>56</id> <stage>29</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_400"> <id>64</id> <stage>29</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_401"> <id>42</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_402"> <id>56</id> <stage>28</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_403"> <id>64</id> <stage>28</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_404"> <id>43</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_405"> <id>56</id> <stage>27</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_406"> <id>64</id> <stage>27</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_407"> <id>44</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_408"> <id>56</id> <stage>26</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_409"> <id>64</id> <stage>26</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_410"> <id>45</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_411"> <id>56</id> <stage>25</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_412"> <id>64</id> <stage>25</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_413"> <id>46</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_414"> <id>56</id> <stage>24</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_415"> <id>64</id> <stage>24</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_416"> <id>47</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_417"> <id>56</id> <stage>23</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_418"> <id>64</id> <stage>23</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_419"> <id>48</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_420"> <id>56</id> <stage>22</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_421"> <id>64</id> <stage>22</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_422"> <id>49</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_423"> <id>56</id> <stage>21</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_424"> <id>64</id> <stage>21</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_425"> <id>50</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_426"> <id>56</id> <stage>20</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_427"> <id>64</id> <stage>20</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_428"> <id>51</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_429"> <id>56</id> <stage>19</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_430"> <id>64</id> <stage>19</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_431"> <id>52</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_432"> <id>56</id> <stage>18</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_433"> <id>64</id> <stage>18</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_434"> <id>53</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_435"> <id>56</id> <stage>17</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_436"> <id>64</id> <stage>17</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_437"> <id>54</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_438"> <id>56</id> <stage>16</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_439"> <id>64</id> <stage>16</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_440"> <id>55</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_441"> <id>56</id> <stage>15</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_442"> <id>64</id> <stage>15</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_443"> <id>56</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_444"> <id>56</id> <stage>14</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_445"> <id>64</id> <stage>14</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_446"> <id>57</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_447"> <id>56</id> <stage>13</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_448"> <id>64</id> <stage>13</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_449"> <id>58</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_450"> <id>56</id> <stage>12</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_451"> <id>64</id> <stage>12</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_452"> <id>59</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_453"> <id>56</id> <stage>11</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_454"> <id>64</id> <stage>11</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_455"> <id>60</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_456"> <id>56</id> <stage>10</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_457"> <id>64</id> <stage>10</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_458"> <id>61</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_459"> <id>56</id> <stage>9</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_460"> <id>64</id> <stage>9</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_461"> <id>62</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_462"> <id>56</id> <stage>8</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_463"> <id>64</id> <stage>8</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_464"> <id>63</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_465"> <id>56</id> <stage>7</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_466"> <id>64</id> <stage>7</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_467"> <id>64</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_468"> <id>56</id> <stage>6</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_469"> <id>64</id> <stage>6</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_470"> <id>65</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_471"> <id>56</id> <stage>5</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_472"> <id>64</id> <stage>5</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_473"> <id>66</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_474"> <id>56</id> <stage>4</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_475"> <id>64</id> <stage>4</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_476"> <id>67</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_477"> <id>56</id> <stage>3</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_478"> <id>64</id> <stage>3</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_479"> <id>68</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_480"> <id>56</id> <stage>2</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_481"> <id>64</id> <stage>2</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_482"> <id>69</id> <operations> <count>2</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_483"> <id>56</id> <stage>1</stage> <latency>31</latency> </item> <item class_id_reference="28" object_id="_484"> <id>64</id> <stage>1</stage> <latency>31</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_485"> <id>70</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_486"> <id>57</id> <stage>5</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_487"> <id>71</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_488"> <id>57</id> <stage>4</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_489"> <id>72</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_490"> <id>57</id> <stage>3</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_491"> <id>73</id> <operations> <count>1</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_492"> <id>57</id> <stage>2</stage> <latency>5</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_493"> <id>74</id> <operations> <count>5</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_494"> <id>57</id> <stage>1</stage> <latency>5</latency> </item> <item class_id_reference="28" object_id="_495"> <id>65</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_496"> <id>69</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_497"> <id>72</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_498"> <id>73</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> <item class_id_reference="26" object_id="_499"> <id>75</id> <operations> <count>7</count> <item_version>0</item_version> <item class_id_reference="28" object_id="_500"> <id>58</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_501"> <id>75</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_502"> <id>76</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_503"> <id>77</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_504"> <id>78</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_505"> <id>79</id> <stage>1</stage> <latency>1</latency> </item> <item class_id_reference="28" object_id="_506"> <id>80</id> <stage>1</stage> <latency>1</latency> </item> </operations> </item> </states> <transitions class_id="29" tracking_level="0" version="0"> <count>74</count> <item_version>0</item_version> <item class_id="30" tracking_level="1" version="0" object_id="_507"> <inState>1</inState> <outState>2</outState> <condition class_id="31" tracking_level="0" version="0"> <id>-1</id> <sop class_id="32" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="33" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_508"> <inState>2</inState> <outState>3</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_509"> <inState>3</inState> <outState>4</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_510"> <inState>4</inState> <outState>5</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_511"> <inState>5</inState> <outState>6</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_512"> <inState>6</inState> <outState>7</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_513"> <inState>7</inState> <outState>8</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_514"> <inState>8</inState> <outState>9</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_515"> <inState>9</inState> <outState>10</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_516"> <inState>10</inState> <outState>11</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_517"> <inState>11</inState> <outState>12</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_518"> <inState>12</inState> <outState>13</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_519"> <inState>13</inState> <outState>14</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_520"> <inState>14</inState> <outState>15</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_521"> <inState>15</inState> <outState>16</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_522"> <inState>16</inState> <outState>17</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_523"> <inState>17</inState> <outState>18</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_524"> <inState>18</inState> <outState>19</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_525"> <inState>19</inState> <outState>20</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_526"> <inState>20</inState> <outState>21</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_527"> <inState>21</inState> <outState>22</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_528"> <inState>22</inState> <outState>23</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_529"> <inState>23</inState> <outState>24</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_530"> <inState>24</inState> <outState>25</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_531"> <inState>25</inState> <outState>26</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_532"> <inState>26</inState> <outState>27</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_533"> <inState>27</inState> <outState>28</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_534"> <inState>28</inState> <outState>29</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_535"> <inState>29</inState> <outState>30</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_536"> <inState>30</inState> <outState>31</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_537"> <inState>31</inState> <outState>32</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_538"> <inState>32</inState> <outState>33</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_539"> <inState>33</inState> <outState>34</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_540"> <inState>34</inState> <outState>35</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_541"> <inState>35</inState> <outState>36</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_542"> <inState>36</inState> <outState>37</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_543"> <inState>37</inState> <outState>38</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_544"> <inState>38</inState> <outState>39</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_545"> <inState>39</inState> <outState>40</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_546"> <inState>40</inState> <outState>41</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_547"> <inState>41</inState> <outState>42</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_548"> <inState>42</inState> <outState>43</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_549"> <inState>43</inState> <outState>44</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_550"> <inState>44</inState> <outState>45</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_551"> <inState>45</inState> <outState>46</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_552"> <inState>46</inState> <outState>47</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_553"> <inState>47</inState> <outState>48</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_554"> <inState>48</inState> <outState>49</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_555"> <inState>49</inState> <outState>50</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_556"> <inState>50</inState> <outState>51</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_557"> <inState>51</inState> <outState>52</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_558"> <inState>52</inState> <outState>53</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_559"> <inState>53</inState> <outState>54</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_560"> <inState>54</inState> <outState>55</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_561"> <inState>55</inState> <outState>56</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_562"> <inState>56</inState> <outState>57</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_563"> <inState>57</inState> <outState>58</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_564"> <inState>58</inState> <outState>59</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_565"> <inState>59</inState> <outState>60</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_566"> <inState>60</inState> <outState>61</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_567"> <inState>61</inState> <outState>62</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_568"> <inState>62</inState> <outState>63</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_569"> <inState>63</inState> <outState>64</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_570"> <inState>64</inState> <outState>65</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_571"> <inState>65</inState> <outState>66</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_572"> <inState>66</inState> <outState>67</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_573"> <inState>67</inState> <outState>68</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_574"> <inState>68</inState> <outState>69</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_575"> <inState>69</inState> <outState>70</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_576"> <inState>70</inState> <outState>71</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_577"> <inState>71</inState> <outState>72</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_578"> <inState>72</inState> <outState>73</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_579"> <inState>73</inState> <outState>74</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> <item class_id_reference="30" object_id="_580"> <inState>74</inState> <outState>75</outState> <condition> <id>-1</id> <sop> <count>1</count> <item_version>0</item_version> <item> <count>0</count> <item_version>0</item_version> </item> </sop> </condition> </item> </transitions> </fsm> <res class_id="-1"></res> <node_label_latency class_id="35" tracking_level="0" version="0"> <count>63</count> <item_version>0</item_version> <item class_id="36" tracking_level="0" version="0"> <first>5</first> <second class_id="37" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>6</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>7</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>8</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>9</first> <second> <first>0</first> <second>0</second> </second> </item> <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>12</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>13</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>14</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>16</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>17</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>19</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>20</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>21</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>22</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>24</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>25</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>27</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>28</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>29</first> <second> <first>1</first> <second>0</second> </second> </item> <item> <first>30</first> <second> <first>1</first> <second>4</second> </second> </item> <item> <first>31</first> <second> <first>0</first> <second>4</second> </second> </item> <item> <first>32</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>33</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>34</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>35</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>36</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>38</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>39</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>40</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>41</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>43</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>44</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>45</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>46</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>48</first> <second> <first>7</first> <second>19</second> </second> </item> <item> <first>49</first> <second> <first>27</first> <second>4</second> </second> </item> <item> <first>50</first> <second> <first>32</first> <second>0</second> </second> </item> <item> <first>52</first> <second> <first>33</first> <second>0</second> </second> </item> <item> <first>53</first> <second> <first>6</first> <second>0</second> </second> </item> <item> <first>55</first> <second> <first>33</first> <second>4</second> </second> </item> <item> <first>56</first> <second> <first>38</first> <second>30</second> </second> </item> <item> <first>57</first> <second> <first>69</first> <second>4</second> </second> </item> <item> <first>58</first> <second> <first>74</first> <second>0</second> </second> </item> <item> <first>60</first> <second> <first>37</first> <second>0</second> </second> </item> <item> <first>61</first> <second> <first>37</first> <second>0</second> </second> </item> <item> <first>62</first> <second> <first>38</first> <second>0</second> </second> </item> <item> <first>63</first> <second> <first>33</first> <second>4</second> </second> </item> <item> <first>64</first> <second> <first>38</first> <second>30</second> </second> </item> <item> <first>65</first> <second> <first>73</first> <second>0</second> </second> </item> <item> <first>67</first> <second> <first>0</first> <second>4</second> </second> </item> <item> <first>68</first> <second> <first>5</first> <second>5</second> </second> </item> <item> <first>69</first> <second> <first>73</first> <second>0</second> </second> </item> <item> <first>71</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>72</first> <second> <first>73</first> <second>0</second> </second> </item> <item> <first>73</first> <second> <first>73</first> <second>0</second> </second> </item> <item> <first>75</first> <second> <first>74</first> <second>0</second> </second> </item> <item> <first>76</first> <second> <first>74</first> <second>0</second> </second> </item> <item> <first>77</first> <second> <first>74</first> <second>0</second> </second> </item> <item> <first>78</first> <second> <first>74</first> <second>0</second> </second> </item> <item> <first>79</first> <second> <first>74</first> <second>0</second> </second> </item> <item> <first>80</first> <second> <first>74</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="38" tracking_level="0" version="0"> <count>14</count> <item_version>0</item_version> <item class_id="39" tracking_level="0" version="0"> <first>15</first> <second class_id="40" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>18</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>23</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>26</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>37</first> <second> <first>0</first> <second>6</second> </second> </item> <item> <first>42</first> <second> <first>6</first> <second>6</second> </second> </item> <item> <first>47</first> <second> <first>6</first> <second>6</second> </second> </item> <item> <first>51</first> <second> <first>7</first> <second>32</second> </second> </item> <item> <first>54</first> <second> <first>0</first> <second>33</second> </second> </item> <item> <first>59</first> <second> <first>0</first> <second>74</second> </second> </item> <item> <first>66</first> <second> <first>0</first> <second>73</second> </second> </item> <item> <first>70</first> <second> <first>0</first> <second>73</second> </second> </item> <item> <first>74</first> <second> <first>0</first> <second>73</second> </second> </item> <item> <first>81</first> <second> <first>74</first> <second>74</second> </second> </item> </bblk_ent_exit> <regions class_id="41" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="42" tracking_level="1" version="0" object_id="_581"> <region_name>generic_tanh&lt;double&gt;</region_name> <basic_blocks> <count>14</count> <item_version>0</item_version> <item>15</item> <item>18</item> <item>23</item> <item>26</item> <item>37</item> <item>42</item> <item>47</item> <item>51</item> <item>54</item> <item>59</item> <item>66</item> <item>70</item> <item>74</item> <item>81</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>75</pipe_depth> </item> </regions> <dp_fu_nodes class_id="43" tracking_level="0" version="0"> <count>45</count> <item_version>0</item_version> <item class_id="44" tracking_level="0" version="0"> <first>52</first> <second> <count>1</count> <item_version>0</item_version> <item>5</item> </second> </item> <item> <first>61</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>74</first> <second> <count>1</count> <item_version>0</item_version> <item>75</item> </second> </item> <item> <first>87</first> <second> <count>20</count> <item_version>0</item_version> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> </second> </item> <item> <first>98</first> <second> <count>10</count> <item_version>0</item_version> <item>31</item> <item>31</item> <item>31</item> <item>31</item> <item>31</item> <item>67</item> <item>67</item> <item>67</item> <item>67</item> <item>67</item> </second> </item> <item> <first>103</first> <second> <count>5</count> <item_version>0</item_version> <item>30</item> <item>30</item> <item>30</item> <item>30</item> <item>30</item> </second> </item> <item> <first>107</first> <second> <count>5</count> <item_version>0</item_version> <item>49</item> <item>49</item> <item>49</item> <item>49</item> <item>49</item> </second> </item> <item> <first>112</first> <second> <count>10</count> <item_version>0</item_version> <item>55</item> <item>55</item> <item>55</item> <item>55</item> <item>55</item> <item>63</item> <item>63</item> <item>63</item> <item>63</item> <item>63</item> </second> </item> <item> <first>118</first> <second> <count>5</count> <item_version>0</item_version> <item>57</item> <item>57</item> <item>57</item> <item>57</item> <item>57</item> </second> </item> <item> <first>123</first> <second> <count>6</count> <item_version>0</item_version> <item>68</item> <item>68</item> <item>68</item> <item>68</item> <item>68</item> <item>68</item> </second> </item> <item> <first>127</first> <second> <count>62</count> <item_version>0</item_version> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> </second> </item> <item> <first>132</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>137</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>142</first> <second> <count>1</count> <item_version>0</item_version> <item>71</item> </second> </item> <item> <first>147</first> <second> <count>2</count> <item_version>0</item_version> <item>39</item> <item>44</item> </second> </item> <item> <first>168</first> <second> <count>1</count> <item_version>0</item_version> <item>6</item> </second> </item> <item> <first>172</first> <second> <count>1</count> <item_version>0</item_version> <item>7</item> </second> </item> <item> <first>180</first> <second> <count>1</count> <item_version>0</item_version> <item>8</item> </second> </item> <item> <first>190</first> <second> <count>1</count> <item_version>0</item_version> <item>9</item> </second> </item> <item> <first>196</first> <second> <count>1</count> <item_version>0</item_version> <item>10</item> </second> </item> <item> <first>200</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> <item> <first>208</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>215</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>221</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>227</first> <second> <count>1</count> <item_version>0</item_version> <item>19</item> </second> </item> <item> <first>233</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>239</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> <item> <first>245</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>251</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>255</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>261</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>265</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>273</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>284</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>290</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>296</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>302</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>308</first> <second> <count>1</count> <item_version>0</item_version> <item>60</item> </second> </item> <item> <first>312</first> <second> <count>1</count> <item_version>0</item_version> <item>61</item> </second> </item> <item> <first>318</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>322</first> <second> <count>1</count> <item_version>0</item_version> <item>72</item> </second> </item> <item> <first>329</first> <second> <count>1</count> <item_version>0</item_version> <item>76</item> </second> </item> <item> <first>333</first> <second> <count>1</count> <item_version>0</item_version> <item>77</item> </second> </item> <item> <first>339</first> <second> <count>1</count> <item_version>0</item_version> <item>78</item> </second> </item> <item> <first>343</first> <second> <count>1</count> <item_version>0</item_version> <item>79</item> </second> </item> </dp_fu_nodes> <dp_fu_nodes_expression class_id="46" tracking_level="0" version="0"> <count>36</count> <item_version>0</item_version> <item class_id="47" tracking_level="0" version="0"> <first>abst_in_fu_208</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>expx_phi_fu_61</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>grp_fu_147</first> <second> <count>2</count> <item_version>0</item_version> <item>39</item> <item>44</item> </second> </item> <item> <first>or_cond1_i_fu_290</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>or_cond_fu_233</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>or_cond_i_fu_302</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>p_1_fu_322</first> <second> <count>1</count> <item_version>0</item_version> <item>72</item> </second> </item> <item> <first>p_Result_11_fu_265</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>p_Result_12_fu_200</first> <second> <count>1</count> <item_version>0</item_version> <item>11</item> </second> </item> <item> <first>p_Result_s_fu_172</first> <second> <count>1</count> <item_version>0</item_version> <item>7</item> </second> </item> <item> <first>p_Val2_3_fu_261</first> <second> <count>1</count> <item_version>0</item_version> <item>33</item> </second> </item> <item> <first>p_Val2_s_fu_168</first> <second> <count>1</count> <item_version>0</item_version> <item>6</item> </second> </item> <item> <first>p_s_fu_343</first> <second> <count>1</count> <item_version>0</item_version> <item>79</item> </second> </item> <item> <first>resultf_4_phi_fu_74</first> <second> <count>1</count> <item_version>0</item_version> <item>75</item> </second> </item> <item> <first>tmp_100_neg_fu_312</first> <second> <count>1</count> <item_version>0</item_version> <item>61</item> </second> </item> <item> <first>tmp_100_to_int_fu_308</first> <second> <count>1</count> <item_version>0</item_version> <item>60</item> </second> </item> <item> <first>tmp_104_neg_fu_333</first> <second> <count>1</count> <item_version>0</item_version> <item>77</item> </second> </item> <item> <first>tmp_104_to_int_fu_329</first> <second> <count>1</count> <item_version>0</item_version> <item>76</item> </second> </item> <item> <first>tmp_10_fu_318</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>tmp_14_fu_339</first> <second> <count>1</count> <item_version>0</item_version> <item>78</item> </second> </item> <item> <first>tmp_38_fu_196</first> <second> <count>1</count> <item_version>0</item_version> <item>10</item> </second> </item> <item> <first>tmp_3_fu_221</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>tmp_4_fu_227</first> <second> <count>1</count> <item_version>0</item_version> <item>19</item> </second> </item> <item> <first>tmp_5_fu_137</first> <second> <count>1</count> <item_version>0</item_version> <item>20</item> </second> </item> <item> <first>tmp_7_fu_132</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>tmp_8_fu_239</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> <item> <first>tmp_99_neg_fu_245</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>tmp_9_fu_251</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>tmp_V_1_fu_190</first> <second> <count>1</count> <item_version>0</item_version> <item>9</item> </second> </item> <item> <first>tmp_V_2_fu_273</first> <second> <count>1</count> <item_version>0</item_version> <item>35</item> </second> </item> <item> <first>tmp_V_fu_180</first> <second> <count>1</count> <item_version>0</item_version> <item>8</item> </second> </item> <item> <first>tmp_fu_215</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>tmp_i_59_fu_284</first> <second> <count>1</count> <item_version>0</item_version> <item>38</item> </second> </item> <item> <first>tmp_i_fu_296</first> <second> <count>1</count> <item_version>0</item_version> <item>43</item> </second> </item> <item> <first>tmp_s_fu_142</first> <second> <count>1</count> <item_version>0</item_version> <item>71</item> </second> </item> <item> <first>x_2_fu_255</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> </dp_fu_nodes_expression> <dp_fu_nodes_module> <count>8</count> <item_version>0</item_version> <item> <first>grp_exp_generic_double_s_fu_87</first> <second> <count>20</count> <item_version>0</item_version> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> <item>48</item> </second> </item> <item> <first>grp_fu_103</first> <second> <count>5</count> <item_version>0</item_version> <item>30</item> <item>30</item> <item>30</item> <item>30</item> <item>30</item> </second> </item> <item> <first>grp_fu_107</first> <second> <count>5</count> <item_version>0</item_version> <item>49</item> <item>49</item> <item>49</item> <item>49</item> <item>49</item> </second> </item> <item> <first>grp_fu_112</first> <second> <count>10</count> <item_version>0</item_version> <item>55</item> <item>55</item> <item>55</item> <item>55</item> <item>55</item> <item>63</item> <item>63</item> <item>63</item> <item>63</item> <item>63</item> </second> </item> <item> <first>grp_fu_118</first> <second> <count>5</count> <item_version>0</item_version> <item>57</item> <item>57</item> <item>57</item> <item>57</item> <item>57</item> </second> </item> <item> <first>grp_fu_123</first> <second> <count>6</count> <item_version>0</item_version> <item>68</item> <item>68</item> <item>68</item> <item>68</item> <item>68</item> <item>68</item> </second> </item> <item> <first>grp_fu_127</first> <second> <count>62</count> <item_version>0</item_version> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>56</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> <item>64</item> </second> </item> <item> <first>grp_fu_98</first> <second> <count>10</count> <item_version>0</item_version> <item>31</item> <item>31</item> <item>31</item> <item>31</item> <item>31</item> <item>67</item> <item>67</item> <item>67</item> <item>67</item> <item>67</item> </second> </item> </dp_fu_nodes_module> <dp_fu_nodes_io> <count>1</count> <item_version>0</item_version> <item> <first>t_in_read_read_fu_52</first> <second> <count>1</count> <item_version>0</item_version> <item>5</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="48" tracking_level="0" version="0"> <count>3</count> <item_version>0</item_version> <item class_id="49" tracking_level="0" version="0"> <first class_id="50" tracking_level="0" version="0"> <first>table_exp_Z1_array_s</first> <second>100</second> </first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> <item> <first> <first>table_f_Z2_array_V</first> <second>100</second> </first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> <item> <first> <first>table_f_Z3_array_V</first> <second>100</second> </first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> </dp_mem_port_nodes> <dp_reg_nodes> <count>27</count> <item_version>0</item_version> <item> <first>58</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>70</first> <second> <count>1</count> <item_version>0</item_version> <item>75</item> </second> </item> <item> <first>152</first> <second> <count>2</count> <item_version>0</item_version> <item>31</item> <item>67</item> </second> </item> <item> <first>157</first> <second> <count>2</count> <item_version>0</item_version> <item>55</item> <item>63</item> </second> </item> <item> <first>162</first> <second> <count>2</count> <item_version>0</item_version> <item>56</item> <item>64</item> </second> </item> <item> <first>350</first> <second> <count>1</count> <item_version>0</item_version> <item>7</item> </second> </item> <item> <first>355</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>363</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>367</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>371</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>375</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>379</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> <item> <first>384</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>389</first> <second> <count>1</count> <item_version>0</item_version> <item>71</item> </second> </item> <item> <first>394</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>399</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> <item> <first>404</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>411</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>415</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>419</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>423</first> <second> <count>1</count> <item_version>0</item_version> <item>68</item> </second> </item> <item> <first>428</first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> <item> <first>433</first> <second> <count>1</count> <item_version>0</item_version> <item>49</item> </second> </item> <item> <first>438</first> <second> <count>1</count> <item_version>0</item_version> <item>61</item> </second> </item> <item> <first>443</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>57</item> </second> </item> <item> <first>453</first> <second> <count>1</count> <item_version>0</item_version> <item>72</item> </second> </item> </dp_reg_nodes> <dp_regname_nodes> <count>27</count> <item_version>0</item_version> <item> <first>abst_in_reg_355</first> <second> <count>1</count> <item_version>0</item_version> <item>12</item> </second> </item> <item> <first>expx_reg_58</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>or_cond1_i_reg_415</first> <second> <count>1</count> <item_version>0</item_version> <item>40</item> </second> </item> <item> <first>or_cond_i_reg_419</first> <second> <count>1</count> <item_version>0</item_version> <item>45</item> </second> </item> <item> <first>or_cond_reg_371</first> <second> <count>1</count> <item_version>0</item_version> <item>21</item> </second> </item> <item> <first>p_1_reg_453</first> <second> <count>1</count> <item_version>0</item_version> <item>72</item> </second> </item> <item> <first>p_Result_11_reg_411</first> <second> <count>1</count> <item_version>0</item_version> <item>34</item> </second> </item> <item> <first>p_Result_s_reg_350</first> <second> <count>1</count> <item_version>0</item_version> <item>7</item> </second> </item> <item> <first>reg_152</first> <second> <count>2</count> <item_version>0</item_version> <item>31</item> <item>67</item> </second> </item> <item> <first>reg_157</first> <second> <count>2</count> <item_version>0</item_version> <item>55</item> <item>63</item> </second> </item> <item> <first>reg_162</first> <second> <count>2</count> <item_version>0</item_version> <item>56</item> <item>64</item> </second> </item> <item> <first>resultf_2_reg_448</first> <second> <count>1</count> <item_version>0</item_version> <item>57</item> </second> </item> <item> <first>resultf_4_reg_70</first> <second> <count>1</count> <item_version>0</item_version> <item>75</item> </second> </item> <item> <first>resultf_reg_423</first> <second> <count>1</count> <item_version>0</item_version> <item>68</item> </second> </item> <item> <first>tmp_100_neg_reg_438</first> <second> <count>1</count> <item_version>0</item_version> <item>61</item> </second> </item> <item> <first>tmp_10_reg_443</first> <second> <count>1</count> <item_version>0</item_version> <item>62</item> </second> </item> <item> <first>tmp_17_i_reg_428</first> <second> <count>1</count> <item_version>0</item_version> <item>48</item> </second> </item> <item> <first>tmp_18_i_reg_433</first> <second> <count>1</count> <item_version>0</item_version> <item>49</item> </second> </item> <item> <first>tmp_3_reg_367</first> <second> <count>1</count> <item_version>0</item_version> <item>16</item> </second> </item> <item> <first>tmp_7_reg_375</first> <second> <count>1</count> <item_version>0</item_version> <item>24</item> </second> </item> <item> <first>tmp_8_reg_379</first> <second> <count>1</count> <item_version>0</item_version> <item>27</item> </second> </item> <item> <first>tmp_99_neg_reg_384</first> <second> <count>1</count> <item_version>0</item_version> <item>28</item> </second> </item> <item> <first>tmp_9_reg_394</first> <second> <count>1</count> <item_version>0</item_version> <item>29</item> </second> </item> <item> <first>tmp_reg_363</first> <second> <count>1</count> <item_version>0</item_version> <item>13</item> </second> </item> <item> <first>tmp_s_reg_389</first> <second> <count>1</count> <item_version>0</item_version> <item>71</item> </second> </item> <item> <first>x_2_reg_404</first> <second> <count>1</count> <item_version>0</item_version> <item>32</item> </second> </item> <item> <first>x_reg_399</first> <second> <count>1</count> <item_version>0</item_version> <item>30</item> </second> </item> </dp_regname_nodes> <dp_reg_phi> <count>2</count> <item_version>0</item_version> <item> <first>58</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>70</first> <second> <count>1</count> <item_version>0</item_version> <item>75</item> </second> </item> </dp_reg_phi> <dp_regname_phi> <count>2</count> <item_version>0</item_version> <item> <first>expx_reg_58</first> <second> <count>1</count> <item_version>0</item_version> <item>52</item> </second> </item> <item> <first>resultf_4_reg_70</first> <second> <count>1</count> <item_version>0</item_version> <item>75</item> </second> </item> </dp_regname_phi> <dp_port_io_nodes class_id="51" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="52" tracking_level="0" version="0"> <first>t_in</first> <second> <count>1</count> <item_version>0</item_version> <item> <first>read</first> <second> <count>1</count> <item_version>0</item_version> <item>5</item> </second> </item> </second> </item> </dp_port_io_nodes> <port2core class_id="53" 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.23591
142
0.601975
1325f43b0ee29b9c703e018579cf9bae88803577
4,875
ads
Ada
Validation/pyFrame3DD-master/gcc-master/gcc/ada/bindo-validators.ads
djamal2727/Main-Bearing-Analytical-Model
2f00c2219c71be0175c6f4f8f1d4cca231d97096
[ "Apache-2.0" ]
null
null
null
Validation/pyFrame3DD-master/gcc-master/gcc/ada/bindo-validators.ads
djamal2727/Main-Bearing-Analytical-Model
2f00c2219c71be0175c6f4f8f1d4cca231d97096
[ "Apache-2.0" ]
null
null
null
Validation/pyFrame3DD-master/gcc-master/gcc/ada/bindo-validators.ads
djamal2727/Main-Bearing-Analytical-Model
2f00c2219c71be0175c6f4f8f1d4cca231d97096
[ "Apache-2.0" ]
null
null
null
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- B I N D O . V A L I D A T O R S -- -- -- -- S p e c -- -- -- -- Copyright (C) 2019-2020, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING3. If not, go to -- -- http://www.gnu.org/licenses for a complete copy of the license. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- For full architecture, see unit Bindo. -- The following unit contains facilities to verify the validity of the -- various graphs used in determining the elaboration order of units. with Bindo.Graphs; use Bindo.Graphs; use Bindo.Graphs.Invocation_Graphs; use Bindo.Graphs.Library_Graphs; package Bindo.Validators is ---------------------- -- Cycle_Validators -- ---------------------- package Cycle_Validators is Invalid_Cycle : exception; -- Exception raised when the library graph contains an invalid cycle procedure Validate_Cycles (G : Library_Graph); -- Ensure that all cycles of library graph G meet the following -- requirements: -- -- * Are of proper kind -- * Have enough edges to form a circuit -- * No edge is repeated -- -- Diagnose issues and raise Invalid_Cycle if this is not the case. end Cycle_Validators; ---------------------------------- -- Elaboration_Order_Validators -- ---------------------------------- package Elaboration_Order_Validators is Invalid_Elaboration_Order : exception; -- Exception raised when the elaboration order contains invalid data procedure Validate_Elaboration_Order (Order : Unit_Id_Table); -- Ensure that elaboration order Order meets the following requirements: -- -- * All units that must be elaborated appear in the order -- * No other units appear in the order -- -- Diagnose issues and raise Invalid_Elaboration_Order if this is not -- the case. end Elaboration_Order_Validators; --------------------------------- -- Invocation_Graph_Validators -- --------------------------------- package Invocation_Graph_Validators is Invalid_Invocation_Graph : exception; -- Exception raised when the invocation graph contains invalid data procedure Validate_Invocation_Graph (G : Invocation_Graph); -- Ensure that invocation graph G meets the following requirements: -- -- * All attributes of edges are properly set -- * All attributes of vertices are properly set -- -- Diagnose issues and raise Invalid_Invocation_Graph if this is not the -- case. end Invocation_Graph_Validators; ------------------------------ -- Library_Graph_Validators -- ------------------------------ package Library_Graph_Validators is Invalid_Library_Graph : exception; -- Exception raised when the library graph contains invalid data procedure Validate_Library_Graph (G : Library_Graph); -- Ensure that library graph G meets the following requirements: -- -- * All attributes edges are properly set -- * All attributes of vertices are properly set -- -- Diagnose issues and raise Invalid_Library_Graph if this is not the -- case. end Library_Graph_Validators; end Bindo.Validators;
42.025862
79
0.529231
579ad8a5fb72d0faf88fd90cfe00c1c6ec210e3a
583
adb
Ada
courses/fundamentals_of_ada/labs/prompts/170_inheritance/main.adb
AdaCore/training_material
6651eb2c53f8c39649b8e0b3c757bc8ff963025a
[ "CC-BY-4.0" ]
15
2020-10-07T08:56:45.000Z
2022-02-08T23:13:22.000Z
courses/fundamentals_of_ada/labs/prompts/170_inheritance/main.adb
AdaCore/training_material
6651eb2c53f8c39649b8e0b3c757bc8ff963025a
[ "CC-BY-4.0" ]
20
2020-11-05T14:35:20.000Z
2022-01-13T15:59:33.000Z
courses/fundamentals_of_ada/labs/prompts/170_inheritance/main.adb
AdaCore/training_material
6651eb2c53f8c39649b8e0b3c757bc8ff963025a
[ "CC-BY-4.0" ]
6
2020-10-08T15:57:06.000Z
2021-08-31T12:03:08.000Z
with Ada.Text_IO; use Ada.Text_IO; with Employee; procedure Main is function Read (Prompt : String) return String is begin Put (Prompt & "> "); return Get_Line; end Read; function Read_Date (Prompt : String) return String is (Read (Prompt & " (YYYY-MM-DD)")); Applicant : Employee.Person_T; -- Create objects to store information for an Employee and Position begin Employee.Set_Attribute (Applicant, Read ("Attribute")); Employee.Print (Applicant); -- set attributes / print contents for employee and position end Main;
25.347826
70
0.674099
220e08df65ba7f8112a8b8eaee1353486dc6e932
4,261
ads
Ada
src/sparknacl-cryptobox.ads
yannickmoy/SPARKNaCl
c27fa811bf38b3706c1dc242f30e82967ad8f1c6
[ "BSD-2-Clause" ]
76
2020-02-24T20:30:15.000Z
2022-02-16T15:10:56.000Z
src/sparknacl-cryptobox.ads
yannickmoy/SPARKNaCl
c27fa811bf38b3706c1dc242f30e82967ad8f1c6
[ "BSD-2-Clause" ]
10
2020-04-15T10:02:49.000Z
2022-02-24T20:10:46.000Z
src/sparknacl-cryptobox.ads
yannickmoy/SPARKNaCl
c27fa811bf38b3706c1dc242f30e82967ad8f1c6
[ "BSD-2-Clause" ]
4
2020-03-10T15:19:45.000Z
2022-02-17T09:46:20.000Z
with SPARKNaCl.Core; with SPARKNaCl.Stream; package SPARKNaCl.Cryptobox with Pure, SPARK_Mode => On is -------------------------------------------------------- -- Public Key Authenticated Encryption - "Crypto Box" -- -------------------------------------------------------- -- Limited, so no assignment or comparison, and always -- pass-by-reference. type Secret_Key is limited private; type Public_Key is limited private; Plaintext_Zero_Bytes : constant := 32; Ciphertext_Zero_Bytes : constant := 16; -- Key generation procedure Keypair (Raw_SK : in Bytes_32; PK : out Public_Key; SK : out Secret_Key) with Global => null; function Construct (K : in Bytes_32) return Secret_Key with Global => null; function Construct (K : in Bytes_32) return Public_Key with Global => null; function Serialize (K : in Secret_Key) return Bytes_32 with Global => null; function Serialize (K : in Public_Key) return Bytes_32 with Global => null; -- Sanitization procedure Sanitize (K : out Secret_Key) with Global => null; procedure Sanitize (K : out Public_Key) with Global => null; -- Precomputation procedure BeforeNM (K : out Core.Salsa20_Key; PK : in Public_Key; SK : in Secret_Key) with Global => null; -- Postcomputation for Create procedure AfterNM (C : out Byte_Seq; Status : out Boolean; M : in Byte_Seq; N : in Stream.HSalsa20_Nonce; K : in Core.Salsa20_Key) with Global => null, Pre => (M'First = 0 and C'First = 0 and C'Last = M'Last and M'Length >= 32) and then Equal (M (0 .. 31), Zero_Bytes_32), Post => Equal (C (0 .. 15), Zero_Bytes_16); -- Postcomputation for Open procedure Open_AfterNM (M : out Byte_Seq; -- Output plaintext Status : out Boolean; C : in Byte_Seq; -- Input ciphertext N : in Stream.HSalsa20_Nonce; K : in Core.Salsa20_Key) with Global => null, Pre => (M'First = 0 and C'First = 0 and M'Last = C'Last and C'Length >= 32) and then Equal (C (0 .. 15), Zero_Bytes_16), Post => Equal (M (0 .. 31), Zero_Bytes_32); -- Top-level all-in-one Create operation procedure Create (C : out Byte_Seq; Status : out Boolean; M : in Byte_Seq; N : in Stream.HSalsa20_Nonce; Recipient_PK : in Public_Key; Sender_SK : in Secret_Key) with Global => null, Pre => (M'First = 0 and C'First = 0 and C'Last = M'Last and M'Length >= 32) and then Equal (M (0 .. 31), Zero_Bytes_32), Post => Equal (C (0 .. 15), Zero_Bytes_16); -- Top-level all-in-one Open operation procedure Open (M : out Byte_Seq; Status : out Boolean; C : in Byte_Seq; N : in Stream.HSalsa20_Nonce; Sender_PK : in Public_Key; Recipient_SK : in Secret_Key) with Global => null, Pre => (M'First = 0 and C'First = 0 and M'Last = C'Last and C'Length >= 32) and then Equal (C (0 .. 15), Zero_Bytes_16), Post => Equal (M (0 .. 31), Zero_Bytes_32); private -- Note - also limited types here in the full view to ensure -- no assignment and pass-by-reference in the body. type Secret_Key is limited record F : Bytes_32; end record; type Public_Key is limited record F : Bytes_32; end record; end SPARKNaCl.Cryptobox;
34.92623
65
0.482046
0497fbb4206121c79711bc7317170481e0948268
2,729
ada
Ada
Task/Formal-power-series/Ada/formal-power-series-2.ada
mullikine/RosettaCodeData
4f0027c6ce83daa36118ee8b67915a13cd23ab67
[ "Info-ZIP" ]
1
2018-11-09T22:08:38.000Z
2018-11-09T22:08:38.000Z
Task/Formal-power-series/Ada/formal-power-series-2.ada
mullikine/RosettaCodeData
4f0027c6ce83daa36118ee8b67915a13cd23ab67
[ "Info-ZIP" ]
null
null
null
Task/Formal-power-series/Ada/formal-power-series-2.ada
mullikine/RosettaCodeData
4f0027c6ce83daa36118ee8b67915a13cd23ab67
[ "Info-ZIP" ]
1
2018-11-09T22:08:40.000Z
2018-11-09T22:08:40.000Z
package body Generic_Taylor_Series is function Normalize (A : Taylor_Series) return Taylor_Series is begin for Power in reverse A'Range loop if A (Power) /= 0 then return A (0..Power); end if; end loop; return Zero; end Normalize; function "+" (A : Taylor_Series) return Taylor_Series is begin return A; end "+"; function "-" (A : Taylor_Series) return Taylor_Series is Result : Taylor_Series (A'Range); begin for Power in A'Range loop Result (Power) := -A (Power); end loop; return Result; end "-"; function "+" (A, B : Taylor_Series) return Taylor_Series is begin if A'Last > B'Last then return B + A; else declare Result : Taylor_Series (0..B'Last); begin for Power in A'Range loop Result (Power) := A (Power) + B (Power); end loop; for Power in A'Last + 1..B'Last loop Result (Power) := B (Power); end loop; return Normalize (Result); end; end if; end "+"; function "-" (A, B : Taylor_Series) return Taylor_Series is begin return A + (-B); end "-"; function "*" (A, B : Taylor_Series) return Taylor_Series is Result : Taylor_Series (0..A'Last + B'Last); begin for I in A'Range loop for J in B'Range loop Result (I + J) := A (I) * B (J); end loop; end loop; return Normalize (Result); end "*"; function Integral (A : Taylor_Series) return Taylor_Series is begin if A = Zero then return Zero; else declare Result : Taylor_Series (0..A'Last + 1); begin for Power in A'Range loop Result (Power + 1) := A (Power) / Number (Power + 1); end loop; Result (0) := Rational_Numbers.Zero; return Result; end; end if; end Integral; function Differential (A : Taylor_Series) return Taylor_Series is begin if A'Length = 1 then return Zero; else declare Result : Taylor_Series (0..A'Last - 1); begin for Power in Result'Range loop Result (Power) := A (Power + 1) * Number (Power); end loop; return Result; end; end if; end Differential; function Value (A : Taylor_Series; X : Rational) return Rational is Sum : Rational := A (A'Last); begin for Power in reverse 0..A'Last - 1 loop Sum := Sum * X + A (Power); end loop; return Sum; end Value; end Generic_Taylor_Series;
26.240385
70
0.532429
4bdcf5cf8bbcbc5e3212c84986582f103677dfae
7,988
ads
Ada
Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-crbtgk.ads
djamal2727/Main-Bearing-Analytical-Model
2f00c2219c71be0175c6f4f8f1d4cca231d97096
[ "Apache-2.0" ]
null
null
null
Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-crbtgk.ads
djamal2727/Main-Bearing-Analytical-Model
2f00c2219c71be0175c6f4f8f1d4cca231d97096
[ "Apache-2.0" ]
null
null
null
Validation/pyFrame3DD-master/gcc-master/gcc/ada/libgnat/a-crbtgk.ads
djamal2727/Main-Bearing-Analytical-Model
2f00c2219c71be0175c6f4f8f1d4cca231d97096
[ "Apache-2.0" ]
null
null
null
------------------------------------------------------------------------------ -- -- -- GNAT LIBRARY COMPONENTS -- -- -- -- ADA.CONTAINERS.RED_BLACK_TREES.GENERIC_KEYS -- -- -- -- S p e c -- -- -- -- Copyright (C) 2004-2020, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- This unit was originally developed by Matthew J Heaney. -- ------------------------------------------------------------------------------ -- Tree_Type is used to implement ordered containers. This package declares -- the tree operations that depend on keys. with Ada.Containers.Red_Black_Trees.Generic_Operations; generic with package Tree_Operations is new Generic_Operations (<>); use Tree_Operations.Tree_Types, Tree_Operations.Tree_Types.Implementation; type Key_Type (<>) is limited private; with function Is_Less_Key_Node (L : Key_Type; R : Node_Access) return Boolean; with function Is_Greater_Key_Node (L : Key_Type; R : Node_Access) return Boolean; package Ada.Containers.Red_Black_Trees.Generic_Keys is pragma Pure; generic with function New_Node return Node_Access; procedure Generic_Insert_Post (Tree : in out Tree_Type; Y : Node_Access; Before : Boolean; Z : out Node_Access); -- Completes an insertion after the insertion position has been -- determined. On output Z contains a pointer to the newly inserted -- node, allocated using New_Node. If Tree is busy then -- Program_Error is raised. If Y is null, then Tree must be empty. -- Otherwise Y denotes the insertion position, and Before specifies -- whether the new node is Y's left (True) or right (False) child. generic with procedure Insert_Post (T : in out Tree_Type; Y : Node_Access; B : Boolean; Z : out Node_Access); procedure Generic_Conditional_Insert (Tree : in out Tree_Type; Key : Key_Type; Node : out Node_Access; Inserted : out Boolean); -- Inserts a new node in Tree, but only if the tree does not already -- contain Key. Generic_Conditional_Insert first searches for a key -- equivalent to Key in Tree. If an equivalent key is found, then on -- output Node designates the node with that key and Inserted is -- False; there is no allocation and Tree is not modified. Otherwise -- Node designates a new node allocated using Insert_Post, and -- Inserted is True. generic with procedure Insert_Post (T : in out Tree_Type; Y : Node_Access; B : Boolean; Z : out Node_Access); procedure Generic_Unconditional_Insert (Tree : in out Tree_Type; Key : Key_Type; Node : out Node_Access); -- Inserts a new node in Tree. On output Node designates the new -- node, which is allocated using Insert_Post. The node is inserted -- immediately after already-existing equivalent keys. generic with procedure Insert_Post (T : in out Tree_Type; Y : Node_Access; B : Boolean; Z : out Node_Access); with procedure Unconditional_Insert_Sans_Hint (Tree : in out Tree_Type; Key : Key_Type; Node : out Node_Access); procedure Generic_Unconditional_Insert_With_Hint (Tree : in out Tree_Type; Hint : Node_Access; Key : Key_Type; Node : out Node_Access); -- Inserts a new node in Tree near position Hint, to avoid having to -- search from the root for the insertion position. If Hint is null -- then Generic_Unconditional_Insert_With_Hint attempts to insert -- the new node after Tree.Last. If Hint is non-null then if Key is -- less than Hint, it attempts to insert the new node immediately -- prior to Hint. Otherwise it attempts to insert the node -- immediately following Hint. We say "attempts" above to emphasize -- that insertions always preserve invariants with respect to key -- order, even when there's a hint. So if Key can't be inserted -- immediately near Hint, then the new node is inserted in the -- normal way, by searching for the correct position starting from -- the root. generic with procedure Insert_Post (T : in out Tree_Type; Y : Node_Access; B : Boolean; Z : out Node_Access); with procedure Conditional_Insert_Sans_Hint (Tree : in out Tree_Type; Key : Key_Type; Node : out Node_Access; Inserted : out Boolean); procedure Generic_Conditional_Insert_With_Hint (Tree : in out Tree_Type; Position : Node_Access; -- the hint Key : Key_Type; Node : out Node_Access; Inserted : out Boolean); -- Inserts a new node in Tree if the tree does not already contain -- Key, using Position as a hint about where to insert the new node. -- See Generic_Unconditional_Insert_With_Hint for more details about -- hint semantics. function Find (Tree : Tree_Type; Key : Key_Type) return Node_Access; -- Searches Tree for the smallest node equivalent to Key function Ceiling (Tree : Tree_Type; Key : Key_Type) return Node_Access; -- Searches Tree for the smallest node equal to or greater than Key function Floor (Tree : Tree_Type; Key : Key_Type) return Node_Access; -- Searches Tree for the largest node less than or equal to Key function Upper_Bound (Tree : Tree_Type; Key : Key_Type) return Node_Access; -- Searches Tree for the smallest node greater than Key generic with procedure Process (Node : Node_Access); procedure Generic_Iteration (Tree : Tree_Type; Key : Key_Type); -- Calls Process for each node in Tree equivalent to Key, in order -- from earliest in range to latest. generic with procedure Process (Node : Node_Access); procedure Generic_Reverse_Iteration (Tree : Tree_Type; Key : Key_Type); -- Calls Process for each node in Tree equivalent to Key, but in -- order from largest in range to earliest. end Ada.Containers.Red_Black_Trees.Generic_Keys;
41.388601
78
0.588758
049efae87f10661e7e7ea36d92fa96367e5dce13
44,873
ads
Ada
src/gnat/aspects.ads
jquorning/dynamo
10d68571476c270b8e45a9c5ef585fa9139b0d05
[ "Apache-2.0" ]
15
2015-01-18T23:04:19.000Z
2022-03-01T20:27:08.000Z
src/gnat/aspects.ads
jquorning/dynamo
10d68571476c270b8e45a9c5ef585fa9139b0d05
[ "Apache-2.0" ]
16
2018-06-10T07:09:30.000Z
2022-03-26T18:28:40.000Z
src/gnat/aspects.ads
jquorning/dynamo
10d68571476c270b8e45a9c5ef585fa9139b0d05
[ "Apache-2.0" ]
3
2015-11-11T18:00:14.000Z
2022-01-30T23:08:45.000Z
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- A S P E C T S -- -- -- -- S p e c -- -- -- -- Copyright (C) 2010-2015, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- 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 defines the aspects that are recognized by GNAT in aspect -- specifications. It also contains the subprograms for storing/retrieving -- aspect specifications from the tree. The semantic processing for aspect -- specifications is found in Sem_Ch13.Analyze_Aspect_Specifications. ------------------------ -- Adding New Aspects -- ------------------------ -- In general, each aspect should have a corresponding pragma, so that the -- newly developed functionality is available for Ada versions < Ada 2012. -- When both are defined, it is convenient to first transform the aspect into -- an equivalent pragma in Sem_Ch13.Analyze_Aspect_Specifications, and then -- analyze the pragma in Sem_Prag.Analyze_Pragma. -- To add a new aspect, you need to do the following -- 1. Create a name in snames.ads-tmpl -- 2. Create a value in type Aspect_Id in this unit -- 3. Add a value for the aspect in the global arrays defined in this unit -- 4. Add code for the aspect in Sem_Ch13.Analyze_Aspect_Specifications. -- This may involve adding some nodes to the tree to perform additional -- treatments later. -- 5. If the semantic analysis of expressions/names in the aspect should not -- occur at the point the aspect is defined, add code in the adequate -- semantic analysis procedure for the aspect. For example, this is the -- case for aspects Pre and Post on subprograms, which are pre-analyzed -- at the end of the declaration list to which the subprogram belongs, -- and fully analyzed (possibly with expansion) during the semantic -- analysis of subprogram bodies. with Namet; use Namet; with Snames; use Snames; with Types; use Types; package Aspects is -- Type defining recognized aspects type Aspect_Id is (No_Aspect, -- Dummy entry for no aspect Aspect_Abstract_State, -- GNAT Aspect_Address, Aspect_Alignment, Aspect_Annotate, -- GNAT Aspect_Attach_Handler, Aspect_Bit_Order, Aspect_Component_Size, Aspect_Constant_Indexing, Aspect_Contract_Cases, -- GNAT Aspect_Convention, Aspect_CPU, Aspect_Default_Component_Value, Aspect_Default_Initial_Condition, -- GNAT Aspect_Default_Iterator, Aspect_Default_Storage_Pool, Aspect_Default_Value, Aspect_Depends, -- GNAT Aspect_Dimension, -- GNAT Aspect_Dimension_System, -- GNAT Aspect_Dispatching_Domain, Aspect_Dynamic_Predicate, Aspect_Extensions_Visible, -- GNAT Aspect_External_Name, Aspect_External_Tag, Aspect_Ghost, -- GNAT Aspect_Global, -- GNAT Aspect_Implicit_Dereference, Aspect_Initial_Condition, -- GNAT Aspect_Initializes, -- GNAT Aspect_Input, Aspect_Interrupt_Priority, Aspect_Invariant, -- GNAT Aspect_Iterator_Element, Aspect_Iterable, -- GNAT Aspect_Link_Name, Aspect_Linker_Section, -- GNAT Aspect_Machine_Radix, Aspect_Object_Size, -- GNAT Aspect_Obsolescent, -- GNAT Aspect_Output, Aspect_Part_Of, -- GNAT Aspect_Post, Aspect_Postcondition, Aspect_Pre, Aspect_Precondition, Aspect_Predicate, -- GNAT Aspect_Priority, Aspect_Read, Aspect_Refined_Depends, -- GNAT Aspect_Refined_Global, -- GNAT Aspect_Refined_Post, -- GNAT Aspect_Refined_State, -- GNAT Aspect_Relative_Deadline, Aspect_Scalar_Storage_Order, -- GNAT Aspect_Simple_Storage_Pool, -- GNAT Aspect_Size, Aspect_Small, Aspect_SPARK_Mode, -- GNAT Aspect_Static_Predicate, Aspect_Storage_Pool, Aspect_Storage_Size, Aspect_Stream_Size, Aspect_Suppress, Aspect_Synchronization, Aspect_Test_Case, -- GNAT Aspect_Type_Invariant, Aspect_Unimplemented, -- GNAT Aspect_Unsuppress, Aspect_Value_Size, -- GNAT Aspect_Variable_Indexing, Aspect_Warnings, -- GNAT Aspect_Write, -- The following aspects correspond to library unit pragmas Aspect_All_Calls_Remote, Aspect_Elaborate_Body, Aspect_No_Elaboration_Code_All, -- GNAT Aspect_Preelaborate, Aspect_Pure, Aspect_Remote_Call_Interface, Aspect_Remote_Types, Aspect_Shared_Passive, Aspect_Universal_Data, -- GNAT -- Remaining aspects have a static boolean value that turns the aspect -- on or off. They all correspond to pragmas, but are only converted to -- the pragmas where the value is True. A value of False normally means -- that the aspect is ignored, except in the case of derived types where -- the aspect value is inherited from the parent, in which case, we do -- not allow False if we inherit a True value from the parent. Aspect_Async_Readers, -- GNAT Aspect_Async_Writers, -- GNAT Aspect_Asynchronous, Aspect_Atomic, Aspect_Atomic_Components, Aspect_Discard_Names, Aspect_Effective_Reads, -- GNAT Aspect_Effective_Writes, -- GNAT Aspect_Export, Aspect_Favor_Top_Level, -- GNAT Aspect_Independent, Aspect_Independent_Components, Aspect_Import, Aspect_Inline, Aspect_Inline_Always, -- GNAT Aspect_Interrupt_Handler, Aspect_Lock_Free, -- GNAT Aspect_No_Return, Aspect_No_Tagged_Streams, -- GNAT Aspect_Pack, Aspect_Persistent_BSS, -- GNAT Aspect_Preelaborable_Initialization, Aspect_Pure_Function, -- GNAT Aspect_Remote_Access_Type, -- GNAT Aspect_Shared, -- GNAT (equivalent to Atomic) Aspect_Simple_Storage_Pool_Type, -- GNAT Aspect_Suppress_Debug_Info, -- GNAT Aspect_Suppress_Initialization, -- GNAT Aspect_Thread_Local_Storage, -- GNAT Aspect_Unchecked_Union, Aspect_Universal_Aliasing, -- GNAT Aspect_Unmodified, -- GNAT Aspect_Unreferenced, -- GNAT Aspect_Unreferenced_Objects, -- GNAT Aspect_Volatile, Aspect_Volatile_Components); subtype Aspect_Id_Exclude_No_Aspect is Aspect_Id range Aspect_Id'Succ (No_Aspect) .. Aspect_Id'Last; -- Aspect_Id's excluding No_Aspect -- The following array indicates aspects that accept 'Class Class_Aspect_OK : constant array (Aspect_Id) of Boolean := (Aspect_Input => True, Aspect_Invariant => True, Aspect_Output => True, Aspect_Pre => True, Aspect_Predicate => True, Aspect_Post => True, Aspect_Read => True, Aspect_Write => True, Aspect_Type_Invariant => True, others => False); -- The following array identifies all implementation defined aspects Implementation_Defined_Aspect : constant array (Aspect_Id) of Boolean := (Aspect_Abstract_State => True, Aspect_Annotate => True, Aspect_Async_Readers => True, Aspect_Async_Writers => True, Aspect_Contract_Cases => True, Aspect_Depends => True, Aspect_Dimension => True, Aspect_Dimension_System => True, Aspect_Effective_Reads => True, Aspect_Effective_Writes => True, Aspect_Extensions_Visible => True, Aspect_Favor_Top_Level => True, Aspect_Ghost => True, Aspect_Global => True, Aspect_Inline_Always => True, Aspect_Invariant => True, Aspect_Lock_Free => True, Aspect_Object_Size => True, Aspect_Persistent_BSS => True, Aspect_Predicate => True, Aspect_Pure_Function => True, Aspect_Remote_Access_Type => True, Aspect_Scalar_Storage_Order => True, Aspect_Shared => True, Aspect_Simple_Storage_Pool => True, Aspect_Simple_Storage_Pool_Type => True, Aspect_Suppress_Debug_Info => True, Aspect_Suppress_Initialization => True, Aspect_Thread_Local_Storage => True, Aspect_Test_Case => True, Aspect_Universal_Aliasing => True, Aspect_Universal_Data => True, Aspect_Unmodified => True, Aspect_Unreferenced => True, Aspect_Unreferenced_Objects => True, Aspect_Value_Size => True, Aspect_Warnings => True, others => False); -- The following array indicates aspects for which multiple occurrences of -- the same aspect attached to the same declaration are allowed. No_Duplicates_Allowed : constant array (Aspect_Id) of Boolean := (Aspect_Annotate => False, Aspect_Test_Case => False, others => True); -- The following subtype defines aspects corresponding to library unit -- pragmas, these can only validly appear as aspects for library units, -- and result in a corresponding pragma being inserted immediately after -- the occurrence of the aspect. subtype Library_Unit_Aspects is Aspect_Id range Aspect_All_Calls_Remote .. Aspect_Universal_Data; -- The following subtype defines aspects accepting an optional static -- boolean parameter indicating if the aspect should be active or -- cancelling. If the parameter is missing the effective value is True, -- enabling the aspect. If the parameter is present it must be a static -- expression of type Standard.Boolean. If the value is True, then the -- aspect is enabled. If it is False, the aspect is disabled. subtype Boolean_Aspects is Aspect_Id range Aspect_Async_Readers .. Aspect_Id'Last; subtype Pre_Post_Aspects is Aspect_Id range Aspect_Post .. Aspect_Precondition; -- The following type is used for indicating allowed expression forms type Aspect_Expression is (Expression, -- Required expression Name, -- Required name Optional_Expression, -- Optional boolean expression Optional_Name); -- Optional name -- The following array indicates what argument type is required Aspect_Argument : constant array (Aspect_Id) of Aspect_Expression := (No_Aspect => Optional_Expression, Aspect_Abstract_State => Expression, Aspect_Address => Expression, Aspect_Alignment => Expression, Aspect_Annotate => Expression, Aspect_Attach_Handler => Expression, Aspect_Bit_Order => Expression, Aspect_Component_Size => Expression, Aspect_Constant_Indexing => Name, Aspect_Contract_Cases => Expression, Aspect_Convention => Name, Aspect_CPU => Expression, Aspect_Default_Component_Value => Expression, Aspect_Default_Initial_Condition => Optional_Expression, Aspect_Default_Iterator => Name, Aspect_Default_Storage_Pool => Expression, Aspect_Default_Value => Expression, Aspect_Depends => Expression, Aspect_Dimension => Expression, Aspect_Dimension_System => Expression, Aspect_Dispatching_Domain => Expression, Aspect_Dynamic_Predicate => Expression, Aspect_Extensions_Visible => Optional_Expression, Aspect_External_Name => Expression, Aspect_External_Tag => Expression, Aspect_Ghost => Optional_Expression, Aspect_Global => Expression, Aspect_Implicit_Dereference => Name, Aspect_Initial_Condition => Expression, Aspect_Initializes => Expression, Aspect_Input => Name, Aspect_Interrupt_Priority => Expression, Aspect_Invariant => Expression, Aspect_Iterable => Expression, Aspect_Iterator_Element => Name, Aspect_Link_Name => Expression, Aspect_Linker_Section => Expression, Aspect_Machine_Radix => Expression, Aspect_Object_Size => Expression, Aspect_Obsolescent => Optional_Expression, Aspect_Output => Name, Aspect_Part_Of => Expression, Aspect_Post => Expression, Aspect_Postcondition => Expression, Aspect_Pre => Expression, Aspect_Precondition => Expression, Aspect_Predicate => Expression, Aspect_Priority => Expression, Aspect_Read => Name, Aspect_Refined_Depends => Expression, Aspect_Refined_Global => Expression, Aspect_Refined_Post => Expression, Aspect_Refined_State => Expression, Aspect_Relative_Deadline => Expression, Aspect_Scalar_Storage_Order => Expression, Aspect_Simple_Storage_Pool => Name, Aspect_Size => Expression, Aspect_Small => Expression, Aspect_SPARK_Mode => Optional_Name, Aspect_Static_Predicate => Expression, Aspect_Storage_Pool => Name, Aspect_Storage_Size => Expression, Aspect_Stream_Size => Expression, Aspect_Suppress => Name, Aspect_Synchronization => Name, Aspect_Test_Case => Expression, Aspect_Type_Invariant => Expression, Aspect_Unimplemented => Optional_Expression, Aspect_Unsuppress => Name, Aspect_Value_Size => Expression, Aspect_Variable_Indexing => Name, Aspect_Warnings => Name, Aspect_Write => Name, Boolean_Aspects => Optional_Expression, Library_Unit_Aspects => Optional_Expression); ----------------------------------------- -- Table Linking Names and Aspect_Id's -- ----------------------------------------- -- Table linking aspect names and id's Aspect_Names : constant array (Aspect_Id) of Name_Id := (No_Aspect => No_Name, Aspect_Abstract_State => Name_Abstract_State, Aspect_Address => Name_Address, Aspect_Alignment => Name_Alignment, Aspect_All_Calls_Remote => Name_All_Calls_Remote, Aspect_Annotate => Name_Annotate, Aspect_Async_Readers => Name_Async_Readers, Aspect_Async_Writers => Name_Async_Writers, Aspect_Asynchronous => Name_Asynchronous, Aspect_Atomic => Name_Atomic, Aspect_Atomic_Components => Name_Atomic_Components, Aspect_Attach_Handler => Name_Attach_Handler, Aspect_Bit_Order => Name_Bit_Order, Aspect_Component_Size => Name_Component_Size, Aspect_Constant_Indexing => Name_Constant_Indexing, Aspect_Contract_Cases => Name_Contract_Cases, Aspect_Convention => Name_Convention, Aspect_CPU => Name_CPU, Aspect_Default_Component_Value => Name_Default_Component_Value, Aspect_Default_Initial_Condition => Name_Default_Initial_Condition, Aspect_Default_Iterator => Name_Default_Iterator, Aspect_Default_Storage_Pool => Name_Default_Storage_Pool, Aspect_Default_Value => Name_Default_Value, Aspect_Depends => Name_Depends, Aspect_Dimension => Name_Dimension, Aspect_Dimension_System => Name_Dimension_System, Aspect_Discard_Names => Name_Discard_Names, Aspect_Dispatching_Domain => Name_Dispatching_Domain, Aspect_Dynamic_Predicate => Name_Dynamic_Predicate, Aspect_Effective_Reads => Name_Effective_Reads, Aspect_Effective_Writes => Name_Effective_Writes, Aspect_Elaborate_Body => Name_Elaborate_Body, Aspect_Export => Name_Export, Aspect_Extensions_Visible => Name_Extensions_Visible, Aspect_External_Name => Name_External_Name, Aspect_External_Tag => Name_External_Tag, Aspect_Favor_Top_Level => Name_Favor_Top_Level, Aspect_Ghost => Name_Ghost, Aspect_Global => Name_Global, Aspect_Implicit_Dereference => Name_Implicit_Dereference, Aspect_Import => Name_Import, Aspect_Independent => Name_Independent, Aspect_Independent_Components => Name_Independent_Components, Aspect_Inline => Name_Inline, Aspect_Inline_Always => Name_Inline_Always, Aspect_Initial_Condition => Name_Initial_Condition, Aspect_Initializes => Name_Initializes, Aspect_Input => Name_Input, Aspect_Interrupt_Handler => Name_Interrupt_Handler, Aspect_Interrupt_Priority => Name_Interrupt_Priority, Aspect_Invariant => Name_Invariant, Aspect_Iterator_Element => Name_Iterator_Element, Aspect_Iterable => Name_Iterable, Aspect_Link_Name => Name_Link_Name, Aspect_Linker_Section => Name_Linker_Section, Aspect_Lock_Free => Name_Lock_Free, Aspect_Machine_Radix => Name_Machine_Radix, Aspect_No_Elaboration_Code_All => Name_No_Elaboration_Code_All, Aspect_No_Return => Name_No_Return, Aspect_No_Tagged_Streams => Name_No_Tagged_Streams, Aspect_Object_Size => Name_Object_Size, Aspect_Obsolescent => Name_Obsolescent, Aspect_Output => Name_Output, Aspect_Pack => Name_Pack, Aspect_Part_Of => Name_Part_Of, Aspect_Persistent_BSS => Name_Persistent_BSS, Aspect_Post => Name_Post, Aspect_Postcondition => Name_Postcondition, Aspect_Pre => Name_Pre, Aspect_Precondition => Name_Precondition, Aspect_Predicate => Name_Predicate, Aspect_Preelaborable_Initialization => Name_Preelaborable_Initialization, Aspect_Preelaborate => Name_Preelaborate, Aspect_Priority => Name_Priority, Aspect_Pure => Name_Pure, Aspect_Pure_Function => Name_Pure_Function, Aspect_Read => Name_Read, Aspect_Refined_Depends => Name_Refined_Depends, Aspect_Refined_Global => Name_Refined_Global, Aspect_Refined_Post => Name_Refined_Post, Aspect_Refined_State => Name_Refined_State, Aspect_Relative_Deadline => Name_Relative_Deadline, Aspect_Remote_Access_Type => Name_Remote_Access_Type, Aspect_Remote_Call_Interface => Name_Remote_Call_Interface, Aspect_Remote_Types => Name_Remote_Types, Aspect_Scalar_Storage_Order => Name_Scalar_Storage_Order, Aspect_Shared => Name_Shared, Aspect_Shared_Passive => Name_Shared_Passive, Aspect_Simple_Storage_Pool => Name_Simple_Storage_Pool, Aspect_Simple_Storage_Pool_Type => Name_Simple_Storage_Pool_Type, Aspect_Size => Name_Size, Aspect_Small => Name_Small, Aspect_SPARK_Mode => Name_SPARK_Mode, Aspect_Static_Predicate => Name_Static_Predicate, Aspect_Storage_Pool => Name_Storage_Pool, Aspect_Storage_Size => Name_Storage_Size, Aspect_Stream_Size => Name_Stream_Size, Aspect_Suppress => Name_Suppress, Aspect_Suppress_Debug_Info => Name_Suppress_Debug_Info, Aspect_Suppress_Initialization => Name_Suppress_Initialization, Aspect_Thread_Local_Storage => Name_Thread_Local_Storage, Aspect_Synchronization => Name_Synchronization, Aspect_Test_Case => Name_Test_Case, Aspect_Type_Invariant => Name_Type_Invariant, Aspect_Unchecked_Union => Name_Unchecked_Union, Aspect_Unimplemented => Name_Unimplemented, Aspect_Universal_Aliasing => Name_Universal_Aliasing, Aspect_Universal_Data => Name_Universal_Data, Aspect_Unmodified => Name_Unmodified, Aspect_Unreferenced => Name_Unreferenced, Aspect_Unreferenced_Objects => Name_Unreferenced_Objects, Aspect_Unsuppress => Name_Unsuppress, Aspect_Value_Size => Name_Value_Size, Aspect_Variable_Indexing => Name_Variable_Indexing, Aspect_Volatile => Name_Volatile, Aspect_Volatile_Components => Name_Volatile_Components, Aspect_Warnings => Name_Warnings, Aspect_Write => Name_Write); function Get_Aspect_Id (Name : Name_Id) return Aspect_Id; pragma Inline (Get_Aspect_Id); -- Given a name Nam, returns the corresponding aspect id value. If the name -- does not match any aspect, then No_Aspect is returned as the result. function Get_Aspect_Id (Aspect : Node_Id) return Aspect_Id; pragma Inline (Get_Aspect_Id); -- Given an aspect specification, return the corresponding aspect_id value. -- If the name does not match any aspect, return No_Aspect. ------------------------------------ -- Delaying Evaluation of Aspects -- ------------------------------------ -- The RM requires that all language defined aspects taking an expression -- delay evaluation of the expression till the freeze point of the entity -- to which the aspect applies. This allows forward references, and is of -- use for example in connection with preconditions and postconditions -- where the requirement of making all references in contracts to local -- functions be backwards references would be onerous. -- For consistency, even attributes like Size are delayed, so we can do: -- type A is range 1 .. 10 -- with Size => Not_Defined_Yet; -- .. -- Not_Defined_Yet : constant := 64; -- Resulting in A having a size of 64, which gets set when A is frozen. -- Furthermore, we can have a situation like -- type A is range 1 .. 10 -- with Size => Not_Defined_Yet; -- .. -- type B is new A; -- .. -- Not_Defined_Yet : constant := 64; -- where the Size of A is considered to have been previously specified at -- the point of derivation, even though the actual value of the size is -- not known yet, and in this example B inherits the size value of 64. -- Our normal implementation model (prior to Ada 2012) was simply to copy -- inheritable attributes at the point of derivation. Then any subsequent -- representation items apply either to the parent type, not affecting the -- derived type, or to the derived type, not affecting the parent type. -- To deal with the delayed aspect case, we use two flags. The first is -- set on the parent type if it has delayed representation aspects. This -- flag Has_Delayed_Rep_Aspects indicates that if we derive from this type -- we have to worry about making sure we inherit any delayed aspects. The -- second flag is set on a derived type: May_Have_Inherited_Rep_Aspects -- is set if the parent type has Has_Delayed_Rep_Aspects set. -- When we freeze a derived type, if the May_Have_Inherited_Rep_Aspects -- flag is set, then we call Freeze.Inherit_Delayed_Rep_Aspects when -- the derived type is frozen, which deals with the necessary copying of -- information from the parent type, which must be frozen at that point -- (since freezing the derived type first freezes the parent type). -- SPARK 2014 aspects do not follow the general delay mechanism as they -- act as annotations and cannot modify the attributes of their related -- constructs. To handle forward references in such aspects, the compiler -- delays the analysis of their respective pragmas by collecting them in -- N_Contract nodes. The pragmas are then analyzed at the end of the -- declarative region which contains the related construct. For details, -- see routines Analyze_xxx_In_Decl_Part. -- The following shows which aspects are delayed. There are three cases: type Delay_Type is (Always_Delay, -- This aspect is not a representation aspect that can be inherited and -- is always delayed, as required by the language definition. Never_Delay, -- There are two cases. There are language defined aspects like -- Convention where the "expression" is simply an uninterpreted -- identifier, and there is no issue of evaluating it and thus no -- issue of delaying the evaluation. The second case is implementation -- defined aspects where we have decided that we don't want to allow -- delays (and for our own aspects we can do what we like). Rep_Aspect); -- These are the cases of representation aspects that are in general -- delayed, and where there is a potential issue of derived types that -- inherit delayed representation values. -- Note: even if this table indicates that an aspect is delayed, we never -- delay Boolean aspects that have a missing expression (taken as True), -- or expressions for delayed rep items that consist of an integer literal -- (most cases of Size etc. in practice), since in these cases we know we -- can get the value of the expression without delay. Note that we still -- need to delay Boolean aspects that are specifically set to True: -- type R is array (0 .. 31) of Boolean -- with Pack => True; -- True : constant Boolean := False; -- This is nonsense, but we need to make it work and result in R not -- being packed, and if we have something like: -- type R is array (0 .. 31) of Boolean -- with Pack => True; -- RR : R; -- True : constant Boolean := False; -- This is illegal because the visibility of True changes after the freeze -- point, which is not allowed, and we need the delay mechanism to properly -- diagnose this error. Aspect_Delay : constant array (Aspect_Id) of Delay_Type := (No_Aspect => Always_Delay, Aspect_Address => Always_Delay, Aspect_All_Calls_Remote => Always_Delay, Aspect_Asynchronous => Always_Delay, Aspect_Attach_Handler => Always_Delay, Aspect_Constant_Indexing => Always_Delay, Aspect_CPU => Always_Delay, Aspect_Default_Iterator => Always_Delay, Aspect_Default_Storage_Pool => Always_Delay, Aspect_Default_Value => Always_Delay, Aspect_Default_Component_Value => Always_Delay, Aspect_Discard_Names => Always_Delay, Aspect_Dispatching_Domain => Always_Delay, Aspect_Dynamic_Predicate => Always_Delay, Aspect_Elaborate_Body => Always_Delay, Aspect_Export => Always_Delay, Aspect_External_Name => Always_Delay, Aspect_External_Tag => Always_Delay, Aspect_Favor_Top_Level => Always_Delay, Aspect_Implicit_Dereference => Always_Delay, Aspect_Import => Always_Delay, Aspect_Independent => Always_Delay, Aspect_Independent_Components => Always_Delay, Aspect_Inline => Always_Delay, Aspect_Inline_Always => Always_Delay, Aspect_Input => Always_Delay, Aspect_Interrupt_Handler => Always_Delay, Aspect_Interrupt_Priority => Always_Delay, Aspect_Invariant => Always_Delay, Aspect_Iterable => Always_Delay, Aspect_Iterator_Element => Always_Delay, Aspect_Link_Name => Always_Delay, Aspect_Linker_Section => Always_Delay, Aspect_Lock_Free => Always_Delay, Aspect_No_Return => Always_Delay, Aspect_Output => Always_Delay, Aspect_Persistent_BSS => Always_Delay, Aspect_Post => Always_Delay, Aspect_Postcondition => Always_Delay, Aspect_Pre => Always_Delay, Aspect_Precondition => Always_Delay, Aspect_Predicate => Always_Delay, Aspect_Preelaborable_Initialization => Always_Delay, Aspect_Preelaborate => Always_Delay, Aspect_Priority => Always_Delay, Aspect_Pure => Always_Delay, Aspect_Pure_Function => Always_Delay, Aspect_Read => Always_Delay, Aspect_Relative_Deadline => Always_Delay, Aspect_Remote_Access_Type => Always_Delay, Aspect_Remote_Call_Interface => Always_Delay, Aspect_Remote_Types => Always_Delay, Aspect_Shared => Always_Delay, Aspect_Shared_Passive => Always_Delay, Aspect_Simple_Storage_Pool => Always_Delay, Aspect_Simple_Storage_Pool_Type => Always_Delay, Aspect_Static_Predicate => Always_Delay, Aspect_Storage_Pool => Always_Delay, Aspect_Stream_Size => Always_Delay, Aspect_Suppress => Always_Delay, Aspect_Suppress_Debug_Info => Always_Delay, Aspect_Suppress_Initialization => Always_Delay, Aspect_Thread_Local_Storage => Always_Delay, Aspect_Type_Invariant => Always_Delay, Aspect_Unchecked_Union => Always_Delay, Aspect_Universal_Aliasing => Always_Delay, Aspect_Universal_Data => Always_Delay, Aspect_Unmodified => Always_Delay, Aspect_Unreferenced => Always_Delay, Aspect_Unreferenced_Objects => Always_Delay, Aspect_Unsuppress => Always_Delay, Aspect_Variable_Indexing => Always_Delay, Aspect_Write => Always_Delay, Aspect_Abstract_State => Never_Delay, Aspect_Annotate => Never_Delay, Aspect_Async_Readers => Never_Delay, Aspect_Async_Writers => Never_Delay, Aspect_Contract_Cases => Never_Delay, Aspect_Convention => Never_Delay, Aspect_Default_Initial_Condition => Never_Delay, Aspect_Depends => Never_Delay, Aspect_Dimension => Never_Delay, Aspect_Dimension_System => Never_Delay, Aspect_Effective_Reads => Never_Delay, Aspect_Effective_Writes => Never_Delay, Aspect_Extensions_Visible => Never_Delay, Aspect_Ghost => Never_Delay, Aspect_Global => Never_Delay, Aspect_Initial_Condition => Never_Delay, Aspect_Initializes => Never_Delay, Aspect_No_Elaboration_Code_All => Never_Delay, Aspect_No_Tagged_Streams => Never_Delay, Aspect_Obsolescent => Never_Delay, Aspect_Part_Of => Never_Delay, Aspect_Refined_Depends => Never_Delay, Aspect_Refined_Global => Never_Delay, Aspect_Refined_Post => Never_Delay, Aspect_Refined_State => Never_Delay, Aspect_SPARK_Mode => Never_Delay, Aspect_Synchronization => Never_Delay, Aspect_Test_Case => Never_Delay, Aspect_Unimplemented => Never_Delay, Aspect_Warnings => Never_Delay, Aspect_Alignment => Rep_Aspect, Aspect_Atomic => Rep_Aspect, Aspect_Atomic_Components => Rep_Aspect, Aspect_Bit_Order => Rep_Aspect, Aspect_Component_Size => Rep_Aspect, Aspect_Machine_Radix => Rep_Aspect, Aspect_Object_Size => Rep_Aspect, Aspect_Pack => Rep_Aspect, Aspect_Scalar_Storage_Order => Rep_Aspect, Aspect_Size => Rep_Aspect, Aspect_Small => Rep_Aspect, Aspect_Storage_Size => Rep_Aspect, Aspect_Value_Size => Rep_Aspect, Aspect_Volatile => Rep_Aspect, Aspect_Volatile_Components => Rep_Aspect); ------------------------------------------------ -- Handling of Aspect Specifications on Stubs -- ------------------------------------------------ -- Aspects that appear on the following stub nodes -- N_Package_Body_Stub -- N_Protected_Body_Stub -- N_Subprogram_Body_Stub -- N_Task_Body_Stub -- are treated as if they apply to the corresponding proper body. Their -- analysis is postponed until the analysis of the proper body takes place -- (see Analyze_Proper_Body). The delay is required because the analysis -- may generate extra code which would be harder to relocate to the body. -- If the proper body is present, the aspect specifications are relocated -- to the corresponding body node: -- N_Package_Body -- N_Protected_Body -- N_Subprogram_Body -- N_Task_Body -- The subsequent analysis takes care of the aspect-to-pragma conversions -- and verification of pragma legality. In the case where the proper body -- is not available, the aspect specifications are analyzed on the spot -- (see Analyze_Proper_Body) to catch potential errors. -- The following table lists all aspects that can apply to a subprogram -- body [stub]. For instance, the following example is legal: -- package P with SPARK_Mode ...; -- package body P with SPARK_Mode is ...; -- The table should be synchronized with Pragma_On_Body_Or_Stub_OK in unit -- Sem_Prag if the aspects below are implemented by a pragma. Aspect_On_Body_Or_Stub_OK : constant array (Aspect_Id) of Boolean := (Aspect_Refined_Depends => True, Aspect_Refined_Global => True, Aspect_Refined_Post => True, Aspect_SPARK_Mode => True, Aspect_Warnings => True, others => False); --------------------------------------------------- -- Handling of Aspect Specifications in the Tree -- --------------------------------------------------- -- Several kinds of declaration node permit aspect specifications in Ada -- 2012 mode. If there was room in all the corresponding declaration nodes, -- we could just have a field Aspect_Specifications pointing to a list of -- nodes for the aspects (N_Aspect_Specification nodes). But there isn't -- room, so we adopt a different approach. -- The following subprograms provide access to a specialized interface -- implemented internally with a hash table in the body, that provides -- access to aspect specifications. function Aspect_Specifications (N : Node_Id) return List_Id; -- Given a node N, returns the list of N_Aspect_Specification nodes that -- are attached to this declaration node. If the node is in the class of -- declaration nodes that permit aspect specifications, as defined by the -- predicate above, and if their Has_Aspects flag is set to True, then this -- will always be a non-empty list. If this flag is set to False, then -- No_List is returned. Normally, the only nodes that have Has_Aspects set -- True are the nodes for which Permits_Aspect_Specifications would return -- True (i.e. the declaration nodes defined in the RM as permitting the -- presence of Aspect_Specifications). However, it is possible for the -- flag Has_Aspects to be set on other nodes as a result of Rewrite and -- Replace calls, and this function may be used to retrieve the aspect -- specifications for the original rewritten node in such cases. function Aspects_On_Body_Or_Stub_OK (N : Node_Id) return Boolean; -- N denotes a body [stub] with aspects. Determine whether all aspects of N -- are allowed to appear on a body [stub]. procedure Exchange_Aspects (N1 : Node_Id; N2 : Node_Id); -- Exchange the aspect specifications of two nodes. If either node lacks an -- aspect specification list, the routine has no effect. It is assumed that -- both nodes can support aspects. function Find_Aspect (Id : Entity_Id; A : Aspect_Id) return Node_Id; -- Find the aspect specification of aspect A associated with entity I. -- Return Empty if Id does not have the requested aspect. function Find_Value_Of_Aspect (Id : Entity_Id; A : Aspect_Id) return Node_Id; -- Find the value of aspect A associated with entity Id. Return Empty if -- Id does not have the requested aspect. function Has_Aspect (Id : Entity_Id; A : Aspect_Id) return Boolean; -- Determine whether entity Id has aspect A procedure Move_Aspects (From : Node_Id; To : Node_Id); -- Relocate the aspect specifications of node From to node To. On entry it -- is assumed that To does not have aspect specifications. If From has no -- aspects, the routine has no effect. procedure Move_Or_Merge_Aspects (From : Node_Id; To : Node_Id); -- Relocate the aspect specifications of node From to node To. If To has -- aspects, the aspects of From are added to the aspects of To. If From has -- no aspects, the routine has no effect. When From denotes a subprogram -- body stub that also acts as a spec, the only aspects relocated to node -- To are those from table Aspect_On_Body_Or_Stub_OK and preconditions. function Permits_Aspect_Specifications (N : Node_Id) return Boolean; -- Returns True if the node N is a declaration node that permits aspect -- specifications in the grammar. It is possible for other nodes to have -- aspect specifications as a result of Rewrite or Replace calls. procedure Remove_Aspects (N : Node_Id); -- Delete the aspect specifications associated with node N. If the node has -- no aspects, the routine has no effect. function Same_Aspect (A1 : Aspect_Id; A2 : Aspect_Id) return Boolean; -- Returns True if A1 and A2 are (essentially) the same aspect. This is not -- a simple equality test because e.g. Post and Postcondition are the same. -- This is used for detecting duplicate aspects. procedure Set_Aspect_Specifications (N : Node_Id; L : List_Id); -- The node N must be in the class of declaration nodes that permit aspect -- specifications and the Has_Aspects flag must be False on entry. L must -- be a non-empty list of N_Aspect_Specification nodes. This procedure sets -- the Has_Aspects flag to True, and makes an entry that can be retrieved -- by a subsequent Aspect_Specifications call. It is an error to call this -- procedure with a node that does not permit aspect specifications, or a -- node that has its Has_Aspects flag set True on entry, or with L being an -- empty list or No_List. procedure Tree_Read; -- Reads contents of Aspect_Specifications hash table from the tree file procedure Tree_Write; -- Writes contents of Aspect_Specifications hash table to the tree file end Aspects;
50.992045
79
0.594054
2e745af9f5d6e18d53de42b9a766eeb63a6f87fc
5,448
adb
Ada
bb-runtimes/arm/stm32/stm32f429x/s-stm32.adb
JCGobbi/Nucleo-STM32F334R8
2a0b1b4b2664c92773703ac5e95dcb71979d051c
[ "BSD-3-Clause" ]
null
null
null
bb-runtimes/arm/stm32/stm32f429x/s-stm32.adb
JCGobbi/Nucleo-STM32F334R8
2a0b1b4b2664c92773703ac5e95dcb71979d051c
[ "BSD-3-Clause" ]
null
null
null
bb-runtimes/arm/stm32/stm32f429x/s-stm32.adb
JCGobbi/Nucleo-STM32F334R8
2a0b1b4b2664c92773703ac5e95dcb71979d051c
[ "BSD-3-Clause" ]
null
null
null
------------------------------------------------------------------------------ -- -- -- GNAT RUN-TIME COMPONENTS -- -- -- -- Copyright (C) 2012-2016, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Ada.Unchecked_Conversion; with System.BB.Parameters; with Interfaces; use Interfaces; with Interfaces.STM32; use Interfaces.STM32; with Interfaces.STM32.RCC; use Interfaces.STM32.RCC; package body System.STM32 is package Param renames System.BB.Parameters; HPRE_Presc_Table : constant array (AHB_Prescaler_Enum) of UInt32 := (2, 4, 8, 16, 64, 128, 256, 512); PPRE_Presc_Table : constant array (APB_Prescaler_Enum) of UInt32 := (2, 4, 8, 16); ------------------- -- System_Clocks -- ------------------- function System_Clocks return RCC_System_Clocks is Source : constant SYSCLK_Source := SYSCLK_Source'Val (RCC_Periph.CFGR.SWS); Result : RCC_System_Clocks; begin case Source is -- HSI as source when SYSCLK_SRC_HSI => Result.SYSCLK := Param.HSI_Clock; -- HSE as source when SYSCLK_SRC_HSE => Result.SYSCLK := Param.HSE_Clock; -- PLL as source when SYSCLK_SRC_PLL => declare Pllm : constant UInt32 := UInt32 (RCC_Periph.PLLCFGR.PLLM); Plln : constant UInt32 := UInt32 (RCC_Periph.PLLCFGR.PLLN); Pllp : constant UInt32 := UInt32 (RCC_Periph.PLLCFGR.PLLP); Pllvco : UInt32; begin case PLL_Source'Val (RCC_Periph.PLLCFGR.PLLSRC) is when PLL_SRC_HSE => Pllvco := (Param.HSE_Clock / Pllm) * Plln; when PLL_SRC_HSI => Pllvco := (Param.HSI_Clock / Pllm) * Plln; end case; Result.SYSCLK := Pllvco / ((Pllp + 1) * 2); end; end case; declare function To_AHBP is new Ada.Unchecked_Conversion (CFGR_HPRE_Field, AHB_Prescaler); function To_APBP is new Ada.Unchecked_Conversion (CFGR_PPRE_Element, APB_Prescaler); HPRE : constant AHB_Prescaler := To_AHBP (RCC_Periph.CFGR.HPRE); HPRE_Div : constant UInt32 := (if HPRE.Enabled then HPRE_Presc_Table (HPRE.Value) else 1); PPRE1 : constant APB_Prescaler := To_APBP (RCC_Periph.CFGR.PPRE.Arr (1)); PPRE1_Div : constant UInt32 := (if PPRE1.Enabled then PPRE_Presc_Table (PPRE1.Value) else 1); PPRE2 : constant APB_Prescaler := To_APBP (RCC_Periph.CFGR.PPRE.Arr (2)); PPRE2_Div : constant UInt32 := (if PPRE2.Enabled then PPRE_Presc_Table (PPRE2.Value) else 1); begin Result.HCLK := Result.SYSCLK / HPRE_Div; Result.PCLK1 := Result.HCLK / PPRE1_Div; Result.PCLK2 := Result.HCLK / PPRE2_Div; if not PPRE1.Enabled then Result.TIMCLK1 := Result.PCLK1; else Result.TIMCLK1 := Result.PCLK1 * 2; end if; if not PPRE2.Enabled then Result.TIMCLK2 := Result.PCLK2; else Result.TIMCLK2 := Result.PCLK2 * 2; end if; end; return Result; end System_Clocks; end System.STM32;
40.962406
78
0.485132
4b5afea761112ec99852a6cb2cf2ea3dce151209
4,615
ada
Ada
gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c8/c83f03b.ada
best08618/asylo
5a520a9f5c461ede0f32acc284017b737a43898c
[ "Apache-2.0" ]
7
2020-05-02T17:34:05.000Z
2021-10-17T10:15:18.000Z
gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c8/c83f03b.ada
best08618/asylo
5a520a9f5c461ede0f32acc284017b737a43898c
[ "Apache-2.0" ]
null
null
null
gcc-gcc-7_3_0-release/gcc/testsuite/ada/acats/tests/c8/c83f03b.ada
best08618/asylo
5a520a9f5c461ede0f32acc284017b737a43898c
[ "Apache-2.0" ]
2
2020-07-27T00:22:36.000Z
2021-04-01T09:41:02.000Z
-- C83F03B.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 PACKAGE BODY IS NESTED INSIDE ANOTHER PACKAGE BODY -- THE INNER PACKAGE BODY CAN CONTAIN A LABEL IDENTIFIER IDENTICAL -- TO A LABEL IDENTIFIER IN THE OUTER PACKAGE BODY, TO AN IDENTI- -- FIER DECLARED IN THE OUTER PACKAGE BODY OR IN ITS SPECIFICATION, -- OR TO A LABEL IDENTIFIER OR OTHER IDENTIFIER IN THE -- ENVIRONMENT SURROUNDING THE OUTER PACKAGE BODY. -- INTERACTIONS WITH SEPARATE COMPILATION ARE TESTED IN C83F03C , -- C83F03D . -- RM 04 SEPTEMBER 1980 WITH REPORT; PROCEDURE C83F03B IS USE REPORT; X1 , X2 : INTEGER RANGE 1..23 := 17 ; TYPE T1 IS ( A , B , C) ; Z : T1 := A ; FLOW_INDEX : INTEGER := 0 ; BEGIN TEST( "C83F03B" , "CHECK THAT IF A PACKAGE BODY IS NESTED" & " INSIDE ANOTHER PACKAGE BODY, THE INNER" & " PACKAGE BODY CAN CONTAIN A LABEL IDENTIFIER" & " IDENTICAL TO A LABEL IDENTIFIER IN THE OUTER" & " PACKAGE BODY, TO AN IDENTIFIER DECLARED IN" & " THE OUTER PACKAGE BODY OR IN ITS SPECIFICA" & "TION, OR TO A LABEL IDENTIFIER OR OTHER" & " IDENTIFIER IN THE ENVIRONMENT SURROUNDING" & " THE OUTER PACKAGE BODY" ) ; DECLARE Y1 , Y2 : INTEGER := 100 ; X2 : INTEGER := 100 ; PROCEDURE BUMP IS BEGIN FLOW_INDEX := FLOW_INDEX + 1 ; END BUMP ; PACKAGE OUTER IS Y3 : INTEGER := 100 ; TYPE T3 IS ( D , E , F ) ; PACKAGE P IS AA : BOOLEAN := FALSE ; END P ; END OUTER ; PACKAGE BODY OUTER IS Y4 : INTEGER := 200 ; TYPE T4 IS ( G , H , I ) ; PACKAGE BODY P IS BEGIN GOTO X1 ; BUMP ; BUMP ; <<X1>> BUMP ; GOTO X2 ; BUMP ; <<T1>> BUMP ; GOTO Z ; BUMP ; <<Y1>> BUMP ; GOTO Y2 ; BUMP ; <<Y2>> BUMP ; GOTO T1 ; BUMP ; <<X2>> BUMP ; GOTO Y1 ; BUMP ; <<Z >> BUMP ; GOTO T3 ; BUMP ; <<T3>> BUMP ; GOTO T4 ; BUMP ; <<LABEL_IN_OUTER>> BUMP ; GOTO LABEL_IN_MAIN ; BUMP ; <<Y3>> BUMP ; GOTO Y4 ; BUMP ; <<Y4>> BUMP ; GOTO LABEL_IN_OUTER ; BUMP ; <<T4>> BUMP ; GOTO Y3 ; BUMP ; <<LABEL_IN_MAIN >> BUMP ; GOTO ENDING ; BUMP ; << ENDING >> NULL; END P ; BEGIN << LABEL_IN_OUTER >> NULL ; END OUTER ; BEGIN << LABEL_IN_MAIN >> IF FLOW_INDEX /= 12 THEN FAILED( "INCORRECT FLOW OF CONTROL" ); END IF; END ; RESULT; -- POSS. ERROR DURING ELABORATION OF P END C83F03B;
29.208861
79
0.488624
4bdf5df4bc5a91649b11e62f2354dbb66de1a70c
2,509
ads
Ada
displaylist/example.ads
Lucretia/old_nehe_ada95
d0378c3bfce202eb01bf00b57c128735dbe8582d
[ "BSD-3-Clause" ]
null
null
null
displaylist/example.ads
Lucretia/old_nehe_ada95
d0378c3bfce202eb01bf00b57c128735dbe8582d
[ "BSD-3-Clause" ]
null
null
null
displaylist/example.ads
Lucretia/old_nehe_ada95
d0378c3bfce202eb01bf00b57c128735dbe8582d
[ "BSD-3-Clause" ]
null
null
null
--------------------------------------------------------------------------------- -- Copyright 2004-2005 © Luke A. Guest -- -- This code is to be used for tutorial purposes only. -- You may not redistribute this code in any form without my express permission. --------------------------------------------------------------------------------- with SDL.Types; use SDL.Types; with SDL.Keysym; with SDL.Video; with SDL.Timer; with Ada.Strings.Unbounded; use Ada.Strings.Unbounded; with GL; use type GL.GLfloat; package Example is procedure PrintGLInfo; procedure PrintUsage; procedure CalculateFPS; function Initialise return Boolean; procedure Uninitialise; procedure Update(Ticks : in Integer); procedure Draw; function GetTitle return String; function GetWidth return Integer; function GetHeight return Integer; function GetBitsPerPixel return Integer; procedure SetLastTickCount(Ticks : in Integer); procedure SetSurface(Surface : in SDL.Video.Surface_Ptr); function GetSurface return SDL.Video.Surface_Ptr; procedure SetKey(Key : in SDL.Keysym.Key; Down : in Boolean); procedure SetActive(Active : in Boolean); function IsActive return Boolean; procedure SetQuit(Quit : in Boolean); function Quit return Boolean; private type KeysArray is array(SDL.Keysym.K_FIRST .. SDL.Keysym.K_LAST) of Boolean; Title : String := "DisplayList Demo in Ada/SDL"; Width : Integer := 640; Height : Integer := 480; BitsPerPixel : Integer := 16; IsFullScreen : Boolean := False; Keys : KeysArray := (others => False); IsVisible : Boolean := False; LastTickCount : Integer := 0; ScreenSurface : SDL.Video.Surface_Ptr := null; AppActive : Boolean := True; AppQuit : Boolean := False; PressedL : Boolean := False; PressedS : Boolean := False; LightingOn : Boolean := True; SmoothShadingOn : Boolean := True; CameraXSpeed : GL.GLfloat := 0.0; CameraYSpeed : GL.GLfloat := 0.0; Zoom : GL.GLfloat := -6.0; CubeList : GL.GLuint := 0; LastElapsedTime : Float := 0.0; FrameCount : Integer := 0; FPS : Float := 0.0; end Example;
37.447761
81
0.552013
4b4b72a29306a1f0937fa8937006cdc82a536e48
85,396
ads
Ada
stm32f0/stm32f072x/svd/stm32_svd-tim.ads
ekoeppen/STM32_Generic_Ada_Drivers
4ff29c3026c4b24280baf22a5b81ea9969375466
[ "MIT" ]
1
2021-04-06T07:57:56.000Z
2021-04-06T07:57:56.000Z
stm32f0/stm32f072x/svd/stm32_svd-tim.ads
ekoeppen/STM32_Generic_Ada_Drivers
4ff29c3026c4b24280baf22a5b81ea9969375466
[ "MIT" ]
null
null
null
stm32f0/stm32f072x/svd/stm32_svd-tim.ads
ekoeppen/STM32_Generic_Ada_Drivers
4ff29c3026c4b24280baf22a5b81ea9969375466
[ "MIT" ]
2
2018-05-29T13:59:31.000Z
2019-02-03T19:48:08.000Z
-- This spec has been automatically generated from STM32F072x.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with System; package STM32_SVD.TIM is pragma Preelaborate; --------------- -- Registers -- --------------- subtype CR1_CEN_Field is STM32_SVD.Bit; subtype CR1_UDIS_Field is STM32_SVD.Bit; subtype CR1_URS_Field is STM32_SVD.Bit; subtype CR1_OPM_Field is STM32_SVD.Bit; subtype CR1_DIR_Field is STM32_SVD.Bit; subtype CR1_CMS_Field is STM32_SVD.UInt2; subtype CR1_ARPE_Field is STM32_SVD.Bit; subtype CR1_CKD_Field is STM32_SVD.UInt2; -- control register 1 type CR1_Register is record -- Counter enable CEN : CR1_CEN_Field := 16#0#; -- Update disable UDIS : CR1_UDIS_Field := 16#0#; -- Update request source URS : CR1_URS_Field := 16#0#; -- One-pulse mode OPM : CR1_OPM_Field := 16#0#; -- Direction DIR : CR1_DIR_Field := 16#0#; -- Center-aligned mode selection CMS : CR1_CMS_Field := 16#0#; -- Auto-reload preload enable ARPE : CR1_ARPE_Field := 16#0#; -- Clock division CKD : CR1_CKD_Field := 16#0#; -- unspecified Reserved_10_31 : STM32_SVD.UInt22 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR1_Register use record CEN at 0 range 0 .. 0; UDIS at 0 range 1 .. 1; URS at 0 range 2 .. 2; OPM at 0 range 3 .. 3; DIR at 0 range 4 .. 4; CMS at 0 range 5 .. 6; ARPE at 0 range 7 .. 7; CKD at 0 range 8 .. 9; Reserved_10_31 at 0 range 10 .. 31; end record; subtype CR2_CCPC_Field is STM32_SVD.Bit; subtype CR2_CCUS_Field is STM32_SVD.Bit; subtype CR2_CCDS_Field is STM32_SVD.Bit; subtype CR2_MMS_Field is STM32_SVD.UInt3; subtype CR2_TI1S_Field is STM32_SVD.Bit; subtype CR2_OIS1_Field is STM32_SVD.Bit; subtype CR2_OIS1N_Field is STM32_SVD.Bit; subtype CR2_OIS2_Field is STM32_SVD.Bit; subtype CR2_OIS2N_Field is STM32_SVD.Bit; subtype CR2_OIS3_Field is STM32_SVD.Bit; subtype CR2_OIS3N_Field is STM32_SVD.Bit; subtype CR2_OIS4_Field is STM32_SVD.Bit; -- control register 2 type CR2_Register is record -- Capture/compare preloaded control CCPC : CR2_CCPC_Field := 16#0#; -- unspecified Reserved_1_1 : STM32_SVD.Bit := 16#0#; -- Capture/compare control update selection CCUS : CR2_CCUS_Field := 16#0#; -- Capture/compare DMA selection CCDS : CR2_CCDS_Field := 16#0#; -- Master mode selection MMS : CR2_MMS_Field := 16#0#; -- TI1 selection TI1S : CR2_TI1S_Field := 16#0#; -- Output Idle state 1 OIS1 : CR2_OIS1_Field := 16#0#; -- Output Idle state 1 OIS1N : CR2_OIS1N_Field := 16#0#; -- Output Idle state 2 OIS2 : CR2_OIS2_Field := 16#0#; -- Output Idle state 2 OIS2N : CR2_OIS2N_Field := 16#0#; -- Output Idle state 3 OIS3 : CR2_OIS3_Field := 16#0#; -- Output Idle state 3 OIS3N : CR2_OIS3N_Field := 16#0#; -- Output Idle state 4 OIS4 : CR2_OIS4_Field := 16#0#; -- unspecified Reserved_15_31 : STM32_SVD.UInt17 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR2_Register use record CCPC at 0 range 0 .. 0; Reserved_1_1 at 0 range 1 .. 1; CCUS at 0 range 2 .. 2; CCDS at 0 range 3 .. 3; MMS at 0 range 4 .. 6; TI1S at 0 range 7 .. 7; OIS1 at 0 range 8 .. 8; OIS1N at 0 range 9 .. 9; OIS2 at 0 range 10 .. 10; OIS2N at 0 range 11 .. 11; OIS3 at 0 range 12 .. 12; OIS3N at 0 range 13 .. 13; OIS4 at 0 range 14 .. 14; Reserved_15_31 at 0 range 15 .. 31; end record; subtype SMCR_SMS_Field is STM32_SVD.UInt3; subtype SMCR_TS_Field is STM32_SVD.UInt3; subtype SMCR_MSM_Field is STM32_SVD.Bit; subtype SMCR_ETF_Field is STM32_SVD.UInt4; subtype SMCR_ETPS_Field is STM32_SVD.UInt2; subtype SMCR_ECE_Field is STM32_SVD.Bit; subtype SMCR_ETP_Field is STM32_SVD.Bit; -- slave mode control register type SMCR_Register is record -- Slave mode selection SMS : SMCR_SMS_Field := 16#0#; -- unspecified Reserved_3_3 : STM32_SVD.Bit := 16#0#; -- Trigger selection TS : SMCR_TS_Field := 16#0#; -- Master/Slave mode MSM : SMCR_MSM_Field := 16#0#; -- External trigger filter ETF : SMCR_ETF_Field := 16#0#; -- External trigger prescaler ETPS : SMCR_ETPS_Field := 16#0#; -- External clock enable ECE : SMCR_ECE_Field := 16#0#; -- External trigger polarity ETP : SMCR_ETP_Field := 16#0#; -- unspecified Reserved_16_31 : STM32_SVD.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for SMCR_Register use record SMS at 0 range 0 .. 2; Reserved_3_3 at 0 range 3 .. 3; TS at 0 range 4 .. 6; MSM at 0 range 7 .. 7; ETF at 0 range 8 .. 11; ETPS at 0 range 12 .. 13; ECE at 0 range 14 .. 14; ETP at 0 range 15 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype DIER_UIE_Field is STM32_SVD.Bit; subtype DIER_CC1IE_Field is STM32_SVD.Bit; subtype DIER_CC2IE_Field is STM32_SVD.Bit; subtype DIER_CC3IE_Field is STM32_SVD.Bit; subtype DIER_CC4IE_Field is STM32_SVD.Bit; subtype DIER_COMIE_Field is STM32_SVD.Bit; subtype DIER_TIE_Field is STM32_SVD.Bit; subtype DIER_BIE_Field is STM32_SVD.Bit; subtype DIER_UDE_Field is STM32_SVD.Bit; subtype DIER_CC1DE_Field is STM32_SVD.Bit; subtype DIER_CC2DE_Field is STM32_SVD.Bit; subtype DIER_CC3DE_Field is STM32_SVD.Bit; subtype DIER_CC4DE_Field is STM32_SVD.Bit; subtype DIER_COMDE_Field is STM32_SVD.Bit; subtype DIER_TDE_Field is STM32_SVD.Bit; -- DMA/Interrupt enable register type DIER_Register is record -- Update interrupt enable UIE : DIER_UIE_Field := 16#0#; -- Capture/Compare 1 interrupt enable CC1IE : DIER_CC1IE_Field := 16#0#; -- Capture/Compare 2 interrupt enable CC2IE : DIER_CC2IE_Field := 16#0#; -- Capture/Compare 3 interrupt enable CC3IE : DIER_CC3IE_Field := 16#0#; -- Capture/Compare 4 interrupt enable CC4IE : DIER_CC4IE_Field := 16#0#; -- COM interrupt enable COMIE : DIER_COMIE_Field := 16#0#; -- Trigger interrupt enable TIE : DIER_TIE_Field := 16#0#; -- Break interrupt enable BIE : DIER_BIE_Field := 16#0#; -- Update DMA request enable UDE : DIER_UDE_Field := 16#0#; -- Capture/Compare 1 DMA request enable CC1DE : DIER_CC1DE_Field := 16#0#; -- Capture/Compare 2 DMA request enable CC2DE : DIER_CC2DE_Field := 16#0#; -- Capture/Compare 3 DMA request enable CC3DE : DIER_CC3DE_Field := 16#0#; -- Capture/Compare 4 DMA request enable CC4DE : DIER_CC4DE_Field := 16#0#; -- Reserved COMDE : DIER_COMDE_Field := 16#0#; -- Trigger DMA request enable TDE : DIER_TDE_Field := 16#0#; -- unspecified Reserved_15_31 : STM32_SVD.UInt17 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for DIER_Register use record UIE at 0 range 0 .. 0; CC1IE at 0 range 1 .. 1; CC2IE at 0 range 2 .. 2; CC3IE at 0 range 3 .. 3; CC4IE at 0 range 4 .. 4; COMIE at 0 range 5 .. 5; TIE at 0 range 6 .. 6; BIE at 0 range 7 .. 7; UDE at 0 range 8 .. 8; CC1DE at 0 range 9 .. 9; CC2DE at 0 range 10 .. 10; CC3DE at 0 range 11 .. 11; CC4DE at 0 range 12 .. 12; COMDE at 0 range 13 .. 13; TDE at 0 range 14 .. 14; Reserved_15_31 at 0 range 15 .. 31; end record; subtype SR_UIF_Field is STM32_SVD.Bit; subtype SR_CC1IF_Field is STM32_SVD.Bit; subtype SR_CC2IF_Field is STM32_SVD.Bit; subtype SR_CC3IF_Field is STM32_SVD.Bit; subtype SR_CC4IF_Field is STM32_SVD.Bit; subtype SR_COMIF_Field is STM32_SVD.Bit; subtype SR_TIF_Field is STM32_SVD.Bit; subtype SR_BIF_Field is STM32_SVD.Bit; subtype SR_CC1OF_Field is STM32_SVD.Bit; subtype SR_CC2OF_Field is STM32_SVD.Bit; subtype SR_CC3OF_Field is STM32_SVD.Bit; subtype SR_CC4OF_Field is STM32_SVD.Bit; -- status register type SR_Register is record -- Update interrupt flag UIF : SR_UIF_Field := 16#0#; -- Capture/compare 1 interrupt flag CC1IF : SR_CC1IF_Field := 16#0#; -- Capture/Compare 2 interrupt flag CC2IF : SR_CC2IF_Field := 16#0#; -- Capture/Compare 3 interrupt flag CC3IF : SR_CC3IF_Field := 16#0#; -- Capture/Compare 4 interrupt flag CC4IF : SR_CC4IF_Field := 16#0#; -- COM interrupt flag COMIF : SR_COMIF_Field := 16#0#; -- Trigger interrupt flag TIF : SR_TIF_Field := 16#0#; -- Break interrupt flag BIF : SR_BIF_Field := 16#0#; -- unspecified Reserved_8_8 : STM32_SVD.Bit := 16#0#; -- Capture/Compare 1 overcapture flag CC1OF : SR_CC1OF_Field := 16#0#; -- Capture/compare 2 overcapture flag CC2OF : SR_CC2OF_Field := 16#0#; -- Capture/Compare 3 overcapture flag CC3OF : SR_CC3OF_Field := 16#0#; -- Capture/Compare 4 overcapture flag CC4OF : SR_CC4OF_Field := 16#0#; -- unspecified Reserved_13_31 : STM32_SVD.UInt19 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for SR_Register use record UIF at 0 range 0 .. 0; CC1IF at 0 range 1 .. 1; CC2IF at 0 range 2 .. 2; CC3IF at 0 range 3 .. 3; CC4IF at 0 range 4 .. 4; COMIF at 0 range 5 .. 5; TIF at 0 range 6 .. 6; BIF at 0 range 7 .. 7; Reserved_8_8 at 0 range 8 .. 8; CC1OF at 0 range 9 .. 9; CC2OF at 0 range 10 .. 10; CC3OF at 0 range 11 .. 11; CC4OF at 0 range 12 .. 12; Reserved_13_31 at 0 range 13 .. 31; end record; subtype EGR_UG_Field is STM32_SVD.Bit; subtype EGR_CC1G_Field is STM32_SVD.Bit; subtype EGR_CC2G_Field is STM32_SVD.Bit; subtype EGR_CC3G_Field is STM32_SVD.Bit; subtype EGR_CC4G_Field is STM32_SVD.Bit; subtype EGR_COMG_Field is STM32_SVD.Bit; subtype EGR_TG_Field is STM32_SVD.Bit; subtype EGR_BG_Field is STM32_SVD.Bit; -- event generation register type EGR_Register is record -- Write-only. Update generation UG : EGR_UG_Field := 16#0#; -- Write-only. Capture/compare 1 generation CC1G : EGR_CC1G_Field := 16#0#; -- Write-only. Capture/compare 2 generation CC2G : EGR_CC2G_Field := 16#0#; -- Write-only. Capture/compare 3 generation CC3G : EGR_CC3G_Field := 16#0#; -- Write-only. Capture/compare 4 generation CC4G : EGR_CC4G_Field := 16#0#; -- Write-only. Capture/Compare control update generation COMG : EGR_COMG_Field := 16#0#; -- Write-only. Trigger generation TG : EGR_TG_Field := 16#0#; -- Write-only. Break generation BG : EGR_BG_Field := 16#0#; -- unspecified Reserved_8_31 : STM32_SVD.UInt24 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for EGR_Register use record UG at 0 range 0 .. 0; CC1G at 0 range 1 .. 1; CC2G at 0 range 2 .. 2; CC3G at 0 range 3 .. 3; CC4G at 0 range 4 .. 4; COMG at 0 range 5 .. 5; TG at 0 range 6 .. 6; BG at 0 range 7 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; subtype CCMR1_Output_CC1S_Field is STM32_SVD.UInt2; subtype CCMR1_Output_OC1FE_Field is STM32_SVD.Bit; subtype CCMR1_Output_OC1PE_Field is STM32_SVD.Bit; subtype CCMR1_Output_OC1M_Field is STM32_SVD.UInt3; subtype CCMR1_Output_OC1CE_Field is STM32_SVD.Bit; subtype CCMR1_Output_CC2S_Field is STM32_SVD.UInt2; subtype CCMR1_Output_OC2FE_Field is STM32_SVD.Bit; subtype CCMR1_Output_OC2PE_Field is STM32_SVD.Bit; subtype CCMR1_Output_OC2M_Field is STM32_SVD.UInt3; subtype CCMR1_Output_OC2CE_Field is STM32_SVD.Bit; -- capture/compare mode register (output mode) type CCMR1_Output_Register is record -- Capture/Compare 1 selection CC1S : CCMR1_Output_CC1S_Field := 16#0#; -- Output Compare 1 fast enable OC1FE : CCMR1_Output_OC1FE_Field := 16#0#; -- Output Compare 1 preload enable OC1PE : CCMR1_Output_OC1PE_Field := 16#0#; -- Output Compare 1 mode OC1M : CCMR1_Output_OC1M_Field := 16#0#; -- Output Compare 1 clear enable OC1CE : CCMR1_Output_OC1CE_Field := 16#0#; -- Capture/Compare 2 selection CC2S : CCMR1_Output_CC2S_Field := 16#0#; -- Output Compare 2 fast enable OC2FE : CCMR1_Output_OC2FE_Field := 16#0#; -- Output Compare 2 preload enable OC2PE : CCMR1_Output_OC2PE_Field := 16#0#; -- Output Compare 2 mode OC2M : CCMR1_Output_OC2M_Field := 16#0#; -- Output Compare 2 clear enable OC2CE : CCMR1_Output_OC2CE_Field := 16#0#; -- unspecified Reserved_16_31 : STM32_SVD.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CCMR1_Output_Register use record CC1S at 0 range 0 .. 1; OC1FE at 0 range 2 .. 2; OC1PE at 0 range 3 .. 3; OC1M at 0 range 4 .. 6; OC1CE at 0 range 7 .. 7; CC2S at 0 range 8 .. 9; OC2FE at 0 range 10 .. 10; OC2PE at 0 range 11 .. 11; OC2M at 0 range 12 .. 14; OC2CE at 0 range 15 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype CCMR1_Input_CC1S_Field is STM32_SVD.UInt2; subtype CCMR1_Input_IC1PCS_Field is STM32_SVD.UInt2; subtype CCMR1_Input_IC1F_Field is STM32_SVD.UInt4; subtype CCMR1_Input_CC2S_Field is STM32_SVD.UInt2; subtype CCMR1_Input_IC2PCS_Field is STM32_SVD.UInt2; subtype CCMR1_Input_IC2F_Field is STM32_SVD.UInt4; -- capture/compare mode register 1 (input mode) type CCMR1_Input_Register is record -- Capture/Compare 1 selection CC1S : CCMR1_Input_CC1S_Field := 16#0#; -- Input capture 1 prescaler IC1PCS : CCMR1_Input_IC1PCS_Field := 16#0#; -- Input capture 1 filter IC1F : CCMR1_Input_IC1F_Field := 16#0#; -- Capture/Compare 2 selection CC2S : CCMR1_Input_CC2S_Field := 16#0#; -- Input capture 2 prescaler IC2PCS : CCMR1_Input_IC2PCS_Field := 16#0#; -- Input capture 2 filter IC2F : CCMR1_Input_IC2F_Field := 16#0#; -- unspecified Reserved_16_31 : STM32_SVD.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CCMR1_Input_Register use record CC1S at 0 range 0 .. 1; IC1PCS at 0 range 2 .. 3; IC1F at 0 range 4 .. 7; CC2S at 0 range 8 .. 9; IC2PCS at 0 range 10 .. 11; IC2F at 0 range 12 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype CCMR2_Output_CC3S_Field is STM32_SVD.UInt2; subtype CCMR2_Output_OC3FE_Field is STM32_SVD.Bit; subtype CCMR2_Output_OC3PE_Field is STM32_SVD.Bit; subtype CCMR2_Output_OC3M_Field is STM32_SVD.UInt3; subtype CCMR2_Output_OC3CE_Field is STM32_SVD.Bit; subtype CCMR2_Output_CC4S_Field is STM32_SVD.UInt2; subtype CCMR2_Output_OC4FE_Field is STM32_SVD.Bit; subtype CCMR2_Output_OC4PE_Field is STM32_SVD.Bit; subtype CCMR2_Output_OC4M_Field is STM32_SVD.UInt3; subtype CCMR2_Output_OC4CE_Field is STM32_SVD.Bit; -- capture/compare mode register (output mode) type CCMR2_Output_Register is record -- Capture/Compare 3 selection CC3S : CCMR2_Output_CC3S_Field := 16#0#; -- Output compare 3 fast enable OC3FE : CCMR2_Output_OC3FE_Field := 16#0#; -- Output compare 3 preload enable OC3PE : CCMR2_Output_OC3PE_Field := 16#0#; -- Output compare 3 mode OC3M : CCMR2_Output_OC3M_Field := 16#0#; -- Output compare 3 clear enable OC3CE : CCMR2_Output_OC3CE_Field := 16#0#; -- Capture/Compare 4 selection CC4S : CCMR2_Output_CC4S_Field := 16#0#; -- Output compare 4 fast enable OC4FE : CCMR2_Output_OC4FE_Field := 16#0#; -- Output compare 4 preload enable OC4PE : CCMR2_Output_OC4PE_Field := 16#0#; -- Output compare 4 mode OC4M : CCMR2_Output_OC4M_Field := 16#0#; -- Output compare 4 clear enable OC4CE : CCMR2_Output_OC4CE_Field := 16#0#; -- unspecified Reserved_16_31 : STM32_SVD.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CCMR2_Output_Register use record CC3S at 0 range 0 .. 1; OC3FE at 0 range 2 .. 2; OC3PE at 0 range 3 .. 3; OC3M at 0 range 4 .. 6; OC3CE at 0 range 7 .. 7; CC4S at 0 range 8 .. 9; OC4FE at 0 range 10 .. 10; OC4PE at 0 range 11 .. 11; OC4M at 0 range 12 .. 14; OC4CE at 0 range 15 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype CCMR2_Input_CC3S_Field is STM32_SVD.UInt2; subtype CCMR2_Input_IC3PSC_Field is STM32_SVD.UInt2; subtype CCMR2_Input_IC3F_Field is STM32_SVD.UInt4; subtype CCMR2_Input_CC4S_Field is STM32_SVD.UInt2; subtype CCMR2_Input_IC4PSC_Field is STM32_SVD.UInt2; subtype CCMR2_Input_IC4F_Field is STM32_SVD.UInt4; -- capture/compare mode register 2 (input mode) type CCMR2_Input_Register is record -- Capture/compare 3 selection CC3S : CCMR2_Input_CC3S_Field := 16#0#; -- Input capture 3 prescaler IC3PSC : CCMR2_Input_IC3PSC_Field := 16#0#; -- Input capture 3 filter IC3F : CCMR2_Input_IC3F_Field := 16#0#; -- Capture/Compare 4 selection CC4S : CCMR2_Input_CC4S_Field := 16#0#; -- Input capture 4 prescaler IC4PSC : CCMR2_Input_IC4PSC_Field := 16#0#; -- Input capture 4 filter IC4F : CCMR2_Input_IC4F_Field := 16#0#; -- unspecified Reserved_16_31 : STM32_SVD.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CCMR2_Input_Register use record CC3S at 0 range 0 .. 1; IC3PSC at 0 range 2 .. 3; IC3F at 0 range 4 .. 7; CC4S at 0 range 8 .. 9; IC4PSC at 0 range 10 .. 11; IC4F at 0 range 12 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype CCER_CC1E_Field is STM32_SVD.Bit; subtype CCER_CC1P_Field is STM32_SVD.Bit; subtype CCER_CC1NE_Field is STM32_SVD.Bit; subtype CCER_CC1NP_Field is STM32_SVD.Bit; subtype CCER_CC2E_Field is STM32_SVD.Bit; subtype CCER_CC2P_Field is STM32_SVD.Bit; subtype CCER_CC2NE_Field is STM32_SVD.Bit; subtype CCER_CC2NP_Field is STM32_SVD.Bit; subtype CCER_CC3E_Field is STM32_SVD.Bit; subtype CCER_CC3P_Field is STM32_SVD.Bit; subtype CCER_CC3NE_Field is STM32_SVD.Bit; subtype CCER_CC3NP_Field is STM32_SVD.Bit; subtype CCER_CC4E_Field is STM32_SVD.Bit; subtype CCER_CC4P_Field is STM32_SVD.Bit; -- capture/compare enable register type CCER_Register is record -- Capture/Compare 1 output enable CC1E : CCER_CC1E_Field := 16#0#; -- Capture/Compare 1 output Polarity CC1P : CCER_CC1P_Field := 16#0#; -- Capture/Compare 1 complementary output enable CC1NE : CCER_CC1NE_Field := 16#0#; -- Capture/Compare 1 output Polarity CC1NP : CCER_CC1NP_Field := 16#0#; -- Capture/Compare 2 output enable CC2E : CCER_CC2E_Field := 16#0#; -- Capture/Compare 2 output Polarity CC2P : CCER_CC2P_Field := 16#0#; -- Capture/Compare 2 complementary output enable CC2NE : CCER_CC2NE_Field := 16#0#; -- Capture/Compare 2 output Polarity CC2NP : CCER_CC2NP_Field := 16#0#; -- Capture/Compare 3 output enable CC3E : CCER_CC3E_Field := 16#0#; -- Capture/Compare 3 output Polarity CC3P : CCER_CC3P_Field := 16#0#; -- Capture/Compare 3 complementary output enable CC3NE : CCER_CC3NE_Field := 16#0#; -- Capture/Compare 3 output Polarity CC3NP : CCER_CC3NP_Field := 16#0#; -- Capture/Compare 4 output enable CC4E : CCER_CC4E_Field := 16#0#; -- Capture/Compare 3 output Polarity CC4P : CCER_CC4P_Field := 16#0#; -- unspecified Reserved_14_31 : STM32_SVD.UInt18 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CCER_Register use record CC1E at 0 range 0 .. 0; CC1P at 0 range 1 .. 1; CC1NE at 0 range 2 .. 2; CC1NP at 0 range 3 .. 3; CC2E at 0 range 4 .. 4; CC2P at 0 range 5 .. 5; CC2NE at 0 range 6 .. 6; CC2NP at 0 range 7 .. 7; CC3E at 0 range 8 .. 8; CC3P at 0 range 9 .. 9; CC3NE at 0 range 10 .. 10; CC3NP at 0 range 11 .. 11; CC4E at 0 range 12 .. 12; CC4P at 0 range 13 .. 13; Reserved_14_31 at 0 range 14 .. 31; end record; subtype CNT_CNT_Field is STM32_SVD.UInt16; -- counter type CNT_Register is record -- counter value CNT : CNT_CNT_Field := 16#0#; -- unspecified Reserved_16_31 : STM32_SVD.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CNT_Register use record CNT at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype PSC_PSC_Field is STM32_SVD.UInt16; -- prescaler type PSC_Register is record -- Prescaler value PSC : PSC_PSC_Field := 16#0#; -- unspecified Reserved_16_31 : STM32_SVD.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for PSC_Register use record PSC at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype ARR_ARR_Field is STM32_SVD.UInt16; -- auto-reload register type ARR_Register is record -- Auto-reload value ARR : ARR_ARR_Field := 16#0#; -- unspecified Reserved_16_31 : STM32_SVD.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for ARR_Register use record ARR at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype RCR_REP_Field is STM32_SVD.Byte; -- repetition counter register type RCR_Register is record -- Repetition counter value REP : RCR_REP_Field := 16#0#; -- unspecified Reserved_8_31 : STM32_SVD.UInt24 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for RCR_Register use record REP at 0 range 0 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; subtype CCR1_CCR1_Field is STM32_SVD.UInt16; -- capture/compare register 1 type CCR1_Register is record -- Capture/Compare 1 value CCR1 : CCR1_CCR1_Field := 16#0#; -- unspecified Reserved_16_31 : STM32_SVD.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CCR1_Register use record CCR1 at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype CCR2_CCR2_Field is STM32_SVD.UInt16; -- capture/compare register 2 type CCR2_Register is record -- Capture/Compare 2 value CCR2 : CCR2_CCR2_Field := 16#0#; -- unspecified Reserved_16_31 : STM32_SVD.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CCR2_Register use record CCR2 at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype CCR3_CCR3_Field is STM32_SVD.UInt16; -- capture/compare register 3 type CCR3_Register is record -- Capture/Compare 3 value CCR3 : CCR3_CCR3_Field := 16#0#; -- unspecified Reserved_16_31 : STM32_SVD.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CCR3_Register use record CCR3 at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype CCR4_CCR4_Field is STM32_SVD.UInt16; -- capture/compare register 4 type CCR4_Register is record -- Capture/Compare 3 value CCR4 : CCR4_CCR4_Field := 16#0#; -- unspecified Reserved_16_31 : STM32_SVD.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CCR4_Register use record CCR4 at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype BDTR_DTG_Field is STM32_SVD.Byte; subtype BDTR_LOCK_Field is STM32_SVD.UInt2; subtype BDTR_OSSI_Field is STM32_SVD.Bit; subtype BDTR_OSSR_Field is STM32_SVD.Bit; subtype BDTR_BKE_Field is STM32_SVD.Bit; subtype BDTR_BKP_Field is STM32_SVD.Bit; subtype BDTR_AOE_Field is STM32_SVD.Bit; subtype BDTR_MOE_Field is STM32_SVD.Bit; -- break and dead-time register type BDTR_Register is record -- Dead-time generator setup DTG : BDTR_DTG_Field := 16#0#; -- Lock configuration LOCK : BDTR_LOCK_Field := 16#0#; -- Off-state selection for Idle mode OSSI : BDTR_OSSI_Field := 16#0#; -- Off-state selection for Run mode OSSR : BDTR_OSSR_Field := 16#0#; -- Break enable BKE : BDTR_BKE_Field := 16#0#; -- Break polarity BKP : BDTR_BKP_Field := 16#0#; -- Automatic output enable AOE : BDTR_AOE_Field := 16#0#; -- Main output enable MOE : BDTR_MOE_Field := 16#0#; -- unspecified Reserved_16_31 : STM32_SVD.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for BDTR_Register use record DTG at 0 range 0 .. 7; LOCK at 0 range 8 .. 9; OSSI at 0 range 10 .. 10; OSSR at 0 range 11 .. 11; BKE at 0 range 12 .. 12; BKP at 0 range 13 .. 13; AOE at 0 range 14 .. 14; MOE at 0 range 15 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype DCR_DBA_Field is STM32_SVD.UInt5; subtype DCR_DBL_Field is STM32_SVD.UInt5; -- DMA control register type DCR_Register is record -- DMA base address DBA : DCR_DBA_Field := 16#0#; -- unspecified Reserved_5_7 : STM32_SVD.UInt3 := 16#0#; -- DMA burst length DBL : DCR_DBL_Field := 16#0#; -- unspecified Reserved_13_31 : STM32_SVD.UInt19 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for DCR_Register use record DBA at 0 range 0 .. 4; Reserved_5_7 at 0 range 5 .. 7; DBL at 0 range 8 .. 12; Reserved_13_31 at 0 range 13 .. 31; end record; subtype DMAR_DMAB_Field is STM32_SVD.UInt16; -- DMA address for full transfer type DMAR_Register is record -- DMA register for burst accesses DMAB : DMAR_DMAB_Field := 16#0#; -- unspecified Reserved_16_31 : STM32_SVD.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for DMAR_Register use record DMAB at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; -- control register 2 type CR2_Register_1 is record -- unspecified Reserved_0_2 : STM32_SVD.UInt3 := 16#0#; -- Capture/compare DMA selection CCDS : CR2_CCDS_Field := 16#0#; -- Master mode selection MMS : CR2_MMS_Field := 16#0#; -- TI1 selection TI1S : CR2_TI1S_Field := 16#0#; -- unspecified Reserved_8_31 : STM32_SVD.UInt24 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR2_Register_1 use record Reserved_0_2 at 0 range 0 .. 2; CCDS at 0 range 3 .. 3; MMS at 0 range 4 .. 6; TI1S at 0 range 7 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; -- DMA/Interrupt enable register type DIER_Register_1 is record -- Update interrupt enable UIE : DIER_UIE_Field := 16#0#; -- Capture/Compare 1 interrupt enable CC1IE : DIER_CC1IE_Field := 16#0#; -- Capture/Compare 2 interrupt enable CC2IE : DIER_CC2IE_Field := 16#0#; -- Capture/Compare 3 interrupt enable CC3IE : DIER_CC3IE_Field := 16#0#; -- Capture/Compare 4 interrupt enable CC4IE : DIER_CC4IE_Field := 16#0#; -- unspecified Reserved_5_5 : STM32_SVD.Bit := 16#0#; -- Trigger interrupt enable TIE : DIER_TIE_Field := 16#0#; -- unspecified Reserved_7_7 : STM32_SVD.Bit := 16#0#; -- Update DMA request enable UDE : DIER_UDE_Field := 16#0#; -- Capture/Compare 1 DMA request enable CC1DE : DIER_CC1DE_Field := 16#0#; -- Capture/Compare 2 DMA request enable CC2DE : DIER_CC2DE_Field := 16#0#; -- Capture/Compare 3 DMA request enable CC3DE : DIER_CC3DE_Field := 16#0#; -- Capture/Compare 4 DMA request enable CC4DE : DIER_CC4DE_Field := 16#0#; -- Reserved COMDE : DIER_COMDE_Field := 16#0#; -- Trigger DMA request enable TDE : DIER_TDE_Field := 16#0#; -- unspecified Reserved_15_31 : STM32_SVD.UInt17 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for DIER_Register_1 use record UIE at 0 range 0 .. 0; CC1IE at 0 range 1 .. 1; CC2IE at 0 range 2 .. 2; CC3IE at 0 range 3 .. 3; CC4IE at 0 range 4 .. 4; Reserved_5_5 at 0 range 5 .. 5; TIE at 0 range 6 .. 6; Reserved_7_7 at 0 range 7 .. 7; UDE at 0 range 8 .. 8; CC1DE at 0 range 9 .. 9; CC2DE at 0 range 10 .. 10; CC3DE at 0 range 11 .. 11; CC4DE at 0 range 12 .. 12; COMDE at 0 range 13 .. 13; TDE at 0 range 14 .. 14; Reserved_15_31 at 0 range 15 .. 31; end record; -- status register type SR_Register_1 is record -- Update interrupt flag UIF : SR_UIF_Field := 16#0#; -- Capture/compare 1 interrupt flag CC1IF : SR_CC1IF_Field := 16#0#; -- Capture/Compare 2 interrupt flag CC2IF : SR_CC2IF_Field := 16#0#; -- Capture/Compare 3 interrupt flag CC3IF : SR_CC3IF_Field := 16#0#; -- Capture/Compare 4 interrupt flag CC4IF : SR_CC4IF_Field := 16#0#; -- unspecified Reserved_5_5 : STM32_SVD.Bit := 16#0#; -- Trigger interrupt flag TIF : SR_TIF_Field := 16#0#; -- unspecified Reserved_7_8 : STM32_SVD.UInt2 := 16#0#; -- Capture/Compare 1 overcapture flag CC1OF : SR_CC1OF_Field := 16#0#; -- Capture/compare 2 overcapture flag CC2OF : SR_CC2OF_Field := 16#0#; -- Capture/Compare 3 overcapture flag CC3OF : SR_CC3OF_Field := 16#0#; -- Capture/Compare 4 overcapture flag CC4OF : SR_CC4OF_Field := 16#0#; -- unspecified Reserved_13_31 : STM32_SVD.UInt19 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for SR_Register_1 use record UIF at 0 range 0 .. 0; CC1IF at 0 range 1 .. 1; CC2IF at 0 range 2 .. 2; CC3IF at 0 range 3 .. 3; CC4IF at 0 range 4 .. 4; Reserved_5_5 at 0 range 5 .. 5; TIF at 0 range 6 .. 6; Reserved_7_8 at 0 range 7 .. 8; CC1OF at 0 range 9 .. 9; CC2OF at 0 range 10 .. 10; CC3OF at 0 range 11 .. 11; CC4OF at 0 range 12 .. 12; Reserved_13_31 at 0 range 13 .. 31; end record; -- event generation register type EGR_Register_1 is record -- Write-only. Update generation UG : EGR_UG_Field := 16#0#; -- Write-only. Capture/compare 1 generation CC1G : EGR_CC1G_Field := 16#0#; -- Write-only. Capture/compare 2 generation CC2G : EGR_CC2G_Field := 16#0#; -- Write-only. Capture/compare 3 generation CC3G : EGR_CC3G_Field := 16#0#; -- Write-only. Capture/compare 4 generation CC4G : EGR_CC4G_Field := 16#0#; -- unspecified Reserved_5_5 : STM32_SVD.Bit := 16#0#; -- Write-only. Trigger generation TG : EGR_TG_Field := 16#0#; -- unspecified Reserved_7_31 : STM32_SVD.UInt25 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for EGR_Register_1 use record UG at 0 range 0 .. 0; CC1G at 0 range 1 .. 1; CC2G at 0 range 2 .. 2; CC3G at 0 range 3 .. 3; CC4G at 0 range 4 .. 4; Reserved_5_5 at 0 range 5 .. 5; TG at 0 range 6 .. 6; Reserved_7_31 at 0 range 7 .. 31; end record; subtype CCMR1_Input_IC1PSC_Field is STM32_SVD.UInt2; subtype CCMR1_Input_IC2PSC_Field is STM32_SVD.UInt2; -- capture/compare mode register 1 (input mode) type CCMR1_Input_Register_1 is record -- Capture/Compare 1 selection CC1S : CCMR1_Input_CC1S_Field := 16#0#; -- Input capture 1 prescaler IC1PSC : CCMR1_Input_IC1PSC_Field := 16#0#; -- Input capture 1 filter IC1F : CCMR1_Input_IC1F_Field := 16#0#; -- Capture/compare 2 selection CC2S : CCMR1_Input_CC2S_Field := 16#0#; -- Input capture 2 prescaler IC2PSC : CCMR1_Input_IC2PSC_Field := 16#0#; -- Input capture 2 filter IC2F : CCMR1_Input_IC2F_Field := 16#0#; -- unspecified Reserved_16_31 : STM32_SVD.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CCMR1_Input_Register_1 use record CC1S at 0 range 0 .. 1; IC1PSC at 0 range 2 .. 3; IC1F at 0 range 4 .. 7; CC2S at 0 range 8 .. 9; IC2PSC at 0 range 10 .. 11; IC2F at 0 range 12 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype CCER_CC4NP_Field is STM32_SVD.Bit; -- capture/compare enable register type CCER_Register_1 is record -- Capture/Compare 1 output enable CC1E : CCER_CC1E_Field := 16#0#; -- Capture/Compare 1 output Polarity CC1P : CCER_CC1P_Field := 16#0#; -- unspecified Reserved_2_2 : STM32_SVD.Bit := 16#0#; -- Capture/Compare 1 output Polarity CC1NP : CCER_CC1NP_Field := 16#0#; -- Capture/Compare 2 output enable CC2E : CCER_CC2E_Field := 16#0#; -- Capture/Compare 2 output Polarity CC2P : CCER_CC2P_Field := 16#0#; -- unspecified Reserved_6_6 : STM32_SVD.Bit := 16#0#; -- Capture/Compare 2 output Polarity CC2NP : CCER_CC2NP_Field := 16#0#; -- Capture/Compare 3 output enable CC3E : CCER_CC3E_Field := 16#0#; -- Capture/Compare 3 output Polarity CC3P : CCER_CC3P_Field := 16#0#; -- unspecified Reserved_10_10 : STM32_SVD.Bit := 16#0#; -- Capture/Compare 3 output Polarity CC3NP : CCER_CC3NP_Field := 16#0#; -- Capture/Compare 4 output enable CC4E : CCER_CC4E_Field := 16#0#; -- Capture/Compare 3 output Polarity CC4P : CCER_CC4P_Field := 16#0#; -- unspecified Reserved_14_14 : STM32_SVD.Bit := 16#0#; -- Capture/Compare 4 output Polarity CC4NP : CCER_CC4NP_Field := 16#0#; -- unspecified Reserved_16_31 : STM32_SVD.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CCER_Register_1 use record CC1E at 0 range 0 .. 0; CC1P at 0 range 1 .. 1; Reserved_2_2 at 0 range 2 .. 2; CC1NP at 0 range 3 .. 3; CC2E at 0 range 4 .. 4; CC2P at 0 range 5 .. 5; Reserved_6_6 at 0 range 6 .. 6; CC2NP at 0 range 7 .. 7; CC3E at 0 range 8 .. 8; CC3P at 0 range 9 .. 9; Reserved_10_10 at 0 range 10 .. 10; CC3NP at 0 range 11 .. 11; CC4E at 0 range 12 .. 12; CC4P at 0 range 13 .. 13; Reserved_14_14 at 0 range 14 .. 14; CC4NP at 0 range 15 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; subtype CNT_CNT_L_Field is STM32_SVD.UInt16; subtype CNT_CNT_H_Field is STM32_SVD.UInt16; -- counter type CNT_Register_1 is record -- Low counter value CNT_L : CNT_CNT_L_Field := 16#0#; -- High counter value (TIM2 only) CNT_H : CNT_CNT_H_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CNT_Register_1 use record CNT_L at 0 range 0 .. 15; CNT_H at 0 range 16 .. 31; end record; subtype ARR_ARR_L_Field is STM32_SVD.UInt16; subtype ARR_ARR_H_Field is STM32_SVD.UInt16; -- auto-reload register type ARR_Register_1 is record -- Low Auto-reload value ARR_L : ARR_ARR_L_Field := 16#0#; -- High Auto-reload value (TIM2 only) ARR_H : ARR_ARR_H_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for ARR_Register_1 use record ARR_L at 0 range 0 .. 15; ARR_H at 0 range 16 .. 31; end record; subtype CCR1_CCR1_L_Field is STM32_SVD.UInt16; subtype CCR1_CCR1_H_Field is STM32_SVD.UInt16; -- capture/compare register 1 type CCR1_Register_1 is record -- Low Capture/Compare 1 value CCR1_L : CCR1_CCR1_L_Field := 16#0#; -- High Capture/Compare 1 value (TIM2 only) CCR1_H : CCR1_CCR1_H_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CCR1_Register_1 use record CCR1_L at 0 range 0 .. 15; CCR1_H at 0 range 16 .. 31; end record; subtype CCR2_CCR2_L_Field is STM32_SVD.UInt16; subtype CCR2_CCR2_H_Field is STM32_SVD.UInt16; -- capture/compare register 2 type CCR2_Register_1 is record -- Low Capture/Compare 2 value CCR2_L : CCR2_CCR2_L_Field := 16#0#; -- High Capture/Compare 2 value (TIM2 only) CCR2_H : CCR2_CCR2_H_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CCR2_Register_1 use record CCR2_L at 0 range 0 .. 15; CCR2_H at 0 range 16 .. 31; end record; subtype CCR3_CCR3_L_Field is STM32_SVD.UInt16; subtype CCR3_CCR3_H_Field is STM32_SVD.UInt16; -- capture/compare register 3 type CCR3_Register_1 is record -- Low Capture/Compare value CCR3_L : CCR3_CCR3_L_Field := 16#0#; -- High Capture/Compare value (TIM2 only) CCR3_H : CCR3_CCR3_H_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CCR3_Register_1 use record CCR3_L at 0 range 0 .. 15; CCR3_H at 0 range 16 .. 31; end record; subtype CCR4_CCR4_L_Field is STM32_SVD.UInt16; subtype CCR4_CCR4_H_Field is STM32_SVD.UInt16; -- capture/compare register 4 type CCR4_Register_1 is record -- Low Capture/Compare value CCR4_L : CCR4_CCR4_L_Field := 16#0#; -- High Capture/Compare value (TIM2 only) CCR4_H : CCR4_CCR4_H_Field := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CCR4_Register_1 use record CCR4_L at 0 range 0 .. 15; CCR4_H at 0 range 16 .. 31; end record; subtype DMAR_DMAR_Field is STM32_SVD.UInt16; -- DMA address for full transfer type DMAR_Register_1 is record -- DMA register for burst accesses DMAR : DMAR_DMAR_Field := 16#0#; -- unspecified Reserved_16_31 : STM32_SVD.UInt16 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for DMAR_Register_1 use record DMAR at 0 range 0 .. 15; Reserved_16_31 at 0 range 16 .. 31; end record; -- control register 1 type CR1_Register_1 is record -- Counter enable CEN : CR1_CEN_Field := 16#0#; -- Update disable UDIS : CR1_UDIS_Field := 16#0#; -- Update request source URS : CR1_URS_Field := 16#0#; -- One-pulse mode OPM : CR1_OPM_Field := 16#0#; -- unspecified Reserved_4_6 : STM32_SVD.UInt3 := 16#0#; -- Auto-reload preload enable ARPE : CR1_ARPE_Field := 16#0#; -- unspecified Reserved_8_31 : STM32_SVD.UInt24 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR1_Register_1 use record CEN at 0 range 0 .. 0; UDIS at 0 range 1 .. 1; URS at 0 range 2 .. 2; OPM at 0 range 3 .. 3; Reserved_4_6 at 0 range 4 .. 6; ARPE at 0 range 7 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; -- control register 2 type CR2_Register_2 is record -- unspecified Reserved_0_3 : STM32_SVD.UInt4 := 16#0#; -- Master mode selection MMS : CR2_MMS_Field := 16#0#; -- unspecified Reserved_7_31 : STM32_SVD.UInt25 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR2_Register_2 use record Reserved_0_3 at 0 range 0 .. 3; MMS at 0 range 4 .. 6; Reserved_7_31 at 0 range 7 .. 31; end record; -- DMA/Interrupt enable register type DIER_Register_2 is record -- Update interrupt enable UIE : DIER_UIE_Field := 16#0#; -- unspecified Reserved_1_7 : STM32_SVD.UInt7 := 16#0#; -- Update DMA request enable UDE : DIER_UDE_Field := 16#0#; -- unspecified Reserved_9_31 : STM32_SVD.UInt23 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for DIER_Register_2 use record UIE at 0 range 0 .. 0; Reserved_1_7 at 0 range 1 .. 7; UDE at 0 range 8 .. 8; Reserved_9_31 at 0 range 9 .. 31; end record; -- status register type SR_Register_2 is record -- Update interrupt flag UIF : SR_UIF_Field := 16#0#; -- unspecified Reserved_1_31 : STM32_SVD.UInt31 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for SR_Register_2 use record UIF at 0 range 0 .. 0; Reserved_1_31 at 0 range 1 .. 31; end record; -- event generation register type EGR_Register_2 is record -- Write-only. Update generation UG : EGR_UG_Field := 16#0#; -- unspecified Reserved_1_31 : STM32_SVD.UInt31 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for EGR_Register_2 use record UG at 0 range 0 .. 0; Reserved_1_31 at 0 range 1 .. 31; end record; -- control register 1 type CR1_Register_2 is record -- Counter enable CEN : CR1_CEN_Field := 16#0#; -- Update disable UDIS : CR1_UDIS_Field := 16#0#; -- Update request source URS : CR1_URS_Field := 16#0#; -- unspecified Reserved_3_6 : STM32_SVD.UInt4 := 16#0#; -- Auto-reload preload enable ARPE : CR1_ARPE_Field := 16#0#; -- Clock division CKD : CR1_CKD_Field := 16#0#; -- unspecified Reserved_10_31 : STM32_SVD.UInt22 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR1_Register_2 use record CEN at 0 range 0 .. 0; UDIS at 0 range 1 .. 1; URS at 0 range 2 .. 2; Reserved_3_6 at 0 range 3 .. 6; ARPE at 0 range 7 .. 7; CKD at 0 range 8 .. 9; Reserved_10_31 at 0 range 10 .. 31; end record; -- DMA/Interrupt enable register type DIER_Register_3 is record -- Update interrupt enable UIE : DIER_UIE_Field := 16#0#; -- Capture/Compare 1 interrupt enable CC1IE : DIER_CC1IE_Field := 16#0#; -- unspecified Reserved_2_31 : STM32_SVD.UInt30 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for DIER_Register_3 use record UIE at 0 range 0 .. 0; CC1IE at 0 range 1 .. 1; Reserved_2_31 at 0 range 2 .. 31; end record; -- status register type SR_Register_3 is record -- Update interrupt flag UIF : SR_UIF_Field := 16#0#; -- Capture/compare 1 interrupt flag CC1IF : SR_CC1IF_Field := 16#0#; -- unspecified Reserved_2_8 : STM32_SVD.UInt7 := 16#0#; -- Capture/Compare 1 overcapture flag CC1OF : SR_CC1OF_Field := 16#0#; -- unspecified Reserved_10_31 : STM32_SVD.UInt22 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for SR_Register_3 use record UIF at 0 range 0 .. 0; CC1IF at 0 range 1 .. 1; Reserved_2_8 at 0 range 2 .. 8; CC1OF at 0 range 9 .. 9; Reserved_10_31 at 0 range 10 .. 31; end record; -- event generation register type EGR_Register_3 is record -- Write-only. Update generation UG : EGR_UG_Field := 16#0#; -- Write-only. Capture/compare 1 generation CC1G : EGR_CC1G_Field := 16#0#; -- unspecified Reserved_2_31 : STM32_SVD.UInt30 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for EGR_Register_3 use record UG at 0 range 0 .. 0; CC1G at 0 range 1 .. 1; Reserved_2_31 at 0 range 2 .. 31; end record; -- capture/compare mode register (output mode) type CCMR1_Output_Register_1 is record -- Capture/Compare 1 selection CC1S : CCMR1_Output_CC1S_Field := 16#0#; -- Output compare 1 fast enable OC1FE : CCMR1_Output_OC1FE_Field := 16#0#; -- Output Compare 1 preload enable OC1PE : CCMR1_Output_OC1PE_Field := 16#0#; -- Output Compare 1 mode OC1M : CCMR1_Output_OC1M_Field := 16#0#; -- unspecified Reserved_7_31 : STM32_SVD.UInt25 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CCMR1_Output_Register_1 use record CC1S at 0 range 0 .. 1; OC1FE at 0 range 2 .. 2; OC1PE at 0 range 3 .. 3; OC1M at 0 range 4 .. 6; Reserved_7_31 at 0 range 7 .. 31; end record; -- capture/compare mode register (input mode) type CCMR1_Input_Register_2 is record -- Capture/Compare 1 selection CC1S : CCMR1_Input_CC1S_Field := 16#0#; -- Input capture 1 prescaler IC1PSC : CCMR1_Input_IC1PSC_Field := 16#0#; -- Input capture 1 filter IC1F : CCMR1_Input_IC1F_Field := 16#0#; -- unspecified Reserved_8_31 : STM32_SVD.UInt24 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CCMR1_Input_Register_2 use record CC1S at 0 range 0 .. 1; IC1PSC at 0 range 2 .. 3; IC1F at 0 range 4 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; -- capture/compare enable register type CCER_Register_2 is record -- Capture/Compare 1 output enable CC1E : CCER_CC1E_Field := 16#0#; -- Capture/Compare 1 output Polarity CC1P : CCER_CC1P_Field := 16#0#; -- unspecified Reserved_2_2 : STM32_SVD.Bit := 16#0#; -- Capture/Compare 1 output Polarity CC1NP : CCER_CC1NP_Field := 16#0#; -- unspecified Reserved_4_31 : STM32_SVD.UInt28 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CCER_Register_2 use record CC1E at 0 range 0 .. 0; CC1P at 0 range 1 .. 1; Reserved_2_2 at 0 range 2 .. 2; CC1NP at 0 range 3 .. 3; Reserved_4_31 at 0 range 4 .. 31; end record; subtype OR_RMP_Field is STM32_SVD.UInt2; -- option register type OR_Register is record -- Timer input 1 remap RMP : OR_RMP_Field := 16#0#; -- unspecified Reserved_2_31 : STM32_SVD.UInt30 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for OR_Register use record RMP at 0 range 0 .. 1; Reserved_2_31 at 0 range 2 .. 31; end record; -- control register 1 type CR1_Register_3 is record -- Counter enable CEN : CR1_CEN_Field := 16#0#; -- Update disable UDIS : CR1_UDIS_Field := 16#0#; -- Update request source URS : CR1_URS_Field := 16#0#; -- One-pulse mode OPM : CR1_OPM_Field := 16#0#; -- unspecified Reserved_4_6 : STM32_SVD.UInt3 := 16#0#; -- Auto-reload preload enable ARPE : CR1_ARPE_Field := 16#0#; -- Clock division CKD : CR1_CKD_Field := 16#0#; -- unspecified Reserved_10_31 : STM32_SVD.UInt22 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR1_Register_3 use record CEN at 0 range 0 .. 0; UDIS at 0 range 1 .. 1; URS at 0 range 2 .. 2; OPM at 0 range 3 .. 3; Reserved_4_6 at 0 range 4 .. 6; ARPE at 0 range 7 .. 7; CKD at 0 range 8 .. 9; Reserved_10_31 at 0 range 10 .. 31; end record; -- control register 2 type CR2_Register_3 is record -- Capture/compare preloaded control CCPC : CR2_CCPC_Field := 16#0#; -- unspecified Reserved_1_1 : STM32_SVD.Bit := 16#0#; -- Capture/compare control update selection CCUS : CR2_CCUS_Field := 16#0#; -- Capture/compare DMA selection CCDS : CR2_CCDS_Field := 16#0#; -- Master mode selection MMS : CR2_MMS_Field := 16#0#; -- unspecified Reserved_7_7 : STM32_SVD.Bit := 16#0#; -- Output Idle state 1 OIS1 : CR2_OIS1_Field := 16#0#; -- Output Idle state 1 OIS1N : CR2_OIS1N_Field := 16#0#; -- Output Idle state 2 OIS2 : CR2_OIS2_Field := 16#0#; -- unspecified Reserved_11_31 : STM32_SVD.UInt21 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR2_Register_3 use record CCPC at 0 range 0 .. 0; Reserved_1_1 at 0 range 1 .. 1; CCUS at 0 range 2 .. 2; CCDS at 0 range 3 .. 3; MMS at 0 range 4 .. 6; Reserved_7_7 at 0 range 7 .. 7; OIS1 at 0 range 8 .. 8; OIS1N at 0 range 9 .. 9; OIS2 at 0 range 10 .. 10; Reserved_11_31 at 0 range 11 .. 31; end record; -- slave mode control register type SMCR_Register_1 is record -- Slave mode selection SMS : SMCR_SMS_Field := 16#0#; -- unspecified Reserved_3_3 : STM32_SVD.Bit := 16#0#; -- Trigger selection TS : SMCR_TS_Field := 16#0#; -- Master/Slave mode MSM : SMCR_MSM_Field := 16#0#; -- unspecified Reserved_8_31 : STM32_SVD.UInt24 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for SMCR_Register_1 use record SMS at 0 range 0 .. 2; Reserved_3_3 at 0 range 3 .. 3; TS at 0 range 4 .. 6; MSM at 0 range 7 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; -- DMA/Interrupt enable register type DIER_Register_4 is record -- Update interrupt enable UIE : DIER_UIE_Field := 16#0#; -- Capture/Compare 1 interrupt enable CC1IE : DIER_CC1IE_Field := 16#0#; -- Capture/Compare 2 interrupt enable CC2IE : DIER_CC2IE_Field := 16#0#; -- unspecified Reserved_3_4 : STM32_SVD.UInt2 := 16#0#; -- COM interrupt enable COMIE : DIER_COMIE_Field := 16#0#; -- Trigger interrupt enable TIE : DIER_TIE_Field := 16#0#; -- Break interrupt enable BIE : DIER_BIE_Field := 16#0#; -- Update DMA request enable UDE : DIER_UDE_Field := 16#0#; -- Capture/Compare 1 DMA request enable CC1DE : DIER_CC1DE_Field := 16#0#; -- Capture/Compare 2 DMA request enable CC2DE : DIER_CC2DE_Field := 16#0#; -- unspecified Reserved_11_13 : STM32_SVD.UInt3 := 16#0#; -- Trigger DMA request enable TDE : DIER_TDE_Field := 16#0#; -- unspecified Reserved_15_31 : STM32_SVD.UInt17 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for DIER_Register_4 use record UIE at 0 range 0 .. 0; CC1IE at 0 range 1 .. 1; CC2IE at 0 range 2 .. 2; Reserved_3_4 at 0 range 3 .. 4; COMIE at 0 range 5 .. 5; TIE at 0 range 6 .. 6; BIE at 0 range 7 .. 7; UDE at 0 range 8 .. 8; CC1DE at 0 range 9 .. 9; CC2DE at 0 range 10 .. 10; Reserved_11_13 at 0 range 11 .. 13; TDE at 0 range 14 .. 14; Reserved_15_31 at 0 range 15 .. 31; end record; -- status register type SR_Register_4 is record -- Update interrupt flag UIF : SR_UIF_Field := 16#0#; -- Capture/compare 1 interrupt flag CC1IF : SR_CC1IF_Field := 16#0#; -- Capture/Compare 2 interrupt flag CC2IF : SR_CC2IF_Field := 16#0#; -- unspecified Reserved_3_4 : STM32_SVD.UInt2 := 16#0#; -- COM interrupt flag COMIF : SR_COMIF_Field := 16#0#; -- Trigger interrupt flag TIF : SR_TIF_Field := 16#0#; -- Break interrupt flag BIF : SR_BIF_Field := 16#0#; -- unspecified Reserved_8_8 : STM32_SVD.Bit := 16#0#; -- Capture/Compare 1 overcapture flag CC1OF : SR_CC1OF_Field := 16#0#; -- Capture/compare 2 overcapture flag CC2OF : SR_CC2OF_Field := 16#0#; -- unspecified Reserved_11_31 : STM32_SVD.UInt21 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for SR_Register_4 use record UIF at 0 range 0 .. 0; CC1IF at 0 range 1 .. 1; CC2IF at 0 range 2 .. 2; Reserved_3_4 at 0 range 3 .. 4; COMIF at 0 range 5 .. 5; TIF at 0 range 6 .. 6; BIF at 0 range 7 .. 7; Reserved_8_8 at 0 range 8 .. 8; CC1OF at 0 range 9 .. 9; CC2OF at 0 range 10 .. 10; Reserved_11_31 at 0 range 11 .. 31; end record; -- event generation register type EGR_Register_4 is record -- Write-only. Update generation UG : EGR_UG_Field := 16#0#; -- Write-only. Capture/compare 1 generation CC1G : EGR_CC1G_Field := 16#0#; -- Write-only. Capture/compare 2 generation CC2G : EGR_CC2G_Field := 16#0#; -- unspecified Reserved_3_4 : STM32_SVD.UInt2 := 16#0#; -- Write-only. Capture/Compare control update generation COMG : EGR_COMG_Field := 16#0#; -- Write-only. Trigger generation TG : EGR_TG_Field := 16#0#; -- Write-only. Break generation BG : EGR_BG_Field := 16#0#; -- unspecified Reserved_8_31 : STM32_SVD.UInt24 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for EGR_Register_4 use record UG at 0 range 0 .. 0; CC1G at 0 range 1 .. 1; CC2G at 0 range 2 .. 2; Reserved_3_4 at 0 range 3 .. 4; COMG at 0 range 5 .. 5; TG at 0 range 6 .. 6; BG at 0 range 7 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; -- capture/compare mode register (output mode) type CCMR1_Output_Register_2 is record -- Capture/Compare 1 selection CC1S : CCMR1_Output_CC1S_Field := 16#0#; -- Output Compare 1 fast enable OC1FE : CCMR1_Output_OC1FE_Field := 16#0#; -- Output Compare 1 preload enable OC1PE : CCMR1_Output_OC1PE_Field := 16#0#; -- Output Compare 1 mode OC1M : CCMR1_Output_OC1M_Field := 16#0#; -- unspecified Reserved_7_7 : STM32_SVD.Bit := 16#0#; -- Capture/Compare 2 selection CC2S : CCMR1_Output_CC2S_Field := 16#0#; -- Output Compare 2 fast enable OC2FE : CCMR1_Output_OC2FE_Field := 16#0#; -- Output Compare 2 preload enable OC2PE : CCMR1_Output_OC2PE_Field := 16#0#; -- Output Compare 2 mode OC2M : CCMR1_Output_OC2M_Field := 16#0#; -- unspecified Reserved_15_31 : STM32_SVD.UInt17 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CCMR1_Output_Register_2 use record CC1S at 0 range 0 .. 1; OC1FE at 0 range 2 .. 2; OC1PE at 0 range 3 .. 3; OC1M at 0 range 4 .. 6; Reserved_7_7 at 0 range 7 .. 7; CC2S at 0 range 8 .. 9; OC2FE at 0 range 10 .. 10; OC2PE at 0 range 11 .. 11; OC2M at 0 range 12 .. 14; Reserved_15_31 at 0 range 15 .. 31; end record; -- capture/compare enable register type CCER_Register_3 is record -- Capture/Compare 1 output enable CC1E : CCER_CC1E_Field := 16#0#; -- Capture/Compare 1 output Polarity CC1P : CCER_CC1P_Field := 16#0#; -- Capture/Compare 1 complementary output enable CC1NE : CCER_CC1NE_Field := 16#0#; -- Capture/Compare 1 output Polarity CC1NP : CCER_CC1NP_Field := 16#0#; -- Capture/Compare 2 output enable CC2E : CCER_CC2E_Field := 16#0#; -- Capture/Compare 2 output Polarity CC2P : CCER_CC2P_Field := 16#0#; -- unspecified Reserved_6_6 : STM32_SVD.Bit := 16#0#; -- Capture/Compare 2 output Polarity CC2NP : CCER_CC2NP_Field := 16#0#; -- unspecified Reserved_8_31 : STM32_SVD.UInt24 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CCER_Register_3 use record CC1E at 0 range 0 .. 0; CC1P at 0 range 1 .. 1; CC1NE at 0 range 2 .. 2; CC1NP at 0 range 3 .. 3; CC2E at 0 range 4 .. 4; CC2P at 0 range 5 .. 5; Reserved_6_6 at 0 range 6 .. 6; CC2NP at 0 range 7 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; -- control register 2 type CR2_Register_4 is record -- Capture/compare preloaded control CCPC : CR2_CCPC_Field := 16#0#; -- unspecified Reserved_1_1 : STM32_SVD.Bit := 16#0#; -- Capture/compare control update selection CCUS : CR2_CCUS_Field := 16#0#; -- Capture/compare DMA selection CCDS : CR2_CCDS_Field := 16#0#; -- unspecified Reserved_4_7 : STM32_SVD.UInt4 := 16#0#; -- Output Idle state 1 OIS1 : CR2_OIS1_Field := 16#0#; -- Output Idle state 1 OIS1N : CR2_OIS1N_Field := 16#0#; -- unspecified Reserved_10_31 : STM32_SVD.UInt22 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR2_Register_4 use record CCPC at 0 range 0 .. 0; Reserved_1_1 at 0 range 1 .. 1; CCUS at 0 range 2 .. 2; CCDS at 0 range 3 .. 3; Reserved_4_7 at 0 range 4 .. 7; OIS1 at 0 range 8 .. 8; OIS1N at 0 range 9 .. 9; Reserved_10_31 at 0 range 10 .. 31; end record; -- DMA/Interrupt enable register type DIER_Register_5 is record -- Update interrupt enable UIE : DIER_UIE_Field := 16#0#; -- Capture/Compare 1 interrupt enable CC1IE : DIER_CC1IE_Field := 16#0#; -- unspecified Reserved_2_4 : STM32_SVD.UInt3 := 16#0#; -- COM interrupt enable COMIE : DIER_COMIE_Field := 16#0#; -- Trigger interrupt enable TIE : DIER_TIE_Field := 16#0#; -- Break interrupt enable BIE : DIER_BIE_Field := 16#0#; -- Update DMA request enable UDE : DIER_UDE_Field := 16#0#; -- Capture/Compare 1 DMA request enable CC1DE : DIER_CC1DE_Field := 16#0#; -- unspecified Reserved_10_13 : STM32_SVD.UInt4 := 16#0#; -- Trigger DMA request enable TDE : DIER_TDE_Field := 16#0#; -- unspecified Reserved_15_31 : STM32_SVD.UInt17 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for DIER_Register_5 use record UIE at 0 range 0 .. 0; CC1IE at 0 range 1 .. 1; Reserved_2_4 at 0 range 2 .. 4; COMIE at 0 range 5 .. 5; TIE at 0 range 6 .. 6; BIE at 0 range 7 .. 7; UDE at 0 range 8 .. 8; CC1DE at 0 range 9 .. 9; Reserved_10_13 at 0 range 10 .. 13; TDE at 0 range 14 .. 14; Reserved_15_31 at 0 range 15 .. 31; end record; -- status register type SR_Register_5 is record -- Update interrupt flag UIF : SR_UIF_Field := 16#0#; -- Capture/compare 1 interrupt flag CC1IF : SR_CC1IF_Field := 16#0#; -- unspecified Reserved_2_4 : STM32_SVD.UInt3 := 16#0#; -- COM interrupt flag COMIF : SR_COMIF_Field := 16#0#; -- Trigger interrupt flag TIF : SR_TIF_Field := 16#0#; -- Break interrupt flag BIF : SR_BIF_Field := 16#0#; -- unspecified Reserved_8_8 : STM32_SVD.Bit := 16#0#; -- Capture/Compare 1 overcapture flag CC1OF : SR_CC1OF_Field := 16#0#; -- unspecified Reserved_10_31 : STM32_SVD.UInt22 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for SR_Register_5 use record UIF at 0 range 0 .. 0; CC1IF at 0 range 1 .. 1; Reserved_2_4 at 0 range 2 .. 4; COMIF at 0 range 5 .. 5; TIF at 0 range 6 .. 6; BIF at 0 range 7 .. 7; Reserved_8_8 at 0 range 8 .. 8; CC1OF at 0 range 9 .. 9; Reserved_10_31 at 0 range 10 .. 31; end record; -- event generation register type EGR_Register_5 is record -- Write-only. Update generation UG : EGR_UG_Field := 16#0#; -- Write-only. Capture/compare 1 generation CC1G : EGR_CC1G_Field := 16#0#; -- unspecified Reserved_2_4 : STM32_SVD.UInt3 := 16#0#; -- Write-only. Capture/Compare control update generation COMG : EGR_COMG_Field := 16#0#; -- Write-only. Trigger generation TG : EGR_TG_Field := 16#0#; -- Write-only. Break generation BG : EGR_BG_Field := 16#0#; -- unspecified Reserved_8_31 : STM32_SVD.UInt24 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for EGR_Register_5 use record UG at 0 range 0 .. 0; CC1G at 0 range 1 .. 1; Reserved_2_4 at 0 range 2 .. 4; COMG at 0 range 5 .. 5; TG at 0 range 6 .. 6; BG at 0 range 7 .. 7; Reserved_8_31 at 0 range 8 .. 31; end record; -- capture/compare enable register type CCER_Register_4 is record -- Capture/Compare 1 output enable CC1E : CCER_CC1E_Field := 16#0#; -- Capture/Compare 1 output Polarity CC1P : CCER_CC1P_Field := 16#0#; -- Capture/Compare 1 complementary output enable CC1NE : CCER_CC1NE_Field := 16#0#; -- Capture/Compare 1 output Polarity CC1NP : CCER_CC1NP_Field := 16#0#; -- unspecified Reserved_4_31 : STM32_SVD.UInt28 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CCER_Register_4 use record CC1E at 0 range 0 .. 0; CC1P at 0 range 1 .. 1; CC1NE at 0 range 2 .. 2; CC1NP at 0 range 3 .. 3; Reserved_4_31 at 0 range 4 .. 31; end record; ----------------- -- Peripherals -- ----------------- type TIM1_Disc is ( Output, Input); -- Advanced-timers type TIM1_Peripheral (Discriminent : TIM1_Disc := Output) is record -- control register 1 CR1 : aliased CR1_Register; -- control register 2 CR2 : aliased CR2_Register; -- slave mode control register SMCR : aliased SMCR_Register; -- DMA/Interrupt enable register DIER : aliased DIER_Register; -- status register SR : aliased SR_Register; -- event generation register EGR : aliased EGR_Register; -- capture/compare enable register CCER : aliased CCER_Register; -- counter CNT : aliased CNT_Register; -- prescaler PSC : aliased PSC_Register; -- auto-reload register ARR : aliased ARR_Register; -- repetition counter register RCR : aliased RCR_Register; -- capture/compare register 1 CCR1 : aliased CCR1_Register; -- capture/compare register 2 CCR2 : aliased CCR2_Register; -- capture/compare register 3 CCR3 : aliased CCR3_Register; -- capture/compare register 4 CCR4 : aliased CCR4_Register; -- break and dead-time register BDTR : aliased BDTR_Register; -- DMA control register DCR : aliased DCR_Register; -- DMA address for full transfer DMAR : aliased DMAR_Register; case Discriminent is when Output => -- capture/compare mode register (output mode) CCMR1_Output : aliased CCMR1_Output_Register; -- capture/compare mode register (output mode) CCMR2_Output : aliased CCMR2_Output_Register; when Input => -- capture/compare mode register 1 (input mode) CCMR1_Input : aliased CCMR1_Input_Register; -- capture/compare mode register 2 (input mode) CCMR2_Input : aliased CCMR2_Input_Register; end case; end record with Unchecked_Union, Volatile; for TIM1_Peripheral use record CR1 at 16#0# range 0 .. 31; CR2 at 16#4# range 0 .. 31; SMCR at 16#8# range 0 .. 31; DIER at 16#C# range 0 .. 31; SR at 16#10# range 0 .. 31; EGR at 16#14# range 0 .. 31; CCER at 16#20# range 0 .. 31; CNT at 16#24# range 0 .. 31; PSC at 16#28# range 0 .. 31; ARR at 16#2C# range 0 .. 31; RCR at 16#30# range 0 .. 31; CCR1 at 16#34# range 0 .. 31; CCR2 at 16#38# range 0 .. 31; CCR3 at 16#3C# range 0 .. 31; CCR4 at 16#40# range 0 .. 31; BDTR at 16#44# range 0 .. 31; DCR at 16#48# range 0 .. 31; DMAR at 16#4C# range 0 .. 31; CCMR1_Output at 16#18# range 0 .. 31; CCMR2_Output at 16#1C# range 0 .. 31; CCMR1_Input at 16#18# range 0 .. 31; CCMR2_Input at 16#1C# range 0 .. 31; end record; -- Advanced-timers TIM1_Periph : aliased TIM1_Peripheral with Import, Address => System'To_Address (16#40012C00#); type TIM2_Disc is ( Output, Input); -- General-purpose-timers type TIM2_Peripheral (Discriminent : TIM2_Disc := Output) is record -- control register 1 CR1 : aliased CR1_Register; -- control register 2 CR2 : aliased CR2_Register_1; -- slave mode control register SMCR : aliased SMCR_Register; -- DMA/Interrupt enable register DIER : aliased DIER_Register_1; -- status register SR : aliased SR_Register_1; -- event generation register EGR : aliased EGR_Register_1; -- capture/compare enable register CCER : aliased CCER_Register_1; -- counter CNT : aliased CNT_Register_1; -- prescaler PSC : aliased PSC_Register; -- auto-reload register ARR : aliased ARR_Register_1; -- capture/compare register 1 CCR1 : aliased CCR1_Register_1; -- capture/compare register 2 CCR2 : aliased CCR2_Register_1; -- capture/compare register 3 CCR3 : aliased CCR3_Register_1; -- capture/compare register 4 CCR4 : aliased CCR4_Register_1; -- DMA control register DCR : aliased DCR_Register; -- DMA address for full transfer DMAR : aliased DMAR_Register_1; case Discriminent is when Output => -- capture/compare mode register 1 (output mode) CCMR1_Output : aliased CCMR1_Output_Register; -- capture/compare mode register 2 (output mode) CCMR2_Output : aliased CCMR2_Output_Register; when Input => -- capture/compare mode register 1 (input mode) CCMR1_Input : aliased CCMR1_Input_Register_1; -- capture/compare mode register 2 (input mode) CCMR2_Input : aliased CCMR2_Input_Register; end case; end record with Unchecked_Union, Volatile; for TIM2_Peripheral use record CR1 at 16#0# range 0 .. 31; CR2 at 16#4# range 0 .. 31; SMCR at 16#8# range 0 .. 31; DIER at 16#C# range 0 .. 31; SR at 16#10# range 0 .. 31; EGR at 16#14# range 0 .. 31; CCER at 16#20# range 0 .. 31; CNT at 16#24# range 0 .. 31; PSC at 16#28# range 0 .. 31; ARR at 16#2C# range 0 .. 31; CCR1 at 16#34# range 0 .. 31; CCR2 at 16#38# range 0 .. 31; CCR3 at 16#3C# range 0 .. 31; CCR4 at 16#40# range 0 .. 31; DCR at 16#48# range 0 .. 31; DMAR at 16#4C# range 0 .. 31; CCMR1_Output at 16#18# range 0 .. 31; CCMR2_Output at 16#1C# range 0 .. 31; CCMR1_Input at 16#18# range 0 .. 31; CCMR2_Input at 16#1C# range 0 .. 31; end record; -- General-purpose-timers TIM2_Periph : aliased TIM2_Peripheral with Import, Address => System'To_Address (16#40000000#); -- General-purpose-timers TIM3_Periph : aliased TIM2_Peripheral with Import, Address => System'To_Address (16#40000400#); -- Basic-timers type TIM6_Peripheral is record -- control register 1 CR1 : aliased CR1_Register_1; -- control register 2 CR2 : aliased CR2_Register_2; -- DMA/Interrupt enable register DIER : aliased DIER_Register_2; -- status register SR : aliased SR_Register_2; -- event generation register EGR : aliased EGR_Register_2; -- counter CNT : aliased CNT_Register; -- prescaler PSC : aliased PSC_Register; -- auto-reload register ARR : aliased ARR_Register; end record with Volatile; for TIM6_Peripheral use record CR1 at 16#0# range 0 .. 31; CR2 at 16#4# range 0 .. 31; DIER at 16#C# range 0 .. 31; SR at 16#10# range 0 .. 31; EGR at 16#14# range 0 .. 31; CNT at 16#24# range 0 .. 31; PSC at 16#28# range 0 .. 31; ARR at 16#2C# range 0 .. 31; end record; -- Basic-timers TIM6_Periph : aliased TIM6_Peripheral with Import, Address => System'To_Address (16#40001000#); -- Basic-timers TIM7_Periph : aliased TIM6_Peripheral with Import, Address => System'To_Address (16#40001400#); type TIM14_Disc is ( Output, Input); -- General-purpose-timers type TIM14_Peripheral (Discriminent : TIM14_Disc := Output) is record -- control register 1 CR1 : aliased CR1_Register_2; -- DMA/Interrupt enable register DIER : aliased DIER_Register_3; -- status register SR : aliased SR_Register_3; -- event generation register EGR : aliased EGR_Register_3; -- capture/compare enable register CCER : aliased CCER_Register_2; -- counter CNT : aliased CNT_Register; -- prescaler PSC : aliased PSC_Register; -- auto-reload register ARR : aliased ARR_Register; -- capture/compare register 1 CCR1 : aliased CCR1_Register; -- option register OR_k : aliased OR_Register; case Discriminent is when Output => -- capture/compare mode register (output mode) CCMR1_Output : aliased CCMR1_Output_Register_1; when Input => -- capture/compare mode register (input mode) CCMR1_Input : aliased CCMR1_Input_Register_2; end case; end record with Unchecked_Union, Volatile; for TIM14_Peripheral use record CR1 at 16#0# range 0 .. 31; DIER at 16#C# range 0 .. 31; SR at 16#10# range 0 .. 31; EGR at 16#14# range 0 .. 31; CCER at 16#20# range 0 .. 31; CNT at 16#24# range 0 .. 31; PSC at 16#28# range 0 .. 31; ARR at 16#2C# range 0 .. 31; CCR1 at 16#34# range 0 .. 31; OR_k at 16#50# range 0 .. 31; CCMR1_Output at 16#18# range 0 .. 31; CCMR1_Input at 16#18# range 0 .. 31; end record; -- General-purpose-timers TIM14_Periph : aliased TIM14_Peripheral with Import, Address => System'To_Address (16#40002000#); type TIM15_Disc is ( Output, Input); -- General-purpose-timers type TIM15_Peripheral (Discriminent : TIM15_Disc := Output) is record -- control register 1 CR1 : aliased CR1_Register_3; -- control register 2 CR2 : aliased CR2_Register_3; -- slave mode control register SMCR : aliased SMCR_Register_1; -- DMA/Interrupt enable register DIER : aliased DIER_Register_4; -- status register SR : aliased SR_Register_4; -- event generation register EGR : aliased EGR_Register_4; -- capture/compare enable register CCER : aliased CCER_Register_3; -- counter CNT : aliased CNT_Register; -- prescaler PSC : aliased PSC_Register; -- auto-reload register ARR : aliased ARR_Register; -- repetition counter register RCR : aliased RCR_Register; -- capture/compare register 1 CCR1 : aliased CCR1_Register; -- capture/compare register 2 CCR2 : aliased CCR2_Register; -- break and dead-time register BDTR : aliased BDTR_Register; -- DMA control register DCR : aliased DCR_Register; -- DMA address for full transfer DMAR : aliased DMAR_Register; case Discriminent is when Output => -- capture/compare mode register (output mode) CCMR1_Output : aliased CCMR1_Output_Register_2; when Input => -- capture/compare mode register 1 (input mode) CCMR1_Input : aliased CCMR1_Input_Register_1; end case; end record with Unchecked_Union, Volatile; for TIM15_Peripheral use record CR1 at 16#0# range 0 .. 31; CR2 at 16#4# range 0 .. 31; SMCR at 16#8# range 0 .. 31; DIER at 16#C# range 0 .. 31; SR at 16#10# range 0 .. 31; EGR at 16#14# range 0 .. 31; CCER at 16#20# range 0 .. 31; CNT at 16#24# range 0 .. 31; PSC at 16#28# range 0 .. 31; ARR at 16#2C# range 0 .. 31; RCR at 16#30# range 0 .. 31; CCR1 at 16#34# range 0 .. 31; CCR2 at 16#38# range 0 .. 31; BDTR at 16#44# range 0 .. 31; DCR at 16#48# range 0 .. 31; DMAR at 16#4C# range 0 .. 31; CCMR1_Output at 16#18# range 0 .. 31; CCMR1_Input at 16#18# range 0 .. 31; end record; -- General-purpose-timers TIM15_Periph : aliased TIM15_Peripheral with Import, Address => System'To_Address (16#40014000#); type TIM16_Disc is ( Output, Input); -- General-purpose-timers type TIM16_Peripheral (Discriminent : TIM16_Disc := Output) is record -- control register 1 CR1 : aliased CR1_Register_3; -- control register 2 CR2 : aliased CR2_Register_4; -- DMA/Interrupt enable register DIER : aliased DIER_Register_5; -- status register SR : aliased SR_Register_5; -- event generation register EGR : aliased EGR_Register_5; -- capture/compare enable register CCER : aliased CCER_Register_4; -- counter CNT : aliased CNT_Register; -- prescaler PSC : aliased PSC_Register; -- auto-reload register ARR : aliased ARR_Register; -- repetition counter register RCR : aliased RCR_Register; -- capture/compare register 1 CCR1 : aliased CCR1_Register; -- break and dead-time register BDTR : aliased BDTR_Register; -- DMA control register DCR : aliased DCR_Register; -- DMA address for full transfer DMAR : aliased DMAR_Register; case Discriminent is when Output => -- capture/compare mode register (output mode) CCMR1_Output : aliased CCMR1_Output_Register_1; when Input => -- capture/compare mode register 1 (input mode) CCMR1_Input : aliased CCMR1_Input_Register_2; end case; end record with Unchecked_Union, Volatile; for TIM16_Peripheral use record CR1 at 16#0# range 0 .. 31; CR2 at 16#4# range 0 .. 31; DIER at 16#C# range 0 .. 31; SR at 16#10# range 0 .. 31; EGR at 16#14# range 0 .. 31; CCER at 16#20# range 0 .. 31; CNT at 16#24# range 0 .. 31; PSC at 16#28# range 0 .. 31; ARR at 16#2C# range 0 .. 31; RCR at 16#30# range 0 .. 31; CCR1 at 16#34# range 0 .. 31; BDTR at 16#44# range 0 .. 31; DCR at 16#48# range 0 .. 31; DMAR at 16#4C# range 0 .. 31; CCMR1_Output at 16#18# range 0 .. 31; CCMR1_Input at 16#18# range 0 .. 31; end record; -- General-purpose-timers TIM16_Periph : aliased TIM16_Peripheral with Import, Address => System'To_Address (16#40014400#); -- General-purpose-timers TIM17_Periph : aliased TIM16_Peripheral with Import, Address => System'To_Address (16#40014800#); end STM32_SVD.TIM;
36.032068
66
0.56676
ad624a9adee2c9ee89c4ab6dc6c80b1be02876da
1,559
adb
Ada
source/crypto-md5.adb
ytomino/openssl-ada
efacd262cec28c773e80246319f25ab316d93d81
[ "OpenSSL", "Unlicense" ]
1
2020-09-04T18:05:22.000Z
2020-09-04T18:05:22.000Z
source/crypto-md5.adb
ytomino/openssl-ada
efacd262cec28c773e80246319f25ab316d93d81
[ "OpenSSL", "Unlicense" ]
null
null
null
source/crypto-md5.adb
ytomino/openssl-ada
efacd262cec28c773e80246319f25ab316d93d81
[ "OpenSSL", "Unlicense" ]
null
null
null
with Ada.Unchecked_Conversion; with System; package body Crypto.MD5 is use type C.signed_int; function Initial return Context is begin return Result : Context do if C.openssl.md5.MD5_Init (Result.MD5'Access) = 0 then raise Use_Error; end if; end return; end Initial; procedure Update ( Context : in out MD5.Context; Data : in Ada.Streams.Stream_Element_Array) is pragma Suppress (Index_Check); begin if C.openssl.md5.MD5_Update ( Context.MD5'Access, C.void_const_ptr (Data (Data'First)'Address), Data'Length) = 0 then raise Use_Error; end if; end Update; procedure Update (Context : in out MD5.Context; Data : in String) is pragma Suppress (Index_Check); begin if C.openssl.md5.MD5_Update ( Context.MD5'Access, C.void_const_ptr (Data (Data'First)'Address), Data'Length) = 0 then raise Use_Error; end if; end Update; procedure Final (Context : in out MD5.Context; Digest : out Fingerprint) is function To_Pointer is new Ada.Unchecked_Conversion (System.Address, C.unsigned_char_ptr); begin if C.openssl.md5.MD5_Final ( To_Pointer (Digest (Digest'First)'Address), Context.MD5'Access) = 0 then raise Use_Error; end if; end Final; function Value (S : Message_Digest) return Fingerprint is begin return Result : Fingerprint do Value (S, Result); end return; end Value; function Image (Digest : in Fingerprint) return Message_Digest is begin return Result : Message_Digest do Image (Digest, Result); end return; end Image; end Crypto.MD5;
22.594203
76
0.715202
4b4fa5b7f8024ecfe0f9a9fb2e4feb6039e6cd48
2,968
adb
Ada
Source/stats.adb
XMoose25X/Advanced-Dungeon-Assault
8303d5ca3f5729675e66069ad5e63a9eed480f7c
[ "MIT" ]
1
2021-06-01T03:57:57.000Z
2021-06-01T03:57:57.000Z
Source/stats.adb
XMoose25X/Advanced-Dungeon-Assault
8303d5ca3f5729675e66069ad5e63a9eed480f7c
[ "MIT" ]
null
null
null
Source/stats.adb
XMoose25X/Advanced-Dungeon-Assault
8303d5ca3f5729675e66069ad5e63a9eed480f7c
[ "MIT" ]
null
null
null
with Ada.Text_IO, Ada.Integer_Text_IO, Ada.Numerics.Discrete_Random; use Ada.Text_IO, Ada.Integer_Text_IO; package body stats is Package RNG is new Ada.Numerics.Discrete_Random(Integer); Use RNG; Gen : Generator; Procedure Instantiate is begin Reset(Gen); End Instantiate; function randomRange(to : Integer) return Integer is begin return Random(Gen) mod to + 1; end randomRange; function randomZero(to: Integer) return Integer is begin return Random(Gen) mod to; end randomZero; function "*" (L:Integer; R:Float) return Integer is begin return Integer(Float(L) * R); end "*"; function rand return Integer is begin return RNG.Random(Gen); end rand; Procedure calculateDamage(by, to : in out statType; damage : out integer; ignoreDefense : Boolean := false) is defensePercent : Integer; hit : Integer; begin defensePercent := (100*to.defense)/to.MaxHP; hit := randomRange(200); if (ignoreDefense = false) then damage := by.attack - (defensePercent * by.attack)/100; if damage < 1 then damage := 1; end if; else hit := 200; damage := by.attack; end if; if hit > to.agility then to.HP := to.HP - damage; if to.HP < 0 then to.HP := 0; end if; else damage := 0; end if; end calculateDamage; procedure setStats(obj : in out statType;HP, MG, ATK, DEF, AGT, LV : Integer) is begin obj.Level := LV; obj.HP := HP; obj.MaxHP := HP; obj.Magic := MG; obj.MaxMag := MG; obj.Attack := ATK; obj.Defense := DEF; obj.Agility := AGT; obj.XP := 0; end setStats; Procedure addXP(exp : in integer; stats : in out statType) is xpTilNextLvl : Integer := (50 + (stats.Level * 50)); magicBuffs : Integer; attackBuffs : Integer; defenseBuffs : Integer; currHPpercent : Integer; currMagPercent : Integer; begin stats.XP := stats.XP + exp; magicBuffs := stats.MaxMag - (90 + (stats.Level * 10)); attackBuffs := stats.attack - (stats.Level * 10); defenseBuffs := stats.defense - (stats.Level * 5); loop exit when stats.XP < xpTilNextLvl; stats.Level := stats.Level + 1; stats.XP := stats.XP - xpTilNextLvl; xpTilNextLvl := (50 + (stats.Level * 50)); currHPpercent := (100*stats.HP)/stats.MaxHP; currMagPercent := (100*stats.Magic)/stats.MaxMag; stats.MaxHP := (90 + (stats.Level * 10)); stats.MaxMag := (90 + (stats.Level * 10)); --put(" Magic Buffs:"); --put(magicBuffs); stats.MaxMag := stats.MaxMag + magicBuffs; stats.attack := (stats.Level * 10); --put(" Attack Buffs:"); --put(attackBuffs); stats.attack := stats.attack + attackBuffs; stats.defense := (stats.Level * 5); --put(" Defense Buffs:"); --put(defenseBuffs); stats.defense := stats.defense + defenseBuffs; stats.agility := (stats.Level * 2); stats.HP := (currHPpercent * stats.MaxHP)/100; stats.Magic := (currMagPercent * stats.MaxMag)/100; end loop; end addXP; end stats;
23.555556
111
0.646226
fb67ec981aa60f938b795571fd8d66a476e5db9c
20,859
ads
Ada
arch/ARM/STM32/svd/stm32f7x9/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/stm32f7x9/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/stm32f7x9/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 STM32F7x9.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.745683
70
0.551656
41c1a06d2e62ec56a4dfc85d9728b86e8d583e93
3,659
ads
Ada
source/web/tools/a2js/properties-definitions-variant.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-definitions-variant.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-definitions-variant.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, 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.Definitions.Variant is function Assign (Engine : access Engines.Contexts.Context; Element : Asis.Association; Name : Engines.Text_Property) return League.Strings.Universal_String; end Properties.Definitions.Variant;
63.086207
78
0.415141
4b362fb95ab5aa2c9f56cc21842ac72cde3bff74
2,226
adb
Ada
src/tom/library/sl/ada/oneidstrategy.adb
rewriting/tom
2918e95c78006f08a2a0919ef440413fa5c2342a
[ "BSD-3-Clause" ]
36
2016-02-19T12:09:49.000Z
2022-02-03T13:13:21.000Z
src/tom/library/sl/ada/oneidstrategy.adb
rewriting/tom
2918e95c78006f08a2a0919ef440413fa5c2342a
[ "BSD-3-Clause" ]
null
null
null
src/tom/library/sl/ada/oneidstrategy.adb
rewriting/tom
2918e95c78006f08a2a0919ef440413fa5c2342a
[ "BSD-3-Clause" ]
6
2017-11-30T17:07:10.000Z
2022-03-12T14:46:21.000Z
with VisitablePackage, EnvironmentPackage, VisitFailurePackage; use VisitablePackage, EnvironmentPackage, VisitFailurePackage; package body OneIdStrategy is ---------------------------------------------------------------------------- -- Object implementation ---------------------------------------------------------------------------- overriding function toString(o: OneId) return String is begin return "OneId()"; end; ---------------------------------------------------------------------------- -- Strategy implementation ---------------------------------------------------------------------------- overriding function visitLight(str:access OneId; any: ObjectPtr; intro: access Introspector'Class) return ObjectPtr is childCount : Integer := getChildCount(intro, any); newSubterm : ObjectPtr := null; begin for i in 0..childCount-1 loop newSubterm := visitLight(StrategyPtr(str.arguments(ARG)), getChildAt(intro, any, i), intro); if newSubterm /= getChildAt(intro, any, i) then return setChildAt(intro, any, i, newSubterm); end if; end loop; return any; end; overriding function visit(str: access OneId; intro: access Introspector'Class) return Integer is childCount : Integer := getChildCount(intro, getSubject(str.env.all)); oldSubject : ObjectPtr := null; newSubject : ObjectPtr := null; status : Integer; begin for i in 0..childCount-1 loop down(str.env.all, i+1); oldSubject := getSubject(str.env.all); status := visit(StrategyPtr(str.arguments(ARG)), intro); newSubject := getSubject(str.env.all); if status = EnvironmentPackage.SUCCESS and then oldSubject /= newSubject then up(str.env.all); return status; else upLocal(str.env.all); end if; end loop; return EnvironmentPackage.SUCCESS; end; ---------------------------------------------------------------------------- procedure makeOneId(o : in out OneId; v: StrategyPtr) is begin initSubterm(o,v); end; function newOneId(v: StrategyPtr) return StrategyPtr is id : StrategyPtr := new OneId; begin makeOneId(OneId(id.all), v); return id; end; ---------------------------------------------------------------------------- end OneIdStrategy;
30.916667
108
0.570081
4b7f04689d4fa4fd89bb3a2a39e879faf3d7d77d
574
ads
Ada
tests/tcl-strings-test_data.ads
thindil/tashy2
43fcbadb33c0062b2c8d6138a8238441dec5fd80
[ "Apache-2.0" ]
2
2020-12-09T07:27:07.000Z
2021-10-19T13:31:54.000Z
tests/tcl-strings-test_data.ads
thindil/tashy2
43fcbadb33c0062b2c8d6138a8238441dec5fd80
[ "Apache-2.0" ]
null
null
null
tests/tcl-strings-test_data.ads
thindil/tashy2
43fcbadb33c0062b2c8d6138a8238441dec5fd80
[ "Apache-2.0" ]
null
null
null
-- This package is intended to set up and tear down the test environment. -- Once created by GNATtest, this package will never be overwritten -- automatically. Contents of this package can be modified in any way -- except for sections surrounded by a 'read only' marker. with AUnit.Test_Fixtures; package Tcl.Strings.Test_Data is -- begin read only type Test is new AUnit.Test_Fixtures.Test_Fixture -- end read only with null record; procedure Set_Up(Gnattest_T: in out Test); procedure Tear_Down(Gnattest_T: in out Test); end Tcl.Strings.Test_Data;
30.210526
75
0.756098
4be6794d056d842c5eb5c51ef9b52ad78b80a27a
3,434
adb
Ada
source/nodes/program-nodes-null_statements.adb
optikos/oasis
9f64d46d26d964790d69f9db681c874cfb3bf96d
[ "MIT" ]
null
null
null
source/nodes/program-nodes-null_statements.adb
optikos/oasis
9f64d46d26d964790d69f9db681c874cfb3bf96d
[ "MIT" ]
null
null
null
source/nodes/program-nodes-null_statements.adb
optikos/oasis
9f64d46d26d964790d69f9db681c874cfb3bf96d
[ "MIT" ]
2
2019-09-14T23:18:50.000Z
2019-10-02T10:11:40.000Z
-- Copyright (c) 2019 Maxim Reznik <[email protected]> -- -- SPDX-License-Identifier: MIT -- License-Filename: LICENSE ------------------------------------------------------------- package body Program.Nodes.Null_Statements is function Create (Null_Token : not null Program.Lexical_Elements .Lexical_Element_Access; Semicolon_Token : not null Program.Lexical_Elements .Lexical_Element_Access) return Null_Statement is begin return Result : Null_Statement := (Null_Token => Null_Token, Semicolon_Token => Semicolon_Token, Enclosing_Element => null) do Initialize (Result); end return; end Create; function Create (Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False) return Implicit_Null_Statement is begin return Result : Implicit_Null_Statement := (Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance, Enclosing_Element => null) do Initialize (Result); end return; end Create; overriding function Null_Token (Self : Null_Statement) return not null Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Null_Token; end Null_Token; overriding function Semicolon_Token (Self : Null_Statement) return not null Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Semicolon_Token; end Semicolon_Token; overriding function Is_Part_Of_Implicit (Self : Implicit_Null_Statement) return Boolean is begin return Self.Is_Part_Of_Implicit; end Is_Part_Of_Implicit; overriding function Is_Part_Of_Inherited (Self : Implicit_Null_Statement) return Boolean is begin return Self.Is_Part_Of_Inherited; end Is_Part_Of_Inherited; overriding function Is_Part_Of_Instance (Self : Implicit_Null_Statement) return Boolean is begin return Self.Is_Part_Of_Instance; end Is_Part_Of_Instance; procedure Initialize (Self : aliased in out Base_Null_Statement'Class) is begin null; end Initialize; overriding function Is_Null_Statement_Element (Self : Base_Null_Statement) return Boolean is pragma Unreferenced (Self); begin return True; end Is_Null_Statement_Element; overriding function Is_Statement_Element (Self : Base_Null_Statement) return Boolean is pragma Unreferenced (Self); begin return True; end Is_Statement_Element; overriding procedure Visit (Self : not null access Base_Null_Statement; Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is begin Visitor.Null_Statement (Self); end Visit; overriding function To_Null_Statement_Text (Self : aliased in out Null_Statement) return Program.Elements.Null_Statements.Null_Statement_Text_Access is begin return Self'Unchecked_Access; end To_Null_Statement_Text; overriding function To_Null_Statement_Text (Self : aliased in out Implicit_Null_Statement) return Program.Elements.Null_Statements.Null_Statement_Text_Access is pragma Unreferenced (Self); begin return null; end To_Null_Statement_Text; end Program.Nodes.Null_Statements;
29.101695
79
0.709959
4b9caa05d21ea812aa79f449f102f58be0fe1dc8
25,241
ads
Ada
tools-src/gnu/gcc/gcc/ada/g-awk.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/g-awk.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/g-awk.ads
modern-tomato/tomato
96f09fab4929c6ddde5c9113f1b2476ad37133c4
[ "FSFAP" ]
69
2015-01-02T10:45:56.000Z
2021-09-06T07:52:13.000Z
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- G N A T . A W K -- -- -- -- S p e c -- -- -- -- $Revision$ -- -- -- Copyright (C) 2000-2001 Ada Core Technologies, 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 is maintained by Ada Core Technologies Inc (http://www.gnat.com). -- -- -- ------------------------------------------------------------------------------ -- -- This is an AWK-like unit. It provides an easy interface for parsing one -- or more files containing formatted data. The file can be viewed seen as -- a database where each record is a line and a field is a data element in -- this line. In this implementation an AWK record is a line. This means -- that a record cannot span multiple lines. The operating procedure is to -- read files line by line, with each line being presented to the user of -- the package. The interface provides services to access specific fields -- in the line. Thus it is possible to control actions takn on a line based -- on values of some fields. This can be achieved directly or by registering -- callbacks triggered on programmed conditions. -- -- The state of an AWK run is recorded in an object of type session. -- The following is the procedure for using a session to control an -- AWK run: -- -- 1) Specify which session is to be used. It is possible to use the -- default session or to create a new one by declaring an object of -- type Session_Type. For example: -- -- Computers : Session_Type; -- -- 2) Specify how to cut a line into fields. There are two modes: using -- character fields separators or column width. This is done by using -- Set_Fields_Separators or Set_Fields_Width. For example by: -- -- AWK.Set_Field_Separators (";,", Computers); -- -- or by using iterators' Separators parameter. -- -- 3) Specify which files to parse. This is done with Add_File/Add_Files -- services, or by using the iterators' Filename parameter. For -- example: -- -- AWK.Add_File ("myfile.db", Computers); -- -- 4) Run the AWK session using one of the provided iterators. -- -- Parse -- This is the most automated iterator. You can gain control on -- the session only by registering one or more callbacks (see -- Register). -- -- Get_Line/End_Of_Data -- This is a manual iterator to be used with a loop. You have -- complete control on the session. You can use callbacks but -- this is not required. -- -- For_Every_Line -- This provides a mixture of manual/automated iterator action. -- -- Examples of these three approaches appear below -- -- There is many ways to use this package. The following discussion shows -- three approaches, using the three iterator forms, to using this package. -- All examples will use the following file (computer.db): -- -- Pluton;Windows-NT;Pentium III -- Mars;Linux;Pentium Pro -- Venus;Solaris;Sparc -- Saturn;OS/2;i486 -- Jupiter;MacOS;PPC -- -- 1) Using Parse iterator -- -- Here the first step is to register some action associated to a pattern -- and then to call the Parse iterator (this is the simplest way to use -- this unit). The default session is used here. For example to output the -- second field (the OS) of computer "Saturn". -- -- procedure Action is -- begin -- Put_Line (AWK.Field (2)); -- end Action; -- -- begin -- AWK.Register (1, "Saturn", Action'Access); -- AWK.Parse (";", "computer.db"); -- -- -- 2) Using the Get_Line/End_Of_Data iterator -- -- Here you have full control. For example to do the same as -- above but using a specific session, you could write: -- -- Computer_File : Session_Type; -- -- begin -- AWK.Set_Current (Computer_File); -- AWK.Open (Separators => ";", -- Filename => "computer.db"); -- -- -- Display Saturn OS -- -- while not AWK.End_Of_File loop -- AWK.Get_Line; -- -- if AWK.Field (1) = "Saturn" then -- Put_Line (AWK.Field (2)); -- end if; -- end loop; -- -- AWK.Close (Computer_File); -- -- -- 3) Using For_Every_Line iterator -- -- In this case you use a provided iterator and you pass the procedure -- that must be called for each record. You could code the previous -- example could be coded as follows (using the iterator quick interface -- but without using the current session): -- -- Computer_File : Session_Type; -- -- procedure Action (Quit : in out Boolean) is -- begin -- if AWK.Field (1, Computer_File) = "Saturn" then -- Put_Line (AWK.Field (2, Computer_File)); -- end if; -- end Action; -- -- procedure Look_For_Saturn is -- new AWK.For_Every_Line (Action); -- -- begin -- Look_For_Saturn (Separators => ";", -- Filename => "computer.db", -- Session => Computer_File); -- -- Integer_Text_IO.Put -- (Integer (AWK.NR (Session => Computer_File))); -- Put_Line (" line(s) have been processed."); -- -- You can also use a regular expression for the pattern. Let us output -- the computer name for all computer for which the OS has a character -- O in its name. -- -- Regexp : String := ".*O.*"; -- -- Matcher : Regpat.Pattern_Matcher := Regpat.Compile (Regexp); -- -- procedure Action is -- begin -- Text_IO.Put_Line (AWK.Field (2)); -- end Action; -- -- begin -- AWK.Register (2, Matcher, Action'Unrestricted_Access); -- AWK.Parse (";", "computer.db"); -- with Ada.Finalization; with GNAT.Regpat; package GNAT.AWK is Session_Error : exception; -- Raised when a Session is reused but is not closed. File_Error : exception; -- Raised when there is a file problem (see below). End_Error : exception; -- Raised when an attempt is made to read beyond the end of the last -- file of a session. Field_Error : exception; -- Raised when accessing a field value which does not exist. Data_Error : exception; -- Raised when it is not possible to convert a field value to a specific -- type. type Count is new Natural; type Widths_Set is array (Positive range <>) of Positive; -- Used to store a set of columns widths. Default_Separators : constant String := " " & ASCII.HT; Use_Current : constant String := ""; -- Value used when no separator or filename is specified in iterators. type Session_Type is limited private; -- This is the main exported type. A session is used to keep the state of -- a full AWK run. The state comprises a list of files, the current file, -- the number of line processed, the current line, the number of fields in -- the current line... A default session is provided (see Set_Current, -- Current_Session and Default_Session above). ---------------------------- -- Package initialization -- ---------------------------- -- To be thread safe it is not possible to use the default provided -- session. Each task must used a specific session and specify it -- explicitly for every services. procedure Set_Current (Session : Session_Type); -- Set the session to be used by default. This file will be used when the -- Session parameter in following services is not specified. function Current_Session return Session_Type; -- Returns the session used by default by all services. This is the -- latest session specified by Set_Current service or the session -- provided by default with this implementation. function Default_Session return Session_Type; -- Returns the default session provided by this package. Note that this is -- the session return by Current_Session if Set_Current has not been used. procedure Set_Field_Separators (Separators : String := Default_Separators; Session : Session_Type := Current_Session); -- Set the field separators. Each character in the string is a field -- separator. When a line is read it will be split by field using the -- separators set here. Separators can be changed at any point and in this -- case the current line is split according to the new separators. In the -- special case that Separators is a space and a tabulation -- (Default_Separators), fields are separated by runs of spaces and/or -- tabs. procedure Set_FS (Separators : String := Default_Separators; Session : Session_Type := Current_Session) renames Set_Field_Separators; -- FS is the AWK abbreviation for above service. procedure Set_Field_Widths (Field_Widths : Widths_Set; Session : Session_Type := Current_Session); -- This is another way to split a line by giving the length (in number of -- characters) of each field in a line. Field widths can be changed at any -- point and in this case the current line is split according to the new -- field lengths. A line split with this method must have a length equal or -- greater to the total of the field widths. All characters remaining on -- the line after the latest field are added to a new automatically -- created field. procedure Add_File (Filename : String; Session : Session_Type := Current_Session); -- Add Filename to the list of file to be processed. There is no limit on -- the number of files that can be added. Files are processed in the order -- they have been added (i.e. the filename list is FIFO). If Filename does -- not exist or if it is not readable, File_Error is raised. procedure Add_Files (Directory : String; Filenames : String; Number_Of_Files_Added : out Natural; Session : Session_Type := Current_Session); -- Add all files matching the regular expression Filenames in the specified -- directory to the list of file to be processed. There is no limit on -- the number of files that can be added. Each file is processed in -- the same order they have been added (i.e. the filename list is FIFO). -- The number of files (possibly 0) added is returned in -- Number_Of_Files_Added. ------------------------------------- -- Information about current state -- ------------------------------------- function Number_Of_Fields (Session : Session_Type := Current_Session) return Count; pragma Inline (Number_Of_Fields); -- Returns the number of fields in the current record. It returns 0 when -- no file is being processed. function NF (Session : Session_Type := Current_Session) return Count renames Number_Of_Fields; -- AWK abbreviation for above service. function Number_Of_File_Lines (Session : Session_Type := Current_Session) return Count; pragma Inline (Number_Of_File_Lines); -- Returns the current line number in the processed file. It returns 0 when -- no file is being processed. function FNR (Session : Session_Type := Current_Session) return Count renames Number_Of_File_Lines; -- AWK abbreviation for above service. function Number_Of_Lines (Session : Session_Type := Current_Session) return Count; pragma Inline (Number_Of_Lines); -- Returns the number of line processed until now. This is equal to number -- of line in each already processed file plus FNR. It returns 0 when -- no file is being processed. function NR (Session : Session_Type := Current_Session) return Count renames Number_Of_Lines; -- AWK abbreviation for above service. function Number_Of_Files (Session : Session_Type := Current_Session) return Natural; pragma Inline (Number_Of_Files); -- Returns the number of files associated with Session. This is the total -- number of files added with Add_File and Add_Files services. function File (Session : Session_Type := Current_Session) return String; -- Returns the name of the file being processed. It returns the empty -- string when no file is being processed. --------------------- -- Field accessors -- --------------------- function Field (Rank : Count; Session : Session_Type := Current_Session) return String; -- Returns field number Rank value of the current record. If Rank = 0 it -- returns the current record (i.e. the line as read in the file). It -- raises Field_Error if Rank > NF or if Session is not open. function Field (Rank : Count; Session : Session_Type := Current_Session) return Integer; -- Returns field number Rank value of the current record as an integer. It -- raises Field_Error if Rank > NF or if Session is not open. It -- raises Data_Error if the field value cannot be converted to an integer. function Field (Rank : Count; Session : Session_Type := Current_Session) return Float; -- Returns field number Rank value of the current record as a float. It -- raises Field_Error if Rank > NF or if Session is not open. It -- raises Data_Error if the field value cannot be converted to a float. generic type Discrete is (<>); function Discrete_Field (Rank : Count; Session : Session_Type := Current_Session) return Discrete; -- Returns field number Rank value of the current record as a type -- Discrete. It raises Field_Error if Rank > NF. It raises Data_Error if -- the field value cannot be converted to type Discrete. -------------------- -- Pattern/Action -- -------------------- -- AWK defines rules like "PATTERN { ACTION }". Which means that ACTION -- will be executed if PATTERN match. A pattern in this implementation can -- be a simple string (match function is equality), a regular expression, -- a function returning a boolean. An action is associated to a pattern -- using the Register services. -- -- Each procedure Register will add a rule to the set of rules for the -- session. Rules are examined in the order they have been added. type Pattern_Callback is access function return Boolean; -- This is a pattern function pointer. When it returns True the associated -- action will be called. type Action_Callback is access procedure; -- A simple action pointer type Match_Action_Callback is access procedure (Matches : GNAT.Regpat.Match_Array); -- An advanced action pointer used with a regular expression pattern. It -- returns an array of all the matches. See GNAT.Regpat for further -- information. procedure Register (Field : Count; Pattern : String; Action : Action_Callback; Session : Session_Type := Current_Session); -- Register an Action associated with a Pattern. The pattern here is a -- simple string that must match exactly the field number specified. procedure Register (Field : Count; Pattern : GNAT.Regpat.Pattern_Matcher; Action : Action_Callback; Session : Session_Type := Current_Session); -- Register an Action associated with a Pattern. The pattern here is a -- simple regular expression which must match the field number specified. procedure Register (Field : Count; Pattern : GNAT.Regpat.Pattern_Matcher; Action : Match_Action_Callback; Session : Session_Type := Current_Session); -- Same as above but it pass the set of matches to the action -- procedure. This is useful to analyse further why and where a regular -- expression did match. procedure Register (Pattern : Pattern_Callback; Action : Action_Callback; Session : Session_Type := Current_Session); -- Register an Action associated with a Pattern. The pattern here is a -- function that must return a boolean. Action callback will be called if -- the pattern callback returns True and nothing will happen if it is -- False. This version is more general, the two other register services -- trigger an action based on the value of a single field only. procedure Register (Action : Action_Callback; Session : Session_Type := Current_Session); -- Register an Action that will be called for every line. This is -- equivalent to a Pattern_Callback function always returning True. -------------------- -- Parse iterator -- -------------------- procedure Parse (Separators : String := Use_Current; Filename : String := Use_Current; Session : Session_Type := Current_Session); -- Launch the iterator, it will read every line in all specified -- session's files. Registered callbacks are then called if the associated -- pattern match. It is possible to specify a filename and a set of -- separators directly. This offer a quick way to parse a single -- file. These parameters will override those specified by Set_FS and -- Add_File. The Session will be opened and closed automatically. -- File_Error is raised if there is no file associated with Session, or if -- a file associated with Session is not longer readable. It raises -- Session_Error is Session is already open. ----------------------------------- -- Get_Line/End_Of_Data Iterator -- ----------------------------------- type Callback_Mode is (None, Only, Pass_Through); -- These mode are used for Get_Line/End_Of_Data and For_Every_Line -- iterators. The associated semantic is: -- -- None -- callbacks are not active. This is the default mode for -- Get_Line/End_Of_Data and For_Every_Line iterators. -- -- Only -- callbacks are active, if at least one pattern match, the associated -- action is called and this line will not be passed to the user. In -- the Get_Line case the next line will be read (if there is some -- line remaining), in the For_Every_Line case Action will -- not be called for this line. -- -- Pass_Through -- callbacks are active, for patterns which match the associated -- action is called. Then the line is passed to the user. It means -- that Action procedure is called in the For_Every_Line case and -- that Get_Line returns with the current line active. -- procedure Open (Separators : String := Use_Current; Filename : String := Use_Current; Session : Session_Type := Current_Session); -- Open the first file and initialize the unit. This must be called once -- before using Get_Line. It is possible to specify a filename and a set of -- separators directly. This offer a quick way to parse a single file. -- These parameters will override those specified by Set_FS and Add_File. -- File_Error is raised if there is no file associated with Session, or if -- the first file associated with Session is no longer readable. It raises -- Session_Error is Session is already open. procedure Get_Line (Callbacks : Callback_Mode := None; Session : Session_Type := Current_Session); -- Read a line from the current input file. If the file index is at the -- end of the current input file (i.e. End_Of_File is True) then the -- following file is opened. If there is no more file to be processed, -- exception End_Error will be raised. File_Error will be raised if Open -- has not been called. Next call to Get_Line will return the following -- line in the file. By default the registered callbacks are not called by -- Get_Line, this can activated by setting Callbacks (see Callback_Mode -- description above). File_Error may be raised if a file associated with -- Session is not readable. -- -- When Callbacks is not None, it is possible to exhaust all the lines -- of all the files associated with Session. In this case, File_Error -- is not raised. -- -- This procedure can be used from a subprogram called by procedure Parse -- or by an instantiation of For_Every_Line (see below). function End_Of_Data (Session : Session_Type := Current_Session) return Boolean; pragma Inline (End_Of_Data); -- Returns True if there is no more data to be processed in Session. It -- means that the latest session's file is being processed and that -- there is no more data to be read in this file (End_Of_File is True). function End_Of_File (Session : Session_Type := Current_Session) return Boolean; pragma Inline (End_Of_File); -- Returns True when there is no more data to be processed on the current -- session's file. procedure Close (Session : Session_Type); -- Release all associated data with Session. All memory allocated will -- be freed, the current file will be closed if needed, the callbacks -- will be unregistered. Close is convenient in reestablishing a session -- for new use. Get_Line is no longer usable (will raise File_Error) -- except after a successful call to Open, Parse or an instantiation -- of For_Every_Line. ----------------------------- -- For_Every_Line iterator -- ----------------------------- generic with procedure Action (Quit : in out Boolean); procedure For_Every_Line (Separators : String := Use_Current; Filename : String := Use_Current; Callbacks : Callback_Mode := None; Session : Session_Type := Current_Session); -- This is another iterator. Action will be called for each new -- record. The iterator's termination can be controlled by setting Quit -- to True. It is by default set to False. It is possible to specify a -- filename and a set of separators directly. This offer a quick way to -- parse a single file. These parameters will override those specified by -- Set_FS and Add_File. By default the registered callbacks are not called -- by For_Every_Line, this can activated by setting Callbacks (see -- Callback_Mode description above). The Session will be opened and -- closed automatically. File_Error is raised if there is no file -- associated with Session. It raises Session_Error is Session is already -- open. private type Session_Data; type Session_Data_Access is access Session_Data; type Session_Type is new Ada.Finalization.Limited_Controlled with record Data : Session_Data_Access; end record; procedure Initialize (Session : in out Session_Type); procedure Finalize (Session : in out Session_Type); end GNAT.AWK;
42.926871
79
0.632027
9a2e3b6c909a17dd8b7d2eb989ed60f61e5206f0
6,756
ads
Ada
ada-containers-doubly_linked_lists.ads
mgrojo/adalib
dc1355a5b65c2843e702ac76252addb2caf3c56b
[ "BSD-3-Clause" ]
15
2018-07-08T07:09:19.000Z
2021-11-21T09:58:55.000Z
ada-containers-doubly_linked_lists.ads
mgrojo/adalib
dc1355a5b65c2843e702ac76252addb2caf3c56b
[ "BSD-3-Clause" ]
4
2019-11-17T20:04:33.000Z
2021-08-29T21:24:55.000Z
ada-containers-doubly_linked_lists.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.Iterator_Interfaces; generic type Element_Type is private; with function "=" (Left, Right : Element_Type) return Boolean is <>; package Ada.Containers.Doubly_Linked_Lists is pragma Preelaborate(Doubly_Linked_Lists); pragma Remote_Types(Doubly_Linked_Lists); type List is tagged private with Constant_Indexing => Constant_Reference, Variable_Indexing => Reference, Default_Iterator => Iterate, Iterator_Element => Element_Type; pragma Preelaborable_Initialization(List); type Cursor is private; pragma Preelaborable_Initialization(Cursor); Empty_List : constant List; No_Element : constant Cursor; function Has_Element (Position : Cursor) return Boolean; package List_Iterator_Interfaces is new Ada.Iterator_Interfaces (Cursor, Has_Element); function "=" (Left, Right : List) return Boolean; function Length (Container : List) return Count_Type; function Is_Empty (Container : List) return Boolean; procedure Clear (Container : in out List); function Element (Position : Cursor) return Element_Type; procedure Replace_Element (Container : in out List; Position : in Cursor; New_Item : in Element_Type); procedure Query_Element (Position : in Cursor; Process : not null access procedure (Element : in Element_Type)); procedure Update_Element (Container : in out List; Position : in Cursor; Process : not null access procedure (Element : in out Element_Type)); type Constant_Reference_Type (Element : not null access constant Element_Type) is private with Implicit_Dereference => Element; type Reference_Type (Element : not null access Element_Type) is private with Implicit_Dereference => Element; function Constant_Reference (Container : aliased in List; Position : in Cursor) return Constant_Reference_Type; function Reference (Container : aliased in out List; Position : in Cursor) return Reference_Type; procedure Assign (Target : in out List; Source : in List); function Copy (Source : List) return List; procedure Move (Target : in out List; Source : in out List); procedure Insert (Container : in out List; Before : in Cursor; New_Item : in Element_Type; Count : in Count_Type := 1); procedure Insert (Container : in out List; Before : in Cursor; New_Item : in Element_Type; Position : out Cursor; Count : in Count_Type := 1); procedure Insert (Container : in out List; Before : in Cursor; Position : out Cursor; Count : in Count_Type := 1); procedure Prepend (Container : in out List; New_Item : in Element_Type; Count : in Count_Type := 1); procedure Append (Container : in out List; New_Item : in Element_Type; Count : in Count_Type := 1); procedure Delete (Container : in out List; Position : in out Cursor; Count : in Count_Type := 1); procedure Delete_First (Container : in out List; Count : in Count_Type := 1); procedure Delete_Last (Container : in out List; Count : in Count_Type := 1); procedure Reverse_Elements (Container : in out List); procedure Swap (Container : in out List; I, J : in Cursor); procedure Swap_Links (Container : in out List; I, J : in Cursor); procedure Splice (Target : in out List; Before : in Cursor; Source : in out List); procedure Splice (Target : in out List; Before : in Cursor; Source : in out List; Position : in out Cursor); procedure Splice (Container: in out List; Before : in Cursor; Position : in Cursor); function First (Container : List) return Cursor; function First_Element (Container : List) return Element_Type; function Last (Container : List) return Cursor; function Last_Element (Container : List) return Element_Type; function Next (Position : Cursor) return Cursor; function Previous (Position : Cursor) return Cursor; procedure Next (Position : in out Cursor); procedure Previous (Position : in out Cursor); function Find (Container : List; Item : Element_Type; Position : Cursor := No_Element) return Cursor; function Reverse_Find (Container : List; Item : Element_Type; Position : Cursor := No_Element) return Cursor; function Contains (Container : List; Item : Element_Type) return Boolean; procedure Iterate (Container : in List; Process : not null access procedure (Position : in Cursor)); procedure Reverse_Iterate (Container : in List; Process : not null access procedure (Position : in Cursor)); function Iterate (Container : in List) return List_Iterator_Interfaces.Reversible_Iterator'Class; function Iterate (Container : in List; Start : in Cursor) return List_Iterator_Interfaces.Reversible_Iterator'Class; generic with function "<" (Left, Right : Element_Type) return Boolean is <>; package Generic_Sorting is function Is_Sorted (Container : List) return Boolean; procedure Sort (Container : in out List); procedure Merge (Target : in out List; Source : in out List); end Generic_Sorting; private -- not specified by the language end Ada.Containers.Doubly_Linked_Lists;
32.956098
75
0.587034
ad78d0d0a750a42921dd46861f9edf8d8b26aaa2
3,033
ads
Ada
Ada95/samples/sample-curses_demo-mouse.ads
mvaisakh/android_external_libncurses
d44c8a16d7f1ed276d0de0b3f6f1a5596c5f556f
[ "DOC", "Unlicense" ]
1,167
2017-08-21T21:21:24.000Z
2022-03-31T15:42:10.000Z
Ada95/samples/sample-curses_demo-mouse.ads
thabongshot/ncurses-5.9-mac
8475dcacfcad55dda5e69f3c8d89de0264fc4429
[ "DOC", "Unlicense" ]
374
2015-11-03T12:37:22.000Z
2021-12-17T14:18:08.000Z
Ada95/samples/sample-curses_demo-mouse.ads
thabongshot/ncurses-5.9-mac
8475dcacfcad55dda5e69f3c8d89de0264fc4429
[ "DOC", "Unlicense" ]
96
2015-11-22T07:47:26.000Z
2022-01-20T19:52:19.000Z
------------------------------------------------------------------------------ -- -- -- GNAT ncurses Binding Samples -- -- -- -- Sample.Curses_Demo.Mouse -- -- -- -- S P E C -- -- -- ------------------------------------------------------------------------------ -- Copyright (c) 1998 Free Software Foundation, Inc. -- -- -- -- Permission is hereby granted, free of charge, to any person obtaining a -- -- copy of this software and associated documentation files (the -- -- "Software"), to deal in the Software without restriction, including -- -- without limitation the rights to use, copy, modify, merge, publish, -- -- distribute, distribute with modifications, sublicense, and/or sell -- -- copies of the Software, and to permit persons to whom the Software is -- -- furnished to do so, subject to the following conditions: -- -- -- -- The above copyright notice and this permission notice shall be included -- -- in all copies or substantial portions of the Software. -- -- -- -- THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS -- -- OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF -- -- MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. -- -- IN NO EVENT SHALL THE ABOVE COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, -- -- DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR -- -- OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR -- -- THE USE OR OTHER DEALINGS IN THE SOFTWARE. -- -- -- -- Except as contained in this notice, the name(s) of the above copyright -- -- holders shall not be used in advertising or otherwise to promote the -- -- sale, use or other dealings in this Software without prior written -- -- authorization. -- ------------------------------------------------------------------------------ -- Author: Juergen Pfeifer, 1996 -- Version Control -- $Revision: 1.9 $ -- Binding Version 01.00 ------------------------------------------------------------------------------ package Sample.Curses_Demo.Mouse is procedure Demo; end Sample.Curses_Demo.Mouse;
65.934783
78
0.413782
4b27d227898b9ec78584ef05002374df4d1560be
1,734
adb
Ada
contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/same_component_name/pck.adb
TheSledgeHammer/2.11BSD
fe61f0b9aaa273783cd027c7b5ec77e95ead2153
[ "BSD-3-Clause" ]
3
2021-05-04T17:09:06.000Z
2021-10-04T07:19:26.000Z
contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/same_component_name/pck.adb
TheSledgeHammer/2.11BSD
fe61f0b9aaa273783cd027c7b5ec77e95ead2153
[ "BSD-3-Clause" ]
null
null
null
contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/same_component_name/pck.adb
TheSledgeHammer/2.11BSD
fe61f0b9aaa273783cd027c7b5ec77e95ead2153
[ "BSD-3-Clause" ]
null
null
null
-- Copyright 2010-2020 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 3 of the License, or -- (at your option) any later version. -- -- This program is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program. If not, see <http://www.gnu.org/licenses/>. with System; package body Pck is package body Top is procedure Assign (Obj: in out Top_T; TV : Integer) is begin Do_Nothing (Obj'Address); -- BREAK_TOP end Assign; end Top; package body Middle is procedure Assign (Obj: in out Middle_T; MV : Character) is begin Do_Nothing (Obj'Address); -- BREAK_MIDDLE end Assign; end Middle; procedure Assign (Obj: in out Bottom_T; BV : Float) is begin Do_Nothing (Obj'Address); -- BREAK_BOTTOM end Assign; procedure Do_Nothing (A : System.Address) is begin null; end Do_Nothing; package body Dyn_Top is procedure Assign (Obj: in out Dyn_Top_T; TV : Integer) is begin Do_Nothing (Obj'Address); -- BREAK_DYN_TOP end Assign; end Dyn_Top; package body Dyn_Middle is procedure Assign (Obj: in out Dyn_Middle_T; MV : Character) is begin Do_Nothing (Obj'Address); -- BREAK_DYN_MIDDLE end Assign; end Dyn_Middle; end Pck;
29.896552
73
0.679931
4b148f5b6e7acd4019b08efa69e5b8e265a4a894
8,062
adb
Ada
source/nodes/program-nodes-block_statements.adb
optikos/oasis
9f64d46d26d964790d69f9db681c874cfb3bf96d
[ "MIT" ]
null
null
null
source/nodes/program-nodes-block_statements.adb
optikos/oasis
9f64d46d26d964790d69f9db681c874cfb3bf96d
[ "MIT" ]
null
null
null
source/nodes/program-nodes-block_statements.adb
optikos/oasis
9f64d46d26d964790d69f9db681c874cfb3bf96d
[ "MIT" ]
2
2019-09-14T23:18:50.000Z
2019-10-02T10:11:40.000Z
-- Copyright (c) 2019 Maxim Reznik <[email protected]> -- -- SPDX-License-Identifier: MIT -- License-Filename: LICENSE ------------------------------------------------------------- package body Program.Nodes.Block_Statements is function Create (Statement_Identifier : Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Colon_Token : Program.Lexical_Elements .Lexical_Element_Access; Declare_Token : Program.Lexical_Elements .Lexical_Element_Access; Declarations : Program.Element_Vectors.Element_Vector_Access; Begin_Token : not null Program.Lexical_Elements .Lexical_Element_Access; Statements : not null Program.Element_Vectors .Element_Vector_Access; Exception_Token : Program.Lexical_Elements .Lexical_Element_Access; Exception_Handlers : Program.Elements.Exception_Handlers .Exception_Handler_Vector_Access; End_Token : not null Program.Lexical_Elements .Lexical_Element_Access; End_Statement_Identifier : Program.Elements.Identifiers.Identifier_Access; Semicolon_Token : not null Program.Lexical_Elements .Lexical_Element_Access) return Block_Statement is begin return Result : Block_Statement := (Statement_Identifier => Statement_Identifier, Colon_Token => Colon_Token, Declare_Token => Declare_Token, Declarations => Declarations, Begin_Token => Begin_Token, Statements => Statements, Exception_Token => Exception_Token, Exception_Handlers => Exception_Handlers, End_Token => End_Token, End_Statement_Identifier => End_Statement_Identifier, Semicolon_Token => Semicolon_Token, Enclosing_Element => null) do Initialize (Result); end return; end Create; function Create (Statement_Identifier : Program.Elements.Defining_Identifiers .Defining_Identifier_Access; Declarations : Program.Element_Vectors.Element_Vector_Access; Statements : not null Program.Element_Vectors .Element_Vector_Access; Exception_Handlers : Program.Elements.Exception_Handlers .Exception_Handler_Vector_Access; End_Statement_Identifier : 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_Block_Statement is begin return Result : Implicit_Block_Statement := (Statement_Identifier => Statement_Identifier, Declarations => Declarations, Statements => Statements, Exception_Handlers => Exception_Handlers, End_Statement_Identifier => End_Statement_Identifier, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance, Enclosing_Element => null) do Initialize (Result); end return; end Create; overriding function Statement_Identifier (Self : Base_Block_Statement) return Program.Elements.Defining_Identifiers .Defining_Identifier_Access is begin return Self.Statement_Identifier; end Statement_Identifier; overriding function Declarations (Self : Base_Block_Statement) return Program.Element_Vectors.Element_Vector_Access is begin return Self.Declarations; end Declarations; overriding function Statements (Self : Base_Block_Statement) return not null Program.Element_Vectors.Element_Vector_Access is begin return Self.Statements; end Statements; overriding function Exception_Handlers (Self : Base_Block_Statement) return Program.Elements.Exception_Handlers .Exception_Handler_Vector_Access is begin return Self.Exception_Handlers; end Exception_Handlers; overriding function End_Statement_Identifier (Self : Base_Block_Statement) return Program.Elements.Identifiers.Identifier_Access is begin return Self.End_Statement_Identifier; end End_Statement_Identifier; overriding function Colon_Token (Self : Block_Statement) return Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Colon_Token; end Colon_Token; overriding function Declare_Token (Self : Block_Statement) return Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Declare_Token; end Declare_Token; overriding function Begin_Token (Self : Block_Statement) return not null Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Begin_Token; end Begin_Token; overriding function Exception_Token (Self : Block_Statement) return Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Exception_Token; end Exception_Token; overriding function End_Token (Self : Block_Statement) return not null Program.Lexical_Elements.Lexical_Element_Access is begin return Self.End_Token; end End_Token; overriding function Semicolon_Token (Self : Block_Statement) return not null Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Semicolon_Token; end Semicolon_Token; overriding function Is_Part_Of_Implicit (Self : Implicit_Block_Statement) return Boolean is begin return Self.Is_Part_Of_Implicit; end Is_Part_Of_Implicit; overriding function Is_Part_Of_Inherited (Self : Implicit_Block_Statement) return Boolean is begin return Self.Is_Part_Of_Inherited; end Is_Part_Of_Inherited; overriding function Is_Part_Of_Instance (Self : Implicit_Block_Statement) return Boolean is begin return Self.Is_Part_Of_Instance; end Is_Part_Of_Instance; procedure Initialize (Self : aliased in out Base_Block_Statement'Class) is begin if Self.Statement_Identifier.Assigned then Set_Enclosing_Element (Self.Statement_Identifier, Self'Unchecked_Access); end if; for Item in Self.Declarations.Each_Element loop Set_Enclosing_Element (Item.Element, Self'Unchecked_Access); end loop; for Item in Self.Statements.Each_Element loop Set_Enclosing_Element (Item.Element, Self'Unchecked_Access); end loop; for Item in Self.Exception_Handlers.Each_Element loop Set_Enclosing_Element (Item.Element, Self'Unchecked_Access); end loop; if Self.End_Statement_Identifier.Assigned then Set_Enclosing_Element (Self.End_Statement_Identifier, Self'Unchecked_Access); end if; null; end Initialize; overriding function Is_Block_Statement_Element (Self : Base_Block_Statement) return Boolean is pragma Unreferenced (Self); begin return True; end Is_Block_Statement_Element; overriding function Is_Statement_Element (Self : Base_Block_Statement) return Boolean is pragma Unreferenced (Self); begin return True; end Is_Statement_Element; overriding procedure Visit (Self : not null access Base_Block_Statement; Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is begin Visitor.Block_Statement (Self); end Visit; overriding function To_Block_Statement_Text (Self : aliased in out Block_Statement) return Program.Elements.Block_Statements.Block_Statement_Text_Access is begin return Self'Unchecked_Access; end To_Block_Statement_Text; overriding function To_Block_Statement_Text (Self : aliased in out Implicit_Block_Statement) return Program.Elements.Block_Statements.Block_Statement_Text_Access is pragma Unreferenced (Self); begin return null; end To_Block_Statement_Text; end Program.Nodes.Block_Statements;
34.600858
79
0.718556
040bd5e340d4713e8f48d2f70b0c1a2d73390123
1,969
ads
Ada
.emacs.d/elpa/wisi-2.1.1/wisitoken-bnf-output_elisp_common.ads
caqg/linux-home
eed631aae6f5e59e4f46e14f1dff443abca5fa28
[ "Linux-OpenIB" ]
null
null
null
.emacs.d/elpa/wisi-2.1.1/wisitoken-bnf-output_elisp_common.ads
caqg/linux-home
eed631aae6f5e59e4f46e14f1dff443abca5fa28
[ "Linux-OpenIB" ]
null
null
null
.emacs.d/elpa/wisi-2.1.1/wisitoken-bnf-output_elisp_common.ads
caqg/linux-home
eed631aae6f5e59e4f46e14f1dff443abca5fa28
[ "Linux-OpenIB" ]
null
null
null
-- Abstract : -- -- Subprograms common to Output_Elisp and Output_Ada_Emacs -- -- Copyright (C) 2012, 2013, 2015, 2017, 2018 Free Software Foundation, Inc. -- -- The WisiToken package is free software; you can redistribute it -- and/or modify it under terms of the GNU General Public License as -- published by the Free Software Foundation; either version 3, or -- (at your option) any later version. This library is distributed in -- the hope that it will be useful, but WITHOUT ANY WARRANTY; without -- even the implied warranty of MERCHANTABILITY or FITNESS FOR A -- PARTICULAR PURPOSE. -- -- As a special exception under Section 7 of GPL version 3, you are granted -- additional permissions described in the GCC Runtime Library Exception, -- version 3.1, as published by the Free Software Foundation. pragma License (Modified_GPL); package WisiToken.BNF.Output_Elisp_Common is function Find_Elisp_ID (List : in WisiToken.BNF.String_Lists.List; Elisp_Name : in String) return Integer; function Elisp_Name_To_Ada (Elisp_Name : in String; Append_ID : in Boolean; Trim : in Integer) return String; -- Drop Trim chars from beginning of Elisp_Name, capitalize. procedure Indent_Keyword_Table (Output_File_Root : in String; Label : in String; Keywords : in String_Pair_Lists.List; Image : access function (Name : in Ada.Strings.Unbounded.Unbounded_String) return String); procedure Indent_Token_Table (Output_File_Root : in String; Label : in String; Tokens : in Token_Lists.List; Image : access function (Name : in Ada.Strings.Unbounded.Unbounded_String) return String); procedure Indent_Name_Table (Output_File_Root : in String; Label : in String; Names : in String_Lists.List); end WisiToken.BNF.Output_Elisp_Common;
39.38
109
0.683088
04ae5de6f47e3f45f543bbe2f6f1f8fdeb785566
9,134
adb
Ada
resolver.adb
SMerrony/dgemua
138b09f814c3576e45fe8d25303a6c2329999757
[ "MIT" ]
2
2021-03-26T08:25:38.000Z
2021-06-08T03:10:12.000Z
resolver.adb
SMerrony/dgemua
138b09f814c3576e45fe8d25303a6c2329999757
[ "MIT" ]
null
null
null
resolver.adb
SMerrony/dgemua
138b09f814c3576e45fe8d25303a6c2329999757
[ "MIT" ]
null
null
null
-- MIT License -- Copyright (c) 2021 Stephen Merrony -- 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 Debug_Logs; use Debug_Logs; with Memory; use Memory; package body Resolver is function Resolve_8bit_Disp (CPU : in CPU_T; Indirect : in Boolean; Mode : in Mode_T; Disp15 : in Integer_16) return Phys_Addr_T is Eff : Phys_Addr_T; Ring : Phys_Addr_T := CPU.PC and 16#7000_0000#; Ind_Addr : Word_T; Indirection_Level : Integer := 0; begin if Mode /= Absolute then -- relative mode, sign-extend to 32-bits Eff := Integer_32_To_Phys (Integer_32 (Disp15)); -- Disp15 is already sexted by decoder end if; case Mode is when Absolute => Eff := Phys_Addr_T (Disp15) or Ring; when PC => Eff := Eff + CPU.PC; when AC2 => Eff := Eff + Phys_Addr_T (Integer_32 (CPU.AC (2))); when AC3 => Eff := Eff + Phys_Addr_T (Integer_32 (CPU.AC (3))); end case; if Indirect then Eff := Eff or Ring; Ind_Addr := RAM.Read_Word (Eff); while (Ind_Addr and 16#8000#) /= 0 loop Indirection_Level := Indirection_Level + 1; if Indirection_Level > 15 then raise Indirection_Failure with "Too many levels of indirection"; end if; Ind_Addr := RAM.Read_Word (Phys_Addr_T (Ind_Addr) or Ring); end loop; Eff := Phys_Addr_T (Ind_Addr) or Ring; end if; if not CPU.ATU then -- constrain to 1st 32MB Eff := Eff and 16#01ff_ffff#; end if; return Eff; end Resolve_8bit_Disp; function Resolve_15bit_Disp (CPU : in CPU_T; Indirect : in Boolean; Mode : in Mode_T; Disp15 : in Integer_16; Disp_Offset : in Natural) return Phys_Addr_T is Eff : Phys_Addr_T; Ring : Phys_Addr_T := CPU.PC and 16#7000_0000#; Disp32 : Integer_32; Ind_Addr : Dword_T; Indirection_Level : Integer := 0; begin if Mode /= Absolute then -- relative mode, sign-extend to 32-bits Disp32 := Integer_32(Disp15); -- Disp15 is already sexted by decoder end if; case Mode is when Absolute => -- Zero-extend to 28 bits, force to current ring Eff := (Phys_Addr_T(Disp15) and 16#0000_7fff#) or Ring; when PC => Eff := Integer_32_To_Phys(Integer_32(CPU.PC) + Disp32 + Integer_32(Disp_Offset)); when AC2 => Eff := Phys_Addr_T(Dword_To_Integer_32(CPU.AC(2)) + Disp32) or Ring; when AC3 => Eff := Phys_Addr_T(Dword_To_Integer_32(CPU.AC(3)) + Disp32) or Ring; end case; if Indirect then Eff := Eff or Ring; Loggers.Debug_Print (Debug_Log, "... Indirect addr resolves from : " & Dword_To_String (Dword_T(Eff), Octal, 11, true)); Ind_Addr := RAM.Read_Dword (Eff); while (Ind_Addr and 16#8000_0000#) /= 0 loop Indirection_Level := Indirection_Level + 1; if Indirection_Level > 15 then raise Indirection_Failure with "Too many levels of indirection"; end if; Ind_Addr := RAM.Read_Dword (Phys_Addr_T(Ind_Addr) and 16#7fff_ffff#); Loggers.Debug_Print (Debug_Log, "... Nested Indirect addr resolves to : " & Dword_To_String (Dword_T(Ind_Addr), Octal, 11, true)); end loop; Eff := Phys_Addr_T(Ind_Addr) or Ring; Loggers.Debug_Print (Debug_Log, "... Indirect addr resolves to : " & Dword_To_String (Dword_T(Eff), Octal, 11, true)); end if; if not CPU.ATU then -- constrain to 1st 32MB Eff := Eff and 16#01ff_ffff#; end if; return Eff; end Resolve_15bit_Disp; function Resolve_31bit_Disp (CPU : in CPU_T; Indirect : in Boolean; Mode : in Mode_T; Disp : in Integer_32; Disp_Offset : in Natural) return Phys_Addr_T is Eff : Phys_Addr_T; Ring : Phys_Addr_T := CPU.PC and 16#7000_0000#; Ind_Addr : Dword_T; Indirection_Level : Integer := 0; begin case Mode is when Absolute => -- Zero-extend to 28 bits Eff := Phys_Addr_T(Integer_32_To_Dword(Disp)); -- or Ring; when PC => Eff := Phys_Addr_T(Integer_32_To_Dword(Dword_To_Integer_32(Dword_T(CPU.PC)) + Disp + Integer_32(Disp_Offset))); when AC2 => Eff := Phys_Addr_T(Integer_32_To_Dword(Dword_To_Integer_32(CPU.AC(2)) + Disp)); when AC3 => Eff := Phys_Addr_T(Integer_32_To_Dword(Dword_To_Integer_32(CPU.AC(3)) + Disp)); end case; if Indirect then Eff := Eff or Ring; Ind_Addr := RAM.Read_Dword (Eff); while (Ind_Addr and 16#8000_0000#) /= 0 loop Indirection_Level := Indirection_Level + 1; if Indirection_Level > 15 then raise Indirection_Failure with "Too many levels of indirection"; end if; Ind_Addr := RAM.Read_Dword (Phys_Addr_T(Ind_Addr) and 16#7fff_ffff#); end loop; Eff := Phys_Addr_T(Ind_Addr) or Ring; end if; if not CPU.ATU then -- constrain to 1st 32MB Eff := Eff and 16#01ff_ffff#; end if; return Eff and 16#7fff_ffff#; end Resolve_31bit_Disp; function Resolve_32bit_Indirectable_Addr (ATU : in Boolean; I_Addr : in Dword_T) return Phys_Addr_T is Eff : Dword_T := I_Addr; begin while Test_DW_Bit (Eff, 0) loop Eff := RAM.Read_Dword (Phys_Addr_T (Eff and 16#7fff_ffff#)); end loop; -- if not ATU then -- Eff := Eff and 16#01ff_ffff#; -- end if; return Phys_Addr_T (Eff); end Resolve_32bit_Indirectable_Addr; procedure Resolve_Eagle_Bit_Addr (CPU : in CPU_T; Acd, Acs : in AC_ID; Word_Addr : out Phys_Addr_T; Bit_Num : out Natural) is begin -- TODO handle segments and indirection if Acd = Acs then Word_Addr := CPU.PC and 16#7000_0000#; else if Test_DW_Bit (CPU.AC(Acs), 0) then raise Not_Yet_Implemented with "Indirect 16-bit BIT pointers"; end if; Word_Addr := Phys_Addr_T(CPU.AC(Acs)); end if; Word_Addr := Word_Addr + Phys_Addr_T (Shift_Right (CPU.AC(Acd), 4)); Bit_Num := Natural(CPU.AC(Acd) and 16#000f#); end Resolve_Eagle_Bit_Addr; procedure Resolve_Eclipse_Bit_Addr (CPU : in CPU_T; Acd, Acs : in AC_ID; Word_Addr : out Phys_Addr_T; Bit_Num : out Natural) is begin -- TODO handle segments and indirection if Acd = Acs then Word_Addr := CPU.PC and 16#7000_0000#; else if Test_DW_Bit (CPU.AC(Acs), 0) then raise Not_Yet_Implemented with "Indirect 16-bit BIT pointers"; end if; Word_Addr := Phys_Addr_T(CPU.AC(Acs)) and 16#0000_7fff#; end if; Word_Addr := Word_Addr + Phys_Addr_T (Shift_Right (CPU.AC(Acd), 4)); Bit_Num := Natural(CPU.AC(Acd) and 16#000f#); end Resolve_Eclipse_Bit_Addr; end Resolver;
41.330317
146
0.555069
4b3b442ab7fcc80e4319aa305680ac6a2aed201f
206
adb
Ada
3-mid/opengl/source/platform/egl/private/opengl-surface_profile-privvy.adb
charlie5/lace
e9b7dc751d500ff3f559617a6fc3089ace9dc134
[ "0BSD" ]
20
2015-11-04T09:23:59.000Z
2022-01-14T10:21:42.000Z
3-mid/opengl/source/platform/egl/private/opengl-surface_profile-privvy.adb
charlie5/lace-alire
9ace9682cf4daac7adb9f980c2868d6225b8111c
[ "0BSD" ]
2
2015-11-04T17:05:56.000Z
2015-12-08T03:16:13.000Z
3-mid/opengl/source/platform/egl/private/opengl-surface_profile-privvy.adb
charlie5/lace-alire
9ace9682cf4daac7adb9f980c2868d6225b8111c
[ "0BSD" ]
1
2015-12-07T12:53:52.000Z
2015-12-07T12:53:52.000Z
package body opengl.surface_Profile.privvy is function to_eGL (Self : in Item'Class) return egl.EGLConfig is begin return Self.egl_Config; end to_eGL; end opengl.surface_Profile.privvy;
18.727273
62
0.742718
57350fc746ac08009a28a91eaf75a84210e01e53
9,170
ads
Ada
arch/ARM/STM32/svd/stm32f7x/stm32_svd-pwr.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-pwr.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-pwr.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.PWR is pragma Preelaborate; --------------- -- Registers -- --------------- subtype CR1_PLS_Field is HAL.UInt3; subtype CR1_VOS_Field is HAL.UInt2; subtype CR1_UDEN_Field is HAL.UInt2; -- power control register type CR1_Register is record -- Low-power deep sleep LPDS : Boolean := False; -- Power down deepsleep PDDS : Boolean := False; -- unspecified Reserved_2_2 : HAL.Bit := 16#0#; -- Clear standby flag CSBF : Boolean := False; -- Power voltage detector enable PVDE : Boolean := False; -- PVD level selection PLS : CR1_PLS_Field := 16#0#; -- Disable backup domain write protection DBP : Boolean := False; -- Flash power down in Stop mode FPDS : Boolean := False; -- Low-power regulator in deepsleep under-drive mode LPUDS : Boolean := False; -- Main regulator in deepsleep under-drive mode MRUDS : Boolean := False; -- unspecified Reserved_12_12 : HAL.Bit := 16#0#; -- ADCDC1 ADCDC1 : Boolean := False; -- Regulator voltage scaling output selection VOS : CR1_VOS_Field := 16#3#; -- Over-drive enable ODEN : Boolean := False; -- Over-drive switching enabled ODSWEN : Boolean := False; -- Under-drive enable in stop mode UDEN : CR1_UDEN_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 CR1_Register use record LPDS at 0 range 0 .. 0; PDDS at 0 range 1 .. 1; Reserved_2_2 at 0 range 2 .. 2; CSBF at 0 range 3 .. 3; PVDE at 0 range 4 .. 4; PLS at 0 range 5 .. 7; DBP at 0 range 8 .. 8; FPDS at 0 range 9 .. 9; LPUDS at 0 range 10 .. 10; MRUDS at 0 range 11 .. 11; Reserved_12_12 at 0 range 12 .. 12; ADCDC1 at 0 range 13 .. 13; VOS at 0 range 14 .. 15; ODEN at 0 range 16 .. 16; ODSWEN at 0 range 17 .. 17; UDEN at 0 range 18 .. 19; Reserved_20_31 at 0 range 20 .. 31; end record; subtype CSR1_UDRDY_Field is HAL.UInt2; -- power control/status register type CSR1_Register is record -- Read-only. Wakeup internal flag WUIF : Boolean := False; -- Read-only. Standby flag SBF : Boolean := False; -- Read-only. PVD output PVDO : Boolean := False; -- Read-only. Backup regulator ready BRR : Boolean := False; -- unspecified Reserved_4_8 : HAL.UInt5 := 16#0#; -- Backup regulator enable BRE : Boolean := False; -- unspecified Reserved_10_13 : HAL.UInt4 := 16#0#; -- Regulator voltage scaling output selection ready bit VOSRDY : Boolean := False; -- unspecified Reserved_15_15 : HAL.Bit := 16#0#; -- Over-drive mode ready ODRDY : Boolean := False; -- Over-drive mode switching ready ODSWRDY : Boolean := False; -- Under-drive ready flag UDRDY : CSR1_UDRDY_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 CSR1_Register use record WUIF at 0 range 0 .. 0; SBF at 0 range 1 .. 1; PVDO at 0 range 2 .. 2; BRR at 0 range 3 .. 3; Reserved_4_8 at 0 range 4 .. 8; BRE at 0 range 9 .. 9; Reserved_10_13 at 0 range 10 .. 13; VOSRDY at 0 range 14 .. 14; Reserved_15_15 at 0 range 15 .. 15; ODRDY at 0 range 16 .. 16; ODSWRDY at 0 range 17 .. 17; UDRDY at 0 range 18 .. 19; Reserved_20_31 at 0 range 20 .. 31; end record; -- CR2_CWUPF array type CR2_CWUPF_Field_Array is array (1 .. 6) of Boolean with Component_Size => 1, Size => 6; -- Type definition for CR2_CWUPF type CR2_CWUPF_Field (As_Array : Boolean := False) is record case As_Array is when False => -- CWUPF as a value Val : HAL.UInt6; when True => -- CWUPF as an array Arr : CR2_CWUPF_Field_Array; end case; end record with Unchecked_Union, Size => 6; for CR2_CWUPF_Field use record Val at 0 range 0 .. 5; Arr at 0 range 0 .. 5; end record; -- CR2_WUPP array type CR2_WUPP_Field_Array is array (1 .. 6) of Boolean with Component_Size => 1, Size => 6; -- Type definition for CR2_WUPP type CR2_WUPP_Field (As_Array : Boolean := False) is record case As_Array is when False => -- WUPP as a value Val : HAL.UInt6; when True => -- WUPP as an array Arr : CR2_WUPP_Field_Array; end case; end record with Unchecked_Union, Size => 6; for CR2_WUPP_Field use record Val at 0 range 0 .. 5; Arr at 0 range 0 .. 5; end record; -- power control register type CR2_Register is record -- Read-only. Clear Wakeup Pin flag for PA0 CWUPF : CR2_CWUPF_Field := (As_Array => False, Val => 16#0#); -- unspecified Reserved_6_7 : HAL.UInt2 := 16#0#; -- Wakeup pin polarity bit for PA0 WUPP : CR2_WUPP_Field := (As_Array => False, Val => 16#0#); -- unspecified Reserved_14_31 : HAL.UInt18 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR2_Register use record CWUPF at 0 range 0 .. 5; Reserved_6_7 at 0 range 6 .. 7; WUPP at 0 range 8 .. 13; Reserved_14_31 at 0 range 14 .. 31; end record; -- CSR2_WUPF array type CSR2_WUPF_Field_Array is array (1 .. 6) of Boolean with Component_Size => 1, Size => 6; -- Type definition for CSR2_WUPF type CSR2_WUPF_Field (As_Array : Boolean := False) is record case As_Array is when False => -- WUPF as a value Val : HAL.UInt6; when True => -- WUPF as an array Arr : CSR2_WUPF_Field_Array; end case; end record with Unchecked_Union, Size => 6; for CSR2_WUPF_Field use record Val at 0 range 0 .. 5; Arr at 0 range 0 .. 5; end record; -- CSR2_EWUP array type CSR2_EWUP_Field_Array is array (1 .. 6) of Boolean with Component_Size => 1, Size => 6; -- Type definition for CSR2_EWUP type CSR2_EWUP_Field (As_Array : Boolean := False) is record case As_Array is when False => -- EWUP as a value Val : HAL.UInt6; when True => -- EWUP as an array Arr : CSR2_EWUP_Field_Array; end case; end record with Unchecked_Union, Size => 6; for CSR2_EWUP_Field use record Val at 0 range 0 .. 5; Arr at 0 range 0 .. 5; end record; -- power control/status register type CSR2_Register is record -- Read-only. Wakeup Pin flag for PA0 WUPF : CSR2_WUPF_Field := (As_Array => False, Val => 16#0#); -- unspecified Reserved_6_7 : HAL.UInt2 := 16#0#; -- Enable Wakeup pin for PA0 EWUP : CSR2_EWUP_Field := (As_Array => False, Val => 16#0#); -- unspecified Reserved_14_31 : HAL.UInt18 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CSR2_Register use record WUPF at 0 range 0 .. 5; Reserved_6_7 at 0 range 6 .. 7; EWUP at 0 range 8 .. 13; Reserved_14_31 at 0 range 14 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Power control type PWR_Peripheral is record -- power control register CR1 : aliased CR1_Register; -- power control/status register CSR1 : aliased CSR1_Register; -- power control register CR2 : aliased CR2_Register; -- power control/status register CSR2 : aliased CSR2_Register; end record with Volatile; for PWR_Peripheral use record CR1 at 16#0# range 0 .. 31; CSR1 at 16#4# range 0 .. 31; CR2 at 16#8# range 0 .. 31; CSR2 at 16#C# range 0 .. 31; end record; -- Power control PWR_Periph : aliased PWR_Peripheral with Import, Address => System'To_Address (16#40007000#); end STM32_SVD.PWR;
30.771812
76
0.549073
4bcb53586a40f2b1c7b32319d2ae5e2668c07301
85,512
adb
Ada
tools-src/gnu/gcc/gcc/ada/exp_pakd.adb
modern-tomato/tomato
96f09fab4929c6ddde5c9113f1b2476ad37133c4
[ "FSFAP" ]
80
2015-01-02T10:14:04.000Z
2021-06-07T06:29:49.000Z
tools-src/gnu/gcc/gcc/ada/exp_pakd.adb
modern-tomato/tomato
96f09fab4929c6ddde5c9113f1b2476ad37133c4
[ "FSFAP" ]
9
2015-05-14T11:03:12.000Z
2018-01-04T07:12:58.000Z
tools-src/gnu/gcc/gcc/ada/exp_pakd.adb
modern-tomato/tomato
96f09fab4929c6ddde5c9113f1b2476ad37133c4
[ "FSFAP" ]
69
2015-01-02T10:45:56.000Z
2021-09-06T07:52:13.000Z
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- E X P _ P A K D -- -- -- -- B o d y -- -- -- -- $Revision$ -- -- -- Copyright (C) 1992-2001 Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- -- MA 02111-1307, USA. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Atree; use Atree; with Checks; use Checks; with Einfo; use Einfo; with Exp_Dbug; use Exp_Dbug; with Exp_Util; use Exp_Util; with Nlists; use Nlists; with Nmake; use Nmake; with Opt; use Opt; with Rtsfind; use Rtsfind; with Sem; use Sem; with Sem_Ch8; use Sem_Ch8; with Sem_Ch13; use Sem_Ch13; with Sem_Eval; use Sem_Eval; with Sem_Res; use Sem_Res; with Sem_Util; use Sem_Util; with Sinfo; use Sinfo; with Snames; use Snames; with Stand; use Stand; with Targparm; use Targparm; with Tbuild; use Tbuild; with Ttypes; use Ttypes; with Uintp; use Uintp; package body Exp_Pakd is --------------------------- -- Endian Considerations -- --------------------------- -- As described in the specification, bit numbering in a packed array -- is consistent with bit numbering in a record representation clause, -- and hence dependent on the endianness of the machine: -- For little-endian machines, element zero is at the right hand end -- (low order end) of a bit field. -- For big-endian machines, element zero is at the left hand end -- (high order end) of a bit field. -- The shifts that are used to right justify a field therefore differ -- in the two cases. For the little-endian case, we can simply use the -- bit number (i.e. the element number * element size) as the count for -- a right shift. For the big-endian case, we have to subtract the shift -- count from an appropriate constant to use in the right shift. We use -- rotates instead of shifts (which is necessary in the store case to -- preserve other fields), and we expect that the backend will be able -- to change the right rotate into a left rotate, avoiding the subtract, -- if the architecture provides such an instruction. ---------------------------------------------- -- Entity Tables for Packed Access Routines -- ---------------------------------------------- -- For the cases of component size = 3,5-7,9-15,17-31,33-63 we call -- library routines. This table is used to obtain the entity for the -- proper routine. type E_Array is array (Int range 01 .. 63) of RE_Id; -- Array of Bits_nn entities. Note that we do not use library routines -- for the 8-bit and 16-bit cases, but we still fill in the table, using -- entries from System.Unsigned, because we also use this table for -- certain special unchecked conversions in the big-endian case. Bits_Id : constant E_Array := (01 => RE_Bits_1, 02 => RE_Bits_2, 03 => RE_Bits_03, 04 => RE_Bits_4, 05 => RE_Bits_05, 06 => RE_Bits_06, 07 => RE_Bits_07, 08 => RE_Unsigned_8, 09 => RE_Bits_09, 10 => RE_Bits_10, 11 => RE_Bits_11, 12 => RE_Bits_12, 13 => RE_Bits_13, 14 => RE_Bits_14, 15 => RE_Bits_15, 16 => RE_Unsigned_16, 17 => RE_Bits_17, 18 => RE_Bits_18, 19 => RE_Bits_19, 20 => RE_Bits_20, 21 => RE_Bits_21, 22 => RE_Bits_22, 23 => RE_Bits_23, 24 => RE_Bits_24, 25 => RE_Bits_25, 26 => RE_Bits_26, 27 => RE_Bits_27, 28 => RE_Bits_28, 29 => RE_Bits_29, 30 => RE_Bits_30, 31 => RE_Bits_31, 32 => RE_Unsigned_32, 33 => RE_Bits_33, 34 => RE_Bits_34, 35 => RE_Bits_35, 36 => RE_Bits_36, 37 => RE_Bits_37, 38 => RE_Bits_38, 39 => RE_Bits_39, 40 => RE_Bits_40, 41 => RE_Bits_41, 42 => RE_Bits_42, 43 => RE_Bits_43, 44 => RE_Bits_44, 45 => RE_Bits_45, 46 => RE_Bits_46, 47 => RE_Bits_47, 48 => RE_Bits_48, 49 => RE_Bits_49, 50 => RE_Bits_50, 51 => RE_Bits_51, 52 => RE_Bits_52, 53 => RE_Bits_53, 54 => RE_Bits_54, 55 => RE_Bits_55, 56 => RE_Bits_56, 57 => RE_Bits_57, 58 => RE_Bits_58, 59 => RE_Bits_59, 60 => RE_Bits_60, 61 => RE_Bits_61, 62 => RE_Bits_62, 63 => RE_Bits_63); -- Array of Get routine entities. These are used to obtain an element -- from a packed array. The N'th entry is used to obtain elements from -- a packed array whose component size is N. RE_Null is used as a null -- entry, for the cases where a library routine is not used. Get_Id : constant E_Array := (01 => RE_Null, 02 => RE_Null, 03 => RE_Get_03, 04 => RE_Null, 05 => RE_Get_05, 06 => RE_Get_06, 07 => RE_Get_07, 08 => RE_Null, 09 => RE_Get_09, 10 => RE_Get_10, 11 => RE_Get_11, 12 => RE_Get_12, 13 => RE_Get_13, 14 => RE_Get_14, 15 => RE_Get_15, 16 => RE_Null, 17 => RE_Get_17, 18 => RE_Get_18, 19 => RE_Get_19, 20 => RE_Get_20, 21 => RE_Get_21, 22 => RE_Get_22, 23 => RE_Get_23, 24 => RE_Get_24, 25 => RE_Get_25, 26 => RE_Get_26, 27 => RE_Get_27, 28 => RE_Get_28, 29 => RE_Get_29, 30 => RE_Get_30, 31 => RE_Get_31, 32 => RE_Null, 33 => RE_Get_33, 34 => RE_Get_34, 35 => RE_Get_35, 36 => RE_Get_36, 37 => RE_Get_37, 38 => RE_Get_38, 39 => RE_Get_39, 40 => RE_Get_40, 41 => RE_Get_41, 42 => RE_Get_42, 43 => RE_Get_43, 44 => RE_Get_44, 45 => RE_Get_45, 46 => RE_Get_46, 47 => RE_Get_47, 48 => RE_Get_48, 49 => RE_Get_49, 50 => RE_Get_50, 51 => RE_Get_51, 52 => RE_Get_52, 53 => RE_Get_53, 54 => RE_Get_54, 55 => RE_Get_55, 56 => RE_Get_56, 57 => RE_Get_57, 58 => RE_Get_58, 59 => RE_Get_59, 60 => RE_Get_60, 61 => RE_Get_61, 62 => RE_Get_62, 63 => RE_Get_63); -- Array of Get routine entities to be used in the case where the packed -- array is itself a component of a packed structure, and therefore may -- not be fully aligned. This only affects the even sizes, since for the -- odd sizes, we do not get any fixed alignment in any case. GetU_Id : constant E_Array := (01 => RE_Null, 02 => RE_Null, 03 => RE_Get_03, 04 => RE_Null, 05 => RE_Get_05, 06 => RE_GetU_06, 07 => RE_Get_07, 08 => RE_Null, 09 => RE_Get_09, 10 => RE_GetU_10, 11 => RE_Get_11, 12 => RE_GetU_12, 13 => RE_Get_13, 14 => RE_GetU_14, 15 => RE_Get_15, 16 => RE_Null, 17 => RE_Get_17, 18 => RE_GetU_18, 19 => RE_Get_19, 20 => RE_GetU_20, 21 => RE_Get_21, 22 => RE_GetU_22, 23 => RE_Get_23, 24 => RE_GetU_24, 25 => RE_Get_25, 26 => RE_GetU_26, 27 => RE_Get_27, 28 => RE_GetU_28, 29 => RE_Get_29, 30 => RE_GetU_30, 31 => RE_Get_31, 32 => RE_Null, 33 => RE_Get_33, 34 => RE_GetU_34, 35 => RE_Get_35, 36 => RE_GetU_36, 37 => RE_Get_37, 38 => RE_GetU_38, 39 => RE_Get_39, 40 => RE_GetU_40, 41 => RE_Get_41, 42 => RE_GetU_42, 43 => RE_Get_43, 44 => RE_GetU_44, 45 => RE_Get_45, 46 => RE_GetU_46, 47 => RE_Get_47, 48 => RE_GetU_48, 49 => RE_Get_49, 50 => RE_GetU_50, 51 => RE_Get_51, 52 => RE_GetU_52, 53 => RE_Get_53, 54 => RE_GetU_54, 55 => RE_Get_55, 56 => RE_GetU_56, 57 => RE_Get_57, 58 => RE_GetU_58, 59 => RE_Get_59, 60 => RE_GetU_60, 61 => RE_Get_61, 62 => RE_GetU_62, 63 => RE_Get_63); -- Array of Set routine entities. These are used to assign an element -- of a packed array. The N'th entry is used to assign elements for -- a packed array whose component size is N. RE_Null is used as a null -- entry, for the cases where a library routine is not used. Set_Id : E_Array := (01 => RE_Null, 02 => RE_Null, 03 => RE_Set_03, 04 => RE_Null, 05 => RE_Set_05, 06 => RE_Set_06, 07 => RE_Set_07, 08 => RE_Null, 09 => RE_Set_09, 10 => RE_Set_10, 11 => RE_Set_11, 12 => RE_Set_12, 13 => RE_Set_13, 14 => RE_Set_14, 15 => RE_Set_15, 16 => RE_Null, 17 => RE_Set_17, 18 => RE_Set_18, 19 => RE_Set_19, 20 => RE_Set_20, 21 => RE_Set_21, 22 => RE_Set_22, 23 => RE_Set_23, 24 => RE_Set_24, 25 => RE_Set_25, 26 => RE_Set_26, 27 => RE_Set_27, 28 => RE_Set_28, 29 => RE_Set_29, 30 => RE_Set_30, 31 => RE_Set_31, 32 => RE_Null, 33 => RE_Set_33, 34 => RE_Set_34, 35 => RE_Set_35, 36 => RE_Set_36, 37 => RE_Set_37, 38 => RE_Set_38, 39 => RE_Set_39, 40 => RE_Set_40, 41 => RE_Set_41, 42 => RE_Set_42, 43 => RE_Set_43, 44 => RE_Set_44, 45 => RE_Set_45, 46 => RE_Set_46, 47 => RE_Set_47, 48 => RE_Set_48, 49 => RE_Set_49, 50 => RE_Set_50, 51 => RE_Set_51, 52 => RE_Set_52, 53 => RE_Set_53, 54 => RE_Set_54, 55 => RE_Set_55, 56 => RE_Set_56, 57 => RE_Set_57, 58 => RE_Set_58, 59 => RE_Set_59, 60 => RE_Set_60, 61 => RE_Set_61, 62 => RE_Set_62, 63 => RE_Set_63); -- Array of Set routine entities to be used in the case where the packed -- array is itself a component of a packed structure, and therefore may -- not be fully aligned. This only affects the even sizes, since for the -- odd sizes, we do not get any fixed alignment in any case. SetU_Id : E_Array := (01 => RE_Null, 02 => RE_Null, 03 => RE_Set_03, 04 => RE_Null, 05 => RE_Set_05, 06 => RE_SetU_06, 07 => RE_Set_07, 08 => RE_Null, 09 => RE_Set_09, 10 => RE_SetU_10, 11 => RE_Set_11, 12 => RE_SetU_12, 13 => RE_Set_13, 14 => RE_SetU_14, 15 => RE_Set_15, 16 => RE_Null, 17 => RE_Set_17, 18 => RE_SetU_18, 19 => RE_Set_19, 20 => RE_SetU_20, 21 => RE_Set_21, 22 => RE_SetU_22, 23 => RE_Set_23, 24 => RE_SetU_24, 25 => RE_Set_25, 26 => RE_SetU_26, 27 => RE_Set_27, 28 => RE_SetU_28, 29 => RE_Set_29, 30 => RE_SetU_30, 31 => RE_Set_31, 32 => RE_Null, 33 => RE_Set_33, 34 => RE_SetU_34, 35 => RE_Set_35, 36 => RE_SetU_36, 37 => RE_Set_37, 38 => RE_SetU_38, 39 => RE_Set_39, 40 => RE_SetU_40, 41 => RE_Set_41, 42 => RE_SetU_42, 43 => RE_Set_43, 44 => RE_SetU_44, 45 => RE_Set_45, 46 => RE_SetU_46, 47 => RE_Set_47, 48 => RE_SetU_48, 49 => RE_Set_49, 50 => RE_SetU_50, 51 => RE_Set_51, 52 => RE_SetU_52, 53 => RE_Set_53, 54 => RE_SetU_54, 55 => RE_Set_55, 56 => RE_SetU_56, 57 => RE_Set_57, 58 => RE_SetU_58, 59 => RE_Set_59, 60 => RE_SetU_60, 61 => RE_Set_61, 62 => RE_SetU_62, 63 => RE_Set_63); ----------------------- -- Local Subprograms -- ----------------------- procedure Compute_Linear_Subscript (Atyp : Entity_Id; N : Node_Id; Subscr : out Node_Id); -- Given a constrained array type Atyp, and an indexed component node -- N referencing an array object of this type, build an expression of -- type Standard.Integer representing the zero-based linear subscript -- value. This expression includes any required range checks. procedure Convert_To_PAT_Type (Aexp : Node_Id); -- Given an expression of a packed array type, builds a corresponding -- expression whose type is the implementation type used to represent -- the packed array. Aexp is analyzed and resolved on entry and on exit. function Known_Aligned_Enough (Obj : Node_Id; Csiz : Nat) return Boolean; -- There are two versions of the Set routines, the ones used when the -- object is known to be sufficiently well aligned given the number of -- bits, and the ones used when the object is not known to be aligned. -- This routine is used to determine which set to use. Obj is a reference -- to the object, and Csiz is the component size of the packed array. -- True is returned if the alignment of object is known to be sufficient, -- defined as 1 for odd bit sizes, 4 for bit sizes divisible by 4, and -- 2 otherwise. function Make_Shift_Left (N : Node_Id; S : Node_Id) return Node_Id; -- Build a left shift node, checking for the case of a shift count of zero function Make_Shift_Right (N : Node_Id; S : Node_Id) return Node_Id; -- Build a right shift node, checking for the case of a shift count of zero function RJ_Unchecked_Convert_To (Typ : Entity_Id; Expr : Node_Id) return Node_Id; -- The packed array code does unchecked conversions which in some cases -- may involve non-discrete types with differing sizes. The semantics of -- such conversions is potentially endian dependent, and the effect we -- want here for such a conversion is to do the conversion in size as -- though numeric items are involved, and we extend or truncate on the -- left side. This happens naturally in the little-endian case, but in -- the big endian case we can get left justification, when what we want -- is right justification. This routine does the unchecked conversion in -- a stepwise manner to ensure that it gives the expected result. Hence -- the name (RJ = Right justified). The parameters Typ and Expr are as -- for the case of a normal Unchecked_Convert_To call. procedure Setup_Enumeration_Packed_Array_Reference (N : Node_Id); -- This routine is called in the Get and Set case for arrays that are -- packed but not bit-packed, meaning that they have at least one -- subscript that is of an enumeration type with a non-standard -- representation. This routine modifies the given node to properly -- reference the corresponding packed array type. procedure Setup_Inline_Packed_Array_Reference (N : Node_Id; Atyp : Entity_Id; Obj : in out Node_Id; Cmask : out Uint; Shift : out Node_Id); -- This procedure performs common processing on the N_Indexed_Component -- parameter given as N, whose prefix is a reference to a packed array. -- This is used for the get and set when the component size is 1,2,4 -- or for other component sizes when the packed array type is a modular -- type (i.e. the cases that are handled with inline code). -- -- On entry: -- -- N is the N_Indexed_Component node for the packed array reference -- -- Atyp is the constrained array type (the actual subtype has been -- computed if necessary to obtain the constraints, but this is still -- the original array type, not the Packed_Array_Type value). -- -- Obj is the object which is to be indexed. It is always of type Atyp. -- -- On return: -- -- Obj is the object containing the desired bit field. It is of type -- Unsigned or Long_Long_Unsigned, and is either the entire value, -- for the small static case, or the proper selected byte from the -- array in the large or dynamic case. This node is analyzed and -- resolved on return. -- -- Shift is a node representing the shift count to be used in the -- rotate right instruction that positions the field for access. -- This node is analyzed and resolved on return. -- -- Cmask is a mask corresponding to the width of the component field. -- Its value is 2 ** Csize - 1 (e.g. 2#1111# for component size of 4). -- -- Note: in some cases the call to this routine may generate actions -- (for handling multi-use references and the generation of the packed -- array type on the fly). Such actions are inserted into the tree -- directly using Insert_Action. ------------------------------ -- Compute_Linear_Subcsript -- ------------------------------ procedure Compute_Linear_Subscript (Atyp : Entity_Id; N : Node_Id; Subscr : out Node_Id) is Loc : constant Source_Ptr := Sloc (N); Oldsub : Node_Id; Newsub : Node_Id; Indx : Node_Id; Styp : Entity_Id; begin Subscr := Empty; -- Loop through dimensions Indx := First_Index (Atyp); Oldsub := First (Expressions (N)); while Present (Indx) loop Styp := Etype (Indx); Newsub := Relocate_Node (Oldsub); -- Get expression for the subscript value. First, if Do_Range_Check -- is set on a subscript, then we must do a range check against the -- original bounds (not the bounds of the packed array type). We do -- this by introducing a subtype conversion. if Do_Range_Check (Newsub) and then Etype (Newsub) /= Styp then Newsub := Convert_To (Styp, Newsub); end if; -- Now evolve the expression for the subscript. First convert -- the subscript to be zero based and of an integer type. -- Case of integer type, where we just subtract to get lower bound if Is_Integer_Type (Styp) then -- If length of integer type is smaller than standard integer, -- then we convert to integer first, then do the subtract -- Integer (subscript) - Integer (Styp'First) if Esize (Styp) < Esize (Standard_Integer) then Newsub := Make_Op_Subtract (Loc, Left_Opnd => Convert_To (Standard_Integer, Newsub), Right_Opnd => Convert_To (Standard_Integer, Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Styp, Loc), Attribute_Name => Name_First))); -- For larger integer types, subtract first, then convert to -- integer, this deals with strange long long integer bounds. -- Integer (subscript - Styp'First) else Newsub := Convert_To (Standard_Integer, Make_Op_Subtract (Loc, Left_Opnd => Newsub, Right_Opnd => Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Styp, Loc), Attribute_Name => Name_First))); end if; -- For the enumeration case, we have to use 'Pos to get the value -- to work with before subtracting the lower bound. -- Integer (Styp'Pos (subscr)) - Integer (Styp'Pos (Styp'First)); -- This is not quite right for bizarre cases where the size of the -- enumeration type is > Integer'Size bits due to rep clause ??? else pragma Assert (Is_Enumeration_Type (Styp)); Newsub := Make_Op_Subtract (Loc, Left_Opnd => Convert_To (Standard_Integer, Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Styp, Loc), Attribute_Name => Name_Pos, Expressions => New_List (Newsub))), Right_Opnd => Convert_To (Standard_Integer, Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Styp, Loc), Attribute_Name => Name_Pos, Expressions => New_List ( Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Styp, Loc), Attribute_Name => Name_First))))); end if; Set_Paren_Count (Newsub, 1); -- For the first subscript, we just copy that subscript value if No (Subscr) then Subscr := Newsub; -- Otherwise, we must multiply what we already have by the current -- stride and then add in the new value to the evolving subscript. else Subscr := Make_Op_Add (Loc, Left_Opnd => Make_Op_Multiply (Loc, Left_Opnd => Subscr, Right_Opnd => Make_Attribute_Reference (Loc, Attribute_Name => Name_Range_Length, Prefix => New_Occurrence_Of (Styp, Loc))), Right_Opnd => Newsub); end if; -- Move to next subscript Next_Index (Indx); Next (Oldsub); end loop; end Compute_Linear_Subscript; ------------------------- -- Convert_To_PAT_Type -- ------------------------- -- The PAT is always obtained from the actual subtype procedure Convert_To_PAT_Type (Aexp : Entity_Id) is Act_ST : Entity_Id; begin Convert_To_Actual_Subtype (Aexp); Act_ST := Underlying_Type (Etype (Aexp)); Create_Packed_Array_Type (Act_ST); -- Just replace the etype with the packed array type. This works -- because the expression will not be further analyzed, and Gigi -- considers the two types equivalent in any case. Set_Etype (Aexp, Packed_Array_Type (Act_ST)); end Convert_To_PAT_Type; ------------------------------ -- Create_Packed_Array_Type -- ------------------------------ procedure Create_Packed_Array_Type (Typ : Entity_Id) is Loc : constant Source_Ptr := Sloc (Typ); Ctyp : constant Entity_Id := Component_Type (Typ); Csize : constant Uint := Component_Size (Typ); Ancest : Entity_Id; PB_Type : Entity_Id; Esiz : Uint; Decl : Node_Id; PAT : Entity_Id; Len_Dim : Node_Id; Len_Expr : Node_Id; Len_Bits : Uint; Bits_U1 : Node_Id; PAT_High : Node_Id; Btyp : Entity_Id; Lit : Node_Id; procedure Install_PAT; -- This procedure is called with Decl set to the declaration for the -- packed array type. It creates the type and installs it as required. procedure Set_PB_Type; -- Sets PB_Type to Packed_Bytes{1,2,4} as required by the alignment -- requirements (see documentation in the spec of this package). ----------------- -- Install_PAT -- ----------------- procedure Install_PAT is Pushed_Scope : Boolean := False; begin -- We do not want to put the declaration we have created in the tree -- since it is often hard, and sometimes impossible to find a proper -- place for it (the impossible case arises for a packed array type -- with bounds depending on the discriminant, a declaration cannot -- be put inside the record, and the reference to the discriminant -- cannot be outside the record). -- The solution is to analyze the declaration while temporarily -- attached to the tree at an appropriate point, and then we install -- the resulting type as an Itype in the packed array type field of -- the original type, so that no explicit declaration is required. -- Note: the packed type is created in the scope of its parent -- type. There are at least some cases where the current scope -- is deeper, and so when this is the case, we temporarily reset -- the scope for the definition. This is clearly safe, since the -- first use of the packed array type will be the implicit -- reference from the corresponding unpacked type when it is -- elaborated. if Is_Itype (Typ) then Set_Parent (Decl, Associated_Node_For_Itype (Typ)); else Set_Parent (Decl, Declaration_Node (Typ)); end if; if Scope (Typ) /= Current_Scope then New_Scope (Scope (Typ)); Pushed_Scope := True; end if; Set_Is_Itype (PAT, True); Set_Is_Packed_Array_Type (PAT, True); Analyze (Decl, Suppress => All_Checks); if Pushed_Scope then Pop_Scope; end if; -- Set Esize and RM_Size to the actual size of the packed object -- Do not reset RM_Size if already set, as happens in the case -- of a modular type Set_Esize (PAT, Esiz); if Unknown_RM_Size (PAT) then Set_RM_Size (PAT, Esiz); end if; -- Set remaining fields of packed array type Init_Alignment (PAT); Set_Parent (PAT, Empty); Set_Packed_Array_Type (Typ, PAT); Set_Associated_Node_For_Itype (PAT, Typ); -- We definitely do not want to delay freezing for packed array -- types. This is of particular importance for the itypes that -- are generated for record components depending on discriminants -- where there is no place to put the freeze node. Set_Has_Delayed_Freeze (PAT, False); Set_Has_Delayed_Freeze (Etype (PAT), False); end Install_PAT; ----------------- -- Set_PB_Type -- ----------------- procedure Set_PB_Type is begin -- If the user has specified an explicit alignment for the -- component, take it into account. if Csize <= 2 or else Csize = 4 or else Csize mod 2 /= 0 or else Component_Alignment (Typ) = Calign_Storage_Unit then PB_Type := RTE (RE_Packed_Bytes1); elsif Csize mod 4 /= 0 then PB_Type := RTE (RE_Packed_Bytes2); else PB_Type := RTE (RE_Packed_Bytes4); end if; end Set_PB_Type; -- Start of processing for Create_Packed_Array_Type begin -- If we already have a packed array type, nothing to do if Present (Packed_Array_Type (Typ)) then return; end if; -- If our immediate ancestor subtype is constrained, and it already -- has a packed array type, then just share the same type, since the -- bounds must be the same. if Ekind (Typ) = E_Array_Subtype then Ancest := Ancestor_Subtype (Typ); if Present (Ancest) and then Is_Constrained (Ancest) and then Present (Packed_Array_Type (Ancest)) then Set_Packed_Array_Type (Typ, Packed_Array_Type (Ancest)); return; end if; end if; -- We preset the result type size from the size of the original array -- type, since this size clearly belongs to the packed array type. The -- size of the conceptual unpacked type is always set to unknown. Esiz := Esize (Typ); -- Case of an array where at least one index is of an enumeration -- type with a non-standard representation, but the component size -- is not appropriate for bit packing. This is the case where we -- have Is_Packed set (we would never be in this unit otherwise), -- but Is_Bit_Packed_Array is false. -- Note that if the component size is appropriate for bit packing, -- then the circuit for the computation of the subscript properly -- deals with the non-standard enumeration type case by taking the -- Pos anyway. if not Is_Bit_Packed_Array (Typ) then -- Here we build a declaration: -- type tttP is array (index1, index2, ...) of component_type -- where index1, index2, are the index types. These are the same -- as the index types of the original array, except for the non- -- standard representation enumeration type case, where we have -- two subcases. -- For the unconstrained array case, we use -- Natural range <> -- For the constrained case, we use -- Natural range Enum_Type'Pos (Enum_Type'First) .. -- Enum_Type'Pos (Enum_Type'Last); PAT := Make_Defining_Identifier (Loc, Chars => New_External_Name (Chars (Typ), 'P')); Set_Packed_Array_Type (Typ, PAT); declare Indexes : List_Id := New_List; Indx : Node_Id; Indx_Typ : Entity_Id; Enum_Case : Boolean; Typedef : Node_Id; begin Indx := First_Index (Typ); while Present (Indx) loop Indx_Typ := Etype (Indx); Enum_Case := Is_Enumeration_Type (Indx_Typ) and then Has_Non_Standard_Rep (Indx_Typ); -- Unconstrained case if not Is_Constrained (Typ) then if Enum_Case then Indx_Typ := Standard_Natural; end if; Append_To (Indexes, New_Occurrence_Of (Indx_Typ, Loc)); -- Constrained case else if not Enum_Case then Append_To (Indexes, New_Occurrence_Of (Indx_Typ, Loc)); else Append_To (Indexes, Make_Subtype_Indication (Loc, Subtype_Mark => New_Occurrence_Of (Standard_Natural, Loc), Constraint => Make_Range_Constraint (Loc, Range_Expression => Make_Range (Loc, Low_Bound => Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Indx_Typ, Loc), Attribute_Name => Name_Pos, Expressions => New_List ( Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Indx_Typ, Loc), Attribute_Name => Name_First))), High_Bound => Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Indx_Typ, Loc), Attribute_Name => Name_Pos, Expressions => New_List ( Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Indx_Typ, Loc), Attribute_Name => Name_Last))))))); end if; end if; Next_Index (Indx); end loop; if not Is_Constrained (Typ) then Typedef := Make_Unconstrained_Array_Definition (Loc, Subtype_Marks => Indexes, Subtype_Indication => New_Occurrence_Of (Ctyp, Loc)); else Typedef := Make_Constrained_Array_Definition (Loc, Discrete_Subtype_Definitions => Indexes, Subtype_Indication => New_Occurrence_Of (Ctyp, Loc)); end if; Decl := Make_Full_Type_Declaration (Loc, Defining_Identifier => PAT, Type_Definition => Typedef); end; Install_PAT; return; -- Case of bit-packing required for unconstrained array. We simply -- use Packed_Bytes{1,2,4} as appropriate, and we do not need to -- construct a special packed array type. elsif not Is_Constrained (Typ) then Set_PB_Type; Set_Packed_Array_Type (Typ, PB_Type); Set_Is_Packed_Array_Type (Packed_Array_Type (Typ), True); return; -- Remaining code is for the case of bit-packing for constrained array -- The name of the packed array subtype is -- ttt___Xsss -- where sss is the component size in bits and ttt is the name of -- the parent packed type. else PAT := Make_Defining_Identifier (Loc, Chars => Make_Packed_Array_Type_Name (Typ, Csize)); Set_Packed_Array_Type (Typ, PAT); -- Build an expression for the length of the array in bits. -- This is the product of the length of each of the dimensions declare J : Nat := 1; begin Len_Expr := Empty; -- suppress junk warning loop Len_Dim := Make_Attribute_Reference (Loc, Attribute_Name => Name_Length, Prefix => New_Occurrence_Of (Typ, Loc), Expressions => New_List ( Make_Integer_Literal (Loc, J))); if J = 1 then Len_Expr := Len_Dim; else Len_Expr := Make_Op_Multiply (Loc, Left_Opnd => Len_Expr, Right_Opnd => Len_Dim); end if; J := J + 1; exit when J > Number_Dimensions (Typ); end loop; end; -- Temporarily attach the length expression to the tree and analyze -- and resolve it, so that we can test its value. We assume that the -- total length fits in type Integer. Set_Parent (Len_Expr, Typ); Analyze_And_Resolve (Len_Expr, Standard_Integer); -- Use a modular type if possible. We can do this if we are we -- have static bounds, and the length is small enough, and the -- length is not zero. We exclude the zero length case because the -- size of things is always at least one, and the zero length object -- would have an anomous size if Compile_Time_Known_Value (Len_Expr) then Len_Bits := Expr_Value (Len_Expr) * Csize; -- We normally consider small enough to mean no larger than the -- value of System_Max_Binary_Modulus_Power, except that in -- No_Run_Time mode, we use the Word Size on machines for -- which double length shifts are not generated in line. if Len_Bits > 0 and then (Len_Bits <= System_Word_Size or else (Len_Bits <= System_Max_Binary_Modulus_Power and then (not No_Run_Time or else Long_Shifts_Inlined_On_Target))) then -- We can use the modular type, it has the form: -- subtype tttPn is btyp -- range 0 .. 2 ** (Esize (Typ) * Csize) - 1; -- Here Siz is 1, 2 or 4, as computed above, and btyp is either -- Unsigned or Long_Long_Unsigned depending on the length. if Len_Bits <= Standard_Integer_Size then Btyp := RTE (RE_Unsigned); else Btyp := RTE (RE_Long_Long_Unsigned); end if; Lit := Make_Integer_Literal (Loc, 2 ** Len_Bits - 1); Set_Print_In_Hex (Lit); Decl := Make_Subtype_Declaration (Loc, Defining_Identifier => PAT, Subtype_Indication => Make_Subtype_Indication (Loc, Subtype_Mark => New_Occurrence_Of (Btyp, Loc), Constraint => Make_Range_Constraint (Loc, Range_Expression => Make_Range (Loc, Low_Bound => Make_Integer_Literal (Loc, 0), High_Bound => Lit)))); if Esiz = Uint_0 then Esiz := Len_Bits; end if; Install_PAT; return; end if; end if; -- Could not use a modular type, for all other cases, we build -- a packed array subtype: -- subtype tttPn is -- System.Packed_Bytes{1,2,4} (0 .. (Bits + 7) / 8 - 1); -- Bits is the length of the array in bits. Set_PB_Type; Bits_U1 := Make_Op_Add (Loc, Left_Opnd => Make_Op_Multiply (Loc, Left_Opnd => Make_Integer_Literal (Loc, Csize), Right_Opnd => Len_Expr), Right_Opnd => Make_Integer_Literal (Loc, 7)); Set_Paren_Count (Bits_U1, 1); PAT_High := Make_Op_Subtract (Loc, Left_Opnd => Make_Op_Divide (Loc, Left_Opnd => Bits_U1, Right_Opnd => Make_Integer_Literal (Loc, 8)), Right_Opnd => Make_Integer_Literal (Loc, 1)); Decl := Make_Subtype_Declaration (Loc, Defining_Identifier => PAT, Subtype_Indication => Make_Subtype_Indication (Loc, Subtype_Mark => New_Occurrence_Of (PB_Type, Loc), Constraint => Make_Index_Or_Discriminant_Constraint (Loc, Constraints => New_List ( Make_Range (Loc, Low_Bound => Make_Integer_Literal (Loc, 0), High_Bound => PAT_High))))); Install_PAT; end if; end Create_Packed_Array_Type; ----------------------------------- -- Expand_Bit_Packed_Element_Set -- ----------------------------------- procedure Expand_Bit_Packed_Element_Set (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Lhs : constant Node_Id := Name (N); Ass_OK : constant Boolean := Assignment_OK (Lhs); -- Used to preserve assignment OK status when assignment is rewritten Rhs : Node_Id := Expression (N); -- Initially Rhs is the right hand side value, it will be replaced -- later by an appropriate unchecked conversion for the assignment. Obj : Node_Id; Atyp : Entity_Id; PAT : Entity_Id; Ctyp : Entity_Id; Csiz : Int; Shift : Node_Id; Cmask : Uint; New_Lhs : Node_Id; New_Rhs : Node_Id; Rhs_Val_Known : Boolean; Rhs_Val : Uint; -- If the value of the right hand side as an integer constant is -- known at compile time, Rhs_Val_Known is set True, and Rhs_Val -- contains the value. Otherwise Rhs_Val_Known is set False, and -- the Rhs_Val is undefined. begin pragma Assert (Is_Bit_Packed_Array (Etype (Prefix (Lhs)))); Obj := Relocate_Node (Prefix (Lhs)); Convert_To_Actual_Subtype (Obj); Atyp := Etype (Obj); PAT := Packed_Array_Type (Atyp); Ctyp := Component_Type (Atyp); Csiz := UI_To_Int (Component_Size (Atyp)); -- We convert the right hand side to the proper subtype to ensure -- that an appropriate range check is made (since the normal range -- check from assignment will be lost in the transformations). This -- conversion is analyzed immediately so that subsequent processing -- can work with an analyzed Rhs (and e.g. look at its Etype) Rhs := Convert_To (Ctyp, Rhs); Set_Parent (Rhs, N); Analyze_And_Resolve (Rhs, Ctyp); -- Case of component size 1,2,4 or any component size for the modular -- case. These are the cases for which we can inline the code. if Csiz = 1 or else Csiz = 2 or else Csiz = 4 or else (Present (PAT) and then Is_Modular_Integer_Type (PAT)) then Setup_Inline_Packed_Array_Reference (Lhs, Atyp, Obj, Cmask, Shift); -- The statement to be generated is: -- Obj := atyp!((Obj and Mask1) or (shift_left (rhs, shift))) -- where mask1 is obtained by shifting Cmask left Shift bits -- and then complementing the result. -- the "and Mask1" is omitted if rhs is constant and all 1 bits -- the "or ..." is omitted if rhs is constant and all 0 bits -- rhs is converted to the appropriate type. -- The result is converted back to the array type, since -- otherwise we lose knowledge of the packed nature. -- Determine if right side is all 0 bits or all 1 bits if Compile_Time_Known_Value (Rhs) then Rhs_Val := Expr_Rep_Value (Rhs); Rhs_Val_Known := True; -- The following test catches the case of an unchecked conversion -- of an integer literal. This results from optimizing aggregates -- of packed types. elsif Nkind (Rhs) = N_Unchecked_Type_Conversion and then Compile_Time_Known_Value (Expression (Rhs)) then Rhs_Val := Expr_Rep_Value (Expression (Rhs)); Rhs_Val_Known := True; else Rhs_Val := No_Uint; Rhs_Val_Known := False; end if; -- Some special checks for the case where the right hand value -- is known at compile time. Basically we have to take care of -- the implicit conversion to the subtype of the component object. if Rhs_Val_Known then -- If we have a biased component type then we must manually do -- the biasing, since we are taking responsibility in this case -- for constructing the exact bit pattern to be used. if Has_Biased_Representation (Ctyp) then Rhs_Val := Rhs_Val - Expr_Rep_Value (Type_Low_Bound (Ctyp)); end if; -- For a negative value, we manually convert the twos complement -- value to a corresponding unsigned value, so that the proper -- field width is maintained. If we did not do this, we would -- get too many leading sign bits later on. if Rhs_Val < 0 then Rhs_Val := 2 ** UI_From_Int (Csiz) + Rhs_Val; end if; end if; New_Lhs := Duplicate_Subexpr (Obj, True); New_Rhs := Duplicate_Subexpr (Obj); -- First we deal with the "and" if not Rhs_Val_Known or else Rhs_Val /= Cmask then declare Mask1 : Node_Id; Lit : Node_Id; begin if Compile_Time_Known_Value (Shift) then Mask1 := Make_Integer_Literal (Loc, Modulus (Etype (Obj)) - 1 - (Cmask * (2 ** Expr_Value (Shift)))); Set_Print_In_Hex (Mask1); else Lit := Make_Integer_Literal (Loc, Cmask); Set_Print_In_Hex (Lit); Mask1 := Make_Op_Not (Loc, Right_Opnd => Make_Shift_Left (Lit, Shift)); end if; New_Rhs := Make_Op_And (Loc, Left_Opnd => New_Rhs, Right_Opnd => Mask1); end; end if; -- Then deal with the "or" if not Rhs_Val_Known or else Rhs_Val /= 0 then declare Or_Rhs : Node_Id; procedure Fixup_Rhs; -- Adjust Rhs by bias if biased representation for components -- or remove extraneous high order sign bits if signed. procedure Fixup_Rhs is Etyp : constant Entity_Id := Etype (Rhs); begin -- For biased case, do the required biasing by simply -- converting to the biased subtype (the conversion -- will generate the required bias). if Has_Biased_Representation (Ctyp) then Rhs := Convert_To (Ctyp, Rhs); -- For a signed integer type that is not biased, generate -- a conversion to unsigned to strip high order sign bits. elsif Is_Signed_Integer_Type (Ctyp) then Rhs := Unchecked_Convert_To (RTE (Bits_Id (Csiz)), Rhs); end if; -- Set Etype, since it can be referenced before the -- node is completely analyzed. Set_Etype (Rhs, Etyp); -- We now need to do an unchecked conversion of the -- result to the target type, but it is important that -- this conversion be a right justified conversion and -- not a left justified conversion. Rhs := RJ_Unchecked_Convert_To (Etype (Obj), Rhs); end Fixup_Rhs; begin if Rhs_Val_Known and then Compile_Time_Known_Value (Shift) then Or_Rhs := Make_Integer_Literal (Loc, Rhs_Val * (2 ** Expr_Value (Shift))); Set_Print_In_Hex (Or_Rhs); else -- We have to convert the right hand side to Etype (Obj). -- A special case case arises if what we have now is a Val -- attribute reference whose expression type is Etype (Obj). -- This happens for assignments of fields from the same -- array. In this case we get the required right hand side -- by simply removing the inner attribute reference. if Nkind (Rhs) = N_Attribute_Reference and then Attribute_Name (Rhs) = Name_Val and then Etype (First (Expressions (Rhs))) = Etype (Obj) then Rhs := Relocate_Node (First (Expressions (Rhs))); Fixup_Rhs; -- If the value of the right hand side is a known integer -- value, then just replace it by an untyped constant, -- which will be properly retyped when we analyze and -- resolve the expression. elsif Rhs_Val_Known then -- Note that Rhs_Val has already been normalized to -- be an unsigned value with the proper number of bits. Rhs := Make_Integer_Literal (Loc, Rhs_Val); -- Otherwise we need an unchecked conversion else Fixup_Rhs; end if; Or_Rhs := Make_Shift_Left (Rhs, Shift); end if; if Nkind (New_Rhs) = N_Op_And then Set_Paren_Count (New_Rhs, 1); end if; New_Rhs := Make_Op_Or (Loc, Left_Opnd => New_Rhs, Right_Opnd => Or_Rhs); end; end if; -- Now do the rewrite Rewrite (N, Make_Assignment_Statement (Loc, Name => New_Lhs, Expression => Unchecked_Convert_To (Etype (New_Lhs), New_Rhs))); Set_Assignment_OK (Name (N), Ass_OK); -- All other component sizes for non-modular case else -- We generate -- Set_nn (Arr'address, Subscr, Bits_nn!(Rhs)) -- where Subscr is the computed linear subscript. declare Bits_nn : constant Entity_Id := RTE (Bits_Id (Csiz)); Set_nn : Entity_Id; Subscr : Node_Id; Atyp : Entity_Id; begin -- Acquire proper Set entity. We use the aligned or unaligned -- case as appropriate. if Known_Aligned_Enough (Obj, Csiz) then Set_nn := RTE (Set_Id (Csiz)); else Set_nn := RTE (SetU_Id (Csiz)); end if; -- Now generate the set reference Obj := Relocate_Node (Prefix (Lhs)); Convert_To_Actual_Subtype (Obj); Atyp := Etype (Obj); Compute_Linear_Subscript (Atyp, Lhs, Subscr); Rewrite (N, Make_Procedure_Call_Statement (Loc, Name => New_Occurrence_Of (Set_nn, Loc), Parameter_Associations => New_List ( Make_Attribute_Reference (Loc, Attribute_Name => Name_Address, Prefix => Obj), Subscr, Unchecked_Convert_To (Bits_nn, Convert_To (Ctyp, Rhs))))); end; end if; Analyze (N, Suppress => All_Checks); end Expand_Bit_Packed_Element_Set; ------------------------------------- -- Expand_Packed_Address_Reference -- ------------------------------------- procedure Expand_Packed_Address_Reference (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Ploc : Source_Ptr; Pref : Node_Id; Expr : Node_Id; Term : Node_Id; Atyp : Entity_Id; Subscr : Node_Id; begin Pref := Prefix (N); Expr := Empty; -- We build up an expression serially that has the form -- outer_object'Address -- + (linear-subscript * component_size for each array reference -- + field'Bit_Position for each record field -- + ... -- + ...) / Storage_Unit; -- Some additional conversions are required to deal with the addition -- operation, which is not normally visible to generated code. loop Ploc := Sloc (Pref); if Nkind (Pref) = N_Indexed_Component then Convert_To_Actual_Subtype (Prefix (Pref)); Atyp := Etype (Prefix (Pref)); Compute_Linear_Subscript (Atyp, Pref, Subscr); Term := Make_Op_Multiply (Ploc, Left_Opnd => Subscr, Right_Opnd => Make_Attribute_Reference (Ploc, Prefix => New_Occurrence_Of (Atyp, Ploc), Attribute_Name => Name_Component_Size)); elsif Nkind (Pref) = N_Selected_Component then Term := Make_Attribute_Reference (Ploc, Prefix => Selector_Name (Pref), Attribute_Name => Name_Bit_Position); else exit; end if; Term := Convert_To (RTE (RE_Integer_Address), Term); if No (Expr) then Expr := Term; else Expr := Make_Op_Add (Ploc, Left_Opnd => Expr, Right_Opnd => Term); end if; Pref := Prefix (Pref); end loop; Rewrite (N, Unchecked_Convert_To (RTE (RE_Address), Make_Op_Add (Loc, Left_Opnd => Unchecked_Convert_To (RTE (RE_Integer_Address), Make_Attribute_Reference (Loc, Prefix => Pref, Attribute_Name => Name_Address)), Right_Opnd => Make_Op_Divide (Loc, Left_Opnd => Expr, Right_Opnd => Make_Integer_Literal (Loc, System_Storage_Unit))))); Analyze_And_Resolve (N, RTE (RE_Address)); end Expand_Packed_Address_Reference; ------------------------------------ -- Expand_Packed_Boolean_Operator -- ------------------------------------ -- This routine expands "a op b" for the packed cases procedure Expand_Packed_Boolean_Operator (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Typ : constant Entity_Id := Etype (N); L : constant Node_Id := Relocate_Node (Left_Opnd (N)); R : constant Node_Id := Relocate_Node (Right_Opnd (N)); Ltyp : Entity_Id; Rtyp : Entity_Id; PAT : Entity_Id; begin Convert_To_Actual_Subtype (L); Convert_To_Actual_Subtype (R); Ensure_Defined (Etype (L), N); Ensure_Defined (Etype (R), N); Apply_Length_Check (R, Etype (L)); Ltyp := Etype (L); Rtyp := Etype (R); -- First an odd and silly test. We explicitly check for the XOR -- case where the component type is True .. True, since this will -- raise constraint error. A special check is required since CE -- will not be required other wise (cf Expand_Packed_Not). -- No such check is required for AND and OR, since for both these -- cases False op False = False, and True op True = True. if Nkind (N) = N_Op_Xor then declare CT : constant Entity_Id := Component_Type (Rtyp); BT : constant Entity_Id := Base_Type (CT); begin Insert_Action (N, Make_Raise_Constraint_Error (Loc, Condition => Make_Op_And (Loc, Left_Opnd => Make_Op_Eq (Loc, Left_Opnd => Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (CT, Loc), Attribute_Name => Name_First), Right_Opnd => Convert_To (BT, New_Occurrence_Of (Standard_True, Loc))), Right_Opnd => Make_Op_Eq (Loc, Left_Opnd => Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (CT, Loc), Attribute_Name => Name_Last), Right_Opnd => Convert_To (BT, New_Occurrence_Of (Standard_True, Loc)))))); end; end if; -- Now that that silliness is taken care of, get packed array type Convert_To_PAT_Type (L); Convert_To_PAT_Type (R); PAT := Etype (L); -- For the modular case, we expand a op b into -- rtyp!(pat!(a) op pat!(b)) -- where rtyp is the Etype of the left operand. Note that we do not -- convert to the base type, since this would be unconstrained, and -- hence not have a corresponding packed array type set. if Is_Modular_Integer_Type (PAT) then declare P : Node_Id; begin if Nkind (N) = N_Op_And then P := Make_Op_And (Loc, L, R); elsif Nkind (N) = N_Op_Or then P := Make_Op_Or (Loc, L, R); else -- Nkind (N) = N_Op_Xor P := Make_Op_Xor (Loc, L, R); end if; Rewrite (N, Unchecked_Convert_To (Rtyp, P)); end; -- For the array case, we insert the actions -- Result : Ltype; -- System.Bitops.Bit_And/Or/Xor -- (Left'Address, -- Ltype'Length * Ltype'Component_Size; -- Right'Address, -- Rtype'Length * Rtype'Component_Size -- Result'Address); -- where Left and Right are the Packed_Bytes{1,2,4} operands and -- the second argument and fourth arguments are the lengths of the -- operands in bits. Then we replace the expression by a reference -- to Result. else declare Result_Ent : constant Entity_Id := Make_Defining_Identifier (Loc, Chars => New_Internal_Name ('T')); E_Id : RE_Id; begin if Nkind (N) = N_Op_And then E_Id := RE_Bit_And; elsif Nkind (N) = N_Op_Or then E_Id := RE_Bit_Or; else -- Nkind (N) = N_Op_Xor E_Id := RE_Bit_Xor; end if; Insert_Actions (N, New_List ( Make_Object_Declaration (Loc, Defining_Identifier => Result_Ent, Object_Definition => New_Occurrence_Of (Ltyp, Loc)), Make_Procedure_Call_Statement (Loc, Name => New_Occurrence_Of (RTE (E_Id), Loc), Parameter_Associations => New_List ( Make_Attribute_Reference (Loc, Attribute_Name => Name_Address, Prefix => L), Make_Op_Multiply (Loc, Left_Opnd => Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Etype (First_Index (Ltyp)), Loc), Attribute_Name => Name_Range_Length), Right_Opnd => Make_Integer_Literal (Loc, Component_Size (Ltyp))), Make_Attribute_Reference (Loc, Attribute_Name => Name_Address, Prefix => R), Make_Op_Multiply (Loc, Left_Opnd => Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Etype (First_Index (Rtyp)), Loc), Attribute_Name => Name_Range_Length), Right_Opnd => Make_Integer_Literal (Loc, Component_Size (Rtyp))), Make_Attribute_Reference (Loc, Attribute_Name => Name_Address, Prefix => New_Occurrence_Of (Result_Ent, Loc)))))); Rewrite (N, New_Occurrence_Of (Result_Ent, Loc)); end; end if; Analyze_And_Resolve (N, Typ, Suppress => All_Checks); end Expand_Packed_Boolean_Operator; ------------------------------------- -- Expand_Packed_Element_Reference -- ------------------------------------- procedure Expand_Packed_Element_Reference (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Obj : Node_Id; Atyp : Entity_Id; PAT : Entity_Id; Ctyp : Entity_Id; Csiz : Int; Shift : Node_Id; Cmask : Uint; Lit : Node_Id; Arg : Node_Id; begin -- If not bit packed, we have the enumeration case, which is easily -- dealt with (just adjust the subscripts of the indexed component) -- Note: this leaves the result as an indexed component, which is -- still a variable, so can be used in the assignment case, as is -- required in the enumeration case. if not Is_Bit_Packed_Array (Etype (Prefix (N))) then Setup_Enumeration_Packed_Array_Reference (N); return; end if; -- Remaining processing is for the bit-packed case. Obj := Relocate_Node (Prefix (N)); Convert_To_Actual_Subtype (Obj); Atyp := Etype (Obj); PAT := Packed_Array_Type (Atyp); Ctyp := Component_Type (Atyp); Csiz := UI_To_Int (Component_Size (Atyp)); -- Case of component size 1,2,4 or any component size for the modular -- case. These are the cases for which we can inline the code. if Csiz = 1 or else Csiz = 2 or else Csiz = 4 or else (Present (PAT) and then Is_Modular_Integer_Type (PAT)) then Setup_Inline_Packed_Array_Reference (N, Atyp, Obj, Cmask, Shift); Lit := Make_Integer_Literal (Loc, Cmask); Set_Print_In_Hex (Lit); -- We generate a shift right to position the field, followed by a -- masking operation to extract the bit field, and we finally do an -- unchecked conversion to convert the result to the required target. -- Note that the unchecked conversion automatically deals with the -- bias if we are dealing with a biased representation. What will -- happen is that we temporarily generate the biased representation, -- but almost immediately that will be converted to the original -- unbiased component type, and the bias will disappear. Arg := Make_Op_And (Loc, Left_Opnd => Make_Shift_Right (Obj, Shift), Right_Opnd => Lit); Analyze_And_Resolve (Arg); Rewrite (N, RJ_Unchecked_Convert_To (Ctyp, Arg)); -- All other component sizes for non-modular case else -- We generate -- Component_Type!(Get_nn (Arr'address, Subscr)) -- where Subscr is the computed linear subscript. declare Get_nn : Entity_Id; Subscr : Node_Id; begin -- Acquire proper Get entity. We use the aligned or unaligned -- case as appropriate. if Known_Aligned_Enough (Obj, Csiz) then Get_nn := RTE (Get_Id (Csiz)); else Get_nn := RTE (GetU_Id (Csiz)); end if; -- Now generate the get reference Compute_Linear_Subscript (Atyp, N, Subscr); Rewrite (N, Unchecked_Convert_To (Ctyp, Make_Function_Call (Loc, Name => New_Occurrence_Of (Get_nn, Loc), Parameter_Associations => New_List ( Make_Attribute_Reference (Loc, Attribute_Name => Name_Address, Prefix => Obj), Subscr)))); end; end if; Analyze_And_Resolve (N, Ctyp, Suppress => All_Checks); end Expand_Packed_Element_Reference; ---------------------- -- Expand_Packed_Eq -- ---------------------- -- Handles expansion of "=" on packed array types procedure Expand_Packed_Eq (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); L : constant Node_Id := Relocate_Node (Left_Opnd (N)); R : constant Node_Id := Relocate_Node (Right_Opnd (N)); LLexpr : Node_Id; RLexpr : Node_Id; Ltyp : Entity_Id; Rtyp : Entity_Id; PAT : Entity_Id; begin Convert_To_Actual_Subtype (L); Convert_To_Actual_Subtype (R); Ltyp := Underlying_Type (Etype (L)); Rtyp := Underlying_Type (Etype (R)); Convert_To_PAT_Type (L); Convert_To_PAT_Type (R); PAT := Etype (L); LLexpr := Make_Op_Multiply (Loc, Left_Opnd => Make_Attribute_Reference (Loc, Attribute_Name => Name_Length, Prefix => New_Occurrence_Of (Ltyp, Loc)), Right_Opnd => Make_Integer_Literal (Loc, Component_Size (Ltyp))); RLexpr := Make_Op_Multiply (Loc, Left_Opnd => Make_Attribute_Reference (Loc, Attribute_Name => Name_Length, Prefix => New_Occurrence_Of (Rtyp, Loc)), Right_Opnd => Make_Integer_Literal (Loc, Component_Size (Rtyp))); -- For the modular case, we transform the comparison to: -- Ltyp'Length = Rtyp'Length and then PAT!(L) = PAT!(R) -- where PAT is the packed array type. This works fine, since in the -- modular case we guarantee that the unused bits are always zeroes. -- We do have to compare the lengths because we could be comparing -- two different subtypes of the same base type. if Is_Modular_Integer_Type (PAT) then Rewrite (N, Make_And_Then (Loc, Left_Opnd => Make_Op_Eq (Loc, Left_Opnd => LLexpr, Right_Opnd => RLexpr), Right_Opnd => Make_Op_Eq (Loc, Left_Opnd => L, Right_Opnd => R))); -- For the non-modular case, we call a runtime routine -- System.Bit_Ops.Bit_Eq -- (L'Address, L_Length, R'Address, R_Length) -- where PAT is the packed array type, and the lengths are the lengths -- in bits of the original packed arrays. This routine takes care of -- not comparing the unused bits in the last byte. else Rewrite (N, Make_Function_Call (Loc, Name => New_Occurrence_Of (RTE (RE_Bit_Eq), Loc), Parameter_Associations => New_List ( Make_Attribute_Reference (Loc, Attribute_Name => Name_Address, Prefix => L), LLexpr, Make_Attribute_Reference (Loc, Attribute_Name => Name_Address, Prefix => R), RLexpr))); end if; Analyze_And_Resolve (N, Standard_Boolean, Suppress => All_Checks); end Expand_Packed_Eq; ----------------------- -- Expand_Packed_Not -- ----------------------- -- Handles expansion of "not" on packed array types procedure Expand_Packed_Not (N : Node_Id) is Loc : constant Source_Ptr := Sloc (N); Typ : constant Entity_Id := Etype (N); Opnd : constant Node_Id := Relocate_Node (Right_Opnd (N)); Rtyp : Entity_Id; PAT : Entity_Id; Lit : Node_Id; begin Convert_To_Actual_Subtype (Opnd); Rtyp := Etype (Opnd); -- First an odd and silly test. We explicitly check for the case -- where the 'First of the component type is equal to the 'Last of -- this component type, and if this is the case, we make sure that -- constraint error is raised. The reason is that the NOT is bound -- to cause CE in this case, and we will not otherwise catch it. -- Believe it or not, this was reported as a bug. Note that nearly -- always, the test will evaluate statically to False, so the code -- will be statically removed, and no extra overhead caused. declare CT : constant Entity_Id := Component_Type (Rtyp); begin Insert_Action (N, Make_Raise_Constraint_Error (Loc, Condition => Make_Op_Eq (Loc, Left_Opnd => Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (CT, Loc), Attribute_Name => Name_First), Right_Opnd => Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (CT, Loc), Attribute_Name => Name_Last)))); end; -- Now that that silliness is taken care of, get packed array type Convert_To_PAT_Type (Opnd); PAT := Etype (Opnd); -- For the case where the packed array type is a modular type, -- not A expands simply into: -- rtyp!(PAT!(A) xor mask) -- where PAT is the packed array type, and mask is a mask of all -- one bits of length equal to the size of this packed type and -- rtyp is the actual subtype of the operand Lit := Make_Integer_Literal (Loc, 2 ** Esize (PAT) - 1); Set_Print_In_Hex (Lit); if not Is_Array_Type (PAT) then Rewrite (N, Unchecked_Convert_To (Rtyp, Make_Op_Xor (Loc, Left_Opnd => Opnd, Right_Opnd => Lit))); -- For the array case, we insert the actions -- Result : Typ; -- System.Bitops.Bit_Not -- (Opnd'Address, -- Typ'Length * Typ'Component_Size; -- Result'Address); -- where Opnd is the Packed_Bytes{1,2,4} operand and the second -- argument is the length of the operand in bits. Then we replace -- the expression by a reference to Result. else declare Result_Ent : constant Entity_Id := Make_Defining_Identifier (Loc, Chars => New_Internal_Name ('T')); begin Insert_Actions (N, New_List ( Make_Object_Declaration (Loc, Defining_Identifier => Result_Ent, Object_Definition => New_Occurrence_Of (Rtyp, Loc)), Make_Procedure_Call_Statement (Loc, Name => New_Occurrence_Of (RTE (RE_Bit_Not), Loc), Parameter_Associations => New_List ( Make_Attribute_Reference (Loc, Attribute_Name => Name_Address, Prefix => Opnd), Make_Op_Multiply (Loc, Left_Opnd => Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Etype (First_Index (Rtyp)), Loc), Attribute_Name => Name_Range_Length), Right_Opnd => Make_Integer_Literal (Loc, Component_Size (Rtyp))), Make_Attribute_Reference (Loc, Attribute_Name => Name_Address, Prefix => New_Occurrence_Of (Result_Ent, Loc)))))); Rewrite (N, New_Occurrence_Of (Result_Ent, Loc)); end; end if; Analyze_And_Resolve (N, Typ, Suppress => All_Checks); end Expand_Packed_Not; ------------------------------------- -- Involves_Packed_Array_Reference -- ------------------------------------- function Involves_Packed_Array_Reference (N : Node_Id) return Boolean is begin if Nkind (N) = N_Indexed_Component and then Is_Bit_Packed_Array (Etype (Prefix (N))) then return True; elsif Nkind (N) = N_Selected_Component then return Involves_Packed_Array_Reference (Prefix (N)); else return False; end if; end Involves_Packed_Array_Reference; -------------------------- -- Known_Aligned_Enough -- -------------------------- function Known_Aligned_Enough (Obj : Node_Id; Csiz : Nat) return Boolean is Typ : constant Entity_Id := Etype (Obj); function In_Partially_Packed_Record (Comp : Entity_Id) return Boolean; -- If the component is in a record that contains previous packed -- components, consider it unaligned because the back-end might -- choose to pack the rest of the record. Lead to less efficient code, -- but safer vis-a-vis of back-end choices. -------------------------------- -- In_Partially_Packed_Record -- -------------------------------- function In_Partially_Packed_Record (Comp : Entity_Id) return Boolean is Rec_Type : constant Entity_Id := Scope (Comp); Prev_Comp : Entity_Id; begin Prev_Comp := First_Entity (Rec_Type); while Present (Prev_Comp) loop if Is_Packed (Etype (Prev_Comp)) then return True; elsif Prev_Comp = Comp then return False; end if; Next_Entity (Prev_Comp); end loop; return False; end In_Partially_Packed_Record; -- Start of processing for Known_Aligned_Enough begin -- Odd bit sizes don't need alignment anyway if Csiz mod 2 = 1 then return True; -- If we have a specified alignment, see if it is sufficient, if not -- then we can't possibly be aligned enough in any case. elsif Is_Entity_Name (Obj) and then Known_Alignment (Entity (Obj)) then -- Alignment required is 4 if size is a multiple of 4, and -- 2 otherwise (e.g. 12 bits requires 4, 10 bits requires 2) if Alignment (Entity (Obj)) < 4 - (Csiz mod 4) then return False; end if; end if; -- OK, alignment should be sufficient, if object is aligned -- If object is strictly aligned, then it is definitely aligned if Strict_Alignment (Typ) then return True; -- Case of subscripted array reference elsif Nkind (Obj) = N_Indexed_Component then -- If we have a pointer to an array, then this is definitely -- aligned, because pointers always point to aligned versions. if Is_Access_Type (Etype (Prefix (Obj))) then return True; -- Otherwise, go look at the prefix else return Known_Aligned_Enough (Prefix (Obj), Csiz); end if; -- Case of record field elsif Nkind (Obj) = N_Selected_Component then -- What is significant here is whether the record type is packed if Is_Record_Type (Etype (Prefix (Obj))) and then Is_Packed (Etype (Prefix (Obj))) then return False; -- Or the component has a component clause which might cause -- the component to become unaligned (we can't tell if the -- backend is doing alignment computations). elsif Present (Component_Clause (Entity (Selector_Name (Obj)))) then return False; elsif In_Partially_Packed_Record (Entity (Selector_Name (Obj))) then return False; -- In all other cases, go look at prefix else return Known_Aligned_Enough (Prefix (Obj), Csiz); end if; -- If not selected or indexed component, must be aligned else return True; end if; end Known_Aligned_Enough; --------------------- -- Make_Shift_Left -- --------------------- function Make_Shift_Left (N : Node_Id; S : Node_Id) return Node_Id is Nod : Node_Id; begin if Compile_Time_Known_Value (S) and then Expr_Value (S) = 0 then return N; else Nod := Make_Op_Shift_Left (Sloc (N), Left_Opnd => N, Right_Opnd => S); Set_Shift_Count_OK (Nod, True); return Nod; end if; end Make_Shift_Left; ---------------------- -- Make_Shift_Right -- ---------------------- function Make_Shift_Right (N : Node_Id; S : Node_Id) return Node_Id is Nod : Node_Id; begin if Compile_Time_Known_Value (S) and then Expr_Value (S) = 0 then return N; else Nod := Make_Op_Shift_Right (Sloc (N), Left_Opnd => N, Right_Opnd => S); Set_Shift_Count_OK (Nod, True); return Nod; end if; end Make_Shift_Right; ----------------------------- -- RJ_Unchecked_Convert_To -- ----------------------------- function RJ_Unchecked_Convert_To (Typ : Entity_Id; Expr : Node_Id) return Node_Id is Source_Typ : constant Entity_Id := Etype (Expr); Target_Typ : constant Entity_Id := Typ; Src : Node_Id := Expr; Source_Siz : Nat; Target_Siz : Nat; begin Source_Siz := UI_To_Int (RM_Size (Source_Typ)); Target_Siz := UI_To_Int (RM_Size (Target_Typ)); -- In the big endian case, if the lengths of the two types differ, -- then we must worry about possible left justification in the -- conversion, and avoiding that is what this is all about. if Bytes_Big_Endian and then Source_Siz /= Target_Siz then -- First step, if the source type is not a discrete type, then we -- first convert to a modular type of the source length, since -- otherwise, on a big-endian machine, we get left-justification. if not Is_Discrete_Type (Source_Typ) then Src := Unchecked_Convert_To (RTE (Bits_Id (Source_Siz)), Src); end if; -- Next step. If the target is not a discrete type, then we first -- convert to a modular type of the target length, since -- otherwise, on a big-endian machine, we get left-justification. if not Is_Discrete_Type (Target_Typ) then Src := Unchecked_Convert_To (RTE (Bits_Id (Target_Siz)), Src); end if; end if; -- And now we can do the final conversion to the target type return Unchecked_Convert_To (Target_Typ, Src); end RJ_Unchecked_Convert_To; ---------------------------------------------- -- Setup_Enumeration_Packed_Array_Reference -- ---------------------------------------------- -- All we have to do here is to find the subscripts that correspond -- to the index positions that have non-standard enumeration types -- and insert a Pos attribute to get the proper subscript value. -- Finally the prefix must be uncheck converted to the corresponding -- packed array type. -- Note that the component type is unchanged, so we do not need to -- fiddle with the types (Gigi always automatically takes the packed -- array type if it is set, as it will be in this case). procedure Setup_Enumeration_Packed_Array_Reference (N : Node_Id) is Pfx : constant Node_Id := Prefix (N); Typ : constant Entity_Id := Etype (N); Exprs : constant List_Id := Expressions (N); Expr : Node_Id; begin -- If the array is unconstrained, then we replace the array -- reference with its actual subtype. This actual subtype will -- have a packed array type with appropriate bounds. if not Is_Constrained (Packed_Array_Type (Etype (Pfx))) then Convert_To_Actual_Subtype (Pfx); end if; Expr := First (Exprs); while Present (Expr) loop declare Loc : constant Source_Ptr := Sloc (Expr); Expr_Typ : constant Entity_Id := Etype (Expr); begin if Is_Enumeration_Type (Expr_Typ) and then Has_Non_Standard_Rep (Expr_Typ) then Rewrite (Expr, Make_Attribute_Reference (Loc, Prefix => New_Occurrence_Of (Expr_Typ, Loc), Attribute_Name => Name_Pos, Expressions => New_List (Relocate_Node (Expr)))); Analyze_And_Resolve (Expr, Standard_Natural); end if; end; Next (Expr); end loop; Rewrite (N, Make_Indexed_Component (Sloc (N), Prefix => Unchecked_Convert_To (Packed_Array_Type (Etype (Pfx)), Pfx), Expressions => Exprs)); Analyze_And_Resolve (N, Typ); end Setup_Enumeration_Packed_Array_Reference; ----------------------------------------- -- Setup_Inline_Packed_Array_Reference -- ----------------------------------------- procedure Setup_Inline_Packed_Array_Reference (N : Node_Id; Atyp : Entity_Id; Obj : in out Node_Id; Cmask : out Uint; Shift : out Node_Id) is Loc : constant Source_Ptr := Sloc (N); Ctyp : Entity_Id; PAT : Entity_Id; Otyp : Entity_Id; Csiz : Uint; Osiz : Uint; begin Ctyp := Component_Type (Atyp); Csiz := Component_Size (Atyp); Convert_To_PAT_Type (Obj); PAT := Etype (Obj); Cmask := 2 ** Csiz - 1; if Is_Array_Type (PAT) then Otyp := Component_Type (PAT); Osiz := Esize (Otyp); else Otyp := PAT; -- In the case where the PAT is a modular type, we want the actual -- size in bits of the modular value we use. This is neither the -- Object_Size nor the Value_Size, either of which may have been -- reset to strange values, but rather the minimum size. Note that -- since this is a modular type with full range, the issue of -- biased representation does not arise. Osiz := UI_From_Int (Minimum_Size (Otyp)); end if; Compute_Linear_Subscript (Atyp, N, Shift); -- If the component size is not 1, then the subscript must be -- multiplied by the component size to get the shift count. if Csiz /= 1 then Shift := Make_Op_Multiply (Loc, Left_Opnd => Make_Integer_Literal (Loc, Csiz), Right_Opnd => Shift); end if; -- If we have the array case, then this shift count must be broken -- down into a byte subscript, and a shift within the byte. if Is_Array_Type (PAT) then declare New_Shift : Node_Id; begin -- We must analyze shift, since we will duplicate it Set_Parent (Shift, N); Analyze_And_Resolve (Shift, Standard_Integer, Suppress => All_Checks); -- The shift count within the word is -- shift mod Osiz New_Shift := Make_Op_Mod (Loc, Left_Opnd => Duplicate_Subexpr (Shift), Right_Opnd => Make_Integer_Literal (Loc, Osiz)); -- The subscript to be used on the PAT array is -- shift / Osiz Obj := Make_Indexed_Component (Loc, Prefix => Obj, Expressions => New_List ( Make_Op_Divide (Loc, Left_Opnd => Duplicate_Subexpr (Shift), Right_Opnd => Make_Integer_Literal (Loc, Osiz)))); Shift := New_Shift; end; -- For the modular integer case, the object to be manipulated is -- the entire array, so Obj is unchanged. Note that we will reset -- its type to PAT before returning to the caller. else null; end if; -- The one remaining step is to modify the shift count for the -- big-endian case. Consider the following example in a byte: -- xxxxxxxx bits of byte -- vvvvvvvv bits of value -- 33221100 little-endian numbering -- 00112233 big-endian numbering -- Here we have the case of 2-bit fields -- For the little-endian case, we already have the proper shift -- count set, e.g. for element 2, the shift count is 2*2 = 4. -- For the big endian case, we have to adjust the shift count, -- computing it as (N - F) - shift, where N is the number of bits -- in an element of the array used to implement the packed array, -- F is the number of bits in a source level array element, and -- shift is the count so far computed. if Bytes_Big_Endian then Shift := Make_Op_Subtract (Loc, Left_Opnd => Make_Integer_Literal (Loc, Osiz - Csiz), Right_Opnd => Shift); end if; Set_Parent (Shift, N); Set_Parent (Obj, N); Analyze_And_Resolve (Obj, Otyp, Suppress => All_Checks); Analyze_And_Resolve (Shift, Standard_Integer, Suppress => All_Checks); -- Make sure final type of object is the appropriate packed type Set_Etype (Obj, Otyp); end Setup_Inline_Packed_Array_Reference; end Exp_Pakd;
34.109294
79
0.542251
59d29ebd672a9aeb56e2f40862103e20acd5b3d5
837
adb
Ada
contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/convvar_comp/pck.adb
TheSledgeHammer/2.11BSD
fe61f0b9aaa273783cd027c7b5ec77e95ead2153
[ "BSD-3-Clause" ]
3
2021-05-04T17:09:06.000Z
2021-10-04T07:19:26.000Z
contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/convvar_comp/pck.adb
TheSledgeHammer/2.11BSD
fe61f0b9aaa273783cd027c7b5ec77e95ead2153
[ "BSD-3-Clause" ]
null
null
null
contrib/gnu/gdb/dist/gdb/testsuite/gdb.ada/convvar_comp/pck.adb
TheSledgeHammer/2.11BSD
fe61f0b9aaa273783cd027c7b5ec77e95ead2153
[ "BSD-3-Clause" ]
null
null
null
-- Copyright 2018-2020 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 3 of the License, or -- (at your option) any later version. -- -- This program is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program. If not, see <http://www.gnu.org/licenses/>. package body Pck is function Break_Me (Item : T) return Boolean is begin return False; end Break_Me; end Pck;
38.045455
73
0.732378
4b033b33f39d1b149ac4a0df7790e9fb5fd0d8bb
865
adb
Ada
build_gnu/binutils/gdb/testsuite/gdb.ada/same_enum/a.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/same_enum/a.adb
jed-frey/e200-gcc
df1421b421a8ec8729d70791129f5283dee5f9ea
[ "BSD-3-Clause" ]
null
null
null
build_gnu/binutils/gdb/testsuite/gdb.ada/same_enum/a.adb
jed-frey/e200-gcc
df1421b421a8ec8729d70791129f5283dee5f9ea
[ "BSD-3-Clause" ]
1
2019-12-17T22:04:07.000Z
2019-12-17T22:04:07.000Z
-- Copyright 2011-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 A is FC : Color := Red; SC : Color := Green; begin Do_Nothing (FC'Address); Do_Nothing (SC'Address); end A;
34.6
73
0.719075
2ed555a68cdd999bd75f32fc7772e0f1ed1e43cf
234
ads
Ada
src/version.ads
bracke/websitegenerator
d3aee456f9f0b84e1d4e7030520fac5d8e6c8a1b
[ "CC0-1.0" ]
1
2022-02-14T11:45:43.000Z
2022-02-14T11:45:43.000Z
src/version.ads
bracke/websitegenerator
d3aee456f9f0b84e1d4e7030520fac5d8e6c8a1b
[ "CC0-1.0" ]
null
null
null
src/version.ads
bracke/websitegenerator
d3aee456f9f0b84e1d4e7030520fac5d8e6c8a1b
[ "CC0-1.0" ]
null
null
null
package Version with Preelaborate is Current : constant String := "0.0.1"; Name : constant String := "WebsiteGenerator"; Link : constant String := "https://github.com/bracke/websitegenerator"; private end Version;
26
78
0.688034
22f361b739524dfbc27b4fee7ca8a9195bbc3f1f
1,793
ads
Ada
tier-1/xcb/source/thin/xcb-xcb_glx_get_tex_genfv_reply_t.ads
charlie5/cBound
741be08197a61ad9c72553e3302f3b669902216d
[ "0BSD" ]
2
2015-11-12T11:16:20.000Z
2021-08-24T22:32:04.000Z
tier-1/xcb/source/thin/xcb-xcb_glx_get_tex_genfv_reply_t.ads
charlie5/cBound
741be08197a61ad9c72553e3302f3b669902216d
[ "0BSD" ]
1
2018-06-05T05:19:35.000Z
2021-11-20T01:13:23.000Z
tier-1/xcb/source/thin/xcb-xcb_glx_get_tex_genfv_reply_t.ads
charlie5/cBound
741be08197a61ad9c72553e3302f3b669902216d
[ "0BSD" ]
null
null
null
-- This file is generated by SWIG. Please do not modify by hand. -- with Interfaces; with swig; with Interfaces.C; with Interfaces.C.Pointers; package xcb.xcb_glx_get_tex_genfv_reply_t is -- Item -- type Item is record response_type : aliased Interfaces.Unsigned_8; pad0 : aliased Interfaces.Unsigned_8; sequence : aliased Interfaces.Unsigned_16; length : aliased Interfaces.Unsigned_32; pad1 : aliased swig.int8_t_Array (0 .. 3); n : aliased Interfaces.Unsigned_32; datum : aliased xcb.xcb_glx_float32_t; pad2 : aliased swig.int8_t_Array (0 .. 11); end record; -- Item_Array -- type Item_Array is array (Interfaces.C .size_t range <>) of aliased xcb.xcb_glx_get_tex_genfv_reply_t .Item; -- Pointer -- package C_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_glx_get_tex_genfv_reply_t.Item, Element_Array => xcb.xcb_glx_get_tex_genfv_reply_t.Item_Array, Default_Terminator => (others => <>)); subtype Pointer is C_Pointers.Pointer; -- Pointer_Array -- type Pointer_Array is array (Interfaces.C .size_t range <>) of aliased xcb.xcb_glx_get_tex_genfv_reply_t .Pointer; -- Pointer_Pointer -- package C_Pointer_Pointers is new Interfaces.C.Pointers (Index => Interfaces.C.size_t, Element => xcb.xcb_glx_get_tex_genfv_reply_t.Pointer, Element_Array => xcb.xcb_glx_get_tex_genfv_reply_t.Pointer_Array, Default_Terminator => null); subtype Pointer_Pointer is C_Pointer_Pointers.Pointer; end xcb.xcb_glx_get_tex_genfv_reply_t;
29.393443
76
0.649749
add719613a20423109fa1b80ccb729d1da083d3b
2,591
ads
Ada
src/ada-core/src/linted-atomics.ads
mstewartgallus/linted
4d4cf9390353ea045b95671474ab278456793a35
[ "Apache-2.0" ]
null
null
null
src/ada-core/src/linted-atomics.ads
mstewartgallus/linted
4d4cf9390353ea045b95671474ab278456793a35
[ "Apache-2.0" ]
null
null
null
src/ada-core/src/linted-atomics.ads
mstewartgallus/linted
4d4cf9390353ea045b95671474ab278456793a35
[ "Apache-2.0" ]
null
null
null
-- Copyright 2017 Steven Stewart-Gallus -- -- 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. generic type Element_T is private; package Linted.Atomics is pragma Pure; protected type Atomic with Lock_Free is private procedure Set (New_Ptr : Element_T) with Global => null, Depends => (Atomic => New_Ptr, null => Atomic); function Get return Element_T with Global => null, Depends => (Get'Result => Atomic); procedure Compare_And_Swap (Old_Ptr : Element_T; New_Ptr : Element_T; Success : in out Boolean) with Global => null, Depends => (Success => (Old_Ptr, Atomic), Atomic =>+ (Old_Ptr, New_Ptr), null => Success); procedure Compare_And_Swap (Old_Ptr : Element_T; New_Ptr : Element_T) with Global => null, Depends => (Atomic =>+ (Old_Ptr, New_Ptr)); procedure Swap (Old_Ptr : in out Element_T; New_Ptr : Element_T) with Global => null, Depends => (Old_Ptr => Atomic, Atomic =>+ New_Ptr, null => Old_Ptr); Ptr : Element_T; end Atomic; procedure Set (A : in out Atomic; Element : Element_T) with Global => null, Depends => (A =>+ Element); procedure Get (A : in out Atomic; Element : out Element_T) with Global => null, Depends => (Element => A, A =>+ null); procedure Compare_And_Swap (A : in out Atomic; Old_Element : Element_T; New_Element : Element_T; Success : out Boolean) with Global => null, Depends => (Success => (A, Old_Element), A =>+ (Old_Element, New_Element)); procedure Compare_And_Swap (A : in out Atomic; Old_Element : Element_T; New_Element : Element_T) with Global => null, Depends => (A =>+ (Old_Element, New_Element)); procedure Swap (A : in out Atomic; Old_Element : out Element_T; New_Element : Element_T) with Global => null, Depends => (Old_Element => A, A =>+ New_Element); end Linted.Atomics;
33.649351
77
0.622154
4b0e867aa0768f7282253fcc99ba7006a63b0152
7,772
ads
Ada
samples/client/petstore/ada/src/model/samples-petstore-models.ads
timgclark/openapi-generator
468d80be4beff74de33a2dd1d533f855030038d5
[ "Apache-2.0" ]
4
2020-07-24T07:02:57.000Z
2022-01-08T17:37:38.000Z
samples/client/petstore/ada/src/model/samples-petstore-models.ads
timgclark/openapi-generator
468d80be4beff74de33a2dd1d533f855030038d5
[ "Apache-2.0" ]
10
2021-03-09T14:12:46.000Z
2022-02-27T11:42:16.000Z
samples/client/petstore/ada/src/model/samples-petstore-models.ads
timgclark/openapi-generator
468d80be4beff74de33a2dd1d533f855030038d5
[ "Apache-2.0" ]
5
2020-11-26T05:13:41.000Z
2021-04-09T15:58:18.000Z
-- OpenAPI Petstore -- This is a sample server Petstore server. For this sample, you can use the api key `special_key` to test the authorization filters. -- -- The version of the OpenAPI document: 1.0.0 -- -- -- NOTE: This package is auto generated by OpenAPI-Generator 4.2.3-SNAPSHOT. -- https://openapi-generator.tech -- Do not edit the class manually. with Swagger.Streams; with Ada.Containers.Vectors; package Samples.Petstore.Models is -- ------------------------------ -- An uploaded response -- Describes the result of uploading an image resource -- ------------------------------ type ApiResponse_Type is record Code : Swagger.Nullable_Integer; P_Type : Swagger.Nullable_UString; Message : Swagger.Nullable_UString; end record; package ApiResponse_Type_Vectors is new Ada.Containers.Vectors (Index_Type => Positive, Element_Type => ApiResponse_Type); procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class; Name : in String; Value : in ApiResponse_Type); procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class; Name : in String; Value : in ApiResponse_Type_Vectors.Vector); procedure Deserialize (From : in Swagger.Value_Type; Name : in String; Value : out ApiResponse_Type); procedure Deserialize (From : in Swagger.Value_Type; Name : in String; Value : out ApiResponse_Type_Vectors.Vector); -- ------------------------------ -- Pet Tag -- A tag for a pet -- ------------------------------ type Tag_Type is record Id : Swagger.Nullable_Long; Name : Swagger.Nullable_UString; end record; package Tag_Type_Vectors is new Ada.Containers.Vectors (Index_Type => Positive, Element_Type => Tag_Type); procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class; Name : in String; Value : in Tag_Type); procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class; Name : in String; Value : in Tag_Type_Vectors.Vector); procedure Deserialize (From : in Swagger.Value_Type; Name : in String; Value : out Tag_Type); procedure Deserialize (From : in Swagger.Value_Type; Name : in String; Value : out Tag_Type_Vectors.Vector); -- ------------------------------ -- Pet category -- A category for a pet -- ------------------------------ type Category_Type is record Id : Swagger.Nullable_Long; Name : Swagger.Nullable_UString; end record; package Category_Type_Vectors is new Ada.Containers.Vectors (Index_Type => Positive, Element_Type => Category_Type); procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class; Name : in String; Value : in Category_Type); procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class; Name : in String; Value : in Category_Type_Vectors.Vector); procedure Deserialize (From : in Swagger.Value_Type; Name : in String; Value : out Category_Type); procedure Deserialize (From : in Swagger.Value_Type; Name : in String; Value : out Category_Type_Vectors.Vector); -- ------------------------------ -- a Pet -- A pet for sale in the pet store -- ------------------------------ type Pet_Type is record Id : Swagger.Nullable_Long; Category : Samples.Petstore.Models.Category_Type; Name : Swagger.UString; Photo_Urls : Swagger.UString_Vectors.Vector; Tags : Samples.Petstore.Models.Tag_Type_Vectors.Vector; Status : Swagger.Nullable_UString; end record; package Pet_Type_Vectors is new Ada.Containers.Vectors (Index_Type => Positive, Element_Type => Pet_Type); procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class; Name : in String; Value : in Pet_Type); procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class; Name : in String; Value : in Pet_Type_Vectors.Vector); procedure Deserialize (From : in Swagger.Value_Type; Name : in String; Value : out Pet_Type); procedure Deserialize (From : in Swagger.Value_Type; Name : in String; Value : out Pet_Type_Vectors.Vector); -- ------------------------------ -- a User -- A User who is purchasing from the pet store -- ------------------------------ type User_Type is record Id : Swagger.Nullable_Long; Username : Swagger.Nullable_UString; First_Name : Swagger.Nullable_UString; Last_Name : Swagger.Nullable_UString; Email : Swagger.Nullable_UString; Password : Swagger.Nullable_UString; Phone : Swagger.Nullable_UString; User_Status : Swagger.Nullable_Integer; end record; package User_Type_Vectors is new Ada.Containers.Vectors (Index_Type => Positive, Element_Type => User_Type); procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class; Name : in String; Value : in User_Type); procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class; Name : in String; Value : in User_Type_Vectors.Vector); procedure Deserialize (From : in Swagger.Value_Type; Name : in String; Value : out User_Type); procedure Deserialize (From : in Swagger.Value_Type; Name : in String; Value : out User_Type_Vectors.Vector); -- ------------------------------ -- Pet Order -- An order for a pets from the pet store -- ------------------------------ type Order_Type is record Id : Swagger.Nullable_Long; Pet_Id : Swagger.Nullable_Long; Quantity : Swagger.Nullable_Integer; Ship_Date : Swagger.Nullable_Date; Status : Swagger.Nullable_UString; Complete : Swagger.Nullable_Boolean; end record; package Order_Type_Vectors is new Ada.Containers.Vectors (Index_Type => Positive, Element_Type => Order_Type); procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class; Name : in String; Value : in Order_Type); procedure Serialize (Into : in out Swagger.Streams.Output_Stream'Class; Name : in String; Value : in Order_Type_Vectors.Vector); procedure Deserialize (From : in Swagger.Value_Type; Name : in String; Value : out Order_Type); procedure Deserialize (From : in Swagger.Value_Type; Name : in String; Value : out Order_Type_Vectors.Vector); end Samples.Petstore.Models;
34.696429
134
0.541688
31c2a4702601a18fd5974da35072573dde0106d3
7,696
adb
Ada
3-mid/impact/source/2d/dynamics/impact-d2-fixture.adb
charlie5/lace
e9b7dc751d500ff3f559617a6fc3089ace9dc134
[ "0BSD" ]
20
2015-11-04T09:23:59.000Z
2022-01-14T10:21:42.000Z
3-mid/impact/source/2d/dynamics/impact-d2-fixture.adb
charlie5/lace
e9b7dc751d500ff3f559617a6fc3089ace9dc134
[ "0BSD" ]
2
2015-11-04T17:05:56.000Z
2015-12-08T03:16:13.000Z
3-mid/impact/source/2d/dynamics/impact-d2-fixture.adb
charlie5/lace
e9b7dc751d500ff3f559617a6fc3089ace9dc134
[ "0BSD" ]
1
2015-12-07T12:53:52.000Z
2015-12-07T12:53:52.000Z
with impact.d2.Contact, impact.d2.Solid, ada.Unchecked_Deallocation; package body impact.d2.Fixture is use type int32; function getKind (Self : in b2Fixture) return shape.Kind is begin return Self.m_shape.getKind; end getKind; function getShape (Self : in b2Fixture) return access Shape.b2Shape'Class is begin return Self.m_shape; end getShape; procedure setSensor (Self : in out b2Fixture; sensor : Boolean) is begin Self.m_isSensor := sensor; end setSensor; function IsSensor (Self : in b2Fixture) return Boolean is begin return Self.m_isSensor; end IsSensor; function GetFilterData (Self : in b2Fixture) return b2Filter is begin return Self.m_filter; end GetFilterData; procedure SetFilterData (Self : in out b2Fixture; filter : in b2Filter) is edge : access impact.d2.contact.b2ContactEdge; contact : access impact.d2.contact.b2Contact; fixtureA, fixtureB : access b2Fixture; begin Self.m_filter := filter; if Self.m_body = null then return; end if; -- Flag associated contacts for filtering. edge := Self.m_body.getContactList; while edge /= null loop contact := edge.contact; fixtureA := contact.GetFixtureA; fixtureB := contact.GetFixtureB; if fixtureA = Self'Access or else fixtureB = Self'Access then contact.FlagForFiltering; end if; edge := edge.next; end loop; end SetFilterData; function getBody (Self : in b2Fixture) return access Solid.b2Body'Class is begin return Self.m_body; end getBody; function GetNext (Self : in b2Fixture) return access b2Fixture is begin return Self.m_next; end GetNext; function GetUserData (Self : in b2Fixture) return access Any'Class is begin return Self.m_userData; end GetUserData; procedure SetUserData (Self : in out b2Fixture; data : access Any'Class) is begin Self.m_userData := data; end SetUserData; function TestPoint (Self : in b2Fixture; p : in b2Vec2) return Boolean is begin return Self.m_shape.TestPoint (Self.m_body.getTransform, p); end TestPoint; function RayCast (Self : in b2Fixture; output : access collision.b2RayCastOutput; input : in collision.b2RayCastInput; childIndex : in int32) return Boolean is begin return Self.m_shape.RayCast (output, input, Self.m_body.GetTransform); end RayCast; procedure GetMassData (Self : in b2Fixture; massData : access shape.b2MassData) is begin Self.m_shape.computeMass (massData, Self.m_density); end GetMassData; procedure SetDensity (Self : in out b2Fixture; density : in float32) is begin pragma Assert (b2IsValid (density) and then density >= 0.0); Self.m_density := density; end SetDensity; function GetDensity (Self : in b2Fixture) return float32 is begin return Self.m_density; end GetDensity; function GetFriction (Self : in b2Fixture) return float32 is begin return Self.m_friction; end GetFriction; procedure SetFriction (Self : in out b2Fixture; friction : in float32) is begin Self.m_friction := friction; end SetFriction; function GetRestitution (Self : in b2Fixture) return float32 is begin return Self.m_restitution; end GetRestitution; procedure SetRestitution (Self : in out b2Fixture; restitution : in float32) is begin Self.m_restitution := restitution; end SetRestitution; function GetAABB (Self : in b2Fixture) return collision.b2AABB is begin return Self.m_aabb; end GetAABB; procedure destruct (Self : in out b2Fixture) is use type Shape.view; begin pragma Assert (Self.m_shape = null); pragma Assert (Self.m_proxyId = BroadPhase.e_nullProxy); null; end destruct; -- We need separation create/destroy functions from the constructor/destructor because -- the destructor cannot access the allocator (no destructor arguments allowed by C++). -- procedure Create (Self : in out b2Fixture; Solid : access impact.d2.Solid.b2Body; def : in b2FixtureDef) is begin Self.m_body := Solid.all'Unchecked_Access; Self.m_userData := def.userData; Self.m_friction := def.friction; Self.m_restitution := def.restitution; Self.m_filter := def.filter; Self.m_isSensor := def.isSensor; Self.m_shape := def.shape.Clone; Self.m_density := def.density; end Create; procedure Destroy (Self : in out b2Fixture) is procedure free is new ada.Unchecked_Deallocation (Shape.b2Shape'Class, Shape.view); begin -- The proxy must be destroyed before calling this. pragma Assert (Self.m_proxyId = BroadPhase.e_nullProxy); -- Free the child shape. Self.m_shape.destruct; free (Self.m_shape); end Destroy; -- These support body activation/deactivation. -- procedure CreateProxy (Self : in out b2Fixture; broadPhase : access impact.d2.broadphase.b2BroadPhase; xf : in b2Transform) is begin pragma Assert (Self.m_proxyId = impact.d2.BroadPhase.e_nullProxy); -- Create proxy in the broad-phase. Self.m_shape.computeAABB (Self.m_aabb'Access, xf); Self.m_proxyId := broadPhase.createProxy (Self.m_aabb, Self'Access); end CreateProxy; procedure DestroyProxy (Self : in out b2Fixture; broadPhase : access impact.d2.broadphase.b2BroadPhase) is begin if Self.m_proxyId = impact.d2.BroadPhase.e_nullProxy then return; end if; -- Destroy proxy in the broad-phase. broadPhase.destroyProxy (Self.m_proxyId); Self.m_proxyId := impact.d2.BroadPhase.e_nullProxy; end DestroyProxy; procedure Synchronize (Self : in out b2Fixture; broadPhase : access impact.d2.broadphase.b2BroadPhase; xf1, xf2 : in b2Transform) is aabb1, aabb2 : aliased collision.b2AABB; displacement : b2Vec2; begin if Self.m_proxyId = impact.d2.BroadPhase.e_nullProxy then return; end if; -- Compute an AABB that covers the swept shape (may miss some rotation effect). Self.m_shape.ComputeAABB (aabb1'Access, xf1); Self.m_shape.ComputeAABB (aabb2'Access, xf2); collision.Combine (Self.m_aabb, aabb1, aabb2); displacement := xf2.position - xf1.position; broadPhase.MoveProxy (Self.m_proxyId, Self.m_aabb, displacement); end Synchronize; --- 'protected' subprograms for use by C 'friend's. -- function m_proxyId (Self : in b2Fixture) return int32 is begin return Self.m_proxyId; end m_proxyId; procedure m_next_is (Self : in out b2Fixture; Now : in Fixture.view) is begin Self.m_next := Now; end m_next_is; procedure m_body_is (Self : in out b2Fixture; Now : in Solid_view) is begin Self.m_body := Now; end m_body_is; procedure free (Self : in out View) is procedure deallocate is new ada.Unchecked_Deallocation (b2Fixture'Class, View); begin deallocate (Self); end free; end impact.d2.Fixture;
21.027322
108
0.636305
046639d805629133390e8f7b5959e0c199e60869
5,995
ads
Ada
arch/ARM/STM32/svd/stm32l4x2/stm32_svd-crs.ads
morbos/Ada_Drivers_Library
a4ab26799be60997c38735f4056160c4af597ef7
[ "BSD-3-Clause" ]
2
2018-05-16T03:56:39.000Z
2019-07-31T13:53:56.000Z
arch/ARM/STM32/svd/stm32l4x2/stm32_svd-crs.ads
morbos/Ada_Drivers_Library
a4ab26799be60997c38735f4056160c4af597ef7
[ "BSD-3-Clause" ]
null
null
null
arch/ARM/STM32/svd/stm32l4x2/stm32_svd-crs.ads
morbos/Ada_Drivers_Library
a4ab26799be60997c38735f4056160c4af597ef7
[ "BSD-3-Clause" ]
null
null
null
-- This spec has been automatically generated from STM32L4x2.svd pragma Restrictions (No_Elaboration_Code); pragma Ada_2012; pragma Style_Checks (Off); with HAL; with System; package STM32_SVD.CRS is pragma Preelaborate; --------------- -- Registers -- --------------- subtype CR_TRIM_Field is HAL.UInt6; -- control register type CR_Register is record -- SYNC event OK interrupt enable SYNCOKIE : Boolean := False; -- SYNC warning interrupt enable SYNCWARNIE : Boolean := False; -- Synchronization or trimming error interrupt enable ERRIE : Boolean := False; -- Expected SYNC interrupt enable ESYNCIE : Boolean := False; -- unspecified Reserved_4_4 : HAL.Bit := 16#0#; -- Frequency error counter enable CEN : Boolean := False; -- Automatic trimming enable AUTOTRIMEN : Boolean := False; -- Generate software SYNC event SWSYNC : Boolean := False; -- HSI48 oscillator smooth trimming TRIM : CR_TRIM_Field := 16#20#; -- unspecified Reserved_14_31 : HAL.UInt18 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CR_Register use record SYNCOKIE at 0 range 0 .. 0; SYNCWARNIE at 0 range 1 .. 1; ERRIE at 0 range 2 .. 2; ESYNCIE at 0 range 3 .. 3; Reserved_4_4 at 0 range 4 .. 4; CEN at 0 range 5 .. 5; AUTOTRIMEN at 0 range 6 .. 6; SWSYNC at 0 range 7 .. 7; TRIM at 0 range 8 .. 13; Reserved_14_31 at 0 range 14 .. 31; end record; subtype CFGR_RELOAD_Field is HAL.UInt16; subtype CFGR_FELIM_Field is HAL.UInt8; subtype CFGR_SYNCDIV_Field is HAL.UInt3; subtype CFGR_SYNCSRC_Field is HAL.UInt2; -- configuration register type CFGR_Register is record -- Counter reload value RELOAD : CFGR_RELOAD_Field := 16#BB7F#; -- Frequency error limit FELIM : CFGR_FELIM_Field := 16#22#; -- SYNC divider SYNCDIV : CFGR_SYNCDIV_Field := 16#0#; -- unspecified Reserved_27_27 : HAL.Bit := 16#0#; -- SYNC signal source selection SYNCSRC : CFGR_SYNCSRC_Field := 16#2#; -- unspecified Reserved_30_30 : HAL.Bit := 16#0#; -- SYNC polarity selection SYNCPOL : Boolean := False; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for CFGR_Register use record RELOAD at 0 range 0 .. 15; FELIM at 0 range 16 .. 23; SYNCDIV at 0 range 24 .. 26; Reserved_27_27 at 0 range 27 .. 27; SYNCSRC at 0 range 28 .. 29; Reserved_30_30 at 0 range 30 .. 30; SYNCPOL at 0 range 31 .. 31; end record; subtype ISR_FECAP_Field is HAL.UInt16; -- interrupt and status register type ISR_Register is record -- Read-only. SYNC event OK flag SYNCOKF : Boolean; -- Read-only. SYNC warning flag SYNCWARNF : Boolean; -- Read-only. Error flag ERRF : Boolean; -- Read-only. Expected SYNC flag ESYNCF : Boolean; -- unspecified Reserved_4_7 : HAL.UInt4; -- Read-only. SYNC error SYNCERR : Boolean; -- Read-only. SYNC missed SYNCMISS : Boolean; -- Read-only. Trimming overflow or underflow TRIMOVF : Boolean; -- unspecified Reserved_11_14 : HAL.UInt4; -- Read-only. Frequency error direction FEDIR : Boolean; -- Read-only. Frequency error capture FECAP : ISR_FECAP_Field; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for ISR_Register use record SYNCOKF at 0 range 0 .. 0; SYNCWARNF at 0 range 1 .. 1; ERRF at 0 range 2 .. 2; ESYNCF at 0 range 3 .. 3; Reserved_4_7 at 0 range 4 .. 7; SYNCERR at 0 range 8 .. 8; SYNCMISS at 0 range 9 .. 9; TRIMOVF at 0 range 10 .. 10; Reserved_11_14 at 0 range 11 .. 14; FEDIR at 0 range 15 .. 15; FECAP at 0 range 16 .. 31; end record; -- interrupt flag clear register type ICR_Register is record -- SYNC event OK clear flag SYNCOKC : Boolean := False; -- SYNC warning clear flag SYNCWARNC : Boolean := False; -- Error clear flag ERRC : Boolean := False; -- Expected SYNC clear flag ESYNCC : Boolean := False; -- unspecified Reserved_4_31 : HAL.UInt28 := 16#0#; end record with Volatile_Full_Access, Size => 32, Bit_Order => System.Low_Order_First; for ICR_Register use record SYNCOKC at 0 range 0 .. 0; SYNCWARNC at 0 range 1 .. 1; ERRC at 0 range 2 .. 2; ESYNCC at 0 range 3 .. 3; Reserved_4_31 at 0 range 4 .. 31; end record; ----------------- -- Peripherals -- ----------------- -- Clock recovery system type CRS_Peripheral is record -- control register CR : aliased CR_Register; -- configuration register CFGR : aliased CFGR_Register; -- interrupt and status register ISR : aliased ISR_Register; -- interrupt flag clear register ICR : aliased ICR_Register; end record with Volatile; for CRS_Peripheral use record CR at 16#0# range 0 .. 31; CFGR at 16#4# range 0 .. 31; ISR at 16#8# range 0 .. 31; ICR at 16#C# range 0 .. 31; end record; -- Clock recovery system CRS_Periph : aliased CRS_Peripheral with Import, Address => System'To_Address (16#40006000#); end STM32_SVD.CRS;
31.552632
65
0.566639
9a1ba6c0e3afdb14022a34f044ca84f582942c8b
65,766
adb
Ada
boards/ip_colordetect_test/colordetect/colordetect/.autopilot/db/Block_ZN2xf2cv3MatILi9ELi2160ELi3840ELi1ELi2EEC2Eii_exit2_proc.sched.adb
Kgfu/PYNQ_HelloWorld
a5197130e7d4a5e7f382c3963349c1c0bd213213
[ "BSD-3-Clause" ]
null
null
null
boards/ip_colordetect_test/colordetect/colordetect/.autopilot/db/Block_ZN2xf2cv3MatILi9ELi2160ELi3840ELi1ELi2EEC2Eii_exit2_proc.sched.adb
Kgfu/PYNQ_HelloWorld
a5197130e7d4a5e7f382c3963349c1c0bd213213
[ "BSD-3-Clause" ]
null
null
null
boards/ip_colordetect_test/colordetect/colordetect/.autopilot/db/Block_ZN2xf2cv3MatILi9ELi2160ELi3840ELi1ELi2EEC2Eii_exit2_proc.sched.adb
Kgfu/PYNQ_HelloWorld
a5197130e7d4a5e7f382c3963349c1c0bd213213
[ "BSD-3-Clause" ]
null
null
null
<?xml version="1.0" encoding="UTF-8" standalone="yes" ?> <!DOCTYPE boost_serialization> <boost_serialization signature="serialization::archive" version="15"> <syndb class_id="0" tracking_level="0" version="0"> <userIPLatency>-1</userIPLatency> <userIPName></userIPName> <cdfg class_id="1" tracking_level="1" version="0" object_id="_0"> <name>Block_ZN2xf2cv3MatILi9ELi2160ELi3840ELi1ELi2EEC2Eii_exit2_proc</name> <ret_bitwidth>0</ret_bitwidth> <ports class_id="2" tracking_level="0" version="0"> <count>16</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>rows</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo class_id="6" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <direction>0</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs class_id="7" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_2"> <Value> <Obj> <type>1</type> <id>2</id> <name>cols</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>49</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <direction>0</direction> <if_type>3</if_type> <array_size>0</array_size> <bit_vecs> <count>0</count> <item_version>0</item_version> </bit_vecs> </item> <item class_id_reference="3" object_id="_3"> <Value> <Obj> <type>1</type> <id>3</id> <name>imgInput_rows_out</name> <fileName>src/xf_colordetect_accel_stream.cpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>155</lineNumber> <contextFuncName>colordetect_accel</contextFuncName> <contextNormFuncName>colordetect_accel</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item class_id="8" tracking_level="0" version="0"> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second class_id="9" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="10" tracking_level="0" version="0"> <first class_id="11" tracking_level="0" version="0"> <first>src/xf_colordetect_accel_stream.cpp</first> <second>colordetect_accel</second> </first> <second>155</second> </item> </second> </item> </inlineStackInfo> <originalName>imgInput.rows</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>3405245360</coreId> </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="_4"> <Value> <Obj> <type>1</type> <id>4</id> <name>imgInput_cols_out</name> <fileName>src/xf_colordetect_accel_stream.cpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>155</lineNumber> <contextFuncName>colordetect_accel</contextFuncName> <contextNormFuncName>colordetect_accel</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>src/xf_colordetect_accel_stream.cpp</first> <second>colordetect_accel</second> </first> <second>155</second> </item> </second> </item> </inlineStackInfo> <originalName>imgInput.cols</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </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>rgb2hsv_rows_out</name> <fileName>src/xf_colordetect_accel_stream.cpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>156</lineNumber> <contextFuncName>colordetect_accel</contextFuncName> <contextNormFuncName>colordetect_accel</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>src/xf_colordetect_accel_stream.cpp</first> <second>colordetect_accel</second> </first> <second>156</second> </item> </second> </item> </inlineStackInfo> <originalName>rgb2hsv.rows</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>129</coreId> </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>rgb2hsv_cols_out</name> <fileName>src/xf_colordetect_accel_stream.cpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>156</lineNumber> <contextFuncName>colordetect_accel</contextFuncName> <contextNormFuncName>colordetect_accel</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>src/xf_colordetect_accel_stream.cpp</first> <second>colordetect_accel</second> </first> <second>156</second> </item> </second> </item> </inlineStackInfo> <originalName>rgb2hsv.cols</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>161</coreId> </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="_7"> <Value> <Obj> <type>1</type> <id>7</id> <name>imgHelper1_rows_out</name> <fileName>src/xf_colordetect_accel_stream.cpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>colordetect_accel</contextFuncName> <contextNormFuncName>colordetect_accel</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>src/xf_colordetect_accel_stream.cpp</first> <second>colordetect_accel</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName>imgHelper1.rows</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>49</coreId> </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="_8"> <Value> <Obj> <type>1</type> <id>8</id> <name>imgHelper1_cols_out</name> <fileName>src/xf_colordetect_accel_stream.cpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>158</lineNumber> <contextFuncName>colordetect_accel</contextFuncName> <contextNormFuncName>colordetect_accel</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>src/xf_colordetect_accel_stream.cpp</first> <second>colordetect_accel</second> </first> <second>158</second> </item> </second> </item> </inlineStackInfo> <originalName>imgHelper1.cols</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>305</coreId> </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="_9"> <Value> <Obj> <type>1</type> <id>9</id> <name>imgHelper2_rows_out</name> <fileName>src/xf_colordetect_accel_stream.cpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>159</lineNumber> <contextFuncName>colordetect_accel</contextFuncName> <contextNormFuncName>colordetect_accel</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>src/xf_colordetect_accel_stream.cpp</first> <second>colordetect_accel</second> </first> <second>159</second> </item> </second> </item> </inlineStackInfo> <originalName>imgHelper2.rows</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>3405527033</coreId> </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="_10"> <Value> <Obj> <type>1</type> <id>10</id> <name>imgHelper2_cols_out</name> <fileName>src/xf_colordetect_accel_stream.cpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>159</lineNumber> <contextFuncName>colordetect_accel</contextFuncName> <contextNormFuncName>colordetect_accel</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>src/xf_colordetect_accel_stream.cpp</first> <second>colordetect_accel</second> </first> <second>159</second> </item> </second> </item> </inlineStackInfo> <originalName>imgHelper2.cols</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>49</coreId> </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="_11"> <Value> <Obj> <type>1</type> <id>11</id> <name>imgHelper3_rows_out</name> <fileName>src/xf_colordetect_accel_stream.cpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>160</lineNumber> <contextFuncName>colordetect_accel</contextFuncName> <contextNormFuncName>colordetect_accel</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>src/xf_colordetect_accel_stream.cpp</first> <second>colordetect_accel</second> </first> <second>160</second> </item> </second> </item> </inlineStackInfo> <originalName>imgHelper3.rows</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1</coreId> </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="_12"> <Value> <Obj> <type>1</type> <id>12</id> <name>imgHelper3_cols_out</name> <fileName>src/xf_colordetect_accel_stream.cpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>160</lineNumber> <contextFuncName>colordetect_accel</contextFuncName> <contextNormFuncName>colordetect_accel</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>src/xf_colordetect_accel_stream.cpp</first> <second>colordetect_accel</second> </first> <second>160</second> </item> </second> </item> </inlineStackInfo> <originalName>imgHelper3.cols</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>545</coreId> </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="_13"> <Value> <Obj> <type>1</type> <id>13</id> <name>imgHelper4_rows_out</name> <fileName>src/xf_colordetect_accel_stream.cpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>161</lineNumber> <contextFuncName>colordetect_accel</contextFuncName> <contextNormFuncName>colordetect_accel</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>src/xf_colordetect_accel_stream.cpp</first> <second>colordetect_accel</second> </first> <second>161</second> </item> </second> </item> </inlineStackInfo> <originalName>imgHelper4.rows</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>132</coreId> </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="_14"> <Value> <Obj> <type>1</type> <id>14</id> <name>imgHelper4_cols_out</name> <fileName>src/xf_colordetect_accel_stream.cpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>161</lineNumber> <contextFuncName>colordetect_accel</contextFuncName> <contextNormFuncName>colordetect_accel</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>src/xf_colordetect_accel_stream.cpp</first> <second>colordetect_accel</second> </first> <second>161</second> </item> </second> </item> </inlineStackInfo> <originalName>imgHelper4.cols</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>49</coreId> </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="_15"> <Value> <Obj> <type>1</type> <id>15</id> <name>imgOutput_rows_out</name> <fileName>src/xf_colordetect_accel_stream.cpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>162</lineNumber> <contextFuncName>colordetect_accel</contextFuncName> <contextNormFuncName>colordetect_accel</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>src/xf_colordetect_accel_stream.cpp</first> <second>colordetect_accel</second> </first> <second>162</second> </item> </second> </item> </inlineStackInfo> <originalName>imgOutput.rows</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>913</coreId> </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="_16"> <Value> <Obj> <type>1</type> <id>16</id> <name>imgOutput_cols_out</name> <fileName>src/xf_colordetect_accel_stream.cpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>162</lineNumber> <contextFuncName>colordetect_accel</contextFuncName> <contextNormFuncName>colordetect_accel</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>src/xf_colordetect_accel_stream.cpp</first> <second>colordetect_accel</second> </first> <second>162</second> </item> </second> </item> </inlineStackInfo> <originalName>imgOutput.cols</originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </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="12" tracking_level="0" version="0"> <count>17</count> <item_version>0</item_version> <item class_id="13" tracking_level="1" version="0" object_id="_17"> <Value> <Obj> <type>0</type> <id>33</id> <name>rows_read</name> <fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>614</lineNumber> <contextFuncName>init</contextFuncName> <contextNormFuncName>init</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</first> <second>init</second> </first> <second>614</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>52</item> <item>53</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>3.40</m_delay> <m_topoIndex>1</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="13" object_id="_18"> <Value> <Obj> <type>0</type> <id>34</id> <name>cols_read</name> <fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>615</lineNumber> <contextFuncName>init</contextFuncName> <contextNormFuncName>init</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</first> <second>init</second> </first> <second>615</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>116</coreId> </Obj> <bitwidth>32</bitwidth> </Value> <oprand_edges> <count>2</count> <item_version>0</item_version> <item>54</item> <item>55</item> </oprand_edges> <opcode>read</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>3.40</m_delay> <m_topoIndex>2</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="13" object_id="_19"> <Value> <Obj> <type>0</type> <id>35</id> <name>imgInput_rows_out_write_ln614</name> <fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>614</lineNumber> <contextFuncName>init</contextFuncName> <contextNormFuncName>init</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</first> <second>init</second> </first> <second>614</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>3405590104</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>57</item> <item>58</item> <item>59</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>3.40</m_delay> <m_topoIndex>3</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="13" object_id="_20"> <Value> <Obj> <type>0</type> <id>36</id> <name>imgInput_cols_out_write_ln615</name> <fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>615</lineNumber> <contextFuncName>init</contextFuncName> <contextNormFuncName>init</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</first> <second>init</second> </first> <second>615</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>49</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>60</item> <item>61</item> <item>62</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>3.40</m_delay> <m_topoIndex>4</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="13" object_id="_21"> <Value> <Obj> <type>0</type> <id>37</id> <name>rgb2hsv_rows_out_write_ln614</name> <fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>614</lineNumber> <contextFuncName>init</contextFuncName> <contextNormFuncName>init</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</first> <second>init</second> </first> <second>614</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>63</item> <item>64</item> <item>65</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>3.40</m_delay> <m_topoIndex>5</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="13" object_id="_22"> <Value> <Obj> <type>0</type> <id>38</id> <name>rgb2hsv_cols_out_write_ln615</name> <fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>615</lineNumber> <contextFuncName>init</contextFuncName> <contextNormFuncName>init</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</first> <second>init</second> </first> <second>615</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1345</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>66</item> <item>67</item> <item>68</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>3.40</m_delay> <m_topoIndex>6</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="13" object_id="_23"> <Value> <Obj> <type>0</type> <id>39</id> <name>imgHelper1_rows_out_write_ln614</name> <fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>614</lineNumber> <contextFuncName>init</contextFuncName> <contextNormFuncName>init</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</first> <second>init</second> </first> <second>614</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>132</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>69</item> <item>70</item> <item>71</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>3.36</m_delay> <m_topoIndex>7</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="13" object_id="_24"> <Value> <Obj> <type>0</type> <id>40</id> <name>imgHelper1_cols_out_write_ln615</name> <fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>615</lineNumber> <contextFuncName>init</contextFuncName> <contextNormFuncName>init</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</first> <second>init</second> </first> <second>615</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>49</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>72</item> <item>73</item> <item>74</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>3.36</m_delay> <m_topoIndex>8</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="13" object_id="_25"> <Value> <Obj> <type>0</type> <id>41</id> <name>imgHelper2_rows_out_write_ln614</name> <fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>614</lineNumber> <contextFuncName>init</contextFuncName> <contextNormFuncName>init</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</first> <second>init</second> </first> <second>614</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>305</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>75</item> <item>76</item> <item>77</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>3.32</m_delay> <m_topoIndex>9</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="13" object_id="_26"> <Value> <Obj> <type>0</type> <id>42</id> <name>imgHelper2_cols_out_write_ln615</name> <fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>615</lineNumber> <contextFuncName>init</contextFuncName> <contextNormFuncName>init</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</first> <second>init</second> </first> <second>615</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>132</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>78</item> <item>79</item> <item>80</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>3.32</m_delay> <m_topoIndex>10</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="13" object_id="_27"> <Value> <Obj> <type>0</type> <id>43</id> <name>imgHelper3_rows_out_write_ln614</name> <fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>614</lineNumber> <contextFuncName>init</contextFuncName> <contextNormFuncName>init</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</first> <second>init</second> </first> <second>614</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>3405842408</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>81</item> <item>82</item> <item>83</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>3.28</m_delay> <m_topoIndex>11</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="13" object_id="_28"> <Value> <Obj> <type>0</type> <id>44</id> <name>imgHelper3_cols_out_write_ln615</name> <fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>615</lineNumber> <contextFuncName>init</contextFuncName> <contextNormFuncName>init</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</first> <second>init</second> </first> <second>615</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1569</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>84</item> <item>85</item> <item>86</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>3.28</m_delay> <m_topoIndex>12</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="13" object_id="_29"> <Value> <Obj> <type>0</type> <id>45</id> <name>imgHelper4_rows_out_write_ln614</name> <fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>614</lineNumber> <contextFuncName>init</contextFuncName> <contextNormFuncName>init</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</first> <second>init</second> </first> <second>614</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>3404947672</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>87</item> <item>88</item> <item>89</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>3.24</m_delay> <m_topoIndex>13</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="13" object_id="_30"> <Value> <Obj> <type>0</type> <id>46</id> <name>imgHelper4_cols_out_write_ln615</name> <fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>615</lineNumber> <contextFuncName>init</contextFuncName> <contextNormFuncName>init</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</first> <second>init</second> </first> <second>615</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>0</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>90</item> <item>91</item> <item>92</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>3.24</m_delay> <m_topoIndex>14</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="13" object_id="_31"> <Value> <Obj> <type>0</type> <id>47</id> <name>imgOutput_rows_out_write_ln614</name> <fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>614</lineNumber> <contextFuncName>init</contextFuncName> <contextNormFuncName>init</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</first> <second>init</second> </first> <second>614</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>49</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>93</item> <item>94</item> <item>95</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>3.26</m_delay> <m_topoIndex>15</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="13" object_id="_32"> <Value> <Obj> <type>0</type> <id>48</id> <name>imgOutput_cols_out_write_ln615</name> <fileName>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>615</lineNumber> <contextFuncName>init</contextFuncName> <contextNormFuncName>init</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip/vitis_lib/vision/L1/include/common/xf_structs.hpp</first> <second>init</second> </first> <second>615</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>132</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>3</count> <item_version>0</item_version> <item>96</item> <item>97</item> <item>98</item> </oprand_edges> <opcode>write</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>3.26</m_delay> <m_topoIndex>16</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> <item class_id_reference="13" object_id="_33"> <Value> <Obj> <type>0</type> <id>49</id> <name>_ln132</name> <fileName>src/xf_colordetect_accel_stream.cpp</fileName> <fileDirectory>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</fileDirectory> <lineNumber>132</lineNumber> <contextFuncName>colordetect_accel</contextFuncName> <contextNormFuncName>colordetect_accel</contextNormFuncName> <inlineStackInfo> <count>1</count> <item_version>0</item_version> <item> <first>/home/willychiang/Desktop/PYNQ-HelloWorld/boards/ip</first> <second> <count>1</count> <item_version>0</item_version> <item> <first> <first>src/xf_colordetect_accel_stream.cpp</first> <second>colordetect_accel</second> </first> <second>132</second> </item> </second> </item> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>3406190656</coreId> </Obj> <bitwidth>0</bitwidth> </Value> <oprand_edges> <count>0</count> <item_version>0</item_version> </oprand_edges> <opcode>ret</opcode> <m_Display>0</m_Display> <m_isOnCriticalPath>0</m_isOnCriticalPath> <m_isLCDNode>0</m_isLCDNode> <m_isStartOfPath>0</m_isStartOfPath> <m_delay>0.00</m_delay> <m_topoIndex>17</m_topoIndex> <m_clusterGroupNumber>-1</m_clusterGroupNumber> </item> </nodes> <consts class_id="15" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </consts> <blocks 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="_34"> <Obj> <type>3</type> <id>50</id> <name>Block__ZN2xf2cv3MatILi9ELi2160ELi3840ELi1ELi2EEC2Eii.exit2_proc</name> <fileName></fileName> <fileDirectory></fileDirectory> <lineNumber>0</lineNumber> <contextFuncName></contextFuncName> <contextNormFuncName></contextNormFuncName> <inlineStackInfo> <count>0</count> <item_version>0</item_version> </inlineStackInfo> <originalName></originalName> <rtlName></rtlName> <control></control> <opType></opType> <implIndex></implIndex> <coreName></coreName> <coreId>1768189039</coreId> </Obj> <node_objs> <count>17</count> <item_version>0</item_version> <item>33</item> <item>34</item> <item>35</item> <item>36</item> <item>37</item> <item>38</item> <item>39</item> <item>40</item> <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> </node_objs> </item> </blocks> <edges class_id="18" tracking_level="0" version="0"> <count>30</count> <item_version>0</item_version> <item class_id="19" tracking_level="1" version="0" object_id="_35"> <id>53</id> <edge_type>1</edge_type> <source_obj>1</source_obj> <sink_obj>33</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_36"> <id>55</id> <edge_type>1</edge_type> <source_obj>2</source_obj> <sink_obj>34</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_37"> <id>58</id> <edge_type>1</edge_type> <source_obj>3</source_obj> <sink_obj>35</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_38"> <id>59</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>35</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_39"> <id>61</id> <edge_type>1</edge_type> <source_obj>4</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_40"> <id>62</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>36</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_41"> <id>64</id> <edge_type>1</edge_type> <source_obj>5</source_obj> <sink_obj>37</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_42"> <id>65</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>37</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_43"> <id>67</id> <edge_type>1</edge_type> <source_obj>6</source_obj> <sink_obj>38</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_44"> <id>68</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>38</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_45"> <id>70</id> <edge_type>1</edge_type> <source_obj>7</source_obj> <sink_obj>39</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_46"> <id>71</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>39</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_47"> <id>73</id> <edge_type>1</edge_type> <source_obj>8</source_obj> <sink_obj>40</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_48"> <id>74</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>40</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_49"> <id>76</id> <edge_type>1</edge_type> <source_obj>9</source_obj> <sink_obj>41</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_50"> <id>77</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>41</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_51"> <id>79</id> <edge_type>1</edge_type> <source_obj>10</source_obj> <sink_obj>42</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_52"> <id>80</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>42</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_53"> <id>82</id> <edge_type>1</edge_type> <source_obj>11</source_obj> <sink_obj>43</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_54"> <id>83</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>43</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_55"> <id>85</id> <edge_type>1</edge_type> <source_obj>12</source_obj> <sink_obj>44</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_56"> <id>86</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>44</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_57"> <id>88</id> <edge_type>1</edge_type> <source_obj>13</source_obj> <sink_obj>45</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_58"> <id>89</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>45</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_59"> <id>91</id> <edge_type>1</edge_type> <source_obj>14</source_obj> <sink_obj>46</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_60"> <id>92</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>46</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_61"> <id>94</id> <edge_type>1</edge_type> <source_obj>15</source_obj> <sink_obj>47</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_62"> <id>95</id> <edge_type>1</edge_type> <source_obj>33</source_obj> <sink_obj>47</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_63"> <id>97</id> <edge_type>1</edge_type> <source_obj>16</source_obj> <sink_obj>48</sink_obj> <is_back_edge>0</is_back_edge> </item> <item class_id_reference="19" object_id="_64"> <id>98</id> <edge_type>1</edge_type> <source_obj>34</source_obj> <sink_obj>48</sink_obj> <is_back_edge>0</is_back_edge> </item> </edges> </cdfg> <cdfg_regions 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="_65"> <mId>1</mId> <mTag>Block__ZN2xf2cv3MatILi9ELi2160ELi3840ELi1ELi2EEC2Eii.exit2_proc</mTag> <mNormTag>Block_ZN2xf2cv3MatILi9ELi2160ELi3840ELi1ELi2EEC2Eii_exit2_proc</mNormTag> <mType>0</mType> <sub_regions> <count>0</count> <item_version>0</item_version> </sub_regions> <basic_blocks> <count>1</count> <item_version>0</item_version> <item>50</item> </basic_blocks> <mII>-1</mII> <mDepth>-1</mDepth> <mMinTripCount>-1</mMinTripCount> <mMaxTripCount>-1</mMaxTripCount> <mMinLatency>0</mMinLatency> <mMaxLatency>0</mMaxLatency> <mIsDfPipe>0</mIsDfPipe> <mDfPipe class_id="-1"></mDfPipe> </item> </cdfg_regions> <fsm class_id="-1"></fsm> <res class_id="-1"></res> <node_label_latency class_id="25" tracking_level="0" version="0"> <count>17</count> <item_version>0</item_version> <item class_id="26" tracking_level="0" version="0"> <first>33</first> <second class_id="27" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> <item> <first>34</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>35</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>36</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>37</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>38</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>39</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>40</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>41</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>42</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>43</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>44</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>45</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>46</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>47</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>48</first> <second> <first>0</first> <second>0</second> </second> </item> <item> <first>49</first> <second> <first>0</first> <second>0</second> </second> </item> </node_label_latency> <bblk_ent_exit class_id="28" tracking_level="0" version="0"> <count>1</count> <item_version>0</item_version> <item class_id="29" tracking_level="0" version="0"> <first>50</first> <second class_id="30" tracking_level="0" version="0"> <first>0</first> <second>0</second> </second> </item> </bblk_ent_exit> <regions class_id="31" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </regions> <dp_fu_nodes class_id="32" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_fu_nodes> <dp_fu_nodes_expression class_id="33" 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="34" 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="35" tracking_level="0" version="0"> <count>0</count> <item_version>0</item_version> </dp_port_io_nodes> <port2core> <count>0</count> <item_version>0</item_version> </port2core> <node2core> <count>0</count> <item_version>0</item_version> </node2core> </syndb> </boost_serialization>
30.433133
128
0.622905
c73824e5fe60ecedce5f6298a900eaff931804f2
5,283
ads
Ada
src/gnat/gnatvsn.ads
Letractively/ada-gen
d06d03821057f9177f2350e32dd09e467df08612
[ "Apache-2.0" ]
null
null
null
src/gnat/gnatvsn.ads
Letractively/ada-gen
d06d03821057f9177f2350e32dd09e467df08612
[ "Apache-2.0" ]
null
null
null
src/gnat/gnatvsn.ads
Letractively/ada-gen
d06d03821057f9177f2350e32dd09e467df08612
[ "Apache-2.0" ]
null
null
null
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- G N A T V S N -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2010, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- 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 spec holds version information for the GNAT tools. -- It is updated whenever the release number is changed. package Gnatvsn is Gnat_Static_Version_String : constant String := "GNU Ada"; -- Static string identifying this version, that can be used as an argument -- to e.g. pragma Ident. function Gnat_Version_String return String; -- Version output when GNAT (compiler), or its related tools, including -- GNATBIND, GNATCHOP, GNATFIND, GNATLINK, GNATMAKE, GNATXREF, are run -- (with appropriate verbose option switch set). type Gnat_Build_Type is (FSF, GPL); -- See Build_Type below for the meaning of these values. Build_Type : constant Gnat_Build_Type := FSF; -- Kind of GNAT build: -- -- FSF -- GNAT FSF version. This version of GNAT is part of a Free Software -- Foundation release of the GNU Compiler Collection (GCC). The bug -- box generated by Comperr gives information on how to report bugs -- and list the "no warranty" information. -- -- GPL -- GNAT GPL Edition. This is a special version of GNAT, released by -- Ada Core Technologies and intended for academic users, and free -- software developers. The bug box generated by the package Comperr -- gives appropriate bug submission instructions that do not reference -- customer number etc. function Gnat_Free_Software return String; -- Text to be displayed by the different GNAT tools when switch --version -- is used. This text depends on the GNAT build type. function Copyright_Holder return String; -- Return the name of the Copyright holder to be displayed by the different -- GNAT tools when switch --version is used. Ver_Len_Max : constant := 256; -- Longest possible length for Gnat_Version_String in this or any -- other version of GNAT. This is used by the binder to establish -- space to store any possible version string value for checks. This -- value should never be decreased in the future, but it would be -- OK to increase it if absolutely necessary. If it is increased, -- be sure to increase GNAT.Compiler.Version.Ver_Len_Max as well. Ver_Prefix : constant String := "GNAT Version: "; -- Prefix generated by binder. If it is changed, be sure to change -- GNAT.Compiler_Version.Ver_Prefix as well. Library_Version : constant String := "4.6"; -- Library version. This value must be updated when the compiler -- version number Gnat_Static_Version_String is updated. -- -- Note: Makefile.in uses the library version string to construct the -- soname value. Verbose_Library_Version : constant String := "GNAT Lib v" & Library_Version; -- Version string stored in e.g. ALI files Current_Year : constant String := "2010"; -- Used in printing copyright messages end Gnatvsn;
53.363636
79
0.549309
589fd8d40b837a6b7880707548922b9613c1fd8b
63,058
ads
Ada
src/fonts/geste_fonts-freesansoblique12pt7b.ads
Fabien-Chouteau/GESTE
5ac814906fdb49d880db60cbb17279cbbb777336
[ "BSD-3-Clause" ]
13
2018-07-31T12:11:46.000Z
2021-11-19T14:16:46.000Z
src/fonts/geste_fonts-freesansoblique12pt7b.ads
gregkrsak/GESTE
5ac814906fdb49d880db60cbb17279cbbb777336
[ "BSD-3-Clause" ]
1
2018-10-22T21:41:59.000Z
2018-10-22T21:41:59.000Z
src/fonts/geste_fonts-freesansoblique12pt7b.ads
gregkrsak/GESTE
5ac814906fdb49d880db60cbb17279cbbb777336
[ "BSD-3-Clause" ]
4
2020-07-03T10:03:13.000Z
2022-02-10T03:35:07.000Z
package GESTE_Fonts.FreeSansOblique12pt7b is Font : constant Bitmap_Font_Ref; private FreeSansOblique12pt7bBitmaps : aliased constant Font_Bitmap := ( 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#04#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#, 16#10#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#30#, 16#00#, 16#0E#, 16#E0#, 16#00#, 16#19#, 16#80#, 16#00#, 16#33#, 16#00#, 16#00#, 16#66#, 16#00#, 16#00#, 16#88#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#31#, 16#80#, 16#00#, 16#63#, 16#00#, 16#00#, 16#CC#, 16#00#, 16#03#, 16#18#, 16#00#, 16#06#, 16#30#, 16#00#, 16#7F#, 16#F0#, 16#00#, 16#FF#, 16#E0#, 16#00#, 16#63#, 16#00#, 16#01#, 16#8C#, 16#00#, 16#03#, 16#18#, 16#00#, 16#04#, 16#60#, 16#00#, 16#7F#, 16#F0#, 16#01#, 16#FF#, 16#E0#, 16#00#, 16#46#, 16#00#, 16#01#, 16#8C#, 16#00#, 16#03#, 16#10#, 16#00#, 16#0C#, 16#60#, 16#00#, 16#18#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#0C#, 16#9C#, 16#00#, 16#31#, 16#18#, 16#00#, 16#62#, 16#30#, 16#00#, 16#CC#, 16#00#, 16#01#, 16#98#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#03#, 16#38#, 16#00#, 16#C4#, 16#70#, 16#01#, 16#88#, 16#C0#, 16#03#, 16#31#, 16#80#, 16#07#, 16#66#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#07#, 16#E0#, 16#00#, 16#02#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#10#, 16#03#, 16#C0#, 16#60#, 16#0F#, 16#C1#, 16#80#, 16#31#, 16#C6#, 16#00#, 16#C1#, 16#88#, 16#01#, 16#82#, 16#30#, 16#03#, 16#0C#, 16#C0#, 16#03#, 16#F3#, 16#00#, 16#03#, 16#C4#, 16#00#, 16#00#, 16#10#, 16#F0#, 16#00#, 16#63#, 16#F0#, 16#01#, 16#8C#, 16#60#, 16#02#, 16#30#, 16#40#, 16#08#, 16#60#, 16#80#, 16#30#, 16#C7#, 16#00#, 16#C0#, 16#FC#, 16#03#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#07#, 16#18#, 16#00#, 16#0C#, 16#30#, 16#00#, 16#18#, 16#60#, 16#00#, 16#31#, 16#80#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#70#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#0E#, 16#E6#, 16#00#, 16#30#, 16#EC#, 16#00#, 16#C0#, 16#F0#, 16#01#, 16#81#, 16#C0#, 16#03#, 16#03#, 16#80#, 16#07#, 16#0F#, 16#80#, 16#07#, 16#F3#, 16#00#, 16#07#, 16#C7#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#10#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#80#, 16#00#, 16#02#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#04#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#20#, 16#00#, 16#00#, 16#40#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#02#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#04#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#40#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#20#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#05#, 16#A0#, 16#00#, 16#1F#, 16#C0#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#6C#, 16#00#, 16#00#, 16#90#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#80#, 16#00#, 16#7F#, 16#F8#, 16#00#, 16#FF#, 16#F0#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#20#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#20#, 16#00#, 16#00#, 16#40#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#10#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#04#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#20#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#00#, 16#00#, 16#04#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#, 16#20#, 16#00#, 16#00#, 16#40#, 16#00#, 16#01#, 16#00#, 16#00#, 16#02#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#40#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#78#, 16#00#, 16#03#, 16#F8#, 16#00#, 16#0E#, 16#38#, 16#00#, 16#18#, 16#30#, 16#00#, 16#60#, 16#60#, 16#00#, 16#C0#, 16#C0#, 16#03#, 16#01#, 16#80#, 16#06#, 16#03#, 16#00#, 16#0C#, 16#06#, 16#00#, 16#18#, 16#0C#, 16#00#, 16#70#, 16#38#, 16#00#, 16#E0#, 16#60#, 16#01#, 16#80#, 16#C0#, 16#03#, 16#83#, 16#00#, 16#03#, 16#0E#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#3F#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#07#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#0E#, 16#1C#, 16#00#, 16#30#, 16#18#, 16#00#, 16#60#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#80#, 16#00#, 16#07#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#07#, 16#80#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#03#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#1F#, 16#FC#, 16#00#, 16#3F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#0E#, 16#18#, 16#00#, 16#30#, 16#30#, 16#00#, 16#60#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#01#, 16#80#, 16#C0#, 16#03#, 16#03#, 16#80#, 16#07#, 16#0E#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#70#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#1B#, 16#00#, 16#00#, 16#66#, 16#00#, 16#01#, 16#8C#, 16#00#, 16#06#, 16#18#, 16#00#, 16#18#, 16#70#, 16#00#, 16#60#, 16#C0#, 16#00#, 16#FF#, 16#F0#, 16#01#, 16#FF#, 16#C0#, 16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#DE#, 16#00#, 16#01#, 16#FF#, 16#00#, 16#07#, 16#0E#, 16#00#, 16#0C#, 16#0E#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#03#, 16#03#, 16#00#, 16#07#, 16#0E#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#0E#, 16#18#, 16#00#, 16#18#, 16#38#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#3C#, 16#00#, 16#06#, 16#FE#, 16#00#, 16#0F#, 16#1C#, 16#00#, 16#18#, 16#1C#, 16#00#, 16#70#, 16#38#, 16#00#, 16#C0#, 16#60#, 16#01#, 16#80#, 16#C0#, 16#03#, 16#83#, 16#80#, 16#03#, 16#0E#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#80#, 16#0F#, 16#FF#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#03#, 16#FC#, 16#00#, 16#0E#, 16#18#, 16#00#, 16#38#, 16#30#, 16#00#, 16#60#, 16#60#, 16#00#, 16#C0#, 16#C0#, 16#01#, 16#C3#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#1C#, 16#38#, 16#00#, 16#70#, 16#30#, 16#00#, 16#C0#, 16#60#, 16#01#, 16#80#, 16#C0#, 16#03#, 16#03#, 16#80#, 16#07#, 16#0E#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#0C#, 16#38#, 16#00#, 16#30#, 16#30#, 16#00#, 16#E0#, 16#60#, 16#01#, 16#80#, 16#C0#, 16#03#, 16#01#, 16#80#, 16#06#, 16#07#, 16#00#, 16#0E#, 16#1E#, 16#00#, 16#0F#, 16#FC#, 16#00#, 16#0F#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#C0#, 16#03#, 16#03#, 16#00#, 16#07#, 16#1C#, 16#00#, 16#07#, 16#F0#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#10#, 16#00#, 16#00#, 16#20#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#07#, 16#80#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#04#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#00#, 16#1F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#E0#, 16#03#, 16#FF#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#02#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#70#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#1E#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3E#, 16#00#, 16#01#, 16#FE#, 16#00#, 16#07#, 16#0E#, 16#00#, 16#0C#, 16#0C#, 16#00#, 16#18#, 16#18#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#80#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#1F#, 16#FE#, 16#00#, 16#F8#, 16#1E#, 16#03#, 16#80#, 16#0C#, 16#0E#, 16#00#, 16#08#, 16#38#, 16#3C#, 16#10#, 16#E1#, 16#FB#, 16#01#, 16#87#, 16#1E#, 16#06#, 16#1C#, 16#38#, 16#0C#, 16#70#, 16#70#, 16#30#, 16#C0#, 16#C2#, 16#61#, 16#83#, 16#84#, 16#C7#, 16#06#, 16#19#, 16#8E#, 16#1C#, 16#73#, 16#0C#, 16#71#, 16#C6#, 16#1F#, 16#FF#, 16#06#, 16#1C#, 16#78#, 16#0E#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#03#, 16#30#, 16#00#, 16#0E#, 16#60#, 16#00#, 16#18#, 16#C0#, 16#00#, 16#71#, 16#80#, 16#00#, 16#C3#, 16#00#, 16#03#, 16#86#, 16#00#, 16#06#, 16#0E#, 16#00#, 16#1F#, 16#FC#, 16#00#, 16#7F#, 16#F8#, 16#00#, 16#C0#, 16#30#, 16#03#, 16#80#, 16#60#, 16#06#, 16#00#, 16#C0#, 16#1C#, 16#01#, 16#80#, 16#30#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#03#, 16#FF#, 16#80#, 16#06#, 16#03#, 16#80#, 16#0C#, 16#03#, 16#00#, 16#18#, 16#06#, 16#00#, 16#70#, 16#0C#, 16#00#, 16#E0#, 16#30#, 16#01#, 16#80#, 16#E0#, 16#03#, 16#FF#, 16#00#, 16#07#, 16#FF#, 16#00#, 16#1C#, 16#07#, 16#00#, 16#38#, 16#06#, 16#00#, 16#60#, 16#0C#, 16#00#, 16#C0#, 16#18#, 16#01#, 16#80#, 16#70#, 16#07#, 16#01#, 16#C0#, 16#0F#, 16#FF#, 16#00#, 16#1F#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#FF#, 16#C0#, 16#03#, 16#C3#, 16#C0#, 16#0E#, 16#03#, 16#80#, 16#18#, 16#03#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#E0#, 16#06#, 16#00#, 16#C0#, 16#1C#, 16#01#, 16#C0#, 16#70#, 16#03#, 16#C1#, 16#C0#, 16#03#, 16#FF#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#03#, 16#FF#, 16#80#, 16#06#, 16#03#, 16#80#, 16#0C#, 16#03#, 16#80#, 16#18#, 16#07#, 16#00#, 16#70#, 16#06#, 16#00#, 16#E0#, 16#0C#, 16#01#, 16#80#, 16#18#, 16#03#, 16#00#, 16#70#, 16#06#, 16#00#, 16#E0#, 16#1C#, 16#01#, 16#80#, 16#38#, 16#03#, 16#00#, 16#60#, 16#0C#, 16#00#, 16#C0#, 16#18#, 16#01#, 16#80#, 16#60#, 16#07#, 16#03#, 16#C0#, 16#0F#, 16#FE#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#F0#, 16#03#, 16#FF#, 16#C0#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#FF#, 16#C0#, 16#07#, 16#FF#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#07#, 16#00#, 16#00#, 16#0F#, 16#FF#, 16#80#, 16#1F#, 16#FF#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#E0#, 16#03#, 16#FF#, 16#C0#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#FF#, 16#80#, 16#07#, 16#FE#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#07#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#7F#, 16#E0#, 16#01#, 16#C1#, 16#E0#, 16#06#, 16#00#, 16#C0#, 16#18#, 16#01#, 16#80#, 16#70#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#80#, 16#00#, 16#06#, 16#03#, 16#F8#, 16#0C#, 16#0F#, 16#F0#, 16#18#, 16#00#, 16#60#, 16#30#, 16#01#, 16#80#, 16#60#, 16#03#, 16#00#, 16#C0#, 16#0E#, 16#01#, 16#C0#, 16#3C#, 16#01#, 16#C1#, 16#D8#, 16#01#, 16#FF#, 16#20#, 16#01#, 16#F8#, 16#40#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#18#, 16#03#, 16#80#, 16#30#, 16#06#, 16#00#, 16#E0#, 16#0C#, 16#01#, 16#80#, 16#18#, 16#03#, 16#00#, 16#70#, 16#06#, 16#00#, 16#E0#, 16#0C#, 16#01#, 16#80#, 16#38#, 16#03#, 16#FF#, 16#E0#, 16#07#, 16#FF#, 16#C0#, 16#1C#, 16#01#, 16#80#, 16#38#, 16#07#, 16#00#, 16#60#, 16#0E#, 16#00#, 16#C0#, 16#18#, 16#01#, 16#80#, 16#30#, 16#07#, 16#00#, 16#60#, 16#0E#, 16#01#, 16#C0#, 16#18#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#E0#, 16#01#, 16#C1#, 16#80#, 16#03#, 16#83#, 16#00#, 16#06#, 16#0E#, 16#00#, 16#0E#, 16#38#, 16#00#, 16#0F#, 16#F0#, 16#00#, 16#0F#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#38#, 16#03#, 16#80#, 16#E0#, 16#06#, 16#03#, 16#80#, 16#0C#, 16#0C#, 16#00#, 16#18#, 16#70#, 16#00#, 16#71#, 16#C0#, 16#00#, 16#E7#, 16#00#, 16#01#, 16#9C#, 16#00#, 16#03#, 16#78#, 16#00#, 16#07#, 16#B8#, 16#00#, 16#1E#, 16#30#, 16#00#, 16#38#, 16#70#, 16#00#, 16#60#, 16#60#, 16#00#, 16#C0#, 16#E0#, 16#01#, 16#80#, 16#C0#, 16#07#, 16#01#, 16#C0#, 16#0C#, 16#01#, 16#80#, 16#18#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#07#, 16#00#, 16#00#, 16#0F#, 16#FE#, 16#00#, 16#1F#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#07#, 16#03#, 16#C0#, 16#1E#, 16#07#, 16#80#, 16#3C#, 16#0F#, 16#00#, 16#F0#, 16#1E#, 16#01#, 16#E0#, 16#7C#, 16#06#, 16#C0#, 16#EC#, 16#1D#, 16#81#, 16#98#, 16#37#, 16#03#, 16#30#, 16#EC#, 16#06#, 16#61#, 16#98#, 16#1C#, 16#C6#, 16#30#, 16#31#, 16#8C#, 16#60#, 16#63#, 16#31#, 16#C0#, 16#C6#, 16#63#, 16#01#, 16#87#, 16#86#, 16#07#, 16#0F#, 16#0C#, 16#0C#, 16#1C#, 16#18#, 16#18#, 16#38#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#18#, 16#03#, 16#C0#, 16#30#, 16#07#, 16#80#, 16#60#, 16#0F#, 16#81#, 16#C0#, 16#1F#, 16#03#, 16#00#, 16#76#, 16#06#, 16#00#, 16#EE#, 16#0C#, 16#01#, 16#8C#, 16#18#, 16#03#, 16#1C#, 16#70#, 16#06#, 16#38#, 16#C0#, 16#1C#, 16#31#, 16#80#, 16#30#, 16#73#, 16#00#, 16#60#, 16#66#, 16#00#, 16#C0#, 16#FC#, 16#01#, 16#80#, 16#F0#, 16#07#, 16#01#, 16#E0#, 16#0C#, 16#03#, 16#C0#, 16#18#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#7F#, 16#E0#, 16#03#, 16#C1#, 16#E0#, 16#0E#, 16#01#, 16#C0#, 16#18#, 16#01#, 16#80#, 16#60#, 16#03#, 16#81#, 16#C0#, 16#07#, 16#03#, 16#00#, 16#0E#, 16#06#, 16#00#, 16#1C#, 16#0C#, 16#00#, 16#30#, 16#38#, 16#00#, 16#60#, 16#70#, 16#00#, 16#C0#, 16#E0#, 16#03#, 16#00#, 16#C0#, 16#0E#, 16#01#, 16#C0#, 16#38#, 16#01#, 16#C0#, 16#E0#, 16#01#, 16#FF#, 16#80#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#80#, 16#03#, 16#FF#, 16#C0#, 16#06#, 16#03#, 16#80#, 16#0C#, 16#03#, 16#00#, 16#18#, 16#06#, 16#00#, 16#70#, 16#0C#, 16#00#, 16#E0#, 16#38#, 16#01#, 16#80#, 16#E0#, 16#03#, 16#FF#, 16#80#, 16#07#, 16#FE#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#07#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#7F#, 16#E0#, 16#03#, 16#C1#, 16#E0#, 16#0E#, 16#01#, 16#C0#, 16#18#, 16#01#, 16#C0#, 16#60#, 16#03#, 16#81#, 16#C0#, 16#07#, 16#03#, 16#00#, 16#0E#, 16#06#, 16#00#, 16#1C#, 16#0C#, 16#00#, 16#30#, 16#38#, 16#00#, 16#60#, 16#70#, 16#01#, 16#C0#, 16#60#, 16#03#, 16#00#, 16#C0#, 16#4E#, 16#01#, 16#C0#, 16#F8#, 16#01#, 16#C1#, 16#E0#, 16#01#, 16#FF#, 16#C0#, 16#01#, 16#F8#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#FF#, 16#C0#, 16#03#, 16#FF#, 16#E0#, 16#06#, 16#01#, 16#C0#, 16#0C#, 16#01#, 16#80#, 16#18#, 16#03#, 16#00#, 16#70#, 16#06#, 16#00#, 16#E0#, 16#18#, 16#01#, 16#80#, 16#70#, 16#03#, 16#FF#, 16#80#, 16#07#, 16#FF#, 16#80#, 16#1C#, 16#07#, 16#00#, 16#38#, 16#06#, 16#00#, 16#60#, 16#0C#, 16#00#, 16#C0#, 16#18#, 16#01#, 16#80#, 16#70#, 16#07#, 16#00#, 16#E0#, 16#0C#, 16#01#, 16#C0#, 16#18#, 16#03#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#3F#, 16#00#, 16#01#, 16#FF#, 16#80#, 16#07#, 16#87#, 16#80#, 16#0C#, 16#03#, 16#00#, 16#38#, 16#06#, 16#00#, 16#60#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#01#, 16#FC#, 16#00#, 16#00#, 16#FE#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#C0#, 16#0C#, 16#01#, 16#80#, 16#38#, 16#03#, 16#00#, 16#60#, 16#07#, 16#83#, 16#80#, 16#07#, 16#FE#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#FF#, 16#F0#, 16#07#, 16#FF#, 16#E0#, 16#00#, 16#70#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#07#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#18#, 16#03#, 16#80#, 16#30#, 16#06#, 16#00#, 16#E0#, 16#0C#, 16#01#, 16#80#, 16#18#, 16#03#, 16#00#, 16#30#, 16#06#, 16#00#, 16#E0#, 16#0C#, 16#01#, 16#80#, 16#38#, 16#03#, 16#00#, 16#60#, 16#06#, 16#00#, 16#C0#, 16#0C#, 16#01#, 16#80#, 16#38#, 16#07#, 16#00#, 16#60#, 16#0E#, 16#00#, 16#C0#, 16#18#, 16#01#, 16#80#, 16#70#, 16#03#, 16#C1#, 16#C0#, 16#03#, 16#FF#, 16#00#, 16#01#, 16#F8#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#00#, 16#38#, 16#07#, 16#00#, 16#60#, 16#0E#, 16#01#, 16#C0#, 16#0C#, 16#03#, 16#00#, 16#18#, 16#0C#, 16#00#, 16#30#, 16#18#, 16#00#, 16#60#, 16#60#, 16#00#, 16#C1#, 16#C0#, 16#01#, 16#C3#, 16#00#, 16#03#, 16#8E#, 16#00#, 16#03#, 16#18#, 16#00#, 16#06#, 16#70#, 16#00#, 16#0C#, 16#C0#, 16#00#, 16#1B#, 16#80#, 16#00#, 16#36#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#F0#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#C0#, 16#07#, 16#03#, 16#80#, 16#0E#, 16#07#, 16#02#, 16#1C#, 16#1E#, 16#04#, 16#38#, 16#3C#, 16#18#, 16#70#, 16#D8#, 16#30#, 16#E1#, 16#B0#, 16#61#, 16#C6#, 16#31#, 16#83#, 16#8C#, 16#63#, 16#07#, 16#30#, 16#CE#, 16#06#, 16#61#, 16#98#, 16#0D#, 16#83#, 16#70#, 16#1B#, 16#06#, 16#C0#, 16#3E#, 16#0D#, 16#80#, 16#78#, 16#1E#, 16#00#, 16#F0#, 16#3C#, 16#01#, 16#C0#, 16#70#, 16#03#, 16#80#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#C0#, 16#38#, 16#03#, 16#80#, 16#E0#, 16#03#, 16#03#, 16#80#, 16#07#, 16#0E#, 16#00#, 16#06#, 16#38#, 16#00#, 16#0E#, 16#60#, 16#00#, 16#0D#, 16#80#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#3C#, 16#00#, 16#00#, 16#78#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#07#, 16#70#, 16#00#, 16#1C#, 16#E0#, 16#00#, 16#70#, 16#C0#, 16#00#, 16#C1#, 16#C0#, 16#03#, 16#01#, 16#80#, 16#0E#, 16#03#, 16#80#, 16#38#, 16#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#03#, 16#80#, 16#18#, 16#03#, 16#00#, 16#60#, 16#07#, 16#01#, 16#C0#, 16#0E#, 16#07#, 16#00#, 16#0C#, 16#1C#, 16#00#, 16#1C#, 16#30#, 16#00#, 16#18#, 16#C0#, 16#00#, 16#3B#, 16#80#, 16#00#, 16#7E#, 16#00#, 16#00#, 16#78#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#03#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#FF#, 16#F0#, 16#03#, 16#FF#, 16#C0#, 16#00#, 16#03#, 16#80#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#03#, 16#80#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#03#, 16#80#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#1F#, 16#FF#, 16#00#, 16#3F#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#F0#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#07#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#02#, 16#00#, 16#00#, 16#04#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#, 16#10#, 16#00#, 16#00#, 16#20#, 16#00#, 16#00#, 16#40#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#02#, 16#00#, 16#00#, 16#04#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#, 16#10#, 16#00#, 16#00#, 16#20#, 16#00#, 16#00#, 16#40#, 16#00#, 16#00#, 16#80#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#80#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#03#, 16#C0#, 16#00#, 16#0D#, 16#80#, 16#00#, 16#13#, 16#00#, 16#00#, 16#62#, 16#00#, 16#01#, 16#84#, 16#00#, 16#03#, 16#0C#, 16#00#, 16#0C#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#FF#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#03#, 16#00#, 16#00#, 16#02#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#7F#, 16#80#, 16#01#, 16#C3#, 16#80#, 16#03#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#38#, 16#00#, 16#1F#, 16#F0#, 16#00#, 16#78#, 16#60#, 16#01#, 16#81#, 16#80#, 16#03#, 16#03#, 16#00#, 16#06#, 16#1E#, 16#00#, 16#0F#, 16#EE#, 16#00#, 16#0F#, 16#9C#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#67#, 16#80#, 16#00#, 16#FF#, 16#80#, 16#01#, 16#C3#, 16#80#, 16#07#, 16#03#, 16#00#, 16#0E#, 16#06#, 16#00#, 16#18#, 16#0C#, 16#00#, 16#30#, 16#18#, 16#00#, 16#60#, 16#30#, 16#01#, 16#C0#, 16#C0#, 16#03#, 16#81#, 16#80#, 16#07#, 16#8E#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#13#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#01#, 16#C7#, 16#00#, 16#07#, 16#06#, 16#00#, 16#0C#, 16#0C#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#03#, 16#00#, 16#07#, 16#0E#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#1F#, 16#30#, 16#00#, 16#7F#, 16#C0#, 16#01#, 16#C7#, 16#80#, 16#06#, 16#07#, 16#00#, 16#0C#, 16#0E#, 16#00#, 16#30#, 16#1C#, 16#00#, 16#60#, 16#30#, 16#00#, 16#C0#, 16#60#, 16#01#, 16#80#, 16#C0#, 16#03#, 16#03#, 16#80#, 16#07#, 16#0E#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#07#, 16#98#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#01#, 16#C3#, 16#00#, 16#06#, 16#07#, 16#00#, 16#0C#, 16#06#, 16#00#, 16#3F#, 16#FC#, 16#00#, 16#7F#, 16#F0#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#03#, 16#80#, 16#07#, 16#0E#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#38#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#20#, 16#00#, 16#7F#, 16#C0#, 16#01#, 16#C7#, 16#80#, 16#07#, 16#07#, 16#00#, 16#0C#, 16#0E#, 16#00#, 16#30#, 16#18#, 16#00#, 16#60#, 16#30#, 16#00#, 16#C0#, 16#60#, 16#01#, 16#81#, 16#C0#, 16#03#, 16#03#, 16#00#, 16#07#, 16#1E#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#07#, 16#98#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#01#, 16#83#, 16#00#, 16#03#, 16#FE#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#67#, 16#80#, 16#00#, 16#FF#, 16#80#, 16#01#, 16#C3#, 16#00#, 16#07#, 16#07#, 16#00#, 16#0C#, 16#0C#, 16#00#, 16#18#, 16#18#, 16#00#, 16#30#, 16#30#, 16#00#, 16#60#, 16#60#, 16#01#, 16#81#, 16#C0#, 16#03#, 16#03#, 16#00#, 16#06#, 16#06#, 16#00#, 16#0C#, 16#0C#, 16#00#, 16#18#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#07#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#C0#, 16#00#, 16#C3#, 16#00#, 16#01#, 16#9C#, 16#00#, 16#06#, 16#70#, 16#00#, 16#0D#, 16#C0#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#3B#, 16#80#, 16#00#, 16#63#, 16#00#, 16#01#, 16#86#, 16#00#, 16#03#, 16#0E#, 16#00#, 16#06#, 16#0C#, 16#00#, 16#0C#, 16#18#, 16#00#, 16#18#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#6F#, 16#8F#, 16#00#, 16#FF#, 16#3F#, 16#01#, 16#C7#, 16#86#, 16#07#, 16#06#, 16#0C#, 16#0C#, 16#0C#, 16#18#, 16#18#, 16#30#, 16#30#, 16#30#, 16#60#, 16#E0#, 16#60#, 16#C1#, 16#81#, 16#81#, 16#83#, 16#03#, 16#03#, 16#06#, 16#06#, 16#0C#, 16#0C#, 16#0C#, 16#18#, 16#30#, 16#18#, 16#30#, 16#60#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#6F#, 16#80#, 16#00#, 16#FF#, 16#80#, 16#01#, 16#C3#, 16#00#, 16#07#, 16#07#, 16#00#, 16#0C#, 16#0C#, 16#00#, 16#18#, 16#18#, 16#00#, 16#30#, 16#30#, 16#00#, 16#60#, 16#60#, 16#01#, 16#81#, 16#C0#, 16#03#, 16#03#, 16#00#, 16#06#, 16#06#, 16#00#, 16#0C#, 16#0C#, 16#00#, 16#18#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#7F#, 16#80#, 16#01#, 16#C3#, 16#00#, 16#07#, 16#07#, 16#00#, 16#0C#, 16#06#, 16#00#, 16#38#, 16#0C#, 16#00#, 16#60#, 16#38#, 16#00#, 16#C0#, 16#60#, 16#01#, 16#80#, 16#C0#, 16#03#, 16#03#, 16#00#, 16#07#, 16#0E#, 16#00#, 16#07#, 16#F8#, 16#00#, 16#07#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#67#, 16#80#, 16#00#, 16#FF#, 16#80#, 16#01#, 16#C3#, 16#80#, 16#07#, 16#03#, 16#00#, 16#0E#, 16#06#, 16#00#, 16#18#, 16#0C#, 16#00#, 16#30#, 16#18#, 16#00#, 16#60#, 16#30#, 16#01#, 16#C0#, 16#E0#, 16#03#, 16#81#, 16#80#, 16#07#, 16#8E#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#3B#, 16#E0#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#20#, 16#00#, 16#7F#, 16#C0#, 16#01#, 16#C7#, 16#80#, 16#06#, 16#07#, 16#00#, 16#0C#, 16#0E#, 16#00#, 16#30#, 16#18#, 16#00#, 16#60#, 16#30#, 16#00#, 16#C0#, 16#60#, 16#01#, 16#81#, 16#C0#, 16#03#, 16#03#, 16#80#, 16#07#, 16#0E#, 16#00#, 16#07#, 16#FC#, 16#00#, 16#07#, 16#98#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#6E#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#07#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#1F#, 16#00#, 16#00#, 16#FF#, 16#00#, 16#03#, 16#86#, 16#00#, 16#06#, 16#0C#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#1F#, 16#80#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#03#, 16#80#, 16#07#, 16#03#, 16#00#, 16#06#, 16#0C#, 16#00#, 16#0F#, 16#F8#, 16#00#, 16#0F#, 16#C0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#F8#, 16#00#, 16#03#, 16#F0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#60#, 16#60#, 16#00#, 16#C0#, 16#C0#, 16#01#, 16#81#, 16#80#, 16#06#, 16#06#, 16#00#, 16#0C#, 16#0C#, 16#00#, 16#18#, 16#18#, 16#00#, 16#30#, 16#30#, 16#00#, 16#60#, 16#60#, 16#01#, 16#81#, 16#80#, 16#03#, 16#03#, 16#00#, 16#07#, 16#1E#, 16#00#, 16#0F#, 16#FC#, 16#00#, 16#0F#, 16#98#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#60#, 16#01#, 16#81#, 16#C0#, 16#03#, 16#03#, 16#00#, 16#07#, 16#0C#, 16#00#, 16#06#, 16#18#, 16#00#, 16#0C#, 16#60#, 16#00#, 16#18#, 16#C0#, 16#00#, 16#33#, 16#00#, 16#00#, 16#6C#, 16#00#, 16#00#, 16#D8#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#01#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C1#, 16#C3#, 16#81#, 16#87#, 16#86#, 16#03#, 16#0F#, 16#1C#, 16#06#, 16#16#, 16#30#, 16#0C#, 16#6C#, 16#E0#, 16#18#, 16#D9#, 16#80#, 16#33#, 16#33#, 16#00#, 16#66#, 16#6C#, 16#00#, 16#58#, 16#D8#, 16#00#, 16#F1#, 16#E0#, 16#01#, 16#C3#, 16#C0#, 16#03#, 16#87#, 16#00#, 16#06#, 16#0E#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#60#, 16#E0#, 16#00#, 16#C3#, 16#80#, 16#01#, 16#C6#, 16#00#, 16#01#, 16#98#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#03#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#1E#, 16#00#, 16#00#, 16#7C#, 16#00#, 16#01#, 16#CC#, 16#00#, 16#03#, 16#18#, 16#00#, 16#0C#, 16#38#, 16#00#, 16#30#, 16#30#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#C0#, 16#E0#, 16#01#, 16#81#, 16#80#, 16#03#, 16#07#, 16#00#, 16#06#, 16#0C#, 16#00#, 16#0E#, 16#30#, 16#00#, 16#0C#, 16#60#, 16#00#, 16#19#, 16#80#, 16#00#, 16#33#, 16#00#, 16#00#, 16#6C#, 16#00#, 16#00#, 16#D0#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#03#, 16#80#, 16#00#, 16#07#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#00#, 16#07#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#7F#, 16#C0#, 16#00#, 16#FF#, 16#80#, 16#00#, 16#07#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#60#, 16#00#, 16#01#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#1F#, 16#F8#, 16#00#, 16#3F#, 16#F0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#10#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#00#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#20#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#E0#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#80#, 16#00#, 16#01#, 16#00#, 16#00#, 16#02#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#20#, 16#00#, 16#00#, 16#40#, 16#00#, 16#00#, 16#80#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#, 16#10#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#02#, 16#00#, 16#00#, 16#04#, 16#00#, 16#00#, 16#18#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#40#, 16#00#, 16#00#, 16#80#, 16#00#, 16#01#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#07#, 16#00#, 16#00#, 16#0F#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#08#, 16#00#, 16#00#, 16#30#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#02#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0E#, 16#00#, 16#00#, 16#1C#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#03#, 16#00#, 16#00#, 16#06#, 16#00#, 16#00#, 16#0C#, 16#00#, 16#00#, 16#10#, 16#00#, 16#00#, 16#60#, 16#00#, 16#00#, 16#C0#, 16#00#, 16#01#, 16#80#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#E0#, 16#00#, 16#03#, 16#E0#, 16#00#, 16#0C#, 16#E2#, 16#00#, 16#00#, 16#FC#, 16#00#, 16#00#, 16#70#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#, 16#00#); Font_D : aliased constant Bitmap_Font := ( Bytes_Per_Glyph => 81, Glyph_Width => 23, Glyph_Height => 28, Data => FreeSansOblique12pt7bBitmaps'Access); Font : constant Bitmap_Font_Ref := Font_D'Access; end GESTE_Fonts.FreeSansOblique12pt7b;
73.153132
74
0.488011
9a10cf7b309be8907d801ea94298a9b4862ab4db
3,041
ads
Ada
include/sf-system-inputstream.ads
Fabien-Chouteau/ASFML
52a013554bcfb6150e0d6391871356c1443a6b93
[ "Zlib" ]
null
null
null
include/sf-system-inputstream.ads
Fabien-Chouteau/ASFML
52a013554bcfb6150e0d6391871356c1443a6b93
[ "Zlib" ]
null
null
null
include/sf-system-inputstream.ads
Fabien-Chouteau/ASFML
52a013554bcfb6150e0d6391871356c1443a6b93
[ "Zlib" ]
null
null
null
--////////////////////////////////////////////////////////// -- SFML - Simple and Fast Multimedia Library -- Copyright (C) 2007-2015 Laurent Gomila ([email protected]) -- This software is provided 'as-is', without any express or implied warranty. -- In no event will the authors be held liable for any damages arising from the use of this software. -- Permission is granted to anyone to use this software for any purpose, -- including commercial applications, and to alter it and redistribute it freely, -- subject to the following restrictions: -- 1. The origin of this software must not be misrepresented; -- you must not claim that you wrote the original software. -- If you use this software in a product, an acknowledgment -- in the product documentation would be appreciated but is not required. -- 2. Altered source versions must be plainly marked as such, -- and must not be misrepresented as being the original software. -- 3. This notice may not be removed or altered from any source distribution. --////////////////////////////////////////////////////////// --////////////////////////////////////////////////////////// with System; package Sf.System.InputStream is --////////////////////////////////////////////////////////// --////////////////////////////////////////////////////////// --////////////////////////////////////////////////////////// --////////////////////////////////////////////////////////// type sfInputStreamReadFunc is access function (data : Standard.System.Address; size : sfInt64; userData : Standard.System.Address) return sfInt64; type sfInputStreamSeekFunc is access function (position : sfInt64; userData : Standard.System.Address) return sfInt64; type sfInputStreamTellFunc is access function (userData : Standard.System.Address) return sfInt64; type sfInputStreamGetSizeFunc is access function (userData : Standard.System.Address) return sfInt64; --////////////////////////////////////////////////////////// --/ @brief Set of callbacks that allow users to define custom file streams --/ --////////////////////////////////////////////////////////// --/< Function to read data from the stream --/< Function to set the current read position --/< Function to get the current read position --/< Function to get the total number of bytes in the stream --/< User data that will be passed to the callbacks type sfInputStream is record read : sfInputStreamReadFunc; seek : sfInputStreamSeekFunc; tell : sfInputStreamTellFunc; getSize : sfInputStreamGetSizeFunc; userData : Standard.System.Address; end record; private pragma Convention (C, sfInputStreamGetSizeFunc); pragma Convention (C, sfInputStreamTellFunc); pragma Convention (C, sfInputStreamSeekFunc); pragma Convention (C, sfInputStreamReadFunc); pragma Convention (C_Pass_By_Copy, sfInputStream); end Sf.System.InputStream;
44.720588
104
0.590595
222edf046f830c005f7ff9c806bfaeb982d2599c
1,519
ads
Ada
src/ds3231.ads
JeremyGrosser/sensors
1efb0da0dd84eed34fdeba6a499d6195d25b8f1b
[ "BSD-3-Clause" ]
1
2022-03-07T11:28:27.000Z
2022-03-07T11:28:27.000Z
src/ds3231.ads
JeremyGrosser/sensors
1efb0da0dd84eed34fdeba6a499d6195d25b8f1b
[ "BSD-3-Clause" ]
null
null
null
src/ds3231.ads
JeremyGrosser/sensors
1efb0da0dd84eed34fdeba6a499d6195d25b8f1b
[ "BSD-3-Clause" ]
null
null
null
-- -- Copyright 2021 (C) Jeremy Grosser <[email protected]> -- -- SPDX-License-Identifier: BSD-3-Clause -- with HAL.Real_Time_Clock; with HAL.I2C; with HAL; package DS3231 is Default_Address : constant HAL.I2C.I2C_Address := 2#1101000#; type DS3231_Device (I2C_Port : not null HAL.I2C.Any_I2C_Port; I2C_Address : HAL.I2C.I2C_Address) is limited new HAL.Real_Time_Clock.RTC_Device with private; overriding procedure Set (This : in out DS3231_Device; Time : HAL.Real_Time_Clock.RTC_Time; Date : HAL.Real_Time_Clock.RTC_Date); overriding procedure Get (This : in out DS3231_Device; Time : out HAL.Real_Time_Clock.RTC_Time; Date : out HAL.Real_Time_Clock.RTC_Date); overriding function Get_Time (This : DS3231_Device) return HAL.Real_Time_Clock.RTC_Time; overriding function Get_Date (This : DS3231_Device) return HAL.Real_Time_Clock.RTC_Date; -- Raised if any I2C error occurs DS3231_Error : exception; private type DS3231_Device (I2C_Port : not null HAL.I2C.Any_I2C_Port; I2C_Address : HAL.I2C.I2C_Address) is limited new HAL.Real_Time_Clock.RTC_Device with null record; subtype All_Registers is HAL.UInt8_Array (16#00# .. 16#12#); procedure Read_All (This : DS3231_Device; Val : out All_Registers); function To_Integer (BCD : HAL.UInt8) return Integer; function To_BCD (N : Integer) return HAL.UInt8; end DS3231;
23.369231
66
0.682028
9a68e219730cab2974ca8ebceb9ca2be4da1097a
9,121
adb
Ada
source/nodes/program-nodes-anonymous_access_to_functions.adb
reznikmm/gela
20134f1d154fb763812e73860c6f4b04f353df79
[ "MIT" ]
null
null
null
source/nodes/program-nodes-anonymous_access_to_functions.adb
reznikmm/gela
20134f1d154fb763812e73860c6f4b04f353df79
[ "MIT" ]
null
null
null
source/nodes/program-nodes-anonymous_access_to_functions.adb
reznikmm/gela
20134f1d154fb763812e73860c6f4b04f353df79
[ "MIT" ]
1
2019-10-16T09:05:27.000Z
2019-10-16T09:05:27.000Z
-- SPDX-FileCopyrightText: 2019 Max Reznik <[email protected]> -- -- SPDX-License-Identifier: MIT ------------------------------------------------------------- package body Program.Nodes.Anonymous_Access_To_Functions is function Create (Not_Token : Program.Lexical_Elements.Lexical_Element_Access; Null_Token : Program.Lexical_Elements.Lexical_Element_Access; Access_Token : not null Program.Lexical_Elements .Lexical_Element_Access; Protected_Token : Program.Lexical_Elements.Lexical_Element_Access; Function_Token : not null Program.Lexical_Elements .Lexical_Element_Access; Left_Bracket_Token : Program.Lexical_Elements.Lexical_Element_Access; Parameters : Program.Elements.Parameter_Specifications .Parameter_Specification_Vector_Access; Right_Bracket_Token : Program.Lexical_Elements.Lexical_Element_Access; Return_Token : not null Program.Lexical_Elements .Lexical_Element_Access; Not_Token_2 : Program.Lexical_Elements.Lexical_Element_Access; Null_Token_2 : Program.Lexical_Elements.Lexical_Element_Access; Result_Subtype : not null Program.Elements.Element_Access) return Anonymous_Access_To_Function is begin return Result : Anonymous_Access_To_Function := (Not_Token => Not_Token, Null_Token => Null_Token, Access_Token => Access_Token, Protected_Token => Protected_Token, Function_Token => Function_Token, Left_Bracket_Token => Left_Bracket_Token, Parameters => Parameters, Right_Bracket_Token => Right_Bracket_Token, Return_Token => Return_Token, Not_Token_2 => Not_Token_2, Null_Token_2 => Null_Token_2, Result_Subtype => Result_Subtype, Enclosing_Element => null) do Initialize (Result); end return; end Create; function Create (Parameters : Program.Elements.Parameter_Specifications .Parameter_Specification_Vector_Access; Result_Subtype : not null Program.Elements.Element_Access; Is_Part_Of_Implicit : Boolean := False; Is_Part_Of_Inherited : Boolean := False; Is_Part_Of_Instance : Boolean := False; Has_Not_Null : Boolean := False; Has_Protected : Boolean := False; Has_Not_Null_2 : Boolean := False) return Implicit_Anonymous_Access_To_Function is begin return Result : Implicit_Anonymous_Access_To_Function := (Parameters => Parameters, Result_Subtype => Result_Subtype, Is_Part_Of_Implicit => Is_Part_Of_Implicit, Is_Part_Of_Inherited => Is_Part_Of_Inherited, Is_Part_Of_Instance => Is_Part_Of_Instance, Has_Not_Null => Has_Not_Null, Has_Protected => Has_Protected, Has_Not_Null_2 => Has_Not_Null_2, Enclosing_Element => null) do Initialize (Result); end return; end Create; overriding function Parameters (Self : Base_Anonymous_Access_To_Function) return Program.Elements.Parameter_Specifications .Parameter_Specification_Vector_Access is begin return Self.Parameters; end Parameters; overriding function Result_Subtype (Self : Base_Anonymous_Access_To_Function) return not null Program.Elements.Element_Access is begin return Self.Result_Subtype; end Result_Subtype; overriding function Not_Token (Self : Anonymous_Access_To_Function) return Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Not_Token; end Not_Token; overriding function Null_Token (Self : Anonymous_Access_To_Function) return Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Null_Token; end Null_Token; overriding function Access_Token (Self : Anonymous_Access_To_Function) return not null Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Access_Token; end Access_Token; overriding function Protected_Token (Self : Anonymous_Access_To_Function) return Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Protected_Token; end Protected_Token; overriding function Function_Token (Self : Anonymous_Access_To_Function) return not null Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Function_Token; end Function_Token; overriding function Left_Bracket_Token (Self : Anonymous_Access_To_Function) return Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Left_Bracket_Token; end Left_Bracket_Token; overriding function Right_Bracket_Token (Self : Anonymous_Access_To_Function) return Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Right_Bracket_Token; end Right_Bracket_Token; overriding function Return_Token (Self : Anonymous_Access_To_Function) return not null Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Return_Token; end Return_Token; overriding function Not_Token_2 (Self : Anonymous_Access_To_Function) return Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Not_Token_2; end Not_Token_2; overriding function Null_Token_2 (Self : Anonymous_Access_To_Function) return Program.Lexical_Elements.Lexical_Element_Access is begin return Self.Null_Token_2; end Null_Token_2; overriding function Has_Not_Null (Self : Anonymous_Access_To_Function) return Boolean is begin return Self.Null_Token.Assigned; end Has_Not_Null; overriding function Has_Protected (Self : Anonymous_Access_To_Function) return Boolean is begin return Self.Protected_Token.Assigned; end Has_Protected; overriding function Has_Not_Null_2 (Self : Anonymous_Access_To_Function) return Boolean is begin return Self.Null_Token_2.Assigned; end Has_Not_Null_2; overriding function Is_Part_Of_Implicit (Self : Implicit_Anonymous_Access_To_Function) return Boolean is begin return Self.Is_Part_Of_Implicit; end Is_Part_Of_Implicit; overriding function Is_Part_Of_Inherited (Self : Implicit_Anonymous_Access_To_Function) return Boolean is begin return Self.Is_Part_Of_Inherited; end Is_Part_Of_Inherited; overriding function Is_Part_Of_Instance (Self : Implicit_Anonymous_Access_To_Function) return Boolean is begin return Self.Is_Part_Of_Instance; end Is_Part_Of_Instance; overriding function Has_Not_Null (Self : Implicit_Anonymous_Access_To_Function) return Boolean is begin return Self.Has_Not_Null; end Has_Not_Null; overriding function Has_Protected (Self : Implicit_Anonymous_Access_To_Function) return Boolean is begin return Self.Has_Protected; end Has_Protected; overriding function Has_Not_Null_2 (Self : Implicit_Anonymous_Access_To_Function) return Boolean is begin return Self.Has_Not_Null_2; end Has_Not_Null_2; procedure Initialize (Self : in out Base_Anonymous_Access_To_Function'Class) is begin for Item in Self.Parameters.Each_Element loop Set_Enclosing_Element (Item.Element, Self'Unchecked_Access); end loop; Set_Enclosing_Element (Self.Result_Subtype, Self'Unchecked_Access); null; end Initialize; overriding function Is_Anonymous_Access_To_Function (Self : Base_Anonymous_Access_To_Function) return Boolean is pragma Unreferenced (Self); begin return True; end Is_Anonymous_Access_To_Function; overriding function Is_Anonymous_Access_Definition (Self : Base_Anonymous_Access_To_Function) return Boolean is pragma Unreferenced (Self); begin return True; end Is_Anonymous_Access_Definition; overriding function Is_Definition (Self : Base_Anonymous_Access_To_Function) return Boolean is pragma Unreferenced (Self); begin return True; end Is_Definition; overriding procedure Visit (Self : not null access Base_Anonymous_Access_To_Function; Visitor : in out Program.Element_Visitors.Element_Visitor'Class) is begin Visitor.Anonymous_Access_To_Function (Self); end Visit; overriding function To_Anonymous_Access_To_Function_Text (Self : in out Anonymous_Access_To_Function) return Program.Elements.Anonymous_Access_To_Functions .Anonymous_Access_To_Function_Text_Access is begin return Self'Unchecked_Access; end To_Anonymous_Access_To_Function_Text; overriding function To_Anonymous_Access_To_Function_Text (Self : in out Implicit_Anonymous_Access_To_Function) return Program.Elements.Anonymous_Access_To_Functions .Anonymous_Access_To_Function_Text_Access is pragma Unreferenced (Self); begin return null; end To_Anonymous_Access_To_Function_Text; end Program.Nodes.Anonymous_Access_To_Functions;
33.533088
76
0.73731
4ba3c2eb6794551e56fd3db37fa3b96ad362d11d
2,855
adb
Ada
src/giza-events.adb
Fabien-Chouteau/Giza
9f6c167666dbba8f0e5f0ba3e33825c0b3f399bd
[ "BSD-3-Clause" ]
7
2017-10-18T02:40:24.000Z
2020-12-19T22:41:19.000Z
src/giza-events.adb
Fabien-Chouteau/Giza
9f6c167666dbba8f0e5f0ba3e33825c0b3f399bd
[ "BSD-3-Clause" ]
null
null
null
src/giza-events.adb
Fabien-Chouteau/Giza
9f6c167666dbba8f0e5f0ba3e33825c0b3f399bd
[ "BSD-3-Clause" ]
2
2019-05-06T08:30:26.000Z
2020-11-22T11:27:27.000Z
------------------------------------------------------------------------------ -- -- -- Giza -- -- -- -- Copyright (C) 2015 Fabien Chouteau ([email protected]) -- -- -- -- -- -- Redistribution and use in source and binary forms, with or without -- -- modification, are permitted provided that the following conditions are -- -- met: -- -- 1. Redistributions of source code must retain the above copyright -- -- notice, this list of conditions and the following disclaimer. -- -- 2. Redistributions in binary form must reproduce the above copyright -- -- notice, this list of conditions and the following disclaimer in -- -- the documentation and/or other materials provided with the -- -- distribution. -- -- 3. Neither the name of the copyright holder nor the names of its -- -- contributors may be used to endorse or promote products derived -- -- from this software without specific prior written permission. -- -- -- -- THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -- -- "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -- -- LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -- -- A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -- -- HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -- -- SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT -- -- LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, -- -- DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY -- -- THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -- -- (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE -- -- OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -- -- -- ------------------------------------------------------------------------------ package body Giza.Events is --------------- -- Triggered -- --------------- overriding function Triggered (Timer : Basic_Timer_Event) return Boolean is begin return Timer.Callback.all; end Triggered; end Giza.Events;
59.479167
78
0.479159
040280fa8be3dac1c96aa8934763edd86185c1f9
1,546
ads
Ada
source/nodes/program-dummy_subpools.ads
optikos/oasis
9f64d46d26d964790d69f9db681c874cfb3bf96d
[ "MIT" ]
null
null
null
source/nodes/program-dummy_subpools.ads
optikos/oasis
9f64d46d26d964790d69f9db681c874cfb3bf96d
[ "MIT" ]
null
null
null
source/nodes/program-dummy_subpools.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 System.Storage_Elements; with System.Storage_Pools.Subpools; package Program.Dummy_Subpools is pragma Preelaborate; type Dummy_Storage_Pool is new System.Storage_Pools.Subpools.Root_Storage_Pool_With_Subpools with private; private type Dummy_Subpool is new System.Storage_Pools.Subpools.Root_Subpool with null record; type Dummy_Storage_Pool is new System.Storage_Pools.Subpools.Root_Storage_Pool_With_Subpools with record Last_Subpool : System.Storage_Pools.Subpools.Subpool_Handle; end record; overriding procedure Allocate_From_Subpool (Self : in out Dummy_Storage_Pool; Address : out System.Address; Size : System.Storage_Elements.Storage_Count; Alignment : System.Storage_Elements.Storage_Count; Subpool : not null System.Storage_Pools.Subpools.Subpool_Handle); overriding procedure Deallocate_Subpool (Self : in out Dummy_Storage_Pool; Subpool : in out System.Storage_Pools.Subpools.Subpool_Handle); overriding function Create_Subpool (Self : in out Dummy_Storage_Pool) return not null System.Storage_Pools.Subpools.Subpool_Handle; overriding function Default_Subpool_For_Pool (Self : in out Dummy_Storage_Pool) return not null System.Storage_Pools.Subpools.Subpool_Handle; end Program.Dummy_Subpools;
32.208333
75
0.732212
ad6b040db33796966f27fff44f283b6ee305f76c
796
adb
Ada
Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/array_of_variable_length/foo.adb
samyvic/OS-Project
1622bc1641876584964effd91d65ef02e92728e1
[ "Apache-2.0" ]
null
null
null
Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/array_of_variable_length/foo.adb
samyvic/OS-Project
1622bc1641876584964effd91d65ef02e92728e1
[ "Apache-2.0" ]
null
null
null
Read Only/gdb-7.12.1/gdb/testsuite/gdb.ada/array_of_variable_length/foo.adb
samyvic/OS-Project
1622bc1641876584964effd91d65ef02e92728e1
[ "Apache-2.0" ]
null
null
null
-- Copyright 2015-2017 Free Software Foundation, Inc. -- -- This program is free software; you can redistribute it and/or modify -- it under the terms of the GNU General Public License as published by -- the Free Software Foundation; either version 3 of the License, or -- (at your option) any later version. -- -- This program is distributed in the hope that it will be useful, -- but WITHOUT ANY WARRANTY; without even the implied warranty of -- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the -- GNU General Public License for more details. -- -- You should have received a copy of the GNU General Public License -- along with this program. If not, see <http://www.gnu.org/licenses/>. with Pck; use Pck; procedure Foo is begin Do_Nothing (A); -- BREAK end Foo;
36.181818
73
0.731156
4b4710e5b2adf6bf52b02d6c59924618df5458df
614
ada
Ada
Task/Averages-Pythagorean-means/Ada/averages-pythagorean-means-3.ada
mullikine/RosettaCodeData
4f0027c6ce83daa36118ee8b67915a13cd23ab67
[ "Info-ZIP" ]
1
2018-11-09T22:08:38.000Z
2018-11-09T22:08:38.000Z
Task/Averages-Pythagorean-means/Ada/averages-pythagorean-means-3.ada
mullikine/RosettaCodeData
4f0027c6ce83daa36118ee8b67915a13cd23ab67
[ "Info-ZIP" ]
null
null
null
Task/Averages-Pythagorean-means/Ada/averages-pythagorean-means-3.ada
mullikine/RosettaCodeData
4f0027c6ce83daa36118ee8b67915a13cd23ab67
[ "Info-ZIP" ]
1
2018-11-09T22:08:40.000Z
2018-11-09T22:08:40.000Z
with Ada.Text_IO; with Pythagorean_Means; procedure Main is My_Set : Pythagorean_Means.Set := (1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0, 9.0, 10.0); Arithmetic_Mean : Float := Pythagorean_Means.Arithmetic_Mean (My_Set); Geometric_Mean : Float := Pythagorean_Means.Geometric_Mean (My_Set); Harmonic_Mean : Float := Pythagorean_Means.Harmonic_Mean (My_Set); begin Ada.Text_IO.Put_Line (Float'Image (Arithmetic_Mean) & " >= " & Float'Image (Geometric_Mean) & " >= " & Float'Image (Harmonic_Mean)); end Main;
43.857143
73
0.59772
1a9a19d58c2ba065dccd6515c8d03fefbdb55127
3,198
ads
Ada
tools-src/gnu/gcc/gcc/ada/s-fatlfl.ads
modern-tomato/tomato
96f09fab4929c6ddde5c9113f1b2476ad37133c4
[ "FSFAP" ]
80
2015-01-02T10:14:04.000Z
2021-06-07T06:29:49.000Z
tools-src/gnu/gcc/gcc/ada/s-fatlfl.ads
modern-tomato/tomato
96f09fab4929c6ddde5c9113f1b2476ad37133c4
[ "FSFAP" ]
9
2015-05-14T11:03:12.000Z
2018-01-04T07:12:58.000Z
tools-src/gnu/gcc/gcc/ada/s-fatlfl.ads
modern-tomato/tomato
96f09fab4929c6ddde5c9113f1b2476ad37133c4
[ "FSFAP" ]
69
2015-01-02T10:45:56.000Z
2021-09-06T07:52:13.000Z
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S Y S T E M . F A T _ L F L T -- -- -- -- S p e c -- -- -- -- $Revision$ -- -- -- Copyright (C) 1992,1993,1994,1995,1996 Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 2, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License -- -- for more details. You should have received a copy of the GNU General -- -- Public License distributed with GNAT; see file COPYING. If not, write -- -- to the Free Software Foundation, 59 Temple Place - Suite 330, Boston, -- -- MA 02111-1307, USA. -- -- -- -- As a special exception, if other files instantiate generics from this -- -- unit, or you link this unit with other files to produce an executable, -- -- this unit does not by itself cause the resulting executable to be -- -- covered by the GNU General Public License. This exception does not -- -- however invalidate any other reasons why the executable file might be -- -- covered by the GNU Public License. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This package contains an instantiation of the floating-point attribute -- runtime routines for the type Long_Float. with System.Fat_Gen; package System.Fat_LFlt is pragma Pure (Fat_LFlt); -- Note the only entity from this package that is accessed by Rtsfind -- is the name of the package instantiation. Entities within this package -- (i.e. the individual floating-point attribute routines) are accessed -- by name using selected notation. package Fat_Long_Float is new System.Fat_Gen (Long_Float); end System.Fat_LFlt;
61.5
78
0.458099
04bf964b4c8468602adcf43f4ccc056af2034e67
2,957
ads
Ada
support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-addima.ads
orb-zhuchen/Orb
6da2404b949ac28bde786e08bf4debe4a27cd3a0
[ "CNRI-Python-GPL-Compatible", "MIT" ]
null
null
null
support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-addima.ads
orb-zhuchen/Orb
6da2404b949ac28bde786e08bf4debe4a27cd3a0
[ "CNRI-Python-GPL-Compatible", "MIT" ]
null
null
null
support/MinGW/lib/gcc/mingw32/9.2.0/adainclude/s-addima.ads
orb-zhuchen/Orb
6da2404b949ac28bde786e08bf4debe4a27cd3a0
[ "CNRI-Python-GPL-Compatible", "MIT" ]
null
null
null
------------------------------------------------------------------------------ -- -- -- GNAT COMPILER COMPONENTS -- -- -- -- S Y S T E M . A D D R E S S _ I M A G E -- -- -- -- S p e c -- -- -- -- Copyright (C) 1992-2019, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ -- This is a GNAT specific addition which provides a useful debugging -- procedure that gives an (implementation dependent) string which -- identifies an address. -- This unit may be used directly from an application program by providing -- an appropriate WITH, and the interface can be expected to remain stable. function System.Address_Image (A : Address) return String; pragma Pure (System.Address_Image); -- Returns string (hexadecimal digits with upper case letters) representing -- the address (string is 8/16 bytes for 32/64-bit machines). 'First of the -- result = 1.
67.204545
78
0.445722
c7e0667cb9279d53acfbfac55c5f86a05b0d11bb
874
ads
Ada
tools/css-tools.ads
stcarrez/ada-css
f7c337306094993186c507540701d04a4753b724
[ "Apache-2.0" ]
3
2017-01-03T22:18:22.000Z
2017-01-10T07:58:17.000Z
tools/css-tools.ads
stcarrez/ada-css
f7c337306094993186c507540701d04a4753b724
[ "Apache-2.0" ]
null
null
null
tools/css-tools.ads
stcarrez/ada-css
f7c337306094993186c507540701d04a4753b724
[ "Apache-2.0" ]
null
null
null
----------------------------------------------------------------------- -- css-tools -- CSS tools -- Copyright (C) 2017 Stephane Carrez -- Written by Stephane Carrez ([email protected]) -- -- Licensed under the Apache License, Version 2.0 (the "License"); -- you may not use this file except in compliance with the License. -- You may obtain a copy of the License at -- -- http://www.apache.org/licenses/LICENSE-2.0 -- -- Unless required by applicable law or agreed to in writing, software -- distributed under the License is distributed on an "AS IS" BASIS, -- WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. -- See the License for the specific language governing permissions and -- limitations under the License. ----------------------------------------------------------------------- package CSS.Tools is end CSS.Tools;
39.727273
76
0.60984
c7115f6576889fe7c6951eb436d6e17910651c7a
6,865
adb
Ada
gcc-gcc-7_3_0-release/gcc/ada/a-tiflau.adb
best08618/asylo
5a520a9f5c461ede0f32acc284017b737a43898c
[ "Apache-2.0" ]
7
2020-05-02T17:34:05.000Z
2021-10-17T10:15:18.000Z
gcc-gcc-7_3_0-release/gcc/ada/a-tiflau.adb
best08618/asylo
5a520a9f5c461ede0f32acc284017b737a43898c
[ "Apache-2.0" ]
null
null
null
gcc-gcc-7_3_0-release/gcc/ada/a-tiflau.adb
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 . T E X T _ I O . F L O A T _ A U X -- -- -- -- B o d y -- -- -- -- Copyright (C) 1992-2014, Free Software Foundation, Inc. -- -- -- -- GNAT is free software; you can redistribute it and/or modify it under -- -- terms of the GNU General Public License as published by the Free Soft- -- -- ware Foundation; either version 3, or (at your option) any later ver- -- -- sion. GNAT is distributed in the hope that it will be useful, but WITH- -- -- OUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY -- -- or FITNESS FOR A PARTICULAR PURPOSE. -- -- -- -- As a special exception under Section 7 of GPL version 3, you are granted -- -- additional permissions described in the GCC Runtime Library Exception, -- -- version 3.1, as published by the Free Software Foundation. -- -- -- -- You should have received a copy of the GNU General Public License and -- -- a copy of the GCC Runtime Library Exception along with this program; -- -- see the files COPYING3 and COPYING.RUNTIME respectively. If not, see -- -- <http://www.gnu.org/licenses/>. -- -- -- -- GNAT was originally developed by the GNAT team at New York University. -- -- Extensive contributions were provided by Ada Core Technologies Inc. -- -- -- ------------------------------------------------------------------------------ with Ada.Text_IO.Generic_Aux; use Ada.Text_IO.Generic_Aux; with System.Img_Real; use System.Img_Real; with System.Val_Real; use System.Val_Real; package body Ada.Text_IO.Float_Aux is --------- -- Get -- --------- procedure Get (File : File_Type; Item : out Long_Long_Float; Width : Field) is Buf : String (1 .. Field'Last); Stop : Integer := 0; Ptr : aliased Integer := 1; begin if Width /= 0 then Load_Width (File, Width, Buf, Stop); String_Skip (Buf, Ptr); else Load_Real (File, Buf, Stop); end if; Item := Scan_Real (Buf, Ptr'Access, Stop); Check_End_Of_Field (Buf, Stop, Ptr, Width); end Get; ---------- -- Gets -- ---------- procedure Gets (From : String; Item : out Long_Long_Float; Last : out Positive) is Pos : aliased Integer; begin String_Skip (From, Pos); Item := Scan_Real (From, Pos'Access, From'Last); Last := Pos - 1; exception when Constraint_Error => raise Data_Error; end Gets; --------------- -- Load_Real -- --------------- procedure Load_Real (File : File_Type; Buf : out String; Ptr : in out Natural) is Loaded : Boolean; begin -- Skip initial blanks, and load possible sign Load_Skip (File); Load (File, Buf, Ptr, '+', '-'); -- Case of .nnnn Load (File, Buf, Ptr, '.', Loaded); if Loaded then Load_Digits (File, Buf, Ptr, Loaded); -- Hopeless junk if no digits loaded if not Loaded then return; end if; -- Otherwise must have digits to start else Load_Digits (File, Buf, Ptr, Loaded); -- Hopeless junk if no digits loaded if not Loaded then return; end if; -- Based cases. We recognize either the standard '#' or the -- allowed alternative replacement ':' (see RM J.2(3)). Load (File, Buf, Ptr, '#', ':', Loaded); if Loaded then -- Case of nnn#.xxx# Load (File, Buf, Ptr, '.', Loaded); if Loaded then Load_Extended_Digits (File, Buf, Ptr); Load (File, Buf, Ptr, '#', ':'); -- Case of nnn#xxx.[xxx]# or nnn#xxx# else Load_Extended_Digits (File, Buf, Ptr); Load (File, Buf, Ptr, '.', Loaded); if Loaded then Load_Extended_Digits (File, Buf, Ptr); end if; -- As usual, it seems strange to allow mixed base characters, -- but that is what ACVC tests expect, see CE3804M, case (3). Load (File, Buf, Ptr, '#', ':'); end if; -- Case of nnn.[nnn] or nnn else -- Prevent the potential processing of '.' in cases where the -- initial digits have a trailing underscore. if Buf (Ptr) = '_' then return; end if; Load (File, Buf, Ptr, '.', Loaded); if Loaded then Load_Digits (File, Buf, Ptr); end if; end if; end if; -- Deal with exponent Load (File, Buf, Ptr, 'E', 'e', Loaded); if Loaded then Load (File, Buf, Ptr, '+', '-'); Load_Digits (File, Buf, Ptr); end if; end Load_Real; --------- -- Put -- --------- procedure Put (File : File_Type; Item : Long_Long_Float; Fore : Field; Aft : Field; Exp : Field) is Buf : String (1 .. 3 * Field'Last + 2); Ptr : Natural := 0; begin Set_Image_Real (Item, Buf, Ptr, Fore, Aft, Exp); Put_Item (File, Buf (1 .. Ptr)); end Put; ---------- -- Puts -- ---------- procedure Puts (To : out String; Item : Long_Long_Float; Aft : Field; Exp : Field) is Buf : String (1 .. 3 * Field'Last + 2); Ptr : Natural := 0; begin Set_Image_Real (Item, Buf, Ptr, Fore => 1, Aft => Aft, Exp => Exp); if Ptr > To'Length then raise Layout_Error; else for J in 1 .. Ptr loop To (To'Last - Ptr + J) := Buf (J); end loop; for J in To'First .. To'Last - Ptr loop To (J) := ' '; end loop; end if; end Puts; end Ada.Text_IO.Float_Aux;
29.088983
78
0.446322
2e372ad89b49803fc3e77e6f8afb604935c8d793
1,959
ads
Ada
source/oasis/program-library_unit_declarations.ads
reznikmm/gela
20134f1d154fb763812e73860c6f4b04f353df79
[ "MIT" ]
null
null
null
source/oasis/program-library_unit_declarations.ads
reznikmm/gela
20134f1d154fb763812e73860c6f4b04f353df79
[ "MIT" ]
null
null
null
source/oasis/program-library_unit_declarations.ads
reznikmm/gela
20134f1d154fb763812e73860c6f4b04f353df79
[ "MIT" ]
1
2019-10-16T09:05:27.000Z
2019-10-16T09:05:27.000Z
-- SPDX-FileCopyrightText: 2019 Max Reznik <[email protected]> -- -- SPDX-License-Identifier: MIT ------------------------------------------------------------- with Program.Compilation_Unit_Vectors; with Program.Compilation_Units; with Program.Library_Items; with Program.Library_Unit_Bodies; package Program.Library_Unit_Declarations is pragma Pure; type Library_Unit_Declaration is limited interface and Program.Library_Items.Library_Item; -- library_unit_declaration is a compilation unit that is the declaration -- or renaming of a library unit. type Library_Unit_Declaration_Access is access all Library_Unit_Declaration'Class with Storage_Size => 0; not overriding function Corresponding_Body (Self : access Library_Unit_Declaration) return Program.Library_Unit_Bodies.Library_Unit_Body_Access is abstract; -- Returns the corresponding library_unit_body, if any, for the -- library_unit_declaration. The corresponding library_unit_body is the -- unit that depends semantically on the library_unit_declaration. -- -- Returns null for library_unit_declaration arguments that -- do not have a corresponding library_unit_body contained in the Context. not overriding function Corresponding_Childern (Self : access Library_Unit_Declaration) return Program.Compilation_Unit_Vectors.Compilation_Unit_Vector_Access is abstract; -- with Post'Class => -- (Corresponding_Childern'Result.Is_Empty -- or else (for all X in Corresponding_Childern'Result.Each_Unit -- => X.Unit.Is_Library_Item)); -- Returns a list of the child units for the given parent library unit. -- -- Both the declaration and body (if any) of each child unit are returned. -- Descendants beyond immediate children (i.e., children of children) are -- not returned by this query. end Program.Library_Unit_Declarations;
39.979592
78
0.72537
04cb73ba9c2d7509b56283d0bbb6d4d43ca1b40b
1,681
adb
Ada
src/Internals/protypo-code_trees-interpreter-consumer_handlers.adb
fintatarta/protypo
c0c2bca17bc766ab95acc99b7422485388a10cb4
[ "MIT" ]
null
null
null
src/Internals/protypo-code_trees-interpreter-consumer_handlers.adb
fintatarta/protypo
c0c2bca17bc766ab95acc99b7422485388a10cb4
[ "MIT" ]
4
2019-10-09T11:16:38.000Z
2019-10-09T11:20:38.000Z
src/Internals/protypo-code_trees-interpreter-consumer_handlers.adb
fintatarta/protypo
c0c2bca17bc766ab95acc99b7422485388a10cb4
[ "MIT" ]
null
null
null
pragma Ada_2012; -- with Readable_Sequences.String_Sequences; -- use Readable_Sequences.String_Sequences; -- with Protypo.Scanning; -- with Protypo.Parsing; -- with Protypo.Code_Trees.Interpreter.Expressions; pragma Warnings (Off, "no entities of ""Ada.Text_IO"" are referenced"); with Ada.Text_IO; use Ada.Text_IO; -- with Protypo.Api.Interpreters; package body Protypo.Code_Trees.Interpreter.Consumer_Handlers is function To_String (X : Engine_Value) return String is (case X.Class is when Int => Get_Integer (X)'Image, when Real => Get_Float (X)'Image, when Text => Get_String (X), when others => raise Constraint_Error); overriding function Process (Fun : Consumer_Callback; Parameter : Engine_Value_vectors.Vector) return Engine_Value_vectors.Vector is begin for P of Parameter loop declare To_Be_Consumed : constant String := (if Fun.With_Escape then Do_Escape (Fun.Status, To_String (P)) else To_String (P)); begin Fun.Consumer.Process (To_Be_Consumed & To_String (Fun.End_Of_Line)); end; end loop; return Engine_Value_Vectors.Empty_Vector; end Process; function Signature (Fun : Consumer_Callback) return Api.Engine_Values.Parameter_Lists.Parameter_Signature is (1 => Parameter_Lists.Mandatory); end Protypo.Code_Trees.Interpreter.Consumer_Handlers;
33.62
92
0.598453
1adb542100afe60b78d66668f2c00def455870fc
1,642
adb
Ada
source/slim-messages-cont.adb
reznikmm/slimp
acbbb895ba9c2a2dfb28e5065e630326ce958502
[ "MIT" ]
null
null
null
source/slim-messages-cont.adb
reznikmm/slimp
acbbb895ba9c2a2dfb28e5065e630326ce958502
[ "MIT" ]
null
null
null
source/slim-messages-cont.adb
reznikmm/slimp
acbbb895ba9c2a2dfb28e5065e630326ce958502
[ "MIT" ]
null
null
null
-- Copyright (c) 2019 Maxim Reznik <[email protected]> -- -- SPDX-License-Identifier: MIT -- License-Filename: LICENSE ------------------------------------------------------------- with Slim.Message_Visiters; package body Slim.Messages.cont is List : constant Field_Description_Array := ((Uint_32_Field, 1), -- Metaint (Uint_8_Field, 1), -- Loop (Uint_16_Field, 1)); -- Guids count ---------- -- Read -- ---------- overriding function Read (Data : not null access League.Stream_Element_Vectors .Stream_Element_Vector) return Cont_Message is begin return Result : Cont_Message do Read_Fields (Result, List, Data.all); end return; end Read; ----------------- -- Set_Metaint -- ----------------- not overriding procedure Set_Metaint (Self : in out Cont_Message; Value : Natural) is begin Self.Data_32 := (1 => Interfaces.Unsigned_32 (Value)); Self.Data_16 := (1 => 0); -- No guids Self.Data_8 := (1 => 0); -- No loop end Set_Metaint; ----------- -- Visit -- ----------- overriding procedure Visit (Self : not null access Cont_Message; Visiter : in out Slim.Message_Visiters.Visiter'Class) is begin Visiter.cont (Self); end Visit; ----------- -- Write -- ----------- overriding procedure Write (Self : Cont_Message; Tag : out Message_Tag; Data : out League.Stream_Element_Vectors.Stream_Element_Vector) is begin Tag := "cont"; Write_Fields (Self, List, Data); end Write; end Slim.Messages.cont;
23.797101
69
0.556029